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

/frameworks/compile/mclinker/include/mcld/ADT/GraphLite/
H A DListDigraph.h35 struct Node;
38 struct Node { struct in class:mcld::graph::ListDigraph
40 Node();
43 Node *prev, *next;
52 Node *target, *source;
60 Node* addNode();
62 Arc* addArc(Node& pU, Node& pV);
64 void erase(Node& pNode);
70 void getHead(Node*
[all...]
H A DDigraph.h26 class Node class in class:mcld::graph::Digraph
30 Node() {} function in class:mcld::graph::Digraph::Node
32 bool operator==(const Node& pOther) const { return m_ID == pOther.m_ID; }
33 bool operator!=(const Node& pOther) const { return m_ID != pOther.m_ID; }
45 bool operator==(const Node& pOther) const;
46 bool operator!=(const Node& pOther) const;
48 Node source() const;
49 Node target() const;
62 Node addNode();
64 Arc addArc(const Node
[all...]
/frameworks/compile/mclinker/lib/ADT/GraphLite/
H A DDigraph.cpp20 bool Digraph::Arc::operator==(const Digraph::Node& pOther) const
25 bool Digraph::Arc::operator!=(const Digraph::Node& pOther) const
30 Digraph::Node Digraph::Arc::source() const
32 return Node();
35 Digraph::Node Digraph::Arc::target() const
37 return Node();
53 Digraph::Node Digraph::addNode()
55 return Node();
60 Digraph::addArc(const Digraph::Node& pSource, const Digraph::Node
[all...]
H A DListDigraph.cpp14 // ListDigraph::Node
16 ListDigraph::Node::Node() function in class:ListDigraph::Node
37 ListDigraph::Node* ListDigraph::addNode()
40 Node* result = NULL;
43 new (result) Node();
64 ListDigraph::Arc* ListDigraph::addArc(Node& pU, Node& pV)
98 void ListDigraph::erase(ListDigraph::Node& pNode)
/frameworks/compile/mclinker/unittests/
H A DGCFactoryListTraitsTest.h32 * \brief Node used in the test
37 class Node : public llvm::ilist_node<Node> class in class:mcldtest::GCFactoryListTraitsTest
45 Node() : m_Init(0), m_Value(0) { } function in class:mcldtest::GCFactoryListTraitsTest::Node
47 Node(unsigned pInit) : m_Init(pInit), m_Value(pInit) { } function in class:mcldtest::GCFactoryListTraitsTest::Node
60 class NodeFactory : public mcld::GCFactory<Node, 0> {
62 NodeFactory() : mcld::GCFactory<Node, 0>(16) { }
64 Node *produce(unsigned pInit) {
65 Node *result = allocate();
66 new (result) Node(pIni
[all...]
H A DGraphTest.cpp44 ListDigraph::Node* u1 = graph.addNode();
45 ListDigraph::Node* u2 = graph.addNode();
46 ListDigraph::Node* u3 = graph.addNode();
63 ListDigraph::Node* head = NULL;
92 ListDigraph::Node* u1 = graph.addNode();
93 ListDigraph::Node* u2 = graph.addNode();
94 ListDigraph::Node* u3 = graph.addNode();
111 ListDigraph::Node* head = NULL;
140 ListDigraph::Node* u1 = graph.addNode();
141 ListDigraph::Node* u
[all...]
H A DGCFactoryListTraitsTest.cpp18 m_pNodesAlloc = new Node* [10];
66 llvm::iplist<Node>::const_iterator it = m_pNodeList.begin(); \
95 Node *NewNode = m_NodeFactory.produce(11);
104 for (llvm::iplist<Node>::const_iterator I = m_pNodeList.begin(),
/frameworks/base/core/tests/benchmarks/src/com/android/internal/util/
H A DIndentingPrintWriterBenchmark.java33 private Node mSimple;
34 private Node mComplex;
42 final Node manyChildren = Node.build("ManyChildren", Node.build("1"), Node.build("2"),
43 Node.build("3"), Node.build("4"), Node.build("5"), Node
99 private static class Node { class in class:IndentingPrintWriterBenchmark
[all...]
/frameworks/base/core/java/android/animation/
H A DAnimatorSet.java68 * to a single node representing that Animator, not create a new Node
71 private HashMap<Animator, Node> mNodeMap = new HashMap<Animator, Node>();
78 private ArrayList<Node> mNodes = new ArrayList<Node>();
85 private ArrayList<Node> mSortedNodes = new ArrayList<Node>();
218 for (Node node : mNodes) {
233 for (Node node : mNodes) {
334 for (Node nod
1002 private static class Node implements Cloneable { class in class:AnimatorSet
1056 public Node(Animator animation) { method in class:AnimatorSet.Node
[all...]
/frameworks/rs/
H A DrsScriptGroup.h48 class Node { class in class:android::renderscript::ScriptGroup
50 Node(Script *);
69 Vector<Node *> mNodes;
103 bool calcOrderRecurse(Node *n, int depth);
105 Node * findNode(Script *s) const;
H A DrsScriptGroup.cpp40 ScriptGroup::Node::Node(Script *s) { function in class:ScriptGroup::Node
46 ScriptGroup::Node * ScriptGroup::findNode(Script *s) const {
49 Node *n = mNodes[ct];
59 bool ScriptGroup::calcOrderRecurse(Node *n, int depth) {
67 Node *nt = NULL;
82 static int CompareNodeForSort(ScriptGroup::Node *const* lhs,
83 ScriptGroup::Node *const* rhs) {
92 bool operator() (const ScriptGroup::Node* lhs,
93 const ScriptGroup::Node* rh
[all...]
/frameworks/base/rs/java/android/renderscript/
H A DScriptGroup.java76 static class Node { class in class:ScriptGroup
83 Node mNext;
85 Node(Script s) { method in class:ScriptGroup.Node
170 private ArrayList<Node> mNodes = new ArrayList<Node>();
186 private void validateCycle(Node target, Node original) {
190 Node tn = findNode(cl.mToK.mScript);
197 Node tn = findNode(cl.mToF.mScript);
213 private void validateDAGRecurse(Node
[all...]
/frameworks/support/v8/renderscript/java/src/android/support/v8/renderscript/
H A DScriptGroup.java78 static class Node { class in class:ScriptGroup
85 Node mNext;
87 Node(Script s) { method in class:ScriptGroup.Node
172 private ArrayList<Node> mNodes = new ArrayList<Node>();
193 private void validateCycle(Node target, Node original) {
197 Node tn = findNode(cl.mToK.mScript);
204 Node tn = findNode(cl.mToF.mScript);
220 private void validateDAGRecurse(Node
[all...]
/frameworks/compile/mclinker/include/mcld/ADT/
H A DTreeAllocator.h17 * \brief NodeFactory manages the creation and destruction of mcld::Node.
29 class NodeFactory : public GCFactory<Node<DataType>, 64>
32 typedef GCFactory<Node<DataType>, 64> Alloc;
35 typedef Node<DataType> NodeType;
H A DTreeBase.h104 class Node : public NodeBase class in namespace:mcld
113 Node() function in class:mcld::Node
117 Node(const value_type& pValue) function in class:mcld::Node
H A DBinTree.h107 typedef Node<value_type> node_type;
195 typedef Node<value_type> node_type;
266 typedef Node<DataType> NodeType;
378 typedef Node<value_type> node_type;
/frameworks/base/core/java/android/widget/
H A DTimePickerClockDelegate.java101 private Node mLegalTimesTree;
885 Node node = mLegalTimesTree;
1103 mLegalTimesTree = new Node();
1106 Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5);
1107 Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
1112 Node firstDigit = new Node(k0, k1);
1116 Node secondDigi
1222 private class Node { class in class:TimePickerClockDelegate
1226 public Node(int... legalKeys) { method in class:TimePickerClockDelegate.Node
[all...]
H A DRelativeLayout.java1012 DependencyGraph.Node node = mGraph.mKeyNodes.get(id);
1620 private ArrayList<Node> mNodes = new ArrayList<Node>();
1626 private SparseArray<Node> mKeyNodes = new SparseArray<Node>();
1632 private ArrayDeque<Node> mRoots = new ArrayDeque<Node>();
1638 final ArrayList<Node> nodes = mNodes;
1657 final Node node = Node
1773 static class Node { class in class:RelativeLayout.DependencyGraph
[all...]
/frameworks/opt/datetimepicker/src/com/android/datetimepicker/time/
H A DTimePickerDialog.java103 private Node mLegalTimesTree;
604 Node node = mLegalTimesTree;
822 mLegalTimesTree = new Node();
825 Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5);
826 Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
831 Node firstDigit = new Node(k0, k1);
835 Node secondDigi
941 private class Node { class in class:TimePickerDialog
945 public Node(int... legalKeys) { method in class:TimePickerDialog.Node
[all...]
/frameworks/base/tools/layoutlib/bridge/tests/src/com/android/layoutlib/bridge/android/
H A DBridgeXmlBlockParserTest.java21 import org.w3c.dom.Node;
71 private void dump(Node node, String prefix) {
72 Node n;
/frameworks/base/tests/RenderScriptTests/SceneGraph/src/com/android/scenegraph/
H A DColladaParser.java35 import org.w3c.dom.Node;
243 Node childNode = node.getFirstChild();
245 if (childNode.getNodeType() == Node.ELEMENT_NODE) {
309 Node paramNode = fx.getFirstChild();
311 if (paramNode.getNodeType() == Node.ELEMENT_NODE) {
314 Node typeNode = paramNode.getFirstChild();
315 while (typeNode != null && typeNode.getNodeType() != Node.ELEMENT_NODE) {
490 Node childNode = scene.getFirstChild();
492 if (childNode.getNodeType() == Node.ELEMENT_NODE) {
/frameworks/compile/mclinker/include/mcld/
H A DInputTree.h89 typedef Node<value_type> node_type;
/frameworks/rs/cpu_ref/
H A DrsCpuScriptGroup.cpp120 ScriptGroup::Node *n = mSG->mNodes[ct];
/frameworks/compile/libbcc/bcinfo/BitReader_2_7/
H A DBitcodeReader.cpp2152 Value *Node = MDValueList.getValueFwdRef(Record[i+1]);
2153 Inst->setMetadata(I->second, cast<MDNode>(Node));
/frameworks/compile/libbcc/bcinfo/BitReader_3_0/
H A DBitcodeReader.cpp2412 Value *Node = MDValueList.getValueFwdRef(Record[i+1]);
2413 Inst->setMetadata(I->second, cast<MDNode>(Node));

Completed in 695 milliseconds