Home
last modified time | relevance | path

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

12345678910>>...40

/third_party/libuv/src/
H A Dheap-inl.h72 /* Swap parent with child. Child moves closer to the root, parent moves away. */
75 struct heap_node* child) { in heap_node_swap()
80 *parent = *child; in heap_node_swap()
81 *child = t; in heap_node_swap()
83 parent->parent = child; in heap_node_swap()
84 if (child->left == child) { in heap_node_swap()
85 child->left = parent; in heap_node_swap()
86 sibling = child->right; in heap_node_swap()
88 child in heap_node_swap()
73 heap_node_swap(struct heap* heap, struct heap_node* parent, struct heap_node* child) heap_node_swap() argument
111 struct heap_node** child; HEAP_EXPORT() local
156 struct heap_node* child; HEAP_EXPORT() local
[all...]
/third_party/node/deps/uv/src/
H A Dheap-inl.h71 /* Swap parent with child. Child moves closer to the root, parent moves away. */
74 struct heap_node* child) { in heap_node_swap()
79 *parent = *child; in heap_node_swap()
80 *child = t; in heap_node_swap()
82 parent->parent = child; in heap_node_swap()
83 if (child->left == child) { in heap_node_swap()
84 child->left = parent; in heap_node_swap()
85 sibling = child->right; in heap_node_swap()
87 child in heap_node_swap()
72 heap_node_swap(struct heap* heap, struct heap_node* parent, struct heap_node* child) heap_node_swap() argument
110 struct heap_node** child; HEAP_EXPORT() local
155 struct heap_node* child; HEAP_EXPORT() local
[all...]
/third_party/rust/crates/nix/test/sys/
H A Dtest_wait.rs13 // Safe: The child only calls `pause` and/or `_exit`, which are async-signal-safe. in test_wait_signal()
19 Parent { child } => { in test_wait_signal()
20 kill(child, Some(SIGKILL)).expect("Error: Kill Failed"); in test_wait_signal()
22 waitpid(child, None), in test_wait_signal()
23 Ok(WaitStatus::Signaled(child, SIGKILL, false)) in test_wait_signal()
40 // Safe: The child only calls `pause` and/or `_exit`, which are async-signal-safe. in test_waitid_signal()
46 Parent { child } => { in test_waitid_signal()
47 kill(child, Some(SIGKILL)).expect("Error: Kill Failed"); in test_waitid_signal()
49 waitid(Id::Pid(child), WaitPidFlag::WEXITED), in test_waitid_signal()
50 Ok(WaitStatus::Signaled(child, SIGKIL in test_waitid_signal()
[all...]
H A Dtest_ptrace.rs95 // As recommended by ptrace(2), raise SIGTRAP to pause the child in test_ptrace_cont()
101 Parent { child } => { in test_ptrace_cont()
103 waitpid(child, None), in test_ptrace_cont()
104 Ok(WaitStatus::Stopped(child, Signal::SIGTRAP)) in test_ptrace_cont()
106 ptrace::cont(child, None).unwrap(); in test_ptrace_cont()
108 waitpid(child, None), in test_ptrace_cont()
109 Ok(WaitStatus::Stopped(child, Signal::SIGTRAP)) in test_ptrace_cont()
111 ptrace::cont(child, Some(Signal::SIGKILL)).unwrap(); in test_ptrace_cont()
112 match waitpid(child, None) { in test_ptrace_cont()
114 if pid == child in test_ptrace_cont()
[all...]
/third_party/ffmpeg/libavutil/
H A Dtree.c27 struct AVTreeNode *child[2]; member
47 return av_tree_find(t->child[(v >> 31) ^ 1], key, cmp, next); in av_tree_find()
50 av_tree_find(t->child[0], key, cmp, next); in av_tree_find()
51 av_tree_find(t->child[1], key, cmp, next); in av_tree_find()
69 else if (t->child[0] || t->child[1]) { in av_tree_insert()
70 int i = !t->child[0]; in av_tree_insert()
72 av_tree_find(t->child[i], key, cmp, next_elem); in av_tree_insert()
81 ret = av_tree_insert(&t->child[v >> 31], key, cmp, next); in av_tree_insert()
84 AVTreeNode **child in av_tree_insert() local
[all...]
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
H A Ddep-valid.js3 // Only relies on child.resolved, which MAY come from
12 const depValid = (child, requested, requestor) => {
23 requested = npa.resolve(child.name, requested || '*', fromPath(requestor, requestor.edgesOut.get(child.name)))
25 // Not invalid because the child doesn't match, but because
28 er.dependency = child.name
39 er.dependency = child.name
53 return semver.satisfies(child.version, requested.fetchSpec, true)
56 return linkValid(child, requested, requestor)
59 return tarballValid(child, requeste
[all...]
/third_party/ltp/testcases/kernel/controllers/cpuset/cpuset_hierarchy_test/
H A Dcpuset_hierarchy_test.sh46 echo > "$CPUSET/father/child/cpuset.cpus" || return 1
49 cpuset_log "child cpuset.cpus $(cat "$CPUSET/father/child/cpuset.cpus")"
52 test -z "$(cat "$CPUSET/father/child/cpuset.cpus")" || return 1
58 echo 0 > "$CPUSET/father/child/cpuset.cpus" 2> /dev/null && return 1
61 cpuset_log "child cpuset.cpus $(cat "$CPUSET/father/child/cpuset.cpus")"
64 test -z "$(cat "$CPUSET/father/child/cpuset.cpus")" || return 1
70 echo > "$CPUSET/father/child/cpuset.cpus" || return 1
73 cpuset_log "child cpuse
[all...]
/third_party/node/test/parallel/
H A Dtest-runner-cli.js14 const child = spawnSync(process.execPath, args);
16 assert.strictEqual(child.status, 1);
17 assert.strictEqual(child.signal, null);
18 assert.strictEqual(child.stdout.toString(), '');
19 assert.match(child.stderr.toString(), /^Could not find/);
26 const child = spawnSync(process.execPath, args, { cwd: join(testFixtures, 'default-behavior') });
28 assert.strictEqual(child.status, 1);
29 assert.strictEqual(child.signal, null);
30 assert.strictEqual(child.stderr.toString(), '');
31 const stdout = child
[all...]
H A Dtest-cli-eval.js32 const child = require('child_process');
43 child.exec(`${nodejs} --eval 42`, common.mustSucceed((stdout, stderr) => {
49 child.exec(`${nodejs} --eval "console.error(42)"`,
59 child.exec(`${cmd}42`, common.mustSucceed((stdout, stderr) => {
64 child.exec(`${cmd} '[]'`, common.mustSucceed((stdout, stderr) => {
76 child.exec(`${nodejs} --eval "require('${filename}')"`,
86 child.exec(`${nodejs} --print "os.platform()"`,
93 child.exec(`${nodejs} --eval "require('./test/parallel/test-cli-eval.js')"`,
103 child.exec(`${nodejs} -e`, common.mustCall((err, stdout, stderr) => {
111 child
[all...]
/third_party/googletest/googletest/test/
H A Dgtest_xml_test_utils.py57 * It has an equivalent set of child nodes (including elements and
96 'number of child elements differ in element ' + actual_node.tagName)
97 for child_id, child in expected_children.items():
101 self.AssertEquivalentNodes(child, actual_children[child_id])
114 Fetches all of the child nodes of element, a DOM Element object.
123 four is encountered, if two child elements with the same identifying
128 for child in element.childNodes:
129 if child.nodeType == Node.ELEMENT_NODE:
130 if child.tagName == 'properties':
131 self.assert_(child
[all...]
/third_party/node/lib/internal/
H A Dsocket_list.js9 constructor(child, key) {
12 this.child = child;
13 child.once('exit', () => this.emit('exit', this));
19 if (!this.child.connected) return onclose();
20 this.child._send(msg, undefined, swallowErrors);
23 self.child.removeListener('internalMessage', onreply);
29 self.child.removeListener('disconnect', onclose);
30 self.child.removeListener('internalMessage', onreply);
35 this.child
[all...]
/third_party/mesa3d/src/util/
H A Ddag.c28 append_edge(struct dag_node *parent, struct dag_node *child, uintptr_t data) in append_edge() argument
30 /* Remove the child as a DAG head. */ in append_edge()
31 list_delinit(&child->link); in append_edge()
34 .child = child, in append_edge()
39 child->parent_count++; in append_edge()
43 * Adds a directed edge from the parent node to the child.
46 * list may contain multiple edges to the same child with different data.
49 dag_add_edge(struct dag_node *parent, struct dag_node *child, uintptr_t data) in dag_add_edge() argument
52 if (edge->child in dag_add_edge()
68 dag_add_edge_max_data(struct dag_node *parent, struct dag_node *child, uintptr_t data) dag_add_edge_max_data() argument
93 struct dag_node *child = edge->child; dag_remove_edge() local
[all...]
/third_party/skia/modules/sksg/include/
H A DSkSGGeometryEffect.h39 SkPath fPath; // transformed child cache.
45 * Apply a trim effect to the child geometry.
49 static sk_sp<TrimEffect> Make(sk_sp<GeometryNode> child) { in Make() argument
50 return child ? sk_sp<TrimEffect>(new TrimEffect(std::move(child))) : nullptr; in Make()
58 explicit TrimEffect(sk_sp<GeometryNode> child) : INHERITED(std::move(child)) {} in TrimEffect() argument
74 static sk_sp<GeometryTransform> Make(sk_sp<GeometryNode> child, sk_sp<Transform> transform) { in Make() argument
75 return child && transform in Make()
76 ? sk_sp<GeometryTransform>(new GeometryTransform(std::move(child), in Make()
104 Make(sk_sp<GeometryNode> child) Make() argument
112 DashEffect(sk_sp<GeometryNode> child) DashEffect() argument
127 Make(sk_sp<GeometryNode> child) Make() argument
134 RoundEffect(sk_sp<GeometryNode> child) RoundEffect() argument
148 Make(sk_sp<GeometryNode> child) Make() argument
157 OffsetEffect(sk_sp<GeometryNode> child) OffsetEffect() argument
[all...]
/third_party/elfutils/libdw/
H A Dlibdw_visit_scopes.c76 struct Dwarf_Die_Chain child; member
103 state.child.parent = root; in __libdw_visit_scopes()
105 if ((ret = INTUSE(dwarf_child) (&root->die, &state.child.die)) != 0) in __libdw_visit_scopes()
120 children in place before moving to the next real child. */ in walk_children()
121 while (INTUSE(dwarf_tag) (&state->child.die) == DW_TAG_imported_unit) in walk_children()
123 Dwarf_Die orig_child_die = state->child.die; in walk_children()
125 Dwarf_Attribute *attr = INTUSE(dwarf_attr) (&state->child.die, in walk_children()
130 if (INTUSE(dwarf_formref_die) (attr, &state->child.die) != NULL in walk_children()
131 && INTUSE(dwarf_tag) (&state->child.die) != DW_TAG_compile_unit in walk_children()
132 && (INTUSE(dwarf_child) (&state->child in walk_children()
[all...]
/third_party/node/test/sequential/
H A Dtest-repl-timeout-throw.js7 const child = spawn(process.execPath, [ '-i' ], {
12 child.stdout.setEncoding('utf8');
13 child.stdout.on('data', function(c) {
17 child.stdin.end();
20 child.stdin.write = function(original) {
23 return original.call(child.stdin, c);
25 }(child.stdin.write);
27 child.stdout.once('data', function() {
28 child.stdin.write('let throws = 0;');
29 child
[all...]
/third_party/ltp/testcases/kernel/controllers/freezer/
H A Dvfork.c55 pid_t child = -1; variable
80 if (0 < child && kill(child, 0) == 0) { in kill_child()
82 if (ptrace(PTRACE_KILL, child, NULL, NULL) < 0) { in kill_child()
84 "ptrace(PTRACE_KILL, %d, ..) failed", child); in kill_child()
86 (void)waitpid(child, NULL, WNOHANG); /* Zombie children are bad. */ in kill_child()
99 pid_t child; in do_vfork() local
102 child = vfork(); in do_vfork()
103 if (child == 0) in do_vfork()
105 else if (child > in do_vfork()
230 do_trace(pid_t child, int num_children) do_trace() argument
[all...]
/third_party/musl/libc-test/src/functionalext/supplement/linux/
H A Dgetprocpid.c49 pid_t child = fork(); in getprocpid_0200() local
50 if (child == 0) { in getprocpid_0200()
57 EXPECT_EQ("getprocpid_0200", child > 0, true); in getprocpid_0200()
60 int ret = waitpid(child, &status, 0); in getprocpid_0200()
61 EXPECT_EQ("getprocpid_0200", ret, child); in getprocpid_0200()
89 pid_t child = clone(child_func, NULL, CLONE_NEWPID | SIGCHLD, &pid1); in getprocpid_0300() local
90 EXPECT_EQ("getprocpid_0300", child > 0, true); in getprocpid_0300()
93 int ret = waitpid(child, &status, 0); in getprocpid_0300()
94 EXPECT_EQ("getprocpid_0300", ret, child); in getprocpid_0300()
143 pid_t child in getproctid_0200() local
184 pid_t child = clone(child_func_tid, NULL, CLONE_NEWPID | SIGCHLD, &pid1); getproctid_0300() local
[all...]
/third_party/ltp/testcases/misc/math/float/trigo/
H A Dgentrigo.c70 pid_t child; in main() local
81 child = create_file(funct, 0); in main()
82 waitpid(child, NULL, 0); in main()
85 child = create_file(funct, 0); in main()
86 waitpid(child, NULL, 0); in main()
89 child = create_file(funct, 0); in main()
90 waitpid(child, NULL, 0); in main()
93 child = create_file(funct, 0); in main()
94 waitpid(child, NULL, 0); in main()
97 child in main()
[all...]
/third_party/ltp/testcases/misc/math/float/exp_log/
H A Dgenexp_log.c69 pid_t child; in main() local
80 child = create_file(funct, 0); in main()
81 waitpid(child, NULL, 0); in main()
84 child = create_file(funct, 0); in main()
85 waitpid(child, NULL, 0); in main()
88 child = create_file(funct, 0); in main()
89 waitpid(child, NULL, 0); in main()
92 child = create_file(funct, 0); in main()
93 waitpid(child, NULL, 0); in main()
96 child in main()
[all...]
/third_party/ltp/libs/libltpsigwait/
H A Dsigwait.c17 pid_t child; in test_empty_set() local
21 /* Run a child that will wake us up */ in test_empty_set()
22 child = create_sig_proc(signo, INT_MAX, 100000); in test_empty_set()
34 SAFE_KILL(child, SIGTERM); in test_empty_set()
42 pid_t child; in test_timeout() local
51 /* Run a child that will wake us up */ in test_timeout()
52 child = create_sig_proc(signo, INT_MAX, 100000); in test_timeout()
64 SAFE_KILL(child, SIGTERM); in test_timeout()
76 pid_t child; in test_unmasked_matching() local
81 /* Run a child tha in test_unmasked_matching()
103 pid_t child; test_unmasked_matching_noinfo() local
126 pid_t child; test_masked_matching() local
174 pid_t child[2]; test_masked_matching_rt() local
239 pid_t child; test_masked_matching_noinfo() local
281 pid_t child; test_bad_address() local
[all...]
/third_party/rust/crates/bindgen/csmith-fuzzing/
H A Dpredicate.py123 def exit_1(msg, child=None):
126 if child:
127 stdout = decode(child.stdout)
132 stderr = decode(child.stderr)
208 child = run(command, stderr=subprocess.PIPE, stdout=subprocess.PIPE)
212 if not (contains(pattern, decode(child.stdout).splitlines()) or
213 contains(pattern, decode(child.stderr).splitlines())):
214 exit_1("Error: did not find '{}' in `bindgen`'s output".format(args.bindgen_grep), child)
216 if args.expect_bindgen_fail and child.returncode == 0:
217 exit_1("Error: expected running `bindgen` to fail, but it didn't", child)
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dscalar_analysis_simplification.cpp42 // child.
71 // add node with each term as a child. For instance a large graph built from, X
91 // which are used to flatten the graph. |child| is the node currenty being
95 void GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child,
219 for (SENode* child : simplified_polynomial->GetChildren()) { in Simplify()
220 if (child->GetType() == SENode::RecurrentAddExpr) { in Simplify()
221 recurrent_expr = child->AsSERecurrentNode(); in Simplify()
244 SENode* child, in GatherAccumulatorsFromChildNodes()
248 if (child->GetType() == SENode::Constant) { in GatherAccumulatorsFromChildNodes()
251 child in GatherAccumulatorsFromChildNodes()
243 GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child, bool negation) GatherAccumulatorsFromChildNodes() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dscalar_analysis_simplification.cpp42 // child.
71 // add node with each term as a child. For instance a large graph built from, X
91 // which are used to flatten the graph. |child| is the node currenty being
95 void GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child,
219 for (SENode* child : simplified_polynomial->GetChildren()) { in Simplify()
220 if (child->GetType() == SENode::RecurrentAddExpr) { in Simplify()
221 recurrent_expr = child->AsSERecurrentNode(); in Simplify()
244 SENode* child, in GatherAccumulatorsFromChildNodes()
248 if (child->GetType() == SENode::Constant) { in GatherAccumulatorsFromChildNodes()
251 child in GatherAccumulatorsFromChildNodes()
243 GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child, bool negation) GatherAccumulatorsFromChildNodes() argument
[all...]
/third_party/spirv-tools/source/opt/
H A Dscalar_analysis_simplification.cpp41 // child.
70 // add node with each term as a child. For instance a large graph built from, X
90 // which are used to flatten the graph. |child| is the node currently being
94 void GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child,
218 for (SENode* child : simplified_polynomial->GetChildren()) { in Simplify()
219 if (child->GetType() == SENode::RecurrentAddExpr) { in Simplify()
220 recurrent_expr = child->AsSERecurrentNode(); in Simplify()
243 SENode* child, in GatherAccumulatorsFromChildNodes()
247 if (child->GetType() == SENode::Constant) { in GatherAccumulatorsFromChildNodes()
250 child in GatherAccumulatorsFromChildNodes()
242 GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child, bool negation) GatherAccumulatorsFromChildNodes() argument
[all...]
/third_party/node/src/permission/
H A Dfs_permission.h35 Node* child = children[label]; in CreateChild() local
36 if (child == nullptr) { in CreateChild()
44 for (; i < child->prefix.length(); ++i) { in CreateChild()
45 if (i > prefix_len || prefix[i] != child->prefix[i]) { in CreateChild()
46 std::string parent_prefix = child->prefix.substr(0, i); in CreateChild()
47 std::string child_prefix = child->prefix.substr(i); in CreateChild()
49 child->prefix = child_prefix; in CreateChild()
51 split_child->children[child_prefix[0]] = child; in CreateChild()
57 return child->CreateChild(prefix.substr(i)); in CreateChild()
77 auto child in NextNode() local
[all...]

Completed in 8 milliseconds

12345678910>>...40