Home
last modified time | relevance | path

Searched refs:isLoopInvariant (Results 1 – 25 of 56) sorted by relevance

123

/llvm-project-15.0.7/llvm/lib/Analysis/
H A DLoopCacheAnalysis.cpp96 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
282 if (isLoopInvariant(L)) { in computeRefCost()
446 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
451 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
517 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
534 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
H A DIVDescriptors.cpp343 if (!SE->isLoopInvariant(PtrScev, TheLoop)) { in AddReductionVar()
660 if (!Loop->isLoopInvariant(NonPhi)) in isSelectCmpPattern()
1398 if (L->isLoopInvariant(Op0)) in getCastsForInductionPHI()
1400 else if (L->isLoopInvariant(Op1)) in getCastsForInductionPHI()
1527 if (!ConstStep && !SE->isLoopInvariant(Step, TheLoop)) in isInductionPHI()
H A DLoopInfo.cpp60 bool Loop::isLoopInvariant(const Value *V) const { in isLoopInvariant() function in Loop
67 return all_of(I->operands(), [this](Value *V) { return isLoopInvariant(V); }); in hasLoopInvariantOperands()
81 if (isLoopInvariant(I)) in makeLoopInvariant()
360 return SE.isLoopInvariant(IndDesc.getStep(), this); in isAuxiliaryInductionVariable()
H A DLoopUnrollAnalyzer.cpp43 if (!IterationNumber->isZero() && SE.isLoopInvariant(S, L)) in simplifyInstWithSCEV()
H A DLoads.cpp280 if (L->isLoopInvariant(Ptr)) in isDereferenceableAndAlignedInLoop()
305 assert(SE.isLoopInvariant(StartS, L) && "implied by addrec definition"); in isDereferenceableAndAlignedInLoop()
H A DScalarEvolution.cpp5347 if (!isLoopInvariant(Accum, L)) in createAddRecFromPHIWithCastsImpl()
8875 if (isLoopInvariant(LHS, L) && !isLoopInvariant(RHS, L)) { in computeExitLimitFromICmp()
10733 if (!isLoopInvariant(RHS, L)) { in getLoopInvariantPredicate()
10734 if (!isLoopInvariant(LHS, L)) in getLoopInvariantPredicate()
10787 if (!isLoopInvariant(RHS, L)) { in getLoopInvariantExitCondDuringFirstIterations()
10788 if (!isLoopInvariant(LHS, L)) in getLoopInvariantExitCondDuringFirstIterations()
12407 if (!isLoopInvariant(RHS, L)) in howManyLessThans()
12545 if (!isLoopInvariant(RHS, L)) in howManyLessThans()
12623 if (!isLoopInvariant(RHS, L)) { in howManyLessThans()
12819 if (!isLoopInvariant(RHS, L)) in howManyGreaterThans()
[all …]
H A DLoopAccessAnalysis.cpp209 if (SE->isLoopInvariant(PtrExpr, Lp)) { in insert()
737 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in hasComputableBounds()
756 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in isNoWrap()
815 if (isa<SCEVAddRecExpr>(Scev) || L->isLoopInvariant(Ptr) || in findForkedSCEVs()
2500 return (SE->isLoopInvariant(SE->getSCEV(V), TheLoop)); in isUniform()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DIndVarSimplify.cpp479 if (!L->isLoopInvariant(Cond)) in rewriteFirstIterationLoopExitValues()
724 if (L->isLoopInvariant(BI->getCondition())) in needsLFTR()
740 if (!L->isLoopInvariant(RHS)) { in needsLFTR()
741 if (!L->isLoopInvariant(LHS)) in needsLFTR()
1003 assert(SE->isLoopInvariant(IVOffset, L) && in genLoopLimit()
1043 assert(SE->isLoopInvariant(IVLimit, L) && in genLoopLimit()
1457 if (!L->isLoopInvariant(RHS)) { in canonicalizeExitCondition()
1458 if (!L->isLoopInvariant(LHS)) in canonicalizeExitCondition()
1501 if (L->isLoopInvariant(LHS) == L->isLoopInvariant(RHS)) in canonicalizeExitCondition()
1504 if (L->isLoopInvariant(LHS)) { in canonicalizeExitCondition()
[all …]
H A DLoopPredication.cpp393 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
413 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
516 if (!L->isLoopInvariant(Op)) in findInsertPt()
528 if (!SE->isLoopInvariant(Op, L) || in findInsertPt()
554 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
1164 !SE->isLoopInvariant(MinEC, L) || in predicateLoopExits()
H A DLoopVersioningLICM.cpp372 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning()
386 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning()
H A DSimpleLoopUnswitch.cpp138 assert(!L.isLoopInvariant(&Root) && in collectHomogenousInstGraphLoopInvariants()
158 if (L.isLoopInvariant(OpV)) { in collectHomogenousInstGraphLoopInvariants()
205 if (!L.isLoopInvariant(PN->getIncomingValueForBlock(&ExitingBB))) in areLoopExitPHIsLoopInvariant()
463 if (L.isLoopInvariant(Cond)) { in unswitchTrivialBranch()
687 if (!L.isLoopInvariant(LoopCond)) in unswitchTrivialSwitch()
2755 if (!isa<Constant>(Cond) && L.isLoopInvariant(Cond)) in unswitchBestCondition()
2763 L.isLoopInvariant(SI->getCondition()) && !BB->getUniqueSuccessor()) in unswitchBestCondition()
2777 if (L.isLoopInvariant(Cond)) { in unswitchBestCondition()
H A DLICM.cpp916 CurLoop->isLoopInvariant(I.getOperand(1))) { in hoistRegion()
1170 if (ORE && Invalidated && CurLoop->isLoopInvariant(LI->getPointerOperand())) in canSinkOrHoistInst()
1753 if (LI && CurLoop->isLoopInvariant(LI->getPointerOperand())) in isSafeToExecuteUnconditionally()
2212 return L->isLoopInvariant(SI->getPointerOperand()); in collectPromotionCandidates()
2214 return L->isLoopInvariant(LI->getPointerOperand()); in collectPromotionCandidates()
H A DLoopFlatten.cpp671 if (!FI.OuterLoop->isLoopInvariant(FI.InnerTripCount)) { in CanFlattenLoopPair()
675 if (!FI.OuterLoop->isLoopInvariant(FI.OuterTripCount)) { in CanFlattenLoopPair()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h73 bool isLoopInvariant(MachineInstr &I) const;
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationLegality.cpp366 if (!(CondOp0 == IVUpdate && OuterLp->isLoopInvariant(CondOp1)) && in isUniformLoop()
367 !(CondOp1 == IVUpdate && OuterLp->isLoopInvariant(CondOp0))) { in isUniformLoop()
497 !TheLoop->isLoopInvariant(Br->getCondition()) && in canVectorizeOuterLoop()
780 if (!SE->isLoopInvariant(PSE.getSCEV(CI->getOperand(i)), TheLoop)) { in canVectorizeInstrs()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DMachineLoopInfo.cpp154 bool MachineLoop::isLoopInvariant(MachineInstr &I) const { in isLoopInvariant() function in MachineLoop
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DLoopCacheAnalysis.h106 bool isLoopInvariant(const Loop &L) const;
/llvm-project-15.0.7/llvm/lib/Target/RISCV/
H A DRISCVGatherScatterLowering.cpp196 if (!L->isLoopInvariant(Step)) in matchStridedRecurrence()
257 if (!L->isLoopInvariant(OtherOp)) in matchStridedRecurrence()
/llvm-project-15.0.7/llvm/test/Transforms/LoopSimplify/
H A Dashr-crash.ll4 ; Assertion `isLoopInvariant(Operands[i],...
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DScalarEvolutionExpander.cpp267 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break; in InsertBinop()
607 if (!L->isLoopInvariant(V) || !L->isLoopInvariant(Idx)) break; in expandAddToGEP()
624 if (!L->isLoopInvariant(V)) break; in expandAddToGEP()
627 GepIndices, [L](Value *Op) { return !L->isLoopInvariant(Op); }); in expandAddToGEP()
1827 if (SE.isLoopInvariant(S, L)) { in expand()
H A DSimplifyIndVar.cpp535 if (!(ICI->getOperand(0) == TI && L->isLoopInvariant(ICI->getOperand(1))) && in eliminateTrunc()
536 !(ICI->getOperand(1) == TI && L->isLoopInvariant(ICI->getOperand(0)))) in eliminateTrunc()
567 bool IsSwapped = L->isLoopInvariant(ICI->getOperand(0)); in eliminateTrunc()
654 if (!SE->isLoopInvariant(S, L)) in replaceIVUserWithLoopInvariant()
1194 L && L->getLoopPreheader() && L->isLoopInvariant(NarrowOper); in createExtendInst()
H A DLoopPeel.cpp138 if (L->isLoopInvariant(Input)) in calculateIterationsToInvariance()
203 if (DT.dominates(BB, Latch) && L.isLoopInvariant(Ptr) && in peelToTurnInvariantLoadsDerefencebale()
/llvm-project-15.0.7/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp224 if (!SE->isLoopInvariant(EC, L)) { in IsSafeActiveMask()
/llvm-project-15.0.7/polly/lib/Support/
H A DScopHelper.cpp510 if (!SE.isLoopInvariant(PtrSCEV, OuterLoop)) in hasVariantIndex()
541 if (!SE.isLoopInvariant(PtrSCEV, L)) in isHoistableLoad()
/llvm-project-15.0.7/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp689 assert(SE->isLoopInvariant(BasePtrIncSCEV, L) && in rewriteForBase()
878 if (L->isLoopInvariant(PtrValue)) in collectCandidates()
1146 if (!SE->isLoopInvariant(BasePtrIncSCEV, L)) in getNodeForInc()

123