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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
// 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 "lapack.hh"
#include "lapack/flops.hh"
#include "print_matrix.hh"
#include "error.hh"
#include "lapacke_wrappers.hh"
#include <vector>
// -----------------------------------------------------------------------------
template< typename scalar_t >
void test_gesv_work( Params& params, bool run )
{
using real_t = blas::real_type< scalar_t >;
// Constants
const scalar_t one = 1.0;
const real_t eps = std::numeric_limits< real_t >::epsilon();
// get & mark input values
int64_t n = params.dim.n();
int64_t nrhs = params.nrhs();
int64_t align = params.align();
int64_t verbose = params.verbose();
real_t tol = params.tol() * eps;
params.matrix.mark();
// mark non-standard output values
params.ref_time();
params.ref_gflops();
params.gflops();
if (! run)
return;
// ---------- setup
int64_t lda = roundup( blas::max( 1, n ), align );
int64_t ldb = roundup( blas::max( 1, n ), align );
size_t size_A = (size_t) lda * n;
size_t size_ipiv = (size_t) (n);
size_t size_B = (size_t) ldb * nrhs;
std::vector< scalar_t > A_tst( size_A );
std::vector< scalar_t > A_ref( size_A );
std::vector< int64_t > ipiv_tst( size_ipiv );
std::vector< lapack_int > ipiv_ref( size_ipiv );
std::vector< scalar_t > B_tst( size_B );
std::vector< scalar_t > B_ref( size_B );
lapack::generate_matrix( params.matrix, n, n, &A_tst[0], lda );
int64_t idist = 1;
int64_t iseed[4] = { 0, 1, 2, 3 };
lapack::larnv( idist, iseed, B_tst.size(), &B_tst[0] );
A_ref = A_tst;
B_ref = B_tst;
if (verbose >= 1) {
printf( "\n"
"A n=%5lld, lda=%5lld\n"
"B n=%5lld, nrhs=%5lld, ldb=%5lld\n",
llong( n ), llong( lda ),
llong( n ), llong( nrhs ), llong( ldb ) );
}
if (verbose >= 2) {
printf( "A = " );
print_matrix( n, n, &A_tst[0], lda );
printf( "B = " );
print_matrix( n, nrhs, &B_tst[0], ldb );
}
// test error exits
if (params.error_exit() == 'y') {
assert_throw( lapack::gesv( -1, nrhs, &A_tst[0], lda, &ipiv_tst[0], &B_tst[0], ldb ), lapack::Error );
assert_throw( lapack::gesv( n, -1, &A_tst[0], lda, &ipiv_tst[0], &B_tst[0], ldb ), lapack::Error );
assert_throw( lapack::gesv( n, nrhs, &A_tst[0], n-1, &ipiv_tst[0], &B_tst[0], ldb ), lapack::Error );
assert_throw( lapack::gesv( n, nrhs, &A_tst[0], lda, &ipiv_tst[0], &B_tst[0], n-1 ), lapack::Error );
}
// ---------- run test
testsweeper::flush_cache( params.cache() );
double time = testsweeper::get_wtime();
int64_t info_tst = lapack::gesv( n, nrhs, &A_tst[0], lda, &ipiv_tst[0],
&B_tst[0], ldb );
time = testsweeper::get_wtime() - time;
if (info_tst != 0) {
fprintf( stderr, "lapack::gesv returned error %lld\n", llong( info_tst ) );
}
params.time() = time;
double gflop = lapack::Gflop< scalar_t >::gesv( n, nrhs );
params.gflops() = gflop / time;
if (verbose >= 2) {
printf( "A_factor = " );
print_matrix( n, n, &A_tst[0], lda );
printf( "X = " );
print_matrix( n, nrhs, &B_tst[0], ldb );
}
if (params.check() == 'y') {
// ---------- check error
// Relative backwards error = ||b - Ax|| / (n * ||A|| * ||x||).
blas::gemm( blas::Layout::ColMajor, blas::Op::NoTrans, blas::Op::NoTrans,
n, nrhs, n,
-one, &A_ref[0], lda,
&B_tst[0], ldb,
one, &B_ref[0], ldb );
if (verbose >= 2) {
printf( "R = " );
print_matrix( n, nrhs, &B_ref[0], ldb );
}
real_t error = lapack::lange( lapack::Norm::One, n, nrhs, &B_ref[0], ldb );
real_t Xnorm = lapack::lange( lapack::Norm::One, n, nrhs, &B_tst[0], ldb );
real_t Anorm = lapack::lange( lapack::Norm::One, n, n, &A_ref[0], lda );
error /= (n * Anorm * Xnorm);
params.error() = error;
params.okay() = (error < tol);
}
if (params.ref() == 'y') {
// ---------- run reference
// Reset B in case check cleared it.
int64_t iseed2[4] = { 0, 1, 2, 3 };
lapack::larnv( idist, iseed2, B_ref.size(), &B_ref[0] );
testsweeper::flush_cache( params.cache() );
time = testsweeper::get_wtime();
int64_t info_ref = LAPACKE_gesv( n, nrhs, &A_ref[0], lda, &ipiv_ref[0],
&B_ref[0], ldb );
time = testsweeper::get_wtime() - time;
if (info_ref != 0) {
fprintf( stderr, "LAPACKE_gesv returned error %lld\n", llong( info_ref ) );
}
params.ref_time() = time;
params.ref_gflops() = gflop / time;
if (verbose >= 2) {
printf( "Aref_factor = " );
print_matrix( n, n, &A_ref[0], lda );
printf( "Xref = " );
print_matrix( n, nrhs, &B_ref[0], ldb );
}
}
}
// -----------------------------------------------------------------------------
void test_gesv( Params& params, bool run )
{
switch (params.datatype()) {
case testsweeper::DataType::Single:
test_gesv_work< float >( params, run );
break;
case testsweeper::DataType::Double:
test_gesv_work< double >( params, run );
break;
case testsweeper::DataType::SingleComplex:
test_gesv_work< std::complex<float> >( params, run );
break;
case testsweeper::DataType::DoubleComplex:
test_gesv_work< std::complex<double> >( params, run );
break;
default:
throw std::runtime_error( "unknown datatype" );
break;
}
}
|
