| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 96 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 D | LoopInfo.cpp | 60 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 D | IVDescriptors.cpp | 343 if (!SE->isLoopInvariant(PtrScev, TheLoop)) { in AddReductionVar() 660 if (!Loop->isLoopInvariant(NonPhi)) in isSelectCmpPattern() 1426 if (L->isLoopInvariant(Op0)) in getCastsForInductionPHI() 1428 else if (L->isLoopInvariant(Op1)) in getCastsForInductionPHI() 1555 if (!ConstStep && !SE->isLoopInvariant(Step, TheLoop)) in isInductionPHI()
|
| H A D | LoopUnrollAnalyzer.cpp | 43 if (!IterationNumber->isZero() && SE.isLoopInvariant(S, L)) in simplifyInstWithSCEV()
|
| H A D | LoopAccessAnalysis.cpp | 210 if (SE->isLoopInvariant(PtrExpr, Lp)) { in insert() 745 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in hasComputableBounds() 764 if (PSE.getSE()->isLoopInvariant(PtrScev, L)) in isNoWrap() 823 if (isa<SCEVAddRecExpr>(Scev) || L->isLoopInvariant(Ptr) || in findForkedSCEVs() 965 SE->isLoopInvariant(get<0>(Scevs[0]), L)) && in findForkedPointer() 967 SE->isLoopInvariant(get<0>(Scevs[1]), L))) { in findForkedPointer() 2556 return (SE->isLoopInvariant(SE->getSCEV(V), TheLoop)); in isUniform()
|
| H A D | Loads.cpp | 277 if (L->isLoopInvariant(Ptr)) in isDereferenceableAndAlignedInLoop() 302 assert(SE.isLoopInvariant(StartS, L) && "implied by addrec definition"); in isDereferenceableAndAlignedInLoop()
|
| H A D | ScalarEvolution.cpp | 2533 return isLoopInvariant(S, L) && properlyDominates(S, L->getHeader()); in isAvailableAtLoopEntry() 3682 assert(isLoopInvariant(Operands[i], L) && in getAddRecExpr() 3712 Operands, [&](const SCEV *Op) { return isLoopInvariant(Op, L); }); in getAddRecExpr() 3724 return isLoopInvariant(Op, NestedLoop); in getAddRecExpr() 4866 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown() 4907 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown() 4960 bool InvariantF = SE.isLoopInvariant(Expr, L); in visitUnknown() 5024 if (!SE.isLoopInvariant(Expr, L)) in visitUnknown() 5495 if (!isLoopInvariant(Accum, L)) in createAddRecFromPHIWithCastsImpl() 5579 assert(isLoopInvariant(Expr, L) && "Expr is expected to be invariant"); in createAddRecFromPHIWithCastsImpl() [all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | IndVarSimplify.cpp | 478 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() 1004 assert(SE->isLoopInvariant(IVOffset, L) && in genLoopLimit() 1044 assert(SE->isLoopInvariant(IVLimit, L) && in genLoopLimit() 1565 if (!L->isLoopInvariant(RHS)) { in canonicalizeExitCondition() 1566 if (!L->isLoopInvariant(LHS)) in canonicalizeExitCondition() [all …]
|
| H A D | LoopPredication.cpp | 402 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp() 422 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck() 525 if (!L->isLoopInvariant(Op)) in findInsertPt() 537 if (!SE->isLoopInvariant(Op, L) || in findInsertPt() 563 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue() 1172 !SE->isLoopInvariant(MinEC, L) || in predicateLoopExits()
|
| H A D | LoopVersioningLICM.cpp | 361 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning() 375 if (SE->isLoopInvariant(SE->getSCEV(Ptr), CurLoop)) in instructionSafeForVersioning()
|
| H A D | SimpleLoopUnswitch.cpp | 153 assert(!L.isLoopInvariant(&Root) && in collectHomogenousInstGraphLoopInvariants() 173 if (L.isLoopInvariant(OpV)) { in collectHomogenousInstGraphLoopInvariants() 221 if (!L.isLoopInvariant(PN->getIncomingValueForBlock(&ExitingBB))) in areLoopExitPHIsLoopInvariant() 480 if (L.isLoopInvariant(Cond)) { in unswitchTrivialBranch() 704 if (!L.isLoopInvariant(LoopCond)) in unswitchTrivialSwitch() 2788 if (!isa<Constant>(Cond) && L.isLoopInvariant(Cond)) in collectUnswitchCandidates() 2796 L.isLoopInvariant(SI->getCondition()) && !BB->getUniqueSuccessor()) in collectUnswitchCandidates() 2810 if (L.isLoopInvariant(Cond)) { in collectUnswitchCandidates()
|
| H A D | LICM.cpp | 929 CurLoop->isLoopInvariant(I.getOperand(1))) { in hoistRegion() 1183 if (ORE && Invalidated && CurLoop->isLoopInvariant(LI->getPointerOperand())) in canSinkOrHoistInst() 1767 if (LI && CurLoop->isLoopInvariant(LI->getPointerOperand())) in isSafeToExecuteUnconditionally() 2275 return L->isLoopInvariant(SI->getPointerOperand()); in collectPromotionCandidates() 2277 return L->isLoopInvariant(LI->getPointerOperand()); in collectPromotionCandidates()
|
| H A D | LoopFlatten.cpp | 698 if (!FI.OuterLoop->isLoopInvariant(FI.InnerTripCount)) { in CanFlattenLoopPair() 702 if (!FI.OuterLoop->isLoopInvariant(FI.OuterTripCount)) { in CanFlattenLoopPair()
|
| H A D | LoopDataPrefetch.cpp | 344 if (L->isLoopInvariant(PtrValue)) in runOnLoop()
|
| H A D | LoopIdiomRecognize.cpp | 533 CurLoop->isLoopInvariant(SplatValue)) { in isLegalStore() 955 if (!SE->isLoopInvariant(MemsetSizeSCEV, CurLoop)) { in processLoopMemSet() 993 if (!SplatValue || !CurLoop->isLoopInvariant(SplatValue)) in processLoopMemSet() 2254 return L->isLoopInvariant(V) && SubPattern.match(V); in match() 2358 assert(CurLoop->isLoopInvariant(BaseX) && in detectShiftUntilBitTestIdiom()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | MachineLoopInfo.h | 73 bool isLoopInvariant(MachineInstr &I) const;
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.cpp | 366 if (!(CondOp0 == IVUpdate && OuterLp->isLoopInvariant(CondOp1)) && in isUniformLoop() 367 !(CondOp1 == IVUpdate && OuterLp->isLoopInvariant(CondOp0))) { in isUniformLoop() 508 !TheLoop->isLoopInvariant(Br->getCondition()) && in canVectorizeOuterLoop() 791 if (!SE->isLoopInvariant(PSE.getSCEV(CI->getOperand(i)), TheLoop)) { in canVectorizeInstrs()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | MachineLoopInfo.cpp | 154 bool MachineLoop::isLoopInvariant(MachineInstr &I) const { in isLoopInvariant() function in MachineLoop
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | LoopCacheAnalysis.h | 107 bool isLoopInvariant(const Loop &L) const;
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/RISCV/ |
| H A D | RISCVGatherScatterLowering.cpp | 205 if (!L->isLoopInvariant(Step)) in matchStridedRecurrence() 266 if (!L->isLoopInvariant(OtherOp)) in matchStridedRecurrence()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/ |
| H A D | ScalarEvolutionExpander.cpp | 268 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break; in InsertBinop() 607 if (!L->isLoopInvariant(V) || !L->isLoopInvariant(Idx)) break; in expandAddToGEP() 624 if (!L->isLoopInvariant(V)) break; in expandAddToGEP() 627 GepIndices, [L](Value *Op) { return !L->isLoopInvariant(Op); }); in expandAddToGEP() 1826 if (SE.isLoopInvariant(S, L)) { in expand()
|
| H A D | SimplifyIndVar.cpp | 505 if (!(ICI->getOperand(0) == TI && L->isLoopInvariant(ICI->getOperand(1))) && in eliminateTrunc() 506 !(ICI->getOperand(1) == TI && L->isLoopInvariant(ICI->getOperand(0)))) in eliminateTrunc() 537 bool IsSwapped = L->isLoopInvariant(ICI->getOperand(0)); in eliminateTrunc() 624 if (!SE->isLoopInvariant(S, L)) in replaceIVUserWithLoopInvariant() 1183 L && L->getLoopPreheader() && L->isLoopInvariant(NarrowOper); in createExtendInst()
|
| H A D | LoopPeel.cpp | 217 if (L.isLoopInvariant(&V)) in calculate() 318 if (DT.dominates(BB, Latch) && L.isLoopInvariant(Ptr) && in peelToTurnInvariantLoadsDerefencebale()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/ARM/ |
| H A D | MVETailPredication.cpp | 224 if (!SE->isLoopInvariant(EC, L)) { in IsSafeActiveMask()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 690 assert(SE->isLoopInvariant(BasePtrIncSCEV, L) && in rewriteForBase() 879 if (L->isLoopInvariant(PtrValue)) in collectCandidates() 1146 if (!SE->isLoopInvariant(BasePtrIncSCEV, L)) in getNodeForInc()
|