-
Notifications
You must be signed in to change notification settings - Fork 12
Expand file tree
/
Copy pathlist_violation.cpp
More file actions
996 lines (862 loc) · 22.7 KB
/
list_violation.cpp
File metadata and controls
996 lines (862 loc) · 22.7 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
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
// version that checks number of subdevices for clCreateSubDevices
template<typename T>
bool list_violation(
cl_version version,
const char * name,
T param,
cl_device_id device,
cl_uint num_devices)
{
if (strcmp(name, "cl_device_partition_property") == 0)
{ // clCreateSubDevices
cl_uint cu;
cl_uint sd;
// only single partition scheme is allowed
size_t pos = 0;
cl_uint curr_cu = 0;
cl_uint curr_sd = 0;
switch (param[0]) {
case CL_DEVICE_PARTITION_EQUALLY:
tdispatch->clGetDeviceInfo(device,
CL_DEVICE_MAX_COMPUTE_UNITS,
sizeof(cl_uint),
&cu,
NULL);
if ((param[1] <= 0) || (static_cast<cl_uint>(param[1]) > cu) || (param[2] != 0))
return true;
if (cu / param[1] > num_devices)
return true;
return false;
case CL_DEVICE_PARTITION_BY_COUNTS:
tdispatch->clGetDeviceInfo(device,
CL_DEVICE_MAX_COMPUTE_UNITS,
sizeof(cl_uint),
&cu,
NULL);
tdispatch->clGetDeviceInfo(device,
CL_DEVICE_PARTITION_MAX_SUB_DEVICES,
sizeof(cl_uint),
&sd,
NULL);
++pos;
while ((param[pos] != 0) && (param[pos] != CL_DEVICE_PARTITION_BY_COUNTS_LIST_END))
{
curr_cu += (cl_uint)param[pos];
curr_sd++;
if ((param[pos] < 0) || (curr_cu > cu) || (curr_sd > sd))
return true;
++pos;
}
++pos;
if (param[pos] != 0)
return true;
if (curr_sd > num_devices)
return true;
return false;
case CL_DEVICE_PARTITION_BY_AFFINITY_DOMAIN:
if (bitfield_violation(version, "cl_device_affinity_domain", param[1]) ||
(param[1] == 0) || (param[2] != 0))
return true;
return false;
default:
return true;
}
}
*layer::log_stream << "Wrong list:" << name << ", expected cl_device_partition_property."
<< std::endl << "This is a bug in the param_verification layer." << std::endl;
return true;
}
// version that checks device limits for clCreateSubDevices
// and max size of device queue and support for for clCreateCommandQueueWithProperties
template<typename T>
bool list_violation(
cl_version version,
const char * name,
T param,
cl_device_id device)
{
if (strcmp(name, "cl_device_partition_property") == 0)
{ // clCreateSubDevices
cl_uint cu;
cl_uint sd;
// only single partition scheme is allowed
size_t pos = 0;
cl_uint curr_cu = 0;
cl_uint curr_sd = 0;
switch (param[0]) {
case CL_DEVICE_PARTITION_EQUALLY:
tdispatch->clGetDeviceInfo(device,
CL_DEVICE_MAX_COMPUTE_UNITS,
sizeof(cl_uint),
&cu,
NULL);
if ((param[1] <= 0) || (static_cast<cl_uint>(param[1]) > cu) || (param[2] != 0))
return true;
return false;
case CL_DEVICE_PARTITION_BY_COUNTS:
tdispatch->clGetDeviceInfo(device,
CL_DEVICE_MAX_COMPUTE_UNITS,
sizeof(cl_uint),
&cu,
NULL);
tdispatch->clGetDeviceInfo(device,
CL_DEVICE_PARTITION_MAX_SUB_DEVICES,
sizeof(cl_uint),
&sd,
NULL);
++pos;
while ((param[pos] != 0) && (param[pos] != CL_DEVICE_PARTITION_BY_COUNTS_LIST_END))
{
curr_cu += (cl_uint)param[pos];
curr_sd++;
if ((param[pos] < 0) || (curr_cu > cu) || (curr_sd > sd) || (curr_sd > cu))
return true;
++pos;
}
++pos;
if (param[pos] != 0)
return true;
return false;
case CL_DEVICE_PARTITION_BY_AFFINITY_DOMAIN:
if (bitfield_violation(version, "cl_device_affinity_domain", param[1]) ||
(param[1] == 0) || (param[2] != 0))
return true;
return false;
default:
return true;
}
}
if (strcmp(name, "cl_queue_properties") == 0)
{ // clCreateCommandQueueWithProperties - min 2.0
if (param == NULL)
return false;
// any order of properties is allowed
size_t pos = 0;
// and not once ???
cl_uint qs = 0;
tdispatch->clGetDeviceInfo(device,
CL_DEVICE_QUEUE_ON_DEVICE_MAX_SIZE,
sizeof(cl_uint),
&qs,
NULL);
cl_uint curr_qs = 0;
cl_device_device_enqueue_capabilities ddec = 0;
if (version >= CL_MAKE_VERSION(3, 0, 0))
tdispatch->clGetDeviceInfo(device,
CL_DEVICE_DEVICE_ENQUEUE_CAPABILITIES,
sizeof(cl_device_device_enqueue_capabilities),
&ddec,
NULL);
cl_command_queue_properties qp = 0;
while (param[pos] != 0)
{
switch (param[pos]) {
case CL_QUEUE_PROPERTIES:
++pos;
qp = param[pos];
++pos;
if (bitfield_violation(version, "cl_command_queue_properties", qp))
return true;
if ((qp & CL_QUEUE_ON_DEVICE) && !(qp & CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE))
return true;
if ((qp & CL_QUEUE_ON_DEVICE_DEFAULT) && !(qp & CL_QUEUE_ON_DEVICE))
return true;
if ((version >= CL_MAKE_VERSION(3, 0, 0)) &&
(qp & CL_QUEUE_ON_DEVICE) && !(ddec & CL_DEVICE_QUEUE_SUPPORTED))
return true;
break;
case CL_QUEUE_SIZE:
++pos;
curr_qs = (cl_uint)param[pos];
++pos;
if (curr_qs > qs)
return true;
break;
default:
return true;
}
}
if ((curr_qs > 0) && !(qp & CL_QUEUE_ON_DEVICE))
return true;
return false;
}
*layer::log_stream << "Wrong list:" << name << ", expected cl_device_partition_property or cl_queue_properties."
<< std::endl << "This is a bug in the param_verification layer." << std::endl;
return true;
}
// version that checks platform for clCreateContext and clCreateContextFromType
template<typename T>
bool list_violation(
cl_version version,
const char * name,
T param,
void * user_data)
{
(void)version;
// dummy param to separate the case
(void)user_data;
if (strcmp(name, "cl_context_properties") == 0)
{ // clCreateContext
if (param == NULL)
return false;
// any order of properties is allowed
size_t pos = 0;
// but only once
cl_uint cp_num = 0;
cl_uint cius_num = 0;
while (param[pos] != 0)
{
switch (param[pos]) {
case CL_CONTEXT_PLATFORM:
if (!object_is_valid((cl_platform_id)param[pos+1]))
return true;
pos += 2;
++cp_num;
if (cp_num > 1)
return true;
break;
case CL_CONTEXT_INTEROP_USER_SYNC:
pos += 2;
++cius_num;
if (cius_num > 1)
return true;
break;
default:
return true;
}
}
return false;
}
*layer::log_stream << "Wrong list:" << name << ", expected cl_context_properties."
<< std::endl << "This is a bug in the param_verification layer." << std::endl;
return true;
}
// base version
template<typename T>
bool list_violation(cl_version version, const char * name, T param)
{
if (strcmp(name, "cl_device_partition_property") == 0)
{ // clCreateSubDevices
// only single partition scheme is allowed
size_t pos = 0;
switch (param[0]) {
case CL_DEVICE_PARTITION_EQUALLY:
if ((param[1] == 0) || (param[2] != 0))
return true;
return false;
case CL_DEVICE_PARTITION_BY_COUNTS:
++pos;
while ((param[pos] != 0) && (param[pos] != CL_DEVICE_PARTITION_BY_COUNTS_LIST_END))
{
++pos;
}
++pos;
if (param[pos] != 0)
return true;
return false;
case CL_DEVICE_PARTITION_BY_AFFINITY_DOMAIN:
if (bitfield_violation(version, "cl_device_affinity_domain", param[1]) ||
(param[1] == 0) || (param[2] != 0))
return true;
return false;
default:
return true;
}
}
if (strcmp(name, "cl_context_properties") == 0)
{ // clCreateContext
if (param == NULL)
return false;
// any order of properties is allowed
size_t pos = 0;
// but only once
cl_uint cp_num = 0;
cl_uint cius_num = 0;
while (param[pos] != 0)
{
switch (param[pos]) {
case CL_CONTEXT_PLATFORM:
pos += 2;
++cp_num;
if (cp_num > 1)
return true;
break;
case CL_CONTEXT_INTEROP_USER_SYNC:
pos += 2;
++cius_num;
if (cius_num > 1)
return true;
break;
default:
return true;
}
}
return false;
}
if (strcmp(name, "cl_queue_properties") == 0)
{ // clCreateCommandQueueWithProperties - min 2.0
if (param == NULL)
return false;
// any order of properties is allowed
size_t pos = 0;
// and not once ???
cl_ulong curr_qs = 0;
cl_command_queue_properties qp = 0;
while (param[pos] != 0)
{
switch (param[pos]) {
case CL_QUEUE_PROPERTIES:
++pos;
qp = param[pos];
++pos;
if (bitfield_violation(version, "cl_command_queue_properties", qp))
return true;
if ((qp & CL_QUEUE_ON_DEVICE) && !(qp & CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE))
return true;
if ((qp & CL_QUEUE_ON_DEVICE_DEFAULT) && !(qp & CL_QUEUE_ON_DEVICE))
return true;
break;
case CL_QUEUE_SIZE:
++pos;
curr_qs = param[pos];
++pos;
break;
default:
return true;
}
}
if ((curr_qs > 0) && !(qp & CL_QUEUE_ON_DEVICE))
return true;
return false;
}
if (strcmp(name, "cl_mem_properties") == 0)
{ // clCreateBufferWithProperties
if (param == NULL)
return false;
// no properties yet
if (param[0] == 0)
return false;
return true;
}
if (strcmp(name, "cl_sampler_properties") == 0)
{ // clCreateBufferWithProperties
if (param == NULL)
return false;
// any order of properties is allowed
size_t pos = 0;
// but only once
cl_uint snc_num = 0;
cl_uint sam_num = 0;
cl_uint sfm_num = 0;
while (param[pos] != 0)
{
switch (param[pos]) {
case CL_SAMPLER_NORMALIZED_COORDS:
pos += 2;
++snc_num;
if (snc_num > 1)
return true;
break;
case CL_SAMPLER_ADDRESSING_MODE:
++pos;
++sam_num;
if (sam_num > 1)
return true;
if (enum_violation(version, "cl_addressing_mode", param[pos]))
return true;
++pos;
break;
case CL_SAMPLER_FILTER_MODE:
++pos;
++sfm_num;
if (sfm_num > 1)
return true;
if (enum_violation(version, "cl_filter_mode", param[pos]))
return true;
++pos;
break;
default:
return true;
}
}
return false;
}
*layer::log_stream << "Bad list:" << name << "."
<< std::endl << "This is a bug in the param_verification layer." << std::endl;
return true;
}
std::vector<cl_device_id> get_devices(cl_context context)
{
// suppose minimum OpenCL 1.1
cl_uint nd = 0;
tdispatch->clGetContextInfo(
context,
CL_CONTEXT_NUM_DEVICES,
sizeof(nd),
&nd,
NULL);
std::vector<cl_device_id> devices(nd);
tdispatch->clGetContextInfo(
context,
CL_CONTEXT_DEVICES,
nd * sizeof(cl_device_id),
devices.data(),
NULL);
return devices;
}
std::vector<cl_device_id> get_devices(cl_program program)
{
cl_uint nd = 0;
tdispatch->clGetProgramInfo(
program,
CL_PROGRAM_NUM_DEVICES,
sizeof(nd),
&nd,
NULL);
std::vector<cl_device_id> devices(nd);
tdispatch->clGetProgramInfo(
program,
CL_PROGRAM_DEVICES,
nd * sizeof(cl_device_id),
devices.data(),
nullptr);
return devices;
}
std::vector<cl_device_id> get_devices(cl_kernel kernel)
{
cl_program pr;
tdispatch->clGetKernelInfo(
kernel,
CL_KERNEL_PROGRAM,
sizeof(pr),
&pr,
NULL);
cl_uint nd;
tdispatch->clGetProgramInfo(
pr,
CL_PROGRAM_NUM_DEVICES,
sizeof(nd),
&nd,
NULL);
std::vector<cl_device_id> devices(nd);
tdispatch->clGetProgramInfo(
pr,
CL_PROGRAM_DEVICES,
nd * sizeof(cl_device_id),
devices.data(),
NULL);
// remove all devices for which the program is not built
devices.erase(
std::remove_if(
devices.begin(),
devices.end(),
[pr](cl_device_id d) {
cl_build_status bs;
tdispatch->clGetProgramBuildInfo(
pr,
d,
CL_PROGRAM_BUILD_STATUS,
sizeof(bs),
&bs,
NULL);
return (bs != CL_BUILD_SUCCESS); }
),
devices.end());
return devices;
}
//template<typename T1, typename T2>
//bool object_not_in(T1 object, T2 in);
// device should belong to context
bool object_not_in(cl_device_id device, cl_context context)
{
std::vector<cl_device_id> devices = get_devices(context);
size_t nd = devices.size();
for (size_t i = 0; i < nd; ++i)
if (device == devices[i])
return false;
return true;
}
// command queue and buffer should belong to the same context
bool object_not_in(cl_command_queue command_queue, cl_mem buffer)
{
cl_context c_context;
tdispatch->clGetCommandQueueInfo(
command_queue,
CL_QUEUE_CONTEXT,
sizeof(cl_context),
&c_context,
NULL);
cl_context b_context;
tdispatch->clGetMemObjectInfo(
buffer,
CL_MEM_CONTEXT,
sizeof(cl_context),
&b_context,
NULL);
if (b_context == c_context)
return false;
return true;
}
// events and command queue should belong to the same context
bool object_not_in(cl_event event, cl_command_queue command_queue)
{
cl_context e_context;
tdispatch->clGetEventInfo(
event,
CL_EVENT_CONTEXT,
sizeof(cl_context),
&e_context,
NULL);
cl_context c_context;
tdispatch->clGetCommandQueueInfo(
command_queue,
CL_QUEUE_CONTEXT,
sizeof(cl_context),
&c_context,
NULL);
if (e_context == c_context)
return false;
return true;
}
// mem objects and command queue should belong to the same context
bool object_not_in(cl_mem object, cl_command_queue command_queue)
{
cl_context m_context;
tdispatch->clGetMemObjectInfo(
object,
CL_MEM_CONTEXT,
sizeof(cl_context),
&m_context,
NULL);
cl_context c_context;
tdispatch->clGetCommandQueueInfo(
command_queue,
CL_QUEUE_CONTEXT,
sizeof(cl_context),
&c_context,
NULL);
if (m_context == c_context)
return false;
return true;
}
// command queue and kernel should belong to the same context
bool object_not_in(cl_command_queue command_queue, cl_kernel kernel)
{
cl_context c_context;
tdispatch->clGetCommandQueueInfo(
command_queue,
CL_QUEUE_CONTEXT,
sizeof(cl_context),
&c_context,
NULL);
cl_context k_context;
tdispatch->clGetKernelInfo(
kernel,
CL_KERNEL_CONTEXT,
sizeof(cl_context),
&k_context,
NULL);
if (k_context == c_context)
return false;
return true;
}
// events should belong to the same context
bool object_not_in(cl_event event1, cl_event event2)
{
cl_context e_context;
tdispatch->clGetEventInfo(
event1,
CL_EVENT_CONTEXT,
sizeof(cl_context),
&e_context,
NULL);
cl_context c_context;
tdispatch->clGetEventInfo(
event2,
CL_EVENT_CONTEXT,
sizeof(cl_context),
&c_context,
NULL);
if (e_context == c_context)
return false;
return true;
}
// command_queue should be on device
bool object_not_in(cl_command_queue command_queue, cl_device_id device)
{
cl_device_id q_device;
tdispatch->clGetCommandQueueInfo(
command_queue,
CL_QUEUE_DEVICE,
sizeof(cl_device_id),
&q_device,
NULL);
if (device == q_device)
return false;
return true;
}
// device should belong to the program
bool object_not_in(cl_device_id device, cl_program program)
{
std::vector<cl_device_id> devices = get_devices(program);
size_t nd = devices.size();
for (size_t i = 0; i < nd; ++i)
{
if (device == devices[i])
return false;
}
return true;
}
// device should belong to the kernel
bool object_not_in(cl_device_id device, cl_kernel kernel)
{
std::vector<cl_device_id> devices = get_devices(kernel);
size_t nd = devices.size();
for (size_t i = 0; i < nd; ++i)
{
if (device == devices[i])
return false;
}
return true;
}
// kernel must be built for the device of command_queue
bool object_not_in(cl_kernel kernel, cl_command_queue command_queue)
{
std::vector<cl_device_id> devices = get_devices(kernel);
size_t nd = devices.size();
cl_device_id d;
tdispatch->clGetCommandQueueInfo(
command_queue,
CL_QUEUE_DEVICE,
sizeof(d),
&d,
NULL);
for (size_t i = 0; i < nd; ++i)
{
if (d == devices[i])
return false;
}
return true;
}
template<typename T1, typename T2>
bool any_object_not_in(T1 * objects, size_t n, T2 in)
{
for (size_t i = 0; i < n; ++i)
if (object_not_in(objects[i], in))
return true;
return false;
}
template<cl_uint property>
bool for_all(const cl_device_id * devices, const size_t nd,
std::function<bool(return_type<property>)> check)
{
return_type<property> a;
bool res = true;
for (size_t i = 0; i < nd; ++i)
{
tdispatch->clGetDeviceInfo(
devices[i],
property,
sizeof(a),
&a,
NULL);
res = res && check(a);
}
return res;
}
template<cl_uint property>
bool for_all(cl_context context, std::function<bool(return_type<property>)> check)
{
std::vector<cl_device_id> devices = get_devices(context);
size_t nd = devices.size();
return_type<property> a;
bool res = true;
for (size_t i = 0; i < nd; ++i)
{
tdispatch->clGetDeviceInfo(
devices[i],
property,
sizeof(a),
&a,
NULL);
res = res && check(a);
}
return res;
}
template<cl_uint property>
bool for_all(cl_program program, std::function<bool(return_type<property>)> check)
{
std::vector<cl_device_id> devices = get_devices(program);
size_t nd = devices.size();
return_type<property> a;
bool res = true;
for (size_t i = 0; i < nd; ++i)
{
tdispatch->clGetDeviceInfo(
devices[i],
property,
sizeof(a),
&a,
NULL);
res = res && check(a);
}
return res;
}
template<cl_uint property>
bool for_all(cl_kernel kernel, std::function<bool(return_type<property>)> check)
{
std::vector<cl_device_id> devices = get_devices(kernel);
size_t nd = devices.size();
return_type<property> a;
bool res = true;
for (size_t i = 0; i < nd; ++i)
{
tdispatch->clGetDeviceInfo(
devices[i],
property,
sizeof(a),
&a,
NULL);
res = res && check(a);
}
return res;
}
template<cl_uint property>
bool for_any(const cl_device_id * devices, const size_t nd,
std::function<bool(return_type<property>)> check)
{
return_type<property> a;
bool res = false;
for (size_t i = 0; i < nd; ++i)
{
tdispatch->clGetDeviceInfo(
devices[i],
property,
sizeof(a),
&a,
NULL);
res = res || check(a);
}
return res;
}
template<cl_uint property>
bool for_any(cl_context context, std::function<bool(return_type<property>)> check)
{
std::vector<cl_device_id> devices = get_devices(context);
size_t nd = devices.size();
return_type<property> a;
bool res = false;
for (size_t i = 0; i < nd; ++i)
{
tdispatch->clGetDeviceInfo(
devices[i],
property,
sizeof(a),
&a,
NULL);
res = res || check(a);
}
return res;
}
template<cl_uint property>
bool for_any(cl_program program, std::function<bool(return_type<property>)> check)
{
std::vector<cl_device_id> devices = get_devices(program);
size_t nd = devices.size();
return_type<property> a;
bool res = false;
for (size_t i = 0; i < nd; ++i)
{
tdispatch->clGetDeviceInfo(
devices[i],
property,
sizeof(a),
&a,
NULL);
res = res || check(a);
}
return res;
}
// adopted from Appendix D of OpenCL 3.0 standard
bool check_copy_overlap(
const size_t src_origin[],
const size_t dst_origin[],
const size_t region[],
const size_t row_pitch,
const size_t slice_pitch)
{
const size_t real_row_pitch = row_pitch > 0 ? row_pitch : region[0];
const size_t real_slice_pitch = slice_pitch > 0 ? slice_pitch : region[1] * real_row_pitch;
const size_t slice_size = (region[1] - 1) * real_row_pitch + region[0];
const size_t block_size = (region[2] - 1) * real_slice_pitch + slice_size;
const size_t src_start =
src_origin[2] * real_slice_pitch + src_origin[1] * real_row_pitch + src_origin[0];
const size_t src_end = src_start + block_size;
const size_t dst_start =
dst_origin[2] * real_slice_pitch + dst_origin[1] * real_row_pitch + dst_origin[0];
const size_t dst_end = dst_start + block_size;
// No overlap if dst ends before src starts or if src ends before dst starts.
if ( (dst_end <= src_start) || (src_end <= dst_start) ) {
return false;
}
// No overlap if region[0] for dst or src fits in the gap between region[0] and row_pitch.
{
const size_t src_dx = src_origin[0] % real_row_pitch;
const size_t dst_dx = dst_origin[0] % real_row_pitch;
if ( ((dst_dx >= src_dx + region[0]) &&
(dst_dx + region[0] <= src_dx + real_row_pitch)) ||
((src_dx >= dst_dx + region[0]) &&
(src_dx + region[0] <= dst_dx + real_row_pitch)) )
{
return false;
}
}
// No overlap if region[1] for dst or src fits in the gap between region[1] and slice_pitch.
{
const size_t src_dy =
(src_origin[1] * real_row_pitch + src_origin[0]) % real_slice_pitch;
const size_t dst_dy =
(dst_origin[1] * real_row_pitch + dst_origin[0]) % real_slice_pitch;
if ( ((dst_dy >= src_dy + slice_size) &&
(dst_dy + slice_size <= src_dy + real_slice_pitch)) ||
((src_dy >= dst_dy + slice_size) &&
(src_dy + slice_size <= dst_dy + real_slice_pitch)) )
{
return false;
}
}
// Otherwise src and dst overlap.
return true;
}
// check overlap for clEnqueueSVMMemcpy
bool check_copy_overlap(
void * dst_ptr,
const void * src_ptr,
size_t size)
{
uint8_t * dst = static_cast<uint8_t *>(dst_ptr);
void * temp = const_cast<void *>(src_ptr);
uint8_t * src = static_cast<uint8_t *>(temp);
if ((src < dst + 1) && (dst < src + size))
return true;
if ((dst < src + 1) && (src < dst + size))
return true;
return false;
}
// check if ptr is not aligned to align
bool not_aligned(
void * ptr,
size_t align)
{
if (std::align(align, align, ptr, align) == nullptr)
return true;
return false;
}
template<typename T>
std::remove_cv_t<T> mult(T * array, size_t elements)
{
std::remove_cv_t<T> res = array[0];
for (size_t i = 1; i < elements; ++i)
res *= array[i];
return res;
}