/
UMESimdInterface.h
6031 lines (5281 loc) · 246 KB
/
UMESimdInterface.h
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
// The MIT License (MIT)
//
// Copyright (c) 2015 CERN
//
// Author: Przemyslaw Karpinski
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//
//
// This piece of code was developed as part of ICE-DIP project at CERN.
// "ICE-DIP is a European Industrial Doctorate project funded by the European Community's
// 7th Framework programme Marie Curie Actions under grant PITN-GA-2012-316596".
//
#ifndef UME_SIMD_INTERFACE_H_
#define UME_SIMD_INTERFACE_H_
#include <cmath>
#include <limits>
#include "UMEBasicTypes.h"
#if defined (_MSC_VER)
// WORKAROUND: Visual studio 2012 does not provide implementation for c++ 11 std::trunc, but VS2013 already has it.
#if _MSC_VER < 1800
namespace std
{
#include <math.h>
inline float trunc( float f ) { return (f>0) ? floor(f) : ceil(f); }
inline double trunc( double d ) { return (d>0) ? floor(d) : ceil(d); }
inline long double trunc( long double ld ) { return (ld>0) ? floor(ld) : ceil(ld); }
float round(float d) { return static_cast<float>(static_cast<int>(d + 0.5f)); }
double round(double d) { return static_cast<double>(static_cast<long>(d + 0.5)); }
//double trunc( Integral arg );
inline bool isnan( float f ) { return _isnan((double)f) != 0 ? true : false; }
inline bool isnan( double d ) { return _isnan(d) != 0 ? true : false; }
inline bool isfinite( float f ) { return _finite((double)f) != 0 ? true : false; }
inline bool isfinite( double d ) { return _finite(d) != 0 ? true : false; }
inline bool isinf( float f ) { return !isfinite(f) && !isnan(f); }
inline bool isinf( double d) { return !isfinite(d) && !isnan(d); }
inline bool isnormal( float f) {
uint32_t temp0 = *reinterpret_cast<uint32_t*>(&f);
uint32_t temp1 = temp0 << 1; // remove sign bit
uint32_t temp2 = 0xFF000000;
uint32_t exponent = temp1 & temp2; // retrieve exponent
uint32_t mantisse = temp1 & (~temp2); // retrieve mantisse
bool issubnormal = (exponent == 0) && (mantisse != 0);
return (f != 0.0f) && (!issubnormal) && (isfinite(f)) && (!std::isnan(f));
}
inline bool isnormal( double d) {
uint64_t temp0 = *reinterpret_cast<uint64_t*>(&d);
uint64_t temp1 = temp0 << 1; // remove sign bit
uint64_t temp2 = 0xFFE0000000000000ll;
uint64_t exponent = temp1 & temp2; // retrieve exponent
uint64_t mantisse = temp1 & (~temp2); // retrive mantisse
bool issubnormal = (exponent == 0) && (mantisse != 0);
return (d != 0.0) && (!issubnormal) && (!std::isnan(d));
}
}
#endif
#endif
namespace UME
{
namespace SIMD
{
// All functions in this namespace will have one purpose: emulation of single function in different backends.
// Scalar emulation plugin has to emulate all of these features using scalar values either way. Spliting
// Functionality implementation from class implementation will allow re-use of the operator functions for
// other backends. This will decrease overall amount of code, and remove potential, repeated errors in plugins.
namespace EMULATED_FUNCTIONS
{
// ASSIGN
template<typename VEC_TYPE>
inline VEC_TYPE & assign(VEC_TYPE & dst, VEC_TYPE const & src) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
dst.insert(i, src[i]);
}
return dst;
}
// MASSIGN
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE & assign(MASK_TYPE const & mask, VEC_TYPE & dst, VEC_TYPE const & src) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) dst.insert(i, src[i]);
}
return dst;
}
// ASSIGNS
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE & assign(VEC_TYPE & dst, SCALAR_TYPE src) {
UME_EMULATION_WARNING();
for( uint32_t i = 0; i < VEC_TYPE::length(); i++) {
dst.insert(i, src);
}
return dst;
}
// MASSIGNS
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE & assign(MASK_TYPE const & mask, VEC_TYPE & dst, SCALAR_TYPE src) {
UME_EMULATION_WARNING();
for( uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) dst.insert(i, src);
}
return dst;
}
// LOAD
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE & load(VEC_TYPE & dst, SCALAR_TYPE const * p) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
dst.insert(i, p[i]);
}
return dst;
}
// MLOAD
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE & load(MASK_TYPE const & mask, VEC_TYPE & dst, SCALAR_TYPE const * p) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++)
{
if(mask[i] == true) dst.insert(i, p[i]);
}
return dst;
}
// LOADA
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE & loadAligned(VEC_TYPE & dst, SCALAR_TYPE const * p) {
UME_ALIGNMENT_CHECK(p, VEC_TYPE::alignment());
return EMULATED_FUNCTIONS::load<VEC_TYPE, SCALAR_TYPE>(dst, p);
}
// MLOADA
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE & loadAligned(MASK_TYPE const & mask, VEC_TYPE & dst, SCALAR_TYPE const * p) {
UME_ALIGNMENT_CHECK(p, VEC_TYPE::alignment());
return EMULATED_FUNCTIONS::load<VEC_TYPE, SCALAR_TYPE, MASK_TYPE>(mask, dst, p);
}
// STORE
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline SCALAR_TYPE* store(VEC_TYPE const & src, SCALAR_TYPE * p) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++)
{
p[i] = src[i];
}
return p;
}
// MSTORE
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline SCALAR_TYPE* store(MASK_TYPE const & mask, VEC_TYPE & src, SCALAR_TYPE * p) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++)
{
if(mask[i] == true) p[i] = src[i];
}
return p;
}
// STOREA
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline SCALAR_TYPE* storeAligned(VEC_TYPE & src, SCALAR_TYPE *p) {
UME_ALIGNMENT_CHECK(p, VEC_TYPE::alignment());
return store<VEC_TYPE, SCALAR_TYPE>(src, p);
}
// MSTOREA
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline SCALAR_TYPE* storeAligned(MASK_TYPE const & mask, VEC_TYPE & src, SCALAR_TYPE *p) {
UME_ALIGNMENT_CHECK(p, VEC_TYPE::alignment());
return store<MASK_TYPE, VEC_TYPE, SCALAR_TYPE>(mask, src, p);
}
// GATHERS
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE & gather(VEC_TYPE & dst, SCALAR_TYPE* base, uint64_t* indices) {
UME_EMULATION_WARNING();
for (uint32_t i = 0; i < VEC_TYPE::length(); i++) {
dst.insert( i, base[indices[i]]);
}
return dst;
}
// MGATHERS
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE & gather(MASK_TYPE const & mask, VEC_TYPE & dst, SCALAR_TYPE* base, uint64_t* indices) {
UME_EMULATION_WARNING();
for (uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) dst.insert( i, base[indices[i]]);
}
return dst;
}
// GATHERV
template<typename VEC_TYPE, typename SCALAR_TYPE, typename UINT_VEC_TYPE>
inline VEC_TYPE & gather(VEC_TYPE & dst, SCALAR_TYPE* base, UINT_VEC_TYPE const & indices) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
dst.insert(i, base[indices[i]]);
}
return dst;
}
// MGATHERV
template<typename VEC_TYPE, typename SCALAR_TYPE, typename UINT_VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE & gather(MASK_TYPE const & mask, VEC_TYPE & dst, SCALAR_TYPE* base, UINT_VEC_TYPE const & indices) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) dst.insert(i, base[indices[i]]);
}
return dst;
}
// SCATTERS
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline SCALAR_TYPE* scatter(VEC_TYPE const & src, SCALAR_TYPE* base, uint64_t* indices) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
base[indices[i]] = src[i];
}
return base;
}
// MSCATTERS
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline SCALAR_TYPE* scatter(MASK_TYPE const & mask, VEC_TYPE const & src, SCALAR_TYPE* base, uint64_t* indices) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) base[indices[i]] = src[i];
}
return base;
}
// SCATTERV
template<typename VEC_TYPE, typename SCALAR_TYPE, typename UINT_VEC_TYPE>
inline SCALAR_TYPE* scatter(VEC_TYPE const & src, SCALAR_TYPE* base, UINT_VEC_TYPE const & indices) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++)
{
base[indices[i]] = src[i];
}
return base;
}
// MSCATTERV
template<typename VEC_TYPE, typename SCALAR_TYPE, typename UINT_VEC_TYPE, typename MASK_TYPE>
inline SCALAR_TYPE* scatter(MASK_TYPE const & mask, VEC_TYPE const & src, SCALAR_TYPE* base, UINT_VEC_TYPE const & indices) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++)
{
if(mask[i] == true) base[indices[i]] = src[i];
}
return base;
}
// PACK
template<typename VEC_TYPE, typename VEC_HALF_TYPE>
inline VEC_TYPE & pack(VEC_TYPE & dst, VEC_HALF_TYPE const & src1, VEC_HALF_TYPE const & src2) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_HALF_TYPE::length(); i++) {
dst.insert(i, src1[i]);
dst.insert(i + VEC_HALF_TYPE::length(), src2[i]);
}
return dst;
}
// PACKLO
template<typename VEC_TYPE, typename VEC_HALF_TYPE>
inline VEC_TYPE & packLow(VEC_TYPE & dst, VEC_HALF_TYPE const & src1) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_HALF_TYPE::length(); i++) {
dst.insert(i, src1[i]);
}
return dst;
}
// PACKHI
template<typename VEC_TYPE, typename VEC_HALF_TYPE>
inline VEC_TYPE & packHigh(VEC_TYPE & dst, VEC_HALF_TYPE const & src1) {
UME_EMULATION_WARNING();
for(uint32_t i = VEC_HALF_TYPE::length(); i < VEC_TYPE::length(); i++) {
dst.insert(i, src1[i - VEC_HALF_TYPE::length()]);
}
return dst;
}
// UNPACK
template<typename VEC_TYPE, typename VEC_HALF_TYPE>
inline void unpack(VEC_TYPE const & src, VEC_HALF_TYPE & dst1, VEC_HALF_TYPE & dst2) {
UME_EMULATION_WARNING();
uint32_t halfLength = VEC_HALF_TYPE::length();
for(uint32_t i = 0; i < halfLength; i++) {
dst1.insert(i, src[i]);
dst2.insert(i, src[i + halfLength]);
}
}
// UNPACKLO
template<typename VEC_TYPE, typename VEC_HALF_TYPE>
inline VEC_HALF_TYPE unpackLow(VEC_TYPE const & src) {
UME_EMULATION_WARNING();
VEC_HALF_TYPE retval;
for(uint32_t i = 0; i < VEC_HALF_TYPE::length(); i++) {
retval.insert(i, src[i]);
}
return retval;
}
// UNPACKHI
template<typename VEC_TYPE, typename VEC_HALF_TYPE>
inline VEC_HALF_TYPE unpackHigh(VEC_TYPE const & src) {
UME_EMULATION_WARNING();
VEC_HALF_TYPE retval;
for(uint32_t i = 0; i < VEC_HALF_TYPE::length(); i++) {
retval.insert(i, src[i + VEC_HALF_TYPE::length()]);
}
return retval;
}
// ADDV
template<typename VEC_TYPE>
inline VEC_TYPE add (VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
retval.insert(i, a[i] + b[i]);
}
return retval;
}
// MADDV
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE add (MASK_TYPE const & mask, VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
retval.insert(i, mask[i] ? a[i] + b[i] : a[i]);
}
return retval;
}
// ADDS
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE addScalar (VEC_TYPE const & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
retval.insert(i, a[i] + b);
}
return retval;
}
// MADDS
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE addScalar (MASK_TYPE const & mask, VEC_TYPE const & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
retval.insert(i, mask[i] ? a[i] + b : a[i]);
}
return retval;
}
// ADDVA
template<typename VEC_TYPE>
inline VEC_TYPE & addAssign (VEC_TYPE & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) { a.insert(i, (a[i] + b[i])); }
return a;
}
// MADDVA
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE & addAssign (MASK_TYPE const & mask, VEC_TYPE & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) a.insert(i, (a[i] + b[i]));
}
return a;
}
// ADDSA
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE & addAssignScalar (VEC_TYPE & a, SCALAR_TYPE const & b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
a.insert(i, (a[i] + b));
}
return a;
}
// MADDSA
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE & addAssignScalar (MASK_TYPE const & mask, VEC_TYPE & a, SCALAR_TYPE const & b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) a.insert(i, a[i] + b);
}
return a;
}
// SADDV
template<typename VEC_TYPE>
inline VEC_TYPE addSaturated (VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::max();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
temp = (a[i] > (satValue - b[i])) ? satValue : (a[i] + b[i]);
retval.insert(i, temp);
}
return retval;
}
// MSADDV
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE addSaturated (MASK_TYPE const & mask, VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::max();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) {
temp = (a[i] > (satValue - b[i])) ? satValue : (a[i] + b[i]);
retval.insert(i, temp);
}
else {
retval.insert(i, a[i]);
}
}
return retval;
}
// SADDS
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE addSaturatedScalar (VEC_TYPE const & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::max();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
temp = (a[i] > (satValue - b)) ? satValue : (a[i] + b);
retval.insert(i, temp);
}
return retval;
}
// MSADDS
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE addSaturatedScalar (MASK_TYPE const & mask, VEC_TYPE const & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::max();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) {
temp = (a[i] > (satValue - b)) ? satValue : (a[i] + b);
retval.insert(i, temp);
}
else {
retval.insert(i, a[i]);
}
}
return retval;
}
// SADDVA
template<typename VEC_TYPE>
inline VEC_TYPE & addSaturatedAssign(VEC_TYPE & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::max();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
temp = (a[i] > (satValue - b[i])) ? satValue : (a[i] + b[i]);
a.insert(i, temp);
}
return a;
}
// MSADDVA
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE & addSaturatedAssign(MASK_TYPE const & mask, VEC_TYPE & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::max();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) {
temp = (a[i] > (satValue - b[i])) ? satValue : (a[i] + b[i]);
a.insert(i, temp);
}
}
return a;
}
// SADDSA
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE & addSaturatedScalarAssign(VEC_TYPE & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::max();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
temp = (a[i] > (satValue - b)) ? satValue : (a[i] + b);
a.insert(i, temp);
}
return a;
}
// MSADDSA
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE & addSaturatedScalarAssign(MASK_TYPE const & mask, VEC_TYPE & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::max();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) {
temp = (a[i] > (satValue - b)) ? satValue : (a[i] + b);
a.insert(i, temp);
}
}
return a;
}
// POSTINC
template<typename VEC_TYPE>
inline VEC_TYPE postfixIncrement(VEC_TYPE & a) {
UME_EMULATION_WARNING();
VEC_TYPE retval = a;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
a.insert(i, a[i] + 1);
}
return retval;
}
// MPOSTINC
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE postfixIncrement(MASK_TYPE const & mask, VEC_TYPE & a) {
UME_EMULATION_WARNING();
VEC_TYPE retval = a;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) a.insert(i, a[i] + 1);
}
return retval;
}
// PREFINC
template<typename VEC_TYPE>
inline VEC_TYPE & prefixIncrement(VEC_TYPE & a) {
for(uint32_t i = 0; i < VEC_TYPE::length(); i++)
{
a.insert(i, a[i] + 1);
}
return a;
}
// MPREFINC
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE & prefixIncrement(MASK_TYPE const & mask, VEC_TYPE & a) {
for(uint32_t i = 0; i < VEC_TYPE::length(); i++)
{
if(mask[i] == true) a.insert(i, a[i] + 1);
}
return a;
}
// SUBV
template<typename VEC_TYPE>
inline VEC_TYPE sub ( VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
retval.insert(i, a[i] - b[i]);
}
return retval;
}
// MSUBV
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE sub ( MASK_TYPE const & mask, VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) retval.insert(i, a[i] - b[i]);
else retval.insert(i, a[i]);
}
return retval;
}
// SUBS
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE subScalar ( VEC_TYPE const & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
retval.insert(i, (a[i] - b));
}
return retval;
}
// MSUBS
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE subScalar ( MASK_TYPE const & mask, VEC_TYPE const & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) retval.insert(i, (a[i] - b));
else retval.insert(i, a[i]);
}
return retval;
}
// SUBFROMV
template<typename VEC_TYPE>
inline VEC_TYPE subFrom (VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
retval.insert(i, a[i] - b[i]);
}
return retval;
}
// MSUBFROMV
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE subFrom (MASK_TYPE const & mask, VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) retval.insert(i, a[i] - b[i]);
else retval.insert(i, a[i]);
}
return retval;
}
// SUBFROMS
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE subFromScalar (SCALAR_TYPE a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
retval.insert(i, a - b[i]);
}
return retval;
}
// MSUBFROMS
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE subFromScalar (MASK_TYPE const & mask, SCALAR_TYPE a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) retval.insert(i, a - b[i]);
else retval.insert(i, a);
}
return retval;
}
// SUBFROMVA
template<typename VEC_TYPE>
inline VEC_TYPE & subFromAssign (VEC_TYPE const & a, VEC_TYPE & b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
b.insert(i, a[i] - b[i]);
}
return b;
}
// MSUBFROMVA
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE & subFromAssign (MASK_TYPE const & mask, VEC_TYPE const & a, VEC_TYPE & b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) b.insert(i, a[i] - b[i]);
else b.insert(i, a[i]);
}
return b;
}
// SUBFROMSA
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE & subFromScalarAssign (SCALAR_TYPE a, VEC_TYPE & b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
b.insert(i, a - b[i]);
}
return b;
}
// MSUBFROMSA
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE & subFromScalarAssign (MASK_TYPE const & mask, SCALAR_TYPE a, VEC_TYPE & b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) b.insert(i, a - b[i]);
else b.insert(i, a);
}
return b;
}
// NEG
template<typename VEC_TYPE>
inline VEC_TYPE unaryMinus (VEC_TYPE const & a) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
retval.insert(i, -a[i]);
}
return retval;
}
// MNEG
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE unaryMinus (MASK_TYPE const & mask, VEC_TYPE const & a) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if( mask[i] == true ) retval.insert(i, -a[i]);
else retval.insert(i, a[i]);
}
return retval;
}
// NEGA
template<typename VEC_TYPE>
inline VEC_TYPE & unaryMinusAssign (VEC_TYPE & a) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
a.insert(i, -a[i]);
}
return a;
}
// MNEGA
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE & unaryMinusAssign (MASK_TYPE const & mask, VEC_TYPE & a) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if( mask[i] == true ) a.insert(i, -a[i]);
}
return a;
}
// SUBVA
template<typename VEC_TYPE>
inline VEC_TYPE & subAssign (VEC_TYPE & dst, VEC_TYPE const & b)
{
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
dst.insert(i, dst[i] - b[i]);
}
return dst;
}
// MSUBVA
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE & subAssign (MASK_TYPE const & mask, VEC_TYPE & dst, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true ) dst.insert(i, dst[i] - b[i]);
}
return dst;
}
// SUBSA
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE & subAssign (VEC_TYPE & dst, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
dst.insert(i, dst[i] - b);
}
return dst;
}
// MSUBSA
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE & subAssign (MASK_TYPE const & mask, VEC_TYPE & dst, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) dst.insert(i, dst[i] - b);
}
return dst;
}
// SSUBV
template<typename VEC_TYPE>
inline VEC_TYPE subSaturated (VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::min();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
temp = (a[i] < (satValue + b[i])) ? satValue : (a[i] - b[i]);
retval.insert(i, temp);
}
return retval;
}
// MSSUBV
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE subSaturated (MASK_TYPE const & mask, VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::min();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) {
temp = (a[i] < (satValue + b[i])) ? satValue : (a[i] - b[i]);
retval.insert(i, temp);
}
else {
retval.insert(i, a[i]);
}
}
return retval;
}
// SSUBS
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE subSaturated (VEC_TYPE const & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::min();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
temp = (a[i] < (satValue + b)) ? satValue : (a[i] - b);
retval.insert(i, temp);
}
return retval;
}
// MSSUBS
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE subSaturated (MASK_TYPE const & mask, VEC_TYPE const & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::min();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) {
temp = (a[i] < (satValue + b)) ? satValue : (a[i] - b);
retval.insert(i, temp);
}
else {
retval.insert(i, a[i]);
}
}
return retval;
}
// SSUBVA
template<typename VEC_TYPE>
inline VEC_TYPE & subSaturatedAssign (VEC_TYPE & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::min();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
temp = (a[i] < (satValue + b[i])) ? satValue : (a[i] - b[i]);
a.insert(i, temp);
}
return a;
}
// MSSUBV
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE & subSaturatedAssign (MASK_TYPE const & mask, VEC_TYPE & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::min();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) {
temp = (a[i] < (satValue + b[i])) ? satValue : (a[i] - b[i]);
a.insert(i, temp);
}
}
return a;
}
// SSUBS
template<typename VEC_TYPE, typename SCALAR_TYPE>
inline VEC_TYPE & subSaturatedScalarAssign (VEC_TYPE & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::min();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
temp = (a[i] < (satValue + b)) ? satValue : (a[i] - b);
a.insert(i, temp);
}
return a;
}
// MSSUBS
template<typename VEC_TYPE, typename SCALAR_TYPE, typename MASK_TYPE>
inline VEC_TYPE & subSaturatedScalarAssign (MASK_TYPE const & mask, VEC_TYPE & a, SCALAR_TYPE b) {
UME_EMULATION_WARNING();
decltype(a[0]) temp = 0;
// maximum value
decltype(a[0]) satValue = std::numeric_limits<decltype(a[0])>::min();
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) {
temp = (a[i] < (satValue + b)) ? satValue : (a[i] - b);
a.insert(i, temp);
}
}
return a;
}
// POSTDEC
template<typename VEC_TYPE>
inline VEC_TYPE postfixDecrement(VEC_TYPE & a) {
VEC_TYPE retval = a;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
a.insert(i, a[i] - 1);
}
return retval;
}
// MPOSTDEC
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE postfixDecrement(MASK_TYPE const & mask, VEC_TYPE & a) {
VEC_TYPE retval = a;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) a.insert(i, a[i] - 1);
}
return retval;
}
// PREFDEC
template<typename VEC_TYPE>
inline VEC_TYPE & prefixDecrement(VEC_TYPE & a) {
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
a.insert(i, a[i]-1 );
}
return a;
}
// MPREFDEC
template<typename VEC_TYPE, typename MASK_TYPE>
inline VEC_TYPE & prefixDecrement(MASK_TYPE const & mask, VEC_TYPE & a) {
for(uint32_t i = 0; i < VEC_TYPE::length(); i++) {
if(mask[i] == true) a.insert(i, a[i]-1 );
}
return a;
}
// MULV
template<typename VEC_TYPE>
inline VEC_TYPE mult (VEC_TYPE const & a, VEC_TYPE const & b) {
UME_EMULATION_WARNING();
VEC_TYPE retval;
for(uint32_t i = 0; i < VEC_TYPE::length(); i++)
{
retval.insert(i, a[i]*b[i] );
}
return retval;
}