LINALG 1.2.0 iteration 1.

[dense-linear-algebra-libraries/linalg.git] / blis / testsuite / src / test_dotxv.c

diff --git a/blis/testsuite/src/test_dotxv.c b/blis/testsuite/src/test_dotxv.c
index fc1aa0aa9797501204039fd66859de63d32494ff..95f6c5e1045072a10b728bef91b4c43d9b08f723 100644 (file)
--- a/blis/testsuite/src/test_dotxv.c
+++ b/blis/testsuite/src/test_dotxv.c
@@ -56,7 +56,7 @@ void libblis_test_dotxv_experiment( test_params_t* params,
                                     char*          pc_str,
                                     char*          sc_str,
                                     unsigned int   p_cur,
-                                    double*        perf,
+                                    perf_t*        perf,
                                     double*        resid );
 
 void libblis_test_dotxv_impl( iface_t   iface,
@@ -121,7 +121,7 @@ void libblis_test_dotxv_experiment( test_params_t* params,
                                     char*          pc_str,
                                     char*          sc_str,
                                     unsigned int   p_cur,
-                                    double*        perf,
+                                    perf_t*        perf,
                                     double*        resid )
 {
        unsigned int n_repeats = params->n_repeats;
@@ -202,8 +202,9 @@ void libblis_test_dotxv_experiment( test_params_t* params,
        }
 
        // Estimate the performance of the best experiment repeat.
-       *perf = ( 2.0 * m ) / time_min / FLOPS_PER_UNIT_PERF;
-       if ( bli_obj_is_complex( y ) ) *perf *= 4.0;
+       perf->gflops = ( 2.0 * m ) / time_min / FLOPS_PER_UNIT_PERF;
+       if ( bli_obj_is_complex( y ) ) perf->gflops *= 4.0;
+       perf->time = time_min;
 
        // Perform checks.
        libblis_test_dotxv_check( &alpha, &x, &y, &beta, &rho, &rho_save, resid );