2 -- WARNING: This module is a temporary kludge. It will soon go away entirely (once
3 -- VECTORISE SCALAR pragmas are fully implemented.)
5 -- | Mapping of prelude functions to vectorised versions.
6 -- Functions like filterP currently have a working but naive version in GHC.PArr
7 -- During vectorisation we replace these by calls to filterPA, which are
8 -- defined in dph-common Data.Array.Parallel.Lifted.Combinators
10 -- As renamer only sees the GHC.PArr functions, if you want to add a new function
11 -- to the vectoriser there has to be a definition for it in GHC.PArr, even though
12 -- it will never be used at runtime.
14 module Vectorise.Builtins.Prelude
18 import Vectorise.Builtins.Modules
24 preludeVars :: Modules
25 -> [( Module, FastString -- Maps the original variable to the one in the DPH
26 , Module, FastString)] -- packages that it should be rewritten to.
27 preludeVars (Modules { dph_Combinators = _dph_Combinators
28 , dph_Prelude_Int = dph_Prelude_Int
29 , dph_Prelude_Word8 = dph_Prelude_Word8
30 , dph_Prelude_Double = dph_Prelude_Double
31 , dph_Prelude_Bool = dph_Prelude_Bool
32 , dph_Prelude_PArr = _dph_Prelude_PArr
35 -- Functions that work on whole PArrays, defined in GHC.PArr
36 = [ {- mk gHC_PARR' (fsLit "mapP") dph_Combinators (fsLit "mapPA")
37 , mk gHC_PARR' (fsLit "zipWithP") dph_Combinators (fsLit "zipWithPA")
38 , mk gHC_PARR' (fsLit "zipP") dph_Combinators (fsLit "zipPA")
39 , mk gHC_PARR' (fsLit "unzipP") dph_Combinators (fsLit "unzipPA")
40 , mk gHC_PARR' (fsLit "filterP") dph_Combinators (fsLit "filterPA")
41 , mk gHC_PARR' (fsLit "lengthP") dph_Combinators (fsLit "lengthPA")
42 , mk gHC_PARR' (fsLit "replicateP") dph_Combinators (fsLit "replicatePA")
43 , mk gHC_PARR' (fsLit "!:") dph_Combinators (fsLit "indexPA")
44 , mk gHC_PARR' (fsLit "sliceP") dph_Combinators (fsLit "slicePA")
45 , mk gHC_PARR' (fsLit "crossMapP") dph_Combinators (fsLit "crossMapPA")
46 , mk gHC_PARR' (fsLit "singletonP") dph_Combinators (fsLit "singletonPA")
47 , mk gHC_PARR' (fsLit "concatP") dph_Combinators (fsLit "concatPA")
48 , mk gHC_PARR' (fsLit "+:+") dph_Combinators (fsLit "appPA")
49 , mk gHC_PARR' (fsLit "emptyP") dph_PArray (fsLit "emptyPA")
51 -- Map scalar functions to versions using closures.
52 , -} mk' dph_Prelude_Int "div" "divV"
53 , mk' dph_Prelude_Int "mod" "modV"
54 , mk' dph_Prelude_Int "sqrt" "sqrtV"
55 , mk' dph_Prelude_Int "enumFromToP" "enumFromToPA"
56 -- , mk' dph_Prelude_Int "upToP" "upToPA"
58 ++ vars_Ord dph_Prelude_Int
59 ++ vars_Num dph_Prelude_Int
61 ++ vars_Ord dph_Prelude_Word8
62 ++ vars_Num dph_Prelude_Word8
64 [ mk' dph_Prelude_Word8 "div" "divV"
65 , mk' dph_Prelude_Word8 "mod" "modV"
66 , mk' dph_Prelude_Word8 "fromInt" "fromIntV"
67 , mk' dph_Prelude_Word8 "toInt" "toIntV"
70 ++ vars_Ord dph_Prelude_Double
71 ++ vars_Num dph_Prelude_Double
72 ++ vars_Fractional dph_Prelude_Double
73 ++ vars_Floating dph_Prelude_Double
74 ++ vars_RealFrac dph_Prelude_Double
76 [ mk dph_Prelude_Bool (fsLit "andP") dph_Prelude_Bool (fsLit "andPA")
77 , mk dph_Prelude_Bool (fsLit "orP") dph_Prelude_Bool (fsLit "orPA")
79 , mk gHC_CLASSES (fsLit "not") dph_Prelude_Bool (fsLit "notV")
80 , mk gHC_CLASSES (fsLit "&&") dph_Prelude_Bool (fsLit "andV")
81 , mk gHC_CLASSES (fsLit "||") dph_Prelude_Bool (fsLit "orV")
85 , mk dph_Prelude_PArr (fsLit "fromPArrayP") dph_Prelude_PArr (fsLit "fromPArrayPA")
86 , mk dph_Prelude_PArr (fsLit "toPArrayP") dph_Prelude_PArr (fsLit "toPArrayPA")
87 , mk dph_Prelude_PArr (fsLit "fromNestedPArrayP") dph_Prelude_PArr (fsLit "fromNestedPArrayPA")
88 , mk dph_Prelude_PArr (fsLit "combineP") dph_Combinators (fsLit "combine2PA")
89 , mk dph_Prelude_PArr (fsLit "updateP") dph_Combinators (fsLit "updatePA")
90 , mk dph_Prelude_PArr (fsLit "bpermuteP") dph_Combinators (fsLit "bpermutePA")
91 , mk dph_Prelude_PArr (fsLit "indexedP") dph_Combinators (fsLit "indexedPA")
95 mk' mod v v' = mk mod (fsLit v) mod (fsLit v')
98 = [ mk' mod "==" "eqV"
104 , mk' mod "min" "minV"
105 , mk' mod "max" "maxV"
106 , mk' mod "minimumP" "minimumPA"
107 , mk' mod "maximumP" "maximumPA"
108 , mk' mod "minIndexP" "minIndexPA"
109 , mk' mod "maxIndexP" "maxIndexPA"
113 = [ mk' mod "+" "plusV"
114 , mk' mod "-" "minusV"
115 , mk' mod "*" "multV"
116 , mk' mod "negate" "negateV"
117 , mk' mod "abs" "absV"
118 , mk' mod "sumP" "sumPA"
119 , mk' mod "productP" "productPA"
123 = [ mk' mod "/" "divideV"
124 , mk' mod "recip" "recipV"
128 = [ mk' mod "pi" "pi"
129 , mk' mod "exp" "expV"
130 , mk' mod "sqrt" "sqrtV"
131 , mk' mod "log" "logV"
132 , mk' mod "sin" "sinV"
133 , mk' mod "tan" "tanV"
134 , mk' mod "cos" "cosV"
135 , mk' mod "asin" "asinV"
136 , mk' mod "atan" "atanV"
137 , mk' mod "acos" "acosV"
138 , mk' mod "sinh" "sinhV"
139 , mk' mod "tanh" "tanhV"
140 , mk' mod "cosh" "coshV"
141 , mk' mod "asinh" "asinhV"
142 , mk' mod "atanh" "atanhV"
143 , mk' mod "acosh" "acoshV"
144 , mk' mod "**" "powV"
145 , mk' mod "logBase" "logBaseV"
149 = [ mk' mod "fromInt" "fromIntV"
150 , mk' mod "truncate" "truncateV"
151 , mk' mod "round" "roundV"
152 , mk' mod "ceiling" "ceilingV"
153 , mk' mod "floor" "floorV"
156 preludeScalars :: Modules -> [(Module, FastString)]
157 preludeScalars (Modules { dph_Prelude_Int = dph_Prelude_Int
158 , dph_Prelude_Word8 = dph_Prelude_Word8
159 , dph_Prelude_Double = dph_Prelude_Double
161 = [ mk dph_Prelude_Int "div"
162 , mk dph_Prelude_Int "mod"
163 , mk dph_Prelude_Int "sqrt"
165 ++ scalars_Ord dph_Prelude_Int
166 ++ scalars_Num dph_Prelude_Int
168 ++ scalars_Ord dph_Prelude_Word8
169 ++ scalars_Num dph_Prelude_Word8
171 [ mk dph_Prelude_Word8 "div"
172 , mk dph_Prelude_Word8 "mod"
173 , mk dph_Prelude_Word8 "fromInt"
174 , mk dph_Prelude_Word8 "toInt"
177 ++ scalars_Ord dph_Prelude_Double
178 ++ scalars_Num dph_Prelude_Double
179 ++ scalars_Fractional dph_Prelude_Double
180 ++ scalars_Floating dph_Prelude_Double
181 ++ scalars_RealFrac dph_Prelude_Double
183 mk mod s = (mod, fsLit s)
204 scalars_Fractional mod