diff options
Diffstat (limited to 'gcc/fold-const.c')
| -rw-r--r-- | gcc/fold-const.c | 61 |
1 files changed, 26 insertions, 35 deletions
diff --git a/gcc/fold-const.c b/gcc/fold-const.c index e39d75c..595d8c1 100644 --- a/gcc/fold-const.c +++ b/gcc/fold-const.c @@ -209,7 +209,7 @@ force_fit_type (tree t, int overflowable, int sign_extended_type; gcc_assert (TREE_CODE (t) == INTEGER_CST); - + low = TREE_INT_CST_LOW (t); high = TREE_INT_CST_HIGH (t); @@ -267,7 +267,7 @@ force_fit_type (tree t, int overflowable, || low != TREE_INT_CST_LOW (t) || high != TREE_INT_CST_HIGH (t)) { t = build_int_cst_wide (TREE_TYPE (t), low, high); - + if (overflowed || overflowable < 0 || (overflowable > 0 && sign_extended_type)) @@ -282,7 +282,7 @@ force_fit_type (tree t, int overflowable, TREE_CONSTANT_OVERFLOW (t) = 1; } } - + return t; } @@ -1451,7 +1451,7 @@ int_const_binop (enum tree_code code, tree arg1, tree arg2, int notrunc) | TREE_OVERFLOW (arg1) | TREE_OVERFLOW (arg2), TREE_CONSTANT_OVERFLOW (arg1) | TREE_CONSTANT_OVERFLOW (arg2)); - + return t; } @@ -1890,7 +1890,7 @@ fold_convert (tree type, tree arg) gcc_assert (TREE_CODE (orig) == VECTOR_TYPE && tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (orig))); return fold (build1 (NOP_EXPR, type, arg)); - + case REAL_TYPE: if (TREE_CODE (arg) == INTEGER_CST) { @@ -1911,19 +1911,19 @@ fold_convert (tree type, tree arg) case BOOLEAN_TYPE: case ENUMERAL_TYPE: case POINTER_TYPE: case REFERENCE_TYPE: return fold (build1 (FLOAT_EXPR, type, arg)); - + case REAL_TYPE: return fold (build1 (flag_float_store ? CONVERT_EXPR : NOP_EXPR, type, arg)); - + case COMPLEX_TYPE: tem = fold (build1 (REALPART_EXPR, TREE_TYPE (orig), arg)); return fold_convert (type, tem); - + default: gcc_unreachable (); } - + case COMPLEX_TYPE: switch (TREE_CODE (orig)) { @@ -1937,14 +1937,14 @@ fold_convert (tree type, tree arg) case COMPLEX_TYPE: { tree rpart, ipart; - + if (TREE_CODE (arg) == COMPLEX_EXPR) { rpart = fold_convert (TREE_TYPE (type), TREE_OPERAND (arg, 0)); ipart = fold_convert (TREE_TYPE (type), TREE_OPERAND (arg, 1)); return fold (build2 (COMPLEX_EXPR, type, rpart, ipart)); } - + arg = save_expr (arg); rpart = fold (build1 (REALPART_EXPR, TREE_TYPE (orig), arg)); ipart = fold (build1 (IMAGPART_EXPR, TREE_TYPE (orig), arg)); @@ -1952,11 +1952,11 @@ fold_convert (tree type, tree arg) ipart = fold_convert (TREE_TYPE (type), ipart); return fold (build2 (COMPLEX_EXPR, type, rpart, ipart)); } - + default: gcc_unreachable (); } - + case VECTOR_TYPE: if (integer_zerop (arg)) return build_zero_vector (type); @@ -3310,7 +3310,7 @@ decode_field_reference (tree exp, HOST_WIDE_INT *pbitsize, mask = build_int_cst (unsigned_type, -1); mask = force_fit_type (mask, 0, false, false); - + mask = const_binop (LSHIFT_EXPR, mask, size_int (precision - *pbitsize), 0); mask = const_binop (RSHIFT_EXPR, mask, size_int (precision - *pbitsize), 0); @@ -3336,7 +3336,7 @@ all_ones_mask_p (tree mask, int size) tmask = build_int_cst (lang_hooks.types.signed_type (type), -1); tmask = force_fit_type (tmask, 0, false, false); - + return tree_int_cst_equal (mask, const_binop (RSHIFT_EXPR, @@ -5902,7 +5902,7 @@ static bool reorder_operands_p (tree arg0, tree arg1) { if (! flag_evaluation_order) - return true; + return true; if (TREE_CONSTANT (arg0) || TREE_CONSTANT (arg1)) return true; return ! TREE_SIDE_EFFECTS (arg0) @@ -5952,15 +5952,6 @@ tree_swap_operands_p (tree arg0, tree arg1, bool reorder) if (DECL_P (arg0)) return 1; - if (reorder && flag_evaluation_order - && (TREE_SIDE_EFFECTS (arg0) || TREE_SIDE_EFFECTS (arg1))) - return 0; - - if (DECL_P (arg1)) - return 0; - if (DECL_P (arg0)) - return 1; - /* It is preferable to swap two SSA_NAME to ensure a canonical form for commutative and comparison operators. Ensuring a canonical form allows the optimizers to find additional redundancies without @@ -10288,7 +10279,7 @@ fold_negate_const (tree arg0, tree type) TREE_CONSTANT_OVERFLOW (arg0)); break; } - + case REAL_CST: t = build_real (type, REAL_VALUE_NEGATE (TREE_REAL_CST (arg0))); break; @@ -10296,7 +10287,7 @@ fold_negate_const (tree arg0, tree type) default: gcc_unreachable (); } - + return t; } @@ -10334,18 +10325,18 @@ fold_abs_const (tree arg0, tree type) TREE_CONSTANT_OVERFLOW (arg0)); } break; - + case REAL_CST: if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg0))) t = build_real (type, REAL_VALUE_NEGATE (TREE_REAL_CST (arg0))); else t = arg0; break; - + default: gcc_unreachable (); } - + return t; } @@ -10358,13 +10349,13 @@ fold_not_const (tree arg0, tree type) tree t = NULL_TREE; gcc_assert (TREE_CODE (arg0) == INTEGER_CST); - + t = build_int_cst_wide (type, ~ TREE_INT_CST_LOW (arg0), ~ TREE_INT_CST_HIGH (arg0)); t = force_fit_type (t, 0, TREE_OVERFLOW (arg0), TREE_CONSTANT_OVERFLOW (arg0)); - + return t; } @@ -10630,7 +10621,7 @@ round_up (tree value, int divisor) if (divisor == (divisor & -divisor)) { tree t; - + t = build_int_cst (TREE_TYPE (value), divisor - 1); value = size_binop (PLUS_EXPR, value, t); t = build_int_cst (TREE_TYPE (value), -divisor); @@ -10674,7 +10665,7 @@ round_down (tree value, int divisor) if (divisor == (divisor & -divisor)) { tree t; - + t = build_int_cst (TREE_TYPE (value), -divisor); value = size_binop (BIT_AND_EXPR, value, t); } @@ -10701,7 +10692,7 @@ ptr_difference_const (tree e1, tree e2, HOST_WIDE_INT *diff) tree toffset1, toffset2, tdiff, type; enum machine_mode mode1, mode2; int unsignedp1, unsignedp2, volatilep1, volatilep2; - + core1 = get_inner_reference (e1, &bitsize1, &bitpos1, &toffset1, &mode1, &unsignedp1, &volatilep1); core2 = get_inner_reference (e2, &bitsize2, &bitpos2, &toffset2, &mode2, |