-
Notifications
You must be signed in to change notification settings - Fork 107
/
mcwamp_hsa.cpp
3909 lines (3120 loc) · 136 KB
/
mcwamp_hsa.cpp
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
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// Kalmar Runtime implementation (HSA version)
#include <cassert>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <future>
#include <iostream>
#include <map>
#include <mutex>
#include <sstream>
#include <string>
#include <thread>
#include <utility>
#include <vector>
#include <algorithm>
#include <hsa/hsa.h>
#include <hsa/hsa_ext_finalize.h>
#include <hsa/hsa_ext_amd.h>
#include <hcc/md5.h>
#include <hcc/kalmar_runtime.h>
#include <hcc/kalmar_aligned_alloc.h>
#include <hc_am.hpp>
#include "unpinned_copy_engine.h"
#include <time.h>
#include <iomanip>
#ifndef KALMAR_DEBUG
#define KALMAR_DEBUG (0)
#endif
#ifndef KALMAR_DEBUG_ASYNC_COPY
#define KALMAR_DEBUG_ASYNC_COPY (0)
#endif
// Macro for prettier debug messages, use like:
// DBOUT(" Something happenedd" << myId() << " i= " << i << "\n");
#if KALMAR_DEBUG
#define DBOUT( x ) std::cerr << x
#else
#define DBOUT( x )
#endif
/////////////////////////////////////////////////
// kernel dispatch speed optimization flags
/////////////////////////////////////////////////
// size of default kernarg buffer in the kernarg pool in HSAContext
// default set as 128
#define KERNARG_BUFFER_SIZE (128)
// number of pre-allocated kernarg buffers in HSAContext
// default set as 64 (pre-allocating 64 of kernarg buffers in the pool)
#define KERNARG_POOL_SIZE (64)
// number of pre-allocated HSA signals in HSAContext
// default set as 64 (pre-allocating 64 HSA signals)
#define SIGNAL_POOL_SIZE (64) //
// Maximum number of inflight commands sent to a single queue.
// If limit is exceeded, HCC will force a queue wait to reclaim
// resources (signals, kernarg)
#define MAX_INFLIGHT_COMMANDS_PER_QUEUE 512
// threshold to clean up finished kernel in HSAQueue.asyncOps
// default set as 1024
#define ASYNCOPS_VECTOR_GC_SIZE (1024)
// Copy thresholds, in KB. These are used for "choose-best" copy mode.
long int HCC_H2D_STAGING_THRESHOLD = 64;
long int HCC_H2D_PININPLACE_THRESHOLD = 4096;
long int HCC_D2H_PININPLACE_THRESHOLD = 1024;
#define HSA_BARRIER_DEP_SIGNAL_CNT (5)
// synchronization for copy commands in the same stream, regardless of command type.
// Add a signal dependencies between async copies -
// so completion signal from prev command used as input dep to next.
// If FORCE_SIGNAL_DEP_BETWEEN_COPIES=0 then data copies of the same kind (H2H, H2D, D2H, D2D)
// are assumed to be implicitly ordered.
// ROCR 1.2 runtime implementation currently provides this guarantee when using SDMA queues and compute shaders.
#define FORCE_SIGNAL_DEP_BETWEEN_COPIES (0)
// whether to use MD5 as kernel indexing hash function
// default set as 0 (use faster FNV-1a hash instead)
#define USE_MD5_HASH (0)
// cutoff size used in FNV-1a hash function
// default set as 768, this is a heuristic value
// which is larger than HSA BrigModuleHeader and AMD GCN ISA header (Elf64_Ehdr)
#define FNV1A_CUTOFF_SIZE (768)
#define CASE_STRING(X) case X: case_string = #X ;break;
static const char* getHcCommandKindString(Kalmar::hcCommandKind k) {
const char* case_string;
switch(k) {
using namespace Kalmar;
CASE_STRING(hcCommandInvalid);
CASE_STRING(hcMemcpyHostToHost);
CASE_STRING(hcMemcpyHostToDevice);
CASE_STRING(hcMemcpyDeviceToHost);
CASE_STRING(hcMemcpyDeviceToDevice);
CASE_STRING(hcCommandKernel);
CASE_STRING(hcCommandMarker);
default: case_string = "Unknown command type";
};
return case_string;
};
static const char* getHSAErrorString(hsa_status_t s) {
const char* case_string;
switch(s) {
CASE_STRING(HSA_STATUS_ERROR_INVALID_ARGUMENT);
CASE_STRING(HSA_STATUS_ERROR_INVALID_QUEUE_CREATION);
CASE_STRING(HSA_STATUS_ERROR_INVALID_ALLOCATION);
CASE_STRING(HSA_STATUS_ERROR_INVALID_AGENT);
CASE_STRING(HSA_STATUS_ERROR_INVALID_REGION);
CASE_STRING(HSA_STATUS_ERROR_INVALID_SIGNAL);
CASE_STRING(HSA_STATUS_ERROR_INVALID_QUEUE);
CASE_STRING(HSA_STATUS_ERROR_OUT_OF_RESOURCES);
CASE_STRING(HSA_STATUS_ERROR_INVALID_PACKET_FORMAT);
CASE_STRING(HSA_STATUS_ERROR_RESOURCE_FREE);
CASE_STRING(HSA_STATUS_ERROR_NOT_INITIALIZED);
CASE_STRING(HSA_STATUS_ERROR_REFCOUNT_OVERFLOW);
CASE_STRING(HSA_STATUS_ERROR_INCOMPATIBLE_ARGUMENTS);
CASE_STRING(HSA_STATUS_ERROR_INVALID_INDEX);
CASE_STRING(HSA_STATUS_ERROR_INVALID_ISA);
CASE_STRING(HSA_STATUS_ERROR_INVALID_ISA_NAME);
CASE_STRING(HSA_STATUS_ERROR_INVALID_CODE_OBJECT);
CASE_STRING(HSA_STATUS_ERROR_INVALID_EXECUTABLE);
CASE_STRING(HSA_STATUS_ERROR_FROZEN_EXECUTABLE);
CASE_STRING(HSA_STATUS_ERROR_INVALID_SYMBOL_NAME);
CASE_STRING(HSA_STATUS_ERROR_VARIABLE_ALREADY_DEFINED);
CASE_STRING(HSA_STATUS_ERROR_VARIABLE_UNDEFINED);
CASE_STRING(HSA_STATUS_ERROR_EXCEPTION);
default: case_string = "Unknown Error Code";
};
return case_string;
}
#define STATUS_CHECK(s,line) if (s != HSA_STATUS_SUCCESS && s != HSA_STATUS_INFO_BREAK) {\
const char* error_string = getHSAErrorString(s);\
printf("### HCC STATUS_CHECK Error: %s (0x%x) at file:%s line:%d\n", error_string, s, __FILE__, line);\
assert(HSA_STATUS_SUCCESS == hsa_shut_down());\
abort();\
}
#define STATUS_CHECK_SYMBOL(s,symbol,line) if (s != HSA_STATUS_SUCCESS && s != HSA_STATUS_INFO_BREAK) {\
const char* error_string = getHSAErrorString(s);\
printf("### HCC STATUS_CHECK_SYMBOL Error: %s (0x%x), symbol name:%s at file:%s line:%d\n", error_string, s, (symbol)!=nullptr?symbol:(const char*)"is a nullptr", __FILE__, line);\
assert(HSA_STATUS_SUCCESS == hsa_shut_down());\
abort();\
}
#define STATUS_CHECK_Q(s,q,line) if (s != HSA_STATUS_SUCCESS) {\
const char* error_string = getHSAErrorString(s);\
printf("### HCC STATUS_CHECK_Q Error: %s (0x%x) at file:%s line:%d\n", error_string, s, __FILE__, line);\
assert(HSA_STATUS_SUCCESS == hsa_queue_destroy(q));\
assert(HSA_STATUS_SUCCESS == hsa_shut_down());\
abort();\
}
// debug function to dump information on an HSA agent
static void dumpHSAAgentInfo(hsa_agent_t agent, const char* extra_string = (const char*)"") {
hsa_status_t status;
char name[64] = {0};
status = hsa_agent_get_info(agent, HSA_AGENT_INFO_NAME, name);
STATUS_CHECK(status, __LINE__);
uint32_t node = 0;
status = hsa_agent_get_info(agent, HSA_AGENT_INFO_NODE, &node);
STATUS_CHECK(status, __LINE__);
wchar_t path_wchar[128] {0};
swprintf(path_wchar, 128, L"%s%u", name, node);
printf("Dump Agent Info (%s)\n",extra_string);
printf("\t Agent: ");
std::wcerr << path_wchar << L"\n";
return;
}
namespace Kalmar {
enum class HCCRuntimeStatus{
// No error
HCCRT_STATUS_SUCCESS = 0x0,
// A generic error
HCCRT_STATUS_ERROR = 0x2000,
// The maximum number of outstanding AQL packets in a queue has been reached
HCCRT_STATUS_ERROR_COMMAND_QUEUE_OVERFLOW = 0x2001
};
const char* getHCCRuntimeStatusMessage(const HCCRuntimeStatus status) {
const char* message = nullptr;
switch(status) {
//HCCRT_CASE_STATUS_STRING(HCCRT_STATUS_SUCCESS,"Success");
case HCCRuntimeStatus::HCCRT_STATUS_SUCCESS:
message = "Success"; break;
case HCCRuntimeStatus::HCCRT_STATUS_ERROR:
message = "Generic error"; break;
case HCCRuntimeStatus::HCCRT_STATUS_ERROR_COMMAND_QUEUE_OVERFLOW:
message = "Command queue overflow"; break;
default:
message = "Unknown error code"; break;
};
return message;
}
inline static void checkHCCRuntimeStatus(const HCCRuntimeStatus status, const unsigned int line, hsa_queue_t* q=nullptr) {
if (status != HCCRuntimeStatus::HCCRT_STATUS_SUCCESS) {
printf("### HCC runtime error: %s at line:%d\n", getHCCRuntimeStatusMessage(status), line);
if (q != nullptr)
assert(HSA_STATUS_SUCCESS == hsa_queue_destroy(q));
assert(HSA_STATUS_SUCCESS == hsa_shut_down());
exit(-1);
}
}
} // namespace Kalmar
extern "C" void PushArgImpl(void *ker, int idx, size_t sz, const void *v);
extern "C" void PushArgPtrImpl(void *ker, int idx, size_t sz, const void *v);
// forward declaration
namespace Kalmar {
class HSAQueue;
class HSADevice;
} // namespace Kalmar
///
/// kernel compilation / kernel launching
///
/// modeling of HSA executable
class HSAExecutable {
private:
hsa_code_object_t hsaCodeObject;
hsa_executable_t hsaExecutable;
friend class HSAKernel;
friend class Kalmar::HSADevice;
public:
HSAExecutable(hsa_executable_t _hsaExecutable,
hsa_code_object_t _hsaCodeObject) :
hsaExecutable(_hsaExecutable),
hsaCodeObject(_hsaCodeObject) {}
~HSAExecutable() {
hsa_status_t status;
#if KALMAR_DEBUG
std::cerr << "HSAExecutable::~HSAExecutable\n";
#endif
status = hsa_executable_destroy(hsaExecutable);
STATUS_CHECK(status, __LINE__);
status = hsa_code_object_destroy(hsaCodeObject);
STATUS_CHECK(status, __LINE__);
}
template<typename T>
void setSymbolToValue(const char* symbolName, T value) {
hsa_status_t status;
// get symbol
hsa_executable_symbol_t symbol;
hsa_agent_t agent;
status = hsa_executable_get_symbol(hsaExecutable, NULL, symbolName, agent, 0, &symbol);
STATUS_CHECK_SYMBOL(status, symbolName, __LINE__);
// get address of symbol
uint64_t symbol_address;
status = hsa_executable_symbol_get_info(symbol,
HSA_EXECUTABLE_SYMBOL_INFO_VARIABLE_ADDRESS,
&symbol_address);
STATUS_CHECK(status, __LINE__);
// set the value of symbol
T* symbol_ptr = (T*)symbol_address;
*symbol_ptr = value;
}
};
class HSAKernel {
private:
HSAExecutable* executable;
uint64_t kernelCodeHandle;
hsa_executable_symbol_t hsaExecutableSymbol;
uint32_t static_group_segment_size;
uint32_t private_segment_size;
friend class HSADispatch;
public:
HSAKernel(HSAExecutable* _executable,
hsa_executable_symbol_t _hsaExecutableSymbol,
uint64_t _kernelCodeHandle) :
executable(_executable),
hsaExecutableSymbol(_hsaExecutableSymbol),
kernelCodeHandle(_kernelCodeHandle) {
hsa_status_t status =
hsa_executable_symbol_get_info(
_hsaExecutableSymbol,
HSA_EXECUTABLE_SYMBOL_INFO_KERNEL_GROUP_SEGMENT_SIZE,
&this->static_group_segment_size);
STATUS_CHECK_Q(status, commandQueue, __LINE__);
status =
hsa_executable_symbol_get_info(
_hsaExecutableSymbol,
HSA_EXECUTABLE_SYMBOL_INFO_KERNEL_PRIVATE_SEGMENT_SIZE,
&this->private_segment_size);
STATUS_CHECK_Q(status, commandQueue, __LINE__);
}
~HSAKernel() {
#if KALMAR_DEBUG
std::cerr << "HSAKernel::~HSAKernel\n";
#endif
}
}; // end of HSAKernel
class HSACopy : public Kalmar::KalmarAsyncOp {
private:
hsa_signal_t signal;
int signalIndex;
bool isSubmitted;
hsa_wait_state_t waitMode;
std::shared_future<void>* future;
// If copy is dependent on another operation, record reference here.
// keep a reference which prevents those ops from being deleted until this op is deleted.
std::shared_ptr<KalmarAsyncOp> depAsyncOp;
Kalmar::HSAQueue* hsaQueue;
// source pointer
const void* src;
// destination pointer
void* dst;
// bytes to be copied
size_t sizeBytes;
// helper function used by HSACopy::enqueueAsync()
hsa_status_t enqueueAsyncCopy();
// helper function used by HSACopy::syncCopy()
void setCopyAgents(Kalmar::hcCommandKind copyDir, hsa_agent_t *srcAgent, hsa_agent_t *dstAgent);
public:
std::shared_future<void>* getFuture() override { return future; }
void* getNativeHandle() override { return &signal; }
void setWaitMode(Kalmar::hcWaitMode mode) override {
switch (mode) {
case Kalmar::hcWaitModeBlocked:
waitMode = HSA_WAIT_STATE_BLOCKED;
break;
case Kalmar::hcWaitModeActive:
waitMode = HSA_WAIT_STATE_ACTIVE;
break;
}
}
bool isReady() override {
return (hsa_signal_load_acquire(signal) == 0);
}
// Copy mode will be set later on.
// HSA signals would be waited in HSA_WAIT_STATE_ACTIVE by default for HSACopy instances
HSACopy(const void* src_, void* dst_, size_t sizeBytes_) : KalmarAsyncOp(Kalmar::hcCommandInvalid),
isSubmitted(false), future(nullptr), depAsyncOp(nullptr), hsaQueue(nullptr), waitMode(HSA_WAIT_STATE_ACTIVE),
src(src_), dst(dst_), sizeBytes(sizeBytes_),
signalIndex(-1) {
#if KALMAR_DEBUG
std::cerr << "HSACopy::HSACopy(" << src_ << ", " << dst_ << ", " << sizeBytes_ << ")\n";
#endif
}
~HSACopy() {
#if KALMAR_DEBUG
std::cerr << "HSACopy::~HSACopy()\n";
#endif
if (isSubmitted) {
hsa_status_t status = HSA_STATUS_SUCCESS;
status = waitComplete();
STATUS_CHECK(status, __LINE__);
}
dispose();
}
hsa_status_t enqueueAsync(Kalmar::HSAQueue*);
// wait for the async copy to complete
hsa_status_t waitComplete();
void dispose();
uint64_t getTimestampFrequency() override {
// get system tick frequency
uint64_t timestamp_frequency_hz = 0L;
hsa_system_get_info(HSA_SYSTEM_INFO_TIMESTAMP_FREQUENCY, ×tamp_frequency_hz);
return timestamp_frequency_hz;
}
uint64_t getBeginTimestamp() override;
uint64_t getEndTimestamp() override;
// synchronous version of copy
void syncCopy(Kalmar::HSAQueue*);
void syncCopyExt(Kalmar::HSAQueue *hsaQueue, hc::hcCommandKind copyDir, const hc::AmPointerInfo &srcPtrInfo, const hc::AmPointerInfo &dstPtrInfo, bool forceHostCopyEngine);
}; // end of HSACopy
class HSABarrier : public Kalmar::KalmarAsyncOp {
private:
hsa_signal_t signal;
int signalIndex;
bool isDispatched;
hsa_wait_state_t waitMode;
std::shared_future<void>* future;
Kalmar::HSAQueue* hsaQueue;
// prior dependencies
// maximum up to 5 prior dependencies could be associated with one
// HSABarrier instance
int depCount;
// array of all operations that this op depends on.
// This array keeps a reference which prevents those ops from being deleted until this op is deleted.
std::shared_ptr<KalmarAsyncOp> depAsyncOps [HSA_BARRIER_DEP_SIGNAL_CNT];
public:
std::shared_future<void>* getFuture() override { return future; }
void* getNativeHandle() override { return &signal; }
void setWaitMode(Kalmar::hcWaitMode mode) override {
switch (mode) {
case Kalmar::hcWaitModeBlocked:
waitMode = HSA_WAIT_STATE_BLOCKED;
break;
case Kalmar::hcWaitModeActive:
waitMode = HSA_WAIT_STATE_ACTIVE;
break;
}
}
bool isReady() override {
return (hsa_signal_load_acquire(signal) == 0);
}
// default constructor
// 0 prior dependency
HSABarrier() : KalmarAsyncOp(Kalmar::hcCommandMarker), isDispatched(false), future(nullptr), hsaQueue(nullptr), waitMode(HSA_WAIT_STATE_BLOCKED), depCount(0) {}
// constructor with 1 prior depedency
HSABarrier(std::shared_ptr <Kalmar::KalmarAsyncOp> dependent_op) : KalmarAsyncOp(Kalmar::hcCommandMarker), isDispatched(false), future(nullptr), hsaQueue(nullptr), waitMode(HSA_WAIT_STATE_BLOCKED), depCount(1) {
depAsyncOps[0] = dependent_op;
}
// constructor with at most 5 prior dependencies
HSABarrier(int count, std::shared_ptr <Kalmar::KalmarAsyncOp> *dependent_op_array) : KalmarAsyncOp(Kalmar::hcCommandMarker), isDispatched(false), future(nullptr), hsaQueue(nullptr), waitMode(HSA_WAIT_STATE_BLOCKED), depCount(count) {
if ((count > 0) && (count <= 5)) {
for (int i = 0; i < count; ++i) {
depAsyncOps[i] = dependent_op_array[i];
}
} else {
// throw an exception
throw Kalmar::runtime_exception("Incorrect number of dependent signals passed to HSABarrier constructor", count);
}
}
~HSABarrier() {
#if KALMAR_DEBUG
std::cerr << "HSABarrier::~HSABarrier()\n";
#endif
if (isDispatched) {
hsa_status_t status = HSA_STATUS_SUCCESS;
status = waitComplete();
STATUS_CHECK(status, __LINE__);
}
dispose();
}
hsa_status_t enqueueBarrier(hsa_queue_t* queue);
hsa_status_t enqueueAsync(Kalmar::HSAQueue*);
// wait for the barrier to complete
hsa_status_t waitComplete();
void dispose();
uint64_t getTimestampFrequency() override {
// get system tick frequency
uint64_t timestamp_frequency_hz = 0L;
hsa_system_get_info(HSA_SYSTEM_INFO_TIMESTAMP_FREQUENCY, ×tamp_frequency_hz);
return timestamp_frequency_hz;
}
uint64_t getBeginTimestamp() override;
uint64_t getEndTimestamp() override;
}; // end of HSABarrier
class HSADispatch : public Kalmar::KalmarAsyncOp {
private:
Kalmar::HSADevice* device;
hsa_agent_t agent;
const HSAKernel* kernel;
std::vector<uint8_t> arg_vec;
uint32_t arg_count;
size_t prevArgVecCapacity;
void* kernargMemory;
int kernargMemoryIndex;
hsa_signal_t signal;
int signalIndex;
hsa_kernel_dispatch_packet_t aql;
bool isDispatched;
hsa_wait_state_t waitMode;
std::shared_future<void>* future;
Kalmar::HSAQueue* hsaQueue;
public:
std::shared_future<void>* getFuture() override { return future; }
void* getNativeHandle() override { return &signal; }
void setWaitMode(Kalmar::hcWaitMode mode) override {
switch (mode) {
case Kalmar::hcWaitModeBlocked:
waitMode = HSA_WAIT_STATE_BLOCKED;
break;
case Kalmar::hcWaitModeActive:
waitMode = HSA_WAIT_STATE_ACTIVE;
break;
}
}
bool isReady() override {
return (hsa_signal_load_acquire(signal) == 0);
}
~HSADispatch() {
#if KALMAR_DEBUG
std::cerr << "HSADispatch::~HSADispatch()\n";
#endif
if (isDispatched) {
hsa_status_t status = HSA_STATUS_SUCCESS;
status = waitComplete();
STATUS_CHECK(status, __LINE__);
}
dispose();
}
HSADispatch(Kalmar::HSADevice* _device, HSAKernel* _kernel,
const hsa_kernel_dispatch_packet_t *aql=nullptr);
hsa_status_t pushFloatArg(float f) { return pushArgPrivate(f); }
hsa_status_t pushIntArg(int i) { return pushArgPrivate(i); }
hsa_status_t pushBooleanArg(unsigned char z) { return pushArgPrivate(z); }
hsa_status_t pushByteArg(char b) { return pushArgPrivate(b); }
hsa_status_t pushLongArg(long j) { return pushArgPrivate(j); }
hsa_status_t pushDoubleArg(double d) { return pushArgPrivate(d); }
hsa_status_t pushShortArg(short s) { return pushArgPrivate(s); }
hsa_status_t pushPointerArg(void *addr) { return pushArgPrivate(addr); }
hsa_status_t clearArgs() {
arg_count = 0;
arg_vec.clear();
return HSA_STATUS_SUCCESS;
}
hsa_status_t setLaunchConfiguration(int dims, size_t *globalDims, size_t *localDims,
int dynamicGroupSize);
hsa_status_t dispatchKernelWaitComplete(Kalmar::HSAQueue*);
hsa_status_t dispatchKernelAsync(Kalmar::HSAQueue*, const void *hostKernarg,
int hostKernargSize, bool allocSignal);
hsa_status_t dispatchKernelAsyncFromOp(Kalmar::HSAQueue* hsaQueue);
// dispatch a kernel asynchronously
hsa_status_t dispatchKernel(hsa_queue_t* commandQueue, const void *hostKernarg,
int hostKernargSize, bool allocSignal);
// wait for the kernel to finish execution
hsa_status_t waitComplete();
void dispose();
uint64_t getTimestampFrequency() override {
// get system tick frequency
uint64_t timestamp_frequency_hz = 0L;
hsa_system_get_info(HSA_SYSTEM_INFO_TIMESTAMP_FREQUENCY, ×tamp_frequency_hz);
return timestamp_frequency_hz;
}
uint64_t getBeginTimestamp() override;
uint64_t getEndTimestamp() override;
private:
template <typename T>
hsa_status_t pushArgPrivate(T val) {
/* add padding if necessary */
int padding_size = (arg_vec.size() % sizeof(T)) ? (sizeof(T) - (arg_vec.size() % sizeof(T))) : 0;
#if KALMAR_DEBUG
printf("push %lu bytes into kernarg: ", sizeof(T) + padding_size);
#endif
for (size_t i = 0; i < padding_size; ++i) {
arg_vec.push_back((uint8_t)0x00);
#if KALMAR_DEBUG
printf("%02X ", (uint8_t)0x00);
#endif
}
uint8_t* ptr = static_cast<uint8_t*>(static_cast<void*>(&val));
for (size_t i = 0; i < sizeof(T); ++i) {
arg_vec.push_back(ptr[i]);
#if KALMAR_DEBUG
printf("%02X ", ptr[i]);
#endif
}
#if KALMAR_DEBUG
printf("\n");
#endif
arg_count++;
return HSA_STATUS_SUCCESS;
}
int computeLaunchAttr(int globalSize, int localSize, int recommendedSize) {
// localSize of 0 means pick best
if (localSize == 0) localSize = recommendedSize;
localSize = std::min(localSize, recommendedSize);
localSize = std::min(localSize, globalSize); // workgroup size shall not exceed grid size
return localSize;
}
}; // end of HSADispatch
//-----
//Structure used to extract information from memory pool
struct pool_iterator
{
hsa_amd_memory_pool_t _am_memory_pool;
hsa_amd_memory_pool_t _am_host_memory_pool;
hsa_amd_memory_pool_t _kernarg_memory_pool;
hsa_amd_memory_pool_t _finegrained_system_memory_pool;
hsa_amd_memory_pool_t _coarsegrained_system_memory_pool;
hsa_amd_memory_pool_t _local_memory_pool;
bool _found_kernarg_memory_pool;
bool _found_finegrained_system_memory_pool;
bool _found_local_memory_pool;
bool _found_coarsegrained_system_memory_pool;
size_t _local_memory_pool_size;
pool_iterator() ;
};
pool_iterator::pool_iterator()
{
_kernarg_memory_pool.handle=(uint64_t)-1;
_finegrained_system_memory_pool.handle=(uint64_t)-1;
_local_memory_pool.handle=(uint64_t)-1;
_coarsegrained_system_memory_pool.handle=(uint64_t)-1;
_found_kernarg_memory_pool = false;
_found_finegrained_system_memory_pool = false;
_found_local_memory_pool = false;
_found_coarsegrained_system_memory_pool = false;
_local_memory_pool_size = 0;
}
//-----
///
/// memory allocator
///
namespace Kalmar {
class HSAQueue final : public KalmarQueue
{
private:
// HSA commmand queue associated with this HSAQueue instance
hsa_queue_t* commandQueue;
//
// kernel dispatches and barriers associated with this HSAQueue instance
//
// When a kernel k is dispatched, we'll get a KalmarAsyncOp f.
// This vector would hold f. acccelerator_view::wait() would trigger
// HSAQueue::wait(), and all future objects in the KalmarAsyncOp objects
// will be waited on.
//
std::vector< std::shared_ptr<KalmarAsyncOp> > asyncOps;
uint64_t opSeqNums;
// Kind of the youngest command in the queue.
// Used to detect and enforce dependencies between commands.
hcCommandKind youngestCommandKind;
//
// kernelBufferMap and bufferKernelMap forms the dependency graph of
// kernel / kernel dispatches / buffers
//
// For a particular kernel k, kernelBufferMap[k] holds a vector of
// host buffers used by k. The vector is filled at HSAQueue::Push(),
// when kernel arguments are prepared.
//
// When a kenrel k is to be dispatched, kernelBufferMap[k] will be traversed
// to figure out if there is any previous kernel dispatch associated for
// each buffer b used by k. This is done by checking bufferKernelMap[b].
// If there are previous kernel dispatches which use b, then we wait on
// them before dispatch kernel k. bufferKernelMap[b] will be cleared then.
//
// After kernel k is dispatched, we'll get a KalmarAsync object f, we then
// walk through each buffer b used by k and mark the association as:
// bufferKernelMap[b] = f
//
// Finally kernelBufferMap[k] will be cleared.
//
// association between buffers and kernel dispatches
// key: buffer address
// value: a vector of kernel dispatches
std::map<void*, std::vector< std::weak_ptr<KalmarAsyncOp> > > bufferKernelMap;
// association between a kernel and buffers used by it
// key: kernel
// value: a vector of buffers used by the kernel
std::map<void*, std::vector<void*> > kernelBufferMap;
// signal used by sync copy only
hsa_signal_t sync_copy_signal;
public:
HSAQueue(KalmarDevice* pDev, hsa_agent_t agent, execute_order order) : KalmarQueue(pDev, queuing_mode_automatic, order), commandQueue(nullptr), asyncOps(), opSeqNums(0), bufferKernelMap(), kernelBufferMap() {
hsa_status_t status;
/// Query the maximum size of the queue.
uint32_t queue_size = 0;
status = hsa_agent_get_info(agent, HSA_AGENT_INFO_QUEUE_MAX_SIZE, &queue_size);
STATUS_CHECK(status, __LINE__);
/// Create a queue using the maximum size.
status = hsa_queue_create(agent, queue_size, HSA_QUEUE_TYPE_SINGLE, NULL, NULL,
UINT32_MAX, UINT32_MAX, &commandQueue);
#if KALMAR_DEBUG
std::cerr << "HSAQueue::HSAQueue(): created an HSA command queue: " << commandQueue << "\n";
#endif
STATUS_CHECK_Q(status, commandQueue, __LINE__);
/// Enable profiling support for the queue.
status = hsa_amd_profiling_set_profiler_enabled(commandQueue, 1);
youngestCommandKind = hcCommandInvalid;
status = hsa_signal_create(1, 1, &agent, &sync_copy_signal);
STATUS_CHECK(status, __LINE__);
}
void dispose() override {
hsa_status_t status;
#if KALMAR_DEBUG
std::cerr << "HSAQueue::dispose() in\n";
#endif
// wait on all existing kernel dispatches and barriers to complete
wait();
// clear bufferKernelMap
for (auto iter = bufferKernelMap.begin(); iter != bufferKernelMap.end(); ++iter) {
iter->second.clear();
}
bufferKernelMap.clear();
// clear kernelBufferMap
for (auto iter = kernelBufferMap.begin(); iter != kernelBufferMap.end(); ++iter) {
iter->second.clear();
}
kernelBufferMap.clear();
#if KALMAR_DEBUG
std::cerr << "HSAQueue::dispose(): destroy an HSA command queue: " << commandQueue << "\n";
#endif
status = hsa_queue_destroy(commandQueue);
STATUS_CHECK(status, __LINE__);
commandQueue = nullptr;
status = hsa_signal_destroy(sync_copy_signal);
STATUS_CHECK(status, __LINE__);
#if KALMAR_DEBUG
std::cerr << "HSAQueue::dispose() out\n";
#endif
}
~HSAQueue() {
#if KALMAR_DEBUG
std::cerr << "HSAQueue::~HSAQueue() in\n";
#endif
if (commandQueue != nullptr) {
dispose();
}
#if KALMAR_DEBUG
std::cerr << "HSAQueue::~HSAQueue() out\n";
#endif
}
// FIXME: implement flush
//
void printAsyncOps(std::ostream &s = std::cerr)
{
hsa_signal_value_t oldv=0;
s << "Queue: " << this << " : " << asyncOps.size() << " op entries\n";
for (int i=0; i<asyncOps.size(); i++) {
const std::shared_ptr<KalmarAsyncOp::KalmarAsyncOp> &op = asyncOps[i];
s << "index:" << std::setw(4) << i ;
if (op != nullptr) {
s << " op#"<< op->getSeqNum() ;
hsa_signal_t signal = * (static_cast<hsa_signal_t*> (op->getNativeHandle()));
hsa_signal_value_t v = hsa_signal_load_acquire(signal);
s << " " << getHcCommandKindString(op->getCommandKind());
s << " signal=" << std::hex << signal.handle << std::dec <<" value=" << v;
if (v != oldv) {
s << " <--TRANSITION";
oldv = v;
}
} else {
s << " op <nullptr>";
}
s << "\n";
}
}
// Save the command and type
// TODO - can convert to reference?
void pushAsyncOp(std::shared_ptr<KalmarAsyncOp> op) {
op->setSeqNum(++opSeqNums);
#if KALMAR_DEBUG_ASYNC_COPY
std::cerr << " pushing op=" << op << " #" << op->getSeqNum() << " signal="<< std::hex << ((hsa_signal_t*)op->getNativeHandle())->handle << std::dec
<< " commandKind=" << getHcCommandKindString(op->getCommandKind()) << std::endl;
#endif
if (asyncOps.size() >= MAX_INFLIGHT_COMMANDS_PER_QUEUE) {
#if KALMAR_DEBUG_ASYNC_COPY
std::cerr << "Hit max inflight ops asyncOps.size=" << asyncOps.size() << ". op#" << opSeqNums << " force sync\n";
#endif
wait();
}
asyncOps.push_back(op);
youngestCommandKind = op->getCommandKind();
}
// Check the command kind for the upcoming command that will be sent to this queue
// if it differs from the youngest async op sent to the queue, we may need to insert additional synchronization.
// The function returns nullptr if no dependency is required. For example, back-to-back commands of same type
// are often implicitly synchronized so no dependency is required.
// Also different modes and optimizations can control when dependencies are added.
std::shared_ptr<KalmarAsyncOp> detectStreamDeps(KalmarAsyncOp *newOp) {
hcCommandKind newCommandKind = newOp->getCommandKind();
assert (newCommandKind != hcCommandInvalid);
if (!asyncOps.empty()) {
assert (youngestCommandKind != hcCommandInvalid);
bool needDep = false;
if (newCommandKind != youngestCommandKind) {
needDep = true;
};
if (((newCommandKind == hcCommandKernel) && (youngestCommandKind == hcCommandMarker)) ||
((newCommandKind == hcCommandMarker) && (youngestCommandKind == hcCommandKernel))) {
// No dependency required since Marker and Kernel share same queue and are ordered by AQL barrier bit.
needDep = false;
} else if (FORCE_SIGNAL_DEP_BETWEEN_COPIES && isCopyCommand(newCommandKind) && isCopyCommand(youngestCommandKind)) {
needDep = true;
}
if (needDep) {
#if KALMAR_DEBUG_ASYNC_COPY
std::cerr << "command type changed " << getHcCommandKindString(youngestCommandKind) << " -> " << getHcCommandKindString(newCommandKind) << "\n" ;
#endif
return asyncOps.back();
}
}
return nullptr;
}
void waitForStreamDeps (KalmarAsyncOp *newOp) {
std::shared_ptr<KalmarAsyncOp> depOp = detectStreamDeps(newOp);
if (depOp != nullptr) {
EnqueueMarkerWithDependency(1, &depOp);
}
}
int getPendingAsyncOps() override {
int count = 0;
for (int i = 0; i < asyncOps.size(); ++i) {
auto asyncOp = asyncOps[i];
if (asyncOp != nullptr) {
hsa_signal_t signal = *(static_cast <hsa_signal_t*> (asyncOp->getNativeHandle()));
hsa_signal_value_t v = hsa_signal_load_relaxed(signal);
if (v != 0) {
++count;
}
}
}
return count;
}
void wait(hcWaitMode mode = hcWaitModeBlocked) override {
// wait on all previous async operations to complete
// Go in reverse order (from youngest to oldest).
// Ensures younger ops have chance to complete before older ops reclaim their resources
#if KALMAR_DEBUG_ASYNC_COPY
std::cerr << " queue wait, contents:\n";
printAsyncOps(std::cerr);
#endif
// If oldest OP doesn't have a signal, we need to enqueue
// a barrier with a signal so host can tell when it finishes