Lines Matching defs:Visited
618 SmallPtrSet<BasicBlock*, 64> Visited;
629 if (!Visited.insert(DirtyBB))
725 DenseMap<BasicBlock*, Value*> Visited;
727 Result, Visited, true))
843 /// results to the results vector and keep track of which blocks are visited in
844 /// 'Visited'.
858 DenseMap<BasicBlock*, Value*> &Visited,
896 isLoad, StartBB, Result, Visited,
915 isLoad, StartBB, Result, Visited,
926 // cached results and populate the visited set. However, we have to verify
928 // to ensure that if a block in the results set is in the visited set that
930 if (!Visited.empty()) {
933 DenseMap<BasicBlock*, Value*>::iterator VI = Visited.find(I->getBB());
934 if (VI == Visited.end() || VI->second == Pointer.getAddr())
947 Visited.insert(std::make_pair(I->getBB(), Addr));
985 assert(Visited.count(BB) && "Should check 'visited' before adding to WL");
1010 InsertRes = Visited.insert(std::make_pair(*PI, Pointer.getAddr()));
1021 // Make sure to clean up the Visited map before continuing on to
1024 Visited.erase(NewBlocks[i]);
1060 // Check to see if we have already visited this pred block with another
1066 InsertRes = Visited.insert(std::make_pair(Pred, PredPtrVal));
1072 // If the predecessor was visited with PredPtr, then we already did
1081 // Make sure to clean up the Visited map before continuing on to
1084 Visited.erase(PredList[i].first);
1114 // result conflicted with the Visited list; we have to conservatively
1120 Result, Visited)) {
