Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLICM.cpp932 CurLoop->isLoopInvariant(I.getOperand(1))) { in hoistRegion()
1193 if (ORE && Invalidated && CurLoop->isLoopInvariant(LI->getPointerOperand())) in canSinkOrHoistInst()
1728 if (LI && CurLoop->isLoopInvariant(LI->getPointerOperand())) in isSafeToExecuteUnconditionally()
2230 return !isa<ConstantData>(PtrOp) && L->isLoopInvariant(PtrOp); in collectPromotionCandidates()
2234 return !isa<ConstantData>(PtrOp) && L->isLoopInvariant(PtrOp); in collectPromotionCandidates()
2443 if (L.isLoopInvariant(LHS)) { in hoistMinMax()
2447 if (L.isLoopInvariant(LHS) || !L.isLoopInvariant(RHS)) in hoistMinMax()
2516 auto LoopInvariant = [&](Value *V) { return L.isLoopInvariant(V); }; in hoistGEP()
2517 if (!L.isLoopInvariant(SrcPtr) || !all_of(GEP->indices(), LoopInvariant)) in hoistGEP()
2560 assert(!L.isLoopInvariant(VariantLHS) && "Precondition."); in hoistAdd()
[all …]
H A DIndVarSimplify.cpp472 if (!L->isLoopInvariant(Cond)) in rewriteFirstIterationLoopExitValues()
679 if (L->isLoopInvariant(IncI->getOperand(1))) in getLoopPhiForCounter()
689 if (L->isLoopInvariant(IncI->getOperand(0))) in getLoopPhiForCounter()
718 if (L->isLoopInvariant(BI->getCondition())) in needsLFTR()
734 if (!L->isLoopInvariant(RHS)) { in needsLFTR()
735 if (!L->isLoopInvariant(LHS)) in needsLFTR()
930 assert(SE->isLoopInvariant(IVLimit, L) && in genLoopLimit()
1430 if (!L->isLoopInvariant(RHS)) { in canonicalizeExitCondition()
1431 if (!L->isLoopInvariant(LHS)) in canonicalizeExitCondition()
1473 if (L->isLoopInvariant(LHS) == L->isLoopInvariant(RHS)) in canonicalizeExitCondition()
[all …]
H A DLoopPredication.cpp361 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
381 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
484 if (!L->isLoopInvariant(Op)) in findInsertPt()
496 if (!SE->isLoopInvariant(Op, L) || in findInsertPt()
522 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
1107 !SE->isLoopInvariant(MinEC, L) || in predicateLoopExits()
H A DLoopVersioningLICM.cpp333 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning()
354 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()
529 if (L.isLoopInvariant(Cond)) { in unswitchTrivialBranch()
756 if (!L.isLoopInvariant(LoopCond)) in unswitchTrivialSwitch()
2914 if (L.isLoopInvariant(Cond)) { in collectUnswitchCandidates()
2950 if (!isa<Constant>(Cond) && L.isLoopInvariant(Cond)) in collectUnswitchCandidates()
2959 L.isLoopInvariant(SI->getCondition()) && !BB->getUniqueSuccessor()) in collectUnswitchCandidates()
3010 if (L.isLoopInvariant(LHS)) { in canonicalizeForInvariantConditionInjection()
3030 if (L.isLoopInvariant(LHS) || !L.isLoopInvariant(RHS)) in shouldTryInjectInvariantCondition()
H A DInductiveRangeCheckElimination.cpp269 return SE.isLoopInvariant(SE.getSCEV(V), L); in parseRangeCheckICmp()
373 if (SE.isLoopInvariant(IV, L)) in reassociateSubLHS()
376 else if (SE.isLoopInvariant(Offset, L)) in reassociateSubLHS()
H A DLoopTermFold.cpp88 if (!LHS || !L->isLoopInvariant(RHS)) in canFoldTermCondOfLoop()
H A DLoopFlatten.cpp716 if (!FI.OuterLoop->isLoopInvariant(FI.InnerTripCount)) { in CanFlattenLoopPair()
720 if (!FI.OuterLoop->isLoopInvariant(FI.OuterTripCount)) { in CanFlattenLoopPair()
/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()
456 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
461 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
527 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
544 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
H A DLoopAccessAnalysis.cpp293 if (SE->isLoopInvariant(PtrExpr, Lp)) { in getStartAndEndForAccess()
338 assert(SE->isLoopInvariant(ScStart, Lp) && "ScStart needs to be invariant"); in getStartAndEndForAccess()
339 assert(SE->isLoopInvariant(ScEnd, Lp) && "ScEnd needs to be invariant"); in getStartAndEndForAccess()
1053 if (isa<SCEVAddRecExpr>(Scev) || L->isLoopInvariant(Ptr) || in findForkedSCEVs()
1204 SE->isLoopInvariant(get<0>(Scevs[0]), L)) && in findForkedPointer()
1206 SE->isLoopInvariant(get<0>(Scevs[1]), L))) { in findForkedPointer()
1232 if (PSE.getSE()->isLoopInvariant(P.getPointer(), TheLoop)) in createCheckForAccess()
1570 if (PSE.getSE()->isLoopInvariant(PtrScev, Lp)) in getPtrStride()
2862 if (TheLoop->isLoopInvariant(V)) in isInvariant()
2867 return SE->isLoopInvariant(S, TheLoop); in isInvariant()
[all …]
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.cpp44 if (!IterationNumber->isZero() && SE.isLoopInvariant(S, L)) in simplifyInstWithSCEV()
H A DIVDescriptors.cpp342 if (!SE->isLoopInvariant(PtrScev, TheLoop)) { in AddReductionVar()
655 if (!Loop->isLoopInvariant(NonPhi)) in isAnyOfPattern()
1493 if (L->isLoopInvariant(Op0)) in getCastsForInductionPHI()
1495 else if (L->isLoopInvariant(Op1)) in getCastsForInductionPHI()
1628 if (!ConstStep && !SE->isLoopInvariant(Step, TheLoop)) in isInductionPHI()
H A DScalarEvolution.cpp2511 return isLoopInvariant(S, L) && properlyDominates(S, L->getHeader()); in isAvailableAtLoopEntry()
3689 Operands, [&](const SCEV *Op) { return isLoopInvariant(Op, L); }); in getAddRecExpr()
3701 return isLoopInvariant(Op, NestedLoop); in getAddRecExpr()
4867 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown()
4908 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown()
4961 bool InvariantF = SE.isLoopInvariant(Expr, L); in visitUnknown()
5025 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown()
5507 if (!isLoopInvariant(Accum, L)) in createAddRecFromPHIWithCastsImpl()
5591 assert(isLoopInvariant(Expr, L) && "Expr is expected to be invariant"); in createAddRecFromPHIWithCastsImpl()
5731 if (BO->LHS == PN && L->isLoopInvariant(BO->RHS)) in createSimpleAffineAddRec()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationLegality.cpp373 if (!(CondOp0 == IVUpdate && OuterLp->isLoopInvariant(CondOp1)) && in isUniformLoop()
374 !(CondOp1 == IVUpdate && OuterLp->isLoopInvariant(CondOp0))) { in isUniformLoop()
512 if (!SE.isLoopInvariant(Step, TheLoop)) { in visitAddRecExpr()
524 if (CannotAnalyze || SE.isLoopInvariant(S, TheLoop)) in visit()
530 if (SE.isLoopInvariant(S, TheLoop)) in visitUnknown()
639 !TheLoop->isLoopInvariant(Br->getCondition()) && in canVectorizeOuterLoop()
942 if (!SE->isLoopInvariant(PSE.getSCEV(CI->getOperand(Idx)), in canVectorizeInstrs()
1106 if (!TheLoop->isLoopInvariant(HIncVal)) in findHistogram()
H A DLoopIdiomVectorize.cpp360 if (!CurLoop->isLoopInvariant(PtrA) || !CurLoop->isLoopInvariant(PtrB) || in recognizeByteCompare()
1161 if (!CurLoop->isLoopInvariant(SearchStart) || in recognizeFindFirstByte()
1162 !CurLoop->isLoopInvariant(SearchEnd) || in recognizeFindFirstByte()
1163 !CurLoop->isLoopInvariant(NeedleStart) || in recognizeFindFirstByte()
1164 !CurLoop->isLoopInvariant(NeedleEnd)) in recognizeFindFirstByte()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopPeel.cpp219 if (L.isLoopInvariant(&V)) in calculate()
317 if (DT.dominates(BB, Latch) && L.isLoopInvariant(Ptr) && in peelToTurnInvariantLoadsDerefencebale()
355 SE.isLoopInvariant(SE.getSCEV(Bound), &L) && in canPeelLastIteration()
518 if (L.isLoopInvariant(LHS)) { in countToEliminateCompares()
521 } else if (L.isLoopInvariant(RHS)) { in countToEliminateCompares()
H A DScalarEvolutionExpander.cpp308 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break; in InsertBinop()
397 if (!L->isLoopInvariant(V) || !L->isLoopInvariant(Idx)) break; in expandAddToGEP()
1520 if (SE.isLoopInvariant(S, L)) { in expand()
H A DSimplifyIndVar.cpp526 if (!(ICI->getOperand(0) == TI && L->isLoopInvariant(ICI->getOperand(1))) && in eliminateTrunc()
527 !(ICI->getOperand(1) == TI && L->isLoopInvariant(ICI->getOperand(0)))) in eliminateTrunc()
558 bool IsSwapped = L->isLoopInvariant(ICI->getOperand(0)); in eliminateTrunc()
646 if (!SE->isLoopInvariant(S, L)) in replaceIVUserWithLoopInvariant()
1244 L && L->getLoopPreheader() && L->isLoopInvariant(NarrowOper); in createExtendInst()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h87 LLVM_ABI bool isLoopInvariant(MachineInstr &I,
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopCacheAnalysis.h108 bool isLoopInvariant(const Loop &L) const;
H A DLoopInfo.h62 bool isLoopInvariant(const Value *V) const;
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineLoopInfo.cpp233 bool MachineLoop::isLoopInvariant(MachineInstr &I, in isLoopInvariant() function in MachineLoop
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp681 assert(SE->isLoopInvariant(BasePtrIncSCEV, L) && in rewriteForBase()
875 if (L->isLoopInvariant(PtrValue)) in collectCandidates()
1142 if (!SE->isLoopInvariant(BasePtrIncSCEV, L)) in getNodeForInc()
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp218 if (!SE->isLoopInvariant(EC, L)) { in IsSafeActiveMask()

123