Home
last modified time | relevance | path

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

123

/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLICM.cpp2417 if (L.isLoopInvariant(LHS)) { in hoistMinMax()
2421 if (L.isLoopInvariant(LHS) || !L.isLoopInvariant(RHS)) in hoistMinMax()
2538 if (L.isLoopInvariant(VariantOp)) in hoistAdd()
2540 if (L.isLoopInvariant(VariantOp) || !L.isLoopInvariant(InvariantOp)) in hoistAdd()
2592 if (L.isLoopInvariant(VariantOp) || !L.isLoopInvariant(InvariantOp)) in hoistSub()
2644 if (L.isLoopInvariant(LHS)) { in hoistAddSub()
2650 if (L.isLoopInvariant(LHS) || !L.isLoopInvariant(RHS) || !LHS->hasOneUse()) in hoistAddSub()
2679 if (L.isLoopInvariant(VariantOp)) in hoistFPAssociation()
2681 if (L.isLoopInvariant(VariantOp) || !L.isLoopInvariant(InvariantOp)) in hoistFPAssociation()
2704 if (L.isLoopInvariant(U0)) in hoistFPAssociation()
[all …]
H A DIndVarSimplify.cpp466 if (!L->isLoopInvariant(Cond)) in rewriteFirstIterationLoopExitValues()
672 if (L->isLoopInvariant(IncI->getOperand(1))) in getLoopPhiForCounter()
711 if (L->isLoopInvariant(BI->getCondition())) in needsLFTR()
727 if (!L->isLoopInvariant(RHS)) { in needsLFTR()
728 if (!L->isLoopInvariant(LHS)) in needsLFTR()
927 assert(SE->isLoopInvariant(IVLimit, L) && in genLoopLimit()
1442 if (!L->isLoopInvariant(RHS)) { in canonicalizeExitCondition()
1443 if (!L->isLoopInvariant(LHS)) in canonicalizeExitCondition()
1486 if (L->isLoopInvariant(LHS) == L->isLoopInvariant(RHS)) in canonicalizeExitCondition()
1489 if (L->isLoopInvariant(LHS)) { in canonicalizeExitCondition()
[all …]
H A DLoopPredication.cpp362 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
382 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
485 if (!L->isLoopInvariant(Op)) in findInsertPt()
497 if (!SE->isLoopInvariant(Op, L) || in findInsertPt()
523 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
1108 !SE->isLoopInvariant(MinEC, L) || in predicateLoopExits()
H A DLoopVersioningLICM.cpp336 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning()
350 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning()
H A DSimpleLoopUnswitch.cpp193 assert(!L.isLoopInvariant(&Root) && in collectHomogenousInstGraphLoopInvariants()
213 if (L.isLoopInvariant(OpV)) { in collectHomogenousInstGraphLoopInvariants()
261 if (!L.isLoopInvariant(PN->getIncomingValueForBlock(&ExitingBB))) in areLoopExitPHIsLoopInvariant()
521 if (L.isLoopInvariant(Cond)) { in unswitchTrivialBranch()
745 if (!L.isLoopInvariant(LoopCond)) in unswitchTrivialSwitch()
2887 if (L.isLoopInvariant(Cond)) { in collectUnswitchCandidates()
2923 if (!isa<Constant>(Cond) && L.isLoopInvariant(Cond)) in collectUnswitchCandidates()
2932 L.isLoopInvariant(SI->getCondition()) && !BB->getUniqueSuccessor()) in collectUnswitchCandidates()
2981 if (L.isLoopInvariant(LHS)) { in canonicalizeForInvariantConditionInjection()
3001 if (L.isLoopInvariant(LHS) || !L.isLoopInvariant(RHS)) in shouldTryInjectInvariantCondition()
H A DInductiveRangeCheckElimination.cpp275 return SE.isLoopInvariant(SE.getSCEV(V), L); in parseRangeCheckICmp()
379 if (SE.isLoopInvariant(IV, L)) in reassociateSubLHS()
382 else if (SE.isLoopInvariant(Offset, L)) in reassociateSubLHS()
H A DLoopFlatten.cpp709 if (!FI.OuterLoop->isLoopInvariant(FI.InnerTripCount)) { in CanFlattenLoopPair()
713 if (!FI.OuterLoop->isLoopInvariant(FI.OuterTripCount)) { in CanFlattenLoopPair()
H A DLoopIdiomRecognize.cpp458 CurLoop->isLoopInvariant(SplatValue)) { in isLegalStore()
880 if (!SE->isLoopInvariant(MemsetSizeSCEV, CurLoop)) { in processLoopMemSet()
918 if (!SplatValue || !CurLoop->isLoopInvariant(SplatValue)) in processLoopMemSet()
2171 return L->isLoopInvariant(V) && SubPattern.match(V); in match()
2275 assert(CurLoop->isLoopInvariant(BaseX) && in detectShiftUntilBitTestIdiom()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopCacheAnalysis.cpp96 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
281 if (isLoopInvariant(L)) { in computeRefCost()
445 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
450 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
516 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
533 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
H A DLoopAccessAnalysis.cpp215 if (SE->isLoopInvariant(PtrExpr, Lp)) { in insert()
240 assert(SE->isLoopInvariant(ScEnd, Lp)&& "ScEnd needs to be invariant"); in insert()
820 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in hasComputableBounds()
839 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in isNoWrap()
898 if (isa<SCEVAddRecExpr>(Scev) || L->isLoopInvariant(Ptr) || in findForkedSCEVs()
1056 SE->isLoopInvariant(get<0>(Scevs[0]), L)) && in findForkedPointer()
1058 SE->isLoopInvariant(get<0>(Scevs[1]), L))) { in findForkedPointer()
1916 return !SE.isLoopInvariant(SE.getSCEV(const_cast<Value *>(UO)), L); in isLoopVariantIndirectAddress()
2729 return SE->isLoopInvariant(S, TheLoop); in isInvariant()
2773 !SE->isLoopInvariant(SE->getSCEV(GEP->getOperand(i)), Lp)) in stripGetElementPtr()
[all …]
H A DIVDescriptors.cpp340 if (!SE->isLoopInvariant(PtrScev, TheLoop)) { in AddReductionVar()
656 if (!Loop->isLoopInvariant(NonPhi)) in isAnyOfPattern()
1386 if (L->isLoopInvariant(Op0)) in getCastsForInductionPHI()
1388 else if (L->isLoopInvariant(Op1)) in getCastsForInductionPHI()
1521 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()
82 if (isLoopInvariant(I)) in makeLoopInvariant()
364 return SE.isLoopInvariant(IndDesc.getStep(), this); in isAuxiliaryInductionVariable()
H A DLoopUnrollAnalyzer.cpp43 if (!IterationNumber->isZero() && SE.isLoopInvariant(S, L)) in simplifyInstWithSCEV()
H A DLoads.cpp275 if (L->isLoopInvariant(Ptr)) in isDereferenceableAndAlignedInLoop()
304 assert(SE.isLoopInvariant(AddRec->getStart(), L) && in isDereferenceableAndAlignedInLoop()
H A DScalarEvolution.cpp5536 if (!isLoopInvariant(Accum, L)) in createAddRecFromPHIWithCastsImpl()
9104 if (isLoopInvariant(LHS, L) && !isLoopInvariant(RHS, L)) { in computeExitLimitFromICmp()
9192 !isLoopInvariant(RHS, L)) in computeExitLimitFromICmp()
9210 !isLoopInvariant(RHS, L)) in computeExitLimitFromICmp()
10982 if (!isLoopInvariant(RHS, L)) { in getLoopInvariantPredicate()
10983 if (!isLoopInvariant(LHS, L)) in getLoopInvariantPredicate()
11095 if (!isLoopInvariant(RHS, L)) { in getLoopInvariantExitCondDuringFirstIterationsImpl()
11096 if (!isLoopInvariant(LHS, L)) in getLoopInvariantExitCondDuringFirstIterationsImpl()
12719 if (!isLoopInvariant(RHS, L)) in howManyLessThans()
12933 if (!isLoopInvariant(RHS, L)) { in howManyLessThans()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationLegality.cpp371 if (!(CondOp0 == IVUpdate && OuterLp->isLoopInvariant(CondOp1)) && in isUniformLoop()
372 !(CondOp1 == IVUpdate && OuterLp->isLoopInvariant(CondOp0))) { in isUniformLoop()
515 if (!SE.isLoopInvariant(Step, TheLoop)) { in visitAddRecExpr()
526 if (CannotAnalyze || SE.isLoopInvariant(S, TheLoop)) in visit()
532 if (SE.isLoopInvariant(S, TheLoop)) in visitUnknown()
641 !TheLoop->isLoopInvariant(Br->getCondition()) && in canVectorizeOuterLoop()
937 if (!SE->isLoopInvariant(PSE.getSCEV(CI->getOperand(i)), TheLoop)) { in canVectorizeInstrs()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h82 bool isLoopInvariant(MachineInstr &I) const;
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopCacheAnalysis.h107 bool isLoopInvariant(const Loop &L) const;
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineLoopInfo.cpp201 bool MachineLoop::isLoopInvariant(MachineInstr &I) const { in isLoopInvariant() function in MachineLoop
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVGatherScatterLowering.cpp217 if (!L->isLoopInvariant(Step)) in matchStridedRecurrence()
280 if (!L->isLoopInvariant(OtherOp)) in matchStridedRecurrence()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSimplifyIndVar.cpp510 if (!(ICI->getOperand(0) == TI && L->isLoopInvariant(ICI->getOperand(1))) && in eliminateTrunc()
511 !(ICI->getOperand(1) == TI && L->isLoopInvariant(ICI->getOperand(0)))) in eliminateTrunc()
542 bool IsSwapped = L->isLoopInvariant(ICI->getOperand(0)); in eliminateTrunc()
630 if (!SE->isLoopInvariant(S, L)) in replaceIVUserWithLoopInvariant()
1214 L && L->getLoopPreheader() && L->isLoopInvariant(NarrowOper); in createExtendInst()
H A DLoopPeel.cpp217 if (L.isLoopInvariant(&V)) in calculate()
318 if (DT.dominates(BB, Latch) && L.isLoopInvariant(Ptr) && in peelToTurnInvariantLoadsDerefencebale()
H A DScalarEvolutionExpander.cpp262 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break; in InsertBinop()
348 if (!L->isLoopInvariant(V) || !L->isLoopInvariant(Idx)) break; in expandAddToGEP()
1434 if (SE.isLoopInvariant(S, L)) { in expand()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp690 assert(SE->isLoopInvariant(BasePtrIncSCEV, L) && in rewriteForBase()
879 if (L->isLoopInvariant(PtrValue)) in collectCandidates()
1146 if (!SE->isLoopInvariant(BasePtrIncSCEV, L)) in getNodeForInc()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64LoopIdiomTransform.cpp325 if (!CurLoop->isLoopInvariant(PtrA) || !CurLoop->isLoopInvariant(PtrB) || in recognizeByteCompare()

123