--- Comment #12 from reichelt at gcc dot gnu dot org 2006-03-31 07:16
---
Fixed on mainline.
--
reichelt at gcc dot gnu dot org changed:
What|Removed |Added
--- Comment #10 from spop at gcc dot gnu dot org 2006-03-29 17:20 ---
Subject: Bug 26859
Author: spop
Date: Wed Mar 29 17:20:24 2006
New Revision: 112502
URL: http://gcc.gnu.org/viewcvs?root=gccview=revrev=112502
Log:
PR tree-optimization/26859
* tree-ssa-loop-niter.c
--- Comment #11 from malitzke at metronets dot com 2006-03-29 22:24 ---
Maybe I should keep my mouth shut.
However, gcc-4.2.0 2006329 again compiles pari-2.1.7 OK. 2nd However,
pari-2.2.12.beta uses a different approch, which does not give any problems
with various gcc-4.2.0. At least
--- Comment #6 from malitzke at metronets dot com 2006-03-28 14:45 ---
As no further comments are forthcoming I am taking the liberty to mark this PR
as resolved.
--
malitzke at metronets dot com changed:
What|Removed |Added
--- Comment #7 from reichelt at gcc dot gnu dot org 2006-03-28 14:50
---
The problem is not fixed.
The reduced testcase from comment #4 still crashes.
--
reichelt at gcc dot gnu dot org changed:
What|Removed |Added
--- Comment #8 from malitzke at metronets dot com 2006-03-28 17:07 ---
You are correct. At least as far as the second batch from S.Pop (dated
2006-03-27)
goes. As I did not keep my gcc-4.2.0 binaries relative to the first batch from
S.Pop (dated 2006-03-26) I can not reproduce the non
--- Comment #9 from sebastian dot pop at cri dot ensmp dot fr 2006-03-29
00:27 ---
Created an attachment (id=11147)
-- (http://gcc.gnu.org/bugzilla/attachment.cgi?id=11147action=view)
proposed fix
this patch (not tested yet) fixes the problem: it avoids a division by zero.
Part of
--- Comment #5 from malitzke at metronets dot com 2006-03-27 15:17 ---
The fairly extensive changes submitted by Mr Sebastian Pop solved the PR 26859
as originally reported by myself.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26859
--- Comment #4 from pinskia at gcc dot gnu dot org 2006-03-25 02:40 ---
Reduced testcase:
void f(long nb)
{
long i, j, d, d2;
for (i=1; i=nb; i++)
if (i1)
{
d = i-1;
d2 = 2*i-3;
for (j=d; j0; j--)
{
