diff options
| author | Richard Guenther <rguenther@suse.de> | 2005-12-02 14:40:40 +0000 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2005-12-02 14:40:40 +0000 |
| commit | 0d451405750ebd0b4abe5ee84398ea7e082b27cb (patch) | |
| tree | 91c46da23139dff93fd79a1086c7f732c02caccb /gcc/tree-vrp.c | |
| parent | 69f8a2d68a851452b56452d866e4d383a83da7bd (diff) | |
| download | gcc-0d451405750ebd0b4abe5ee84398ea7e082b27cb.zip gcc-0d451405750ebd0b4abe5ee84398ea7e082b27cb.tar.gz gcc-0d451405750ebd0b4abe5ee84398ea7e082b27cb.tar.bz2 | |
tree-vrp.c (build_assert_expr_for, [...]): Use buildN instead of build.
2005-12-02 Richard Guenther <rguenther@suse.de>
* tree-vrp.c (build_assert_expr_for, process_assert_insertions_for,
simplify_cond_using_ranges): Use buildN instead of build.
* tree-tailcall.c (adjust_accumulator_values,
adjust_return_value): Likewise.
* tree-sra.c (generate_one_element_ref, generate_copy_inout,
generate_element_copy, generate_element_zero,
generate_one_element_init): Likewise.
* tree-ssa-forwprop.c (forward_propagate_into_cond_1): Likewise.
* lambda-code.c (gcc_loop_to_lambda_loop, lbv_to_gcc_expression,
lle_to_gcc_expression, lambda_loopnest_to_gcc_loopnest,
perfect_nestify): Likewise.
From-SVN: r107894
Diffstat (limited to 'gcc/tree-vrp.c')
| -rw-r--r-- | gcc/tree-vrp.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/gcc/tree-vrp.c b/gcc/tree-vrp.c index 0797b5c..04353f5a 100644 --- a/gcc/tree-vrp.c +++ b/gcc/tree-vrp.c @@ -2164,21 +2164,21 @@ build_assert_expr_for (tree cond, tree v) if (COMPARISON_CLASS_P (cond)) { - tree a = build (ASSERT_EXPR, TREE_TYPE (v), v, cond); - assertion = build (MODIFY_EXPR, TREE_TYPE (v), n, a); + tree a = build2 (ASSERT_EXPR, TREE_TYPE (v), v, cond); + assertion = build2 (MODIFY_EXPR, TREE_TYPE (v), n, a); } else if (TREE_CODE (cond) == TRUTH_NOT_EXPR) { /* Given !V, build the assignment N = false. */ tree op0 = TREE_OPERAND (cond, 0); gcc_assert (op0 == v); - assertion = build (MODIFY_EXPR, TREE_TYPE (v), n, boolean_false_node); + assertion = build2 (MODIFY_EXPR, TREE_TYPE (v), n, boolean_false_node); } else if (TREE_CODE (cond) == SSA_NAME) { /* Given V, build the assignment N = true. */ gcc_assert (v == cond); - assertion = build (MODIFY_EXPR, TREE_TYPE (v), n, boolean_true_node); + assertion = build2 (MODIFY_EXPR, TREE_TYPE (v), n, boolean_true_node); } else gcc_unreachable (); @@ -2781,7 +2781,7 @@ process_assert_insertions_for (tree name, assert_locus_t loc) edge_iterator ei; edge e; - cond = build (loc->comp_code, boolean_type_node, name, loc->val); + cond = build2 (loc->comp_code, boolean_type_node, name, loc->val); assert_expr = build_assert_expr_for (cond, name); if (loc->e) @@ -3957,7 +3957,7 @@ simplify_cond_using_ranges (tree stmt) } COND_EXPR_COND (stmt) - = build (EQ_EXPR, boolean_type_node, op0, new); + = build2 (EQ_EXPR, boolean_type_node, op0, new); update_stmt (stmt); if (dump_file) @@ -3985,7 +3985,7 @@ simplify_cond_using_ranges (tree stmt) } COND_EXPR_COND (stmt) - = build (NE_EXPR, boolean_type_node, op0, new); + = build2 (NE_EXPR, boolean_type_node, op0, new); update_stmt (stmt); if (dump_file) |