| /freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.cpp | 377 if (!(CondOp0 == IVUpdate && OuterLp->isLoopInvariant(CondOp1)) && in isUniformLoop() 378 !(CondOp1 == IVUpdate && OuterLp->isLoopInvariant(CondOp0))) { in isUniformLoop() 492 !TheLoop->isLoopInvariant(Br->getCondition()) && in canVectorizeOuterLoop() 749 if (!SE->isLoopInvariant(PSE.getSCEV(CI->getOperand(1)), TheLoop)) { in canVectorizeInstrs()
|
| H A D | LoopVectorize.cpp | 1496 bool SafeToHoist = OrigLoop->isLoopInvariant(V) && in getBroadcastInstrs() 1658 assert(PSE.getSE()->isLoopInvariant(ID.getStep(), OrigLoop) && in widenIntOrFpInduction() 1902 if (OrigLoop->isLoopInvariant(V)) in getOrCreateScalarValue() 3404 if (LI->getLoopFor(LoopVectorBody)->isLoopInvariant(PreviousLastPart) || in fixFirstOrderRecurrence() 3922 OrigLoop->isLoopInvariant(GEP->getPointerOperand()) in widenInstruction() 3930 if (OrigLoop->isLoopInvariant(U.get())) in widenInstruction() 3993 SE->isLoopInvariant(PSE.getSCEV(I.getOperand(0)), OrigLoop); in widenInstruction() 4206 !TheLoop->isLoopInvariant(V); in collectLoopScalars() 5447 if (!SE->isLoopInvariant(SE->getSCEV(Opd), TheLoop) && in getAddressAccessSCEV() 5922 bool ScalarCond = (SE->isLoopInvariant(CondSCEV, TheLoop)); in getInstructionCost()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | LoopVersioningLICM.cpp | 384 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning() 398 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning()
|
| H A D | IndVarSimplify.cpp | 621 if (!SE->isLoopInvariant(ExitValue, L) || in rewriteLoopExitValues() 745 if (!L->isLoopInvariant(Cond)) in rewriteFirstIterationLoopExitValues() 1034 L && L->getLoopPreheader() && L->isLoopInvariant(NarrowOper); in createExtendInst() 1995 if (L->isLoopInvariant(IncI->getOperand(1))) in getLoopPhiForCounter() 2005 if (L->isLoopInvariant(IncI->getOperand(0))) in getLoopPhiForCounter() 2043 if (!L->isLoopInvariant(RHS)) { in needsLFTR() 2044 if (!L->isLoopInvariant(LHS)) in needsLFTR() 2307 assert(SE->isLoopInvariant(IVOffset, L) && in genLoopLimit() 2353 assert(SE->isLoopInvariant(IVLimit, L) && in genLoopLimit()
|
| H A D | SimpleLoopUnswitch.cpp | 106 assert(!L.isLoopInvariant(&Root) && in collectHomogenousInstGraphLoopInvariants() 123 if (L.isLoopInvariant(OpV)) { in collectHomogenousInstGraphLoopInvariants() 170 if (!L.isLoopInvariant(PN->getIncomingValueForBlock(&ExitingBB))) in areLoopExitPHIsLoopInvariant() 366 if (L.isLoopInvariant(BI.getCondition())) { in unswitchTrivialBranch() 580 if (!L.isLoopInvariant(LoopCond)) in unswitchTrivialSwitch() 2521 if (!isa<Constant>(Cond) && L.isLoopInvariant(Cond)) in unswitchBestCondition() 2529 L.isLoopInvariant(SI->getCondition())) in unswitchBestCondition() 2539 if (L.isLoopInvariant(BI->getCondition())) { in unswitchBestCondition()
|
| H A D | LoopPredication.cpp | 369 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp() 432 return SE->isLoopInvariant(S, L) && isSafeToExpand(S, *SE); in CanExpand()
|
| H A D | LoopDataPrefetch.cpp | 270 if (L->isLoopInvariant(PtrValue)) in runOnLoop()
|
| H A D | LICM.cpp | 362 !L->isLoopInvariant(AS.begin()->getValue())) in runOnLoop() 787 CurLoop->isLoopInvariant(I.getOperand(1)) && in hoistRegion() 1035 if (ORE && Invalidated && CurLoop->isLoopInvariant(LI->getPointerOperand())) in canSinkOrHoistInst() 1596 if (LI && CurLoop->isLoopInvariant(LI->getPointerOperand())) in isSafeToExecuteUnconditionally()
|
| H A D | SeparateConstOffsetFromGEP.cpp | 825 L && L->isLoopInvariant(ResultPtr) && in lowerToSingleIndexGEPs() 1246 if (CurLoop->isLoopInvariant(FirstOffset)) in isLegalToSwapOperand()
|
| H A D | LoopUnrollAndJamPass.cpp | 263 if (SE.isLoopInvariant(LSCEV, L)) in computeUnrollAndJamCount()
|
| H A D | LoopIdiomRecognize.cpp | 444 CurLoop->isLoopInvariant(SplatValue)) { in isLegalStore() 761 if (!SplatValue || !CurLoop->isLoopInvariant(SplatValue)) in processLoopMemSet()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | LoopInfo.cpp | 58 bool Loop::isLoopInvariant(const Value *V) const { in isLoopInvariant() function in Loop 65 return all_of(I->operands(), [this](Value *V) { return isLoopInvariant(V); }); in hasLoopInvariantOperands() 78 if (isLoopInvariant(I)) in makeLoopInvariant()
|
| H A D | IVDescriptors.cpp | 932 if (L->isLoopInvariant(Op0)) in getCastsForInductionPHI() 934 else if (L->isLoopInvariant(Op1)) in getCastsForInductionPHI() 1056 if (!ConstStep && !SE->isLoopInvariant(Step, TheLoop)) in isInductionPHI()
|
| H A D | ScalarEvolutionExpander.cpp | 216 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break; in InsertBinop() 543 if (!L->isLoopInvariant(V) || !L->isLoopInvariant(Idx)) break; in expandAddToGEP() 563 if (!L->isLoopInvariant(V)) break; in expandAddToGEP() 566 GepIndices, [L](Value *Op) { return !L->isLoopInvariant(Op); }); in expandAddToGEP() 1737 if (SE.isLoopInvariant(S, L)) { in expand()
|
| H A D | LoopAccessAnalysis.cpp | 201 if (SE->isLoopInvariant(Sc, Lp)) in insert() 626 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in hasComputableBounds() 644 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in isNoWrap() 2054 return (SE->isLoopInvariant(SE->getSCEV(V), TheLoop)); in isUniform() 2096 if (SE->isLoopInvariant(Sc, TheLoop)) { in expandBounds()
|
| H A D | ScalarEvolution.cpp | 4234 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown() 4275 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown() 4392 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown() 4765 if (!isLoopInvariant(Accum, L)) in createAddRecFromPHIWithCastsImpl() 5088 if (isLoopInvariant(Accum, L) || in createAddRecFromPHI() 7327 if (isLoopInvariant(LHS, L) && !isLoopInvariant(RHS, L)) { in computeExitLimitFromICmp() 9197 if (!isLoopInvariant(RHS, L)) { in isLoopInvariantPredicate() 9198 if (!isLoopInvariant(LHS, L)) in isLoopInvariantPredicate() 10582 if (!isLoopInvariant(RHS, L)) { in howManyLessThans() 10637 if (!isLoopInvariant(RHS, L)) in howManyGreaterThans() [all …]
|
| H A D | DependenceAnalysis.cpp | 776 bool DependenceInfo::isLoopInvariant(const SCEV *Expression, in isLoopInvariant() function in DependenceInfo 780 return SE->isLoopInvariant(Expression, LoopNest) && in isLoopInvariant() 781 isLoopInvariant(Expression, LoopNest->getParentLoop()); in isLoopInvariant() 793 if (Level <= CommonLevels && !SE->isLoopInvariant(Expression, LoopNest)) in collectCommonLoops() 879 return isLoopInvariant(Src, LoopNest); in checkSrcSubscript() 890 if (!isLoopInvariant(Step, LoopNest)) in checkSrcSubscript() 904 return isLoopInvariant(Dst, LoopNest); in checkDstSubscript() 915 if (!isLoopInvariant(Step, LoopNest)) in checkDstSubscript() 3041 if (SE->isLoopInvariant(AddRec, TargetLoop)) in addToCoefficient()
|
| H A D | VectorUtils.cpp | 155 !SE->isLoopInvariant(SE->getSCEV(GEP->getOperand(i)), Lp)) in stripGetElementPtr() 239 if (!Lp->isLoopInvariant(Stride)) in getStrideFromPointer()
|
| /freebsd-12.1/contrib/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopPreIncPrep.cpp | 290 if (L->isLoopInvariant(PtrValue)) in runOnLoop() 412 if (!SE->isLoopInvariant(BasePtrStartSCEV, L)) in runOnLoop()
|
| H A D | PPCCTRLoops.cpp | 577 } else if (!SE->isLoopInvariant(EC, L)) in convertToCTRLoop()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyIndVar.cpp | 552 if (ICI->getOperand(0) == TI && L->isLoopInvariant(ICI->getOperand(1))) { in eliminateTrunc() 668 if (!SE->isLoopInvariant(S, L)) in replaceIVUserWithLoopInvariant()
|
| H A D | LoopUnrollPeel.cpp | 122 if (L->isLoopInvariant(Input)) in calculateIterationsToInvariance()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | DependenceAnalysis.h | 520 bool isLoopInvariant(const SCEV *Expression, const Loop *LoopNest) const;
|
| H A D | LoopInfo.h | 487 bool isLoopInvariant(const Value *V) const;
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUTargetTransformInfo.cpp | 178 if (!Inst || L->isLoopInvariant(Op)) in getUnrollingPreferences()
|