Home
last modified time | relevance | path

Searched refs:dependency (Results 1 - 25 of 183) sorted by relevance

12345678

/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/
H A Dparse_dependency.py9 # dependency - the expression string
11 # evaluateDependency(dependency, isSupported) evaluates the expression,
15 # dependencyLanguage(dependency) returns an English string equivalent
18 # dependencyNames(dependency) returns a set of the extension and
21 # dependencyMarkup(dependency) returns a string containing asciidoctor
176 def evaluateDependency(dependency, isSupported):
177 """Evaluate a dependency expression, returning a boolean result.
179 - dependency - the expression
185 results = dependencyBNF().parseString(dependency, parseAll=True)
214 def dependencyLanguage(dependency, leafMarku
[all...]
/third_party/vulkan-headers/registry/
H A Dparse_dependency.py9 # dependency - the expression string
11 # evaluateDependency(dependency, isSupported) evaluates the expression,
15 # dependencyLanguage(dependency) returns an English string equivalent
18 # dependencyNames(dependency) returns a set of the extension and
21 # dependencyMarkup(dependency) returns a string containing asciidoctor
176 def evaluateDependency(dependency, isSupported):
177 """Evaluate a dependency expression, returning a boolean result.
179 - dependency - the expression
185 results = dependencyBNF().parseString(dependency, parseAll=True)
214 def dependencyLanguage(dependency, leafMarku
[all...]
/third_party/mesa3d/src/intel/compiler/
H A Dbrw_fs_scoreboard.cpp54 * - tdr0 thread dependency register
148 * RegDist counter calculated for any ordered dependency that crosses this
190 * Construct the ordered address of a dependency known to execute on a
404 * Representation of a data dependency between two instructions in the
408 struct dependency {
410 * No dependency information.
412 dependency() : ordered(TGL_REGDIST_NULL), jp(),
417 * Construct a dependency on the in-order instruction with the provided
420 dependency(tgl_regdist_mode mode, const ordered_address &jp,
426 * Construct a dependency o
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
[all...]
/third_party/skia/src/gpu/vk/
H A DGrVkRenderPass.cpp172 VkSubpassDependency& dependency = dependencies[currentDependency++]; in Create() local
173 dependency.srcSubpass = mainSubpass; in Create()
174 dependency.dstSubpass = mainSubpass; in Create()
175 dependency.dependencyFlags = VK_DEPENDENCY_BY_REGION_BIT; in Create()
176 dependency.srcStageMask = VK_PIPELINE_STAGE_COLOR_ATTACHMENT_OUTPUT_BIT; in Create()
177 dependency.srcAccessMask = VK_ACCESS_COLOR_ATTACHMENT_WRITE_BIT; in Create()
178 dependency.dstStageMask = 0; in Create()
179 dependency.dstAccessMask = 0; in Create()
182 // If we have coherent support we shouldn't be needing a self dependency in Create()
184 dependency in Create()
249 VkSubpassDependency& dependency = dependencies[currentDependency++]; Create() local
[all...]
/third_party/protobuf/csharp/src/Google.Protobuf/Reflection/
H A DDescriptorPool.cs65 foreach (FileDescriptor dependency in dependencyFiles) in DescriptorPool()
67 AddPackage(dependency.Package, dependency); in DescriptorPool()
73 foreach (FileDescriptor dependency in file.PublicDependencies) in ImportPublicDependencies()
75 if (dependencies.Add(dependency)) in ImportPublicDependencies()
77 ImportPublicDependencies(dependency); in ImportPublicDependencies()
101 foreach (FileDescriptor dependency in dependencies)
103 dependency.DescriptorPool.descriptorsByName.TryGetValue(fullName, out result);
/third_party/node/tools/gyp/pylib/gyp/
H A Dinput.py463 # Look for dependencies. This means that dependency resolution occurs
473 for dependency in target_dict["dependencies"]:
475 gyp.common.ResolveTarget(build_file_path, dependency, None)[0]
479 for dependency in dependencies:
482 dependency,
581 # A list of dependency build file paths that haven't been scheduled yet.
627 dependency = parallel_state.dependencies.pop()
642 dependency,
1480 """Make dependency links fully-qualified relative to the current directory.
1483 dicts. For each target in this dict, keys known to contain dependency
[all...]
H A Dinput_test.py19 def _create_dependency(self, dependent, dependency):
20 dependent.dependencies.append(dependency)
21 dependency.dependents.append(dependent)
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dinput.py463 # Look for dependencies. This means that dependency resolution occurs
473 for dependency in target_dict["dependencies"]:
475 gyp.common.ResolveTarget(build_file_path, dependency, None)[0]
479 for dependency in dependencies:
482 dependency,
581 # A list of dependency build file paths that haven't been scheduled yet.
627 dependency = parallel_state.dependencies.pop()
642 dependency,
1470 """Make dependency links fully-qualified relative to the current directory.
1473 dicts. For each target in this dict, keys known to contain dependency
[all...]
H A Dinput_test.py19 def _create_dependency(self, dependent, dependency):
20 dependent.dependencies.append(dependency)
21 dependency.dependents.append(dependent)
/third_party/skia/third_party/externals/angle2/src/compiler/translator/
H A DBuiltInFunctionEmulator.cpp60 const TSymbolUniqueId &dependency, in addEmulatedFunctionWithDependency()
65 mFunctionDependencies[uniqueId.get()] = dependency.get(); in addEmulatedFunctionWithDependency()
122 // If the function depends on another, mark the dependency as called. in setFunctionCalled()
123 auto dependency = mFunctionDependencies.find(uniqueId); in setFunctionCalled() local
124 if (dependency != mFunctionDependencies.end()) in setFunctionCalled()
126 setFunctionCalled((*dependency).second); in setFunctionCalled()
59 addEmulatedFunctionWithDependency( const TSymbolUniqueId &dependency, const TSymbolUniqueId &uniqueId, const char *emulatedFunctionDefinition) addEmulatedFunctionWithDependency() argument
/third_party/protobuf/src/google/protobuf/compiler/java/
H A Djava_shared_code_generator.cc164 std::string filename = file_->dependency(i)->name(); in GenerateDescriptors()
165 std::string package = FileJavaPackage(file_->dependency(i)); in GenerateDescriptors()
167 name_resolver_->GetDescriptorClassName(file_->dependency(i)); in GenerateDescriptors()
186 const std::string& dependency = dependencies[i].second; in GenerateDescriptors() local
187 printer->Print(" $dependency$.getDescriptor(),\n", "dependency", in GenerateDescriptors()
188 dependency); in GenerateDescriptors()
H A Djava_file.cc476 if (ShouldIncludeDependency(file_->dependency(i), true)) { in GenerateDescriptorInitializationCodeForImmutable()
477 std::string dependency = in GenerateDescriptorInitializationCodeForImmutable() local
478 name_resolver_->GetImmutableClassName(file_->dependency(i)); in GenerateDescriptorInitializationCodeForImmutable()
479 printer->Print("$dependency$.getDescriptor();\n", "dependency", in GenerateDescriptorInitializationCodeForImmutable()
480 dependency); in GenerateDescriptorInitializationCodeForImmutable()
580 if (ShouldIncludeDependency(file_->dependency(i), false)) { in GenerateDescriptorInitializationCodeForMutable()
581 std::string dependency = in GenerateDescriptorInitializationCodeForMutable() local
582 name_resolver_->GetMutableClassName(file_->dependency(i)); in GenerateDescriptorInitializationCodeForMutable()
583 printer->Print("$dependency in GenerateDescriptorInitializationCodeForMutable()
[all...]
/third_party/protobuf/python/google/protobuf/
H A Dmessage_factory.py152 # message in topological order of the dependency graph.
155 for dependency in file_proto.dependency:
156 if dependency in file_by_name:
158 _AddFile(file_by_name.pop(dependency))
/third_party/gn/src/gn/
H A Dcommand_analyze.cc78 - "Found dependency"
79 - "No dependency"
80 - "Found dependency (all)"
H A Dcommand_meta.cc47 that it is a label of a valid dependency of the target and then added to the
60 target and all of its dependency tree.
64 //base/foo:foo target and all of its dependency tree.
72 target and all of its dependency tree, rebasing the strings in the `files`
/third_party/mbedtls/tests/scripts/
H A Dgenerate_test_code.py35 that macro should be specified as a dependency of the test.
103 dependency checks, expression evaluation and function dispatch. These
139 dependency Id and return status: if
140 the dependency is defined or not.
272 Split NOT character '!' from dependency. Used by gen_dependencies()
285 dependency list. Caller uses the generated preprocessor code to
287 A dependency in the input list can have a leading '!' character
288 to negate a condition. '!' is separated from the dependency using
306 Similar to gen_dependencies() but generates dependency checks in one line.
394 def validate_dependency(dependency)
[all...]
/third_party/skia/gn/
H A Dgn_to_cmake.py176 for dependency in dependencies:
177 dependency_type = self.targets[dependency].get('type', None)
179 object_dependencies.add(dependency)
181 self.GetObjectSourceDependencies(dependency, object_dependencies)
186 for dependency in dependencies:
187 dependency_type = self.targets[dependency].get('type', None)
189 object_dependencies.add(dependency)
190 self.GetObjectLibraryDependencies(dependency, object_dependencies)
522 for dependency in object_dependencies:
523 cmake_dependency_name = project.GetCMakeTargetName(dependency)
[all...]
/third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/
H A Dsource_helpers.js171 // Add the dependency path.
255 const dependency = loadDependencyAbs(this.baseDir, absPath);
256 dependency.loadDependencies(dependencies, visitedDependencies);
258 // Add the dependency.
259 dependencies.set(absPath, dependency);
418 let dependency = dependencyCache.get(absPath);
419 if (!dependency) {
421 dependency = new CachedSource(source);
422 dependencyCache.set(absPath, dependency);
424 return dependency;
[all...]
H A Ddb.js229 for (let dependency of expression.dependencies) {
230 result = result.replace(new RegExp(dependency, 'g'), 'ID');
253 for (const dependency of expression.dependencies) {
254 dependencies[dependency] = babelTypes.identifier('__v_0');
282 // First pass to collect dependency information.
312 // Unknown dependency. Don't handle this.
324 // Unknown dependency. Don't handle this.
332 // Mark all parents as having a dependency.
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
H A Ddep-valid.js28 er.dependency = child.name
38 const er = new Error('Invalid dependency specifier')
39 er.dependency = child.name
108 const er = new Error('Unsupported dependency type')
109 er.dependency = child.name
/third_party/icu/tools/cldr/cldr-to-icu/src/test/java/org/unicode/icu/tool/cldrtoicu/mapper/
H A DBreakIteratorMapperTest.java100 assertThat(icuData).hasValuesFor("/dictionaries/foo:process(dependency)", "<foo deps>"); in testSpecials_dictionary()
101 assertThat(icuData).hasValuesFor("/dictionaries/bar:process(dependency)", "<bar deps>"); in testSpecials_dictionary()
115 .hasValuesFor("/boundaries/grapheme:process(dependency)", "<grapheme deps>"); in testSpecials_boundaries()
117 .hasValuesFor("/boundaries/sentence_altName:process(dependency)", "<sentence deps>"); in testSpecials_boundaries()
133 private static CldrValue dictionary(String type, String dependency) { in dictionary() argument
137 appendAttribute(cldrPath, "icu:dependency", dependency); in dictionary()
141 private static CldrValue boundaries(BoundaryType type, String dependency, String alt) { in boundaries() argument
144 appendAttribute(cldrPath, "icu:dependency", dependency); in boundaries()
[all...]
/third_party/node/deps/v8/src/heap/cppgc-js/
H A Dcpp-snapshot.cc178 // The object was not visible (above case). Having a dependency on itself in FollowDependencies()
215 void MarkDependentVisibility(StateBase* dependency) { in MarkDependentVisibility() argument
217 dependency = dependency->FollowDependencies(); in MarkDependentVisibility()
218 DCHECK(dependency->IsVisited()); in MarkDependentVisibility()
220 // Already visible, no dependency needed. in MarkDependentVisibility()
224 if (dependency->visibility_ == Visibility::kVisible) { in MarkDependentVisibility()
231 (visibility_dependency_->state_count_ > dependency->state_count_)) || in MarkDependentVisibility()
233 (state_count_ > dependency->state_count_))) { in MarkDependentVisibility()
235 // ensures that we pick an ancestor as dependency an in MarkDependentVisibility()
[all...]
/third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/mutators/
H A Dcrossover_mutator.js49 for (const dependency of randomExpression.dependencies) {
50 dependencies[dependency] = random.single(variables);
/third_party/rust/crates/rustix/tests/
H A Dbackends.rs26 // and always use std, so it can drop its libc dependency. in test_backends()
91 /// Test whether the crate at directory `dir` has a dependency on `dependency`,
99 dependency: &str, in has_dependency()
107 .arg(&format!("--invert={}", dependency)) in has_dependency()
121 // a non-zero status if the dependency is not present in the Cargo.toml in has_dependency()
123 // the dependency is present but optional and not enabled. So we check for in has_dependency()
/third_party/protobuf/php/src/Google/Protobuf/Internal/
H A DFileDescriptorProto.php35 * Generated from protobuf field <code>repeated string dependency = 3;</code>
37 private $dependency; variable
39 * Indexes of the public imported files in the dependency list above.
45 * Indexes of the weak imported files in the dependency list.
100 * @type string[]|\Google\Protobuf\Internal\RepeatedField $dependency
103 * Indexes of the public imported files in the dependency list above.
105 * Indexes of the weak imported files in the dependency list.
203 * Generated from protobuf field <code>repeated string dependency = 3;</code>
208 return $this->dependency;
214 * Generated from protobuf field <code>repeated string dependency
221 $this->dependency = $arr; global() variable
[all...]

Completed in 16 milliseconds

12345678