summaryrefslogtreecommitdiff
path: root/src/Grasp/Monad.hs
blob: e35cc342f31ddd1e1db1b6ec79793144455248f5 (plain)
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
module Grasp.Monad (
    GraspM,

    construct,
    finalise,

    getReadHandle,
    getWriteHandle,

    updateIP,
    pushIP,
    popIP,
    peekIP,
    nextIP,

    nodesOut, edgesOut, edgesIn,
    reLabel,
    nodesWithName,
    subGraph,
    newNodes,
    insNode, insNodes,
    delNode, delNodes,
    insEdge, insEdges,
    delEdge, delEdges
    ) where




import System.IO( Handle, FilePath, IOMode )
import qualified System.IO as IO

import qualified System.Random as Random

import Control.Monad.Trans.State.Lazy( StateT )
import qualified Control.Monad.Trans.State.Lazy as State

import qualified Control.Monad as Monad

import Control.Monad.IO.Class( liftIO )

import qualified Data.Maybe as Maybe

import Data.List( (\\) )
import qualified Data.List as List

import Data.Map( Map )
import qualified Data.Map as Map

import Grasp.Graph( Node, LNode, LEdge, Gr, (&) )
import qualified Grasp.Graph as Graph

import Grasp.Types.IP( IP )
import qualified Grasp.Types.IP as IP

import Grasp.Types.GNode( GNode )
import qualified Grasp.Types.GNode as GN

import Grasp.Types.GEdge( GEdge )
import qualified Grasp.Types.GEdge as GE

import Grasp.Types.Instruction( Instruction )
import qualified Grasp.Types.Instruction as IN

import Grasp.Types.EdgeLabel( EdgeLabel )
import qualified Grasp.Types.EdgeLabel as EL




type GraspM a = StateT (Gr Instruction EdgeLabel, [IP], Map FilePath Handle) IO a





-- wrapping and unwrapping


construct :: ([GNode],[GEdge]) -> GraspM ()
construct (ns,es) = do
    Monad.when (multiNodes ns) (error "node declared multiple times")
    Monad.when (unconnected ns es) (error "unconnected edge")
    Monad.when (multiNames ns es) (error "node with multiple names")
    Monad.when (numericName ns es) (error "node with a numeric name")
    Monad.when (noMain ns es) (error "could not find grasp:main")

    let graph = Graph.mkGraph (map GN.toLNode ns) (map GE.toLEdge es)
        ips = map IP.singleton (getNodesWithName ns es "grasp:main")
        handles = Map.empty

    State.put (graph, ips, handles)



finalise :: GraspM () -> IO ([GNode],[GEdge])
finalise s = do
    (gr, ips, fh) <- State.execStateT s (Graph.empty, [], Map.empty)
    (mapM_ IO.hClose) . Map.elems $ fh
    let (nodes, edges) = (Graph.labNodes gr, Graph.labEdges gr)
    return (map GN.mk nodes, map GE.mk edges)





-- internally used functions


-- fix this later so it doesn't required unconnected edge checking first
nameNodeList :: [GNode] -> [GEdge] -> [(GNode,GNode)]
nameNodeList ns es =
    let nameEdges = filter ((== (EL.mk "name")) . GE.toLabel) es
        findNode n = Maybe.fromJust (List.find ((== n) . GN.toNode) ns)
    in map (\x -> (findNode (GE.toSrc x), findNode (GE.toDest x))) nameEdges



getNodesWithName :: [GNode] -> [GEdge] -> String -> [GNode]
getNodesWithName ns es name =
    (map fst) . (filter (\x -> (GN.toInst . snd $ x) == (IN.mk name))) $ (nameNodeList ns es)



getNamedNodes :: [GNode] -> [GEdge] -> [GNode]
getNamedNodes ns es = map fst (nameNodeList ns es)





-- error checking when setting up


multiNodes :: [GNode] -> Bool
multiNodes ns = (ns /= (List.nubBy (\x y -> GN.toNode x == GN.toNode y) ns))



unconnected :: [GNode] -> [GEdge] -> Bool
unconnected ns es =
    let nodeList = map GN.toNode ns
        unconnectedEdges = filter (\x -> GE.toSrc x `notElem` nodeList || GE.toDest x `notElem` nodeList) es
    in unconnectedEdges /= []



multiNames :: [GNode] -> [GEdge] -> Bool
multiNames ns es =
    let named = map fst (nameNodeList ns es)
    in named /= (List.nub named)



numericName :: [GNode] -> [GEdge] -> Bool
numericName ns es =
    let names = map snd (nameNodeList ns es)
    in any (\x -> Maybe.isJust (IN.toFloat (GN.toInst x))) names



noMain :: [GNode] -> [GEdge] -> Bool
noMain ns es =
    let names = map snd (nameNodeList ns es)
        mains = filter ((== (IN.mk "grasp:main")) . GN.toInst) names
    in length mains == 0





-- garbage collection


garbageCollect :: Gr Instruction EdgeLabel -> [IP] -> Gr Instruction EdgeLabel
garbageCollect gr ips =
    let unreachable = (Graph.nodes gr) \\ (reachable gr ips)
    in Graph.delNodes unreachable gr



reachable :: Gr Instruction EdgeLabel -> [IP] -> [Node]
reachable gr ips =
    let named = getNamedNodes (map GN.mk (Graph.labNodes gr)) (map GE.mk (Graph.labEdges gr))
        ipNodes = concatMap IP.toList ips
        start = (map GN.toNode) . List.nub $ named ++ ipNodes
    in reach gr start []



reach :: Gr Instruction EdgeLabel -> [Node] -> [Node] -> [Node]
reach _ [] f = f
reach gr (x:xs) f =
    let f' = List.nub (x:f)
        x' = List.nub (xs ++ (Graph.suc gr x))
        gr' = Graph.delNode x gr
    in reach gr' x' f'





-- I/O


getWriteHandle :: FilePath -> GraspM Handle
getWriteHandle path = do
    (gr, ips, fh) <- State.get

    case (Map.lookup path fh) of
        Nothing -> do
            h <- liftIO (IO.openFile path IO.AppendMode)
            State.put (gr, ips, (Map.insert path h fh))
            return h

        Just x -> do
            w <- liftIO (IO.hIsWritable x)
            if (not w) then do
                liftIO (IO.hClose x)
                h <- liftIO (IO.openFile path IO.AppendMode)
                State.put (gr, ips, (Map.insert path h fh))
                return h
            else return x



getReadHandle :: FilePath -> GraspM Handle
getReadHandle path = do
    (gr, ips, fh) <- State.get

    case (Map.lookup path fh) of
        Nothing -> do
            h <- liftIO (IO.openFile path IO.ReadMode)
            State.put (gr, ips, (Map.insert path h fh))
            return h

        Just x -> do
            r <- liftIO (IO.hIsReadable x)
            if (not r) then do
                liftIO (IO.hClose x)
                h <- liftIO (IO.openFile path IO.ReadMode)
                State.put (gr, ips, (Map.insert path h fh))
                return h
            else return x





-- manipulating the instruction pointers


updateIP :: GraspM ()
updateIP = do
    (gr, ips, fh) <- State.get
    curNode <- peekIP
    Monad.when (Maybe.isJust curNode) (do
        nexts <- nodesOut (EL.mk "next") (Maybe.fromJust curNode)
        r <- liftIO (Random.getStdRandom (Random.randomR (0, length nexts - 1)))

        let updated = if (length nexts == 0) then IP.empty else IP.shift (nexts !! r) (head ips)
            ips' = updated:(tail ips)

        State.put (gr, ips', fh) )



pushIP :: GNode -> GraspM ()
pushIP n = do
    (gr, ips, fh) <- State.get
    let ips' = if (length ips == 0) then [] else (IP.push n (head ips)):(tail ips)
    State.put (gr, ips', fh)



popIP :: GraspM ()
popIP = do
    (gr, ips, fh) <- State.get
    let ips' = if (length ips == 0) then [] else (IP.pop (head ips)):(tail ips)
    State.put (gr, ips', fh)



peekIP :: GraspM (Maybe GNode)
peekIP = do
    (gr, ips, fh) <- State.get
    if (length ips == 0) then return Nothing else return (IP.peek (head ips))



nextIP :: GraspM ()
nextIP = do
    (gr, ips, fh) <- State.get
    let ips' = if (length ips == 0)
                then []
                else if (IP.isEmpty (head ips))
                        then tail ips
                        else (tail ips) ++ [head ips]
        gr' = garbageCollect gr ips'
    State.put (gr', ips', fh)





-- accessing and manipulating the graph


nodesOut :: EdgeLabel -> GNode -> GraspM [GNode]
nodesOut s n = do
    (gr, ips, fh) <- State.get
    curNode <- peekIP

    let nout = Graph.lsuc gr (GN.toNode (Maybe.fromJust curNode))
        filtered = filter ((== s) . snd) nout
        result = map (\(x,y) -> GN.mk (x, Maybe.fromJust (Graph.lab gr x))) filtered

    if (Maybe.isNothing curNode) then return [] else return result



edgesOut :: GNode -> GraspM [GEdge]
edgesOut n = do
    (gr, ips, fh) <- State.get
    curNode <- peekIP

    let eout = Graph.out gr (GN.toNode (Maybe.fromJust curNode))
        result = map GE.mk eout

    if (Maybe.isNothing curNode) then return [] else return result



edgesIn :: GNode -> GraspM [GEdge]
edgesIn n = do
    (gr, ips, fh) <- State.get
    curNode <- peekIP

    let ein = Graph.inn gr (GN.toNode (Maybe.fromJust curNode))
        result = map GE.mk ein

    if (Maybe.isNothing curNode) then return [] else return result



reLabel :: Instruction -> GNode -> GraspM ()
reLabel i n = do
    (gr, ips, fh) <- State.get

    let (mc, d) = Graph.match (GN.toNode n) gr
        c = Maybe.fromJust mc
        c' = (\(w,x,y,z) -> (w,x,i,z)) $ c

    Monad.when (Maybe.isJust mc) (State.put ((c' & d) ,ips, fh))



nodesWithName :: Instruction -> GraspM [GNode]
nodesWithName x = do
    (gr, ips, fh) <- State.get
    let ns = map GN.mk (Graph.labNodes gr)
        es = map GE.mk (Graph.labEdges gr)
    return (getNodesWithName ns es (IN.toString x))



subGraph :: GNode -> GraspM ([GNode],[GEdge])
subGraph n = do
    (gr, ips, fh) <- State.get
    let rNodes = reach gr [GN.toNode n] []
        rEdges = filter (\(x,y,z) -> x `elem` rNodes && y `elem` rNodes) (Graph.labEdges gr)
        result = (map (\x -> GN.mk (x, Maybe.fromJust (Graph.lab gr x))) rNodes, map GE.mk rEdges)
    return result



newNodes :: [Instruction] -> GraspM [GNode]
newNodes is = do
    (gr, ips, fh) <- State.get
    let newNs = Graph.newNodes (length is) gr
        newGNs = map GN.mk (zip newNs is)
    return newGNs



insNode :: GNode -> GraspM ()
insNode n = do
    (gr, ips, fh) <- State.get
    let gr' = Graph.insNode (GN.toLNode n) gr
    State.put (gr', ips, fh)



insNodes :: [GNode] -> GraspM ()
insNodes ns = do
    (gr, ips, fh) <- State.get
    let gr' = Graph.insNodes (map GN.toLNode ns) gr
    State.put (gr', ips, fh)



delNode :: GNode -> GraspM ()
delNode n = do
    (gr, ips, fh) <- State.get
    let gr' = Graph.delNode (GN.toNode n) gr
    State.put (gr', ips, fh)



delNodes :: [GNode] -> GraspM ()
delNodes ns = do
    (gr, ips, fh) <- State.get
    let gr' = Graph.delNodes (map GN.toNode ns) gr
    State.put (gr', ips, fh)



insEdge :: GEdge -> GraspM ()
insEdge e = do
    (gr, ips, fh) <- State.get
    let gr' = Graph.insEdge (GE.toLEdge e) gr
    State.put (gr', ips, fh)



insEdges :: [GEdge] -> GraspM ()
insEdges es = do
    (gr, ips, fh) <- State.get
    let gr' = Graph.insEdges (map GE.toLEdge es) gr
    State.put (gr', ips, fh)



delEdge :: GEdge -> GraspM ()
delEdge e = do
    (gr, ips, fh) <- State.get
    let gr' = Graph.delLEdge (GE.toLEdge e) gr
    State.put (gr', ips, fh)



delEdges :: [GEdge] -> GraspM ()
delEdges es = do
    (gr, ips, fh) <- State.get
    let gr' = List.foldl' (flip Graph.delLEdge) gr (map GE.toLEdge es)
    State.put (gr', ips, fh)