1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
// Copyright (c) 2017-2023, University of Tennessee. All rights reserved.
// SPDX-License-Identifier: BSD-3-Clause
// This program is free software: you can redistribute it and/or modify it under
// the terms of the BSD 3-Clause license. See the accompanying LICENSE file.
#include "test.hh"
#include "cblas_wrappers.hh"
#include "lapack_wrappers.hh"
#include "blas/flops.hh"
#include "print_matrix.hh"
#include "check_gemm.hh"
// -----------------------------------------------------------------------------
template <typename T>
void test_asum_work( Params& params, bool run )
{
using namespace testsweeper;
using std::abs;
using real_t = blas::real_type< T >;
// get & mark input values
int64_t n = params.dim.n();
int64_t incx = params.incx();
int64_t verbose = params.verbose();
// mark non-standard output values
params.gflops();
params.gbytes();
params.ref_time();
params.ref_gflops();
params.ref_gbytes();
// adjust header to msec
params.time.name( "time (ms)" );
params.ref_time.name( "ref time (ms)" );
params.ref_time.width( 13 );
if (! run)
return;
// setup
size_t size_x = (n - 1) * std::abs(incx) + 1;
T* x = new T[ size_x ];
int64_t idist = 1;
int iseed[4] = { 0, 0, 0, 1 };
lapack_larnv( idist, iseed, size_x, x );
// test error exits
assert_throw( blas::asum( -1, x, incx ), blas::Error );
assert_throw( blas::asum( n, x, 0 ), blas::Error );
assert_throw( blas::asum( n, x, -1 ), blas::Error );
if (verbose >= 1) {
printf( "\n"
"x n=%5lld, inc=%5lld, size=%10lld\n",
llong( n ), llong( incx ), llong( size_x ) );
}
if (verbose >= 2) {
printf( "x = " ); print_vector( n, x, incx );
}
// run test
testsweeper::flush_cache( params.cache() );
double time = get_wtime();
real_t result = blas::asum( n, x, incx );
time = get_wtime() - time;
double gflop = blas::Gflop< T >::asum( n );
double gbyte = blas::Gbyte< T >::asum( n );
params.time() = time * 1000; // msec
params.gflops() = gflop / time;
params.gbytes() = gbyte / time;
if (verbose >= 1) {
printf( "result = %.4e\n", result );
}
if (params.check() == 'y') {
// run reference
testsweeper::flush_cache( params.cache() );
time = get_wtime();
real_t ref = cblas_asum( n, x, incx );
time = get_wtime() - time;
params.ref_time() = time * 1000; // msec
params.ref_gflops() = gflop / time;
params.ref_gbytes() = gbyte / time;
if (verbose >= 1) {
printf( "ref = %.4e\n", ref );
}
// relative forward error
// note: using sqrt(n) here gives failures
real_t error = abs( (ref - result) / (n * ref) );
// complex needs extra factor; see Higham, 2002, sec. 3.6.
if (blas::is_complex<T>::value) {
error /= 2*sqrt(2);
}
real_t u = 0.5 * std::numeric_limits< real_t >::epsilon();
params.error() = error;
params.okay() = (error < u);
}
delete[] x;
}
// -----------------------------------------------------------------------------
void test_asum( Params& params, bool run )
{
switch (params.datatype()) {
case testsweeper::DataType::Single:
test_asum_work< float >( params, run );
break;
case testsweeper::DataType::Double:
test_asum_work< double >( params, run );
break;
case testsweeper::DataType::SingleComplex:
test_asum_work< std::complex<float> >( params, run );
break;
case testsweeper::DataType::DoubleComplex:
test_asum_work< std::complex<double> >( params, run );
break;
default:
throw std::exception();
break;
}
}
|
