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
|
module Grasp.Monad (
GraspM,
construct,
finalise,
getReadHandle,
getWriteHandle
) where
import System.IO( Handle, FilePath, IOMode )
import qualified System.IO as IO
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 Text.Read( readMaybe )
import qualified Data.Maybe as Maybe
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.IP( IP )
import qualified Grasp.IP as IP
import Grasp.Types( Instruction(..), EdgeLabel(..), GNode(..), GEdge(..) )
import qualified Grasp.Types as Types
type GraspM a = StateT GraspProgram IO a
data GraspProgram = GraspProgram { programGraph :: Gr Instruction EdgeLabel
, instPtrs :: [IP]
, fileHandles :: Map FilePath Handle }
deriving (Show, Eq)
construct :: ([GNode],[GEdge]) -> GraspM ()
construct (n,e) = do
Monad.when (multiNodes n) (error "node declared multiple times")
Monad.when (unconnected n e) (error "unconnected edge")
Monad.when (multiNames n e) (error "node with multiple names")
Monad.when (numericName n e) (error "node with a numeric name")
Monad.when (noMain n e) (error "could not find grasp:main")
let graph = Graph.mkGraph (map toLNode n) (map toLEdge e)
ips = map IP.singleton (nodesWithName n e "grasp:main")
handles = Map.empty
State.put (GraspProgram graph ips handles)
finalise :: GraspM () -> IO ([GNode],[GEdge])
finalise s = do
p <- State.execStateT s (GraspProgram Graph.empty [] Map.empty)
(mapM_ IO.hClose) . Map.elems . fileHandles $ p
let gr = programGraph p
(nodes, edges) = (Graph.labNodes gr, Graph.labEdges gr)
return (map GNode nodes, map GEdge edges)
toLNode :: GNode -> LNode Instruction
toLNode n = (Types.gnode n, Types.gninst n)
toLEdge :: GEdge -> LEdge EdgeLabel
toLEdge e = (Types.gefrom e, Types.geto e, Types.gelabel e)
multiNodes :: [GNode] -> Bool
multiNodes ns = (ns == (List.nubBy (\x y -> Types.gnode x == Types.gnode y) ns))
unconnected :: [GNode] -> [GEdge] -> Bool
unconnected ns es =
let nodeList = map Types.gnode ns
unconnectedEdges = filter (\x -> Types.gefrom x `notElem` nodeList || Types.geto 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)
test (Instruction x) = readMaybe x :: Maybe Float
in any (\x -> Maybe.isJust (test (Types.gninst x))) names
noMain :: [GNode] -> [GEdge] -> Bool
noMain ns es =
let names = map snd (nameNodeList ns es)
mains = filter ((== (Instruction "grasp:main")) . Types.gninst) names
in length mains /= 0
getWriteHandle :: FilePath -> GraspM Handle
getWriteHandle path = do
program <- State.get
let (gr, ptrs, handles) = ((programGraph program), (instPtrs program), (fileHandles program))
case (Map.lookup path handles) of
Nothing -> do
h <- liftIO (IO.openFile path IO.AppendMode)
State.put (GraspProgram gr ptrs (Map.insert path h handles))
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 (GraspProgram gr ptrs (Map.insert path h handles))
return h
else return x
getReadHandle :: FilePath -> GraspM Handle
getReadHandle path = do
program <- State.get
let (gr, ptrs, handles) = ((programGraph program), (instPtrs program), (fileHandles program))
case (Map.lookup path (fileHandles program)) of
Nothing -> do
h <- liftIO (IO.openFile path IO.ReadMode)
State.put (GraspProgram gr ptrs (Map.insert path h handles))
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 (GraspProgram gr ptrs (Map.insert path h handles))
return h
else return x
-- fix this later so it doesn't required unconnected edge checking first
nameNodeList :: [GNode] -> [GEdge] -> [(GNode,GNode)]
nameNodeList ns es =
let nameEdges = filter ((== (EdgeLabel "name")) . Types.gelabel) es
findNode n = Maybe.fromJust (List.find ((== n) . Types.gnode) ns)
in map (\x -> (findNode (Types.gefrom x), findNode (Types.geto x))) nameEdges
nodesWithName :: [GNode] -> [GEdge] -> String -> [GNode]
nodesWithName ns es name =
(map fst) . (filter (\x -> (Types.gninst . snd $ x) == (Instruction name))) $ (nameNodeList ns es)
|
