| /external/protobuf/src/google/protobuf/util/ |
| field_mask_util.cc | 287 Node*& child = node->children[node_name]; local
288 if (child == NULL) {
290 child = new Node();
292 node = child;
347 const Node* child = it->second; local
354 if (!child->children.empty()) {
364 MergeMessage(child, source_reflection->GetMessage(source, field), options,
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/ |
| BaseConstructor.java | 274 for (Node child : node.getValue()) {
275 collection.add(constructObject(child));
283 for (Node child : node.getValue()) {
285 if (child.getType() == Object.class) {
286 child.setType(componentType);
289 final Object value = constructObject(child);
294 throw new NullPointerException("Unable to construct element value for " + child);
|
| /external/swiftshader/third_party/SPIRV-Tools/source/comp/ |
| move_to_front.cpp | 246 // Will determine if |node| will become the right or left child after
324 // |node| may have only one child at this point.
328 uint32_t child = RightOf(node) ? RightOf(node) : LeftOf(node); local
330 // Orphan |node| and reconnect parent and child.
331 if (child) MutableParentOf(child) = parent;
335 MutableLeftOf(parent) = child;
337 MutableRightOf(parent) = child;
346 if (root_ == node) root_ = child;
350 node = child;
[all...] |
| /external/v8/src/torque/ |
| earley-parser.h | 206 // that are left of the mark. In addition, they store a child and a left-sibling
231 // If NextSymbol() was a non-terminal, then {child} is a pointer to a
234 Item Advance(size_t new_pos, const Item* child = nullptr) const {
235 if (child) {
236 DCHECK(child->IsComplete());
237 DCHECK_EQ(pos(), child->start());
238 DCHECK_EQ(new_pos, child->pos());
239 DCHECK_EQ(NextSymbol(), child->left());
243 result.child_ = child;
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| XMPNode.java | 46 /** list of child nodes, lazy initialized */
61 /** flag if the node has an "rdf:value" child node. */
117 * @return Returns the child with the requested index.
126 * Adds a node as child to this node.
140 * Adds a node as child to this node.
169 * Removes a child at the requested index.
180 * Removes a child node.
183 * @param node the child node to delete.
227 * @param expr child node name to look for
454 XMPNode child = (XMPNode) it.next()
[all...] |
| XMPSerializerRDF.java | 850 XMPNode child = (XMPNode) it.next(); local
851 declareUsedNamespaces(child, usedPrefixes, indent);
1067 XMPNode child = (XMPNode) it.next(); local
1068 serializePrettyRDFProperty(child, false, indent + 2);
1089 XMPNode child = (XMPNode) it.next(); local
1090 serializePrettyRDFProperty(child, false, indent + 1);
1100 XMPNode child = (XMPNode) it.next(); local
1101 if (!canBeRDFAttrProp(child))
1109 write(child.getName());
1111 appendNodeValue(child.getValue(), true)
[all...] |
| /cts/hostsidetests/appsecurity/test-apps/UsePermissionApp23/src/com/android/cts/usepermission/ |
| BasePermissionsTest.java | 517 AccessibilityNodeInfo child = root.getChild(i); local
518 if (child == null) {
521 if (child.getCollectionInfo() != null) {
522 scrollTop(child);
523 result = getNodeTimed(() -> findByText(child, text), false);
528 while (child.getActionList().contains(
529 AccessibilityAction.ACTION_SCROLL_FORWARD) || child.getActionList()
531 scrollForward(child);
532 result = getNodeTimed(() -> findByText(child, text), false);
541 result = findByTextInCollection(child, text)
[all...] |
| /external/guice/core/test/com/google/inject/ |
| JitBindingsTest.java | 53 + ". It was already configured on one or more child injectors or private modules";
362 Injector child = local
370 ensureWorks(child, Foo.class, Bar.class);
371 ensureFails(child, ALLOW_BINDING, FooImpl.class);
373 // TODO(sameb): FooBar may or may not be in a child injector, depending on if GC has run.
374 // We should fix failed child injectors to remove their contents from the parent blacklist
376 // FooBar was succesfully inserted into the child injector (and parent blacklist), but then
377 // JIT bindings it depended on failed, making the child injector invalid.
380 child.createChildInjector(
389 ensureFails(child, ALLOW_BINDING, FooImpl.class)
420 Injector child = local
[all...] |
| /external/mesa3d/src/gallium/drivers/vc4/ |
| vc4_qir_schedule.c | 559 struct schedule_node *child = n->children[i]; local
561 qir_dump_inst(c, child->inst);
562 fprintf(stderr, " (%d parents)\n", child->parent_count);
675 struct schedule_node *child = chosen->children[i]; local
677 child->unblocked_time = MAX2(child->unblocked_time,
679 latency_between(child,
681 child->parent_count--;
682 if (child->parent_count == 0)
683 list_add(&child->link, &state->worklist)
[all...] |
| /external/python/cpython2/Lib/idlelib/ |
| TreeWidget.py | 115 for child in self.children:
116 child.deselecttree()
190 child = self.__class__(self.canvas, self, item)
191 self.children.append(child)
195 for child in self.children:
198 cy = child.draw(cx, cy)
199 if child.item._IsExpandable():
200 if child.state == 'expanded':
202 callback = child.collapse
205 callback = child.expan
[all...] |
| /external/python/cpython3/Lib/idlelib/ |
| tree.py | 116 for child in self.children:
117 child.deselecttree()
191 child = self.__class__(self.canvas, self, item)
192 self.children.append(child)
196 for child in self.children:
199 cy = child.draw(cx, cy)
200 if child.item._IsExpandable():
201 if child.state == 'expanded':
203 callback = child.collapse
206 callback = child.expan
[all...] |
| /external/skqp/src/gpu/ |
| GrFragmentProcessor.cpp | 103 int GrFragmentProcessor::registerChildProcessor(std::unique_ptr<GrFragmentProcessor> child) {
104 if (child->usesLocalCoords()) {
109 fChildProcessors.push_back(std::move(child));
287 static std::unique_ptr<GrFragmentProcessor> Make(std::unique_ptr<GrFragmentProcessor> child,
290 new ReplaceInputFragmentProcessor(std::move(child), color));
331 ReplaceInputFragmentProcessor(std::unique_ptr<GrFragmentProcessor> child,
333 : INHERITED(kReplaceInputFragmentProcessor_ClassID, OptFlags(child.get(), color))
335 this->registerChildProcessor(std::move(child));
338 static OptimizationFlags OptFlags(const GrFragmentProcessor* child,
340 OptimizationFlags childFlags = child->optimizationFlags()
[all...] |
| /external/v8/src/profiler/ |
| heap-snapshot-generator.h | 139 V8_INLINE HeapGraphEdge* child(int i);
427 Object* child,
432 Object* child);
436 Object* child);
440 Object* child,
445 Object* child,
448 Object* child, int field_offset);
460 Name* reference_name, Object* child,
465 Object* child, const char* name_format_string = nullptr,
472 Object* child);
[all...] |
| allocation-tracker.cc | 41 AllocationTraceNode* child = FindChild(function_info_index); local
42 if (child == nullptr) {
43 child = new AllocationTraceNode(tree_, function_info_index);
44 children_.push_back(child);
46 return child;
|
| /art/tools/ahat/src/main/com/android/ahat/heapdump/ |
| Diff.java | 173 for (AhatInstance child : inst.getDominated()) {
174 placeholders.add(child.newPlaceHolderInstance());
175 deque.push(child);
252 for (Site child : root.getChildren()) {
253 setSitesBaseline(child, baseline);
|
| /bootable/recovery/install/ |
| adb_install.cpp | 241 // Recovery starts minadbd service as a child process, and spawns another thread to listen for the
286 pid_t child = fork(); local
287 if (child == -1) {
288 PLOG(ERROR) << "Failed to fork child process";
291 if (child == 0) {
315 std::thread listener_thread(ListenAndExecuteMinadbdCommands, ui, child,
322 waitpid(child, &status, 0);
|
| /external/linux-kselftest/tools/testing/selftests/capabilities/ |
| test_execve.c | 181 pid_t child = fork(); local
182 if (child == 0) {
185 } else if (child > 0) {
187 if (waitpid(child, &status, 0) != child ||
189 ksft_print_msg("Child died\n");
192 ksft_print_msg("Child failed\n");
|
| /external/ltp/testcases/kernel/mem/vmtests/ |
| data_space.c | 151 int child; local
157 switch (child = fork()) {
164 allchild[i] = child;
174 while ((child = wait(&status)) > 0) {
176 tst_resm(TINFO, "\t%s[%d] exited status = 0x%x\n", prog, child,
235 * NOTE: If we run this with a lot of children, the last child
239 * not the first child.
448 * Child - exit.
496 "\tThis is not ok for first child - check parameters.\n");
|
| /external/minijail/ |
| system_unittest.cc | 56 auto callback = [](const char* child, const struct stat*, int file_type,
59 if (rmdir(child) == -1) {
60 fprintf(stderr, "rmdir(%s): %s", child, strerror(errno));
64 if (unlink(child) == -1) {
65 fprintf(stderr, "unlink(%s): %s", child, strerror(errno));
|
| /external/ImageMagick/MagickCore/ |
| histogram.c | 79 *child[16];
250 if (node_info->child[id] == (NodeInfo *) NULL)
252 node_info->child[id]=GetNodeInfo(cube_info,level);
253 if (node_info->child[id] == (NodeInfo *) NULL)
261 node_info=node_info->child[id];
358 if (node_info->child[i] != (NodeInfo *) NULL)
359 DefineImageHistogram(image,node_info->child[i],histogram);
459 if (node_info->child[i] != (NodeInfo *) NULL)
460 DestroyColorCube(image,node_info->child[i]);
716 if (node_info->child[id] == (NodeInfo *) NULL
76 *child[16]; member in struct:_NodeInfo
[all...] |
| /external/libevent/WIN32-Code/ |
| tree.h | 513 struct type *child, *parent, *old = elm; \
516 child = RB_RIGHT(elm, field); \
518 child = RB_LEFT(elm, field); \
524 child = RB_RIGHT(elm, field); \
527 if (child) \
528 RB_PARENT(child, field) = parent; \
531 RB_LEFT(parent, field) = child; \
533 RB_RIGHT(parent, field) = child; \
536 RB_ROOT(head) = child; \
561 if (child) \
[all...] |
| /external/openssh/openbsd-compat/ |
| sys-tree.h | 530 struct type *child, *parent, *old = elm; \
533 child = RB_RIGHT(elm, field); \
535 child = RB_LEFT(elm, field); \
541 child = RB_RIGHT(elm, field); \
544 if (child) \
545 RB_PARENT(child, field) = parent; \
548 RB_LEFT(parent, field) = child; \
550 RB_RIGHT(parent, field) = child; \
553 RB_ROOT(head) = child; \
578 if (child) \
[all...] |
| /development/scripts/ |
| native_heapdump_viewer.py | 367 child = stack[0]
368 if not (child.addr in self.children):
369 self.children[child.addr] = child
370 self.children[child.addr].addStack(size, num_allocs, stack[1:])
382 for child in children:
383 Display(resolved_addrs, indent + " ", total, node.size, child)
407 for child in children:
408 label_count = DisplayHtml(verbose, resolved_addrs, total, child, "", label_count)
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_minidom.py | 242 child = dom.appendChild(dom.createElement("abc"))
244 child.setAttribute("def", "ghi")
245 self.confirm(child.getAttribute("def") == "ghi")
246 self.confirm(child.attributes["def"].value == "ghi")
248 child.setAttribute("jkl", "mno")
249 self.confirm(child.getAttribute("jkl") == "mno")
250 self.confirm(child.attributes["jkl"].value == "mno")
252 self.confirm(len(child.attributes) == 2)
254 child.setAttribute("def", "newval")
255 self.confirm(child.getAttribute("def") == "newval")
[all...] |
| /external/ltp/utils/ffsb-6.0-rc2/ |
| rbt.c | 71 /* Return the maximal child depth + 1 (the current node) */
112 /* If there is a right child, the successor is the
114 * child.
145 /* If there is a left child, the predecessor is the
147 * child.
323 * child of the current node
335 * child of the current node
386 * is as the left child of the current minimal leaf
392 * order In case given node has no right child, place
393 * the new node as its right child. Otherwise, plac
489 rb_node *child = NULL; local
[all...] |
