ziv@2291
|
1 structure Sqlcache :> SQLCACHE = struct
|
ziv@2209
|
2
|
ziv@2286
|
3
|
ziv@2286
|
4 (*********************)
|
ziv@2286
|
5 (* General Utilities *)
|
ziv@2286
|
6 (*********************)
|
ziv@2209
|
7
|
ziv@2276
|
8 structure IK = struct type ord_key = int val compare = Int.compare end
|
ziv@2209
|
9 structure IS = IntBinarySet
|
ziv@2209
|
10 structure IM = IntBinaryMap
|
ziv@2213
|
11 structure SK = struct type ord_key = string val compare = String.compare end
|
ziv@2213
|
12 structure SS = BinarySetFn(SK)
|
ziv@2213
|
13 structure SM = BinaryMapFn(SK)
|
ziv@2286
|
14 structure IIMM = MultimapFn(structure KeyMap = IM structure ValSet = IS)
|
ziv@2213
|
15 structure SIMM = MultimapFn(structure KeyMap = SM structure ValSet = IS)
|
ziv@2209
|
16
|
ziv@2274
|
17 fun id x = x
|
ziv@2274
|
18
|
ziv@2250
|
19 fun iterate f n x = if n < 0
|
ziv@2250
|
20 then raise Fail "Can't iterate function negative number of times."
|
ziv@2250
|
21 else if n = 0
|
ziv@2250
|
22 then x
|
ziv@2250
|
23 else iterate f (n-1) (f x)
|
ziv@2250
|
24
|
ziv@2286
|
25 (* From the MLton wiki. *)
|
ziv@2286
|
26 infix 3 <\ fun x <\ f = fn y => f (x, y) (* Left section *)
|
ziv@2286
|
27 infix 3 \> fun f \> y = f y (* Left application *)
|
ziv@2286
|
28
|
ziv@2286
|
29 fun mapFst f (x, y) = (f x, y)
|
ziv@2286
|
30
|
ziv@2286
|
31 (* Option monad. *)
|
ziv@2286
|
32 fun obind (x, f) = Option.mapPartial f x
|
ziv@2294
|
33 fun oguard (b, x) = if b then x () else NONE
|
ziv@2286
|
34 fun omap f = fn SOME x => SOME (f x) | _ => NONE
|
ziv@2286
|
35 fun omap2 f = fn (SOME x, SOME y) => SOME (f (x,y)) | _ => NONE
|
ziv@2286
|
36 fun osequence ys = List.foldr (omap2 op::) (SOME []) ys
|
ziv@2286
|
37
|
ziv@2294
|
38 fun concatMap f xs = List.concat (map f xs)
|
ziv@2294
|
39
|
ziv@2294
|
40 val rec cartesianProduct : 'a list list -> 'a list list =
|
ziv@2294
|
41 fn [] => [[]]
|
ziv@2294
|
42 | (xs :: xss) => concatMap (fn ys => concatMap (fn x => [x :: ys]) xs)
|
ziv@2294
|
43 (cartesianProduct xss)
|
ziv@2294
|
44
|
ziv@2286
|
45 fun indexOf test =
|
ziv@2286
|
46 let
|
ziv@2286
|
47 fun f n =
|
ziv@2286
|
48 fn [] => NONE
|
ziv@2286
|
49 | (x::xs) => if test x then SOME n else f (n+1) xs
|
ziv@2286
|
50 in
|
ziv@2286
|
51 f 0
|
ziv@2286
|
52 end
|
ziv@2286
|
53
|
ziv@2286
|
54
|
ziv@2286
|
55 (************)
|
ziv@2286
|
56 (* Settings *)
|
ziv@2286
|
57 (************)
|
ziv@2286
|
58
|
ziv@2286
|
59 open Mono
|
ziv@2286
|
60
|
ziv@2268
|
61 (* Filled in by [addFlushing]. *)
|
ziv@2268
|
62 val ffiInfoRef : {index : int, params : int} list ref = ref []
|
ziv@2209
|
63
|
ziv@2268
|
64 fun resetFfiInfo () = ffiInfoRef := []
|
ziv@2227
|
65
|
ziv@2268
|
66 fun getFfiInfo () = !ffiInfoRef
|
ziv@2213
|
67
|
ziv@2215
|
68 (* Some FFIs have writing as their only effect, which the caching records. *)
|
ziv@2215
|
69 val ffiEffectful =
|
ziv@2223
|
70 (* ASK: how can this be less hard-coded? *)
|
ziv@2215
|
71 let
|
ziv@2258
|
72 val okayWrites = SS.fromList ["htmlifyInt_w",
|
ziv@2258
|
73 "htmlifyFloat_w",
|
ziv@2258
|
74 "htmlifyString_w",
|
ziv@2258
|
75 "htmlifyBool_w",
|
ziv@2258
|
76 "htmlifyTime_w",
|
ziv@2258
|
77 "attrifyInt_w",
|
ziv@2258
|
78 "attrifyFloat_w",
|
ziv@2258
|
79 "attrifyString_w",
|
ziv@2258
|
80 "attrifyChar_w",
|
ziv@2258
|
81 "urlifyInt_w",
|
ziv@2258
|
82 "urlifyFloat_w",
|
ziv@2258
|
83 "urlifyString_w",
|
ziv@2258
|
84 "urlifyBool_w",
|
ziv@2258
|
85 "urlifyChannel_w"]
|
ziv@2215
|
86 in
|
ziv@2265
|
87 (* ASK: is it okay to hardcode Sqlcache functions as effectful? *)
|
ziv@2215
|
88 fn (m, f) => Settings.isEffectful (m, f)
|
ziv@2258
|
89 andalso not (m = "Basis" andalso SS.member (okayWrites, f))
|
ziv@2215
|
90 end
|
ziv@2215
|
91
|
ziv@2278
|
92 val cacheRef = ref LruCache.cache
|
ziv@2278
|
93 fun setCache c = cacheRef := c
|
ziv@2278
|
94 fun getCache () = !cacheRef
|
ziv@2278
|
95
|
ziv@2299
|
96 datatype heuristic = Always | Never | NoPureAll | NoPureOne | NoCombo
|
ziv@2299
|
97
|
ziv@2299
|
98 val heuristicRef = ref Always
|
ziv@2299
|
99 fun setHeuristic h = heuristicRef := (case h of
|
ziv@2299
|
100 "always" => Always
|
ziv@2299
|
101 | "never" => Never
|
ziv@2299
|
102 | "nopureall" => NoPureAll
|
ziv@2299
|
103 | "nopureone" => NoPureOne
|
ziv@2299
|
104 | "nocombo" => NoCombo
|
ziv@2299
|
105 | _ => raise Fail "Sqlcache: setHeuristic")
|
ziv@2299
|
106 fun getHeuristic () = !heuristicRef
|
ziv@2233
|
107
|
ziv@2286
|
108
|
ziv@2286
|
109 (************************)
|
ziv@2286
|
110 (* Really Useful Things *)
|
ziv@2286
|
111 (************************)
|
ziv@2286
|
112
|
ziv@2248
|
113 (* Used to have type context for local variables in MonoUtil functions. *)
|
ziv@2248
|
114 val doBind =
|
ziv@2262
|
115 fn (env, MonoUtil.Exp.RelE (x, t)) => MonoEnv.pushERel env x t NONE
|
ziv@2262
|
116 | (env, MonoUtil.Exp.NamedE (x, n, t, eo, s)) => MonoEnv.pushENamed env x n t eo s
|
ziv@2262
|
117 | (env, MonoUtil.Exp.Datatype (x, n, cs)) => MonoEnv.pushDatatype env x n cs
|
ziv@2215
|
118
|
ziv@2271
|
119 val dummyLoc = ErrorMsg.dummySpan
|
ziv@2271
|
120
|
ziv@2278
|
121 (* DEBUG *)
|
ziv@2294
|
122 fun printExp msg exp =
|
ziv@2294
|
123 (Print.preface ("SQLCACHE: " ^ msg ^ ":", MonoPrint.p_exp MonoEnv.empty exp); exp)
|
ziv@2294
|
124 fun printExp' msg exp' = (printExp msg (exp', dummyLoc); exp')
|
ziv@2294
|
125 fun printTyp msg typ =
|
ziv@2294
|
126 (Print.preface ("SQLCACHE: " ^ msg ^ ":", MonoPrint.p_typ MonoEnv.empty typ); typ)
|
ziv@2294
|
127 fun printTyp' msg typ' = (printTyp msg (typ', dummyLoc); typ')
|
ziv@2278
|
128 fun obindDebug printer (x, f) =
|
ziv@2278
|
129 case x of
|
ziv@2278
|
130 NONE => NONE
|
ziv@2278
|
131 | SOME x' => case f x' of
|
ziv@2278
|
132 NONE => (printer (); NONE)
|
ziv@2278
|
133 | y => y
|
ziv@2271
|
134
|
ziv@2268
|
135
|
ziv@2248
|
136 (*******************)
|
ziv@2248
|
137 (* Effect Analysis *)
|
ziv@2248
|
138 (*******************)
|
ziv@2215
|
139
|
ziv@2286
|
140 (* TODO: test this. *)
|
ziv@2286
|
141 fun transitiveAnalysis doVal state (decls, _) =
|
ziv@2286
|
142 let
|
ziv@2286
|
143 val doDecl =
|
ziv@2286
|
144 fn ((DVal v, _), state) => doVal (v, state)
|
ziv@2286
|
145 (* Pass over the list of values a number of times equal to its size,
|
ziv@2286
|
146 making sure whatever property we're testing propagates everywhere
|
ziv@2286
|
147 it should. This is analagous to the Bellman-Ford algorithm. *)
|
ziv@2286
|
148 | ((DValRec vs, _), state) =>
|
ziv@2286
|
149 iterate (fn state => List.foldl doVal state vs) (length vs) state
|
ziv@2286
|
150 | (_, state) => state
|
ziv@2286
|
151 in
|
ziv@2286
|
152 List.foldl doDecl state decls
|
ziv@2286
|
153 end
|
ziv@2286
|
154
|
ziv@2216
|
155 (* Makes an exception for [EWrite] (which is recorded when caching). *)
|
ziv@2248
|
156 fun effectful (effs : IS.set) =
|
ziv@2215
|
157 let
|
ziv@2248
|
158 val isFunction =
|
ziv@2248
|
159 fn (TFun _, _) => true
|
ziv@2248
|
160 | _ => false
|
ziv@2250
|
161 fun doExp (env, e) =
|
ziv@2248
|
162 case e of
|
ziv@2248
|
163 EPrim _ => false
|
ziv@2248
|
164 (* For now: variables of function type might be effectful, but
|
ziv@2248
|
165 others are fully evaluated and are therefore not effectful. *)
|
ziv@2250
|
166 | ERel n => isFunction (#2 (MonoEnv.lookupERel env n))
|
ziv@2248
|
167 | ENamed n => IS.member (effs, n)
|
ziv@2248
|
168 | EFfi (m, f) => ffiEffectful (m, f)
|
ziv@2248
|
169 | EFfiApp (m, f, _) => ffiEffectful (m, f)
|
ziv@2248
|
170 (* These aren't effectful unless a subexpression is. *)
|
ziv@2248
|
171 | ECon _ => false
|
ziv@2248
|
172 | ENone _ => false
|
ziv@2248
|
173 | ESome _ => false
|
ziv@2248
|
174 | EApp _ => false
|
ziv@2248
|
175 | EAbs _ => false
|
ziv@2248
|
176 | EUnop _ => false
|
ziv@2248
|
177 | EBinop _ => false
|
ziv@2248
|
178 | ERecord _ => false
|
ziv@2248
|
179 | EField _ => false
|
ziv@2248
|
180 | ECase _ => false
|
ziv@2248
|
181 | EStrcat _ => false
|
ziv@2248
|
182 (* EWrite is a special exception because we record writes when caching. *)
|
ziv@2248
|
183 | EWrite _ => false
|
ziv@2248
|
184 | ESeq _ => false
|
ziv@2248
|
185 | ELet _ => false
|
ziv@2250
|
186 | EUnurlify _ => false
|
ziv@2248
|
187 (* ASK: what should we do about closures? *)
|
ziv@2248
|
188 (* Everything else is some sort of effect. We could flip this and
|
ziv@2248
|
189 explicitly list bits of Mono that are effectful, but this is
|
ziv@2248
|
190 conservatively robust to future changes (however unlikely). *)
|
ziv@2248
|
191 | _ => true
|
ziv@2215
|
192 in
|
ziv@2248
|
193 MonoUtil.Exp.existsB {typ = fn _ => false, exp = doExp, bind = doBind}
|
ziv@2215
|
194 end
|
ziv@2215
|
195
|
ziv@2215
|
196 (* TODO: test this. *)
|
ziv@2286
|
197 fun effectfulDecls file =
|
ziv@2286
|
198 transitiveAnalysis (fn ((_, name, _, e, _), effs) =>
|
ziv@2286
|
199 if effectful effs MonoEnv.empty e
|
ziv@2286
|
200 then IS.add (effs, name)
|
ziv@2286
|
201 else effs)
|
ziv@2286
|
202 IS.empty
|
ziv@2286
|
203 file
|
ziv@2215
|
204
|
ziv@2215
|
205
|
ziv@2248
|
206 (*********************************)
|
ziv@2248
|
207 (* Boolean Formula Normalization *)
|
ziv@2248
|
208 (*********************************)
|
ziv@2216
|
209
|
ziv@2234
|
210 datatype junctionType = Conj | Disj
|
ziv@2216
|
211
|
ziv@2216
|
212 datatype 'atom formula =
|
ziv@2216
|
213 Atom of 'atom
|
ziv@2216
|
214 | Negate of 'atom formula
|
ziv@2234
|
215 | Combo of junctionType * 'atom formula list
|
ziv@2216
|
216
|
ziv@2243
|
217 (* Guaranteed to have all negation pushed to the atoms. *)
|
ziv@2243
|
218 datatype 'atom formula' =
|
ziv@2243
|
219 Atom' of 'atom
|
ziv@2243
|
220 | Combo' of junctionType * 'atom formula' list
|
ziv@2243
|
221
|
ziv@2234
|
222 val flipJt = fn Conj => Disj | Disj => Conj
|
ziv@2216
|
223
|
ziv@2218
|
224 (* Pushes all negation to the atoms.*)
|
ziv@2244
|
225 fun pushNegate (normalizeAtom : bool * 'atom -> 'atom) (negating : bool) =
|
ziv@2244
|
226 fn Atom x => Atom' (normalizeAtom (negating, x))
|
ziv@2244
|
227 | Negate f => pushNegate normalizeAtom (not negating) f
|
ziv@2244
|
228 | Combo (j, fs) => Combo' (if negating then flipJt j else j,
|
ziv@2244
|
229 map (pushNegate normalizeAtom negating) fs)
|
ziv@2218
|
230
|
ziv@2218
|
231 val rec flatten =
|
ziv@2243
|
232 fn Combo' (_, [f]) => flatten f
|
ziv@2243
|
233 | Combo' (j, fs) =>
|
ziv@2243
|
234 Combo' (j, List.foldr (fn (f, acc) =>
|
ziv@2243
|
235 case f of
|
ziv@2243
|
236 Combo' (j', fs') =>
|
ziv@2243
|
237 if j = j' orelse length fs' = 1
|
ziv@2243
|
238 then fs' @ acc
|
ziv@2243
|
239 else f :: acc
|
ziv@2243
|
240 | _ => f :: acc)
|
ziv@2243
|
241 []
|
ziv@2243
|
242 (map flatten fs))
|
ziv@2218
|
243 | f => f
|
ziv@2218
|
244
|
ziv@2243
|
245 (* [simplify] operates on the desired normal form. E.g., if [junc] is [Disj],
|
ziv@2243
|
246 consider the list of lists to be a disjunction of conjunctions. *)
|
ziv@2237
|
247 fun normalize' (simplify : 'a list list -> 'a list list)
|
ziv@2235
|
248 (junc : junctionType) =
|
ziv@2216
|
249 let
|
ziv@2235
|
250 fun norm junc =
|
ziv@2237
|
251 simplify
|
ziv@2243
|
252 o (fn Atom' x => [[x]]
|
ziv@2243
|
253 | Combo' (j, fs) =>
|
ziv@2235
|
254 let
|
ziv@2236
|
255 val fss = map (norm junc) fs
|
ziv@2235
|
256 in
|
ziv@2236
|
257 if j = junc
|
ziv@2236
|
258 then List.concat fss
|
ziv@2236
|
259 else map List.concat (cartesianProduct fss)
|
ziv@2235
|
260 end)
|
ziv@2216
|
261 in
|
ziv@2235
|
262 norm junc
|
ziv@2216
|
263 end
|
ziv@2216
|
264
|
ziv@2244
|
265 fun normalize simplify normalizeAtom junc =
|
ziv@2243
|
266 normalize' simplify junc
|
ziv@2235
|
267 o flatten
|
ziv@2244
|
268 o pushNegate normalizeAtom false
|
ziv@2216
|
269
|
ziv@2221
|
270 fun mapFormula mf =
|
ziv@2221
|
271 fn Atom x => Atom (mf x)
|
ziv@2221
|
272 | Negate f => Negate (mapFormula mf f)
|
ziv@2235
|
273 | Combo (j, fs) => Combo (j, map (mapFormula mf) fs)
|
ziv@2216
|
274
|
ziv@2274
|
275 fun mapFormulaExps mf = mapFormula (fn (cmp, e1, e2) => (cmp, mf e1, mf e2))
|
ziv@2274
|
276
|
ziv@2230
|
277
|
ziv@2248
|
278 (****************)
|
ziv@2248
|
279 (* SQL Analysis *)
|
ziv@2248
|
280 (****************)
|
ziv@2213
|
281
|
ziv@2240
|
282 structure CmpKey = struct
|
ziv@2235
|
283
|
ziv@2235
|
284 type ord_key = Sql.cmp
|
ziv@2235
|
285
|
ziv@2235
|
286 val compare =
|
ziv@2235
|
287 fn (Sql.Eq, Sql.Eq) => EQUAL
|
ziv@2235
|
288 | (Sql.Eq, _) => LESS
|
ziv@2235
|
289 | (_, Sql.Eq) => GREATER
|
ziv@2235
|
290 | (Sql.Ne, Sql.Ne) => EQUAL
|
ziv@2235
|
291 | (Sql.Ne, _) => LESS
|
ziv@2235
|
292 | (_, Sql.Ne) => GREATER
|
ziv@2235
|
293 | (Sql.Lt, Sql.Lt) => EQUAL
|
ziv@2235
|
294 | (Sql.Lt, _) => LESS
|
ziv@2235
|
295 | (_, Sql.Lt) => GREATER
|
ziv@2235
|
296 | (Sql.Le, Sql.Le) => EQUAL
|
ziv@2235
|
297 | (Sql.Le, _) => LESS
|
ziv@2235
|
298 | (_, Sql.Le) => GREATER
|
ziv@2235
|
299 | (Sql.Gt, Sql.Gt) => EQUAL
|
ziv@2235
|
300 | (Sql.Gt, _) => LESS
|
ziv@2235
|
301 | (_, Sql.Gt) => GREATER
|
ziv@2235
|
302 | (Sql.Ge, Sql.Ge) => EQUAL
|
ziv@2235
|
303
|
ziv@2235
|
304 end
|
ziv@2235
|
305
|
ziv@2216
|
306 val rec chooseTwos : 'a list -> ('a * 'a) list =
|
ziv@2216
|
307 fn [] => []
|
ziv@2216
|
308 | x :: ys => map (fn y => (x, y)) ys @ chooseTwos ys
|
ziv@2213
|
309
|
ziv@2237
|
310 fun removeRedundant madeRedundantBy zs =
|
ziv@2237
|
311 let
|
ziv@2237
|
312 fun removeRedundant' (xs, ys) =
|
ziv@2237
|
313 case xs of
|
ziv@2237
|
314 [] => ys
|
ziv@2237
|
315 | x :: xs' =>
|
ziv@2237
|
316 removeRedundant' (xs',
|
ziv@2237
|
317 if List.exists (fn y => madeRedundantBy (x, y)) (xs' @ ys)
|
ziv@2237
|
318 then ys
|
ziv@2237
|
319 else x :: ys)
|
ziv@2237
|
320 in
|
ziv@2237
|
321 removeRedundant' (zs, [])
|
ziv@2237
|
322 end
|
ziv@2237
|
323
|
ziv@2216
|
324 datatype atomExp =
|
ziv@2289
|
325 True
|
ziv@2289
|
326 | False
|
ziv@2289
|
327 | QueryArg of int
|
ziv@2216
|
328 | DmlRel of int
|
ziv@2216
|
329 | Prim of Prim.t
|
ziv@2216
|
330 | Field of string * string
|
ziv@2216
|
331
|
ziv@2216
|
332 structure AtomExpKey : ORD_KEY = struct
|
ziv@2216
|
333
|
ziv@2234
|
334 type ord_key = atomExp
|
ziv@2216
|
335
|
ziv@2234
|
336 val compare =
|
ziv@2289
|
337 fn (True, True) => EQUAL
|
ziv@2289
|
338 | (True, _) => LESS
|
ziv@2289
|
339 | (_, True) => GREATER
|
ziv@2289
|
340 | (False, False) => EQUAL
|
ziv@2289
|
341 | (False, _) => LESS
|
ziv@2289
|
342 | (_, False) => GREATER
|
ziv@2289
|
343 | (QueryArg n1, QueryArg n2) => Int.compare (n1, n2)
|
ziv@2234
|
344 | (QueryArg _, _) => LESS
|
ziv@2234
|
345 | (_, QueryArg _) => GREATER
|
ziv@2234
|
346 | (DmlRel n1, DmlRel n2) => Int.compare (n1, n2)
|
ziv@2234
|
347 | (DmlRel _, _) => LESS
|
ziv@2234
|
348 | (_, DmlRel _) => GREATER
|
ziv@2234
|
349 | (Prim p1, Prim p2) => Prim.compare (p1, p2)
|
ziv@2234
|
350 | (Prim _, _) => LESS
|
ziv@2234
|
351 | (_, Prim _) => GREATER
|
ziv@2234
|
352 | (Field (t1, f1), Field (t2, f2)) =>
|
ziv@2234
|
353 case String.compare (t1, t2) of
|
ziv@2234
|
354 EQUAL => String.compare (f1, f2)
|
ziv@2234
|
355 | ord => ord
|
ziv@2216
|
356
|
ziv@2216
|
357 end
|
ziv@2216
|
358
|
ziv@2244
|
359 structure AtomOptionKey = OptionKeyFn(AtomExpKey)
|
ziv@2244
|
360
|
ziv@2271
|
361 val rec tablesOfQuery =
|
ziv@2294
|
362 fn Sql.Query1 {From = fitems, ...} => List.foldl SS.union SS.empty (map tableOfFitem fitems)
|
ziv@2271
|
363 | Sql.Union (q1, q2) => SS.union (tablesOfQuery q1, tablesOfQuery q2)
|
ziv@2294
|
364 and tableOfFitem =
|
ziv@2294
|
365 fn Sql.Table (t, _) => SS.singleton t
|
ziv@2294
|
366 | Sql.Nested (q, _) => tablesOfQuery q
|
ziv@2294
|
367 | Sql.Join (_, f1, f2, _) => SS.union (tableOfFitem f1, tableOfFitem f2)
|
ziv@2271
|
368
|
ziv@2271
|
369 val tableOfDml =
|
ziv@2271
|
370 fn Sql.Insert (tab, _) => tab
|
ziv@2271
|
371 | Sql.Delete (tab, _) => tab
|
ziv@2271
|
372 | Sql.Update (tab, _, _) => tab
|
ziv@2271
|
373
|
ziv@2271
|
374 val freeVars =
|
ziv@2271
|
375 MonoUtil.Exp.foldB
|
ziv@2271
|
376 {typ = #2,
|
ziv@2271
|
377 exp = fn (bound, ERel n, vars) => if n < bound
|
ziv@2271
|
378 then vars
|
ziv@2271
|
379 else IS.add (vars, n - bound)
|
ziv@2271
|
380 | (_, _, vars) => vars,
|
ziv@2273
|
381 bind = fn (bound, MonoUtil.Exp.RelE _) => bound + 1
|
ziv@2273
|
382 | (bound, _) => bound}
|
ziv@2271
|
383 0
|
ziv@2271
|
384 IS.empty
|
ziv@2271
|
385
|
ziv@2276
|
386 (* A path is a number of field projections of a variable. *)
|
ziv@2278
|
387 type path = int * string list
|
ziv@2276
|
388 structure PK = PairKeyFn(structure I = IK structure J = ListKeyFn(SK))
|
ziv@2276
|
389 structure PS = BinarySetFn(PK)
|
ziv@2276
|
390
|
ziv@2276
|
391 val pathOfExp =
|
ziv@2276
|
392 let
|
ziv@2276
|
393 fun readFields acc exp =
|
ziv@2276
|
394 acc
|
ziv@2276
|
395 <\obind\>
|
ziv@2276
|
396 (fn fs =>
|
ziv@2276
|
397 case #1 exp of
|
ziv@2276
|
398 ERel n => SOME (n, fs)
|
ziv@2276
|
399 | EField (exp, f) => readFields (SOME (f::fs)) exp
|
ziv@2276
|
400 | _ => NONE)
|
ziv@2276
|
401 in
|
ziv@2276
|
402 readFields (SOME [])
|
ziv@2276
|
403 end
|
ziv@2276
|
404
|
ziv@2276
|
405 fun expOfPath (n, fs) =
|
ziv@2276
|
406 List.foldl (fn (f, exp) => (EField (exp, f), dummyLoc)) (ERel n, dummyLoc) fs
|
ziv@2276
|
407
|
ziv@2276
|
408 fun freePaths'' bound exp paths =
|
ziv@2276
|
409 case pathOfExp (exp, dummyLoc) of
|
ziv@2276
|
410 NONE => paths
|
ziv@2276
|
411 | SOME (n, fs) => if n < bound then paths else PS.add (paths, (n - bound, fs))
|
ziv@2276
|
412
|
ziv@2276
|
413 (* ASK: nicer way? :( *)
|
ziv@2276
|
414 fun freePaths' bound exp =
|
ziv@2276
|
415 case #1 exp of
|
ziv@2276
|
416 EPrim _ => id
|
ziv@2276
|
417 | e as ERel _ => freePaths'' bound e
|
ziv@2276
|
418 | ENamed _ => id
|
ziv@2276
|
419 | ECon (_, _, data) => (case data of NONE => id | SOME e => freePaths' bound e)
|
ziv@2276
|
420 | ENone _ => id
|
ziv@2276
|
421 | ESome (_, e) => freePaths' bound e
|
ziv@2276
|
422 | EFfi _ => id
|
ziv@2276
|
423 | EFfiApp (_, _, args) =>
|
ziv@2276
|
424 List.foldl (fn ((e, _), acc) => freePaths' bound e o acc) id args
|
ziv@2276
|
425 | EApp (e1, e2) => freePaths' bound e1 o freePaths' bound e2
|
ziv@2276
|
426 | EAbs (_, _, _, e) => freePaths' (bound + 1) e
|
ziv@2276
|
427 | EUnop (_, e) => freePaths' bound e
|
ziv@2276
|
428 | EBinop (_, _, e1, e2) => freePaths' bound e1 o freePaths' bound e2
|
ziv@2276
|
429 | ERecord fields => List.foldl (fn ((_, e, _), acc) => freePaths' bound e o acc) id fields
|
ziv@2276
|
430 | e as EField _ => freePaths'' bound e
|
ziv@2276
|
431 | ECase (e, cases, _) =>
|
ziv@2278
|
432 List.foldl (fn ((p, e), acc) => freePaths' (MonoEnv.patBindsN p + bound) e o acc)
|
ziv@2276
|
433 (freePaths' bound e)
|
ziv@2276
|
434 cases
|
ziv@2276
|
435 | EStrcat (e1, e2) => freePaths' bound e1 o freePaths' bound e2
|
ziv@2276
|
436 | EError (e, _) => freePaths' bound e
|
ziv@2276
|
437 | EReturnBlob {blob, mimeType = e, ...} =>
|
ziv@2276
|
438 freePaths' bound e o (case blob of NONE => id | SOME e => freePaths' bound e)
|
ziv@2276
|
439 | ERedirect (e, _) => freePaths' bound e
|
ziv@2276
|
440 | EWrite e => freePaths' bound e
|
ziv@2276
|
441 | ESeq (e1, e2) => freePaths' bound e1 o freePaths' bound e2
|
ziv@2278
|
442 | ELet (_, _, e1, e2) => freePaths' bound e1 o freePaths' (bound + 1) e2
|
ziv@2276
|
443 | EClosure (_, es) => List.foldl (fn (e, acc) => freePaths' bound e o acc) id es
|
ziv@2276
|
444 | EQuery {query = e1, body = e2, initial = e3, ...} =>
|
ziv@2276
|
445 freePaths' bound e1 o freePaths' (bound + 2) e2 o freePaths' bound e3
|
ziv@2276
|
446 | EDml (e, _) => freePaths' bound e
|
ziv@2276
|
447 | ENextval e => freePaths' bound e
|
ziv@2276
|
448 | ESetval (e1, e2) => freePaths' bound e1 o freePaths' bound e2
|
ziv@2276
|
449 | EUnurlify (e, _, _) => freePaths' bound e
|
ziv@2276
|
450 | EJavaScript (_, e) => freePaths' bound e
|
ziv@2276
|
451 | ESignalReturn e => freePaths' bound e
|
ziv@2276
|
452 | ESignalBind (e1, e2) => freePaths' bound e1 o freePaths' bound e2
|
ziv@2276
|
453 | ESignalSource e => freePaths' bound e
|
ziv@2276
|
454 | EServerCall (e, _, _, _) => freePaths' bound e
|
ziv@2276
|
455 | ERecv (e, _) => freePaths' bound e
|
ziv@2276
|
456 | ESleep e => freePaths' bound e
|
ziv@2276
|
457 | ESpawn e => freePaths' bound e
|
ziv@2276
|
458
|
ziv@2276
|
459 fun freePaths exp = freePaths' 0 exp PS.empty
|
ziv@2276
|
460
|
ziv@2271
|
461 datatype unbind = Known of exp | Unknowns of int
|
ziv@2271
|
462
|
ziv@2273
|
463 datatype cacheArg = AsIs of exp | Urlify of exp
|
ziv@2273
|
464
|
ziv@2278
|
465 structure InvalInfo :> sig
|
ziv@2271
|
466 type t
|
ziv@2271
|
467 type state = {tableToIndices : SIMM.multimap,
|
ziv@2271
|
468 indexToInvalInfo : (t * int) IntBinaryMap.map,
|
ziv@2271
|
469 ffiInfo : {index : int, params : int} list,
|
ziv@2271
|
470 index : int}
|
ziv@2271
|
471 val empty : t
|
ziv@2271
|
472 val singleton : Sql.query -> t
|
ziv@2271
|
473 val query : t -> Sql.query
|
ziv@2299
|
474 val orderArgs : t * Mono.exp -> cacheArg list option
|
ziv@2271
|
475 val unbind : t * unbind -> t option
|
ziv@2271
|
476 val union : t * t -> t
|
ziv@2271
|
477 val updateState : t * int * state -> state
|
ziv@2278
|
478 end = struct
|
ziv@2271
|
479
|
ziv@2276
|
480 (* Variable, field projections, possible wrapped sqlification FFI call. *)
|
ziv@2278
|
481 type sqlArg = path * (string * string * typ) option
|
ziv@2273
|
482
|
ziv@2273
|
483 type subst = sqlArg IM.map
|
ziv@2273
|
484
|
ziv@2273
|
485 (* TODO: store free variables as well? *)
|
ziv@2273
|
486 type t = (Sql.query * subst) list
|
ziv@2271
|
487
|
ziv@2271
|
488 type state = {tableToIndices : SIMM.multimap,
|
ziv@2271
|
489 indexToInvalInfo : (t * int) IntBinaryMap.map,
|
ziv@2271
|
490 ffiInfo : {index : int, params : int} list,
|
ziv@2271
|
491 index : int}
|
ziv@2271
|
492
|
ziv@2278
|
493 structure AK = PairKeyFn(
|
ziv@2278
|
494 structure I = PK
|
ziv@2278
|
495 structure J = OptionKeyFn(TripleKeyFn(
|
ziv@2276
|
496 structure I = SK
|
ziv@2276
|
497 structure J = SK
|
ziv@2276
|
498 structure K = struct type ord_key = Mono.typ val compare = MonoUtil.Typ.compare end)))
|
ziv@2276
|
499 structure AM = BinaryMapFn(AK)
|
ziv@2271
|
500
|
ziv@2273
|
501 (* Traversal Utilities *)
|
ziv@2273
|
502 (* TODO: get rid of unused ones. *)
|
ziv@2271
|
503
|
ziv@2271
|
504 (* Need lift', etc. because we don't have rank-2 polymorphism. This should
|
ziv@2273
|
505 probably use a functor (an ML one, not Haskell) but works for now. *)
|
ziv@2294
|
506 fun traverseSqexp (pure, _, _, _, lift, lift', _, _, lift2, _, _, _, _, _) f =
|
ziv@2271
|
507 let
|
ziv@2271
|
508 val rec tr =
|
ziv@2271
|
509 fn Sql.SqNot se => lift Sql.SqNot (tr se)
|
ziv@2271
|
510 | Sql.Binop (r, se1, se2) =>
|
ziv@2271
|
511 lift2 (fn (trse1, trse2) => Sql.Binop (r, trse1, trse2)) (tr se1, tr se2)
|
ziv@2271
|
512 | Sql.SqKnown se => lift Sql.SqKnown (tr se)
|
ziv@2294
|
513 | Sql.Inj (e', loc) => lift' (fn fe' => Sql.Inj (fe', loc)) (f e')
|
ziv@2271
|
514 | Sql.SqFunc (s, se) => lift (fn trse => Sql.SqFunc (s, trse)) (tr se)
|
ziv@2271
|
515 | se => pure se
|
ziv@2271
|
516 in
|
ziv@2271
|
517 tr
|
ziv@2271
|
518 end
|
ziv@2271
|
519
|
ziv@2294
|
520 fun traverseFitem (ops as (_, _, _, pure''', _, _, _, lift''', _, _, _, _, lift2'''', lift2''''')) f =
|
ziv@2271
|
521 let
|
ziv@2294
|
522 val rec tr =
|
ziv@2294
|
523 fn Sql.Table t => pure''' (Sql.Table t)
|
ziv@2294
|
524 | Sql.Join (jt, fi1, fi2, se) =>
|
ziv@2294
|
525 lift2'''' (fn ((trfi1, trfi2), trse) => Sql.Join (jt, trfi1, trfi2, trse))
|
ziv@2294
|
526 (lift2''''' id (tr fi1, tr fi2), traverseSqexp ops f se)
|
ziv@2294
|
527 | Sql.Nested (q, s) => lift''' (fn trq => Sql.Nested (trq, s))
|
ziv@2294
|
528 (traverseQuery ops f q)
|
ziv@2294
|
529 in
|
ziv@2294
|
530 tr
|
ziv@2294
|
531 end
|
ziv@2294
|
532
|
ziv@2294
|
533 and traverseQuery (ops as (_, pure', pure'', _, _, _, lift'', _, _, lift2', lift2'', lift2''', _, _)) f =
|
ziv@2294
|
534 let
|
ziv@2294
|
535 val rec seqList =
|
ziv@2294
|
536 fn [] => pure'' []
|
ziv@2294
|
537 | (x::xs) => lift2''' op:: (x, seqList xs)
|
ziv@2294
|
538 val rec tr =
|
ziv@2271
|
539 fn Sql.Query1 q =>
|
ziv@2294
|
540 (* TODO: make sure we don't need to traverse [#Select q]. *)
|
ziv@2294
|
541 lift2' (fn (trfrom, trwher) => Sql.Query1 {Select = #Select q,
|
ziv@2294
|
542 From = trfrom,
|
ziv@2294
|
543 Where = trwher})
|
ziv@2294
|
544 (seqList (map (traverseFitem ops f) (#From q)),
|
ziv@2294
|
545 case #Where q of
|
ziv@2294
|
546 NONE => pure' NONE
|
ziv@2294
|
547 | SOME se => lift'' SOME (traverseSqexp ops f se))
|
ziv@2294
|
548 | Sql.Union (q1, q2) => lift2'' Sql.Union (tr q1, tr q2)
|
ziv@2271
|
549 in
|
ziv@2294
|
550 tr
|
ziv@2271
|
551 end
|
ziv@2271
|
552
|
ziv@2273
|
553 (* Include unused tuple elements in argument for convenience of using same
|
ziv@2273
|
554 argument as [traverseQuery]. *)
|
ziv@2294
|
555 fun traverseIM (pure, _, _, _, _, _, _, _, _, lift2, _, _, _, _) f =
|
ziv@2273
|
556 IM.foldli (fn (k, v, acc) => lift2 (fn (acc, w) => IM.insert (acc, k, w)) (acc, f (k,v)))
|
ziv@2273
|
557 (pure IM.empty)
|
ziv@2271
|
558
|
ziv@2294
|
559 fun traverseSubst (ops as (_, pure', _, _, lift, _, _, _, _, lift2', _, _, _, _)) f =
|
ziv@2273
|
560 let
|
ziv@2278
|
561 fun mp ((n, fields), sqlify) =
|
ziv@2278
|
562 lift (fn ((n', fields'), sqlify') =>
|
ziv@2276
|
563 let
|
ziv@2278
|
564 fun wrap sq = ((n', fields' @ fields), sq)
|
ziv@2276
|
565 in
|
ziv@2276
|
566 case (fields', sqlify', fields, sqlify) of
|
ziv@2276
|
567 (_, NONE, _, NONE) => wrap NONE
|
ziv@2276
|
568 | (_, NONE, _, sq as SOME _) => wrap sq
|
ziv@2276
|
569 (* Last case should suffice because we don't
|
ziv@2276
|
570 project from a sqlified value (which is a
|
ziv@2276
|
571 string). *)
|
ziv@2276
|
572 | (_, sq as SOME _, [], NONE) => wrap sq
|
ziv@2289
|
573 | _ => raise Fail "Sqlcache: traverseSubst"
|
ziv@2276
|
574 end)
|
ziv@2276
|
575 (f n)
|
ziv@2273
|
576 in
|
ziv@2273
|
577 traverseIM ops (fn (_, v) => mp v)
|
ziv@2273
|
578 end
|
ziv@2273
|
579
|
ziv@2294
|
580 fun monoidOps plus zero =
|
ziv@2294
|
581 (fn _ => zero, fn _ => zero, fn _ => zero, fn _ => zero,
|
ziv@2294
|
582 fn _ => fn x => x, fn _ => fn x => x, fn _ => fn x => x, fn _ => fn x => x,
|
ziv@2294
|
583 fn _ => plus, fn _ => plus, fn _ => plus, fn _ => plus, fn _ => plus, fn _ => plus)
|
ziv@2273
|
584
|
ziv@2294
|
585 val optionOps = (SOME, SOME, SOME, SOME,
|
ziv@2294
|
586 omap, omap, omap, omap,
|
ziv@2294
|
587 omap2, omap2, omap2, omap2, omap2, omap2)
|
ziv@2273
|
588
|
ziv@2273
|
589 fun foldMapQuery plus zero = traverseQuery (monoidOps plus zero)
|
ziv@2273
|
590 val omapQuery = traverseQuery optionOps
|
ziv@2273
|
591 fun foldMapIM plus zero = traverseIM (monoidOps plus zero)
|
ziv@2273
|
592 fun omapIM f = traverseIM optionOps f
|
ziv@2273
|
593 fun foldMapSubst plus zero = traverseSubst (monoidOps plus zero)
|
ziv@2273
|
594 fun omapSubst f = traverseSubst optionOps f
|
ziv@2271
|
595
|
ziv@2271
|
596 val varsOfQuery = foldMapQuery IS.union
|
ziv@2271
|
597 IS.empty
|
ziv@2271
|
598 (fn e' => freeVars (e', dummyLoc))
|
ziv@2271
|
599
|
ziv@2276
|
600 fun varsOfSubst subst = foldMapSubst IS.union IS.empty IS.singleton subst
|
ziv@2273
|
601
|
ziv@2271
|
602 val varsOfList =
|
ziv@2271
|
603 fn [] => IS.empty
|
ziv@2271
|
604 | (q::qs) => varsOfQuery (List.foldl Sql.Union q qs)
|
ziv@2271
|
605
|
ziv@2273
|
606 (* Signature Implementation *)
|
ziv@2273
|
607
|
ziv@2273
|
608 val empty = []
|
ziv@2273
|
609
|
ziv@2278
|
610 fun singleton q = [(q, IS.foldl (fn (n, acc) => IM.insert (acc, n, ((n, []), NONE)))
|
ziv@2273
|
611 IM.empty
|
ziv@2273
|
612 (varsOfQuery q))]
|
ziv@2273
|
613
|
ziv@2273
|
614 val union = op@
|
ziv@2273
|
615
|
ziv@2273
|
616 fun sqlArgsMap (qs : t) =
|
ziv@2271
|
617 let
|
ziv@2273
|
618 val args =
|
ziv@2273
|
619 List.foldl (fn ((q, subst), acc) =>
|
ziv@2273
|
620 IM.foldl (fn (arg, acc) => AM.insert (acc, arg, ())) acc subst)
|
ziv@2273
|
621 AM.empty
|
ziv@2273
|
622 qs
|
ziv@2273
|
623 val countRef = ref (~1)
|
ziv@2273
|
624 fun count () = (countRef := !countRef + 1; !countRef)
|
ziv@2273
|
625 in
|
ziv@2273
|
626 (* Maps each arg to a different consecutive integer, starting from 0. *)
|
ziv@2273
|
627 AM.map count args
|
ziv@2273
|
628 end
|
ziv@2273
|
629
|
ziv@2278
|
630 fun expOfArg (path, sqlify) =
|
ziv@2276
|
631 let
|
ziv@2278
|
632 val exp = expOfPath path
|
ziv@2276
|
633 in
|
ziv@2276
|
634 case sqlify of
|
ziv@2276
|
635 NONE => exp
|
ziv@2276
|
636 | SOME (m, x, typ) => (EFfiApp (m, x, [(exp, typ)]), dummyLoc)
|
ziv@2276
|
637 end
|
ziv@2273
|
638
|
ziv@2278
|
639 fun orderArgs (qs : t, exp) =
|
ziv@2273
|
640 let
|
ziv@2278
|
641 val paths = freePaths exp
|
ziv@2273
|
642 fun erel n = (ERel n, dummyLoc)
|
ziv@2273
|
643 val argsMap = sqlArgsMap qs
|
ziv@2273
|
644 val args = map (expOfArg o #1) (AM.listItemsi argsMap)
|
ziv@2276
|
645 val invalPaths = List.foldl PS.union PS.empty (map freePaths args)
|
ziv@2299
|
646 (* TODO: make sure these variables are okay to remove from the argument list. *)
|
ziv@2299
|
647 val pureArgs = PS.difference (paths, invalPaths)
|
ziv@2299
|
648 val shouldCache =
|
ziv@2299
|
649 case getHeuristic () of
|
ziv@2299
|
650 Always => true
|
ziv@2299
|
651 | Never => (case qs of [_] => true | _ => false)
|
ziv@2299
|
652 | NoPureAll => (case qs of [] => false | _ => true)
|
ziv@2299
|
653 | NoPureOne => (case qs of [] => false | _ => PS.numItems pureArgs = 0)
|
ziv@2299
|
654 | NoCombo => PS.numItems pureArgs = 0 orelse AM.numItems argsMap = 0
|
ziv@2271
|
655 in
|
ziv@2271
|
656 (* Put arguments we might invalidate by first. *)
|
ziv@2299
|
657 if shouldCache
|
ziv@2299
|
658 then SOME (map AsIs args @ map (Urlify o expOfPath) (PS.listItems pureArgs))
|
ziv@2299
|
659 else NONE
|
ziv@2271
|
660 end
|
ziv@2271
|
661
|
ziv@2271
|
662 (* As a kludge, we rename the variables in the query to correspond to the
|
ziv@2271
|
663 argument of the cache they're part of. *)
|
ziv@2273
|
664 fun query (qs : t) =
|
ziv@2271
|
665 let
|
ziv@2273
|
666 val argsMap = sqlArgsMap qs
|
ziv@2273
|
667 fun substitute subst =
|
ziv@2273
|
668 fn ERel n => IM.find (subst, n)
|
ziv@2273
|
669 <\obind\>
|
ziv@2273
|
670 (fn arg =>
|
ziv@2273
|
671 AM.find (argsMap, arg)
|
ziv@2273
|
672 <\obind\>
|
ziv@2273
|
673 (fn n' => SOME (ERel n')))
|
ziv@2289
|
674 | _ => raise Fail "Sqlcache: query (a)"
|
ziv@2271
|
675 in
|
ziv@2273
|
676 case (map #1 qs) of
|
ziv@2273
|
677 (q :: qs) =>
|
ziv@2273
|
678 let
|
ziv@2273
|
679 val q = List.foldl Sql.Union q qs
|
ziv@2273
|
680 val ns = IS.listItems (varsOfQuery q)
|
ziv@2273
|
681 val rename =
|
ziv@2273
|
682 fn ERel n => omap ERel (indexOf (fn n' => n' = n) ns)
|
ziv@2289
|
683 | _ => raise Fail "Sqlcache: query (b)"
|
ziv@2273
|
684 in
|
ziv@2273
|
685 case omapQuery rename q of
|
ziv@2273
|
686 SOME q => q
|
ziv@2273
|
687 (* We should never get NONE because indexOf should never fail. *)
|
ziv@2289
|
688 | NONE => raise Fail "Sqlcache: query (c)"
|
ziv@2273
|
689 end
|
ziv@2273
|
690 (* We should never reach this case because [updateState] won't
|
ziv@2273
|
691 put anything in the state if there are no queries. *)
|
ziv@2289
|
692 | [] => raise Fail "Sqlcache: query (d)"
|
ziv@2271
|
693 end
|
ziv@2271
|
694
|
ziv@2276
|
695 val argOfExp =
|
ziv@2276
|
696 let
|
ziv@2276
|
697 fun doFields acc exp =
|
ziv@2276
|
698 acc
|
ziv@2276
|
699 <\obind\>
|
ziv@2276
|
700 (fn (fs, sqlify) =>
|
ziv@2276
|
701 case #1 exp of
|
ziv@2276
|
702 ERel n => SOME (n, fs, sqlify)
|
ziv@2276
|
703 | EField (exp, f) => doFields (SOME (f::fs, sqlify)) exp
|
ziv@2276
|
704 | _ => NONE)
|
ziv@2276
|
705 in
|
ziv@2276
|
706 fn (EFfiApp ("Basis", x, [(exp, typ)]), _) =>
|
ziv@2276
|
707 if String.isPrefix "sqlify" x
|
ziv@2278
|
708 then omap (fn path => (path, SOME ("Basis", x, typ))) (pathOfExp exp)
|
ziv@2276
|
709 else NONE
|
ziv@2278
|
710 | exp => omap (fn path => (path, NONE)) (pathOfExp exp)
|
ziv@2276
|
711 end
|
ziv@2273
|
712
|
ziv@2273
|
713 val unbind1 =
|
ziv@2273
|
714 fn Known e =>
|
ziv@2273
|
715 let
|
ziv@2273
|
716 val replacement = argOfExp e
|
ziv@2273
|
717 in
|
ziv@2273
|
718 omapSubst (fn 0 => replacement
|
ziv@2278
|
719 | n => SOME ((n-1, []), NONE))
|
ziv@2273
|
720 end
|
ziv@2278
|
721 | Unknowns k => omapSubst (fn n => if n < k then NONE else SOME ((n-k, []), NONE))
|
ziv@2271
|
722
|
ziv@2271
|
723 fun unbind (qs, ub) =
|
ziv@2271
|
724 case ub of
|
ziv@2271
|
725 (* Shortcut if nothing's changing. *)
|
ziv@2271
|
726 Unknowns 0 => SOME qs
|
ziv@2273
|
727 | _ => osequence (map (fn (q, subst) => unbind1 ub subst
|
ziv@2273
|
728 <\obind\>
|
ziv@2273
|
729 (fn subst' => SOME (q, subst'))) qs)
|
ziv@2271
|
730
|
ziv@2273
|
731 fun updateState (qs, numArgs, state as {index, ...} : state) =
|
ziv@2273
|
732 {tableToIndices = List.foldr (fn ((q, _), acc) =>
|
ziv@2271
|
733 SS.foldl (fn (tab, acc) =>
|
ziv@2271
|
734 SIMM.insert (acc, tab, index))
|
ziv@2271
|
735 acc
|
ziv@2271
|
736 (tablesOfQuery q))
|
ziv@2271
|
737 (#tableToIndices state)
|
ziv@2271
|
738 qs,
|
ziv@2271
|
739 indexToInvalInfo = IM.insert (#indexToInvalInfo state, index, (qs, numArgs)),
|
ziv@2271
|
740 ffiInfo = {index = index, params = numArgs} :: #ffiInfo state,
|
ziv@2271
|
741 index = index + 1}
|
ziv@2271
|
742
|
ziv@2271
|
743 end
|
ziv@2271
|
744
|
ziv@2216
|
745 structure UF = UnionFindFn(AtomExpKey)
|
ziv@2234
|
746
|
ziv@2273
|
747 val rec sqexpToFormula =
|
ziv@2273
|
748 fn Sql.SqTrue => Combo (Conj, [])
|
ziv@2273
|
749 | Sql.SqFalse => Combo (Disj, [])
|
ziv@2273
|
750 | Sql.SqNot e => Negate (sqexpToFormula e)
|
ziv@2273
|
751 | Sql.Binop (Sql.RCmp c, e1, e2) => Atom (c, e1, e2)
|
ziv@2273
|
752 | Sql.Binop (Sql.RLop l, p1, p2) => Combo (case l of Sql.And => Conj | Sql.Or => Disj,
|
ziv@2273
|
753 [sqexpToFormula p1, sqexpToFormula p2])
|
ziv@2289
|
754 | e as Sql.Field f => Atom (Sql.Eq, e, Sql.SqTrue)
|
ziv@2273
|
755 (* ASK: any other sqexps that can be props? *)
|
ziv@2289
|
756 | Sql.SqConst prim =>
|
ziv@2289
|
757 (case prim of
|
ziv@2289
|
758 (Prim.String (Prim.Normal, s)) =>
|
ziv@2289
|
759 if s = #trueString (Settings.currentDbms ())
|
ziv@2289
|
760 then Combo (Conj, [])
|
ziv@2289
|
761 else if s = #falseString (Settings.currentDbms ())
|
ziv@2289
|
762 then Combo (Disj, [])
|
ziv@2289
|
763 else raise Fail "Sqlcache: sqexpToFormula (SqConst a)"
|
ziv@2289
|
764 | _ => raise Fail "Sqlcache: sqexpToFormula (SqConst b)")
|
ziv@2289
|
765 | Sql.Computed _ => raise Fail "Sqlcache: sqexpToFormula (Computed)"
|
ziv@2289
|
766 | Sql.SqKnown _ => raise Fail "Sqlcache: sqexpToFormula (SqKnown)"
|
ziv@2289
|
767 | Sql.Inj _ => raise Fail "Sqlcache: sqexpToFormula (Inj)"
|
ziv@2289
|
768 | Sql.SqFunc _ => raise Fail "Sqlcache: sqexpToFormula (SqFunc)"
|
ziv@2289
|
769 | Sql.Unmodeled => raise Fail "Sqlcache: sqexpToFormula (Unmodeled)"
|
ziv@2289
|
770 | Sql.Null => raise Fail "Sqlcache: sqexpToFormula (Null)"
|
ziv@2273
|
771
|
ziv@2275
|
772 fun mapSqexpFields f =
|
ziv@2294
|
773 fn Sql.Field (t, v) => f (t, v)
|
ziv@2275
|
774 | Sql.SqNot e => Sql.SqNot (mapSqexpFields f e)
|
ziv@2275
|
775 | Sql.Binop (r, e1, e2) => Sql.Binop (r, mapSqexpFields f e1, mapSqexpFields f e2)
|
ziv@2275
|
776 | Sql.SqKnown e => Sql.SqKnown (mapSqexpFields f e)
|
ziv@2275
|
777 | Sql.SqFunc (s, e) => Sql.SqFunc (s, mapSqexpFields f e)
|
ziv@2275
|
778 | e => e
|
ziv@2275
|
779
|
ziv@2273
|
780 fun renameTables tablePairs =
|
ziv@2273
|
781 let
|
ziv@2275
|
782 fun rename table =
|
ziv@2273
|
783 case List.find (fn (_, t) => table = t) tablePairs of
|
ziv@2273
|
784 NONE => table
|
ziv@2273
|
785 | SOME (realTable, _) => realTable
|
ziv@2273
|
786 in
|
ziv@2275
|
787 mapSqexpFields (fn (t, f) => Sql.Field (rename t, f))
|
ziv@2273
|
788 end
|
ziv@2273
|
789
|
ziv@2294
|
790 structure FlattenQuery = struct
|
ziv@2294
|
791
|
ziv@2294
|
792 datatype substitution = RenameTable of string | SubstituteExp of Sql.sqexp SM.map
|
ziv@2294
|
793
|
ziv@2294
|
794 fun applySubst substTable =
|
ziv@2294
|
795 let
|
ziv@2294
|
796 fun substitute (table, field) =
|
ziv@2294
|
797 case SM.find (substTable, table) of
|
ziv@2294
|
798 NONE => Sql.Field (table, field)
|
ziv@2294
|
799 | SOME (RenameTable realTable) => Sql.Field (realTable, field)
|
ziv@2294
|
800 | SOME (SubstituteExp substField) =>
|
ziv@2294
|
801 case SM.find (substField, field) of
|
ziv@2294
|
802 NONE => raise Fail "Sqlcache: applySubst"
|
ziv@2294
|
803 | SOME se => se
|
ziv@2294
|
804 in
|
ziv@2294
|
805 mapSqexpFields substitute
|
ziv@2294
|
806 end
|
ziv@2294
|
807
|
ziv@2294
|
808 fun addToSubst (substTable, table, substField) =
|
ziv@2294
|
809 SM.insert (substTable,
|
ziv@2294
|
810 table,
|
ziv@2294
|
811 case substField of
|
ziv@2294
|
812 RenameTable _ => substField
|
ziv@2294
|
813 | SubstituteExp subst => SubstituteExp (SM.map (applySubst substTable) subst))
|
ziv@2294
|
814
|
ziv@2294
|
815 fun newSubst (t, s) = addToSubst (SM.empty, t, s)
|
ziv@2294
|
816
|
ziv@2294
|
817 datatype sitem' = Named of Sql.sqexp * string | Unnamed of Sql.sqexp
|
ziv@2294
|
818
|
ziv@2294
|
819 type queryFlat = {Select : sitem' list, Where : Sql.sqexp}
|
ziv@2294
|
820
|
ziv@2294
|
821 val sitemsToSubst =
|
ziv@2294
|
822 List.foldl (fn (Named (se, s), acc) => SM.insert (acc, s, se)
|
ziv@2294
|
823 | (Unnamed _, _) => raise Fail "Sqlcache: sitemsToSubst")
|
ziv@2294
|
824 SM.empty
|
ziv@2294
|
825
|
ziv@2294
|
826 fun unionSubst (s1, s2) = SM.unionWith (fn _ => raise Fail "Sqlcache: unionSubst") (s1, s2)
|
ziv@2294
|
827
|
ziv@2294
|
828 fun sqlAnd (se1, se2) = Sql.Binop (Sql.RLop Sql.And, se1, se2)
|
ziv@2294
|
829
|
ziv@2294
|
830 val rec flattenFitem : Sql.fitem -> (Sql.sqexp * substitution SM.map) list =
|
ziv@2294
|
831 fn Sql.Table (real, alias) => [(Sql.SqTrue, newSubst (alias, RenameTable real))]
|
ziv@2294
|
832 | Sql.Nested (q, s) =>
|
ziv@2294
|
833 let
|
ziv@2294
|
834 val qfs = flattenQuery q
|
ziv@2294
|
835 in
|
ziv@2294
|
836 map (fn (qf, subst) =>
|
ziv@2294
|
837 (#Where qf, addToSubst (subst, s, SubstituteExp (sitemsToSubst (#Select qf)))))
|
ziv@2294
|
838 qfs
|
ziv@2294
|
839 end
|
ziv@2294
|
840 | Sql.Join (jt, fi1, fi2, se) =>
|
ziv@2294
|
841 concatMap (fn ((wher1, subst1)) =>
|
ziv@2294
|
842 map (fn (wher2, subst2) =>
|
ziv@2295
|
843 let
|
ziv@2295
|
844 val subst = unionSubst (subst1, subst2)
|
ziv@2295
|
845 in
|
ziv@2295
|
846 (* ON clause becomes part of the accumulated WHERE. *)
|
ziv@2295
|
847 (sqlAnd (sqlAnd (wher1, wher2), applySubst subst se), subst)
|
ziv@2295
|
848 end)
|
ziv@2294
|
849 (flattenFitem fi2))
|
ziv@2294
|
850 (flattenFitem fi1)
|
ziv@2294
|
851
|
ziv@2294
|
852 and flattenQuery : Sql.query -> (queryFlat * substitution SM.map) list =
|
ziv@2294
|
853 fn Sql.Query1 q =>
|
ziv@2294
|
854 let
|
ziv@2294
|
855 val fifss = cartesianProduct (map flattenFitem (#From q))
|
ziv@2294
|
856 in
|
ziv@2294
|
857 map (fn fifs =>
|
ziv@2294
|
858 let
|
ziv@2294
|
859 val subst = List.foldl (fn ((_, subst), acc) => unionSubst (acc, subst))
|
ziv@2294
|
860 SM.empty
|
ziv@2294
|
861 fifs
|
ziv@2294
|
862 val wher = List.foldr (fn ((wher, _), acc) => sqlAnd (wher, acc))
|
ziv@2294
|
863 (case #Where q of
|
ziv@2294
|
864 NONE => Sql.SqTrue
|
ziv@2294
|
865 | SOME wher => wher)
|
ziv@2294
|
866 fifs
|
ziv@2294
|
867 in
|
ziv@2294
|
868 (* ASK: do we actually need to pass the substitution through here? *)
|
ziv@2294
|
869 (* We use the substitution later, but it's not clear we
|
ziv@2294
|
870 need any of its currently present fields again. *)
|
ziv@2294
|
871 ({Select = map (fn Sql.SqExp (se, s) => Named (applySubst subst se, s)
|
ziv@2294
|
872 | Sql.SqField tf =>
|
ziv@2294
|
873 Unnamed (applySubst subst (Sql.Field tf)))
|
ziv@2294
|
874 (#Select q),
|
ziv@2294
|
875 Where = applySubst subst wher},
|
ziv@2294
|
876 subst)
|
ziv@2294
|
877 end)
|
ziv@2294
|
878 fifss
|
ziv@2294
|
879 end
|
ziv@2294
|
880 | Sql.Union (q1, q2) => (flattenQuery q1) @ (flattenQuery q2)
|
ziv@2294
|
881
|
ziv@2294
|
882 end
|
ziv@2294
|
883
|
ziv@2294
|
884 val flattenQuery = map #1 o FlattenQuery.flattenQuery
|
ziv@2294
|
885
|
ziv@2294
|
886 fun queryFlatToFormula marker {Select = sitems, Where = wher} =
|
ziv@2274
|
887 let
|
ziv@2294
|
888 val fWhere = sqexpToFormula wher
|
ziv@2274
|
889 in
|
ziv@2275
|
890 case marker of
|
ziv@2275
|
891 NONE => fWhere
|
ziv@2275
|
892 | SOME markFields =>
|
ziv@2275
|
893 let
|
ziv@2275
|
894 val fWhereMarked = mapFormulaExps markFields fWhere
|
ziv@2275
|
895 val toSqexp =
|
ziv@2294
|
896 fn FlattenQuery.Named (se, _) => se
|
ziv@2294
|
897 | FlattenQuery.Unnamed se => se
|
ziv@2275
|
898 fun ineq se = Atom (Sql.Ne, se, markFields se)
|
ziv@2294
|
899 val fIneqs = Combo (Disj, map (ineq o toSqexp) sitems)
|
ziv@2275
|
900 in
|
ziv@2275
|
901 (Combo (Conj,
|
ziv@2275
|
902 [fWhere,
|
ziv@2275
|
903 Combo (Disj,
|
ziv@2275
|
904 [Negate fWhereMarked,
|
ziv@2275
|
905 Combo (Conj, [fWhereMarked, fIneqs])])]))
|
ziv@2275
|
906 end
|
ziv@2274
|
907 end
|
ziv@2294
|
908
|
ziv@2294
|
909 fun queryToFormula marker q = Combo (Disj, map (queryFlatToFormula marker) (flattenQuery q))
|
ziv@2273
|
910
|
ziv@2274
|
911 fun valsToFormula (markLeft, markRight) (table, vals) =
|
ziv@2274
|
912 Combo (Conj,
|
ziv@2274
|
913 map (fn (field, v) => Atom (Sql.Eq, markLeft (Sql.Field (table, field)), markRight v))
|
ziv@2274
|
914 vals)
|
ziv@2273
|
915
|
ziv@2274
|
916 (* TODO: verify logic for insertion and deletion. *)
|
ziv@2274
|
917 val rec dmlToFormulaMarker =
|
ziv@2274
|
918 fn Sql.Insert (table, vals) => (valsToFormula (id, id) (table, vals), NONE)
|
ziv@2275
|
919 | Sql.Delete (table, wher) => (sqexpToFormula (renameTables [(table, "T")] wher), NONE)
|
ziv@2273
|
920 | Sql.Update (table, vals, wher) =>
|
ziv@2273
|
921 let
|
ziv@2275
|
922 val fWhere = sqexpToFormula (renameTables [(table, "T")] wher)
|
ziv@2274
|
923 fun fVals marks = valsToFormula marks (table, vals)
|
ziv@2273
|
924 val modifiedFields = SS.addList (SS.empty, map #1 vals)
|
ziv@2273
|
925 (* TODO: don't use field name hack. *)
|
ziv@2275
|
926 val markFields =
|
ziv@2275
|
927 mapSqexpFields (fn (t, v) => if t = table andalso SS.member (modifiedFields, v)
|
ziv@2276
|
928 then Sql.Field (t, v ^ "'")
|
ziv@2276
|
929 else Sql.Field (t, v))
|
ziv@2275
|
930 val mark = mapFormulaExps markFields
|
ziv@2273
|
931 in
|
ziv@2275
|
932 ((Combo (Disj, [Combo (Conj, [fVals (id, markFields), mark fWhere]),
|
ziv@2275
|
933 Combo (Conj, [fVals (markFields, id), fWhere])])),
|
ziv@2275
|
934 SOME markFields)
|
ziv@2273
|
935 end
|
ziv@2273
|
936
|
ziv@2274
|
937 fun pairToFormulas (query, dml) =
|
ziv@2274
|
938 let
|
ziv@2276
|
939 val (fDml, marker) = dmlToFormulaMarker dml
|
ziv@2274
|
940 in
|
ziv@2274
|
941 (queryToFormula marker query, fDml)
|
ziv@2274
|
942 end
|
ziv@2274
|
943
|
ziv@2235
|
944 structure ConflictMaps = struct
|
ziv@2235
|
945
|
ziv@2235
|
946 structure TK = TripleKeyFn(structure I = CmpKey
|
ziv@2244
|
947 structure J = AtomOptionKey
|
ziv@2244
|
948 structure K = AtomOptionKey)
|
ziv@2274
|
949
|
ziv@2244
|
950 structure TS : ORD_SET = BinarySetFn(TK)
|
ziv@2235
|
951
|
ziv@2235
|
952 val toKnownEquality =
|
ziv@2235
|
953 (* [NONE] here means unkown. Anything that isn't a comparison between two
|
ziv@2235
|
954 knowns shouldn't be used, and simply dropping unused terms is okay in
|
ziv@2235
|
955 disjunctive normal form. *)
|
ziv@2235
|
956 fn (Sql.Eq, SOME e1, SOME e2) => SOME (e1, e2)
|
ziv@2235
|
957 | _ => NONE
|
ziv@2235
|
958
|
ziv@2274
|
959 fun equivClasses atoms : atomExp list list option =
|
ziv@2274
|
960 let
|
ziv@2274
|
961 val uf = List.foldl UF.union' UF.empty (List.mapPartial toKnownEquality atoms)
|
ziv@2274
|
962 val contradiction =
|
ziv@2274
|
963 fn (cmp, SOME ae1, SOME ae2) => (cmp = Sql.Ne orelse cmp = Sql.Lt orelse cmp = Sql.Gt)
|
ziv@2275
|
964 andalso UF.together (uf, ae1, ae2)
|
ziv@2274
|
965 (* If we don't know one side of the comparision, not a contradiction. *)
|
ziv@2274
|
966 | _ => false
|
ziv@2274
|
967 in
|
ziv@2294
|
968 not (List.exists contradiction atoms) <\oguard\> (fn _ => SOME (UF.classes uf))
|
ziv@2274
|
969 end
|
ziv@2235
|
970
|
ziv@2235
|
971 fun addToEqs (eqs, n, e) =
|
ziv@2235
|
972 case IM.find (eqs, n) of
|
ziv@2235
|
973 (* Comparing to a constant is probably better than comparing to a
|
ziv@2235
|
974 variable? Checking that existing constants match a new ones is
|
ziv@2235
|
975 handled by [accumulateEqs]. *)
|
ziv@2235
|
976 SOME (Prim _) => eqs
|
ziv@2235
|
977 | _ => IM.insert (eqs, n, e)
|
ziv@2235
|
978
|
ziv@2235
|
979 val accumulateEqs =
|
ziv@2235
|
980 (* [NONE] means we have a contradiction. *)
|
ziv@2235
|
981 fn (_, NONE) => NONE
|
ziv@2235
|
982 | ((Prim p1, Prim p2), eqso) =>
|
ziv@2235
|
983 (case Prim.compare (p1, p2) of
|
ziv@2235
|
984 EQUAL => eqso
|
ziv@2235
|
985 | _ => NONE)
|
ziv@2235
|
986 | ((QueryArg n, Prim p), SOME eqs) => SOME (addToEqs (eqs, n, Prim p))
|
ziv@2235
|
987 | ((QueryArg n, DmlRel r), SOME eqs) => SOME (addToEqs (eqs, n, DmlRel r))
|
ziv@2235
|
988 | ((Prim p, QueryArg n), SOME eqs) => SOME (addToEqs (eqs, n, Prim p))
|
ziv@2235
|
989 | ((DmlRel r, QueryArg n), SOME eqs) => SOME (addToEqs (eqs, n, DmlRel r))
|
ziv@2235
|
990 (* TODO: deal with equalities between [DmlRel]s and [Prim]s.
|
ziv@2235
|
991 This would involve guarding the invalidation with a check for the
|
ziv@2235
|
992 relevant comparisons. *)
|
ziv@2235
|
993 | (_, eqso) => eqso
|
ziv@2235
|
994
|
ziv@2235
|
995 val eqsOfClass : atomExp list -> atomExp IM.map option =
|
ziv@2235
|
996 List.foldl accumulateEqs (SOME IM.empty)
|
ziv@2235
|
997 o chooseTwos
|
ziv@2235
|
998
|
ziv@2235
|
999 fun toAtomExps rel (cmp, e1, e2) =
|
ziv@2235
|
1000 let
|
ziv@2235
|
1001 val qa =
|
ziv@2235
|
1002 (* Here [NONE] means unkown. *)
|
ziv@2235
|
1003 fn Sql.SqConst p => SOME (Prim p)
|
ziv@2235
|
1004 | Sql.Field tf => SOME (Field tf)
|
ziv@2235
|
1005 | Sql.Inj (EPrim p, _) => SOME (Prim p)
|
ziv@2235
|
1006 | Sql.Inj (ERel n, _) => SOME (rel n)
|
ziv@2235
|
1007 (* We can't deal with anything else, e.g., CURRENT_TIMESTAMP
|
ziv@2235
|
1008 becomes Sql.Unmodeled, which becomes NONE here. *)
|
ziv@2235
|
1009 | _ => NONE
|
ziv@2235
|
1010 in
|
ziv@2235
|
1011 (cmp, qa e1, qa e2)
|
ziv@2235
|
1012 end
|
ziv@2235
|
1013
|
ziv@2244
|
1014 val negateCmp =
|
ziv@2244
|
1015 fn Sql.Eq => Sql.Ne
|
ziv@2244
|
1016 | Sql.Ne => Sql.Eq
|
ziv@2244
|
1017 | Sql.Lt => Sql.Ge
|
ziv@2244
|
1018 | Sql.Le => Sql.Gt
|
ziv@2244
|
1019 | Sql.Gt => Sql.Le
|
ziv@2244
|
1020 | Sql.Ge => Sql.Lt
|
ziv@2244
|
1021
|
ziv@2244
|
1022 fun normalizeAtom (negating, (cmp, e1, e2)) =
|
ziv@2244
|
1023 (* Restricting to Le/Lt and sorting the expressions in Eq/Ne helps with
|
ziv@2244
|
1024 simplification, where we put the triples in sets. *)
|
ziv@2244
|
1025 case (if negating then negateCmp cmp else cmp) of
|
ziv@2244
|
1026 Sql.Eq => (case AtomOptionKey.compare (e1, e2) of
|
ziv@2244
|
1027 LESS => (Sql.Eq, e2, e1)
|
ziv@2244
|
1028 | _ => (Sql.Eq, e1, e2))
|
ziv@2244
|
1029 | Sql.Ne => (case AtomOptionKey.compare (e1, e2) of
|
ziv@2244
|
1030 LESS => (Sql.Ne, e2, e1)
|
ziv@2244
|
1031 | _ => (Sql.Ne, e1, e2))
|
ziv@2244
|
1032 | Sql.Lt => (Sql.Lt, e1, e2)
|
ziv@2244
|
1033 | Sql.Le => (Sql.Le, e1, e2)
|
ziv@2244
|
1034 | Sql.Gt => (Sql.Lt, e2, e1)
|
ziv@2244
|
1035 | Sql.Ge => (Sql.Le, e2, e1)
|
ziv@2235
|
1036
|
ziv@2235
|
1037 val markQuery : (Sql.cmp * Sql.sqexp * Sql.sqexp) formula ->
|
ziv@2235
|
1038 (Sql.cmp * atomExp option * atomExp option) formula =
|
ziv@2235
|
1039 mapFormula (toAtomExps QueryArg)
|
ziv@2235
|
1040
|
ziv@2235
|
1041 val markDml : (Sql.cmp * Sql.sqexp * Sql.sqexp) formula ->
|
ziv@2235
|
1042 (Sql.cmp * atomExp option * atomExp option) formula =
|
ziv@2235
|
1043 mapFormula (toAtomExps DmlRel)
|
ziv@2250
|
1044
|
ziv@2235
|
1045 (* No eqs should have key conflicts because no variable is in two
|
ziv@2294
|
1046 equivalence classes. *)
|
ziv@2235
|
1047 val mergeEqs : (atomExp IntBinaryMap.map option list
|
ziv@2235
|
1048 -> atomExp IntBinaryMap.map option) =
|
ziv@2294
|
1049 List.foldr (omap2 (IM.unionWith (fn _ => raise Fail "Sqlcache: ConflictMaps.mergeEqs")))
|
ziv@2294
|
1050 (SOME IM.empty)
|
ziv@2235
|
1051
|
ziv@2239
|
1052 val simplify =
|
ziv@2239
|
1053 map TS.listItems
|
ziv@2239
|
1054 o removeRedundant (fn (x, y) => TS.isSubset (y, x))
|
ziv@2239
|
1055 o map (fn xs => TS.addList (TS.empty, xs))
|
ziv@2239
|
1056
|
ziv@2235
|
1057 fun dnf (fQuery, fDml) =
|
ziv@2244
|
1058 normalize simplify normalizeAtom Disj (Combo (Conj, [markQuery fQuery, markDml fDml]))
|
ziv@2235
|
1059
|
ziv@2274
|
1060 val conflictMaps =
|
ziv@2274
|
1061 List.mapPartial (mergeEqs o map eqsOfClass)
|
ziv@2274
|
1062 o List.mapPartial equivClasses
|
ziv@2274
|
1063 o dnf
|
ziv@2235
|
1064
|
ziv@2235
|
1065 end
|
ziv@2235
|
1066
|
ziv@2235
|
1067 val conflictMaps = ConflictMaps.conflictMaps
|
ziv@2213
|
1068
|
ziv@2213
|
1069
|
ziv@2265
|
1070 (*************************************)
|
ziv@2265
|
1071 (* Program Instrumentation Utilities *)
|
ziv@2265
|
1072 (*************************************)
|
ziv@2213
|
1073
|
ziv@2288
|
1074 val {check, store, flush, lock, ...} = getCache ()
|
ziv@2233
|
1075
|
ziv@2248
|
1076 val dummyTyp = (TRecord [], dummyLoc)
|
ziv@2248
|
1077
|
ziv@2230
|
1078 fun stringExp s = (EPrim (Prim.String (Prim.Normal, s)), dummyLoc)
|
ziv@2230
|
1079
|
ziv@2230
|
1080 val stringTyp = (TFfi ("Basis", "string"), dummyLoc)
|
ziv@2213
|
1081
|
ziv@2213
|
1082 val sequence =
|
ziv@2213
|
1083 fn (exp :: exps) =>
|
ziv@2213
|
1084 let
|
ziv@2230
|
1085 val loc = dummyLoc
|
ziv@2213
|
1086 in
|
ziv@2213
|
1087 List.foldl (fn (e', seq) => ESeq ((seq, loc), (e', loc))) exp exps
|
ziv@2213
|
1088 end
|
ziv@2289
|
1089 | _ => raise Fail "Sqlcache: sequence"
|
ziv@2213
|
1090
|
ziv@2248
|
1091 (* Always increments negative indices as a hack we use later. *)
|
ziv@2248
|
1092 fun incRels inc =
|
ziv@2215
|
1093 MonoUtil.Exp.mapB
|
ziv@2248
|
1094 {typ = fn t' => t',
|
ziv@2248
|
1095 exp = fn bound =>
|
ziv@2248
|
1096 (fn ERel n => ERel (if n >= bound orelse n < 0 then n + inc else n)
|
ziv@2248
|
1097 | e' => e'),
|
ziv@2248
|
1098 bind = fn (bound, MonoUtil.Exp.RelE _) => bound + 1 | (bound, _) => bound}
|
ziv@2248
|
1099 0
|
ziv@2213
|
1100
|
ziv@2262
|
1101 fun fileTopLevelMapfoldB doTopLevelExp (decls, sideInfo) state =
|
ziv@2262
|
1102 let
|
ziv@2262
|
1103 fun doVal env ((x, n, t, exp, s), state) =
|
ziv@2262
|
1104 let
|
ziv@2262
|
1105 val (exp, state) = doTopLevelExp env exp state
|
ziv@2262
|
1106 in
|
ziv@2262
|
1107 ((x, n, t, exp, s), state)
|
ziv@2262
|
1108 end
|
ziv@2262
|
1109 fun doDecl' env (decl', state) =
|
ziv@2262
|
1110 case decl' of
|
ziv@2262
|
1111 DVal v =>
|
ziv@2262
|
1112 let
|
ziv@2262
|
1113 val (v, state) = doVal env (v, state)
|
ziv@2262
|
1114 in
|
ziv@2262
|
1115 (DVal v, state)
|
ziv@2262
|
1116 end
|
ziv@2262
|
1117 | DValRec vs =>
|
ziv@2262
|
1118 let
|
ziv@2262
|
1119 val (vs, state) = ListUtil.foldlMap (doVal env) state vs
|
ziv@2262
|
1120 in
|
ziv@2262
|
1121 (DValRec vs, state)
|
ziv@2262
|
1122 end
|
ziv@2262
|
1123 | _ => (decl', state)
|
ziv@2262
|
1124 fun doDecl (decl as (decl', loc), (env, state)) =
|
ziv@2262
|
1125 let
|
ziv@2262
|
1126 val env = MonoEnv.declBinds env decl
|
ziv@2262
|
1127 val (decl', state) = doDecl' env (decl', state)
|
ziv@2262
|
1128 in
|
ziv@2262
|
1129 ((decl', loc), (env, state))
|
ziv@2262
|
1130 end
|
ziv@2262
|
1131 val (decls, (_, state)) = (ListUtil.foldlMap doDecl (MonoEnv.empty, state) decls)
|
ziv@2262
|
1132 in
|
ziv@2262
|
1133 ((decls, sideInfo), state)
|
ziv@2262
|
1134 end
|
ziv@2262
|
1135
|
ziv@2262
|
1136 fun fileAllMapfoldB doExp file start =
|
ziv@2248
|
1137 case MonoUtil.File.mapfoldB
|
ziv@2248
|
1138 {typ = Search.return2,
|
ziv@2250
|
1139 exp = fn env => fn e' => fn s => Search.Continue (doExp env e' s),
|
ziv@2248
|
1140 decl = fn _ => Search.return2,
|
ziv@2248
|
1141 bind = doBind}
|
ziv@2250
|
1142 MonoEnv.empty file start of
|
ziv@2213
|
1143 Search.Continue x => x
|
ziv@2289
|
1144 | Search.Return _ => raise Fail "Sqlcache: fileAllMapfoldB"
|
ziv@2213
|
1145
|
ziv@2262
|
1146 fun fileMap doExp file = #1 (fileAllMapfoldB (fn _ => fn e => fn _ => (doExp e, ())) file ())
|
ziv@2213
|
1147
|
ziv@2267
|
1148 (* TODO: make this a bit prettier.... *)
|
ziv@2294
|
1149 (* TODO: factour out identical subexpressions to the same variable.... *)
|
ziv@2267
|
1150 val simplifySql =
|
ziv@2266
|
1151 let
|
ziv@2267
|
1152 fun factorOutNontrivial text =
|
ziv@2267
|
1153 let
|
ziv@2267
|
1154 val loc = dummyLoc
|
ziv@2294
|
1155 val strcat =
|
ziv@2294
|
1156 fn (e1, (EPrim (Prim.String (Prim.Normal, "")), _)) => e1
|
ziv@2294
|
1157 | ((EPrim (Prim.String (Prim.Normal, "")), _), e2) => e2
|
ziv@2294
|
1158 | (e1, e2) => (EStrcat (e1, e2), loc)
|
ziv@2267
|
1159 val chunks = Sql.chunkify text
|
ziv@2267
|
1160 val (newText, newVariables) =
|
ziv@2267
|
1161 (* Important that this is foldr (to oppose foldl below). *)
|
ziv@2267
|
1162 List.foldr
|
ziv@2267
|
1163 (fn (chunk, (qText, newVars)) =>
|
ziv@2267
|
1164 (* Variable bound to the head of newVars will have the lowest index. *)
|
ziv@2267
|
1165 case chunk of
|
ziv@2267
|
1166 (* EPrim should always be a string in this case. *)
|
ziv@2267
|
1167 Sql.Exp (e as (EPrim _, _)) => (strcat (e, qText), newVars)
|
ziv@2267
|
1168 | Sql.Exp e =>
|
ziv@2267
|
1169 let
|
ziv@2267
|
1170 val n = length newVars
|
ziv@2267
|
1171 in
|
ziv@2267
|
1172 (* This is the (n+1)th new variable, so there are
|
ziv@2267
|
1173 already n new variables bound, so we increment
|
ziv@2267
|
1174 indices by n. *)
|
ziv@2267
|
1175 (strcat ((ERel (~(n+1)), loc), qText), incRels n e :: newVars)
|
ziv@2267
|
1176 end
|
ziv@2267
|
1177 | Sql.String s => (strcat (stringExp s, qText), newVars))
|
ziv@2267
|
1178 (stringExp "", [])
|
ziv@2267
|
1179 chunks
|
ziv@2267
|
1180 fun wrapLets e' =
|
ziv@2267
|
1181 (* Important that this is foldl (to oppose foldr above). *)
|
ziv@2273
|
1182 List.foldl (fn (v, e') => ELet ("sqlArg", stringTyp, v, (e', loc)))
|
ziv@2267
|
1183 e'
|
ziv@2267
|
1184 newVariables
|
ziv@2267
|
1185 val numArgs = length newVariables
|
ziv@2267
|
1186 in
|
ziv@2267
|
1187 (newText, wrapLets, numArgs)
|
ziv@2267
|
1188 end
|
ziv@2267
|
1189 fun doExp exp' =
|
ziv@2267
|
1190 let
|
ziv@2267
|
1191 val text = case exp' of
|
ziv@2267
|
1192 EQuery {query = text, ...} => text
|
ziv@2267
|
1193 | EDml (text, _) => text
|
ziv@2289
|
1194 | _ => raise Fail "Sqlcache: simplifySql (a)"
|
ziv@2267
|
1195 val (newText, wrapLets, numArgs) = factorOutNontrivial text
|
ziv@2267
|
1196 val newExp' = case exp' of
|
ziv@2267
|
1197 EQuery q => EQuery {query = newText,
|
ziv@2267
|
1198 exps = #exps q,
|
ziv@2267
|
1199 tables = #tables q,
|
ziv@2267
|
1200 state = #state q,
|
ziv@2267
|
1201 body = #body q,
|
ziv@2267
|
1202 initial = #initial q}
|
ziv@2267
|
1203 | EDml (_, failureMode) => EDml (newText, failureMode)
|
ziv@2289
|
1204 | _ => raise Fail "Sqlcache: simplifySql (b)"
|
ziv@2267
|
1205 in
|
ziv@2267
|
1206 (* Increment once for each new variable just made. This is
|
ziv@2267
|
1207 where we use the negative De Bruijn indices hack. *)
|
ziv@2267
|
1208 (* TODO: please don't use that hack. As anyone could have
|
ziv@2267
|
1209 predicted, it was incomprehensible a year later.... *)
|
ziv@2267
|
1210 wrapLets (#1 (incRels numArgs (newExp', dummyLoc)))
|
ziv@2267
|
1211 end
|
ziv@2266
|
1212 in
|
ziv@2267
|
1213 fileMap (fn exp' => case exp' of
|
ziv@2267
|
1214 EQuery _ => doExp exp'
|
ziv@2267
|
1215 | EDml _ => doExp exp'
|
ziv@2267
|
1216 | _ => exp')
|
ziv@2266
|
1217 end
|
ziv@2266
|
1218
|
ziv@2250
|
1219
|
ziv@2250
|
1220 (**********************)
|
ziv@2250
|
1221 (* Mono Type Checking *)
|
ziv@2250
|
1222 (**********************)
|
ziv@2250
|
1223
|
ziv@2250
|
1224 fun typOfExp' (env : MonoEnv.env) : exp' -> typ option =
|
ziv@2250
|
1225 fn EPrim p => SOME (TFfi ("Basis", case p of
|
ziv@2250
|
1226 Prim.Int _ => "int"
|
ziv@2250
|
1227 | Prim.Float _ => "double"
|
ziv@2250
|
1228 | Prim.String _ => "string"
|
ziv@2250
|
1229 | Prim.Char _ => "char"),
|
ziv@2250
|
1230 dummyLoc)
|
ziv@2250
|
1231 | ERel n => SOME (#2 (MonoEnv.lookupERel env n))
|
ziv@2250
|
1232 | ENamed n => SOME (#2 (MonoEnv.lookupENamed env n))
|
ziv@2250
|
1233 (* ASK: okay to make a new [ref] each time? *)
|
ziv@2250
|
1234 | ECon (dk, PConVar nCon, _) =>
|
ziv@2250
|
1235 let
|
ziv@2250
|
1236 val (_, _, nData) = MonoEnv.lookupConstructor env nCon
|
ziv@2250
|
1237 val (_, cs) = MonoEnv.lookupDatatype env nData
|
ziv@2250
|
1238 in
|
ziv@2250
|
1239 SOME (TDatatype (nData, ref (dk, cs)), dummyLoc)
|
ziv@2250
|
1240 end
|
ziv@2250
|
1241 | ECon (_, PConFfi {mod = s, datatyp, ...}, _) => SOME (TFfi (s, datatyp), dummyLoc)
|
ziv@2250
|
1242 | ENone t => SOME (TOption t, dummyLoc)
|
ziv@2250
|
1243 | ESome (t, _) => SOME (TOption t, dummyLoc)
|
ziv@2250
|
1244 | EFfi _ => NONE
|
ziv@2250
|
1245 | EFfiApp _ => NONE
|
ziv@2250
|
1246 | EApp (e1, e2) => (case typOfExp env e1 of
|
ziv@2250
|
1247 SOME (TFun (_, t), _) => SOME t
|
ziv@2250
|
1248 | _ => NONE)
|
ziv@2250
|
1249 | EAbs (_, t1, t2, _) => SOME (TFun (t1, t2), dummyLoc)
|
ziv@2250
|
1250 (* ASK: is this right? *)
|
ziv@2250
|
1251 | EUnop (unop, e) => (case unop of
|
ziv@2250
|
1252 "!" => SOME (TFfi ("Basis", "bool"), dummyLoc)
|
ziv@2250
|
1253 | "-" => typOfExp env e
|
ziv@2250
|
1254 | _ => NONE)
|
ziv@2250
|
1255 (* ASK: how should this (and other "=> NONE" cases) work? *)
|
ziv@2250
|
1256 | EBinop _ => NONE
|
ziv@2250
|
1257 | ERecord fields => SOME (TRecord (map (fn (s, _, t) => (s, t)) fields), dummyLoc)
|
ziv@2250
|
1258 | EField (e, s) => (case typOfExp env e of
|
ziv@2250
|
1259 SOME (TRecord fields, _) =>
|
ziv@2286
|
1260 omap #2 (List.find (fn (s', _) => s = s') fields)
|
ziv@2250
|
1261 | _ => NONE)
|
ziv@2250
|
1262 | ECase (_, _, {result, ...}) => SOME result
|
ziv@2250
|
1263 | EStrcat _ => SOME (TFfi ("Basis", "string"), dummyLoc)
|
ziv@2250
|
1264 | EWrite _ => SOME (TRecord [], dummyLoc)
|
ziv@2250
|
1265 | ESeq (_, e) => typOfExp env e
|
ziv@2250
|
1266 | ELet (s, t, e1, e2) => typOfExp (MonoEnv.pushERel env s t (SOME e1)) e2
|
ziv@2250
|
1267 | EClosure _ => NONE
|
ziv@2250
|
1268 | EUnurlify (_, t, _) => SOME t
|
ziv@2269
|
1269 | EQuery {state, ...} => SOME state
|
ziv@2276
|
1270 | e => NONE
|
ziv@2250
|
1271
|
ziv@2250
|
1272 and typOfExp env (e', loc) = typOfExp' env e'
|
ziv@2250
|
1273
|
ziv@2250
|
1274
|
ziv@2266
|
1275 (***********)
|
ziv@2266
|
1276 (* Caching *)
|
ziv@2266
|
1277 (***********)
|
ziv@2250
|
1278
|
ziv@2271
|
1279 type state = InvalInfo.state
|
ziv@2271
|
1280
|
ziv@2271
|
1281 datatype subexp = Cachable of InvalInfo.t * (state -> exp * state) | Impure of exp
|
ziv@2271
|
1282
|
ziv@2271
|
1283 val isImpure =
|
ziv@2271
|
1284 fn Cachable _ => false
|
ziv@2271
|
1285 | Impure _ => true
|
ziv@2271
|
1286
|
ziv@2271
|
1287 val runSubexp : subexp * state -> exp * state =
|
ziv@2271
|
1288 fn (Cachable (_, f), state) => f state
|
ziv@2271
|
1289 | (Impure e, state) => (e, state)
|
ziv@2271
|
1290
|
ziv@2271
|
1291 val invalInfoOfSubexp =
|
ziv@2271
|
1292 fn Cachable (invalInfo, _) => invalInfo
|
ziv@2289
|
1293 | Impure _ => raise Fail "Sqlcache: invalInfoOfSubexp"
|
ziv@2271
|
1294
|
ziv@2271
|
1295 fun cacheWrap (env, exp, typ, args, index) =
|
ziv@2265
|
1296 let
|
ziv@2265
|
1297 val loc = dummyLoc
|
ziv@2265
|
1298 val rel0 = (ERel 0, loc)
|
ziv@2265
|
1299 in
|
ziv@2271
|
1300 case MonoFooify.urlify env (rel0, typ) of
|
ziv@2265
|
1301 NONE => NONE
|
ziv@2265
|
1302 | SOME urlified =>
|
ziv@2265
|
1303 let
|
ziv@2265
|
1304 (* We ensure before this step that all arguments aren't effectful.
|
ziv@2265
|
1305 by turning them into local variables as needed. *)
|
ziv@2265
|
1306 val argsInc = map (incRels 1) args
|
ziv@2268
|
1307 val check = (check (index, args), loc)
|
ziv@2268
|
1308 val store = (store (index, argsInc, urlified), loc)
|
ziv@2265
|
1309 in
|
ziv@2271
|
1310 SOME (ECase (check,
|
ziv@2271
|
1311 [((PNone stringTyp, loc),
|
ziv@2273
|
1312 (ELet ("q", typ, exp, (ESeq (store, rel0), loc)), loc)),
|
ziv@2273
|
1313 ((PSome (stringTyp, (PVar ("hit", stringTyp), loc)), loc),
|
ziv@2271
|
1314 (* Boolean is false because we're not unurlifying from a cookie. *)
|
ziv@2271
|
1315 (EUnurlify (rel0, typ, false), loc))],
|
ziv@2271
|
1316 {disc = (TOption stringTyp, loc), result = typ}))
|
ziv@2265
|
1317 end
|
ziv@2265
|
1318 end
|
ziv@2265
|
1319
|
ziv@2258
|
1320 val expSize = MonoUtil.Exp.fold {typ = #2, exp = fn (_, n) => n+1} 0
|
ziv@2258
|
1321
|
ziv@2259
|
1322 (* TODO: pick a number. *)
|
ziv@2278
|
1323 val sizeWorthCaching = 5
|
ziv@2259
|
1324
|
ziv@2269
|
1325 val worthCaching =
|
ziv@2269
|
1326 fn EQuery _ => true
|
ziv@2269
|
1327 | exp' => expSize (exp', dummyLoc) > sizeWorthCaching
|
ziv@2269
|
1328
|
ziv@2273
|
1329 fun cacheExp (env, exp', invalInfo, state : state) =
|
ziv@2294
|
1330 case worthCaching exp' <\oguard\> (fn _ => typOfExp' env exp') of
|
ziv@2269
|
1331 NONE => NONE
|
ziv@2269
|
1332 | SOME (TFun _, _) => NONE
|
ziv@2269
|
1333 | SOME typ =>
|
ziv@2299
|
1334 InvalInfo.orderArgs (invalInfo, (exp', dummyLoc))
|
ziv@2299
|
1335 <\obind\>
|
ziv@2299
|
1336 (fn args =>
|
ziv@2299
|
1337 List.foldr (fn (arg, acc) =>
|
ziv@2299
|
1338 acc
|
ziv@2299
|
1339 <\obind\>
|
ziv@2299
|
1340 (fn args' =>
|
ziv@2299
|
1341 (case arg of
|
ziv@2299
|
1342 AsIs exp => SOME exp
|
ziv@2299
|
1343 | Urlify exp =>
|
ziv@2299
|
1344 typOfExp env exp
|
ziv@2299
|
1345 <\obind\>
|
ziv@2299
|
1346 (fn typ => (MonoFooify.urlify env (exp, typ))))
|
ziv@2299
|
1347 <\obind\>
|
ziv@2299
|
1348 (fn arg' => SOME (arg' :: args'))))
|
ziv@2299
|
1349 (SOME [])
|
ziv@2299
|
1350 args
|
ziv@2299
|
1351 <\obind\>
|
ziv@2299
|
1352 (fn args' =>
|
ziv@2299
|
1353 cacheWrap (env, (exp', dummyLoc), typ, args', #index state)
|
ziv@2299
|
1354 <\obind\>
|
ziv@2299
|
1355 (fn cachedExp =>
|
ziv@2299
|
1356 SOME (cachedExp,
|
ziv@2299
|
1357 InvalInfo.updateState (invalInfo, length args', state)))))
|
ziv@2269
|
1358
|
ziv@2271
|
1359 fun cacheQuery (effs, env, q) : subexp =
|
ziv@2266
|
1360 let
|
ziv@2266
|
1361 (* We use dummyTyp here. I think this is okay because databases don't
|
ziv@2266
|
1362 store (effectful) functions, but perhaps there's some pathalogical
|
ziv@2266
|
1363 corner case missing.... *)
|
ziv@2266
|
1364 fun safe bound =
|
ziv@2266
|
1365 not
|
ziv@2266
|
1366 o effectful effs
|
ziv@2266
|
1367 (iterate (fn env => MonoEnv.pushERel env "_" dummyTyp NONE)
|
ziv@2266
|
1368 bound
|
ziv@2266
|
1369 env)
|
ziv@2271
|
1370 val {query = queryText, initial, body, ...} = q
|
ziv@2266
|
1371 val attempt =
|
ziv@2266
|
1372 (* Ziv misses Haskell's do notation.... *)
|
ziv@2295
|
1373 (safe 0 queryText andalso safe 0 initial andalso safe 2 body)
|
ziv@2273
|
1374 <\oguard\>
|
ziv@2294
|
1375 (fn _ =>
|
ziv@2295
|
1376 Sql.parse Sql.query queryText
|
ziv@2294
|
1377 <\obind\>
|
ziv@2294
|
1378 (fn queryParsed =>
|
ziv@2294
|
1379 let
|
ziv@2294
|
1380 val invalInfo = InvalInfo.singleton queryParsed
|
ziv@2294
|
1381 fun mkExp state =
|
ziv@2294
|
1382 case cacheExp (env, EQuery q, invalInfo, state) of
|
ziv@2294
|
1383 NONE => ((EQuery q, dummyLoc), state)
|
ziv@2294
|
1384 | SOME (cachedExp, state) => ((cachedExp, dummyLoc), state)
|
ziv@2294
|
1385 in
|
ziv@2294
|
1386 SOME (Cachable (invalInfo, mkExp))
|
ziv@2294
|
1387 end))
|
ziv@2266
|
1388 in
|
ziv@2266
|
1389 case attempt of
|
ziv@2271
|
1390 NONE => Impure (EQuery q, dummyLoc)
|
ziv@2271
|
1391 | SOME subexp => subexp
|
ziv@2266
|
1392 end
|
ziv@2266
|
1393
|
ziv@2278
|
1394 fun cacheTree (effs : IS.set) ((env, exp as (exp', loc)), state) =
|
ziv@2250
|
1395 let
|
ziv@2271
|
1396 fun wrapBindN (f : exp list -> exp')
|
ziv@2271
|
1397 (args : ((MonoEnv.env * exp) * unbind) list) =
|
ziv@2250
|
1398 let
|
ziv@2271
|
1399 val (subexps, state) =
|
ziv@2271
|
1400 ListUtil.foldlMap (cacheTree effs)
|
ziv@2271
|
1401 state
|
ziv@2271
|
1402 (map #1 args)
|
ziv@2268
|
1403 fun mkExp state = mapFst (fn exps => (f exps, loc))
|
ziv@2268
|
1404 (ListUtil.foldlMap runSubexp state subexps)
|
ziv@2271
|
1405 val attempt =
|
ziv@2271
|
1406 if List.exists isImpure subexps
|
ziv@2271
|
1407 then NONE
|
ziv@2271
|
1408 else (List.foldl (omap2 InvalInfo.union)
|
ziv@2271
|
1409 (SOME InvalInfo.empty)
|
ziv@2271
|
1410 (ListPair.map
|
ziv@2271
|
1411 (fn (subexp, (_, unbinds)) =>
|
ziv@2271
|
1412 InvalInfo.unbind (invalInfoOfSubexp subexp, unbinds))
|
ziv@2271
|
1413 (subexps, args)))
|
ziv@2273
|
1414 <\obind\>
|
ziv@2294
|
1415 (fn invalInfo =>
|
ziv@2294
|
1416 SOME (Cachable (invalInfo,
|
ziv@2294
|
1417 fn state =>
|
ziv@2294
|
1418 case cacheExp (env,
|
ziv@2294
|
1419 f (map (#2 o #1) args),
|
ziv@2294
|
1420 invalInfo,
|
ziv@2294
|
1421 state) of
|
ziv@2294
|
1422 NONE => mkExp state
|
ziv@2294
|
1423 | SOME (e', state) => ((e', loc), state)),
|
ziv@2294
|
1424 state))
|
ziv@2250
|
1425 in
|
ziv@2271
|
1426 case attempt of
|
ziv@2271
|
1427 SOME (subexp, state) => (subexp, state)
|
ziv@2271
|
1428 | NONE => mapFst Impure (mkExp state)
|
ziv@2250
|
1429 end
|
ziv@2250
|
1430 fun wrapBind1 f arg =
|
ziv@2289
|
1431 wrapBindN (fn [arg] => f arg
|
ziv@2289
|
1432 | _ => raise Fail "Sqlcache: cacheTree (a)") [arg]
|
ziv@2250
|
1433 fun wrapBind2 f (arg1, arg2) =
|
ziv@2289
|
1434 wrapBindN (fn [arg1, arg2] => f (arg1, arg2)
|
ziv@2289
|
1435 | _ => raise Fail "Sqlcache: cacheTree (b)") [arg1, arg2]
|
ziv@2271
|
1436 fun wrapN f es = wrapBindN f (map (fn e => ((env, e), Unknowns 0)) es)
|
ziv@2271
|
1437 fun wrap1 f e = wrapBind1 f ((env, e), Unknowns 0)
|
ziv@2271
|
1438 fun wrap2 f (e1, e2) = wrapBind2 f (((env, e1), Unknowns 0), ((env, e2), Unknowns 0))
|
ziv@2250
|
1439 in
|
ziv@2250
|
1440 case exp' of
|
ziv@2250
|
1441 ECon (dk, pc, SOME e) => wrap1 (fn e => ECon (dk, pc, SOME e)) e
|
ziv@2250
|
1442 | ESome (t, e) => wrap1 (fn e => ESome (t, e)) e
|
ziv@2250
|
1443 | EFfiApp (s1, s2, args) =>
|
ziv@2258
|
1444 if ffiEffectful (s1, s2)
|
ziv@2266
|
1445 then (Impure exp, state)
|
ziv@2258
|
1446 else wrapN (fn es =>
|
ziv@2258
|
1447 EFfiApp (s1, s2, ListPair.map (fn (e, (_, t)) => (e, t)) (es, args)))
|
ziv@2258
|
1448 (map #1 args)
|
ziv@2250
|
1449 | EApp (e1, e2) => wrap2 EApp (e1, e2)
|
ziv@2250
|
1450 | EAbs (s, t1, t2, e) =>
|
ziv@2250
|
1451 wrapBind1 (fn e => EAbs (s, t1, t2, e))
|
ziv@2271
|
1452 ((MonoEnv.pushERel env s t1 NONE, e), Unknowns 1)
|
ziv@2250
|
1453 | EUnop (s, e) => wrap1 (fn e => EUnop (s, e)) e
|
ziv@2250
|
1454 | EBinop (bi, s, e1, e2) => wrap2 (fn (e1, e2) => EBinop (bi, s, e1, e2)) (e1, e2)
|
ziv@2250
|
1455 | ERecord fields =>
|
ziv@2250
|
1456 wrapN (fn es => ERecord (ListPair.map (fn (e, (s, _, t)) => (s, e, t)) (es, fields)))
|
ziv@2250
|
1457 (map #2 fields)
|
ziv@2250
|
1458 | EField (e, s) => wrap1 (fn e => EField (e, s)) e
|
ziv@2250
|
1459 | ECase (e, cases, {disc, result}) =>
|
ziv@2250
|
1460 wrapBindN (fn (e::es) =>
|
ziv@2250
|
1461 ECase (e,
|
ziv@2250
|
1462 (ListPair.map (fn (e, (p, _)) => (p, e)) (es, cases)),
|
ziv@2256
|
1463 {disc = disc, result = result})
|
ziv@2289
|
1464 | _ => raise Fail "Sqlcache: cacheTree (c)")
|
ziv@2271
|
1465 (((env, e), Unknowns 0)
|
ziv@2271
|
1466 :: map (fn (p, e) =>
|
ziv@2271
|
1467 ((MonoEnv.patBinds env p, e), Unknowns (MonoEnv.patBindsN p)))
|
ziv@2271
|
1468 cases)
|
ziv@2250
|
1469 | EStrcat (e1, e2) => wrap2 EStrcat (e1, e2)
|
ziv@2250
|
1470 (* We record page writes, so they're cachable. *)
|
ziv@2250
|
1471 | EWrite e => wrap1 EWrite e
|
ziv@2250
|
1472 | ESeq (e1, e2) => wrap2 ESeq (e1, e2)
|
ziv@2250
|
1473 | ELet (s, t, e1, e2) =>
|
ziv@2250
|
1474 wrapBind2 (fn (e1, e2) => ELet (s, t, e1, e2))
|
ziv@2271
|
1475 (((env, e1), Unknowns 0),
|
ziv@2271
|
1476 ((MonoEnv.pushERel env s t (SOME e1), e2), Known e1))
|
ziv@2250
|
1477 (* ASK: | EClosure (n, es) => ? *)
|
ziv@2250
|
1478 | EUnurlify (e, t, b) => wrap1 (fn e => EUnurlify (e, t, b)) e
|
ziv@2271
|
1479 | EQuery q => (cacheQuery (effs, env, q), state)
|
ziv@2269
|
1480 | _ => (if effectful effs env exp
|
ziv@2269
|
1481 then Impure exp
|
ziv@2271
|
1482 else Cachable (InvalInfo.empty,
|
ziv@2271
|
1483 fn state =>
|
ziv@2271
|
1484 case cacheExp (env, exp', InvalInfo.empty, state) of
|
ziv@2269
|
1485 NONE => ((exp', loc), state)
|
ziv@2269
|
1486 | SOME (exp', state) => ((exp', loc), state)),
|
ziv@2269
|
1487 state)
|
ziv@2256
|
1488 end
|
ziv@2256
|
1489
|
ziv@2266
|
1490 fun addCaching file =
|
ziv@2256
|
1491 let
|
ziv@2266
|
1492 val effs = effectfulDecls file
|
ziv@2271
|
1493 fun doTopLevelExp env exp state = runSubexp (cacheTree effs ((env, exp), state))
|
ziv@2256
|
1494 in
|
ziv@2271
|
1495 (fileTopLevelMapfoldB doTopLevelExp
|
ziv@2271
|
1496 file
|
ziv@2271
|
1497 {tableToIndices = SIMM.empty,
|
ziv@2271
|
1498 indexToInvalInfo = IM.empty,
|
ziv@2271
|
1499 ffiInfo = [],
|
ziv@2271
|
1500 index = 0},
|
ziv@2271
|
1501 effs)
|
ziv@2265
|
1502 end
|
ziv@2265
|
1503
|
ziv@2265
|
1504
|
ziv@2265
|
1505 (************)
|
ziv@2265
|
1506 (* Flushing *)
|
ziv@2265
|
1507 (************)
|
ziv@2265
|
1508
|
ziv@2265
|
1509 structure Invalidations = struct
|
ziv@2265
|
1510
|
ziv@2265
|
1511 val loc = dummyLoc
|
ziv@2265
|
1512
|
ziv@2265
|
1513 val optionAtomExpToExp =
|
ziv@2265
|
1514 fn NONE => (ENone stringTyp, loc)
|
ziv@2265
|
1515 | SOME e => (ESome (stringTyp,
|
ziv@2265
|
1516 (case e of
|
ziv@2265
|
1517 DmlRel n => ERel n
|
ziv@2265
|
1518 | Prim p => EPrim p
|
ziv@2265
|
1519 (* TODO: make new type containing only these two. *)
|
ziv@2294
|
1520 | _ => raise Fail "Sqlcache: Invalidations.optionAtomExpToExp",
|
ziv@2265
|
1521 loc)),
|
ziv@2265
|
1522 loc)
|
ziv@2265
|
1523
|
ziv@2265
|
1524 fun eqsToInvalidation numArgs eqs =
|
ziv@2269
|
1525 List.tabulate (numArgs, (fn n => IM.find (eqs, n)))
|
ziv@2265
|
1526
|
ziv@2265
|
1527 (* Tests if [ys] makes [xs] a redundant cache invalidation. [NONE] here
|
ziv@2265
|
1528 represents unknown, which means a wider invalidation. *)
|
ziv@2265
|
1529 val rec madeRedundantBy : atomExp option list * atomExp option list -> bool =
|
ziv@2265
|
1530 fn ([], []) => true
|
ziv@2265
|
1531 | (_ :: xs, NONE :: ys) => madeRedundantBy (xs, ys)
|
ziv@2265
|
1532 | (SOME x :: xs, SOME y :: ys) => (case AtomExpKey.compare (x, y) of
|
ziv@2265
|
1533 EQUAL => madeRedundantBy (xs, ys)
|
ziv@2265
|
1534 | _ => false)
|
ziv@2265
|
1535 | _ => false
|
ziv@2265
|
1536
|
ziv@2271
|
1537 fun invalidations ((invalInfo, numArgs), dml) =
|
ziv@2271
|
1538 let
|
ziv@2271
|
1539 val query = InvalInfo.query invalInfo
|
ziv@2271
|
1540 in
|
ziv@2271
|
1541 (map (map optionAtomExpToExp)
|
ziv@2271
|
1542 o removeRedundant madeRedundantBy
|
ziv@2271
|
1543 o map (eqsToInvalidation numArgs)
|
ziv@2273
|
1544 o conflictMaps)
|
ziv@2274
|
1545 (pairToFormulas (query, dml))
|
ziv@2271
|
1546 end
|
ziv@2265
|
1547
|
ziv@2265
|
1548 end
|
ziv@2265
|
1549
|
ziv@2265
|
1550 val invalidations = Invalidations.invalidations
|
ziv@2265
|
1551
|
ziv@2273
|
1552 fun addFlushing ((file, {tableToIndices, indexToInvalInfo, ffiInfo, ...} : state), effs) =
|
ziv@2265
|
1553 let
|
ziv@2265
|
1554 val flushes = List.concat
|
ziv@2265
|
1555 o map (fn (i, argss) => map (fn args => flush (i, args)) argss)
|
ziv@2265
|
1556 val doExp =
|
ziv@2267
|
1557 fn dmlExp as EDml (dmlText, failureMode) =>
|
ziv@2265
|
1558 let
|
ziv@2265
|
1559 val inval =
|
ziv@2265
|
1560 case Sql.parse Sql.dml dmlText of
|
ziv@2265
|
1561 SOME dmlParsed =>
|
ziv@2271
|
1562 SOME (map (fn i => (case IM.find (indexToInvalInfo, i) of
|
ziv@2271
|
1563 SOME invalInfo =>
|
ziv@2271
|
1564 (i, invalidations (invalInfo, dmlParsed))
|
ziv@2265
|
1565 (* TODO: fail more gracefully. *)
|
ziv@2271
|
1566 (* This probably means invalidating everything.... *)
|
ziv@2289
|
1567 | NONE => raise Fail "Sqlcache: addFlushing (a)"))
|
ziv@2271
|
1568 (SIMM.findList (tableToIndices, tableOfDml dmlParsed)))
|
ziv@2265
|
1569 | NONE => NONE
|
ziv@2265
|
1570 in
|
ziv@2265
|
1571 case inval of
|
ziv@2265
|
1572 (* TODO: fail more gracefully. *)
|
ziv@2289
|
1573 NONE => raise Fail "Sqlcache: addFlushing (b)"
|
ziv@2267
|
1574 | SOME invs => sequence (flushes invs @ [dmlExp])
|
ziv@2265
|
1575 end
|
ziv@2265
|
1576 | e' => e'
|
ziv@2274
|
1577 val file = fileMap doExp file
|
ziv@2274
|
1578
|
ziv@2265
|
1579 in
|
ziv@2268
|
1580 ffiInfoRef := ffiInfo;
|
ziv@2274
|
1581 file
|
ziv@2265
|
1582 end
|
ziv@2265
|
1583
|
ziv@2265
|
1584
|
ziv@2286
|
1585 (***********)
|
ziv@2286
|
1586 (* Locking *)
|
ziv@2286
|
1587 (***********)
|
ziv@2286
|
1588
|
ziv@2288
|
1589 (* TODO: do this less evilly by not relying on specific FFI names, please? *)
|
ziv@2289
|
1590 fun locksNeeded (lockMap : {store : IIMM.multimap, flush : IIMM.multimap}) =
|
ziv@2289
|
1591 MonoUtil.Exp.fold
|
ziv@2289
|
1592 {typ = #2,
|
ziv@2289
|
1593 exp = fn (EFfiApp ("Sqlcache", x, _), state as {store, flush}) =>
|
ziv@2289
|
1594 (case Int.fromString (String.extract (x, 5, NONE)) of
|
ziv@2289
|
1595 NONE => state
|
ziv@2289
|
1596 | SOME index =>
|
ziv@2289
|
1597 if String.isPrefix "flush" x
|
ziv@2289
|
1598 then {store = store, flush = IS.add (flush, index)}
|
ziv@2289
|
1599 else if String.isPrefix "store" x
|
ziv@2289
|
1600 then {store = IS.add (store, index), flush = flush}
|
ziv@2289
|
1601 else state)
|
ziv@2289
|
1602 | (ENamed n, {store, flush}) =>
|
ziv@2289
|
1603 {store = IS.union (store, IIMM.findSet (#store lockMap, n)),
|
ziv@2289
|
1604 flush = IS.union (flush, IIMM.findSet (#flush lockMap, n))}
|
ziv@2289
|
1605 | (_, state) => state}
|
ziv@2289
|
1606 {store = IS.empty, flush = IS.empty}
|
ziv@2289
|
1607
|
ziv@2289
|
1608 fun lockMapOfFile file =
|
ziv@2286
|
1609 transitiveAnalysis
|
ziv@2286
|
1610 (fn ((_, name, _, e, _), state) =>
|
ziv@2289
|
1611 let
|
ziv@2289
|
1612 val locks = locksNeeded state e
|
ziv@2289
|
1613 in
|
ziv@2289
|
1614 {store = IIMM.insertSet (#store state, name, #store locks),
|
ziv@2289
|
1615 flush = IIMM.insertSet (#flush state, name, #flush locks)}
|
ziv@2289
|
1616 end)
|
ziv@2286
|
1617 {store = IIMM.empty, flush = IIMM.empty}
|
ziv@2286
|
1618 file
|
ziv@2286
|
1619
|
ziv@2286
|
1620 fun exports (decls, _) =
|
ziv@2286
|
1621 List.foldl (fn ((DExport (_, _, n, _, _, _), _), ns) => IS.add (ns, n)
|
ziv@2286
|
1622 | (_, ns) => ns)
|
ziv@2286
|
1623 IS.empty
|
ziv@2286
|
1624 decls
|
ziv@2286
|
1625
|
ziv@2288
|
1626 fun wrapLocks (locks, (exp', loc)) =
|
ziv@2288
|
1627 case exp' of
|
ziv@2288
|
1628 EAbs (s, t1, t2, exp) => (EAbs (s, t1, t2, wrapLocks (locks, exp)), loc)
|
ziv@2288
|
1629 | _ => (List.foldr (fn (l, e') => sequence [lock l, e']) exp' locks, loc)
|
ziv@2286
|
1630
|
ziv@2288
|
1631 fun addLocking file =
|
ziv@2288
|
1632 let
|
ziv@2289
|
1633 val lockMap = lockMapOfFile file
|
ziv@2289
|
1634 fun lockList {store, flush} =
|
ziv@2288
|
1635 let
|
ziv@2289
|
1636 val ls = map (fn i => (i, true)) (IS.listItems flush)
|
ziv@2289
|
1637 @ map (fn i => (i, false)) (IS.listItems (IS.difference (store, flush)))
|
ziv@2288
|
1638 in
|
ziv@2288
|
1639 ListMergeSort.sort (fn ((i, _), (j, _)) => i > j) ls
|
ziv@2288
|
1640 end
|
ziv@2289
|
1641 fun locksOfName n =
|
ziv@2294
|
1642 lockList {flush = IIMM.findSet (#flush lockMap, n),
|
ziv@2294
|
1643 store = IIMM.findSet (#store lockMap, n)}
|
ziv@2289
|
1644 val locksOfExp = lockList o locksNeeded lockMap
|
ziv@2288
|
1645 val expts = exports file
|
ziv@2288
|
1646 fun doVal (v as (x, n, t, exp, s)) =
|
ziv@2288
|
1647 if IS.member (expts, n)
|
ziv@2289
|
1648 then (x, n, t, wrapLocks ((locksOfName n), exp), s)
|
ziv@2288
|
1649 else v
|
ziv@2288
|
1650 val doDecl =
|
ziv@2288
|
1651 fn (DVal v, loc) => (DVal (doVal v), loc)
|
ziv@2288
|
1652 | (DValRec vs, loc) => (DValRec (map doVal vs), loc)
|
ziv@2289
|
1653 | (DTask (exp1, exp2), loc) => (DTask (exp1, wrapLocks (locksOfExp exp2, exp2)), loc)
|
ziv@2288
|
1654 | decl => decl
|
ziv@2288
|
1655 in
|
ziv@2288
|
1656 mapFst (map doDecl) file
|
ziv@2288
|
1657 end
|
ziv@2288
|
1658
|
ziv@2286
|
1659
|
ziv@2268
|
1660 (************************)
|
ziv@2268
|
1661 (* Compiler Entry Point *)
|
ziv@2268
|
1662 (************************)
|
ziv@2265
|
1663
|
ziv@2265
|
1664 val inlineSql =
|
ziv@2265
|
1665 let
|
ziv@2265
|
1666 val doExp =
|
ziv@2265
|
1667 (* TODO: EQuery, too? *)
|
ziv@2265
|
1668 (* ASK: should this live in [MonoOpt]? *)
|
ziv@2265
|
1669 fn EDml ((ECase (disc, cases, {disc = dTyp, ...}), loc), failureMode) =>
|
ziv@2265
|
1670 let
|
ziv@2265
|
1671 val newCases = map (fn (p, e) => (p, (EDml (e, failureMode), loc))) cases
|
ziv@2265
|
1672 in
|
ziv@2265
|
1673 ECase (disc, newCases, {disc = dTyp, result = (TRecord [], loc)})
|
ziv@2265
|
1674 end
|
ziv@2265
|
1675 | e => e
|
ziv@2265
|
1676 in
|
ziv@2265
|
1677 fileMap doExp
|
ziv@2265
|
1678 end
|
ziv@2265
|
1679
|
ziv@2262
|
1680 fun insertAfterDatatypes ((decls, sideInfo), newDecls) =
|
ziv@2262
|
1681 let
|
ziv@2262
|
1682 val (datatypes, others) = List.partition (fn (DDatatype _, _) => true | _ => false) decls
|
ziv@2262
|
1683 in
|
ziv@2262
|
1684 (datatypes @ newDecls @ others, sideInfo)
|
ziv@2262
|
1685 end
|
ziv@2262
|
1686
|
ziv@2288
|
1687 val go' = addLocking o addFlushing o addCaching o simplifySql o inlineSql
|
ziv@2256
|
1688
|
ziv@2256
|
1689 fun go file =
|
ziv@2256
|
1690 let
|
ziv@2256
|
1691 (* TODO: do something nicer than [Sql] being in one of two modes. *)
|
ziv@2299
|
1692 val () = (resetFfiInfo ();
|
ziv@2299
|
1693 Sql.sqlcacheMode := true;
|
ziv@2299
|
1694 setHeuristic (Settings.getSqlcacheHeuristic ()))
|
ziv@2262
|
1695 val file = go' file
|
ziv@2262
|
1696 (* Important that this happens after [MonoFooify.urlify] calls! *)
|
ziv@2262
|
1697 val fmDecls = MonoFooify.getNewFmDecls ()
|
ziv@2256
|
1698 val () = Sql.sqlcacheMode := false
|
ziv@2256
|
1699 in
|
ziv@2262
|
1700 insertAfterDatatypes (file, rev fmDecls)
|
ziv@2250
|
1701 end
|
ziv@2250
|
1702
|
ziv@2209
|
1703 end
|