Lines Matching defs:below
2693 be detected in the recursive calls below. */
3559 shifts below. */
3599 error case below. If we didn't, we might generate wrong code.
3694 below can fail for, e.g., XFmode. */
3700 outermost expression if it may matter below. */
3870 In the comments below, we represent a range by two numbers in brackets
3900 comparison rules. Note that most of the cases below won't occur, but
3970 and see if we can refine the range. Some of the cases below may not
4447 below are simplified by the ones above. */
5238 thing below. */
5436 incorrect code below. */
5629 /* Don't deal with constants of zero here; they confuse the code below. */
5781 This simplifies the logic below. */
6310 /* The transformation below creates non-gimple code and thus is
6569 /* If we are going to be able to omit the AND below, we must do our
6683 bool above, below;
6729 below = integer_nonzerop (fold_relational_const (LT_EXPR, type,
6735 if (above || below)
6740 if (above || below)
6748 else if (below)
6755 else if (below)
7604 handled below, if we are converting something to its own
8573 to ARG1 to reduce the number of tests below. */
8590 code below would make the expression more complex. Change it to a
8704 take advantage of the factoring cases below. */
13205 Therefore, the code below must handle only EQ and LT. */