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

<<11121314151617181920>>

  /external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
TreeVisitor.cs 56 * the child list of this node (their parent). Return result of
70 object child = adaptor.GetChild( t, i );
71 Visit( child, action );
  /external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/
TreeVisitor.java 45 * If a child visit yields a new child, it can update its
46 * parent's child list or just return the new child. The
47 * child update code works even if the child visit alters its parent
59 Object child = adaptor.getChild(t, i); local
60 Object visitResult = visit(child, action);
62 if ( visitResult != childAfterVisit ) { // result & child differ?
  /external/antlr/runtime/JavaScript/src/org/antlr/runtime/tree/
BaseTreeAdaptor.js 43 // ensure new subtree root has parent/child index set
47 i, child, newSubTree;
49 child = this.getChild(t, i);
50 newSubTree = this.dupTree(child, t);
56 /** Add a child to the tree t. If child is a flat tree (a list), make all
57 * in list children of t. Warning: if t has no children, but child does
58 * and child isNil then you can decide it is ok to move children to t via
59 * t.children = child.children; i.e., without copying the array. Just
63 addChild: function(t, child) {
    [all...]
  /external/droiddriver/src/io/appium/droiddriver/finders/
MatchFinder.java 51 for (UiElement child : context.getChildren(UiElement.VISIBLE)) {
53 return find(child);
  /external/elfutils/libdw/
dwarf_aggregate_size.c 65 Dwarf_Die child;
66 if (INTUSE(dwarf_child) (die, &child) != 0)
74 switch (INTUSE(dwarf_tag) (&child))
78 if (INTUSE(dwarf_attr_integrate) (&child, DW_AT_count,
89 (&child, DW_AT_upper_bound,
94 if (INTUSE(dwarf_attr_integrate) (&child, DW_AT_lower_bound,
115 /* We have to find the DW_TAG_enumerator child with the
145 while (INTUSE(dwarf_siblingof) (&child, &child) == 0);
  /external/grpc-grpc/src/core/lib/json/
json.h 35 struct grpc_json* child; member in struct:grpc_json
80 /* Links the child json object into the parent's json tree. If the parent
81 * already has children, then passing in the most recently added child as the
85 grpc_json* grpc_json_link_child(grpc_json* parent, grpc_json* child,
88 /* Creates a child json object into the parent's json tree then links it in
94 /* Creates a child json string object from the integer num, then links the
  /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/
CommentsInserter.java 76 * This method try to attributes the nodes received to child of the node. It
88 // 1) Inside one of the child, then it is the child that have to
90 // 2) If they are not inside a child they could be preceeding nothing, a
91 // comment or a child
92 // if they preceed a child they are assigned to it, otherweise they
98 for (Node child : children) {
101 if (PositionUtils.nodeContains(child, c,
107 insertComments(child, commentsInsideChild);
115 for (Node child : children)
    [all...]
  /external/linux-kselftest/tools/testing/selftests/powerpc/pmu/ebb/
fork_cleanup_test.c 20 * Test that a fork clears the PMU state of the child. eg. BESCR/EBBHR/EBBRR
21 * are cleared, and MMCR0_PMCC is reset, preventing the child from accessing
27 static int child(void) function
67 exit(child());
69 /* Child does the actual testing */
  /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_create/
14-1.c 112 pthread_t child; local
130 ret = pthread_create(&child, &scenarii[sc].ta, threaded, NULL);
161 SAFE_PFUNC(pthread_join(child, NULL));
171 pid_t child; local
179 child = SAFE_FUNC(fork());
180 if (child == 0) {
195 ret = waitpid(child, &status, 0);
196 if (ret != child)
200 FAILED("Child exited abnormally");
204 FAILED("An error occurred in child");
    [all...]
  /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_getschedparam/
1-3.c 118 pthread_t child; local
159 ret = pthread_create(&child, &ta, threaded, &bar);
165 check_param(child, SCHED_RR, sp.sched_priority);
179 ret = pthread_setschedparam(child, SCHED_FIFO, &sp);
191 check_param(child, SCHED_FIFO, sp.sched_priority);
205 ret = pthread_setschedprio(child, sp.sched_priority);
217 check_param(child, SCHED_FIFO, sched_get_priority_max(SCHED_FIFO));
225 pthread_join(child, NULL);
  /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/sigaction/templates/
template_16-1.in 24 * -> create a child thread
25 * -> child registers a handler for %%MYSIG%% with SA_RESTART, then waits for the semaphore
26 * -> parent kills the child with %%MYSIG%%, then post the semaphore.
128 pthread_t child;
162 /* Create the child thread */
163 ret = pthread_create( &child, NULL, threaded, NULL );
167 UNRESOLVED( ret, "Failed to create a child thread" );
170 /* Let the child thread enter the wait routine...
171 we use sched_yield as there is no certain way to test that the child
179 /* Ok, now kill the child */
    [all...]
  /external/mesa3d/src/compiler/nir/
nir_opt_cse.c 54 nir_block *child = block->dom_children[i]; local
55 progress |= cse_block(child, instr_set);
  /external/mesa3d/src/gallium/drivers/swr/rasterizer/common/
rdtsc_buckets.cpp 122 for (const BUCKET& child : bucket.children)
124 if (child.count)
126 PrintBucket(f, level + 1, threadCycles, bucket.elapsed, child);
140 for (const BUCKET& child : root.children)
142 totalCycles += child.elapsed;
145 for (const BUCKET& child : root.children)
147 if (child.count)
149 PrintBucket(f, 0, totalCycles, totalCycles, child);
  /external/perfetto/include/perfetto/base/
lookup_set.h 48 bool Remove(const T& child) { return set_.erase(child); }
  /external/protobuf/src/google/protobuf/util/internal/
default_value_objectwriter.cc 208 Node* child = children_[i]; local
209 if (child->name() == name) {
210 return child;
250 Node* child = children_[i]; local
251 child->WriteTo(ow);
258 // the type of the child node.
297 // Creates a map of child nodes to speed up lookup.
319 // If the child field has already been set, we just add it to the new list
346 // the type of the child node.
359 // If oneof_index() != 0, the child field is part of a "oneof", which mean
471 Node* child = current_->FindChild(name); local
517 Node* child = current_->FindChild(name); local
574 Node* child = current_->FindChild(name); local
    [all...]
  /external/robolectric-shadows/shadows/framework/src/main/java/org/robolectric/shadows/
ShadowViewAnimator.java 23 View child = ((ViewGroup) realView).getChildAt(i); local
24 child.setVisibility(i == whichChild ? View.VISIBLE : View.GONE);
  /external/skia/src/sksl/lex/
RegexNode.cpp 20 for (const RegexNode& child : fChildren) {
21 if (child.fKind == kChar_Kind) {
22 while (chars.size() <= (size_t) child.fPayload.fChar) {
25 chars[child.fPayload.fChar] = true;
27 SkASSERT(child.fKind == kRange_Kind);
28 while (chars.size() <= (size_t) child.fChildren[1].fPayload.fChar) {
31 for (char c = child.fChildren[0].fPayload.fChar;
32 c <= child.fChildren[1].fPayload.fChar;
  /external/skqp/modules/sksg/src/
SkSGClipEffect.cpp 16 ClipEffect::ClipEffect(sk_sp<RenderNode> child, sk_sp<GeometryNode> clip, bool aa)
17 : INHERITED(std::move(child))
  /external/skqp/src/sksl/lex/
RegexNode.cpp 20 for (const RegexNode& child : fChildren) {
21 if (child.fKind == kChar_Kind) {
22 while (chars.size() <= (size_t) child.fPayload.fChar) {
25 chars[child.fPayload.fChar] = true;
27 SkASSERT(child.fKind == kRange_Kind);
28 while (chars.size() <= (size_t) child.fChildren[1].fPayload.fChar) {
31 for (char c = child.fChildren[0].fPayload.fChar;
32 c <= child.fChildren[1].fPayload.fChar;
  /external/strace/tests/
clone_parent.c 41 child(void *const arg) function
57 const pid_t pid = clone(child, tail_alloc(child_stack_size),
  /external/strace/tests-m32/
clone_parent.c 41 child(void *const arg) function
57 const pid_t pid = clone(child, tail_alloc(child_stack_size),
  /external/strace/tests-mx32/
clone_parent.c 41 child(void *const arg) function
57 const pid_t pid = clone(child, tail_alloc(child_stack_size),
  /external/webrtc/webrtc/base/
taskparent.h 48 void OnChildStopped(Task *child);
49 void AddChild(Task *child);
  /external/wpa_supplicant_8/src/utils/
xml-utils.h 30 xml_node_t *child);
62 #define xml_node_for_each_child(ctx, child, parent) \
63 for (child = xml_node_first_child(ctx, parent); \
64 child; \
65 child = xml_node_next_sibling(ctx, child))
72 #define xml_node_for_each_check(ctx, child) \
73 if (!xml_node_is_element(ctx, child)) \
  /external/yapf/yapf/yapflib/
continuation_splicer.py 46 for index, child in enumerate(node.children[:]):
47 continuation_node = RecSplicer(child)

Completed in 3180 milliseconds

<<11121314151617181920>>