floraachy
/
OpenBLAS
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix portability problems

This commit is contained in:
Martin Kroeker 2024-02-26 22:22:48 +01:00 committed by GitHub
parent 28f151808e
commit 38283f678e
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
5 changed files with 17 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
utest/test_extensions/test_cgemv_t.c
View File

@ -126,7 +126,7 @@ static float check_cgemv(char api, char order, char trans, blasint m, blasint n,
srand_generate(data_cgemv_t.y_test, m * inc_y * 2); srand_generate(data_cgemv_t.y_test, m * inc_y * 2);
// Copy vector y for reference funcs // Copy vector y for reference funcs
for (int i = 0; i < m * inc_y * 2; i++) { for (i = 0; i < m * inc_y * 2; i++) {
data_cgemv_t.y_verify[i] = data_cgemv_t.y_test[i]; data_cgemv_t.y_verify[i] = data_cgemv_t.y_test[i];
} }

4
utest/test_extensions/test_csbmv.c
View File

@ -188,7 +188,7 @@ static float check_csbmv(char uplo, blasint n, blasint k, float *alpha, blasint
char trans = 'N'; char trans = 'N';
// Symmetric band packed matrix for sbmv // Symmetric band packed matrix for sbmv
float a[lda * n * 2]; float *a = (float*) malloc(lda * n * 2 * sizeof(float));
// Fill symmetric packed matrix sp_matrix, vector b_test, vector c_test // Fill symmetric packed matrix sp_matrix, vector b_test, vector c_test
srand_generate(data_csbmv.sp_matrix, n * (n + 1)); srand_generate(data_csbmv.sp_matrix, n * (n + 1));
@ -216,7 +216,7 @@ static float check_csbmv(char uplo, blasint n, blasint k, float *alpha, blasint
// Find the differences between output vector caculated by csbmv and cgemv // Find the differences between output vector caculated by csbmv and cgemv
for (i = 0; i < n * inc_c * 2; i++) for (i = 0; i < n * inc_c * 2; i++)
data_csbmv.c_test[i] -= data_csbmv.c_verify[i]; data_csbmv.c_test[i] -= data_csbmv.c_verify[i];
free(a);
// Find the norm of differences // Find the norm of differences
return BLASFUNC(scnrm2)(&n, data_csbmv.c_test, &inc_c); return BLASFUNC(scnrm2)(&n, data_csbmv.c_test, &inc_c);
} }

6
utest/test_extensions/test_idamin.c
View File

@ -402,13 +402,14 @@ CTEST(idamin, min_idx_in_vec_tail){
CTEST(idamin, min_idx_in_vec_tail_inc_1){ CTEST(idamin, min_idx_in_vec_tail_inc_1){
blasint i; blasint i;
blasint N = ELEMENTS, inc = 1; blasint N = ELEMENTS, inc = 1;
double x[ELEMENTS * inc]; double *x = (double*)malloc(ELEMENTS * inc * sizeof(double));
for (i = 0; i < N * inc; i ++) { for (i = 0; i < N * inc; i ++) {
x[i] = i + 1000; x[i] = i + 1000;
} }
x[(N - 1) * inc] = 0.0f; x[(N - 1) * inc] = 0.0f;
blasint index = BLASFUNC(idamin)(&N, x, &inc); blasint index = BLASFUNC(idamin)(&N, x, &inc);
free(x);
ASSERT_EQUAL(N, index); ASSERT_EQUAL(N, index);
} }
@ -775,13 +776,14 @@ CTEST(idamin, c_api_min_idx_in_vec_tail){
CTEST(idamin, c_api_min_idx_in_vec_tail_inc_1){ CTEST(idamin, c_api_min_idx_in_vec_tail_inc_1){
blasint i; blasint i;
blasint N = ELEMENTS, inc = 1; blasint N = ELEMENTS, inc = 1;
double x[ELEMENTS * inc]; double *x = (double*) malloc(ELEMENTS * inc * sizeof(double));
for (i = 0; i < N * inc; i ++) { for (i = 0; i < N * inc; i ++) {
x[i] = i + 1000; x[i] = i + 1000;
} }
x[(N - 1) * inc] = 0.0; x[(N - 1) * inc] = 0.0;
blasint index = cblas_idamin(N, x, inc); blasint index = cblas_idamin(N, x, inc);
free(x);
ASSERT_EQUAL(N - 1, index); ASSERT_EQUAL(N - 1, index);
} }
#endif #endif

6
utest/test_extensions/test_isamin.c
View File

@ -402,13 +402,14 @@ CTEST(isamin, min_idx_in_vec_tail){
CTEST(isamin, min_idx_in_vec_tail_inc_1){ CTEST(isamin, min_idx_in_vec_tail_inc_1){
blasint i; blasint i;
blasint N = ELEMENTS, inc = 1; blasint N = ELEMENTS, inc = 1;
float x[ELEMENTS * inc]; float *x = (float*) (ELEMENTS * inc * sizeof(float));
for (i = 0; i < N * inc; i ++) { for (i = 0; i < N * inc; i ++) {
x[i] = i + 1000; x[i] = i + 1000;
} }
x[(N - 1) * inc] = 0.0f; x[(N - 1) * inc] = 0.0f;
blasint index = BLASFUNC(isamin)(&N, x, &inc); blasint index = BLASFUNC(isamin)(&N, x, &inc);
free(x);
ASSERT_EQUAL(N, index); ASSERT_EQUAL(N, index);
} }
@ -775,13 +776,14 @@ CTEST(isamin, c_api_min_idx_in_vec_tail){
CTEST(isamin, c_api_min_idx_in_vec_tail_inc_1){ CTEST(isamin, c_api_min_idx_in_vec_tail_inc_1){
blasint i; blasint i;
blasint N = ELEMENTS, inc = 1; blasint N = ELEMENTS, inc = 1;
float x[ELEMENTS * inc]; float *x = (float*)malloc(ELEMENTS * inc * sizeof(float));
for (i = 0; i < N * inc; i ++) { for (i = 0; i < N * inc; i ++) {
x[i] = i + 1000; x[i] = i + 1000;
} }
x[(N - 1) * inc] = 0.0f; x[(N - 1) * inc] = 0.0f;
blasint index = cblas_isamin(N, x, inc); blasint index = cblas_isamin(N, x, inc);
free(x);
ASSERT_EQUAL(N - 1, index); ASSERT_EQUAL(N - 1, index);
} }
#endif #endif

2
utest/test_extensions/test_zgemv_t.c
View File

@ -126,7 +126,7 @@ static double check_zgemv(char api, char order, char trans, blasint m, blasint n
drand_generate(data_zgemv_t.y_test, m * inc_y * 2); drand_generate(data_zgemv_t.y_test, m * inc_y * 2);
// Copy vector y for reference funcs // Copy vector y for reference funcs
for (int i = 0; i < m * inc_y * 2; i++) for (i = 0; i < m * inc_y * 2; i++)
{ {
data_zgemv_t.y_verify[i] = data_zgemv_t.y_test[i]; data_zgemv_t.y_verify[i] = data_zgemv_t.y_test[i];
} }