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

123

/frameworks/compile/mclinker/unittests/
H A DGCFactoryListTraitsTest.h30 * \brief Node used in the test
35 class Node : public llvm::ilist_node<Node> { class in class:mcldtest::GCFactoryListTraitsTest
43 Node() : m_Init(0), m_Value(0) {} function in class:mcldtest::GCFactoryListTraitsTest::Node
45 Node(unsigned pInit) : m_Init(pInit), m_Value(pInit) {} function in class:mcldtest::GCFactoryListTraitsTest::Node
54 class NodeFactory : public mcld::GCFactory<Node, 0> {
56 NodeFactory() : mcld::GCFactory<Node, 0>(16) {}
58 Node* produce(unsigned pInit) {
59 Node* result = allocate();
60 new (result) Node(pIni
[all...]
H A DGraphTest.cpp39 ListDigraph::Node* u1 = graph.addNode();
40 ListDigraph::Node* u2 = graph.addNode();
41 ListDigraph::Node* u3 = graph.addNode();
58 ListDigraph::Node* head = NULL;
86 ListDigraph::Node* u1 = graph.addNode();
87 ListDigraph::Node* u2 = graph.addNode();
88 ListDigraph::Node* u3 = graph.addNode();
105 ListDigraph::Node* head = NULL;
133 ListDigraph::Node* u1 = graph.addNode();
134 ListDigraph::Node* u
[all...]
H A DGCFactoryListTraitsTest.cpp17 m_pNodesAlloc = new Node* [10];
64 llvm::iplist<Node>::const_iterator it = m_pNodeList.begin(); \
93 Node* NewNode = m_NodeFactory.produce(11);
102 for (llvm::iplist<Node>::const_iterator I = m_pNodeList.begin(),
/frameworks/base/tools/aapt2/
H A DDominatorTree.h53 class Node { class in class:aapt::DominatorTree
55 explicit Node(ResourceConfigValue* value = nullptr, Node* parent = nullptr) function in class:aapt::DominatorTree::Node
60 inline Node* parent() const { return parent_; }
64 inline const std::vector<std::unique_ptr<Node>>& children() const {
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
[all...]
H A DDominatorTree.cpp31 util::make_unique<Node>(config.get(), nullptr));
41 bool DominatorTree::Node::TryAddChild(std::unique_ptr<Node> new_child) {
50 bool DominatorTree::Node::AddChild(std::unique_ptr<Node> new_child) {
65 [](const std::unique_ptr<Node>& child) -> bool {
83 bool DominatorTree::Node::Dominates(const Node* other) const {
/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/tools/incident_report/
H A Dgeneric_message.cpp30 Node node;
33 mNodes.insert(pair<int32_t,Node>(fieldId, node));
39 Node node;
42 mNodes.insert(pair<int32_t,Node>(fieldId, node));
49 Node node;
52 mNodes.insert(pair<int32_t,Node>(fieldId, node));
59 Node node;
62 mNodes.insert(pair<int32_t,Node>(fieldId, node));
H A Dgeneric_message.h45 struct Node { struct in class:GenericMessage
61 typedef multimap<int32_t,Node>::const_iterator const_iterator;
67 multimap<int,Node> mNodes;
/frameworks/support/emoji/core/src/android/support/text/emoji/
H A DMetadataRepo.java60 private final Node mRootNode;
76 mRootNode = new Node(DEFAULT_ROOT_SIZE);
90 mRootNode = new Node(DEFAULT_ROOT_SIZE);
167 Node getRootNode() {
209 static class Node { class in class:MetadataRepo
210 private final SparseArray<Node> mChildren;
213 private Node() { method in class:MetadataRepo.Node
217 private Node(final int defaultChildrenSize) { method in class:MetadataRepo.Node
221 Node get(final int key) {
230 Node nod
[all...]
/frameworks/native/vulkan/libvulkan/
H A 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) {
59 return reinterpret_cast<Node*>(uintptr_t(handle));
62 static VkDebugReportCallbackEXT GetHandle(const Node* node) {
66 static VkDebugReportCallbackEXT GetDriverHandle(const Node* node) {
71 struct Node { struct in class:vulkan::driver::DebugReportCallbackList
72 Node* next;
83 Node head
[all...]
H A Ddebug_report.cpp22 DebugReportCallbackList::Node* DebugReportCallbackList::AddCallback(
26 void* mem = allocator.pfnAllocation(allocator.pUserData, sizeof(Node),
27 alignof(Node),
34 head_.next = new (mem) Node{head_.next, info.flags, info.pfnCallback,
41 Node* node,
46 Node* prev = &head_;
64 const Node* node = &head_;
/frameworks/base/core/java/android/animation/
H A DAnimatorSet.java74 private ArrayList<Node> mPlayingSet = new ArrayList<Node>();
79 * to a single node representing that Animator, not create a new 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 nod
1758 private static class Node implements Cloneable { class in class:AnimatorSet
1804 public Node(Animator animation) { method in class:AnimatorSet.Node
[all...]
/frameworks/base/tools/aapt2/flatten/
H A DXmlFlattener.h49 bool Flatten(IAaptContext* context, xml::Node* node);
/frameworks/base/tools/aapt2/optimize/
H A DResourceDeduper.cpp41 using Node = DominatorTree::Node;
46 void VisitConfig(Node* node) {
47 Node* parent = node->parent();
/frameworks/base/tools/aapt2/xml/
H A DXmlDom.h40 class Node { class in namespace:aapt::xml
42 virtual ~Node() = default;
53 // Clones the Node subtree, using the given function to decide how to clone an Element.
54 virtual std::unique_ptr<Node> Clone(const ElementCloneFunc& el_cloner) const = 0;
85 class Element : public Node {
93 std::vector<std::unique_ptr<Node>> children;
95 void AppendChild(std::unique_ptr<Node> child);
96 void InsertChild(size_t index, std::unique_ptr<Node> child);
112 std::unique_ptr<Node> Clone(const ElementCloneFunc& el_cloner) const override;
118 class Text : public Node {
[all...]
/frameworks/compile/mclinker/include/mcld/ADT/
H A DTreeAllocator.h20 * \brief NodeFactory manages the creation and destruction of mcld::Node.
32 class NodeFactory : public GCFactory<Node<DataType>, 64> {
34 typedef GCFactory<Node<DataType>, 64> Alloc;
37 typedef Node<DataType> NodeType;
H A DTreeBase.h99 class Node : public NodeBase { class in namespace:mcld
107 Node() : NodeBase(), data(NULL) {} function in class:mcld::Node
109 explicit Node(const value_type& pValue) : NodeBase(), data(&pValue) {} function in class:mcld::Node
/frameworks/rs/
H A DrsScriptGroup.h57 class Node { class in class:android::renderscript::ScriptGroup
59 explicit Node(Script *);
78 std::vector<Node *> mNodes;
98 bool calcOrderRecurse(Node *n, int depth);
100 Node * findNode(Script *s) const;
H A DrsScriptGroup.cpp54 ScriptGroup::Node::Node(Script *s) { function in class:android::renderscript::ScriptGroup::Node
60 ScriptGroup::Node * ScriptGroup::findNode(Script *s) const {
63 Node *n = mNodes[ct];
74 bool ScriptGroup::calcOrderRecurse(Node *n, int depth) {
83 Node *nt = NULL;
99 bool operator() (const ScriptGroup::Node* lhs,
100 const ScriptGroup::Node* rhs) {
111 Node *n = findNode(k->mScript);
114 n = new Node(
[all...]
/frameworks/opt/datetimepicker/src/com/android/datetimepicker/time/
H A 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 secondDigi
942 private class Node { class in class:TimePickerDialog
946 public Node(int... legalKeys) { method in class:TimePickerDialog.Node
[all...]
/frameworks/layoutlib/bridge/src/android/text/
H A DOptimizingLineBreaker.java56 Node[] opt = new Node[numBreaks];
57 opt[0] = new Node(-1, 0, 0, 0, false);
58 opt[numBreaks - 1] = new Node(-1, 0, 0, 0, false);
67 Node bestBreak = null;
85 bestBreak = new Node(pos, opt[pos].mPrevCount + 1, demerits,
113 opt[breakIndex] = new Node(lastBreak, lines + 1, 0 /*doesn't matter*/,
244 private static class Node { class in class:OptimizingLineBreaker
253 public Node(int prev, int prevCount, float demerits, float width, boolean hasTabs) { method in class:OptimizingLineBreaker.Node
/frameworks/rs/support/java/src/android/support/v8/renderscript/
H A DScriptGroup.java51 private ArrayList<Node> mNodes = new ArrayList<Node>();
82 static class Node { class in class:ScriptGroup
91 Node mNext;
93 Node(Script s) { method in class:ScriptGroup.Node
536 Node n = mNodes.get(ct);
556 for (Node node : mNodes) {
620 private ArrayList<Node> mNodes = new ArrayList<Node>();
637 private void validateCycle(Node targe
[all...]
/frameworks/data-binding/compiler/src/main/java/android/databinding/tool/reflection/
H A DSdkUtil.java19 import org.w3c.dom.Node;
108 Node node = allClasses.item(j);
109 if (node.getNodeType() != Node.ELEMENT_NODE || !"class"
119 Node child = childNodes.item(i);
120 if (child.getNodeType() != Node.ELEMENT_NODE || !"method"
153 private static int getSince(Node node) {
154 final Node since = node.getAttributes().getNamedItem("since");
/frameworks/layoutlib/bridge/tests/src/com/android/layoutlib/bridge/android/
H A DBridgeXmlBlockParserTest.java25 import org.w3c.dom.Node;
85 private void dump(Node node, String prefix) {
86 Node n;
/frameworks/support/emoji/core/tests/java/android/support/text/emoji/
H A DMetadataRepoTest.java24 import android.support.text.emoji.MetadataRepo.Node;
100 final EmojiMetadata getNode(Node node, final int[] codepoints, int start) {
104 final Node childNode = node.get(codepoints[start]);

Completed in 1457 milliseconds

123