Lines Matching full:visited
859 SmallPtrSet<BasicBlock*, 64> Visited;
870 if (!Visited.insert(DirtyBB).second)
993 DenseMap<BasicBlock*, Value*> Visited;
995 Result, Visited, true))
1111 /// results to the results vector and keep track of which blocks are visited in
1112 /// 'Visited'.
1125 DenseMap<BasicBlock *, Value *> &Visited, bool SkipFirstBlock) {
1161 isLoad, StartBB, Result, Visited,
1181 isLoad, StartBB, Result, Visited,
1192 // cached results and populate the visited set. However, we have to verify
1194 // to ensure that if a block in the results set is in the visited set that
1196 if (!Visited.empty()) {
1199 DenseMap<BasicBlock*, Value*>::iterator VI = Visited.find(I->getBB());
1200 if (VI == Visited.end() || VI->second == Pointer.getAddr())
1213 Visited.insert(std::make_pair(I->getBB(), Addr));
1278 assert(Visited.count(BB) && "Should check 'visited' before adding to WL");
1311 InsertRes = Visited.insert(std::make_pair(Pred, Pointer.getAddr()));
1322 // Make sure to clean up the Visited map before continuing on to
1325 Visited.erase(NewBlocks[i]);
1359 // Check to see if we have already visited this pred block with another
1365 InsertRes = Visited.insert(std::make_pair(Pred, PredPtrVal));
1371 // If the predecessor was visited with PredPtr, then we already did
1380 // Make sure to clean up the Visited map before continuing on to
1383 Visited.erase(PredList[i].first);
1413 // result conflicted with the Visited list; we have to conservatively
1419 Result, Visited)) {
