diff options
Diffstat (limited to 'gcc/fold-const.cc')
| -rw-r--r-- | gcc/fold-const.cc | 22 |
1 files changed, 11 insertions, 11 deletions
diff --git a/gcc/fold-const.cc b/gcc/fold-const.cc index be04f28..0e37429 100644 --- a/gcc/fold-const.cc +++ b/gcc/fold-const.cc @@ -263,7 +263,7 @@ div_if_zero_remainder (const_tree arg1, const_tree arg2) SIGNED, &quo)) return wide_int_to_tree (TREE_TYPE (arg1), quo); - return NULL_TREE; + return NULL_TREE; } /* This is nonzero if we should defer warnings about undefined @@ -2343,7 +2343,7 @@ fold_convert_const_real_from_real (tree type, const_tree arg1) and the operand is a signaling NaN. */ if (HONOR_SNANS (arg1) && REAL_VALUE_ISSIGNALING_NAN (TREE_REAL_CST (arg1))) - return NULL_TREE; + return NULL_TREE; /* With flag_rounding_math we should respect the current rounding mode unless the conversion is exact. */ @@ -3855,10 +3855,10 @@ operand_compare::operand_equal_p (const_tree arg0, const_tree arg1, Double check this so we won't get false positives for GENERIC. */ || (c0->index - && (TREE_CODE (c0->index) != INTEGER_CST + && (TREE_CODE (c0->index) != INTEGER_CST || compare_tree_int (c0->index, i))) || (c1->index - && (TREE_CODE (c1->index) != INTEGER_CST + && (TREE_CODE (c1->index) != INTEGER_CST || compare_tree_int (c1->index, i)))) return false; } @@ -4320,7 +4320,7 @@ operand_equal_for_comparison_p (tree arg0, tree arg1) two different values, which will be stored in *CVAL1 and *CVAL2; if they are nonzero it means that some operands have already been found. No variables may be used anywhere else in the expression except in the - comparisons. + comparisons. If this is true, return 1. Otherwise, return zero. */ @@ -6450,7 +6450,7 @@ unextend (tree c, int p, int unsignedp, tree mask) A || ~B or A && ~B - LOC is the location of the resulting expression. OP is the inner + LOC is the location of the resulting expression. OP is the inner logical operation; the left-hand side in the examples above, while CMPOP is the right-hand side. RHS_ONLY is used to prevent us from accidentally removing a condition that guards another, as in @@ -7999,7 +7999,7 @@ native_encode_fixed (const_tree expr, unsigned char *ptr, int len, int off) if (NULL_TREE == i_type || TYPE_PRECISION (i_type) != total_bytes) return 0; - + value = TREE_FIXED_CST (expr); i_value = double_int_to_tree (i_type, value.data); @@ -10138,7 +10138,7 @@ fold_truth_andor (location_t loc, enum tree_code code, tree type, side-effects. */ && simple_condition_p (TREE_OPERAND (arg1, 0))) { - tem = fold_build2_loc (loc, ncode, type, + tem = fold_build2_loc (loc, ncode, type, arg0, TREE_OPERAND (arg1, 0)); return fold_build2_loc (loc, icode, type, tem, TREE_OPERAND (arg1, 1)); @@ -12390,7 +12390,7 @@ fold_binary_loc (location_t loc, enum tree_code code, tree type, case TRUNC_DIV_EXPR: /* Fall through */ - + case FLOOR_DIV_EXPR: /* Simplify A / (B << N) where A and B are positive and B is a power of 2, to A >> (N + log2(B)). */ @@ -12651,10 +12651,10 @@ fold_binary_loc (location_t loc, enum tree_code code, tree type, l0 = fold_convert_loc (loc, type, TREE_OPERAND (arg0, 0)); l1 = fold_convert_loc (loc, type, TREE_OPERAND (arg0, 1)); - + n0 = fold_build1_loc (loc, TRUTH_NOT_EXPR, type, l0); n1 = fold_build1_loc (loc, TRUTH_NOT_EXPR, type, l1); - + if ((operand_equal_p (n0, a0, 0) && operand_equal_p (n1, a1, 0)) || (operand_equal_p (n0, a1, 0) |