Home
last modified time | relevance | path

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

123

/frameworks/base/core/tests/benchmarks/src/com/android/internal/util/
DIndentingPrintWriterBenchmark.java36 private Node mSimple;
37 private Node mComplex;
45 final Node manyChildren = Node.build("ManyChildren", Node.build("1"), Node.build("2"), in setUp()
46 Node.build("3"), Node.build("4"), Node.build("5"), Node.build("6"), Node.build("7"), in setUp()
47 Node.build("8"), Node.build("9"), Node.build("10")); in setUp()
49 mSimple = Node.build("RED"); in setUp()
50 mComplex = Node.build("PARENT", Node.build("RED"), Node.build("GREEN", in setUp()
51 Node.build("BLUE", manyChildren, manyChildren), manyChildren, manyChildren), in setUp()
102 private static class Node { class in IndentingPrintWriterBenchmark
104 public ArrayList<Node> children;
[all …]
/frameworks/compile/mclinker/unittests/
DGCFactoryListTraitsTest.h35 class Node : public llvm::ilist_node<Node> {
43 Node() : m_Init(0), m_Value(0) {} in Node() function
45 Node(unsigned pInit) : m_Init(pInit), m_Value(pInit) {} in Node() function
54 class NodeFactory : public mcld::GCFactory<Node, 0> {
56 NodeFactory() : mcld::GCFactory<Node, 0>(16) {} in NodeFactory()
58 Node* produce(unsigned pInit) { in produce()
59 Node* result = allocate(); in produce()
60 new (result) Node(pInit); in produce()
77 const llvm::iplist<Node, mcld::GCFactoryListTraits<Node> >& getNodeList() in getNodeList()
82 llvm::iplist<Node, mcld::GCFactoryListTraits<Node> >& getNodeList() { in getNodeList()
[all …]
DGraphTest.cpp39 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
40 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
41 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
58 ListDigraph::Node* head = NULL; in TEST_F()
86 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
87 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
88 ListDigraph::Node* u3 = graph.addNode(); in TEST_F()
105 ListDigraph::Node* head = NULL; in TEST_F()
133 ListDigraph::Node* u1 = graph.addNode(); in TEST_F()
134 ListDigraph::Node* u2 = graph.addNode(); in TEST_F()
[all …]
DGCFactoryListTraitsTest.cpp17 m_pNodesAlloc = new Node* [10]; in GCFactoryListTraitsTest()
64 llvm::iplist<Node>::const_iterator it = m_pNodeList.begin(); \
93 Node* NewNode = m_NodeFactory.produce(11); in TEST_F()
102 for (llvm::iplist<Node>::const_iterator I = m_pNodeList.begin(), in TEST_F()
/frameworks/base/tools/aapt2/
DDominatorTree.h53 class Node {
55 explicit Node(ResourceConfigValue* value = nullptr, Node* parent = nullptr)
60 inline Node* parent() const { return parent_; } in parent()
64 inline const std::vector<std::unique_ptr<Node>>& children() const { in children()
68 bool TryAddChild(std::unique_ptr<Node> new_child);
71 bool AddChild(std::unique_ptr<Node> new_child);
72 bool Dominates(const Node* other) const;
75 Node* parent_;
76 std::vector<std::unique_ptr<Node>> children_;
78 DISALLOW_COPY_AND_ASSIGN(Node);
[all …]
DDominatorTree.cpp32 util::make_unique<Node>(config.get(), nullptr)); in DominatorTree()
42 bool DominatorTree::Node::TryAddChild(std::unique_ptr<Node> new_child) { in TryAddChild()
51 bool DominatorTree::Node::AddChild(std::unique_ptr<Node> new_child) { in AddChild()
66 [](const std::unique_ptr<Node>& child) -> bool { in AddChild()
84 bool DominatorTree::Node::Dominates(const Node* other) const { in Dominates()
/frameworks/base/cmds/idmap2/libidmap2/
DXmlParser.cpp34 XmlParser::Node::Node(const ResXMLTree& tree) : Node(tree, get_tree_position(tree)) { in Node() function in android::idmap2::XmlParser::Node
36 XmlParser::Node::Node(const ResXMLTree& tree, const ResXMLParser::ResXMLPosition& pos) in Node() function in android::idmap2::XmlParser::Node
41 bool XmlParser::Node::operator==(const XmlParser::Node& rhs) const { in operator ==()
48 bool XmlParser::Node::operator!=(const XmlParser::Node& rhs) const { in operator !=()
52 ResXMLParser::ResXMLPosition XmlParser::Node::get_position() const { in get_position()
56 void XmlParser::Node::set_position(const ResXMLParser::ResXMLPosition& pos) { in set_position()
60 bool XmlParser::Node::Seek(bool inner_child) { in Seek()
83 XmlParser::Event XmlParser::Node::event() const { in event()
87 std::string XmlParser::Node::name() const { in name()
127 Result<Res_value> XmlParser::Node::GetAttributeValue(ResourceId attr, in GetAttributeValue()
[all …]
/frameworks/base/cmds/idmap2/include/idmap2/
DXmlParser.h37 class Node {
48 bool operator==(const Node& rhs) const;
49 bool operator!=(const Node& rhs) const;
52 explicit Node(const ResXMLTree& tree);
53 Node(const ResXMLTree& tree, const ResXMLParser::ResXMLPosition& pos);
108 inline const Node operator*() {
109 return Node(tree_, iter_.get_position());
112 inline const Node* operator->() {
117 explicit iterator(const ResXMLTree& tree) : tree_(tree), iter_(Node(tree)) { in iterator()
119 iterator(const ResXMLTree& tree, const Node& node) in iterator()
[all …]
/frameworks/base/core/java/android/animation/
DAnimatorSet.java74 private ArrayList<Node> mPlayingSet = new ArrayList<Node>();
82 private ArrayMap<Animator, Node> mNodeMap = new ArrayMap<Animator, Node>();
94 private ArrayList<Node> mNodes = new ArrayList<Node>();
118 private Node mRootNode = new Node(mDelayAnim);
306 Node node = mNodes.get(i);
325 Node node = mNodes.get(i);
423 ArrayList<Node> playingSet = new ArrayList<>(mPlayingSet);
573 Node node = mNodes.get(i);
626 Node node = mNodes.get(i);
637 Node node = mNodes.get(i);
[all …]
/frameworks/base/tools/incident_report/
Dgeneric_message.cpp30 Node node; in addInt32()
33 mNodes.insert(pair<int32_t,Node>(fieldId, node)); in addInt32()
39 Node node; in addInt64()
42 mNodes.insert(pair<int32_t,Node>(fieldId, node)); in addInt64()
49 Node node; in addMessage()
52 mNodes.insert(pair<int32_t,Node>(fieldId, node)); in addMessage()
59 Node node; in addString()
62 mNodes.insert(pair<int32_t,Node>(fieldId, node)); in addString()
Dgeneric_message.h45 struct Node { struct
61 typedef multimap<int32_t,Node>::const_iterator const_iterator; argument
67 multimap<int,Node> mNodes;
/frameworks/native/vulkan/libvulkan/
Ddebug_report.h36 struct Node;
45 Node* AddCallback(const VkDebugReportCallbackCreateInfoEXT& info,
48 void RemoveCallback(Node* node, const VkAllocationCallbacks& allocator);
58 static Node* FromHandle(VkDebugReportCallbackEXT handle) { in FromHandle()
59 return reinterpret_cast<Node*>(uintptr_t(handle)); in FromHandle()
62 static VkDebugReportCallbackEXT GetHandle(const Node* node) { in GetHandle()
66 static VkDebugReportCallbackEXT GetDriverHandle(const Node* node) { in GetDriverHandle()
71 struct Node { struct
72 Node* next; argument
83 Node head_; argument
Ddebug_report.cpp22 DebugReportCallbackList::Node* DebugReportCallbackList::AddCallback( in AddCallback()
26 void* mem = allocator.pfnAllocation(allocator.pUserData, sizeof(Node), in AddCallback()
27 alignof(Node), in AddCallback()
34 head_.next = new (mem) Node{head_.next, info.flags, info.pfnCallback, in AddCallback()
41 Node* node, in RemoveCallback()
46 Node* prev = &head_; in RemoveCallback()
64 const Node* node = &head_; in Message()
/frameworks/base/tools/aapt2/xml/
DXmlDom.h41 class Node {
43 virtual ~Node() = default;
56 virtual std::unique_ptr<Node> Clone(const ElementCloneFunc& el_cloner) const = 0;
87 class Element : public Node {
95 std::vector<std::unique_ptr<Node>> children;
97 void AppendChild(std::unique_ptr<Node> child);
98 void InsertChild(size_t index, std::unique_ptr<Node> child);
128 std::unique_ptr<Node> Clone(const ElementCloneFunc& el_cloner) const override;
135 class Text : public Node {
139 std::unique_ptr<Node> Clone(const ElementCloneFunc& el_cloner) const override;
[all …]
/frameworks/base/cmds/incident_helper/testdata/
Dpagetypeinfo.txt5 Node 0, zone DMA, type Unmovable 426 279 226 1 1 1 0 0…
6 Node 0, zone Normal, type Reclaimable 953 773 437 154 92 26 15 14…
9 Node 0, zone DMA 74 9 337 41 1 0
10 Node 0, zone Normal 70 12 423 0 1 0
/frameworks/rs/support/java/src/androidx/renderscript/
DScriptGroup.java56 private ArrayList<Node> mNodes = new ArrayList<Node>();
87 static class Node { class in ScriptGroup
96 Node mNext;
98 Node(Script s) { in Node() method in ScriptGroup.Node
541 Node n = mNodes.get(ct); in execute()
561 for (Node node : mNodes) { in execute()
625 private ArrayList<Node> mNodes = new ArrayList<Node>();
642 private void validateCycle(Node target, Node original) { in validateCycle()
646 Node tn = findNode(cl.mToK.mScript); in validateCycle()
653 Node tn = findNode(cl.mToF.mScript); in validateCycle()
[all …]
/frameworks/rs/
DrsScriptGroup.cpp54 ScriptGroup::Node::Node(Script *s) { in Node() function in android::renderscript::ScriptGroup::Node
60 ScriptGroup::Node * ScriptGroup::findNode(Script *s) const { in findNode()
63 Node *n = mNodes[ct]; in findNode()
74 bool ScriptGroup::calcOrderRecurse(Node *n, int depth) { in calcOrderRecurse()
83 Node *nt = NULL; in calcOrderRecurse()
99 bool operator() (const ScriptGroup::Node* lhs, in operator ()()
100 const ScriptGroup::Node* rhs) { in operator ()()
111 Node *n = findNode(k->mScript); in calcOrder()
114 n = new Node(k->mScript); in calcOrder()
125 Node *n = findNode(l->mSource->mScript); in calcOrder()
[all …]
DrsScriptGroup.h57 class Node {
59 explicit Node(Script *);
78 std::vector<Node *> mNodes;
98 bool calcOrderRecurse(Node *n, int depth);
100 Node * findNode(Script *s) const;
/frameworks/base/tools/codegen/src/com/android/codegen/
DDebug.kt19 import com.github.javaparser.ast.Node in <lambda>()
21 fun Node.dump(indent: String = ""): String { in <lambda>() method
31 private fun Node.dumpOneLineNoChildren(): String { in dumpOneLineNoChildren() method
/frameworks/layoutlib/bridge/src/android/graphics/text/
DOptimizingLineBreaker.java59 Node[] opt = new Node[numBreaks]; in computeBreaks()
60 opt[0] = new Node(-1, 0, 0, 0, false); in computeBreaks()
61 opt[numBreaks - 1] = new Node(-1, 0, 0, 0, false); in computeBreaks()
70 Node bestBreak = null; in computeBreaks()
88 bestBreak = new Node(pos, opt[pos].mPrevCount + 1, demerits, in computeBreaks()
116 opt[breakIndex] = new Node(lastBreak, lines + 1, 0 /*doesn't matter*/, in computeBreaks()
233 private static class Node { class in OptimizingLineBreaker
242 public Node(int prev, int prevCount, float demerits, float width, boolean hasTabs) { in Node() method in OptimizingLineBreaker.Node
/frameworks/base/tools/aapt2/optimize/
DResourceDeduper.cpp44 using Node = DominatorTree::Node; typedef in aapt::__anon12cee7890111::DominatedKeyValueRemover
49 void VisitConfig(Node* node) { in VisitConfig()
50 Node* parent = node->parent(); in VisitConfig()
/frameworks/base/rs/java/android/renderscript/
DScriptGroup.java79 static class Node { class in ScriptGroup
86 Node mNext;
88 Node(Script s) { in Node() method in ScriptGroup.Node
561 private ArrayList<Node> mNodes = new ArrayList<Node>();
577 private void validateCycle(Node target, Node original) { in validateCycle()
581 Node tn = findNode(cl.mToK.mScript); in validateCycle()
588 Node tn = findNode(cl.mToF.mScript); in validateCycle()
604 private void validateDAGRecurse(Node n, int dagNumber) { in validateDAGRecurse()
615 Node tn = findNode(cl.mToK.mScript); in validateDAGRecurse()
619 Node tn = findNode(cl.mToF.mScript); in validateDAGRecurse()
[all …]
/frameworks/base/libs/hwui/
DVectorDrawable.h100 class Node {
104 explicit Properties(Node* node) : mNode(node) {} in Properties()
108 Node* mNode;
110 Node(const Node& node) { mName = node.mName; } in Node() function
111 Node() {} in Node() function
119 virtual ~Node() {} in ~Node()
130 class Path : public Node {
143 explicit PathProperties(Node* node) : Properties(node) {} in PathProperties()
221 explicit FullPathProperties(Node* mNode) : Properties(mNode), mTrimDirty(false) {} in FullPathProperties()
381 class Group : public Node {
[all …]
/frameworks/compile/mclinker/include/mcld/ADT/
DTreeAllocator.h32 class NodeFactory : public GCFactory<Node<DataType>, 64> {
34 typedef GCFactory<Node<DataType>, 64> Alloc;
37 typedef Node<DataType> NodeType;
/frameworks/base/core/java/android/widget/
DRelativeLayout.java1031 DependencyGraph.Node node = mGraph.mKeyNodes.get(id); in getRelatedView()
1875 private ArrayList<Node> mNodes = new ArrayList<Node>();
1881 private SparseArray<Node> mKeyNodes = new SparseArray<Node>();
1887 private ArrayDeque<Node> mRoots = new ArrayDeque<Node>();
1893 final ArrayList<Node> nodes = mNodes; in clear()
1912 final Node node = Node.acquire(view); in add()
1932 final ArrayDeque<Node> roots = findRoots(rules); in getSortedViews()
1935 Node node; in getSortedViews()
1942 final ArrayMap<Node, DependencyGraph> dependents = node.dependents; in getSortedViews()
1945 final Node dependent = dependents.keyAt(i); in getSortedViews()
[all …]

123