reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
132 member_iterator LeaderIt = member_begin(insert(*MI)); 134 unionSets(LeaderIt, member_begin(insert(*MI))); 173 return *MI; 182 return *MI; 272 pointer operator->() const { return &operator*(); }lib/Analysis/LoopAccessAnalysis.cpp
1656 Visited.insert(*AI); 1664 for (std::vector<unsigned>::iterator I1 = Accesses[*AI].begin(), 1665 I1E = Accesses[*AI].end(); I1 != I1E; ++I1) 1669 I2 = (OI == AI ? std::next(I1) : Accesses[*OI].begin()), 1670 I2E = (OI == AI ? I1E : Accesses[*OI].end()); 1672 auto A = std::make_pair(&*AI, *I1); 1673 auto B = std::make_pair(&*OI, *I2);lib/Analysis/VectorUtils.cpp
474 LeaderDemandedBits |= DBits[*MI]; 488 if (isa<PHINode>(*MI) && MinBW < (*MI)->getType()->getScalarSizeInBits()) { 488 if (isa<PHINode>(*MI) && MinBW < (*MI)->getType()->getScalarSizeInBits()) { 496 if (!isa<Instruction>(*MI)) 498 Type *Ty = (*MI)->getType(); 499 if (Roots.count(*MI)) 500 Ty = cast<Instruction>(*MI)->getOperand(0)->getType(); 502 MinBWs[cast<Instruction>(*MI)] = MinBW;lib/Transforms/Scalar/Float2Int.cpp
364 Instruction *I = *MI; 428 convert(*MI, Ty);lib/Transforms/Scalar/LoopDistribute.cpp
401 for (auto PartJ : make_range(std::next(ToBeMerged.member_begin(I)),
lib/Transforms/Utils/SplitModule.cpp202 if (!Visited.insert(*MI).second) 204 LLVM_DEBUG(dbgs() << "----> " << (*MI)->getName() 205 << ((*MI)->hasLocalLinkage() ? " l " : " e ") << "\n"); 206 Visited.insert(*MI); 207 ClusterIDMap[*MI] = CurrentClusterID;tools/polly/lib/Analysis/ScopBuilder.cpp
2137 (void)LeaderToInstList[*LeaderIt]; 2148 MainLeader = *LeaderIt; 2149 std::vector<Instruction *> &InstList = LeaderToInstList[*LeaderIt];usr/include/c++/7.4.0/bits/stl_algobase.h
294 *__result = *__first;