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
|
-- WARNING: This module is a temporary kludge. It will soon go away entirely (once
-- VECTORISE SCALAR pragmas are fully implemented.)
-- | Mapping of prelude functions to vectorised versions.
-- Functions like filterP currently have a working but naive version in GHC.PArr
-- During vectorisation we replace these by calls to filterPA, which are
-- defined in dph-common Data.Array.Parallel.Lifted.Combinators
--
-- As renamer only sees the GHC.PArr functions, if you want to add a new function
-- to the vectoriser there has to be a definition for it in GHC.PArr, even though
-- it will never be used at runtime.
--
module Vectorise.Builtins.Prelude
( preludeVars
, preludeScalars)
where
import Vectorise.Builtins.Modules
import PrelNames
import Module
import FastString
preludeVars :: Modules
-> [( Module, FastString -- Maps the original variable to the one in the DPH
, Module, FastString)] -- packages that it should be rewritten to.
preludeVars (Modules { dph_Combinators = _dph_Combinators
, dph_Prelude_Int = dph_Prelude_Int
, dph_Prelude_Word8 = dph_Prelude_Word8
, dph_Prelude_Double = dph_Prelude_Double
, dph_Prelude_Bool = dph_Prelude_Bool
})
= [
-- Map scalar functions to versions using closures.
mk' dph_Prelude_Int "div" "divV"
, mk' dph_Prelude_Int "mod" "modV"
, mk' dph_Prelude_Int "sqrt" "sqrtV"
, mk' dph_Prelude_Int "enumFromToP" "enumFromToPA"
]
++ vars_Ord dph_Prelude_Int
++ vars_Num dph_Prelude_Int
++ vars_Ord dph_Prelude_Word8
++ vars_Num dph_Prelude_Word8
++
[ mk' dph_Prelude_Word8 "div" "divV"
, mk' dph_Prelude_Word8 "mod" "modV"
, mk' dph_Prelude_Word8 "fromInt" "fromIntV"
, mk' dph_Prelude_Word8 "toInt" "toIntV"
]
++ vars_Ord dph_Prelude_Double
++ vars_Num dph_Prelude_Double
++ vars_Fractional dph_Prelude_Double
++ vars_Floating dph_Prelude_Double
++ vars_RealFrac dph_Prelude_Double
++
[ mk dph_Prelude_Bool (fsLit "andP") dph_Prelude_Bool (fsLit "andPA")
, mk dph_Prelude_Bool (fsLit "orP") dph_Prelude_Bool (fsLit "orPA")
, mk gHC_CLASSES (fsLit "not") dph_Prelude_Bool (fsLit "notV")
, mk gHC_CLASSES (fsLit "&&") dph_Prelude_Bool (fsLit "andV")
, mk gHC_CLASSES (fsLit "||") dph_Prelude_Bool (fsLit "orV")
]
where
mk = (,,,)
mk' mod v v' = mk mod (fsLit v) mod (fsLit v')
vars_Ord mod
= [ mk' mod "==" "eqV"
, mk' mod "/=" "neqV"
, mk' mod "<=" "leV"
, mk' mod "<" "ltV"
, mk' mod ">=" "geV"
, mk' mod ">" "gtV"
, mk' mod "min" "minV"
, mk' mod "max" "maxV"
, mk' mod "minimumP" "minimumPA"
, mk' mod "maximumP" "maximumPA"
, mk' mod "minIndexP" "minIndexPA"
, mk' mod "maxIndexP" "maxIndexPA"
]
vars_Num mod
= [ mk' mod "+" "plusV"
, mk' mod "-" "minusV"
, mk' mod "*" "multV"
, mk' mod "negate" "negateV"
, mk' mod "abs" "absV"
, mk' mod "sumP" "sumPA"
, mk' mod "productP" "productPA"
]
vars_Fractional mod
= [ mk' mod "/" "divideV"
, mk' mod "recip" "recipV"
]
vars_Floating mod
= [ mk' mod "pi" "pi"
, mk' mod "exp" "expV"
, mk' mod "sqrt" "sqrtV"
, mk' mod "log" "logV"
, mk' mod "sin" "sinV"
, mk' mod "tan" "tanV"
, mk' mod "cos" "cosV"
, mk' mod "asin" "asinV"
, mk' mod "atan" "atanV"
, mk' mod "acos" "acosV"
, mk' mod "sinh" "sinhV"
, mk' mod "tanh" "tanhV"
, mk' mod "cosh" "coshV"
, mk' mod "asinh" "asinhV"
, mk' mod "atanh" "atanhV"
, mk' mod "acosh" "acoshV"
, mk' mod "**" "powV"
, mk' mod "logBase" "logBaseV"
]
vars_RealFrac mod
= [ mk' mod "fromInt" "fromIntV"
, mk' mod "truncate" "truncateV"
, mk' mod "round" "roundV"
, mk' mod "ceiling" "ceilingV"
, mk' mod "floor" "floorV"
]
preludeScalars :: Modules -> [(Module, FastString)]
preludeScalars (Modules { dph_Prelude_Int = dph_Prelude_Int
, dph_Prelude_Word8 = dph_Prelude_Word8
, dph_Prelude_Double = dph_Prelude_Double
})
= [ mk dph_Prelude_Int "div"
, mk dph_Prelude_Int "mod"
, mk dph_Prelude_Int "sqrt"
]
++ scalars_Ord dph_Prelude_Int
++ scalars_Num dph_Prelude_Int
++ scalars_Ord dph_Prelude_Word8
++ scalars_Num dph_Prelude_Word8
++
[ mk dph_Prelude_Word8 "div"
, mk dph_Prelude_Word8 "mod"
, mk dph_Prelude_Word8 "fromInt"
, mk dph_Prelude_Word8 "toInt"
]
++ scalars_Ord dph_Prelude_Double
++ scalars_Num dph_Prelude_Double
++ scalars_Fractional dph_Prelude_Double
++ scalars_Floating dph_Prelude_Double
++ scalars_RealFrac dph_Prelude_Double
where
mk mod s = (mod, fsLit s)
scalars_Ord mod
= [ mk mod "=="
, mk mod "/="
, mk mod "<="
, mk mod "<"
, mk mod ">="
, mk mod ">"
, mk mod "min"
, mk mod "max"
]
scalars_Num mod
= [ mk mod "+"
, mk mod "-"
, mk mod "*"
, mk mod "negate"
, mk mod "abs"
]
scalars_Fractional mod
= [ mk mod "/"
, mk mod "recip"
]
scalars_Floating mod
= [ mk mod "pi"
, mk mod "exp"
, mk mod "sqrt"
, mk mod "log"
, mk mod "sin"
, mk mod "tan"
, mk mod "cos"
, mk mod "asin"
, mk mod "atan"
, mk mod "acos"
, mk mod "sinh"
, mk mod "tanh"
, mk mod "cosh"
, mk mod "asinh"
, mk mod "atanh"
, mk mod "acosh"
, mk mod "**"
, mk mod "logBase"
]
scalars_RealFrac mod
= [ mk mod "fromInt"
, mk mod "truncate"
, mk mod "round"
, mk mod "ceiling"
, mk mod "floor"
]
|
