Home
last modified time | relevance | path

Searched refs:Node (Results 1 – 18 of 18) sorted by relevance

/system/core/libmemunreachable/
DTarjan.h30 class Node {
32 allocator::set<Node<T>*> references_in;
33 allocator::set<Node<T>*> references_out;
39 Node(T* ptr, Allocator<Node> allocator) in Node() function
41 Node(Node&& rhs) noexcept = default;
42 void Edge(Node<T>* ref) { in Edge()
54 DISALLOW_COPY_AND_ASSIGN(Node<T>);
58 using Graph = allocator::vector<Node<T>*>;
61 using SCC = allocator::vector<Node<T>*>;
76 void Tarjan(Node<T>* vertex, Graph<T>& graph);
[all …]
DLeakFolding.h50 Node<SCCInfo> node;
77 Node<LeakInfo> node;
/system/extras/libperfmgr/
DNode.cc29 Node::Node(std::string name, std::string node_path, in Node() function in android::perfmgr::Node
42 bool Node::AddRequest(std::size_t value_index, const std::string& hint_type, in AddRequest()
54 bool Node::RemoveRequest(const std::string& hint_type) { in RemoveRequest()
63 const std::string& Node::GetName() const { in GetName()
67 const std::string& Node::GetPath() const { in GetPath()
71 bool Node::GetValueIndex(const std::string& value, std::size_t* index) const { in GetValueIndex()
83 std::size_t Node::GetDefaultIndex() const { in GetDefaultIndex()
87 bool Node::GetResetOnInit() const { in GetResetOnInit()
91 std::vector<std::string> Node::GetValues() const { in GetValues()
DHintManager.cc114 std::vector<std::unique_ptr<Node>> nodes = ParseNodes(json_doc); in GetFromJSON()
135 std::vector<std::unique_ptr<Node>> HintManager::ParseNodes( in ParseNodes()
138 std::vector<std::unique_ptr<Node>> nodes_parsed; in ParseNodes()
282 const std::vector<std::unique_ptr<Node>>& nodes) { in ParseActions()
DPropertyNode.cc33 : Node(std::move(name), std::move(node_path), std::move(req_sorted), in PropertyNode()
DFileNode.cc33 : Node(std::move(name), std::move(node_path), std::move(req_sorted), in FileNode()
DAndroid.bp49 "Node.cc",
/system/extras/libperfmgr/include/perfmgr/
DNode.h47 class Node {
49 virtual ~Node() {} in ~Node()
73 Node(std::string name, std::string node_path,
76 Node(const Node& other) = delete;
77 Node& operator=(Node const&) = delete;
DPropertyNode.h30 class PropertyNode : public Node {
41 PropertyNode(const Node& other) = delete;
42 PropertyNode& operator=(Node const&) = delete;
DFileNode.h32 class FileNode : public Node {
45 FileNode(const Node& other) = delete;
46 FileNode& operator=(Node const&) = delete;
DNodeLooperThread.h56 explicit NodeLooperThread(std::vector<std::unique_ptr<Node>> nodes) in NodeLooperThread()
87 std::vector<std::unique_ptr<Node>> nodes_; // parsed from Config
DHintManager.h74 static std::vector<std::unique_ptr<Node>> ParseNodes(
78 const std::vector<std::unique_ptr<Node>>& nodes);
/system/extras/libperfmgr/tests/
DHintManagerTest.cc185 std::vector<std::unique_ptr<Node>> nodes_;
273 std::vector<std::unique_ptr<Node>> nodes = in TEST_F()
307 std::vector<std::unique_ptr<Node>> nodes = in TEST_F()
316 std::vector<std::unique_ptr<Node>> nodes = in TEST_F()
326 std::vector<std::unique_ptr<Node>> nodes = in TEST_F()
336 std::vector<std::unique_ptr<Node>> nodes = in TEST_F()
346 std::vector<std::unique_ptr<Node>> nodes = in TEST_F()
356 std::vector<std::unique_ptr<Node>> nodes = in TEST_F()
366 std::vector<std::unique_ptr<Node>> nodes = in TEST_F()
397 std::vector<std::unique_ptr<Node>> nodes = in TEST_F()
[all …]
DNodeLooperThreadTest.cc53 std::vector<std::unique_ptr<Node>> nodes_;
/system/media/camera/docs/
Dmetadata_model.py42 class Node(object): class
191 class Metadata(Node):
598 class Tag(Node):
633 class Typedef(Node):
663 class OuterNamespace(Node):
684 class Section(Node):
788 class Kind(Node):
888 class InnerNamespace(Node):
976 class EnumValue(Node):
1060 class Enum(Node):
[all …]
/system/extras/libperfmgr/tools/
DConfigVerifier.cc41 std::vector<std::unique_ptr<Node>> nodes = ParseNodes(json_doc); in VerifyNodes()
/system/update_engine/scripts/update_payload/
Dchecker.py123 class Node(object): class in _PayloadReport
153 class FieldNode(Node):
186 class SubReportNode(Node):
201 class SectionNode(Node):
/system/tools/hidl/test/hidl_test/
Dhidl_test_client.cpp2585 IGraph::Node node; node.data = 10; in TEST_F()