--- Comment #25 from pinskia at gcc dot gnu dot org 2006-05-16 06:11
---
This was fixed by the patch for PR 27603.
*** This bug has been marked as a duplicate of 27603 ***
--
pinskia at gcc dot gnu dot org changed:
What|Removed |Added
---
--- Comment #24 from rakdver at gcc dot gnu dot org 2006-05-08 11:18
---
Patch: http://gcc.gnu.org/ml/gcc-patches/2006-05/msg00290.html
--
rakdver at gcc dot gnu dot org changed:
What|Removed |Added
--- Comment #23 from rakdver at gcc dot gnu dot org 2006-05-02 08:57
---
Somehow, we record that the loop iterates at most once, which obviously leads
to problems.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26304
--- Comment #22 from rakdver at gcc dot gnu dot org 2006-05-02 07:56
---
(In reply to comment #14)
> Hmm, I wonder if the following loop in scev_probably_wraps_p is wrong.
>
> estimate_numbers_of_iterations_loop (loop);
> for (bound = loop->bounds; bound; bound = bound->next)
>
--- Comment #21 from pinskia at gcc dot gnu dot org 2006-05-02 06:14
---
This still fails even after the code change.
CCing the person who changed the code:
http://gcc.gnu.org/ml/gcc-cvs/2006-05/msg00024.html
--
pinskia at gcc dot gnu dot org changed:
What|Removed
--- Comment #20 from pinskia at gcc dot gnu dot org 2006-05-02 05:55
---
The code which I replaced here is changed.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26304
--- Comment #19 from dberlin at gcc dot gnu dot org 2006-04-24 01:10
---
Subject: Re: [4.2 Regression]
25_algorithms/prev_permutation/1.cc on powerpc{64,}-linux and
powerpc-darwin
On Sun, 2006-04-23 at 23:14 +, pinskia at gcc dot gnu dot org wrote:
>
> --- Comment #17
On Sun, 2006-04-23 at 23:14 +, pinskia at gcc dot gnu dot org wrote:
>
> --- Comment #17 from pinskia at gcc dot gnu dot org 2006-04-23 23:14
> ---
> Rewritting that loop like:
> [kudzu:local/trunk/gcc] pinskia% svn diff tree-ssa-loop-niter.c
> Index: tree-ssa-loop-niter.c
>
--- Comment #18 from pinskia at gcc dot gnu dot org 2006-04-23 23:15
---
Oh, I did not test the patch at all except on the testcase I gave in comment
#7.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26304
--- Comment #17 from pinskia at gcc dot gnu dot org 2006-04-23 23:14
---
Rewritting that loop like:
[kudzu:local/trunk/gcc] pinskia% svn diff tree-ssa-loop-niter.c
Index: tree-ssa-loop-niter.c
===
--- tree-ssa-loop-niter.c
--- Comment #16 from janis at gcc dot gnu dot org 2006-04-18 16:23 ---
I verified that the failure starts with Jeff's patch:
r110705 | law | 2006-02-07 10:31:27 -0800 (Tue, 07 Feb 2006)
http://gcc.gnu.org/viewcvs?view=rev&rev=110705
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=2
--- Comment #15 from pcarlini at suse dot de 2006-03-28 20:20 ---
*** Bug 26911 has been marked as a duplicate of this bug. ***
--
pcarlini at suse dot de changed:
What|Removed |Added
--
pinskia at gcc dot gnu dot org changed:
What|Removed |Added
Severity|normal |blocker
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26304
--- Comment #14 from pinskia at gcc dot gnu dot org 2006-02-17 03:37
---
Hmm, I wonder if the following loop in scev_probably_wraps_p is wrong.
estimate_numbers_of_iterations_loop (loop);
for (bound = loop->bounds; bound; bound = bound->next)
if (proved_non_wrapping_p (at_stmt,
--- Comment #13 from law at redhat dot com 2006-02-17 02:47 ---
Subject: Re: [4.2 Regression]
25_algorithms/prev_permutation/1.cc on powerpc{64,}-linux and
powerpc-darwin
On Fri, 2006-02-17 at 01:17 +, pinskia at gcc dot gnu dot org wrote:
>
> --- Comment #12 from pins
--- Comment #12 from pinskia at gcc dot gnu dot org 2006-02-17 01:17
---
(In reply to comment #11)
> I've just checked in a patch which may (or may not) fix this problem;
> can you update your stor-layout.c and see if that change happens to
> fix this problem.
Nope, sorry it does not f
--- Comment #11 from law at redhat dot com 2006-02-17 00:19 ---
Subject: Re: [4.2 Regression]
25_algorithms/prev_permutation/1.cc on powerpc{64,}-linux and
powerpc-darwin
On Wed, 2006-02-15 at 15:37 +, pinskia at gcc dot gnu dot org wrote:
>
> --- Comment #7 from pinsk
--- Comment #10 from law at redhat dot com 2006-02-16 03:52 ---
Subject: Re: [4.2 Regression]
25_algorithms/prev_permutation/1.cc on powerpc{64,}-linux and
powerpc-darwin
On Thu, 2006-02-16 at 02:59 +, pinskia at gcc dot gnu dot org wrote:
>
> --- Comment #9 from pinsk
--- Comment #9 from pinskia at gcc dot gnu dot org 2006-02-16 02:59 ---
(In reply to comment #8)
> > Which looks more like VRP messing up.
> Can you check something for me. Is sizetype an unsigned type on
> this platform? And what type is ivtmp?
sizetype should be "unsigned long int"
--- Comment #8 from law at redhat dot com 2006-02-15 23:34 ---
Subject: Re: [4.2 Regression]
25_algorithms/prev_permutation/1.cc on powerpc{64,}-linux and
powerpc-darwin
On Wed, 2006-02-15 at 15:19 +, pinskia at gcc dot gnu dot org wrote:
>
> --- Comment #3 from pinski
--- Comment #7 from pinskia at gcc dot gnu dot org 2006-02-15 15:37 ---
Here is a self contained program without using libstdc++:
int array[10] = {5, 4, 3, 2, 1, 0};
int array1[10] = {5, 4, 3, 2, 1, 0};
int array2[10] = {5, 4, 3, 2, 1, 0};
#include
void g(int *a)
{
*a = 0;
}
void
te
--- Comment #6 from pinskia at gcc dot gnu dot org 2006-02-15 15:26 ---
The part which is being miscompiled is:
for(int i = 0; i < 6; ++i)
assert(array[i] == 5 - i);
which is funny.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26304
--- Comment #5 from pinskia at gcc dot gnu dot org 2006-02-15 15:23 ---
Folding predicate ivtmp.209_41 != 4294967295 to 1
Folded statement: if (ivtmp.209_41 != 4294967295) goto ; else goto ;
into: if (1) goto ; else goto ;
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=2
--- Comment #4 from pinskia at gcc dot gnu dot org 2006-02-15 15:19 ---
Also -O2 -fno-ivopts cures the problem too.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26304
--- Comment #3 from pinskia at gcc dot gnu dot org 2006-02-15 15:18 ---
-O2 -fno-tree-vrp cures the wrong code which either means VRP is messing up or
some other pass is messing up after VRP. Though I should note:
- ivtmp.209 = ivtmp.209 - 1;
+ ivtmp.211 = ivtmp.211 - 1;
ivtmp.214
25 matches
Mail list logo
