Lines Matching full:visited
722 SmallPtrSet<BasicBlock*, 64> Visited;
733 if (!Visited.insert(DirtyBB))
829 DenseMap<BasicBlock*, Value*> Visited;
831 Result, Visited, true))
947 /// results to the results vector and keep track of which blocks are visited in
948 /// 'Visited'.
962 DenseMap<BasicBlock*, Value*> &Visited,
1000 isLoad, StartBB, Result, Visited,
1019 isLoad, StartBB, Result, Visited,
1030 // cached results and populate the visited set. However, we have to verify
1032 // to ensure that if a block in the results set is in the visited set that
1034 if (!Visited.empty()) {
1037 DenseMap<BasicBlock*, Value*>::iterator VI = Visited.find(I->getBB());
1038 if (VI == Visited.end() || VI->second == Pointer.getAddr())
1051 Visited.insert(std::make_pair(I->getBB(), Addr));
1089 assert(Visited.count(BB) && "Should check 'visited' before adding to WL");
1114 InsertRes = Visited.insert(std::make_pair(*PI, Pointer.getAddr()));
1125 // Make sure to clean up the Visited map before continuing on to
1128 Visited.erase(NewBlocks[i]);
1164 // Check to see if we have already visited this pred block with another
1170 InsertRes = Visited.insert(std::make_pair(Pred, PredPtrVal));
1176 // If the predecessor was visited with PredPtr, then we already did
1185 // Make sure to clean up the Visited map before continuing on to
1188 Visited.erase(PredList[i].first);
1218 // result conflicted with the Visited list; we have to conservatively
1224 Result, Visited)) {
