Home
last modified time | relevance | path

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

12

/frameworks/base/core/tests/benchmarks/src/com/android/internal/util/
DIndentingPrintWriterBenchmark.java33 private Node mSimple;
34 private Node mComplex;
42 final Node manyChildren = Node.build("ManyChildren", Node.build("1"), Node.build("2"), in setUp()
43 Node.build("3"), Node.build("4"), Node.build("5"), Node.build("6"), Node.build("7"), in setUp()
44 Node.build("8"), Node.build("9"), Node.build("10")); in setUp()
46 mSimple = Node.build("RED"); in setUp()
47 mComplex = Node.build("PARENT", Node.build("RED"), Node.build("GREEN", in setUp()
48 Node.build("BLUE", manyChildren, manyChildren), manyChildren, manyChildren), in setUp()
99 private static class Node { class in IndentingPrintWriterBenchmark
101 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/core/java/android/animation/
DAnimatorSet.java77 private ArrayMap<Animator, Node> mNodeMap = new ArrayMap<Animator, Node>();
84 private ArrayList<Node> mNodes = new ArrayList<Node>();
123 private Node mRootNode = new Node(mDelayAnim);
248 Node node = mNodes.get(i); in getChildAnimations()
267 Node node = mNodes.get(i); in setTarget()
415 Node node = mNodeMap.get(anim); in endRemainingAnimations()
419 Node child = node.mChildNodes.get(i); in endRemainingAnimations()
442 Node node = mNodes.get(i); in isRunning()
492 Node node = mNodes.get(i); in setStartDelay()
545 Node node = mNodes.get(i); in setupStartValues()
[all …]
/frameworks/opt/datetimepicker/src/com/android/datetimepicker/time/
DTimePickerDialog.java103 private Node mLegalTimesTree;
605 Node node = mLegalTimesTree;
823 mLegalTimesTree = new Node();
826 Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5);
827 Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
832 Node firstDigit = new Node(k0, k1);
836 Node secondDigit = new Node(k0, k1, k2, k3, k4, k5);
842 Node thirdDigit = new Node(k6, k7, k8, k9);
847 secondDigit = new Node(k6, k7, k8, k9);
853 firstDigit = new Node(k2);
[all …]
/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()
63 const Node* node = &head_; in Message()
/frameworks/base/tools/aapt2/xml/
DXmlDom.h40 struct Node { struct
41 Node* parent = nullptr; argument
45 std::vector<std::unique_ptr<Node>> children; argument
47 virtual ~Node() = default;
49 void addChild(std::unique_ptr<Node> child);
58 struct BaseNode : public Node {
116 std::unique_ptr<xml::Node> root;
133 Element* findRootElement(Node* node);
165 void visitChildren(Node* node) { in visitChildren()
211 T* nodeCast(Node* node) { in nodeCast()
DXmlDom.cpp34 std::unique_ptr<xml::Node> root;
35 std::stack<xml::Node*> nodeStack;
57 static void addToStack(Stack* stack, XML_Parser parser, std::unique_ptr<Node> node) { in addToStack()
61 Node* thisNode = node.get(); in addToStack()
143 Node* currentParent = stack->nodeStack.top(); in characterDataHandler()
145 Node* lastChild = currentParent->children.back().get(); in characterDataHandler()
235 std::unique_ptr<Node> root; in inflate()
236 std::stack<Node*> nodeStack; in inflate()
246 std::unique_ptr<Node> newNode; in inflate()
308 Node* thisNode = newNode.get(); in inflate()
[all …]
/frameworks/rs/
DrsScriptGroup.cpp54 ScriptGroup::Node::Node(Script *s) { in Node() function in 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()
98 static int CompareNodeForSort(ScriptGroup::Node *const* lhs, in CompareNodeForSort()
99 ScriptGroup::Node *const* rhs) { in CompareNodeForSort()
108 bool operator() (const ScriptGroup::Node* lhs, in operator ()()
109 const ScriptGroup::Node* rhs) { in operator ()()
124 Node *n = findNode(k->mScript); in calcOrder()
[all …]
DrsScriptGroup.h57 class Node {
59 Node(Script *);
78 Vector<Node *> mNodes;
98 bool calcOrderRecurse(Node *n, int depth);
100 Node * findNode(Script *s) const;
/frameworks/support/v8/renderscript/java/src/android/support/v8/renderscript/
DScriptGroup.java51 private ArrayList<Node> mNodes = new ArrayList<Node>();
82 static class Node { class in ScriptGroup
91 Node mNext;
93 Node(Script s) { in Node() method in ScriptGroup.Node
536 Node n = mNodes.get(ct); in execute()
556 for (Node node : mNodes) { in execute()
620 private ArrayList<Node> mNodes = new ArrayList<Node>();
637 private void validateCycle(Node target, Node original) { in validateCycle()
641 Node tn = findNode(cl.mToK.mScript); in validateCycle()
648 Node tn = findNode(cl.mToF.mScript); in validateCycle()
[all …]
/frameworks/native/vulkan/api/templates/
Dvulkan_common.tmpl13 {{define "Type.StaticArray"}}{{Node "Type" $.Type.ValueType}}{{end}}
14 {{define "Type.Pointer" }}{{if $.Type.Const}}{{Node "ConstType" $.Type.To}}{{else}}{{Node "Type"…
15 {{define "Type.Slice" }}{{Log "%T %+v" $.Node $.Node}}{{Node "Type" $.Type.To}}*{{end}}
32 {{define "ConstType_Default"}}const {{Node "Type" $.Type}}{{end}}
33 {{define "ConstType.Pointer"}}{{Node "Type" $.Type}} const{{end}}
127 {{define "ArrayPostfix"}}{{Node "ArrayPostfix" $}}{{end}}
161 {{define "ParameterType"}}{{AssertType $ "Parameter"}}{{Node "Type" $}}{{end}}
220 {{Node "Vtbl" (index $.CallParameters 0)}}
Dvk_xml.tmpl320 …<member>{{Node "XML.Type" $f}} <name>{{$f.Name}}</name>{{Macro "XML.ArrayPostfix" $f}}</mem…
348 <proto>{{Node "XML.Type" $.Return}} <name>{{$.Name}}</name></proto>
350 <param>{{Node "XML.Type" $p}} <name>{{$p.Name}}{{Macro "ArrayPostfix" $p}}</name></param>
373 {{define "XML.Type.StaticArray"}}{{Node "XML.Type" $.Type.ValueType}}{{end}}
374 …{define "XML.Type.Pointer" }}{{if $.Type.Const}}{{Node "XML.ConstType" $.Type.To}}{{else}}{{Nod…
375 {{define "XML.Type.Slice" }}<type>{{Node "XML.Type" $.Type.To}}</type>*{{end}}
389 {{define "XML.ConstType_Default"}}const {{Node "XML.Type" $.Type}}{{end}}
390 {{define "XML.ConstType.Pointer"}}{{Node "XML.Type" $.Type}} const{{end}}
423 {{define "XML.ArrayPostfix"}}{{Node "XML.ArrayPostfix" $}}{{end}}
424 {{define "XML.ArrayPostfix.StaticArray"}}[{{Node "XML.NamedValue" $.Type.SizeExpr}}]{{end}}
[all …]
/frameworks/data-binding/compiler/src/main/java/android/databinding/tool/reflection/
DSdkUtil.java19 import org.w3c.dom.Node;
108 Node node = allClasses.item(j); in buildFullLookup()
109 if (node.getNodeType() != Node.ELEMENT_NODE || !"class" in buildFullLookup()
119 Node child = childNodes.item(i); in buildFullLookup()
120 if (child.getNodeType() != Node.ELEMENT_NODE || !"method" in buildFullLookup()
153 private static int getSince(Node node) { in getSince()
154 final Node since = node.getAttributes().getNamedItem("since"); in getSince()
/frameworks/base/tools/layoutlib/bridge/src/android/text/
DOptimizingLineBreaker.java56 Node[] opt = new Node[numBreaks]; in computeBreaks()
57 opt[0] = new Node(-1, 0, 0, 0, false); in computeBreaks()
58 opt[numBreaks - 1] = new Node(-1, 0, 0, 0, false); in computeBreaks()
67 Node bestBreak = null; in computeBreaks()
85 bestBreak = new Node(pos, opt[pos].mPrevCount + 1, demerits, in computeBreaks()
113 opt[breakIndex] = new Node(lastBreak, lines + 1, 0 /*doesn't matter*/, in computeBreaks()
244 private static class Node { class in OptimizingLineBreaker
253 public Node(int prev, int prevCount, float demerits, float width, boolean hasTabs) { in Node() method in OptimizingLineBreaker.Node
/frameworks/base/rs/java/android/renderscript/
DScriptGroup.java74 static class Node { class in ScriptGroup
81 Node mNext;
83 Node(Script s) { in Node() method in ScriptGroup.Node
556 private ArrayList<Node> mNodes = new ArrayList<Node>();
572 private void validateCycle(Node target, Node original) { in validateCycle()
576 Node tn = findNode(cl.mToK.mScript); in validateCycle()
583 Node tn = findNode(cl.mToF.mScript); in validateCycle()
599 private void validateDAGRecurse(Node n, int dagNumber) { in validateDAGRecurse()
610 Node tn = findNode(cl.mToK.mScript); in validateDAGRecurse()
614 Node tn = findNode(cl.mToF.mScript); in validateDAGRecurse()
[all …]
/frameworks/base/libs/hwui/
DVectorDrawable.h89 class ANDROID_API Node {
93 Properties(Node* node) : mNode(node) {} in Properties()
98 Node* mNode;
100 Node(const Node& node) { in Node() function
103 Node() {} in Node() function
114 virtual ~Node(){} in ~Node()
121 class ANDROID_API Path : public Node {
135 PathProperties(Node* node) : Properties(node) {} in PathProperties()
221 FullPathProperties(Node* mNode) : Properties(mNode), mTrimDirty(false) {} in FullPathProperties()
408 class ANDROID_API Group: public Node {
[all …]
/frameworks/base/core/java/android/widget/
DRelativeLayout.java1008 DependencyGraph.Node node = mGraph.mKeyNodes.get(id); in getRelatedView()
1692 private ArrayList<Node> mNodes = new ArrayList<Node>();
1698 private SparseArray<Node> mKeyNodes = new SparseArray<Node>();
1704 private ArrayDeque<Node> mRoots = new ArrayDeque<Node>();
1710 final ArrayList<Node> nodes = mNodes; in clear()
1729 final Node node = Node.acquire(view); in add()
1749 final ArrayDeque<Node> roots = findRoots(rules); in getSortedViews()
1752 Node node; in getSortedViews()
1759 final ArrayMap<Node, DependencyGraph> dependents = node.dependents; in getSortedViews()
1762 final Node dependent = dependents.keyAt(i); in getSortedViews()
[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;
DTreeBase.h99 class Node : public NodeBase {
107 Node() : NodeBase(), data(NULL) {} in Node() function
109 explicit Node(const value_type& pValue) : NodeBase(), data(&pValue) {} in Node() function
/frameworks/compile/libbcc/bcinfo/
DMetadataExtractor.cpp500 llvm::MDNode *Node = ReduceMetadata->getOperand(i); in populateReduceMetadata() local
501 if (!Node || Node->getNumOperands() < 3) { in populateReduceMetadata()
506 TmpReduceList[i].mReduceName = createStringFromValue(Node->getOperand(0)); in populateReduceMetadata()
509 Node->getOperand(1))) { in populateReduceMetadata()
514 llvm::MDNode *AccumulatorNode = llvm::dyn_cast<llvm::MDNode>(Node->getOperand(2)); in populateReduceMetadata()
539 TmpReduceList[i].mInitializerName = createStringFromOptionalValue(Node, 3); in populateReduceMetadata()
540 TmpReduceList[i].mCombinerName = createStringFromOptionalValue(Node, 4); in populateReduceMetadata()
541 TmpReduceList[i].mOutConverterName = createStringFromOptionalValue(Node, 5); in populateReduceMetadata()
542 TmpReduceList[i].mHalterName = createStringFromOptionalValue(Node, 6); in populateReduceMetadata()
/frameworks/data-binding/compiler/src/main/java/android/databinding/tool/expr/
DExpr.java573 private Node mCalculationPaths = null;
578 protected Node getAllCalculationPaths() { in getAllCalculationPaths()
580 Node node = new Node(); in getAllCalculationPaths()
589 Node cond = new Node(); in getAllCalculationPaths()
736 static class Node { class in Expr
739 List<Node> mParents = new ArrayList<Node>();
760 for (Node parent : mParents) { in areAllPathsSatisfied()
/frameworks/base/tools/layoutlib/bridge/tests/src/com/android/layoutlib/bridge/android/
DBridgeXmlBlockParserTest.java25 import org.w3c.dom.Node;
85 private void dump(Node node, String prefix) { in dump()
86 Node n; in dump()

12