|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Derived Classes
include/llvm/IR/PassManagerInternal.h 137 template <typename T> struct Checker : CheckerBase, T {};
Declarations
include/llvm/Analysis/BasicAliasAnalysis.h 41 class LoopInfo;
include/llvm/Analysis/BlockFrequencyInfo.h 28 class LoopInfo;
include/llvm/Analysis/BlockFrequencyInfoImpl.h 54 class LoopInfo;
include/llvm/Analysis/BranchProbabilityInfo.h 35 class LoopInfo;
include/llvm/Analysis/CFG.h 26 class LoopInfo;
include/llvm/Analysis/DependenceAnalysis.h 50 class LoopInfo;
include/llvm/Analysis/IVDescriptors.h 41 class LoopInfo;
include/llvm/Analysis/LazyBlockFrequencyInfo.h 27 class LoopInfo;
include/llvm/Analysis/LazyBranchProbabilityInfo.h 25 class LoopInfo;
include/llvm/Analysis/LoopInfo.h 58 class LoopInfo;
include/llvm/Analysis/RegionInfo.h 64 class LoopInfo;
include/llvm/Analysis/ValueTracking.h 39 class LoopInfo;
include/llvm/Transforms/Scalar/GVN.h 48 class LoopInfo;
include/llvm/Transforms/Utils/BasicBlockUtils.h 34 class LoopInfo;
include/llvm/Transforms/Utils/Cloning.h 45 class LoopInfo;
include/llvm/Transforms/Utils/LoopRotationUtils.h 21 class LoopInfo;
include/llvm/Transforms/Utils/LoopUtils.h 42 class LoopInfo;
include/llvm/Transforms/Utils/LoopVersioning.h 27 class LoopInfo;
include/llvm/Transforms/Utils/SimplifyIndVar.h 25 class LoopInfo;
include/llvm/Transforms/Utils/UnrollLoop.h 31 class LoopInfo;
include/llvm/Transforms/Vectorize/LoopVectorize.h 72 class LoopInfo;
include/llvm/Transforms/Vectorize/SLPVectorizer.h 40 class LoopInfo;
lib/Transforms/InstCombine/InstCombineInternal.h 60 class LoopInfo;
lib/Transforms/Vectorize/VPlan.h 56 class LoopInfo;
tools/polly/include/polly/CodeGen/Utils.h 23 class LoopInfo;
tools/polly/include/polly/Support/ScopHelper.h 22 class LoopInfo;
tools/polly/include/polly/ZoneAlgo.h 24 class LoopInfo;
References
include/llvm/ADT/STLExtras.h 154 auto adl_begin(ContainerTy &&container)
162 auto adl_end(ContainerTy &&container)
178 auto adl_begin(ContainerTy &&container)
184 auto adl_end(ContainerTy &&container)
244 static yes& test(Inner *I, decltype(I->rbegin()) * = nullptr);
250 static const bool value = sizeof(test<Ty>(nullptr)) == sizeof(yes);
261 auto reverse(ContainerTy &&C,
1165 bool all_of(R &&Range, UnaryPredicate P) {
1186 auto find(R &&Range, const T &Val) -> decltype(adl_begin(Range)) {
include/llvm/Analysis/BasicAliasAnalysis.h 62 LoopInfo *LI;
68 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
include/llvm/Analysis/BlockFrequencyInfo.h 45 const LoopInfo &LI);
93 const LoopInfo &LI);
include/llvm/Analysis/BlockFrequencyInfoImpl.h 550 using LoopInfoT = LoopInfo;
include/llvm/Analysis/BranchProbabilityInfo.h 56 BranchProbabilityInfo(const Function &F, const LoopInfo &LI,
133 void calculate(const Function &F, const LoopInfo &LI,
196 bool calcLoopBranchHeuristics(const BasicBlock *BB, const LoopInfo &LI,
include/llvm/Analysis/CFG.h 70 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
80 const LoopInfo *LI = nullptr);
92 const LoopInfo *LI = nullptr);
106 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
145 bool containsIrreducibleCFG(RPOTraversalT &RPOTraversal, const LoopInfoT &LI) {
include/llvm/Analysis/DependenceAnalysis.h 274 LoopInfo *LI)
338 LoopInfo *LI;
include/llvm/Analysis/DivergenceAnalysis.h 47 const DominatorTree &DT, const LoopInfo &LI,
154 const LoopInfo &LI;
186 const PostDominatorTree &PDT, const LoopInfo &LI,
include/llvm/Analysis/IVUsers.h 97 LoopInfo *LI;
110 IVUsers(Loop *L, AssumptionCache *AC, LoopInfo *LI, DominatorTree *DT,
include/llvm/Analysis/LazyBlockFrequencyInfo.h 42 const LoopInfoT *LI) {
74 const LoopInfoT *LI;
102 LazyBlockFrequencyInfo<Function, LazyBranchProbabilityInfoPass, LoopInfo,
include/llvm/Analysis/LazyBranchProbabilityInfo.h 58 LazyBranchProbabilityInfo(const Function *F, const LoopInfo *LI,
80 const LoopInfo *LI;
include/llvm/Analysis/LoopAccessAnalysis.h 519 AliasAnalysis *AA, DominatorTree *DT, LoopInfo *LI);
610 void analyzeLoop(AliasAnalysis *AA, LoopInfo *LI,
757 LoopInfo *LI;
include/llvm/Analysis/LoopAnalysisManager.h 57 LoopInfo &LI;
88 explicit Result(LoopAnalysisManager &InnerAM, LoopInfo &LI)
137 LoopInfo *LI;
include/llvm/Analysis/LoopCacheAnalysis.h 49 IndexedReference(Instruction &StoreOrLoadInst, const LoopInfo &LI,
96 bool delinearize(const LoopInfo &LI);
185 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE,
258 const LoopInfo &LI;
include/llvm/Analysis/LoopInfo.h 767 bool isRecursivelyLCSSAForm(DominatorTree &DT, const LoopInfo &LI) const;
1043 void operator=(const LoopInfo &) = delete;
1044 LoopInfo(const LoopInfo &) = delete;
1050 LoopInfo(LoopInfo &&Arg) : BaseT(std::move(static_cast<BaseT &>(Arg))) {}
1051 LoopInfo &operator=(LoopInfo &&RHS) {
1051 LoopInfo &operator=(LoopInfo &&RHS) {
1166 typedef LoopInfo::iterator ChildIteratorType;
1175 typedef LoopInfo::iterator ChildIteratorType;
1188 typedef LoopInfo Result;
1190 LoopInfo run(Function &F, FunctionAnalysisManager &AM);
1209 LoopInfo LI;
1218 LoopInfo &getLoopInfo() { return LI; }
1219 const LoopInfo &getLoopInfo() const { return LI; }
include/llvm/Analysis/LoopIterator.h 123 void perform(LoopInfo *LI);
180 void perform(LoopInfo *LI) {
207 LoopInfo *LI;
210 LoopBlocksTraversal(LoopBlocksDFS &Storage, LoopInfo *LInfo) :
include/llvm/Analysis/LoopPass.h 155 LoopInfo *LI;
include/llvm/Analysis/RegionInfo.h 98 using LoopInfoT = LoopInfo;
include/llvm/Analysis/ScalarEvolution.h 475 DominatorTree &DT, LoopInfo &LI);
1125 LoopInfo &LI;
include/llvm/Analysis/SyncDependenceAnalysis.h 48 const LoopInfo &LI);
76 const LoopInfo &LI;
include/llvm/Analysis/TargetTransformInfo.h 100 bool isHardwareLoopCandidate(ScalarEvolution &SE, LoopInfo &LI,
103 bool canAnalyze(LoopInfo &LI);
565 bool canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, LoopInfo *LI,
1209 LoopInfo *LI, DominatorTree *DT, AssumptionCache *AC,
1490 LoopInfo *LI, DominatorTree *DT, AssumptionCache *AC,
include/llvm/Analysis/TargetTransformInfoImpl.h 236 bool canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, LoopInfo *LI,
include/llvm/Analysis/ValueTracking.h 375 const DataLayout &DL, LoopInfo *LI = nullptr,
include/llvm/Analysis/VectorUtils.h 528 DominatorTree *DT, LoopInfo *LI,
594 LoopInfo *LI;
include/llvm/IR/PassManagerInternal.h 137 template <typename T> struct Checker : CheckerBase, T {};
147 enum { Value = sizeof(check<ResultT>(rank<2>())) == sizeof(EnabledType) };
208 explicit AnalysisResultModel(ResultT Result) : Result(std::move(Result)) {}
231 ResultT Result;
include/llvm/Transforms/Scalar/GVN.h 164 LoopInfo *LI;
199 MemoryDependenceResults *RunMD, LoopInfo *LI,
include/llvm/Transforms/Scalar/LoopPassManager.h 291 LoopInfo &LI = AM.getResult<LoopAnalysis>(F);
include/llvm/Transforms/Utils/BasicBlockUtils.h 92 LoopInfo *LI = nullptr,
120 LoopInfo *LI;
128 LoopInfo *LI = nullptr,
222 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
230 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
251 LoopInfo *LI = nullptr,
269 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
305 LoopInfo *LI = nullptr,
include/llvm/Transforms/Utils/Cloning.h 248 const Twine &NameSuffix, LoopInfo *LI,
include/llvm/Transforms/Utils/LoopRotationUtils.h 33 bool LoopRotation(Loop *L, LoopInfo *LI, const TargetTransformInfo *TTI,
include/llvm/Transforms/Utils/LoopSimplify.h 62 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE,
include/llvm/Transforms/Utils/LoopUtils.h 53 BasicBlock *InsertPreheaderForLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
61 bool formDedicatedExitBlocks(Loop *L, DominatorTree *DT, LoopInfo *LI,
76 DominatorTree &DT, LoopInfo &LI);
90 bool formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, ScalarEvolution *SE);
101 bool formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,
120 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
133 bool hoistRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
150 LoopInfo *LI);
163 PredIteratorCache &, LoopInfo *, DominatorTree *, const TargetLibraryInfo *,
include/llvm/Transforms/Utils/LoopVersioning.h 41 LoopVersioning(const LoopAccessInfo &LAI, Loop *L, LoopInfo *LI,
145 LoopInfo *LI;
include/llvm/Transforms/Utils/SimplifyIndVar.h 49 LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead,
55 LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead);
include/llvm/Transforms/Utils/UnrollLoop.h 49 BasicBlock *ClonedBB, LoopInfo *LI,
81 LoopUnrollResult UnrollLoop(Loop *L, UnrollLoopOptions ULO, LoopInfo *LI,
89 bool ForgetAllSCEV, LoopInfo *LI,
100 bool peelLoop(Loop *L, unsigned PeelCount, LoopInfo *LI, ScalarEvolution *SE,
105 LoopInfo *LI, ScalarEvolution *SE,
114 DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE,
124 void simplifyLoopAfterUnroll(Loop *L, bool SimplifyIVs, LoopInfo *LI,
include/llvm/Transforms/Vectorize/LoopVectorizationLegality.h 203 LoopInfo *LI, OptimizationRemarkEmitter *ORE,
389 LoopInfo *LI;
include/llvm/Transforms/Vectorize/LoopVectorize.h 133 LoopInfo *LI;
148 bool runImpl(Function &F, ScalarEvolution &SE_, LoopInfo &LI_,
include/llvm/Transforms/Vectorize/SLPVectorizer.h 69 LoopInfo *LI = nullptr;
80 TargetLibraryInfo *TLI_, AliasAnalysis *AA_, LoopInfo *LI_,
lib/Analysis/BlockFrequencyInfo.cpp 155 const LoopInfo &LI) {
185 const LoopInfo &LI) {
321 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Analysis/BranchProbabilityInfo.cpp 575 const LoopInfo &LI,
949 void BranchProbabilityInfo::calculate(const Function &F, const LoopInfo &LI,
1028 const LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Analysis/CFG.cpp 121 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) {
133 const LoopInfo *LI) {
207 const DominatorTree *DT, const LoopInfo *LI) {
221 const LoopInfo *LI) {
lib/Analysis/Delinearization.cpp 42 LoopInfo *LI;
lib/Analysis/DependenceAnalysis.cpp 128 auto &LI = FAM.getResult<LoopAnalysis>(F);
151 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Analysis/DivergenceAnalysis.cpp 96 const LoopInfo &LI, SyncDependenceAnalysis &SDA, bool IsLCSSAForm)
435 const LoopInfo &LI,
lib/Analysis/IVUsers.cpp 60 ScalarEvolution *SE, LoopInfo *LI) {
95 const LoopInfo *LI,
304 IVUsers::IVUsers(Loop *L, AssumptionCache *AC, LoopInfo *LI, DominatorTree *DT,
368 auto *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Analysis/InlineCost.cpp 1918 LoopInfo LI(DT);
lib/Analysis/LazyBlockFrequencyInfo.cpp 56 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Analysis/LazyBranchProbabilityInfo.cpp 57 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Analysis/LegacyDivergenceAnalysis.cpp 310 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
314 const LoopInfo>(FuncRPOT, LI);
337 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Analysis/LoopAccessAnalysis.cpp 503 LoopInfo *LI, MemoryDepChecker::DepCandidates &DA,
594 LoopInfo *LI;
1789 void LoopAccessInfo::analyzeLoop(AliasAnalysis *AA, LoopInfo *LI,
2346 DominatorTree *DT, LoopInfo *LI)
lib/Analysis/LoopCacheAnalysis.cpp 129 const LoopInfo &LI, ScalarEvolution &SE)
307 bool IndexedReference::delinearize(const LoopInfo &LI) {
lib/Analysis/LoopInfo.cpp 455 bool Loop::isRecursivelyLCSSAForm(DominatorTree &DT, const LoopInfo &LI) const {
663 LoopInfo *LI;
678 UnloopUpdater(Loop *UL, LoopInfo *LInfo)
918 LoopInfo LoopAnalysis::run(Function &F, FunctionAnalysisManager &AM) {
925 LoopInfo LI;
1090 LoopInfo &LI = AM.getResult<LoopAnalysis>(F);
1103 void LoopBlocksDFS::perform(LoopInfo *LI) {
lib/Analysis/ModuleSummaryAnalysis.cpp 742 LoopInfo LI{DT};
lib/Analysis/MustExecute.cpp 387 DominatorTree &DT, LoopInfo &LI) {
399 DominatorTree &DT, LoopInfo &LI) {
437 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Analysis/OptimizationRemarkEmitter.cpp 34 LoopInfo LI;
lib/Analysis/ScalarEvolution.cpp 575 const LoopInfo *const LI, Value *LV, Value *RV,
654 const LoopInfo *const LI, const SCEV *LHS, const SCEV *RHS,
803 LoopInfo *LI, DominatorTree &DT) {
4621 static const Loop *isIntegerLoopHeaderPHI(const PHINode *PN, LoopInfo &LI) {
11402 LoopInfo &LI)
lib/Analysis/SyncDependenceAnalysis.cpp 122 const LoopInfo &LI)
134 const LoopInfo &LI;
153 const PostDominatorTree &PDT, const LoopInfo &LI)
lib/Analysis/TargetTransformInfo.cpp 46 bool HardwareLoopInfo::canAnalyze(LoopInfo &LI) {
57 LoopInfo &LI, DominatorTree &DT,
277 ScalarEvolution *SE, LoopInfo *LI,
lib/Analysis/ValueTracking.cpp 3690 const LoopInfo *LI) {
3765 const DataLayout &DL, LoopInfo *LI,
lib/CodeGen/CodeGenPrepare.cpp 251 const LoopInfo *LI;
lib/CodeGen/HardwareLoops.cpp 111 LoopInfo *LI = nullptr;
191 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I) {
lib/CodeGen/SafeStack.cpp 884 LoopInfo LI(DT);
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 355 LoopInfo *LI) {
444 LoopInfo *LI = LIWP ? &LIWP->getLoopInfo() : nullptr;
lib/Target/AArch64/AArch64FalkorHWPFFix.cpp 70 FalkorMarkStridedAccesses(LoopInfo &LI, ScalarEvolution &SE)
78 LoopInfo &LI;
129 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Target/AMDGPU/AMDGPUAnnotateUniformValues.cpp 35 LoopInfo *LI;
lib/Target/AMDGPU/SIAnnotateControlFlow.cpp 77 LoopInfo *LI;
lib/Target/Hexagon/HexagonCommonGEP.cpp 155 LoopInfo *LI;
lib/Target/Hexagon/HexagonLoopIdiomRecognition.cpp 156 LoopInfo *LF;
lib/Target/PowerPC/PPCLoopPreIncPrep.cpp 110 LoopInfo *LI;
lib/Target/PowerPC/PPCTargetTransformInfo.cpp 942 LoopInfo *LI, DominatorTree *DT,
lib/Target/PowerPC/PPCTargetTransformInfo.h 60 bool canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, LoopInfo *LI,
lib/Transforms/IPO/LoopExtractor.cpp 98 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/IPO/PartialInlining.cpp 397 LoopInfo LI(DT);
937 LoopInfo LI(DT);
1121 LoopInfo LI(DT);
1196 LoopInfo LI(DT);
lib/Transforms/IPO/SampleProfile.cpp 361 std::unique_ptr<LoopInfo> LI;
1549 LI.reset(new LoopInfo);
lib/Transforms/InstCombine/InstCombineInternal.h 333 LoopInfo *LI;
342 ProfileSummaryInfo *PSI, const DataLayout &DL, LoopInfo *LI)
358 LoopInfo *getLoopInfo() const { return LI; }
lib/Transforms/InstCombine/InstructionCombining.cpp 3511 LoopInfo *LI = nullptr) {
3558 auto *LI = AM.getCachedResult<LoopAnalysis>(F);
3610 auto *LI = LIWP ? &LIWP->getLoopInfo() : nullptr;
lib/Transforms/Instrumentation/InstrProfiling.cpp 230 LoopInfo &LI;
369 LoopInfo &LI;
445 LoopInfo LI(DT);
lib/Transforms/Instrumentation/PGOInstrumentation.cpp 1594 LoopInfo LI{DominatorTree(F)};
lib/Transforms/Scalar/GVN.cpp 621 auto *LI = AM.getCachedResult<LoopAnalysis>(F);
2081 MemoryDependenceResults *RunMD, LoopInfo *LI,
lib/Transforms/Scalar/GuardWidening.cpp 128 LoopInfo &LI;
290 LoopInfo &LI, BranchProbabilityInfo *BPI,
806 auto &LI = AM.getResult<LoopAnalysis>(F);
857 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
889 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/IndVarSimplify.cpp 136 LoopInfo *LI;
150 bool simplifyAndExtend(Loop *L, SCEVExpander &Rewriter, LoopInfo *LI);
169 IndVarSimplify(LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT,
238 DominatorTree *DT, LoopInfo *LI) {
971 LoopInfo *LI;
1027 WidenIV(const WideIVInfo &WI, LoopInfo *LInfo, ScalarEvolution *SEv,
1344 static void truncateIVUse(NarrowIVDefUse DU, DominatorTree *DT, LoopInfo *LI) {
1965 LoopInfo *LI) {
3167 auto *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/InductiveRangeCheckElimination.cpp 233 LoopInfo &LI;
238 LoopInfo &LI)
605 LoopInfo &LI;
626 LoopConstrainer(Loop &L, LoopInfo &LI,
1776 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/JumpThreading.cpp 310 LoopInfo LI{DominatorTree(F)};
337 LoopInfo LI{DominatorTree(F)};
lib/Transforms/Scalar/LICM.cpp 134 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI);
141 static bool sink(Instruction &I, LoopInfo *LI, DominatorTree *DT,
157 Instruction &I, BasicBlock &ExitBlock, PHINode &PN, const LoopInfo *LI,
170 bool runOnLoop(Loop *L, AliasAnalysis *AA, LoopInfo *LI, DominatorTree *DT,
187 collectAliasInfoForLoop(Loop *L, LoopInfo *LI, AliasAnalysis *AA);
327 Loop *L, AliasAnalysis *AA, LoopInfo *LI, DominatorTree *DT,
494 bool llvm::sinkRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI,
572 LoopInfo *LI;
586 ControlFlowHoister(LoopInfo *LI, DominatorTree *DT, Loop *CurLoop,
795 bool llvm::hoistRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI,
1359 Instruction &I, BasicBlock &ExitBlock, PHINode &PN, const LoopInfo *LI,
1455 PHINode *TPN, Instruction *I, LoopInfo *LI,
1491 LoopInfo *LI, const Loop *CurLoop,
1562 static bool sink(Instruction &I, LoopInfo *LI, DominatorTree *DT,
1742 LoopInfo &LI;
2157 LoopInvariantCodeMotion::collectAliasInfoForLoop(Loop *L, LoopInfo *LI,
2333 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI) {
lib/Transforms/Scalar/LoopDataPrefetch.cpp 63 LoopDataPrefetch(AssumptionCache *AC, LoopInfo *LI, ScalarEvolution *SE,
96 LoopInfo *LI;
158 LoopInfo *LI = &AM.getResult<LoopAnalysis>(F);
182 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/LoopDeletion.cpp 136 ScalarEvolution &SE, LoopInfo &LI) {
256 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/LoopDistribute.cpp 185 unsigned Index, LoopInfo *LI,
282 InstPartitionContainer(Loop *L, LoopInfo *LI, DominatorTree *DT)
574 LoopInfo *LI;
658 LoopDistributeForLoop(Loop *L, Function *F, LoopInfo *LI, DominatorTree *DT,
956 LoopInfo *LI;
974 static bool runImpl(Function &F, LoopInfo *LI, DominatorTree *DT,
1019 auto *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
1046 auto &LI = AM.getResult<LoopAnalysis>(F);
lib/Transforms/Scalar/LoopFuse.cpp 441 LoopDepthTree(LoopInfo &LI) : Depth(1) {
506 LoopInfo &LI;
514 LoopFuser(LoopInfo &LI, DominatorTree &DT, DependenceInfo &DI,
1587 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
1602 auto &LI = AM.getResult<LoopAnalysis>(F);
lib/Transforms/Scalar/LoopIdiomRecognize.cpp 144 LoopInfo *LI;
155 LoopInfo *LI, ScalarEvolution *SE,
273 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/LoopInstSimplify.cpp 50 static bool simplifyLoopInst(Loop &L, DominatorTree &DT, LoopInfo &LI,
190 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/LoopInterchange.cpp 399 LoopInfo *LI, DominatorTree *DT,
423 LoopInfo *LI;
434 LoopInfo *LI = nullptr;
lib/Transforms/Scalar/LoopLoadElimination.cpp 165 LoadEliminationForLoop(Loop *L, LoopInfo *LI, const LoopAccessInfo &LAI,
588 LoopInfo *LI;
599 eliminateLoadsAcrossLoops(Function &F, LoopInfo &LI, DominatorTree &DT,
641 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
692 auto &LI = AM.getResult<LoopAnalysis>(F);
lib/Transforms/Scalar/LoopRerollPass.cpp 180 LoopInfo *LI;
380 TargetLibraryInfo *TLI, DominatorTree *DT, LoopInfo *LI,
437 LoopInfo *LI;
lib/Transforms/Scalar/LoopRotation.cpp 94 auto *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/LoopSimplifyCFG.cpp 96 Loop &L, LoopInfo &LI) {
118 LoopInfo &LI;
524 ConstantTerminatorFoldingImpl(Loop &L, LoopInfo &LI, DominatorTree &DT,
623 static bool constantFoldTerminators(Loop &L, DominatorTree &DT, LoopInfo &LI,
642 LoopInfo &LI, MemorySSAUpdater *MSSAU) {
669 static bool simplifyLoopCFG(Loop &L, DominatorTree &DT, LoopInfo &LI,
723 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/LoopSink.cpp 177 LoopInfo &LI, DominatorTree &DT,
251 static bool sinkLoopInvariantInstructions(Loop &L, AAResults &AA, LoopInfo &LI,
314 LoopInfo &LI = FAM.getResult<LoopAnalysis>(F);
lib/Transforms/Scalar/LoopStrengthReduce.cpp 1913 LoopInfo &LI;
2054 LoopInfo &LI, const TargetTransformInfo &TTI, AssumptionCache &AC,
5496 DominatorTree &DT, LoopInfo &LI,
5707 DominatorTree &DT, LoopInfo &LI,
5743 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/LoopUnrollAndJamPass.cpp 155 LoopInfo *LI, ScalarEvolution &SE,
277 tryToUnrollAndJamLoop(Loop *L, DominatorTree &DT, LoopInfo *LI,
447 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/LoopUnrollPass.cpp 737 Loop *L, const TargetTransformInfo &TTI, DominatorTree &DT, LoopInfo *LI,
1012 Loop *L, DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE,
1226 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
1412 auto &LI = AM.getResult<LoopAnalysis>(F);
lib/Transforms/Scalar/LoopUnswitch.cpp 170 LoopInfo *LI; // Loop information
908 LoopInfo *LI, LPPassManager *LPM) {
lib/Transforms/Scalar/LoopVersioningLICM.cpp 590 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/PlaceSafepoints.cpp 114 LoopInfo *LI = nullptr;
lib/Transforms/Scalar/SeparateConstOffsetFromGEP.cpp 451 LoopInfo *LI;
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 104 LoopInfo &LI) {
265 DominatorTree &DT, LoopInfo &LI,
350 LoopInfo &LI, ScalarEvolution *SE,
573 LoopInfo &LI, ScalarEvolution *SE,
852 LoopInfo &LI, ScalarEvolution *SE,
976 DominatorTree &DT, LoopInfo &LI, MemorySSAUpdater *MSSAU) {
1142 const ValueToValueMapTy &VMap, LoopInfo &LI) {
1201 const ValueToValueMapTy &VMap, LoopInfo &LI,
1481 DominatorTree &DT, LoopInfo &LI,
1675 LoopInfo &LI,
1903 SmallVectorImpl<BasicBlock *> &ExitBlocks, DominatorTree &DT, LoopInfo &LI,
2377 DominatorTree &DT, LoopInfo &LI, MemorySSAUpdater *MSSAU) {
2452 Instruction &TI, Loop &L, LoopInfo &LI, DominatorTree &DT,
2524 unswitchBestCondition(Loop &L, DominatorTree &DT, LoopInfo &LI,
2801 static bool unswitchLoop(Loop &L, DominatorTree &DT, LoopInfo &LI,
2932 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/Sink.cpp 95 DominatorTree &DT, LoopInfo &LI) {
140 DominatorTree &DT, LoopInfo &LI, AAResults &AA) {
198 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI,
239 LoopInfo &LI, AAResults &AA) {
257 auto &LI = AM.getResult<LoopAnalysis>(F);
278 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Scalar/StructurizeCFG.cpp 193 LoopInfo *LI;
lib/Transforms/Scalar/WarnMissedTransforms.cpp 84 static void warnAboutLeftoverTransformations(Function *F, LoopInfo *LI,
99 auto &LI = AM.getResult<LoopAnalysis>(F);
122 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Utils/BasicBlockUtils.cpp 172 LoopInfo *LI, MemorySSAUpdater *MSSAU,
361 LoopInfo *LI, MemorySSAUpdater *MSSAU) {
403 DominatorTree *DT, LoopInfo *LI,
439 DominatorTree *DT, LoopInfo *LI,
597 LoopInfo *LI, MemorySSAUpdater *MSSAU,
667 DominatorTree *DT, LoopInfo *LI,
814 DominatorTree *DT, LoopInfo *LI,
lib/Transforms/Utils/BreakCriticalEdges.cpp 57 auto *LI = LIWP ? &LIWP->getLoopInfo() : nullptr;
87 auto *LI = AM.getCachedResult<LoopAnalysis>(F);
214 auto *LI = Options.LI;
lib/Transforms/Utils/CloneFunction.cpp 754 const Twine &NameSuffix, LoopInfo *LI,
lib/Transforms/Utils/LCSSA.cpp 77 DominatorTree &DT, LoopInfo &LI) {
320 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI,
385 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,
398 static bool formLCSSAOnAllLoops(LoopInfo *LI, DominatorTree &DT,
415 LoopInfo *LI;
480 auto &LI = AM.getResult<LoopAnalysis>(F);
lib/Transforms/Utils/LoopRotationUtils.cpp 53 LoopInfo *LI;
64 LoopRotate(unsigned MaxHeaderSize, LoopInfo *LI,
655 bool llvm::LoopRotation(Loop *L, LoopInfo *LI, const TargetTransformInfo *TTI,
lib/Transforms/Utils/LoopSimplify.cpp 123 LoopInfo *LI, MemorySSAUpdater *MSSAU,
225 DominatorTree *DT, LoopInfo *LI,
349 DominatorTree *DT, LoopInfo *LI,
472 DominatorTree *DT, LoopInfo *LI,
709 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
799 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
818 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I)
834 LoopInfo *LI = &AM.getResult<LoopAnalysis>(F);
848 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I)
lib/Transforms/Utils/LoopUnroll.cpp 108 LoopInfo *LI) {
132 BasicBlock *ClonedBB, LoopInfo *LI,
199 void llvm::simplifyLoopAfterUnroll(Loop *L, bool SimplifyIVs, LoopInfo *LI,
276 LoopUnrollResult llvm::UnrollLoop(Loop *L, UnrollLoopOptions ULO, LoopInfo *LI,
lib/Transforms/Utils/LoopUnrollAndJam.cpp 175 bool UnrollRemainder, LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT,
lib/Transforms/Utils/LoopUnrollPeel.cpp 473 LoopInfo *LI) {
578 bool llvm::peelLoop(Loop *L, unsigned PeelCount, LoopInfo *LI,
lib/Transforms/Utils/LoopUnrollRuntime.cpp 71 LoopInfo *LI, bool PreserveLCSSA) {
186 LoopInfo *LI, bool PreserveLCSSA) {
304 ValueToValueMapTy &VMap, DominatorTree *DT, LoopInfo *LI) {
549 LoopInfo *LI, ScalarEvolution *SE,
lib/Transforms/Utils/LoopUtils.cpp 51 bool llvm::formDedicatedExitBlocks(Loop *L, DominatorTree *DT, LoopInfo *LI,
508 LoopInfo *LI = nullptr) {
lib/Transforms/Utils/LoopVersioning.cpp 32 LoopVersioning::LoopVersioning(const LoopAccessInfo &LAI, Loop *L, LoopInfo *LI,
263 auto *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
lib/Transforms/Utils/SimplifyIndVar.cpp 54 LoopInfo *LI;
64 LoopInfo *LI, SCEVExpander &Rewriter,
934 LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead,
945 LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead) {
lib/Transforms/Vectorize/LoopVectorizationPlanner.h 190 LoopInfo *LI;
223 LoopVectorizationPlanner(Loop *L, LoopInfo *LI, const TargetLibraryInfo *TLI,
lib/Transforms/Vectorize/LoopVectorize.cpp 401 LoopInfo *LI, DominatorTree *DT,
670 LoopInfo *LI;
773 LoopInfo *LI, DominatorTree *DT,
954 PredicatedScalarEvolution &PSE, LoopInfo *LI,
1474 LoopInfo *LI;
1554 static void collectSupportedLoops(Loop &L, LoopInfo *LI,
1601 auto *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
7460 Loop *L, PredicatedScalarEvolution &PSE, LoopInfo *LI, DominatorTree *DT,
7802 Function &F, ScalarEvolution &SE_, LoopInfo &LI_, TargetTransformInfo &TTI_,
7870 auto &LI = AM.getResult<LoopAnalysis>(F);
lib/Transforms/Vectorize/SLPVectorizer.cpp 503 TargetLibraryInfo *TLi, AliasAnalysis *Aa, LoopInfo *Li,
1957 LoopInfo *LI;
5213 auto *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
5247 auto *LI = &AM.getResult<LoopAnalysis>(F);
5267 LoopInfo *LI_, DominatorTree *DT_,
6679 BasicBlock *ParentBB, LoopInfo *LI) {
lib/Transforms/Vectorize/VPlan.h 234 VPTransformState(unsigned VF, unsigned UF, LoopInfo *LI, DominatorTree *DT,
306 LoopInfo *LI;
lib/Transforms/Vectorize/VPlanHCFGBuilder.cpp 40 LoopInfo *LI;
73 PlainCFGBuilder(Loop *Lp, LoopInfo *LI, VPlan &P)
lib/Transforms/Vectorize/VPlanHCFGBuilder.h 45 LoopInfo *LI;
63 VPlanHCFGBuilder(Loop *Lp, LoopInfo *LI, VPlan &P)
tools/polly/include/polly/CodeGen/BlockGenerators.h 67 BlockGenerator(PollyIRBuilder &Builder, LoopInfo &LI, ScalarEvolution &SE,
133 LoopInfo &LI;
tools/polly/include/polly/CodeGen/IslExprBuilder.h 125 llvm::LoopInfo &LI, llvm::BasicBlock *StartBlock);
207 llvm::LoopInfo &LI;
tools/polly/include/polly/CodeGen/IslNodeBuilder.h 35 LoopInfo &LI;
69 const DataLayout &DL, LoopInfo &LI, ScalarEvolution &SE,
154 LoopInfo &LI;
tools/polly/include/polly/CodeGen/LoopGenerators.h 66 PollyIRBuilder &Builder, LoopInfo &LI, DominatorTree &DT,
114 ParallelLoopGenerator(PollyIRBuilder &Builder, LoopInfo &LI,
149 LoopInfo &LI;
tools/polly/include/polly/CodeGen/LoopGeneratorsGOMP.h 29 ParallelLoopGeneratorGOMP(PollyIRBuilder &Builder, LoopInfo &LI,
tools/polly/include/polly/CodeGen/LoopGeneratorsKMP.h 29 ParallelLoopGeneratorKMP(PollyIRBuilder &Builder, LoopInfo &LI,
tools/polly/include/polly/CodeGen/Utils.h 70 llvm::RegionInfo &RI, llvm::LoopInfo &LI);
tools/polly/include/polly/ScopBuilder.h 44 LoopInfo &LI;
815 const DataLayout &DL, DominatorTree &DT, LoopInfo &LI,
tools/polly/include/polly/ScopDetection.h 195 LoopInfo &LI;
518 LoopInfo &LI, RegionInfo &RI, AliasAnalysis &AA,
527 LoopInfo *getLI() const { return &LI; }
598 countBeneficialLoops(Region *R, ScalarEvolution &SE, LoopInfo &LI,
tools/polly/include/polly/ScopInfo.h 1946 Scop(Region &R, ScalarEvolution &SE, LoopInfo &LI, DominatorTree &DT,
1953 LoopInfo &LI);
2108 LoopInfo *getLI() const { return Affinator.getLI(); }
2810 LoopInfo &LI;
2818 LoopInfo &LI, AliasAnalysis &AA, DominatorTree &DT,
tools/polly/include/polly/ScopPass.h 176 LoopInfo &LI;
tools/polly/include/polly/Support/SCEVAffinator.h 31 SCEVAffinator(Scop *S, llvm::LoopInfo &LI);
51 llvm::LoopInfo *getLI() const { return &LI; }
64 llvm::LoopInfo &LI;
tools/polly/include/polly/Support/SCEVValidator.h 97 llvm::LoopInfo &LI,
106 llvm::LoopInfo &LI,
tools/polly/include/polly/Support/ScopHelper.h 308 llvm::LoopInfo *LI, llvm::RegionInfo *RI);
325 llvm::DominatorTree *DT, llvm::LoopInfo *LI,
372 llvm::LoopInfo &LI, const llvm::DominatorTree &DT);
384 llvm::Loop *getLoopSurroundingScop(Scop &S, llvm::LoopInfo &LI);
402 llvm::Loop *getRegionNodeLoop(llvm::RegionNode *RN, llvm::LoopInfo &LI);
414 bool isHoistableLoad(llvm::LoadInst *LInst, llvm::Region &R, llvm::LoopInfo &LI,
469 llvm::Loop *getFirstNonBoxedLoopFor(llvm::Loop *L, llvm::LoopInfo &LI,
479 llvm::Loop *getFirstNonBoxedLoopFor(llvm::BasicBlock *BB, llvm::LoopInfo &LI,
tools/polly/include/polly/Support/VirtualInstruction.h 99 static VirtualUse create(Scop *S, const Use &U, LoopInfo *LI, bool Virtual);
305 void markReachable(Scop *S, LoopInfo *LI,
tools/polly/include/polly/ZoneAlgo.h 66 llvm::LoopInfo *LI;
164 ZoneAlgorithm(const char *PassName, Scop *S, llvm::LoopInfo *LI);
tools/polly/lib/Analysis/PolyhedralInfo.cpp 60 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
tools/polly/lib/Analysis/ScopBuilder.cpp 177 static bool containsErrorBlock(RegionNode *RN, const Region &R, LoopInfo &LI,
3528 static void verifyUse(Scop *S, Use &Op, LoopInfo &LI) {
3549 static void verifyUses(Scop *S, LoopInfo &LI, DominatorTree &DT) {
3751 const DataLayout &DL, DominatorTree &DT, LoopInfo &LI,
tools/polly/lib/Analysis/ScopDetection.cpp 330 ScalarEvolution &SE, LoopInfo &LI, RegionInfo &RI,
1361 LoopInfo &LI, unsigned MinProfitableTrips) {
1444 static bool regionWithoutLoops(Region &R, LoopInfo &LI) {
1852 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
1899 auto &LI = FAM.getResult<LoopAnalysis>(F);
tools/polly/lib/Analysis/ScopInfo.cpp 1698 Scop::Scop(Region &R, ScalarEvolution &ScalarEvolution, LoopInfo &LI,
2672 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
2720 LoopInfo &LI, AliasAnalysis &AA, DominatorTree &DT,
2770 auto &LI = FAM.getResult<LoopAnalysis>(F);
2808 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
tools/polly/lib/CodeGen/BlockGenerators.cpp 57 PollyIRBuilder &B, LoopInfo &LI, ScalarEvolution &SE, DominatorTree &DT,
tools/polly/lib/CodeGen/CodeGeneration.cpp 168 static bool CodeGen(Scop &S, IslAstInfo &AI, LoopInfo &LI, DominatorTree &DT,
314 LoopInfo *LI;
tools/polly/lib/CodeGen/IslExprBuilder.cpp 42 DominatorTree &DT, LoopInfo &LI,
tools/polly/lib/CodeGen/LoopGenerators.cpp 83 PollyIRBuilder &Builder, LoopInfo &LI,
tools/polly/lib/CodeGen/Utils.cpp 33 LoopInfo *LI, RegionInfo *RI) {
79 RegionInfo &RI, LoopInfo &LI) {
tools/polly/lib/Support/SCEVAffinator.cpp 83 SCEVAffinator::SCEVAffinator(Scop *S, LoopInfo &LI)
tools/polly/lib/Support/SCEVValidator.cpp 773 ScalarEvolution &SE, LoopInfo &LI,
798 Value *getUniqueNonErrorValue(PHINode *PHI, Region *R, LoopInfo &LI,
tools/polly/lib/Support/ScopHelper.cpp 44 static void simplifyRegionEntry(Region *R, DominatorTree *DT, LoopInfo *LI,
108 static void simplifyRegionExit(Region *R, DominatorTree *DT, LoopInfo *LI,
156 void polly::simplifyRegion(Region *R, DominatorTree *DT, LoopInfo *LI,
172 DominatorTree *DT, llvm::LoopInfo *LI,
201 LoopInfo *LI, RegionInfo *RI) {
216 auto *LI = LIWP ? &LIWP->getLoopInfo() : nullptr;
402 bool polly::isErrorBlock(BasicBlock &BB, const Region &R, LoopInfo &LI,
464 Loop *polly::getLoopSurroundingScop(Scop &S, LoopInfo &LI) {
503 Loop *polly::getRegionNodeLoop(RegionNode *RN, LoopInfo &LI) {
549 bool polly::isHoistableLoad(LoadInst *LInst, Region &R, LoopInfo &LI,
710 llvm::Loop *polly::getFirstNonBoxedLoopFor(llvm::Loop *L, llvm::LoopInfo &LI,
718 llvm::LoopInfo &LI,
tools/polly/lib/Support/VirtualInstruction.cpp 19 VirtualUse VirtualUse::create(Scop *S, const Use &U, LoopInfo *LI,
275 static void walkReachable(Scop *S, LoopInfo *LI,
404 void polly::markReachable(Scop *S, LoopInfo *LI,
tools/polly/lib/Transform/CodePreparation.cpp 37 LoopInfo *LI;
69 auto &LI = FAM.getResult<LoopAnalysis>(F);
tools/polly/lib/Transform/DeLICM.cpp 1181 DeLICMImpl(Scop *S, LoopInfo *LI) : ZoneAlgorithm("polly-delicm", S, LI) {}
1360 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
tools/polly/lib/Transform/ForwardOpTree.cpp 270 ForwardOpTreeImpl(Scop *S, LoopInfo *LI, IslMaxOperationsGuard &MaxOpGuard)
913 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
tools/polly/lib/Transform/Simplify.cpp 529 void markAndSweep(LoopInfo *LI) {
648 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
tools/polly/lib/Transform/ZoneAlgo.cpp 261 ZoneAlgorithm::ZoneAlgorithm(const char *PassName, Scop *S, LoopInfo *LI)
unittests/Analysis/BlockFrequencyInfoTest.cpp 31 std::unique_ptr<LoopInfo> LI;
36 LI.reset(new LoopInfo(*DT));
unittests/Analysis/BranchProbabilityInfoTest.cpp 30 std::unique_ptr<LoopInfo> LI;
35 LI.reset(new LoopInfo(*DT));
unittests/Analysis/CFGTest.cpp 99 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
unittests/Analysis/DivergenceAnalysisTest.cpp 52 std::unique_ptr<LoopInfo> LI;
60 LI.reset(new LoopInfo(*DT));
67 function_ref<void(Function &F, LoopInfo &LI, DivergenceAnalysis &DA)>
unittests/Analysis/IVDescriptorsTest.cpp 24 function_ref<void(Function &F, LoopInfo &LI, ScalarEvolution &SE)> Test) {
32 LoopInfo LI(DT);
unittests/Analysis/LoopInfoTest.cpp 23 function_ref<void(Function &F, LoopInfo &LI)> Test) {
28 LoopInfo LI(DT);
35 function_ref<void(Function &F, LoopInfo &LI, ScalarEvolution &SE)> Test) {
43 LoopInfo LI(DT);
187 LoopInfo LI;
unittests/Analysis/ProfileSummaryInfoTest.cpp 35 std::unique_ptr<LoopInfo> LI;
42 LI.reset(new LoopInfo(*DT));
unittests/Analysis/ScalarEvolutionTest.cpp 41 std::unique_ptr<LoopInfo> LI;
48 LI.reset(new LoopInfo(*DT));
54 function_ref<void(Function &F, LoopInfo &LI, ScalarEvolution &SE)> Test) {
unittests/Analysis/UnrollAnalyzerTest.cpp 27 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
unittests/Transforms/Utils/CloningTest.cpp 362 function_ref<void(Function &F, LoopInfo &LI, DominatorTree &DT)> Test) {
367 LoopInfo LI(DT);
unittests/Transforms/Utils/SizeOptsTest.cpp 35 std::unique_ptr<LoopInfo> LI;
40 LI.reset(new LoopInfo(*DT));
unittests/Transforms/Utils/UnrollLoopTest.cpp 63 LoopInfo LI(DT);
unittests/Transforms/Vectorize/VPlanTestBase.h 31 std::unique_ptr<LoopInfo> LI;
45 LI.reset(new LoopInfo(*DT));
usr/include/c++/7.4.0/bits/move.h 72 constexpr _Tp&&
73 forward(typename std::remove_reference<_Tp>::type& __t) noexcept
83 constexpr _Tp&&
84 forward(typename std::remove_reference<_Tp>::type&& __t) noexcept
98 move(_Tp&& __t) noexcept
usr/include/c++/7.4.0/bits/range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
58 begin(const _Container& __cont) -> decltype(__cont.begin())
68 end(_Container& __cont) -> decltype(__cont.end())
78 end(const _Container& __cont) -> decltype(__cont.end())
usr/include/c++/7.4.0/bits/unique_ptr.h 68 default_delete(const default_delete<_Up>&) noexcept { }
72 operator()(_Tp* __ptr) const
74 static_assert(!is_void<_Tp>::value,
76 static_assert(sizeof(_Tp)>0,
122 using type = _Up*;
137 using pointer = typename _Ptr<_Tp, _Dp>::type;
161 typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;
163 __uniq_ptr_impl<_Tp, _Dp> _M_t;
166 using pointer = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
167 using element_type = _Tp;
252 unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept
297 __safe_conversion_up<_Up, _Ep>,
301 operator=(unique_ptr<_Up, _Ep>&& __u) noexcept
824 make_unique(_Args&&... __args)
825 { return unique_ptr<_Tp>(new _Tp(std::forward<_Args>(__args)...)); }
usr/include/c++/7.4.0/type_traits 215 : public __is_void_helper<typename remove_cv<_Tp>::type>::type
581 : public __or_<is_lvalue_reference<_Tp>,
582 is_rvalue_reference<_Tp>>::type
601 : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
601 : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
602 is_void<_Tp>>>::type
638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
1554 { typedef _Tp type; };
1563 { typedef _Tp type; };
1574 remove_const<typename remove_volatile<_Tp>::type>::type type;
1629 { typedef _Tp type; };
1633 { typedef _Tp type; };
1645 { typedef _Tp& type; };
1650 : public __add_lvalue_reference_helper<_Tp>
1659 { typedef _Tp&& type; };
1664 : public __add_rvalue_reference_helper<_Tp>
2253 inline typename add_rvalue_reference<_Tp>::type