Home
last modified time | relevance | path

Searched refs:visited (Results 26 - 50 of 120) sorted by relevance

12345

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
H A DDominanceFrontierImpl.h166 SmallPtrSet<BlockT *, 32> visited; in calculate() local
182 if (visited.insert(currentBB).second) { in calculate()
200 if (visited.count(childBB) == 0) { in calculate()
207 // If all children are visited or there is any child then pop this block in calculate()
H A DRegionInfoImpl.h279 void RegionBase<Tr>::verifyWalk(BlockT *BB, std::set<BlockT *> *visited) const { in verifyWalk()
282 visited->insert(BB); in verifyWalk()
288 if (Succ != exit && visited->find(Succ) == visited->end()) in verifyWalk()
289 verifyWalk(Succ, visited); in verifyWalk()
301 std::set<BlockT *> visited; in verifyRegion()
302 verifyWalk(getEntry(), &visited); in verifyRegion() local
/third_party/node/deps/v8/src/compiler/
H A Dmemory-optimizer.cc101 ZoneSet<Node*> visited(temp_zone); in SearchAllocatingNode()
102 visited.insert(limit); in SearchAllocatingNode()
108 if (visited.find(current) == visited.end()) { in SearchAllocatingNode()
109 visited.insert(current); in SearchAllocatingNode()
H A Dcontrol-equivalence.h87 visited(false), in NodeData()
92 bool visited : 1; // Indicates node has already been visited. member
115 // \ / - Pre-visit: When N1 is visited in direction D the preferred
118 // | N been visited, we switch the direction and start considering
121 // / \ to D have been visited, we pop N and call VisitPost(N).
H A Dloop-analysis.cc555 auto* visited = zone->New<ZoneUnorderedSet<Node*>>(zone); in FindSmallInnermostLoopFromHeader() local
564 if (condition && visited->count(use_name) == 0) queue.push_back(use_name); \ in FindSmallInnermostLoopFromHeader()
574 visited->insert(node); in FindSmallInnermostLoopFromHeader()
575 if (visited->size() > max_size) return nullptr; in FindSmallInnermostLoopFromHeader()
653 for (Node* node : *visited) { in FindSmallInnermostLoopFromHeader()
659 if (NodeProperties::IsControlEdge(edge) && visited->count(input) == 0 && in FindSmallInnermostLoopFromHeader()
671 return visited; in FindSmallInnermostLoopFromHeader()
/third_party/spirv-tools/source/
H A Dcfa.h45 /// @param[in] work_list Set of blocks visited in the depth first
312 // The set of nodes which have been visited from any of the roots so far. in TraversalRoots()
313 std::unordered_set<const BB*> visited; in TraversalRoots() local
315 auto mark_visited = [&visited](const BB* b) { visited.insert(b); }; in TraversalRoots()
330 assert(visited.count(block) == 0 && "Malformed graph!"); in TraversalRoots()
338 if (visited.count(block) == 0) { in TraversalRoots()
/third_party/node/deps/v8/src/ast/
H A Dast-function-literal-id-reindexer.cc28 // Make sure we're not already in the visited set. in VisitFunctionLiteral()
56 // already have been visited. in VisitClassLiteral()
69 // already have been visited. in VisitClassLiteral()
92 const std::set<FunctionLiteral*>* visited) in AstFunctionLiteralIdReindexChecker()
93 : AstTraversalVisitor(stack_limit), visited_(visited) {} in AstFunctionLiteralIdReindexChecker()
91 AstFunctionLiteralIdReindexChecker(size_t stack_limit, const std::set<FunctionLiteral*>* visited) AstFunctionLiteralIdReindexChecker() argument
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dupgrade_memory_model.cpp313 std::unordered_set<uint32_t> visited; in GetInstructionAttributes() local
316 std::vector<uint32_t>(), &visited); in GetInstructionAttributes()
323 std::unordered_set<uint32_t>* visited) { in TraceInstruction()
329 if (!visited->insert(inst->result_id()).second) { in TraceInstruction()
383 &visited](const uint32_t* id_ptr) { in TraceInstruction()
392 TraceInstruction(op_inst, indices, visited); in TraceInstruction()
450 std::unordered_set<const Instruction*> visited; in CheckAllTypes() local
460 if (!visited.insert(def).second) continue; in CheckAllTypes()
321 TraceInstruction( Instruction* inst, std::vector<uint32_t> indices, std::unordered_set<uint32_t>* visited) TraceInstruction() argument
H A Ddead_branch_elim_pass.cpp106 // Live blocks doubles as visited set. in MarkLiveBlocks()
609 std::unordered_set<uint32_t> visited; in AddBlocksWithBackEdge() local
610 visited.insert(cont_id); in AddBlocksWithBackEdge()
611 visited.insert(header_id); in AddBlocksWithBackEdge()
612 visited.insert(merge_id); in AddBlocksWithBackEdge()
624 bb->ForEachSuccessorLabel([header_id, &visited, &work_list, in AddBlocksWithBackEdge()
626 if (visited.insert(*succ_label_id).second) { in AddBlocksWithBackEdge()
H A Dupgrade_memory_model.h80 std::unordered_set<uint32_t>* visited);
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dupgrade_memory_model.cpp313 std::unordered_set<uint32_t> visited; in GetInstructionAttributes() local
316 std::vector<uint32_t>(), &visited); in GetInstructionAttributes()
323 std::unordered_set<uint32_t>* visited) { in TraceInstruction()
329 if (!visited->insert(inst->result_id()).second) { in TraceInstruction()
383 &visited](const uint32_t* id_ptr) { in TraceInstruction()
392 TraceInstruction(op_inst, indices, visited); in TraceInstruction()
450 std::unordered_set<const Instruction*> visited; in CheckAllTypes() local
460 if (!visited.insert(def).second) continue; in CheckAllTypes()
321 TraceInstruction( Instruction* inst, std::vector<uint32_t> indices, std::unordered_set<uint32_t>* visited) TraceInstruction() argument
H A Ddead_branch_elim_pass.cpp106 // Live blocks doubles as visited set. in MarkLiveBlocks()
609 std::unordered_set<uint32_t> visited; in AddBlocksWithBackEdge() local
610 visited.insert(cont_id); in AddBlocksWithBackEdge()
611 visited.insert(header_id); in AddBlocksWithBackEdge()
612 visited.insert(merge_id); in AddBlocksWithBackEdge()
624 bb->ForEachSuccessorLabel([header_id, &visited, &work_list, in AddBlocksWithBackEdge()
626 if (visited.insert(*succ_label_id).second) { in AddBlocksWithBackEdge()
H A Dupgrade_memory_model.h80 std::unordered_set<uint32_t>* visited);
/third_party/spirv-tools/source/opt/
H A Dupgrade_memory_model.cpp315 std::unordered_set<uint32_t> visited; in GetInstructionAttributes() local
318 std::vector<uint32_t>(), &visited); in GetInstructionAttributes()
325 std::unordered_set<uint32_t>* visited) { in TraceInstruction()
331 if (!visited->insert(inst->result_id()).second) { in TraceInstruction()
385 &visited](const uint32_t* id_ptr) { in TraceInstruction()
394 TraceInstruction(op_inst, indices, visited); in TraceInstruction()
452 std::unordered_set<const Instruction*> visited; in CheckAllTypes() local
462 if (!visited.insert(def).second) continue; in CheckAllTypes()
323 TraceInstruction( Instruction* inst, std::vector<uint32_t> indices, std::unordered_set<uint32_t>* visited) TraceInstruction() argument
H A Ddead_branch_elim_pass.cpp102 // Live blocks doubles as visited set. in MarkLiveBlocks()
597 std::unordered_set<uint32_t> visited; in AddBlocksWithBackEdge() local
598 visited.insert(cont_id); in AddBlocksWithBackEdge()
599 visited.insert(header_id); in AddBlocksWithBackEdge()
600 visited.insert(merge_id); in AddBlocksWithBackEdge()
612 bb->ForEachSuccessorLabel([header_id, &visited, &work_list, in AddBlocksWithBackEdge()
614 if (visited.insert(*succ_label_id).second) { in AddBlocksWithBackEdge()
H A Dupgrade_memory_model.h80 std::unordered_set<uint32_t>* visited);
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/
H A DRangeTreeTest.java271 assertThat(v.visited).hasSize(10); in testVisitor()
273 assertThat(v.visited.stream().map(Edge::source).filter(initial::equals).count()).isEqualTo(2); in testVisitor()
274 assertThat(v.visited.stream().map(Edge::target).filter(terminal::equals).count()).isEqualTo(4); in testVisitor()
277 assertThat(v.visited.get(n).digitMask()).isEqualTo(1 << n); in testVisitor()
520 // Range tree visitor that captures edges visited (in depth first order)
522 List<Edge> visited = new ArrayList<>(); field in RangeTreeTest.TestVisitor
526 visited.add(Edge.of(source, target, edge)); in visit()
/third_party/gn/src/gn/
H A Drust_project_writer.h34 static void VisitDeps(const Target* target, TargetSet* visited);
H A Dtarget.cc150 // visited should point to an empty set, this will be used to prevent
162 TargetSet* visited, in RecursiveCheckAssertNoDeps()
167 if (!visited->add(target)) in RecursiveCheckAssertNoDeps()
187 if (!RecursiveCheckAssertNoDeps(pair.ptr, true, assert_no, visited, in RecursiveCheckAssertNoDeps()
1186 TargetSet visited; in CheckAssertNoDeps()
1190 if (!RecursiveCheckAssertNoDeps(this, false, assert_no_deps_, &visited, in CheckAssertNoDeps()
159 RecursiveCheckAssertNoDeps(const Target* target, bool check_this, const std::vector<LabelPattern>& assert_no, TargetSet* visited, std::string* failure_path_str, const LabelPattern** failure_pattern) RecursiveCheckAssertNoDeps() argument
/third_party/node/test/sequential/
H A Dtest-module-loading.js269 const visited = new Set();
271 if (visited.has(child)) return set;
272 visited.add(child);
/third_party/node/deps/v8/src/objects/
H A Dmodule.cc306 UnorderedModuleSet visited(&zone); in GetModuleNamespace()
310 isolate, Handle<SourceTextModule>::cast(module), &zone, &visited); in GetModuleNamespace()
462 ZoneUnorderedSet<Module, Module::Hash> visited(&zone, bucket_count); in IsGraphAsync()
464 visited.insert(root); in IsGraphAsync()
477 const bool cycle = !visited.insert(descendant).second; in IsGraphAsync()
/foundation/resourceschedule/ffrt/src/util/
H A Dgraph_check.h25 bool visited; member
/third_party/node/deps/v8/src/regexp/
H A Dregexp-dotprinter.cc52 if (node->info()->visited) return; in Visit()
53 node->info()->visited = true; in Visit()
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-ot-layout.cc1033 bool visited (const OT::Script &s) in visited() function
1044 return visited (s, visited_script); in visited()
1046 bool visited (const OT::LangSys &l) in visited() function
1057 return visited (l, visited_langsys); in visited()
1068 bool visited (const T &p, hb_set_t &visited_set) in visited() function
1096 if (c->visited (l)) return; in langsys_collect_features()
1128 if (c->visited (s)) return; in script_collect_features()
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/grid/irregular/
H A Dgrid_irregular_filler.cpp306 std::unordered_set<int32_t> visited; in MeasureLineWithIrregulars() local
313 if (itemIdx < 0 && !visited.count(std::abs(itemIdx))) { in MeasureLineWithIrregulars()
316 visited.insert(std::abs(itemIdx)); in MeasureLineWithIrregulars()

Completed in 21 milliseconds

12345