Home
last modified time | relevance | path

Searched refs:deps (Results 1 - 25 of 242) sorted by relevance

12345678910

/third_party/ninja/src/
H A Ddeps_log_test.cc50 vector<Node*> deps; in TEST_F() local
51 deps.push_back(state1.GetNode("foo.h", 0)); in TEST_F()
52 deps.push_back(state1.GetNode("bar.h", 0)); in TEST_F()
53 log1.RecordDeps(state1.GetNode("out.o", 0), 1, deps); in TEST_F()
55 deps.clear(); in TEST_F()
56 deps.push_back(state1.GetNode("foo.h", 0)); in TEST_F()
57 deps.push_back(state1.GetNode("bar2.h", 0)); in TEST_F()
58 log1.RecordDeps(state1.GetNode("out2.o", 0), 2, deps); in TEST_F()
102 vector<Node*> deps; in TEST_F() local
106 deps in TEST_F()
136 vector<Node*> deps; TEST_F() local
162 vector<Node*> deps; TEST_F() local
198 vector<Node*> deps; TEST_F() local
232 vector<Node*> deps; TEST_F() local
260 DepsLog::Deps* deps = log.GetDeps(out); TEST_F() local
314 DepsLog::Deps* deps = log.GetDeps(out); TEST_F() local
390 vector<Node*> deps; TEST_F() local
454 vector<Node*> deps; TEST_F() local
496 vector<Node*> deps; TEST_F() local
513 DepsLog::Deps* deps = log.GetDeps(state.GetNode("out2.o", 0)); TEST_F() local
525 vector<Node*> deps; TEST_F() local
[all...]
H A Ddeps_log.cc87 Deps* deps = GetDeps(node); in RecordDeps() local
88 if (!deps || in RecordDeps()
89 deps->mtime != mtime || in RecordDeps()
90 deps->node_count != node_count) { in RecordDeps()
94 if (deps->nodes[i] != nodes[i]) { in RecordDeps()
137 Deps* deps = new Deps(mtime, node_count); in RecordDeps()
139 deps->nodes[i] = nodes[i]; in RecordDeps()
140 UpdateDeps(node->id(), deps); in RecordDeps()
174 *err = "deps log version change; rebuilding"; in Load()
176 *err = "bad deps lo in Load()
215 Deps* deps = new Deps(mtime, deps_count); Load() local
[all...]
/third_party/gn/src/gn/
H A Dresolved_target_deps_unittest.cc10 ResolvedTargetDeps deps; in TEST() local
11 EXPECT_EQ(0u, deps.size()); in TEST()
12 EXPECT_TRUE(deps.public_deps().empty()); in TEST()
13 EXPECT_TRUE(deps.private_deps().empty()); in TEST()
14 EXPECT_TRUE(deps.data_deps().empty()); in TEST()
15 EXPECT_TRUE(deps.linked_deps().empty()); in TEST()
16 EXPECT_TRUE(deps.all_deps().empty()); in TEST()
37 ResolvedTargetDeps deps(public_vec, private_vec, data_vec); in TEST()
38 EXPECT_EQ(5u, deps.size()); in TEST()
40 EXPECT_EQ(2u, deps in TEST()
[all...]
H A Dohos_components_mapping.cc99 const std::string &label, const std::string &deps) const in MappingTargetAbsoluteDpes()
101 if (settings == nullptr || StartWith(deps, "//build/") || in MappingTargetAbsoluteDpes()
102 StartWith(deps, "//out/") || StartWith(deps, "//prebuilts/")) { in MappingTargetAbsoluteDpes()
110 if (StartWith(deps, component->path())) { in MappingTargetAbsoluteDpes()
114 std::string deps_without_tool = deps; in MappingTargetAbsoluteDpes()
115 size_t tool_sep = deps.find("("); in MappingTargetAbsoluteDpes()
117 deps_without_tool = deps.substr(0, tool_sep); in MappingTargetAbsoluteDpes()
124 size_t pos = deps.find(":"); in MappingTargetAbsoluteDpes()
128 return deps_component->getInnerApi(deps in MappingTargetAbsoluteDpes()
[all...]
H A Dohos_components_checker.cc248 const std::string &deps, Err *err) const in InterceptInnerApiPublicDepsInner()
255 std::string deps_str(deps); in InterceptInnerApiPublicDepsInner()
262 "The item " + label + " not allow the use of public_deps dependent internal modules : " + deps); in InterceptInnerApiPublicDepsInner()
282 const std::string &deps, Err *err) const in InterceptDepsNotLib()
289 std::string deps_str(deps); in InterceptDepsNotLib()
298 std::string deps_str(deps); in InterceptDepsNotLib()
305 "The item " + label + " cannot depend on a non-lib target " + deps); in InterceptDepsNotLib()
356 const std::string &deps, Err *err) const in InterceptTargetAbsoluteDepsOther()
363 std::string deps_str(deps); in InterceptTargetAbsoluteDepsOther()
372 std::string deps_str(deps); in InterceptTargetAbsoluteDepsOther()
247 InterceptInnerApiPublicDepsInner(const Target *target, const std::string &label, const std::string &deps, Err *err) const InterceptInnerApiPublicDepsInner() argument
281 InterceptDepsNotLib(const Item *item, const std::string &label, const std::string &deps, Err *err) const InterceptDepsNotLib() argument
355 InterceptTargetAbsoluteDepsOther(const Item *item, const std::string &label, const std::string &deps, Err *err) const InterceptTargetAbsoluteDepsOther() argument
400 InterceptImportOther(const FunctionCallNode *function, const std::string &label, const std::string &deps, Err *err) const InterceptImportOther() argument
448 file << subsystem << " " << component << " " << label << " " << deps << "\\n"; GenerateScanList() local
493 CheckInnerApiPublicDepsInner(const Target *target, const std::string &label, const std::string &deps, Err *err) const CheckInnerApiPublicDepsInner() argument
516 CheckInnerApiNotLib(const Item *item, const OhosComponent *component, const std::string &label, const std::string &deps, Err *err) const CheckInnerApiNotLib() argument
585 CheckInnerApiVisibilityDenied(const Item *item, const OhosComponent *component, const std::string &label, const std::string &deps, Err *err) const CheckInnerApiVisibilityDenied() argument
617 CheckTargetAbsoluteDepsOther(const Item *item, const OhosComponent *component, const std::string &label, const std::string &deps, bool is_external_deps, Err *err) const CheckTargetAbsoluteDepsOther() argument
641 CheckImportOther(const FunctionCallNode *function, const BuildSettings *build_settings, const std::string &label, const std::string &deps, Err *err) const CheckImportOther() argument
[all...]
H A Druntime_deps.cc31 // Adds the given file to the deps list if it hasn't already been listed in
35 RuntimeDepsVector* deps, in AddIfNew()
39 deps->push_back(std::make_pair(output_file, source)); in AddIfNew()
45 RuntimeDepsVector* deps, in AddIfNew()
50 AddIfNew(output_file, source, deps, found_file); in AddIfNew()
57 // data deps add more stuff, so we will want to revisit a target if it's a
61 RuntimeDepsVector* deps, in RecursiveCollectRuntimeDeps()
83 AddIfNew(runtime_output, target, deps, found_files); in RecursiveCollectRuntimeDeps()
88 AddIfNew(file, target, deps, found_files); in RecursiveCollectRuntimeDeps()
97 AddIfNew(output_file.value(), target, deps, found_file in RecursiveCollectRuntimeDeps()
33 AddIfNew(const OutputFile& output_file, const Target* source, RuntimeDepsVector* deps, std::set<OutputFile>* found_file) AddIfNew() argument
43 AddIfNew(const std::string& str, const Target* source, RuntimeDepsVector* deps, std::set<OutputFile>* found_file) AddIfNew() argument
59 RecursiveCollectRuntimeDeps(const Target* target, bool is_target_data_dep, RuntimeDepsVector* deps, std::map<const Target*, bool>* seen_targets, std::set<OutputFile>* found_files) RecursiveCollectRuntimeDeps() argument
[all...]
H A Dohos_components_checker.h52 bool CheckInnerApiPublicDepsInner(const Target *target, const std::string &label, const std::string &deps,
55 const std::string &deps, Err *err) const;
61 const std::string &deps, Err *err) const;
63 const std::string &deps, bool is_external_deps, Err *err) const;
65 const std::string &label, const std::string &deps, Err *err) const;
81 bool InterceptInnerApiPublicDepsInner(const Target *target, const std::string &label, const std::string &deps,
84 bool InterceptDepsNotLib(const Item *item, const std::string &label, const std::string &deps, Err *err) const;
90 bool InterceptTargetAbsoluteDepsOther(const Item *item, const std::string &label, const std::string &deps,
92 bool InterceptImportOther(const FunctionCallNode* function, const std::string &label, const std::string &deps,
95 const std::string &label, const std::string &deps) cons
[all...]
H A Dresolved_target_data.cc27 for (const Target* dep : info->deps.linked_deps()) { in ComputeLibInfo()
51 for (const Target* dep : info->deps.linked_deps()) { in ComputeFrameworkInfo()
68 for (const Target* dep : info->deps.linked_deps()) { in ComputeHardDeps()
95 ComputeInheritedLibsFor(info->deps.public_deps(), true, &inherited_libraries); in ComputeInheritedLibs()
96 ComputeInheritedLibsFor(info->deps.private_deps(), false, in ComputeInheritedLibs()
104 base::span<const Target*> deps, in ComputeInheritedLibsFor()
107 for (const Target* dep : deps) { in ComputeInheritedLibsFor()
136 // library. Rust dylib deps are handled above and transitive deps are in ComputeInheritedLibsFor()
146 // The current target isn't linked, so propagate linked deps an in ComputeInheritedLibsFor()
103 ComputeInheritedLibsFor( base::span<const Target*> deps, bool is_public, TargetPublicPairListBuilder* inherited_libraries) const ComputeInheritedLibsFor() argument
186 ComputeRustLibsFor(base::span<const Target*> deps, bool is_public, RustLibsBuilder* rust_libs) const ComputeRustLibsFor() argument
[all...]
/third_party/typescript/tests/baselines/reference/
H A DcontextSensitiveReturnTypeInference.js9 getter: (deps: TDependencies, data: IData) => any,
10 deps: TDependencies,
18 (deps, data) => ({
19 fn1: function() { return deps.foo },
26 (deps: typeof DEPS, data) => ({
27 fn1: function() { return deps.foo },
34 (deps, data) => ({
35 fn1: () => deps.foo,
42 (deps, data) => {
44 fn1() { return deps
[all...]
/third_party/mesa3d/src/intel/compiler/
H A Dbrw_fs_scoreboard.cpp763 dependency_list() : deps(NULL), n(0) {}
767 free(deps);
773 deps = (dependency *)realloc(deps, (n + 1) * sizeof(*deps));
774 deps[n++] = dep;
787 return deps[i];
794 return deps[i];
802 dependency *deps;
808 * \p deps
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
1126 dependency_list *deps = new dependency_list[num_instructions(shader)]; gather_inst_dependencies() local
1249 emit_inst_dependencies(fs_visitor *shader, const ordered_address *jps, const dependency_list *deps) emit_inst_dependencies() argument
[all...]
/third_party/node/deps/openssl/openssl/Configurations/
H A Dgentemplate.pm220 deps => $self->{info}->{depends}->{$src} // [],
244 deps => $self->{info}->{depends}->{$target} // []);
261 my @deps = @{$self->{info}->{depends}->{$obj} // []};
269 print STDERR "DEBUG[doobj] \@deps for $obj ($bin) : ",
270 join(",", map { "\n $_" } @deps), "\n"
283 srcs => [ @srcs ], deps => [ @deps ],
337 my @deps = ( $self->resolvedepends(getsrclibs('sources', $lib)) );
364 my @deps = ();
369 push @deps,
[all...]
/third_party/openssl/Configurations/
H A Dgentemplate.pm220 deps => $self->{info}->{depends}->{$src} // [],
244 deps => $self->{info}->{depends}->{$target} // []);
261 my @deps = @{$self->{info}->{depends}->{$obj} // []};
269 print STDERR "DEBUG[doobj] \@deps for $obj ($bin) : ",
270 join(",", map { "\n $_" } @deps), "\n"
283 srcs => [ @srcs ], deps => [ @deps ],
337 my @deps = ( $self->resolvedepends(getsrclibs('sources', $lib)) );
364 my @deps = ();
369 push @deps,
[all...]
/third_party/node/tools/gyp/tools/
H A Dpretty_sln.py24 def BuildProject(project, built, projects, deps):
28 for dep in deps[project]:
30 BuildProject(dep, built, projects, deps)
109 def PrintDependencies(projects, deps):
115 for (project, dep_list) in sorted(deps.items()):
126 def PrintBuildOrder(projects, deps):
133 for (project, _) in sorted(deps.items()):
135 BuildProject(project, built, projects, deps)
171 (projects, deps) = ParseSolution(sys.argv[1])
172 PrintDependencies(projects, deps)
[all...]
/third_party/musl/scripts/
H A Dprint_so_deps.py95 f.write("digraph deps {\n")
97 for soname, deps in self.soname_deps.items():
99 for so in deps:
114 for soname, deps in self.soname_deps.items():
115 f.write("{}:{}\n".format(soname, ",".join(deps)))
120 for soname, deps in self.soname_deps.items():
121 f.write("{},{}\n".format(soname, ",".join(deps)))
126 deps = []
132 deps.append(self.get_soname(line))
134 self.soname_deps[entry_so] = deps
[all...]
/third_party/qrcodegen/cpp/
H A DMakefile64 rm -rf .deps
75 %.o: %.cpp .deps/timestamp
76 $(CXX) $(CXXFLAGS) -c -o $@ -MMD -MF .deps/$*.d $<
79 .deps/timestamp:
80 mkdir -p .deps
81 touch .deps/timestamp
84 -include .deps/*.d
/third_party/qrcodegen/c/
H A DMakefile64 rm -rf .deps
79 %.o: %.c .deps/timestamp
80 $(CC) $(CFLAGS) -c -o $@ -MMD -MF .deps/$*.d $<
83 .deps/timestamp:
84 mkdir -p .deps
85 touch .deps/timestamp
88 -include .deps/*.d
/third_party/mesa3d/src/gallium/frontends/clover/api/
H A Dtransfer.cpp73 const ref_vector<event> &deps) { in validate_common()
76 }, deps)) in validate_common()
366 auto deps = objs<wait_list_tag>(d_deps, num_deps);
371 validate_common(q, deps);
377 q, CL_COMMAND_READ_BUFFER, deps,
399 auto deps = objs<wait_list_tag>(d_deps, num_deps);
404 validate_common(q, deps);
410 q, CL_COMMAND_WRITE_BUFFER, deps,
437 auto deps = objs<wait_list_tag>(d_deps, num_deps);
444 validate_common(q, deps);
72 validate_common(command_queue &q, const ref_vector<event> &deps) validate_common() argument
[all...]
/third_party/jsframework/runtime/main/reactivity/
H A Dwatcher.js43 this.deps = [];
94 let i = this.deps.length;
96 const dep = this.deps[i];
105 tmp = this.deps
106 this.deps = this.newDeps
151 * Depend on all deps collected by this watcher.
154 let i = this.deps.length;
156 this.deps[i].depend();
173 let i = this.deps.length;
175 this.deps[
[all...]
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbi_helper_invocations.c196 bi_helper_block_update(BITSET_WORD *deps, bi_block *block) in bi_helper_block_update() argument
206 if (!BITSET_TEST(deps, bi_get_node(I->dest[d]))) in bi_helper_block_update()
213 progress |= !BITSET_TEST(deps, node); in bi_helper_block_update()
214 BITSET_SET(deps, node); in bi_helper_block_update()
229 BITSET_WORD *deps = calloc(sizeof(BITSET_WORD), BITSET_WORDS(temp_count)); in bi_analyze_helper_requirements() local
239 BITSET_SET(deps, bi_get_node(I->src[s])); in bi_analyze_helper_requirements()
254 if (bi_helper_block_update(deps, blk)) { in bi_analyze_helper_requirements()
271 exec |= BITSET_TEST(deps, bi_get_node(I->dest[d])); in bi_analyze_helper_requirements()
277 free(deps); in bi_analyze_helper_requirements()
/third_party/node/deps/npm/node_modules/normalize-package-data/lib/
H A Dfixer.js147 ;['dependencies', 'devDependencies'].forEach(function (deps) {
148 if (!(deps in data)) {
151 if (!data[deps] || typeof data[deps] !== 'object') {
152 this.warn('nonObjectDependencies', deps)
153 delete data[deps]
156 Object.keys(data[deps]).forEach(function (d) {
157 var r = data[deps][d]
160 delete data[deps][d]
162 var hosted = hostedGitInfo.fromUrl(data[deps][
[all...]
/third_party/weex-loader/src/
H A Dparser.js45 function extractDependencies (node, deps) {
50 deps,
53 extractDependencies(child, deps)
64 deps: [],
106 const deps = []
107 extractDependencies(node.content, deps)
108 output.deps = deps
/third_party/mesa3d/src/panfrost/midgard/
H A Dmidgard_helper_invocations.c163 mir_helper_block_update(BITSET_WORD *deps, pan_block *_block, unsigned temp_count) in mir_helper_block_update() argument
170 if (ins->dest >= temp_count || !BITSET_TEST(deps, ins->dest)) in mir_helper_block_update()
179 progress |= !BITSET_TEST(deps, ins->src[s]); in mir_helper_block_update()
180 BITSET_SET(deps, ins->src[s]); in mir_helper_block_update()
192 BITSET_WORD *deps = calloc(sizeof(BITSET_WORD), BITSET_WORDS(temp_count)); in mir_analyze_helper_requirements() local
204 BITSET_SET(deps, ins->src[s]); in mir_analyze_helper_requirements()
224 bool progress = mir_helper_block_update(deps, blk, temp_count); in mir_analyze_helper_requirements()
243 ins->helper_execute = BITSET_TEST(deps, ins->dest); in mir_analyze_helper_requirements()
246 free(deps); in mir_analyze_helper_requirements()
/third_party/mesa3d/src/gallium/frontends/clover/core/
H A Devent.cpp28 event::event(clover::context &ctx, const ref_vector<event> &deps, in event() argument
32 for (auto &ev : deps) in event()
110 ev.deps.push_back(*this); in chain()
122 std::swap(deps, evs); in wait()
131 const ref_vector<event> &deps, action action) : in hard_event()
132 event(q.context(), deps, profile(q, action), [](event &ev){}), in hard_event()
212 deps.clear(); in fence()
234 soft_event::soft_event(clover::context &ctx, const ref_vector<event> &deps,
236 event(ctx, deps, action, action) {
249 }, deps))
130 hard_event(command_queue &q, cl_command_type command, const ref_vector<event> &deps, action action) hard_event() argument
[all...]
/third_party/python/Lib/test/test_importlib/
H A Dtest_metadata_api.py227 deps = requires('egginfo-pkg')
228 assert len(deps) == 2
229 assert any(dep == 'wheel >= 1.0; python_version >= "2.7"' for dep in deps)
238 deps = requires('egginfo-pkg')
239 assert deps == []
242 deps = requires('distinfo-pkg')
243 assert len(deps) == 2
244 assert all(deps)
245 assert 'wheel >= 1.0' in deps
246 assert "pytest; extra == 'test'" in deps
[all...]
/third_party/ffmpeg/doc/
H A Dtexidep.pl14 my ($file, $deps) = @_;
15 $deps->{$file} = 1;
20 die "Circular dependency found in file $root\n" if exists $deps->{"doc/$1"};
26 print_deps("$src_path/doc/$1", {%$deps});

Completed in 12 milliseconds

12345678910