contrib/gcc/tree-vrp.c

47 static int compare_values (tree val1, tree val2);
48 static int compare_values_warnv (tree val1, tree val2, bool *);
488 vrp_operand_equal_p (tree val1, tree val2)
490   if (val1 == val2)
492   if (!val1 || !val2 || !operand_equal_p (val1, val2, 0))
495     return is_overflow_infinity (val2);
694 compare_values_warnv (tree val1, tree val2, bool *strict_overflow_p)
696   if (val1 == val2)
702 	      == POINTER_TYPE_P (TREE_TYPE (val2)));
707       && (TREE_CODE (val2) == SSA_NAME
708 	  || TREE_CODE (val2) == PLUS_EXPR
709 	  || TREE_CODE (val2) == MINUS_EXPR))
739       if (TREE_CODE (val2) == SSA_NAME)
742 	  n2 = val2;
747 	  code2 = TREE_CODE (val2);
748 	  n2 = TREE_OPERAND (val2, 0);
749 	  c2 = TREE_OPERAND (val2, 1);
776 	  && (code2 == SSA_NAME || !TREE_NO_WARNING (val2)))
818   if (!is_gimple_min_invariant (val1) || !is_gimple_min_invariant (val2))
825       if (TREE_OVERFLOW (val1) || TREE_OVERFLOW (val2))
830 	    return is_negative_overflow_infinity (val2) ? 0 : -1;
831 	  else if (is_negative_overflow_infinity (val2))
834 	    return is_positive_overflow_infinity (val2) ? 0 : 1;
835 	  else if (is_positive_overflow_infinity (val2))
840       return tree_int_cst_compare (val1, val2);
847       if (val1 == val2 || operand_equal_p (val1, val2, 0))
851       t = fold_binary (LT_EXPR, boolean_type_node, val1, val2);
856       t = fold_binary (GT_EXPR, boolean_type_node, val1, val2);
861       t = fold_binary (NE_EXPR, boolean_type_node, val1, val2);
873 compare_values (tree val1, tree val2)
879   ret = compare_values_warnv (val1, val2, &sop);
881       && (!is_gimple_min_invariant (val1) || !is_gimple_min_invariant (val2)))
1467 vrp_int_const_binop (enum tree_code code, tree val1, tree val2)
1471   res = int_const_binop (code, val1, val2, 0);
1480       /* Ensure that res = val1 [+*] val2 >= val1
1481          or that res = val1 - val2 <= val1.  */
1499 	  int check = compare_values (tmp, val2);
1514 	    && !TREE_OVERFLOW (val2))
1516 	   || is_overflow_infinity (val2))
1522       int sgn2 = tree_int_cst_sgn (val2);
1534 	  && is_overflow_infinity (val2))
1545 	      || is_overflow_infinity (val2)))
1565 		  ? !is_negative_overflow_infinity (val2)
1566 		  : is_positive_overflow_infinity (val2)))
1576 		  ? !is_positive_overflow_infinity (val2)
1577 		  : is_negative_overflow_infinity (val2)))