forked from kokkos/kokkos
-
Notifications
You must be signed in to change notification settings - Fork 0
/
TestReducers.hpp
1407 lines (1170 loc) · 43.3 KB
/
TestReducers.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
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
//@HEADER
// ************************************************************************
//
// Kokkos v. 4.0
// Copyright (2022) National Technology & Engineering
// Solutions of Sandia, LLC (NTESS).
//
// Under the terms of Contract DE-NA0003525 with NTESS,
// the U.S. Government retains certain rights in this software.
//
// Part of Kokkos, under the Apache License v2.0 with LLVM Exceptions.
// See https://kokkos.org/LICENSE for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//@HEADER
#include <sstream>
#include <iostream>
#include <limits>
#include <Kokkos_Core.hpp>
#include <TestNonTrivialScalarTypes.hpp>
//--------------------------------------------------------------------------
namespace Test {
struct MyPair : Kokkos::pair<int, int> {};
} // namespace Test
template <>
struct Kokkos::reduction_identity<Test::MyPair> {
KOKKOS_FUNCTION static Test::MyPair min() {
return Test::MyPair{{INT_MAX, INT_MAX}};
}
};
namespace Test {
struct ReducerTag {};
template <class Scalar, class ExecSpace = Kokkos::DefaultExecutionSpace>
struct TestReducers {
struct SumFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const int& i, Scalar& value) const { value += values(i); }
};
struct TeamSumFunctor {
using member_type = typename Kokkos::TeamPolicy<ExecSpace>::member_type;
KOKKOS_INLINE_FUNCTION
void operator()(const member_type& m, Scalar& value) const {
if (m.team_rank() == m.team_size() - 1) value += Scalar(1);
}
};
struct TeamSumNestedFunctor {
using member_type = typename Kokkos::TeamPolicy<ExecSpace>::member_type;
SumFunctor f;
int M, N;
Kokkos::View<Scalar*, ExecSpace> result;
TeamSumNestedFunctor(SumFunctor& f_, const int M_, const int N_,
Kokkos::View<Scalar*, ExecSpace> result_)
: f(f_), M(M_), N(N_), result(result_) {}
KOKKOS_INLINE_FUNCTION
void operator()(const member_type& m) const {
const int i = m.league_rank();
Scalar local_scalar;
Kokkos::Sum<Scalar, typename ExecSpace::memory_space> reducer_scalar(
local_scalar);
Kokkos::parallel_reduce(Kokkos::TeamThreadRange(m, N), f, reducer_scalar);
result(i) = local_scalar;
}
};
struct ProdFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const int& i, Scalar& value) const { value *= values(i); }
};
struct MinFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const int& i, Scalar& value) const {
if (values(i) < value) value = values(i);
}
};
struct MaxFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const int& i, Scalar& value) const {
if (values(i) > value) value = values(i);
}
};
struct MinLocFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(
const int& i,
typename Kokkos::MinLoc<Scalar, int>::value_type& value) const {
if (values(i) < value.val) {
value.val = values(i);
value.loc = i;
}
}
};
struct MinLocFunctor2D {
Kokkos::View<const Scalar**, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(
const int& i, const int& j,
typename Kokkos::MinLoc<Scalar, MyPair>::value_type& value) const {
if (values(i, j) < value.val) {
value.val = values(i, j);
value.loc = {{i, j}};
}
}
};
struct MaxLocFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(
const int& i,
typename Kokkos::MaxLoc<Scalar, int>::value_type& value) const {
if (values(i) > value.val) {
value.val = values(i);
value.loc = i;
}
}
};
struct MaxLocFunctor2D {
Kokkos::View<const Scalar**, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(
const int& i, const int& j,
typename Kokkos::MaxLoc<Scalar, MyPair>::value_type& value) const {
if (values(i, j) > value.val) {
value.val = values(i, j);
value.loc = {{i, j}};
}
}
};
struct MinMaxLocFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(
const int& i,
typename Kokkos::MinMaxLoc<Scalar, int>::value_type& value) const {
if (values(i) > value.max_val) {
value.max_val = values(i);
value.max_loc = i;
}
if (values(i) < value.min_val) {
value.min_val = values(i);
value.min_loc = i;
}
}
};
struct MinMaxLocFunctor2D {
Kokkos::View<const Scalar**, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(
const int& i, const int& j,
typename Kokkos::MinMaxLoc<Scalar, MyPair>::value_type& value) const {
if (values(i, j) > value.max_val) {
value.max_val = values(i, j);
value.max_loc = {{i, j}};
}
if (values(i, j) < value.min_val) {
value.min_val = values(i, j);
value.min_loc = {{i, j}};
}
}
};
struct BAndFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const int& i, Scalar& value) const {
value = value & values(i);
}
};
struct BOrFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const int& i, Scalar& value) const {
value = value | values(i);
}
};
struct LAndFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const int& i, Scalar& value) const {
value = value && values(i);
}
};
struct LOrFunctor {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const int& i, Scalar& value) const {
value = value || values(i);
}
};
struct SumFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const ReducerTag, const int& i, Scalar& value) const {
value += values(i);
}
};
struct ProdFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const ReducerTag, const int& i, Scalar& value) const {
value *= values(i);
}
};
struct MinFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const ReducerTag, const int& i, Scalar& value) const {
if (values(i) < value) value = values(i);
}
};
struct MaxFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const ReducerTag, const int& i, Scalar& value) const {
if (values(i) > value) value = values(i);
}
};
struct MinLocFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(
const ReducerTag, const int& i,
typename Kokkos::MinLoc<Scalar, int>::value_type& value) const {
if (values(i) < value.val) {
value.val = values(i);
value.loc = i;
}
}
};
struct MaxLocFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(
const ReducerTag, const int& i,
typename Kokkos::MaxLoc<Scalar, int>::value_type& value) const {
if (values(i) > value.val) {
value.val = values(i);
value.loc = i;
}
}
};
struct MinMaxLocFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(
const ReducerTag, const int& i,
typename Kokkos::MinMaxLoc<Scalar, int>::value_type& value) const {
if (values(i) > value.max_val) {
value.max_val = values(i);
value.max_loc = i;
}
if (values(i) < value.min_val) {
value.min_val = values(i);
value.min_loc = i;
}
}
};
struct BAndFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const ReducerTag, const int& i, Scalar& value) const {
value = value & values(i);
}
};
struct BOrFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const ReducerTag, const int& i, Scalar& value) const {
value = value | values(i);
}
};
struct LAndFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const ReducerTag, const int& i, Scalar& value) const {
value = value && values(i);
}
};
struct LOrFunctorTag {
Kokkos::View<const Scalar*, ExecSpace> values;
KOKKOS_INLINE_FUNCTION
void operator()(const ReducerTag, const int& i, Scalar& value) const {
value = value || values(i);
}
};
// get number of teams for TeamPolicy depending on the tested type
constexpr static int get_num_teams() {
if constexpr (sizeof(Scalar) == 1) {
return 126;
} else if constexpr (std::is_same_v<Scalar,
Kokkos::Experimental::bhalf_t>) {
return 256;
}
return 1024;
}
static void test_sum_team_policy(int N, SumFunctor f, Scalar reference_sum) {
#ifdef KOKKOS_ENABLE_OPENACC
if constexpr (std::is_same_v<ExecSpace, Kokkos::Experimental::OpenACC> &&
(std::is_same_v<Scalar, size_t> ||
std::is_same_v<Scalar, double>)) {
return; // FIXME_OPENACC
}
#endif
Scalar sum_scalar;
Kokkos::View<Scalar, ExecSpace> sum_view("result");
Kokkos::deep_copy(sum_view, Scalar(1));
// Test team policy reduction
constexpr int num_teams = get_num_teams();
TeamSumFunctor tf;
#ifdef KOKKOS_ENABLE_OPENMPTARGET
auto team_pol = Kokkos::TeamPolicy<ExecSpace>(num_teams, Kokkos::AUTO);
#else
auto team_pol = Kokkos::TeamPolicy<ExecSpace>(num_teams, 1);
#endif
Kokkos::parallel_reduce(team_pol, tf, sum_view);
Kokkos::deep_copy(sum_scalar, sum_view);
ASSERT_EQ(sum_scalar, Scalar{num_teams}) << "num_teams: " << num_teams;
// Test TeamThreadRange level reduction with 0 work produces 0 result
{
const int league_size = 1;
Kokkos::View<Scalar*, ExecSpace> result("result", league_size);
TeamSumNestedFunctor tnf(f, league_size, 0, result);
Kokkos::parallel_for(
#ifdef KOKKOS_ENABLE_OPENMPTARGET
Kokkos::TeamPolicy<ExecSpace>(1, Kokkos::AUTO),
#else
Kokkos::TeamPolicy<ExecSpace>(1, 1),
#endif
tnf);
auto result_h =
Kokkos::create_mirror_view_and_copy(Kokkos::HostSpace(), result);
ASSERT_EQ(result_h(0), Scalar{0}) << "N: " << N;
}
// Same test as above, but with inner reduction over N, and league_size=10
{
const int league_size = 10;
Kokkos::View<Scalar*, ExecSpace> result("result", league_size);
TeamSumNestedFunctor tnf(f, league_size, N, result);
// FIXME_OPENMPTARGET temporary restriction for team size to be at least
// 32
#ifdef KOKKOS_ENABLE_OPENMPTARGET
int initial_team_size =
std::is_same_v<ExecSpace, Kokkos::Experimental::OpenMPTarget> ? 32
: 1;
#else
int initial_team_size = 1;
#endif
auto team_size_max =
Kokkos::TeamPolicy<ExecSpace>(league_size, initial_team_size)
.team_size_max(tnf, Kokkos::ParallelForTag());
auto team_size = std::min(team_size_max, TEST_EXECSPACE().concurrency());
Kokkos::parallel_for(
Kokkos::TeamPolicy<ExecSpace>(league_size, team_size), tnf);
auto result_h =
Kokkos::create_mirror_view_and_copy(Kokkos::HostSpace(), result);
for (int i = 0; i < result_h.extent_int(0); ++i) {
ASSERT_EQ(result_h(i), reference_sum) << "N: " << N;
}
}
}
static void test_sum(int N) {
Kokkos::View<Scalar*, ExecSpace> values("Values", N);
auto h_values = Kokkos::create_mirror_view(values);
Scalar reference_sum = 0;
for (int i = 0; i < N; i++) {
int denom = sizeof(Scalar) <= 2 ? 10 : 100;
// clang-format off
// For bhalf, we start overflowing integer values at 2^8.
// after 2^8, we lose representation of odd numbers;
// after 2^9, we lose representation of odd and even numbers in position 1.
// after 2^10, we lose representation of odd and even numbers in position 1-3.
// after 2^11, we lose representation of odd and even numbers in position 1-7.
// ...
// Generally, for IEEE 754 floating point numbers, we start this overflow pattern at: 2^(num_fraction_bits+1).
// brain float has num_fraction_bits = 7.
// This mask addresses #4719 for N <= 51.
// The mask is not needed for N <= 25.
// clang-format on
int mask =
std::is_same<Scalar, Kokkos::Experimental::bhalf_t>::value && N > 25
? (int)0xfffffffe
: (int)0xffffffff;
h_values(i) = (Scalar)((rand() % denom) & mask);
reference_sum += h_values(i);
}
Kokkos::deep_copy(values, h_values);
SumFunctor f;
f.values = values;
SumFunctorTag f_tag;
f_tag.values = values;
Scalar init = 0;
{
Scalar sum_scalar = Scalar(1);
Kokkos::Sum<Scalar> reducer_scalar(sum_scalar);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, 0), f,
reducer_scalar);
ASSERT_EQ(sum_scalar, init) << "N: " << N;
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_scalar);
ASSERT_EQ(sum_scalar, reference_sum) << "N: " << N;
sum_scalar = init;
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace, ReducerTag>(0, N),
f_tag, reducer_scalar);
ASSERT_EQ(sum_scalar, reference_sum) << "N: " << N;
Scalar sum_scalar_view = reducer_scalar.reference();
ASSERT_EQ(sum_scalar_view, reference_sum) << "N: " << N;
}
test_sum_team_policy(N, f, reference_sum);
{
Kokkos::View<Scalar, Kokkos::HostSpace> sum_view("View");
sum_view() = Scalar(1);
Kokkos::Sum<Scalar> reducer_view(sum_view);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, 0), f,
reducer_view);
Kokkos::fence();
Scalar sum_view_scalar = sum_view();
ASSERT_EQ(sum_view_scalar, init) << "N: " << N;
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_view);
Kokkos::fence();
sum_view_scalar = sum_view();
ASSERT_EQ(sum_view_scalar, reference_sum) << "N: " << N;
Scalar sum_view_view = reducer_view.reference();
ASSERT_EQ(sum_view_view, reference_sum) << "N: " << N;
}
{
Kokkos::View<Scalar, typename ExecSpace::memory_space> sum_view("View");
Kokkos::deep_copy(sum_view, Scalar(1));
Kokkos::Sum<Scalar, typename ExecSpace::memory_space> reducer_view(
sum_view);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, 0), f,
reducer_view);
Kokkos::fence();
Scalar sum_view_scalar;
Kokkos::deep_copy(sum_view_scalar, sum_view);
ASSERT_EQ(sum_view_scalar, init) << "N: " << N;
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_view);
Kokkos::fence();
Kokkos::deep_copy(sum_view_scalar, sum_view);
ASSERT_EQ(sum_view_scalar, reference_sum) << "N: " << N;
}
}
static void test_prod(int N) {
Kokkos::View<Scalar*, ExecSpace> values("Values", N);
auto h_values = Kokkos::create_mirror_view(values);
Scalar reference_prod = 1;
for (int i = 0; i < N; i++) {
h_values(i) = (Scalar)(rand() % 4 + 1);
reference_prod *= h_values(i);
}
Kokkos::deep_copy(values, h_values);
ProdFunctor f;
f.values = values;
ProdFunctorTag f_tag;
f_tag.values = values;
Scalar init = 1;
{
Scalar prod_scalar = Scalar(0);
Kokkos::Prod<Scalar> reducer_scalar(prod_scalar);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, 0), f,
reducer_scalar);
ASSERT_EQ(prod_scalar, init);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_scalar);
ASSERT_EQ(prod_scalar, reference_prod);
prod_scalar = init;
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace, ReducerTag>(0, N),
f_tag, reducer_scalar);
ASSERT_EQ(prod_scalar, reference_prod);
Scalar prod_scalar_view = reducer_scalar.reference();
ASSERT_EQ(prod_scalar_view, reference_prod);
}
{
Kokkos::View<Scalar, Kokkos::HostSpace> prod_view("View");
prod_view() = Scalar(0);
Kokkos::Prod<Scalar> reducer_view(prod_view);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, 0), f,
reducer_view);
Kokkos::fence();
Scalar prod_view_scalar = prod_view();
ASSERT_EQ(prod_view_scalar, init);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_view);
Kokkos::fence();
prod_view_scalar = prod_view();
ASSERT_EQ(prod_view_scalar, reference_prod);
Scalar prod_view_view = reducer_view.reference();
ASSERT_EQ(prod_view_view, reference_prod);
}
{
Kokkos::View<Scalar, typename ExecSpace::memory_space> prod_view("View");
Kokkos::deep_copy(prod_view, Scalar(0));
Kokkos::Prod<Scalar, typename ExecSpace::memory_space> reducer_view(
prod_view);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, 0), f,
reducer_view);
Kokkos::fence();
Scalar prod_view_scalar;
Kokkos::deep_copy(prod_view_scalar, prod_view);
ASSERT_EQ(prod_view_scalar, init);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_view);
Kokkos::fence();
Kokkos::deep_copy(prod_view_scalar, prod_view);
ASSERT_EQ(prod_view_scalar, reference_prod);
}
}
static void test_min(int N) {
Kokkos::View<Scalar*, ExecSpace> values("Values", N);
auto h_values = Kokkos::create_mirror_view(values);
Scalar reference_min = std::numeric_limits<Scalar>::max();
for (int i = 0; i < N; i++) {
h_values(i) = (Scalar)(rand() % 100000);
if (h_values(i) < reference_min) reference_min = h_values(i);
}
Kokkos::deep_copy(values, h_values);
MinFunctor f;
f.values = values;
MinFunctorTag f_tag;
f_tag.values = values;
Scalar init = std::numeric_limits<Scalar>::max();
{
Scalar min_scalar = init;
Kokkos::Min<Scalar> reducer_scalar(min_scalar);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_scalar);
ASSERT_EQ(min_scalar, reference_min);
min_scalar = init;
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace, ReducerTag>(0, N),
f_tag, reducer_scalar);
ASSERT_EQ(min_scalar, reference_min);
Scalar min_scalar_view = reducer_scalar.reference();
ASSERT_EQ(min_scalar_view, reference_min);
}
{
Kokkos::View<Scalar, Kokkos::HostSpace> min_view("View");
min_view() = init;
Kokkos::Min<Scalar> reducer_view(min_view);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_view);
Kokkos::fence();
Scalar min_view_scalar = min_view();
ASSERT_EQ(min_view_scalar, reference_min);
Scalar min_view_view = reducer_view.reference();
ASSERT_EQ(min_view_view, reference_min);
}
}
static void test_max(int N) {
Kokkos::View<Scalar*, ExecSpace> values("Values", N);
auto h_values = Kokkos::create_mirror_view(values);
Scalar reference_max = std::numeric_limits<Scalar>::min();
for (int i = 0; i < N; i++) {
h_values(i) = (Scalar)(rand() % 100000 + 1);
if (h_values(i) > reference_max) reference_max = h_values(i);
}
Kokkos::deep_copy(values, h_values);
MaxFunctor f;
f.values = values;
MaxFunctorTag f_tag;
f_tag.values = values;
Scalar init = std::numeric_limits<Scalar>::min();
{
Scalar max_scalar = init;
Kokkos::Max<Scalar> reducer_scalar(max_scalar);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_scalar);
ASSERT_EQ(max_scalar, reference_max);
max_scalar = init;
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace, ReducerTag>(0, N),
f_tag, reducer_scalar);
ASSERT_EQ(max_scalar, reference_max);
Scalar max_scalar_view = reducer_scalar.reference();
ASSERT_EQ(max_scalar_view, reference_max);
}
{
Kokkos::View<Scalar, Kokkos::HostSpace> max_view("View");
max_view() = init;
Kokkos::Max<Scalar> reducer_view(max_view);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_view);
Kokkos::fence();
Scalar max_view_scalar = max_view();
ASSERT_EQ(max_view_scalar, reference_max);
Scalar max_view_view = reducer_view.reference();
ASSERT_EQ(max_view_view, reference_max);
}
}
static void test_minloc(int N) {
using value_type = typename Kokkos::MinLoc<Scalar, int>::value_type;
Kokkos::View<Scalar*, ExecSpace> values("Values", N);
auto h_values = Kokkos::create_mirror_view(values);
Scalar reference_min = std::numeric_limits<Scalar>::max();
int reference_loc = -1;
for (int i = 0; i < N; i++) {
h_values(i) = (Scalar)(rand() % 100000 + 2);
if (h_values(i) < reference_min) {
reference_min = h_values(i);
reference_loc = i;
} else if (h_values(i) == reference_min) {
// Make min unique.
h_values(i) += Scalar(1);
}
}
Kokkos::deep_copy(values, h_values);
MinLocFunctor f;
f.values = values;
MinLocFunctorTag f_tag;
f_tag.values = values;
{
value_type min_scalar;
Kokkos::MinLoc<Scalar, int> reducer_scalar(min_scalar);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_scalar);
ASSERT_EQ(min_scalar.val, reference_min);
ASSERT_EQ(min_scalar.loc, reference_loc);
min_scalar = value_type();
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace, ReducerTag>(0, N),
f_tag, reducer_scalar);
ASSERT_EQ(min_scalar.val, reference_min);
ASSERT_EQ(min_scalar.loc, reference_loc);
value_type min_scalar_view = reducer_scalar.reference();
ASSERT_EQ(min_scalar_view.val, reference_min);
ASSERT_EQ(min_scalar_view.loc, reference_loc);
}
{
Kokkos::View<value_type, Kokkos::HostSpace> min_view("View");
Kokkos::MinLoc<Scalar, int> reducer_view(min_view);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_view);
Kokkos::fence();
value_type min_view_scalar = min_view();
ASSERT_EQ(min_view_scalar.val, reference_min);
ASSERT_EQ(min_view_scalar.loc, reference_loc);
value_type min_view_view = reducer_view.reference();
ASSERT_EQ(min_view_view.val, reference_min);
ASSERT_EQ(min_view_view.loc, reference_loc);
}
}
static void test_minloc_2d(int N) {
using reducer_type = Kokkos::MinLoc<Scalar, MyPair>;
using value_type = typename reducer_type::value_type;
Kokkos::View<Scalar**, ExecSpace> values("Values", N, N);
auto h_values = Kokkos::create_mirror_view(values);
Scalar reference_min = std::numeric_limits<Scalar>::max();
MyPair reference_loc = {{-1, -1}};
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) {
h_values(i, j) = (Scalar)(rand() % 100000 + 2);
if (h_values(i, j) < reference_min) {
reference_min = h_values(i, j);
reference_loc = {{i, j}};
} else if (h_values(i, j) == reference_min) {
// Make min unique.
h_values(i, j) += Scalar(1);
}
}
Kokkos::deep_copy(values, h_values);
MinLocFunctor2D f;
f.values = values;
{
value_type min_scalar;
reducer_type reducer_scalar(min_scalar);
Kokkos::parallel_reduce(
Kokkos::MDRangePolicy<Kokkos::Rank<2>, ExecSpace>({0, 0}, {N, N}), f,
reducer_scalar);
ASSERT_EQ(min_scalar.val, reference_min);
ASSERT_EQ(min_scalar.loc, reference_loc);
}
}
static void test_maxloc(int N) {
using value_type = typename Kokkos::MaxLoc<Scalar, int>::value_type;
Kokkos::View<Scalar*, ExecSpace> values("Values", N);
auto h_values = Kokkos::create_mirror_view(values);
Scalar reference_max = std::numeric_limits<Scalar>::min();
int reference_loc = -1;
for (int i = 0; i < N; i++) {
h_values(i) = (Scalar)(rand() % 100000 + 2);
if (h_values(i) > reference_max) {
reference_max = h_values(i);
reference_loc = i;
} else if (h_values(i) == reference_max) {
// Make max unique.
h_values(i) -= Scalar(1);
}
}
Kokkos::deep_copy(values, h_values);
MaxLocFunctor f;
f.values = values;
MaxLocFunctorTag f_tag;
f_tag.values = values;
{
value_type max_scalar;
Kokkos::MaxLoc<Scalar, int> reducer_scalar(max_scalar);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_scalar);
ASSERT_EQ(max_scalar.val, reference_max);
ASSERT_EQ(max_scalar.loc, reference_loc);
max_scalar = value_type();
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace, ReducerTag>(0, N),
f_tag, reducer_scalar);
ASSERT_EQ(max_scalar.val, reference_max);
ASSERT_EQ(max_scalar.loc, reference_loc);
value_type max_scalar_view = reducer_scalar.reference();
ASSERT_EQ(max_scalar_view.val, reference_max);
ASSERT_EQ(max_scalar_view.loc, reference_loc);
}
{
Kokkos::View<value_type, Kokkos::HostSpace> max_view("View");
Kokkos::MaxLoc<Scalar, int> reducer_view(max_view);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_view);
Kokkos::fence();
value_type max_view_scalar = max_view();
ASSERT_EQ(max_view_scalar.val, reference_max);
ASSERT_EQ(max_view_scalar.loc, reference_loc);
value_type max_view_view = reducer_view.reference();
ASSERT_EQ(max_view_view.val, reference_max);
ASSERT_EQ(max_view_view.loc, reference_loc);
}
}
static void test_maxloc_2d(int N) {
using reducer_type = Kokkos::MaxLoc<Scalar, MyPair>;
using value_type = typename reducer_type::value_type;
Kokkos::View<Scalar**, ExecSpace> values("Values", N, N);
auto h_values = Kokkos::create_mirror_view(values);
Scalar reference_max = std::numeric_limits<Scalar>::min();
MyPair reference_loc = {{-1, -1}};
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j) {
h_values(i, j) = (Scalar)(rand() % 100000 + 2);
if (h_values(i, j) > reference_max) {
reference_max = h_values(i, j);
reference_loc = {{i, j}};
} else if (h_values(i, j) == reference_max) {
// Make max unique.
h_values(i, j) -= Scalar(1);
}
}
Kokkos::deep_copy(values, h_values);
MaxLocFunctor2D f;
f.values = values;
{
value_type max_scalar;
reducer_type reducer_scalar(max_scalar);
Kokkos::parallel_reduce(
Kokkos::MDRangePolicy<Kokkos::Rank<2>, ExecSpace>({0, 0}, {N, N}), f,
reducer_scalar);
ASSERT_EQ(max_scalar.val, reference_max);
ASSERT_EQ(max_scalar.loc, reference_loc);
}
}
static void test_minmaxloc(int N) {
using value_type = typename Kokkos::MinMaxLoc<Scalar, int>::value_type;
Kokkos::View<Scalar*, ExecSpace> values("Values", N);
auto h_values = Kokkos::create_mirror_view(values);
Scalar reference_max = std::numeric_limits<Scalar>::min();
Scalar reference_min = std::numeric_limits<Scalar>::max();
int reference_minloc = -1;
int reference_maxloc = -1;
for (int i = 0; i < N; i++) {
h_values(i) = (Scalar)(rand() % 100000 + 2);
}
for (int i = 0; i < N; i++) {
if (h_values(i) > reference_max) {
reference_max = h_values(i);
reference_maxloc = i;
} else if (h_values(i) == reference_max) {
// Make max unique.
h_values(i) -= Scalar(1);
}
}
for (int i = 0; i < N; i++) {
if (h_values(i) < reference_min) {
reference_min = h_values(i);
reference_minloc = i;
} else if (h_values(i) == reference_min) {
// Make min unique.
h_values(i) += Scalar(1);
}
}
Kokkos::deep_copy(values, h_values);
MinMaxLocFunctor f;
f.values = values;
MinMaxLocFunctorTag f_tag;
f_tag.values = values;
{
value_type minmax_scalar;
Kokkos::MinMaxLoc<Scalar, int> reducer_scalar(minmax_scalar);
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace>(0, N), f,
reducer_scalar);
ASSERT_EQ(minmax_scalar.min_val, reference_min);
for (int i = 0; i < N; i++) {
if ((i == minmax_scalar.min_loc) && (h_values(i) == reference_min)) {
reference_minloc = i;
}
}
ASSERT_EQ(minmax_scalar.min_loc, reference_minloc);
ASSERT_EQ(minmax_scalar.max_val, reference_max);
for (int i = 0; i < N; i++) {
if ((i == minmax_scalar.max_loc) && (h_values(i) == reference_max)) {
reference_maxloc = i;
}
}
ASSERT_EQ(minmax_scalar.max_loc, reference_maxloc);
minmax_scalar = value_type();
Kokkos::parallel_reduce(Kokkos::RangePolicy<ExecSpace, ReducerTag>(0, N),
f_tag, reducer_scalar);
ASSERT_EQ(minmax_scalar.min_val, reference_min);
for (int i = 0; i < N; i++) {
if ((i == minmax_scalar.min_loc) && (h_values(i) == reference_min)) {
reference_minloc = i;
}
}
ASSERT_EQ(minmax_scalar.min_loc, reference_minloc);
ASSERT_EQ(minmax_scalar.max_val, reference_max);
for (int i = 0; i < N; i++) {
if ((i == minmax_scalar.max_loc) && (h_values(i) == reference_max)) {
reference_maxloc = i;
}
}