This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug middle-end/39297] [4.4 Regression] gcc.dg/tree-ssa/loop-31.c
- From: "rakdver at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 25 Feb 2009 19:09:46 -0000
- Subject: [Bug middle-end/39297] [4.4 Regression] gcc.dg/tree-ssa/loop-31.c
- References: <bug-39297-682@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #10 from rakdver at gcc dot gnu dot org 2009-02-25 19:09 -------
The difference between
> D.1254 = &a[0] + ((long unsigned int) ((unsigned int) len + 4294967295) + 1)
> * 2;
(original) and
> D.1255 = ((long unsigned int) &a + 2) + (long unsigned int) ((unsigned int)
> len + 4294967295) * 2;
(current) is mostly cosmetical; the test in the testcase should be made more
robust, but other than that, there is no regression here.
--
rakdver at gcc dot gnu dot org changed:
What |Removed |Added
----------------------------------------------------------------------------
URL|http://gcc.gnu.org/ml/gcc- |
|patches/2009- |
|02/msg01185.html |
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=39297