Mercurial > urweb

annotate src/sqlcache.sml @ 2265:a647a1560628

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Hard-code Sqlcache module (in Ur/Web) as effectful and reorder sqlcache.sml.
author Ziv Scully <ziv@mit.edu>
date Wed, 14 Oct 2015 00:07:00 -0400
parents bbcf9ba9b39a
children afd12c75e0d6
rev   line source
ziv@2250 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@2250 12 fun iterate f n x = if n < 0
ziv@2250 13 then raise Fail "Can't iterate function negative number of times."
ziv@2250 14 else if n = 0
ziv@2250 15 then x
ziv@2250 16 else iterate f (n-1) (f x)
ziv@2250 17
ziv@2265 18 (* Filled in by [cacheWrap]. *)
ziv@2213 19 val ffiInfo : {index : int, params : int} list ref = ref []
ziv@2209 20
ziv@2227 21 fun resetFfiInfo () = ffiInfo := []
ziv@2227 22
ziv@2213 23 fun getFfiInfo () = !ffiInfo
ziv@2213 24
ziv@2215 25 (* Some FFIs have writing as their only effect, which the caching records. *)
ziv@2215 26 val ffiEffectful =
ziv@2223 27 (* ASK: how can this be less hard-coded? *)
ziv@2215 28 let
ziv@2258 29 val okayWrites = SS.fromList ["htmlifyInt_w",
ziv@2258 30 "htmlifyFloat_w",
ziv@2258 31 "htmlifyString_w",
ziv@2258 32 "htmlifyBool_w",
ziv@2258 33 "htmlifyTime_w",
ziv@2258 34 "attrifyInt_w",
ziv@2258 35 "attrifyFloat_w",
ziv@2258 36 "attrifyString_w",
ziv@2258 37 "attrifyChar_w",
ziv@2258 38 "urlifyInt_w",
ziv@2258 39 "urlifyFloat_w",
ziv@2258 40 "urlifyString_w",
ziv@2258 41 "urlifyBool_w",
ziv@2258 42 "urlifyChannel_w"]
ziv@2215 43 in
ziv@2265 44 (* ASK: is it okay to hardcode Sqlcache functions as effectful? *)
ziv@2215 45 fn (m, f) => Settings.isEffectful (m, f)
ziv@2258 46 andalso not (m = "Basis" andalso SS.member (okayWrites, f))
ziv@2215 47 end
ziv@2215 48
ziv@2234 49 val cache = ref LruCache.cache
ziv@2233 50 fun setCache c = cache := c
ziv@2233 51 fun getCache () = !cache
ziv@2233 52
ziv@2248 53 (* Used to have type context for local variables in MonoUtil functions. *)
ziv@2248 54 val doBind =
ziv@2262 55 fn (env, MonoUtil.Exp.RelE (x, t)) => MonoEnv.pushERel env x t NONE
ziv@2262 56 | (env, MonoUtil.Exp.NamedE (x, n, t, eo, s)) => MonoEnv.pushENamed env x n t eo s
ziv@2262 57 | (env, MonoUtil.Exp.Datatype (x, n, cs)) => MonoEnv.pushDatatype env x n cs
ziv@2215 58
ziv@2248 59
ziv@2248 60 (*******************)
ziv@2248 61 (* Effect Analysis *)
ziv@2248 62 (*******************)
ziv@2215 63
ziv@2216 64 (* Makes an exception for [EWrite] (which is recorded when caching). *)
ziv@2248 65 fun effectful (effs : IS.set) =
ziv@2215 66 let
ziv@2248 67 val isFunction =
ziv@2248 68 fn (TFun _, _) => true
ziv@2248 69 | _ => false
ziv@2250 70 fun doExp (env, e) =
ziv@2248 71 case e of
ziv@2248 72 EPrim _ => false
ziv@2248 73 (* For now: variables of function type might be effectful, but
ziv@2248 74 others are fully evaluated and are therefore not effectful. *)
ziv@2250 75 | ERel n => isFunction (#2 (MonoEnv.lookupERel env n))
ziv@2248 76 | ENamed n => IS.member (effs, n)
ziv@2248 77 | EFfi (m, f) => ffiEffectful (m, f)
ziv@2248 78 | EFfiApp (m, f, _) => ffiEffectful (m, f)
ziv@2248 79 (* These aren't effectful unless a subexpression is. *)
ziv@2248 80 | ECon _ => false
ziv@2248 81 | ENone _ => false
ziv@2248 82 | ESome _ => false
ziv@2248 83 | EApp _ => false
ziv@2248 84 | EAbs _ => false
ziv@2248 85 | EUnop _ => false
ziv@2248 86 | EBinop _ => false
ziv@2248 87 | ERecord _ => false
ziv@2248 88 | EField _ => false
ziv@2248 89 | ECase _ => false
ziv@2248 90 | EStrcat _ => false
ziv@2248 91 (* EWrite is a special exception because we record writes when caching. *)
ziv@2248 92 | EWrite _ => false
ziv@2248 93 | ESeq _ => false
ziv@2248 94 | ELet _ => false
ziv@2250 95 | EUnurlify _ => false
ziv@2248 96 (* ASK: what should we do about closures? *)
ziv@2248 97 (* Everything else is some sort of effect. We could flip this and
ziv@2248 98 explicitly list bits of Mono that are effectful, but this is
ziv@2248 99 conservatively robust to future changes (however unlikely). *)
ziv@2248 100 | _ => true
ziv@2215 101 in
ziv@2248 102 MonoUtil.Exp.existsB {typ = fn _ => false, exp = doExp, bind = doBind}
ziv@2215 103 end
ziv@2215 104
ziv@2215 105 (* TODO: test this. *)
ziv@2252 106 fun effectfulDecls (decls, _) =
ziv@2215 107 let
ziv@2248 108 fun doVal ((_, name, _, e, _), effs) =
ziv@2250 109 if effectful effs MonoEnv.empty e
ziv@2248 110 then IS.add (effs, name)
ziv@2248 111 else effs
ziv@2215 112 val doDecl =
ziv@2248 113 fn ((DVal v, _), effs) => doVal (v, effs)
ziv@2248 114 (* Repeat the list of declarations a number of times equal to its size,
ziv@2248 115 making sure effectfulness propagates everywhere it should. This is
ziv@2248 116 analagous to the Bellman-Ford algorithm. *)
ziv@2248 117 | ((DValRec vs, _), effs) =>
ziv@2248 118 List.foldl doVal effs (List.concat (List.map (fn _ => vs) vs))
ziv@2215 119 (* ASK: any other cases? *)
ziv@2248 120 | (_, effs) => effs
ziv@2215 121 in
ziv@2248 122 List.foldl doDecl IS.empty decls
ziv@2215 123 end
ziv@2215 124
ziv@2215 125
ziv@2248 126 (*********************************)
ziv@2248 127 (* Boolean Formula Normalization *)
ziv@2248 128 (*********************************)
ziv@2216 129
ziv@2234 130 datatype junctionType = Conj | Disj
ziv@2216 131
ziv@2216 132 datatype 'atom formula =
ziv@2216 133 Atom of 'atom
ziv@2216 134 | Negate of 'atom formula
ziv@2234 135 | Combo of junctionType * 'atom formula list
ziv@2216 136
ziv@2243 137 (* Guaranteed to have all negation pushed to the atoms. *)
ziv@2243 138 datatype 'atom formula' =
ziv@2243 139 Atom' of 'atom
ziv@2243 140 | Combo' of junctionType * 'atom formula' list
ziv@2243 141
ziv@2234 142 val flipJt = fn Conj => Disj | Disj => Conj
ziv@2216 143
ziv@2236 144 fun concatMap f xs = 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@2236 148 | (xs :: xss) => concatMap (fn ys => concatMap (fn x => [x :: ys]) xs)
ziv@2236 149 (cartesianProduct xss)
ziv@2216 150
ziv@2218 151 (* Pushes all negation to the atoms.*)
ziv@2244 152 fun pushNegate (normalizeAtom : bool * 'atom -> 'atom) (negating : bool) =
ziv@2244 153 fn Atom x => Atom' (normalizeAtom (negating, x))
ziv@2244 154 | Negate f => pushNegate normalizeAtom (not negating) f
ziv@2244 155 | Combo (j, fs) => Combo' (if negating then flipJt j else j,
ziv@2244 156 map (pushNegate normalizeAtom negating) fs)
ziv@2218 157
ziv@2218 158 val rec flatten =
ziv@2243 159 fn Combo' (_, [f]) => flatten f
ziv@2243 160 | Combo' (j, fs) =>
ziv@2243 161 Combo' (j, List.foldr (fn (f, acc) =>
ziv@2243 162 case f of
ziv@2243 163 Combo' (j', fs') =>
ziv@2243 164 if j = j' orelse length fs' = 1
ziv@2243 165 then fs' @ acc
ziv@2243 166 else f :: acc
ziv@2243 167 | _ => f :: acc)
ziv@2243 168 []
ziv@2243 169 (map flatten fs))
ziv@2218 170 | f => f
ziv@2218 171
ziv@2243 172 (* [simplify] operates on the desired normal form. E.g., if [junc] is [Disj],
ziv@2243 173 consider the list of lists to be a disjunction of conjunctions. *)
ziv@2237 174 fun normalize' (simplify : 'a list list -> 'a list list)
ziv@2235 175 (junc : junctionType) =
ziv@2216 176 let
ziv@2235 177 fun norm junc =
ziv@2237 178 simplify
ziv@2243 179 o (fn Atom' x => [[x]]
ziv@2243 180 | Combo' (j, fs) =>
ziv@2235 181 let
ziv@2236 182 val fss = map (norm junc) fs
ziv@2235 183 in
ziv@2236 184 if j = junc
ziv@2236 185 then List.concat fss
ziv@2236 186 else map List.concat (cartesianProduct fss)
ziv@2235 187 end)
ziv@2216 188 in
ziv@2235 189 norm junc
ziv@2216 190 end
ziv@2216 191
ziv@2244 192 fun normalize simplify normalizeAtom junc =
ziv@2243 193 normalize' simplify junc
ziv@2235 194 o flatten
ziv@2244 195 o pushNegate normalizeAtom false
ziv@2216 196
ziv@2221 197 fun mapFormula mf =
ziv@2221 198 fn Atom x => Atom (mf x)
ziv@2221 199 | Negate f => Negate (mapFormula mf f)
ziv@2235 200 | Combo (j, fs) => Combo (j, map (mapFormula mf) fs)
ziv@2216 201
ziv@2230 202
ziv@2248 203 (****************)
ziv@2248 204 (* SQL Analysis *)
ziv@2248 205 (****************)
ziv@2213 206
ziv@2240 207 structure CmpKey = struct
ziv@2235 208
ziv@2235 209 type ord_key = Sql.cmp
ziv@2235 210
ziv@2235 211 val compare =
ziv@2235 212 fn (Sql.Eq, Sql.Eq) => EQUAL
ziv@2235 213 | (Sql.Eq, _) => LESS
ziv@2235 214 | (_, Sql.Eq) => GREATER
ziv@2235 215 | (Sql.Ne, Sql.Ne) => EQUAL
ziv@2235 216 | (Sql.Ne, _) => LESS
ziv@2235 217 | (_, Sql.Ne) => GREATER
ziv@2235 218 | (Sql.Lt, Sql.Lt) => EQUAL
ziv@2235 219 | (Sql.Lt, _) => LESS
ziv@2235 220 | (_, Sql.Lt) => GREATER
ziv@2235 221 | (Sql.Le, Sql.Le) => EQUAL
ziv@2235 222 | (Sql.Le, _) => LESS
ziv@2235 223 | (_, Sql.Le) => GREATER
ziv@2235 224 | (Sql.Gt, Sql.Gt) => EQUAL
ziv@2235 225 | (Sql.Gt, _) => LESS
ziv@2235 226 | (_, Sql.Gt) => GREATER
ziv@2235 227 | (Sql.Ge, Sql.Ge) => EQUAL
ziv@2235 228
ziv@2235 229 end
ziv@2235 230
ziv@2216 231 val rec chooseTwos : 'a list -> ('a * 'a) list =
ziv@2216 232 fn [] => []
ziv@2216 233 | x :: ys => map (fn y => (x, y)) ys @ chooseTwos ys
ziv@2213 234
ziv@2237 235 fun removeRedundant madeRedundantBy zs =
ziv@2237 236 let
ziv@2237 237 fun removeRedundant' (xs, ys) =
ziv@2237 238 case xs of
ziv@2237 239 [] => ys
ziv@2237 240 | x :: xs' =>
ziv@2237 241 removeRedundant' (xs',
ziv@2237 242 if List.exists (fn y => madeRedundantBy (x, y)) (xs' @ ys)
ziv@2237 243 then ys
ziv@2237 244 else x :: ys)
ziv@2237 245 in
ziv@2237 246 removeRedundant' (zs, [])
ziv@2237 247 end
ziv@2237 248
ziv@2216 249 datatype atomExp =
ziv@2216 250 QueryArg of int
ziv@2216 251 | DmlRel of int
ziv@2216 252 | Prim of Prim.t
ziv@2216 253 | Field of string * string
ziv@2216 254
ziv@2216 255 structure AtomExpKey : ORD_KEY = struct
ziv@2216 256
ziv@2234 257 type ord_key = atomExp
ziv@2216 258
ziv@2234 259 val compare =
ziv@2234 260 fn (QueryArg n1, QueryArg n2) => Int.compare (n1, n2)
ziv@2234 261 | (QueryArg _, _) => LESS
ziv@2234 262 | (_, QueryArg _) => GREATER
ziv@2234 263 | (DmlRel n1, DmlRel n2) => Int.compare (n1, n2)
ziv@2234 264 | (DmlRel _, _) => LESS
ziv@2234 265 | (_, DmlRel _) => GREATER
ziv@2234 266 | (Prim p1, Prim p2) => Prim.compare (p1, p2)
ziv@2234 267 | (Prim _, _) => LESS
ziv@2234 268 | (_, Prim _) => GREATER
ziv@2234 269 | (Field (t1, f1), Field (t2, f2)) =>
ziv@2234 270 case String.compare (t1, t2) of
ziv@2234 271 EQUAL => String.compare (f1, f2)
ziv@2234 272 | ord => ord
ziv@2216 273
ziv@2216 274 end
ziv@2216 275
ziv@2244 276 structure AtomOptionKey = OptionKeyFn(AtomExpKey)
ziv@2244 277
ziv@2216 278 structure UF = UnionFindFn(AtomExpKey)
ziv@2234 279
ziv@2235 280 structure ConflictMaps = struct
ziv@2235 281
ziv@2235 282 structure TK = TripleKeyFn(structure I = CmpKey
ziv@2244 283 structure J = AtomOptionKey
ziv@2244 284 structure K = AtomOptionKey)
ziv@2244 285 structure TS : ORD_SET = BinarySetFn(TK)
ziv@2235 286
ziv@2235 287 val toKnownEquality =
ziv@2235 288 (* [NONE] here means unkown. Anything that isn't a comparison between two
ziv@2235 289 knowns shouldn't be used, and simply dropping unused terms is okay in
ziv@2235 290 disjunctive normal form. *)
ziv@2235 291 fn (Sql.Eq, SOME e1, SOME e2) => SOME (e1, e2)
ziv@2235 292 | _ => NONE
ziv@2235 293
ziv@2235 294 val equivClasses : (Sql.cmp * atomExp option * atomExp option) list -> atomExp list list =
ziv@2235 295 UF.classes
ziv@2235 296 o List.foldl UF.union' UF.empty
ziv@2235 297 o List.mapPartial toKnownEquality
ziv@2235 298
ziv@2235 299 fun addToEqs (eqs, n, e) =
ziv@2235 300 case IM.find (eqs, n) of
ziv@2235 301 (* Comparing to a constant is probably better than comparing to a
ziv@2235 302 variable? Checking that existing constants match a new ones is
ziv@2235 303 handled by [accumulateEqs]. *)
ziv@2235 304 SOME (Prim _) => eqs
ziv@2235 305 | _ => IM.insert (eqs, n, e)
ziv@2235 306
ziv@2235 307 val accumulateEqs =
ziv@2235 308 (* [NONE] means we have a contradiction. *)
ziv@2235 309 fn (_, NONE) => NONE
ziv@2235 310 | ((Prim p1, Prim p2), eqso) =>
ziv@2235 311 (case Prim.compare (p1, p2) of
ziv@2235 312 EQUAL => eqso
ziv@2235 313 | _ => NONE)
ziv@2235 314 | ((QueryArg n, Prim p), SOME eqs) => SOME (addToEqs (eqs, n, Prim p))
ziv@2235 315 | ((QueryArg n, DmlRel r), SOME eqs) => SOME (addToEqs (eqs, n, DmlRel r))
ziv@2235 316 | ((Prim p, QueryArg n), SOME eqs) => SOME (addToEqs (eqs, n, Prim p))
ziv@2235 317 | ((DmlRel r, QueryArg n), SOME eqs) => SOME (addToEqs (eqs, n, DmlRel r))
ziv@2235 318 (* TODO: deal with equalities between [DmlRel]s and [Prim]s.
ziv@2235 319 This would involve guarding the invalidation with a check for the
ziv@2235 320 relevant comparisons. *)
ziv@2235 321 | (_, eqso) => eqso
ziv@2235 322
ziv@2235 323 val eqsOfClass : atomExp list -> atomExp IM.map option =
ziv@2235 324 List.foldl accumulateEqs (SOME IM.empty)
ziv@2235 325 o chooseTwos
ziv@2235 326
ziv@2235 327 fun toAtomExps rel (cmp, e1, e2) =
ziv@2235 328 let
ziv@2235 329 val qa =
ziv@2235 330 (* Here [NONE] means unkown. *)
ziv@2235 331 fn Sql.SqConst p => SOME (Prim p)
ziv@2235 332 | Sql.Field tf => SOME (Field tf)
ziv@2235 333 | Sql.Inj (EPrim p, _) => SOME (Prim p)
ziv@2235 334 | Sql.Inj (ERel n, _) => SOME (rel n)
ziv@2235 335 (* We can't deal with anything else, e.g., CURRENT_TIMESTAMP
ziv@2235 336 becomes Sql.Unmodeled, which becomes NONE here. *)
ziv@2235 337 | _ => NONE
ziv@2235 338 in
ziv@2235 339 (cmp, qa e1, qa e2)
ziv@2235 340 end
ziv@2235 341
ziv@2244 342 val negateCmp =
ziv@2244 343 fn Sql.Eq => Sql.Ne
ziv@2244 344 | Sql.Ne => Sql.Eq
ziv@2244 345 | Sql.Lt => Sql.Ge
ziv@2244 346 | Sql.Le => Sql.Gt
ziv@2244 347 | Sql.Gt => Sql.Le
ziv@2244 348 | Sql.Ge => Sql.Lt
ziv@2244 349
ziv@2244 350 fun normalizeAtom (negating, (cmp, e1, e2)) =
ziv@2244 351 (* Restricting to Le/Lt and sorting the expressions in Eq/Ne helps with
ziv@2244 352 simplification, where we put the triples in sets. *)
ziv@2244 353 case (if negating then negateCmp cmp else cmp) of
ziv@2244 354 Sql.Eq => (case AtomOptionKey.compare (e1, e2) of
ziv@2244 355 LESS => (Sql.Eq, e2, e1)
ziv@2244 356 | _ => (Sql.Eq, e1, e2))
ziv@2244 357 | Sql.Ne => (case AtomOptionKey.compare (e1, e2) of
ziv@2244 358 LESS => (Sql.Ne, e2, e1)
ziv@2244 359 | _ => (Sql.Ne, e1, e2))
ziv@2244 360 | Sql.Lt => (Sql.Lt, e1, e2)
ziv@2244 361 | Sql.Le => (Sql.Le, e1, e2)
ziv@2244 362 | Sql.Gt => (Sql.Lt, e2, e1)
ziv@2244 363 | Sql.Ge => (Sql.Le, e2, e1)
ziv@2235 364
ziv@2235 365 val markQuery : (Sql.cmp * Sql.sqexp * Sql.sqexp) formula ->
ziv@2235 366 (Sql.cmp * atomExp option * atomExp option) formula =
ziv@2235 367 mapFormula (toAtomExps QueryArg)
ziv@2235 368
ziv@2235 369 val markDml : (Sql.cmp * Sql.sqexp * Sql.sqexp) formula ->
ziv@2235 370 (Sql.cmp * atomExp option * atomExp option) formula =
ziv@2235 371 mapFormula (toAtomExps DmlRel)
ziv@2250 372
ziv@2235 373 (* No eqs should have key conflicts because no variable is in two
ziv@2235 374 equivalence classes, so the [#1] could be [#2]. *)
ziv@2235 375 val mergeEqs : (atomExp IntBinaryMap.map option list
ziv@2235 376 -> atomExp IntBinaryMap.map option) =
ziv@2235 377 List.foldr (fn (SOME eqs, SOME acc) => SOME (IM.unionWith #1 (eqs, acc)) | _ => NONE)
ziv@2235 378 (SOME IM.empty)
ziv@2235 379
ziv@2239 380 val simplify =
ziv@2239 381 map TS.listItems
ziv@2239 382 o removeRedundant (fn (x, y) => TS.isSubset (y, x))
ziv@2239 383 o map (fn xs => TS.addList (TS.empty, xs))
ziv@2239 384
ziv@2235 385 fun dnf (fQuery, fDml) =
ziv@2244 386 normalize simplify normalizeAtom Disj (Combo (Conj, [markQuery fQuery, markDml fDml]))
ziv@2235 387
ziv@2235 388 val conflictMaps = List.mapPartial (mergeEqs o map eqsOfClass o equivClasses) o dnf
ziv@2235 389
ziv@2235 390 end
ziv@2235 391
ziv@2235 392 val conflictMaps = ConflictMaps.conflictMaps
ziv@2213 393
ziv@2216 394 val rec sqexpToFormula =
ziv@2234 395 fn Sql.SqTrue => Combo (Conj, [])
ziv@2234 396 | Sql.SqFalse => Combo (Disj, [])
ziv@2216 397 | Sql.SqNot e => Negate (sqexpToFormula e)
ziv@2216 398 | Sql.Binop (Sql.RCmp c, e1, e2) => Atom (c, e1, e2)
ziv@2234 399 | Sql.Binop (Sql.RLop l, p1, p2) => Combo (case l of Sql.And => Conj | Sql.Or => Disj,
ziv@2216 400 [sqexpToFormula p1, sqexpToFormula p2])
ziv@2216 401 (* ASK: any other sqexps that can be props? *)
ziv@2216 402 | _ => raise Match
ziv@2213 403
ziv@2218 404 fun renameTables tablePairs =
ziv@2216 405 let
ziv@2216 406 fun renameString table =
ziv@2216 407 case List.find (fn (_, t) => table = t) tablePairs of
ziv@2216 408 NONE => table
ziv@2216 409 | SOME (realTable, _) => realTable
ziv@2216 410 val renameSqexp =
ziv@2216 411 fn Sql.Field (table, field) => Sql.Field (renameString table, field)
ziv@2216 412 | e => e
ziv@2218 413 fun renameAtom (cmp, e1, e2) = (cmp, renameSqexp e1, renameSqexp e2)
ziv@2216 414 in
ziv@2218 415 mapFormula renameAtom
ziv@2216 416 end
ziv@2218 417
ziv@2218 418 val rec queryToFormula =
ziv@2234 419 fn Sql.Query1 {Where = NONE, ...} => Combo (Conj, [])
ziv@2218 420 | Sql.Query1 {From = tablePairs, Where = SOME e, ...} =>
ziv@2218 421 renameTables tablePairs (sqexpToFormula e)
ziv@2234 422 | Sql.Union (q1, q2) => Combo (Disj, [queryToFormula q1, queryToFormula q2])
ziv@2216 423
ziv@2218 424 fun valsToFormula (table, vals) =
ziv@2234 425 Combo (Conj, map (fn (field, v) => Atom (Sql.Eq, Sql.Field (table, field), v)) vals)
ziv@2218 426
ziv@2216 427 val rec dmlToFormula =
ziv@2221 428 fn Sql.Insert (table, vals) => valsToFormula (table, vals)
ziv@2218 429 | Sql.Delete (table, wher) => renameTables [(table, "T")] (sqexpToFormula wher)
ziv@2218 430 | Sql.Update (table, vals, wher) =>
ziv@2218 431 let
ziv@2221 432 val fWhere = sqexpToFormula wher
ziv@2221 433 val fVals = valsToFormula (table, vals)
ziv@2237 434 val modifiedFields = SS.addList (SS.empty, map #1 vals)
ziv@2221 435 (* TODO: don't use field name hack. *)
ziv@2221 436 val markField =
ziv@2237 437 fn e as Sql.Field (t, v) => if SS.member (modifiedFields, v)
ziv@2237 438 then Sql.Field (t, v ^ "'")
ziv@2237 439 else e
ziv@2221 440 | e => e
ziv@2221 441 val mark = mapFormula (fn (cmp, e1, e2) => (cmp, markField e1, markField e2))
ziv@2218 442 in
ziv@2218 443 renameTables [(table, "T")]
ziv@2234 444 (Combo (Disj, [Combo (Conj, [fVals, mark fWhere]),
ziv@2244 445 Combo (Conj, [mark fVals, fWhere])]))
ziv@2218 446 end
ziv@2213 447
ziv@2213 448 val rec tablesQuery =
ziv@2216 449 fn Sql.Query1 {From = tablePairs, ...} => SS.fromList (map #1 tablePairs)
ziv@2216 450 | Sql.Union (q1, q2) => SS.union (tablesQuery q1, tablesQuery q2)
ziv@2213 451
ziv@2213 452 val tableDml =
ziv@2216 453 fn Sql.Insert (tab, _) => tab
ziv@2216 454 | Sql.Delete (tab, _) => tab
ziv@2216 455 | Sql.Update (tab, _, _) => tab
ziv@2213 456
ziv@2213 457
ziv@2265 458 (*************************************)
ziv@2265 459 (* Program Instrumentation Utilities *)
ziv@2265 460 (*************************************)
ziv@2213 461
ziv@2234 462 val varName =
ziv@2234 463 let
ziv@2234 464 val varNumber = ref 0
ziv@2234 465 in
ziv@2234 466 fn s => (varNumber := !varNumber + 1; s ^ Int.toString (!varNumber))
ziv@2234 467 end
ziv@2234 468
ziv@2233 469 val {check, store, flush, ...} = getCache ()
ziv@2233 470
ziv@2230 471 val dummyLoc = ErrorMsg.dummySpan
ziv@2216 472
ziv@2248 473 val dummyTyp = (TRecord [], dummyLoc)
ziv@2248 474
ziv@2230 475 fun stringExp s = (EPrim (Prim.String (Prim.Normal, s)), dummyLoc)
ziv@2230 476
ziv@2230 477 val stringTyp = (TFfi ("Basis", "string"), dummyLoc)
ziv@2213 478
ziv@2213 479 val sequence =
ziv@2213 480 fn (exp :: exps) =>
ziv@2213 481 let
ziv@2230 482 val loc = dummyLoc
ziv@2213 483 in
ziv@2213 484 List.foldl (fn (e', seq) => ESeq ((seq, loc), (e', loc))) exp exps
ziv@2213 485 end
ziv@2213 486 | _ => raise Match
ziv@2213 487
ziv@2248 488 (* Always increments negative indices as a hack we use later. *)
ziv@2248 489 fun incRels inc =
ziv@2215 490 MonoUtil.Exp.mapB
ziv@2248 491 {typ = fn t' => t',
ziv@2248 492 exp = fn bound =>
ziv@2248 493 (fn ERel n => ERel (if n >= bound orelse n < 0 then n + inc else n)
ziv@2248 494 | e' => e'),
ziv@2248 495 bind = fn (bound, MonoUtil.Exp.RelE _) => bound + 1 | (bound, _) => bound}
ziv@2248 496 0
ziv@2213 497
ziv@2262 498 fun fileTopLevelMapfoldB doTopLevelExp (decls, sideInfo) state =
ziv@2262 499 let
ziv@2262 500 fun doVal env ((x, n, t, exp, s), state) =
ziv@2262 501 let
ziv@2262 502 val (exp, state) = doTopLevelExp env exp state
ziv@2262 503 in
ziv@2262 504 ((x, n, t, exp, s), state)
ziv@2262 505 end
ziv@2262 506 fun doDecl' env (decl', state) =
ziv@2262 507 case decl' of
ziv@2262 508 DVal v =>
ziv@2262 509 let
ziv@2262 510 val (v, state) = doVal env (v, state)
ziv@2262 511 in
ziv@2262 512 (DVal v, state)
ziv@2262 513 end
ziv@2262 514 | DValRec vs =>
ziv@2262 515 let
ziv@2262 516 val (vs, state) = ListUtil.foldlMap (doVal env) state vs
ziv@2262 517 in
ziv@2262 518 (DValRec vs, state)
ziv@2262 519 end
ziv@2262 520 | _ => (decl', state)
ziv@2262 521 fun doDecl (decl as (decl', loc), (env, state)) =
ziv@2262 522 let
ziv@2262 523 val env = MonoEnv.declBinds env decl
ziv@2262 524 val (decl', state) = doDecl' env (decl', state)
ziv@2262 525 in
ziv@2262 526 ((decl', loc), (env, state))
ziv@2262 527 end
ziv@2262 528 val (decls, (_, state)) = (ListUtil.foldlMap doDecl (MonoEnv.empty, state) decls)
ziv@2262 529 in
ziv@2262 530 ((decls, sideInfo), state)
ziv@2262 531 end
ziv@2262 532
ziv@2262 533 fun fileAllMapfoldB doExp file start =
ziv@2248 534 case MonoUtil.File.mapfoldB
ziv@2248 535 {typ = Search.return2,
ziv@2250 536 exp = fn env => fn e' => fn s => Search.Continue (doExp env e' s),
ziv@2248 537 decl = fn _ => Search.return2,
ziv@2248 538 bind = doBind}
ziv@2250 539 MonoEnv.empty file start of
ziv@2213 540 Search.Continue x => x
ziv@2213 541 | Search.Return _ => raise Match
ziv@2213 542
ziv@2262 543 fun fileMap doExp file = #1 (fileAllMapfoldB (fn _ => fn e => fn _ => (doExp e, ())) file ())
ziv@2213 544
ziv@2250 545
ziv@2250 546 (**********************)
ziv@2250 547 (* Mono Type Checking *)
ziv@2250 548 (**********************)
ziv@2250 549
ziv@2250 550 fun typOfExp' (env : MonoEnv.env) : exp' -> typ option =
ziv@2250 551 fn EPrim p => SOME (TFfi ("Basis", case p of
ziv@2250 552 Prim.Int _ => "int"
ziv@2250 553 | Prim.Float _ => "double"
ziv@2250 554 | Prim.String _ => "string"
ziv@2250 555 | Prim.Char _ => "char"),
ziv@2250 556 dummyLoc)
ziv@2250 557 | ERel n => SOME (#2 (MonoEnv.lookupERel env n))
ziv@2250 558 | ENamed n => SOME (#2 (MonoEnv.lookupENamed env n))
ziv@2250 559 (* ASK: okay to make a new [ref] each time? *)
ziv@2250 560 | ECon (dk, PConVar nCon, _) =>
ziv@2250 561 let
ziv@2250 562 val (_, _, nData) = MonoEnv.lookupConstructor env nCon
ziv@2250 563 val (_, cs) = MonoEnv.lookupDatatype env nData
ziv@2250 564 in
ziv@2250 565 SOME (TDatatype (nData, ref (dk, cs)), dummyLoc)
ziv@2250 566 end
ziv@2250 567 | ECon (_, PConFfi {mod = s, datatyp, ...}, _) => SOME (TFfi (s, datatyp), dummyLoc)
ziv@2250 568 | ENone t => SOME (TOption t, dummyLoc)
ziv@2250 569 | ESome (t, _) => SOME (TOption t, dummyLoc)
ziv@2250 570 | EFfi _ => NONE
ziv@2250 571 | EFfiApp _ => NONE
ziv@2250 572 | EApp (e1, e2) => (case typOfExp env e1 of
ziv@2250 573 SOME (TFun (_, t), _) => SOME t
ziv@2250 574 | _ => NONE)
ziv@2250 575 | EAbs (_, t1, t2, _) => SOME (TFun (t1, t2), dummyLoc)
ziv@2250 576 (* ASK: is this right? *)
ziv@2250 577 | EUnop (unop, e) => (case unop of
ziv@2250 578 "!" => SOME (TFfi ("Basis", "bool"), dummyLoc)
ziv@2250 579 | "-" => typOfExp env e
ziv@2250 580 | _ => NONE)
ziv@2250 581 (* ASK: how should this (and other "=> NONE" cases) work? *)
ziv@2250 582 | EBinop _ => NONE
ziv@2250 583 | ERecord fields => SOME (TRecord (map (fn (s, _, t) => (s, t)) fields), dummyLoc)
ziv@2250 584 | EField (e, s) => (case typOfExp env e of
ziv@2250 585 SOME (TRecord fields, _) =>
ziv@2250 586 (case List.find (fn (s', _) => s = s') fields of
ziv@2250 587 SOME (_, t) => SOME t
ziv@2250 588 | _ => NONE)
ziv@2250 589 | _ => NONE)
ziv@2250 590 | ECase (_, _, {result, ...}) => SOME result
ziv@2250 591 | EStrcat _ => SOME (TFfi ("Basis", "string"), dummyLoc)
ziv@2250 592 | EWrite _ => SOME (TRecord [], dummyLoc)
ziv@2250 593 | ESeq (_, e) => typOfExp env e
ziv@2250 594 | ELet (s, t, e1, e2) => typOfExp (MonoEnv.pushERel env s t (SOME e1)) e2
ziv@2250 595 | EClosure _ => NONE
ziv@2250 596 | EUnurlify (_, t, _) => SOME t
ziv@2256 597 | _ => NONE
ziv@2250 598
ziv@2250 599 and typOfExp env (e', loc) = typOfExp' env e'
ziv@2250 600
ziv@2250 601
ziv@2250 602 (*******************************)
ziv@2250 603 (* Caching Pure Subexpressions *)
ziv@2250 604 (*******************************)
ziv@2250 605
ziv@2265 606 fun cacheWrap (env, exp, resultTyp, args, i) =
ziv@2265 607 let
ziv@2265 608 val loc = dummyLoc
ziv@2265 609 val rel0 = (ERel 0, loc)
ziv@2265 610 in
ziv@2265 611 case MonoFooify.urlify env (rel0, resultTyp) of
ziv@2265 612 NONE => NONE
ziv@2265 613 | SOME urlified =>
ziv@2265 614 let
ziv@2265 615 val () = ffiInfo := {index = i, params = length args} :: !ffiInfo
ziv@2265 616 (* We ensure before this step that all arguments aren't effectful.
ziv@2265 617 by turning them into local variables as needed. *)
ziv@2265 618 val argsInc = map (incRels 1) args
ziv@2265 619 val check = (check (i, args), loc)
ziv@2265 620 val store = (store (i, argsInc, urlified), loc)
ziv@2265 621 in
ziv@2265 622 SOME (ECase
ziv@2265 623 (check,
ziv@2265 624 [((PNone stringTyp, loc),
ziv@2265 625 (ELet (varName "q", resultTyp, exp, (ESeq (store, rel0), loc)), loc)),
ziv@2265 626 ((PSome (stringTyp, (PVar (varName "hit", stringTyp), loc)), loc),
ziv@2265 627 (* Boolean is false because we're not unurlifying from a cookie. *)
ziv@2265 628 (EUnurlify (rel0, resultTyp, false), loc))],
ziv@2265 629 {disc = (TOption stringTyp, loc), result = resultTyp}))
ziv@2265 630 end
ziv@2265 631 end
ziv@2265 632
ziv@2257 633 val freeVars =
ziv@2257 634 IS.listItems
ziv@2257 635 o MonoUtil.Exp.foldB
ziv@2257 636 {typ = #2,
ziv@2257 637 exp = fn (bound, ERel n, vars) => if n < bound
ziv@2257 638 then vars
ziv@2257 639 else IS.add (vars, n - bound)
ziv@2257 640 | (_, _, vars) => vars,
ziv@2257 641 bind = fn (bound, MonoUtil.Exp.RelE _) => bound + 1 | (bound, _) => bound}
ziv@2257 642 0
ziv@2257 643 IS.empty
ziv@2257 644
ziv@2258 645 val expSize = MonoUtil.Exp.fold {typ = #2, exp = fn (_, n) => n+1} 0
ziv@2258 646
ziv@2260 647 structure InvalidationInfo :> sig
ziv@2260 648 type t
ziv@2261 649 val empty : t
ziv@2260 650 val fromList : int list -> t
ziv@2260 651 val toList : t -> int list
ziv@2260 652 val union : t * t -> t
ziv@2260 653 val unbind : t * int -> t option
ziv@2260 654 end = struct
ziv@2260 655
ziv@2260 656 (* Keep track of the minimum explicitly. NONE is the empty set. *)
ziv@2260 657 type t = (int * IS.set) option
ziv@2260 658
ziv@2260 659 val fromList =
ziv@2260 660 List.foldl
ziv@2260 661 (fn (n, NONE) => SOME (n, IS.singleton n)
ziv@2260 662 | (n', SOME (n, ns)) => SOME (Int.min (n, n'), IS.add (ns, n')))
ziv@2260 663 NONE
ziv@2260 664
ziv@2261 665 val empty = fromList []
ziv@2261 666
ziv@2260 667 val toList =
ziv@2260 668 fn NONE => []
ziv@2260 669 | SOME (_, ns) => IS.listItems ns
ziv@2260 670
ziv@2260 671 val union =
ziv@2260 672 fn (SOME (n1, ns1), SOME (n2, ns2)) => SOME (Int.min (n1, n2), IS.union (ns1, ns2))
ziv@2261 673 | (NONE, info) => info
ziv@2261 674 | (info, NONE) => info
ziv@2260 675
ziv@2260 676 val unbind =
ziv@2260 677 fn (SOME (n, ns), unbound) =>
ziv@2260 678 let
ziv@2260 679 val n = n - unbound
ziv@2260 680 in
ziv@2260 681 if n < 0
ziv@2260 682 then NONE
ziv@2260 683 else SOME (SOME (n, IS.map (fn n => n - unbound) ns))
ziv@2260 684 end
ziv@2260 685 | _ => SOME NONE
ziv@2260 686
ziv@2260 687 end
ziv@2260 688
ziv@2261 689 val unionUnbind =
ziv@2261 690 List.foldl
ziv@2261 691 (fn (_, NONE) => NONE
ziv@2261 692 | ((info, unbound), SOME infoAcc) =>
ziv@2261 693 case InvalidationInfo.unbind (info, unbound) of
ziv@2261 694 NONE => NONE
ziv@2261 695 | SOME info => SOME (InvalidationInfo.union (info, infoAcc)))
ziv@2261 696 (SOME InvalidationInfo.empty)
ziv@2261 697
ziv@2250 698 datatype subexp = Pure of unit -> exp | Impure of exp
ziv@2250 699
ziv@2250 700 val isImpure =
ziv@2250 701 fn Pure _ => false
ziv@2250 702 | Impure _ => true
ziv@2250 703
ziv@2250 704 val expOfSubexp =
ziv@2250 705 fn Pure f => f ()
ziv@2250 706 | Impure e => e
ziv@2250 707
ziv@2259 708 (* TODO: pick a number. *)
ziv@2259 709 val sizeWorthCaching = 5
ziv@2259 710
ziv@2256 711 fun makeCache (env, exp', index) =
ziv@2256 712 case typOfExp' env exp' of
ziv@2256 713 NONE => NONE
ziv@2256 714 | SOME (TFun _, _) => NONE
ziv@2256 715 | SOME typ =>
ziv@2259 716 if expSize (exp', dummyLoc) < sizeWorthCaching
ziv@2258 717 then NONE
ziv@2258 718 else case List.foldr (fn ((_, _), NONE) => NONE
ziv@2258 719 | ((n, typ), SOME args) =>
ziv@2258 720 case MonoFooify.urlify env ((ERel n, dummyLoc), typ) of
ziv@2258 721 NONE => NONE
ziv@2258 722 | SOME arg => SOME (arg :: args))
ziv@2258 723 (SOME [])
ziv@2258 724 (map (fn n => (n, #2 (MonoEnv.lookupERel env n)))
ziv@2258 725 (freeVars (exp', dummyLoc))) of
ziv@2258 726 NONE => NONE
ziv@2258 727 | SOME args => cacheWrap (env, (exp', dummyLoc), typ, args, index)
ziv@2250 728
ziv@2256 729 fun pureCache (effs : IS.set) ((env, exp as (exp', loc)), index) : subexp * int =
ziv@2250 730 let
ziv@2250 731 fun wrapBindN f (args : (MonoEnv.env * exp) list) =
ziv@2250 732 let
ziv@2256 733 val (subexps, index) = ListUtil.foldlMap (pureCache effs) index args
ziv@2256 734 fun mkExp () = (f (map expOfSubexp subexps), loc)
ziv@2250 735 in
ziv@2250 736 if List.exists isImpure subexps
ziv@2256 737 then (Impure (mkExp ()), index)
ziv@2256 738 else (Pure (fn () => case makeCache (env, f (map #2 args), index) of
ziv@2256 739 NONE => mkExp ()
ziv@2256 740 | SOME e' => (e', loc)),
ziv@2256 741 (* Conservatively increment index. *)
ziv@2256 742 index + 1)
ziv@2250 743 end
ziv@2250 744 fun wrapBind1 f arg =
ziv@2250 745 wrapBindN (fn [arg] => f arg | _ => raise Match) [arg]
ziv@2250 746 fun wrapBind2 f (arg1, arg2) =
ziv@2250 747 wrapBindN (fn [arg1, arg2] => f (arg1, arg2) | _ => raise Match) [arg1, arg2]
ziv@2250 748 fun wrapN f es = wrapBindN f (map (fn e => (env, e)) es)
ziv@2250 749 fun wrap1 f e = wrapBind1 f (env, e)
ziv@2250 750 fun wrap2 f (e1, e2) = wrapBind2 f ((env, e1), (env, e2))
ziv@2250 751 in
ziv@2250 752 case exp' of
ziv@2250 753 ECon (dk, pc, SOME e) => wrap1 (fn e => ECon (dk, pc, SOME e)) e
ziv@2250 754 | ESome (t, e) => wrap1 (fn e => ESome (t, e)) e
ziv@2250 755 | EFfiApp (s1, s2, args) =>
ziv@2258 756 if ffiEffectful (s1, s2)
ziv@2258 757 then (Impure exp, index)
ziv@2258 758 else wrapN (fn es =>
ziv@2258 759 EFfiApp (s1, s2, ListPair.map (fn (e, (_, t)) => (e, t)) (es, args)))
ziv@2258 760 (map #1 args)
ziv@2250 761 | EApp (e1, e2) => wrap2 EApp (e1, e2)
ziv@2250 762 | EAbs (s, t1, t2, e) =>
ziv@2250 763 wrapBind1 (fn e => EAbs (s, t1, t2, e))
ziv@2250 764 (MonoEnv.pushERel env s t1 NONE, e)
ziv@2250 765 | EUnop (s, e) => wrap1 (fn e => EUnop (s, e)) e
ziv@2250 766 | EBinop (bi, s, e1, e2) => wrap2 (fn (e1, e2) => EBinop (bi, s, e1, e2)) (e1, e2)
ziv@2250 767 | ERecord fields =>
ziv@2250 768 wrapN (fn es => ERecord (ListPair.map (fn (e, (s, _, t)) => (s, e, t)) (es, fields)))
ziv@2250 769 (map #2 fields)
ziv@2250 770 | EField (e, s) => wrap1 (fn e => EField (e, s)) e
ziv@2250 771 | ECase (e, cases, {disc, result}) =>
ziv@2250 772 wrapBindN (fn (e::es) =>
ziv@2250 773 ECase (e,
ziv@2250 774 (ListPair.map (fn (e, (p, _)) => (p, e)) (es, cases)),
ziv@2256 775 {disc = disc, result = result})
ziv@2256 776 | _ => raise Match)
ziv@2250 777 ((env, e) :: map (fn (p, e) => (MonoEnv.patBinds env p, e)) cases)
ziv@2250 778 | EStrcat (e1, e2) => wrap2 EStrcat (e1, e2)
ziv@2250 779 (* We record page writes, so they're cachable. *)
ziv@2250 780 | EWrite e => wrap1 EWrite e
ziv@2250 781 | ESeq (e1, e2) => wrap2 ESeq (e1, e2)
ziv@2250 782 | ELet (s, t, e1, e2) =>
ziv@2250 783 wrapBind2 (fn (e1, e2) => ELet (s, t, e1, e2))
ziv@2250 784 ((env, e1), (MonoEnv.pushERel env s t (SOME e1), e2))
ziv@2250 785 (* ASK: | EClosure (n, es) => ? *)
ziv@2250 786 | EUnurlify (e, t, b) => wrap1 (fn e => EUnurlify (e, t, b)) e
ziv@2250 787 | _ => if effectful effs env exp
ziv@2256 788 then (Impure exp, index)
ziv@2256 789 else (Pure (fn () => (case makeCache (env, exp', index) of
ziv@2256 790 NONE => exp'
ziv@2256 791 | SOME e' => e',
ziv@2256 792 loc)),
ziv@2256 793 index + 1)
ziv@2256 794 end
ziv@2256 795
ziv@2262 796 fun addPure (file, indexStart, effs) =
ziv@2256 797 let
ziv@2262 798 fun doTopLevelExp env exp index =
ziv@2256 799 let
ziv@2261 800 val (subexp, index) = pureCache effs ((env, exp), index)
ziv@2256 801 in
ziv@2262 802 (expOfSubexp subexp, index)
ziv@2256 803 end
ziv@2256 804 in
ziv@2262 805 #1 (fileTopLevelMapfoldB doTopLevelExp file indexStart)
ziv@2256 806 end
ziv@2256 807
ziv@2265 808
ziv@2265 809 (***********************)
ziv@2265 810 (* Caching SQL Queries *)
ziv@2265 811 (***********************)
ziv@2265 812
ziv@2265 813 fun factorOutNontrivial text =
ziv@2265 814 let
ziv@2265 815 val loc = dummyLoc
ziv@2265 816 fun strcat (e1, e2) = (EStrcat (e1, e2), loc)
ziv@2265 817 val chunks = Sql.chunkify text
ziv@2265 818 val (newText, newVariables) =
ziv@2265 819 (* Important that this is foldr (to oppose foldl below). *)
ziv@2265 820 List.foldr
ziv@2265 821 (fn (chunk, (qText, newVars)) =>
ziv@2265 822 (* Variable bound to the head of newBs will have the lowest index. *)
ziv@2265 823 case chunk of
ziv@2265 824 Sql.Exp (e as (EPrim _, _)) => (strcat (e, qText), newVars)
ziv@2265 825 | Sql.Exp e =>
ziv@2265 826 let
ziv@2265 827 val n = length newVars
ziv@2265 828 in
ziv@2265 829 (* This is the (n+1)th new variable, so there are
ziv@2265 830 already n new variables bound, so we increment
ziv@2265 831 indices by n. *)
ziv@2265 832 (strcat ((ERel (~(n+1)), loc), qText), incRels n e :: newVars)
ziv@2265 833 end
ziv@2265 834 | Sql.String s => (strcat (stringExp s, qText), newVars))
ziv@2265 835 (stringExp "", [])
ziv@2265 836 chunks
ziv@2265 837 fun wrapLets e' =
ziv@2265 838 (* Important that this is foldl (to oppose foldr above). *)
ziv@2265 839 List.foldl (fn (v, e') => ELet (varName "sqlArg", stringTyp, v, (e', loc)))
ziv@2265 840 e'
ziv@2265 841 newVariables
ziv@2265 842 val numArgs = length newVariables
ziv@2265 843 in
ziv@2265 844 (newText, wrapLets, numArgs)
ziv@2265 845 end
ziv@2265 846
ziv@2265 847 fun cacheQuery effs env (queryInfo as (tableToIndices, indexToQueryNumArgs, index)) =
ziv@2265 848 fn e' as EQuery {query = origQueryText,
ziv@2265 849 state = resultTyp,
ziv@2265 850 initial, body, tables, exps} =>
ziv@2265 851 let
ziv@2265 852 val (newQueryText, wrapLets, numArgs) = factorOutNontrivial origQueryText
ziv@2265 853 (* Increment once for each new variable just made. *)
ziv@2265 854 val queryExp = incRels numArgs
ziv@2265 855 (EQuery {query = newQueryText,
ziv@2265 856 state = resultTyp,
ziv@2265 857 initial = initial,
ziv@2265 858 body = body,
ziv@2265 859 tables = tables,
ziv@2265 860 exps = exps},
ziv@2265 861 dummyLoc)
ziv@2265 862 (* DEBUG *)
ziv@2265 863 (* val () = Print.preface ("sqlcache> ", MonoPrint.p_exp MonoEnv.empty queryText) *)
ziv@2265 864 val args = List.tabulate (numArgs, fn n => (ERel n, dummyLoc))
ziv@2265 865 fun bind x f = Option.mapPartial f x
ziv@2265 866 fun guard b x = if b then x else NONE
ziv@2265 867 (* We use dummyTyp here. I think this is okay because databases don't
ziv@2265 868 store (effectful) functions, but perhaps there's some pathalogical
ziv@2265 869 corner case missing.... *)
ziv@2265 870 fun safe bound =
ziv@2265 871 not
ziv@2265 872 o effectful effs
ziv@2265 873 (iterate (fn env => MonoEnv.pushERel env "_" dummyTyp NONE)
ziv@2265 874 bound
ziv@2265 875 env)
ziv@2265 876 val textOfQuery = fn (EQuery {query, ...}, _) => SOME query | _ => NONE
ziv@2265 877 val attempt =
ziv@2265 878 (* Ziv misses Haskell's do notation.... *)
ziv@2265 879 bind (textOfQuery queryExp) (fn queryText =>
ziv@2265 880 guard (safe 0 queryText andalso safe 0 initial andalso safe 2 body) (
ziv@2265 881 bind (Sql.parse Sql.query queryText) (fn queryParsed =>
ziv@2265 882 bind (cacheWrap (env, queryExp, resultTyp, args, index)) (fn cachedExp =>
ziv@2265 883 SOME (wrapLets cachedExp,
ziv@2265 884 (SS.foldr (fn (tab, qi) => SIMM.insert (qi, tab, index))
ziv@2265 885 tableToIndices
ziv@2265 886 (tablesQuery queryParsed),
ziv@2265 887 IM.insert (indexToQueryNumArgs, index, (queryParsed, numArgs)),
ziv@2265 888 index + 1))))))
ziv@2265 889 in
ziv@2265 890 case attempt of
ziv@2265 891 SOME pair => pair
ziv@2265 892 (* We have to increment index conservatively. *)
ziv@2265 893 (* TODO: just use a reference for current index.... *)
ziv@2265 894 | NONE => (e', (tableToIndices, indexToQueryNumArgs, index + 1))
ziv@2265 895 end
ziv@2265 896 | e' => (e', queryInfo)
ziv@2265 897
ziv@2265 898 fun addChecking file =
ziv@2265 899 let
ziv@2265 900 val effs = effectfulDecls file
ziv@2265 901 in
ziv@2265 902 (fileAllMapfoldB (fn env => fn exp => fn state => cacheQuery effs env state exp)
ziv@2265 903 file
ziv@2265 904 (SIMM.empty, IM.empty, 0),
ziv@2265 905 effs)
ziv@2265 906 end
ziv@2265 907
ziv@2265 908
ziv@2265 909 (************)
ziv@2265 910 (* Flushing *)
ziv@2265 911 (************)
ziv@2265 912
ziv@2265 913 structure Invalidations = struct
ziv@2265 914
ziv@2265 915 val loc = dummyLoc
ziv@2265 916
ziv@2265 917 val optionAtomExpToExp =
ziv@2265 918 fn NONE => (ENone stringTyp, loc)
ziv@2265 919 | SOME e => (ESome (stringTyp,
ziv@2265 920 (case e of
ziv@2265 921 DmlRel n => ERel n
ziv@2265 922 | Prim p => EPrim p
ziv@2265 923 (* TODO: make new type containing only these two. *)
ziv@2265 924 | _ => raise Match,
ziv@2265 925 loc)),
ziv@2265 926 loc)
ziv@2265 927
ziv@2265 928 fun eqsToInvalidation numArgs eqs =
ziv@2265 929 let
ziv@2265 930 fun inv n = if n < 0 then [] else IM.find (eqs, n) :: inv (n - 1)
ziv@2265 931 in
ziv@2265 932 inv (numArgs - 1)
ziv@2265 933 end
ziv@2265 934
ziv@2265 935 (* Tests if [ys] makes [xs] a redundant cache invalidation. [NONE] here
ziv@2265 936 represents unknown, which means a wider invalidation. *)
ziv@2265 937 val rec madeRedundantBy : atomExp option list * atomExp option list -> bool =
ziv@2265 938 fn ([], []) => true
ziv@2265 939 | (_ :: xs, NONE :: ys) => madeRedundantBy (xs, ys)
ziv@2265 940 | (SOME x :: xs, SOME y :: ys) => (case AtomExpKey.compare (x, y) of
ziv@2265 941 EQUAL => madeRedundantBy (xs, ys)
ziv@2265 942 | _ => false)
ziv@2265 943 | _ => false
ziv@2265 944
ziv@2265 945 fun eqss (query, dml) = conflictMaps (queryToFormula query, dmlToFormula dml)
ziv@2265 946
ziv@2265 947 fun invalidations ((query, numArgs), dml) =
ziv@2265 948 (map (map optionAtomExpToExp)
ziv@2265 949 o removeRedundant madeRedundantBy
ziv@2265 950 o map (eqsToInvalidation numArgs)
ziv@2265 951 o eqss)
ziv@2265 952 (query, dml)
ziv@2265 953
ziv@2265 954 end
ziv@2265 955
ziv@2265 956 val invalidations = Invalidations.invalidations
ziv@2265 957
ziv@2265 958 (* DEBUG *)
ziv@2265 959 (* val gunk : ((Sql.query * int) * Sql.dml) list ref = ref [] *)
ziv@2265 960 (* val gunk' : exp list ref = ref [] *)
ziv@2265 961
ziv@2265 962 fun addFlushing ((file, (tableToIndices, indexToQueryNumArgs, index)), effs) =
ziv@2265 963 let
ziv@2265 964 val flushes = List.concat
ziv@2265 965 o map (fn (i, argss) => map (fn args => flush (i, args)) argss)
ziv@2265 966 val doExp =
ziv@2265 967 fn EDml (origDmlText, failureMode) =>
ziv@2265 968 let
ziv@2265 969 (* DEBUG *)
ziv@2265 970 (* val () = gunk' := origDmlText :: !gunk' *)
ziv@2265 971 val (newDmlText, wrapLets, numArgs) = factorOutNontrivial origDmlText
ziv@2265 972 val dmlText = incRels numArgs newDmlText
ziv@2265 973 val dmlExp = EDml (dmlText, failureMode)
ziv@2265 974 (* DEBUG *)
ziv@2265 975 (* val () = Print.preface ("SQLCACHE: ", (MonoPrint.p_exp MonoEnv.empty origDmlText)) *)
ziv@2265 976 val inval =
ziv@2265 977 case Sql.parse Sql.dml dmlText of
ziv@2265 978 SOME dmlParsed =>
ziv@2265 979 SOME (map (fn i => (case IM.find (indexToQueryNumArgs, i) of
ziv@2265 980 SOME queryNumArgs =>
ziv@2265 981 (* DEBUG *)
ziv@2265 982 ((* gunk := (queryNumArgs, dmlParsed) :: !gunk; *)
ziv@2265 983 (i, invalidations (queryNumArgs, dmlParsed)))
ziv@2265 984 (* TODO: fail more gracefully. *)
ziv@2265 985 | NONE => raise Match))
ziv@2265 986 (SIMM.findList (tableToIndices, tableDml dmlParsed)))
ziv@2265 987 | NONE => NONE
ziv@2265 988 in
ziv@2265 989 case inval of
ziv@2265 990 (* TODO: fail more gracefully. *)
ziv@2265 991 NONE => raise Match
ziv@2265 992 | SOME invs => wrapLets (sequence (flushes invs @ [dmlExp]))
ziv@2265 993 end
ziv@2265 994 | e' => e'
ziv@2265 995 in
ziv@2265 996 (* DEBUG *)
ziv@2265 997 (* gunk := []; *)
ziv@2265 998 (fileMap doExp file, index, effs)
ziv@2265 999 end
ziv@2265 1000
ziv@2265 1001
ziv@2265 1002 (***************)
ziv@2265 1003 (* Entry point *)
ziv@2265 1004 (***************)
ziv@2265 1005
ziv@2265 1006 val inlineSql =
ziv@2265 1007 let
ziv@2265 1008 val doExp =
ziv@2265 1009 (* TODO: EQuery, too? *)
ziv@2265 1010 (* ASK: should this live in [MonoOpt]? *)
ziv@2265 1011 fn EDml ((ECase (disc, cases, {disc = dTyp, ...}), loc), failureMode) =>
ziv@2265 1012 let
ziv@2265 1013 val newCases = map (fn (p, e) => (p, (EDml (e, failureMode), loc))) cases
ziv@2265 1014 in
ziv@2265 1015 ECase (disc, newCases, {disc = dTyp, result = (TRecord [], loc)})
ziv@2265 1016 end
ziv@2265 1017 | e => e
ziv@2265 1018 in
ziv@2265 1019 fileMap doExp
ziv@2265 1020 end
ziv@2265 1021
ziv@2262 1022 fun insertAfterDatatypes ((decls, sideInfo), newDecls) =
ziv@2262 1023 let
ziv@2262 1024 val (datatypes, others) = List.partition (fn (DDatatype _, _) => true | _ => false) decls
ziv@2262 1025 in
ziv@2262 1026 (datatypes @ newDecls @ others, sideInfo)
ziv@2262 1027 end
ziv@2262 1028
ziv@2262 1029 val go' = addPure o addFlushing o addChecking o inlineSql
ziv@2256 1030
ziv@2256 1031 fun go file =
ziv@2256 1032 let
ziv@2256 1033 (* TODO: do something nicer than [Sql] being in one of two modes. *)
ziv@2256 1034 val () = (resetFfiInfo (); Sql.sqlcacheMode := true)
ziv@2262 1035 val file = go' file
ziv@2262 1036 (* Important that this happens after [MonoFooify.urlify] calls! *)
ziv@2262 1037 val fmDecls = MonoFooify.getNewFmDecls ()
ziv@2256 1038 val () = Sql.sqlcacheMode := false
ziv@2256 1039 in
ziv@2262 1040 insertAfterDatatypes (file, rev fmDecls)
ziv@2250 1041 end
ziv@2250 1042
ziv@2209 1043 end