[lapack] 02/10: Remove patches applied upstream:
Sébastien Villemot
sebastien at debian.org
Sun Jun 26 18:21:36 UTC 2016
This is an automated email from the git hooks/post-receive script.
sebastien pushed a commit to branch master
in repository lapack.
commit b7210d503f341d0b00a07559a39804de9bde0f8a
Author: Sébastien Villemot <sebastien at debian.org>
Date: Sun Jun 26 00:11:45 2016 +0200
Remove patches applied upstream:
+ parallel_build.patch
+ cblas-makerule.patch
+ cblas-test-output.patch
+ cblas-zblat2.patch
+ fix-typos.patch
Gbp-Dch: Full
---
debian/patches/cblas-makerule.patch | 43 --
debian/patches/cblas-test-output.patch | 68 --
debian/patches/cblas-zblat2.patch | 61 --
debian/patches/fix-typos.patch | 1263 --------------------------------
debian/patches/parallel_build.patch | 23 -
debian/patches/series | 5 -
6 files changed, 1463 deletions(-)
diff --git a/debian/patches/cblas-makerule.patch b/debian/patches/cblas-makerule.patch
deleted file mode 100644
index e043b01..0000000
--- a/debian/patches/cblas-makerule.patch
+++ /dev/null
@@ -1,43 +0,0 @@
-Description: Misc fixes for CBLAS build system
- - the "cblaslib" make rule from toplevel now creates the cblas_mangling.h
- header
- - the "cleancblas_testing" make rule from toplevel now cleans all testing data
- - the "clean" make rul from CBLAS/testing now cleans the *.out files generated
- by test programs
-Author: Sébastien Villemot <sebastien at debian.org>
-Forwarded: yes, by email to lapack at cs.utk.edu on 2016-01-06
-Applied-Upstream: commit: r1672
-Last-Update: 2016-01-08
----
-This patch header follows DEP-3: http://dep.debian.net/deps/dep3/
---- a/Makefile
-+++ b/Makefile
-@@ -21,7 +21,7 @@ blaslib:
- ( cd BLAS/SRC; $(MAKE) )
-
- cblaslib:
-- ( cd CBLAS/src; $(MAKE) )
-+ ( cd CBLAS; $(MAKE) )
-
- lapacklib: lapack_install
- ( cd SRC; $(MAKE) )
-@@ -117,7 +117,7 @@ cleanblas_testing:
- ( cd BLAS; rm -f xblat* )
-
- cleancblas_testing:
-- ( cd CBLAS; $(MAKE) cleanexe )
-+ ( cd CBLAS/testing; $(MAKE) clean )
-
- cleantesting:
- ( cd TESTING/LIN; $(MAKE) clean )
---- a/CBLAS/testing/Makefile
-+++ b/CBLAS/testing/Makefile
-@@ -41,7 +41,7 @@ all2: stest2 dtest2 ctest2 ztest2
- all3: stest3 dtest3 ctest3 ztest3
-
- clean:
-- rm -f core *.o a.out x*
-+ rm -f core *.o *.out x*
- cleanobj:
- rm -f core *.o a.out
- cleanexe:
diff --git a/debian/patches/cblas-test-output.patch b/debian/patches/cblas-test-output.patch
deleted file mode 100644
index db20ba9..0000000
--- a/debian/patches/cblas-test-output.patch
+++ /dev/null
@@ -1,68 +0,0 @@
-Description: Fix output descriptors of c_{s,d,c,z}blat3
- The NTRA argument can be equal to -1 if one does not want a snapshot file
- (and this is the case with sample data {s,d,c,z}in3).
- The routines {S,D,C,Z}PRCN3 will try to use their first argument as an output
- unit number, so we avoid calling them when NTRA < 0.
-Author: Camm Maguire <camm at enhanced.com>
-Author: Sébastien Villemot <sebastien at debian.org>
-Forwarded: yes, by email to lapack at cs.utk.edu on 2016-01-06
-Applied-Upstream: commit: r1672
-Last-Update: 2016-01-08
----
-This patch header follows DEP-3: http://dep.debian.net/deps/dep3/
---- a/CBLAS/testing/c_cblat3.f
-+++ b/CBLAS/testing/c_cblat3.f
-@@ -1365,8 +1365,9 @@
- *
- 150 CONTINUE
- WRITE( NOUT, FMT = 9996 )SNAME
-- CALL CPRCN3( NTRA, NC, SNAME, IORDER, SIDE, UPLO, TRANSA, DIAG,
-- $ M, N, ALPHA, LDA, LDB)
-+ IF( TRACE )
-+ $ CALL CPRCN3( NTRA, NC, SNAME, IORDER, SIDE, UPLO, TRANSA, DIAG,
-+ $ M, N, ALPHA, LDA, LDB)
- *
- 160 CONTINUE
- RETURN
---- a/CBLAS/testing/c_dblat3.f
-+++ b/CBLAS/testing/c_dblat3.f
-@@ -1335,8 +1335,9 @@
- *
- 150 CONTINUE
- WRITE( NOUT, FMT = 9996 )SNAME
-- CALL DPRCN3( NTRA, NC, SNAME, IORDER, SIDE, UPLO, TRANSA, DIAG,
-- $ M, N, ALPHA, LDA, LDB)
-+ IF( TRACE )
-+ $ CALL DPRCN3( NTRA, NC, SNAME, IORDER, SIDE, UPLO, TRANSA, DIAG,
-+ $ M, N, ALPHA, LDA, LDB)
- *
- 160 CONTINUE
- RETURN
---- a/CBLAS/testing/c_sblat3.f
-+++ b/CBLAS/testing/c_sblat3.f
-@@ -1339,8 +1339,9 @@
- *
- 150 CONTINUE
- WRITE( NOUT, FMT = 9996 )SNAME
-- CALL SPRCN3( NTRA, NC, SNAME, IORDER, SIDE, UPLO, TRANSA, DIAG,
-- $ M, N, ALPHA, LDA, LDB)
-+ IF( TRACE )
-+ $ CALL SPRCN3( NTRA, NC, SNAME, IORDER, SIDE, UPLO, TRANSA, DIAG,
-+ $ M, N, ALPHA, LDA, LDB)
- *
- 160 CONTINUE
- RETURN
---- a/CBLAS/testing/c_zblat3.f
-+++ b/CBLAS/testing/c_zblat3.f
-@@ -1366,8 +1366,9 @@
- *
- 150 CONTINUE
- WRITE( NOUT, FMT = 9996 )SNAME
-- CALL ZPRCN3( NTRA, NC, SNAME, IORDER, SIDE, UPLO, TRANSA, DIAG,
-- $ M, N, ALPHA, LDA, LDB)
-+ IF( TRACE )
-+ $ CALL ZPRCN3( NTRA, NC, SNAME, IORDER, SIDE, UPLO, TRANSA, DIAG,
-+ $ M, N, ALPHA, LDA, LDB)
- *
- 160 CONTINUE
- RETURN
diff --git a/debian/patches/cblas-zblat2.patch b/debian/patches/cblas-zblat2.patch
deleted file mode 100644
index 6297f84..0000000
--- a/debian/patches/cblas-zblat2.patch
+++ /dev/null
@@ -1,61 +0,0 @@
-Description: Fix CBLAS double complex level 2 tests
- The SNAME variable contains names of C functions like "cblas_dgemv".
- Apparently the code was not taking into account the 6-letter "cblas_"
- prefix when determining the task to be done.
- .
- The issue does not affect c_{s,d,c}blat2.f, which use the correct
- offsetting.
-Author: Camm Maguire <camm at enhanced.com>
-Reviewed-by: Sébastien Villemot <sebastien at debian.org>
-Forwarded: yes, by email to lapack at cs.utk.edu on 2016-01-06
-Applied-Upstream: commit: r1672
-Last-Update: 2016-01-08
----
-This patch header follows DEP-3: http://dep.debian.net/deps/dep3/
---- a/CBLAS/testing/c_zblat2.f
-+++ b/CBLAS/testing/c_zblat2.f
-@@ -1350,7 +1350,7 @@
- *
- * Call the subroutine.
- *
-- IF( SNAME( 4: 5 ).EQ.'mv' )THEN
-+ IF( SNAME( 10: 11 ).EQ.'mv' )THEN
- IF( FULL )THEN
- IF( TRACE )
- $ WRITE( NTRA, FMT = 9993 )NC, SNAME,
-@@ -1376,7 +1376,7 @@
- CALL CZTPMV( IORDER, UPLO, TRANS, DIAG,
- $ N, AA, XX, INCX )
- END IF
-- ELSE IF( SNAME( 4: 5 ).EQ.'sv' )THEN
-+ ELSE IF( SNAME( 10: 11 ).EQ.'sv' )THEN
- IF( FULL )THEN
- IF( TRACE )
- $ WRITE( NTRA, FMT = 9993 )NC, SNAME,
-@@ -1465,7 +1465,7 @@
- END IF
- *
- IF( .NOT.NULL )THEN
-- IF( SNAME( 4: 5 ).EQ.'mv' )THEN
-+ IF( SNAME( 10: 11 ).EQ.'mv' )THEN
- *
- * Check the result.
- *
-@@ -1473,7 +1473,7 @@
- $ INCX, ZERO, Z, INCX, XT, G,
- $ XX, EPS, ERR, FATAL, NOUT,
- $ .TRUE. )
-- ELSE IF( SNAME( 4: 5 ).EQ.'sv' )THEN
-+ ELSE IF( SNAME( 10: 11 ).EQ.'sv' )THEN
- *
- * Compute approximation to original vector.
- *
-@@ -1611,7 +1611,7 @@
- * .. Common blocks ..
- COMMON /INFOC/INFOT, NOUTC, OK
- * .. Executable Statements ..
-- CONJ = SNAME( 5: 5 ).EQ.'c'
-+ CONJ = SNAME( 11: 11 ).EQ.'c'
- * Define the number of arguments.
- NARGS = 9
- *
diff --git a/debian/patches/fix-typos.patch b/debian/patches/fix-typos.patch
deleted file mode 100644
index c25b8d1..0000000
--- a/debian/patches/fix-typos.patch
+++ /dev/null
@@ -1,1263 +0,0 @@
-Description: Fix various typos
-Author: Sébastien Villemot <sebastien at debian.org>
-Forwarded: yes, by email to lapack at cs.utk.edu on 2016-01-06
-Applied-Upstream: commit: r1672
-Last-Update: 2016-01-08
----
-This patch header follows DEP-3: http://dep.debian.net/deps/dep3/
---- a/TESTING/EIG/cdrves.f
-+++ b/TESTING/EIG/cdrves.f
-@@ -901,7 +901,7 @@
- $ ' 1/ulp otherwise', /
- $ ' 12 = 0 if W same no matter if VS computed (sort),',
- $ ' 1/ulp otherwise', /
-- $ ' 13 = 0 if sorting succesful, 1/ulp otherwise', / )
-+ $ ' 13 = 0 if sorting successful, 1/ulp otherwise', / )
- 9993 FORMAT( ' N=', I5, ', IWK=', I2, ', seed=', 4( I4, ',' ),
- $ ' type ', I2, ', test(', I2, ')=', G10.3 )
- 9992 FORMAT( ' CDRVES: ', A, ' returned INFO=', I6, '.', / 9X, 'N=',
---- a/TESTING/EIG/cdrvsx.f
-+++ b/TESTING/EIG/cdrvsx.f
-@@ -914,7 +914,7 @@
- $ ' 1/ulp otherwise', /
- $ ' 12 = 0 if W same no matter what else computed ',
- $ '(sort), 1/ulp otherwise', /
-- $ ' 13 = 0 if sorting succesful, 1/ulp otherwise',
-+ $ ' 13 = 0 if sorting successful, 1/ulp otherwise',
- $ / ' 14 = 0 if RCONDE same no matter what else computed,',
- $ ' 1/ulp otherwise', /
- $ ' 15 = 0 if RCONDv same no matter what else computed,',
---- a/TESTING/EIG/ddrves.f
-+++ b/TESTING/EIG/ddrves.f
-@@ -948,7 +948,7 @@
- $ ' 1/ulp otherwise', /
- $ ' 12 = 0 if WR, WI same no matter if VS computed (sort),',
- $ ' 1/ulp otherwise', /
-- $ ' 13 = 0 if sorting succesful, 1/ulp otherwise', / )
-+ $ ' 13 = 0 if sorting successful, 1/ulp otherwise', / )
- 9993 FORMAT( ' N=', I5, ', IWK=', I2, ', seed=', 4( I4, ',' ),
- $ ' type ', I2, ', test(', I2, ')=', G10.3 )
- 9992 FORMAT( ' DDRVES: ', A, ' returned INFO=', I6, '.', / 9X, 'N=',
---- a/TESTING/EIG/ddrvsx.f
-+++ b/TESTING/EIG/ddrvsx.f
-@@ -933,7 +933,7 @@
- $ ' 1/ulp otherwise', /
- $ ' 12 = 0 if WR, WI same no matter what else computed ',
- $ '(sort), 1/ulp otherwise', /
-- $ ' 13 = 0 if sorting succesful, 1/ulp otherwise',
-+ $ ' 13 = 0 if sorting successful, 1/ulp otherwise',
- $ / ' 14 = 0 if RCONDE same no matter what else computed,',
- $ ' 1/ulp otherwise', /
- $ ' 15 = 0 if RCONDv same no matter what else computed,',
---- a/TESTING/EIG/sdrves.f
-+++ b/TESTING/EIG/sdrves.f
-@@ -948,7 +948,7 @@
- $ ' 1/ulp otherwise', /
- $ ' 12 = 0 if WR, WI same no matter if VS computed (sort),',
- $ ' 1/ulp otherwise', /
-- $ ' 13 = 0 if sorting succesful, 1/ulp otherwise', / )
-+ $ ' 13 = 0 if sorting successful, 1/ulp otherwise', / )
- 9993 FORMAT( ' N=', I5, ', IWK=', I2, ', seed=', 4( I4, ',' ),
- $ ' type ', I2, ', test(', I2, ')=', G10.3 )
- 9992 FORMAT( ' SDRVES: ', A, ' returned INFO=', I6, '.', / 9X, 'N=',
---- a/TESTING/EIG/sdrvsx.f
-+++ b/TESTING/EIG/sdrvsx.f
-@@ -933,7 +933,7 @@
- $ ' 1/ulp otherwise', /
- $ ' 12 = 0 if WR, WI same no matter what else computed ',
- $ '(sort), 1/ulp otherwise', /
-- $ ' 13 = 0 if sorting succesful, 1/ulp otherwise',
-+ $ ' 13 = 0 if sorting successful, 1/ulp otherwise',
- $ / ' 14 = 0 if RCONDE same no matter what else computed,',
- $ ' 1/ulp otherwise', /
- $ ' 15 = 0 if RCONDv same no matter what else computed,',
---- a/TESTING/EIG/zdrves.f
-+++ b/TESTING/EIG/zdrves.f
-@@ -901,7 +901,7 @@
- $ ' 1/ulp otherwise', /
- $ ' 12 = 0 if W same no matter if VS computed (sort),',
- $ ' 1/ulp otherwise', /
-- $ ' 13 = 0 if sorting succesful, 1/ulp otherwise', / )
-+ $ ' 13 = 0 if sorting successful, 1/ulp otherwise', / )
- 9993 FORMAT( ' N=', I5, ', IWK=', I2, ', seed=', 4( I4, ',' ),
- $ ' type ', I2, ', test(', I2, ')=', G10.3 )
- 9992 FORMAT( ' ZDRVES: ', A, ' returned INFO=', I6, '.', / 9X, 'N=',
---- a/TESTING/EIG/zdrvsx.f
-+++ b/TESTING/EIG/zdrvsx.f
-@@ -914,7 +914,7 @@
- $ ' 1/ulp otherwise', /
- $ ' 12 = 0 if W same no matter what else computed ',
- $ '(sort), 1/ulp otherwise', /
-- $ ' 13 = 0 if sorting succesful, 1/ulp otherwise',
-+ $ ' 13 = 0 if sorting successful, 1/ulp otherwise',
- $ / ' 14 = 0 if RCONDE same no matter what else computed,',
- $ ' 1/ulp otherwise', /
- $ ' 15 = 0 if RCONDv same no matter what else computed,',
---- a/SRC/claed7.f
-+++ b/SRC/claed7.f
-@@ -57,7 +57,7 @@
- *>
- *> The first stage consists of deflating the size of the problem
- *> when there are multiple eigenvalues or if there is a zero in
--*> the Z vector. For each such occurence the dimension of the
-+*> the Z vector. For each such occurrence the dimension of the
- *> secular equation problem is reduced by one. This stage is
- *> performed by the routine SLAED2.
- *>
---- a/SRC/clarrv.f
-+++ b/SRC/clarrv.f
-@@ -81,7 +81,7 @@
- *> L is REAL array, dimension (N)
- *> On entry, the (N-1) subdiagonal elements of the unit
- *> bidiagonal matrix L are in elements 1 to N-1 of L
--*> (if the matrix is not splitted.) At the end of each block
-+*> (if the matrix is not split.) At the end of each block
- *> is stored the corresponding shift as given by SLARRE.
- *> On exit, L is overwritten.
- *> \endverbatim
-@@ -236,7 +236,7 @@
- *> INFO is INTEGER
- *> = 0: successful exit
- *>
--*> > 0: A problem occured in CLARRV.
-+*> > 0: A problem occurred in CLARRV.
- *> < 0: One of the called subroutines signaled an internal problem.
- *> Needs inspection of the corresponding parameter IINFO
- *> for further information.
---- a/SRC/clatdf.f
-+++ b/SRC/clatdf.f
-@@ -58,7 +58,7 @@
- *> Zx = +-e - f with the sign giving the greater value of
- *> 2-norm(x). About 5 times as expensive as Default.
- *> IJOB .ne. 2: Local look ahead strategy where
--*> all entries of the r.h.s. b is choosen as either +1 or
-+*> all entries of the r.h.s. b is chosen as either +1 or
- *> -1. Default.
- *> \endverbatim
- *>
---- a/SRC/dlarre.f
-+++ b/SRC/dlarre.f
-@@ -244,7 +244,7 @@
- *> \verbatim
- *> INFO is INTEGER
- *> = 0: successful exit
--*> > 0: A problem occured in DLARRE.
-+*> > 0: A problem occurred in DLARRE.
- *> < 0: One of the called subroutines signaled an internal problem.
- *> Needs inspection of the corresponding parameter IINFO
- *> for further information.
---- a/SRC/dlarrf.f
-+++ b/SRC/dlarrf.f
-@@ -51,7 +51,7 @@
- *> \param[in] N
- *> \verbatim
- *> N is INTEGER
--*> The order of the matrix (subblock, if the matrix splitted).
-+*> The order of the matrix (subblock, if the matrix split).
- *> \endverbatim
- *>
- *> \param[in] D
---- a/SRC/dlasd1.f
-+++ b/SRC/dlasd1.f
-@@ -60,7 +60,7 @@
- *>
- *> The first stage consists of deflating the size of the problem
- *> when there are multiple singular values or when there are zeros in
--*> the Z vector. For each such occurence the dimension of the
-+*> the Z vector. For each such occurrence the dimension of the
- *> secular equation problem is reduced by one. This stage is
- *> performed by the routine DLASD2.
- *>
---- a/SRC/dlasd6.f
-+++ b/SRC/dlasd6.f
-@@ -74,7 +74,7 @@
- *>
- *> The first stage consists of deflating the size of the problem
- *> when there are multiple singular values or if there is a zero
--*> in the Z vector. For each such occurence the dimension of the
-+*> in the Z vector. For each such occurrence the dimension of the
- *> secular equation problem is reduced by one. This stage is
- *> performed by the routine DLASD7.
- *>
---- a/SRC/dlasdq.f
-+++ b/SRC/dlasdq.f
-@@ -59,7 +59,7 @@
- *> \verbatim
- *> UPLO is CHARACTER*1
- *> On entry, UPLO specifies whether the input bidiagonal matrix
--*> is upper or lower bidiagonal, and wether it is square are
-+*> is upper or lower bidiagonal, and whether it is square are
- *> not.
- *> UPLO = 'U' or 'u' B is upper bidiagonal.
- *> UPLO = 'L' or 'l' B is lower bidiagonal.
---- a/SRC/slarre.f
-+++ b/SRC/slarre.f
-@@ -244,7 +244,7 @@
- *> \verbatim
- *> INFO is INTEGER
- *> = 0: successful exit
--*> > 0: A problem occured in SLARRE.
-+*> > 0: A problem occurred in SLARRE.
- *> < 0: One of the called subroutines signaled an internal problem.
- *> Needs inspection of the corresponding parameter IINFO
- *> for further information.
---- a/SRC/slarrf.f
-+++ b/SRC/slarrf.f
-@@ -51,7 +51,7 @@
- *> \param[in] N
- *> \verbatim
- *> N is INTEGER
--*> The order of the matrix (subblock, if the matrix splitted).
-+*> The order of the matrix (subblock, if the matrix split).
- *> \endverbatim
- *>
- *> \param[in] D
---- a/SRC/slasd1.f
-+++ b/SRC/slasd1.f
-@@ -60,7 +60,7 @@
- *>
- *> The first stage consists of deflating the size of the problem
- *> when there are multiple singular values or when there are zeros in
--*> the Z vector. For each such occurence the dimension of the
-+*> the Z vector. For each such occurrence the dimension of the
- *> secular equation problem is reduced by one. This stage is
- *> performed by the routine SLASD2.
- *>
---- a/SRC/slasd6.f
-+++ b/SRC/slasd6.f
-@@ -74,7 +74,7 @@
- *>
- *> The first stage consists of deflating the size of the problem
- *> when there are multiple singular values or if there is a zero
--*> in the Z vector. For each such occurence the dimension of the
-+*> in the Z vector. For each such occurrence the dimension of the
- *> secular equation problem is reduced by one. This stage is
- *> performed by the routine SLASD7.
- *>
---- a/SRC/slasdq.f
-+++ b/SRC/slasdq.f
-@@ -59,7 +59,7 @@
- *> \verbatim
- *> UPLO is CHARACTER*1
- *> On entry, UPLO specifies whether the input bidiagonal matrix
--*> is upper or lower bidiagonal, and wether it is square are
-+*> is upper or lower bidiagonal, and whether it is square are
- *> not.
- *> UPLO = 'U' or 'u' B is upper bidiagonal.
- *> UPLO = 'L' or 'l' B is lower bidiagonal.
---- a/SRC/zcgesv.f
-+++ b/SRC/zcgesv.f
-@@ -170,7 +170,7 @@
- *> -3 : failure of CGETRF
- *> -31: stop the iterative refinement after the 30th
- *> iterations
--*> > 0: iterative refinement has been sucessfully used.
-+*> > 0: iterative refinement has been successfully used.
- *> Returns the number of iterations
- *> \endverbatim
- *>
---- a/SRC/zcposv.f
-+++ b/SRC/zcposv.f
-@@ -178,7 +178,7 @@
- *> -3 : failure of CPOTRF
- *> -31: stop the iterative refinement after the 30th
- *> iterations
--*> > 0: iterative refinement has been sucessfully used.
-+*> > 0: iterative refinement has been successfully used.
- *> Returns the number of iterations
- *> \endverbatim
- *>
---- a/SRC/zgejsv.f
-+++ b/SRC/zgejsv.f
-@@ -318,7 +318,7 @@
- *> the minimal requirement is LWORK >= 5*N+2*N*N.
- *> 4.2. if JOBV.EQ.'J' the minimal requirement is
- *> LWORK >= 4*N+N*N.
--*> In both cases, the allocated CWORK can accomodate blocked runs
-+*> In both cases, the allocated CWORK can accommodate blocked runs
- *> of ZGEQP3, ZGEQRF, ZGELQF, SUNMQR, CUNMLQ.
- *> \endverbatim
- *>
---- a/SRC/dlag2.f
-+++ b/SRC/dlag2.f
-@@ -99,7 +99,7 @@
- *> will always be positive. If the eigenvalues are real, then
- *> the first (real) eigenvalue is WR1 / SCALE1 , but this may
- *> overflow or underflow, and in fact, SCALE1 may be zero or
--*> less than the underflow threshhold if the exact eigenvalue
-+*> less than the underflow threshold if the exact eigenvalue
- *> is sufficiently large.
- *> \endverbatim
- *>
-@@ -112,7 +112,7 @@
- *> eigenvalues are real, then the second (real) eigenvalue is
- *> WR2 / SCALE2 , but this may overflow or underflow, and in
- *> fact, SCALE2 may be zero or less than the underflow
--*> threshhold if the exact eigenvalue is sufficiently large.
-+*> threshold if the exact eigenvalue is sufficiently large.
- *> \endverbatim
- *>
- *> \param[out] WR1
-@@ -266,8 +266,8 @@
- * Note: the test of R in the following IF is to cover the case when
- * DISCR is small and negative and is flushed to zero during
- * the calculation of R. On machines which have a consistent
--* flush-to-zero threshhold and handle numbers above that
--* threshhold correctly, it would not be necessary.
-+* flush-to-zero threshold and handle numbers above that
-+* threshold correctly, it would not be necessary.
- *
- IF( DISCR.GE.ZERO .OR. R.EQ.ZERO ) THEN
- SUM = PP + SIGN( R, PP )
---- a/SRC/slag2.f
-+++ b/SRC/slag2.f
-@@ -99,7 +99,7 @@
- *> will always be positive. If the eigenvalues are real, then
- *> the first (real) eigenvalue is WR1 / SCALE1 , but this may
- *> overflow or underflow, and in fact, SCALE1 may be zero or
--*> less than the underflow threshhold if the exact eigenvalue
-+*> less than the underflow threshold if the exact eigenvalue
- *> is sufficiently large.
- *> \endverbatim
- *>
-@@ -112,7 +112,7 @@
- *> eigenvalues are real, then the second (real) eigenvalue is
- *> WR2 / SCALE2 , but this may overflow or underflow, and in
- *> fact, SCALE2 may be zero or less than the underflow
--*> threshhold if the exact eigenvalue is sufficiently large.
-+*> threshold if the exact eigenvalue is sufficiently large.
- *> \endverbatim
- *>
- *> \param[out] WR1
-@@ -266,8 +266,8 @@
- * Note: the test of R in the following IF is to cover the case when
- * DISCR is small and negative and is flushed to zero during
- * the calculation of R. On machines which have a consistent
--* flush-to-zero threshhold and handle numbers above that
--* threshhold correctly, it would not be necessary.
-+* flush-to-zero threshold and handle numbers above that
-+* threshold correctly, it would not be necessary.
- *
- IF( DISCR.GE.ZERO .OR. R.EQ.ZERO ) THEN
- SUM = PP + SIGN( R, PP )
---- a/TESTING/EIG/cchkgg.f
-+++ b/TESTING/EIG/cchkgg.f
-@@ -68,7 +68,7 @@
- *> and each type of matrix, one matrix will be generated and used
- *> to test the nonsymmetric eigenroutines. For each matrix, 13
- *> tests will be performed. The first twelve "test ratios" should be
--*> small -- O(1). They will be compared with the threshhold THRESH:
-+*> small -- O(1). They will be compared with the threshold THRESH:
- *>
- *> H
- *> (1) | A - U H V | / ( |A| n ulp )
-@@ -128,7 +128,7 @@
- *> |beta(Q,Z computed) - beta(Q,Z not computed)|/|P| ) / ulp
- *>
- *> In addition, the normalization of L and R are checked, and compared
--*> with the threshhold THRSHN.
-+*> with the threshold THRSHN.
- *>
- *> Test Matrices
- *> ---- --------
-@@ -298,7 +298,7 @@
- *> \param[in] THRSHN
- *> \verbatim
- *> THRSHN is REAL
--*> Threshhold for reporting eigenvector normalization error.
-+*> Threshold for reporting eigenvector normalization error.
- *> If the normalization of any eigenvector differs from 1 by
- *> more than THRSHN*ulp, then a special error message will be
- *> printed. (This is handled separately from the other tests,
---- a/TESTING/EIG/cdrges.f
-+++ b/TESTING/EIG/cdrges.f
-@@ -50,7 +50,7 @@
- *> number of matrix "TYPES" are specified. For each size ("N")
- *> and each TYPE of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following 13 tests
--*> will be performed and compared with the threshhold THRESH except
-+*> will be performed and compared with the threshold THRESH except
- *> the tests (5), (11) and (13).
- *>
- *>
---- a/TESTING/EIG/cdrges3.f
-+++ b/TESTING/EIG/cdrges3.f
-@@ -50,7 +50,7 @@
- *> number of matrix "TYPES" are specified. For each size ("N")
- *> and each TYPE of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following 13 tests
--*> will be performed and compared with the threshhold THRESH except
-+*> will be performed and compared with the threshold THRESH except
- *> the tests (5), (11) and (13).
- *>
- *>
---- a/TESTING/EIG/cdrgev.f
-+++ b/TESTING/EIG/cdrgev.f
-@@ -55,7 +55,7 @@
- *> number of matrix "types" are specified. For each size ("n")
- *> and each type of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following tests
--*> will be performed and compared with the threshhold THRESH.
-+*> will be performed and compared with the threshold THRESH.
- *>
- *> Results from CGGEV:
- *>
---- a/TESTING/EIG/cdrgev3.f
-+++ b/TESTING/EIG/cdrgev3.f
-@@ -55,7 +55,7 @@
- *> number of matrix "types" are specified. For each size ("n")
- *> and each type of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following tests
--*> will be performed and compared with the threshhold THRESH.
-+*> will be performed and compared with the threshold THRESH.
- *>
- *> Results from CGGEV3:
- *>
---- a/TESTING/EIG/cdrgsx.f
-+++ b/TESTING/EIG/cdrgsx.f
-@@ -59,7 +59,7 @@
- *> (need more details on what kind of read-in data are needed).
- *>
- *> For each matrix pair, the following tests will be performed and
--*> compared with the threshhold THRESH except for the tests (7) and (9):
-+*> compared with the threshold THRESH except for the tests (7) and (9):
- *>
- *> (1) | A - Q S Z' | / ( |A| n ulp )
- *>
---- a/TESTING/EIG/cdrgvx.f
-+++ b/TESTING/EIG/cdrgvx.f
-@@ -50,7 +50,7 @@
- *> corresponding the first and last eigenvalues are also know
- *> ``exactly'' (see CLATM6).
- *> For each matrix pair, the following tests will be performed and
--*> compared with the threshhold THRESH.
-+*> compared with the threshold THRESH.
- *>
- *> (1) max over all left eigenvalue/-vector pairs (beta/alpha,l) of
- *>
---- a/TESTING/EIG/dchkgg.f
-+++ b/TESTING/EIG/dchkgg.f
-@@ -72,7 +72,7 @@
- *> and each type of matrix, one matrix will be generated and used
- *> to test the nonsymmetric eigenroutines. For each matrix, 15
- *> tests will be performed. The first twelve "test ratios" should be
--*> small -- O(1). They will be compared with the threshhold THRESH:
-+*> small -- O(1). They will be compared with the threshold THRESH:
- *>
- *> T
- *> (1) | A - U H V | / ( |A| n ulp )
-@@ -132,7 +132,7 @@
- *> |beta(Q,Z computed) - beta(Q,Z not computed)|/|P| ) / ulp
- *>
- *> In addition, the normalization of L and R are checked, and compared
--*> with the threshhold THRSHN.
-+*> with the threshold THRSHN.
- *>
- *> Test Matrices
- *> ---- --------
-@@ -298,7 +298,7 @@
- *> \param[in] THRSHN
- *> \verbatim
- *> THRSHN is DOUBLE PRECISION
--*> Threshhold for reporting eigenvector normalization error.
-+*> Threshold for reporting eigenvector normalization error.
- *> If the normalization of any eigenvector differs from 1 by
- *> more than THRSHN*ulp, then a special error message will be
- *> printed. (This is handled separately from the other tests,
---- a/TESTING/EIG/ddrges.f
-+++ b/TESTING/EIG/ddrges.f
-@@ -52,7 +52,7 @@
- *> number of matrix "TYPES" are specified. For each size ("N")
- *> and each TYPE of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following 13 tests
--*> will be performed and compared with the threshhold THRESH except
-+*> will be performed and compared with the threshold THRESH except
- *> the tests (5), (11) and (13).
- *>
- *>
---- a/TESTING/EIG/ddrges3.f
-+++ b/TESTING/EIG/ddrges3.f
-@@ -52,7 +52,7 @@
- *> number of matrix "TYPES" are specified. For each size ("N")
- *> and each TYPE of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following 13 tests
--*> will be performed and compared with the threshhold THRESH except
-+*> will be performed and compared with the threshold THRESH except
- *> the tests (5), (11) and (13).
- *>
- *>
---- a/TESTING/EIG/ddrgev.f
-+++ b/TESTING/EIG/ddrgev.f
-@@ -55,7 +55,7 @@
- *> number of matrix "types" are specified. For each size ("n")
- *> and each type of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following tests
--*> will be performed and compared with the threshhold THRESH.
-+*> will be performed and compared with the threshold THRESH.
- *>
- *> Results from DGGEV:
- *>
---- a/TESTING/EIG/ddrgev3.f
-+++ b/TESTING/EIG/ddrgev3.f
-@@ -55,7 +55,7 @@
- *> number of matrix "types" are specified. For each size ("n")
- *> and each type of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following tests
--*> will be performed and compared with the threshhold THRESH.
-+*> will be performed and compared with the threshold THRESH.
- *>
- *> Results from DGGEV3:
- *>
---- a/TESTING/EIG/ddrgsx.f
-+++ b/TESTING/EIG/ddrgsx.f
-@@ -60,7 +60,7 @@
- *> to test DGGESX.
- *>
- *> For each matrix pair, the following tests will be performed and
--*> compared with the threshhold THRESH except for the tests (7) and (9):
-+*> compared with the threshold THRESH except for the tests (7) and (9):
- *>
- *> (1) | A - Q S Z' | / ( |A| n ulp )
- *>
---- a/TESTING/EIG/ddrgvx.f
-+++ b/TESTING/EIG/ddrgvx.f
-@@ -50,7 +50,7 @@
- *> ``exactly'' (see DLATM6).
- *>
- *> For each matrix pair, the following tests will be performed and
--*> compared with the threshhold THRESH.
-+*> compared with the threshold THRESH.
- *>
- *> (1) max over all left eigenvalue/-vector pairs (beta/alpha,l) of
- *>
---- a/TESTING/EIG/schkgg.f
-+++ b/TESTING/EIG/schkgg.f
-@@ -72,7 +72,7 @@
- *> and each type of matrix, one matrix will be generated and used
- *> to test the nonsymmetric eigenroutines. For each matrix, 15
- *> tests will be performed. The first twelve "test ratios" should be
--*> small -- O(1). They will be compared with the threshhold THRESH:
-+*> small -- O(1). They will be compared with the threshold THRESH:
- *>
- *> T
- *> (1) | A - U H V | / ( |A| n ulp )
-@@ -132,7 +132,7 @@
- *> |beta(Q,Z computed) - beta(Q,Z not computed)|/|P| ) / ulp
- *>
- *> In addition, the normalization of L and R are checked, and compared
--*> with the threshhold THRSHN.
-+*> with the threshold THRSHN.
- *>
- *> Test Matrices
- *> ---- --------
-@@ -298,7 +298,7 @@
- *> \param[in] THRSHN
- *> \verbatim
- *> THRSHN is REAL
--*> Threshhold for reporting eigenvector normalization error.
-+*> Threshold for reporting eigenvector normalization error.
- *> If the normalization of any eigenvector differs from 1 by
- *> more than THRSHN*ulp, then a special error message will be
- *> printed. (This is handled separately from the other tests,
---- a/TESTING/EIG/sdrges.f
-+++ b/TESTING/EIG/sdrges.f
-@@ -52,7 +52,7 @@
- *> number of matrix "TYPES" are specified. For each size ("N")
- *> and each TYPE of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following 13 tests
--*> will be performed and compared with the threshhold THRESH except
-+*> will be performed and compared with the threshold THRESH except
- *> the tests (5), (11) and (13).
- *>
- *>
---- a/TESTING/EIG/sdrges3.f
-+++ b/TESTING/EIG/sdrges3.f
-@@ -52,7 +52,7 @@
- *> number of matrix "TYPES" are specified. For each size ("N")
- *> and each TYPE of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following 13 tests
--*> will be performed and compared with the threshhold THRESH except
-+*> will be performed and compared with the threshold THRESH except
- *> the tests (5), (11) and (13).
- *>
- *>
---- a/TESTING/EIG/sdrgev.f
-+++ b/TESTING/EIG/sdrgev.f
-@@ -55,7 +55,7 @@
- *> number of matrix "types" are specified. For each size ("n")
- *> and each type of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following tests
--*> will be performed and compared with the threshhold THRESH.
-+*> will be performed and compared with the threshold THRESH.
- *>
- *> Results from SGGEV:
- *>
---- a/TESTING/EIG/sdrgev3.f
-+++ b/TESTING/EIG/sdrgev3.f
-@@ -55,7 +55,7 @@
- *> number of matrix "types" are specified. For each size ("n")
- *> and each type of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following tests
--*> will be performed and compared with the threshhold THRESH.
-+*> will be performed and compared with the threshold THRESH.
- *>
- *> Results from SGGEV3:
- *>
---- a/TESTING/EIG/sdrgsx.f
-+++ b/TESTING/EIG/sdrgsx.f
-@@ -60,7 +60,7 @@
- *> to test SGGESX.
- *>
- *> For each matrix pair, the following tests will be performed and
--*> compared with the threshhold THRESH except for the tests (7) and (9):
-+*> compared with the threshold THRESH except for the tests (7) and (9):
- *>
- *> (1) | A - Q S Z' | / ( |A| n ulp )
- *>
---- a/TESTING/EIG/sdrgvx.f
-+++ b/TESTING/EIG/sdrgvx.f
-@@ -51,7 +51,7 @@
- *> ``exactly'' (see SLATM6).
- *>
- *> For each matrix pair, the following tests will be performed and
--*> compared with the threshhold THRESH.
-+*> compared with the threshold THRESH.
- *>
- *> (1) max over all left eigenvalue/-vector pairs (beta/alpha,l) of
- *>
---- a/TESTING/EIG/zchkgg.f
-+++ b/TESTING/EIG/zchkgg.f
-@@ -68,7 +68,7 @@
- *> and each type of matrix, one matrix will be generated and used
- *> to test the nonsymmetric eigenroutines. For each matrix, 13
- *> tests will be performed. The first twelve "test ratios" should be
--*> small -- O(1). They will be compared with the threshhold THRESH:
-+*> small -- O(1). They will be compared with the threshold THRESH:
- *>
- *> H
- *> (1) | A - U H V | / ( |A| n ulp )
-@@ -128,7 +128,7 @@
- *> |beta(Q,Z computed) - beta(Q,Z not computed)|/|P| ) / ulp
- *>
- *> In addition, the normalization of L and R are checked, and compared
--*> with the threshhold THRSHN.
-+*> with the threshold THRSHN.
- *>
- *> Test Matrices
- *> ---- --------
-@@ -298,7 +298,7 @@
- *> \param[in] THRSHN
- *> \verbatim
- *> THRSHN is DOUBLE PRECISION
--*> Threshhold for reporting eigenvector normalization error.
-+*> Threshold for reporting eigenvector normalization error.
- *> If the normalization of any eigenvector differs from 1 by
- *> more than THRSHN*ulp, then a special error message will be
- *> printed. (This is handled separately from the other tests,
---- a/TESTING/EIG/zdrges.f
-+++ b/TESTING/EIG/zdrges.f
-@@ -50,7 +50,7 @@
- *> number of matrix "TYPES" are specified. For each size ("N")
- *> and each TYPE of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following 13 tests
--*> will be performed and compared with the threshhold THRESH except
-+*> will be performed and compared with the threshold THRESH except
- *> the tests (5), (11) and (13).
- *>
- *>
---- a/TESTING/EIG/zdrges3.f
-+++ b/TESTING/EIG/zdrges3.f
-@@ -50,7 +50,7 @@
- *> number of matrix "TYPES" are specified. For each size ("N")
- *> and each TYPE of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following 13 tests
--*> will be performed and compared with the threshhold THRESH except
-+*> will be performed and compared with the threshold THRESH except
- *> the tests (5), (11) and (13).
- *>
- *>
---- a/TESTING/EIG/zdrgev.f
-+++ b/TESTING/EIG/zdrgev.f
-@@ -55,7 +55,7 @@
- *> number of matrix "types" are specified. For each size ("n")
- *> and each type of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following tests
--*> will be performed and compared with the threshhold THRESH.
-+*> will be performed and compared with the threshold THRESH.
- *>
- *> Results from ZGGEV:
- *>
---- a/TESTING/EIG/zdrgev3.f
-+++ b/TESTING/EIG/zdrgev3.f
-@@ -55,7 +55,7 @@
- *> number of matrix "types" are specified. For each size ("n")
- *> and each type of matrix, a pair of matrices (A, B) will be generated
- *> and used for testing. For each matrix pair, the following tests
--*> will be performed and compared with the threshhold THRESH.
-+*> will be performed and compared with the threshold THRESH.
- *>
- *> Results from ZGGEV3:
- *>
---- a/TESTING/EIG/zdrgsx.f
-+++ b/TESTING/EIG/zdrgsx.f
-@@ -59,7 +59,7 @@
- *> (need more details on what kind of read-in data are needed).
- *>
- *> For each matrix pair, the following tests will be performed and
--*> compared with the threshhold THRESH except for the tests (7) and (9):
-+*> compared with the threshold THRESH except for the tests (7) and (9):
- *>
- *> (1) | A - Q S Z' | / ( |A| n ulp )
- *>
---- a/TESTING/EIG/zdrgvx.f
-+++ b/TESTING/EIG/zdrgvx.f
-@@ -49,7 +49,7 @@
- *> corresponding the first and last eigenvalues are also know
- *> ``exactly'' (see ZLATM6).
- *> For each matrix pair, the following tests will be performed and
--*> compared with the threshhold THRESH.
-+*> compared with the threshold THRESH.
- *>
- *> (1) max over all left eigenvalue/-vector pairs (beta/alpha,l) of
- *>
---- a/SRC/cgejsv.f
-+++ b/SRC/cgejsv.f
-@@ -317,7 +317,7 @@
- *> the minimal requirement is LWORK >= 5*N+2*N*N.
- *> 4.2. if JOBV.EQ.'J' the minimal requirement is
- *> LWORK >= 4*N+N*N.
--*> In both cases, the allocated CWORK can accomodate blocked runs
-+*> In both cases, the allocated CWORK can accommodate blocked runs
- *> of CGEQP3, CGEQRF, CGELQF, SUNMQR, CUNMLQ.
- *> \endverbatim
- *>
---- a/SRC/cstegr.f
-+++ b/SRC/cstegr.f
-@@ -48,7 +48,7 @@
- *> either an interval (VL,VU] or a range of indices IL:IU for the desired
- *> eigenvalues.
- *>
--*> CSTEGR is a compatability wrapper around the improved CSTEMR routine.
-+*> CSTEGR is a compatibility wrapper around the improved CSTEMR routine.
- *> See SSTEMR for further details.
- *>
- *> One important change is that the ABSTOL parameter no longer provides any
---- a/SRC/dlaed1.f
-+++ b/SRC/dlaed1.f
-@@ -54,7 +54,7 @@
- *>
- *> The first stage consists of deflating the size of the problem
- *> when there are multiple eigenvalues or if there is a zero in
--*> the Z vector. For each such occurence the dimension of the
-+*> the Z vector. For each such occurrence the dimension of the
- *> secular equation problem is reduced by one. This stage is
- *> performed by the routine DLAED2.
- *>
---- a/SRC/dlaed7.f
-+++ b/SRC/dlaed7.f
-@@ -59,7 +59,7 @@
- *>
- *> The first stage consists of deflating the size of the problem
- *> when there are multiple eigenvalues or if there is a zero in
--*> the Z vector. For each such occurence the dimension of the
-+*> the Z vector. For each such occurrence the dimension of the
- *> secular equation problem is reduced by one. This stage is
- *> performed by the routine DLAED8.
- *>
---- a/SRC/dlamrg.f
-+++ b/SRC/dlamrg.f
-@@ -50,7 +50,7 @@
- *> \param[in] N2
- *> \verbatim
- *> N2 is INTEGER
--*> These arguements contain the respective lengths of the two
-+*> These arguments contain the respective lengths of the two
- *> sorted lists to be merged.
- *> \endverbatim
- *>
---- a/SRC/dlarrv.f
-+++ b/SRC/dlarrv.f
-@@ -81,7 +81,7 @@
- *> L is DOUBLE PRECISION array, dimension (N)
- *> On entry, the (N-1) subdiagonal elements of the unit
- *> bidiagonal matrix L are in elements 1 to N-1 of L
--*> (if the matrix is not splitted.) At the end of each block
-+*> (if the matrix is not split.) At the end of each block
- *> is stored the corresponding shift as given by DLARRE.
- *> On exit, L is overwritten.
- *> \endverbatim
-@@ -236,7 +236,7 @@
- *> INFO is INTEGER
- *> = 0: successful exit
- *>
--*> > 0: A problem occured in DLARRV.
-+*> > 0: A problem occurred in DLARRV.
- *> < 0: One of the called subroutines signaled an internal problem.
- *> Needs inspection of the corresponding parameter IINFO
- *> for further information.
---- a/SRC/dlasrt.f
-+++ b/SRC/dlasrt.f
-@@ -123,7 +123,7 @@
- * ..
- * .. Executable Statements ..
- *
--* Test the input paramters.
-+* Test the input parameters.
- *
- INFO = 0
- DIR = -1
---- a/SRC/dlatdf.f
-+++ b/SRC/dlatdf.f
-@@ -58,7 +58,7 @@
- *> Zx = +-e - f with the sign giving the greater value
- *> of 2-norm(x). About 5 times as expensive as Default.
- *> IJOB .ne. 2: Local look ahead strategy where all entries of
--*> the r.h.s. b is choosen as either +1 or -1 (Default).
-+*> the r.h.s. b is chosen as either +1 or -1 (Default).
- *> \endverbatim
- *>
- *> \param[in] N
---- a/SRC/dstegr.f
-+++ b/SRC/dstegr.f
-@@ -48,7 +48,7 @@
- *> either an interval (VL,VU] or a range of indices IL:IU for the desired
- *> eigenvalues.
- *>
--*> DSTEGR is a compatability wrapper around the improved DSTEMR routine.
-+*> DSTEGR is a compatibility wrapper around the improved DSTEMR routine.
- *> See DSTEMR for further details.
- *>
- *> One important change is that the ABSTOL parameter no longer provides any
---- a/SRC/slaed1.f
-+++ b/SRC/slaed1.f
-@@ -54,7 +54,7 @@
- *>
- *> The first stage consists of deflating the size of the problem
- *> when there are multiple eigenvalues or if there is a zero in
--*> the Z vector. For each such occurence the dimension of the
-+*> the Z vector. For each such occurrence the dimension of the
- *> secular equation problem is reduced by one. This stage is
- *> performed by the routine SLAED2.
- *>
---- a/SRC/slaed7.f
-+++ b/SRC/slaed7.f
-@@ -59,7 +59,7 @@
- *>
- *> The first stage consists of deflating the size of the problem
- *> when there are multiple eigenvalues or if there is a zero in
--*> the Z vector. For each such occurence the dimension of the
-+*> the Z vector. For each such occurrence the dimension of the
- *> secular equation problem is reduced by one. This stage is
- *> performed by the routine SLAED8.
- *>
---- a/SRC/slamrg.f
-+++ b/SRC/slamrg.f
-@@ -50,7 +50,7 @@
- *> \param[in] N2
- *> \verbatim
- *> N2 is INTEGER
--*> These arguements contain the respective lengths of the two
-+*> These arguments contain the respective lengths of the two
- *> sorted lists to be merged.
- *> \endverbatim
- *>
---- a/SRC/slarrv.f
-+++ b/SRC/slarrv.f
-@@ -81,7 +81,7 @@
- *> L is REAL array, dimension (N)
- *> On entry, the (N-1) subdiagonal elements of the unit
- *> bidiagonal matrix L are in elements 1 to N-1 of L
--*> (if the matrix is not splitted.) At the end of each block
-+*> (if the matrix is not split.) At the end of each block
- *> is stored the corresponding shift as given by SLARRE.
- *> On exit, L is overwritten.
- *> \endverbatim
-@@ -236,7 +236,7 @@
- *> INFO is INTEGER
- *> = 0: successful exit
- *>
--*> > 0: A problem occured in SLARRV.
-+*> > 0: A problem occurred in SLARRV.
- *> < 0: One of the called subroutines signaled an internal problem.
- *> Needs inspection of the corresponding parameter IINFO
- *> for further information.
---- a/SRC/slasrt.f
-+++ b/SRC/slasrt.f
-@@ -123,7 +123,7 @@
- * ..
- * .. Executable Statements ..
- *
--* Test the input paramters.
-+* Test the input parameters.
- *
- INFO = 0
- DIR = -1
---- a/SRC/slatdf.f
-+++ b/SRC/slatdf.f
-@@ -58,7 +58,7 @@
- *> Zx = +-e - f with the sign giving the greater value
- *> of 2-norm(x). About 5 times as expensive as Default.
- *> IJOB .ne. 2: Local look ahead strategy where all entries of
--*> the r.h.s. b is choosen as either +1 or -1 (Default).
-+*> the r.h.s. b is chosen as either +1 or -1 (Default).
- *> \endverbatim
- *>
- *> \param[in] N
---- a/SRC/sstegr.f
-+++ b/SRC/sstegr.f
-@@ -48,7 +48,7 @@
- *> either an interval (VL,VU] or a range of indices IL:IU for the desired
- *> eigenvalues.
- *>
--*> SSTEGR is a compatability wrapper around the improved SSTEMR routine.
-+*> SSTEGR is a compatibility wrapper around the improved SSTEMR routine.
- *> See SSTEMR for further details.
- *>
- *> One important change is that the ABSTOL parameter no longer provides any
---- a/SRC/zlaed7.f
-+++ b/SRC/zlaed7.f
-@@ -57,7 +57,7 @@
- *>
- *> The first stage consists of deflating the size of the problem
- *> when there are multiple eigenvalues or if there is a zero in
--*> the Z vector. For each such occurence the dimension of the
-+*> the Z vector. For each such occurrence the dimension of the
- *> secular equation problem is reduced by one. This stage is
- *> performed by the routine DLAED2.
- *>
---- a/SRC/zlarrv.f
-+++ b/SRC/zlarrv.f
-@@ -81,7 +81,7 @@
- *> L is DOUBLE PRECISION array, dimension (N)
- *> On entry, the (N-1) subdiagonal elements of the unit
- *> bidiagonal matrix L are in elements 1 to N-1 of L
--*> (if the matrix is not splitted.) At the end of each block
-+*> (if the matrix is not split.) At the end of each block
- *> is stored the corresponding shift as given by DLARRE.
- *> On exit, L is overwritten.
- *> \endverbatim
-@@ -236,7 +236,7 @@
- *> INFO is INTEGER
- *> = 0: successful exit
- *>
--*> > 0: A problem occured in ZLARRV.
-+*> > 0: A problem occurred in ZLARRV.
- *> < 0: One of the called subroutines signaled an internal problem.
- *> Needs inspection of the corresponding parameter IINFO
- *> for further information.
---- a/SRC/zlatdf.f
-+++ b/SRC/zlatdf.f
-@@ -58,7 +58,7 @@
- *> Zx = +-e - f with the sign giving the greater value of
- *> 2-norm(x). About 5 times as expensive as Default.
- *> IJOB .ne. 2: Local look ahead strategy where
--*> all entries of the r.h.s. b is choosen as either +1 or
-+*> all entries of the r.h.s. b is chosen as either +1 or
- *> -1. Default.
- *> \endverbatim
- *>
---- a/SRC/zstegr.f
-+++ b/SRC/zstegr.f
-@@ -48,7 +48,7 @@
- *> either an interval (VL,VU] or a range of indices IL:IU for the desired
- *> eigenvalues.
- *>
--*> ZSTEGR is a compatability wrapper around the improved ZSTEMR routine.
-+*> ZSTEGR is a compatibility wrapper around the improved ZSTEMR routine.
- *> See DSTEMR for further details.
- *>
- *> One important change is that the ABSTOL parameter no longer provides any
---- a/TESTING/EIG/clctes.f
-+++ b/TESTING/EIG/clctes.f
-@@ -25,7 +25,7 @@
- *> eigenvalue is negative), and otherwise it returns .FALSE..
- *>
- *> It is used by the test routine CDRGES to test whether the driver
--*> routine CGGES succesfully sorts eigenvalues.
-+*> routine CGGES successfully sorts eigenvalues.
- *> \endverbatim
- *
- * Arguments:
---- a/TESTING/EIG/cslect.f
-+++ b/TESTING/EIG/cslect.f
-@@ -22,8 +22,8 @@
- *>
- *> CSLECT returns .TRUE. if the eigenvalue Z is to be selected,
- *> otherwise it returns .FALSE.
--*> It is used by CCHK41 to test if CGEES succesfully sorts eigenvalues,
--*> and by CCHK43 to test if CGEESX succesfully sorts eigenvalues.
-+*> It is used by CCHK41 to test if CGEES successfully sorts eigenvalues,
-+*> and by CCHK43 to test if CGEESX successfully sorts eigenvalues.
- *>
- *> The common block /SSLCT/ controls how eigenvalues are selected.
- *> If SELOPT = 0, then CSLECT return .TRUE. when real(Z) is less than
---- a/TESTING/EIG/dlctes.f
-+++ b/TESTING/EIG/dlctes.f
-@@ -26,7 +26,7 @@
- *> .FALSE..
- *>
- *> It is used by the test routine DDRGES to test whether the driver
--*> routine DGGES succesfully sorts eigenvalues.
-+*> routine DGGES successfully sorts eigenvalues.
- *> \endverbatim
- *
- * Arguments:
---- a/TESTING/EIG/dslect.f
-+++ b/TESTING/EIG/dslect.f
-@@ -22,8 +22,8 @@
- *>
- *> DSLECT returns .TRUE. if the eigenvalue ZR+sqrt(-1)*ZI is to be
- *> selected, and otherwise it returns .FALSE.
--*> It is used by DCHK41 to test if DGEES succesfully sorts eigenvalues,
--*> and by DCHK43 to test if DGEESX succesfully sorts eigenvalues.
-+*> It is used by DCHK41 to test if DGEES successfully sorts eigenvalues,
-+*> and by DCHK43 to test if DGEESX successfully sorts eigenvalues.
- *>
- *> The common block /SSLCT/ controls how eigenvalues are selected.
- *> If SELOPT = 0, then DSLECT return .TRUE. when ZR is less than zero,
---- a/TESTING/EIG/slctes.f
-+++ b/TESTING/EIG/slctes.f
-@@ -26,7 +26,7 @@
- *> .FALSE..
- *>
- *> It is used by the test routine SDRGES to test whether the driver
--*> routine SGGES succesfully sorts eigenvalues.
-+*> routine SGGES successfully sorts eigenvalues.
- *> \endverbatim
- *
- * Arguments:
---- a/TESTING/EIG/sslect.f
-+++ b/TESTING/EIG/sslect.f
-@@ -22,8 +22,8 @@
- *>
- *> SSLECT returns .TRUE. if the eigenvalue ZR+sqrt(-1)*ZI is to be
- *> selected, and otherwise it returns .FALSE.
--*> It is used by SCHK41 to test if SGEES succesfully sorts eigenvalues,
--*> and by SCHK43 to test if SGEESX succesfully sorts eigenvalues.
-+*> It is used by SCHK41 to test if SGEES successfully sorts eigenvalues,
-+*> and by SCHK43 to test if SGEESX successfully sorts eigenvalues.
- *>
- *> The common block /SSLCT/ controls how eigenvalues are selected.
- *> If SELOPT = 0, then SSLECT return .TRUE. when ZR is less than zero,
---- a/TESTING/EIG/zlctes.f
-+++ b/TESTING/EIG/zlctes.f
-@@ -25,7 +25,7 @@
- *> eigenvalue is negative), and otherwise it returns .FALSE..
- *>
- *> It is used by the test routine ZDRGES to test whether the driver
--*> routine ZGGES succesfully sorts eigenvalues.
-+*> routine ZGGES successfully sorts eigenvalues.
- *> \endverbatim
- *
- * Arguments:
---- a/TESTING/EIG/zslect.f
-+++ b/TESTING/EIG/zslect.f
-@@ -22,8 +22,8 @@
- *>
- *> ZSLECT returns .TRUE. if the eigenvalue Z is to be selected,
- *> otherwise it returns .FALSE.
--*> It is used by ZCHK41 to test if ZGEES succesfully sorts eigenvalues,
--*> and by ZCHK43 to test if ZGEESX succesfully sorts eigenvalues.
-+*> It is used by ZCHK41 to test if ZGEES successfully sorts eigenvalues,
-+*> and by ZCHK43 to test if ZGEESX successfully sorts eigenvalues.
- *>
- *> The common block /SSLCT/ controls how eigenvalues are selected.
- *> If SELOPT = 0, then ZSLECT return .TRUE. when real(Z) is less than
---- a/TESTING/MATGEN/clatm2.f
-+++ b/TESTING/MATGEN/clatm2.f
-@@ -30,7 +30,7 @@
- *> \verbatim
- *>
- *> CLATM2 returns the (I,J) entry of a random matrix of dimension
--*> (M, N) described by the other paramters. It is called by the
-+*> (M, N) described by the other parameters. It is called by the
- *> CLATMR routine in order to build random test matrices. No error
- *> checking on parameters is done, because this routine is called in
- *> a tight loop by CLATMR which has already checked the parameters.
---- a/TESTING/MATGEN/clatm3.f
-+++ b/TESTING/MATGEN/clatm3.f
-@@ -32,7 +32,7 @@
- *> \verbatim
- *>
- *> CLATM3 returns the (ISUB,JSUB) entry of a random matrix of
--*> dimension (M, N) described by the other paramters. (ISUB,JSUB)
-+*> dimension (M, N) described by the other parameters. (ISUB,JSUB)
- *> is the final position of the (I,J) entry after pivoting
- *> according to IPVTNG and IWORK. CLATM3 is called by the
- *> CLATMR routine in order to build random test matrices. No error
---- a/TESTING/MATGEN/clatm5.f
-+++ b/TESTING/MATGEN/clatm5.f
-@@ -48,7 +48,7 @@
- *> \param[in] PRTYPE
- *> \verbatim
- *> PRTYPE is INTEGER
--*> "Points" to a certian type of the matrices to generate
-+*> "Points" to a certain type of the matrices to generate
- *> (see futher details).
- *> \endverbatim
- *>
---- a/TESTING/MATGEN/dlatm2.f
-+++ b/TESTING/MATGEN/dlatm2.f
-@@ -30,7 +30,7 @@
- *> \verbatim
- *>
- *> DLATM2 returns the (I,J) entry of a random matrix of dimension
--*> (M, N) described by the other paramters. It is called by the
-+*> (M, N) described by the other parameters. It is called by the
- *> DLATMR routine in order to build random test matrices. No error
- *> checking on parameters is done, because this routine is called in
- *> a tight loop by DLATMR which has already checked the parameters.
---- a/TESTING/MATGEN/dlatm3.f
-+++ b/TESTING/MATGEN/dlatm3.f
-@@ -32,7 +32,7 @@
- *> \verbatim
- *>
- *> DLATM3 returns the (ISUB,JSUB) entry of a random matrix of
--*> dimension (M, N) described by the other paramters. (ISUB,JSUB)
-+*> dimension (M, N) described by the other parameters. (ISUB,JSUB)
- *> is the final position of the (I,J) entry after pivoting
- *> according to IPVTNG and IWORK. DLATM3 is called by the
- *> DLATMR routine in order to build random test matrices. No error
---- a/TESTING/MATGEN/dlatm5.f
-+++ b/TESTING/MATGEN/dlatm5.f
-@@ -48,7 +48,7 @@
- *> \param[in] PRTYPE
- *> \verbatim
- *> PRTYPE is INTEGER
--*> "Points" to a certian type of the matrices to generate
-+*> "Points" to a certain type of the matrices to generate
- *> (see futher details).
- *> \endverbatim
- *>
---- a/TESTING/MATGEN/slatm2.f
-+++ b/TESTING/MATGEN/slatm2.f
-@@ -30,7 +30,7 @@
- *> \verbatim
- *>
- *> SLATM2 returns the (I,J) entry of a random matrix of dimension
--*> (M, N) described by the other paramters. It is called by the
-+*> (M, N) described by the other parameters. It is called by the
- *> SLATMR routine in order to build random test matrices. No error
- *> checking on parameters is done, because this routine is called in
- *> a tight loop by SLATMR which has already checked the parameters.
---- a/TESTING/MATGEN/slatm3.f
-+++ b/TESTING/MATGEN/slatm3.f
-@@ -32,7 +32,7 @@
- *> \verbatim
- *>
- *> SLATM3 returns the (ISUB,JSUB) entry of a random matrix of
--*> dimension (M, N) described by the other paramters. (ISUB,JSUB)
-+*> dimension (M, N) described by the other parameters. (ISUB,JSUB)
- *> is the final position of the (I,J) entry after pivoting
- *> according to IPVTNG and IWORK. SLATM3 is called by the
- *> SLATMR routine in order to build random test matrices. No error
---- a/TESTING/MATGEN/slatm5.f
-+++ b/TESTING/MATGEN/slatm5.f
-@@ -48,7 +48,7 @@
- *> \param[in] PRTYPE
- *> \verbatim
- *> PRTYPE is INTEGER
--*> "Points" to a certian type of the matrices to generate
-+*> "Points" to a certain type of the matrices to generate
- *> (see futher details).
- *> \endverbatim
- *>
---- a/TESTING/MATGEN/zlatm2.f
-+++ b/TESTING/MATGEN/zlatm2.f
-@@ -30,7 +30,7 @@
- *> \verbatim
- *>
- *> ZLATM2 returns the (I,J) entry of a random matrix of dimension
--*> (M, N) described by the other paramters. It is called by the
-+*> (M, N) described by the other parameters. It is called by the
- *> ZLATMR routine in order to build random test matrices. No error
- *> checking on parameters is done, because this routine is called in
- *> a tight loop by ZLATMR which has already checked the parameters.
---- a/TESTING/MATGEN/zlatm3.f
-+++ b/TESTING/MATGEN/zlatm3.f
-@@ -32,7 +32,7 @@
- *> \verbatim
- *>
- *> ZLATM3 returns the (ISUB,JSUB) entry of a random matrix of
--*> dimension (M, N) described by the other paramters. (ISUB,JSUB)
-+*> dimension (M, N) described by the other parameters. (ISUB,JSUB)
- *> is the final position of the (I,J) entry after pivoting
- *> according to IPVTNG and IWORK. ZLATM3 is called by the
- *> ZLATMR routine in order to build random test matrices. No error
---- a/TESTING/MATGEN/zlatm5.f
-+++ b/TESTING/MATGEN/zlatm5.f
-@@ -48,7 +48,7 @@
- *> \param[in] PRTYPE
- *> \verbatim
- *> PRTYPE is INTEGER
--*> "Points" to a certian type of the matrices to generate
-+*> "Points" to a certain type of the matrices to generate
- *> (see futher details).
- *> \endverbatim
- *>
---- a/SRC/dsgesv.f
-+++ b/SRC/dsgesv.f
-@@ -164,7 +164,7 @@
- *> -3 : failure of SGETRF
- *> -31: stop the iterative refinement after the 30th
- *> iterations
--*> > 0: iterative refinement has been sucessfully used.
-+*> > 0: iterative refinement has been successfully used.
- *> Returns the number of iterations
- *> \endverbatim
- *>
---- a/SRC/dsposv.f
-+++ b/SRC/dsposv.f
-@@ -168,7 +168,7 @@
- *> -3 : failure of SPOTRF
- *> -31: stop the iterative refinement after the 30th
- *> iterations
--*> > 0: iterative refinement has been sucessfully used.
-+*> > 0: iterative refinement has been successfully used.
- *> Returns the number of iterations
- *> \endverbatim
- *>
---- a/TESTING/EIG/cdrvvx.f
-+++ b/TESTING/EIG/cdrvvx.f
-@@ -446,7 +446,7 @@
- *> \verbatim
- *> INFO is INTEGER
- *> If 0, then successful exit.
--*> If <0, then input paramter -INFO is incorrect.
-+*> If <0, then input parameter -INFO is incorrect.
- *> If >0, CLATMR, CLATMS, CLATME or CGET23 returned an error
- *> code, and INFO is its absolute value.
- *>
---- a/TESTING/EIG/ddrvvx.f
-+++ b/TESTING/EIG/ddrvvx.f
-@@ -471,7 +471,7 @@
- *> \verbatim
- *> INFO is INTEGER
- *> If 0, then successful exit.
--*> If <0, then input paramter -INFO is incorrect.
-+*> If <0, then input parameter -INFO is incorrect.
- *> If >0, DLATMR, SLATMS, SLATME or DGET23 returned an error
- *> code, and INFO is its absolute value.
- *>
---- a/TESTING/EIG/sdrvvx.f
-+++ b/TESTING/EIG/sdrvvx.f
-@@ -470,7 +470,7 @@
- *> \verbatim
- *> INFO is INTEGER
- *> If 0, then successful exit.
--*> If <0, then input paramter -INFO is incorrect.
-+*> If <0, then input parameter -INFO is incorrect.
- *> If >0, SLATMR, SLATMS, SLATME or SGET23 returned an error
- *> code, and INFO is its absolute value.
- *>
---- a/TESTING/EIG/zdrvvx.f
-+++ b/TESTING/EIG/zdrvvx.f
-@@ -446,7 +446,7 @@
- *> \verbatim
- *> INFO is INTEGER
- *> If 0, then successful exit.
--*> If <0, then input paramter -INFO is incorrect.
-+*> If <0, then input parameter -INFO is incorrect.
- *> If >0, ZLATMR, CLATMS, CLATME or ZGET23 returned an error
- *> code, and INFO is its absolute value.
- *>
diff --git a/debian/patches/parallel_build.patch b/debian/patches/parallel_build.patch
deleted file mode 100644
index f9f97b1..0000000
--- a/debian/patches/parallel_build.patch
+++ /dev/null
@@ -1,23 +0,0 @@
-Description: Make build system compatible with parallel make (-jN)
-Author: Sébastien Villemot <sebastien at debian.org>
-Forwarded: yes, by email to lapack at cs.utk.edu on 2016-01-06
-Applied-Upstream: commit: r1672
-Last-Update: 2016-01-08
----
-This patch header follows DEP-3: http://dep.debian.net/deps/dep3/
---- a/TESTING/Makefile
-+++ b/TESTING/Makefile
-@@ -582,3 +582,5 @@ FRCEIG:
-
- FRC:
- @FRC=$(FRC)
-+
-+.NOTPARALLEL:
---- a/TESTING/LIN/Makefile
-+++ b/TESTING/LIN/Makefile
-@@ -339,3 +339,5 @@ zchkaa.o: zchkaa.f
-
- .f.o:
- $(FORTRAN) $(OPTS) -c $< -o $@
-+
-+.NOTPARALLEL:
diff --git a/debian/patches/series b/debian/patches/series
index b9646aa..fcfd422 100644
--- a/debian/patches/series
+++ b/debian/patches/series
@@ -1,7 +1,2 @@
-parallel_build.patch
-cblas-makerule.patch
icamax-izamax-extended-precision.patch
-cblas-test-output.patch
-cblas-zblat2.patch
doxygen-strip-source.patch
-fix-typos.patch
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/lapack.git
More information about the debian-science-commits
mailing list