Home
last modified time | relevance | path

Searched refs:parents (Results 1 – 25 of 159) sorted by relevance

1234567

/third_party/skia/third_party/externals/harfbuzz/src/
Dhb-repacker.hh48 parents (), in vertex_t()
55 parents.fini (); in fini()
61 hb_vector_t<unsigned> parents; member
68 return parents.length > 1; in is_shared()
73 return parents.length; in incoming_edges()
78 for (unsigned i = 0; i < parents.length; i++) in remove_parent()
80 if (parents[i] != parent_index) continue; in remove_parent()
81 parents.remove (i); in remove_parent()
88 for (unsigned i = 0; i < parents.length; i++) in remap_parents()
89 parents[i] = id_map[parents[i]]; in remap_parents()
[all …]
/third_party/mesa3d/src/intel/compiler/
Dbrw_cfg.cpp69 parents.make_empty(); in bblock_t()
77 successor->parents.push_tail(::link(mem_ctx, this, kind)); in add_successor()
85 foreach_list_typed_safe (bblock_link, parent, link, &block->parents) { in is_predecessor_of()
146 foreach_list_typed (bblock_link, link, link, &that->parents) { in combine_with()
419 foreach_list_typed_safe (bblock_link, predecessor, link, &block->parents) { in remove_block()
443 &successor->block->parents) { in remove_block()
451 foreach_list_typed (bblock_link, predecessor, link, &block->parents) { in remove_block()
454 successor->block->parents.push_tail(link(mem_ctx, in remove_block()
517 foreach_list_typed(bblock_link, link, link, &block->parents) { in dump()
545 parents(new bblock_t *[num_parents]()) in idom_tree()
[all …]
Dbrw_cfg.h124 struct exec_list parents; member
486 return parents[b->num]; in parent()
493 return parents[b->num]; in parent()
504 bblock_t **parents; member
/third_party/ltp/tools/sparse/sparse-src/
Dflow.c103 remove_bb_from_list(&old->parents, bb, 1); in rewrite_branch()
104 add_bb(&new->parents, bb); in rewrite_branch()
199 PREPARE_PTR_LIST(node->bb->parents, bb); in phi_check()
350 if (bb_list_size(target->parents) != 1) in simplify_branch_branch()
528 FOR_EACH_PTR(bb->parents, parent) { in kill_dead_stores_bb()
637 remove_bb_from_list(&child->parents, bb, 0); in kill_bb()
641 FOR_EACH_PTR(bb->parents, parent) { in kill_bb()
644 bb->parents = NULL; in kill_bb()
713 while ((parent = first_basic_block(bb->parents)) != NULL) { in rewrite_branch_bb()
737 FOR_EACH_PTR(bb->parents, tmp) { in vrfy_parents()
[all …]
Dir.c35 if (bb_list_size(insn->bb->parents) != nbr_phi_operands(insn)) { in check_phi_node()
38 info(insn->pos, "parents: %d", bb_list_size(insn->bb->parents)); in check_phi_node()
43 PREPARE_PTR_LIST(insn->bb->parents, par); in check_phi_node()
Dcse.c286 if (bb_list_size(bb1->parents) != 1) in trivial_common_parent()
288 parent = first_basic_block(bb1->parents); in trivial_common_parent()
289 if (bb_list_size(bb2->parents) != 1) in trivial_common_parent()
291 if (first_basic_block(bb2->parents) != parent) in trivial_common_parent()
/third_party/icu/icu4c/source/test/depstest/
Ddepstest.py117 def _Resolve(name, parents): argument
121 if name in parents:
123 (item_type, name, parents))
128 parents.append(name)
143 dep_item = _Resolve(dep, parents)
172 del parents[-1]
/third_party/skia/tools/mdbviz/
Dmainwindow.cpp34 SkTDArray<QTreeWidgetItem*> parents; in setupOpsTaskWidget() local
44 parents.pop(); in setupOpsTaskWidget()
47 if (parents.isEmpty()) { in setupOpsTaskWidget()
50 parents.top()->addChild(item); in setupOpsTaskWidget()
54 *parents.push() = item; in setupOpsTaskWidget()
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/
Dcheck_html_xrefs.py94 parents = find_parent_ids(elem, href) variable
95 print('{:<40} in {:<28} ({})'.format(href, parents[0], parents[1]))
/third_party/vk-gl-cts/scripts/
Dcheck_swiftshader_runtime.py342 COMP_RESULTS_DIR.mkdir(parents=True, exist_ok=True)
398 VK_GL_CTS_BUILD_DIR.mkdir(parents=True, exist_ok=True)
413 SWS_SRC_DIR.mkdir(parents=True, exist_ok=True)
436 LAYERS_SRC_DIR.mkdir(parents=True, exist_ok=True)
442 LAYERS_BUILD_DIR.mkdir(parents=True, exist_ok=True)
463 RESULT_DIR.mkdir(parents=True, exist_ok=True)
/third_party/typescript/src/debug/
Ddbg.ts253 const parents: FlowGraphNode[] = []; constant
256 parents.push(edge.source);
259 return parents;
417 const parents = getParents(node); constant
418 for (let i = 0; i < parents.length; i++) {
419 const parent = parents[i];
422 if (i < parents.length - 1) connector |= Connection.Down;
/third_party/python/PC/layout/
Dmain.py340 ns.temp.mkdir(parents=True, exist_ok=True)
347 ns.temp.mkdir(parents=True, exist_ok=True)
382 ns.zip.parent.mkdir(parents=True, exist_ok=True)
388 ns.copy.mkdir(parents=True, exist_ok=True)
414 (ns.copy / dest).parent.mkdir(parents=True, exist_ok=True)
432 (ns.temp / "Lib" / dest).parent.mkdir(parents=True, exist_ok=True)
441 (ns.copy / dest).parent.mkdir(parents=True, exist_ok=True)
471 ns.catalog.parent.mkdir(parents=True, exist_ok=True)
/third_party/node/deps/v8/tools/system-analyzer/view/map-panel/
Dmap-transitions.mjs60 let parents = map.getParents();
61 if (parents.length > 0) {
62 this._addTransitionTo(parents.pop());
63 parents.reverse().forEach((each) => this._addTransitionTo(each));
/third_party/python/PC/layout/support/
Dpip.py47 dest.mkdir(parents=True, exist_ok=False)
53 ns.temp.mkdir(parents=True, exist_ok=True)
/third_party/node/tools/lint-md/
Dlint-md.mjs8397 function factory(node, index, parents) { argument
8420 if (!test || is(node, index, parents[parents.length - 1] || undefined)) {
8421 result = toResult$A(visitor(node, parents));
8430 grandparents = parents.concat(nodeAsParent);
8473 function overload(node, parents) { argument
8474 const parent = parents[parents.length - 1];
9589 function visitor(node, parents) { argument
9592 while (++index < parents.length) {
9593 const parent = parents[index];
9607 return handler(node, parents)
[all …]
/third_party/mesa3d/src/gallium/drivers/r600/sfn/
Dsfn_instr_lds.cpp106 if (reg->parents().size() == 1) { in split()
107 for (auto& p: reg->parents()) { in split()
268 if (reg->parents().size() == 1) { in split()
269 for (auto& p: reg->parents()) { in split()
/third_party/musl/src/regex/
Dregcomp.c1217 int *parents; /* Stack of submatches the current submatch is in tre_add_tags() local
1235 parents = xmalloc(sizeof(*parents) * (tnfa->num_submatches + 1)); in tre_add_tags()
1236 if (parents == NULL) in tre_add_tags()
1241 parents[0] = -1; in tre_add_tags()
1247 xfree(parents); in tre_add_tags()
1280 for (i = 0; parents[i] >= 0; i++); in tre_add_tags()
1281 parents[i - 1] = -1; in tre_add_tags()
1301 for (i = 0; parents[i] >= 0; i++); in tre_add_tags()
1302 tnfa->submatch_data[id].parents = NULL; in tre_add_tags()
1311 assert(tnfa->submatch_data[id].parents == NULL); in tre_add_tags()
[all …]
Dregexec.c935 int *parents; in tre_fill_pmatch() local
970 parents = submatch_data[i].parents; in tre_fill_pmatch()
971 if (parents != NULL) in tre_fill_pmatch()
972 for (j = 0; parents[j] >= 0; j++) in tre_fill_pmatch()
974 if (pmatch[i].rm_so < pmatch[parents[j]].rm_so in tre_fill_pmatch()
975 || pmatch[i].rm_eo > pmatch[parents[j]].rm_eo) in tre_fill_pmatch()
/third_party/musl/porting/liteos_m_iccarm/kernel/src/regex/
Dregcomp.c1218 int *parents; /* Stack of submatches the current submatch is in tre_add_tags() local
1236 parents = xmalloc(sizeof(*parents) * (tnfa->num_submatches + 1)); in tre_add_tags()
1237 if (parents == NULL) in tre_add_tags()
1242 parents[0] = -1; in tre_add_tags()
1248 xfree(parents); in tre_add_tags()
1281 for (i = 0; parents[i] >= 0; i++); in tre_add_tags()
1282 parents[i - 1] = -1; in tre_add_tags()
1302 for (i = 0; parents[i] >= 0; i++); in tre_add_tags()
1303 tnfa->submatch_data[id].parents = NULL; in tre_add_tags()
1312 assert(tnfa->submatch_data[id].parents == NULL); in tre_add_tags()
[all …]
Dregexec.c935 int *parents; in tre_fill_pmatch() local
970 parents = submatch_data[i].parents; in tre_fill_pmatch()
971 if (parents != NULL) in tre_fill_pmatch()
972 for (j = 0; parents[j] >= 0; j++) in tre_fill_pmatch()
974 if (pmatch[i].rm_so < pmatch[parents[j]].rm_so in tre_fill_pmatch()
975 || pmatch[i].rm_eo > pmatch[parents[j]].rm_eo) in tre_fill_pmatch()
/third_party/musl/porting/liteos_m/kernel/src/regex/
Dregcomp.c1217 int *parents; /* Stack of submatches the current submatch is in tre_add_tags() local
1235 parents = xmalloc(sizeof(*parents) * (tnfa->num_submatches + 1)); in tre_add_tags()
1236 if (parents == NULL) in tre_add_tags()
1241 parents[0] = -1; in tre_add_tags()
1247 xfree(parents); in tre_add_tags()
1280 for (i = 0; parents[i] >= 0; i++); in tre_add_tags()
1281 parents[i - 1] = -1; in tre_add_tags()
1301 for (i = 0; parents[i] >= 0; i++); in tre_add_tags()
1302 tnfa->submatch_data[id].parents = NULL; in tre_add_tags()
1311 assert(tnfa->submatch_data[id].parents == NULL); in tre_add_tags()
[all …]
Dregexec.c935 int *parents; in tre_fill_pmatch() local
970 parents = submatch_data[i].parents; in tre_fill_pmatch()
971 if (parents != NULL) in tre_fill_pmatch()
972 for (j = 0; parents[j] >= 0; j++) in tre_fill_pmatch()
974 if (pmatch[i].rm_so < pmatch[parents[j]].rm_so in tre_fill_pmatch()
975 || pmatch[i].rm_eo > pmatch[parents[j]].rm_eo) in tre_fill_pmatch()
/third_party/musl/porting/uniproton/kernel/src/regex/
Dregcomp.c1217 int *parents; /* Stack of submatches the current submatch is in tre_add_tags() local
1235 parents = xmalloc(sizeof(*parents) * (tnfa->num_submatches + 1)); in tre_add_tags()
1236 if (parents == NULL) in tre_add_tags()
1241 parents[0] = -1; in tre_add_tags()
1247 xfree(parents); in tre_add_tags()
1280 for (i = 0; parents[i] >= 0; i++); in tre_add_tags()
1281 parents[i - 1] = -1; in tre_add_tags()
1301 for (i = 0; parents[i] >= 0; i++); in tre_add_tags()
1302 tnfa->submatch_data[id].parents = NULL; in tre_add_tags()
1311 assert(tnfa->submatch_data[id].parents == NULL); in tre_add_tags()
[all …]
Dregexec.c935 int *parents; in tre_fill_pmatch() local
970 parents = submatch_data[i].parents; in tre_fill_pmatch()
971 if (parents != NULL) in tre_fill_pmatch()
972 for (j = 0; parents[j] >= 0; j++) in tre_fill_pmatch()
974 if (pmatch[i].rm_so < pmatch[parents[j]].rm_so in tre_fill_pmatch()
975 || pmatch[i].rm_eo > pmatch[parents[j]].rm_eo) in tre_fill_pmatch()
/third_party/python/Lib/xml/dom/
Dpulldom.py243 parents = [node]
249 parents[-1].appendChild(cur_node)
251 parents.append(cur_node)
253 del parents[-1]

1234567