ziv@2213
|
1 structure Sqlcache (* :> SQLCACHE *) = struct
|
ziv@2209
|
2
|
ziv@2209
|
3 open Mono
|
ziv@2209
|
4
|
ziv@2209
|
5 structure IS = IntBinarySet
|
ziv@2209
|
6 structure IM = IntBinaryMap
|
ziv@2213
|
7 structure SK = struct type ord_key = string val compare = String.compare end
|
ziv@2213
|
8 structure SS = BinarySetFn(SK)
|
ziv@2213
|
9 structure SM = BinaryMapFn(SK)
|
ziv@2213
|
10 structure SIMM = MultimapFn(structure KeyMap = SM structure ValSet = IS)
|
ziv@2209
|
11
|
ziv@2216
|
12 (* Filled in by [cacheWrap] during [Sqlcache]. *)
|
ziv@2213
|
13 val ffiInfo : {index : int, params : int} list ref = ref []
|
ziv@2209
|
14
|
ziv@2213
|
15 fun getFfiInfo () = !ffiInfo
|
ziv@2213
|
16
|
ziv@2215
|
17 (* Some FFIs have writing as their only effect, which the caching records. *)
|
ziv@2215
|
18 val ffiEffectful =
|
ziv@2223
|
19 (* ASK: how can this be less hard-coded? *)
|
ziv@2215
|
20 let
|
ziv@2215
|
21 val fs = SS.fromList ["htmlifyInt_w",
|
ziv@2215
|
22 "htmlifyFloat_w",
|
ziv@2215
|
23 "htmlifyString_w",
|
ziv@2215
|
24 "htmlifyBool_w",
|
ziv@2215
|
25 "htmlifyTime_w",
|
ziv@2215
|
26 "attrifyInt_w",
|
ziv@2215
|
27 "attrifyFloat_w",
|
ziv@2215
|
28 "attrifyString_w",
|
ziv@2215
|
29 "attrifyChar_w",
|
ziv@2215
|
30 "urlifyInt_w",
|
ziv@2215
|
31 "urlifyFloat_w",
|
ziv@2215
|
32 "urlifyString_w",
|
ziv@2215
|
33 "urlifyBool_w",
|
ziv@2215
|
34 "urlifyChannel_w"]
|
ziv@2215
|
35 in
|
ziv@2215
|
36 fn (m, f) => Settings.isEffectful (m, f)
|
ziv@2215
|
37 andalso not (m = "Basis" andalso SS.member (fs, f))
|
ziv@2215
|
38 end
|
ziv@2215
|
39
|
ziv@2215
|
40
|
ziv@2215
|
41 (* Effect analysis. *)
|
ziv@2215
|
42
|
ziv@2216
|
43 (* Makes an exception for [EWrite] (which is recorded when caching). *)
|
ziv@2215
|
44 fun effectful doPrint (effs : IS.set) (inFunction : bool) (bound : int) : Mono.exp -> bool =
|
ziv@2215
|
45 (* If result is true, expression is definitely effectful. If result is
|
ziv@2215
|
46 false, then expression is definitely not effectful if effs is fully
|
ziv@2215
|
47 populated. The intended pattern is to use this a number of times equal
|
ziv@2215
|
48 to the number of declarations in a file, Bellman-Ford style. *)
|
ziv@2223
|
49 (* TODO: make incrementing of bound less janky, probably by using [MonoUtil]
|
ziv@2215
|
50 instead of all this. *)
|
ziv@2215
|
51 let
|
ziv@2215
|
52 (* DEBUG: remove printing when done. *)
|
ziv@2215
|
53 fun tru msg = if doPrint then (print (msg ^ "\n"); true) else true
|
ziv@2215
|
54 val rec eff' =
|
ziv@2215
|
55 (* ASK: is there a better way? *)
|
ziv@2215
|
56 fn EPrim _ => false
|
ziv@2215
|
57 (* We don't know if local functions have effects when applied. *)
|
ziv@2215
|
58 | ERel idx => if inFunction andalso idx >= bound
|
ziv@2215
|
59 then tru ("rel" ^ Int.toString idx) else false
|
ziv@2215
|
60 | ENamed name => if IS.member (effs, name) then tru "named" else false
|
ziv@2215
|
61 | ECon (_, _, NONE) => false
|
ziv@2215
|
62 | ECon (_, _, SOME e) => eff e
|
ziv@2215
|
63 | ENone _ => false
|
ziv@2215
|
64 | ESome (_, e) => eff e
|
ziv@2215
|
65 | EFfi (m, f) => if ffiEffectful (m, f) then tru "ffi" else false
|
ziv@2215
|
66 | EFfiApp (m, f, _) => if ffiEffectful (m, f) then tru "ffiapp" else false
|
ziv@2215
|
67 (* ASK: we're calling functions effectful if they have effects when
|
ziv@2215
|
68 applied or if the function expressions themselves have effects.
|
ziv@2215
|
69 Is that okay? *)
|
ziv@2215
|
70 (* This is okay because the values we ultimately care about aren't
|
ziv@2215
|
71 functions, and this is a conservative approximation, anyway. *)
|
ziv@2215
|
72 | EApp (eFun, eArg) => effectful doPrint effs true bound eFun orelse eff eArg
|
ziv@2215
|
73 | EAbs (_, _, _, e) => effectful doPrint effs inFunction (bound+1) e
|
ziv@2215
|
74 | EUnop (_, e) => eff e
|
ziv@2215
|
75 | EBinop (_, _, e1, e2) => eff e1 orelse eff e2
|
ziv@2215
|
76 | ERecord xs => List.exists (fn (_, e, _) => eff e) xs
|
ziv@2215
|
77 | EField (e, _) => eff e
|
ziv@2215
|
78 (* If any case could be effectful, consider it effectful. *)
|
ziv@2215
|
79 | ECase (e, xs, _) => eff e orelse List.exists (fn (_, e) => eff e) xs
|
ziv@2215
|
80 | EStrcat (e1, e2) => eff e1 orelse eff e2
|
ziv@2215
|
81 (* ASK: how should we treat these three? *)
|
ziv@2215
|
82 | EError _ => tru "error"
|
ziv@2215
|
83 | EReturnBlob _ => tru "blob"
|
ziv@2215
|
84 | ERedirect _ => tru "redirect"
|
ziv@2215
|
85 (* EWrite is a special exception because we record writes when caching. *)
|
ziv@2215
|
86 | EWrite _ => false
|
ziv@2215
|
87 | ESeq (e1, e2) => eff e1 orelse eff e2
|
ziv@2215
|
88 (* TODO: keep context of which local variables aren't effectful? Only
|
ziv@2215
|
89 makes a difference for function expressions, though. *)
|
ziv@2215
|
90 | ELet (_, _, eBind, eBody) => eff eBind orelse
|
ziv@2215
|
91 effectful doPrint effs inFunction (bound+1) eBody
|
ziv@2215
|
92 | EClosure (_, es) => List.exists eff es
|
ziv@2215
|
93 (* TODO: deal with EQuery. *)
|
ziv@2215
|
94 | EQuery _ => tru "query"
|
ziv@2215
|
95 | EDml _ => tru "dml"
|
ziv@2215
|
96 | ENextval _ => tru "nextval"
|
ziv@2215
|
97 | ESetval _ => tru "setval"
|
ziv@2215
|
98 | EUnurlify (e, _, _) => eff e
|
ziv@2215
|
99 (* ASK: how should we treat this? *)
|
ziv@2215
|
100 | EJavaScript _ => tru "javascript"
|
ziv@2215
|
101 (* ASK: these are all effectful, right? *)
|
ziv@2215
|
102 | ESignalReturn _ => tru "signalreturn"
|
ziv@2215
|
103 | ESignalBind _ => tru "signalbind"
|
ziv@2215
|
104 | ESignalSource _ => tru "signalsource"
|
ziv@2215
|
105 | EServerCall _ => tru "servercall"
|
ziv@2215
|
106 | ERecv _ => tru "recv"
|
ziv@2215
|
107 | ESleep _ => tru "sleep"
|
ziv@2215
|
108 | ESpawn _ => tru "spawn"
|
ziv@2215
|
109 and eff = fn (e', _) => eff' e'
|
ziv@2215
|
110 in
|
ziv@2215
|
111 eff
|
ziv@2215
|
112 end
|
ziv@2215
|
113
|
ziv@2215
|
114 (* TODO: test this. *)
|
ziv@2215
|
115 val effectfulMap =
|
ziv@2215
|
116 let
|
ziv@2215
|
117 fun doVal ((_, name, _, e, _), effMap) =
|
ziv@2215
|
118 if effectful false effMap false 0 e
|
ziv@2215
|
119 then IS.add (effMap, name)
|
ziv@2215
|
120 else effMap
|
ziv@2215
|
121 val doDecl =
|
ziv@2215
|
122 fn (DVal v, effMap) => doVal (v, effMap)
|
ziv@2215
|
123 (* Repeat the list of declarations a number of times equal to its size. *)
|
ziv@2215
|
124 | (DValRec vs, effMap) =>
|
ziv@2215
|
125 List.foldl doVal effMap (List.concat (List.map (fn _ => vs) vs))
|
ziv@2215
|
126 (* ASK: any other cases? *)
|
ziv@2215
|
127 | (_, effMap) => effMap
|
ziv@2215
|
128 in
|
ziv@2215
|
129 MonoUtil.File.fold {typ = #2, exp = #2, decl = doDecl} IS.empty
|
ziv@2215
|
130 end
|
ziv@2215
|
131
|
ziv@2215
|
132
|
ziv@2216
|
133 (* Boolean formula normalization. *)
|
ziv@2216
|
134
|
ziv@2216
|
135 datatype normalForm = Cnf | Dnf
|
ziv@2216
|
136
|
ziv@2216
|
137 datatype 'atom formula =
|
ziv@2216
|
138 Atom of 'atom
|
ziv@2216
|
139 | Negate of 'atom formula
|
ziv@2216
|
140 | Combo of normalForm * 'atom formula list
|
ziv@2216
|
141
|
ziv@2216
|
142 val flipNf = fn Cnf => Dnf | Dnf => Cnf
|
ziv@2216
|
143
|
ziv@2216
|
144 fun bind xs f = List.concat (map f xs)
|
ziv@2216
|
145
|
ziv@2216
|
146 val rec cartesianProduct : 'a list list -> 'a list list =
|
ziv@2216
|
147 fn [] => [[]]
|
ziv@2216
|
148 | (xs :: xss) => bind (cartesianProduct xss)
|
ziv@2216
|
149 (fn ys => bind xs (fn x => [x :: ys]))
|
ziv@2216
|
150
|
ziv@2218
|
151 (* Pushes all negation to the atoms.*)
|
ziv@2218
|
152 fun pushNegate (negate : 'atom -> 'atom) (negating : bool) =
|
ziv@2218
|
153 fn Atom x => Atom (if negating then negate x else x)
|
ziv@2218
|
154 | Negate f => pushNegate negate (not negating) f
|
ziv@2218
|
155 | Combo (n, fs) => Combo (if negating then flipNf n else n, map (pushNegate negate negating) fs)
|
ziv@2218
|
156
|
ziv@2218
|
157 val rec flatten =
|
ziv@2218
|
158 fn Combo (n, fs) =>
|
ziv@2218
|
159 Combo (n, List.foldr (fn (f, acc) =>
|
ziv@2218
|
160 case f of
|
ziv@2218
|
161 Combo (n', fs') => if n = n' then fs' @ acc else f :: acc
|
ziv@2218
|
162 | _ => f :: acc)
|
ziv@2218
|
163 []
|
ziv@2218
|
164 (map flatten fs))
|
ziv@2218
|
165 | f => f
|
ziv@2218
|
166
|
ziv@2218
|
167 fun normalize' (negate : 'atom -> 'atom) (norm : normalForm) =
|
ziv@2216
|
168 fn Atom x => [[x]]
|
ziv@2218
|
169 | Negate f => map (map negate) (normalize' negate (flipNf norm) f)
|
ziv@2216
|
170 | Combo (n, fs) =>
|
ziv@2216
|
171 let
|
ziv@2218
|
172 val fss = bind fs (normalize' negate n)
|
ziv@2216
|
173 in
|
ziv@2216
|
174 if n = norm then fss else cartesianProduct fss
|
ziv@2216
|
175 end
|
ziv@2216
|
176
|
ziv@2218
|
177 fun normalize negate norm = normalize' negate norm o flatten o pushNegate negate false
|
ziv@2216
|
178
|
ziv@2221
|
179 fun mapFormula mf =
|
ziv@2221
|
180 fn Atom x => Atom (mf x)
|
ziv@2221
|
181 | Negate f => Negate (mapFormula mf f)
|
ziv@2221
|
182 | Combo (n, fs) => Combo (n, map (mapFormula mf) fs)
|
ziv@2216
|
183
|
ziv@2215
|
184 (* SQL analysis. *)
|
ziv@2213
|
185
|
ziv@2216
|
186 val rec chooseTwos : 'a list -> ('a * 'a) list =
|
ziv@2216
|
187 fn [] => []
|
ziv@2216
|
188 | x :: ys => map (fn y => (x, y)) ys @ chooseTwos ys
|
ziv@2213
|
189
|
ziv@2216
|
190 datatype atomExp =
|
ziv@2216
|
191 QueryArg of int
|
ziv@2216
|
192 | DmlRel of int
|
ziv@2216
|
193 | Prim of Prim.t
|
ziv@2216
|
194 | Field of string * string
|
ziv@2216
|
195
|
ziv@2218
|
196 val equalAtomExp =
|
ziv@2218
|
197 let
|
ziv@2218
|
198 val isEqual = fn EQUAL => true | _ => false
|
ziv@2218
|
199 in
|
ziv@2218
|
200 fn (QueryArg n1, QueryArg n2) => n1 = n2
|
ziv@2218
|
201 | (DmlRel n1, DmlRel n2) => n1 = n2
|
ziv@2218
|
202 | (Prim p1, Prim p2) => isEqual (Prim.compare (p1, p2))
|
ziv@2218
|
203 | (Field (t1, f1), Field (t2, f2)) => isEqual (String.compare (t1 ^ "." ^ f1, t2 ^ "." ^ f2))
|
ziv@2218
|
204 | _ => false
|
ziv@2218
|
205 end
|
ziv@2218
|
206
|
ziv@2216
|
207 structure AtomExpKey : ORD_KEY = struct
|
ziv@2216
|
208
|
ziv@2216
|
209 type ord_key = atomExp
|
ziv@2216
|
210
|
ziv@2216
|
211 val compare =
|
ziv@2216
|
212 fn (QueryArg n1, QueryArg n2) => Int.compare (n1, n2)
|
ziv@2216
|
213 | (QueryArg _, _) => LESS
|
ziv@2216
|
214 | (_, QueryArg _) => GREATER
|
ziv@2216
|
215 | (DmlRel n1, DmlRel n2) => Int.compare (n1, n2)
|
ziv@2216
|
216 | (DmlRel _, _) => LESS
|
ziv@2216
|
217 | (_, DmlRel _) => GREATER
|
ziv@2216
|
218 | (Prim p1, Prim p2) => Prim.compare (p1, p2)
|
ziv@2216
|
219 | (Prim _, _) => LESS
|
ziv@2216
|
220 | (_, Prim _) => GREATER
|
ziv@2216
|
221 | (Field (t1, f1), Field (t2, f2)) => String.compare (t1 ^ "." ^ f1, t2 ^ "." ^ f2)
|
ziv@2216
|
222
|
ziv@2216
|
223 end
|
ziv@2216
|
224
|
ziv@2216
|
225 structure UF = UnionFindFn(AtomExpKey)
|
ziv@2221
|
226 val conflictMaps : (Sql.cmp * Sql.sqexp * Sql.sqexp) formula
|
ziv@2221
|
227 * (Sql.cmp * Sql.sqexp * Sql.sqexp) formula
|
ziv@2221
|
228 -> atomExp IM.map list =
|
ziv@2221
|
229 let
|
ziv@2216
|
230 val toKnownEquality =
|
ziv@2216
|
231 (* [NONE] here means unkown. Anything that isn't a comparison between
|
ziv@2216
|
232 two knowns shouldn't be used, and simply dropping unused terms is
|
ziv@2216
|
233 okay in disjunctive normal form. *)
|
ziv@2216
|
234 fn (Sql.Eq, SOME e1, SOME e2) => SOME (e1, e2)
|
ziv@2216
|
235 | _ => NONE
|
ziv@2216
|
236 val equivClasses : (Sql.cmp * atomExp option * atomExp option) list -> atomExp list list =
|
ziv@2216
|
237 UF.classes
|
ziv@2216
|
238 o List.foldl UF.union' UF.empty
|
ziv@2216
|
239 o List.mapPartial toKnownEquality
|
ziv@2216
|
240 fun addToEqs (eqs, n, e) =
|
ziv@2216
|
241 case IM.find (eqs, n) of
|
ziv@2216
|
242 (* Comparing to a constant seems better? *)
|
ziv@2218
|
243 SOME (Prim _) => eqs
|
ziv@2216
|
244 | _ => IM.insert (eqs, n, e)
|
ziv@2216
|
245 val accumulateEqs =
|
ziv@2216
|
246 (* [NONE] means we have a contradiction. *)
|
ziv@2216
|
247 fn (_, NONE) => NONE
|
ziv@2216
|
248 | ((Prim p1, Prim p2), eqso) =>
|
ziv@2216
|
249 (case Prim.compare (p1, p2) of
|
ziv@2216
|
250 EQUAL => eqso
|
ziv@2213
|
251 | _ => NONE)
|
ziv@2218
|
252 | ((QueryArg n, Prim p), SOME eqs) => SOME (addToEqs (eqs, n, Prim p))
|
ziv@2218
|
253 | ((QueryArg n, DmlRel r), SOME eqs) => SOME (addToEqs (eqs, n, DmlRel r))
|
ziv@2218
|
254 | ((Prim p, QueryArg n), SOME eqs) => SOME (addToEqs (eqs, n, Prim p))
|
ziv@2218
|
255 | ((DmlRel r, QueryArg n), SOME eqs) => SOME (addToEqs (eqs, n, DmlRel r))
|
ziv@2223
|
256 (* TODO: deal with equalities involving just [DmlRel]s and [Prim]s.
|
ziv@2223
|
257 This would involve guarding the invalidation with a check for the
|
ziv@2223
|
258 relevant comparisons. *)
|
ziv@2216
|
259 | (_, eqso) => eqso
|
ziv@2218
|
260 val eqsOfClass : atomExp list -> atomExp IM.map option =
|
ziv@2216
|
261 List.foldl accumulateEqs (SOME IM.empty)
|
ziv@2216
|
262 o chooseTwos
|
ziv@2216
|
263 fun toAtomExps rel (cmp, e1, e2) =
|
ziv@2216
|
264 let
|
ziv@2216
|
265 val qa =
|
ziv@2216
|
266 (* Here [NONE] means unkown. *)
|
ziv@2216
|
267 fn Sql.SqConst p => SOME (Prim p)
|
ziv@2216
|
268 | Sql.Field tf => SOME (Field tf)
|
ziv@2216
|
269 | Sql.Inj (EPrim p, _) => SOME (Prim p)
|
ziv@2216
|
270 | Sql.Inj (ERel n, _) => SOME (rel n)
|
ziv@2216
|
271 (* We can't deal with anything else. *)
|
ziv@2216
|
272 | _ => NONE
|
ziv@2216
|
273 in
|
ziv@2216
|
274 (cmp, qa e1, qa e2)
|
ziv@2216
|
275 end
|
ziv@2216
|
276 fun negateCmp (cmp, e1, e2) =
|
ziv@2216
|
277 (case cmp of
|
ziv@2216
|
278 Sql.Eq => Sql.Ne
|
ziv@2216
|
279 | Sql.Ne => Sql.Eq
|
ziv@2216
|
280 | Sql.Lt => Sql.Ge
|
ziv@2216
|
281 | Sql.Le => Sql.Gt
|
ziv@2216
|
282 | Sql.Gt => Sql.Le
|
ziv@2216
|
283 | Sql.Ge => Sql.Lt,
|
ziv@2216
|
284 e1, e2)
|
ziv@2218
|
285 val markQuery : (Sql.cmp * Sql.sqexp * Sql.sqexp) formula ->
|
ziv@2218
|
286 (Sql.cmp * atomExp option * atomExp option) formula =
|
ziv@2218
|
287 mapFormula (toAtomExps QueryArg)
|
ziv@2218
|
288 val markDml : (Sql.cmp * Sql.sqexp * Sql.sqexp) formula ->
|
ziv@2218
|
289 (Sql.cmp * atomExp option * atomExp option) formula =
|
ziv@2218
|
290 mapFormula (toAtomExps DmlRel)
|
ziv@2218
|
291 (* No eqs should have key conflicts because no variable is in two
|
ziv@2218
|
292 equivalence classes, so the [#1] can be anything. *)
|
ziv@2218
|
293 val mergeEqs : (atomExp IntBinaryMap.map option list
|
ziv@2218
|
294 -> atomExp IntBinaryMap.map option) =
|
ziv@2218
|
295 List.foldr (fn (SOME eqs, SOME acc) => SOME (IM.unionWith #1 (eqs, acc)) | _ => NONE)
|
ziv@2218
|
296 (SOME IM.empty)
|
ziv@2218
|
297 fun dnf (fQuery, fDml) =
|
ziv@2218
|
298 normalize negateCmp Dnf (Combo (Cnf, [markQuery fQuery, markDml fDml]))
|
ziv@2221
|
299 in
|
ziv@2221
|
300 List.mapPartial (mergeEqs o map eqsOfClass o equivClasses) o dnf
|
ziv@2221
|
301 end
|
ziv@2213
|
302
|
ziv@2216
|
303 val rec sqexpToFormula =
|
ziv@2216
|
304 fn Sql.SqTrue => Combo (Cnf, [])
|
ziv@2216
|
305 | Sql.SqFalse => Combo (Dnf, [])
|
ziv@2216
|
306 | Sql.SqNot e => Negate (sqexpToFormula e)
|
ziv@2216
|
307 | Sql.Binop (Sql.RCmp c, e1, e2) => Atom (c, e1, e2)
|
ziv@2216
|
308 | Sql.Binop (Sql.RLop l, p1, p2) => Combo (case l of Sql.And => Cnf | Sql.Or => Dnf,
|
ziv@2216
|
309 [sqexpToFormula p1, sqexpToFormula p2])
|
ziv@2216
|
310 (* ASK: any other sqexps that can be props? *)
|
ziv@2216
|
311 | _ => raise Match
|
ziv@2213
|
312
|
ziv@2218
|
313 fun renameTables tablePairs =
|
ziv@2216
|
314 let
|
ziv@2216
|
315 fun renameString table =
|
ziv@2216
|
316 case List.find (fn (_, t) => table = t) tablePairs of
|
ziv@2216
|
317 NONE => table
|
ziv@2216
|
318 | SOME (realTable, _) => realTable
|
ziv@2216
|
319 val renameSqexp =
|
ziv@2216
|
320 fn Sql.Field (table, field) => Sql.Field (renameString table, field)
|
ziv@2216
|
321 | e => e
|
ziv@2218
|
322 fun renameAtom (cmp, e1, e2) = (cmp, renameSqexp e1, renameSqexp e2)
|
ziv@2216
|
323 in
|
ziv@2218
|
324 mapFormula renameAtom
|
ziv@2216
|
325 end
|
ziv@2218
|
326
|
ziv@2218
|
327 val rec queryToFormula =
|
ziv@2218
|
328 fn Sql.Query1 {Where = NONE, ...} => Combo (Cnf, [])
|
ziv@2218
|
329 | Sql.Query1 {From = tablePairs, Where = SOME e, ...} =>
|
ziv@2218
|
330 renameTables tablePairs (sqexpToFormula e)
|
ziv@2216
|
331 | Sql.Union (q1, q2) => Combo (Dnf, [queryToFormula q1, queryToFormula q2])
|
ziv@2216
|
332
|
ziv@2218
|
333 fun valsToFormula (table, vals) =
|
ziv@2218
|
334 Combo (Cnf, map (fn (field, v) => Atom (Sql.Eq, Sql.Field (table, field), v)) vals)
|
ziv@2218
|
335
|
ziv@2216
|
336 val rec dmlToFormula =
|
ziv@2221
|
337 fn Sql.Insert (table, vals) => valsToFormula (table, vals)
|
ziv@2218
|
338 | Sql.Delete (table, wher) => renameTables [(table, "T")] (sqexpToFormula wher)
|
ziv@2218
|
339 | Sql.Update (table, vals, wher) =>
|
ziv@2218
|
340 let
|
ziv@2221
|
341 val fWhere = sqexpToFormula wher
|
ziv@2221
|
342 val fVals = valsToFormula (table, vals)
|
ziv@2221
|
343 (* TODO: don't use field name hack. *)
|
ziv@2221
|
344 val markField =
|
ziv@2221
|
345 fn Sql.Field (t, v) => Sql.Field (t, v ^ "*")
|
ziv@2221
|
346 | e => e
|
ziv@2221
|
347 val mark = mapFormula (fn (cmp, e1, e2) => (cmp, markField e1, markField e2))
|
ziv@2218
|
348 in
|
ziv@2218
|
349 renameTables [(table, "T")]
|
ziv@2221
|
350 (Combo (Dnf, [Combo (Cnf, [fVals, mark fWhere]),
|
ziv@2221
|
351 Combo (Cnf, [mark fVals, fWhere])]))
|
ziv@2218
|
352 end
|
ziv@2213
|
353
|
ziv@2213
|
354 val rec tablesQuery =
|
ziv@2216
|
355 fn Sql.Query1 {From = tablePairs, ...} => SS.fromList (map #1 tablePairs)
|
ziv@2216
|
356 | Sql.Union (q1, q2) => SS.union (tablesQuery q1, tablesQuery q2)
|
ziv@2213
|
357
|
ziv@2213
|
358 val tableDml =
|
ziv@2216
|
359 fn Sql.Insert (tab, _) => tab
|
ziv@2216
|
360 | Sql.Delete (tab, _) => tab
|
ziv@2216
|
361 | Sql.Update (tab, _, _) => tab
|
ziv@2213
|
362
|
ziv@2213
|
363
|
ziv@2213
|
364 (* Program instrumentation. *)
|
ziv@2213
|
365
|
ziv@2215
|
366 fun stringExp s = (EPrim (Prim.String (Prim.Normal, s)), ErrorMsg.dummySpan)
|
ziv@2216
|
367
|
ziv@2213
|
368 val stringTyp = (TFfi ("Basis", "string"), ErrorMsg.dummySpan)
|
ziv@2213
|
369
|
ziv@2213
|
370 val sequence =
|
ziv@2213
|
371 fn (exp :: exps) =>
|
ziv@2213
|
372 let
|
ziv@2213
|
373 val loc = ErrorMsg.dummySpan
|
ziv@2213
|
374 in
|
ziv@2213
|
375 List.foldl (fn (e', seq) => ESeq ((seq, loc), (e', loc))) exp exps
|
ziv@2213
|
376 end
|
ziv@2213
|
377 | _ => raise Match
|
ziv@2213
|
378
|
ziv@2213
|
379 fun ffiAppCache' (func, index, args) : Mono.exp' =
|
ziv@2213
|
380 EFfiApp ("Sqlcache", func ^ Int.toString index, args)
|
ziv@2213
|
381
|
ziv@2215
|
382 fun ffiAppCache (func, index, args) : Mono.exp =
|
ziv@2213
|
383 (ffiAppCache' (func, index, args), ErrorMsg.dummySpan)
|
ziv@2213
|
384
|
ziv@2213
|
385 val varPrefix = "queryResult"
|
ziv@2213
|
386
|
ziv@2213
|
387 fun indexOfName varName =
|
ziv@2213
|
388 if String.isPrefix varPrefix varName
|
ziv@2213
|
389 then Int.fromString (String.extract (varName, String.size varPrefix, NONE))
|
ziv@2213
|
390 else NONE
|
ziv@2213
|
391
|
ziv@2215
|
392 (* Always increments negative indices because that's what we need later. *)
|
ziv@2215
|
393 fun incRelsBound bound inc =
|
ziv@2215
|
394 MonoUtil.Exp.mapB
|
ziv@2215
|
395 {typ = fn x => x,
|
ziv@2215
|
396 exp = fn level =>
|
ziv@2215
|
397 (fn ERel n => ERel (if n >= level orelse n < 0 then n + inc else n)
|
ziv@2215
|
398 | x => x),
|
ziv@2215
|
399 bind = fn (level, MonoUtil.Exp.RelE _) => level + 1 | (level, _) => level}
|
ziv@2215
|
400 bound
|
ziv@2215
|
401
|
ziv@2215
|
402 val incRels = incRelsBound 0
|
ziv@2213
|
403
|
ziv@2223
|
404 fun cacheWrap (query, i, urlifiedRel0, resultTyp, args) =
|
ziv@2213
|
405 let
|
ziv@2223
|
406 val () = ffiInfo := {index = i, params = length args} :: !ffiInfo
|
ziv@2223
|
407 val loc = ErrorMsg.dummySpan
|
ziv@2223
|
408 (* We ensure before this step that all arguments aren't effectful.
|
ziv@2223
|
409 by turning them into local variables as needed. *)
|
ziv@2223
|
410 val argTyps = map (fn e => (e, stringTyp)) args
|
ziv@2223
|
411 val argTypsInc = map (fn (e, typ) => (incRels 1 e, typ)) argTyps
|
ziv@2223
|
412 val check = ffiAppCache ("check", i, argTyps)
|
ziv@2223
|
413 val store = ffiAppCache ("store", i, (urlifiedRel0, stringTyp) :: argTypsInc)
|
ziv@2223
|
414 val rel0 = (ERel 0, loc)
|
ziv@2213
|
415 in
|
ziv@2223
|
416 ECase (check,
|
ziv@2223
|
417 [((PNone stringTyp, loc),
|
ziv@2223
|
418 (ELet ("q", resultTyp, query, (ESeq (store, rel0), loc)), loc)),
|
ziv@2223
|
419 ((PSome (stringTyp, (PVar ("hit", stringTyp), loc)), loc),
|
ziv@2223
|
420 (* Boolean is false because we're not unurlifying from a cookie. *)
|
ziv@2223
|
421 (EUnurlify (rel0, resultTyp, false), loc))],
|
ziv@2223
|
422 {disc = stringTyp, result = resultTyp})
|
ziv@2213
|
423 end
|
ziv@2213
|
424
|
ziv@2213
|
425 fun fileMapfold doExp file start =
|
ziv@2213
|
426 case MonoUtil.File.mapfold {typ = Search.return2,
|
ziv@2213
|
427 exp = fn x => (fn s => Search.Continue (doExp x s)),
|
ziv@2213
|
428 decl = Search.return2} file start of
|
ziv@2213
|
429 Search.Continue x => x
|
ziv@2213
|
430 | Search.Return _ => raise Match
|
ziv@2213
|
431
|
ziv@2213
|
432 fun fileMap doExp file = #1 (fileMapfold (fn x => fn _ => (doExp x, ())) file ())
|
ziv@2213
|
433
|
ziv@2221
|
434 fun factorOutNontrivial text =
|
ziv@2221
|
435 let
|
ziv@2221
|
436 val loc = ErrorMsg.dummySpan
|
ziv@2221
|
437 fun strcat (e1, e2) = (EStrcat (e1, e2), loc)
|
ziv@2221
|
438 val chunks = Sql.chunkify text
|
ziv@2221
|
439 val (newText, newVariables) =
|
ziv@2221
|
440 (* Important that this is foldr (to oppose foldl below). *)
|
ziv@2221
|
441 List.foldr
|
ziv@2221
|
442 (fn (chunk, (qText, newVars)) =>
|
ziv@2221
|
443 (* Variable bound to the head of newBs will have the lowest index. *)
|
ziv@2221
|
444 case chunk of
|
ziv@2221
|
445 Sql.Exp (e as (EPrim _, _)) => (strcat (e, qText), newVars)
|
ziv@2221
|
446 | Sql.Exp e =>
|
ziv@2221
|
447 let
|
ziv@2221
|
448 val n = length newVars
|
ziv@2221
|
449 in
|
ziv@2221
|
450 (* This is the (n + 1)th new variable, so there are
|
ziv@2221
|
451 already n new variables bound, so we increment
|
ziv@2221
|
452 indices by n. *)
|
ziv@2221
|
453 (strcat ((ERel (~(n+1)), loc), qText), incRels n e :: newVars)
|
ziv@2221
|
454 end
|
ziv@2221
|
455 | Sql.String s => (strcat (stringExp s, qText), newVars))
|
ziv@2221
|
456 (stringExp "", [])
|
ziv@2221
|
457 chunks
|
ziv@2221
|
458 fun wrapLets e' =
|
ziv@2221
|
459 (* Important that this is foldl (to oppose foldr above). *)
|
ziv@2221
|
460 List.foldl (fn (v, e') => ELet ("sqlArgz", stringTyp, v, (e', loc)))
|
ziv@2221
|
461 e'
|
ziv@2221
|
462 newVariables
|
ziv@2221
|
463 val numArgs = length newVariables
|
ziv@2221
|
464 in
|
ziv@2221
|
465 (newText, wrapLets, numArgs)
|
ziv@2221
|
466 end
|
ziv@2221
|
467
|
ziv@2215
|
468 fun addChecking file =
|
ziv@2213
|
469 let
|
ziv@2223
|
470 fun doExp (queryInfo as (tableToIndices, indexToQueryNumArgs, index)) =
|
ziv@2223
|
471 fn e' as EQuery {query = origQueryText,
|
ziv@2223
|
472 sqlcacheInfo = urlifiedRel0,
|
ziv@2223
|
473 state = resultTyp,
|
ziv@2223
|
474 initial, body, tables, exps} =>
|
ziv@2213
|
475 let
|
ziv@2221
|
476 val (newQueryText, wrapLets, numArgs) = factorOutNontrivial origQueryText
|
ziv@2215
|
477 (* Increment once for each new variable just made. *)
|
ziv@2221
|
478 val queryExp = incRels numArgs
|
ziv@2215
|
479 (EQuery {query = newQueryText,
|
ziv@2223
|
480 sqlcacheInfo = urlifiedRel0,
|
ziv@2223
|
481 state = resultTyp,
|
ziv@2215
|
482 initial = initial,
|
ziv@2215
|
483 body = body,
|
ziv@2215
|
484 tables = tables,
|
ziv@2223
|
485 exps = exps},
|
ziv@2223
|
486 ErrorMsg.dummySpan)
|
ziv@2215
|
487 val (EQuery {query = queryText, ...}, _) = queryExp
|
ziv@2221
|
488 val () = Print.preface ("sqlcache> ", (MonoPrint.p_exp MonoEnv.empty queryText))
|
ziv@2221
|
489 val args = List.tabulate (numArgs, fn n => (ERel n, ErrorMsg.dummySpan))
|
ziv@2213
|
490 fun bind x f = Option.mapPartial f x
|
ziv@2215
|
491 fun guard b x = if b then x else NONE
|
ziv@2215
|
492 (* DEBUG: set first boolean argument to true to turn on printing. *)
|
ziv@2215
|
493 fun safe bound = not o effectful true (effectfulMap file) false bound
|
ziv@2213
|
494 val attempt =
|
ziv@2213
|
495 (* Ziv misses Haskell's do notation.... *)
|
ziv@2215
|
496 guard (safe 0 queryText andalso safe 0 initial andalso safe 2 body) (
|
ziv@2216
|
497 bind (Sql.parse Sql.query queryText) (fn queryParsed =>
|
ziv@2223
|
498 SOME (wrapLets (cacheWrap (queryExp, index, urlifiedRel0, resultTyp, args)),
|
ziv@2218
|
499 (SS.foldr (fn (tab, qi) => SIMM.insert (qi, tab, index))
|
ziv@2218
|
500 tableToIndices
|
ziv@2218
|
501 (tablesQuery queryParsed),
|
ziv@2223
|
502 IM.insert (indexToQueryNumArgs, index, (queryParsed, numArgs)),
|
ziv@2223
|
503 index + 1))))
|
ziv@2213
|
504 in
|
ziv@2213
|
505 case attempt of
|
ziv@2213
|
506 SOME pair => pair
|
ziv@2213
|
507 | NONE => (e', queryInfo)
|
ziv@2213
|
508 end
|
ziv@2213
|
509 | e' => (e', queryInfo)
|
ziv@2213
|
510 in
|
ziv@2223
|
511 fileMapfold (fn exp => fn state => doExp state exp) file (SIMM.empty, IM.empty, 0)
|
ziv@2213
|
512 end
|
ziv@2213
|
513
|
ziv@2221
|
514 val gunk : (Sql.query * Sql.dml * Mono.exp list list) list ref = ref []
|
ziv@2221
|
515
|
ziv@2218
|
516 val gunk' : (((Sql.cmp * Sql.sqexp * Sql.sqexp) formula)
|
ziv@2218
|
517 * ((Sql.cmp * Sql.sqexp * Sql.sqexp) formula)) list ref = ref []
|
ziv@2218
|
518
|
ziv@2221
|
519 fun invalidations ((query, numArgs), dml) =
|
ziv@2216
|
520 let
|
ziv@2216
|
521 val loc = ErrorMsg.dummySpan
|
ziv@2218
|
522 val optionAtomExpToExp =
|
ziv@2216
|
523 fn NONE => (ENone stringTyp, loc)
|
ziv@2218
|
524 | SOME e => (ESome (stringTyp,
|
ziv@2218
|
525 (case e of
|
ziv@2218
|
526 DmlRel n => ERel n
|
ziv@2218
|
527 | Prim p => EPrim p
|
ziv@2218
|
528 (* TODO: make new type containing only these two. *)
|
ziv@2218
|
529 | _ => raise Match,
|
ziv@2218
|
530 loc)),
|
ziv@2218
|
531 loc)
|
ziv@2216
|
532 fun eqsToInvalidation eqs =
|
ziv@2216
|
533 let
|
ziv@2218
|
534 fun inv n = if n < 0 then [] else IM.find (eqs, n) :: inv (n - 1)
|
ziv@2216
|
535 in
|
ziv@2221
|
536 inv (numArgs - 1)
|
ziv@2216
|
537 end
|
ziv@2221
|
538 (* Tests if [ys] makes [xs] a redundant cache invalidation. [NONE] here
|
ziv@2221
|
539 represents unknown, which means a wider invalidation. *)
|
ziv@2218
|
540 val rec madeRedundantBy : atomExp option list * atomExp option list -> bool =
|
ziv@2218
|
541 fn ([], []) => true
|
ziv@2218
|
542 | (NONE :: xs, _ :: ys) => madeRedundantBy (xs, ys)
|
ziv@2218
|
543 | (SOME x :: xs, SOME y :: ys) => equalAtomExp (x, y) andalso madeRedundantBy (xs, ys)
|
ziv@2218
|
544 | _ => false
|
ziv@2218
|
545 fun removeRedundant' (xss, yss) =
|
ziv@2218
|
546 case xss of
|
ziv@2218
|
547 [] => yss
|
ziv@2218
|
548 | xs :: xss' =>
|
ziv@2218
|
549 removeRedundant' (xss',
|
ziv@2218
|
550 if List.exists (fn ys => madeRedundantBy (xs, ys)) (xss' @ yss)
|
ziv@2218
|
551 then yss
|
ziv@2218
|
552 else xs :: yss)
|
ziv@2218
|
553 fun removeRedundant xss = removeRedundant' (xss, [])
|
ziv@2218
|
554 val eqss = conflictMaps (queryToFormula query, dmlToFormula dml)
|
ziv@2216
|
555 in
|
ziv@2218
|
556 gunk' := (queryToFormula query, dmlToFormula dml) :: !gunk';
|
ziv@2218
|
557 (map (map optionAtomExpToExp) o removeRedundant o map eqsToInvalidation) eqss
|
ziv@2216
|
558 end
|
ziv@2216
|
559
|
ziv@2218
|
560
|
ziv@2221
|
561 (* gunk := (queryParsed, dmlParsed, invalidations (numArgs, queryParsed, dmlParsed)) :: !gunk); *)
|
ziv@2221
|
562
|
ziv@2223
|
563 fun addFlushing (file, (tableToIndices, indexToQueryNumArgs, _)) =
|
ziv@2213
|
564 let
|
ziv@2221
|
565 (* TODO: write this. *)
|
ziv@2221
|
566 val allInvs = () (* SM.foldr (fn (x, acc) => IS.listItems x @ acc) [] tableToIndices *)
|
ziv@2221
|
567 val flushes = List.concat o
|
ziv@2221
|
568 map (fn (i, argss) =>
|
ziv@2221
|
569 map (fn args =>
|
ziv@2221
|
570 ffiAppCache' ("flush", i,
|
ziv@2221
|
571 map (fn arg => (arg, stringTyp)) args)) argss)
|
ziv@2213
|
572 val doExp =
|
ziv@2221
|
573 fn EDml (origDmlText, failureMode) =>
|
ziv@2213
|
574 let
|
ziv@2221
|
575 val (newDmlText, wrapLets, numArgs) = factorOutNontrivial origDmlText
|
ziv@2221
|
576 val dmlText = incRels numArgs newDmlText
|
ziv@2221
|
577 val dmlExp = EDml (dmlText, failureMode)
|
ziv@2221
|
578 val () = Print.preface ("sqlcache> ", (MonoPrint.p_exp MonoEnv.empty dmlText))
|
ziv@2221
|
579 val invs =
|
ziv@2216
|
580 case Sql.parse Sql.dml dmlText of
|
ziv@2218
|
581 SOME dmlParsed =>
|
ziv@2221
|
582 map (fn i => (case IM.find (indexToQueryNumArgs, i) of
|
ziv@2221
|
583 SOME queryNumArgs =>
|
ziv@2221
|
584 (i, invalidations (queryNumArgs, dmlParsed))
|
ziv@2221
|
585 (* TODO: fail more gracefully. *)
|
ziv@2221
|
586 | NONE => raise Match))
|
ziv@2221
|
587 (SIMM.findList (tableToIndices, tableDml dmlParsed))
|
ziv@2221
|
588 (* TODO: fail more gracefully. *)
|
ziv@2221
|
589 | NONE => raise Match
|
ziv@2213
|
590 in
|
ziv@2221
|
591 wrapLets (sequence (flushes invs @ [dmlExp]))
|
ziv@2213
|
592 end
|
ziv@2213
|
593 | e' => e'
|
ziv@2213
|
594 in
|
ziv@2213
|
595 fileMap doExp file
|
ziv@2213
|
596 end
|
ziv@2213
|
597
|
ziv@2221
|
598 val inlineSql =
|
ziv@2221
|
599 let
|
ziv@2221
|
600 val doExp =
|
ziv@2221
|
601 (* TODO: EQuery, too? *)
|
ziv@2221
|
602 (* ASK: should this live in [MonoOpt]? *)
|
ziv@2221
|
603 fn EDml ((ECase (disc, cases, {disc = dTyp, ...}), loc), failureMode) =>
|
ziv@2221
|
604 let
|
ziv@2221
|
605 val newCases = map (fn (p, e) => (p, (EDml (e, failureMode), loc))) cases
|
ziv@2221
|
606 in
|
ziv@2221
|
607 ECase (disc, newCases, {disc = dTyp, result = (TRecord [], loc)})
|
ziv@2221
|
608 end
|
ziv@2221
|
609 | e => e
|
ziv@2221
|
610 in
|
ziv@2221
|
611 fileMap doExp
|
ziv@2221
|
612 end
|
ziv@2221
|
613
|
ziv@2213
|
614 fun go file =
|
ziv@2213
|
615 let
|
ziv@2213
|
616 val () = Sql.sqlcacheMode := true
|
ziv@2221
|
617 val file' = addFlushing (addChecking (inlineSql file))
|
ziv@2215
|
618 val () = Sql.sqlcacheMode := false
|
ziv@2213
|
619 in
|
ziv@2221
|
620 file'
|
ziv@2213
|
621 end
|
ziv@2213
|
622
|
ziv@2209
|
623 end
|