Lines Matching refs:Visited
634 SmallPtrSet<BasicBlock*, 64> Visited;
645 if (!Visited.insert(DirtyBB))
741 DenseMap<BasicBlock*, Value*> Visited;
743 Result, Visited, true))
859 /// results to the results vector and keep track of which blocks are visited in
860 /// 'Visited'.
874 DenseMap<BasicBlock*, Value*> &Visited,
912 isLoad, StartBB, Result, Visited,
931 isLoad, StartBB, Result, Visited,
942 // cached results and populate the visited set. However, we have to verify
944 // to ensure that if a block in the results set is in the visited set that
946 if (!Visited.empty()) {
949 DenseMap<BasicBlock*, Value*>::iterator VI = Visited.find(I->getBB());
950 if (VI == Visited.end() || VI->second == Pointer.getAddr())
963 Visited.insert(std::make_pair(I->getBB(), Addr));
1001 assert(Visited.count(BB) && "Should check 'visited' before adding to WL");
1026 InsertRes = Visited.insert(std::make_pair(*PI, Pointer.getAddr()));
1037 // Make sure to clean up the Visited map before continuing on to
1040 Visited.erase(NewBlocks[i]);
1076 // Check to see if we have already visited this pred block with another
1082 InsertRes = Visited.insert(std::make_pair(Pred, PredPtrVal));
1088 // If the predecessor was visited with PredPtr, then we already did
1097 // Make sure to clean up the Visited map before continuing on to
1100 Visited.erase(PredList[i].first);
1130 // result conflicted with the Visited list; we have to conservatively
1136 Result, Visited)) {
