Mercurial > urweb

annotate src/sqlcache.sml @ 2232:a07b91fa71db

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