Mercurial > urweb

annotate src/sqlcache.sml @ 2233:af1585e7d645

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