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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
|
/*! \file */
/* ************************************************************************
* Copyright (C) 2021 Advanced Micro Devices, Inc. All rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*
* ************************************************************************ */
#include "rocsparse_check.hpp"
#ifdef GOOGLE_TEST
#include <gtest/gtest.h>
#endif
#ifndef GOOGLE_TEST
#include <iostream>
#define ASSERT_TRUE(cond) \
do \
{ \
if(!(cond)) \
{ \
std::cerr << "ASSERT_TRUE() failed." << std::endl; \
exit(EXIT_FAILURE); \
} \
} while(0)
#define ASSERT_EQ(state1, state2) \
do \
{ \
if(state1 != state2) \
{ \
std::cerr.precision(16); \
std::cerr << "ASSERT_EQ(" << state1 << ", " << state2 << ") failed." << std::endl; \
exit(EXIT_FAILURE); \
} \
} while(0)
#define ASSERT_FLOAT_EQ ASSERT_EQ
#define ASSERT_DOUBLE_EQ ASSERT_EQ
#endif
#define ASSERT_FLOAT_COMPLEX_EQ(a, b) \
do \
{ \
ASSERT_FLOAT_EQ(std::real(a), std::real(b)); \
ASSERT_FLOAT_EQ(std::imag(a), std::imag(b)); \
} while(0)
#define ASSERT_DOUBLE_COMPLEX_EQ(a, b) \
do \
{ \
ASSERT_DOUBLE_EQ(std::real(a), std::real(b)); \
ASSERT_DOUBLE_EQ(std::imag(a), std::imag(b)); \
} while(0)
#define ROCSPARSE_UNIT_CHECK(M, N, A, LDA, B, LDB, UNIT_ASSERT_EQ) \
do \
{ \
for(rocsparse_int j = 0; j < N; ++j) \
for(rocsparse_int i = 0; i < M; ++i) \
if(rocsparse_isnan(A[i + j * LDA])) \
{ \
ASSERT_TRUE(rocsparse_isnan(B[i + j * LDB])); \
} \
else \
{ \
UNIT_ASSERT_EQ(A[i + j * LDA], B[i + j * LDB]); \
} \
} while(0)
template <>
void unit_check_general(
int64_t M, int64_t N, const float* A, int64_t LDA, const float* B, int64_t LDB)
{
ROCSPARSE_UNIT_CHECK(M, N, A, LDA, B, LDB, ASSERT_FLOAT_EQ);
}
template <>
void unit_check_general(
int64_t M, int64_t N, const double* A, int64_t LDA, const double* B, int64_t LDB)
{
ROCSPARSE_UNIT_CHECK(M, N, A, LDA, B, LDB, ASSERT_DOUBLE_EQ);
}
template <>
void unit_check_general(int64_t M,
int64_t N,
const rocsparse_float_complex* A,
int64_t LDA,
const rocsparse_float_complex* B,
int64_t LDB)
{
ROCSPARSE_UNIT_CHECK(M, N, A, LDA, B, LDB, ASSERT_FLOAT_COMPLEX_EQ);
}
template <>
void unit_check_general(int64_t M,
int64_t N,
const rocsparse_double_complex* A,
int64_t LDA,
const rocsparse_double_complex* B,
int64_t LDB)
{
ROCSPARSE_UNIT_CHECK(M, N, A, LDA, B, LDB, ASSERT_DOUBLE_COMPLEX_EQ);
}
template <>
void unit_check_general(
int64_t M, int64_t N, const int32_t* A, int64_t LDA, const int32_t* B, int64_t LDB)
{
ROCSPARSE_UNIT_CHECK(M, N, A, LDA, B, LDB, ASSERT_EQ);
}
template <>
void unit_check_general(
int64_t M, int64_t N, const int64_t* A, int64_t LDA, const int64_t* B, int64_t LDB)
{
ROCSPARSE_UNIT_CHECK(M, N, A, LDA, B, LDB, ASSERT_EQ);
}
template <>
void unit_check_general(
int64_t M, int64_t N, const size_t* A, int64_t LDA, const size_t* B, int64_t LDB)
{
ROCSPARSE_UNIT_CHECK(M, N, A, LDA, B, LDB, ASSERT_EQ);
}
template <>
void unit_check_enum(const rocsparse_index_base a, const rocsparse_index_base b)
{
ASSERT_TRUE(a == b);
}
template <>
void unit_check_enum(const rocsparse_order a, const rocsparse_order b)
{
ASSERT_TRUE(a == b);
}
template <>
void unit_check_enum(const rocsparse_direction a, const rocsparse_direction b)
{
ASSERT_TRUE(a == b);
}
#define MAX_TOL_MULTIPLIER 4
template <typename T>
void near_check_general_template(rocsparse_int M,
rocsparse_int N,
const T* A,
rocsparse_int LDA,
const T* B,
rocsparse_int LDB,
floating_data_t<T> tol = default_tolerance<T>::value)
{
int tolm = 1;
for(rocsparse_int j = 0; j < N; ++j)
{
for(rocsparse_int i = 0; i < M; ++i)
{
T compare_val
= std::max(std::abs(A[i + j * LDA] * tol), 10 * std::numeric_limits<T>::epsilon());
#ifdef GOOGLE_TEST
if(rocsparse_isnan(A[i + j * LDA]))
{
ASSERT_TRUE(rocsparse_isnan(B[i + j * LDB]));
}
else if(rocsparse_isinf(A[i + j * LDA]))
{
ASSERT_TRUE(rocsparse_isinf(B[i + j * LDB]));
}
else
{
int k;
for(k = 1; k <= MAX_TOL_MULTIPLIER; ++k)
{
if(std::abs(A[i + j * LDA] - B[i + j * LDB]) <= compare_val * k)
{
break;
}
}
if(k > MAX_TOL_MULTIPLIER)
{
ASSERT_NEAR(A[i + j * LDA], B[i + j * LDB], compare_val);
}
tolm = std::max(tolm, k);
}
#else
int k;
for(k = 1; k <= MAX_TOL_MULTIPLIER; ++k)
{
if(std::abs(A[i + j * LDA] - B[i + j * LDB]) <= compare_val * k)
{
break;
}
}
if(k > MAX_TOL_MULTIPLIER)
{
std::cerr.precision(12);
std::cerr << "ASSERT_NEAR(" << A[i + j * LDA] << ", " << B[i + j * LDB]
<< ") failed: " << std::abs(A[i + j * LDA] - B[i + j * LDB])
<< " exceeds permissive range [" << compare_val << ","
<< compare_val * MAX_TOL_MULTIPLIER << " ]" << std::endl;
exit(EXIT_FAILURE);
}
tolm = std::max(tolm, k);
#endif
}
}
if(tolm > 1)
{
std::cerr << "WARNING near_check has been permissive with a tolerance multiplier equal to "
<< tolm << std::endl;
}
}
template <>
void near_check_general_template(rocsparse_int M,
rocsparse_int N,
const rocsparse_float_complex* A,
rocsparse_int LDA,
const rocsparse_float_complex* B,
rocsparse_int LDB,
float tol)
{
int tolm = 1;
for(rocsparse_int j = 0; j < N; ++j)
{
for(rocsparse_int i = 0; i < M; ++i)
{
rocsparse_float_complex compare_val
= rocsparse_float_complex(std::max(std::abs(std::real(A[i + j * LDA]) * tol),
10 * std::numeric_limits<float>::epsilon()),
std::max(std::abs(std::imag(A[i + j * LDA]) * tol),
10 * std::numeric_limits<float>::epsilon()));
#ifdef GOOGLE_TEST
if(rocsparse_isnan(A[i + j * LDA]))
{
ASSERT_TRUE(rocsparse_isnan(B[i + j * LDB]));
}
else if(rocsparse_isinf(A[i + j * LDA]))
{
ASSERT_TRUE(rocsparse_isinf(B[i + j * LDB]));
}
else
{
int k;
for(k = 1; k <= MAX_TOL_MULTIPLIER; ++k)
{
if(std::abs(std::real(A[i + j * LDA]) - std::real(B[i + j * LDB]))
<= std::real(compare_val) * k
&& std::abs(std::imag(A[i + j * LDA]) - std::imag(B[i + j * LDB]))
<= std::imag(compare_val) * k)
{
break;
}
}
if(k > MAX_TOL_MULTIPLIER)
{
ASSERT_NEAR(std::real(A[i + j * LDA]),
std::real(B[i + j * LDB]),
std::real(compare_val));
ASSERT_NEAR(std::imag(A[i + j * LDA]),
std::imag(B[i + j * LDB]),
std::imag(compare_val));
}
tolm = std::max(tolm, k);
}
#else
int k;
for(k = 1; k <= MAX_TOL_MULTIPLIER; ++k)
{
if(std::abs(std::real(A[i + j * LDA]) - std::real(B[i + j * LDB]))
<= std::real(compare_val) * k
&& std::abs(std::imag(A[i + j * LDA]) - std::imag(B[i + j * LDB]))
<= std::imag(compare_val) * k)
{
break;
}
}
if(k > MAX_TOL_MULTIPLIER)
{
std::cerr.precision(16);
std::cerr << "ASSERT_NEAR(" << A[i + j * LDA] << ", " << B[i + j * LDB]
<< ") failed: " << std::abs(A[i + j * LDA] - B[i + j * LDB])
<< " exceeds permissive range [" << compare_val << ","
<< compare_val * MAX_TOL_MULTIPLIER << " ]" << std::endl;
exit(EXIT_FAILURE);
}
tolm = std::max(tolm, k);
#endif
}
}
if(tolm > 1)
{
std::cerr << "WARNING near_check has been permissive with a tolerance multiplier equal to "
<< tolm << std::endl;
}
}
template <>
void near_check_general_template(rocsparse_int M,
rocsparse_int N,
const rocsparse_double_complex* A,
rocsparse_int LDA,
const rocsparse_double_complex* B,
rocsparse_int LDB,
double tol)
{
int tolm = 1;
for(rocsparse_int j = 0; j < N; ++j)
{
for(rocsparse_int i = 0; i < M; ++i)
{
rocsparse_double_complex compare_val
= rocsparse_double_complex(std::max(std::abs(std::real(A[i + j * LDA]) * tol),
10 * std::numeric_limits<double>::epsilon()),
std::max(std::abs(std::imag(A[i + j * LDA]) * tol),
10 * std::numeric_limits<double>::epsilon()));
#ifdef GOOGLE_TEST
if(rocsparse_isnan(A[i + j * LDA]))
{
ASSERT_TRUE(rocsparse_isnan(B[i + j * LDB]));
}
else if(rocsparse_isinf(A[i + j * LDA]))
{
ASSERT_TRUE(rocsparse_isinf(B[i + j * LDB]));
}
else
{
int k;
for(k = 1; k <= MAX_TOL_MULTIPLIER; ++k)
{
if(std::abs(std::real(A[i + j * LDA]) - std::real(B[i + j * LDB]))
<= std::real(compare_val) * k
&& std::abs(std::imag(A[i + j * LDA]) - std::imag(B[i + j * LDB]))
<= std::imag(compare_val) * k)
{
break;
}
}
if(k > MAX_TOL_MULTIPLIER)
{
ASSERT_NEAR(std::real(A[i + j * LDA]),
std::real(B[i + j * LDB]),
std::real(compare_val));
ASSERT_NEAR(std::imag(A[i + j * LDA]),
std::imag(B[i + j * LDB]),
std::imag(compare_val));
}
tolm = std::max(tolm, k);
}
#else
int k;
for(k = 1; k <= MAX_TOL_MULTIPLIER; ++k)
{
if(std::abs(std::real(A[i + j * LDA]) - std::real(B[i + j * LDB]))
<= std::real(compare_val) * k
&& std::abs(std::imag(A[i + j * LDA]) - std::imag(B[i + j * LDB]))
<= std::imag(compare_val) * k)
{
break;
}
}
if(k > MAX_TOL_MULTIPLIER)
{
std::cerr.precision(16);
std::cerr << "ASSERT_NEAR(" << A[i + j * LDA] << ", " << B[i + j * LDB]
<< ") failed: " << std::abs(A[i + j * LDA] - B[i + j * LDB])
<< " exceeds permissive range [" << compare_val << ","
<< compare_val * MAX_TOL_MULTIPLIER << " ]" << std::endl;
exit(EXIT_FAILURE);
}
tolm = std::max(tolm, k);
#endif
}
}
if(tolm > 1)
{
std::cerr << "WARNING near_check has been permissive with a tolerance multiplier equal to "
<< tolm << std::endl;
}
}
template <typename T>
void near_check_general(rocsparse_int M,
rocsparse_int N,
const T* A,
rocsparse_int LDA,
const T* B,
rocsparse_int LDB,
floating_data_t<T> tol)
{
near_check_general_template(M, N, A, LDA, B, LDB, tol);
}
#define INSTANTIATE(TYPE) \
template void near_check_general(rocsparse_int M, \
rocsparse_int N, \
const TYPE* A, \
rocsparse_int LDA, \
const TYPE* B, \
rocsparse_int LDB, \
floating_data_t<TYPE> tol)
INSTANTIATE(float);
INSTANTIATE(double);
INSTANTIATE(rocsparse_float_complex);
INSTANTIATE(rocsparse_double_complex);
#undef INSTANTIATE
|
