Home
last modified time | relevance | path

Searched refs:Unvisited (Results 1 – 3 of 3) sorted by relevance

/external/swiftshader/third_party/LLVM/lib/Analysis/
DProfileInfo.cpp662 std::set<const BasicBlock*> Unvisited; in repair() local
677 Unvisited.insert(BB); in repair()
701 if (Unvisited.insert(*NBB).second) { in repair()
707 while (Unvisited.size() > 0) { in repair()
708 unsigned oldUnvisitedCount = Unvisited.size(); in repair()
719 Unvisited.erase(e.first); in repair()
726 std::set<const BasicBlock *>::iterator FI = Unvisited.begin(), FE = Unvisited.end(); in repair()
734 Unvisited.erase(BB); in repair()
741 if (oldUnvisitedCount > Unvisited.size()) continue; in repair()
744 FI = Unvisited.begin(), FE = Unvisited.end(); in repair()
[all …]
/external/v8/src/compiler/
Dstore-store-elimination.cc100 static UnobservablesSet Unvisited();
345 UnobservablesSet::Unvisited(), temp_zone), in RedundantStoreFinder()
414 UnobservablesSet cur_set = UnobservablesSet::Unvisited(); // irrelevant in RecomputeUseIntersection()
459 UnobservablesSet UnobservablesSet::Unvisited() { return UnobservablesSet(); } in Unvisited() function in v8::internal::compiler::UnobservablesSet
478 return Unvisited(); in Intersect()
/external/spirv-llvm/lib/SPIRV/libSPIRV/
DSPIRVModule.cpp1178 Unvisited, enumerator
1247 EntryStateMap[T] = DFSState::Unvisited;
1249 EntryStateMap[C] = DFSState::Unvisited;
1251 EntryStateMap[V] = DFSState::Unvisited;