| /frameworks/base/core/tests/benchmarks/src/com/android/internal/util/ |
| D | IndentingPrintWriterBenchmark.java | 33 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/ |
| D | GCFactoryListTraitsTest.h | 35 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 …]
|
| D | GraphTest.cpp | 39 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 …]
|
| /frameworks/base/tools/aapt2/ |
| D | DominatorTree.h | 53 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 …]
|
| D | DominatorTree.cpp | 32 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/tools/incident_report/ |
| D | generic_message.cpp | 30 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()
|
| D | generic_message.h | 45 struct Node { struct
61 typedef multimap<int32_t,Node>::const_iterator const_iterator; argument
67 multimap<int,Node> mNodes;
|
| /frameworks/base/core/java/android/animation/ |
| D | AnimatorSet.java | 74 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/opt/gamesdk/third_party/protobuf-3.0.0/java/util/src/main/java/com/google/protobuf/util/ |
| D | FieldMaskTree.java | 68 private static final class Node { class in FieldMaskTree
69 final SortedMap<String, Node> children = new TreeMap<String, Node>();
72 private final Node root = new Node();
106 Node node = root; in addFieldPath()
119 Node tmp = new Node(); in addFieldPath()
154 private void getFieldPaths(Node node, String path, List<String> paths) { in getFieldPaths()
159 for (Entry<String, Node> entry : node.children.entrySet()) { in getFieldPaths()
176 Node node = root; in intersectFieldPath()
215 Node node, in merge()
223 for (Entry<String, Node> entry : node.children.entrySet()) { in merge()
|
| /frameworks/opt/gamesdk/third_party/protobuf-3.0.0/src/google/protobuf/util/internal/ |
| D | default_value_objectwriter.h | 139 class LIBPROTOBUF_EXPORT Node {
141 Node(const string& name, const google::protobuf::Type* type, NodeKind kind,
144 virtual ~Node() { in ~Node()
151 void AddChild(Node* child) { children_.push_back(child); } in AddChild()
154 Node* FindChild(StringPiece name);
209 std::vector<Node*> children_;
226 GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Node);
231 void MaybePopulateChildrenOfAny(Node* node);
261 Node* current_;
263 google::protobuf::scoped_ptr<Node> root_;
[all …]
|
| D | default_value_objectwriter.cc | 188 DefaultValueObjectWriter::Node::Node( in Node() function in google::protobuf::util::converter::DefaultValueObjectWriter::Node
202 DefaultValueObjectWriter::Node* DefaultValueObjectWriter::Node::FindChild( in FindChild()
208 Node* child = children_[i]; in FindChild()
216 void DefaultValueObjectWriter::Node::WriteTo(ObjectWriter* ow) { in WriteTo()
251 void DefaultValueObjectWriter::Node::WriteChildren(ObjectWriter* ow) { in WriteChildren()
253 Node* child = children_[i]; in WriteChildren()
258 const google::protobuf::Type* DefaultValueObjectWriter::Node::GetMapValueType( in GetMapValueType()
284 void DefaultValueObjectWriter::Node::PopulateChildren( in PopulateChildren()
297 std::vector<Node*> new_children; in PopulateChildren()
368 google::protobuf::scoped_ptr<Node> child(new Node( in PopulateChildren()
[all …]
|
| /frameworks/opt/gamesdk/third_party/protobuf-3.0.0/src/google/protobuf/util/ |
| D | field_mask_util.cc | 213 struct Node { struct in google::protobuf::util::__anon405789c10111::FieldMaskTree
214 Node() {} in Node() argument
216 ~Node() { ClearChildren(); } in ~Node() argument
219 for (map<string, Node*>::iterator it = children.begin(); in ClearChildren()
226 map<string, Node*> children; argument
229 GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Node);
234 void MergeToFieldMask(const string& prefix, const Node* node, FieldMask* out);
237 void MergeLeafNodesToTree(const string& prefix, const Node* node,
241 void MergeMessage(const Node* node, const Message& source,
246 void TrimMessage(const Node* node, Message* message);
[all …]
|
| /frameworks/opt/net/wifi/tests/wifitests/src/com/android/server/wifi/hotspot2/omadm/ |
| D | MoSerializerTest.java | 29 import org.w3c.dom.Node;
74 Node childNode = element.getFirstChild(); in testShouldReturnValidElementForWriteVersion()
90 Node childNode = element.getFirstChild(); in testShouldReturnValidElementForCreateNodeForUrn()
94 Node childNode2 = childNode.getFirstChild(); in testShouldReturnValidElementForCreateNodeForUrn()
97 Node textNode = childNode2.getFirstChild(); in testShouldReturnValidElementForCreateNodeForUrn()
113 Node childNode = element.getFirstChild(); in testShouldReturnValidElementForCreateNode()
115 Node textNode = childNode.getFirstChild(); in testShouldReturnValidElementForCreateNode()
133 Node childNode; in testShouldReturnValidElementForCreateNodeForValue()
134 Node textNode; in testShouldReturnValidElementForCreateNodeForValue()
|
| /frameworks/native/vulkan/libvulkan/ |
| D | debug_report.h | 36 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
|
| D | debug_report.cpp | 22 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/opt/datetimepicker/src/com/android/datetimepicker/time/ |
| D | TimePickerDialog.java | 106 private Node mLegalTimesTree;
608 Node node = mLegalTimesTree;
826 mLegalTimesTree = new Node();
829 Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5);
830 Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
835 Node firstDigit = new Node(k0, k1);
839 Node secondDigit = new Node(k0, k1, k2, k3, k4, k5);
845 Node thirdDigit = new Node(k6, k7, k8, k9);
850 secondDigit = new Node(k6, k7, k8, k9);
856 firstDigit = new Node(k2);
[all …]
|
| /frameworks/base/cmds/incident_helper/testdata/ |
| D | pagetypeinfo.txt | 5 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/base/tools/aapt2/xml/ |
| D | XmlDom.h | 41 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/native/vulkan/api/templates/ |
| D | vulkan_common.tmpl | 13 {{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)}}
|
| /frameworks/rs/support/java/src/androidx/renderscript/ |
| D | ScriptGroup.java | 51 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/rs/ |
| D | rsScriptGroup.cpp | 54 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 …]
|
| D | rsScriptGroup.h | 57 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/layoutlib/bridge/src/android/graphics/text/ |
| D | OptimizingLineBreaker.java | 59 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/ |
| D | ResourceDeduper.cpp | 44 using Node = DominatorTree::Node; typedef in aapt::__anoncbc5f1a20111::DominatedKeyValueRemover
49 void VisitConfig(Node* node) { in VisitConfig()
50 Node* parent = node->parent(); in VisitConfig()
|
| /frameworks/opt/gamesdk/third_party/protobuf-3.0.0/src/google/protobuf/ |
| D | map.h | 739 struct Node { struct
741 Node* next; argument
746 static Node* NodePtrFromKeyPtr(Key* k) { in NodePtrFromKeyPtr()
747 return reinterpret_cast<Node*>(k); in NodePtrFromKeyPtr()
750 static Key* KeyPtrFromNodePtr(Node* node) { return &node->kv.key(); } in KeyPtrFromNodePtr()
792 iterator_base(Node* n, const InnerMap* m, size_type index) in iterator_base()
815 node_ = static_cast<Node*>(m_->table_[bucket_index_]); in SearchFrom()
876 Node* l = static_cast<Node*>(m_->table_[bucket_index_]); in revalidate_if_necessary()
893 Node* node_;
911 Node* node = static_cast<Node*>(table_[b]); in clear()
[all …]
|