http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #17 from Andreas Schwab schwab at gcc dot gnu.org 2012-12-12
09:32:47 UTC ---
Author: schwab
Date: Wed Dec 12 09:32:40 2012
New Revision: 194437
URL: http://gcc.gnu.org/viewcvs?root=gccview=revrev=194437
Log:
PR
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #15 from Richard Biener rguenth at gcc dot gnu.org 2012-12-11
10:06:20 UTC ---
Author: rguenth
Date: Tue Dec 11 10:06:15 2012
New Revision: 194388
URL: http://gcc.gnu.org/viewcvs?root=gccview=revrev=194388
Log:
2012-12-11
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
Richard Biener rguenth at gcc dot gnu.org changed:
What|Removed |Added
Status|ASSIGNED
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
Richard Biener rguenth at gcc dot gnu.org changed:
What|Removed |Added
Status|NEW
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #12 from Richard Biener rguenth at gcc dot gnu.org 2012-12-10
13:50:15 UTC ---
For the testcase in comment#1 we have
Found new range for len_10: [1, 7]
Visiting statement:
len_17 = MIN_EXPR len_10, len_11(D);
Found
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #13 from Richard Biener rguenth at gcc dot gnu.org 2012-12-10
14:14:07 UTC ---
(In reply to comment #9)
This is reduced testcase from gcov.c
int a[8];
int
t (void)
{
int ix = 0;
int k;
int b = 0;
int curr = 0;
for
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #14 from Jan Hubicka hubicka at ucw dot cz 2012-12-10 16:26:40
UTC ---
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #13 from Richard Biener rguenth at gcc dot gnu.org 2012-12-10
14:14:07 UTC ---
(In
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
Richard Biener rguenth at gcc dot gnu.org changed:
What|Removed |Added
Priority|P3 |P1
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
Jan Hubicka hubicka at gcc dot gnu.org changed:
What|Removed |Added
Summary|[4.8 regression] false |[4.8 regression]
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #9 from Jan Hubicka hubicka at gcc dot gnu.org 2012-11-15
01:01:30 UTC ---
This is reduced testcase from gcov.c
int a[8];
int
t (void)
{
int ix = 0;
int k;
int b = 0;
int curr = 0;
for (k = 0; k 2; k++)
{
b = ix
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #4 from Jan Hubicka hubicka at gcc dot gnu.org 2012-11-02
16:35:01 UTC ---
Author: hubicka
Date: Fri Nov 2 16:34:52 2012
New Revision: 193098
URL: http://gcc.gnu.org/viewcvs?root=gccview=revrev=193098
Log:
PR
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #5 from Jan Hubicka hubicka at gcc dot gnu.org 2012-11-02
16:46:54 UTC ---
The patch cures a lot of false positives seen at -O3 bootstrap. The testcase
here is not cured, I am looking into it.
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #6 from Jan Hubicka hubicka at gcc dot gnu.org 2012-11-02
18:44:37 UTC ---
Hmm, it seems to be due to off-by-one bug in my patch
Index: tree-ssa-loop-ivcanon.c
===
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #7 from Jan Hubicka hubicka at gcc dot gnu.org 2012-11-02
20:51:31 UTC ---
Actually not, what happen here is that we unroll the loop 17 times based on the
fact that the array access iterates from taillen to tailen+n_iterations
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
--- Comment #2 from Richard Biener rguenth at gcc dot gnu.org 2012-10-30
09:32:45 UTC ---
*** Bug 55085 has been marked as a duplicate of this bug. ***
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=55079
Richard Biener rguenth at gcc dot gnu.org changed:
What|Removed |Added
CC|
16 matches
Mail list logo