Fix comments to generate wrapper correctly

diff --git a/SRC/cpstf2.f b/SRC/cpstf2.f
index 2e319133fd9262c69eefb7486a919e49c67a87b2..c2342cee648b98db27f0558a836732fdbcce2976 100644 (file)
--- a/SRC/cpstf2.f
+++ b/SRC/cpstf2.f
@@ -69,7 +69,7 @@
 *  LDA     (input) INTEGER
 *          The leading dimension of the array A.  LDA >= max(1,N).
 *
-*  WORK    REAL array, dimension (2*N)
+*  WORK    (workspace) REAL array, dimension (2*N)
 *          Work space.
 *
 *  INFO    (output) INTEGER

diff --git a/SRC/cpstrf.f b/SRC/cpstrf.f
index 895085286bd305f9e8a05c4a0142e117672f705c..6bffef1fa7008b4623e6d46c16177cada3c3841c 100644 (file)
--- a/SRC/cpstrf.f
+++ b/SRC/cpstrf.f
@@ -69,7 +69,7 @@
 *          will be used. The algorithm terminates at the (K-1)st step
 *          if the pivot <= TOL.
 *
-*  WORK    REAL array, dimension (2*N)
+*  WORK    (workspace) REAL array, dimension (2*N)
 *          Work space.
 *
 *  INFO    (output) INTEGER

diff --git a/SRC/ctfsm.f b/SRC/ctfsm.f
index ec8db864b3f7adcfe15c684f70695e71441f0869..2dcd5263487c064748ade68d36e62ddc9eebdf95 100644 (file)
--- a/SRC/ctfsm.f
+++ b/SRC/ctfsm.f
@@ -115,7 +115,7 @@
 *           even and is N when is odd.
 *           See the Note below for more details. Unchanged on exit.
 *
-*  B       (input/ouptut) COMPLEX array,  dimension (LDB,N)
+*  B       (input/output) COMPLEX array,  dimension (LDB,N)
 *           Before entry,  the leading  m by n part of the array  B must
 *           contain  the  right-hand  side  matrix  B,  and  on exit  is
 *           overwritten by the solution matrix  X.

diff --git a/SRC/dsgesv.f b/SRC/dsgesv.f
index 3ff3be781b43b4b8330d893701fc043f1a49e84c..da588a0a743d34fe2039c4ea377c93f92abb59c5 100644 (file)
--- a/SRC/dsgesv.f
+++ b/SRC/dsgesv.f
@@ -62,7 +62,7 @@
 *          The number of right hand sides, i.e., the number of columns
 *          of the matrix B.  NRHS >= 0.
 *
-*  A       (input or input/ouptut) DOUBLE PRECISION array,
+*  A       (input/output) DOUBLE PRECISION array,
 *          dimension (LDA,N)
 *          On entry, the N-by-N coefficient matrix A.
 *          On exit, if iterative refinement has been successfully used

diff --git a/SRC/dsposv.f b/SRC/dsposv.f
index 1f6846decaad04779d4bc56eaccedb10ef6190f6..36b89a442c217a596dbed4c77d8c4256289417ef 100644 (file)
--- a/SRC/dsposv.f
+++ b/SRC/dsposv.f
@@ -66,7 +66,7 @@
 *          The number of right hand sides, i.e., the number of columns
 *          of the matrix B.  NRHS >= 0.
 *
-*  A       (input or input/ouptut) DOUBLE PRECISION array,
+*  A       (input/output) DOUBLE PRECISION array,
 *          dimension (LDA,N)
 *          On entry, the symmetric matrix A.  If UPLO = 'U', the leading
 *          N-by-N upper triangular part of A contains the upper

diff --git a/SRC/spstf2.f b/SRC/spstf2.f
index df0530bf14ce4eca5f3cd86e4bab85f500eb09c9..142fbf89c0f13cb4a8639bd5c1d82abd9b34e9ef 100644 (file)
--- a/SRC/spstf2.f
+++ b/SRC/spstf2.f
@@ -68,7 +68,7 @@
 *  LDA     (input) INTEGER
 *          The leading dimension of the array A.  LDA >= max(1,N).
 *
-*  WORK    REAL array, dimension (2*N)
+*  WORK    (workspace) REAL array, dimension (2*N)
 *          Work space.
 *
 *  INFO    (output) INTEGER

diff --git a/SRC/spstrf.f b/SRC/spstrf.f
index cb217dabd2e1ec39d5d751ee9d313462c4336e4c..9e7509fee41ecd0b9eba0b058dd6fe1ce9cbd466 100644 (file)
--- a/SRC/spstrf.f
+++ b/SRC/spstrf.f
@@ -68,7 +68,7 @@
 *          will be used. The algorithm terminates at the (K-1)st step
 *          if the pivot <= TOL.
 *
-*  WORK    REAL array, dimension (2*N)
+*  WORK    (workspace) REAL array, dimension (2*N)
 *          Work space.
 *
 *  INFO    (output) INTEGER

diff --git a/SRC/stfsm.f b/SRC/stfsm.f
index d619cf0a51b629bb7cdb2a0387fab470e2f23500..6cc6f63a40a2b91041f4db84ae102acd173a659d 100644 (file)
--- a/SRC/stfsm.f
+++ b/SRC/stfsm.f
@@ -115,7 +115,7 @@
 *           even and is N when is odd.
 *           See the Note below for more details. Unchanged on exit.
 *
-*  B       (input/ouptut) REAL array,  DIMENSION (LDB,N)
+*  B       (input/output) REAL array,  DIMENSION (LDB,N)
 *           Before entry,  the leading  m by n part of the array  B must
 *           contain  the  right-hand  side  matrix  B,  and  on exit  is
 *           overwritten by the solution matrix  X.

diff --git a/SRC/zcgesv.f b/SRC/zcgesv.f
index b974de3c7ea796ed04ccc6b7123987621212eb9a..4700b2a74cbc945175ca6c3ea7cc35d8b6e23a13 100644 (file)
--- a/SRC/zcgesv.f
+++ b/SRC/zcgesv.f
@@ -63,7 +63,7 @@
 *          The number of right hand sides, i.e., the number of columns
 *          of the matrix B.  NRHS >= 0.
 *
-*  A       (input or input/ouptut) COMPLEX*16 array,
+*  A       (input/output) COMPLEX*16 array,
 *          dimension (LDA,N)
 *          On entry, the N-by-N coefficient matrix A.
 *          On exit, if iterative refinement has been successfully used

diff --git a/SRC/zcposv.f b/SRC/zcposv.f
index 8695db0ab844da2f1400eafa0606be80ff82e6b2..c67793619a9351d7b31f04efa9309a6c755225ea 100644 (file)
--- a/SRC/zcposv.f
+++ b/SRC/zcposv.f
@@ -69,7 +69,7 @@
 *          The number of right hand sides, i.e., the number of columns
 *          of the matrix B.  NRHS >= 0.
 *
-*  A       (input or input/ouptut) COMPLEX*16 array,
+*  A       (input/output) COMPLEX*16 array,
 *          dimension (LDA,N)
 *          On entry, the Hermitian matrix A. If UPLO = 'U', the leading
 *          N-by-N upper triangular part of A contains the upper

diff --git a/SRC/zpstf2.f b/SRC/zpstf2.f
index 3db059b1bfa2e7937a8a8b69640ec1037ae51832..b4c58f980d94a9892a91281ea4bcc8360b25124a 100644 (file)
--- a/SRC/zpstf2.f
+++ b/SRC/zpstf2.f
@@ -69,7 +69,7 @@
 *  LDA     (input) INTEGER
 *          The leading dimension of the array A.  LDA >= max(1,N).
 *
-*  WORK    DOUBLE PRECISION array, dimension (2*N)
+*  WORK    (workspace) DOUBLE PRECISION array, dimension (2*N)
 *          Work space.
 *
 *  INFO    (output) INTEGER

diff --git a/SRC/zpstrf.f b/SRC/zpstrf.f
index 3e09d8430ef3447ba678641c68b30d39cc3f4e83..cda1874c2947f9fa22609a072c7af5559d544d06 100644 (file)
--- a/SRC/zpstrf.f
+++ b/SRC/zpstrf.f
@@ -72,7 +72,7 @@
 *          will be used. The algorithm terminates at the (K-1)st step
 *          if the pivot <= TOL.
 *
-*  WORK    DOUBLE PRECISION array, dimension (2*N)
+*  WORK    (workspace) DOUBLE PRECISION array, dimension (2*N)
 *          Work space.
 *
 *  INFO    (output) INTEGER