gcc/gcc/tree-vrp.c

116   /* Set of SSA names whose value ranges are equivalent to this one.
149    SSA name may have more than one assertion associated with it, these
548       tree one, tmp;
550       /* For one bit precision if max < min, then the swapped
559       one = build_int_cst (TREE_TYPE (min), 1);
560       tmp = int_const_binop (PLUS_EXPR, max, one);
561       max = int_const_binop (MINUS_EXPR, min, one);
564       /* There's one corner case, if we had [C+1, C] before we now have
605 	  tree one = build_int_cst (TREE_TYPE (max), 1);
606 	  min = int_const_binop (PLUS_EXPR, max, one);
612 	  tree one = build_int_cst (TREE_TYPE (min), 1);
613 	  max = int_const_binop (MINUS_EXPR, min, one);
960 /* Return true if value range VR involves at least one symbol.  */
1036 /* Return true if value range VR involves exactly one symbol SYM.  */
2082 	     of one of the operands, for example the first.  For
2354 	 then the operation caused one of them to wrap around, mark
2414   /* If one of the ranges is UNDEFINED drop it to VARYING for the following
2458      because we may be able to derive a useful range even if one of
2809 	     but one could use a scheme similar to equivalences for this. */
3317 	 then the operation caused one of them to wrap around, mark
3355   /* Try harder for PLUS and MINUS if the range of one operand is symbolic
3699 	     then the operation caused one of them to wrap around, mark
4519 	 exactly one value.  */
4644 	 one value.  */
4666       /* If VR represents exactly one value equal to VAL, then return
4862      operand of the ASSERT_EXPR.  Create it so the new name and the old one
5056      one.  Similarly, if the same assertion already exists at a block
5089       /* Update the last node of the list and move to the next one.  */
5095      NAME COMP_CODE VAL, add a new one at the end of the list of
5192   wide_int bit = wi::one (prec), res;
5866      the value zero or one, then we may be able to assert values
5896 	 necessarily zero value, or if type-precision is one.  */
6396      STMT is not control flow, there may only be one non-abnormal edge
6504 /* Checks one ARRAY_REF in REF, located at LOCUS. Ignores flexible arrays
6702    subscript one outside the valid range is allowed). Call
6891    multiple ranges to be associated with one SSA_NAME.  */
7676      discovered that from one visit to the other i_5 changed from
7722    If there is no CASE_LABEL for VAL and there is one that is larger than VAL,
7734   /* Find case label for minimum of the value range or the next one.
8096 	      /* If the result can be an anti-range, create one.  */
8122 	      /* If the result can be an anti-range, create one.  */
8393 	  /* If both are ranges the result is the inner one.  */
8401 	  /* Choose the right gap if the left one is empty.  */
8410 	  /* Choose the left gap if the right one is empty.  */
8431 	/* If both are anti-ranges the result is the outer one.  */
8492 	  /* If both are anti-ranges the result is the outer one.  */
8593   /* If either range is VR_VARYING the other one wins.  */
8873      previous one.  We don't do this if we have seen a new executable
8876      use the updated range and iterate one more time.  */
8898       /* If the new minimum is larger than than the previous one
8900 	 than the previous one and not -INF go all the way to -INF + 1.
8905 	 expense of one additional iteration.  */
9200    set by | are already known to be one from VR, the bit
9281    If there is one and only one value which will satisfy the
9306 	  tree one = build_int_cst (TREE_TYPE (op0), 1);
9307 	  max = fold_build2 (MINUS_EXPR, TREE_TYPE (op0), max, one);
9321 	  tree one = build_int_cst (TREE_TYPE (op0), 1);
9322 	  min = fold_build2 (PLUS_EXPR, TREE_TYPE (op0), min, one);
9338 	 then there is only one value which can satisfy the condition,
9408    test if the range information indicates only one value can satisfy
9940 	     if the RHS is zero or one, and the LHS are known to be boolean
10114 /* Blocks which have more than one predecessor and more than
10115    one successor present jump threading opportunities, i.e.,
10408       /* As we may have replaced the default label with a regular one