Searched refs:InvariantRHS (Results 1 – 3 of 3) sorted by relevance
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LICM.cpp | 2523 Value *InvariantRHS, ICmpInst &ICmp, Loop &L, in hoistAdd() argument 2528 assert(L.isLoopInvariant(InvariantRHS) && "Precondition."); in hoistAdd() 2549 computeOverflowForSignedSub(InvariantRHS, InvariantOp, in hoistAdd() 2557 Value *NewCmpOp = Builder.CreateSub(InvariantRHS, InvariantOp, "invariant.op", in hoistAdd() 2570 Value *InvariantRHS, ICmpInst &ICmp, Loop &L, in hoistSub() argument 2575 assert(L.isLoopInvariant(InvariantRHS) && "Precondition."); in hoistSub() 2604 if (computeOverflowForSignedSub(InvariantOp, InvariantRHS, SQ) != in hoistSub() 2609 if (computeOverflowForSignedAdd(InvariantOp, InvariantRHS, SQ) != in hoistSub() 2618 ? Builder.CreateSub(InvariantOp, InvariantRHS, "invariant.op", in hoistSub() 2620 : 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, in reassociateSubLHS() argument 376 const SCEV *Limit = SE.getSCEV(InvariantRHS); in reassociateSubLHS()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyIndVar.cpp | 218 const SCEV *InvariantRHS = LIP->RHS; in makeIVComparisonInvariant() local 222 if (Rewriter.isHighCostExpansion({InvariantLHS, InvariantRHS}, L, in makeIVComparisonInvariant() 225 !Rewriter.isSafeToExpandAt(InvariantRHS, PHTerm)) in makeIVComparisonInvariant() 230 Rewriter.expandCodeFor(InvariantRHS, IVOperand->getType(), PHTerm); in makeIVComparisonInvariant()
|