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
|
<%inherit file='base'/>
__global__ __launch_bounds__(128) void
% if n is None:
${kname}(int n,
const ${dtype}* __restrict__ b, int ldb,
${dtype}* __restrict__ c, int ldc)
{
% if width > 1:
n = ((n + ${width} - 1) / ${width}) * ${width};
ldb /= ${width};
ldc /= ${width};
% endif
% else:
${kname}(const ${dtype}* __restrict__ b, ${dtype}* __restrict__ c)
{
const int n = ${-(-n // width)};
const ${'long long' if k*ldb >= width*2**31 else 'int'} ldb = ${ldb // width};
const ${'long long' if m*ldc >= width*2**31 else 'int'} ldc = ${ldc // width};
% endif
const int i = blockDim.x*blockIdx.x + threadIdx.x;
if (i < n)
{
${dtype} bv, csub[${m}];
## Iterare through the used rows of B
% for kx in bix:
bv = b[i + ${kx}*ldb];
% for j, jx in enumerate(A[:, kx]):
% if jx != 0 and kx == afix[j]:
csub[${j}] = ${jx}*bv;
% elif jx != 0:
csub[${j}] += ${jx}*bv;
% endif
##
% if kx == alix[j] and beta == 0:
c[i + ${j}*ldc] = csub[${j}];
% elif kx == alix[j] and beta == 1:
c[i + ${j}*ldc] += csub[${j}];
% elif kx == alix[j]:
c[i + ${j}*ldc] = csub[${j}] + ${beta}*c[i + ${j}*ldc];
% endif
% endfor
% endfor
## Handle rows of A which are all zero
% for j, jx in enumerate(afix):
% if jx == -1 and beta == 0:
c[i + ${j}*ldc] = make_zero();
% elif jx == -1 and beta != 1:
c[i + ${j}*ldc] *= ${beta};
% endif
% endfor
}
}
|
