-
Notifications
You must be signed in to change notification settings - Fork 2
/
Sylvan.hs
236 lines (173 loc) · 6.89 KB
/
Sylvan.hs
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
module Sylvan where
import Foreign.C.Types
import Foreign.Ptr
import Foreign.Marshal.Array
import Data.Word
import Control.Monad
import Data.Bits
import Control.Monad.Primitive
--Lace
foreign import ccall safe "lace_init"
c_laceInit :: CInt -> CInt -> IO ()
laceInit :: PrimMonad m => Int -> Int -> m ()
laceInit workers deque = unsafePrimToPrim $ c_laceInit (fromIntegral workers) (fromIntegral deque)
foreign import ccall safe "lace_startup"
c_laceStartup :: CInt -> Ptr () -> Ptr () -> IO ()
laceStartup :: PrimMonad m => m ()
laceStartup = unsafePrimToPrim $ c_laceStartup 0 nullPtr nullPtr
--Sylvan
type CBDD = CLLong
newtype BDD = BDD CBDD deriving (Eq, Show)
type CBDDVar = CUInt
type BDDVar = Word32
type CBDDMap = CLLong
newtype BDDMap = BDDMap CBDDMap deriving (Show)
c_sylvanComplement :: CLLong
c_sylvanComplement = 0x8000000000000000
c_sylvanFalse :: CLLong
c_sylvanFalse = 0x0000000000000000
c_sylvanTrue :: CLLong
c_sylvanTrue = c_sylvanFalse .|. c_sylvanComplement
sylvanFalse = BDD c_sylvanFalse
sylvanTrue = BDD c_sylvanTrue
foreign import ccall safe "sylvan_init_mtbdd"
c_sylvanInit :: IO ()
sylvanInit :: PrimMonad m => m ()
sylvanInit = unsafePrimToPrim c_sylvanInit
foreign import ccall safe "sylvan_init_package"
c_sylvanInitPackage :: CInt -> CInt -> CInt -> CInt -> IO ()
sylvanInitPackage :: PrimMonad m => Int -> Int -> Int -> Int -> m ()
sylvanInitPackage tableSize maxSize cacheSize maxCacheSize = unsafePrimToPrim $ c_sylvanInitPackage (fromIntegral tableSize) (fromIntegral maxSize) (fromIntegral cacheSize) (fromIntegral maxCacheSize)
foreign import ccall safe "sylvan_quit"
c_sylvanQuit :: IO ()
sylvanQuit :: PrimMonad m => m ()
sylvanQuit = unsafePrimToPrim c_sylvanQuit
foreign import ccall safe "sylvan_ithvar"
c_ithVar :: CBDDVar -> IO CBDD
ithVar :: PrimMonad m => BDDVar -> m BDD
ithVar var = liftM BDD $ unsafePrimToPrim $ c_ithVar (fromIntegral var)
nithVar :: PrimMonad m => BDDVar -> m BDD
nithVar var = liftM (BDD . xor c_sylvanComplement) $ unsafePrimToPrim $ c_ithVar (fromIntegral var)
foreign import ccall safe "mtbdd_ref"
c_ref :: CBDD -> IO (CBDD)
ref :: PrimMonad m => BDD -> m BDD
ref (BDD bdd) = liftM BDD $ unsafePrimToPrim $ c_ref bdd
refMap :: PrimMonad m => BDDMap -> m BDDMap
refMap (BDDMap bdd) = liftM BDDMap $ unsafePrimToPrim $ c_ref bdd
foreign import ccall safe "mtbdd_deref"
c_deref :: CBDD -> IO ()
deref :: PrimMonad m => BDD -> m ()
deref (BDD bdd) = unsafePrimToPrim $ c_deref bdd
derefMap :: PrimMonad m => BDDMap -> m ()
derefMap (BDDMap bdd) = unsafePrimToPrim $ c_deref bdd
foreign import ccall safe "sylvan_gc_stub"
c_gc :: IO ()
gc :: PrimMonad m => m ()
gc = unsafePrimToPrim $ c_gc
foreign import ccall safe "sylvan_gc_enable"
c_gcEnable :: IO ()
gcEnable :: PrimMonad m => m ()
gcEnable = unsafePrimToPrim c_gcEnable
foreign import ccall safe "sylvan_gc_disable"
c_gcDisable :: IO ()
gcDisable :: PrimMonad m => m ()
gcDisable = unsafePrimToPrim c_gcDisable
neg :: BDD -> BDD
neg (BDD x) = BDD $ xor c_sylvanComplement x
foreign import ccall safe "sylvan_ite_stub"
c_ite :: CBDD -> CBDD -> CBDD -> IO CBDD
ite :: PrimMonad m => BDD -> BDD -> BDD -> m BDD
ite (BDD a) (BDD b) (BDD c) = liftM BDD $ unsafePrimToPrim $ c_ite a b c
foreign import ccall safe "sylvan_xor_stub"
c_xor :: CBDD -> CBDD -> IO CBDD
bxor :: PrimMonad m => BDD -> BDD -> m BDD
bxor (BDD a) (BDD b) = liftM BDD $ unsafePrimToPrim $ c_xor a b
bequiv :: PrimMonad m => BDD -> BDD -> m BDD
bequiv a b = liftM neg $ bxor a b
foreign import ccall safe "sylvan_and_stub"
c_and :: CBDD -> CBDD -> IO CBDD
band :: PrimMonad m => BDD -> BDD -> m BDD
band (BDD a) (BDD b) = liftM BDD $ unsafePrimToPrim $ c_and a b
bor :: PrimMonad m => BDD -> BDD -> m BDD
bor a b = liftM neg $ band (neg a) (neg b)
bnand :: PrimMonad m => BDD -> BDD -> m BDD
bnand a b = liftM neg $ band a b
bnor :: PrimMonad m => BDD -> BDD -> m BDD
bnor a b = liftM neg $ bor a b
bimp :: PrimMonad m => BDD -> BDD -> m BDD
bimp a b = liftM neg $ band a (neg b)
bimpinv :: PrimMonad m => BDD -> BDD -> m BDD
bimpinv a b = liftM neg $ band (neg a) b
biimp :: PrimMonad m => BDD -> BDD -> m BDD
biimp = bequiv
diff :: PrimMonad m => BDD -> BDD -> m BDD
diff a b = band a (neg b)
less :: PrimMonad m => BDD -> BDD -> m BDD
less a b = band (neg a) b
foreign import ccall safe "sylvan_exists_stub"
c_exists :: CBDD -> CBDD -> IO CBDD
exists :: PrimMonad m => BDD -> BDD -> m BDD
exists (BDD a) (BDD variables) = liftM BDD $ unsafePrimToPrim $ c_exists a variables
forall :: PrimMonad m => BDD -> BDD -> m BDD
forall a variables = liftM neg $ exists (neg a) variables
foreign import ccall safe "sylvan_and_exists_stub"
c_and_exists :: CBDD -> CBDD -> CBDD -> IO CBDD
andExists :: PrimMonad m => BDD -> BDD -> BDD -> m BDD
andExists (BDD a) (BDD b) (BDD vars) = liftM BDD $ unsafePrimToPrim $ c_and_exists a b vars
foreign import ccall safe "mtbdd_fromarray"
c_setFromArray :: Ptr CBDDVar -> CSize -> IO CBDD
setFromArray :: PrimMonad m => [BDDVar] -> m BDD
setFromArray vars = liftM BDD $ unsafePrimToPrim $
withArrayLen (map fromIntegral vars) $ \l p ->
c_setFromArray p (fromIntegral l)
mapEmpty :: BDDMap
mapEmpty = BDDMap c_sylvanFalse
foreign import ccall safe "mtbdd_map_add"
c_mapAdd :: CBDDMap -> CBDDVar -> CBDD -> IO CBDDMap
mapAdd :: PrimMonad m => BDDMap -> BDDVar -> BDD -> m BDDMap
mapAdd (BDDMap m) var (BDD x) = liftM BDDMap $ unsafePrimToPrim $ c_mapAdd m (fromIntegral var) x
foreign import ccall safe "sylvan_compose_stub"
c_compose :: CBDD -> CBDDMap -> IO CBDD
compose :: PrimMonad m => BDD -> BDDMap -> m BDD
compose (BDD f) (BDDMap m) = liftM BDD $ unsafePrimToPrim $ c_compose f m
----TODO: doesnt seem to exist
--foreign import ccall safe "sylvan_report_stats"
-- c_reportStats :: IO ()
--
--reportStats :: PrimMonad m => m ()
--reportStats = unsafePrimToPrim c_reportStats
--
--foreign import ccall safe "sylvan_printdot"
-- c_printDot :: CBDD -> IO ()
--
--printDot :: PrimMonad m => BDD -> m ()
--printDot (BDD x) = unsafePrimToPrim $ c_printDot x
--
----TODO: a macro
--foreign import ccall safe "sylvan_print"
-- c_bddPrint :: CBDD -> IO ()
--
--bddPrint :: PrimMonad m => BDD -> m ()
--bddPrint (BDD x) = unsafePrimToPrim $ c_bddPrint x
--
----TODO: a macro
--foreign import ccall safe "sylvan_printsha"
-- c_printSHA :: CBDD -> IO ()
--
--printSHA :: BDD -> IO ()
--printSHA (BDD x) = unsafePrimToPrim $ c_printSHA x
foreign import ccall safe "sylvan_cube"
c_cube :: CBDD -> Ptr CUChar -> IO CBDD
data Polarity =
Negative
| Positive
| DontCare
deriving (Show)
polarityToInt :: Integral i => Polarity -> i
polarityToInt Negative = 0
polarityToInt Positive = 1
polarityToInt DontCare = 2
cube :: PrimMonad m => BDD -> [Polarity] -> m BDD
cube (BDD vars) polarities = liftM BDD $ unsafePrimToPrim $
withArrayLen (map polarityToInt polarities) $ \_ pp ->
c_cube vars pp