This repository was archived by the owner on Mar 28, 2023. It is now read-only.
forked from llvm/llvm-test-suite
-
Notifications
You must be signed in to change notification settings - Fork 131
/
Copy pathjoint_matrix_all_sizes_impl.hpp
230 lines (209 loc) · 8.71 KB
/
joint_matrix_all_sizes_impl.hpp
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
#define BF16_EPSILON 0.00781250
static constexpr size_t M_MULTIPLIER = 16;
template <typename T, size_t NUM_ROWS, size_t NUM_COLS> struct big_matrix {
private:
T *mat;
public:
T *get_data() { return mat; }
void set_data(T *data) { mat = data; }
big_matrix(T *data) : mat(data) {}
};
template <typename T>
void matrix_vnni(unsigned int rows, unsigned int cols, T *src, T *dest,
unsigned int vnniFactor) {
for (unsigned int i = 0; i < rows / vnniFactor; i++) {
for (unsigned int j = 0; j < cols; j++) {
for (unsigned int k = 0; k < vnniFactor; k++) {
dest[i * cols * vnniFactor + j * vnniFactor + k] =
src[(i * vnniFactor + k) * cols + j];
}
}
}
}
template <typename T1, typename T2, size_t M, size_t N, size_t K,
int vnniFactor, size_t TM, size_t TN, size_t TK>
void matrix_multiply(big_matrix<T1, M, N> &C, big_matrix<T2, M, K> &A,
big_matrix<T2, K / vnniFactor, N * vnniFactor> &B) {
size_t NDRangeM = M / TM;
size_t NDRangeN = N / TN;
buffer<T2, 2> bufA(A.get_data(), range<2>(M, K));
buffer<T2, 2> bufB(B.get_data(), range<2>(K, N));
buffer<T1, 2> bufC(C.get_data(), range<2>(M, N));
queue q;
q.submit([&](handler &cgh) {
sycl::accessor accC{bufC, cgh, sycl::read_write};
sycl::accessor accA{bufA, cgh, sycl::read_only};
sycl::accessor accB{bufB, cgh, sycl::read_only};
cgh.parallel_for(
nd_range<2>({NDRangeM, NDRangeN * SG_SZ}, {1, 1 * SG_SZ}),
[=](nd_item<2> spmd_item) [[intel::reqd_sub_group_size(SG_SZ)]]
{
// The submatrix API has to be accessed by all the workitems in a
// subgroup these functions will be called once by the subgroup no
// code divergence between the workitems
const auto global_idx = spmd_item.get_global_id(0);
const auto global_idy = spmd_item.get_global_id(1);
const auto sg_startx = global_idx - spmd_item.get_local_id(0);
const auto sg_starty = global_idy - spmd_item.get_local_id(1);
sub_group sg = spmd_item.get_sub_group();
joint_matrix<sub_group, T2, use::a, TM, TK, layout::row_major> sub_a;
// For B, we assume B has been already VNNIed.
joint_matrix<sub_group, T2, use::b, TK, TN,
ext::intel::experimental::matrix::layout::packed>
sub_b;
joint_matrix<sub_group, T1, use::accumulator, TM, TN> sub_c;
joint_matrix_load(sg, sub_c,
accC.get_pointer() + (sg_startx * TM) * N +
sg_starty / SG_SZ * TN,
N, layout::row_major);
for (int k = 0; k < K / TK; k += 1) {
joint_matrix_load(
sg, sub_a, accA.get_pointer() + (sg_startx * TM) * K + k * TK,
K);
joint_matrix_load(sg, sub_b,
accB.get_pointer() +
(k * TK / vnniFactor) * (N * vnniFactor) +
sg_starty / SG_SZ * TN * vnniFactor,
N * vnniFactor);
sub_c = joint_matrix_mad(sg, sub_a, sub_b, sub_c);
}
joint_matrix_store(sg, sub_c,
accC.get_pointer() + (sg_startx * TM) * N +
sg_starty / SG_SZ * TN,
N, layout::row_major);
}); // parallel for
}).wait();
}
static constexpr size_t MATRIX_N = 128;
static constexpr size_t MATRIX_K = 128;
float make_fp32(bfloat16 x) {
unsigned int y = *((int *)&x);
y = y << 16;
float *res = reinterpret_cast<float *>(&y);
return *res;
}
template <typename Ta, typename Tc>
void matrix_multiply_ref(Ta *A, Ta *B, Tc *C, int M, int N, int K) {
for (int m = 0; m < M; m++)
for (int n = 0; n < N; n++) {
for (int k = 0; k < K; k++) {
if (std::is_same_v<Ta, bfloat16> && std::is_same_v<Tc, float>)
C[m * N + n] += make_fp32(A[m * K + k]) * make_fp32(B[k * N + n]);
if (std::is_same_v<Ta, int8_t> && std::is_same_v<Tc, int32_t>)
C[m * N + n] += A[m * K + k] * B[k * N + n];
}
}
}
template <typename Ta, typename Tc, int vnni_factor, size_t tM, size_t tN,
size_t tK>
int init_and_multiply() {
static constexpr size_t MATRIX_M = tM * M_MULTIPLIER;
std::cout << "MATRIX_M=" << MATRIX_M << "\n";
Ta A[MATRIX_M][MATRIX_K];
Ta B[MATRIX_K][MATRIX_N];
Ta Bvnni[MATRIX_K / vnni_factor][MATRIX_N * vnni_factor];
Tc C[MATRIX_M][MATRIX_N];
Tc D[MATRIX_M][MATRIX_N];
for (int i = 0; i < MATRIX_M; i++) {
for (int j = 0; j < MATRIX_K; j++) {
if (std::is_same_v<Ta, bfloat16> && std::is_same_v<Tc, float>)
A[i][j] = bfloat16(1.0f * (i + j));
if (std::is_same_v<Ta, int8_t> && std::is_same_v<Tc, int32_t>)
A[i][j] = i + j;
}
}
for (int i = 0; i < MATRIX_K; i++) {
for (int j = 0; j < MATRIX_N; j++) {
if (std::is_same_v<Ta, bfloat16> && std::is_same_v<Tc, float>)
B[i][j] = bfloat16(2.0f * i + 3.0f * j);
if (std::is_same_v<Ta, int8_t> && std::is_same_v<Tc, int32_t>)
B[i][j] = i + 2 * j;
}
}
for (int i = 0; i < MATRIX_M; i++) {
for (int j = 0; j < MATRIX_N; j++) {
C[i][j] = 1;
D[i][j] = 1;
}
}
big_matrix<Tc, MATRIX_M, MATRIX_N> MC((Tc *)&C);
big_matrix<Tc, MATRIX_M, MATRIX_N> MD((Tc *)&D);
big_matrix<Ta, MATRIX_M, MATRIX_K> MA((Ta *)&A);
matrix_vnni<Ta>(MATRIX_K, MATRIX_N, (Ta *)&B, (Ta *)&Bvnni, vnni_factor);
big_matrix<Ta, MATRIX_K / vnni_factor, MATRIX_N * vnni_factor> MBvnni(
(Ta *)&Bvnni);
matrix_multiply<Tc, Ta, MATRIX_M, MATRIX_N, MATRIX_K, vnni_factor, tM, tN,
tK>(MC, MA, MBvnni);
matrix_multiply_ref((Ta *)A, (Ta *)B, (Tc *)D, MATRIX_M, MATRIX_N, MATRIX_K);
bool res = true;
for (int i = 0; i < MATRIX_M; i++) {
for (int j = 0; j < MATRIX_N; j++) {
if constexpr (std::is_same_v<Ta, bfloat16> && std::is_same_v<Tc, float>) {
if (fabs(C[i][j] - D[i][j]) > BF16_EPSILON) {
res = false;
std::cout << "Failed bfloat16: C is " << C[i][j] << ", D is "
<< D[i][j] << std::endl;
}
} else if (std::is_same_v<Ta, int8_t> && std::is_same_v<Tc, int32_t>) {
if (C[i][j] != D[i][j]) {
res = false;
std::cout << "Failed int8_t: C is " << C[i][j] << ", D is " << D[i][j]
<< std::endl;
}
}
}
}
std::cout << (res ? "passed" : "failed") << std::endl;
return !res;
}
int main() {
#if defined(JOINT_MATRIX_TEST_BF16_1) || defined(JOINT_MATRIX_TEST_ALL_BF16)
init_and_multiply<bfloat16, float, 2, 1, SG_SZ, 16>();
#endif
#if defined(JOINT_MATRIX_TEST_BF16_2) || defined(JOINT_MATRIX_TEST_ALL_BF16)
init_and_multiply<bfloat16, float, 2, 2, SG_SZ, 16>();
#endif
#if defined(JOINT_MATRIX_TEST_BF16_3) || defined(JOINT_MATRIX_TEST_ALL_BF16)
init_and_multiply<bfloat16, float, 2, 3, SG_SZ, 16>();
#endif
#if defined(JOINT_MATRIX_TEST_BF16_4) || defined(JOINT_MATRIX_TEST_ALL_BF16)
init_and_multiply<bfloat16, float, 2, 4, SG_SZ, 16>();
#endif
#if defined(JOINT_MATRIX_TEST_BF16_5) || defined(JOINT_MATRIX_TEST_ALL_BF16)
init_and_multiply<bfloat16, float, 2, 5, SG_SZ, 16>();
#endif
#if defined(JOINT_MATRIX_TEST_BF16_6) || defined(JOINT_MATRIX_TEST_ALL_BF16)
init_and_multiply<bfloat16, float, 2, 6, SG_SZ, 16>();
#endif
#if defined(JOINT_MATRIX_TEST_BF16_7) || defined(JOINT_MATRIX_TEST_ALL_BF16)
init_and_multiply<bfloat16, float, 2, 7, SG_SZ, 16>();
#endif
#if defined(JOINT_MATRIX_TEST_BF16_8) || defined(JOINT_MATRIX_TEST_ALL_BF16)
init_and_multiply<bfloat16, float, 2, 8, SG_SZ, 16>();
#endif
#if defined(JOINT_MATRIX_TEST_INT8_1) || defined(JOINT_MATRIX_TEST_ALL_INT8)
init_and_multiply<int8_t, int32_t, 4, 1, SG_SZ, 32>();
#endif
#if defined(JOINT_MATRIX_TEST_INT8_2) || defined(JOINT_MATRIX_TEST_ALL_INT8)
init_and_multiply<int8_t, int32_t, 4, 2, SG_SZ, 32>();
#endif
#if defined(JOINT_MATRIX_TEST_INT8_3) || defined(JOINT_MATRIX_TEST_ALL_INT8)
init_and_multiply<int8_t, int32_t, 4, 3, SG_SZ, 32>();
#endif
#if defined(JOINT_MATRIX_TEST_INT8_4) || defined(JOINT_MATRIX_TEST_ALL_INT8)
init_and_multiply<int8_t, int32_t, 4, 4, SG_SZ, 32>();
#endif
#if defined(JOINT_MATRIX_TEST_INT8_5) || defined(JOINT_MATRIX_TEST_ALL_INT8)
init_and_multiply<int8_t, int32_t, 4, 5, SG_SZ, 32>();
#endif
#if defined(JOINT_MATRIX_TEST_INT8_6) || defined(JOINT_MATRIX_TEST_ALL_INT8)
init_and_multiply<int8_t, int32_t, 4, 6, SG_SZ, 32>();
#endif
#if defined(JOINT_MATRIX_TEST_INT8_7) || defined(JOINT_MATRIX_TEST_ALL_INT8)
init_and_multiply<int8_t, int32_t, 4, 7, SG_SZ, 32>();
#endif
#if defined(JOINT_MATRIX_TEST_INT8_8) || defined(JOINT_MATRIX_TEST_ALL_INT8)
init_and_multiply<int8_t, int32_t, 4, 8, SG_SZ, 32>();
#endif
return 0;
}