Lines Matching defs:Visited
677 SmallPtrSet<BasicBlock*, 64> Visited;
688 if (!Visited.insert(DirtyBB))
784 DenseMap<BasicBlock*, Value*> Visited;
786 Result, Visited, true))
902 /// results to the results vector and keep track of which blocks are visited in
903 /// 'Visited'.
917 DenseMap<BasicBlock*, Value*> &Visited,
954 isLoad, StartBB, Result, Visited,
973 isLoad, StartBB, Result, Visited,
984 // cached results and populate the visited set. However, we have to verify
986 // to ensure that if a block in the results set is in the visited set that
988 if (!Visited.empty()) {
991 DenseMap<BasicBlock*, Value*>::iterator VI = Visited.find(I->getBB());
992 if (VI == Visited.end() || VI->second == Pointer.getAddr())
1005 Visited.insert(std::make_pair(I->getBB(), Addr));
1052 assert(Visited.count(BB) && "Should check 'visited' before adding to WL");
1084 InsertRes = Visited.insert(std::make_pair(*PI, Pointer.getAddr()));
1095 // Make sure to clean up the Visited map before continuing on to
1098 Visited.erase(NewBlocks[i]);
1134 // Check to see if we have already visited this pred block with another
1140 InsertRes = Visited.insert(std::make_pair(Pred, PredPtrVal));
1146 // If the predecessor was visited with PredPtr, then we already did
1155 // Make sure to clean up the Visited map before continuing on to
1158 Visited.erase(PredList[i].first);
1188 // result conflicted with the Visited list; we have to conservatively
1194 Result, Visited)) {
