-
Notifications
You must be signed in to change notification settings - Fork 35
/
LLVM_intrinsics.jl
762 lines (681 loc) · 22.4 KB
/
LLVM_intrinsics.jl
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
# LLVM operations and intrinsics
module Intrinsics
# Note, that in the functions below, some care needs to be taken when passing
# Julia Bools to LLVM. Julia passes Bools as LLVM i8 but expect them to only
# have the last bit as non-zero. Failure to comply with this can give weird errors
# like false !== false where the first false is the result of some computation.
# Note, no difference is made between Julia usigned integers and signed integers
# when passed to LLVM. It is up to the caller to make sure that the correct
# intrinsic is called (e.g uitofp vs sitofp).
import ..SIMD: SIMD, VE, LVec, FloatingTypes
# Inlcude Bool in IntegerTypes
const IntegerTypes = Union{SIMD.IntegerTypes, Bool}
const d = Dict{DataType, String}(
Bool => "i8",
Int8 => "i8",
Int16 => "i16",
Int32 => "i32",
Int64 => "i64",
Int128 => "i128",
UInt8 => "i8",
UInt16 => "i16",
UInt32 => "i32",
UInt64 => "i64",
UInt128 => "i128",
#Float16 => "half",
Float32 => "float",
Float64 => "double",
)
# Add the Ptr translations
foreach(x -> (d[Ptr{x}] = d[Int]), collect(keys(d)))
# LT = LLVM Type (scalar and vectors), we keep type names intentionally short
# to make the signatures smaller
const LT{T} = Union{LVec{<:Any, T}, T}
suffix(N::Integer, ::Type{Ptr{T}}) where {T} = "v$(N)p0$(T<:IntegerTypes ? "i" : "f")$(8*sizeof(T))"
suffix(N::Integer, ::Type{T}) where {T} = "v$(N)$(T<:IntegerTypes ? "i" : "f")$(8*sizeof(T))"
suffix(::Type{T}) where {T} = "$(T<:IntegerTypes ? "i" : "f")$(8*sizeof(T))"
dotit(f) = replace(string(f), "_" => ".")
llvm_name(llvmf, N, T) = string("llvm", ".", dotit(llvmf), ".", suffix(N, T))
llvm_name(llvmf, ::Type{LVec{N, T}}) where {N,T} = string("llvm", ".", dotit(llvmf), ".", suffix(N, T))
llvm_name(llvmf, ::Type{T}) where {T} = string("llvm", ".", dotit(llvmf), ".", suffix(T))
llvm_type(::Type{T}) where {T} = d[T]
llvm_type(::Type{LVec{N, T}}) where {N,T} = "< $N x $(d[T])>"
############
# FastMath #
############
module FastMath
const nnan = 1 << 0
const ninf = 1 << 1
const nsz = 1 << 2
const arcp = 1 << 3
const contract = 1 << 4
const afn = 1 << 5
const reassoc = 1 << 6
const fast = 1 << 7
end
struct FastMathFlags{T} end
Base.@pure FastMathFlags(T::Int) = FastMathFlags{T}()
function fp_str(::Type{FastMathFlags{T}}) where {T}
flags = String[]
(T & FastMath.nnan != 0) && push!(flags, "nnan")
(T & FastMath.ninf != 0) && push!(flags, "ninf")
(T & FastMath.nsz != 0) && push!(flags, "nsz")
(T & FastMath.arcp != 0) && push!(flags, "arcp")
(T & FastMath.contract != 0) && push!(flags, "contract")
(T & FastMath.afn != 0) && push!(flags, "afn")
(T & FastMath.reassoc != 0) && push!(flags, "reassoc")
(T & FastMath.fast != 0) && push!(flags, "fast")
return join(flags, " ")
end
fp_str(::Type{Nothing}) = ""
const FPFlags{T} = Union{Nothing, FastMathFlags{T}}
####################
# Unary operators #
####################
const UNARY_INTRINSICS_FLOAT = [
:sqrt
:sin
:cos
:exp
:trunc
:exp2
:log
:log10
:log2
:fabs
:floor
:ceil
:rint
:nearbyint
:round
]
const UNARY_INTRINSICS_INT = [
:bitreverse
:bswap
:ctpop
:ctlz
:cttz
:fshl
:fshr
]
for (fs, c) in zip([UNARY_INTRINSICS_FLOAT, UNARY_INTRINSICS_INT],
[FloatingTypes, IntegerTypes])
for f in fs
@eval begin
@generated function $(f)(x::T) where T<:LT{<:$c}
ff = llvm_name($(QuoteNode(f)), T)
return :(
$(Expr(:meta, :inline));
ccall($ff, llvmcall, T, (T,), x)
)
end
end
end
end
# fneg (not an intrinsic so cannot use `ccall)
@generated function fneg(x::T, ::F=nothing) where {T<:LT{<:FloatingTypes}, F<:FPFlags}
fpflags = fp_str(F)
s = """
%2 = fneg $fpflags $(llvm_type(T)) %0
ret $(llvm_type(T)) %2
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, T, Tuple{T}, x)
)
end
#####################
# Binary operators #
#####################
const BINARY_OPS_FLOAT = [
:fadd
:fsub
:fmul
:fdiv
:frem
]
const BINARY_OPS_INT = [
:add
:sub
:mul
:sdiv
:udiv
:srem
:urem
:shl
:ashr
:lshr
:and
:or
:xor
]
for f in BINARY_OPS_FLOAT
@eval @generated function $f(x::T, y::T, ::F=nothing) where {T<:LT{<:FloatingTypes}, F<:FPFlags}
fpflags = fp_str(F)
ff = $(QuoteNode(f))
s = """
%3 = $ff $fpflags $(llvm_type(T)) %0, %1
ret $(llvm_type(T)) %3
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, T, Tuple{T, T}, x, y)
)
end
end
for f in BINARY_OPS_INT
@eval @generated function $f(x::T, y::T) where T<:LT{<:IntegerTypes}
ff = $(QuoteNode(f))
s = """
%3 = $ff $(llvm_type(T)) %0, %1
ret $(llvm_type(T)) %3
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, T, Tuple{T, T}, x, y)
)
end
end
const BINARY_INTRINSICS_FLOAT = [
:minnum
:maxnum
:minimum
:maximum
:copysign
:pow
:floor
:ceil
:trunc
:rint
:nearbyint
:round
]
const BINARY_INTRINSICS_INT = [
:sadd_sat
:uadd_sat
:ssub_sat
:usub_sat
]
for (fs, c) in zip([BINARY_INTRINSICS_FLOAT, BINARY_INTRINSICS_INT],
[FloatingTypes, IntegerTypes])
for f in fs
@eval @generated function $(f)(x::T, y::T) where T<:LT{<:$c}
ff = llvm_name($(QuoteNode(f)), T,)
return :(
$(Expr(:meta, :inline));
ccall($ff, llvmcall, T, (T, T), x, y)
)
end
end
end
# pow, powi
for (f, c) in [(:pow, FloatingTypes), (:powi, IntegerTypes)]
@eval @generated function $(f)(x::T, y::T2) where {T <: LT{<:FloatingTypes}, T2 <: $c}
ff = llvm_name($(QuoteNode(f)), T)
return :(
$(Expr(:meta, :inline));
ccall($ff, llvmcall, T, (T, T2), x, y)
)
end
end
# Overflow
const OVERFLOW_INTRINSICS = [
:sadd_with_overflow
:uadd_with_overflow
:ssub_with_overflow
:usub_with_overflow
:smul_with_overflow
:umul_with_overflow
]
const SUPPORTS_VEC_OVERFLOW = Base.libllvm_version >= v"9"
for f in OVERFLOW_INTRINSICS
@eval @generated function $f(x::LVec{N, T}, y::LVec{N, T}) where {N, T <: IntegerTypes}
if !SUPPORTS_VEC_OVERFLOW
return :(error("LLVM version 9.0 or greater required (Julia 1.5 or greater)"))
end
ff = llvm_name($(QuoteNode(f)), N, T)
if $(QuoteNode(f)) == :smul_with_overflow && Sys.ARCH == :i686 && T == Int64
str = "this intrinsic ($ff) is broken on i686"
return :(error($str))
end
decl = "declare {<$N x $(d[T])>, <$N x i1>} @$ff(<$N x $(d[T])>, <$N x $(d[T])>)"
# Julia passes Tuple{[U]Int8, Bool} as [2 x i8] so we need to special case that scenario
ret_type = sizeof(T) == 1 ? "[2 x <$N x i8>]" : "{<$N x $(d[T])>, <$N x i8>}"
s = """
%res = call {<$N x $(d[T])>, <$N x i1>} @$ff(<$N x $(d[T])> %0, <$N x $(d[T])> %1)
%plus = extractvalue {<$N x $(d[T])>, <$N x i1>} %res, 0
%overflow = extractvalue {<$N x $(d[T])>, <$N x i1>} %res, 1
%overflow_ext = zext <$(N) x i1> %overflow to <$(N) x i8>
%new_tuple = insertvalue $ret_type undef, <$N x $(d[T])> %plus, 0
%new_tuple_2 = insertvalue $ret_type %new_tuple, <$N x i8> %overflow_ext, 1
ret $ret_type %new_tuple_2
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall(($decl, $s), Tuple{LVec{N, T}, LVec{N, Bool}}, Tuple{LVec{N, T}, LVec{N, T}}, x, y)
)
end
end
# Comparisons
const CMP_FLAGS_FLOAT = [
:false
:oeq
:ogt
:oge
:olt
:ole
:one
:ord
:ueq
:ugt
:uge
:ult
:ule
:une
:uno
:true
]
const CMP_FLAGS_INT = [
:eq
:ne
:sgt
:sge
:slt
:sle
:ugt
:uge
:ult
:ule
]
for flag in CMP_FLAGS_FLOAT
ftot = Symbol(string("fcmp_", flag))
@eval @generated function $ftot(x::LVec{N, T}, y::LVec{N, T}, ::F=nothing) where {N, T <: FloatingTypes, F<:FPFlags}
fpflags = fp_str(F)
fflag = $(QuoteNode(flag))
s = """
%res = fcmp $(fpflags) $(fflag) <$(N) x $(d[T])> %0, %1
%resb = zext <$(N) x i1> %res to <$(N) x i8>
ret <$(N) x i8> %resb
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, LVec{N, Bool}, Tuple{LVec{N, T}, LVec{N, T}}, x, y)
)
end
end
for flag in CMP_FLAGS_INT
ftot = Symbol(string("icmp_", flag))
@eval @generated function $ftot(x::LVec{N, T}, y::LVec{N, T}) where {N, T <: IntegerTypes}
fflag = $(QuoteNode(flag))
s = """
%res = icmp $(fflag) <$(N) x $(d[T])> %0, %1
%resb = zext <$(N) x i1> %res to <$(N) x i8>
ret <$(N) x i8> %resb
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, LVec{N, Bool}, Tuple{LVec{N, T}, LVec{N, T}}, x, y)
)
end
end
#####################
# Ternary operators #
#####################
@generated function select(cond::LVec{N, Bool}, x::LVec{N, T}, y::LVec{N, T}) where {N, T}
s = """
%cond = trunc <$(N) x i8> %0 to <$(N) x i1>
%res = select <$N x i1> %cond, <$N x $(d[T])> %1, <$N x $(d[T])> %2
ret <$N x $(d[T])> %res
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, LVec{N, T}, Tuple{LVec{N, Bool}, LVec{N, T}, LVec{N, T}}, cond, x, y)
)
end
const MULADD_INTRINSICS = [
:fmuladd,
:fma,
]
for f in MULADD_INTRINSICS
@eval @generated function $(f)(a::LVec{N, T}, b::LVec{N, T}, c::LVec{N, T}) where {N, T<:FloatingTypes}
ff = llvm_name($(QuoteNode(f)), N, T)
return :(
$(Expr(:meta, :inline));
ccall($ff, llvmcall, LVec{N, T}, (LVec{N, T}, LVec{N, T}, LVec{N, T}), a, b, c)
)
end
end
################
# Load / store #
################
# These alignment numbers feels a bit dubious
n_align(align, N, T) = align ? N * sizeof(T) : sizeof(T)
temporal_str(temporal) = temporal ? ", !nontemporal !{i32 1}" : ""
@generated function load(x::Type{LVec{N, T}}, ptr::Ptr{T},
::Val{Al}=Val(false), ::Val{Te}=Val(false)) where {N, T, Al, Te}
s = """
%ptr = inttoptr $(d[Int]) %0 to <$N x $(d[T])>*
%res = load <$N x $(d[T])>, <$N x $(d[T])>* %ptr, align $(n_align(Al, N, T)) $(temporal_str(Te))
ret <$N x $(d[T])> %res
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, LVec{N, T}, Tuple{Ptr{T}}, ptr)
)
end
@generated function maskedload(ptr::Ptr{T}, mask::LVec{N,Bool},
::Val{Al}=Val(false), ::Val{Te}=Val(false)) where {N, T, Al, Te}
# TODO: Allow setting the passthru
decl = "declare <$N x $(d[T])> @llvm.masked.load.$(suffix(N, T))(<$N x $(d[T])>*, i32, <$N x i1>, <$N x $(d[T])>)"
s = """
%mask = trunc <$(N) x i8> %1 to <$(N) x i1>
%ptr = inttoptr $(d[Int]) %0 to <$N x $(d[T])>*
%res = call <$N x $(d[T])> @llvm.masked.load.$(suffix(N, T))(<$N x $(d[T])>* %ptr, i32 $(n_align(Al, N, T)), <$N x i1> %mask, <$N x $(d[T])> zeroinitializer)
ret <$N x $(d[T])> %res
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall(($decl, $s), LVec{N, T}, Tuple{Ptr{T}, LVec{N,Bool}}, ptr, mask)
)
end
@generated function store(x::LVec{N, T}, ptr::Ptr{T},
::Val{Al}=Val(false), ::Val{Te}=Val(false)) where {N, T, Al, Te}
s = """
%ptr = inttoptr $(d[Int]) %1 to <$N x $(d[T])>*
store <$N x $(d[T])> %0, <$N x $(d[T])>* %ptr, align $(n_align(Al, N, T)) $(temporal_str(Te))
ret void
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, Cvoid, Tuple{LVec{N, T}, Ptr{T}}, x, ptr)
)
end
@generated function maskedstore(x::LVec{N, T}, ptr::Ptr{T}, mask::LVec{N,Bool},
::Val{Al}=Val(false), ::Val{Te}=Val(false)) where {N, T, Al, Te}
# TODO: Allow setting the passthru
decl = "declare <$N x $(d[T])> @llvm.masked.store.$(suffix(N, T))(<$N x $(d[T])>, <$N x $(d[T])>*, i32, <$N x i1>)"
s = """
%mask = trunc <$(N) x i8> %2 to <$(N) x i1>
%ptr = inttoptr $(d[Int]) %1 to <$N x $(d[T])>*
%res = call <$N x $(d[T])> @llvm.masked.store.$(suffix(N, T))(<$N x $(d[T])> %0, <$N x $(d[T])>* %ptr, i32 $(n_align(Al, N, T)), <$N x i1> %mask)
ret void
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall(($decl, $s), Cvoid, Tuple{LVec{N, T}, Ptr{T}, LVec{N,Bool}}, x, ptr, mask)
)
end
@generated function maskedexpandload(ptr::Ptr{T}, mask::LVec{N,Bool}) where {N, T}
# TODO: Allow setting the passthru
decl = "declare <$N x $(d[T])> @llvm.masked.expandload.$(suffix(N, T))($(d[T])*, <$N x i1>, <$N x $(d[T])>)"
s = """
%mask = trunc <$(N) x i8> %1 to <$(N) x i1>
%ptr = inttoptr $(d[Int]) %0 to $(d[T])*
%res = call <$N x $(d[T])> @llvm.masked.expandload.$(suffix(N, T))($(d[T])* %ptr, <$N x i1> %mask, <$N x $(d[T])> zeroinitializer)
ret <$N x $(d[T])> %res
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall(($decl, $s), LVec{N, T}, Tuple{Ptr{T}, LVec{N, Bool}}, ptr, mask)
)
end
@generated function maskedcompressstore(x::LVec{N, T}, ptr::Ptr{T},
mask::LVec{N,Bool}) where {N, T}
decl = "declare <$N x $(d[T])> @llvm.masked.compressstore.$(suffix(N, T))(<$N x $(d[T])>, $(d[T])*, <$N x i1>)"
s = """
%mask = trunc <$(N) x i8> %2 to <$(N) x i1>
%ptr = inttoptr $(d[Int]) %1 to $(d[T])*
call <$N x $(d[T])> @llvm.masked.compressstore.$(suffix(N, T))(<$N x $(d[T])> %0, $(d[T])* %ptr, <$N x i1> %mask)
ret void
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall(($decl, $s), Cvoid, Tuple{LVec{N, T}, Ptr{T}, LVec{N, Bool}}, x, ptr, mask)
)
end
####################
# Gather / Scatter #
####################
@generated function maskedgather(ptrs::LVec{N,Ptr{T}},
mask::LVec{N,Bool}, ::Val{Al}=Val(false)) where {N, T, Al}
# TODO: Allow setting the passthru
decl = "declare <$N x $(d[T])> @llvm.masked.gather.$(suffix(N, T))(<$N x $(d[T])*>, i32, <$N x i1>, <$N x $(d[T])>)"
s = """
%mask = trunc <$(N) x i8> %1 to <$(N) x i1>
%ptrs = inttoptr <$N x $(d[Int])> %0 to <$N x $(d[T])*>
%res = call <$N x $(d[T])> @llvm.masked.gather.$(suffix(N, T))(<$N x $(d[T])*> %ptrs, i32 $(n_align(Al, N, T)), <$N x i1> %mask, <$N x $(d[T])> zeroinitializer)
ret <$N x $(d[T])> %res
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall(($decl, $s), LVec{N, T}, Tuple{LVec{N, Ptr{T}}, LVec{N, Bool}}, ptrs, mask)
)
end
@generated function maskedscatter(x::LVec{N, T}, ptrs::LVec{N, Ptr{T}},
mask::LVec{N,Bool}, ::Val{Al}=Val(false)) where {N, T, Al}
decl = "declare <$N x $(d[T])> @llvm.masked.scatter.$(suffix(N, T))(<$N x $(d[T])>, <$N x $(d[T])*>, i32, <$N x i1>)"
s = """
%mask = trunc <$(N) x i8> %2 to <$(N) x i1>
%ptrs = inttoptr <$N x $(d[Int])> %1 to <$N x $(d[T])*>
call <$N x $(d[T])> @llvm.masked.scatter.$(suffix(N, T))(<$N x $(d[T])> %0, <$N x $(d[T])*> %ptrs, i32 $(n_align(Al, N, T)), <$N x i1> %mask)
ret void
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall(($decl, $s), Cvoid, Tuple{LVec{N, T}, LVec{N, Ptr{T}}, LVec{N, Bool}}, x, ptrs, mask)
)
end
######################
# LVector Operations #
######################
@generated function extractelement(x::LVec{N, T}, i::I) where {N, T, I <: IntegerTypes}
s = """
%3 = extractelement <$N x $(d[T])> %0, $(d[I]) %1
ret $(d[T]) %3
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, T, Tuple{LVec{N, T}, $i}, x, i)
)
end
@generated function insertelement(x::LVec{N, T}, v::T, i::IntegerTypes) where {N, T}
s = """
%4 = insertelement <$N x $(d[T])> %0, $(d[T]) %1, $(d[i]) %2
ret <$N x $(d[T])> %4
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, LVec{N, T}, Tuple{LVec{N, T}, T, typeof(i)}, x, v, i)
)
end
_shuffle_vec(I) = join((string("i32 ", i == :undef ? "undef" : Int32(i::Integer)) for i in I), ", ")
@generated function shufflevector(x::LVec{N, T}, y::LVec{N, T}, ::Val{I}) where {N, T, I}
shfl = _shuffle_vec(I)
M = length(I)
s = """
%res = shufflevector <$N x $(d[T])> %0, <$N x $(d[T])> %1, <$M x i32> <$shfl>
ret <$M x $(d[T])> %res
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, LVec{$M, T}, Tuple{LVec{N, T}, LVec{N, T}}, x, y)
)
end
@generated function shufflevector(x::LVec{N, T}, ::Val{I}) where {N, T, I}
shfl = _shuffle_vec(I)
M = length(I)
s = """
%res = shufflevector <$(N) x $(d[T])> %0, <$N x $(d[T])> undef, <$M x i32> <$shfl>
ret <$M x $(d[T])> %res
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, LVec{$M, T}, Tuple{LVec{N, T}}, x)
)
end
@generated function constantvector(v::T, y::Type{LVec{N, T}}) where {N, T}
s = """
%2 = insertelement <$N x $(d[T])> undef, $(d[T]) %0, i32 0
%res = shufflevector <$N x $(d[T])> %2, <$N x $(d[T])> undef, <$N x i32> zeroinitializer
ret <$N x $(d[T])> %res
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, LVec{N, T}, Tuple{T}, v)
)
end
#########################
# Conversion Operations #
#########################
const CAST_SIZE_CHANGE_FLOAT = [
(:fptrunc, >)
(:fpext, <)
]
const CAST_SIZE_CHANGE_INT = [
(:trunc, >)
(:zext, <)
(:sext, <)
]
for (fs, c) in zip([CAST_SIZE_CHANGE_FLOAT, CAST_SIZE_CHANGE_INT],
[FloatingTypes, IntegerTypes])
for (f, criteria) in fs
@eval @generated function $f(::Type{LVec{N, T2}}, x::LVec{N, T1}) where {N, T1 <: $c, T2 <: $c}
sT1, sT2 = sizeof(T1) * 8, sizeof(T2) * 8
# Not changing size is not allowed
if !$criteria(sT1, sT2)
return :(error("size of conversion type ($T2: $sT2) must be $($criteria) than the element type ($T1: $sT1)"))
end
ff = $(QuoteNode(f))
s = """
%2 = $ff <$(N) x $(d[T1])> %0 to <$(N) x $(d[T2])>
ret <$(N) x $(d[T2])> %2
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, LVec{N, T2}, Tuple{LVec{N, T1}}, x)
)
end
end
end
const CONVERSION_FLOAT_TO_INT = [
:fptoui,
:fptosi
]
const CONVERSION_INT_TO_FLOAT = [
:uitofp,
:sitofp
]
for (fs, (from, to)) in zip([CONVERSION_FLOAT_TO_INT, CONVERSION_INT_TO_FLOAT],
[(FloatingTypes, IntegerTypes), (IntegerTypes, FloatingTypes)])
for f in fs
@eval @generated function $f(::Type{LVec{N, T2}}, x::LVec{N, T1}) where {N, T1 <: $from, T2 <: $to}
ff = $(QuoteNode(f))
s = """
%2 = $ff <$(N) x $(d[T1])> %0 to <$(N) x $(d[T2])>
ret <$(N) x $(d[T2])> %2
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, LVec{N, T2}, Tuple{LVec{N, T1}}, x)
)
end
end
end
###########
# Bitcast #
###########
@generated function bitcast(::Type{T1}, x::T2) where {T1<:LT, T2<:LT}
sT1, sT2 = sizeof(T1), sizeof(T2)
if sT1 != sT2
return :(error("size of conversion type ($T1: $sT1) must be equal to the vector type ($T2: $sT2)"))
end
s = """
%2 = bitcast $(llvm_type(T2)) %0 to $(llvm_type(T1))
ret $(llvm_type(T1)) %2
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall($s, T1, Tuple{T2}, x)
)
end
##################################
# Horizontal reductions (LLVM 9) #
##################################
const HORZ_REDUCTION_OPS_FLOAT = [
:fmax
:fmin
]
const HORZ_REDUCTION_OPS_INT = [
:and
:or
:mul
:add
:smax
:umax
:smin
:umin
]
for (fs, c) in zip([HORZ_REDUCTION_OPS_FLOAT, HORZ_REDUCTION_OPS_INT],
[FloatingTypes, IntegerTypes])
for f in fs
f_red = Symbol("reduce_", f)
@eval @generated function $f_red(x::LVec{N, T}) where {N,T<:$c}
ff = llvm_name(string("experimental.vector.reduce.", $(QuoteNode(f))), N, T)
decl = "declare $(d[T]) @$ff(<$N x $(d[T])>)"
s2 = """
%res = call $(d[T]) @$ff(<$N x $(d[T])> %0)
ret $(d[T]) %res
"""
return quote
$(Expr(:meta, :inline));
Base.llvmcall($(decl, s2), T, Tuple{LVec{N, T},}, x)
end
end
end
end
# The fadd and fmul reductions take an initializer
horz_reduction_version = Base.libllvm_version < v"9" ? "" : "v2."
for (f, neutral) in [(:fadd, "0.0"), (:fmul, "1.0")]
f_red = Symbol("reduce_", f)
@eval @generated function $f_red(x::LVec{N, T}) where {N,T<:FloatingTypes}
ff = llvm_name(string("experimental.vector.reduce.$horz_reduction_version", $(QuoteNode(f))), N, T)
decl = "declare $(d[T]) @$ff($(d[T]), <$N x $(d[T])>)"
s2 = """
%res = call $(d[T]) @$ff($(d[T]) $($neutral), <$N x $(d[T])> %0)
ret $(d[T]) %res
"""
return quote
$(Expr(:meta, :inline));
Base.llvmcall($(decl, s2), T, Tuple{LVec{N, T},}, x)
end
end
end
# See: https://llvm.org/docs/LangRef.html#id839
@generated function reduce_add(x::LVec{N, Bool}) where {N}
native_bit_width = sizeof(Int) * 8
if N < native_bit_width
ret = """
%res = zext i$(N) %maskipopcnt to i$(native_bit_width)
ret i$(native_bit_width) %res
"""
elseif N == native_bit_width
ret = "ret i$(native_bit_width) %maskipopcnt"
else
ret = """
%res = trunc i$(N) %maskipopcnt to i$(native_bit_width)
ret i$(native_bit_width) %res
"""
end
decl = "declare i$(N) @llvm.ctpop.i$(N)(i$(N))"
s = """
%mask = trunc <$(N) x i8> %0 to <$(N) x i1>
%maski = bitcast <$(N) x i1> %mask to i$(N)
%maskipopcnt = call i$(N) @llvm.ctpop.i$(N)(i$(N) %maski)
$(ret)
"""
return :(
$(Expr(:meta, :inline));
Base.llvmcall(($decl, $s), Int, Tuple{LVec{N, Bool}}, x)
)
end
end