Searched refs:InvariantRHS (Results 1 – 3 of 3) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LICM.cpp | 2538 Value *InvariantRHS, ICmpInst &ICmp, Loop &L, in hoistAdd() argument
2543 assert(L.isLoopInvariant(InvariantRHS) && "Precondition."); in hoistAdd()
2564 computeOverflowForSignedSub(InvariantRHS, InvariantOp, in hoistAdd()
2572 Value *NewCmpOp = Builder.CreateSub(InvariantRHS, InvariantOp, "invariant.op", in hoistAdd()
2585 Value *InvariantRHS, ICmpInst &ICmp, Loop &L, in hoistSub() argument
2590 assert(L.isLoopInvariant(InvariantRHS) && "Precondition."); in hoistSub()
2619 if (computeOverflowForSignedSub(InvariantOp, InvariantRHS, SQ) != in hoistSub()
2624 if (computeOverflowForSignedAdd(InvariantOp, InvariantRHS, SQ) != in hoistSub()
2633 ? Builder.CreateSub(InvariantOp, InvariantRHS, "invariant.op", in hoistSub()
2635 : Builder.CreateAdd(InvariantOp, InvariantRHS, "invariant.op", in hoistSub()
|
| H A D | InductiveRangeCheckElimination.cpp | 166 static bool reassociateSubLHS(Loop *L, Value *VariantLHS, Value *InvariantRHS,
368 Loop *L, Value *VariantLHS, Value *InvariantRHS, ICmpInst::Predicate Pred,
376 const SCEV *Limit = SE.getSCEV(InvariantRHS); in reassociateSubLHS()
370 reassociateSubLHS(Loop * L,Value * VariantLHS,Value * InvariantRHS,ICmpInst::Predicate Pred,ScalarEvolution & SE,const SCEVAddRecExpr * & Index,const SCEV * & End) reassociateSubLHS() argument
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyIndVar.cpp | 226 const SCEV *InvariantRHS = LIP->RHS; in makeIVComparisonInvariant() local
230 if (Rewriter.isHighCostExpansion({InvariantLHS, InvariantRHS}, L, in makeIVComparisonInvariant()
233 !Rewriter.isSafeToExpandAt(InvariantRHS, PHTerm)) in makeIVComparisonInvariant()
238 Rewriter.expandCodeFor(InvariantRHS, IVOperand->getType(), PHTerm); in makeIVComparisonInvariant()
|