-
Notifications
You must be signed in to change notification settings - Fork 4.5k
Expand file tree
/
Copy pathsdpa_mips.cpp
More file actions
409 lines (351 loc) · 12.3 KB
/
Copy pathsdpa_mips.cpp
File metadata and controls
409 lines (351 loc) · 12.3 KB
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
// Copyright 2026 Tencent
// SPDX-License-Identifier: BSD-3-Clause
#include "sdpa_mips.h"
#include "cpu.h"
#include "layer_type.h"
namespace ncnn {
static Mat make_persistent_kvcache_view_mips(const Mat& cache, int seqlen)
{
Mat view = cache;
view.h = seqlen;
return view;
}
SDPA_mips::SDPA_mips()
{
#if NCNN_BF16
support_bf16_storage = true;
#endif
qk_gemm = 0;
qkv_gemm = 0;
qk_softmax = 0;
}
int SDPA_mips::create_pipeline(const Option& _opt)
{
Option opt = _opt;
if (int8_scale_term)
{
opt.use_packing_layout = false; // TODO enable packing
support_bf16_storage = false;
}
{
qk_softmax = ncnn::create_layer_cpu(ncnn::LayerType::Softmax);
ncnn::ParamDict pd;
pd.set(0, -1); // axis
pd.set(1, 1);
qk_softmax->load_param(pd);
qk_softmax->load_model(ModelBinFromMatArray(0));
qk_softmax->create_pipeline(opt);
}
// Q * K^T
if (scale != 0.f)
{
qk_gemm = ncnn::create_layer_cpu(ncnn::LayerType::Gemm);
ncnn::ParamDict pd;
pd.set(0, scale); // alpha
pd.set(1, 1.f / scale); // beta
pd.set(2, 0); // transA (Q: Seq x Embed)
pd.set(3, 1); // transB (K: Seq x Embed -> K^T: Embed x Seq) => Q * K^T
pd.set(4, 0); // constantA
pd.set(5, 0); // constantB
pd.set(6, attn_mask ? 0 : 1); // constantC (if mask exists, use it)
pd.set(7, 0); // M
pd.set(8, 0); // N
pd.set(9, 0); // K
pd.set(10, attn_mask ? 3 : -1); // constant_broadcast_type_C (MxN)
pd.set(11, 0); // output_N1M
pd.set(12, 1); // output_elempack
pd.set(13, 1); // output_elemtype = fp32
#if NCNN_INT8
pd.set(18, int8_scale_term);
#endif
qk_gemm->load_param(pd);
qk_gemm->load_model(ModelBinFromMatArray(0));
Option opt1 = opt;
opt1.num_threads = 1;
qk_gemm->create_pipeline(opt1);
}
// Attn * V
{
qkv_gemm = ncnn::create_layer_cpu(ncnn::LayerType::Gemm);
ncnn::ParamDict pd;
pd.set(0, 1.f); // alpha
pd.set(1, 1.f); // beta
pd.set(2, 0); // transA (Attn: Seq x Seq)
pd.set(3, 0); // transB (V: Seq x Embed) => Attn * V
pd.set(4, 0); // constantA
pd.set(5, 0); // constantB
pd.set(6, 1); // constantC (None)
pd.set(7, 0); // M
pd.set(8, 0); // N
pd.set(9, 0); // K
pd.set(10, -1); // constant_broadcast_type_C
pd.set(11, 0); // output_N1M
pd.set(12, 1); // output_elempack
pd.set(13, 1); // output_elemtype = fp32
pd.set(14, 0); // output_transpose
#if NCNN_INT8
pd.set(18, int8_scale_term);
#endif
qkv_gemm->load_param(pd);
qkv_gemm->load_model(ModelBinFromMatArray(0));
Option opt1 = opt;
opt1.num_threads = 1;
qkv_gemm->create_pipeline(opt1);
}
return 0;
}
int SDPA_mips::destroy_pipeline(const Option& _opt)
{
Option opt = _opt;
if (int8_scale_term)
{
opt.use_packing_layout = false; // TODO enable packing
}
if (qk_softmax)
{
qk_softmax->destroy_pipeline(opt);
delete qk_softmax;
qk_softmax = 0;
}
if (qk_gemm)
{
qk_gemm->destroy_pipeline(opt);
delete qk_gemm;
qk_gemm = 0;
}
if (qkv_gemm)
{
qkv_gemm->destroy_pipeline(opt);
delete qkv_gemm;
qkv_gemm = 0;
}
return 0;
}
int SDPA_mips::forward(const std::vector<Mat>& bottom_blobs, std::vector<Mat>& top_blobs, const Option& _opt) const
{
Option opt = _opt;
if (int8_scale_term)
{
opt.use_packing_layout = false; // TODO enable packing
}
const Mat& query = bottom_blobs[0];
const Mat& cur_key = bottom_blobs[1];
const Mat& cur_value = bottom_blobs[2];
const Mat& attn_mask_blob = attn_mask ? bottom_blobs[3] : Mat();
const int blob_offset = attn_mask ? 4 : 3;
if (kv_cache == 2 && (int)bottom_blobs.size() <= blob_offset + 1)
return -1;
const Mat& past_key = kv_cache ? bottom_blobs[blob_offset] : Mat();
const Mat& past_value = kv_cache ? bottom_blobs[blob_offset + 1] : Mat();
const int embed_dim = query.w;
const int src_seqlen = query.h;
const int num_heads = query.c;
const int cur_seqlen = cur_key.h;
const int num_group = cur_key.c;
const int out_embed_dim = cur_value.w;
int past_seqlen = 0;
if (kv_cache == 2)
{
if (past_key.dims == 0 || past_value.dims == 0)
return -1;
past_seqlen = past_key.h;
}
else if (kv_cache == 1 && past_key.dims > 0)
past_seqlen = past_key.h;
if (kv_cache == 2 && past_value.h != past_seqlen)
return -1;
const int dst_seqlen = past_seqlen + cur_seqlen;
const size_t elemsize = query.elemsize;
Mat key;
Mat value;
if (kv_cache == 2 && past_key.dims > 0)
{
const int key_capacity = (int)(past_key.cstep / embed_dim);
const int value_capacity = (int)(past_value.cstep / out_embed_dim);
if (dst_seqlen > key_capacity || dst_seqlen > value_capacity)
return -1;
#pragma omp parallel for num_threads(opt.num_threads)
for (int q = 0; q < num_group; q++)
{
unsigned char* pk = (unsigned char*)past_key.channel(q).data;
unsigned char* pv = (unsigned char*)past_value.channel(q).data;
memcpy(pk + (size_t)past_seqlen * embed_dim * elemsize,
cur_key.channel(q).data, embed_dim * cur_seqlen * elemsize);
memcpy(pv + (size_t)past_seqlen * out_embed_dim * elemsize,
cur_value.channel(q).data, out_embed_dim * cur_seqlen * elemsize);
}
key.create(embed_dim, dst_seqlen, num_group, elemsize, opt.blob_allocator);
if (key.empty())
return -100;
value.create(out_embed_dim, dst_seqlen, num_group, elemsize, opt.blob_allocator);
if (value.empty())
return -100;
#pragma omp parallel for num_threads(opt.num_threads)
for (int q = 0; q < num_group; q++)
{
memcpy(key.channel(q), past_key.channel(q), embed_dim * dst_seqlen * elemsize);
memcpy(value.channel(q), past_value.channel(q), out_embed_dim * dst_seqlen * elemsize);
}
}
else if (past_seqlen > 0)
{
key.create(embed_dim, dst_seqlen, num_group, elemsize, opt.blob_allocator);
if (key.empty())
return -100;
#pragma omp parallel for num_threads(opt.num_threads)
for (int q = 0; q < num_group; q++)
{
const Mat past_key_head = past_key.channel(q);
const Mat cur_key_head = cur_key.channel(q);
Mat key_head = key.channel(q);
memcpy(key_head.row(0), past_key_head, embed_dim * past_seqlen * elemsize);
memcpy(key_head.row(past_seqlen), cur_key_head, embed_dim * cur_seqlen * elemsize);
}
}
else
{
key = cur_key;
}
if (kv_cache != 2 && past_seqlen > 0)
{
value.create(out_embed_dim, dst_seqlen, num_group, elemsize, opt.blob_allocator);
if (value.empty())
return -100;
#pragma omp parallel for num_threads(opt.num_threads)
for (int q = 0; q < num_group; q++)
{
const Mat past_value_head = past_value.channel(q);
const Mat cur_value_head = cur_value.channel(q);
Mat value_head = value.channel(q);
memcpy(value_head.row(0), past_value_head, out_embed_dim * past_seqlen * elemsize);
memcpy(value_head.row(past_seqlen), cur_value_head, out_embed_dim * cur_seqlen * elemsize);
}
}
else if (kv_cache != 2)
{
value = cur_value;
}
const int num_heads_per_group = num_heads / num_group;
Mat qk_cross(dst_seqlen, src_seqlen, num_heads, 4u, opt.workspace_allocator);
if (qk_cross.empty())
return -100;
std::vector<int> retqks(num_heads);
// Dynamic Scale Calculation and Beta Correction
Layer* _qk_gemm = qk_gemm;
if (scale == 0.f)
{
float _scale = 1.f / sqrt(embed_dim);
_qk_gemm = ncnn::create_layer_cpu(ncnn::LayerType::Gemm);
ncnn::ParamDict pd;
pd.set(0, _scale); // alpha
pd.set(1, 1.f / _scale); // beta
pd.set(2, 0); // transA (Q: Seq x Embed)
pd.set(3, 1); // transB (K: Seq x Embed -> K^T: Embed x Seq) => Q * K^T
pd.set(4, 0); // constantA
pd.set(5, 0); // constantB
pd.set(6, attn_mask ? 0 : 1); // constantC (if mask exists, use it)
pd.set(7, 0); // M
pd.set(8, 0); // N
pd.set(9, 0); // K
pd.set(10, attn_mask ? 3 : -1); // constant_broadcast_type_C (MxN)
pd.set(11, 0); // output_N1M
pd.set(12, 1); // output_elempack
pd.set(13, 1); // output_elemtype = fp32
#if NCNN_INT8
pd.set(18, int8_scale_term);
#endif
_qk_gemm->load_param(pd);
_qk_gemm->load_model(ModelBinFromMatArray(0));
Option opt1 = opt;
opt1.num_threads = 1;
_qk_gemm->create_pipeline(opt1);
}
#pragma omp parallel for num_threads(opt.num_threads)
for (int i = 0; i < num_heads; i++)
{
// 1. Q * K^T
std::vector<Mat> qk_bottom_blobs;
qk_bottom_blobs.push_back(query.channel(i)); // Q: [Seq, Embed]
qk_bottom_blobs.push_back(key.channel(i / num_heads_per_group)); // K: [DstSeq, Embed]
if (attn_mask)
{
// Ensure mask is 2D for Gemm auto-broadcast detection
Mat maskm = attn_mask_blob;
if (maskm.dims == 3)
{
// If c > 1, pick i-th head mask. If c == 1, pick 0-th (broadcast)
maskm = maskm.channel(maskm.c > 1 ? i : 0);
}
qk_bottom_blobs.push_back(maskm);
}
std::vector<Mat> qk_top_blobs(1);
qk_top_blobs[0] = qk_cross.channel(i);
Option opt1 = opt;
opt1.num_threads = 1;
opt1.blob_allocator = qk_cross.allocator;
retqks[i] = _qk_gemm->forward(qk_bottom_blobs, qk_top_blobs, opt1);
}
if (scale == 0.f)
{
Option opt1 = opt;
opt1.num_threads = 1;
_qk_gemm->destroy_pipeline(opt1);
delete _qk_gemm;
_qk_gemm = 0;
}
for (int i = 0; i < num_heads; i++)
{
if (retqks[i] != 0)
return retqks[i];
}
// 2. Softmax
int retqk = qk_softmax->forward_inplace(qk_cross, opt);
if (retqk != 0)
return retqk;
Mat value_fp32 = value;
#if NCNN_BF16
if (opt.use_bf16_storage && value.elembits() == 16)
{
// qkv_gemm need fp32 inputs
cast_bfloat16_to_float32(value, value_fp32, opt);
if (value_fp32.empty())
return -100;
}
#endif
Mat& top_blob = top_blobs[0];
top_blob.create(out_embed_dim, src_seqlen, num_heads, 4u, opt.blob_allocator);
if (top_blob.empty())
return -100;
// 3. Attn * V
std::vector<int> retqkvs(num_heads);
#pragma omp parallel for num_threads(opt.num_threads)
for (int i = 0; i < num_heads; i++)
{
std::vector<Mat> qkv_bottom_blobs(2);
qkv_bottom_blobs[0] = qk_cross.channel(i); // Attn: [DstSeq, Seq]
qkv_bottom_blobs[1] = value_fp32.channel(i / num_heads_per_group); // V: [DstSeq, OutEmbed]
std::vector<Mat> qkv_top_blobs(1);
qkv_top_blobs[0] = top_blob.channel(i); // Output
Option opt1 = opt;
opt1.num_threads = 1;
retqkvs[i] = qkv_gemm->forward(qkv_bottom_blobs, qkv_top_blobs, opt1);
}
for (int i = 0; i < num_heads; i++)
{
if (retqkvs[i] != 0)
return retqkvs[i];
}
value_fp32.release();
if (kv_cache == 2)
{
top_blobs[1] = make_persistent_kvcache_view_mips(past_key, dst_seqlen);
top_blobs[2] = make_persistent_kvcache_view_mips(past_value, dst_seqlen);
}
else if (kv_cache)
{
top_blobs[1] = key;
top_blobs[2] = value;
}
return 0;
}
} // namespace ncnn