Home
last modified time | relevance | path

Searched refs:ancestor (Results 1 - 25 of 31) sorted by relevance

12

/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Davailable_instructions.cpp160 for (auto* ancestor = block; true; in operator []()
161 ancestor = dominator_analysis->ImmediateDominator(ancestor)) { in operator []()
163 available_instructions_.num_available_at_block_entry_.at(ancestor); in operator []()
170 available_instructions_.generated_by_block_.at(ancestor); in operator []()
182 assert(ancestor != &*function->begin() && in operator []()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Davailable_instructions.cpp160 for (auto* ancestor = block; true; in operator []()
161 ancestor = dominator_analysis->ImmediateDominator(ancestor)) { in operator []()
163 available_instructions_.num_available_at_block_entry_.at(ancestor); in operator []()
170 available_instructions_.generated_by_block_.at(ancestor); in operator []()
182 assert(ancestor != &*function->begin() && in operator []()
/third_party/spirv-tools/source/fuzz/
H A Davailable_instructions.cpp160 for (auto* ancestor = block; true; in operator []()
161 ancestor = dominator_analysis->ImmediateDominator(ancestor)) { in operator []()
163 available_instructions_.num_available_at_block_entry_.at(ancestor); in operator []()
170 available_instructions_.generated_by_block_.at(ancestor); in operator []()
182 assert(ancestor != &*function->begin() && in operator []()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
H A Doverride-set.js119 for (let ancestor = this; ancestor; ancestor = ancestor.parent) {
120 yield ancestor
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/
H A DDiscoverEnclosingFunctionTraverser.cpp23 while (TIntermNode *ancestor = getAncestorNode(height)) in discoverEnclosingFunction()
25 if (TIntermFunctionDefinition *funcDefNode = ancestor->getAsFunctionDefinition()) in discoverEnclosingFunction()
/third_party/node/test/fixtures/wpt/resources/
H A Dcheck-layout.js18 var ancestor = node.parentNode;
19 while (getComputedStyle(ancestor).position == 'static')
20 ancestor = ancestor.parentNode;
21 return ancestor;
/third_party/node/deps/v8/src/objects/
H A Dsource-text-module.cc434 Handle<SourceTextModule> ancestor; in MaybeTransitionComponent() local
436 ancestor = stack->front(); in MaybeTransitionComponent()
438 DCHECK_EQ(ancestor->status(), in MaybeTransitionComponent()
441 if (!SourceTextModule::RunInitializationCode(isolate, ancestor)) in MaybeTransitionComponent()
444 DCHECK(ancestor->cycle_root().IsTheHole(isolate)); in MaybeTransitionComponent()
445 ancestor->set_cycle_root(*cycle_root); in MaybeTransitionComponent()
447 ancestor->SetStatus(new_status); in MaybeTransitionComponent()
448 } while (*ancestor != *module); in MaybeTransitionComponent()
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/apple/
H A DRewriteRowMajorMatrices.cpp886 TIntermTyped *ancestor = getAncestorNode(accessorIndex)->getAsTyped(); in transformExpression() local
887 ASSERT(ancestor); in transformExpression()
892 TOperator op = GetIndex(mSymbolTable, ancestor, &indices, &prependStatements); in transformExpression()
902 // If primary index is seen and the ancestor is still an index, it must be a direct in transformExpression()
936 ReplicateIndexNode(mSymbolTable, ancestor, baseExpression, &indices); in transformExpression()
938 const TType &ancestorType = ancestor->getType(); in transformExpression()
943 IsConvertedField(ancestor, mInterfaceBlockFieldConvertedIn); in transformExpression()
955 previousAncestor = ancestor; in transformExpression()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Dload-actual.js8 const ancestorPath = require('common-ancestor-path')
376 const ancestor = ancestorPath(node.realpath, this.path)
389 // only walk as far as the nearest ancestor
394 // from the nearest common ancestor, we've gone too far.
395 if (ancestor && /^\.\.(?:[\\/]|$)/.test(relative(ancestor, p))) {
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DIntermTraverse.cpp616 TIntermNode *ancestor = getAncestorNode(ancestorIndex); in queueAccessChainReplacement() local
617 ASSERT(ancestor != nullptr); in queueAccessChainReplacement()
619 TIntermBinary *asBinary = ancestor->getAsBinaryNode(); in queueAccessChainReplacement()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Ddebug_info_manager.h226 // Returns true if a scope |ancestor| is |scope| or an ancestor scope
228 bool IsAncestorOfScope(uint32_t scope, uint32_t ancestor);
H A Ddebug_info_manager.cpp504 bool DebugInfoManager::IsAncestorOfScope(uint32_t scope, uint32_t ancestor) { in IsAncestorOfScope() argument
507 if (ancestor == ancestor_scope_itr) return true; in IsAncestorOfScope()
538 // If the scope of DebugDeclare is an ancestor scope of the instruction's in IsDeclareVisibleToInstr()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Ddebug_info_manager.h226 // Returns true if a scope |ancestor| is |scope| or an ancestor scope
228 bool IsAncestorOfScope(uint32_t scope, uint32_t ancestor);
H A Ddebug_info_manager.cpp504 bool DebugInfoManager::IsAncestorOfScope(uint32_t scope, uint32_t ancestor) { in IsAncestorOfScope() argument
507 if (ancestor == ancestor_scope_itr) return true; in IsAncestorOfScope()
538 // If the scope of DebugDeclare is an ancestor scope of the instruction's in IsDeclareVisibleToInstr()
/third_party/spirv-tools/source/opt/
H A Ddebug_info_manager.h225 // Returns true if a scope |ancestor| is |scope| or an ancestor scope
227 bool IsAncestorOfScope(uint32_t scope, uint32_t ancestor);
H A Ddebug_info_manager.cpp516 bool DebugInfoManager::IsAncestorOfScope(uint32_t scope, uint32_t ancestor) { in IsAncestorOfScope() argument
519 if (ancestor == ancestor_scope_itr) return true; in IsAncestorOfScope()
550 // If the scope of DebugDeclare is an ancestor scope of the instruction's in IsDeclareVisibleToInstr()
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/
H A Dmutex.cc852 // "ancestor" appears before "to_be_removed" in the same Mutex waiter queue.
854 // Check whether "ancestor" has a skip field pointing to "to_be_removed",
856 static void FixSkip(PerThreadSynch *ancestor, PerThreadSynch *to_be_removed) { in FixSkip() argument
857 if (ancestor->skip == to_be_removed) { // ancestor->skip left dangling in FixSkip()
859 ancestor->skip = to_be_removed->skip; // can skip past to_be_removed in FixSkip()
860 } else if (ancestor->next != to_be_removed) { // they are not adjacent in FixSkip()
861 ancestor->skip = ancestor->next; // can skip one past ancestor in FixSkip()
[all...]
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/spec_tools/
H A Dconsistency_tools.py167 before performing "ancestor propagation".
786 # The sets of return codes corresponding to each ancestor type.
787 ancestors_codes = [types_to_codes.get(ancestor, set())
788 for ancestor in ancestors]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/
H A DOutputHLSL.cpp208 TIntermNode *ancestor = getAncestorNode(n); in needStructMapping() local
209 const TIntermBinary *ancestorBinary = ancestor->getAsBinaryNode(); in needStructMapping()
235 const TIntermAggregate *ancestorAggregate = ancestor->getAsAggregate(); in needStructMapping()
1397 TIntermNode *ancestor = getAncestorNode(n); in ancestorEvaluatesToSamplerInStruct() local
1398 const TIntermBinary *ancestorBinary = ancestor->getAsBinaryNode(); in ancestorEvaluatesToSamplerInStruct()
/third_party/protobuf/java/compatibility_tests/v2.5.0/tests/src/main/java/com/google/protobuf/test/
H A DTestUtil.java2974 File ancestor = new File("."); in getTestDataDir()
2976 ancestor = ancestor.getCanonicalFile(); in getTestDataDir()
2981 while (ancestor != null && ancestor.exists()) { in getTestDataDir()
2982 if (new File(ancestor, "src/google/protobuf").exists()) { in getTestDataDir()
2983 return new File(ancestor, "src/google/protobuf/testdata"); in getTestDataDir()
2985 ancestor = ancestor.getParentFile(); in getTestDataDir()
/third_party/rust/crates/bindgen/bindgen/ir/
H A Dcontext.rs1239 .any(|ancestor| { in assert_every_item_in_a_module()
1242 id, ancestor in assert_every_item_in_a_module()
1244 self.resolve_item(ancestor) in assert_every_item_in_a_module()
1251 "{:?} should be in some ancestor module's children set", in assert_every_item_in_a_module()
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
H A DTestUtil.java3766 File ancestor = new File(System.getProperty("protobuf.dir", ".")); in getTestDataDir()
3767 String initialPath = ancestor.getAbsolutePath(); in getTestDataDir()
3769 ancestor = ancestor.getCanonicalFile(); in getTestDataDir()
3773 while (ancestor != null && ancestor.exists()) { in getTestDataDir()
3774 if (new File(ancestor, "src/google/protobuf").exists()) { in getTestDataDir()
3775 return new File(ancestor, "src/google/protobuf/testdata"); in getTestDataDir()
3777 ancestor = ancestor in getTestDataDir()
[all...]
/third_party/node/lib/
H A Drepl.js240 acornWalk.ancestor(ast, {
/third_party/typescript/lib/
H A Dtsserverlibrary.js[all...]
H A Dtsserver.js[all...]

Completed in 82 milliseconds

12