/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | Sink.cpp | 66 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget() 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 105 SinkInstruction(Instruction * Inst,SmallPtrSetImpl<Instruction * > & Stores,DominatorTree & DT,LoopInfo & LI,AAResults & AA) SinkInstruction() argument 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
|
H A D | LoopSimplifyCFG.cpp | 90 Loop &L, LoopInfo &LI) { in getInnermostLoopFor() 112 LoopInfo &LI; member in __anona0e87c8a0111::ConstantTerminatorFoldingImpl 528 ConstantTerminatorFoldingImpl(Loop &L, LoopInfo &LI, DominatorTree &DT, in ConstantTerminatorFoldingImpl() 642 static bool constantFoldTerminators(Loop &L, DominatorTree &DT, LoopInfo &LI, in constantFoldTerminators() 661 LoopInfo &LI, MemorySSAUpdater *MSSAU, in mergeBlocksIntoPredecessors() 695 static bool simplifyLoopCFG(Loop &L, DominatorTree &DT, LoopInfo &LI, in simplifyLoopCFG()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | FixIrreducible.cpp | 167 createNaturalLoopInternal(LoopInfo & LI,DominatorTree & DT,Loop * ParentLoop,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoopInternal() argument 256 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Function * F,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument 262 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Loop & L,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument 270 makeReducible(LoopInfo & LI,DominatorTree & DT,Graph && G) makeReducible() argument 316 FixIrreducibleImpl(Function & F,LoopInfo & LI,DominatorTree & DT) FixIrreducibleImpl() argument 344 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); runOnFunction() local 351 auto &LI = AM.getResult<LoopAnalysis>(F); run() local [all...] |
H A D | UnifyLoopExits.cpp | 143 static bool unifyLoopExits(DominatorTree &DT, LoopInfo &LI, Loop *L) { in unifyLoopExits() 216 static bool runImpl(LoopInfo &LI, DominatorTree &DT) { in runImpl() 231 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); in runOnFunction() local 243 auto &LI = AM.getResult<LoopAnalysis>(F); in run() local
|
H A D | LCSSA.cpp | 78 const DominatorTree &DT, const LoopInfo &LI, in formLCSSAForInstructions() 363 bool llvm::formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI, in formLCSSA() 426 const LoopInfo *LI, ScalarEvolution *SE) { in formLCSSARecursively() 438 static bool formLCSSAOnAllLoops(const LoopInfo *LI, const DominatorTree &DT, in formLCSSAOnAllLoops() 455 LoopInfo *LI; member 520 auto &LI = AM.getResult<LoopAnalysis>(F); in run() local
|
H A D | LoopSimplify.cpp | 119 LoopInfo *LI, MemorySSAUpdater *MSSAU, in InsertPreheaderForLoop() 216 DominatorTree *DT, LoopInfo *LI, in separateNestedLoop() 359 DominatorTree *DT, LoopInfo *LI, in insertUniqueBackedgeBlock() 479 DominatorTree *DT, LoopInfo *LI, in simplifyOneLoop() 700 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, in simplifyLoop() 796 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); in runOnFunction() local 829 LoopInfo *LI = &AM.getResult<LoopAnalysis>(F); in run() local
|
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/ |
H A D | SPIRVConvergenceRegionAnalysis.cpp | 123 ConvergenceRegion::ConvergenceRegion(DominatorTree &DT, LoopInfo &LI, in ConvergenceRegion() 136 DominatorTree &DT, LoopInfo &LI, in ConvergenceRegion() 201 ConvergenceRegionAnalyzer(Function &F, DominatorTree &DT, LoopInfo &LI) in ConvergenceRegionAnalyzer() 223 findPathsToMatch(LoopInfo &LI, BasicBlock *From, in findPathsToMatch() 312 LoopInfo &LI; member in llvm::SPIRV::ConvergenceRegionAnalyzer 317 LoopInfo &LI) { in getConvergenceRegions() 332 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); in runOnFunction() local 343 auto &LI = AM.getResult<LoopAnalysis>(F); in run() local
|
/freebsd/contrib/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()
|
H A D | FunctionPropertiesAnalysis.cpp | 204 const LoopInfo &LI) { in updateAggregateStats() 227 const Function &F, const DominatorTree &DT, const LoopInfo &LI) { in getFunctionPropertiesInfo() 428 const auto &LI = FAM.getResult<LoopAnalysis>(const_cast<Function &>(Caller)); in finish() local 436 LoopInfo LI(DT); in isUpdateValid() local
|
H A D | MemoryDependenceAnalysis.cpp | 110 if (const LoadInst *LI = dyn_cast<LoadInst>(Inst)) { in GetLocation() local 246 if (auto *LI = dyn_cast<LoadInst>(QueryInst)) { in getPointerDependencyFrom() local 277 MemoryDependenceResults::getInvariantGroupPointerDependency(LoadInst *LI, in getInvariantGroupPointerDependency() 382 auto *LI = dyn_cast<LoadInst>(SI->getValueOperand()); in canSkipClobberingStore() local 441 if (LoadInst *LI = dyn_cast<LoadInst>(QueryInst)) { in getSimplePointerDependencyFrom() local 453 if (auto *LI = dyn_cast<LoadInst>(I)) in getSimplePointerDependencyFrom() local 511 if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) { in getSimplePointerDependencyFrom() local 901 if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) { in getNonLocalPointerDependency() local 941 if (LoadInst *LI = dyn_cast_or_null<LoadInst>(QueryInst)) in getNonLocalInfoForBlock() local 1084 if (LoadInst *LI = dyn_cast_or_null<LoadInst>(QueryInst)) in getNonLocalPointerDepFromBB() local
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | RegAllocBasic.cpp | 89 void enqueueImpl(const LiveInterval *LI) override { Queue.push(LI); } in enqueueImpl() 94 const LiveInterval *LI = Queue.top(); in dequeue() local 147 LiveInterval &LI = LIS->getInterval(VirtReg); in INITIALIZE_PASS_DEPENDENCY() local 166 LiveInterval &LI = LIS->getInterval(VirtReg); in LRE_WillShrinkVirtReg() local
|
H A D | LiveRangeEdit.cpp | 40 LiveInterval &LI = LIS.createEmptyInterval(VReg); in createEmptyIntervalFrom() local 207 bool LiveRangeEdit::foldAsLoad(LiveInterval *LI, in foldAsLoad() 266 bool LiveRangeEdit::useIsKill(const LiveInterval &LI, in useIsKill() 349 LiveInterval &LI = LIS.getInterval(Reg); in eliminateDeadDef() local 450 LiveInterval *LI = ToShrink.pop_back_val(); in eliminateDeadDefs() local 499 LiveInterval &LI = LIS.getInterval(get(I)); in calculateRegClassAndHint() local
|
H A D | SplitKit.cpp | 401 template <typename T> auto &getSubrangeImpl(LaneBitmask LM, T &LI) { in getSubrangeImpl() 409 LiveInterval &LI) { in getSubRangeForMaskExact() 414 const LiveInterval &LI) { in getSubRangeForMaskExact() 423 const LiveInterval &LI) { in getSubRangeForMask() 430 void SplitEditor::addDeadDef(LiveInterval &LI, VNInfo *VNI, bool Original) { in addDeadDef() 478 LiveInterval *LI = &LIS.getInterval(Edit->get(RegIdx)); in defValue() local 596 LiveInterval *LI = &LIS.getInterval(Edit->get(RegIdx)); in defFromParent() local 855 LiveInterval *LI = &LIS.getInterval(Edit->get(0)); in removeBackCopies() local 962 LiveInterval *LI = &LIS.getInterval(Edit->get(0)); in computeRedundantBackCopies() local 1015 LiveInterval *LI = &LIS.getInterval(Edit->get(0)); in hoistCopies() local [all …]
|
H A D | CalcSpillWeights.cpp | 82 bool VirtRegAuxInfo::isRematerializable(const LiveInterval &LI, in isRematerializable() 132 bool VirtRegAuxInfo::isLiveAtStatepointVarArg(LiveInterval &LI) { in isLiveAtStatepointVarArg() 142 void VirtRegAuxInfo::calculateSpillWeightAndHint(LiveInterval &LI) { in calculateSpillWeightAndHint() 150 static bool canMemFoldInlineAsm(LiveInterval &LI, in canMemFoldInlineAsm() 161 float VirtRegAuxInfo::weightCalcHelper(LiveInterval &LI, SlotIndex *Start, in weightCalcHelper()
|
H A D | LiveIntervalCalc.cpp | 43 calculate(LiveInterval & LI,bool TrackSubRegs) calculate() argument 107 constructMainRangeFromSubranges(LiveInterval & LI) constructMainRangeFromSubranges() argument 137 extendToUses(LiveRange & LR,Register Reg,LaneBitmask Mask,LiveInterval * LI) extendToUses() argument [all...] |
H A D | LiveIntervals.cpp | 213 bool LiveIntervals::computeVirtRegInterval(LiveInterval &LI) { in computeVirtRegInterval() 226 LiveInterval &LI = createEmptyInterval(Reg); in computeVirtRegs() local 356 for (const auto &LI : MBB.liveins()) { in computeLiveInRegUnits() local 409 const LiveInterval &LI = getInterval(Reg); in extendSegmentsToUses() local 527 bool LiveIntervals::computeDeadValues(LiveInterval &LI, in computeDeadValues() 719 const LiveInterval &LI = getInterval(Reg); in addKillFlags() local 861 LiveIntervals::hasPHIKill(const LiveInterval &LI, const VNInfo *VNI) const { in hasPHIKill() argument 922 bool LiveIntervals::checkRegMaskInterference(const LiveInterval &LI, in checkRegMaskInterference() 1042 LiveInterval &LI = LIS.getInterval(Reg); in updateAllRanges() local 1569 LiveInterval &LI = getInterval(Reg); in handleMoveIntoNewBundle() local [all …]
|
/freebsd/contrib/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()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64FalkorHWPFFix.cpp | 68 FalkorMarkStridedAccesses(LoopInfo &LI, ScalarEvolution &SE) in FalkorMarkStridedAccesses() 76 LoopInfo &LI; member in __anon523956620111::FalkorMarkStridedAccesses 127 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); in runOnFunction() local 647 LoadInfo LI; in getLoadInfo() local 658 const LoadInfo &LI) { in getTag() 824 MachineLoopInfo &LI = getAnalysis<MachineLoopInfoWrapperPass>().getLI(); in runOnMachineFunction() local
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | LazyBlockFrequencyInfo.h | 40 const LoopInfoT *LI) { in setAnalysis() 72 const LoopInfoT *LI = nullptr; variable
|
H A D | LoopAnalysisManager.h | 57 LoopInfo &LI; member 90 explicit Result(LoopAnalysisManager &InnerAM, LoopInfo &LI) in Result() 139 LoopInfo *LI; variable
|
H A D | LazyBranchProbabilityInfo.h | 58 LazyBranchProbabilityInfo(const Function *F, const LoopInfo *LI, in LazyBranchProbabilityInfo() 80 const LoopInfo *LI; variable
|
/freebsd/contrib/llvm-project/llvm/tools/llvm-diff/lib/ |
H A D | DifferenceEngine.cpp | 304 BasicBlock::const_iterator LI = L->begin(), LE = L->end(); in diff() local 389 const PHINode &LI = cast<PHINode>(*L); in diff() local 422 const InvokeInst &LI = cast<InvokeInst>(*L); in diff() local 434 const CallBrInst &LI = cast<CallBrInst>(*L); in diff() local 455 const BranchInst *LI = cast<BranchInst>(L); in diff() local 473 const IndirectBrInst *LI = cast<IndirectBrInst>(L); in diff() local 493 const SwitchInst *LI = cast<SwitchInst>(L); in diff() local 774 for (Function::const_arg_iterator LI = L->arg_begin(), LE = L->arg_end(), in diff() local 830 for (BasicBlock::const_iterator LI = LStart; LI != LE; ++LI, ++Index) { in runBlockDiff() local 855 BasicBlock::const_iterator LI = LStart, RI = RStart; in runBlockDiff() local
|
/freebsd/contrib/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
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DebugLocStream.h | 111 return ArrayRef(Entries).slice(Lists[LI].EntryOffset, getNumEntries(LI)); in getEntries() local 137 if (LI + 1 == Lists.size()) in getNumEntries() argument 61 getList(size_t LI) getList() argument 81 size_t LI = Lists.size(); startList() local [all...] |