Skip to content

Commit 2a6c126

Browse files
Address PR comments
1 parent 87c0459 commit 2a6c126

File tree

5 files changed

+29
-28
lines changed

5 files changed

+29
-28
lines changed

tests/t324-basis.c

+4-4
Original file line numberDiff line numberDiff line change
@@ -14,16 +14,16 @@ int main(int argc, char **argv) {
1414
CeedScalar q_ref[dim * Q], q_weight[Q];
1515
CeedScalar interp[P * Q], grad[dim * P * Q];
1616
const CeedScalar *out;
17-
CeedScalar colsum[P];
17+
CeedScalar column_sum[P];
1818

1919
buildmats(q_ref, q_weight, interp, grad);
2020

2121
CeedInit(argv[1], &ceed);
2222

2323
for (int i = 0; i < P; i++) {
24-
colsum[i] = 0;
24+
column_sum[i] = 0;
2525
for (int j = 0; j < Q * dim; j++) {
26-
colsum[i] += grad[i + j * P];
26+
column_sum[i] += grad[i + j * P];
2727
}
2828
}
2929

@@ -39,7 +39,7 @@ int main(int argc, char **argv) {
3939
// Check values at quadrature points
4040
CeedVectorGetArrayRead(Out, CEED_MEM_HOST, &out);
4141
for (int i = 0; i < P; i++) {
42-
if (fabs(colsum[i] - out[i]) > 100. * CEED_EPSILON) printf("[%" CeedInt_FMT "] %f != %f\n", i, out[i], colsum[i]);
42+
if (fabs(column_sum[i] - out[i]) > 100. * CEED_EPSILON) printf("[%" CeedInt_FMT "] %f != %f\n", i, out[i], column_sum[i]);
4343
}
4444
CeedVectorRestoreArrayRead(Out, &out);
4545

tests/t325-basis.c

+5-4
Original file line numberDiff line numberDiff line change
@@ -14,16 +14,16 @@ int main(int argc, char **argv) {
1414
CeedScalar q_ref[dim * Q], q_weight[Q];
1515
CeedScalar interp[P * Q], grad[dim * P * Q];
1616
const CeedScalar *out;
17-
CeedScalar colsum[P], *in;
17+
CeedScalar column_sum[P], *in;
1818

1919
buildmats(q_ref, q_weight, interp, grad);
2020

2121
CeedInit(argv[1], &ceed);
2222

2323
for (int i = 0; i < P; i++) {
24-
colsum[i] = 0;
24+
column_sum[i] = 0;
2525
for (int j = 0; j < Q * dim; j++) {
26-
colsum[i] += grad[i + j * P];
26+
column_sum[i] += grad[i + j * P];
2727
}
2828
}
2929

@@ -46,7 +46,8 @@ int main(int argc, char **argv) {
4646
CeedVectorGetArrayRead(Out, CEED_MEM_HOST, &out);
4747
for (int p = 0; p < P; p++) {
4848
for (int n = 0; n < num_comp; n++) {
49-
if (fabs(n * colsum[p] - out[p + n * P]) > 100. * CEED_EPSILON) printf("[%" CeedInt_FMT "] %f != %f\n", p, out[p + n * P], n * colsum[p]);
49+
if (fabs(n * column_sum[p] - out[p + n * P]) > 100. * CEED_EPSILON)
50+
printf("[%" CeedInt_FMT "] %f != %f\n", p, out[p + n * P], n * column_sum[p]);
5051
}
5152
}
5253
CeedVectorRestoreArrayRead(Out, &out);

tests/t332-basis.c

+3-3
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@ int main(int argc, char **argv) {
1414
CeedScalar q_ref[dim * num_qpts], q_weights[num_qpts];
1515
CeedScalar interp[dim * P * num_qpts], div[P * num_qpts];
1616
CeedVector X, Y;
17-
const CeedScalar *y, *x, *div2;
17+
const CeedScalar *y, *x, *div_in_basis;
1818

1919
CeedInit(argv[1], &ceed);
2020

@@ -23,9 +23,9 @@ int main(int argc, char **argv) {
2323
CeedBasisCreateHdiv(ceed, CEED_TOPOLOGY_QUAD, 1, P, num_qpts, interp, div, q_ref, q_weights, &b);
2424

2525
// Test div for H(div)
26-
CeedBasisGetDiv(b, &div2);
26+
CeedBasisGetDiv(b, &div_in_basis);
2727
for (CeedInt i = 0; i < P * num_qpts; i++) {
28-
if (fabs(div[i] - div2[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", div[i], div2[i]);
28+
if (fabs(div[i] - div_in_basis[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", div[i], div_in_basis[i]);
2929
}
3030

3131
CeedVectorCreate(ceed, P, &X);

tests/t341-basis.c

+7-7
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@ int main(int argc, char **argv) {
1414
CeedScalar interp[dim * P * Q], curl[P * Q];
1515
CeedVector X, Y;
1616
const CeedScalar *y, *x, *interp2;
17-
CeedScalar rowsum[dim * Q], colsum[P];
17+
CeedScalar row_sum[dim * Q], column_sum[P];
1818

1919
CeedInit(argv[1], &ceed);
2020

@@ -29,15 +29,15 @@ int main(int argc, char **argv) {
2929
}
3030

3131
for (int i = 0; i < dim * Q; i++) {
32-
rowsum[i] = 0;
32+
row_sum[i] = 0;
3333
for (int j = 0; j < P; j++) {
34-
rowsum[i] += interp[j + i * P];
34+
row_sum[i] += interp[j + i * P];
3535
}
3636
}
3737
for (int i = 0; i < P; i++) {
38-
colsum[i] = 0;
38+
column_sum[i] = 0;
3939
for (int j = 0; j < dim * Q; j++) {
40-
colsum[i] += interp[i + j * P];
40+
column_sum[i] += interp[i + j * P];
4141
}
4242
}
4343

@@ -50,7 +50,7 @@ int main(int argc, char **argv) {
5050

5151
CeedVectorGetArrayRead(Y, CEED_MEM_HOST, &y);
5252
for (CeedInt i = 0; i < dim * Q; i++) {
53-
if (fabs(rowsum[i] - y[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", rowsum[i], y[i]);
53+
if (fabs(row_sum[i] - y[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", row_sum[i], y[i]);
5454
}
5555
CeedVectorRestoreArrayRead(Y, &y);
5656

@@ -61,7 +61,7 @@ int main(int argc, char **argv) {
6161

6262
CeedVectorGetArrayRead(X, CEED_MEM_HOST, &x);
6363
for (CeedInt i = 0; i < P; i++) {
64-
if (fabs(colsum[i] - x[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", colsum[i], x[i]);
64+
if (fabs(column_sum[i] - x[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", column_sum[i], x[i]);
6565
}
6666
CeedVectorRestoreArrayRead(X, &x);
6767

tests/t342-basis.c

+10-10
Original file line numberDiff line numberDiff line change
@@ -13,8 +13,8 @@ int main(int argc, char **argv) {
1313
CeedScalar q_ref[dim * Q], q_weight[Q];
1414
CeedScalar interp[dim * P * Q], curl[P * Q];
1515
CeedVector X, Y;
16-
const CeedScalar *y, *x, *curl2;
17-
CeedScalar rowsum[Q], colsum[P];
16+
const CeedScalar *y, *x, *curl_in_basis;
17+
CeedScalar row_sum[Q], column_sum[P];
1818

1919
CeedInit(argv[1], &ceed);
2020

@@ -23,21 +23,21 @@ int main(int argc, char **argv) {
2323
CeedBasisCreateHcurl(ceed, CEED_TOPOLOGY_TRIANGLE, 1, P, Q, interp, curl, q_ref, q_weight, &b);
2424

2525
// Test curl for H(curl)
26-
CeedBasisGetCurl(b, &curl2);
26+
CeedBasisGetCurl(b, &curl_in_basis);
2727
for (CeedInt i = 0; i < P * Q; i++) {
28-
if (fabs(curl[i] - curl2[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", curl[i], curl2[i]);
28+
if (fabs(curl[i] - curl_in_basis[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", curl[i], curl_in_basis[i]);
2929
}
3030

3131
for (int i = 0; i < Q; i++) {
32-
rowsum[i] = 0;
32+
row_sum[i] = 0;
3333
for (int j = 0; j < P; j++) {
34-
rowsum[i] += curl[j + i * P];
34+
row_sum[i] += curl[j + i * P];
3535
}
3636
}
3737
for (int i = 0; i < P; i++) {
38-
colsum[i] = 0;
38+
column_sum[i] = 0;
3939
for (int j = 0; j < Q; j++) {
40-
colsum[i] += curl[i + j * P];
40+
column_sum[i] += curl[i + j * P];
4141
}
4242
}
4343

@@ -50,7 +50,7 @@ int main(int argc, char **argv) {
5050

5151
CeedVectorGetArrayRead(Y, CEED_MEM_HOST, &y);
5252
for (CeedInt i = 0; i < Q; i++) {
53-
if (fabs(rowsum[i] - y[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", rowsum[i], y[i]);
53+
if (fabs(row_sum[i] - y[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", row_sum[i], y[i]);
5454
}
5555
CeedVectorRestoreArrayRead(Y, &y);
5656

@@ -61,7 +61,7 @@ int main(int argc, char **argv) {
6161

6262
CeedVectorGetArrayRead(X, CEED_MEM_HOST, &x);
6363
for (CeedInt i = 0; i < P; i++) {
64-
if (fabs(colsum[i] - x[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", colsum[i], x[i]);
64+
if (fabs(column_sum[i] - x[i]) > 100. * CEED_EPSILON) printf("%f != %f\n", column_sum[i], x[i]);
6565
}
6666
CeedVectorRestoreArrayRead(X, &x);
6767

0 commit comments

Comments
 (0)