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 2013 Advanced Micro Devices, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
* ************************************************************************/
#ifndef SBMV_H_
#define SBMV_H_
#include <gtest/gtest.h>
#include <clBLAS.h>
#include <common.h>
#include <BlasBase.h>
#include <ExtraTestSizes.h>
#include <blas-random.h>
#include <blas-math.h>
using namespace clMath;
using ::testing::TestWithParam;
class SBMV : public TestWithParam<
::std::tr1::tuple<
clblasOrder, // order
clblasUplo, // uplo
int, // N
int, // K
ExtraTestSizes,
ComplexLong, // Alpha
ComplexLong, // Beta
int // numCommandQueues
> > {
public:
void getParams(TestParams *params)
{
memset(params, 0, sizeof(TestParams));
params->order = order;
params->uplo = uplo;
params->seed = seed;
params->N = N;
params->K = KLU;
params->lda = lda;
params->incx = incx;
params->incy = incy;
params->offA = offA;
params->offa = offA;
params->offBX = offx;
params->offCY = offy;
params->alpha = paramAlpha;
params->beta = paramBeta;
params->numCommandQueues = numCommandQueues;
}
protected:
virtual void SetUp()
{
ExtraTestSizes extra;
order = ::std::tr1::get<0>(GetParam());
uplo = ::std::tr1::get<1>(GetParam());
N = ::std::tr1::get<2>(GetParam());
KLU = ::std::tr1::get<3>(GetParam());
extra = ::std::tr1::get<4>(GetParam());
offA = extra.offA;
offx = extra.offBX;
offy = extra.offCY;
lda = extra.strideA.ld;
incx = extra.strideBX.inc;
incy = extra.strideCY.inc;
paramAlpha = ::std::tr1::get<5>(GetParam());
paramBeta = ::std::tr1::get<6>(GetParam());
numCommandQueues = ::std::tr1::get<7>(GetParam());
base = ::clMath::BlasBase::getInstance();
seed = base->seed();
useNumCommandQueues = base->useNumCommandQueues();
if (useNumCommandQueues) {
numCommandQueues = base->numCommandQueues();
}
KLU = KLU % N;
lda = ::std::max(lda, (KLU+1));
printTestParams(order, uplo, N, KLU, paramAlpha, offA,
lda, offx, incx, paramBeta, offy, incy);
::std::cerr << "seed = " << seed << ::std::endl;
::std::cerr << "queues = " << numCommandQueues << ::std::endl;
}
clblasOrder order;
clblasUplo uplo;
size_t N, KLU;
size_t lda;
int incx, incy;
size_t offA, offx, offy;
unsigned int seed;
ComplexLong paramAlpha, paramBeta;
::clMath::BlasBase *base;
bool useNumCommandQueues;
cl_uint numCommandQueues;
};
/*template <typename T>
static void
randomGbmvMatrices(
clblasOrder order,
clblasTranspose trans,
size_t M,
size_t N,
T *alpha,
T *beta,
T *A,
size_t lda,
T *X,
int incx,
T *Y,
int incy
)
{
size_t i;
size_t lenX, lenY, lenA;
cl_double bound, maxAB, maxMN;
// bound is calculated by solving the equation (alpha*x^2 + x - UPPER_BOUND) < 0
bound = UPPER_BOUND<T>();
if(module(maxVal(*alpha)) > (sqrt(bound) / (2.0)))
*alpha = random<T>((sqrt(bound) / (2.0)));
if(module(maxVal(*beta)) > (sqrt(bound) / (2.0)))
*beta = random<T>((sqrt(bound) / (2.0)));
maxAB = module( ::std::max(maxVal(*alpha), maxVal(*beta)) ); // Take max of alpha & beta
maxMN = ::std::max( M, N );
bound = sqrt( bound / (maxAB*maxMN) ); // (maxAB * N * bound^2 + maxAB * bound - UPPER_BOUND) < 0
lenA = ((order == clblasRowMajor)? M: N) * lda;
for (i = 0; i < lenA; i++) {
A[i] = random<T>(bound);
}
if( trans == clblasNoTrans )
{
lenX = 1 + ((N - 1) * abs(incx));
lenY = 1 + ((M - 1) * abs(incy));
}
else {
lenX = 1 + ((M - 1) * abs(incx));
lenY = 1 + ((N - 1) * abs(incy));
}
if (X != NULL) {
for (i = 0; i < lenX; i++) {
X[i] = random<T>(bound);
}
}
if (Y != NULL) {
for (i = 0; i < lenY; i++) {
Y[i] = random<T>(bound);
}
}
}*/
#endif // GBMV_H_
|
