diff options
| author | Richard Biener <rguenther@suse.de> | 2016-11-09 15:15:28 +0000 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2016-11-09 15:15:28 +0000 |
| commit | 14e7281244ddf777d822f1e99518f0e15b0bfea6 (patch) | |
| tree | 73df188c516c30ba22babcd35c5781b2add0a224 /gcc/fold-const.c | |
| parent | 2c49f22a484e13d6fceeb2af6ea045c17ece466b (diff) | |
| download | gcc-14e7281244ddf777d822f1e99518f0e15b0bfea6.zip gcc-14e7281244ddf777d822f1e99518f0e15b0bfea6.tar.gz gcc-14e7281244ddf777d822f1e99518f0e15b0bfea6.tar.bz2 | |
fold-const.c (tree_swap_operands_p): Remove unused arg.
2016-11-09 Richard Biener <rguenther@suse.de>
* fold-const.c (tree_swap_operands_p): Remove unused arg.
* fold-const.c (tree_swap_operands_p): Likewise.
(fold_binary_loc): Adjust.
(fold_ternary_loc): Likewise.
* genmatch.c (dt_operand::gen_gimple_exp): Likewise.
* gimple-fold.c (fold_stmt_1): Likewise.
* gimple-match-head.c (gimple_resimplify2): Likewise.
(gimple_resimplify3): Likewise.
(gimple_simplify): Likewise.
* tree-ssa-dom.c (record_equality): Likewise.
* tree-ssa-reassoc.c (optimize_range_tests_var_bound): Likewise.
* tree-ssa-sccvn.c (vn_nary_op_compute_hash): Likewise.
* tree-ssa-threadedge.c (simplify_control_stmt_condition_1): Likewise.
From-SVN: r242004
Diffstat (limited to 'gcc/fold-const.c')
| -rw-r--r-- | gcc/fold-const.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/fold-const.c b/gcc/fold-const.c index b78b6d8..e14471e 100644 --- a/gcc/fold-const.c +++ b/gcc/fold-const.c @@ -6758,7 +6758,7 @@ fold_single_bit_test (location_t loc, enum tree_code code, isn't. */ bool -tree_swap_operands_p (const_tree arg0, const_tree arg1, bool) +tree_swap_operands_p (const_tree arg0, const_tree arg1) { if (CONSTANT_CLASS_P (arg1)) return 0; @@ -9132,13 +9132,13 @@ fold_binary_loc (location_t loc, /* If this is a commutative operation, and ARG0 is a constant, move it to ARG1 to reduce the number of tests below. */ if (commutative_tree_code (code) - && tree_swap_operands_p (arg0, arg1, true)) + && tree_swap_operands_p (arg0, arg1)) return fold_build2_loc (loc, code, type, op1, op0); /* Likewise if this is a comparison, and ARG0 is a constant, move it to ARG1 to reduce the number of tests below. */ if (kind == tcc_comparison - && tree_swap_operands_p (arg0, arg1, true)) + && tree_swap_operands_p (arg0, arg1)) return fold_build2_loc (loc, swap_tree_comparison (code), type, op1, op0); tem = generic_simplify (loc, code, type, op0, op1); @@ -11242,7 +11242,7 @@ fold_ternary_loc (location_t loc, enum tree_code code, tree type, /* If this is a commutative operation, and OP0 is a constant, move it to OP1 to reduce the number of tests below. */ if (commutative_ternary_tree_code (code) - && tree_swap_operands_p (op0, op1, true)) + && tree_swap_operands_p (op0, op1)) return fold_build3_loc (loc, code, type, op1, op0, op2); tem = generic_simplify (loc, code, type, op0, op1, op2); @@ -11371,7 +11371,7 @@ fold_ternary_loc (location_t loc, enum tree_code code, tree type, /* If the second operand is simpler than the third, swap them since that produces better jump optimization results. */ if (truth_value_p (TREE_CODE (arg0)) - && tree_swap_operands_p (op1, op2, false)) + && tree_swap_operands_p (op1, op2)) { location_t loc0 = expr_location_or (arg0, loc); /* See if this can be inverted. If it can't, possibly because |