SCM Repository
Annotation of /sml/trunk/src/compiler/MiscUtil/profile/btrace.sml
Parent Directory
|
Revision Log
Revision 678 - (view) (download)
1 : | blume | 675 | (* |
2 : | * Perform Absyn annotations for back-tracing support. | ||
3 : | * This adds a bt_add at the entry point of each FNexp, | ||
4 : | * a push-restore sequence (bt_push) at each non-tail call site of | ||
5 : | * a non-primitive function, and a save-restore sequence to each HANDLEexp. | ||
6 : | * | ||
7 : | * Copyright (c) 2000 by Lucent Bell Laboratories | ||
8 : | * | ||
9 : | * author: Matthias Blume (blume@kurims.kyoto-u.ac.jp) | ||
10 : | *) | ||
11 : | local | ||
12 : | structure A = Absyn | ||
13 : | structure SE = StaticEnv | ||
14 : | structure CB = CompBasic | ||
15 : | structure SP = SymPath | ||
16 : | structure EM = ErrorMsg | ||
17 : | structure VC = VarCon | ||
18 : | structure BT = BasicTypes | ||
19 : | structure II = InlInfo | ||
20 : | structure EU = ElabUtil | ||
21 : | |||
22 : | structure Dummy = BTImp (* mention it, so it gets made! *) | ||
23 : | in | ||
24 : | |||
25 : | signature BTRACE = sig | ||
26 : | val instrument : SE.staticEnv * CB.compInfo -> A.dec -> A.dec | ||
27 : | end | ||
28 : | |||
29 : | structure BTrace :> BTRACE = struct | ||
30 : | |||
31 : | blume | 677 | exception NoCore |
32 : | |||
33 : | blume | 675 | fun impossible s = EM.impossible ("BTrace: " ^ s) |
34 : | |||
35 : | infix --> | ||
36 : | val op --> = BT.--> | ||
37 : | |||
38 : | blume | 677 | val i_i_Ty = BT.intTy --> BT.intTy |
39 : | val ii_u_Ty = BT.tupleTy [BT.intTy, BT.intTy] --> BT.unitTy | ||
40 : | blume | 675 | val u_u_Ty = BT.unitTy --> BT.unitTy |
41 : | val u_u_u_Ty = BT.unitTy --> u_u_Ty | ||
42 : | blume | 677 | val iis_u_Ty = BT.tupleTy [BT.intTy, BT.intTy, BT.unitTy] --> BT.unitTy |
43 : | blume | 675 | |
44 : | fun instrument0 (senv, cinfo: CB.compInfo) d = let | ||
45 : | |||
46 : | val matchstring = #errorMatch cinfo | ||
47 : | |||
48 : | val mkv = #mkLvar cinfo | ||
49 : | |||
50 : | fun tmpvar (n, t) = let | ||
51 : | val sy = Symbol.varSymbol n | ||
52 : | in | ||
53 : | VC.VALvar { access = Access.namedAcc (sy, mkv), info = II.nullInfo, | ||
54 : | path = SP.SPATH [sy], typ = ref t } | ||
55 : | end | ||
56 : | |||
57 : | val isSpecial = let | ||
58 : | val l = [SpecialSymbols.paramId, | ||
59 : | SpecialSymbols.functorId, | ||
60 : | SpecialSymbols.hiddenId, | ||
61 : | SpecialSymbols.tempStrId, | ||
62 : | SpecialSymbols.tempFctId, | ||
63 : | SpecialSymbols.fctbodyId, | ||
64 : | SpecialSymbols.anonfsigId, | ||
65 : | SpecialSymbols.resultId, | ||
66 : | SpecialSymbols.returnId, | ||
67 : | SpecialSymbols.internalVarId] | ||
68 : | in | ||
69 : | fn s => List.exists (fn s' => Symbol.eq (s, s')) l | ||
70 : | end | ||
71 : | |||
72 : | fun cons (s, []) = if isSpecial s then [] else [(s, 0)] | ||
73 : | | cons (s, l as ((s', m) :: t)) = | ||
74 : | if isSpecial s then l | ||
75 : | else if Symbol.eq (s, s') then (s, m+1) :: t | ||
76 : | else (s, 0) :: l | ||
77 : | |||
78 : | fun getCore s = let | ||
79 : | blume | 677 | fun err _ _ _ = raise NoCore |
80 : | blume | 675 | in |
81 : | Lookup.lookVal (senv, SP.SPATH [CoreSym.coreSym, | ||
82 : | Symbol.varSymbol s], err) | ||
83 : | end | ||
84 : | |||
85 : | fun getCoreVal s = | ||
86 : | case getCore s of | ||
87 : | VC.VAL r => r | ||
88 : | | _ => impossible "getCoreVal" | ||
89 : | |||
90 : | fun getCoreCon s = | ||
91 : | case getCore s of | ||
92 : | VC.CON c => c | ||
93 : | | _ => impossible "getCoreCon" | ||
94 : | |||
95 : | blume | 677 | val bt_reserve = getCoreVal "bt_reserve" |
96 : | blume | 675 | val bt_register = getCoreVal "bt_register" |
97 : | val bt_save = getCoreVal "bt_save" | ||
98 : | val bt_push = getCoreVal "bt_push" | ||
99 : | val bt_add = getCoreVal "bt_add" | ||
100 : | val matchcon = getCoreCon "Match" | ||
101 : | |||
102 : | blume | 677 | val bt_register_var = tmpvar ("<bt_register>", iis_u_Ty) |
103 : | blume | 675 | val bt_save_var = tmpvar ("<bt_save>", u_u_u_Ty) |
104 : | val bt_push_var = tmpvar ("<bt_push>", u_u_u_Ty) | ||
105 : | blume | 677 | val bt_add_var = tmpvar ("<bt_add>", ii_u_Ty) |
106 : | val bt_reserve_var = tmpvar ("<bt_reserve>", i_i_Ty) | ||
107 : | val bt_module_var = tmpvar ("<bt_module>", BT.intTy) | ||
108 : | blume | 675 | |
109 : | fun VARexp v = A.VARexp (ref v, []) | ||
110 : | fun INTexp i = A.INTexp (IntInf.fromInt i, BT.intTy) | ||
111 : | |||
112 : | val uExp = EU.unitExp | ||
113 : | val pushexp = A.APPexp (VARexp bt_push_var, uExp) | ||
114 : | val saveexp = A.APPexp (VARexp bt_save_var, uExp) | ||
115 : | |||
116 : | blume | 677 | fun mkaddexp id = A.APPexp (VARexp bt_add_var, |
117 : | EU.TUPLEexp [VARexp bt_module_var, | ||
118 : | INTexp id]) | ||
119 : | blume | 675 | fun mkregexp (id, s) = |
120 : | A.APPexp (VARexp bt_register_var, | ||
121 : | blume | 677 | EU.TUPLEexp [VARexp bt_module_var, |
122 : | INTexp id, A.STRINGexp s]) | ||
123 : | blume | 675 | |
124 : | val regexps = ref [] | ||
125 : | blume | 677 | val next = ref 0 |
126 : | blume | 675 | |
127 : | fun mkadd (id, s) = | ||
128 : | (regexps := mkregexp (id, s) :: !regexps; | ||
129 : | mkaddexp id) | ||
130 : | |||
131 : | fun VALdec (v, e) = | ||
132 : | A.VALdec [A.VB { pat = A.VARpat v, exp = e, | ||
133 : | tyvars = ref [], boundtvs = [] }] | ||
134 : | fun LETexp (v, e, b) = A.LETexp (VALdec (v, e), b) | ||
135 : | fun AUexp v = A.APPexp (VARexp v, uExp) (* apply to unit *) | ||
136 : | |||
137 : | fun is_prim_exp (A.VARexp (ref (VC.VALvar v), _)) = | ||
138 : | II.isPrimInfo (#info v) | ||
139 : | | is_prim_exp (A.CONexp _) = true | ||
140 : | | is_prim_exp (A.CONSTRAINTexp (e, _)) = is_prim_exp e | ||
141 : | | is_prim_exp (A.MARKexp (e, _)) = is_prim_exp e | ||
142 : | | is_prim_exp _ = false | ||
143 : | |||
144 : | blume | 678 | fun is_raise_exp (A.RAISEexp _) = true |
145 : | | is_raise_exp (A.MARKexp (e, _) | | ||
146 : | A.CONSTRAINTexp (e, _) | | ||
147 : | A.SEQexp [e]) = is_raise_exp e | ||
148 : | | is_raise_exp _ = false | ||
149 : | |||
150 : | blume | 675 | fun i_exp _ loc (A.RECORDexp l) = |
151 : | A.RECORDexp (map (fn (l, e) => (l, i_exp false loc e)) l) | ||
152 : | | i_exp _ loc (A.SELECTexp (l, e)) = | ||
153 : | A.SELECTexp (l, i_exp false loc e) | ||
154 : | | i_exp _ loc (A.VECTORexp (l, t)) = | ||
155 : | A.VECTORexp (map (i_exp false loc) l, t) | ||
156 : | | i_exp tail loc (A.PACKexp (e, t, tcl)) = | ||
157 : | A.PACKexp (i_exp tail loc e, t, tcl) | ||
158 : | | i_exp tail loc (e as A.APPexp (f, a)) = | ||
159 : | if tail orelse is_prim_exp f then | ||
160 : | A.APPexp (i_exp false loc f, i_exp false loc a) | ||
161 : | else let | ||
162 : | val mainexp = A.APPexp (i_exp false loc f, | ||
163 : | i_exp false loc a) | ||
164 : | val ty = Reconstruct.expType e | ||
165 : | val result = tmpvar ("tmpresult", ty) | ||
166 : | val restore = tmpvar ("tmprestore", u_u_Ty) | ||
167 : | in | ||
168 : | LETexp (restore, pushexp, | ||
169 : | LETexp (result, mainexp, | ||
170 : | A.SEQexp [AUexp restore, VARexp result])) | ||
171 : | end | ||
172 : | | i_exp tail loc (A.HANDLEexp (e, A.HANDLER (A.FNexp (rl, t)))) = let | ||
173 : | val restore = tmpvar ("tmprestore", u_u_Ty) | ||
174 : | blume | 678 | fun rule (r as A.RULE (p, e)) = |
175 : | if is_raise_exp e then r | ||
176 : | else A.RULE (p, A.SEQexp [AUexp restore, i_exp tail loc e]) | ||
177 : | blume | 675 | in |
178 : | LETexp (restore, saveexp, | ||
179 : | A.HANDLEexp (i_exp false loc e, | ||
180 : | A.HANDLER (A.FNexp (map rule rl, t)))) | ||
181 : | end | ||
182 : | | i_exp _ _ (A.HANDLEexp _) = impossible "bad HANDLEexp" | ||
183 : | | i_exp _ loc (A.RAISEexp (e, t)) = | ||
184 : | A.RAISEexp (i_exp false loc e, t) | ||
185 : | | i_exp tail loc (A.CASEexp (e, rl, b)) = | ||
186 : | A.CASEexp (i_exp false loc e, map (i_rule tail loc) rl, b) | ||
187 : | | i_exp tail loc (A.FNexp (rl, t)) = let | ||
188 : | fun name ((s, 0), a) = Symbol.name s :: a | ||
189 : | | name ((s, m), a) = Symbol.name s :: "[" :: | ||
190 : | Int.toString (m + 1) :: "]" :: a | ||
191 : | fun dot ([z], a) = name (z, a) | ||
192 : | | dot (h :: t, a) = dot (t, "." :: name (h, a)) | ||
193 : | | dot ([], a) = impossible "FNexp: no path" | ||
194 : | val (n, r) = loc | ||
195 : | val ms = matchstring r | ||
196 : | val descr = concat (ms :: ": " :: dot (n, [])) | ||
197 : | blume | 677 | val id = !next |
198 : | val _ = next := id + 1 | ||
199 : | blume | 675 | val addexp = mkadd (id, descr) |
200 : | val arg = tmpvar ("fnvar", t) | ||
201 : | val rl' = map (i_rule true loc) rl | ||
202 : | val re = let | ||
203 : | val A.RULE (_, lst) = List.last rl | ||
204 : | val t = Reconstruct.expType lst | ||
205 : | in | ||
206 : | A.RAISEexp (A.CONexp (matchcon, []), t) | ||
207 : | end | ||
208 : | in | ||
209 : | A.FNexp ([A.RULE (A.VARpat arg, | ||
210 : | A.SEQexp [addexp, | ||
211 : | A.CASEexp (A.VARexp (ref arg, []), | ||
212 : | rl', true)]), | ||
213 : | A.RULE (A.WILDpat, re)], | ||
214 : | t) | ||
215 : | end | ||
216 : | | i_exp tail loc (A.LETexp (d, e)) = | ||
217 : | A.LETexp (i_dec loc d, i_exp tail loc e) | ||
218 : | | i_exp tail loc (A.SEQexp l) = | ||
219 : | A.SEQexp (#1 (foldr (fn (e, (l, t)) => (i_exp t loc e :: l, false)) | ||
220 : | ([], tail) l)) | ||
221 : | | i_exp tail loc (A.CONSTRAINTexp (e, t)) = | ||
222 : | A.CONSTRAINTexp (i_exp tail loc e, t) | ||
223 : | | i_exp tail (n, _) (A.MARKexp (e, r)) = | ||
224 : | A.MARKexp (i_exp tail (n, r) e, r) | ||
225 : | | i_exp _ _ e = e | ||
226 : | |||
227 : | and i_dec loc (A.VALdec l) = A.VALdec (map (i_vb loc) l) | ||
228 : | | i_dec loc (A.VALRECdec l) = A.VALRECdec (map (i_rvb loc) l) | ||
229 : | | i_dec loc (A.ABSTYPEdec { abstycs, withtycs, body }) = | ||
230 : | A.ABSTYPEdec { abstycs = abstycs, withtycs = withtycs, | ||
231 : | body = i_dec loc body } | ||
232 : | | i_dec loc (A.EXCEPTIONdec l) = A.EXCEPTIONdec (map (i_eb loc) l) | ||
233 : | | i_dec loc (A.STRdec l) = A.STRdec (map (i_strb loc) l) | ||
234 : | | i_dec loc (A.ABSdec l) = A.ABSdec (map (i_strb loc) l) | ||
235 : | | i_dec loc (A.FCTdec l) = A.FCTdec (map (i_fctb loc) l) | ||
236 : | | i_dec loc (A.LOCALdec (d, d')) = | ||
237 : | A.LOCALdec (i_dec loc d, i_dec loc d') | ||
238 : | | i_dec loc (A.SEQdec l) = A.SEQdec (map (i_dec loc) l) | ||
239 : | | i_dec (n, _) (A.MARKdec (d, r)) = A.MARKdec (i_dec (n, r) d, r) | ||
240 : | | i_dec _ d = d | ||
241 : | |||
242 : | and i_rule tail loc (A.RULE (p, e)) = A.RULE (p, i_exp tail loc e) | ||
243 : | |||
244 : | and i_vb (n, r) (vb as A.VB { pat, exp, boundtvs, tyvars }) = let | ||
245 : | fun gv (A.VARpat v) = SOME v | ||
246 : | | gv (A.CONSTRAINTpat (p, _)) = gv p | ||
247 : | | gv (A.LAYEREDpat (p, p')) = | ||
248 : | (case gv p of | ||
249 : | SOME v => SOME v | ||
250 : | | NONE => gv p') | ||
251 : | | gv _ = NONE | ||
252 : | fun recur n = A.VB { pat = pat, exp = i_exp false (n, r) exp, | ||
253 : | boundtvs = boundtvs, tyvars = tyvars } | ||
254 : | in | ||
255 : | case gv pat of | ||
256 : | SOME (VC.VALvar { path = SP.SPATH [x], info, ... }) => | ||
257 : | if II.isPrimInfo info then vb else recur (cons (x, n)) | ||
258 : | | SOME (VC.VALvar { info, ... }) => | ||
259 : | if II.isPrimInfo info then vb else recur n | ||
260 : | | _ => recur n | ||
261 : | end | ||
262 : | |||
263 : | and i_rvb (n, r) (A.RVB { var, exp, boundtvs, resultty, tyvars }) = let | ||
264 : | val x = | ||
265 : | case var of | ||
266 : | VC.VALvar { path = SymPath.SPATH [x], ... } => x | ||
267 : | | _ => impossible "VALRECdec" | ||
268 : | in | ||
269 : | A.RVB { var = var, exp = i_exp false (cons (x, n), r) exp, | ||
270 : | boundtvs = boundtvs, resultty = resultty, tyvars = tyvars } | ||
271 : | end | ||
272 : | |||
273 : | and i_eb loc (A.EBgen { exn, etype, ident }) = | ||
274 : | A.EBgen { exn = exn, etype = etype, ident = i_exp false loc ident } | ||
275 : | | i_eb _ eb = eb | ||
276 : | |||
277 : | and i_strb (n, r) (A.STRB { name, str, def }) = | ||
278 : | A.STRB { name = name, str = str, | ||
279 : | def = i_strexp (cons (name, n), r) def } | ||
280 : | |||
281 : | and i_fctb (n, r) (A.FCTB { name, fct, def }) = | ||
282 : | A.FCTB { name = name, fct = fct, | ||
283 : | def = i_fctexp (cons (name, n), r) def } | ||
284 : | |||
285 : | and i_strexp loc (A.LETstr (d, s)) = | ||
286 : | A.LETstr (i_dec loc d, i_strexp loc s) | ||
287 : | | i_strexp (n, _) (A.MARKstr (s, r)) = | ||
288 : | A.MARKstr (i_strexp (n, r) s, r) | ||
289 : | | i_strexp _ s = s | ||
290 : | |||
291 : | and i_fctexp loc (A.FCTfct { param, argtycs, def }) = | ||
292 : | A.FCTfct { param = param, argtycs = argtycs, | ||
293 : | def = i_strexp loc def } | ||
294 : | | i_fctexp loc (A.LETfct (d, f)) = | ||
295 : | A.LETfct (i_dec loc d, i_fctexp loc f) | ||
296 : | | i_fctexp (n, _) (A.MARKfct (f, r)) = | ||
297 : | A.MARKfct (i_fctexp (n, r) f, r) | ||
298 : | | i_fctexp _ f = f | ||
299 : | |||
300 : | val d' = i_dec ([], (0, 0)) d | ||
301 : | in | ||
302 : | blume | 677 | A.LOCALdec (A.SEQdec [VALdec (bt_reserve_var, AUexp bt_reserve), |
303 : | VALdec (bt_module_var, | ||
304 : | A.APPexp (VARexp bt_reserve_var, | ||
305 : | INTexp (!next))), | ||
306 : | VALdec (bt_save_var, AUexp bt_save), | ||
307 : | blume | 675 | VALdec (bt_push_var, AUexp bt_push), |
308 : | VALdec (bt_register_var, AUexp bt_register), | ||
309 : | VALdec (bt_add_var, | ||
310 : | A.SEQexp (!regexps @ [AUexp bt_add]))], | ||
311 : | d') | ||
312 : | end | ||
313 : | |||
314 : | fun instrument params d = | ||
315 : | blume | 677 | if SMLofNJ.Internals.BTrace.mode NONE then |
316 : | instrument0 params d | ||
317 : | handle NoCore => d (* this takes care of core.sml *) | ||
318 : | blume | 675 | else d |
319 : | end | ||
320 : | |||
321 : | end (* local *) |
root@smlnj-gforge.cs.uchicago.edu | ViewVC Help |
Powered by ViewVC 1.0.0 |