Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLICM.cpp929 CurLoop->isLoopInvariant(I.getOperand(1))) { in hoistRegion()
1197 if (ORE && Invalidated && CurLoop->isLoopInvariant(LI->getPointerOperand())) in canSinkOrHoistInst()
1799 if (LI && CurLoop->isLoopInvariant(LI->getPointerOperand())) in isSafeToExecuteUnconditionally()
2293 return L->isLoopInvariant(SI->getPointerOperand()); in collectPromotionCandidates()
2295 return L->isLoopInvariant(LI->getPointerOperand()); in collectPromotionCandidates()
2432 if (L.isLoopInvariant(LHS)) { in hoistMinMax()
2436 if (L.isLoopInvariant(LHS) || !L.isLoopInvariant(RHS)) in hoistMinMax()
2498 auto LoopInvariant = [&](Value *V) { return L.isLoopInvariant(V); }; in hoistGEP()
2499 if (!L.isLoopInvariant(SrcPtr) || !all_of(GEP->indices(), LoopInvariant)) in hoistGEP()
2542 assert(!L.isLoopInvariant(VariantLHS) && "Precondition."); in hoistAdd()
[all …]
H A DIndVarSimplify.cpp476 if (!L->isLoopInvariant(Cond)) in rewriteFirstIterationLoopExitValues()
684 if (L->isLoopInvariant(IncI->getOperand(1))) in getLoopPhiForCounter()
694 if (L->isLoopInvariant(IncI->getOperand(0))) in getLoopPhiForCounter()
723 if (L->isLoopInvariant(BI->getCondition())) in needsLFTR()
739 if (!L->isLoopInvariant(RHS)) { in needsLFTR()
740 if (!L->isLoopInvariant(LHS)) in needsLFTR()
939 assert(SE->isLoopInvariant(IVLimit, L) && in genLoopLimit()
1454 if (!L->isLoopInvariant(RHS)) { in canonicalizeExitCondition()
1455 if (!L->isLoopInvariant(LHS)) in canonicalizeExitCondition()
1498 if (L->isLoopInvariant(LHS) == L->isLoopInvariant(RHS)) in canonicalizeExitCondition()
[all …]
H A DLoopPredication.cpp362 if (SE->isLoopInvariant(LHSS, L)) {
382 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in run()
485 if (!L->isLoopInvariant(Op))
497 if (!SE->isLoopInvariant(Op, L) || in generateLoopLatchCheck()
523 if (SE->isLoopInvariant(S, L)) in findInsertPt()
1108 !SE->isLoopInvariant(MinEC, L) ||
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.cpp195 assert(!L.isLoopInvariant(&Root) && in collectHomogenousInstGraphLoopInvariants()
215 if (L.isLoopInvariant(OpV)) { in collectHomogenousInstGraphLoopInvariants()
263 if (!L.isLoopInvariant(PN->getIncomingValueForBlock(&ExitingBB))) in areLoopExitPHIsLoopInvariant()
523 if (L.isLoopInvariant(Cond)) { in unswitchTrivialBranch()
750 if (!L.isLoopInvariant(LoopCond)) in unswitchTrivialSwitch()
2909 if (L.isLoopInvariant(Cond)) { in collectUnswitchCandidates()
2945 if (!isa<Constant>(Cond) && L.isLoopInvariant(Cond)) in collectUnswitchCandidates()
2954 L.isLoopInvariant(SI->getCondition()) && !BB->getUniqueSuccessor()) in collectUnswitchCandidates()
3003 if (L.isLoopInvariant(LHS)) { in canonicalizeForInvariantConditionInjection()
3023 if (L.isLoopInvariant(LH in shouldTryInjectInvariantCondition()
[all...]
H A DLoopFlatten.cpp716 if (!FI.OuterLoop->isLoopInvariant(FI.InnerTripCount)) { in CanFlattenLoopPair()
720 if (!FI.OuterLoop->isLoopInvariant(FI.OuterTripCount)) { in CanFlattenLoopPair()
H A DLoopDataPrefetch.cpp344 if (L->isLoopInvariant(PtrValue)) in runOnLoop()
/freebsd/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()
450 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
455 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
521 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
538 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
H A DLoopAccessAnalysis.cpp222 if (SE->isLoopInvariant(PtrExpr, Lp)) { in getStartAndEndForAccess()
246 assert(SE->isLoopInvariant(ScStart, Lp) && "ScStart needs to be invariant"); in getStartAndEndForAccess()
247 assert(SE->isLoopInvariant(ScEnd, Lp)&& "ScEnd needs to be invariant"); in getStartAndEndForAccess()
818 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in hasComputableBounds()
837 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in isNoWrap()
896 if (isa<SCEVAddRecExpr>(Scev) || L->isLoopInvariant(Ptr) || in findForkedSCEVs()
1054 SE->isLoopInvariant(get<0>(Scevs[0]), L)) && in findForkedPointer()
1056 SE->isLoopInvariant(get<0>(Scevs[1]), L))) { in findForkedPointer()
1463 if (PSE.getSE()->isLoopInvariant(PtrScev, Lp)) in getPtrStride()
1948 if (SE.isLoopInvariant(Src, InnermostLoop) || in getDependenceDistanceStrideAndSize()
[all …]
H A DIVDescriptors.cpp340 if (!SE->isLoopInvariant(PtrScev, TheLoop)) { in AddReductionVar()
655 if (!Loop->isLoopInvariant(NonPhi)) in isAnyOfPattern()
1385 if (L->isLoopInvariant(Op0)) in getCastsForInductionPHI()
1387 else if (L->isLoopInvariant(Op1)) in getCastsForInductionPHI()
1520 if (!ConstStep && !SE->isLoopInvariant(Step, TheLoop)) in isInductionPHI()
H A DLoopInfo.cpp61 bool Loop::isLoopInvariant(const Value *V) const { in isLoopInvariant() function in Loop
68 return all_of(I->operands(), [this](Value *V) { return isLoopInvariant(V); }); in hasLoopInvariantOperands()
83 if (isLoopInvariant(I)) in makeLoopInvariant()
365 return SE.isLoopInvariant(IndDesc.getStep(), this); in isAuxiliaryInductionVariable()
H A DLoopUnrollAnalyzer.cpp43 if (!IterationNumber->isZero() && SE.isLoopInvariant(S, L)) in simplifyInstWithSCEV()
H A DLoads.cpp277 if (L->isLoopInvariant(Ptr)) in isDereferenceableAndAlignedInLoop()
306 assert(SE.isLoopInvariant(AddRec->getStart(), L) && in isDereferenceableAndAlignedInLoop()
H A DScalarEvolution.cpp2508 return isLoopInvariant(S, L) && properlyDominates(S, L->getHeader()); in isAvailableAtLoopEntry()
3707 Operands, [&](const SCEV *Op) { return isLoopInvariant(Op, L); }); in getAddRecExpr()
3719 return isLoopInvariant(Op, NestedLoop); in getAddRecExpr()
4901 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown()
4942 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown()
4995 bool InvariantF = SE.isLoopInvariant(Expr, L); in visitUnknown()
5059 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown()
5541 if (!isLoopInvariant(Accum, L)) in createAddRecFromPHIWithCastsImpl()
5625 assert(isLoopInvariant(Expr, L) && "Expr is expected to be invariant"); in createAddRecFromPHIWithCastsImpl()
5764 if (BO->LHS == PN && L->isLoopInvariant(BO->RHS)) in createSimpleAffineAddRec()
[all …]
/freebsd/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/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopPeel.cpp217 if (L.isLoopInvariant(&V)) in calculate()
318 if (DT.dominates(BB, Latch) && L.isLoopInvariant(Ptr) && in peelToTurnInvariantLoadsDerefencebale()
455 if (L.isLoopInvariant(LHS)) { in countToEliminateCompares()
458 } else if (L.isLoopInvariant(RHS)) { in countToEliminateCompares()
H A DSimplifyIndVar.cpp524 if (!(ICI->getOperand(0) == TI && L->isLoopInvariant(ICI->getOperand(1))) && in eliminateTrunc()
525 !(ICI->getOperand(1) == TI && L->isLoopInvariant(ICI->getOperand(0)))) in eliminateTrunc()
556 bool IsSwapped = L->isLoopInvariant(ICI->getOperand(0)); in eliminateTrunc()
644 if (!SE->isLoopInvariant(S, L)) in replaceIVUserWithLoopInvariant()
1244 L && L->getLoopPreheader() && L->isLoopInvariant(NarrowOper); in createExtendInst()
H A DScalarEvolutionExpander.cpp301 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break; in InsertBinop()
387 if (!L->isLoopInvariant(V) || !L->isLoopInvariant(Idx)) break; in expandAddToGEP()
1491 if (SE.isLoopInvariant(S, L)) { in expand()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h86 bool isLoopInvariant(MachineInstr &I, const Register ExcludeReg = 0) const;
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopCacheAnalysis.h107 bool isLoopInvariant(const Loop &L) const;
H A DLoopInfo.h66 bool isLoopInvariant(const Value *V) const;
/freebsd/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/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineLoopInfo.cpp246 bool MachineLoop::isLoopInvariant(MachineInstr &I, in isLoopInvariant() function in MachineLoop
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp690 assert(SE->isLoopInvariant(BasePtrIncSCEV, L) && in rewriteForBase()
884 if (L->isLoopInvariant(PtrValue)) in collectCandidates()
1151 if (!SE->isLoopInvariant(BasePtrIncSCEV, L)) in getNodeForInc()
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp220 if (!SE->isLoopInvariant(EC, L)) { in IsSafeActiveMask()

123