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
|
/* ************************************************************************
* Copyright (C) 2023-2024 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 cop-
* ies 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 IM-
* PLIED, 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 CONNE-
* CTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*
* ************************************************************************ */
#pragma once
#include "hipsolver.h"
#include "hipsolver.hpp"
#include "hipsparse/hipsparse.h"
// Most functions within this file exist to provide a consistent interface for our templated tests.
// Function overloading is used to select between the float, double, rocblas_float_complex
// and rocblas_double_complex variants, and to distinguish the batched case (T**) from the normal
// and strided_batched cases (T*).
//
// The normal and strided_batched cases are distinguished from each other by passing a boolean
// parameter, STRIDED. Variants such as the blocked and unblocked versions of algorithms, may be
// provided in similar ways.
/* ============================================================================================
*/
/*! \brief local matrix descriptor which is automatically created and destroyed */
class hipsparse_local_mat_descr
{
hipsparseMatDescr_t m_info;
public:
hipsparse_local_mat_descr()
{
if(hipsparseCreateMatDescr(&m_info) != HIPSPARSE_STATUS_SUCCESS)
throw std::runtime_error("ERROR: Could not create hipsparseMatDescr_t");
}
~hipsparse_local_mat_descr()
{
hipsparseDestroyMatDescr(m_info);
}
hipsparse_local_mat_descr(const hipsparse_local_mat_descr&) = delete;
hipsparse_local_mat_descr(hipsparse_local_mat_descr&&) = delete;
hipsparse_local_mat_descr& operator=(const hipsparse_local_mat_descr&) = delete;
hipsparse_local_mat_descr& operator=(hipsparse_local_mat_descr&&) = delete;
// Allow hipsparse_local_mat_descr to be used anywhere hipsparseMatDescr_t is expected
operator hipsparseMatDescr_t&()
{
return m_info;
}
operator const hipsparseMatDescr_t&() const
{
return m_info;
}
};
/******************** CSRLSVCHOL ********************/
// normal and strided_batched
inline hipsolverStatus_t hipsolver_csrlsvchol(bool HOST,
hipsolverSpHandle_t handle,
int n,
int nnz,
const hipsparseMatDescr_t descrA,
const float* csrVal,
const int* csrRowPtr,
const int* csrColInd,
const float* b,
float tol,
int reorder,
float* x,
int* singularity)
{
if(!HOST)
return hipsolverSpScsrlsvchol(
handle, n, nnz, descrA, csrVal, csrRowPtr, csrColInd, b, tol, reorder, x, singularity);
else
return hipsolverSpScsrlsvcholHost(
handle, n, nnz, descrA, csrVal, csrRowPtr, csrColInd, b, tol, reorder, x, singularity);
}
inline hipsolverStatus_t hipsolver_csrlsvchol(bool HOST,
hipsolverSpHandle_t handle,
int n,
int nnz,
const hipsparseMatDescr_t descrA,
const double* csrVal,
const int* csrRowPtr,
const int* csrColInd,
const double* b,
double tol,
int reorder,
double* x,
int* singularity)
{
if(!HOST)
return hipsolverSpDcsrlsvchol(
handle, n, nnz, descrA, csrVal, csrRowPtr, csrColInd, b, tol, reorder, x, singularity);
else
return hipsolverSpDcsrlsvcholHost(
handle, n, nnz, descrA, csrVal, csrRowPtr, csrColInd, b, tol, reorder, x, singularity);
}
/*inline hipsolverStatus_t hipsolver_csrlsvchol(bool HOST,
hipsolverSpHandle_t handle,
int n,
int nnz,
const hipsparseMatDescr_t descrA,
const hipsolverComplex* csrVal,
const int* csrRowPtr,
const int* csrColInd,
const hipsolverComplex* b,
float tol,
int reorder,
hipsolverComplex* x,
int* singularity)
{
if(!HOST)
return hipsolverSpCcsrlsvchol(handle,
n,
nnz,
descrA,
(hipFloatComplex*)csrVal,
csrRowPtr,
csrColInd,
(hipFloatComplex*)b,
tol,
reorder,
(hipFloatComplex*)x,
singularity);
else
return hipsolverSpCcsrlsvcholHost(handle,
n,
nnz,
descrA,
(hipFloatComplex*)csrVal,
csrRowPtr,
csrColInd,
(hipFloatComplex*)b,
tol,
reorder,
(hipFloatComplex*)x,
singularity);
}
inline hipsolverStatus_t hipsolver_csrlsvchol(bool HOST,
hipsolverSpHandle_t handle,
int n,
int nnz,
const hipsparseMatDescr_t descrA,
const hipsolverDoubleComplex* csrVal,
const int* csrRowPtr,
const int* csrColInd,
const hipsolverDoubleComplex* b,
double tol,
int reorder,
hipsolverDoubleComplex* x,
int* singularity)
{
if(!HOST)
return hipsolverSpZcsrlsvchol(handle,
n,
nnz,
descrA,
(hipDoubleComplex*)csrVal,
csrRowPtr,
csrColInd,
(hipDoubleComplex*)b,
tol,
reorder,
(hipDoubleComplex*)x,
singularity);
else
return hipsolverSpZcsrlsvcholHost(handle,
n,
nnz,
descrA,
(hipDoubleComplex*)csrVal,
csrRowPtr,
csrColInd,
(hipDoubleComplex*)b,
tol,
reorder,
(hipDoubleComplex*)x,
singularity);
}*/
/********************************************************/
/******************** CSRLSVQR ********************/
// normal and strided_batched
inline hipsolverStatus_t hipsolver_csrlsvqr(bool HOST,
hipsolverSpHandle_t handle,
int n,
int nnz,
const hipsparseMatDescr_t descrA,
const float* csrVal,
const int* csrRowPtr,
const int* csrColInd,
const float* b,
double tol,
int reorder,
float* x,
int* singularity)
{
if(!HOST)
return hipsolverSpScsrlsvqr(
handle, n, nnz, descrA, csrVal, csrRowPtr, csrColInd, b, tol, reorder, x, singularity);
else
return HIPSOLVER_STATUS_NOT_SUPPORTED;
}
inline hipsolverStatus_t hipsolver_csrlsvqr(bool HOST,
hipsolverSpHandle_t handle,
int n,
int nnz,
const hipsparseMatDescr_t descrA,
const double* csrVal,
const int* csrRowPtr,
const int* csrColInd,
const double* b,
double tol,
int reorder,
double* x,
int* singularity)
{
if(!HOST)
return hipsolverSpDcsrlsvqr(
handle, n, nnz, descrA, csrVal, csrRowPtr, csrColInd, b, tol, reorder, x, singularity);
else
return HIPSOLVER_STATUS_NOT_SUPPORTED;
}
/*inline hipsolverStatus_t hipsolver_csrlsvqr(bool HOST,
hipsolverSpHandle_t handle,
int n,
int nnz,
const hipsparseMatDescr_t descrA,
const hipsolverComplex* csrVal,
const int* csrRowPtr,
const int* csrColInd,
const hipsolverComplex* b,
double tol,
int reorder,
hipsolverComplex* x,
int* singularity)
{
if(!HOST)
return hipsolverSpCcsrlsvqr(handle,
n,
nnz,
descrA,
(hipFloatComplex*)csrVal,
csrRowPtr,
csrColInd,
(hipFloatComplex*)b,
tol,
reorder,
(hipFloatComplex*)x,
singularity);
else
return HIPSOLVER_STATUS_NOT_SUPPORTED;
}
inline hipsolverStatus_t hipsolver_csrlsvqr(bool HOST,
hipsolverSpHandle_t handle,
int n,
int nnz,
const hipsparseMatDescr_t descrA,
const hipsolverDoubleComplex* csrVal,
const int* csrRowPtr,
const int* csrColInd,
const hipsolverDoubleComplex* b,
double tol,
int reorder,
hipsolverDoubleComplex* x,
int* singularity)
{
if(!HOST)
return hipsolverSpZcsrlsvqr(handle,
n,
nnz,
descrA,
(hipDoubleComplex*)csrVal,
csrRowPtr,
csrColInd,
(hipDoubleComplex*)b,
tol,
reorder,
(hipDoubleComplex*)x,
singularity);
else
return HIPSOLVER_STATUS_NOT_SUPPORTED;
}*/
/********************************************************/
|
