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

12

/system/core/property_service/libpropertyinfoserializer/
H A Dtrie_builder.cpp55 auto child = current_node->FindChild(name_pieces.front()); local
56 if (child == nullptr) {
57 child = current_node->AddChild(name_pieces.front());
59 if (child == nullptr) {
63 current_node = child;
79 auto child = current_node->FindChild(name_pieces.front()); local
80 if (child == nullptr) {
81 child = current_node->AddChild(name_pieces.front());
83 if (child == nullptr) {
87 if (child
[all...]
H A Dtrie_builder.h42 for (auto& child : children_) {
43 if (child.name() == name) return &child;
49 for (const auto& child : children_) {
50 if (child.name() == name) return &child;
/system/chre/util/include/chre/util/
H A Dheap_impl.h55 size_t child = 2 * current + 1; // left child
58 if (child + 1 < container.size() - 1 &&
59 compare(container[child], container[child + 1])) {
60 child++;
63 // If the current element is not childless and the dominant child dominates
65 if (child < container.size() - 1 &&
66 compare(container[current], container[child])) {
67 container.swap(current, child);
[all...]
/system/extras/runconuid/
H A Drunconuid.cpp178 pid_t child; local
181 child = fork();
183 if (child < 0) {
193 if (child == 0) {
197 if (ptrace(PTRACE_ATTACH, child, 0, 0) < 0) {
199 kill(SIGKILL, child);
201 perror_exit("Could not ptrace child.");
207 perror_exit("Could not wait for child SIGSTOP");
211 ptrace(PTRACE_SETOPTIONS, child, 0, PTRACE_O_TRACESYSGOOD);
214 ptrace(PTRACE_SYSCALL, child,
[all...]
/system/extras/simpleperf/scripts/inferno/
H A Ddata_types.py110 child = self.child_dict.get(key)
111 if child is None:
112 child = self.child_dict[key] = FlameGraphCallSite(callsite.method, callsite.dso,
114 return child
121 child = self.child_dict[key]
122 if child.num_events >= min_num_events:
123 child.trim_callchain(min_num_events)
124 self.children.append(child)
134 for child in self.children:
135 child_offset = child
[all...]
H A Dsvg_renderer.py123 for i, child in enumerate(flamegraph.children):
136 up_index = max(child.children, key=lambda x: x.weight()).id if child.children else 0
141 createSVGNode(process, child, depth, f, total_weight, height, color_scheme, nav)
143 renderSVGNodes(process, child, depth + 1, f, total_weight, height, color_scheme)
/system/libufdt/
H A Dufdt_node.c38 res->child = NULL;
39 res->last_child_p = &res->child;
48 struct ufdt_node *it = ((struct ufdt_node_fdt_node *)node)->child;
59 int ufdt_node_add_child(struct ufdt_node *parent, struct ufdt_node *child) { argument
60 if (!parent || !child) return -1;
64 uint32_t child_tag = ufdt_node_tag(child);
68 // Append the child node to the last child of parant node
69 *((struct ufdt_node_fdt_node *)parent)->last_child_p = child;
70 ((struct ufdt_node_fdt_node *)parent)->last_child_p = &child
[all...]
/system/libufdt/include/
H A Dufdt_types.h30 for ((it) = &(((struct ufdt_node_fdt_node *)(node))->child); *(it); \
65 struct ufdt_node *child; member in struct:ufdt_node_fdt_node
H A Dlibufdt.h45 * Adds the child as a subnode of the parent.
47 * the tag type of child.
54 int ufdt_node_add_child(struct ufdt_node *parent, struct ufdt_node *child);
/system/timezone/tzlookup_generator/src/main/java/com/android/libcore/timezone/tzlookup/zonetree/
H A DTreeNode.java23 * and zero or more child nodes.
56 * Adds the child and sets the parent of the child. The child must not already have a parent.
79 for (V child : getChildren()) {
80 child.visitSelfThenChildrenRecursive(visitor);
85 * Remove a single child. {@link Object#equals(Object)} is used to
86 * identify the child node to remove. The parent of the node to be removed is set to null.
H A DCountryZoneTree.java358 * into the past (the leaves). If a node has a single child it means that the previous
359 * period (the child) also had every zone in agreement. If a node has zero children it means
369 // Increase the period offset by one so that the child will be for one period further
376 // Generate all the child sets.
395 // Construct any child nodes.
401 // The child ID is just the {parent ID}.{child number} so we create an easy-to-debug
420 * Uninteresting nodes are those that have a single child; having a single child implies the
421 * node and its child hav
[all...]
/system/core/include/utils/
H A DLruCache.h72 Entry* child; member in class:android::LruCache::final
74 Entry(TKey _key, TValue _value) : key(_key), value(_value), parent(NULL), child(NULL) {
257 for (Entry* p = mOldest; p != NULL; p = p->child) {
275 mYoungest->child = &entry;
283 entry.parent->child = entry.child;
285 mOldest = entry.child;
287 if (entry.child != NULL) {
288 entry.child->parent = entry.parent;
294 entry.child
[all...]
/system/core/libutils/include/utils/
H A DLruCache.h72 Entry* child; member in class:android::LruCache::final
74 Entry(TKey _key, TValue _value) : key(_key), value(_value), parent(NULL), child(NULL) {
257 for (Entry* p = mOldest; p != NULL; p = p->child) {
275 mYoungest->child = &entry;
283 entry.parent->child = entry.child;
285 mOldest = entry.child;
287 if (entry.child != NULL) {
288 entry.child->parent = entry.parent;
294 entry.child
[all...]
/system/core/adb/
H A Dadb_utils_test.cpp37 static std::string subdir(const char* parent, const char* child) { argument
40 str += child;
/system/core/libmemunreachable/tests/
H A DThreadCapture_test.cpp185 // child
212 // child init
216 // child cleanup
219 [&](pid_t child) {
221 ASSERT_GT(child, 0);
226 ThreadCapture thread_capture(child, heap);
252 // child
290 // child init
308 // child cleanup
312 [&](pid_t child) {
[all...]
/system/extras/simpleperf/
H A Dcallchain.h131 std::unique_ptr<NodeT> child = AllocateNode( local
133 child->children = std::move(parent->children);
135 parent->children_period = child->period + child->children_period;
138 parent->children.push_back(std::move(child));
H A DCallChainJoiner.h127 void LinkParent(CacheNode* child, CacheNode* new_parent);
128 void UnlinkParent(CacheNode* child);
H A DCallChainJoiner.cpp150 void LRUCache::LinkParent(CacheNode* child, CacheNode* new_parent) { argument
151 CacheNode* old_parent = GetParent(child);
155 child->parent_index = GetNodeIndex(new_parent);
165 void LRUCache::UnlinkParent(CacheNode* child) { argument
166 CacheNode* old_parent = GetParent(child);
170 child->parent_index = 0;
/system/core/fastboot/
H A Dfs.cpp88 pid_t child;
89 if ((child = fork()) == 0) {
93 if (child < 0) {
97 if (TEMP_FAILURE_RETRY(waitpid(child, &status, 0)) == -1) {
/system/extras/simpleperf/runtest/
H A Druntest.py42 def add_child(self, child):
43 self.children.append(child)
51 for child in self.children:
52 strs.extend(child._dump(indent + 1))
127 def add_child(self, child):
128 self.children.append(child)
137 for child in self.children:
138 strs.extend(child._dump(indent + 1))
154 for child in self.children:
157 if child
[all...]
/system/core/debuggerd/
H A Dcrash_dump.cpp272 // Wait for a process to clone and return the child's pid.
293 pid_t child; local
294 if (ptrace(PTRACE_GETEVENTMSG, pid, 0, &child) != 0) {
295 PLOG(FATAL) << "failed to get child pid via PTRACE_GETEVENTMSG";
299 if (!wait_for_stop(child, &stop_signal)) {
300 PLOG(FATAL) << "failed to waitpid on child";
306 if (ptrace(PTRACE_CONT, child, 0, 0) != 0) {
307 PLOG(FATAL) << "failed to resume child (pid = " << child << ")";
311 return child;
[all...]
/system/extras/simpleperf/scripts/
H A Dreport.py72 for child in self.children:
73 child_strs = child.dump()
266 for child in node.children:
267 self.display_call_tree(tree, id, child, indent + 1)
H A Dreport_html.py269 child = self.children.get(func_id)
270 if not child:
271 child = self.children[func_id] = CallNode(func_id)
272 return child
276 for child in self.children.values():
277 self.subtree_event_count += child.update_subtree_event_count()
284 child = self.children[key]
285 if child.subtree_event_count < min_limit:
288 child.cut_edge(min_limit, hit_func_ids)
297 result['c'] = [child
[all...]
/system/libvintf/
H A Dparse_xml.cpp69 inline void appendChild(NodeType *parent, NodeType *child) { argument
70 parent->InsertEndChild(child);
73 inline void appendChild(DocType *parent, NodeType *child) { argument
74 parent->InsertEndChild(child);
104 for (NodeType *child = parent->FirstChildElement(name.c_str());
105 child != nullptr;
106 child = child->NextSiblingElement(name.c_str())) {
107 v.push_back(child);
282 NodeType *child local
295 NodeType* child = getChild(root, elementName); local
313 NodeType *child = getChild(root, conv.elementName()); local
325 NodeType *child = getChild(root, conv.elementName()); local
[all...]
/system/tools/hidl/test/hidl_test/
H A Dhidl_test_client.cpp567 "android.hardware.tests.inheritance@1.0::IParent/child",
568 "android.hardware.tests.inheritance@1.0::IChild/child",
570 "android.hardware.tests.inheritance@1.0::IGrandparent/child",
625 std::set<std::string> activeSet = {"parent", "child"};
641 sp<IChild> child = new SimpleChild(); local
644 EXPECT_EQ(::android::OK, child->registerAsService(kInstanceName));
645 EXPECT_EQ(::android::OK, child->registerAsService(kOtherName));
647 EXPECT_TRUE(interfacesEqual(child, IChild::getService(kInstanceName)));
648 EXPECT_TRUE(interfacesEqual(child, IParent::getService(kInstanceName)));
658 EXPECT_TRUE(interfacesEqual(child, IChil
765 sp<IChild> child = IChild::castFrom(service1); local
1580 expectGoodChild(sp<IChild> child) argument
1595 sp<IChild> child = IChild::castFrom(parent); local
2153 pid_t child; local
[all...]

Completed in 404 milliseconds

12