/llvm-project/llvm/unittests/CodeGen/GlobalISel/ |
H A D | LegalizerInfoTest.cpp | 253 LegalizerInfo LI; in TEST() local 269 LegalizerInfo LI; in TEST() local 282 LegalizerInfo LI; in TEST() local 295 LegalizerInfo LI; in TEST() local 312 LegalizerInfo LI; in TEST() local 327 LegalizerInfo LI; in TEST() local 347 LegalizerInfo LI; in TEST() local 361 LegalizerInfo LI; in TEST() local 379 LegalizerInfo LI; in TEST() local 396 LegalizerInfo LI; in TEST() local [all …]
|
H A D | LegalizerTest.cpp | 67 ALegalizerInfo LI(MF->getSubtarget()); in TEST_F() local 105 ALegalizerInfo LI(MF->getSubtarget()); in TEST_F() local 199 ALegalizerInfo LI(MF->getSubtarget()); in TEST_F() local
|
/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | Sink.cpp | 66 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget() argument 104 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction() argument 175 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock() argument 213 LoopInfo &LI, AAResults &AA) { in iterativelySinkInstructions() argument 231 auto &LI in run() local 252 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); runOnFunction() local [all...] |
H A D | WarnMissedTransforms.cpp | 85 static void warnAboutLeftoverTransformations(Function *F, LoopInfo *LI, in warnAboutLeftoverTransformations() 100 auto &LI = AM.getResult<LoopAnalysis>(F); in run() local
|
/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | FixIrreducible.cpp | 164 LI.destroy(Child); in createNaturalLoopInternal() argument 253 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Function * F,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument 259 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Loop & L,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument 267 makeReducible(LoopInfo & LI,DominatorTree & DT,Graph && G) makeReducible() argument 313 FixIrreducibleImpl(Function & F,LoopInfo & LI,DominatorTree & DT) FixIrreducibleImpl() argument 343 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); runOnFunction() local 350 auto &LI = AM.getResult<LoopAnalysis>(F); run() local [all...] |
H A D | UnifyLoopExits.cpp | 231 if (!runImpl(LI, D in runOnFunction() local 143 unifyLoopExits(DominatorTree & DT,LoopInfo & LI,Loop * L) unifyLoopExits() argument 216 runImpl(LoopInfo & LI,DominatorTree & DT) runImpl() argument 243 auto &LI = AM.getResult<LoopAnalysis>(F); run() local [all...] |
H A D | LCSSA.cpp | 78 formLCSSAForInstructions(SmallVectorImpl<Instruction * > & Worklist,const DominatorTree & DT,const LoopInfo & LI,ScalarEvolution * SE,SmallVectorImpl<PHINode * > * PHIsToRemove,SmallVectorImpl<PHINode * > * InsertedPHIs) formLCSSAForInstructions() argument 363 formLCSSA(Loop & L,const DominatorTree & DT,const LoopInfo * LI,ScalarEvolution * SE) formLCSSA() argument 426 formLCSSARecursively(Loop & L,const DominatorTree & DT,const LoopInfo * LI,ScalarEvolution * SE) formLCSSARecursively() argument 438 formLCSSAOnAllLoops(const LoopInfo * LI,const DominatorTree & DT,ScalarEvolution * SE) formLCSSAOnAllLoops() argument 455 LoopInfo *LI; global() member 520 auto &LI = AM.getResult<LoopAnalysis>(F); run() local [all...] |
/llvm-project/llvm/lib/Target/SPIRV/Analysis/ |
H A D | SPIRVConvergenceRegionAnalysis.cpp | 123 ConvergenceRegion(DominatorTree & DT,LoopInfo & LI,Function & F) ConvergenceRegion() argument 136 ConvergenceRegion(DominatorTree & DT,LoopInfo & LI,std::optional<IntrinsicInst * > ConvergenceToken,BasicBlock * Entry,SmallPtrSet<BasicBlock *,8> && Blocks,SmallPtrSet<BasicBlock *,2> && Exits) ConvergenceRegion() argument 201 ConvergenceRegionAnalyzer(Function & F,DominatorTree & DT,LoopInfo & LI) ConvergenceRegionAnalyzer() argument 223 findPathsToMatch(LoopInfo & LI,BasicBlock * From,std::function<bool (const BasicBlock *)> isMatch) const findPathsToMatch() argument 312 LoopInfo &LI; global() member in llvm::SPIRV::ConvergenceRegionAnalyzer 317 getConvergenceRegions(Function & F,DominatorTree & DT,LoopInfo & LI) getConvergenceRegions() argument 332 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); runOnFunction() local 343 auto &LI = AM.getResult<LoopAnalysis>(F); run() local [all...] |
/llvm-project/llvm/unittests/Analysis/ |
H A D | LoopInfoTest.cpp | 30 LoopInfo LI(DT); in runWithLoopInfo() local 37 function_ref<void(Function &F, LoopInfo &LI, ScalarEvolution &SE)> Test) { in runWithLoopInfoPlus() 45 LoopInfo LI(DT); in runWithLoopInfoPlus() local 81 runWithLoopInfo(*M, "foo", [&](Function &F, LoopInfo &LI) { in TEST() 131 runWithLoopInfo(*M, "foo", [&](Function &F, LoopInfo &LI) { in TEST() 189 LoopInfo LI; in TEST() local 263 [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST() 322 [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST() 381 [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST() 440 [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST() [all …]
|
H A D | IVDescriptorsTest.cpp | 25 function_ref<void(Function &F, LoopInfo &LI, ScalarEvolution &SE)> Test) { in runWithLoopInfoAndSE() argument 33 LoopInfo LI(DT); in runWithLoopInfoAndSE() local 75 *M, "foo", [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST() argument 151 *M, "barney", [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST() argument 195 *M, "foo", [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST() argument 247 __anonf0eb85030402(Function &F, LoopInfo &LI, ScalarEvolution &SE) TEST() argument [all...] |
H A D | LoopNestTest.cpp | 24 function_ref<void(Function &F, LoopInfo &LI, ScalarEvolution &SE)> Test) { in runTest() 32 LoopInfo LI(DT); in runTest() local 86 runTest(*M, "foo", [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST() 182 runTest(*M, "foo", [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST() 268 runTest(*M, "foo", [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST()
|
/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanHCFGBuilder.h | 46 LoopInfo *LI; variable 60 VPlanHCFGBuilder(Loop *Lp, LoopInfo *LI, VPlan &P) in VPlanHCFGBuilder() argument
|
/llvm-project/llvm/lib/Analysis/ |
H A D | CFG.cpp | 128 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) { in getOutermostLoop() 137 const DominatorTree *DT, const LoopInfo *LI) { in isReachableImpl() 242 const LoopInfo *LI) { in isPotentiallyReachableFromMany() 252 const LoopInfo *LI) { in isManyPotentiallyReachableFromMany() 260 const LoopInfo *LI) { in isPotentiallyReachable() 284 const LoopInfo *LI) { in isPotentiallyReachable()
|
/llvm-project/llvm/include/llvm/Analysis/ |
H A D | LazyBlockFrequencyInfo.h | 40 setAnalysis(const FunctionT * F,BranchProbabilityInfoPassT * BPIPass,const LoopInfoT * LI) setAnalysis() argument 72 const LoopInfoT *LI = nullptr; global() variable
|
H A D | LazyBranchProbabilityInfo.h | 58 LazyBranchProbabilityInfo(const Function * F,const LoopInfo * LI,const TargetLibraryInfo * TLI) LazyBranchProbabilityInfo() argument 80 const LoopInfo *LI; global() variable
|
H A D | LoopAnalysisManager.h | 57 LoopInfo &LI; member 90 explicit Result(LoopAnalysisManager &InnerAM, LoopInfo &LI) in Result() 139 LoopInfo *LI; variable
|
/llvm-project/llvm/lib/CodeGen/ |
H A D | RegAllocBasic.cpp | 89 enqueueImpl(const LiveInterval * LI) enqueueImpl() argument 94 const LiveInterval *LI = Queue.top(); dequeue() local 147 LiveInterval &LI = LIS->getInterval(VirtReg); INITIALIZE_PASS_DEPENDENCY() local 166 LiveInterval &LI = LIS->getInterval(VirtReg); LRE_WillShrinkVirtReg() local [all...] |
H A D | LiveRangeEdit.cpp | 40 LiveInterval &LI = LIS.createEmptyInterval(VReg); in createEmptyIntervalFrom() local 207 bool LiveRangeEdit::foldAsLoad(LiveInterval *LI, in foldAsLoad() argument 266 bool LiveRangeEdit::useIsKill(const LiveInterval &LI, in useIsKill() argument 349 LiveInterval &LI = LIS.getInterval(Reg); eliminateDeadDef() local 450 LiveInterval *LI = ToShrink.pop_back_val(); eliminateDeadDefs() local 499 LiveInterval &LI = LIS.getInterval(get(I)); calculateRegClassAndHint() local [all...] |
H A D | CalcSpillWeights.cpp | 81 bool VirtRegAuxInfo::isRematerializable(const LiveInterval &LI, in isRematerializable() argument 131 bool VirtRegAuxInfo::isLiveAtStatepointVarArg(LiveInterval &LI) { in isLiveAtStatepointVarArg() argument 141 void VirtRegAuxInfo::calculateSpillWeightAndHint(LiveInterval &LI) { in calculateSpillWeightAndHint() argument 149 canMemFoldInlineAsm(LiveInterval & LI,const MachineRegisterInfo & MRI) canMemFoldInlineAsm() argument 160 weightCalcHelper(LiveInterval & LI,SlotIndex * Start,SlotIndex * End) weightCalcHelper() argument [all...] |
H A D | SplitKit.cpp | 401 for (auto &S : LI.subranges()) in getSubrangeImpl() argument 409 return getSubrangeImpl(LM, LI); in getSubRangeForMaskExact() argument 414 return getSubrangeImpl(LM, LI); in getSubRangeForMaskExact() argument 423 getSubRangeForMask(LaneBitmask LM,const LiveInterval & LI) getSubRangeForMask() argument 430 addDeadDef(LiveInterval & LI,VNInfo * VNI,bool Original) addDeadDef() argument 478 LiveInterval *LI = &LIS.getInterval(Edit->get(RegIdx)); defValue() local 596 LiveInterval *LI = &LIS.getInterval(Edit->get(RegIdx)); defFromParent() local 855 LiveInterval *LI = &LIS.getInterval(Edit->get(0)); removeBackCopies() local 962 LiveInterval *LI = &LIS.getInterval(Edit->get(0)); computeRedundantBackCopies() local 1015 LiveInterval *LI = &LIS.getInterval(Edit->get(0)); hoistCopies() local 1164 LiveInterval &LI = LIS.getInterval(Edit->get(RegIdx)); transferValues() local 1286 LiveInterval &LI = LIS.getInterval(Edit->get(RegIdx)); extendPHIKillRanges() local 1301 LiveInterval &LI = LIS.getInterval(Edit->get(RegIdx)); extendPHIKillRanges() local 1348 LiveInterval &LI = LIS.getInterval(Edit->get(RegIdx)); rewriteAssigned() local 1405 LiveInterval &LI = LIS.getInterval(Edit->get(EP.RegIdx)); rewriteAssigned() local 1431 LiveInterval &LI = LIS.getInterval(R); rewriteAssigned() local 1443 LiveInterval *LI = &LIS.getInterval(R); deleteRematVictims() local 1550 LiveInterval &LI = LIS.getInterval(Reg); finish() local 1566 LiveInterval &LI = LIS.getInterval(VReg); finish() local [all...] |
/llvm-project/llvm/unittests/Transforms/Utils/ |
H A D | LoopUtilsTest.cpp | 39 LoopInfo LI(DT); in run() local 74 [&](Function &F, DominatorTree &DT, ScalarEvolution &SE, LoopInfo &LI) { in TEST() argument 112 __anonf89b06080202(Function &F, DominatorTree &DT, ScalarEvolution &SE, LoopInfo &LI) TEST() argument 136 __anonf89b06080302(Function &F, DominatorTree &DT, ScalarEvolution &SE, LoopInfo &LI) TEST() argument [all...] |
/llvm-project/polly/include/polly/CodeGen/ |
H A D | LoopGenerators.h | 131 ParallelLoopGenerator(PollyIRBuilder & Builder,LoopInfo & LI,DominatorTree & DT,const DataLayout & DL) ParallelLoopGenerator() argument 168 LoopInfo &LI; global() variable
|
/llvm-project/llvm/tools/llvm-reduce/deltas/ |
H A D | ReduceMemoryOperations.cpp | 20 if (LoadInst *LI = dyn_cast<LoadInst>(&I)) { in removeVolatileInFunction() local 50 if (LoadInst *LI = dyn_cast<LoadInst>(&I)) { in reduceAtomicSyncScopesInFunction() local 83 if (LoadInst *LI = dyn_cast<LoadInst>(&I)) { in reduceAtomicOrderingInFunction() local
|
/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64FalkorHWPFFix.cpp | 68 FalkorMarkStridedAccesses(LoopInfo &LI, ScalarEvolution &SE) in FalkorMarkStridedAccesses() argument 76 LoopInfo &LI; member in __anonbde351b50111::FalkorMarkStridedAccesses 127 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); in runOnFunction() local 647 LoadInfo LI; in getLoadInfo() local 658 getTag(const TargetRegisterInfo * TRI,const MachineInstr & MI,const LoadInfo & LI) getTag() argument 824 MachineLoopInfo &LI = getAnalysis<MachineLoopInfo>(); runOnMachineFunction() local [all...] |
/llvm-project/llvm/lib/TableGen/ |
H A D | StringMatcher.cpp | 113 for (const auto &LI : MatchesByLetter) { in EmitStringMatcherForChar() local 146 for (const auto &LI : MatchesByLength) { in Emit() local
|