From mboxrd@z Thu Jan  1 00:00:00 1970
Return-Path: <gcc-bugs-return-490274-listarch-gcc-bugs=gcc.gnu.org@gcc.gnu.org>
Received: (qmail 89434 invoked by alias); 26 Jun 2015 12:53:25 -0000
Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm
Precedence: bulk
List-Id: <gcc-bugs.gcc.gnu.org>
List-Archive: <http://gcc.gnu.org/ml/gcc-bugs/>
List-Post: <mailto:gcc-bugs@gcc.gnu.org>
List-Help: <mailto:gcc-bugs-help@gcc.gnu.org>
Sender: gcc-bugs-owner@gcc.gnu.org
Received: (qmail 88063 invoked by uid 48); 26 Jun 2015 12:53:16 -0000
From: "vries at gcc dot gnu.org" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug tree-optimization/66678] loop counter not accurately described by vrp
Date: Fri, 26 Jun 2015 12:53:00 -0000
X-Bugzilla-Reason: CC
X-Bugzilla-Type: changed
X-Bugzilla-Watch-Reason: None
X-Bugzilla-Product: gcc
X-Bugzilla-Component: tree-optimization
X-Bugzilla-Version: 6.0
X-Bugzilla-Keywords:
X-Bugzilla-Severity: minor
X-Bugzilla-Who: vries at gcc dot gnu.org
X-Bugzilla-Status: UNCONFIRMED
X-Bugzilla-Resolution:
X-Bugzilla-Priority: P3
X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org
X-Bugzilla-Target-Milestone: ---
X-Bugzilla-Flags:
X-Bugzilla-Changed-Fields:
Message-ID: <bug-66678-4-4tVOGFSAbq@http.gcc.gnu.org/bugzilla/>
In-Reply-To: <bug-66678-4@http.gcc.gnu.org/bugzilla/>
References: <bug-66678-4@http.gcc.gnu.org/bugzilla/>
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: 7bit
X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/
Auto-Submitted: auto-generated
MIME-Version: 1.0
X-SW-Source: 2015-06/txt/msg02606.txt.bz2

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=66678

--- Comment #1 from vries at gcc dot gnu.org ---
I.
(In reply to vries from comment #0)

> AFAIU:
> - the loop iv i_1 has range [0, 4294967294], and 

This bit is incorrect. i_1 can actually be 4294967295. 


II.

With this demonstrator patch:
...
diff --git a/gcc/tree-vrp.c b/gcc/tree-vrp.c
index fdaebe4..3dd2992 100644
--- a/gcc/tree-vrp.c
+++ b/gcc/tree-vrp.c
@@ -1890,7 +1890,8 @@ extract_range_from_assert (value_range_t *vr_p, tree
expr)
                max = fold_build2 (PLUS_EXPR, TREE_TYPE (max), max,
                                   build_int_cst (TREE_TYPE (max), -1));
              else
-               max = fold_build2 (MINUS_EXPR, TREE_TYPE (max), max,
+               max = fold_build2 (MINUS_EXPR, TREE_TYPE (max),
+                                  TYPE_MAXVAL (TREE_TYPE (max)),
                                   build_int_cst (TREE_TYPE (max), 1));
              if (EXPR_P (max))
                TREE_NO_WARNING (max) = 1;
...

we get:
...
  # RANGE [1, 4294967295]
  i_17 = i_1 + 1;
...