Searched refs:InvariantRHS (Results 1 – 3 of 3) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LICM.cpp | 2557 Value *InvariantRHS, ICmpInst &ICmp, Loop &L, in hoistAdd() argument 2561 assert(L.isLoopInvariant(InvariantRHS) && "Precondition."); in hoistAdd() 2588 if (IsSigned && computeOverflowForSignedSub(InvariantRHS, InvariantOp, SQ) != in hoistAdd() 2592 computeOverflowForUnsignedSub(InvariantRHS, InvariantOp, SQ) != in hoistAdd() 2599 Builder.CreateSub(InvariantRHS, InvariantOp, "invariant.op", in hoistAdd() 2615 Value *InvariantRHS, ICmpInst &ICmp, Loop &L, in hoistSub() argument 2619 assert(L.isLoopInvariant(InvariantRHS) && "Precondition."); in hoistSub() 2654 if (computeOverflowForSignedSub(InvariantOp, InvariantRHS, SQ) != in hoistSub() 2659 if (computeOverflowForUnsignedSub(InvariantOp, InvariantRHS, SQ) != in hoistSub() 2664 if (computeOverflowForSignedAdd(InvariantOp, InvariantRHS, SQ) != in hoistSub() [all …]
|
| H A D | InductiveRangeCheckElimination.cpp | 158 static bool reassociateSubLHS(Loop *L, Value *VariantLHS, Value *InvariantRHS, 362 Loop *L, Value *VariantLHS, Value *InvariantRHS, ICmpInst::Predicate Pred, in reassociateSubLHS() argument 370 const SCEV *Limit = SE.getSCEV(InvariantRHS); in reassociateSubLHS()
|
| /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()
|