Mentions légales du service

Skip to content
Snippets Groups Projects
Commit 969341fa authored by LISITO Alycia's avatar LISITO Alycia Committed by Mathieu Faverge
Browse files

testing: add standard api to her2k

parent 06fa75f4
No related branches found
No related tags found
1 merge request!275Add standard version to the blas3 testings
......@@ -2,7 +2,7 @@
*
* @file testing_zher2k.c
*
* @copyright 2019-2021 Bordeaux INP, CNRS (LaBRI UMR 5800), Inria,
* @copyright 2019-2022 Bordeaux INP, CNRS (LaBRI UMR 5800), Inria,
* Univ. Bordeaux. All rights reserved.
*
***
......@@ -13,7 +13,8 @@
* @author Lucas Barros de Assis
* @author Florent Pruvost
* @author Mathieu Faverge
* @date 2020-11-19
* @author Alycia Lisito
* @date 2022-02-04
* @precisions normal z -> z c
*
*/
......@@ -102,8 +103,8 @@ testing_zher2k_desc( run_arg_list_t *args, int check )
&descCinit, (void*)(-mtxfmt), ChamComplexDouble, nb, nb, nb * nb, LDC, N, 0, 0, N, N, P, Q );
CHAMELEON_zplghe_Tile( bump, uplo, descCinit, seedC );
hres +=
check_zsyrk( args, ChamHermitian, uplo, trans, alpha, descA, descB, beta, descCinit, descC );
hres += check_zsyrk( args, ChamHermitian, uplo, trans, alpha, descA, descB,
beta, descCinit, descC );
CHAMELEON_Desc_Destroy( &descCinit );
}
......@@ -115,6 +116,82 @@ testing_zher2k_desc( run_arg_list_t *args, int check )
return hres;
}
int
testing_zher2k_std( run_arg_list_t *args, int check )
{
testdata_t test_data = { .args = args };
int hres = 0;
/* Read arguments */
int nb = run_arg_get_int( args, "nb", 320 );
cham_trans_t trans = run_arg_get_trans( args, "trans", ChamNoTrans );
cham_uplo_t uplo = run_arg_get_uplo( args, "uplo", ChamUpper );
int N = run_arg_get_int( args, "N", 1000 );
int K = run_arg_get_int( args, "K", N );
int LDA = run_arg_get_int( args, "LDA", ( ( trans == ChamNoTrans ) ? N : K ) );
int LDB = run_arg_get_int( args, "LDB", ( ( trans == ChamNoTrans ) ? N : K ) );
int LDC = run_arg_get_int( args, "LDC", N );
CHAMELEON_Complex64_t alpha = testing_zalea();
double beta = testing_dalea();
int seedA = run_arg_get_int( args, "seedA", random() );
int seedB = run_arg_get_int( args, "seedB", random() );
int seedC = run_arg_get_int( args, "seedC", random() );
double bump = testing_dalea();
/* Descriptors */
int Am, An;
CHAMELEON_Complex64_t *A, *B, *C, *Cinit;
bump = run_arg_get_double( args, "bump", bump );
alpha = run_arg_get_complex64( args, "alpha", alpha );
beta = run_arg_get_double( args, "beta", beta );
CHAMELEON_Set( CHAMELEON_TILE_SIZE, nb );
/* Calculate the dimensions according to the transposition */
if ( trans == ChamNoTrans ) {
Am = N;
An = K;
}
else {
Am = K;
An = N;
}
/* Create the matrices */
A = malloc( LDA*An*sizeof(CHAMELEON_Complex64_t) );
B = malloc( LDB*An*sizeof(CHAMELEON_Complex64_t) );
C = malloc( LDC*N*sizeof(CHAMELEON_Complex64_t) );
/* Fill the matrix with random values */
CHAMELEON_zplrnt( Am, An, B, LDA, seedA );
CHAMELEON_zplrnt( K, An, B, LDB, seedB );
CHAMELEON_zplghe( bump, uplo, N, C, LDC, seedC );
/* Calculate the product */
testing_start( &test_data );
hres = CHAMELEON_zher2k( uplo, trans, N, K, alpha, A, LDA, B, LDB, beta, C, LDC );
test_data.hres = hres;
testing_stop( &test_data, flops_zher2k( K, N ) );
/* Check the solution */
if ( check ) {
Cinit = malloc( LDC*N*sizeof(CHAMELEON_Complex64_t) );
CHAMELEON_zplghe( bump, uplo, N, Cinit, LDC, seedC );
// hres += check_zsyrk( args, ChamHermitian, uplo, trans, alpha, descA, descB,
// beta, descCinit, descC );
free( Cinit );
}
free( A );
free( B );
free( C );
return hres;
}
testing_t test_zher2k;
const char *zher2k_params[] = { "mtxfmt", "nb", "trans", "uplo", "n", "k",
"lda", "ldb", "ldc", "alpha", "beta", "seedA",
......@@ -135,7 +212,7 @@ testing_zher2k_init( void )
test_zher2k.output = zher2k_output;
test_zher2k.outchk = zher2k_outchk;
test_zher2k.fptr_desc = testing_zher2k_desc;
test_zher2k.fptr_std = NULL;
test_zher2k.fptr_std = testing_zher2k_std;
test_zher2k.next = NULL;
testing_register( &test_zher2k );
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment