*> \brief \b SBLAT3
*
* =========== DOCUMENTATION ===========
*
* Online html documentation available at
*
http://www.netlib.org/lapack/explore-html/
*
* Definition:
* ===========
*
*
PROGRAM SBLAT3
*
*
*> \par Purpose:
* =============
*>
*> \verbatim
*>
*> Test
program for the
REAL Level 3 Blas.
*>
*> The
program must be driven by a short
data file. The first 14 records
*> of the
file are
read using list-directed input, the last 6 records
*> are
read using the
format ( A6, L2 ). An annotated example of a
data
*>
file can be obtained by deleting the first 3 characters from the
*> following 20 lines:
*>
'sblat3.out' NAME OF SUMMARY OUTPUT
FILE
*> 6
UNIT NUMBER OF SUMMARY
FILE
*>
'SBLAT3.SNAP' NAME OF SNAPSHOT OUTPUT
FILE
*> -1
UNIT NUMBER OF SNAPSHOT
FILE (NOT USED
IF .LT. 0)
*> F
LOGICAL FLAG, T
TO REWIND SNAPSHOT
FILE AFTER EACH RECORD.
*> F
LOGICAL FLAG, T
TO STOP ON FAILURES.
*> T
LOGICAL FLAG, T
TO TEST ERROR EXITS.
*> 16.0 THRESHOLD VALUE OF TEST RATIO
*> 6
NUMBER OF VALUES OF N
*> 0 1 2 3 5 9 VALUES OF N
*> 3
NUMBER OF VALUES OF ALPHA
*> 0.0 1.0 0.7 VALUES OF ALPHA
*> 3
NUMBER OF VALUES OF BETA
*> 0.0 1.0 1.3 VALUES OF BETA
*> SGEMM T PUT F FOR NO TEST. SAME COLUMNS.
*> SSYMM T PUT F FOR NO TEST. SAME COLUMNS.
*> STRMM T PUT F FOR NO TEST. SAME COLUMNS.
*> STRSM T PUT F FOR NO TEST. SAME COLUMNS.
*> SSYRK T PUT F FOR NO TEST. SAME COLUMNS.
*> SSYR2K T PUT F FOR NO TEST. SAME COLUMNS.
*>
*> Further Details
*> ===============
*>
*> See:
*>
*> Dongarra J. J., Du Croz J. J., Duff I. S. and Hammarling S.
*> A Set of Level 3 Basic Linear Algebra Subprograms.
*>
*> Technical Memorandum No.88 (Revision 1), Mathematics and
*> Computer Science Division, Argonne National Laboratory, 9700
*> South Cass Avenue, Argonne, Illinois 60439, US.
*>
*> -- Written on 8-February-1989.
*> Jack Dongarra, Argonne National Laboratory.
*> Iain Duff, AERE Harwell.
*> Jeremy Du Croz, Numerical Algorithms Group Ltd.
*> Sven Hammarling, Numerical Algorithms Group Ltd.
*>
*> 10-9-00: Change
STATUS=
'NEW' to 'UNKNOWN' so that the testers
*> can be run multiple times without deleting generated
*> output files (susan)
*> \endverbatim
*
* Authors:
* ========
*
*> \author Univ. of Tennessee
*> \author Univ. of California Berkeley
*> \author Univ. of Colorado Denver
*> \author NAG Ltd.
*
*> \date April 2012
*
*> \ingroup single_blas_testing
*
* =====================================================================
PROGRAM SBLAT3
*
* -- Reference BLAS test routine (version 3.4.1) --
* -- Reference BLAS is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
* April 2012
*
* =====================================================================
*
* .. Parameters ..
INTEGER NIN
PARAMETER ( NIN = 5 )
INTEGER NSUBS
PARAMETER ( NSUBS = 6 )
REAL ZERO, ONE
PARAMETER ( ZERO = 0.0, ONE = 1.0 )
INTEGER NMAX
PARAMETER ( NMAX = 65 )
INTEGER NIDMAX, NALMAX, NBEMAX
PARAMETER ( NIDMAX = 9, NALMAX = 7, NBEMAX = 7 )
* .. Local Scalars ..
REAL EPS,
ERR, THRESH
INTEGER I, ISNUM, J, N, NALF, NBET, NIDIM, NOUT, NTRA
LOGICAL FATAL, LTESTT, REWI, SAME, SFATAL, TRACE,
$ TSTERR
CHARACTER*1 TRANSA, TRANSB
CHARACTER*6 SNAMET
CHARACTER*32 SNAPS, SUMMRY
* .. Local Arrays ..
REAL AA( NMAX*NMAX ), AB( NMAX, 2*NMAX ),
$ ALF( NALMAX ), AS( NMAX*NMAX ),
$ BB( NMAX*NMAX ), BET( NBEMAX ),
$ BS( NMAX*NMAX ), C( NMAX, NMAX ),
$ CC( NMAX*NMAX ), CS( NMAX*NMAX ), CT( NMAX ),
$ G( NMAX ), W( 2*NMAX )
INTEGER IDIM( NIDMAX )
LOGICAL LTEST( NSUBS )
CHARACTER*6 SNAMES( NSUBS )
* ..
External Functions ..
REAL SDIFF
LOGICAL LSE
EXTERNAL SDIFF, LSE
* ..
External Subroutines ..
EXTERNAL SCHK1, SCHK2, SCHK3, SCHK4, SCHK5, SCHKE, SMMCH
* ..
Intrinsic Functions ..
INTRINSIC MAX, MIN
* .. Scalars
in Common ..
INTEGER INFOT, NOUTC
LOGICAL LERR, OK
CHARACTER*6 SRNAMT
* ..
Common blocks ..
COMMON /INFOC/INFOT, NOUTC, OK, LERR
COMMON /SRNAMC/SRNAMT
* ..
Data statements ..
DATA SNAMES/
'SGEMM ',
'SSYMM ',
'STRMM ',
'STRSM ',
$
'SSYRK ',
'SSYR2K'/
* .. Executable Statements ..
*
*
Read name and
unit number for summary output
file and
open file.
*
READ( NIN,
FMT = * )SUMMRY
READ( NIN,
FMT = * )NOUT
OPEN( NOUT,
FILE = SUMMRY )
NOUTC = NOUT
*
*
Read name and
unit number for snapshot output
file and
open file.
*
READ( NIN,
FMT = * )SNAPS
READ( NIN,
FMT = * )NTRA
TRACE = NTRA.GE.0
IF( TRACE )
THEN
OPEN( NTRA,
FILE = SNAPS )
END IF
*
Read the flag that directs rewinding of the snapshot
file.
READ( NIN,
FMT = * )REWI
REWI = REWI.AND.TRACE
*
Read the flag that directs stopping on any failure.
READ( NIN,
FMT = * )SFATAL
*
Read the flag that indicates whether error exits are
to be tested.
READ( NIN,
FMT = * )TSTERR
*
Read the threshold value of the test ratio
READ( NIN,
FMT = * )THRESH
*
*
Read and check the
parameter values for the tests.
*
* Values of N
READ( NIN,
FMT = * )NIDIM
IF( NIDIM.LT.1.OR.NIDIM.GT.NIDMAX )
THEN
WRITE( NOUT,
FMT = 9997 )
'N', NIDMAX
GO TO 220
END IF
READ( NIN,
FMT = * )( IDIM( I ), I = 1, NIDIM )
DO 10 I = 1, NIDIM
IF( IDIM( I ).LT.0.OR.IDIM( I ).GT.NMAX )
THEN
WRITE( NOUT,
FMT = 9996 )NMAX
GO TO 220
END IF
10
CONTINUE
* Values of ALPHA
READ( NIN,
FMT = * )NALF
IF( NALF.LT.1.OR.NALF.GT.NALMAX )
THEN
WRITE( NOUT,
FMT = 9997 )
'ALPHA', NALMAX
GO TO 220
END IF
READ( NIN,
FMT = * )( ALF( I ), I = 1, NALF )
* Values of BETA
READ( NIN,
FMT = * )NBET
IF( NBET.LT.1.OR.NBET.GT.NBEMAX )
THEN
WRITE( NOUT,
FMT = 9997 )
'BETA', NBEMAX
GO TO 220
END IF
READ( NIN,
FMT = * )( BET( I ), I = 1, NBET )
*
* Report values of parameters.
*
WRITE( NOUT,
FMT = 9995 )
WRITE( NOUT,
FMT = 9994 )( IDIM( I ), I = 1, NIDIM )
WRITE( NOUT,
FMT = 9993 )( ALF( I ), I = 1, NALF )
WRITE( NOUT,
FMT = 9992 )( BET( I ), I = 1, NBET )
IF( .NOT.TSTERR )
THEN
WRITE( NOUT,
FMT = * )
WRITE( NOUT,
FMT = 9984 )
END IF
WRITE( NOUT,
FMT = * )
WRITE( NOUT,
FMT = 9999 )THRESH
WRITE( NOUT,
FMT = * )
*
*
Read names of subroutines and flags which indicate
* whether they are
to be tested.
*
DO 20 I = 1, NSUBS
LTEST( I ) = .
FALSE.
20
CONTINUE
30
READ( NIN,
FMT = 9988,
END = 60 )SNAMET, LTESTT
DO 40 I = 1, NSUBS
IF( SNAMET.EQ.SNAMES( I ) )
$
GO TO 50
40
CONTINUE
WRITE( NOUT,
FMT = 9990 )SNAMET
STOP
50 LTEST( I ) = LTESTT
GO TO 30
*
60
CONTINUE
CLOSE ( NIN )
*
* Compute EPS (the machine
precision).
*
EPS = EPSILON(ZERO)
WRITE( NOUT,
FMT = 9998 )EPS
*
* Check the reliability of SMMCH using exact
data.
*
N = MIN( 32, NMAX )
DO 100 J = 1, N
DO 90 I = 1, N
AB( I, J ) = MAX( I - J + 1, 0 )
90
CONTINUE
AB( J, NMAX + 1 ) = J
AB( 1, NMAX + J ) = J
C( J, 1 ) = ZERO
100
CONTINUE
DO 110 J = 1, N
CC( J ) = J*( ( J + 1 )*J )/2 - ( ( J + 1 )*J*( J - 1 ) )/3
110
CONTINUE
* CC holds the exact result. On
exit from SMMCH CT holds
* the result computed by SMMCH.
TRANSA =
'N'
TRANSB =
'N'
CALL SMMCH( TRANSA, TRANSB, N, 1, N, ONE, AB, NMAX,
$ AB( 1, NMAX + 1 ), NMAX, ZERO, C, NMAX, CT, G, CC,
$ NMAX, EPS,
ERR, FATAL, NOUT, .
TRUE. )
SAME = LSE( CC, CT, N )
IF( .NOT.SAME.OR.
ERR.NE.ZERO )
THEN
WRITE( NOUT,
FMT = 9989 )TRANSA, TRANSB, SAME,
ERR
STOP
END IF
TRANSB =
'T'
CALL SMMCH( TRANSA, TRANSB, N, 1, N, ONE, AB, NMAX,
$ AB( 1, NMAX + 1 ), NMAX, ZERO, C, NMAX, CT, G, CC,
$ NMAX, EPS,
ERR, FATAL, NOUT, .
TRUE. )
SAME = LSE( CC, CT, N )
IF( .NOT.SAME.OR.
ERR.NE.ZERO )
THEN
WRITE( NOUT,
FMT = 9989 )TRANSA, TRANSB, SAME,
ERR
STOP
END IF
DO 120 J = 1, N
AB( J, NMAX + 1 ) = N - J + 1
AB( 1, NMAX + J ) = N - J + 1
120
CONTINUE
DO 130 J = 1, N
CC( N - J + 1 ) = J*( ( J + 1 )*J )/2 -
$ ( ( J + 1 )*J*( J - 1 ) )/3
130
CONTINUE
TRANSA =
'T'
TRANSB =
'N'
CALL SMMCH( TRANSA, TRANSB, N, 1, N, ONE, AB, NMAX,
$ AB( 1, NMAX + 1 ), NMAX, ZERO, C, NMAX, CT, G, CC,
$ NMAX, EPS,
ERR, FATAL, NOUT, .
TRUE. )
SAME = LSE( CC, CT, N )
IF( .NOT.SAME.OR.
ERR.NE.ZERO )
THEN
WRITE( NOUT,
FMT = 9989 )TRANSA, TRANSB, SAME,
ERR
STOP
END IF
TRANSB =
'T'
CALL SMMCH( TRANSA, TRANSB, N, 1, N, ONE, AB, NMAX,
$ AB( 1, NMAX + 1 ), NMAX, ZERO, C, NMAX, CT, G, CC,
$ NMAX, EPS,
ERR, FATAL, NOUT, .
TRUE. )
SAME = LSE( CC, CT, N )
IF( .NOT.SAME.OR.
ERR.NE.ZERO )
THEN
WRITE( NOUT,
FMT = 9989 )TRANSA, TRANSB, SAME,
ERR
STOP
END IF
*
* Test each
subroutine in turn.
*
DO 200 ISNUM = 1, NSUBS
WRITE( NOUT,
FMT = * )
IF( .NOT.LTEST( ISNUM ) )
THEN
* Subprogram is not
to be tested.
WRITE( NOUT,
FMT = 9987 )SNAMES( ISNUM )
ELSE
SRNAMT = SNAMES( ISNUM )
* Test error exits.
IF( TSTERR )
THEN
CALL SCHKE( ISNUM, SNAMES( ISNUM ), NOUT )
WRITE( NOUT,
FMT = * )
END IF
* Test computations.
INFOT = 0
OK = .
TRUE.
FATAL = .
FALSE.
GO TO ( 140, 150, 160, 160, 170, 180 )ISNUM
* Test SGEMM, 01.
140
CALL SCHK1( SNAMES( ISNUM ), EPS, THRESH, NOUT, NTRA, TRACE,
$ REWI, FATAL, NIDIM, IDIM, NALF, ALF, NBET, BET,
$ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C,
$ CC, CS, CT, G )
GO TO 190
* Test SSYMM, 02.
150
CALL SCHK2( SNAMES( ISNUM ), EPS, THRESH, NOUT, NTRA, TRACE,
$ REWI, FATAL, NIDIM, IDIM, NALF, ALF, NBET, BET,
$ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C,
$ CC, CS, CT, G )
GO TO 190
* Test STRMM, 03, STRSM, 04.
160
CALL SCHK3( SNAMES( ISNUM ), EPS, THRESH, NOUT, NTRA, TRACE,
$ REWI, FATAL, NIDIM, IDIM, NALF, ALF, NMAX, AB,
$ AA, AS, AB( 1, NMAX + 1 ), BB, BS, CT, G, C )
GO TO 190
* Test SSYRK, 05.
170
CALL SCHK4( SNAMES( ISNUM ), EPS, THRESH, NOUT, NTRA, TRACE,
$ REWI, FATAL, NIDIM, IDIM, NALF, ALF, NBET, BET,
$ NMAX, AB, AA, AS, AB( 1, NMAX + 1 ), BB, BS, C,
$ CC, CS, CT, G )
GO TO 190
* Test SSYR2K, 06.
180
CALL SCHK5( SNAMES( ISNUM ), EPS, THRESH, NOUT, NTRA, TRACE,
$ REWI, FATAL, NIDIM, IDIM, NALF, ALF, NBET, BET,
$ NMAX, AB, AA, AS, BB, BS, C, CC, CS, CT, G, W )
GO TO 190
*
190
IF( FATAL.AND.SFATAL )
$
GO TO 210
END IF
200
CONTINUE
WRITE( NOUT,
FMT = 9986 )
GO TO 230
*
210
CONTINUE
WRITE( NOUT,
FMT = 9985 )
GO TO 230
*
220
CONTINUE
WRITE( NOUT,
FMT = 9991 )
*
230
CONTINUE
IF( TRACE )
$
CLOSE ( NTRA )
CLOSE ( NOUT )
STOP
*
9999
FORMAT(
' ROUTINES PASS COMPUTATIONAL TESTS IF TEST RATIO IS LES',
$
'S THAN', F8.2 )
9998
FORMAT(
' RELATIVE MACHINE PRECISION IS TAKEN TO BE', 1P, E9.1 )
9997
FORMAT(
' NUMBER OF VALUES OF ', A,
' IS LESS THAN 1 OR GREATER ',
$
'THAN ', I2 )
9996
FORMAT(
' VALUE OF N IS LESS THAN 0 OR GREATER THAN ', I2 )
9995
FORMAT(
' TESTS OF THE REAL LEVEL 3 BLAS', //
' THE F',
$
'OLLOWING PARAMETER VALUES WILL BE USED:' )
9994
FORMAT(
' FOR N ', 9I6 )
9993
FORMAT(
' FOR ALPHA ', 7F6.1 )
9992
FORMAT(
' FOR BETA ', 7F6.1 )
9991
FORMAT(
' AMEND DATA FILE OR INCREASE ARRAY SIZES IN PROGRAM',
$ /
' ******* TESTS ABANDONED *******' )
9990
FORMAT(
' SUBPROGRAM NAME ', A6,
' NOT RECOGNIZED', /
' ******* T',
$
'ESTS ABANDONED *******' )
9989
FORMAT(
' ERROR IN SMMCH - IN-LINE DOT PRODUCTS ARE BEING EVALU',
$
'ATED WRONGLY.', /
' SMMCH WAS CALLED WITH TRANSA = ', A1,
$
' AND TRANSB = ', A1, /
' AND RETURNED SAME = ', L1,
' AND ',
$
'ERR = ', F12.3,
'.', /
' THIS MAY BE DUE TO FAULTS IN THE ',
$
'ARITHMETIC OR THE COMPILER.', /
' ******* TESTS ABANDONED ',
$
'*******' )
9988
FORMAT( A6, L2 )
9987
FORMAT( 1X, A6,
' WAS NOT TESTED' )
9986
FORMAT( /
' END OF TESTS' )
9985
FORMAT( /
' ******* FATAL ERROR - TESTS ABANDONED *******' )
9984
FORMAT(
' ERROR-EXITS WILL NOT BE TESTED' )
*
*
End of SBLAT3.
*
END
SUBROUTINE SCHK1( SNAME, EPS, THRESH, NOUT, NTRA, TRACE, REWI,
$ FATAL, NIDIM, IDIM, NALF, ALF, NBET, BET, NMAX,
$ A, AA, AS, B, BB, BS, C, CC, CS, CT, G )
*
* Tests SGEMM.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Parameters ..
REAL ZERO
PARAMETER ( ZERO = 0.0 )
* .. Scalar Arguments ..
REAL EPS, THRESH
INTEGER NALF, NBET, NIDIM, NMAX, NOUT, NTRA
LOGICAL FATAL, REWI, TRACE
CHARACTER*6 SNAME
* .. Array Arguments ..
REAL A( NMAX, NMAX ), AA( NMAX*NMAX ), ALF( NALF ),
$ AS( NMAX*NMAX ), B( NMAX, NMAX ),
$ BB( NMAX*NMAX ), BET( NBET ), BS( NMAX*NMAX ),
$ C( NMAX, NMAX ), CC( NMAX*NMAX ),
$ CS( NMAX*NMAX ), CT( NMAX ), G( NMAX )
INTEGER IDIM( NIDIM )
* .. Local Scalars ..
REAL ALPHA, ALS, BETA, BLS,
ERR, ERRMAX
INTEGER I, IA, IB, ICA, ICB, IK, IM,
IN, K, KS, LAA,
$ LBB, LCC, LDA, LDAS, LDB, LDBS, LDC, LDCS, M,
$ MA, MB, MS, N,
NA, NARGS, NB, NC, NS
LOGICAL NULL, RESET, SAME, TRANA, TRANB
CHARACTER*1 TRANAS, TRANBS, TRANSA, TRANSB
CHARACTER*3 ICH
* .. Local Arrays ..
LOGICAL ISAME( 13 )
* ..
External Functions ..
LOGICAL LSE, LSERES
EXTERNAL LSE, LSERES
* ..
External Subroutines ..
EXTERNAL SGEMM, SMAKE, SMMCH
* ..
Intrinsic Functions ..
INTRINSIC MAX
* .. Scalars
in Common ..
INTEGER INFOT, NOUTC
LOGICAL LERR, OK
* ..
Common blocks ..
COMMON /INFOC/INFOT, NOUTC, OK, LERR
* ..
Data statements ..
DATA ICH/
'NTC'/
* .. Executable Statements ..
*
NARGS = 13
NC = 0
RESET = .
TRUE.
ERRMAX = ZERO
*
DO 110 IM = 1, NIDIM
M = IDIM( IM )
*
DO 100
IN = 1, NIDIM
N = IDIM(
IN )
* Set LDC
to 1 more than minimum value
if room.
LDC = M
IF( LDC.LT.NMAX )
$ LDC = LDC + 1
* Skip tests
if not enough room.
IF( LDC.GT.NMAX )
$
GO TO 100
LCC = LDC*N
NULL = N.LE.0.OR.M.LE.0
*
DO 90 IK = 1, NIDIM
K = IDIM( IK )
*
DO 80 ICA = 1, 3
TRANSA = ICH( ICA: ICA )
TRANA = TRANSA.EQ.
'T'.OR.TRANSA.EQ.
'C'
*
IF( TRANA )
THEN
MA = K
NA = M
ELSE
MA = M
NA = K
END IF
* Set LDA
to 1 more than minimum value
if room.
LDA = MA
IF( LDA.LT.NMAX )
$ LDA = LDA + 1
* Skip tests
if not enough room.
IF( LDA.GT.NMAX )
$
GO TO 80
LAA = LDA*
NA
*
* Generate the matrix A.
*
CALL SMAKE(
'GE',
' ',
' ', MA,
NA, A, NMAX, AA, LDA,
$ RESET, ZERO )
*
DO 70 ICB = 1, 3
TRANSB = ICH( ICB: ICB )
TRANB = TRANSB.EQ.
'T'.OR.TRANSB.EQ.
'C'
*
IF( TRANB )
THEN
MB = N
NB = K
ELSE
MB = K
NB = N
END IF
* Set LDB
to 1 more than minimum value
if room.
LDB = MB
IF( LDB.LT.NMAX )
$ LDB = LDB + 1
* Skip tests
if not enough room.
IF( LDB.GT.NMAX )
$
GO TO 70
LBB = LDB*NB
*
* Generate the matrix B.
*
CALL SMAKE(
'GE',
' ',
' ', MB, NB, B, NMAX, BB,
$ LDB, RESET, ZERO )
*
DO 60 IA = 1, NALF
ALPHA = ALF( IA )
*
DO 50 IB = 1, NBET
BETA = BET( IB )
*
* Generate the matrix C.
*
CALL SMAKE(
'GE',
' ',
' ', M, N, C, NMAX,
$ CC, LDC, RESET, ZERO )
*
NC = NC + 1
*
*
Save every datum before calling the
*
subroutine.
*
TRANAS = TRANSA
TRANBS = TRANSB
MS = M
NS = N
KS = K
ALS = ALPHA
DO 10 I = 1, LAA
AS( I ) = AA( I )
10
CONTINUE
LDAS = LDA
DO 20 I = 1, LBB
BS( I ) = BB( I )
20
CONTINUE
LDBS = LDB
BLS = BETA
DO 30 I = 1, LCC
CS( I ) = CC( I )
30
CONTINUE
LDCS = LDC
*
*
Call the
subroutine.
*
IF( TRACE )
$
WRITE( NTRA,
FMT = 9995 )NC, SNAME,
$ TRANSA, TRANSB, M, N, K, ALPHA, LDA, LDB,
$ BETA, LDC
IF( REWI )
$
REWIND NTRA
CALL SGEMM( TRANSA, TRANSB, M, N, K, ALPHA,
$ AA, LDA, BB, LDB, BETA, CC, LDC )
*
* Check
if error-exit was taken incorrectly.
*
IF( .NOT.OK )
THEN
WRITE( NOUT,
FMT = 9994 )
FATAL = .
TRUE.
GO TO 120
END IF
*
* See what
data changed inside subroutines.
*
ISAME( 1 ) = TRANSA.EQ.TRANAS
ISAME( 2 ) = TRANSB.EQ.TRANBS
ISAME( 3 ) = MS.EQ.M
ISAME( 4 ) = NS.EQ.N
ISAME( 5 ) = KS.EQ.K
ISAME( 6 ) = ALS.EQ.ALPHA
ISAME( 7 ) = LSE( AS, AA, LAA )
ISAME( 8 ) = LDAS.EQ.LDA
ISAME( 9 ) = LSE( BS, BB, LBB )
ISAME( 10 ) = LDBS.EQ.LDB
ISAME( 11 ) = BLS.EQ.BETA
IF(
NULL )
THEN
ISAME( 12 ) = LSE( CS, CC, LCC )
ELSE
ISAME( 12 ) = LSERES(
'GE',
' ', M, N, CS,
$ CC, LDC )
END IF
ISAME( 13 ) = LDCS.EQ.LDC
*
*
If data was incorrectly changed, report
* and
return.
*
SAME = .
TRUE.
DO 40 I = 1, NARGS
SAME = SAME.AND.ISAME( I )
IF( .NOT.ISAME( I ) )
$
WRITE( NOUT,
FMT = 9998 )I
40
CONTINUE
IF( .NOT.SAME )
THEN
FATAL = .
TRUE.
GO TO 120
END IF
*
IF( .NOT.
NULL )
THEN
*
* Check the result.
*
CALL SMMCH( TRANSA, TRANSB, M, N, K,
$ ALPHA, A, NMAX, B, NMAX, BETA,
$ C, NMAX, CT, G, CC, LDC, EPS,
$
ERR, FATAL, NOUT, .
TRUE. )
ERRMAX = MAX( ERRMAX,
ERR )
*
If got really bad answer, report and
*
return.
IF( FATAL )
$
GO TO 120
END IF
*
50
CONTINUE
*
60
CONTINUE
*
70
CONTINUE
*
80
CONTINUE
*
90
CONTINUE
*
100
CONTINUE
*
110
CONTINUE
*
* Report result.
*
IF( ERRMAX.LT.THRESH )
THEN
WRITE( NOUT,
FMT = 9999 )SNAME, NC
ELSE
WRITE( NOUT,
FMT = 9997 )SNAME, NC, ERRMAX
END IF
GO TO 130
*
120
CONTINUE
WRITE( NOUT,
FMT = 9996 )SNAME
WRITE( NOUT,
FMT = 9995 )NC, SNAME, TRANSA, TRANSB, M, N, K,
$ ALPHA, LDA, LDB, BETA, LDC
*
130
CONTINUE
RETURN
*
9999
FORMAT(
' ', A6,
' PASSED THE COMPUTATIONAL TESTS (', I6,
' CALL',
$
'S)' )
9998
FORMAT(
' ******* FATAL ERROR - PARAMETER NUMBER ', I2,
' WAS CH',
$
'ANGED INCORRECTLY *******' )
9997
FORMAT(
' ', A6,
' COMPLETED THE COMPUTATIONAL TESTS (', I6,
' C',
$
'ALLS)', /
' ******* BUT WITH MAXIMUM TEST RATIO', F8.2,
$
' - SUSPECT *******' )
9996
FORMAT(
' ******* ', A6,
' FAILED ON CALL NUMBER:' )
9995
FORMAT( 1X, I6,
': ', A6,
'(''', A1,
''',''', A1,
''',',
$ 3( I3,
',' ), F4.1,
', A,', I3,
', B,', I3,
',', F4.1,
', ',
$
'C,', I3,
').' )
9994
FORMAT(
' ******* FATAL ERROR - ERROR-EXIT TAKEN ON VALID CALL *',
$
'******' )
*
*
End of SCHK1.
*
END
SUBROUTINE SCHK2( SNAME, EPS, THRESH, NOUT, NTRA, TRACE, REWI,
$ FATAL, NIDIM, IDIM, NALF, ALF, NBET, BET, NMAX,
$ A, AA, AS, B, BB, BS, C, CC, CS, CT, G )
*
* Tests SSYMM.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Parameters ..
REAL ZERO
PARAMETER ( ZERO = 0.0 )
* .. Scalar Arguments ..
REAL EPS, THRESH
INTEGER NALF, NBET, NIDIM, NMAX, NOUT, NTRA
LOGICAL FATAL, REWI, TRACE
CHARACTER*6 SNAME
* .. Array Arguments ..
REAL A( NMAX, NMAX ), AA( NMAX*NMAX ), ALF( NALF ),
$ AS( NMAX*NMAX ), B( NMAX, NMAX ),
$ BB( NMAX*NMAX ), BET( NBET ), BS( NMAX*NMAX ),
$ C( NMAX, NMAX ), CC( NMAX*NMAX ),
$ CS( NMAX*NMAX ), CT( NMAX ), G( NMAX )
INTEGER IDIM( NIDIM )
* .. Local Scalars ..
REAL ALPHA, ALS, BETA, BLS,
ERR, ERRMAX
INTEGER I, IA, IB, ICS, ICU, IM,
IN, LAA, LBB, LCC,
$ LDA, LDAS, LDB, LDBS, LDC, LDCS, M, MS, N,
NA,
$ NARGS, NC, NS
LOGICAL LEFT,
NULL, RESET, SAME
CHARACTER*1 SIDE, SIDES, UPLO, UPLOS
CHARACTER*2 ICHS, ICHU
* .. Local Arrays ..
LOGICAL ISAME( 13 )
* ..
External Functions ..
LOGICAL LSE, LSERES
EXTERNAL LSE, LSERES
* ..
External Subroutines ..
EXTERNAL SMAKE, SMMCH, SSYMM
* ..
Intrinsic Functions ..
INTRINSIC MAX
* .. Scalars
in Common ..
INTEGER INFOT, NOUTC
LOGICAL LERR, OK
* ..
Common blocks ..
COMMON /INFOC/INFOT, NOUTC, OK, LERR
* ..
Data statements ..
DATA ICHS/
'LR'/, ICHU/
'UL'/
* .. Executable Statements ..
*
NARGS = 12
NC = 0
RESET = .
TRUE.
ERRMAX = ZERO
*
DO 100 IM = 1, NIDIM
M = IDIM( IM )
*
DO 90
IN = 1, NIDIM
N = IDIM(
IN )
* Set LDC
to 1 more than minimum value
if room.
LDC = M
IF( LDC.LT.NMAX )
$ LDC = LDC + 1
* Skip tests
if not enough room.
IF( LDC.GT.NMAX )
$
GO TO 90
LCC = LDC*N
NULL = N.LE.0.OR.M.LE.0
*
* Set LDB
to 1 more than minimum value
if room.
LDB = M
IF( LDB.LT.NMAX )
$ LDB = LDB + 1
* Skip tests
if not enough room.
IF( LDB.GT.NMAX )
$
GO TO 90
LBB = LDB*N
*
* Generate the matrix B.
*
CALL SMAKE(
'GE',
' ',
' ', M, N, B, NMAX, BB, LDB, RESET,
$ ZERO )
*
DO 80 ICS = 1, 2
SIDE = ICHS( ICS: ICS )
LEFT = SIDE.EQ.
'L'
*
IF( LEFT )
THEN
NA = M
ELSE
NA = N
END IF
* Set LDA
to 1 more than minimum value
if room.
LDA =
NA
IF( LDA.LT.NMAX )
$ LDA = LDA + 1
* Skip tests
if not enough room.
IF( LDA.GT.NMAX )
$
GO TO 80
LAA = LDA*
NA
*
DO 70 ICU = 1, 2
UPLO = ICHU( ICU: ICU )
*
* Generate the symmetric matrix A.
*
CALL SMAKE(
'SY', UPLO,
' ',
NA,
NA, A, NMAX, AA, LDA,
$ RESET, ZERO )
*
DO 60 IA = 1, NALF
ALPHA = ALF( IA )
*
DO 50 IB = 1, NBET
BETA = BET( IB )
*
* Generate the matrix C.
*
CALL SMAKE(
'GE',
' ',
' ', M, N, C, NMAX, CC,
$ LDC, RESET, ZERO )
*
NC = NC + 1
*
*
Save every datum before calling the
*
subroutine.
*
SIDES = SIDE
UPLOS = UPLO
MS = M
NS = N
ALS = ALPHA
DO 10 I = 1, LAA
AS( I ) = AA( I )
10
CONTINUE
LDAS = LDA
DO 20 I = 1, LBB
BS( I ) = BB( I )
20
CONTINUE
LDBS = LDB
BLS = BETA
DO 30 I = 1, LCC
CS( I ) = CC( I )
30
CONTINUE
LDCS = LDC
*
*
Call the
subroutine.
*
IF( TRACE )
$
WRITE( NTRA,
FMT = 9995 )NC, SNAME, SIDE,
$ UPLO, M, N, ALPHA, LDA, LDB, BETA, LDC
IF( REWI )
$
REWIND NTRA
CALL SSYMM( SIDE, UPLO, M, N, ALPHA, AA, LDA,
$ BB, LDB, BETA, CC, LDC )
*
* Check
if error-exit was taken incorrectly.
*
IF( .NOT.OK )
THEN
WRITE( NOUT,
FMT = 9994 )
FATAL = .
TRUE.
GO TO 110
END IF
*
* See what
data changed inside subroutines.
*
ISAME( 1 ) = SIDES.EQ.SIDE
ISAME( 2 ) = UPLOS.EQ.UPLO
ISAME( 3 ) = MS.EQ.M
ISAME( 4 ) = NS.EQ.N
ISAME( 5 ) = ALS.EQ.ALPHA
ISAME( 6 ) = LSE( AS, AA, LAA )
ISAME( 7 ) = LDAS.EQ.LDA
ISAME( 8 ) = LSE( BS, BB, LBB )
ISAME( 9 ) = LDBS.EQ.LDB
ISAME( 10 ) = BLS.EQ.BETA
IF(
NULL )
THEN
ISAME( 11 ) = LSE( CS, CC, LCC )
ELSE
ISAME( 11 ) = LSERES(
'GE',
' ', M, N, CS,
$ CC, LDC )
END IF
ISAME( 12 ) = LDCS.EQ.LDC
*
*
If data was incorrectly changed, report and
*
return.
*
SAME = .
TRUE.
DO 40 I = 1, NARGS
SAME = SAME.AND.ISAME( I )
IF( .NOT.ISAME( I ) )
$
WRITE( NOUT,
FMT = 9998 )I
40
CONTINUE
IF( .NOT.SAME )
THEN
FATAL = .
TRUE.
GO TO 110
END IF
*
IF( .NOT.
NULL )
THEN
*
* Check the result.
*
IF( LEFT )
THEN
CALL SMMCH(
'N',
'N', M, N, M, ALPHA, A,
$ NMAX, B, NMAX, BETA, C, NMAX,
$ CT, G, CC, LDC, EPS,
ERR,
$ FATAL, NOUT, .
TRUE. )
ELSE
CALL SMMCH(
'N',
'N', M, N, N, ALPHA, B,
$ NMAX, A, NMAX, BETA, C, NMAX,
$ CT, G, CC, LDC, EPS,
ERR,
$ FATAL, NOUT, .
TRUE. )
END IF
ERRMAX = MAX( ERRMAX,
ERR )
*
If got really bad answer, report and
*
return.
IF( FATAL )
$
GO TO 110
END IF
*
50
CONTINUE
*
60
CONTINUE
*
70
CONTINUE
*
80
CONTINUE
*
90
CONTINUE
*
100
CONTINUE
*
* Report result.
*
IF( ERRMAX.LT.THRESH )
THEN
WRITE( NOUT,
FMT = 9999 )SNAME, NC
ELSE
WRITE( NOUT,
FMT = 9997 )SNAME, NC, ERRMAX
END IF
GO TO 120
*
110
CONTINUE
WRITE( NOUT,
FMT = 9996 )SNAME
WRITE( NOUT,
FMT = 9995 )NC, SNAME, SIDE, UPLO, M, N, ALPHA, LDA,
$ LDB, BETA, LDC
*
120
CONTINUE
RETURN
*
9999
FORMAT(
' ', A6,
' PASSED THE COMPUTATIONAL TESTS (', I6,
' CALL',
$
'S)' )
9998
FORMAT(
' ******* FATAL ERROR - PARAMETER NUMBER ', I2,
' WAS CH',
$
'ANGED INCORRECTLY *******' )
9997
FORMAT(
' ', A6,
' COMPLETED THE COMPUTATIONAL TESTS (', I6,
' C',
$
'ALLS)', /
' ******* BUT WITH MAXIMUM TEST RATIO', F8.2,
$
' - SUSPECT *******' )
9996
FORMAT(
' ******* ', A6,
' FAILED ON CALL NUMBER:' )
9995
FORMAT( 1X, I6,
': ', A6,
'(', 2(
'''', A1,
''',' ), 2( I3,
',' ),
$ F4.1,
', A,', I3,
', B,', I3,
',', F4.1,
', C,', I3,
') ',
$
' .' )
9994
FORMAT(
' ******* FATAL ERROR - ERROR-EXIT TAKEN ON VALID CALL *',
$
'******' )
*
*
End of SCHK2.
*
END
SUBROUTINE SCHK3( SNAME, EPS, THRESH, NOUT, NTRA, TRACE, REWI,
$ FATAL, NIDIM, IDIM, NALF, ALF, NMAX, A, AA, AS,
$ B, BB, BS, CT, G, C )
*
* Tests STRMM and STRSM.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Parameters ..
REAL ZERO, ONE
PARAMETER ( ZERO = 0.0, ONE = 1.0 )
* .. Scalar Arguments ..
REAL EPS, THRESH
INTEGER NALF, NIDIM, NMAX, NOUT, NTRA
LOGICAL FATAL, REWI, TRACE
CHARACTER*6 SNAME
* .. Array Arguments ..
REAL A( NMAX, NMAX ), AA( NMAX*NMAX ), ALF( NALF ),
$ AS( NMAX*NMAX ), B( NMAX, NMAX ),
$ BB( NMAX*NMAX ), BS( NMAX*NMAX ),
$ C( NMAX, NMAX ), CT( NMAX ), G( NMAX )
INTEGER IDIM( NIDIM )
* .. Local Scalars ..
REAL ALPHA, ALS,
ERR, ERRMAX
INTEGER I, IA, ICD, ICS, ICT, ICU, IM,
IN, J, LAA, LBB,
$ LDA, LDAS, LDB, LDBS, M, MS, N,
NA, NARGS, NC,
$ NS
LOGICAL LEFT,
NULL, RESET, SAME
CHARACTER*1 DIAG, DIAGS, SIDE, SIDES, TRANAS, TRANSA, UPLO,
$ UPLOS
CHARACTER*2 ICHD, ICHS, ICHU
CHARACTER*3 ICHT
* .. Local Arrays ..
LOGICAL ISAME( 13 )
* ..
External Functions ..
LOGICAL LSE, LSERES
EXTERNAL LSE, LSERES
* ..
External Subroutines ..
EXTERNAL SMAKE, SMMCH, STRMM, STRSM
* ..
Intrinsic Functions ..
INTRINSIC MAX
* .. Scalars
in Common ..
INTEGER INFOT, NOUTC
LOGICAL LERR, OK
* ..
Common blocks ..
COMMON /INFOC/INFOT, NOUTC, OK, LERR
* ..
Data statements ..
DATA ICHU/
'UL'/, ICHT/
'NTC'/, ICHD/
'UN'/, ICHS/
'LR'/
* .. Executable Statements ..
*
NARGS = 11
NC = 0
RESET = .
TRUE.
ERRMAX = ZERO
* Set up zero matrix for SMMCH.
DO 20 J = 1, NMAX
DO 10 I = 1, NMAX
C( I, J ) = ZERO
10
CONTINUE
20
CONTINUE
*
DO 140 IM = 1, NIDIM
M = IDIM( IM )
*
DO 130
IN = 1, NIDIM
N = IDIM(
IN )
* Set LDB
to 1 more than minimum value
if room.
LDB = M
IF( LDB.LT.NMAX )
$ LDB = LDB + 1
* Skip tests
if not enough room.
IF( LDB.GT.NMAX )
$
GO TO 130
LBB = LDB*N
NULL = M.LE.0.OR.N.LE.0
*
DO 120 ICS = 1, 2
SIDE = ICHS( ICS: ICS )
LEFT = SIDE.EQ.
'L'
IF( LEFT )
THEN
NA = M
ELSE
NA = N
END IF
* Set LDA
to 1 more than minimum value
if room.
LDA =
NA
IF( LDA.LT.NMAX )
$ LDA = LDA + 1
* Skip tests
if not enough room.
IF( LDA.GT.NMAX )
$
GO TO 130
LAA = LDA*
NA
*
DO 110 ICU = 1, 2
UPLO = ICHU( ICU: ICU )
*
DO 100 ICT = 1, 3
TRANSA = ICHT( ICT: ICT )
*
DO 90 ICD = 1, 2
DIAG = ICHD( ICD: ICD )
*
DO 80 IA = 1, NALF
ALPHA = ALF( IA )
*
* Generate the matrix A.
*
CALL SMAKE(
'TR', UPLO, DIAG,
NA,
NA, A,
$ NMAX, AA, LDA, RESET, ZERO )
*
* Generate the matrix B.
*
CALL SMAKE(
'GE',
' ',
' ', M, N, B, NMAX,
$ BB, LDB, RESET, ZERO )
*
NC = NC + 1
*
*
Save every datum before calling the
*
subroutine.
*
SIDES = SIDE
UPLOS = UPLO
TRANAS = TRANSA
DIAGS = DIAG
MS = M
NS = N
ALS = ALPHA
DO 30 I = 1, LAA
AS( I ) = AA( I )
30
CONTINUE
LDAS = LDA
DO 40 I = 1, LBB
BS( I ) = BB( I )
40
CONTINUE
LDBS = LDB
*
*
Call the
subroutine.
*
IF( SNAME( 4: 5 ).EQ.
'MM' )
THEN
IF( TRACE )
$
WRITE( NTRA,
FMT = 9995 )NC, SNAME,
$ SIDE, UPLO, TRANSA, DIAG, M, N, ALPHA,
$ LDA, LDB
IF( REWI )
$
REWIND NTRA
CALL STRMM( SIDE, UPLO, TRANSA, DIAG, M,
$ N, ALPHA, AA, LDA, BB, LDB )
ELSE IF( SNAME( 4: 5 ).EQ.
'SM' )
THEN
IF( TRACE )
$
WRITE( NTRA,
FMT = 9995 )NC, SNAME,
$ SIDE, UPLO, TRANSA, DIAG, M, N, ALPHA,
$ LDA, LDB
IF( REWI )
$
REWIND NTRA
CALL STRSM( SIDE, UPLO, TRANSA, DIAG, M,
$ N, ALPHA, AA, LDA, BB, LDB )
END IF
*
* Check
if error-exit was taken incorrectly.
*
IF( .NOT.OK )
THEN
WRITE( NOUT,
FMT = 9994 )
FATAL = .
TRUE.
GO TO 150
END IF
*
* See what
data changed inside subroutines.
*
ISAME( 1 ) = SIDES.EQ.SIDE
ISAME( 2 ) = UPLOS.EQ.UPLO
ISAME( 3 ) = TRANAS.EQ.TRANSA
ISAME( 4 ) = DIAGS.EQ.DIAG
ISAME( 5 ) = MS.EQ.M
ISAME( 6 ) = NS.EQ.N
ISAME( 7 ) = ALS.EQ.ALPHA
ISAME( 8 ) = LSE( AS, AA, LAA )
ISAME( 9 ) = LDAS.EQ.LDA
IF(
NULL )
THEN
ISAME( 10 ) = LSE( BS, BB, LBB )
ELSE
ISAME( 10 ) = LSERES(
'GE',
' ', M, N, BS,
$ BB, LDB )
END IF
ISAME( 11 ) = LDBS.EQ.LDB
*
*
If data was incorrectly changed, report and
*
return.
*
SAME = .
TRUE.
DO 50 I = 1, NARGS
SAME = SAME.AND.ISAME( I )
IF( .NOT.ISAME( I ) )
$
WRITE( NOUT,
FMT = 9998 )I
50
CONTINUE
IF( .NOT.SAME )
THEN
FATAL = .
TRUE.
GO TO 150
END IF
*
IF( .NOT.
NULL )
THEN
IF( SNAME( 4: 5 ).EQ.
'MM' )
THEN
*
* Check the result.
*
IF( LEFT )
THEN
CALL SMMCH( TRANSA,
'N', M, N, M,
$ ALPHA, A, NMAX, B, NMAX,
$ ZERO, C, NMAX, CT, G,
$ BB, LDB, EPS,
ERR,
$ FATAL, NOUT, .
TRUE. )
ELSE
CALL SMMCH(
'N', TRANSA, M, N, N,
$ ALPHA, B, NMAX, A, NMAX,
$ ZERO, C, NMAX, CT, G,
$ BB, LDB, EPS,
ERR,
$ FATAL, NOUT, .
TRUE. )
END IF
ELSE IF( SNAME( 4: 5 ).EQ.
'SM' )
THEN
*
* Compute approximation
to original
* matrix.
*
DO 70 J = 1, N
DO 60 I = 1, M
C( I, J ) = BB( I + ( J - 1 )*
$ LDB )
BB( I + ( J - 1 )*LDB ) = ALPHA*
$ B( I, J )
60
CONTINUE
70
CONTINUE
*
IF( LEFT )
THEN
CALL SMMCH( TRANSA,
'N', M, N, M,
$ ONE, A, NMAX, C, NMAX,
$ ZERO, B, NMAX, CT, G,
$ BB, LDB, EPS,
ERR,
$ FATAL, NOUT, .
FALSE. )
ELSE
CALL SMMCH(
'N', TRANSA, M, N, N,
$ ONE, C, NMAX, A, NMAX,
$ ZERO, B, NMAX, CT, G,
$ BB, LDB, EPS,
ERR,
$ FATAL, NOUT, .
FALSE. )
END IF
END IF
ERRMAX = MAX( ERRMAX,
ERR )
*
If got really bad answer, report and
*
return.
IF( FATAL )
$
GO TO 150
END IF
*
80
CONTINUE
*
90
CONTINUE
*
100
CONTINUE
*
110
CONTINUE
*
120
CONTINUE
*
130
CONTINUE
*
140
CONTINUE
*
* Report result.
*
IF( ERRMAX.LT.THRESH )
THEN
WRITE( NOUT,
FMT = 9999 )SNAME, NC
ELSE
WRITE( NOUT,
FMT = 9997 )SNAME, NC, ERRMAX
END IF
GO TO 160
*
150
CONTINUE
WRITE( NOUT,
FMT = 9996 )SNAME
WRITE( NOUT,
FMT = 9995 )NC, SNAME, SIDE, UPLO, TRANSA, DIAG, M,
$ N, ALPHA, LDA, LDB
*
160
CONTINUE
RETURN
*
9999
FORMAT(
' ', A6,
' PASSED THE COMPUTATIONAL TESTS (', I6,
' CALL',
$
'S)' )
9998
FORMAT(
' ******* FATAL ERROR - PARAMETER NUMBER ', I2,
' WAS CH',
$
'ANGED INCORRECTLY *******' )
9997
FORMAT(
' ', A6,
' COMPLETED THE COMPUTATIONAL TESTS (', I6,
' C',
$
'ALLS)', /
' ******* BUT WITH MAXIMUM TEST RATIO', F8.2,
$
' - SUSPECT *******' )
9996
FORMAT(
' ******* ', A6,
' FAILED ON CALL NUMBER:' )
9995
FORMAT( 1X, I6,
': ', A6,
'(', 4(
'''', A1,
''',' ), 2( I3,
',' ),
$ F4.1,
', A,', I3,
', B,', I3,
') .' )
9994
FORMAT(
' ******* FATAL ERROR - ERROR-EXIT TAKEN ON VALID CALL *',
$
'******' )
*
*
End of SCHK3.
*
END
SUBROUTINE SCHK4( SNAME, EPS, THRESH, NOUT, NTRA, TRACE, REWI,
$ FATAL, NIDIM, IDIM, NALF, ALF, NBET, BET, NMAX,
$ A, AA, AS, B, BB, BS, C, CC, CS, CT, G )
*
* Tests SSYRK.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Parameters ..
REAL ZERO
PARAMETER ( ZERO = 0.0 )
* .. Scalar Arguments ..
REAL EPS, THRESH
INTEGER NALF, NBET, NIDIM, NMAX, NOUT, NTRA
LOGICAL FATAL, REWI, TRACE
CHARACTER*6 SNAME
* .. Array Arguments ..
REAL A( NMAX, NMAX ), AA( NMAX*NMAX ), ALF( NALF ),
$ AS( NMAX*NMAX ), B( NMAX, NMAX ),
$ BB( NMAX*NMAX ), BET( NBET ), BS( NMAX*NMAX ),
$ C( NMAX, NMAX ), CC( NMAX*NMAX ),
$ CS( NMAX*NMAX ), CT( NMAX ), G( NMAX )
INTEGER IDIM( NIDIM )
* .. Local Scalars ..
REAL ALPHA, ALS, BETA, BETS,
ERR, ERRMAX
INTEGER I, IA, IB, ICT, ICU, IK,
IN, J, JC, JJ, K, KS,
$ LAA, LCC, LDA, LDAS, LDC, LDCS, LJ, MA, N,
NA,
$ NARGS, NC, NS
LOGICAL NULL, RESET, SAME, TRAN, UPPER
CHARACTER*1 TRANS, TRANSS, UPLO, UPLOS
CHARACTER*2 ICHU
CHARACTER*3 ICHT
* .. Local Arrays ..
LOGICAL ISAME( 13 )
* ..
External Functions ..
LOGICAL LSE, LSERES
EXTERNAL LSE, LSERES
* ..
External Subroutines ..
EXTERNAL SMAKE, SMMCH, SSYRK
* ..
Intrinsic Functions ..
INTRINSIC MAX
* .. Scalars
in Common ..
INTEGER INFOT, NOUTC
LOGICAL LERR, OK
* ..
Common blocks ..
COMMON /INFOC/INFOT, NOUTC, OK, LERR
* ..
Data statements ..
DATA ICHT/
'NTC'/, ICHU/
'UL'/
* .. Executable Statements ..
*
NARGS = 10
NC = 0
RESET = .
TRUE.
ERRMAX = ZERO
*
DO 100
IN = 1, NIDIM
N = IDIM(
IN )
* Set LDC
to 1 more than minimum value
if room.
LDC = N
IF( LDC.LT.NMAX )
$ LDC = LDC + 1
* Skip tests
if not enough room.
IF( LDC.GT.NMAX )
$
GO TO 100
LCC = LDC*N
NULL = N.LE.0
*
DO 90 IK = 1, NIDIM
K = IDIM( IK )
*
DO 80 ICT = 1, 3
TRANS = ICHT( ICT: ICT )
TRAN = TRANS.EQ.
'T'.OR.TRANS.EQ.
'C'
IF( TRAN )
THEN
MA = K
NA = N
ELSE
MA = N
NA = K
END IF
* Set LDA
to 1 more than minimum value
if room.
LDA = MA
IF( LDA.LT.NMAX )
$ LDA = LDA + 1
* Skip tests
if not enough room.
IF( LDA.GT.NMAX )
$
GO TO 80
LAA = LDA*
NA
*
* Generate the matrix A.
*
CALL SMAKE(
'GE',
' ',
' ', MA,
NA, A, NMAX, AA, LDA,
$ RESET, ZERO )
*
DO 70 ICU = 1, 2
UPLO = ICHU( ICU: ICU )
UPPER = UPLO.EQ.
'U'
*
DO 60 IA = 1, NALF
ALPHA = ALF( IA )
*
DO 50 IB = 1, NBET
BETA = BET( IB )
*
* Generate the matrix C.
*
CALL SMAKE(
'SY', UPLO,
' ', N, N, C, NMAX, CC,
$ LDC, RESET, ZERO )
*
NC = NC + 1
*
*
Save every datum before calling the
subroutine.
*
UPLOS = UPLO
TRANSS = TRANS
NS = N
KS = K
ALS = ALPHA
DO 10 I = 1, LAA
AS( I ) = AA( I )
10
CONTINUE
LDAS = LDA
BETS = BETA
DO 20 I = 1, LCC
CS( I ) = CC( I )
20
CONTINUE
LDCS = LDC
*
*
Call the
subroutine.
*
IF( TRACE )
$
WRITE( NTRA,
FMT = 9994 )NC, SNAME, UPLO,
$ TRANS, N, K, ALPHA, LDA, BETA, LDC
IF( REWI )
$
REWIND NTRA
CALL SSYRK( UPLO, TRANS, N, K, ALPHA, AA, LDA,
$ BETA, CC, LDC )
*
* Check
if error-exit was taken incorrectly.
*
IF( .NOT.OK )
THEN
WRITE( NOUT,
FMT = 9993 )
FATAL = .
TRUE.
GO TO 120
END IF
*
* See what
data changed inside subroutines.
*
ISAME( 1 ) = UPLOS.EQ.UPLO
ISAME( 2 ) = TRANSS.EQ.TRANS
ISAME( 3 ) = NS.EQ.N
ISAME( 4 ) = KS.EQ.K
ISAME( 5 ) = ALS.EQ.ALPHA
ISAME( 6 ) = LSE( AS, AA, LAA )
ISAME( 7 ) = LDAS.EQ.LDA
ISAME( 8 ) = BETS.EQ.BETA
IF(
NULL )
THEN
ISAME( 9 ) = LSE( CS, CC, LCC )
ELSE
ISAME( 9 ) = LSERES(
'SY', UPLO, N, N, CS,
$ CC, LDC )
END IF
ISAME( 10 ) = LDCS.EQ.LDC
*
*
If data was incorrectly changed, report and
*
return.
*
SAME = .
TRUE.
DO 30 I = 1, NARGS
SAME = SAME.AND.ISAME( I )
IF( .NOT.ISAME( I ) )
$
WRITE( NOUT,
FMT = 9998 )I
30
CONTINUE
IF( .NOT.SAME )
THEN
FATAL = .
TRUE.
GO TO 120
END IF
*
IF( .NOT.
NULL )
THEN
*
* Check the result column by column.
*
JC = 1
DO 40 J = 1, N
IF( UPPER )
THEN
JJ = 1
LJ = J
ELSE
JJ = J
LJ = N - J + 1
END IF
IF( TRAN )
THEN
CALL SMMCH(
'T',
'N', LJ, 1, K, ALPHA,
$ A( 1, JJ ), NMAX,
$ A( 1, J ), NMAX, BETA,
$ C( JJ, J ), NMAX, CT, G,
$ CC( JC ), LDC, EPS,
ERR,
$ FATAL, NOUT, .
TRUE. )
ELSE
CALL SMMCH(
'N',
'T', LJ, 1, K, ALPHA,
$ A( JJ, 1 ), NMAX,
$ A( J, 1 ), NMAX, BETA,
$ C( JJ, J ), NMAX, CT, G,
$ CC( JC ), LDC, EPS,
ERR,
$ FATAL, NOUT, .
TRUE. )
END IF
IF( UPPER )
THEN
JC = JC + LDC
ELSE
JC = JC + LDC + 1
END IF
ERRMAX = MAX( ERRMAX,
ERR )
*
If got really bad answer, report and
*
return.
IF( FATAL )
$
GO TO 110
40
CONTINUE
END IF
*
50
CONTINUE
*
60
CONTINUE
*
70
CONTINUE
*
80
CONTINUE
*
90
CONTINUE
*
100
CONTINUE
*
* Report result.
*
IF( ERRMAX.LT.THRESH )
THEN
WRITE( NOUT,
FMT = 9999 )SNAME, NC
ELSE
WRITE( NOUT,
FMT = 9997 )SNAME, NC, ERRMAX
END IF
GO TO 130
*
110
CONTINUE
IF( N.GT.1 )
$
WRITE( NOUT,
FMT = 9995 )J
*
120
CONTINUE
WRITE( NOUT,
FMT = 9996 )SNAME
WRITE( NOUT,
FMT = 9994 )NC, SNAME, UPLO, TRANS, N, K, ALPHA,
$ LDA, BETA, LDC
*
130
CONTINUE
RETURN
*
9999
FORMAT(
' ', A6,
' PASSED THE COMPUTATIONAL TESTS (', I6,
' CALL',
$
'S)' )
9998
FORMAT(
' ******* FATAL ERROR - PARAMETER NUMBER ', I2,
' WAS CH',
$
'ANGED INCORRECTLY *******' )
9997
FORMAT(
' ', A6,
' COMPLETED THE COMPUTATIONAL TESTS (', I6,
' C',
$
'ALLS)', /
' ******* BUT WITH MAXIMUM TEST RATIO', F8.2,
$
' - SUSPECT *******' )
9996
FORMAT(
' ******* ', A6,
' FAILED ON CALL NUMBER:' )
9995
FORMAT(
' THESE ARE THE RESULTS FOR COLUMN ', I3 )
9994
FORMAT( 1X, I6,
': ', A6,
'(', 2(
'''', A1,
''',' ), 2( I3,
',' ),
$ F4.1,
', A,', I3,
',', F4.1,
', C,', I3,
') .' )
9993
FORMAT(
' ******* FATAL ERROR - ERROR-EXIT TAKEN ON VALID CALL *',
$
'******' )
*
*
End of SCHK4.
*
END
SUBROUTINE SCHK5( SNAME, EPS, THRESH, NOUT, NTRA, TRACE, REWI,
$ FATAL, NIDIM, IDIM, NALF, ALF, NBET, BET, NMAX,
$ AB, AA, AS, BB, BS, C, CC, CS, CT, G, W )
*
* Tests SSYR2K.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Parameters ..
REAL ZERO
PARAMETER ( ZERO = 0.0 )
* .. Scalar Arguments ..
REAL EPS, THRESH
INTEGER NALF, NBET, NIDIM, NMAX, NOUT, NTRA
LOGICAL FATAL, REWI, TRACE
CHARACTER*6 SNAME
* .. Array Arguments ..
REAL AA( NMAX*NMAX ), AB( 2*NMAX*NMAX ),
$ ALF( NALF ), AS( NMAX*NMAX ), BB( NMAX*NMAX ),
$ BET( NBET ), BS( NMAX*NMAX ), C( NMAX, NMAX ),
$ CC( NMAX*NMAX ), CS( NMAX*NMAX ), CT( NMAX ),
$ G( NMAX ), W( 2*NMAX )
INTEGER IDIM( NIDIM )
* .. Local Scalars ..
REAL ALPHA, ALS, BETA, BETS,
ERR, ERRMAX
INTEGER I, IA, IB, ICT, ICU, IK,
IN, J, JC, JJ, JJAB,
$ K, KS, LAA, LBB, LCC, LDA, LDAS, LDB, LDBS,
$ LDC, LDCS, LJ, MA, N,
NA, NARGS, NC, NS
LOGICAL NULL, RESET, SAME, TRAN, UPPER
CHARACTER*1 TRANS, TRANSS, UPLO, UPLOS
CHARACTER*2 ICHU
CHARACTER*3 ICHT
* .. Local Arrays ..
LOGICAL ISAME( 13 )
* ..
External Functions ..
LOGICAL LSE, LSERES
EXTERNAL LSE, LSERES
* ..
External Subroutines ..
EXTERNAL SMAKE, SMMCH, SSYR2K
* ..
Intrinsic Functions ..
INTRINSIC MAX
* .. Scalars
in Common ..
INTEGER INFOT, NOUTC
LOGICAL LERR, OK
* ..
Common blocks ..
COMMON /INFOC/INFOT, NOUTC, OK, LERR
* ..
Data statements ..
DATA ICHT/
'NTC'/, ICHU/
'UL'/
* .. Executable Statements ..
*
NARGS = 12
NC = 0
RESET = .
TRUE.
ERRMAX = ZERO
*
DO 130
IN = 1, NIDIM
N = IDIM(
IN )
* Set LDC
to 1 more than minimum value
if room.
LDC = N
IF( LDC.LT.NMAX )
$ LDC = LDC + 1
* Skip tests
if not enough room.
IF( LDC.GT.NMAX )
$
GO TO 130
LCC = LDC*N
NULL = N.LE.0
*
DO 120 IK = 1, NIDIM
K = IDIM( IK )
*
DO 110 ICT = 1, 3
TRANS = ICHT( ICT: ICT )
TRAN = TRANS.EQ.
'T'.OR.TRANS.EQ.
'C'
IF( TRAN )
THEN
MA = K
NA = N
ELSE
MA = N
NA = K
END IF
* Set LDA
to 1 more than minimum value
if room.
LDA = MA
IF( LDA.LT.NMAX )
$ LDA = LDA + 1
* Skip tests
if not enough room.
IF( LDA.GT.NMAX )
$
GO TO 110
LAA = LDA*
NA
*
* Generate the matrix A.
*
IF( TRAN )
THEN
CALL SMAKE(
'GE',
' ',
' ', MA,
NA, AB, 2*NMAX, AA,
$ LDA, RESET, ZERO )
ELSE
CALL SMAKE(
'GE',
' ',
' ', MA,
NA, AB, NMAX, AA, LDA,
$ RESET, ZERO )
END IF
*
* Generate the matrix B.
*
LDB = LDA
LBB = LAA
IF( TRAN )
THEN
CALL SMAKE(
'GE',
' ',
' ', MA,
NA, AB( K + 1 ),
$ 2*NMAX, BB, LDB, RESET, ZERO )
ELSE
CALL SMAKE(
'GE',
' ',
' ', MA,
NA, AB( K*NMAX + 1 ),
$ NMAX, BB, LDB, RESET, ZERO )
END IF
*
DO 100 ICU = 1, 2
UPLO = ICHU( ICU: ICU )
UPPER = UPLO.EQ.
'U'
*
DO 90 IA = 1, NALF
ALPHA = ALF( IA )
*
DO 80 IB = 1, NBET
BETA = BET( IB )
*
* Generate the matrix C.
*
CALL SMAKE(
'SY', UPLO,
' ', N, N, C, NMAX, CC,
$ LDC, RESET, ZERO )
*
NC = NC + 1
*
*
Save every datum before calling the
subroutine.
*
UPLOS = UPLO
TRANSS = TRANS
NS = N
KS = K
ALS = ALPHA
DO 10 I = 1, LAA
AS( I ) = AA( I )
10
CONTINUE
LDAS = LDA
DO 20 I = 1, LBB
BS( I ) = BB( I )
20
CONTINUE
LDBS = LDB
BETS = BETA
DO 30 I = 1, LCC
CS( I ) = CC( I )
30
CONTINUE
LDCS = LDC
*
*
Call the
subroutine.
*
IF( TRACE )
$
WRITE( NTRA,
FMT = 9994 )NC, SNAME, UPLO,
$ TRANS, N, K, ALPHA, LDA, LDB, BETA, LDC
IF( REWI )
$
REWIND NTRA
CALL SSYR2K( UPLO, TRANS, N, K, ALPHA, AA, LDA,
$ BB, LDB, BETA, CC, LDC )
*
* Check
if error-exit was taken incorrectly.
*
IF( .NOT.OK )
THEN
WRITE( NOUT,
FMT = 9993 )
FATAL = .
TRUE.
GO TO 150
END IF
*
* See what
data changed inside subroutines.
*
ISAME( 1 ) = UPLOS.EQ.UPLO
ISAME( 2 ) = TRANSS.EQ.TRANS
ISAME( 3 ) = NS.EQ.N
ISAME( 4 ) = KS.EQ.K
ISAME( 5 ) = ALS.EQ.ALPHA
ISAME( 6 ) = LSE( AS, AA, LAA )
ISAME( 7 ) = LDAS.EQ.LDA
ISAME( 8 ) = LSE( BS, BB, LBB )
ISAME( 9 ) = LDBS.EQ.LDB
ISAME( 10 ) = BETS.EQ.BETA
IF(
NULL )
THEN
ISAME( 11 ) = LSE( CS, CC, LCC )
ELSE
ISAME( 11 ) = LSERES(
'SY', UPLO, N, N, CS,
$ CC, LDC )
END IF
ISAME( 12 ) = LDCS.EQ.LDC
*
*
If data was incorrectly changed, report and
*
return.
*
SAME = .
TRUE.
DO 40 I = 1, NARGS
SAME = SAME.AND.ISAME( I )
IF( .NOT.ISAME( I ) )
$
WRITE( NOUT,
FMT = 9998 )I
40
CONTINUE
IF( .NOT.SAME )
THEN
FATAL = .
TRUE.
GO TO 150
END IF
*
IF( .NOT.
NULL )
THEN
*
* Check the result column by column.
*
JJAB = 1
JC = 1
DO 70 J = 1, N
IF( UPPER )
THEN
JJ = 1
LJ = J
ELSE
JJ = J
LJ = N - J + 1
END IF
IF( TRAN )
THEN
DO 50 I = 1, K
W( I ) = AB( ( J - 1 )*2*NMAX + K +
$ I )
W( K + I ) = AB( ( J - 1 )*2*NMAX +
$ I )
50
CONTINUE
CALL SMMCH(
'T',
'N', LJ, 1, 2*K,
$ ALPHA, AB( JJAB ), 2*NMAX,
$ W, 2*NMAX, BETA,
$ C( JJ, J ), NMAX, CT, G,
$ CC( JC ), LDC, EPS,
ERR,
$ FATAL, NOUT, .
TRUE. )
ELSE
DO 60 I = 1, K
W( I ) = AB( ( K + I - 1 )*NMAX +
$ J )
W( K + I ) = AB( ( I - 1 )*NMAX +
$ J )
60
CONTINUE
CALL SMMCH(
'N',
'N', LJ, 1, 2*K,
$ ALPHA, AB( JJ ), NMAX, W,
$ 2*NMAX, BETA, C( JJ, J ),
$ NMAX, CT, G, CC( JC ), LDC,
$ EPS,
ERR, FATAL, NOUT,
$ .
TRUE. )
END IF
IF( UPPER )
THEN
JC = JC + LDC
ELSE
JC = JC + LDC + 1
IF( TRAN )
$ JJAB = JJAB + 2*NMAX
END IF
ERRMAX = MAX( ERRMAX,
ERR )
*
If got really bad answer, report and
*
return.
IF( FATAL )
$
GO TO 140
70
CONTINUE
END IF
*
80
CONTINUE
*
90
CONTINUE
*
100
CONTINUE
*
110
CONTINUE
*
120
CONTINUE
*
130
CONTINUE
*
* Report result.
*
IF( ERRMAX.LT.THRESH )
THEN
WRITE( NOUT,
FMT = 9999 )SNAME, NC
ELSE
WRITE( NOUT,
FMT = 9997 )SNAME, NC, ERRMAX
END IF
GO TO 160
*
140
CONTINUE
IF( N.GT.1 )
$
WRITE( NOUT,
FMT = 9995 )J
*
150
CONTINUE
WRITE( NOUT,
FMT = 9996 )SNAME
WRITE( NOUT,
FMT = 9994 )NC, SNAME, UPLO, TRANS, N, K, ALPHA,
$ LDA, LDB, BETA, LDC
*
160
CONTINUE
RETURN
*
9999
FORMAT(
' ', A6,
' PASSED THE COMPUTATIONAL TESTS (', I6,
' CALL',
$
'S)' )
9998
FORMAT(
' ******* FATAL ERROR - PARAMETER NUMBER ', I2,
' WAS CH',
$
'ANGED INCORRECTLY *******' )
9997
FORMAT(
' ', A6,
' COMPLETED THE COMPUTATIONAL TESTS (', I6,
' C',
$
'ALLS)', /
' ******* BUT WITH MAXIMUM TEST RATIO', F8.2,
$
' - SUSPECT *******' )
9996
FORMAT(
' ******* ', A6,
' FAILED ON CALL NUMBER:' )
9995
FORMAT(
' THESE ARE THE RESULTS FOR COLUMN ', I3 )
9994
FORMAT( 1X, I6,
': ', A6,
'(', 2(
'''', A1,
''',' ), 2( I3,
',' ),
$ F4.1,
', A,', I3,
', B,', I3,
',', F4.1,
', C,', I3,
') ',
$
' .' )
9993
FORMAT(
' ******* FATAL ERROR - ERROR-EXIT TAKEN ON VALID CALL *',
$
'******' )
*
*
End of SCHK5.
*
END
SUBROUTINE SCHKE( ISNUM, SRNAMT, NOUT )
*
* Tests the error exits from the Level 3 Blas.
* Requires a special version of the error-handling routine XERBLA.
* A, B and C should not need
to be defined.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* 3-19-92: Initialize ALPHA and BETA (eca)
* 3-19-92: Fix argument 12
in calls
to SSYMM with INFOT = 9 (eca)
*
* .. Scalar Arguments ..
INTEGER ISNUM, NOUT
CHARACTER*6 SRNAMT
* .. Scalars
in Common ..
INTEGER INFOT, NOUTC
LOGICAL LERR, OK
* .. Parameters ..
REAL ONE, TWO
PARAMETER ( ONE = 1.0E0, TWO = 2.0E0 )
* .. Local Scalars ..
REAL ALPHA, BETA
* .. Local Arrays ..
REAL A( 2, 1 ), B( 2, 1 ), C( 2, 1 )
* ..
External Subroutines ..
EXTERNAL CHKXER, SGEMM, SSYMM, SSYR2K, SSYRK, STRMM,
$ STRSM
* ..
Common blocks ..
COMMON /INFOC/INFOT, NOUTC, OK, LERR
* .. Executable Statements ..
* OK is set
to .
FALSE. by the special version of XERBLA or by CHKXER
*
if anything is wrong.
OK = .
TRUE.
* LERR is set
to .
TRUE. by the special version of XERBLA each time
* it is called, and is
then tested and re-set by CHKXER.
LERR = .
FALSE.
*
* Initialize ALPHA and BETA.
*
ALPHA = ONE
BETA = TWO
*
GO TO ( 10, 20, 30, 40, 50, 60 )ISNUM
10 INFOT = 1
CALL SGEMM(
'/',
'N', 0, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 1
CALL SGEMM(
'/',
'T', 0, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 2
CALL SGEMM(
'N',
'/', 0, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 2
CALL SGEMM(
'T',
'/', 0, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SGEMM(
'N',
'N', -1, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SGEMM(
'N',
'T', -1, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SGEMM(
'T',
'N', -1, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SGEMM(
'T',
'T', -1, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SGEMM(
'N',
'N', 0, -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SGEMM(
'N',
'T', 0, -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SGEMM(
'T',
'N', 0, -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SGEMM(
'T',
'T', 0, -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL SGEMM(
'N',
'N', 0, 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL SGEMM(
'N',
'T', 0, 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL SGEMM(
'T',
'N', 0, 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL SGEMM(
'T',
'T', 0, 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 8
CALL SGEMM(
'N',
'N', 2, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 8
CALL SGEMM(
'N',
'T', 2, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 8
CALL SGEMM(
'T',
'N', 0, 0, 2, ALPHA, A, 1, B, 2, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 8
CALL SGEMM(
'T',
'T', 0, 0, 2, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 10
CALL SGEMM(
'N',
'N', 0, 0, 2, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 10
CALL SGEMM(
'T',
'N', 0, 0, 2, ALPHA, A, 2, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 10
CALL SGEMM(
'N',
'T', 0, 2, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 10
CALL SGEMM(
'T',
'T', 0, 2, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 13
CALL SGEMM(
'N',
'N', 2, 0, 0, ALPHA, A, 2, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 13
CALL SGEMM(
'N',
'T', 2, 0, 0, ALPHA, A, 2, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 13
CALL SGEMM(
'T',
'N', 2, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 13
CALL SGEMM(
'T',
'T', 2, 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
GO TO 70
20 INFOT = 1
CALL SSYMM(
'/',
'U', 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 2
CALL SSYMM(
'L',
'/', 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYMM(
'L',
'U', -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYMM(
'R',
'U', -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYMM(
'L',
'L', -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYMM(
'R',
'L', -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYMM(
'L',
'U', 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYMM(
'R',
'U', 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYMM(
'L',
'L', 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYMM(
'R',
'L', 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYMM(
'L',
'U', 2, 0, ALPHA, A, 1, B, 2, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYMM(
'R',
'U', 0, 2, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYMM(
'L',
'L', 2, 0, ALPHA, A, 1, B, 2, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYMM(
'R',
'L', 0, 2, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL SSYMM(
'L',
'U', 2, 0, ALPHA, A, 2, B, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL SSYMM(
'R',
'U', 2, 0, ALPHA, A, 1, B, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL SSYMM(
'L',
'L', 2, 0, ALPHA, A, 2, B, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL SSYMM(
'R',
'L', 2, 0, ALPHA, A, 1, B, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 12
CALL SSYMM(
'L',
'U', 2, 0, ALPHA, A, 2, B, 2, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 12
CALL SSYMM(
'R',
'U', 2, 0, ALPHA, A, 1, B, 2, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 12
CALL SSYMM(
'L',
'L', 2, 0, ALPHA, A, 2, B, 2, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 12
CALL SSYMM(
'R',
'L', 2, 0, ALPHA, A, 1, B, 2, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
GO TO 70
30 INFOT = 1
CALL STRMM(
'/',
'U',
'N',
'N', 0, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 2
CALL STRMM(
'L',
'/',
'N',
'N', 0, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL STRMM(
'L',
'U',
'/',
'N', 0, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL STRMM(
'L',
'U',
'N',
'/', 0, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRMM(
'L',
'U',
'N',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRMM(
'L',
'U',
'T',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRMM(
'R',
'U',
'N',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRMM(
'R',
'U',
'T',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRMM(
'L',
'L',
'N',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRMM(
'L',
'L',
'T',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRMM(
'R',
'L',
'N',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRMM(
'R',
'L',
'T',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRMM(
'L',
'U',
'N',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRMM(
'L',
'U',
'T',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRMM(
'R',
'U',
'N',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRMM(
'R',
'U',
'T',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRMM(
'L',
'L',
'N',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRMM(
'L',
'L',
'T',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRMM(
'R',
'L',
'N',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRMM(
'R',
'L',
'T',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRMM(
'L',
'U',
'N',
'N', 2, 0, ALPHA, A, 1, B, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRMM(
'L',
'U',
'T',
'N', 2, 0, ALPHA, A, 1, B, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRMM(
'R',
'U',
'N',
'N', 0, 2, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRMM(
'R',
'U',
'T',
'N', 0, 2, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRMM(
'L',
'L',
'N',
'N', 2, 0, ALPHA, A, 1, B, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRMM(
'L',
'L',
'T',
'N', 2, 0, ALPHA, A, 1, B, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRMM(
'R',
'L',
'N',
'N', 0, 2, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRMM(
'R',
'L',
'T',
'N', 0, 2, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRMM(
'L',
'U',
'N',
'N', 2, 0, ALPHA, A, 2, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRMM(
'L',
'U',
'T',
'N', 2, 0, ALPHA, A, 2, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRMM(
'R',
'U',
'N',
'N', 2, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRMM(
'R',
'U',
'T',
'N', 2, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRMM(
'L',
'L',
'N',
'N', 2, 0, ALPHA, A, 2, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRMM(
'L',
'L',
'T',
'N', 2, 0, ALPHA, A, 2, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRMM(
'R',
'L',
'N',
'N', 2, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRMM(
'R',
'L',
'T',
'N', 2, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
GO TO 70
40 INFOT = 1
CALL STRSM(
'/',
'U',
'N',
'N', 0, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 2
CALL STRSM(
'L',
'/',
'N',
'N', 0, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL STRSM(
'L',
'U',
'/',
'N', 0, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL STRSM(
'L',
'U',
'N',
'/', 0, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRSM(
'L',
'U',
'N',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRSM(
'L',
'U',
'T',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRSM(
'R',
'U',
'N',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRSM(
'R',
'U',
'T',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRSM(
'L',
'L',
'N',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRSM(
'L',
'L',
'T',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRSM(
'R',
'L',
'N',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 5
CALL STRSM(
'R',
'L',
'T',
'N', -1, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRSM(
'L',
'U',
'N',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRSM(
'L',
'U',
'T',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRSM(
'R',
'U',
'N',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRSM(
'R',
'U',
'T',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRSM(
'L',
'L',
'N',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRSM(
'L',
'L',
'T',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRSM(
'R',
'L',
'N',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 6
CALL STRSM(
'R',
'L',
'T',
'N', 0, -1, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRSM(
'L',
'U',
'N',
'N', 2, 0, ALPHA, A, 1, B, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRSM(
'L',
'U',
'T',
'N', 2, 0, ALPHA, A, 1, B, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRSM(
'R',
'U',
'N',
'N', 0, 2, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRSM(
'R',
'U',
'T',
'N', 0, 2, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRSM(
'L',
'L',
'N',
'N', 2, 0, ALPHA, A, 1, B, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRSM(
'L',
'L',
'T',
'N', 2, 0, ALPHA, A, 1, B, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRSM(
'R',
'L',
'N',
'N', 0, 2, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL STRSM(
'R',
'L',
'T',
'N', 0, 2, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRSM(
'L',
'U',
'N',
'N', 2, 0, ALPHA, A, 2, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRSM(
'L',
'U',
'T',
'N', 2, 0, ALPHA, A, 2, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRSM(
'R',
'U',
'N',
'N', 2, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRSM(
'R',
'U',
'T',
'N', 2, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRSM(
'L',
'L',
'N',
'N', 2, 0, ALPHA, A, 2, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRSM(
'L',
'L',
'T',
'N', 2, 0, ALPHA, A, 2, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRSM(
'R',
'L',
'N',
'N', 2, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 11
CALL STRSM(
'R',
'L',
'T',
'N', 2, 0, ALPHA, A, 1, B, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
GO TO 70
50 INFOT = 1
CALL SSYRK(
'/',
'N', 0, 0, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 2
CALL SSYRK(
'U',
'/', 0, 0, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYRK(
'U',
'N', -1, 0, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYRK(
'U',
'T', -1, 0, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYRK(
'L',
'N', -1, 0, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYRK(
'L',
'T', -1, 0, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYRK(
'U',
'N', 0, -1, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYRK(
'U',
'T', 0, -1, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYRK(
'L',
'N', 0, -1, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYRK(
'L',
'T', 0, -1, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYRK(
'U',
'N', 2, 0, ALPHA, A, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYRK(
'U',
'T', 0, 2, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYRK(
'L',
'N', 2, 0, ALPHA, A, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYRK(
'L',
'T', 0, 2, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 10
CALL SSYRK(
'U',
'N', 2, 0, ALPHA, A, 2, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 10
CALL SSYRK(
'U',
'T', 2, 0, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 10
CALL SSYRK(
'L',
'N', 2, 0, ALPHA, A, 2, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 10
CALL SSYRK(
'L',
'T', 2, 0, ALPHA, A, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
GO TO 70
60 INFOT = 1
CALL SSYR2K(
'/',
'N', 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 2
CALL SSYR2K(
'U',
'/', 0, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYR2K(
'U',
'N', -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYR2K(
'U',
'T', -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYR2K(
'L',
'N', -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 3
CALL SSYR2K(
'L',
'T', -1, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYR2K(
'U',
'N', 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYR2K(
'U',
'T', 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYR2K(
'L',
'N', 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 4
CALL SSYR2K(
'L',
'T', 0, -1, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYR2K(
'U',
'N', 2, 0, ALPHA, A, 1, B, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYR2K(
'U',
'T', 0, 2, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYR2K(
'L',
'N', 2, 0, ALPHA, A, 1, B, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 7
CALL SSYR2K(
'L',
'T', 0, 2, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL SSYR2K(
'U',
'N', 2, 0, ALPHA, A, 2, B, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL SSYR2K(
'U',
'T', 0, 2, ALPHA, A, 2, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL SSYR2K(
'L',
'N', 2, 0, ALPHA, A, 2, B, 1, BETA, C, 2 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 9
CALL SSYR2K(
'L',
'T', 0, 2, ALPHA, A, 2, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 12
CALL SSYR2K(
'U',
'N', 2, 0, ALPHA, A, 2, B, 2, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 12
CALL SSYR2K(
'U',
'T', 2, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 12
CALL SSYR2K(
'L',
'N', 2, 0, ALPHA, A, 2, B, 2, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
INFOT = 12
CALL SSYR2K(
'L',
'T', 2, 0, ALPHA, A, 1, B, 1, BETA, C, 1 )
CALL CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
*
70
IF( OK )
THEN
WRITE( NOUT,
FMT = 9999 )SRNAMT
ELSE
WRITE( NOUT,
FMT = 9998 )SRNAMT
END IF
RETURN
*
9999
FORMAT(
' ', A6,
' PASSED THE TESTS OF ERROR-EXITS' )
9998
FORMAT(
' ******* ', A6,
' FAILED THE TESTS OF ERROR-EXITS *****',
$
'**' )
*
*
End of SCHKE.
*
END
SUBROUTINE SMAKE(
TYPE, UPLO, DIAG, M, N, A, NMAX, AA, LDA, RESET,
$ TRANSL )
*
* Generates values for an M by N matrix A.
* Stores the values
in the array AA
in the
data structure required
* by the routine, with unwanted elements set
to rogue value.
*
*
TYPE is
'GE',
'SY' or
'TR'.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Parameters ..
REAL ZERO, ONE
PARAMETER ( ZERO = 0.0, ONE = 1.0 )
REAL ROGUE
PARAMETER ( ROGUE = -1.0E10 )
* .. Scalar Arguments ..
REAL TRANSL
INTEGER LDA, M, N, NMAX
LOGICAL RESET
CHARACTER*1 DIAG, UPLO
CHARACTER*2
TYPE
* .. Array Arguments ..
REAL A( NMAX, * ), AA( * )
* .. Local Scalars ..
INTEGER I, IBEG, IEND, J
LOGICAL GEN, LOWER, SYM, TRI,
UNIT, UPPER
* ..
External Functions ..
REAL SBEG
EXTERNAL SBEG
* .. Executable Statements ..
GEN =
TYPE.EQ.
'GE'
SYM =
TYPE.EQ.
'SY'
TRI =
TYPE.EQ.
'TR'
UPPER = ( SYM.OR.TRI ).AND.UPLO.EQ.
'U'
LOWER = ( SYM.OR.TRI ).AND.UPLO.EQ.
'L'
UNIT = TRI.AND.DIAG.EQ.
'U'
*
* Generate
data in array A.
*
DO 20 J = 1, N
DO 10 I = 1, M
IF( GEN.OR.( UPPER.AND.I.LE.J ).OR.( LOWER.AND.I.GE.J ) )
$
THEN
A( I, J ) = SBEG( RESET ) + TRANSL
IF( I.NE.J )
THEN
* Set some elements
to zero
IF( N.GT.3.AND.J.EQ.N/2 )
$ A( I, J ) = ZERO
IF( SYM )
THEN
A( J, I ) = A( I, J )
ELSE IF( TRI )
THEN
A( J, I ) = ZERO
END IF
END IF
END IF
10
CONTINUE
IF( TRI )
$ A( J, J ) = A( J, J ) + ONE
IF(
UNIT )
$ A( J, J ) = ONE
20
CONTINUE
*
* Store elements
in array AS
in data structure required by routine.
*
IF(
TYPE.EQ.
'GE' )
THEN
DO 50 J = 1, N
DO 30 I = 1, M
AA( I + ( J - 1 )*LDA ) = A( I, J )
30
CONTINUE
DO 40 I = M + 1, LDA
AA( I + ( J - 1 )*LDA ) = ROGUE
40
CONTINUE
50
CONTINUE
ELSE IF(
TYPE.EQ.
'SY'.OR.
TYPE.EQ.
'TR' )
THEN
DO 90 J = 1, N
IF( UPPER )
THEN
IBEG = 1
IF(
UNIT )
THEN
IEND = J - 1
ELSE
IEND = J
END IF
ELSE
IF(
UNIT )
THEN
IBEG = J + 1
ELSE
IBEG = J
END IF
IEND = N
END IF
DO 60 I = 1, IBEG - 1
AA( I + ( J - 1 )*LDA ) = ROGUE
60
CONTINUE
DO 70 I = IBEG, IEND
AA( I + ( J - 1 )*LDA ) = A( I, J )
70
CONTINUE
DO 80 I = IEND + 1, LDA
AA( I + ( J - 1 )*LDA ) = ROGUE
80
CONTINUE
90
CONTINUE
END IF
RETURN
*
*
End of SMAKE.
*
END
SUBROUTINE SMMCH( TRANSA, TRANSB, M, N, KK, ALPHA, A, LDA, B, LDB,
$ BETA, C, LDC, CT, G, CC, LDCC, EPS,
ERR, FATAL,
$ NOUT, MV )
*
* Checks the results of the computational tests.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Parameters ..
REAL ZERO, ONE
PARAMETER ( ZERO = 0.0, ONE = 1.0 )
* .. Scalar Arguments ..
REAL ALPHA, BETA, EPS,
ERR
INTEGER KK, LDA, LDB, LDC, LDCC, M, N, NOUT
LOGICAL FATAL, MV
CHARACTER*1 TRANSA, TRANSB
* .. Array Arguments ..
REAL A( LDA, * ), B( LDB, * ), C( LDC, * ),
$ CC( LDCC, * ), CT( * ), G( * )
* .. Local Scalars ..
REAL ERRI
INTEGER I, J, K
LOGICAL TRANA, TRANB
* ..
Intrinsic Functions ..
INTRINSIC ABS, MAX, SQRT
* .. Executable Statements ..
TRANA = TRANSA.EQ.
'T'.OR.TRANSA.EQ.
'C'
TRANB = TRANSB.EQ.
'T'.OR.TRANSB.EQ.
'C'
*
* Compute expected result, one column at a time,
in CT using
data
*
in A, B and C.
* Compute gauges
in G.
*
DO 120 J = 1, N
*
DO 10 I = 1, M
CT( I ) = ZERO
G( I ) = ZERO
10
CONTINUE
IF( .NOT.TRANA.AND..NOT.TRANB )
THEN
DO 30 K = 1, KK
DO 20 I = 1, M
CT( I ) = CT( I ) + A( I, K )*B( K, J )
G( I ) = G( I ) + ABS( A( I, K ) )*ABS( B( K, J ) )
20
CONTINUE
30
CONTINUE
ELSE IF( TRANA.AND..NOT.TRANB )
THEN
DO 50 K = 1, KK
DO 40 I = 1, M
CT( I ) = CT( I ) + A( K, I )*B( K, J )
G( I ) = G( I ) + ABS( A( K, I ) )*ABS( B( K, J ) )
40
CONTINUE
50
CONTINUE
ELSE IF( .NOT.TRANA.AND.TRANB )
THEN
DO 70 K = 1, KK
DO 60 I = 1, M
CT( I ) = CT( I ) + A( I, K )*B( J, K )
G( I ) = G( I ) + ABS( A( I, K ) )*ABS( B( J, K ) )
60
CONTINUE
70
CONTINUE
ELSE IF( TRANA.AND.TRANB )
THEN
DO 90 K = 1, KK
DO 80 I = 1, M
CT( I ) = CT( I ) + A( K, I )*B( J, K )
G( I ) = G( I ) + ABS( A( K, I ) )*ABS( B( J, K ) )
80
CONTINUE
90
CONTINUE
END IF
DO 100 I = 1, M
CT( I ) = ALPHA*CT( I ) + BETA*C( I, J )
G( I ) = ABS( ALPHA )*G( I ) + ABS( BETA )*ABS( C( I, J ) )
100
CONTINUE
*
* Compute the error ratio for this result.
*
ERR = ZERO
DO 110 I = 1, M
ERRI = ABS( CT( I ) - CC( I, J ) )/EPS
IF( G( I ).NE.ZERO )
$ ERRI = ERRI/G( I )
ERR = MAX(
ERR, ERRI )
IF(
ERR*SQRT( EPS ).GE.ONE )
$
GO TO 130
110
CONTINUE
*
120
CONTINUE
*
*
If the loop completes, all results are at least half accurate.
GO TO 150
*
* Report fatal error.
*
130 FATAL = .
TRUE.
WRITE( NOUT,
FMT = 9999 )
DO 140 I = 1, M
IF( MV )
THEN
WRITE( NOUT,
FMT = 9998 )I, CT( I ), CC( I, J )
ELSE
WRITE( NOUT,
FMT = 9998 )I, CC( I, J ), CT( I )
END IF
140
CONTINUE
IF( N.GT.1 )
$
WRITE( NOUT,
FMT = 9997 )J
*
150
CONTINUE
RETURN
*
9999
FORMAT(
' ******* FATAL ERROR - COMPUTED RESULT IS LESS THAN HAL',
$
'F ACCURATE *******', /
' EXPECTED RESULT COMPU',
$
'TED RESULT' )
9998
FORMAT( 1X, I7, 2G18.6 )
9997
FORMAT(
' THESE ARE THE RESULTS FOR COLUMN ', I3 )
*
*
End of SMMCH.
*
END
LOGICAL FUNCTION LSE( RI, RJ, LR )
*
* Tests
if two arrays are identical.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Scalar Arguments ..
INTEGER LR
* .. Array Arguments ..
REAL RI( * ), RJ( * )
* .. Local Scalars ..
INTEGER I
* .. Executable Statements ..
DO 10 I = 1, LR
IF( RI( I ).NE.RJ( I ) )
$
GO TO 20
10
CONTINUE
LSE = .
TRUE.
GO TO 30
20
CONTINUE
LSE = .
FALSE.
30
RETURN
*
*
End of LSE.
*
END
LOGICAL FUNCTION LSERES(
TYPE, UPLO, M, N, AA, AS, LDA )
*
* Tests
if selected elements
in two arrays are equal.
*
*
TYPE is
'GE' or
'SY'.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Scalar Arguments ..
INTEGER LDA, M, N
CHARACTER*1 UPLO
CHARACTER*2
TYPE
* .. Array Arguments ..
REAL AA( LDA, * ), AS( LDA, * )
* .. Local Scalars ..
INTEGER I, IBEG, IEND, J
LOGICAL UPPER
* .. Executable Statements ..
UPPER = UPLO.EQ.
'U'
IF(
TYPE.EQ.
'GE' )
THEN
DO 20 J = 1, N
DO 10 I = M + 1, LDA
IF( AA( I, J ).NE.AS( I, J ) )
$
GO TO 70
10
CONTINUE
20
CONTINUE
ELSE IF(
TYPE.EQ.
'SY' )
THEN
DO 50 J = 1, N
IF( UPPER )
THEN
IBEG = 1
IEND = J
ELSE
IBEG = J
IEND = N
END IF
DO 30 I = 1, IBEG - 1
IF( AA( I, J ).NE.AS( I, J ) )
$
GO TO 70
30
CONTINUE
DO 40 I = IEND + 1, LDA
IF( AA( I, J ).NE.AS( I, J ) )
$
GO TO 70
40
CONTINUE
50
CONTINUE
END IF
*
LSERES = .
TRUE.
GO TO 80
70
CONTINUE
LSERES = .
FALSE.
80
RETURN
*
*
End of LSERES.
*
END
REAL FUNCTION SBEG( RESET )
*
* Generates random numbers uniformly distributed between -0.5 and 0.5.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Scalar Arguments ..
LOGICAL RESET
* .. Local Scalars ..
INTEGER I, IC, MI
* ..
Save statement ..
SAVE I, IC, MI
* .. Executable Statements ..
IF( RESET )
THEN
* Initialize local variables.
MI = 891
I = 7
IC = 0
RESET = .
FALSE.
END IF
*
* The
sequence of values of I is bounded between 1 and 999.
*
If initial I = 1,2,3,6,7 or 9, the period will be 50.
*
If initial I = 4 or 8, the period will be 25.
*
If initial I = 5, the period will be 10.
* IC is used
to break up the period by skipping 1 value of I
in 6.
*
IC = IC + 1
10 I = I*MI
I = I - 1000*( I/1000 )
IF( IC.GE.5 )
THEN
IC = 0
GO TO 10
END IF
SBEG = ( I - 500 )/1001.0
RETURN
*
*
End of SBEG.
*
END
REAL FUNCTION SDIFF( X, Y )
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Scalar Arguments ..
REAL X, Y
* .. Executable Statements ..
SDIFF = X - Y
RETURN
*
*
End of SDIFF.
*
END
SUBROUTINE CHKXER( SRNAMT, INFOT, NOUT, LERR, OK )
*
* Tests whether XERBLA has detected an error when it should.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Scalar Arguments ..
INTEGER INFOT, NOUT
LOGICAL LERR, OK
CHARACTER*6 SRNAMT
* .. Executable Statements ..
IF( .NOT.LERR )
THEN
WRITE( NOUT,
FMT = 9999 )INFOT, SRNAMT
OK = .
FALSE.
END IF
LERR = .
FALSE.
RETURN
*
9999
FORMAT(
' ***** ILLEGAL VALUE OF PARAMETER NUMBER ', I2,
' NOT D',
$
'ETECTED BY ', A6,
' *****' )
*
*
End of CHKXER.
*
END
SUBROUTINE XERBLA( SRNAME, INFO )
*
* This is a special version of XERBLA
to be used only as part of
* the test
program for testing error exits from the Level 3 BLAS
* routines.
*
* XERBLA is an error handler for the Level 3 BLAS routines.
*
* It is called by the Level 3 BLAS routines
if an input
parameter is
* invalid.
*
* Auxiliary routine for test
program for Level 3 Blas.
*
* -- Written on 8-February-1989.
* Jack Dongarra, Argonne National Laboratory.
* Iain Duff, AERE Harwell.
* Jeremy Du Croz, Numerical Algorithms Group Ltd.
* Sven Hammarling, Numerical Algorithms Group Ltd.
*
* .. Scalar Arguments ..
INTEGER INFO
CHARACTER*6 SRNAME
* .. Scalars
in Common ..
INTEGER INFOT, NOUT
LOGICAL LERR, OK
CHARACTER*6 SRNAMT
* ..
Common blocks ..
COMMON /INFOC/INFOT, NOUT, OK, LERR
COMMON /SRNAMC/SRNAMT
* .. Executable Statements ..
LERR = .
TRUE.
IF( INFO.NE.INFOT )
THEN
IF( INFOT.NE.0 )
THEN
WRITE( NOUT,
FMT = 9999 )INFO, INFOT
ELSE
WRITE( NOUT,
FMT = 9997 )INFO
END IF
OK = .
FALSE.
END IF
IF( SRNAME.NE.SRNAMT )
THEN
WRITE( NOUT,
FMT = 9998 )SRNAME, SRNAMT
OK = .
FALSE.
END IF
RETURN
*
9999
FORMAT(
' ******* XERBLA WAS CALLED WITH INFO = ', I6,
' INSTEAD',
$
' OF ', I2,
' *******' )
9998
FORMAT(
' ******* XERBLA WAS CALLED WITH SRNAME = ', A6,
' INSTE',
$
'AD OF ', A6,
' *******' )
9997
FORMAT(
' ******* XERBLA WAS CALLED WITH INFO = ', I6,
$
' *******' )
*
*
End of XERBLA
*
END
