Package: g77-3.2
Version: 3.2.2-0pre3
The original source code file muller.F (which triggers an internal
compiler error), preprocessed file muller.f, and assembly file muller.s
are attached to this email. The compiler error occurs only on
optimization of -O2 or higher.
Output of gcc -v:
Reading specs from /usr/lib/gcc-lib/i386-linux/3.2.2/specs
Configured with: ../src/configure -v
--enable-languages=c,c++,java,f77,proto,pascal,objc,ada --prefix=/usr
--mandir=/usr/share/man --infodir=/usr/share/info
--with-gxx-include-dir=/usr/include/c++/3.2 --enable-shared
--with-system-zlib --enable-nls --without-included-gettext
--enable-__cxa_atexit --enable-clocale=gnu --enable-java-gc=boehm
--enable-objc-gc i386-linux
Thread model: posix
gcc version 3.2.2 20021231 (Debian prerelease)
Command line triggering the bug:
g77 -Wall -c -O2 -g -fno-automatic -fno-second-underscore -fugly-complex
-I/home/kmccarty/Downloads/programs/src/cernlib-2002.04.26/2002/build/packlib/kernlib/kernnum
-I/home/kmccarty/src/cernlib-2002.04.26/2002/src/packlib/kernlib/kernnum
-I/home/kmccarty/src/cernlib-2002.04.26/2002/src/packlib/kernlib/kernnum/c204fort
-I/home/kmccarty/src/cernlib-2002.04.26/2002/src/include -DCERNLIB_LINUX
-DCERNLIB_UNIX -DCERNLIB_LNX -DCERNLIB_QMGLIBC -o archive/muller.o
/home/kmccarty/src/cernlib-2002.04.26/2002/src/packlib/kernlib/kernnum/c204fort/muller.F
Compiler output:
/home/kmccarty/src/cernlib-2002.04.26/2002/src/packlib/kernlib/kernnum/c204fort/muller.F:
In subroutine `muller':
/home/kmccarty/src/cernlib-2002.04.26/2002/src/packlib/kernlib/kernnum/c204fort/muller.F:194:
Internal compiler error in compensate_edge, at reg-stack.c:2591
Please submit a full bug report,
with preprocessed source if appropriate.
See <URL:http://www.gnu.org/software/gcc/bugs.html> for instructions.
Debian-specific information:
Versions of the packages that g77-3.2 depends upon are as follows:
ii gcc-3.2-base 3.2.2-0pre3 The GNU Compiler Collection (base
ii libg2c0 3.2.2-0pre3 Runtime library for GNU Fortran 77
ii libc6 2.3.1-9 GNU C Library: Shared libraries and
ii gcc-3.2 3.2.2-0pre3 The GNU C compiler
Regards,
--
Kevin McCarty Physics Department
[EMAIL PROTECTED] Princeton University
www.princeton.edu/~kmccarty Princeton, NJ 08544
*
* $Id: muller.F,v 1.1.1.1 1996/02/15 17:48:47 mclareni Exp $
*
* $Log: muller.F,v $
* Revision 1.1.1.1 1996/02/15 17:48:47 mclareni
* Kernlib
*
*
#include "kernnum/pilot.h"
SUBROUTINE MULLER (A,N,C)
C
C MODIFIED TO ELIMINATE STOP AND AVOID COMPILER DIAGNOSTICS
C DUE TO ASSIGNED GOTO INTO DO 17. H.LIPPS, 30.6.1982.
C
C-----COMPUTES ROOTS OF POLYNOMIAL A(1)*X**N+...A(N)*X+A(N+1) = 0.
C BY METHOD OF D.E.MULLER,M.T.A.C.,VOL 10, P208-215 (1956).
C DURING EXECUTION THE ARRAY C CONTAINS SCALED,COMPLEX POLYNOMIAL
C COEFFICIENTS.AFTER EXECUTION IT CONTAINS COMPLEX ROOTS.
C THE FOLLOWING ARE DUMMY ARRAY DIMENSIONS
DIMENSION A(9),C(9)
COMPLEX C,DX,X,X3,Y1,Y2,Y,TE1,TE2,TE3,TE4,TE5,TE6,TE7
#if defined(CERNLIB_IBMRT)
EXTERNAL CABS
#endif
LOGICAL MFLAG, RFLAG
#if defined(CERNLIB_NUMHIPRE)
DATA ETA1/1.E-14/ ,ETA2/.6E-7/
#endif
#if defined(CERNLIB_NUMLOPRE)
DATA ETA1/1.E-6/,ETA2/1.E-3/
#endif
SUMABS(X)=ABS(REAL(X))+ABS(AIMAG(X))
IF(N .LT. 1) THEN
CALL KERMTR('C204.1',LGFILE,MFLAG,RFLAG)
IF(MFLAG) THEN
IF(LGFILE .EQ. 0) THEN
WRITE(*,1000) N
ELSE
WRITE(LGFILE,1000) N
ENDIF
ENDIF
IF(.NOT. RFLAG) CALL ABEND
RETURN
ENDIF
IF(A(1).EQ.0.) GO TO 105
C
C-----EXTRACT ALL ZERO ROOTS
N1=N
2 IF(N1.EQ.1) GO TO 3
IF(A(N1+1).NE.0.) GO TO 5
C(N1)=0.
N1=N1-1
GO TO 2
3 C(1)=-A(2)/A(1)
RETURN
C
C-----NORMALIZE AND SCALE DOWN POLYNOMIAL TO MAKE COEFF.C(0)=C(N1)= 1.
5 B=1./FLOAT(N1)
SCALE=ABS(A(N1+1))**B/ABS(A(1))**B
B=A(1)
DO 6 I=1,N1
B=B*SCALE
6 C(I)=A(I+1)/B
IF(N1.EQ.2) GO TO 104
C
C-----STARTING VALUES AT X1=+1, X2=-1, X=0.
10 ASSIGN 20 TO L
Y1=C(1)+1.
Y2=C(1)-1.
DO 11 I=2,N1
Y1=C(I)+Y1
11 Y2=C(I)-Y2
Y=C(N1)
X=0.
DX=1.
C
C-----MULLER"S ITERATION
TE1=-2.
12 TE2=Y2/Y
TE3=(Y1-Y2)/(Y*TE1)
DO 17 ITER=1,2000
TE4=TE2-1.
TE5=(TE4-TE3)/(TE1+1.)
TE6=(TE5+TE4)*.5
TE7=SQRT(TE6*TE6+TE5)
TE1=TE6+TE7
TE7=TE6-TE7
B=REAL(TE7)**2+AIMAG(TE7)**2
IF(REAL(TE1)**2+AIMAG(TE1)**2.GT.B) GO TO 13
IF(B.EQ.0.) TE7=.9
TE1=TE7
13 DX=DX/TE1
X=DX+X
EPSI=SUMABS(X)*ETA1
IF(SUMABS(DX).GE.EPSI) GO TO 14
IF(SUMABS(Y).LT.2.E-3) GO TO 18
14 Y2=Y
GO TO 199
C
15 IF(YA.LT.100.*SUMABS(Y2)) GO TO 16
IF(SUMABS(DX).LT.EPSI) GO TO 16
C
C-----REDUCE EXCESSIVE STEP SIZE DX,PREVENT OVERFLOW IN POLYN.EVALUATION
TE1=TE1+TE1
DX=.5*DX
X=X-DX
C
C-----EVALUATE POLYNOMIAL AND TEST ZERO.
199 Y=X+C(1)
DO 200 I=2,N1
200 Y=Y*X+C(I)
YA=SUMABS(Y)
IF(YA.EQ.0.) GO TO 18
GOTO 15
C
16 TE2=Y2/Y
17 TE3=TE2/TE1*TE4
C-----SCALE DEFLATED POLYNOMIAL
CN=CABS(C(N1))
IF (ABS(CN-1.).LT.0.1) GO TO 35
S=CN**(1./FLOAT(N1))
SCALE=SCALE*S
B=1.
DO 30 I=1,N1
B=B/S
30 C(I)=C(I)*B
GO TO 10
C-----IF ROOT CANNOT BE FOUND IN 2000 ITERATIONS PRINT ERROR MESSAGE
35 IMIN=N1+1
DO 40 I=1,N1
40 C(I)=1.E20
IMAX=N+1
CALL KERMTR('C204.3',LGFILE,MFLAG,RFLAG)
IF(MFLAG) THEN
IF(LGFILE .EQ. 0) THEN
WRITE(*,1003) (A(I),I=1,IMAX)
IF(N1 .LT. N) WRITE(*,1004) (C(I),I=IMIN,N)
ELSE
WRITE(LGFILE,1003) (A(I),I=1,IMAX)
IF(N1 .LT. N) WRITE(LGFILE,1004) (C(I),I=IMIN,N)
ENDIF
ENDIF
IF(.NOT. RFLAG) CALL ABEND
RETURN
C
C-----IF ROOT IS COMPLEX,START ITERATION NEAR CONJUGATE ROOT(HIGH PREC.)
20 IF(ABS(AIMAG(X)).LT.ABS(REAL(X))*ETA2) GO TO 10
ASSIGN 10 TO L
X3=CONJG(X)
DX=CONJG(DX)
TE1=CONJG(TE1)
X=X3-DX
ASSIGN 21 TO M
GO TO 99
21 Y2=Y
X=X-DX*TE1
ASSIGN 22 TO M
GO TO 99
22 Y1=Y
X=X3
ASSIGN 12 TO M
GO TO 99
C
C-----EVALUATE POLYNOMIAL AND TEST ZERO.
99 Y=X+C(1)
DO 100 I=2,N1
100 Y=Y*X+C(I)
YA=SUMABS(Y)
IF(YA.NE.0.) GO TO M,(12,21,22)
C
C-----IF A ROOT IS FOUND REDUCE DEGREE OF POLYNOMIAL(DEFLATION)
18 C(N1)=X*SCALE
N1=N1-1
C(1)=X+C(1)
DO 19 I=2,N1
19 C(I)=C(I-1)*X+C(I)
IF(N1.GT.2) GO TO L,(10,20)
C
C-----SOLVE QUADRATIC EQUATION AND RETURN
104 TE6=.5*C(1)
C(2)=(CSQRT(TE6*TE6-C(2))-TE6)*SCALE
C(1)=-C(1)*SCALE-C(2)
RETURN
105 IMAX=N+1
CALL KERMTR('C204.2',LGFILE,MFLAG,RFLAG)
IF(MFLAG) THEN
IF(LGFILE .EQ. 0) THEN
WRITE(*,1001) (A(I),I=1,IMAX)
ELSE
WRITE(LGFILE,1001) (A(I),I=1,IMAX)
ENDIF
ENDIF
IF(.NOT. RFLAG) CALL ABEND
RETURN
C
1000 FORMAT( 7X, 'SUBROUTINE MULLER ... THE DEGREE N OF THE ',
+ 'POLYNOMIAL =', I6, ' IS LESS THAN 1.')
1001 FORMAT( 7X, 'SUBROUTINE MULLER ...'/' THE POLYNOMIAL ',
1'CANNOT HAVE N ROOTS BECAUSE THE COEFFICIENT OF Z**N (FIRST ',
2'COEFFICIENT ) IS ZERO. THE COEFFICIENTS ARE'/(1H0,8G14.6))
1003 FORMAT( 7X, 'SUBROUTINE MULLER ... ',' ROOT CANNOT BE FOUND ',
1'WITH 2000 ITERATIONS'/' REVERSE THE SEQUENCE OF COEFFICIENTS ',
2' A(N+1)...A(1) AND CALL MULLER AGAIN TO COMPUTE 1/ROOT.' /
3 ' THE COEFFICIENTS ARE' //(1H0,8G14.6))
1004 FORMAT(41H0ONLY THE FOLLOWING ROOTS HAVE BEEN FOUND//(2H (,E20.13,
11H, ,3X,E20.13,1H) ))
END
# 1
"/home/kmccarty/src/cernlib-2002.04.26/2002/src/packlib/kernlib/kernnum/c204fort/muller.F"
*
* $Id: muller.F,v 1.1.1.1 1996/02/15 17:48:47 mclareni Exp $
*
* $Log: muller.F,v $
* Revision 1.1.1.1 1996/02/15 17:48:47 mclareni
* Kernlib
*
*
# 1
"/home/kmccarty/src/cernlib-2002.04.26/2002/src/packlib/kernlib/kernnum/kernnum/pilot.h"
1
# 44
"/home/kmccarty/src/cernlib-2002.04.26/2002/src/packlib/kernlib/kernnum/kernnum/pilot.h"
# 10
"/home/kmccarty/src/cernlib-2002.04.26/2002/src/packlib/kernlib/kernnum/c204fort/muller.F"
2
SUBROUTINE MULLER (A,N,C)
C
C MODIFIED TO ELIMINATE STOP AND AVOID COMPILER DIAGNOSTICS
C DUE TO ASSIGNED GOTO INTO DO 17. H.LIPPS, 30.6.1982.
C
C-----COMPUTES ROOTS OF POLYNOMIAL A(1)*X**N+...A(N)*X+A(N+1) = 0.
C BY METHOD OF D.E.MULLER,M.T.A.C.,VOL 10, P208-215 (1956).
C DURING EXECUTION THE ARRAY C CONTAINS SCALED,COMPLEX POLYNOMIAL
C COEFFICIENTS.AFTER EXECUTION IT CONTAINS COMPLEX ROOTS.
C THE FOLLOWING ARE DUMMY ARRAY DIMENSIONS
DIMENSION A(9),C(9)
COMPLEX C,DX,X,X3,Y1,Y2,Y,TE1,TE2,TE3,TE4,TE5,TE6,TE7
LOGICAL MFLAG, RFLAG
DATA ETA1/1.E-6/,ETA2/1.E-3/
SUMABS(X)=ABS(REAL(X))+ABS(AIMAG(X))
IF(N .LT. 1) THEN
CALL KERMTR('C204.1',LGFILE,MFLAG,RFLAG)
IF(MFLAG) THEN
IF(LGFILE .EQ. 0) THEN
WRITE(*,1000) N
ELSE
WRITE(LGFILE,1000) N
ENDIF
ENDIF
IF(.NOT. RFLAG) CALL ABEND
RETURN
ENDIF
IF(A(1).EQ.0.) GO TO 105
C
C-----EXTRACT ALL ZERO ROOTS
N1=N
2 IF(N1.EQ.1) GO TO 3
IF(A(N1+1).NE.0.) GO TO 5
C(N1)=0.
N1=N1-1
GO TO 2
3 C(1)=-A(2)/A(1)
RETURN
C
C-----NORMALIZE AND SCALE DOWN POLYNOMIAL TO MAKE COEFF.C(0)=C(N1)= 1.
5 B=1./FLOAT(N1)
SCALE=ABS(A(N1+1))**B/ABS(A(1))**B
B=A(1)
DO 6 I=1,N1
B=B*SCALE
6 C(I)=A(I+1)/B
IF(N1.EQ.2) GO TO 104
C
C-----STARTING VALUES AT X1=+1, X2=-1, X=0.
10 ASSIGN 20 TO L
Y1=C(1)+1.
Y2=C(1)-1.
DO 11 I=2,N1
Y1=C(I)+Y1
11 Y2=C(I)-Y2
Y=C(N1)
X=0.
DX=1.
C
C-----MULLER"S ITERATION
TE1=-2.
12 TE2=Y2/Y
TE3=(Y1-Y2)/(Y*TE1)
DO 17 ITER=1,2000
TE4=TE2-1.
TE5=(TE4-TE3)/(TE1+1.)
TE6=(TE5+TE4)*.5
TE7=SQRT(TE6*TE6+TE5)
TE1=TE6+TE7
TE7=TE6-TE7
B=REAL(TE7)**2+AIMAG(TE7)**2
IF(REAL(TE1)**2+AIMAG(TE1)**2.GT.B) GO TO 13
IF(B.EQ.0.) TE7=.9
TE1=TE7
13 DX=DX/TE1
X=DX+X
EPSI=SUMABS(X)*ETA1
IF(SUMABS(DX).GE.EPSI) GO TO 14
IF(SUMABS(Y).LT.2.E-3) GO TO 18
14 Y2=Y
GO TO 199
C
15 IF(YA.LT.100.*SUMABS(Y2)) GO TO 16
IF(SUMABS(DX).LT.EPSI) GO TO 16
C
C-----REDUCE EXCESSIVE STEP SIZE DX,PREVENT OVERFLOW IN POLYN.EVALUATION
TE1=TE1+TE1
DX=.5*DX
X=X-DX
C
C-----EVALUATE POLYNOMIAL AND TEST ZERO.
199 Y=X+C(1)
DO 200 I=2,N1
200 Y=Y*X+C(I)
YA=SUMABS(Y)
IF(YA.EQ.0.) GO TO 18
GOTO 15
C
16 TE2=Y2/Y
17 TE3=TE2/TE1*TE4
C-----SCALE DEFLATED POLYNOMIAL
CN=CABS(C(N1))
IF (ABS(CN-1.).LT.0.1) GO TO 35
S=CN**(1./FLOAT(N1))
SCALE=SCALE*S
B=1.
DO 30 I=1,N1
B=B/S
30 C(I)=C(I)*B
GO TO 10
C-----IF ROOT CANNOT BE FOUND IN 2000 ITERATIONS PRINT ERROR MESSAGE
35 IMIN=N1+1
DO 40 I=1,N1
40 C(I)=1.E20
IMAX=N+1
CALL KERMTR('C204.3',LGFILE,MFLAG,RFLAG)
IF(MFLAG) THEN
IF(LGFILE .EQ. 0) THEN
WRITE(*,1003) (A(I),I=1,IMAX)
IF(N1 .LT. N) WRITE(*,1004) (C(I),I=IMIN,N)
ELSE
WRITE(LGFILE,1003) (A(I),I=1,IMAX)
IF(N1 .LT. N) WRITE(LGFILE,1004) (C(I),I=IMIN,N)
ENDIF
ENDIF
IF(.NOT. RFLAG) CALL ABEND
RETURN
C
C-----IF ROOT IS COMPLEX,START ITERATION NEAR CONJUGATE ROOT(HIGH PREC.)
20 IF(ABS(AIMAG(X)).LT.ABS(REAL(X))*ETA2) GO TO 10
ASSIGN 10 TO L
X3=CONJG(X)
DX=CONJG(DX)
TE1=CONJG(TE1)
X=X3-DX
ASSIGN 21 TO M
GO TO 99
21 Y2=Y
X=X-DX*TE1
ASSIGN 22 TO M
GO TO 99
22 Y1=Y
X=X3
ASSIGN 12 TO M
GO TO 99
C
C-----EVALUATE POLYNOMIAL AND TEST ZERO.
99 Y=X+C(1)
DO 100 I=2,N1
100 Y=Y*X+C(I)
YA=SUMABS(Y)
IF(YA.NE.0.) GO TO M,(12,21,22)
C
C-----IF A ROOT IS FOUND REDUCE DEGREE OF POLYNOMIAL(DEFLATION)
18 C(N1)=X*SCALE
N1=N1-1
C(1)=X+C(1)
DO 19 I=2,N1
19 C(I)=C(I-1)*X+C(I)
IF(N1.GT.2) GO TO L,(10,20)
C
C-----SOLVE QUADRATIC EQUATION AND RETURN
104 TE6=.5*C(1)
C(2)=(CSQRT(TE6*TE6-C(2))-TE6)*SCALE
C(1)=-C(1)*SCALE-C(2)
RETURN
105 IMAX=N+1
CALL KERMTR('C204.2',LGFILE,MFLAG,RFLAG)
IF(MFLAG) THEN
IF(LGFILE .EQ. 0) THEN
WRITE(*,1001) (A(I),I=1,IMAX)
ELSE
WRITE(LGFILE,1001) (A(I),I=1,IMAX)
ENDIF
ENDIF
IF(.NOT. RFLAG) CALL ABEND
RETURN
C
1000 FORMAT( 7X, 'SUBROUTINE MULLER ... THE DEGREE N OF THE ',
+ 'POLYNOMIAL =', I6, ' IS LESS THAN 1.')
1001 FORMAT( 7X, 'SUBROUTINE MULLER ...'/' THE POLYNOMIAL ',
1'CANNOT HAVE N ROOTS BECAUSE THE COEFFICIENT OF Z**N (FIRST ',
2'COEFFICIENT ) IS ZERO. THE COEFFICIENTS ARE'/(1H0,8G14.6))
1003 FORMAT( 7X, 'SUBROUTINE MULLER ... ',' ROOT CANNOT BE FOUND ',
1'WITH 2000 ITERATIONS'/' REVERSE THE SEQUENCE OF COEFFICIENTS ',
2' A(N+1)...A(1) AND CALL MULLER AGAIN TO COMPUTE 1/ROOT.' /
3 ' THE COEFFICIENTS ARE' //(1H0,8G14.6))
1004 FORMAT(41H0ONLY THE FOLLOWING ROOTS HAVE BEEN FOUND//(2H (,E20.13,
11H, ,3X,E20.13,1H) ))
END
.file "muller.F"
.file 1
"/home/kmccarty/src/cernlib-2002.04.26/2002/src/packlib/kernlib/kernnum/c204fort/muller.F"
.section .debug_abbrev,"",@progbits
.Ldebug_abbrev0:
.section .debug_info,"",@progbits
.Ldebug_info0:
.section .debug_line,"",@progbits
.Ldebug_line0:
.text
.Ltext0:
.local dx.0
.comm dx.0,8,4
.local x.1
.comm x.1,8,4
.local x3.2
.comm x3.2,8,4
.local y1.3
.comm y1.3,8,4
.local y2.4
.comm y2.4,8,4
.local y.5
.comm y.5,8,4
.local te1.6
.comm te1.6,8,4
.local te2.7
.comm te2.7,8,4
.local te3.8
.comm te3.8,8,4
.local te4.9
.comm te4.9,8,4
.local te5.10
.comm te5.10,8,4
.local te6.11
.comm te6.11,8,4
.local te7.12
.comm te7.12,8,4
.local mflag.13
.comm mflag.13,4,4
.local rflag.14
.comm rflag.14,4,4
.data
.align 4
.type eta1.15,@object
.size eta1.15,4
eta1.15:
.long 897988541
.align 4
.type eta2.16,@object
.size eta2.16,4
eta2.16:
.long 981668463
.local lgfile.18
.comm lgfile.18,4,4
.local n1.19
.comm n1.19,4,4
.local b.20
.comm b.20,4,4
.local scale.21
.comm scale.21,4,4
.local i.22
.comm i.22,4,4
.local __g77_ASSIGN_l.23
.comm __g77_ASSIGN_l.23,4,4
.local l.24
.comm l.24,4,4
.local iter.25
.comm iter.25,4,4
.local epsi.26
.comm epsi.26,4,4
.local ya.27
.comm ya.27,4,4
.local cn.28
.comm cn.28,4,4
.local s.29
.comm s.29,4,4
.local imin.30
.comm imin.30,4,4
.local imax.31
.comm imax.31,4,4
.local __g77_ASSIGN_m.32
.comm __g77_ASSIGN_m.32,4,4
.local m.33
.comm m.33,4,4
.align 4
.type __g77_cilist_0.35,@object
.size __g77_cilist_0.35,20
__g77_cilist_0.35:
.long 0
.long 6
.long 0
.long __g77_format_1000.34
.long 0
.align 4
.type __g77_cilist_1.36,@object
.size __g77_cilist_1.36,20
__g77_cilist_1.36:
.long 0
.long 0
.long 0
.long __g77_format_1000.34
.long 0
.section .rodata
.align 4
.LC3:
.long 0
.long 0
.align 4
.LC5:
.long 1065353216
.long 0
.align 4
.LC6:
.long -1073741824
.long 0
.align 4
.LC7:
.long 1056964608
.long 0
.align 4
.LC8:
.long 1063675494
.long 0
.align 4
.LC12:
.long 1621981420
.long 0
.data
.align 4
.type __g77_cilist_2.38,@object
.size __g77_cilist_2.38,20
__g77_cilist_2.38:
.long 0
.long 6
.long 0
.long __g77_format_1003.37
.long 0
.align 4
.type __g77_cilist_3.40,@object
.size __g77_cilist_3.40,20
__g77_cilist_3.40:
.long 0
.long 6
.long 0
.long __g77_format_1004.39
.long 0
.align 4
.type __g77_cilist_4.41,@object
.size __g77_cilist_4.41,20
__g77_cilist_4.41:
.long 0
.long 0
.long 0
.long __g77_format_1003.37
.long 0
.align 4
.type __g77_cilist_5.42,@object
.size __g77_cilist_5.42,20
__g77_cilist_5.42:
.long 0
.long 0
.long 0
.long __g77_format_1004.39
.long 0
.align 4
.type __g77_cilist_6.44,@object
.size __g77_cilist_6.44,20
__g77_cilist_6.44:
.long 0
.long 6
.long 0
.long __g77_format_1001.43
.long 0
.align 4
.type __g77_cilist_7.45,@object
.size __g77_cilist_7.45,20
__g77_cilist_7.45:
.long 0
.long 0
.long 0
.long __g77_format_1001.43
.long 0
.align 32
.type __g77_format_1000.34,@object
.size __g77_format_1000.34,86
__g77_format_1000.34:
.ascii "(7X,\002SUBROUTINE MULLER ... THE DEGREE N OF THE \002,\002P"
.ascii "OLYNOMIAL =\002,I6,\002 IS LESS THAN 1.\002)"
.align 32
.type __g77_format_1001.43,@object
.size __g77_format_1001.43,172
__g77_format_1001.43:
.ascii "(7X,\002SUBROUTINE MULLER ...\002,/,\002 THE POLYNOMIAL \002"
.ascii ",\002CANNOT HAVE N ROOTS BECAUSE THE COEFFICIENT OF Z**N (FI"
.ascii "RST \002,\002COEFFICIENT ) IS ZERO. THE COEFFICIENTS ARE\002"
.ascii ",/,(1H0,8G14.6))"
.align 32
.type __g77_format_1003.37,@object
.size __g77_format_1003.37,222
__g77_format_1003.37:
.ascii "(7X,\002SUBROUTINE MULLER ... \002,\002 ROOT CANNOT BE FOUND"
.ascii " \002,\002WITH 2000 ITERATIONS\002,/,\002 REVERSE THE SEQUEN"
.ascii "CE OF COEFFICIENTS \002,\002 A(N+1)...A(1) AND CALL MULLER "
.ascii "AGAIN TO COMPUTE 1/ROOT.\002,/,\002 THE COEFFICIENTS ARE\002"
.ascii ",/,/,(1H0,8G14.6))"
.align 32
.type __g77_format_1004.39,@object
.size __g77_format_1004.39,82
__g77_format_1004.39:
.ascii "(41H0ONLY THE FOLLOWING ROOTS HAVE BEEN FOUND,/,/,(2H (,E20."
.ascii "13,1H,,3X,E20.13,1H)))"
