Skip to content

Commit d24495f

Browse files
luzpazelmar-peise
luzpaz
authored and
elmar-peise
committed
Misc. typos (#9)
Found via downstream repo OpenBLAS using `codespell -q 3`
1 parent 0ca9d69 commit d24495f

File tree

8 files changed

+38
-38
lines changed

8 files changed

+38
-38
lines changed

‎config.h

+3-3
Original file line numberDiff line numberDiff line change
@@ -5,9 +5,9 @@
55
// See also config.md
66

77

8-
///////////////////////////////
9-
// BLAS/LAPACK obect symbols //
10-
///////////////////////////////
8+
////////////////////////////////
9+
// BLAS/LAPACK object symbols //
10+
////////////////////////////////
1111

1212
// BLAS routines linked against have a trailing underscore
1313
#define BLAS_UNDERSCORE 1

‎src/chetrf_rook_rec2.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@
1717
static complex c_b1 = {1.f,0.f};
1818
static int c__1 = 1;
1919

20-
/** CHETRF_ROOK_REC2 computes a partial factorization of a complex Hermitian indefinite matrix using the boun ded Bunch-Kaufman ("rook") diagonal pivoting method
20+
/** CHETRF_ROOK_REC2 computes a partial factorization of a complex Hermitian indefinite matrix using the bounded Bunch-Kaufman ("rook") diagonal pivoting method
2121
*
2222
* This routine is a minor modification of LAPACK's clahef_rook.
2323
* It serves as an unblocked kernel in the recursive algorithms.

‎src/ctrsyl.c

+8-8
Original file line numberDiff line numberDiff line change
@@ -100,21 +100,21 @@ static void RELAPACK_ctrsyl_rec(
100100
float *const C_B = C + 2 * m1;
101101

102102
if (*tranA == 'N') {
103-
// recusion(A_BR, B, C_B)
103+
// recursion(A_BR, B, C_B)
104104
RELAPACK_ctrsyl_rec(tranA, tranB, isgn, &m2, n, A_BR, ldA, B, ldB, C_B, ldC, scale1, info1);
105105
// C_T = C_T - A_TR * C_B
106106
BLAS(cgemm)("N", "N", &m1, n, &m2, MONE, A_TR, ldA, C_B, ldC, scale1, C_T, ldC);
107-
// recusion(A_TL, B, C_T)
107+
// recursion(A_TL, B, C_T)
108108
RELAPACK_ctrsyl_rec(tranA, tranB, isgn, &m1, n, A_TL, ldA, B, ldB, C_T, ldC, scale2, info2);
109109
// apply scale
110110
if (scale2[0] != 1)
111111
LAPACK(clascl)("G", iONE, iONE, ONE, scale2, &m2, n, C_B, ldC, info);
112112
} else {
113-
// recusion(A_TL, B, C_T)
113+
// recursion(A_TL, B, C_T)
114114
RELAPACK_ctrsyl_rec(tranA, tranB, isgn, &m1, n, A_TL, ldA, B, ldB, C_T, ldC, scale1, info1);
115115
// C_B = C_B - A_TR' * C_T
116116
BLAS(cgemm)("C", "N", &m2, n, &m1, MONE, A_TR, ldA, C_T, ldC, scale1, C_B, ldC);
117-
// recusion(A_BR, B, C_B)
117+
// recursion(A_BR, B, C_B)
118118
RELAPACK_ctrsyl_rec(tranA, tranB, isgn, &m2, n, A_BR, ldA, B, ldB, C_B, ldC, scale2, info2);
119119
// apply scale
120120
if (scale2[0] != 1)
@@ -136,21 +136,21 @@ static void RELAPACK_ctrsyl_rec(
136136
float *const C_R = C + 2 * *ldC * n1;
137137

138138
if (*tranB == 'N') {
139-
// recusion(A, B_TL, C_L)
139+
// recursion(A, B_TL, C_L)
140140
RELAPACK_ctrsyl_rec(tranA, tranB, isgn, m, &n1, A, ldA, B_TL, ldB, C_L, ldC, scale1, info1);
141141
// C_R = C_R -/+ C_L * B_TR
142142
BLAS(cgemm)("N", "N", m, &n2, &n1, MSGN, C_L, ldC, B_TR, ldB, scale1, C_R, ldC);
143-
// recusion(A, B_BR, C_R)
143+
// recursion(A, B_BR, C_R)
144144
RELAPACK_ctrsyl_rec(tranA, tranB, isgn, m, &n2, A, ldA, B_BR, ldB, C_R, ldC, scale2, info2);
145145
// apply scale
146146
if (scale2[0] != 1)
147147
LAPACK(clascl)("G", iONE, iONE, ONE, scale2, m, &n1, C_L, ldC, info);
148148
} else {
149-
// recusion(A, B_BR, C_R)
149+
// recursion(A, B_BR, C_R)
150150
RELAPACK_ctrsyl_rec(tranA, tranB, isgn, m, &n2, A, ldA, B_BR, ldB, C_R, ldC, scale1, info1);
151151
// C_L = C_L -/+ C_R * B_TR'
152152
BLAS(cgemm)("N", "C", m, &n1, &n2, MSGN, C_R, ldC, B_TR, ldB, scale1, C_L, ldC);
153-
// recusion(A, B_TL, C_L)
153+
// recursion(A, B_TL, C_L)
154154
RELAPACK_ctrsyl_rec(tranA, tranB, isgn, m, &n1, A, ldA, B_TL, ldB, C_L, ldC, scale2, info2);
155155
// apply scale
156156
if (scale2[0] != 1)

‎src/dtrsyl.c

+8-8
Original file line numberDiff line numberDiff line change
@@ -104,21 +104,21 @@ static void RELAPACK_dtrsyl_rec(
104104
double *const C_B = C + m1;
105105

106106
if (*tranA == 'N') {
107-
// recusion(A_BR, B, C_B)
107+
// recursion(A_BR, B, C_B)
108108
RELAPACK_dtrsyl_rec(tranA, tranB, isgn, &m2, n, A_BR, ldA, B, ldB, C_B, ldC, scale1, info1);
109109
// C_T = C_T - A_TR * C_B
110110
BLAS(dgemm)("N", "N", &m1, n, &m2, MONE, A_TR, ldA, C_B, ldC, scale1, C_T, ldC);
111-
// recusion(A_TL, B, C_T)
111+
// recursion(A_TL, B, C_T)
112112
RELAPACK_dtrsyl_rec(tranA, tranB, isgn, &m1, n, A_TL, ldA, B, ldB, C_T, ldC, scale2, info2);
113113
// apply scale
114114
if (scale2[0] != 1)
115115
LAPACK(dlascl)("G", iONE, iONE, ONE, scale2, &m2, n, C_B, ldC, info);
116116
} else {
117-
// recusion(A_TL, B, C_T)
117+
// recursion(A_TL, B, C_T)
118118
RELAPACK_dtrsyl_rec(tranA, tranB, isgn, &m1, n, A_TL, ldA, B, ldB, C_T, ldC, scale1, info1);
119119
// C_B = C_B - A_TR' * C_T
120120
BLAS(dgemm)("C", "N", &m2, n, &m1, MONE, A_TR, ldA, C_T, ldC, scale1, C_B, ldC);
121-
// recusion(A_BR, B, C_B)
121+
// recursion(A_BR, B, C_B)
122122
RELAPACK_dtrsyl_rec(tranA, tranB, isgn, &m2, n, A_BR, ldA, B, ldB, C_B, ldC, scale2, info2);
123123
// apply scale
124124
if (scale2[0] != 1)
@@ -142,21 +142,21 @@ static void RELAPACK_dtrsyl_rec(
142142
double *const C_R = C + *ldC * n1;
143143

144144
if (*tranB == 'N') {
145-
// recusion(A, B_TL, C_L)
145+
// recursion(A, B_TL, C_L)
146146
RELAPACK_dtrsyl_rec(tranA, tranB, isgn, m, &n1, A, ldA, B_TL, ldB, C_L, ldC, scale1, info1);
147147
// C_R = C_R -/+ C_L * B_TR
148148
BLAS(dgemm)("N", "N", m, &n2, &n1, MSGN, C_L, ldC, B_TR, ldB, scale1, C_R, ldC);
149-
// recusion(A, B_BR, C_R)
149+
// recursion(A, B_BR, C_R)
150150
RELAPACK_dtrsyl_rec(tranA, tranB, isgn, m, &n2, A, ldA, B_BR, ldB, C_R, ldC, scale2, info2);
151151
// apply scale
152152
if (scale2[0] != 1)
153153
LAPACK(dlascl)("G", iONE, iONE, ONE, scale2, m, &n1, C_L, ldC, info);
154154
} else {
155-
// recusion(A, B_BR, C_R)
155+
// recursion(A, B_BR, C_R)
156156
RELAPACK_dtrsyl_rec(tranA, tranB, isgn, m, &n2, A, ldA, B_BR, ldB, C_R, ldC, scale1, info1);
157157
// C_L = C_L -/+ C_R * B_TR'
158158
BLAS(dgemm)("N", "C", m, &n1, &n2, MSGN, C_R, ldC, B_TR, ldB, scale1, C_L, ldC);
159-
// recusion(A, B_TL, C_L)
159+
// recursion(A, B_TL, C_L)
160160
RELAPACK_dtrsyl_rec(tranA, tranB, isgn, m, &n1, A, ldA, B_TL, ldB, C_L, ldC, scale2, info2);
161161
// apply scale
162162
if (scale2[0] != 1)

‎src/strsyl.c

+8-8
Original file line numberDiff line numberDiff line change
@@ -104,21 +104,21 @@ static void RELAPACK_strsyl_rec(
104104
float *const C_B = C + m1;
105105

106106
if (*tranA == 'N') {
107-
// recusion(A_BR, B, C_B)
107+
// recursion(A_BR, B, C_B)
108108
RELAPACK_strsyl_rec(tranA, tranB, isgn, &m2, n, A_BR, ldA, B, ldB, C_B, ldC, scale1, info1);
109109
// C_T = C_T - A_TR * C_B
110110
BLAS(sgemm)("N", "N", &m1, n, &m2, MONE, A_TR, ldA, C_B, ldC, scale1, C_T, ldC);
111-
// recusion(A_TL, B, C_T)
111+
// recursion(A_TL, B, C_T)
112112
RELAPACK_strsyl_rec(tranA, tranB, isgn, &m1, n, A_TL, ldA, B, ldB, C_T, ldC, scale2, info2);
113113
// apply scale
114114
if (scale2[0] != 1)
115115
LAPACK(slascl)("G", iONE, iONE, ONE, scale2, &m2, n, C_B, ldC, info);
116116
} else {
117-
// recusion(A_TL, B, C_T)
117+
// recursion(A_TL, B, C_T)
118118
RELAPACK_strsyl_rec(tranA, tranB, isgn, &m1, n, A_TL, ldA, B, ldB, C_T, ldC, scale1, info1);
119119
// C_B = C_B - A_TR' * C_T
120120
BLAS(sgemm)("C", "N", &m2, n, &m1, MONE, A_TR, ldA, C_T, ldC, scale1, C_B, ldC);
121-
// recusion(A_BR, B, C_B)
121+
// recursion(A_BR, B, C_B)
122122
RELAPACK_strsyl_rec(tranA, tranB, isgn, &m2, n, A_BR, ldA, B, ldB, C_B, ldC, scale2, info2);
123123
// apply scale
124124
if (scale2[0] != 1)
@@ -142,21 +142,21 @@ static void RELAPACK_strsyl_rec(
142142
float *const C_R = C + *ldC * n1;
143143

144144
if (*tranB == 'N') {
145-
// recusion(A, B_TL, C_L)
145+
// recursion(A, B_TL, C_L)
146146
RELAPACK_strsyl_rec(tranA, tranB, isgn, m, &n1, A, ldA, B_TL, ldB, C_L, ldC, scale1, info1);
147147
// C_R = C_R -/+ C_L * B_TR
148148
BLAS(sgemm)("N", "N", m, &n2, &n1, MSGN, C_L, ldC, B_TR, ldB, scale1, C_R, ldC);
149-
// recusion(A, B_BR, C_R)
149+
// recursion(A, B_BR, C_R)
150150
RELAPACK_strsyl_rec(tranA, tranB, isgn, m, &n2, A, ldA, B_BR, ldB, C_R, ldC, scale2, info2);
151151
// apply scale
152152
if (scale2[0] != 1)
153153
LAPACK(slascl)("G", iONE, iONE, ONE, scale2, m, &n1, C_L, ldC, info);
154154
} else {
155-
// recusion(A, B_BR, C_R)
155+
// recursion(A, B_BR, C_R)
156156
RELAPACK_strsyl_rec(tranA, tranB, isgn, m, &n2, A, ldA, B_BR, ldB, C_R, ldC, scale1, info1);
157157
// C_L = C_L -/+ C_R * B_TR'
158158
BLAS(sgemm)("N", "C", m, &n1, &n2, MSGN, C_R, ldC, B_TR, ldB, scale1, C_L, ldC);
159-
// recusion(A, B_TL, C_L)
159+
// recursion(A, B_TL, C_L)
160160
RELAPACK_strsyl_rec(tranA, tranB, isgn, m, &n1, A, ldA, B_TL, ldB, C_L, ldC, scale2, info2);
161161
// apply scale
162162
if (scale2[0] != 1)

‎src/zhetrf_rook_rec2.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@
1717
static doublecomplex c_b1 = {1.,0.};
1818
static int c__1 = 1;
1919

20-
/** ZHETRF_ROOK_REC2 computes a partial factorization of a complex Hermitian indefinite matrix using the boun ded Bunch-Kaufman ("rook") diagonal pivoting method
20+
/** ZHETRF_ROOK_REC2 computes a partial factorization of a complex Hermitian indefinite matrix using the bounded Bunch-Kaufman ("rook") diagonal pivoting method
2121
*
2222
* This routine is a minor modification of LAPACK's zlahef_rook.
2323
* It serves as an unblocked kernel in the recursive algorithms.

‎src/ztrsyl.c

+8-8
Original file line numberDiff line numberDiff line change
@@ -100,21 +100,21 @@ static void RELAPACK_ztrsyl_rec(
100100
double *const C_B = C + 2 * m1;
101101

102102
if (*tranA == 'N') {
103-
// recusion(A_BR, B, C_B)
103+
// recursion(A_BR, B, C_B)
104104
RELAPACK_ztrsyl_rec(tranA, tranB, isgn, &m2, n, A_BR, ldA, B, ldB, C_B, ldC, scale1, info1);
105105
// C_T = C_T - A_TR * C_B
106106
BLAS(zgemm)("N", "N", &m1, n, &m2, MONE, A_TR, ldA, C_B, ldC, scale1, C_T, ldC);
107-
// recusion(A_TL, B, C_T)
107+
// recursion(A_TL, B, C_T)
108108
RELAPACK_ztrsyl_rec(tranA, tranB, isgn, &m1, n, A_TL, ldA, B, ldB, C_T, ldC, scale2, info2);
109109
// apply scale
110110
if (scale2[0] != 1)
111111
LAPACK(zlascl)("G", iONE, iONE, ONE, scale2, &m2, n, C_B, ldC, info);
112112
} else {
113-
// recusion(A_TL, B, C_T)
113+
// recursion(A_TL, B, C_T)
114114
RELAPACK_ztrsyl_rec(tranA, tranB, isgn, &m1, n, A_TL, ldA, B, ldB, C_T, ldC, scale1, info1);
115115
// C_B = C_B - A_TR' * C_T
116116
BLAS(zgemm)("C", "N", &m2, n, &m1, MONE, A_TR, ldA, C_T, ldC, scale1, C_B, ldC);
117-
// recusion(A_BR, B, C_B)
117+
// recursion(A_BR, B, C_B)
118118
RELAPACK_ztrsyl_rec(tranA, tranB, isgn, &m2, n, A_BR, ldA, B, ldB, C_B, ldC, scale2, info2);
119119
// apply scale
120120
if (scale2[0] != 1)
@@ -136,21 +136,21 @@ static void RELAPACK_ztrsyl_rec(
136136
double *const C_R = C + 2 * *ldC * n1;
137137

138138
if (*tranB == 'N') {
139-
// recusion(A, B_TL, C_L)
139+
// recursion(A, B_TL, C_L)
140140
RELAPACK_ztrsyl_rec(tranA, tranB, isgn, m, &n1, A, ldA, B_TL, ldB, C_L, ldC, scale1, info1);
141141
// C_R = C_R -/+ C_L * B_TR
142142
BLAS(zgemm)("N", "N", m, &n2, &n1, MSGN, C_L, ldC, B_TR, ldB, scale1, C_R, ldC);
143-
// recusion(A, B_BR, C_R)
143+
// recursion(A, B_BR, C_R)
144144
RELAPACK_ztrsyl_rec(tranA, tranB, isgn, m, &n2, A, ldA, B_BR, ldB, C_R, ldC, scale2, info2);
145145
// apply scale
146146
if (scale2[0] != 1)
147147
LAPACK(zlascl)("G", iONE, iONE, ONE, scale2, m, &n1, C_L, ldC, info);
148148
} else {
149-
// recusion(A, B_BR, C_R)
149+
// recursion(A, B_BR, C_R)
150150
RELAPACK_ztrsyl_rec(tranA, tranB, isgn, m, &n2, A, ldA, B_BR, ldB, C_R, ldC, scale1, info1);
151151
// C_L = C_L -/+ C_R * B_TR'
152152
BLAS(zgemm)("N", "C", m, &n1, &n2, MSGN, C_R, ldC, B_TR, ldB, scale1, C_L, ldC);
153-
// recusion(A, B_TL, C_L)
153+
// recursion(A, B_TL, C_L)
154154
RELAPACK_ztrsyl_rec(tranA, tranB, isgn, m, &n1, A, ldA, B_TL, ldB, C_L, ldC, scale2, info2);
155155
// apply scale
156156
if (scale2[0] != 1)

‎test/util.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -55,7 +55,7 @@ void z2matgen(const int m, const int n, double *A, double *B) {
5555
////////////////////////
5656
// error computations //
5757
////////////////////////
58-
// Each routine x2vecerrr is passed a vector lengh n and two vectors x and y.
58+
// Each routine x2vecerrr is passed a vector length n and two vectors x and y.
5959
// It returns the maximum of the element-wise error between these two vectors.
6060
// This error is the minimum of the absolute difference and the relative
6161
// differene with respect to y.

0 commit comments

Comments
 (0)