diff options
| author | Richard Biener <rguenther@suse.de> | 2013-02-11 13:33:19 +0000 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2013-02-11 13:33:19 +0000 |
| commit | b4a4b56dc7ff0bb336abd777cb8f2437cd05909b (patch) | |
| tree | 03c7a299ead75282880171606b8684c11336788e /gcc/tree-vrp.c | |
| parent | 3b424b30be6a93cfc68df6f77e0aa1ce673d71fe (diff) | |
| download | gcc-b4a4b56dc7ff0bb336abd777cb8f2437cd05909b.zip gcc-b4a4b56dc7ff0bb336abd777cb8f2437cd05909b.tar.gz gcc-b4a4b56dc7ff0bb336abd777cb8f2437cd05909b.tar.bz2 | |
re PR tree-optimization/56273 (Bogus -Warray-bounds warning)
2013-02-11 Richard Biener <rguenther@suse.de>
PR tree-optimization/56273
* tree-vrp.c (simplify_cond_using_ranges): Disable for the
first VRP run.
(check_array_ref): Fix missing newline in dumps.
(search_for_addr_array): Likewise.
* g++.dg/warn/Warray-bounds-6.C: New testcase.
* gcc.dg/tree-ssa/pr21559.c: Adjust.
* gcc.dg/tree-ssa/vrp17.c: Likewise.
* gcc.dg/tree-ssa/vrp18.c: Likewise.
* gcc.dg/tree-ssa/vrp23.c: Likewise.
* gcc.dg/tree-ssa/vrp24.c: Likewise.
From-SVN: r195940
Diffstat (limited to 'gcc/tree-vrp.c')
| -rw-r--r-- | gcc/tree-vrp.c | 17 |
1 files changed, 13 insertions, 4 deletions
diff --git a/gcc/tree-vrp.c b/gcc/tree-vrp.c index 0efac60..a023a46 100644 --- a/gcc/tree-vrp.c +++ b/gcc/tree-vrp.c @@ -6027,6 +6027,7 @@ check_array_ref (location_t location, tree ref, bool ignore_off_by_one) { fprintf (dump_file, "Array bound warning for "); dump_generic_expr (MSG_NOTE, TDF_SLIM, ref); + fprintf (dump_file, "\n"); } warning_at (location, OPT_Warray_bounds, "array subscript is above array bounds"); @@ -6039,6 +6040,7 @@ check_array_ref (location_t location, tree ref, bool ignore_off_by_one) { fprintf (dump_file, "Array bound warning for "); dump_generic_expr (MSG_NOTE, TDF_SLIM, ref); + fprintf (dump_file, "\n"); } warning_at (location, OPT_Warray_bounds, "array subscript is below array bounds"); @@ -6112,6 +6114,7 @@ search_for_addr_array (tree t, location_t location) { fprintf (dump_file, "Array bound warning for "); dump_generic_expr (MSG_NOTE, TDF_SLIM, t); + fprintf (dump_file, "\n"); } warning_at (location, OPT_Warray_bounds, "array subscript is below array bounds"); @@ -6125,6 +6128,7 @@ search_for_addr_array (tree t, location_t location) { fprintf (dump_file, "Array bound warning for "); dump_generic_expr (MSG_NOTE, TDF_SLIM, t); + fprintf (dump_file, "\n"); } warning_at (location, OPT_Warray_bounds, "array subscript is above array bounds"); @@ -8499,9 +8503,8 @@ test_for_singularity (enum tree_code cond_code, tree op0, return NULL; } -/* Simplify a conditional using a relational operator to an equality - test if the range information indicates only one value can satisfy - the original conditional. */ +/* Simplify the conditional stmt STMT using final range information. + Return true if we simplified the statement. */ static bool simplify_cond_using_ranges (gimple stmt) @@ -8510,7 +8513,13 @@ simplify_cond_using_ranges (gimple stmt) tree op1 = gimple_cond_rhs (stmt); enum tree_code cond_code = gimple_cond_code (stmt); - if (cond_code != NE_EXPR + /* Simplify a conditional using a relational operator to an equality + test if the range information indicates only one value can satisfy + the original conditional. + Do that only in the second VRP pass as otherwise assertions derived + from this predicate are weakened. */ + if (!first_pass_instance + && cond_code != NE_EXPR && cond_code != EQ_EXPR && TREE_CODE (op0) == SSA_NAME && INTEGRAL_TYPE_P (TREE_TYPE (op0)) |