93 static int compare_values (tree val1, tree val2);
94 static int compare_values_warnv (tree val1, tree val2, bool *);
722 vrp_operand_equal_p (const_tree val1, const_tree val2)  in vrp_operand_equal_p()  argument
724   if (val1 == val2)  in vrp_operand_equal_p()
726   if (!val1 || !val2 || !operand_equal_p (val1, val2, 0))  in vrp_operand_equal_p()
728   if (is_overflow_infinity (val1))  in vrp_operand_equal_p()
1117 compare_values_warnv (tree val1, tree val2, bool *strict_overflow_p)  in compare_values_warnv()  argument
1119   if (val1 == val2)  in compare_values_warnv()
1124   gcc_assert (POINTER_TYPE_P (TREE_TYPE (val1))  in compare_values_warnv()
1128   val2 = fold_convert (TREE_TYPE (val1), val2);  in compare_values_warnv()
1131   if ((TREE_CODE (val1) == SSA_NAME  in compare_values_warnv()
1132        || TREE_CODE (val1) == PLUS_EXPR  in compare_values_warnv()
1133        || TREE_CODE (val1) == MINUS_EXPR)  in compare_values_warnv()
1144       if (TREE_CODE (val1) == SSA_NAME)  in compare_values_warnv()
1147 	  n1 = val1;  in compare_values_warnv()
1152 	  code1 = TREE_CODE (val1);  in compare_values_warnv()
1153 	  n1 = TREE_OPERAND (val1, 0);  in compare_values_warnv()
1154 	  c1 = TREE_OPERAND (val1, 1);  in compare_values_warnv()
1198       if (!TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (val1)))  in compare_values_warnv()
1202 	  && (code1 == SSA_NAME || !TREE_NO_WARNING (val1))  in compare_values_warnv()
1245   if (!is_gimple_min_invariant (val1) || !is_gimple_min_invariant (val2))  in compare_values_warnv()
1248   if (!POINTER_TYPE_P (TREE_TYPE (val1)))  in compare_values_warnv()
1252       if (TREE_OVERFLOW (val1) || TREE_OVERFLOW (val2))  in compare_values_warnv()
1256 	  if (is_negative_overflow_infinity (val1))  in compare_values_warnv()
1260 	  else if (is_positive_overflow_infinity (val1))  in compare_values_warnv()
1267       return tree_int_cst_compare (val1, val2);  in compare_values_warnv()
1274       if (val1 == val2 || operand_equal_p (val1, val2, 0))  in compare_values_warnv()
1278       if (operand_less_p (val1, val2) == 1)  in compare_values_warnv()
1282       if (operand_less_p (val2, val1) == 1)  in compare_values_warnv()
1289       if (TREE_CODE (val1) != INTEGER_CST  in compare_values_warnv()
1292           t = fold_binary_to_constant (NE_EXPR, boolean_type_node, val1, val2);  in compare_values_warnv()
1305 compare_values (tree val1, tree val2)  in compare_values()  argument
1311   ret = compare_values_warnv (val1, val2, &sop);  in compare_values()
1313       && (!is_gimple_min_invariant (val1) || !is_gimple_min_invariant (val2)))  in compare_values()
2002 vrp_int_const_binop (enum tree_code code, tree val1, tree val2)  in vrp_int_const_binop()  argument
2006   res = int_const_binop (code, val1, val2);  in vrp_int_const_binop()
2010   if (TYPE_UNSIGNED (TREE_TYPE (val1)))  in vrp_int_const_binop()
2012       int checkz = compare_values (res, val1);  in vrp_int_const_binop()
2029       else if (code == MULT_EXPR && !integer_zerop (val1))  in vrp_int_const_binop()
2033 				      val1);  in vrp_int_const_binop()
2047   else if (TYPE_OVERFLOW_WRAPS (TREE_TYPE (val1)))  in vrp_int_const_binop()
2052 	    && !TREE_OVERFLOW (val1)  in vrp_int_const_binop()
2054 	   || is_overflow_infinity (val1)  in vrp_int_const_binop()
2060       int sgn1 = tree_int_cst_sgn (val1);  in vrp_int_const_binop()
2072 	  && is_overflow_infinity (val1)  in vrp_int_const_binop()
2083 	  && (is_overflow_infinity (val1)  in vrp_int_const_binop()