ruby-lapack 1.7.1 → 1.7.2
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/Rakefile +1 -1
- data/dev/defs/claed7 +1 -1
- data/dev/defs/clarrv +1 -1
- data/dev/defs/dlaed1 +1 -1
- data/dev/defs/dlaed7 +1 -1
- data/dev/defs/dlag2 +16 -16
- data/dev/defs/dlag2s +13 -13
- data/dev/defs/dlarrf +1 -1
- data/dev/defs/dlarrv +1 -1
- data/dev/defs/dlasd1 +1 -1
- data/dev/defs/dlasd6 +1 -1
- data/dev/defs/slaed1 +1 -1
- data/dev/defs/slaed7 +1 -1
- data/dev/defs/slag2 +16 -16
- data/dev/defs/slarrf +1 -1
- data/dev/defs/slarrv +1 -1
- data/dev/defs/slasd1 +1 -1
- data/dev/defs/slasd6 +1 -1
- data/dev/defs/zlaed7 +1 -1
- data/dev/defs/zlag2c +13 -13
- data/dev/defs/zlarrv +1 -1
- data/dev/make_csrc.rb +8 -8
- data/dev/parse.rb +40 -44
- data/ext/claed7.c +1 -1
- data/ext/clarrv.c +1 -1
- data/ext/dlaed1.c +1 -1
- data/ext/dlaed7.c +1 -1
- data/ext/dlag2.c +1 -1
- data/ext/dlag2s.c +1 -1
- data/ext/dlarrf.c +1 -1
- data/ext/dlarrv.c +1 -1
- data/ext/dlasd1.c +1 -1
- data/ext/dlasd6.c +1 -1
- data/ext/extconf.rb +26 -12
- data/ext/f2c_minimal.h +4 -2
- data/ext/slaed1.c +1 -1
- data/ext/slaed7.c +1 -1
- data/ext/slag2.c +1 -1
- data/ext/slarrf.c +1 -1
- data/ext/slarrv.c +1 -1
- data/ext/slasd1.c +1 -1
- data/ext/slasd6.c +1 -1
- data/ext/zlaed7.c +1 -1
- data/ext/zlag2c.c +1 -1
- data/ext/zlarrv.c +1 -1
- metadata +3 -3
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA1:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: 098368c8e96980512abbc75217bf685e8f869612
|
4
|
+
data.tar.gz: 93f656be91a7ca10383d90b51f48c9865db19098
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: 92480b3239ecc8232967ba221beb59110b63c1ac9ad7c63cfb04195e8c36c1e8c3d6e22e97ffb7cef99bc46ce3967536f8257c36e1799a2bfe1c2a4895f276a7
|
7
|
+
data.tar.gz: 840315569edbcc4d4623fe6c5588fa8e23a243cb0ffc60747234e8612014c3ec74ffdc7f1911af8fb0d61450a323d4b1bd2c4d1be63342ae97441fb3e9cf286a
|
data/Rakefile
CHANGED
data/dev/defs/claed7
CHANGED
@@ -120,7 +120,7 @@
|
|
120
120
|
*\n\
|
121
121
|
* The first stage consists of deflating the size of the problem\n\
|
122
122
|
* when there are multiple eigenvalues or if there is a zero in\n\
|
123
|
-
* the Z vector. For each such
|
123
|
+
* the Z vector. For each such occurrence the dimension of the\n\
|
124
124
|
* secular equation problem is reduced by one. This stage is\n\
|
125
125
|
* performed by the routine SLAED2.\n\
|
126
126
|
*\n\
|
data/dev/defs/clarrv
CHANGED
@@ -134,7 +134,7 @@
|
|
134
134
|
* L (input/output) REAL array, dimension (N)\n\
|
135
135
|
* On entry, the (N-1) subdiagonal elements of the unit\n\
|
136
136
|
* bidiagonal matrix L are in elements 1 to N-1 of L\n\
|
137
|
-
* (if the matrix is not
|
137
|
+
* (if the matrix is not split.) At the end of each block\n\
|
138
138
|
* is stored the corresponding shift as given by SLARRE.\n\
|
139
139
|
* On exit, L is overwritten.\n\
|
140
140
|
*\n\
|
data/dev/defs/dlaed1
CHANGED
@@ -68,7 +68,7 @@
|
|
68
68
|
*\n\
|
69
69
|
* The first stage consists of deflating the size of the problem\n\
|
70
70
|
* when there are multiple eigenvalues or if there is a zero in\n\
|
71
|
-
* the Z vector. For each such
|
71
|
+
* the Z vector. For each such occurrence the dimension of the\n\
|
72
72
|
* secular equation problem is reduced by one. This stage is\n\
|
73
73
|
* performed by the routine DLAED2.\n\
|
74
74
|
*\n\
|
data/dev/defs/dlaed7
CHANGED
@@ -120,7 +120,7 @@
|
|
120
120
|
*\n\
|
121
121
|
* The first stage consists of deflating the size of the problem\n\
|
122
122
|
* when there are multiple eigenvalues or if there is a zero in\n\
|
123
|
-
* the Z vector. For each such
|
123
|
+
* the Z vector. For each such occurrence the dimension of the\n\
|
124
124
|
* secular equation problem is reduced by one. This stage is\n\
|
125
125
|
* performed by the routine DLAED8.\n\
|
126
126
|
*\n\
|
data/dev/defs/dlag2
CHANGED
@@ -1,42 +1,42 @@
|
|
1
|
-
---
|
1
|
+
---
|
2
2
|
:name: dlag2
|
3
3
|
:md5sum: cb3cffe0121d3cdef959429272b11c8d
|
4
4
|
:category: :subroutine
|
5
|
-
:arguments:
|
6
|
-
- a:
|
5
|
+
:arguments:
|
6
|
+
- a:
|
7
7
|
:type: doublereal
|
8
8
|
:intent: input
|
9
|
-
:dims:
|
9
|
+
:dims:
|
10
10
|
- lda
|
11
11
|
- "2"
|
12
|
-
- lda:
|
12
|
+
- lda:
|
13
13
|
:type: integer
|
14
14
|
:intent: input
|
15
|
-
- b:
|
15
|
+
- b:
|
16
16
|
:type: doublereal
|
17
17
|
:intent: input
|
18
|
-
:dims:
|
18
|
+
:dims:
|
19
19
|
- ldb
|
20
20
|
- "2"
|
21
|
-
- ldb:
|
21
|
+
- ldb:
|
22
22
|
:type: integer
|
23
23
|
:intent: input
|
24
|
-
- safmin:
|
24
|
+
- safmin:
|
25
25
|
:type: doublereal
|
26
26
|
:intent: input
|
27
|
-
- scale1:
|
27
|
+
- scale1:
|
28
28
|
:type: doublereal
|
29
29
|
:intent: output
|
30
|
-
- scale2:
|
30
|
+
- scale2:
|
31
31
|
:type: doublereal
|
32
32
|
:intent: output
|
33
|
-
- wr1:
|
33
|
+
- wr1:
|
34
34
|
:type: doublereal
|
35
35
|
:intent: output
|
36
|
-
- wr2:
|
36
|
+
- wr2:
|
37
37
|
:type: doublereal
|
38
38
|
:intent: output
|
39
|
-
- wi:
|
39
|
+
- wi:
|
40
40
|
:type: doublereal
|
41
41
|
:intent: output
|
42
42
|
:substitutions: {}
|
@@ -91,7 +91,7 @@
|
|
91
91
|
* will always be positive. If the eigenvalues are real, then\n\
|
92
92
|
* the first (real) eigenvalue is WR1 / SCALE1 , but this may\n\
|
93
93
|
* overflow or underflow, and in fact, SCALE1 may be zero or\n\
|
94
|
-
* less than the underflow
|
94
|
+
* less than the underflow threshold if the exact eigenvalue\n\
|
95
95
|
* is sufficiently large.\n\
|
96
96
|
*\n\
|
97
97
|
* SCALE2 (output) DOUBLE PRECISION\n\
|
@@ -101,7 +101,7 @@
|
|
101
101
|
* eigenvalues are real, then the second (real) eigenvalue is\n\
|
102
102
|
* WR2 / SCALE2 , but this may overflow or underflow, and in\n\
|
103
103
|
* fact, SCALE2 may be zero or less than the underflow\n\
|
104
|
-
*
|
104
|
+
* threshold if the exact eigenvalue is sufficiently large.\n\
|
105
105
|
*\n\
|
106
106
|
* WR1 (output) DOUBLE PRECISION\n\
|
107
107
|
* If the eigenvalue is real, then WR1 is SCALE1 times the\n\
|
data/dev/defs/dlag2s
CHANGED
@@ -1,36 +1,36 @@
|
|
1
|
-
---
|
1
|
+
---
|
2
2
|
:name: dlag2s
|
3
3
|
:md5sum: 669e5e37ddea7cbcff65fc0b9ae1eca2
|
4
4
|
:category: :subroutine
|
5
|
-
:arguments:
|
6
|
-
- m:
|
5
|
+
:arguments:
|
6
|
+
- m:
|
7
7
|
:type: integer
|
8
8
|
:intent: input
|
9
|
-
- n:
|
9
|
+
- n:
|
10
10
|
:type: integer
|
11
11
|
:intent: input
|
12
|
-
- a:
|
12
|
+
- a:
|
13
13
|
:type: doublereal
|
14
14
|
:intent: input
|
15
|
-
:dims:
|
15
|
+
:dims:
|
16
16
|
- lda
|
17
17
|
- n
|
18
|
-
- lda:
|
18
|
+
- lda:
|
19
19
|
:type: integer
|
20
20
|
:intent: input
|
21
|
-
- sa:
|
21
|
+
- sa:
|
22
22
|
:type: real
|
23
23
|
:intent: output
|
24
|
-
:dims:
|
24
|
+
:dims:
|
25
25
|
- ldsa
|
26
26
|
- n
|
27
|
-
- ldsa:
|
27
|
+
- ldsa:
|
28
28
|
:type: integer
|
29
29
|
:intent: input
|
30
|
-
- info:
|
30
|
+
- info:
|
31
31
|
:type: integer
|
32
32
|
:intent: output
|
33
|
-
:substitutions:
|
33
|
+
:substitutions:
|
34
34
|
ldsa: MAX(1,m)
|
35
35
|
:fortran_help: " SUBROUTINE DLAG2S( M, N, A, LDA, SA, LDSA, INFO )\n\n\
|
36
36
|
* Purpose\n\
|
@@ -41,7 +41,7 @@
|
|
41
41
|
*\n\
|
42
42
|
* RMAX is the overflow for the SINGLE PRECISION arithmetic\n\
|
43
43
|
* DLAG2S checks that all the entries of A are between -RMAX and\n\
|
44
|
-
* RMAX. If not the
|
44
|
+
* RMAX. If not the conversion is aborted and a flag is raised.\n\
|
45
45
|
*\n\
|
46
46
|
* This is an auxiliary routine so there is no argument checking.\n\
|
47
47
|
*\n\n\
|
data/dev/defs/dlarrf
CHANGED
@@ -91,7 +91,7 @@
|
|
91
91
|
* =========\n\
|
92
92
|
*\n\
|
93
93
|
* N (input) INTEGER\n\
|
94
|
-
* The order of the matrix (subblock, if the matrix
|
94
|
+
* The order of the matrix (subblock, if the matrix split).\n\
|
95
95
|
*\n\
|
96
96
|
* D (input) DOUBLE PRECISION array, dimension (N)\n\
|
97
97
|
* The N diagonal elements of the diagonal matrix D.\n\
|
data/dev/defs/dlarrv
CHANGED
@@ -134,7 +134,7 @@
|
|
134
134
|
* L (input/output) DOUBLE PRECISION array, dimension (N)\n\
|
135
135
|
* On entry, the (N-1) subdiagonal elements of the unit\n\
|
136
136
|
* bidiagonal matrix L are in elements 1 to N-1 of L\n\
|
137
|
-
* (if the matrix is not
|
137
|
+
* (if the matrix is not split.) At the end of each block\n\
|
138
138
|
* is stored the corresponding shift as given by DLARRE.\n\
|
139
139
|
* On exit, L is overwritten.\n\
|
140
140
|
*\n\
|
data/dev/defs/dlasd1
CHANGED
@@ -90,7 +90,7 @@
|
|
90
90
|
*\n\
|
91
91
|
* The first stage consists of deflating the size of the problem\n\
|
92
92
|
* when there are multiple singular values or when there are zeros in\n\
|
93
|
-
* the Z vector. For each such
|
93
|
+
* the Z vector. For each such occurrence the dimension of the\n\
|
94
94
|
* secular equation problem is reduced by one. This stage is\n\
|
95
95
|
* performed by the routine DLASD2.\n\
|
96
96
|
*\n\
|
data/dev/defs/dlasd6
CHANGED
@@ -152,7 +152,7 @@
|
|
152
152
|
*\n\
|
153
153
|
* The first stage consists of deflating the size of the problem\n\
|
154
154
|
* when there are multiple singular values or if there is a zero\n\
|
155
|
-
* in the Z vector. For each such
|
155
|
+
* in the Z vector. For each such occurrence the dimension of the\n\
|
156
156
|
* secular equation problem is reduced by one. This stage is\n\
|
157
157
|
* performed by the routine DLASD7.\n\
|
158
158
|
*\n\
|
data/dev/defs/slaed1
CHANGED
@@ -68,7 +68,7 @@
|
|
68
68
|
*\n\
|
69
69
|
* The first stage consists of deflating the size of the problem\n\
|
70
70
|
* when there are multiple eigenvalues or if there is a zero in\n\
|
71
|
-
* the Z vector. For each such
|
71
|
+
* the Z vector. For each such occurrence the dimension of the\n\
|
72
72
|
* secular equation problem is reduced by one. This stage is\n\
|
73
73
|
* performed by the routine SLAED2.\n\
|
74
74
|
*\n\
|
data/dev/defs/slaed7
CHANGED
@@ -120,7 +120,7 @@
|
|
120
120
|
*\n\
|
121
121
|
* The first stage consists of deflating the size of the problem\n\
|
122
122
|
* when there are multiple eigenvalues or if there is a zero in\n\
|
123
|
-
* the Z vector. For each such
|
123
|
+
* the Z vector. For each such occurrence the dimension of the\n\
|
124
124
|
* secular equation problem is reduced by one. This stage is\n\
|
125
125
|
* performed by the routine SLAED8.\n\
|
126
126
|
*\n\
|
data/dev/defs/slag2
CHANGED
@@ -1,42 +1,42 @@
|
|
1
|
-
---
|
1
|
+
---
|
2
2
|
:name: slag2
|
3
3
|
:md5sum: 4299c5465453583eb5c3f7ba95c8c2df
|
4
4
|
:category: :subroutine
|
5
|
-
:arguments:
|
6
|
-
- a:
|
5
|
+
:arguments:
|
6
|
+
- a:
|
7
7
|
:type: real
|
8
8
|
:intent: input
|
9
|
-
:dims:
|
9
|
+
:dims:
|
10
10
|
- lda
|
11
11
|
- "2"
|
12
|
-
- lda:
|
12
|
+
- lda:
|
13
13
|
:type: integer
|
14
14
|
:intent: input
|
15
|
-
- b:
|
15
|
+
- b:
|
16
16
|
:type: real
|
17
17
|
:intent: input
|
18
|
-
:dims:
|
18
|
+
:dims:
|
19
19
|
- ldb
|
20
20
|
- "2"
|
21
|
-
- ldb:
|
21
|
+
- ldb:
|
22
22
|
:type: integer
|
23
23
|
:intent: input
|
24
|
-
- safmin:
|
24
|
+
- safmin:
|
25
25
|
:type: real
|
26
26
|
:intent: input
|
27
|
-
- scale1:
|
27
|
+
- scale1:
|
28
28
|
:type: real
|
29
29
|
:intent: output
|
30
|
-
- scale2:
|
30
|
+
- scale2:
|
31
31
|
:type: real
|
32
32
|
:intent: output
|
33
|
-
- wr1:
|
33
|
+
- wr1:
|
34
34
|
:type: real
|
35
35
|
:intent: output
|
36
|
-
- wr2:
|
36
|
+
- wr2:
|
37
37
|
:type: real
|
38
38
|
:intent: output
|
39
|
-
- wi:
|
39
|
+
- wi:
|
40
40
|
:type: real
|
41
41
|
:intent: output
|
42
42
|
:substitutions: {}
|
@@ -91,7 +91,7 @@
|
|
91
91
|
* will always be positive. If the eigenvalues are real, then\n\
|
92
92
|
* the first (real) eigenvalue is WR1 / SCALE1 , but this may\n\
|
93
93
|
* overflow or underflow, and in fact, SCALE1 may be zero or\n\
|
94
|
-
* less than the underflow
|
94
|
+
* less than the underflow threshold if the exact eigenvalue\n\
|
95
95
|
* is sufficiently large.\n\
|
96
96
|
*\n\
|
97
97
|
* SCALE2 (output) REAL\n\
|
@@ -101,7 +101,7 @@
|
|
101
101
|
* eigenvalues are real, then the second (real) eigenvalue is\n\
|
102
102
|
* WR2 / SCALE2 , but this may overflow or underflow, and in\n\
|
103
103
|
* fact, SCALE2 may be zero or less than the underflow\n\
|
104
|
-
*
|
104
|
+
* threshold if the exact eigenvalue is sufficiently large.\n\
|
105
105
|
*\n\
|
106
106
|
* WR1 (output) REAL\n\
|
107
107
|
* If the eigenvalue is real, then WR1 is SCALE1 times the\n\
|
data/dev/defs/slarrf
CHANGED
@@ -91,7 +91,7 @@
|
|
91
91
|
* =========\n\
|
92
92
|
*\n\
|
93
93
|
* N (input) INTEGER\n\
|
94
|
-
* The order of the matrix (subblock, if the matrix
|
94
|
+
* The order of the matrix (subblock, if the matrix split).\n\
|
95
95
|
*\n\
|
96
96
|
* D (input) REAL array, dimension (N)\n\
|
97
97
|
* The N diagonal elements of the diagonal matrix D.\n\
|
data/dev/defs/slarrv
CHANGED
@@ -134,7 +134,7 @@
|
|
134
134
|
* L (input/output) REAL array, dimension (N)\n\
|
135
135
|
* On entry, the (N-1) subdiagonal elements of the unit\n\
|
136
136
|
* bidiagonal matrix L are in elements 1 to N-1 of L\n\
|
137
|
-
* (if the matrix is not
|
137
|
+
* (if the matrix is not split.) At the end of each block\n\
|
138
138
|
* is stored the corresponding shift as given by SLARRE.\n\
|
139
139
|
* On exit, L is overwritten.\n\
|
140
140
|
*\n\
|
data/dev/defs/slasd1
CHANGED
@@ -89,7 +89,7 @@
|
|
89
89
|
*\n\
|
90
90
|
* The first stage consists of deflating the size of the problem\n\
|
91
91
|
* when there are multiple singular values or when there are zeros in\n\
|
92
|
-
* the Z vector. For each such
|
92
|
+
* the Z vector. For each such occurrence the dimension of the\n\
|
93
93
|
* secular equation problem is reduced by one. This stage is\n\
|
94
94
|
* performed by the routine SLASD2.\n\
|
95
95
|
*\n\
|
data/dev/defs/slasd6
CHANGED
@@ -152,7 +152,7 @@
|
|
152
152
|
*\n\
|
153
153
|
* The first stage consists of deflating the size of the problem\n\
|
154
154
|
* when there are multiple singular values or if there is a zero\n\
|
155
|
-
* in the Z vector. For each such
|
155
|
+
* in the Z vector. For each such occurrence the dimension of the\n\
|
156
156
|
* secular equation problem is reduced by one. This stage is\n\
|
157
157
|
* performed by the routine SLASD7.\n\
|
158
158
|
*\n\
|
data/dev/defs/zlaed7
CHANGED
@@ -120,7 +120,7 @@
|
|
120
120
|
*\n\
|
121
121
|
* The first stage consists of deflating the size of the problem\n\
|
122
122
|
* when there are multiple eigenvalues or if there is a zero in\n\
|
123
|
-
* the Z vector. For each such
|
123
|
+
* the Z vector. For each such occurrence the dimension of the\n\
|
124
124
|
* secular equation problem is reduced by one. This stage is\n\
|
125
125
|
* performed by the routine DLAED2.\n\
|
126
126
|
*\n\
|
data/dev/defs/zlag2c
CHANGED
@@ -1,36 +1,36 @@
|
|
1
|
-
---
|
1
|
+
---
|
2
2
|
:name: zlag2c
|
3
3
|
:md5sum: 74fe0ffefcc616f52a172abaa7fccf0d
|
4
4
|
:category: :subroutine
|
5
|
-
:arguments:
|
6
|
-
- m:
|
5
|
+
:arguments:
|
6
|
+
- m:
|
7
7
|
:type: integer
|
8
8
|
:intent: input
|
9
|
-
- n:
|
9
|
+
- n:
|
10
10
|
:type: integer
|
11
11
|
:intent: input
|
12
|
-
- a:
|
12
|
+
- a:
|
13
13
|
:type: doublecomplex
|
14
14
|
:intent: input
|
15
|
-
:dims:
|
15
|
+
:dims:
|
16
16
|
- lda
|
17
17
|
- n
|
18
|
-
- lda:
|
18
|
+
- lda:
|
19
19
|
:type: integer
|
20
20
|
:intent: input
|
21
|
-
- sa:
|
21
|
+
- sa:
|
22
22
|
:type: complex
|
23
23
|
:intent: output
|
24
|
-
:dims:
|
24
|
+
:dims:
|
25
25
|
- ldsa
|
26
26
|
- n
|
27
|
-
- ldsa:
|
27
|
+
- ldsa:
|
28
28
|
:type: integer
|
29
29
|
:intent: input
|
30
|
-
- info:
|
30
|
+
- info:
|
31
31
|
:type: integer
|
32
32
|
:intent: output
|
33
|
-
:substitutions:
|
33
|
+
:substitutions:
|
34
34
|
ldsa: MAX(1,m)
|
35
35
|
:fortran_help: " SUBROUTINE ZLAG2C( M, N, A, LDA, SA, LDSA, INFO )\n\n\
|
36
36
|
* Purpose\n\
|
@@ -40,7 +40,7 @@
|
|
40
40
|
*\n\
|
41
41
|
* RMAX is the overflow for the SINGLE PRECISION arithmetic\n\
|
42
42
|
* ZLAG2C checks that all the entries of A are between -RMAX and\n\
|
43
|
-
* RMAX. If not the
|
43
|
+
* RMAX. If not the conversion is aborted and a flag is raised.\n\
|
44
44
|
*\n\
|
45
45
|
* This is an auxiliary routine so there is no argument checking.\n\
|
46
46
|
*\n\n\
|
data/dev/defs/zlarrv
CHANGED
@@ -134,7 +134,7 @@
|
|
134
134
|
* L (input/output) DOUBLE PRECISION array, dimension (N)\n\
|
135
135
|
* On entry, the (N-1) subdiagonal elements of the unit\n\
|
136
136
|
* bidiagonal matrix L are in elements 1 to N-1 of L\n\
|
137
|
-
* (if the matrix is not
|
137
|
+
* (if the matrix is not split.) At the end of each block\n\
|
138
138
|
* is stored the corresponding shift as given by DLARRE.\n\
|
139
139
|
* On exit, L is overwritten.\n\
|
140
140
|
*\n\
|
data/dev/make_csrc.rb
CHANGED
@@ -150,7 +150,7 @@ end
|
|
150
150
|
|
151
151
|
|
152
152
|
|
153
|
-
def create_code(name, flag)
|
153
|
+
def create_code(name, flag, debug)
|
154
154
|
def_fname = File.join(TOPDIR, "dev", "defs", name)
|
155
155
|
hash = nil
|
156
156
|
begin
|
@@ -255,7 +255,7 @@ def create_code(name, flag)
|
|
255
255
|
inputs.delete(k)
|
256
256
|
end
|
257
257
|
|
258
|
-
if
|
258
|
+
if debug
|
259
259
|
p "inputs"
|
260
260
|
p inputs
|
261
261
|
p "outputs"
|
@@ -481,7 +481,7 @@ EOF
|
|
481
481
|
end
|
482
482
|
order = new_order
|
483
483
|
|
484
|
-
if
|
484
|
+
if debug
|
485
485
|
p "order"
|
486
486
|
pp order
|
487
487
|
end
|
@@ -756,14 +756,14 @@ EOF
|
|
756
756
|
return [code_all, sub_name]
|
757
757
|
end
|
758
758
|
|
759
|
-
def generate_code(fnames, names)
|
759
|
+
def generate_code(fnames, names, debug)
|
760
760
|
nfnames = fnames.length
|
761
761
|
sub_names = Array.new
|
762
762
|
fnames.each_with_index{|fname,i|
|
763
763
|
print "#{i+1}/#{nfnames}\n" if (i+1)%100==0
|
764
764
|
name = File.basename(fname)
|
765
765
|
flag = names.nil? || names.include?(name)
|
766
|
-
code, sub_name = create_code(name, flag)
|
766
|
+
code, sub_name = create_code(name, flag, debug)
|
767
767
|
if code
|
768
768
|
sub_names.push sub_name
|
769
769
|
if flag
|
@@ -846,7 +846,7 @@ end
|
|
846
846
|
|
847
847
|
|
848
848
|
|
849
|
-
|
849
|
+
debug = ARGV.delete("--debug")
|
850
850
|
|
851
851
|
#dname = ARGV.shift || raise("Usage: ruby #$0 path_to_lapack_src [name0, name1, ..]")
|
852
852
|
dname = File.join(TOPDIR, "dev", "defs")
|
@@ -856,7 +856,7 @@ end
|
|
856
856
|
|
857
857
|
unless ARGV.empty?
|
858
858
|
names = ARGV
|
859
|
-
|
859
|
+
debug = true
|
860
860
|
else
|
861
861
|
names = nil
|
862
862
|
end
|
@@ -864,4 +864,4 @@ end
|
|
864
864
|
reg = File.join(dname, "[a-z]*[a-z0-9]")
|
865
865
|
fnames = Dir[reg]
|
866
866
|
|
867
|
-
generate_code(fnames, names)
|
867
|
+
generate_code(fnames, names, debug)
|