Home
last modified time | relevance | path

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

123

/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopCacheAnalysis.cpp95 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
271 if (isLoopInvariant(L)) { in computeRefCost()
388 bool IndexedReference::isLoopInvariant(const Loop &L) const { in isLoopInvariant() function in IndexedReference
393 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
438 : SE.isLoopInvariant(&Subscript, &L); in isCoeffForLoopZeroOrInvariant()
455 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
H A DLoopInfo.cpp64 bool Loop::isLoopInvariant(const Value *V) const { in isLoopInvariant() function in Loop
71 return all_of(I->operands(), [this](Value *V) { return isLoopInvariant(V); }); in hasLoopInvariantOperands()
85 if (isLoopInvariant(I)) in makeLoopInvariant()
363 return SE.isLoopInvariant(IndDesc.getStep(), this); in isAuxiliaryInductionVariable()
H A DLoopUnrollAnalyzer.cpp40 if (!IterationNumber->isZero() && SE.isLoopInvariant(S, L)) in simplifyInstWithSCEV()
H A DLoads.cpp287 if (L->isLoopInvariant(Ptr)) in isDereferenceableAndAlignedInLoop()
312 assert(SE.isLoopInvariant(StartS, L) && "implied by addrec definition"); in isDereferenceableAndAlignedInLoop()
H A DScalarEvolution.cpp5052 if (!isLoopInvariant(Accum, L)) in createAddRecFromPHIWithCastsImpl()
8051 if (isLoopInvariant(LHS, L) && !isLoopInvariant(RHS, L)) { in computeExitLimitFromICmp()
10016 if (!isLoopInvariant(RHS, L)) { in getLoopInvariantPredicate()
10017 if (!isLoopInvariant(LHS, L)) in getLoopInvariantPredicate()
10070 if (!isLoopInvariant(RHS, L)) { in getLoopInvariantExitCondDuringFirstIterations()
10071 if (!isLoopInvariant(LHS, L)) in getLoopInvariantExitCondDuringFirstIterations()
11661 if (!isLoopInvariant(RHS, L)) in howManyLessThans()
11710 if (!isLoopInvariant(RHS, L)) in howManyLessThans()
11762 if (!isLoopInvariant(RHS, L)) { in howManyLessThans()
11957 if (!isLoopInvariant(RHS, L)) in howManyGreaterThans()
[all …]
H A DIVDescriptors.cpp1118 if (L->isLoopInvariant(Op0)) in getCastsForInductionPHI()
1120 else if (L->isLoopInvariant(Op1)) in getCastsForInductionPHI()
1249 if (!ConstStep && !SE->isLoopInvariant(Step, TheLoop)) in isInductionPHI()
H A DLoopAccessAnalysis.cpp204 if (SE->isLoopInvariant(Sc, Lp)) { in insert()
641 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in hasComputableBounds()
659 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in isNoWrap()
2129 return (SE->isLoopInvariant(SE->getSCEV(V), TheLoop)); in isUniform()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopPredication.cpp387 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
407 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
509 if (!L->isLoopInvariant(Op)) in findInsertPt()
520 if (!SE->isLoopInvariant(Op, L) || in findInsertPt()
546 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
1105 !SE->isLoopInvariant(MinEC, L) || in predicateLoopExits()
H A DIndVarSimplify.cpp476 if (!L->isLoopInvariant(Cond)) in rewriteFirstIterationLoopExitValues()
681 if (L->isLoopInvariant(IncI->getOperand(1))) in getLoopPhiForCounter()
691 if (L->isLoopInvariant(IncI->getOperand(0))) in getLoopPhiForCounter()
720 if (L->isLoopInvariant(BI->getCondition())) in needsLFTR()
736 if (!L->isLoopInvariant(RHS)) { in needsLFTR()
737 if (!L->isLoopInvariant(LHS)) in needsLFTR()
998 assert(SE->isLoopInvariant(IVOffset, L) && in genLoopLimit()
1046 assert(SE->isLoopInvariant(IVLimit, L) && in genLoopLimit()
1573 !SE->isLoopInvariant(ExactBTC, L) || in predicateLoopExits()
1607 !SE->isLoopInvariant(ExitCount, L) || in predicateLoopExits()
H A DLoopVersioningLICM.cpp374 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning()
388 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning()
H A DSimpleLoopUnswitch.cpp122 assert(!L.isLoopInvariant(&Root) && in collectHomogenousInstGraphLoopInvariants()
142 if (L.isLoopInvariant(OpV)) { in collectHomogenousInstGraphLoopInvariants()
189 if (!L.isLoopInvariant(PN->getIncomingValueForBlock(&ExitingBB))) in areLoopExitPHIsLoopInvariant()
440 if (L.isLoopInvariant(BI.getCondition())) { in unswitchTrivialBranch()
662 if (!L.isLoopInvariant(LoopCond)) in unswitchTrivialSwitch()
2705 if (!isa<Constant>(Cond) && L.isLoopInvariant(Cond)) in unswitchBestCondition()
2713 L.isLoopInvariant(SI->getCondition()) && !BB->getUniqueSuccessor()) in unswitchBestCondition()
2730 if (L.isLoopInvariant(BI->getCondition())) { in unswitchBestCondition()
H A DLoopFlatten.cpp488 if (!FI.OuterLoop->isLoopInvariant(FI.InnerTripCount)) { in CanFlattenLoopPair()
492 if (!FI.OuterLoop->isLoopInvariant(FI.OuterTripCount)) { in CanFlattenLoopPair()
H A DLICM.cpp487 !L->isLoopInvariant(AS.begin()->getValue())) in runOnLoop()
959 CurLoop->isLoopInvariant(I.getOperand(1))) { in hoistRegion()
1232 if (ORE && Invalidated && CurLoop->isLoopInvariant(LI->getPointerOperand())) in canSinkOrHoistInst()
1858 if (LI && CurLoop->isLoopInvariant(LI->getPointerOperand())) in isSafeToExecuteUnconditionally()
2313 return L->isLoopInvariant(SI->getPointerOperand()); in collectPromotionCandidates()
2315 return L->isLoopInvariant(LI->getPointerOperand()); in collectPromotionCandidates()
H A DLoopDataPrefetch.cpp338 if (L->isLoopInvariant(PtrValue)) in runOnLoop()
H A DLoopBoundSplit.cpp254 if (L.isLoopInvariant(BI->getCondition())) in findSplitCandidate()
H A DSeparateConstOffsetFromGEP.cpp857 L && L->isLoopInvariant(ResultPtr) && in lowerToSingleIndexGEPs()
1303 if (CurLoop->isLoopInvariant(FirstOffset)) in isLegalToSwapOperand()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationLegality.cpp346 if (!(CondOp0 == IVUpdate && OuterLp->isLoopInvariant(CondOp1)) && in isUniformLoop()
347 !(CondOp1 == IVUpdate && OuterLp->isLoopInvariant(CondOp0))) { in isUniformLoop()
469 !TheLoop->isLoopInvariant(Br->getCondition()) && in canVectorizeOuterLoop()
752 if (!SE->isLoopInvariant(PSE.getSCEV(CI->getOperand(i)), TheLoop)) { in canVectorizeInstrs()
H A DVPlanTransforms.cpp79 SE.isLoopInvariant(SE.getSCEV(SI->getOperand(0)), OrigLoop); in VPInstructionsToVPRecipes()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h74 bool isLoopInvariant(MachineInstr &I) const;
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineLoopInfo.cpp154 bool MachineLoop::isLoopInvariant(MachineInstr &I) const { in isLoopInvariant() function in MachineLoop
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopCacheAnalysis.h100 bool isLoopInvariant(const Loop &L) const;
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DScalarEvolutionExpander.cpp268 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break; in InsertBinop()
604 if (!L->isLoopInvariant(V) || !L->isLoopInvariant(Idx)) break; in expandAddToGEP()
621 if (!L->isLoopInvariant(V)) break; in expandAddToGEP()
624 GepIndices, [L](Value *Op) { return !L->isLoopInvariant(Op); }); in expandAddToGEP()
1961 if (SE.isLoopInvariant(S, L)) { in expand()
H A DSimplifyIndVar.cpp532 if (!(ICI->getOperand(0) == TI && L->isLoopInvariant(ICI->getOperand(1))) && in eliminateTrunc()
533 !(ICI->getOperand(1) == TI && L->isLoopInvariant(ICI->getOperand(0)))) in eliminateTrunc()
564 bool IsSwapped = L->isLoopInvariant(ICI->getOperand(0)); in eliminateTrunc()
651 if (!SE->isLoopInvariant(S, L)) in replaceIVUserWithLoopInvariant()
1145 L && L->getLoopPreheader() && L->isLoopInvariant(NarrowOper); in createExtendInst()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp223 if (!SE->isLoopInvariant(EC, L)) { in IsSafeActiveMask()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp363 if (L->isLoopInvariant(PtrValue)) in collectCandidates()
515 if (!SE->isLoopInvariant(BasePtrSCEV->getStart(), L)) in rewriteLoadStores()

123