-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFresh.hs
executable file
·259 lines (219 loc) · 7.72 KB
/
Fresh.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
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
{- |
Provides a Monad to maintain the state of the analyzer.
Mainly used for unique name generation.
-}
module Fresh where
import ImpConfig(Flags,showDebugMSG,showDRE,outputFile)
import MyPrelude
------------------------------------------
import System.CPUTime(getCPUTime)
import System.IO(hFlush,stdout,Handle)
import System.IO.Unsafe(unsafePerformIO)
import Control.Monad(when,foldM,ap)
import Text.Regex(mkRegexWithOpts,matchRegex)
-------FS Fresh---------------------------
data St = MkState {
cnt :: Integer, -- ^Used for unique name generation.
omegaStrs :: [String], -- ^Strings to be printed in the log file. Kept in reverse order, so that adding a string is fast (to the front of the list).
flags:: Flags, -- ^ Set of flags read from the command-line.
safePrimChecks:: Int,
unsafePrimChecks:: Int,
safeUserChecks:: Int,
unsafeUserChecks:: Int
}
newtype FS a = FS (St -> IO (St,a))
instance Monad FS where
-- return :: a -> FS a
return a = FS (\st -> return (st, a))
(FS a) >>= f =
FS (\st ->
(a st) >>= \(st', a') ->
let (FS b) = (f a') in
(b st') >>= \(st'',b') ->
return (st'',b'))
instance Applicative FS where
pure = return
(<*>) = ap
instance Functor FS where
-- fmap:: (a->b) -> FS a -> FS b
fmap f (FS stFunction) = FS (\n -> stFunction n >>= \(n1,a) -> return (n1,f a))
runFS:: St -> FS a -> IO a
runFS state (FS a) =
a state >>= \(finalState,result) ->
let strs = reverse (omegaStrs finalState) in
let outFile = outputFile (flags finalState) ++ ".omega" in
let str = concatSepBy "\n" strs in
-- putStrLn ("# Hello1") >>
-- putStrLn ("length of string") >>
-- putStrLn ("length"++(show (length str))) >>
writeFile outFile str >>
-- putStrLn ("# Hello2") >>
return result
initialState:: Flags -> St
initialState fs = MkState{cnt=0,omegaStrs=[],flags=fs, safePrimChecks=0, unsafePrimChecks=0, safeUserChecks=0, unsafeUserChecks=0}
fresh:: FS String
fresh = FS (\st -> return (st{cnt = (cnt st) + 1},"f_" ++ show (cnt st)))
freshVar:: FS String
freshVar = FS (\st -> return (st{cnt = (cnt st) + 1},"v_" ++ show (cnt st)))
freshLabel:: FS String
freshLabel = FS (\st -> return (st{cnt = (cnt st) + 1},"l_" ++ show (cnt st)))
takeFresh:: Int -> FS [String]
takeFresh 0 = return []
takeFresh n = fresh >>= \fsh ->
takeFresh (n-1) >>= \fshs -> return $ fsh:fshs
addOmegaStr:: String -> FS ()
addOmegaStr s =
getFlags >>= \flags ->
when ((showDebugMSG flags)>=5) (addOmegaS s) >>
return ()
addOmegaS:: String -> FS ()
addOmegaS newStr =
FS (\st -> return (st{omegaStrs=(newStr:omegaStrs st)},()))
-- writeOmegaStrs:: FS ()
-- writeOmegaStrs =
-- getFlags >>= \flags ->
-- let outFile = outputFile flags ++ ".omega" in
-- getOmegaStrs >>= \strs ->
-- let str = concatSepBy "\n" strs in
-- FS (\st -> writeFile outFile str >> return (st,()))
-- where
-- getOmegaStrs:: FS [String]
-- getOmegaStrs = FS (\st -> return (st,reverse (omegaStrs st)))
getFlags:: FS Flags
getFlags = FS (\st -> return (st,flags st))
getDRE:: FS (Maybe String)
getDRE =
getFlags >>= \flags ->
return (showDRE flags)
incSafePrimChecks:: FS ()
incSafePrimChecks = FS (\st -> return (st{safePrimChecks = (safePrimChecks st) + 1},()))
getSafePrimChecks:: FS Int
getSafePrimChecks = FS (\st -> return (st,safePrimChecks st))
incUnsafePrimChecks:: FS ()
incUnsafePrimChecks = FS (\st -> return (st{unsafePrimChecks = (unsafePrimChecks st) + 1},()))
getUnsafePrimChecks:: FS Int
getUnsafePrimChecks = FS (\st -> return (st,unsafePrimChecks st))
incSafeUserChecks:: FS ()
incSafeUserChecks = FS (\st -> return (st{safeUserChecks = (safeUserChecks st) + 1},()))
getSafeUserChecks:: FS Int
getSafeUserChecks = FS (\st -> return (st,safeUserChecks st))
incUnsafeUserChecks:: FS ()
incUnsafeUserChecks = FS (\st -> return (st{unsafeUserChecks = (unsafeUserChecks st) + 1},()))
getUnsafeUserChecks:: FS Int
getUnsafeUserChecks = FS (\st -> return (st,unsafeUserChecks st))
putStrFS :: String -> FS ()
putStrFS str = FS (\st -> putStrLn str >> return (st,()))
putStrFS_debug :: String -> FS ()
putStrFS_debug s =
getFlags >>= \flags ->
when (showDebugMSG flags>=100) (putStrFS ("DEBUG:"++s)) >>
return ()
print_DD :: Bool -> Int -> [(String,String)] -> FS ()
print_DD flag dno lst =
if flag
then
foldM (\ _ (a,b)->
putStrFS_DD dno (a++":"++b)
) () lst
else
return ()
print_RES :: String -> Int -> [(String,String)] -> FS ()
print_RES str dno lst =
getDRE >>= \dre ->
let new_dno = case dre of {
Nothing -> dno;
Just pattern ->
-- use RegExp to match from the beginning of lines
let new_pattern = "^"++pattern in
let regex = mkRegexWithOpts new_pattern True True in
case (matchRegex regex str) of {
Just _ -> -100;
Nothing -> dno
}}
in
putStrFS_DD new_dno (">>>>>>>>"++str++">>>>>>>>") >>
print_DD True new_dno lst
-- >>
-- putStrFS_DD dno ("<<<<<<<<"++str++"<<<<<<<<")
-- print exact if d is negative; otherwise print when exceed
putStrFS_DD:: Int -> String -> FS ()
putStrFS_DD d s =
getFlags >>= \flags ->
let m = showDebugMSG flags in
let (flag,str)=
if d<0 then
if d==(-100) then (True,"DEBUG:")
else (m==d,"EXACT:")
else if m>50 then (d>=m,"DD_"++":")
else if m<10 then (m>=d,"")
else if d>=50 then (True,"DD_"++(show d)++":")
else (m>=d,"")
-- -v:10-50 (for details + all tracing + omega)
-- -v:1-9 (for details only)
-- -v:51.. (for tracing only)
-- -v:-1 (minimal tracing)
-- -v:-2..(exact tracing only)
-- -v=-100 (always print for info)
in
when flag (putStrFS (str++s)) >>
return ()
putStrFSOpt:: String -> FS ()
putStrFSOpt str =
getFlags >>= \flags ->
if (showDebugMSG flags>=0)
then putStrFS str
else return ()
-- FS (\st -> return (st,()))
putStrNoLnFSOpt:: String -> FS ()
putStrNoLnFSOpt str =
getFlags >>= \flags ->
if (showDebugMSG flags>=0)
then putStrNoLnFS str
else return ()
putStrNoLnFS:: String -> FS ()
putStrNoLnFS str = FS (\st -> putStr str >> return (st,()))
getLineFS:: FS String
getLineFS = FS (\st -> getLine >>= \str -> return (st,str))
hFlushStdoutFS:: FS ()
hFlushStdoutFS = FS (\st -> hFlush stdout >> return (st,()))
getCPUTimeFS:: FS Integer
getCPUTimeFS = FS (\st -> getCPUTime >>= \t -> return (st,t))
---------For Debugging-------------------
---- empty state of the monad contains counter 0 and empty program
--emptyST:: St
--emptyST = MkState{cnt=0,prog=Prog [] []}
--
---- uses the empty state to run the Monad function
--runFSEmpty:: Show a => FS a -> a
--runFSEmpty (FS a) = snd (a emptyST)
-------Example: starting FS Monad------
--type Prog = String
--typeCheck:: Prog -> String
--typeCheck p = runFS MkState{cnt=0,prog=p} _typeCheck
-- where
-- _typeCheck :: FS String
-- _typeCheck = getProg >>= \p ->
-- fresh >>= \f ->
-- return $ f
{- freshTy with do mapM and fmap
freshTy:: AnnTy -> FS AnnTy
freshTy ty = case ty of
AnnPrimTy (ty,_) -> fresh >>= \fsh -> return $ AnnPrimTy (ty,Just fsh)
AnnArrTy (ty,_) annPrims -> do
fsh <- fresh
fshTys <-
mapM (\ty ->
fmap (\(AnnPrimTy t) -> t) (freshTy (AnnPrimTy ty))
) annPrims
return $ AnnArrTy (ty,Just (AnnElem fsh)) fshTys
_ -> error $ "what other type to freshen up besides AnnPrimTy and AnnArrTy?"
-}
{- freshTy without do notation
freshTy:: AnnTy -> FS AnnTy
freshTy ty = case ty of
AnnPrimTy (ty,_) -> fresh >>= \fsh -> return $ AnnPrimTy (ty,Just fsh)
AnnArrTy (ty,_) annPrims ->
fresh >>= \fsh ->
mapM (\(ty,_) -> fresh >>= \fsh -> return (ty,Just fsh)) annPrims >>= \fshTys ->
return $ AnnArrTy (ty,Just (AnnElem fsh)) fshTys
-}