Lines Matching defs:implies

1377   // "{S,+,X} is <nsw>/<nuw>" and "the backedge is taken at least once" implies
4302     //  * %y being poison implies %x is also poison.
5710         !Preds->implies(SE.getEqualPredicate(Expr1, Expr2), SE) &&
5711         !Preds->implies(SE.getEqualPredicate(Expr2, Expr1), SE))
8873     // Exact always implies symbolic, only check symbolic.
10639     // are finite by assumption, in which case the step being zero implies
11743   // False conditions implies anything. Do not bother analyzing it further.
11982           // We know V `Pred` SharperMin.  If this implies LHS `Pred`
11998           // If V `Pred` Min implies LHS `Pred` RHS, we're done.
12187   // this case, `FoundLHS Pred FoundRHS` implies `Start Pred FoundRHS`. Try to
12828   // The antecedent implies the consequent if every value of `LHS` that
12969           // overflow occurs.  This limit also implies that a signed comparison
13051     // Precondition a) implies that if the stride is negative, this is a single
13233         // (RHS > Start - 1) implies RHS >= Start.
14849       return Pred && Pred->implies(P, SE);
14930 bool SCEVComparePredicate::implies(const SCEVPredicate *N,
14961 bool SCEVWrapPredicate::implies(const SCEVPredicate *N,
14984   // If both steps are positive, this implies N, if N's start and step are
15053 bool SCEVUnionPredicate::implies(const SCEVPredicate *N,
15057       return this->implies(I, SE);
15061                 [N, &SE](const SCEVPredicate *I) { return I->implies(N, SE); });
15077   if (implies(N, SE))
15084     if (N->implies(P, SE))
15160   if (Preds->implies(&Pred, SE))