HomeSort by relevance Sort by last modified time
    Searched refs:child (Results 601 - 625 of 1841) sorted by null

<<21222324252627282930>>

  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/
ast.c 69 /* add a child node to the current sibling list */
126 * example: print tree in child-sibling LISP-format (AST has token field)
258 register AST *child, *sibling=NULL, *tail=NULL /* MR20 */, *w; local
271 child = va_arg(ap, AST *);
272 while ( child != NULL )
274 for (w=child; w->right!=NULL; w=w->right) {;} /* find end of child */
275 if ( sibling == NULL ) {sibling = child; tail = w;}
276 else {tail->right = child; tail = w;}
277 child = va_arg(ap, AST *);
    [all...]
  /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
BaseTreeAdaptor.cs 96 // ensure new subtree root has parent/child index set
101 object child = GetChild(t, i);
102 object newSubTree = DupTree(child, t);
109 * Add a child to the tree t. If child is a flat tree (a list), make all
110 * in list children of t. Warning: if t has no children, but child does
111 * and child isNil then you can decide it is ok to move children to t via
112 * t.children = child.children; i.e., without copying the array. Just
117 public virtual void AddChild(object t, object child) {
118 if (t != null && child != null)
    [all...]
  /external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/
BaseTreeAdaptor.java 90 // ensure new subtree root has parent/child index set
95 Object child = getChild(t, i); local
96 Object newSubTree = dupTree(child, t);
102 /** Add a child to the tree t. If child is a flat tree (a list), make all
103 * in list children of t. Warning: if t has no children, but child does
104 * and child isNil then you can decide it is ok to move children to t via
105 * t.children = child.children; i.e., without copying the array. Just
110 public void addChild(Object t, Object child) {
111 if ( t!=null && child!=null )
    [all...]
  /external/emma/core/java12/com/vladium/util/
IPathEnumerator.java 170 final File child = dir != null ? new File (dir, childName) : new File (childName); local
175 handler.handleDirStart (currentPathDir, child);
176 if (trace1) m_log.trace1 ("enumeratePathDir", "recursing into [" + child.getName () + "] ...");
177 enumeratePathDir (child.getPath ());
178 handler.handleDirEnd (currentPathDir, child);
186 // handler.handleArchiveStart (currentPathDir, child);
187 // enumeratePathArchive (child.getPath ());
188 // handler.handleArchiveEnd (currentPathDir, child);
192 if (trace1) m_log.trace1 ("enumeratePathDir", "processing file [" + child.getName () + "] ...");
193 handler.handleFile (currentPathDir, child);
    [all...]
  /external/libchrome/mojo/core/
shared_buffer_unittest.cc 107 // another child process.
114 // Send a copy of the buffer to the parent and the other child.
124 // another child process (running CreateAndPassBuffer).
128 // Receive a shared buffer from the other child.
146 // Send one end of the pipe to each child. The first child will create
147 // and pass a buffer to the second child and back to us. The second child
152 // Receive the buffer back from the first child.
160 // The second child should have written this message
    [all...]
  /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_detach/
4-3.c 153 pthread_t child; local
175 ret = pthread_create(&child, &scenarii[sc].ta, threaded, NULL);
282 pid_t child; local
293 child = fork();
294 if (child == 0) {
309 ret = waitpid(child, &status, 0);
310 if (ret != child)
315 FAILED("Child exited abnormally");
320 FAILED("An error occured in child");
325 output("Test spawned %d child processes.\n", child_count)
    [all...]
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/constructor/
BeanConstructorTest.java 199 Child1 child = parent.getChild(); local
200 assertEquals(new Integer(25), child.getCode());
219 private ExceptionChild child; field in class:BeanConstructorTest.ExceptionParent
230 return child;
233 public void setChild(ExceptionChild child) {
234 this.child = child;
  /external/u-boot/drivers/power/pmic/
pmic-uclass.c 24 struct udevice *child; local
38 debug("* Found child node: '%s'\n", node_name);
40 child = NULL;
61 debug(" - found child driver: '%s'\n", drv->name);
64 0, node, &child);
66 debug(" - child binding error: %d\n", ret);
70 debug(" - bound child device: '%s'\n", child->name);
72 child->driver_data = trailing_strtol(node_name);
74 debug(" - set 'child->driver_data': %lu\n"
    [all...]
  /external/u-boot/scripts/kconfig/
kxgettext.c 173 struct menu *child; local
184 for (child = menu->list; child != NULL; child = child->next)
185 if (child->prompt != NULL)
186 menu_build_message_list(child);
  /external/webrtc/webrtc/libjingle/xmpp/
xmppengineimpl_iq.cc 208 for (const XmlChild * child = element_original->FirstChild();
209 child;
210 child = child->NextChild()) {
211 if (child->IsText()) {
212 error_element.AddText(child->AsText()->Text());
214 error_element.AddElement(new XmlElement(*(child->AsElement())));
  /external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/tree/
BaseTree.as 31 * instead of the child-sibling approach in v2. A flat tree (a list) is
76 /** Add t as child of this node.
78 * Warning: if t has no children, but child does
79 * and child isNil then this routine moves children to t via
80 * t.children = child.children; i.e., without copying the array.
89 throw new Error("attempt to add child list to itself");
98 // handle double-link stuff for each child of nil root
111 else { // child is not nil (don't care about children)
134 throw new Error("Can't set single child to a list");
149 // walk rest and decrement their child indexe
    [all...]
BaseTreeAdaptor.as 57 // ensure new subtree root has parent/child index set
62 var child:Object = getChild(t, i);
63 var newSubTree:Object = dupTreeWithParent(child, t);
69 /** Add a child to the tree t. If child is a flat tree (a list), make all
70 * in list children of t. Warning: if t has no children, but child does
71 * and child isNil then you can decide it is ok to move children to t via
72 * t.children = child.children; i.e., without copying the array. Just
76 public function addChild(t:Object, child:Object):void {
77 if ( t!=null && child!=null )
    [all...]
  /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/op/
ScopeTest.java 53 Scope child = root.withSubScope("child"); local
54 assertEquals("child/add", child.makeOpName("add"));
55 assertEquals("child/add_1", child.makeOpName("add"));
56 assertEquals("child/mul", child.makeOpName("mul"));
58 Scope child_1 = root.withSubScope("child");
80 Scope child = root.withSubScope("child") local
144 Scope child = root.withSubScope("child"); local
    [all...]
  /bootable/recovery/
fsck_unshare_blocks.cpp 91 pid_t child; local
93 if (posix_spawn(&child, argv[0], nullptr, nullptr, argv.data(), env)) {
99 int ret = TEMP_FAILURE_RETRY(waitpid(child, &status, 0));
  /cts/tests/core/runner/src/com/android/cts/core/runner/
ExpectationBasedFilter.java 132 Description child = children.get(0); local
133 String methodName = child.getMethodName();
135 return child;
  /cts/tests/core/runner-axt/src/com/android/cts/core/runner/
ExpectationBasedFilter.java 132 Description child = children.get(0); local
133 String methodName = child.getMethodName();
135 return child;
  /cts/tests/tests/uirendering/src/android/uirendering/cts/testclasses/
LayerTests.java 124 View child = new View(view.getContext());
125 child.setLayerType(View.LAYER_TYPE_HARDWARE, null);
126 child.setAlpha(0.0f);
128 child.setBackgroundColor(Color.RED);
129 root.addView(child, new FrameLayout.LayoutParams(TEST_WIDTH, TEST_HEIGHT,
201 final View child = new View(view.getContext());
202 child.setBackgroundColor(Color.BLUE);
203 child.setTranslationX(10);
204 child.setLayoutParams(
206 child.setLayerType(View.LAYER_TYPE_HARDWARE, null)
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/fixes/
fix_next.py 86 for child in assign.children:
87 if child.type == token.EQUAL:
89 elif is_subtree(child, node):
  /external/boringssl/src/crypto/bytestring/
cbs.c 476 CBS child; local
478 if (!CBS_get_optional_asn1(cbs, &child, &present, tag)) {
483 if (!CBS_get_asn1(&child, out, CBS_ASN1_OCTETSTRING) ||
484 CBS_len(&child) != 0) {
498 CBS child; local
500 if (!CBS_get_optional_asn1(cbs, &child, &present, tag)) {
504 if (!CBS_get_asn1_uint64(&child, out) ||
505 CBS_len(&child) != 0) {
516 CBS child, child2; local
518 if (!CBS_get_optional_asn1(cbs, &child, &present, tag))
    [all...]
  /external/chromium-trace/catapult/devil/devil/android/sdk/
shared_prefs.py 151 for child in self._elem:
152 assert child.tag == 'string'
153 value.append(child.text)
158 for child in list(self._elem):
159 self._elem.remove(child)
393 for child in self.xml:
394 pref = _PREF_TYPES[child.tag](child)
395 d[child.get('name')] = pref.get()
414 for child in self.xml
    [all...]
  /external/dagger2/compiler/src/it/functional-tests/src/test/java/test/membersinject/
MembersInjectTest.java 83 NonRequestedChild child = new NonRequestedChild(); local
92 injector.injectMembers(child);
93 assertThat(child.t).isEqualTo("field!");
  /external/deqp/framework/delibs/depool/
deMemPool.c 91 int numChildren; /*!< Number of child pools. */
92 deMemPool* firstChild; /*!< Pointer to first child pool in linked list. */
295 * Frees all the memory allocated from the pool. Also destroyed any child
376 * \return The number of (immediate) child pools a memory pool has.
386 * \param recurse Is operation recursive to child pools?
387 * \return The number of bytes allocated by the pool (including child pools
400 deMemPool* child; local
401 for (child = pool->firstChild; child; child = child->nextPool
418 deMemPool* child; local
    [all...]
  /external/dtc/
livetree.c 103 struct node *child; local
110 for_each_child(new, child) {
111 child->parent = new;
183 /* Move the override child nodes into the primary node. If
186 /* Pop the child node off the list */
207 /* if no collision occurred, add child to the old node. */
281 void add_child(struct node *parent, struct node *child)
285 child->next_sibling = NULL;
286 child->parent = parent;
292 *p = child;
311 struct node *child; local
477 struct node *child; local
489 struct node *child; local
515 struct node *child, *node; local
535 struct node *child, *node; local
    [all...]
  /external/google-breakpad/src/testing/gtest/test/
gtest_help_test.py 94 child = gtest_test_utils.Subprocess(command)
95 return child.exit_code, child.output
  /external/googletest/googletest/test/
gtest_help_test.py 92 child = gtest_test_utils.Subprocess(command)
93 return child.exit_code, child.output

Completed in 1586 milliseconds

<<21222324252627282930>>