Home
last modified time | relevance | path

Searched refs:dep (Results 1 - 25 of 243) sorted by relevance

12345678910

/third_party/gn/src/gn/
H A Dresolved_target_data.cc27 for (const Target* dep : info->deps.linked_deps()) { in ComputeLibInfo()
28 if (!dep->IsFinal() || dep->output_type() == Target::STATIC_LIBRARY) { in ComputeLibInfo()
29 const TargetInfo* dep_info = GetTargetLibInfo(dep); in ComputeLibInfo()
51 for (const Target* dep : info->deps.linked_deps()) { in ComputeFrameworkInfo()
52 if (!dep->IsFinal() || dep->output_type() == Target::STATIC_LIBRARY) { in ComputeFrameworkInfo()
53 const TargetInfo* dep_info = GetTargetFrameworkInfo(dep); in ComputeFrameworkInfo()
68 for (const Target* dep : info->deps.linked_deps()) { in ComputeHardDeps()
70 if (info->target->hard_dep() || dep in ComputeHardDeps()
[all...]
H A Dtarget.cc135 for (const auto* dep : target->bundle_data().bundle_deps()) { in EnsureFileIsGeneratedByDependency()
136 if (EnsureFileIsGeneratedByDependency(dep, file, false, in EnsureFileIsGeneratedByDependency()
479 for (const auto& dep : public_deps_) { in OnResolved()
480 if (dep.ptr->toolchain() == toolchain() || in OnResolved()
481 dep.ptr->toolchain()->propagates_configs()) in OnResolved()
482 public_configs_.Append(dep.ptr->public_configs().begin(), in OnResolved()
483 dep.ptr->public_configs().end()); in OnResolved()
753 void Target::PullDependentTargetLibsFrom(const Target* dep, bool is_public) { in PullDependentTargetLibsFrom() argument
755 if (dep->output_type() == STATIC_LIBRARY || in PullDependentTargetLibsFrom()
756 dep in PullDependentTargetLibsFrom()
[all...]
H A Drust_project_writer_unittest.cc86 Target dep(setup.settings(), Label(SourceDir("//tortoise/"), "bar")); in TEST_F()
87 dep.set_output_type(Target::RUST_LIBRARY); in TEST_F()
88 dep.visibility().SetPublic(); in TEST_F()
90 dep.sources().push_back(tlib); in TEST_F()
91 dep.source_types_used().Set(SourceFile::SOURCE_RS); in TEST_F()
92 dep.rust_values().set_crate_root(tlib); in TEST_F()
93 dep.rust_values().crate_name() = "tortoise"; in TEST_F()
94 dep.SetToolchain(setup.toolchain()); in TEST_F()
95 ASSERT_TRUE(dep.OnResolved(&err)); in TEST_F()
105 target.public_deps().push_back(LabelTargetPair(&dep)); in TEST_F()
[all...]
H A Dninja_target_writer_unittest.cc39 // Make a base target that's a hard dep (action). in TEST()
61 // Make a base target that's a hard dep (action). in TEST()
81 // Make a base target that's a hard dep (action). in TEST()
116 std::vector<OutputFile> dep = in TEST() local
121 ASSERT_EQ(1u, dep.size()); in TEST()
122 EXPECT_EQ("../../foo/script.py", dep[0].value()); in TEST()
130 std::vector<OutputFile> dep = in TEST() local
135 ASSERT_EQ(1u, dep.size()); in TEST()
136 EXPECT_EQ("obj/foo/base.stamp", dep[0].value()); in TEST()
156 // Input deps for action which should depend on the base since its a hard dep in TEST()
161 std::vector<OutputFile> dep = TEST() local
197 std::vector<OutputFile> dep = TEST() local
[all...]
H A Dninja_binary_target_writer.cc118 for (const Target* dep : target_deps.linked_deps()) { in GetClassifiedDeps()
119 ClassifyDependency(dep, &classified_deps); in GetClassifiedDeps()
135 const Target* dep, in ClassifyDependency()
147 if (can_link_libs && dep->builds_swift_module()) in ClassifyDependency()
148 classified_deps->swiftmodule_deps.push_back(dep); in ClassifyDependency()
153 dep->IsLinkable()) { in ClassifyDependency()
156 classified_deps->linkable_deps.push_back(dep); in ClassifyDependency()
157 } else if (dep->output_type() == Target::SOURCE_SET || in ClassifyDependency()
164 (dep->output_type() == Target::STATIC_LIBRARY && in ClassifyDependency()
165 !dep in ClassifyDependency()
134 ClassifyDependency( const Target* dep, ClassifiedDeps* classified_deps) const ClassifyDependency() argument
[all...]
H A Dninja_group_target_writer_unittest.cc18 Target dep(setup.settings(), Label(SourceDir("//foo/"), "dep")); in TEST()
19 dep.set_output_type(Target::ACTION); in TEST()
20 dep.visibility().SetPublic(); in TEST()
21 dep.SetToolchain(setup.toolchain()); in TEST()
22 ASSERT_TRUE(dep.OnResolved(&err)); in TEST()
44 target.public_deps().push_back(LabelTargetPair(&dep)); in TEST()
57 "build obj/foo/bar.stamp: stamp obj/foo/dep.stamp obj/foo/dep2.stamp || " in TEST()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
H A Dplace-dep.js1 // Given a dep, a node that depends on it, and the edge representing that
2 // dependency, place the dep somewhere in the node's tree, and all of its
5 // Handles all of the tree updating needed to place the dep, including
14 const CanPlaceDep = require('./can-place-dep.js')
22 const gatherDepSet = require('./gather-dep-set.js')
28 this.dep = options.dep
64 // where the dep is not a peer dep.
79 // Then we check under b, and can't, because of the optional peer dep
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dscheduler.c228 static int gpir_min_dist_alu(gpir_dep *dep) in gpir_min_dist_alu() argument
230 switch (dep->pred->op) { in gpir_min_dist_alu()
245 static int gpir_get_min_dist(gpir_dep *dep) in gpir_get_min_dist() argument
247 switch (dep->type) { in gpir_get_min_dist()
249 switch (dep->succ->op) { in gpir_get_min_dist()
258 if (dep->pred->type == gpir_node_type_load || in gpir_get_min_dist()
259 dep->pred->op == gpir_op_complex1) in gpir_get_min_dist()
265 return gpir_min_dist_alu(dep); in gpir_get_min_dist()
269 assert(dep->succ->op == gpir_op_store_temp); in gpir_get_min_dist()
270 return gpir_min_dist_alu(dep); in gpir_get_min_dist()
296 gpir_max_dist_alu(gpir_dep *dep) gpir_max_dist_alu() argument
328 gpir_get_max_dist(gpir_dep *dep) gpir_get_max_dist() argument
701 pred_almost_ready(gpir_dep *dep) pred_almost_ready() argument
[all...]
H A Dnode.c335 /* don't add dep for two nodes from different block */ in gpir_node_add_dep()
339 /* don't add self loop dep */ in gpir_node_add_dep()
343 /* don't add duplicated dep */ in gpir_node_add_dep()
344 gpir_node_foreach_pred(succ, dep) { in gpir_node_add_dep()
345 if (dep->pred == pred) { in gpir_node_add_dep()
347 if (dep->type > type) in gpir_node_add_dep()
348 dep->type = type; in gpir_node_add_dep()
349 return dep; in gpir_node_add_dep()
353 gpir_dep *dep = ralloc(succ, gpir_dep); in gpir_node_add_dep() local
354 dep in gpir_node_add_dep()
395 gpir_node_replace_pred(gpir_dep *dep, gpir_node *new_pred) gpir_node_replace_pred() argument
[all...]
/third_party/mbedtls/scripts/mbedtls_dev/
H A Dpsa_information.py52 def finish_family_dependency(dep: str, bits: int) -> str:
53 """Finish dep if it's a family dependency symbol prefix.
56 qualified by the key size. If dep is such a symbol, finish it by adjusting
59 return re.sub(r'_FAMILY_(.*)', r'_\1_' + str(bits), dep)
66 return [finish_family_dependency(dep, bits) for dep in dependencies]
131 if not all((dep.lstrip('!') in _implemented_dependencies or
132 not dep.lstrip('!').startswith('PSA_WANT'))
133 for dep in dependencies):
136 def tweak_key_pair_dependency(dep
[all...]
/third_party/toybox/kconfig/
H A Dmenu.c102 void menu_add_dep(struct expr *dep) in menu_add_dep() argument
104 current_entry->dep = expr_alloc_and(current_entry->dep, menu_check_dep(dep)); in menu_add_dep()
122 struct property *menu_add_prop(enum prop_type type, char *prompt, struct expr *expr, struct expr *dep) in menu_add_prop() argument
128 prop->visible.expr = menu_check_dep(dep); in menu_add_prop()
145 struct property *menu_add_prompt(enum prop_type type, char *prompt, struct expr *dep) in menu_add_prompt() argument
147 return menu_add_prop(type, prompt, NULL, dep); in menu_add_prompt()
150 void menu_add_expr(enum prop_type type, struct expr *expr, struct expr *dep) in menu_add_expr() argument
152 menu_add_prop(type, NULL, expr, dep); in menu_add_expr()
155 menu_add_symbol(enum prop_type type, struct symbol *sym, struct expr *dep) menu_add_symbol() argument
233 struct expr *parentdep, *basedep, *dep, *dep2, **ep; menu_finalize() local
[all...]
/third_party/mesa3d/src/intel/compiler/
H A Dbrw_fs_scoreboard.cpp502 * Return whether \p dep contains any dependency information.
505 is_valid(const dependency &dep)
507 return dep.ordered || dep.unordered;
521 dependency dep;
524 dep.ordered = dep0.ordered | dep1.ordered;
526 dep.jp.jp[p] = MAX2(dep0.jp.jp[p], dep1.jp.jp[p]);
530 dep.unordered = dep0.unordered | dep1.unordered;
531 dep.id = eq.link(dep0.unordered ? dep0.id : dep1.id,
535 dep
390 assert(from < n); if (is[from] != from) assign(is[from], to); is[from] = to; } } unsigned *is; unsigned n; }; struct dependency { dependency() : ordered(TGL_REGDIST_NULL), jp(), unordered(TGL_SBID_NULL), id(0), exec_all(false) {} dependency(tgl_regdist_mode mode, const ordered_address &jp, bool exec_all) : ordered(mode), jp(jp), unordered(TGL_SBID_NULL), id(0), exec_all(exec_all) {} dependency(tgl_sbid_mode mode, unsigned id, bool exec_all) : ordered(TGL_REGDIST_NULL), jp(), unordered(mode), id(id), exec_all(exec_all) {} tgl_regdist_mode ordered; ordered_address jp; tgl_sbid_mode unordered; unsigned id; bool exec_all; static const dependency done; friend bool operator==(const dependency &dep0, const dependency &dep1) { return dep0.ordered == dep1.ordered && dep0.jp == dep1.jp && dep0.unordered == dep1.unordered && dep0.id == dep1.id && dep0.exec_all == dep1.exec_all; } friend bool operator!=(const dependency &dep0, const dependency &dep1) { return !(dep0 == dep1); } }; const dependency dependency::done = dependency(TGL_REGDIST_DST, ordered_address(), false); bool is_valid(const dependency &dep) { return dep.ordered || dep.unordered; } dependency merge(equivalence_relation &eq, const dependency &dep0, const dependency &dep1) { dependency dep; if (dep0.ordered || dep1.ordered) { dep.ordered = dep0.ordered | dep1.ordered; for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) dep.jp.jp[p] = MAX2(dep0.jp.jp[p], dep1.jp.jp[p]); } if (dep0.unordered || dep1.unordered) { dep.unordered = dep0.unordered | dep1.unordered; dep.id = eq.link(dep0.unordered ? dep0.id : dep1.id, dep1.unordered ? dep1.id : dep0.id); } dep.exec_all = dep0.exec_all || dep1.exec_all; return dep; } dependency shadow(const dependency &dep0, const dependency &dep1) { if (dep0.ordered == TGL_REGDIST_SRC && is_valid(dep1) && !(dep1.unordered & TGL_SBID_DST) && !(dep1.ordered & TGL_REGDIST_DST)) { dependency dep = dep1; dep.ordered |= dep0.ordered; for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) dep.jp.jp[p] = MAX2(dep.jp.jp[p], dep0.jp.jp[p]); return dep; } else { return is_valid(dep1) ? dep1 : dep0; } } dependency transport(dependency dep, int delta[IDX(TGL_PIPE_ALL)]) { if (dep.ordered) { for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) { if (dep.jp.jp[p] > INT_MIN) dep.jp.jp[p] += delta[p]; } } return dep; } dependency dependency_for_read(dependency dep) { dep.ordered &= TGL_REGDIST_DST; return dep; } dependency dependency_for_write(const struct intel_device_info *devinfo, const fs_inst *inst, dependency dep) { if (!is_unordered(inst) && is_single_pipe(dep.jp, inferred_exec_pipe(devinfo, inst))) dep.ordered &= TGL_REGDIST_DST; return dep; } class scoreboard { public: dependency get(const fs_reg &r) const { if (const dependency *p = const_cast<scoreboard *>(this)->dep(r)) return *p; else return dependency(); } void set(const fs_reg &r, const dependency &d) { if (dependency *p = dep(r)) *p = d; } friend scoreboard merge(equivalence_relation &eq, const scoreboard &sb0, const scoreboard &sb1) { scoreboard sb; for (unsigned i = 0; i < ARRAY_SIZE(sb.grf_deps); i++) sb.grf_deps[i] = merge(eq, sb0.grf_deps[i], sb1.grf_deps[i]); sb.addr_dep = merge(eq, sb0.addr_dep, sb1.addr_dep); sb.accum_dep = merge(eq, sb0.accum_dep, sb1.accum_dep); return sb; } friend scoreboard shadow(const scoreboard &sb0, const scoreboard &sb1) { scoreboard sb; for (unsigned i = 0; i < ARRAY_SIZE(sb.grf_deps); i++) sb.grf_deps[i] = shadow(sb0.grf_deps[i], sb1.grf_deps[i]); sb.addr_dep = shadow(sb0.addr_dep, sb1.addr_dep); sb.accum_dep = shadow(sb0.accum_dep, sb1.accum_dep); return sb; } friend scoreboard transport(const scoreboard &sb0, int delta[IDX(TGL_PIPE_ALL)]) { scoreboard sb; for (unsigned i = 0; i < ARRAY_SIZE(sb.grf_deps); i++) sb.grf_deps[i] = transport(sb0.grf_deps[i], delta); sb.addr_dep = transport(sb0.addr_dep, delta); sb.accum_dep = transport(sb0.accum_dep, delta); return sb; } friend bool operator==(const scoreboard &sb0, const scoreboard &sb1) { for (unsigned i = 0; i < ARRAY_SIZE(sb0.grf_deps); i++) { if (sb0.grf_deps[i] != sb1.grf_deps[i]) return false; } if (sb0.addr_dep != sb1.addr_dep) return false; if (sb0.accum_dep != sb1.accum_dep) return false; return true; } friend bool operator!=(const scoreboard &sb0, const scoreboard &sb1) { return !(sb0 == sb1); } private: dependency grf_deps[BRW_MAX_GRF]; dependency addr_dep; dependency accum_dep; dependency * dep(const fs_reg &r) { const unsigned reg = (r.file == VGRF ? r.nr + r.offset / REG_SIZE : reg_offset(r) / REG_SIZE); return (r.file == VGRF || r.file == FIXED_GRF ? &grf_deps[reg] : r.file == MRF ? &grf_deps[GFX7_MRF_HACK_START + reg] : r.file == ARF && reg >= BRW_ARF_ADDRESS && reg < BRW_ARF_ACCUMULATOR ? &addr_dep : r.file == ARF && reg >= BRW_ARF_ACCUMULATOR && reg < BRW_ARF_FLAG ? &accum_dep : NULL); } }; struct dependency_list { dependency_list() : deps(NULL), n(0) {} ~dependency_list() { free(deps); } void push_back(const dependency &dep) { deps = (dependency *)realloc(deps, (n + 1) * sizeof(*deps)); deps[n++] = dep; } unsigned size() const { return n; } const dependency & operator[](unsigned i) const { assert(i < n); return deps[i]; } dependency & operator[](unsigned i) { assert(i < n); return deps[i]; } private: dependency_list(const dependency_list &); dependency_list & operator=(const dependency_list &); dependency *deps; unsigned n; }; void add_dependency(const unsigned *ids, dependency_list &deps, dependency dep) { if (is_valid(dep)) { if (dep.unordered) dep.id = ids[dep.id]; for (unsigned i = 0; i < deps.size(); i++) { if (deps[i].exec_all != dep.exec_all && (!deps[i].exec_all || (dep.unordered & TGL_SBID_SET)) && (!dep.exec_all || (deps[i].unordered & TGL_SBID_SET))) continue; if (dep.ordered && deps[i].ordered) { for (unsigned p = 0; p < IDX(TGL_PIPE_ALL); p++) deps[i].jp.jp[p] = MAX2(deps[i].jp.jp[p], dep.jp.jp[p]); deps[i].ordered |= dep.ordered; deps[i].exec_all |= dep.exec_all; dep.ordered = TGL_REGDIST_NULL; } if (dep.unordered && deps[i].unordered && deps[i].id == dep.id) { deps[i].unordered |= dep.unordered; deps[i].exec_all |= dep.exec_all; dep.unordered = TGL_SBID_NULL; } } if (is_valid(dep)) deps.push_back(dep); } } tgl_swsb ordered_dependency_swsb(const dependency_list &deps, const ordered_address &jp, bool exec_all) { tgl_pipe p = TGL_PIPE_NONE; unsigned min_dist = ~0u; for (unsigned i = 0; i < deps.size(); i++) { if (deps[i].ordered && exec_all >= deps[i].exec_all) { for (unsigned q = 0; q < IDX(TGL_PIPE_ALL); q++) { const unsigned dist = jp.jp[q] - int64_t(deps[i].jp.jp[q]); const unsigned max_dist = (q == IDX(TGL_PIPE_LONG) ? 14 : 10); assert(jp.jp[q] > deps[i].jp.jp[q]); if (dist <= max_dist) { p = (p && IDX(p) != q ? TGL_PIPE_ALL : tgl_pipe(TGL_PIPE_FLOAT + q)); min_dist = MIN3(min_dist, dist, 7); } } } } return { p ? min_dist : 0, p }; } bool find_ordered_dependency(const dependency_list &deps, const ordered_address &jp, bool exec_all) { return ordered_dependency_swsb(deps, jp, exec_all).regdist; } tgl_sbid_mode find_unordered_dependency(const dependency_list &deps, tgl_sbid_mode unordered, bool exec_all) { if (unordered) { for (unsigned i = 0; i < deps.size(); i++) { if ((unordered & deps[i].unordered) && exec_all >= deps[i].exec_all) return deps[i].unordered; } } return TGL_SBID_NULL; } tgl_sbid_mode baked_unordered_dependency_mode(const struct intel_device_info *devinfo, const fs_inst *inst, const dependency_list &deps, const ordered_address &jp) { const bool exec_all = inst->force_writemask_all; const bool has_ordered = find_ordered_dependency(deps, jp, exec_all); const tgl_pipe ordered_pipe = ordered_dependency_swsb(deps, jp, exec_all).pipe; if (find_unordered_dependency(deps, TGL_SBID_SET, exec_all)) return find_unordered_dependency(deps, TGL_SBID_SET, exec_all); else if (has_ordered && is_unordered(inst)) return TGL_SBID_NULL; else if (find_unordered_dependency(deps, TGL_SBID_DST, exec_all) && (!has_ordered || ordered_pipe == inferred_sync_pipe(devinfo, inst))) return find_unordered_dependency(deps, TGL_SBID_DST, exec_all); else if (!has_ordered) return find_unordered_dependency(deps, TGL_SBID_SRC, exec_all); else return TGL_SBID_NULL; } bool baked_ordered_dependency_mode(const struct intel_device_info *devinfo, const fs_inst *inst, const dependency_list &deps, const ordered_address &jp) { const bool exec_all = inst->force_writemask_all; const bool has_ordered = find_ordered_dependency(deps, jp, exec_all); const tgl_pipe ordered_pipe = ordered_dependency_swsb(deps, jp, exec_all).pipe; const tgl_sbid_mode unordered_mode = baked_unordered_dependency_mode(devinfo, inst, deps, jp); if (!has_ordered) return false; else if (!unordered_mode) return true; else return ordered_pipe == inferred_sync_pipe(devinfo, inst) && unordered_mode == (is_unordered(inst) ? TGL_SBID_SET : TGL_SBID_DST); } void update_inst_scoreboard(const fs_visitor *shader, const ordered_address *jps, const fs_inst *inst, unsigned ip, scoreboard &sb) { const bool exec_all = inst->force_writemask_all; const struct intel_device_info *devinfo = shader->devinfo; const tgl_pipe p = inferred_exec_pipe(devinfo, inst); const ordered_address jp = p ? ordered_address(p, jps[ip].jp[IDX(p)]) : ordered_address(); const bool is_ordered = ordered_unit(devinfo, inst, IDX(TGL_PIPE_ALL)); for (unsigned i = 0; i < inst->sources; i++) { const dependency rd_dep = (inst->is_payload(i) || inst->is_math()) ? dependency(TGL_SBID_SRC, ip, exec_all) : is_ordered ? dependency(TGL_REGDIST_SRC, jp, exec_all) : dependency::done; for (unsigned j = 0; j < regs_read(inst, i); j++) { const fs_reg r = byte_offset(inst->src[i], REG_SIZE * j); sb.set(r, shadow(sb.get(r), rd_dep)); } } if (inst->reads_accumulator_implicitly()) sb.set(brw_acc_reg(8), dependency(TGL_REGDIST_SRC, jp, exec_all)); if (is_send(inst) && inst->base_mrf != -1) { const dependency rd_dep = dependency(TGL_SBID_SRC, ip, exec_all); for (unsigned j = 0; j < inst->mlen; j++) sb.set(brw_uvec_mrf(8, inst->base_mrf + j, 0), rd_dep); } const dependency wr_dep = is_unordered(inst) ? dependency(TGL_SBID_DST, ip, exec_all) : is_ordered ? dependency(TGL_REGDIST_DST, jp, exec_all) : dependency(); if (inst->writes_accumulator_implicitly(devinfo)) sb.set(brw_acc_reg(8), wr_dep); if (is_valid(wr_dep) && inst->dst.file != BAD_FILE && !inst->dst.is_null()) assign() argument
1147 const dependency dep = sb.get(brw_acc_reg(8)); gather_inst_dependencies() local
1179 const dependency dep = sb.get(brw_acc_reg(8)); gather_inst_dependencies() local
1229 const dependency &dep = deps0[ip][i]; allocate_inst_dependencies() local
1266 const dependency &dep = deps[ip][i]; emit_inst_dependencies() local
1295 const dependency &dep = deps[ip][i]; emit_inst_dependencies() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dcontrol_dependence.cpp71 std::ostream& operator<<(std::ostream& os, const ControlDependence& dep) { in operator <<() argument
72 os << dep.source_bb_id() << "->" << dep.target_bb_id(); in operator <<()
73 if (dep.branch_target_bb_id() != dep.target_bb_id()) { in operator <<()
74 os << " through " << dep.branch_target_bb_id(); in operator <<()
128 for (const ControlDependence& dep : reverse_nodes_[child->id()]) { in ComputePostDominanceFrontierForNode()
130 if (dep.source_bb_id() == kPseudoEntryBlock || in ComputePostDominanceFrontierForNode()
131 !pdom.StrictlyDominates(label, dep.source_bb_id())) { in ComputePostDominanceFrontierForNode()
132 edges.push_back(ControlDependence(dep in ComputePostDominanceFrontierForNode()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dcontrol_dependence.cpp71 std::ostream& operator<<(std::ostream& os, const ControlDependence& dep) { in operator <<() argument
72 os << dep.source_bb_id() << "->" << dep.target_bb_id(); in operator <<()
73 if (dep.branch_target_bb_id() != dep.target_bb_id()) { in operator <<()
74 os << " through " << dep.branch_target_bb_id(); in operator <<()
128 for (const ControlDependence& dep : reverse_nodes_[child->id()]) { in ComputePostDominanceFrontierForNode()
130 if (dep.source_bb_id() == kPseudoEntryBlock || in ComputePostDominanceFrontierForNode()
131 !pdom.StrictlyDominates(label, dep.source_bb_id())) { in ComputePostDominanceFrontierForNode()
132 edges.push_back(ControlDependence(dep in ComputePostDominanceFrontierForNode()
[all...]
/third_party/spirv-tools/source/opt/
H A Dcontrol_dependence.cpp68 std::ostream& operator<<(std::ostream& os, const ControlDependence& dep) { in operator <<() argument
69 os << dep.source_bb_id() << "->" << dep.target_bb_id(); in operator <<()
70 if (dep.branch_target_bb_id() != dep.target_bb_id()) { in operator <<()
71 os << " through " << dep.branch_target_bb_id(); in operator <<()
125 for (const ControlDependence& dep : reverse_nodes_[child->id()]) { in ComputePostDominanceFrontierForNode()
127 if (dep.source_bb_id() == kPseudoEntryBlock || in ComputePostDominanceFrontierForNode()
128 !pdom.StrictlyDominates(label, dep.source_bb_id())) { in ComputePostDominanceFrontierForNode()
129 edges.push_back(ControlDependence(dep in ComputePostDominanceFrontierForNode()
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/pp/
H A Dnode.c395 /* don't add dep for two nodes from different block */ in ppir_node_add_dep()
401 /* don't add duplicated dep */ in ppir_node_add_dep()
402 ppir_node_foreach_pred(succ, dep) { in ppir_node_add_dep()
403 if (dep->pred == pred) in ppir_node_add_dep()
407 ppir_dep *dep = ralloc(succ, ppir_dep); in ppir_node_add_dep() local
408 dep->pred = pred; in ppir_node_add_dep()
409 dep->succ = succ; in ppir_node_add_dep()
410 dep->type = type; in ppir_node_add_dep()
411 list_addtail(&dep->pred_link, &succ->pred_list); in ppir_node_add_dep()
412 list_addtail(&dep in ppir_node_add_dep()
415 ppir_node_remove_dep(ppir_dep *dep) ppir_node_remove_dep() argument
472 ppir_node_replace_pred(ppir_dep *dep, ppir_node *new_pred) ppir_node_replace_pred() argument
[all...]
H A Dscheduler.c40 ppir_instr_foreach_pred(instr, dep) { in ppir_schedule_calc_sched_info()
41 ppir_instr *pred = dep->pred; in ppir_schedule_calc_sched_info()
63 ppir_instr_foreach_pred(instr, dep) { in ppir_schedule_calc_sched_info()
64 ppir_instr *pred = dep->pred; in ppir_schedule_calc_sched_info()
129 ppir_instr_foreach_pred(instr, dep) { in ppir_schedule_ready_list()
130 ppir_instr *pred = dep->pred; in ppir_schedule_ready_list()
134 ppir_instr_foreach_succ(pred, dep) { in ppir_schedule_ready_list()
135 ppir_instr *succ = dep->succ; in ppir_schedule_ready_list()
H A Dppir.h445 void ppir_node_remove_dep(ppir_dep *dep);
450 void ppir_node_replace_pred(ppir_dep *dep, ppir_node *new_pred);
488 #define ppir_node_foreach_succ(node, dep) \
489 list_for_each_entry(ppir_dep, dep, &node->succ_list, succ_link)
490 #define ppir_node_foreach_succ_safe(node, dep) \
491 list_for_each_entry_safe(ppir_dep, dep, &node->succ_list, succ_link)
492 #define ppir_node_foreach_pred(node, dep) \
493 list_for_each_entry(ppir_dep, dep, &node->pred_list, pred_link)
494 #define ppir_node_foreach_pred_safe(node, dep) \
495 list_for_each_entry_safe(ppir_dep, dep,
[all...]
/third_party/mbedtls/tests/scripts/
H A Dset_psa_test_dependencies.py94 def is_classic_dependency(dep):
95 """Whether dep is a classic dependency that PSA test cases should not use."""
96 if dep.startswith('!'):
97 dep = dep[1:]
98 return dep in CLASSIC_DEPENDENCIES
100 def is_systematic_dependency(dep):
101 """Whether dep is a PSA dependency which is determined systematically."""
102 if dep.startswith('PSA_WANT_ECC_'):
104 return dep
[all...]
/third_party/mesa3d/src/gallium/drivers/freedreno/
H A Dfreedreno_batch.c228 struct fd_batch *dep; variable
230 foreach_batch (dep, cache, batch->dependents_mask) {
231 fd_batch_flush(dep); variable
232 fd_batch_reference(&dep, NULL);
242 struct fd_batch *dep; in batch_reset_dependencies() local
244 foreach_batch (dep, cache, batch->dependents_mask) { in batch_reset_dependencies()
245 fd_batch_reference(&dep, NULL); in batch_reset_dependencies()
397 struct fd_batch *dep; in recursive_dependents_mask() local
400 foreach_batch (dep, cache, batch->dependents_mask) in recursive_dependents_mask()
401 dependents_mask |= recursive_dependents_mask(dep); in recursive_dependents_mask()
407 fd_batch_add_dep(struct fd_batch *batch, struct fd_batch *dep) fd_batch_add_dep() argument
477 struct fd_batch *dep; fd_batch_resource_write() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/lint/
H A Ddivergence_analysis.cpp47 for (const spvtools::opt::ControlDependence& dep : in EnqueueSuccessors()
50 context().cfg()->block(dep.target_bb_id())->GetLabelInst(); in EnqueueSuccessors()
73 for (const spvtools::opt::ControlDependence& dep : in VisitBlock()
75 if (divergence_[dep.source_bb_id()] > cur_level) { in VisitBlock()
76 cur_level = divergence_[dep.source_bb_id()]; in VisitBlock()
77 divergence_source_[id] = dep.source_bb_id(); in VisitBlock()
78 } else if (dep.source_bb_id() != 0) { in VisitBlock()
79 uint32_t condition_id = dep.GetConditionID(*context().cfg()); in VisitBlock()
83 if (follow_unconditional_branches_[dep.branch_target_bb_id()] != in VisitBlock()
84 follow_unconditional_branches_[dep in VisitBlock()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/lint/
H A Ddivergence_analysis.cpp47 for (const spvtools::opt::ControlDependence& dep : in EnqueueSuccessors()
50 context().cfg()->block(dep.target_bb_id())->GetLabelInst(); in EnqueueSuccessors()
73 for (const spvtools::opt::ControlDependence& dep : in VisitBlock()
75 if (divergence_[dep.source_bb_id()] > cur_level) { in VisitBlock()
76 cur_level = divergence_[dep.source_bb_id()]; in VisitBlock()
77 divergence_source_[id] = dep.source_bb_id(); in VisitBlock()
78 } else if (dep.source_bb_id() != 0) { in VisitBlock()
79 uint32_t condition_id = dep.GetConditionID(*context().cfg()); in VisitBlock()
83 if (follow_unconditional_branches_[dep.branch_target_bb_id()] != in VisitBlock()
84 follow_unconditional_branches_[dep in VisitBlock()
[all...]
/third_party/jsframework/runtime/main/reactivity/
H A Dwatcher.js2 import Dep, { pushTarget, popTarget } from './dep';
77 * @param {Dep} dep
79 Watcher.prototype.addDep = function (dep) {
80 const id = dep.id;
83 this.newDeps.push(dep);
85 dep.addSub(this);
96 const dep = this.deps[i];
97 if (!this.newDepIds.has(dep.id)) {
98 dep.removeSub(this);
201 const depId = val.__ob__.dep
[all...]
/third_party/skia/third_party/externals/angle2/scripts/
H A Dgen_angle_gn_info_json.py60 for dep in target.get('deps', []):
61 if dep not in all_desc:
62 logging.debug("dep: %s%s" % (indent, dep))
63 new_desc = get_json_description(gn_out, dep)
64 all_desc[dep] = new_desc[dep]
65 load_json_deps(new_desc, gn_out, dep, all_desc, indent + " ")
67 logging.debug("dup: %s%s" % (indent, dep))
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DMemDepPrinter.cpp62 static InstTypePair getInstTypePair(MemDepResult dep) { in getInstTypePair()
63 if (dep.isClobber()) in getInstTypePair()
64 return InstTypePair(dep.getInst(), Clobber); in getInstTypePair()
65 if (dep.isDef()) in getInstTypePair()
66 return InstTypePair(dep.getInst(), Def); in getInstTypePair()
67 if (dep.isNonFuncLocal()) in getInstTypePair()
68 return InstTypePair(dep.getInst(), NonFuncLocal); in getInstTypePair()
69 assert(dep.isUnknown() && "unexpected dependence type"); in getInstTypePair()
70 return InstTypePair(dep.getInst(), Unknown); in getInstTypePair()

Completed in 14 milliseconds

12345678910