Lines Matching defs:bound
2039 /* See if R is less than the lower bound or greater than the
2040 upper bound. */
3867 range with a lower and upper bound. If one of the bounds is omitted,
3873 flipping the prefix. An omitted bound is represented by a "-". For
3880 manner so neither a missing bound nor "true" and "false" need to be
3885 and UPPER1_P are nonzero if the respective argument is an upper bound
3914 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4055 /* If the high bound is missing, but we have a nonzero low
4056 bound, reverse the range so it goes from zero to the low bound
4171 /* A range without an upper bound is, naturally, unbounded.
4185 /* If the low bound is specified, "and" the range with the
6931 fold_to_nonsharp_ineq_using_bound (tree ineq, tree bound)
6935 if (TREE_CODE (bound) == LT_EXPR)
6936 a = TREE_OPERAND (bound, 0);
6937 else if (TREE_CODE (bound) == GT_EXPR)
6938 a = TREE_OPERAND (bound, 1);
12988 /* Optimize the special-case of a zero lower bound.
12991 with constant folding. (E.g. suppose the lower bound is 1,