Lines Matching full:visited
672 SmallPtrSet<BasicBlock*, 64> Visited;
683 if (!Visited.insert(DirtyBB))
779 DenseMap<BasicBlock*, Value*> Visited;
781 Result, Visited, true))
897 /// results to the results vector and keep track of which blocks are visited in
898 /// 'Visited'.
912 DenseMap<BasicBlock*, Value*> &Visited,
949 isLoad, StartBB, Result, Visited,
968 isLoad, StartBB, Result, Visited,
979 // cached results and populate the visited set. However, we have to verify
981 // to ensure that if a block in the results set is in the visited set that
983 if (!Visited.empty()) {
986 DenseMap<BasicBlock*, Value*>::iterator VI = Visited.find(I->getBB());
987 if (VI == Visited.end() || VI->second == Pointer.getAddr())
1000 Visited.insert(std::make_pair(I->getBB(), Addr));
1047 assert(Visited.count(BB) && "Should check 'visited' before adding to WL");
1079 InsertRes = Visited.insert(std::make_pair(*PI, Pointer.getAddr()));
1090 // Make sure to clean up the Visited map before continuing on to
1093 Visited.erase(NewBlocks[i]);
1129 // Check to see if we have already visited this pred block with another
1135 InsertRes = Visited.insert(std::make_pair(Pred, PredPtrVal));
1141 // If the predecessor was visited with PredPtr, then we already did
1150 // Make sure to clean up the Visited map before continuing on to
1153 Visited.erase(PredList[i].first);
1183 // result conflicted with the Visited list; we have to conservatively
1189 Result, Visited)) {
