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
|
implementation module Sjit.Compile
import StdEnv
import StdGeneric
import StdMaybe
import StdOverloadedList
import Control.Applicative
import Control.Monad
import Data.Either
from Data.Func import mapSt, $
from Data.Map import :: Map(..), get, put, newMap, fromList
import Sjit.Syntax
import code from "sjit_c."
appendProgram :: !Bool !Program !JITState -> JITState
appendProgram is_main prog jitst
# new_code_ptr = append
jitst.code_start jitst.code_len jitst.code_ptr
jitst.mapping
jitst.n_instr
(encode prog)
is_main
=
{ jitst
& code_ptr = new_code_ptr
, n_instr = jitst.n_instr + size prog
}
where
append :: !Int !Int !Int !Int !Int !{#Int} !Bool -> Int
append _ _ _ _ _ _ _ = code {
ccall jit_append "pIppIAI:p"
}
bootstrap :: (!Program, !CompileState)
bootstrap
# (len_bs, bs_funs) = bootstrap_funs
# is = {i \\ i <- flatten [is \\ (_,is) <- header]}
=
( is,
{ vars = newMap
, funs = fromList bs_funs
, sp = 0
, pc = len_bs
, blocks = [!is!]
, new_block = [!!]
, jitst = appendProgram False is (initJITState 1000)
})
where
bootstrap_funs :: (!Int, ![(String, Int)])
bootstrap_funs = iter 0 header
where
iter :: !Int ![(String, [Instr])] -> (!Int, ![(String, Int)])
iter pc [] = (pc, [])
iter pc [(name,is):rest]
# fun = (name,pc)
# (pc,funs) = iter (pc+length is) rest
= (pc,[fun:funs])
header :: [(!String, ![Instr])]
header =
[ ("_", [PushI 0,Call 0 /* main address */,Halt])
, ("+", [IAddRet])
, ("*", [IMulRet])
, ("-", [ISubRet])
, ("/", [IDivRet])
]
initJITState :: !Int -> JITState
initJITState maxlen
# (code_start,mapping) = init maxlen (maxlen*10)
=
{ n_instr = 0
, code_start = code_start
, code_len = maxlen*10
, code_ptr = code_start
, mapping = mapping
}
where
init :: !Int !Int -> (!Int, !Int)
init _ _ = code {
ccall init_jit "II:Vpp"
}
class toInstrs a :: !a -> [Instr]
instance toInstrs Instr where toInstrs i = [i]
instance toInstrs [a] | toInstrs a where toInstrs xs = [i \\ x <- xs, i <- toInstrs x]
gen :: !newis !CompileState -> m CompileState | Monad m & toInstrs newis
gen newis cs = pure (foldr add cs (toInstrs newis))
where
add i cs = {cs & new_block=[!i:cs.new_block!], sp=sp, pc=cs.pc+1}
where
sp = cs.sp + case i of
PushRef _ -> 1
PushI _ -> 1
Put _ -> -1
Pop n -> 0-n
Call _ -> 1
JmpRelTrue _ -> 0
Ret -> -1
Halt -> -2
IAddRet -> -1
IMulRet -> -1
ISubRet -> -1
IDivRet -> -1
compile :: !Function !CompileState -> Either String CompileState
compile f cs
# cs & funs = put f.fun_name cs.pc cs.funs
# vars = cs.vars
# cs & vars = foldr (uncurry put) cs.vars [(v,sp) \\ v <- f.fun_args & sp <- [cs.sp+1..]]
= case expr f.fun_expr cs of
Left e -> Left e
Right cs
# is = {i \\ i <|- Reverse [!Ret:Put (max 1 (length f.fun_args)+1):cs.new_block!]}
-> Right
{ cs
& vars = vars
, pc = cs.pc+2
, blocks = cs.blocks ++| [!is!]
, new_block = [!!]
, jitst = appendProgram (f.fun_name == "main") is cs.jitst
}
where
expr :: !Expr !CompileState -> Either String CompileState
expr (Int i) cs = gen (PushI i) cs
expr (Bool b) cs = gen (PushI (if b 1 0)) cs
expr (Var v) cs = case get v cs.vars of
Just i -> gen (PushRef (i-cs.sp)) cs
Nothing -> Left ("undefined variable '" +++ v +++ "'")
expr (App f args) cs
# args = if (args=:[]) [Int 0] args
= foldM (flip expr) {cs & sp=cs.sp+1} (reverse args) >>= \cs -> case get f cs.funs of
Nothing -> Left ("undefined function '" +++ toString f +++ "'")
Just f -> gen [Pop (length args-1),Call f] cs
generic gEncodedSize a :: !a -> Int
gEncodedSize{|Int|} _ = 1
gEncodedSize{|{!}|} fx xs = 1 + sum [fx x \\ x <-: xs]
gEncodedSize{|UNIT|} _ = 0
gEncodedSize{|PAIR|} fx fy (PAIR x y) = fx x + fy y
gEncodedSize{|EITHER|} fl _ (LEFT l) = fl l
gEncodedSize{|EITHER|} _ fr (RIGHT r) = fr r
gEncodedSize{|CONS|} fx (CONS x) = fx x + 1
gEncodedSize{|OBJECT|} fx (OBJECT x) = fx x
generic gEncode a :: !a !Int !*{#Int} -> (!Int, !*{#Int})
gEncode{|Int|} n i arr = (i+1, {arr & [i]=n})
gEncode{|{!}|} fx xs i arr = walk 0 (i+1) {arr & [i]=sz}
where
sz = size xs
walk ai i arr
| ai >= sz = (i,arr)
# (i,arr) = fx xs.[ai] i arr
= walk (ai+1) i arr
gEncode{|UNIT|} _ i arr = (i,arr)
gEncode{|PAIR|} fx fy (PAIR x y) i arr
# (i,arr) = fx x i arr
= fy y i arr
gEncode{|EITHER|} fl _ (LEFT l) i arr = fl l i arr
gEncode{|EITHER|} _ fr (RIGHT r) i arr = fr r i arr
gEncode{|CONS of {gcd_index}|} fx (CONS x) i arr = fx x (i+1) {arr & [i]=gcd_index}
gEncode{|OBJECT|} fx (OBJECT x) i arr = fx x i arr
derive gEncodedSize Instr
derive gEncode Instr
encode :: !a -> *{#Int} | gEncodedSize{|*|}, gEncode{|*|} a
encode x
# (_,arr) = gEncode{|*|} x 0 (createArray (gEncodedSize{|*|} x) -1)
= arr
|
