lib/Analysis/MemoryDependenceAnalysis.cpp

252 /// MemLocBase, MemLocOffset are lazily computed here the first time the
632   NonLocalDepInfo &Cache = CacheP.first;
900 /// This has special behavior for the first block queries (when SkipFirstBlock
906 /// as a clobber dependence on the first instruction in the predecessor block.
929   NonLocalPointerInfo *CacheInfo = &Pair.first->second;
1043     // Skip the first block if we have it.
1089         if (InsertRes.first->second != Pointer.getAddr()) {
1133       // pointer the block was first analyzed with.
1143         if (InsertRes.first->second == PredPtrVal)
1153           Visited.erase(PredList[i].first);
1165       BasicBlock *Pred = PredList[i].first;
1238     // If this is the magic first block, return this as a clobber of the whole
1320     NonLocalDepInfo &BlockMap = NLDI->second.first;
1392       ReverseLocalDeps[ReverseDepsToAdd.back().first]
1409       for (NonLocalDepInfo::iterator DI = INLD.first.begin(),
1410            DE = INLD.first.end(); DI != DE; ++DI) {
1425       ReverseNonLocalDeps[ReverseDepsToAdd.back().first]
1470       ReverseNonLocalPtrDeps[ReversePtrDepsToAdd.back().first]
1486     assert(I->first != D && "Inst occurs in data structures");
1493     assert(I->first.getPointer() != D && "Inst occurs in NLPD map key");
1502     assert(I->first != D && "Inst occurs in data structures");
1504     for (NonLocalDepInfo::const_iterator II = INLD.first.begin(),
1505          EE = INLD.first.end(); II  != EE; ++II)
1511     assert(I->first != D && "Inst occurs in data structures");
1520     assert(I->first != D && "Inst occurs in data structures");
1529     assert(I->first != D && "Inst occurs in rev NLPD map");