contrib/gcc/tree-vrp.c

1605   tree op0, op1, min, max;
1634   op0 = TREE_OPERAND (expr, 0);
1635   if (TREE_CODE (op0) == SSA_NAME)
1636     vr0 = *(get_value_range (op0));
1637   else if (is_gimple_min_invariant (op0))
1638     set_value_range_to_value (&vr0, op0, NULL);
1680       || POINTER_TYPE_P (TREE_TYPE (op0))
1764 	 range for such a case.  For example, if we have op0 == 1 and
1766 	 op0 + op1 == 0, so we cannot claim that the sum is in ~[0,0].
1795 	 op0 == 65536 and op1 == 65536 with their ranges both being
1796 	 ~[0,0] on a 32-bit machine, we would have op0 * op1 == 0, so
1802 	  && !TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (op0)))
1905 	 range for such a case.  For example, if we have op0 == 1 and
1907 	 op0 - op1 == 0, so we cannot claim that the difference is in
2000   tree min, max, op0;
2021   op0 = TREE_OPERAND (expr, 0);
2022   if (TREE_CODE (op0) == SSA_NAME)
2023     vr0 = *(get_value_range (op0));
2024   else if (is_gimple_min_invariant (op0))
2025     set_value_range_to_value (&vr0, op0, NULL);
2038   if ((!INTEGRAL_TYPE_P (TREE_TYPE (op0))
2039        && !POINTER_TYPE_P (TREE_TYPE (op0)))
2049   if (POINTER_TYPE_P (TREE_TYPE (expr)) || POINTER_TYPE_P (TREE_TYPE (op0)))
2069       tree inner_type = TREE_TYPE (op0);
3073       tree op0 = TREE_OPERAND (cond, 0);
3074       gcc_assert (op0 == v);
4342       tree op0 = TREE_OPERAND (cond, 0);
4346       if (!INTEGRAL_TYPE_P (TREE_TYPE (op0))
4347 	  && !POINTER_TYPE_P (TREE_TYPE (op0)))
4352 	  if (TREE_CODE (op0) == SSA_NAME && TREE_CODE (op1) == SSA_NAME)
4353 	    return compare_names (TREE_CODE (cond), op0, op1,
4355 	  else if (TREE_CODE (op0) == SSA_NAME)
4356 	    return compare_name_with_value (TREE_CODE (cond), op0, op1,
4360 		    (swap_tree_comparison (TREE_CODE (cond)), op1, op0,
4367 	  vr0 = (TREE_CODE (op0) == SSA_NAME) ? get_value_range (op0) : NULL;
4378 		    (swap_tree_comparison (TREE_CODE (cond)), vr1, op0,
4946       tree op0 = TREE_OPERAND (rhs, 0);
4952 	  t = build2 (RSHIFT_EXPR, TREE_TYPE (op0), op0, t);
4958 	  t = fold_convert (TREE_TYPE (op0), t);
4959 	  t = build2 (BIT_AND_EXPR, TREE_TYPE (op0), op0, t);
5040 test_for_singularity (enum tree_code cond_code, tree op0,
5052       min = TYPE_MIN_VALUE (TREE_TYPE (op0));
5057 	  tree one = build_int_cst (TREE_TYPE (op0), 1);
5058 	  max = fold_build2 (MINUS_EXPR, TREE_TYPE (op0), max, one);
5067       max = TYPE_MAX_VALUE (TREE_TYPE (op0));
5072 	  tree one = build_int_cst (TREE_TYPE (op0), 1);
5073 	  min = fold_build2 (PLUS_EXPR, TREE_TYPE (op0), min, one);
5080      value range information we have for op0.  */
5109   tree op0 = TREE_OPERAND (cond, 0);
5115       && TREE_CODE (op0) == SSA_NAME
5116       && INTEGRAL_TYPE_P (TREE_TYPE (op0))
5119       value_range_t *vr = get_value_range (op0);
5125 	  tree new = test_for_singularity (cond_code, op0, op1, vr);
5137 		= build2 (EQ_EXPR, boolean_type_node, op0, new);
5153 	  new = test_for_singularity (cond_code, op0, op1, vr);
5165 		= build2 (NE_EXPR, boolean_type_node, op0, new);