Repository navigation
Expand file tree
/
Copy pathhipbsolgemm.cu
More file actions
610 lines (560 loc) · 22.3 KB
/
Copy pathhipbsolgemm.cu
File metadata and controls
610 lines (560 loc) · 22.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
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
// #ifdef __gfx908__
// // Uncomment ifdef and endif only if you need to undef the HIP_HALF ops below just for gfx908 and not for others
// // below lines enable hip float to half conversion which are disabled by default in hip_fp16.h
// #undef __HIP_NO_HALF_OPERATORS__
// #undef __HIP_NO_HALF_CONVERSIONS__
// #endif
#include <torch/torch.h>
#include <torch/extension.h>
#include <ATen/ATen.h>
#include <ATen/autocast_mode.h>
#include <ATen/cuda/CUDABlas.h>
#include <ATen/cuda/Exceptions.h>
#include <ATen/cuda/CUDAContext.h>
#include <c10/cuda/CUDAFunctions.h>
// #include <c10/cuda/CUDACachingAllocator.h>
#include <c10/hip/HIPStream.h>
#include <c10/macros/Export.h>
#include <c10/util/irange.h>
#include <ATen/cuda/CUDAEvent.h>
#include <hip/hip_runtime.h>
#include <hipblaslt/hipblaslt.h>
#include <hipblaslt/hipblaslt-ext.hpp>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <tuple>
#include <assert.h>
//#include "nvToolsExt.h"
//#include <rocblas/rocblas.h>
// #ifdef USE_ROCM
// #define PYTORCH_ROCBLAS_VERSION_DECIMAL (ROCBLAS_VERSION_MAJOR * 100 + ROCBLAS_VERSION_MINOR)
// #define USE_GEMM_FLAGS_FP16_ALT_IMPL (PYTORCH_ROCBLAS_VERSION_DECIMAL >= 242)
// #endif
// #ifdef __HIP_PLATFORM_HCC__
// #define PYTORCH_ROCBLAS_VERSION_DECIMAL (ROCBLAS_VERSION_MAJOR * 100 + ROCBLAS_VERSION_MINOR)
// #define USE_GEMM_FLAGS_FP16_ALT_IMPL (PYTORCH_ROCBLAS_VERSION_DECIMAL >= 242)
// #if USE_GEMM_FLAGS_FP16_ALT_IMPL
// #ifdef ROCM_BACKWARD_PASS_GUARD
// flag = at::BackwardPassGuard::is_backward_pass() ? rocblas_gemm_flags_fp16_alt_impl : 0;
// #endif
// #endif
// #endif
#ifndef CHECK_HIP_ERROR
#define CHECK_HIP_ERROR(error) \
if(error != hipSuccess) \
{ \
fprintf(stderr, \
"Hip error: '%s'(%d) at %s:%d\n", \
hipGetErrorString(error), \
error, \
__FILE__, \
__LINE__); \
exit(EXIT_FAILURE); \
}
#endif
#ifndef CHECK_HIPBLAS_ERROR
#define CHECK_HIPBLAS_ERROR(error) \
if(error != HIPBLAS_STATUS_SUCCESS) \
{ \
fprintf(stderr, \
"hipBLAS error: '%s'(%d) at %s:%d\n", \
hipblasStatusToString(error), \
error, \
__FILE__, \
__LINE__); \
exit(EXIT_FAILURE); \
}
#endif
namespace {
/*thread_local*/ cudaStream_t weight_stream;
// BUG: DLM has event and stream on different devices error
// In multi-GPU scenerio, do names defined in this namespace exist on all devices?
// C++ keyword: thread_local <- maybe this can help?
/*thread_local*/ cudaEvent_t event;
// hipBLASLt
hipblasLtHandle_t hipblaslt_handle;
hipblasLtMatmulPreference_t preference;
size_t workspace_size = 2*128*1024*1024;
//uint64_t workspace_size = 0;
void* d_workspace;
int request_solutions = 1;
int returnedAlgoCount = 0;
struct MatMulConfig {
hipblasOperation_t op_A;
hipblasOperation_t op_B;
int M;
int N;
int K;
hipblasltDatatype_t dtype;
friend auto operator<(const MatMulConfig& left, const MatMulConfig& right) -> bool {
return std::tie(left.op_A, left.op_B, left.M, left.N, left.K, left.dtype) < std::tie(right.op_A, right.op_B, right.M, right.N, right.K, right.dtype);
}
};
// std::map<std::tuple<int, int, int, int, int, int>, std::vector<hipblasLtMatmulHeuristicResult_t>> heuristic_map;
std::map<MatMulConfig, hipblasLtMatmulHeuristicResult_t> heuristic_map;
hipEvent_t start, stop;
int bench_iters { 1 };
int warmup_iters { 1 };
bool cout_print = false;
//std::vector<hipblasLtMatmulHeuristicResult_t> heuristicResult;
}
//find all hipblaslt solutions for given gemm problem
std::vector<int> hipblasLtMatmul_findallsols_wrapper(
hipblasLtHandle_t handle,
hipblasOperation_t op_A,
hipblasOperation_t op_B,
int m, int n, int k,
const void *alpha,
const void *a,
int lda,
const void *b,
int ldb,
const void *beta,
void *c,
int ldc,
hipblasltDatatype_t dtype,
hipStream_t &stream)
{
int flag { 0 };
hipblasLtMatrixLayout_t matA, matB, matC;
hipblasLtMatmulDesc_t matmul;
if (op_A == HIPBLAS_OP_N) {
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutCreate(&matA, dtype, m, k, lda));
} else {
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutCreate(&matA, dtype, k, m, lda));
}
if (op_B == HIPBLAS_OP_N) {
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutCreate(&matB, dtype, k, n, ldb));
} else {
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutCreate(&matB, dtype, n, k, ldb));
}
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutCreate(&matC, dtype, m, n, ldc));
CHECK_HIPBLAS_ERROR(hipblasLtMatmulDescCreate(&matmul, HIPBLASLT_COMPUTE_F32_FAST_XF32, HIPBLASLT_R_32F));
CHECK_HIPBLAS_ERROR(hipblasLtMatmulDescSetAttribute(
matmul, HIPBLASLT_MATMUL_DESC_TRANSA, &op_A, sizeof(int32_t)));
CHECK_HIPBLAS_ERROR(hipblasLtMatmulDescSetAttribute(
matmul, HIPBLASLT_MATMUL_DESC_TRANSB, &op_B, sizeof(int32_t)));
//std::vector<hipblasLtMatmulHeuristicResult_t> heuristicResult(10);
//CHECK_HIPBLAS_ERROR(hipblasLtMatmulAlgoGetHeuristic(
// handle, matmul, matA, matB, matC, matC,
// preference, 10, heuristicResult.data(), &returnedAlgoCount));
std::vector<hipblasLtMatmulHeuristicResult_t> heuristicResult;
CHECK_HIPBLAS_ERROR(hipblaslt_ext::getAllAlgos(handle, hipblaslt_ext::GemmType::HIPBLASLT_GEMM,
op_A,
op_B,
dtype,
dtype,
dtype,
dtype,
HIPBLASLT_COMPUTE_F32_FAST_XF32,
heuristicResult));
std::vector<int> algoIndex;
int returned_algo_count = heuristicResult.size();
//for (int i = 0; i < returnedAlgoCount; i++) {
for (int i = 0; i < returned_algo_count; i++) {
auto algo = heuristicResult[i].algo;
size_t ret_workspace_size = 0;
auto status = hipblaslt_ext::matmulIsAlgoSupported(handle, matmul,
alpha,
matA,
matB,
beta,
matC,
matC,
algo,
ret_workspace_size
);
if (status == HIPBLAS_STATUS_SUCCESS) {
if (ret_workspace_size<workspace_size) {
algoIndex.push_back(hipblaslt_ext::getIndexFromAlgo(algo));
}
}
}
CHECK_HIPBLAS_ERROR(hipblasLtMatmulDescDestroy(matmul));
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutDestroy(matA));
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutDestroy(matB));
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutDestroy(matC));
return algoIndex;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////
/**
* hipBLASLt GEMM call
*/
hipblasStatus_t hipblasLtMatmul_sol_wrapper(
hipblasLtHandle_t handle,
hipblasOperation_t op_A,
hipblasOperation_t op_B,
int m, int n, int k,
const void *alpha,
const void *a,
int lda,
const void *b,
int ldb,
const void *beta,
void *c,
int ldc,
hipblasltDatatype_t dtype,
hipStream_t &stream,
int solution_index=-1)
{
// TODO: flag is not supported for hipblasLt yet
int flag { 0 };
//if (dtype == HIPBLAS_R_16F) {
// use fp16 alt impl for MI200
// https://pytorch.org/docs/stable/notes/numerical_accuracy.html#reduced-precision-fp16-and-bf16-gemms-and-convolutions-on-amd-instinct-mi200-devices
//flag = rocblas_gemm_flags_fp16_alt_impl;
//}
//nvtxRangePushA("hipBLASLt variables creation");
hipblasLtMatrixLayout_t matA, matB, matC;
hipblasLtMatmulDesc_t matmul;
if (op_A == HIPBLAS_OP_N) {
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutCreate(&matA, dtype, m, k, lda));
} else {
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutCreate(&matA, dtype, k, m, lda));
}
if (op_B == HIPBLAS_OP_N) {
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutCreate(&matB, dtype, k, n, ldb));
} else {
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutCreate(&matB, dtype, n, k, ldb));
}
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutCreate(&matC, dtype, m, n, ldc));
CHECK_HIPBLAS_ERROR(hipblasLtMatmulDescCreate(&matmul, HIPBLASLT_COMPUTE_F32_FAST_XF32, HIPBLASLT_R_32F));
CHECK_HIPBLAS_ERROR(hipblasLtMatmulDescSetAttribute(
matmul, HIPBLASLT_MATMUL_DESC_TRANSA, &op_A, sizeof(int32_t)));
CHECK_HIPBLAS_ERROR(hipblasLtMatmulDescSetAttribute(
matmul, HIPBLASLT_MATMUL_DESC_TRANSB, &op_B, sizeof(int32_t)));
//nvtxRangePop();
// if heuristic does not exist in the map, do search and push into the map
//auto gemm_key { MatMulConfig { op_A, op_B, m, n, k, dtype } };
//if (heuristic_map.count(gemm_key) <= 0) {
std::vector<hipblasLtMatmulHeuristicResult_t> heuristicResult(1);
if (solution_index<0) {
//nvtxRangePushA("hipblasLtMatmulAlgoGetHeuristic");
std::cout << "Warning! HipbSolId Gemm Fallback Path used for solution index <0" << std::endl;
if (cout_print) {
std::cout << (op_A == HIPBLAS_OP_N ? "N" : "T") << (op_B == HIPBLAS_OP_N ? "N" : "T")
<< " (" << m << ", " << n << ", " << k << "), dtype: " << dtype
<< ", (lda, ldb, ldc): (" << lda << ", " << ldb << ", " << ldc << "), " << std::endl;
}
//std::vector<hipblasLtMatmulHeuristicResult_t> heuristicResult(request_solutions);
CHECK_HIPBLAS_ERROR(hipblasLtMatmulAlgoGetHeuristic(
handle, matmul, matA, matB, matC, matC,
preference, request_solutions, heuristicResult.data(), &returnedAlgoCount));
if((returnedAlgoCount != request_solutions) && cout_print) {
std::cout << "less solution found! request: " << request_solutions
<< ", found: " << returnedAlgoCount << std::endl;
}
//heuristic_map[gemm_key] = heuristicResult[0];
/*
if (returnedAlgoCount == 1) {
heuristic_map[gemm_key] = heuristicResult[0];
} else {
// benchmark requested solutions and pick best one
int bestIndex { -1 };
double bestMs { std::numeric_limits<double>::max() };
for (int sol { 0 }; sol < returnedAlgoCount; ++sol) {
// warm up
for (int iter { 0 }; iter < warmup_iters; ++iter) {
CHECK_HIPBLAS_ERROR(hipblasLtMatmul(handle, matmul,
alpha,
a, matA,
b, matB,
beta,
c, matC,
c, matC, // In case beta != 0, these runs can overwrite the values in c
// since c and d are the same
// TODO: allocates separate d memory for these runs
&heuristicResult[sol].algo,
d_workspace, workspace_size,
stream));
}
// performance measuring
double eventMs;
CHECK_HIP_ERROR(hipEventRecord(start, stream));
for (int iter { 0 }; iter < bench_iters; ++iter) {
CHECK_HIPBLAS_ERROR(hipblasLtMatmul(handle, matmul,
alpha,
a, matA,
b, matB,
beta,
c, matC,
c, matC, // In case beta != 0, these runs can overwrite the values in c
// since c and d are the same
// TODO: allocates separate d memory for these runs
&heuristicResult[sol].algo,
d_workspace, workspace_size,
stream));
}
CHECK_HIP_ERROR(hipEventRecord(stop, stream));
CHECK_HIP_ERROR(hipEventSynchronize(stop));
float temp;
CHECK_HIP_ERROR(hipEventElapsedTime(&temp, start, stop));
eventMs = double(temp);
eventMs /= bench_iters;
if (cout_print) {
std::cout << " Sol " << sol << ": average time per iter " << std::to_string(eventMs) << " ms";
}
if (bestMs > eventMs) {
bestMs = eventMs;
bestIndex = sol;
if (cout_print) {
std::cout << " *" << std::endl;
}
} else {
if (cout_print) {
std::cout << std::endl;
}
}
}
heuristic_map[gemm_key] = heuristicResult[bestIndex];
}
*/
//nvtxRangePop();
} else {
std::vector<int> algoIndex(1);
algoIndex[0]=solution_index;
//std::vector<hipblasLtMatmulHeuristicResult_t> tmpAlgo;
CHECK_HIPBLAS_ERROR(hipblaslt_ext::getAlgosFromIndex(handle, algoIndex, heuristicResult));
}
//size_t ret_workspace_size = 0;
//auto status1 = hipblaslt_ext::matmulIsAlgoSupported(handle, matmul,
// alpha,
// matA,
// matB,
// beta,
// matC,
// matC,
// heuristicResult[0].algo,
// ret_workspace_size
//);
//if (status1 == HIPBLAS_STATUS_SUCCESS) {
// std::cout << "Workspace size" << ret_workspace_size << std::endl;
//} else {
// std::cout << "Algo not supported!!!" << std::endl;
//}
hipblasStatus_t status = hipblasLtMatmul(handle, matmul,
alpha,
a, matA,
b, matB,
beta,
c, matC,
c, matC,
&heuristicResult[0].algo,
d_workspace, workspace_size,
stream);
//nvtxRangePushA("hipBLASLt variables deletion");
CHECK_HIPBLAS_ERROR(hipblasLtMatmulDescDestroy(matmul));
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutDestroy(matA));
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutDestroy(matB));
CHECK_HIPBLAS_ERROR(hipblasLtMatrixLayoutDestroy(matC));
//nvtxRangePop();
return status;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////
torch::Tensor HipbSolIdxBlas(
const torch::Tensor& mat1,
const torch::Tensor& mat2,
const int solution_index
)
{
auto mat1_strides { mat1.strides() };
auto mat2_strides { mat2.strides() };
auto mat1_sizes { mat1.sizes() };
auto mat2_sizes { mat2.sizes() };
// std::cout << " | mat1 info: size: " << mat1_sizes << " stride: " << mat1_strides << std::endl
// << " | mat2 info: size: " << mat2_sizes << " stride: " << mat2_strides << std::endl;
TORCH_CHECK(mat1.dim() == 2 && mat2.dim() == 2, "tensors must be 2-D");
TORCH_CHECK(
mat1.dtype() == mat2.dtype(),
"expected mat1 and mat2 to have the same dtype, but got: ", mat1.dtype(), " != ", mat2.dtype()
);
TORCH_CHECK(mat1_sizes[1] == mat2_sizes[0], "mat1 dim 1 must match mat2 dim 0");
auto abcType { mat1.options().dtype() };
auto options { at::TensorOptions().dtype(abcType).device(at::kCUDA) };
auto result { torch::empty({ mat1_sizes[0], mat2_sizes[1] }, options) };
// std::cout << " | result info: size: " << result.sizes() << " stride: " << result.strides() << std::endl;
bool transpose_result = true;
bool transpose_mat1;
bool transpose_mat2;
if ((mat2_strides[0] == 1) && (mat2_strides[1] >= std::max<int64_t>(1, mat2_sizes[0]))) {
transpose_mat2 = false;
} else if ((mat2_strides[1] == 1) && (mat2_strides[0] >= std::max<int64_t>(1, mat2_sizes[1]))) {
transpose_mat2 = true;
} else {
assert(false && "unusual strides detected, may need to clone a contiguous tensor");
}
if ((mat1_strides[0] == 1) && (mat1_strides[1] >= std::max<int64_t>(1, mat1_sizes[0]))) {
transpose_mat1 = false;
} else if ((mat1_strides[1] == 1) && (mat1_strides[0] >= std::max<int64_t>(1, mat1_sizes[1]))) {
transpose_mat1 = true;
} else {
assert(false && "unusual strides detected, may need to clone a contiguous tensor");
}
if (transpose_result) {
bool tmp = transpose_mat1;
transpose_mat1 = !transpose_mat2;
transpose_mat2 = !tmp;
mat1_strides = mat2.strides();
mat2_strides = mat1.strides();
mat1_sizes = mat2.sizes();
mat2_sizes = mat1.sizes();
}
// std::cout << " | transpose_result: " << (transpose_result ? "true" : "false") << std::endl
// << " | transpose_A: " << (transpose_mat1 ? "true" : "false") << std::endl
// << " | transpose_B: " << (transpose_mat2 ? "true" : "false") << std::endl;
// std::cout << " | A matrix: size: " << mat1_sizes << " stride: " << mat1_strides << std::endl
// << " | B matrix: size: " << mat2_sizes << " stride: " << mat2_strides << std::endl;
float one { 1.0f };
float zero { 0.0f };
int64_t m = mat1_sizes[transpose_result ? 1 : 0];
int64_t k = mat1_sizes[transpose_result ? 0 : 1];
int64_t n = mat2_sizes[transpose_result ? 0 : 1];
int64_t mat1_ld = mat1_strides[(transpose_mat1 == transpose_result) ? 1 : 0];
int64_t mat2_ld = mat2_strides[(transpose_mat2 == transpose_result) ? 1 : 0];
int64_t result_ld = result.stride(transpose_result ? 0 : 1);
// std::cout << " | (m, n, k): " << m << ", " << n << ", " << k << std::endl
// << " | (lda, ldb, ldc): " << mat1_ld << ", " << mat2_ld << ", " << result_ld << std::endl;
hipblasltDatatype_t hipblasType;
if (abcType == at::kHalf) {
hipblasType = HIPBLASLT_R_16F;
} else if (abcType == at::kBFloat16) {
hipblasType = HIPBLASLT_R_16B;
} else if (abcType == at::kFloat) {
hipblasType = HIPBLASLT_R_32F;
} else {
assert(false && "Wrong datatype!");
}
void *ptrA { static_cast<void *>((transpose_result ? mat2 : mat1).data_ptr()) };
void *ptrB { static_cast<void *>((transpose_result ? mat1 : mat2).data_ptr()) };
void *ptrC { static_cast<void *>(result.data_ptr()) };
auto current_stream { torch::hip::getCurrentHIPStream().stream() };
CHECK_HIPBLAS_ERROR(hipblasLtMatmul_sol_wrapper(
hipblaslt_handle,
transpose_mat1 ? HIPBLAS_OP_T : HIPBLAS_OP_N,
transpose_mat2 ? HIPBLAS_OP_T : HIPBLAS_OP_N,
m, n, k,
&one,
ptrA, mat1_ld,
ptrB, mat2_ld,
&zero,
ptrC, result_ld,
hipblasType,
current_stream,solution_index));
return result;
}
//find all hipblas solutions and return them to python land
std::vector<int> HipbFindAllSolIdxBlas(
const torch::Tensor& mat1,
const torch::Tensor& mat2
)
{
auto mat1_strides { mat1.strides() };
auto mat2_strides { mat2.strides() };
auto mat1_sizes { mat1.sizes() };
auto mat2_sizes { mat2.sizes() };
TORCH_CHECK(mat1.dim() == 2 && mat2.dim() == 2, "tensors must be 2-D");
TORCH_CHECK(
mat1.dtype() == mat2.dtype(),
"expected mat1 and mat2 to have the same dtype, but got: ", mat1.dtype(), " != ", mat2.dtype()
);
TORCH_CHECK(mat1_sizes[1] == mat2_sizes[0], "mat1 dim 1 must match mat2 dim 0");
auto abcType { mat1.options().dtype() };
auto options { at::TensorOptions().dtype(abcType).device(at::kCUDA) };
auto result { torch::empty({ mat1_sizes[0], mat2_sizes[1] }, options) };
bool transpose_result = true;
bool transpose_mat1;
bool transpose_mat2;
if ((mat2_strides[0] == 1) && (mat2_strides[1] >= std::max<int64_t>(1, mat2_sizes[0]))) {
transpose_mat2 = false;
} else if ((mat2_strides[1] == 1) && (mat2_strides[0] >= std::max<int64_t>(1, mat2_sizes[1]))) {
transpose_mat2 = true;
} else {
assert(false && "unusual strides detected, may need to clone a contiguous tensor");
}
if ((mat1_strides[0] == 1) && (mat1_strides[1] >= std::max<int64_t>(1, mat1_sizes[0]))) {
transpose_mat1 = false;
} else if ((mat1_strides[1] == 1) && (mat1_strides[0] >= std::max<int64_t>(1, mat1_sizes[1]))) {
transpose_mat1 = true;
} else {
assert(false && "unusual strides detected, may need to clone a contiguous tensor");
}
if (transpose_result) {
bool tmp = transpose_mat1;
transpose_mat1 = !transpose_mat2;
transpose_mat2 = !tmp;
mat1_strides = mat2.strides();
mat2_strides = mat1.strides();
mat1_sizes = mat2.sizes();
mat2_sizes = mat1.sizes();
}
float one { 1.0f };
float zero { 0.0f };
int64_t m = mat1_sizes[transpose_result ? 1 : 0];
int64_t k = mat1_sizes[transpose_result ? 0 : 1];
int64_t n = mat2_sizes[transpose_result ? 0 : 1];
int64_t mat1_ld = mat1_strides[(transpose_mat1 == transpose_result) ? 1 : 0];
int64_t mat2_ld = mat2_strides[(transpose_mat2 == transpose_result) ? 1 : 0];
int64_t result_ld = result.stride(transpose_result ? 0 : 1);
hipblasltDatatype_t hipblasType;
if (abcType == at::kHalf) {
hipblasType = HIPBLASLT_R_16F;
} else if (abcType == at::kBFloat16) {
hipblasType = HIPBLASLT_R_16B;
} else if (abcType == at::kFloat) {
hipblasType = HIPBLASLT_R_32F;
} else {
assert(false && "Wrong datatype!");
}
void *ptrA { static_cast<void *>((transpose_result ? mat2 : mat1).data_ptr()) };
void *ptrB { static_cast<void *>((transpose_result ? mat1 : mat2).data_ptr()) };
void *ptrC { static_cast<void *>(result.data_ptr()) };
auto current_stream { torch::hip::getCurrentHIPStream().stream() };
return hipblasLtMatmul_findallsols_wrapper(
hipblaslt_handle,
transpose_mat1 ? HIPBLAS_OP_T : HIPBLAS_OP_N,
transpose_mat2 ? HIPBLAS_OP_T : HIPBLAS_OP_N,
m, n, k,
&one,
ptrA, mat1_ld,
ptrB, mat2_ld,
&zero,
ptrC, result_ld,
hipblasType,
current_stream);
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////
void hipb_create_extension()
{
//CHECK_HIP_ERROR(hipStreamCreate(&weight_stream));
//CHECK_HIP_ERROR(hipEventCreateWithFlags(&event, cudaEventDisableTiming));
// hipBLASLt
CHECK_HIPBLAS_ERROR(hipblasLtCreate(&hipblaslt_handle));
CHECK_HIP_ERROR(hipMalloc(&d_workspace, workspace_size));
CHECK_HIPBLAS_ERROR(hipblasLtMatmulPreferenceCreate(&preference));
CHECK_HIPBLAS_ERROR(hipblasLtMatmulPreferenceSetAttribute(
preference, HIPBLASLT_MATMUL_PREF_MAX_WORKSPACE_BYTES, &workspace_size, sizeof(workspace_size)));
//CHECK_HIP_ERROR(hipEventCreate(&start));
//CHECK_HIP_ERROR(hipEventCreate(&stop));
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////
void hipb_destroy_extension()
{
//CHECK_HIP_ERROR(hipStreamDestroy(weight_stream));
//CHECK_HIP_ERROR(hipEventDestroy(event));
// hipBLASLt
CHECK_HIPBLAS_ERROR(hipblasLtDestroy(hipblaslt_handle));
CHECK_HIPBLAS_ERROR(hipblasLtMatmulPreferenceDestroy(preference));
CHECK_HIP_ERROR(hipFree(d_workspace));
//CHECK_HIP_ERROR(hipEventDestroy(start));
//CHECK_HIP_ERROR(hipEventDestroy(stop));
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////
PYBIND11_MODULE(TORCH_EXTENSION_NAME, m)
{
m.def("hipb_create_extension", &hipb_create_extension, "create_extension");
m.def("hipb_destroy_extension", &hipb_destroy_extension, "destroy_extension");
m.def("hipb_mm", &HipbSolIdxBlas, "mm");
m.def("hipb_findallsols", &HipbFindAllSolIdxBlas, "hipblas_find_all_sols");
}