diff options
| author | Thomas Koenig <tkoenig@gcc.gnu.org> | 2007-07-19 04:47:29 +0000 |
|---|---|---|
| committer | Thomas Koenig <tkoenig@gcc.gnu.org> | 2007-07-19 04:47:29 +0000 |
| commit | 2211d9eae7c06cf47bbd32a0e0e04ec50f39fcbe (patch) | |
| tree | e0d04e6160ba601bca746b8b10d0ffac4e172743 /gcc/testsuite | |
| parent | afcc3cea715f99217134ac9d58af6afbce93d117 (diff) | |
| download | gcc-2211d9eae7c06cf47bbd32a0e0e04ec50f39fcbe.zip gcc-2211d9eae7c06cf47bbd32a0e0e04ec50f39fcbe.tar.gz gcc-2211d9eae7c06cf47bbd32a0e0e04ec50f39fcbe.tar.bz2 | |
re PR tree-optimization/32635 (gfortran - internal compiler error: verify_ssa failed)
2007-07-19 Thomas Koenig <tkoenig@gcc.gnu.org>
PR tree-optimzation/32635
* gfortran.dg/pr32635.f: New test case.
From-SVN: r126742
Diffstat (limited to 'gcc/testsuite')
| -rw-r--r-- | gcc/testsuite/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/testsuite/gfortran.dg/pr32635.f | 51 |
2 files changed, 56 insertions, 0 deletions
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index 9ada9e8..43442da 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,8 @@ +2007-07-19 Thomas Koenig <tkoenig@gcc.gnu.org> + + PR tree-optimzation/32635 + * gfortran.dg/pr32635.f: New test case. + 2007-07-18 Christopher D. Rickett <crickett@lanl.gov> PR fortran/32801 diff --git a/gcc/testsuite/gfortran.dg/pr32635.f b/gcc/testsuite/gfortran.dg/pr32635.f new file mode 100644 index 0000000..f052651 --- /dev/null +++ b/gcc/testsuite/gfortran.dg/pr32635.f @@ -0,0 +1,51 @@ +C { dg-do run } +C PR 32635 - this used to call an ICE in verify_ssa at -O2. +C An empty main program ensures that we cycle through all +C the options. + + program main + end + + subroutine aled7(ix,ib,itable,ip,ip2,imat,nummat, + 1 mx0,k,numnp,numel,iadj) + + implicit double precision (a-h,o-z) dp + + common/cale6/fst(16,4),ist(256,14) +c + dimension ib(*),itable(*),ip(3,*),ip2(*),ix(6,*),imat(nummat+1,*) +c +c + ipnt=1 + do 20 i=1,numel + if (imat(ix(5,i),mx0).ne.1) go to 20 + 20 continue +c + k=0 + kflg=0 + 25 do 30 i=1,ipnt + if (ip(1,i).eq.0) go to 30 + ii=i + go to 40 + 30 continue +c + 40 k=k+1 + iel=ip(3,ii) + ib(k+iadj)=i1 + if (kflg.eq.1) ip(1,ii)=0 + kflg=1 +c + isum=0 + do 50 i=1,ipnt + if (ip(1,i).eq.0) isum=isum+1 + if (ip(1,i).eq.0.or.ip(1,i).ne.i2) go to 50 + ii=i + if (ip(3,i).eq.iel) go to 40 + 50 continue +c + if (ip(1,ii).eq.i2) go to 40 + kflg=0 + if (isum.ne.ipnt) go to 25 +c + return + end |