Mercurial > urweb

annotate src/iflow.sml @ 1205:7cd11380cdf1

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
WHERE-dependent checking
author Adam Chlipala <adamc@hcoop.net>
date Sun, 04 Apr 2010 17:18:41 -0400
parents 7af5e2af64f4
children 772760df4c4c
rev   line source
adamc@1200 1 (* Copyright (c) 2010, Adam Chlipala
adamc@1200 2 * All rights reserved.
adamc@1200 3 *
adamc@1200 4 * Redistribution and use in source and binary forms, with or without
adamc@1200 5 * modification, are permitted provided that the following conditions are met:
adamc@1200 6 *
adamc@1200 7 * - Redistributions of source code must retain the above copyright notice,
adamc@1200 8 * this list of conditions and the following disclaimer.
adamc@1200 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@1200 10 * this list of conditions and the following disclaimer in the documentation
adamc@1200 11 * and/or other materials provided with the distribution.
adamc@1200 12 * - The names of contributors may not be used to endorse or promote products
adamc@1200 13 * derived from this software without specific prior written permission.
adamc@1200 14 *
adamc@1200 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@1200 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@1200 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@1200 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@1200 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@1200 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@1200 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@1200 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@1200 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@1200 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@1200 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@1200 26 *)
adamc@1200 27
adamc@1200 28 structure Iflow :> IFLOW = struct
adamc@1200 29
adamc@1200 30 open Mono
adamc@1200 31
adamc@1202 32 structure IM = IntBinaryMap
adamc@1202 33
adamc@1200 34 structure SS = BinarySetFn(struct
adamc@1200 35 type ord_key = string
adamc@1200 36 val compare = String.compare
adamc@1200 37 end)
adamc@1200 38
adamc@1200 39 val writers = ["htmlifyInt_w",
adamc@1200 40 "htmlifyFloat_w",
adamc@1200 41 "htmlifyString_w",
adamc@1200 42 "htmlifyBool_w",
adamc@1200 43 "htmlifyTime_w",
adamc@1200 44 "attrifyInt_w",
adamc@1200 45 "attrifyFloat_w",
adamc@1200 46 "attrifyString_w",
adamc@1200 47 "attrifyChar_w",
adamc@1200 48 "urlifyInt_w",
adamc@1200 49 "urlifyFloat_w",
adamc@1200 50 "urlifyString_w",
adamc@1200 51 "urlifyBool_w"]
adamc@1200 52
adamc@1200 53 val writers = SS.addList (SS.empty, writers)
adamc@1200 54
adamc@1200 55 type lvar = int
adamc@1200 56
adamc@1200 57 datatype exp =
adamc@1200 58 Const of Prim.t
adamc@1200 59 | Var of int
adamc@1200 60 | Lvar of lvar
adamc@1200 61 | Func of string * exp list
adamc@1200 62 | Recd of (string * exp) list
adamc@1200 63 | Proj of exp * string
adamc@1200 64 | Finish
adamc@1200 65
adamc@1200 66 datatype reln =
adamc@1200 67 Sql of string
adamc@1200 68 | Eq
adamc@1200 69
adamc@1200 70 datatype prop =
adamc@1200 71 True
adamc@1200 72 | False
adamc@1200 73 | Unknown
adamc@1200 74 | And of prop * prop
adamc@1200 75 | Or of prop * prop
adamc@1200 76 | Reln of reln * exp list
adamc@1200 77 | Select of int * lvar * lvar * prop * exp
adamc@1200 78
adamc@1200 79 local
adamc@1202 80 val count = ref 1
adamc@1200 81 in
adamc@1200 82 fun newLvar () =
adamc@1200 83 let
adamc@1200 84 val n = !count
adamc@1200 85 in
adamc@1200 86 count := n + 1;
adamc@1200 87 n
adamc@1200 88 end
adamc@1200 89 end
adamc@1200 90
adamc@1200 91 fun subExp (v, lv) =
adamc@1200 92 let
adamc@1200 93 fun sub e =
adamc@1200 94 case e of
adamc@1200 95 Const _ => e
adamc@1200 96 | Var v' => if v' = v then Lvar lv else e
adamc@1200 97 | Lvar _ => e
adamc@1200 98 | Func (f, es) => Func (f, map sub es)
adamc@1200 99 | Recd xes => Recd (map (fn (x, e) => (x, sub e)) xes)
adamc@1200 100 | Proj (e, s) => Proj (sub e, s)
adamc@1200 101 | Finish => Finish
adamc@1200 102 in
adamc@1200 103 sub
adamc@1200 104 end
adamc@1200 105
adamc@1200 106 fun subProp (v, lv) =
adamc@1200 107 let
adamc@1200 108 fun sub p =
adamc@1200 109 case p of
adamc@1200 110 True => p
adamc@1200 111 | False => p
adamc@1200 112 | Unknown => p
adamc@1200 113 | And (p1, p2) => And (sub p1, sub p2)
adamc@1200 114 | Or (p1, p2) => Or (sub p1, sub p2)
adamc@1200 115 | Reln (r, es) => Reln (r, map (subExp (v, lv)) es)
adamc@1200 116 | Select (v1, lv1, lv2, p, e) => Select (v1, lv1, lv2, sub p, subExp (v, lv) e)
adamc@1200 117 in
adamc@1200 118 sub
adamc@1200 119 end
adamc@1200 120
adamc@1200 121 fun isKnown e =
adamc@1200 122 case e of
adamc@1200 123 Const _ => true
adamc@1200 124 | Func (_, es) => List.all isKnown es
adamc@1200 125 | Recd xes => List.all (isKnown o #2) xes
adamc@1200 126 | Proj (e, _) => isKnown e
adamc@1200 127 | _ => false
adamc@1200 128
adamc@1200 129 fun isFinish e =
adamc@1200 130 case e of
adamc@1200 131 Finish => true
adamc@1200 132 | _ => false
adamc@1200 133
adamc@1200 134 fun simplify e =
adamc@1200 135 case e of
adamc@1200 136 Const _ => e
adamc@1200 137 | Var _ => e
adamc@1200 138 | Lvar _ => e
adamc@1200 139 | Func (f, es) =>
adamc@1200 140 let
adamc@1200 141 val es = map simplify es
adamc@1200 142 in
adamc@1200 143 if List.exists isFinish es then
adamc@1200 144 Finish
adamc@1200 145 else
adamc@1200 146 Func (f, es)
adamc@1200 147 end
adamc@1200 148 | Recd xes =>
adamc@1200 149 let
adamc@1200 150 val xes = map (fn (x, e) => (x, simplify e)) xes
adamc@1200 151 in
adamc@1200 152 if List.exists (isFinish o #2) xes then
adamc@1200 153 Finish
adamc@1200 154 else
adamc@1200 155 Recd xes
adamc@1200 156 end
adamc@1200 157 | Proj (e, s) =>
adamc@1200 158 (case simplify e of
adamc@1200 159 Recd xes =>
adamc@1200 160 getOpt (ListUtil.search (fn (x, e') => if x = s then SOME e' else NONE) xes, Recd xes)
adamc@1200 161 | e' =>
adamc@1200 162 if isFinish e' then
adamc@1200 163 Finish
adamc@1200 164 else
adamc@1200 165 Proj (e', s))
adamc@1200 166 | Finish => Finish
adamc@1200 167
adamc@1202 168 fun decomp fals or =
adamc@1200 169 let
adamc@1200 170 fun decomp p k =
adamc@1200 171 case p of
adamc@1200 172 True => k []
adamc@1202 173 | False => fals
adamc@1200 174 | Unknown => k []
adamc@1200 175 | And (p1, p2) =>
adamc@1200 176 decomp p1 (fn ps1 =>
adamc@1200 177 decomp p2 (fn ps2 =>
adamc@1200 178 k (ps1 @ ps2)))
adamc@1200 179 | Or (p1, p2) =>
adamc@1200 180 or (decomp p1 k, fn () => decomp p2 k)
adamc@1200 181 | Reln x => k [x]
adamc@1200 182 | Select _ => k []
adamc@1200 183 in
adamc@1200 184 decomp
adamc@1200 185 end
adamc@1200 186
adamc@1202 187 val unif = ref (IM.empty : exp IM.map)
adamc@1200 188
adamc@1203 189 fun reset () = unif := IM.empty
adamc@1203 190 fun save () = !unif
adamc@1203 191 fun restore x = unif := x
adamc@1203 192
adamc@1202 193 fun lvarIn lv =
adamc@1202 194 let
adamc@1202 195 fun lvi e =
adamc@1202 196 case e of
adamc@1202 197 Const _ => false
adamc@1202 198 | Var _ => false
adamc@1202 199 | Lvar lv' => lv' = lv
adamc@1202 200 | Func (_, es) => List.exists lvi es
adamc@1202 201 | Recd xes => List.exists (lvi o #2) xes
adamc@1202 202 | Proj (e, _) => lvi e
adamc@1202 203 | Finish => false
adamc@1202 204 in
adamc@1202 205 lvi
adamc@1202 206 end
adamc@1202 207
adamc@1202 208 fun eq' (e1, e2) =
adamc@1202 209 case (e1, e2) of
adamc@1202 210 (Const p1, Const p2) => Prim.equal (p1, p2)
adamc@1202 211 | (Var n1, Var n2) => n1 = n2
adamc@1202 212
adamc@1202 213 | (Lvar n1, _) =>
adamc@1202 214 (case IM.find (!unif, n1) of
adamc@1202 215 SOME e1 => eq' (e1, e2)
adamc@1202 216 | NONE =>
adamc@1202 217 case e2 of
adamc@1202 218 Lvar n2 =>
adamc@1202 219 (case IM.find (!unif, n2) of
adamc@1202 220 SOME e2 => eq' (e1, e2)
adamc@1202 221 | NONE => n1 = n2
adamc@1202 222 orelse (unif := IM.insert (!unif, n1, e2);
adamc@1202 223 true))
adamc@1202 224 | _ =>
adamc@1202 225 if lvarIn n1 e2 then
adamc@1202 226 false
adamc@1202 227 else
adamc@1202 228 (unif := IM.insert (!unif, n1, e2);
adamc@1202 229 true))
adamc@1202 230
adamc@1202 231 | (_, Lvar n2) =>
adamc@1202 232 (case IM.find (!unif, n2) of
adamc@1202 233 SOME e2 => eq' (e1, e2)
adamc@1202 234 | NONE =>
adamc@1202 235 if lvarIn n2 e1 then
adamc@1202 236 false
adamc@1202 237 else
adamc@1202 238 (unif := IM.insert (!unif, n2, e1);
adamc@1202 239 true))
adamc@1202 240
adamc@1202 241 | (Func (f1, es1), Func (f2, es2)) => f1 = f2 andalso ListPair.allEq eq' (es1, es2)
adamc@1202 242 | (Recd xes1, Recd xes2) => ListPair.allEq (fn ((x1, e1), (x2, e2)) => x1 = x2 andalso eq' (e1, e2)) (xes1, xes2)
adamc@1202 243 | (Proj (e1, s1), Proj (e2, s2)) => eq' (e1, e2) andalso s1 = s2
adamc@1202 244 | (Finish, Finish) => true
adamc@1202 245 | _ => false
adamc@1202 246
adamc@1202 247 fun eq (e1, e2) =
adamc@1202 248 let
adamc@1203 249 val saved = save ()
adamc@1202 250 in
adamc@1202 251 if eq' (simplify e1, simplify e2) then
adamc@1202 252 true
adamc@1202 253 else
adamc@1203 254 (restore saved;
adamc@1202 255 false)
adamc@1202 256 end
adamc@1202 257
adamc@1202 258 exception Imply of prop * prop
adamc@1202 259
adamc@1202 260 fun rimp ((r1, es1), (r2, es2)) =
adamc@1202 261 case (r1, r2) of
adamc@1202 262 (Sql r1', Sql r2') =>
adamc@1202 263 r1' = r2' andalso
adamc@1202 264 (case (es1, es2) of
adamc@1202 265 ([Recd xes1], [Recd xes2]) =>
adamc@1202 266 let
adamc@1203 267 val saved = save ()
adamc@1202 268 in
adamc@1202 269 if List.all (fn (f, e2) =>
adamc@1203 270 case ListUtil.search (fn (f', e1) => if f' = f then SOME e1 else NONE) xes1 of
adamc@1203 271 NONE => true
adamc@1203 272 | SOME e1 => eq (e1, e2)) xes2 then
adamc@1202 273 true
adamc@1202 274 else
adamc@1203 275 (restore saved;
adamc@1202 276 false)
adamc@1202 277 end
adamc@1202 278 | _ => false)
adamc@1202 279 | (Eq, Eq) =>
adamc@1202 280 (case (es1, es2) of
adamc@1202 281 ([x1, y1], [x2, y2]) =>
adamc@1202 282 let
adamc@1203 283 val saved = save ()
adamc@1202 284 in
adamc@1202 285 if eq (x1, x2) andalso eq (y1, y2) then
adamc@1202 286 true
adamc@1202 287 else
adamc@1203 288 (restore saved;
adamc@1202 289 (*raise Imply (Reln (Eq, es1), Reln (Eq, es2));*)
adamc@1202 290 eq (x1, y2) andalso eq (y1, x2))
adamc@1202 291 end
adamc@1202 292 | _ => false)
adamc@1202 293 | _ => false
adamc@1202 294
adamc@1202 295 fun imply (p1, p2) =
adamc@1203 296 (reset ();
adamc@1202 297 (*raise (Imply (p1, p2));*)
adamc@1202 298 decomp true (fn (e1, e2) => e1 andalso e2 ()) p1
adamc@1202 299 (fn hyps =>
adamc@1202 300 decomp false (fn (e1, e2) => e1 orelse e2 ()) p2
adamc@1202 301 (fn goals =>
adamc@1202 302 let
adamc@1202 303 fun gls goals onFail =
adamc@1202 304 case goals of
adamc@1202 305 [] => true
adamc@1202 306 | g :: goals =>
adamc@1202 307 let
adamc@1202 308 fun hps hyps =
adamc@1202 309 case hyps of
adamc@1202 310 [] => onFail ()
adamc@1202 311 | h :: hyps =>
adamc@1202 312 let
adamc@1203 313 val saved = save ()
adamc@1202 314 in
adamc@1202 315 if rimp (h, g) then
adamc@1202 316 let
adamc@1203 317 val changed = IM.numItems (!unif) <> IM.numItems saved
adamc@1202 318 in
adamc@1203 319 gls goals (fn () => (restore saved;
adamc@1202 320 changed andalso hps hyps))
adamc@1202 321 end
adamc@1202 322 else
adamc@1202 323 hps hyps
adamc@1202 324 end
adamc@1202 325 in
adamc@1202 326 hps hyps
adamc@1202 327 end
adamc@1202 328 in
adamc@1202 329 gls goals (fn () => false)
adamc@1202 330 end)))
adamc@1202 331
adamc@1200 332
adamc@1200 333 fun patCon pc =
adamc@1200 334 case pc of
adamc@1200 335 PConVar n => "C" ^ Int.toString n
adamc@1200 336 | PConFfi {mod = m, datatyp = d, con = c, ...} => m ^ "." ^ d ^ "." ^ c
adamc@1200 337
adamc@1202 338
adamc@1200 339
adamc@1200 340 datatype chunk =
adamc@1200 341 String of string
adamc@1200 342 | Exp of Mono.exp
adamc@1200 343
adamc@1200 344 fun chunkify e =
adamc@1200 345 case #1 e of
adamc@1200 346 EPrim (Prim.String s) => [String s]
adamc@1200 347 | EStrcat (e1, e2) => chunkify e1 @ chunkify e2
adamc@1200 348 | _ => [Exp e]
adamc@1200 349
adamc@1201 350 type 'a parser = chunk list -> ('a * chunk list) option
adamc@1201 351
adamc@1201 352 fun always v chs = SOME (v, chs)
adamc@1201 353
adamc@1202 354 fun parse p s =
adamc@1202 355 case p (chunkify s) of
adamc@1201 356 SOME (v, []) => SOME v
adamc@1201 357 | _ => NONE
adamc@1201 358
adamc@1201 359 fun const s chs =
adamc@1201 360 case chs of
adamc@1201 361 String s' :: chs => if String.isPrefix s s' then
adamc@1201 362 SOME ((), if size s = size s' then
adamc@1201 363 chs
adamc@1201 364 else
adamc@1201 365 String (String.extract (s', size s, NONE)) :: chs)
adamc@1201 366 else
adamc@1201 367 NONE
adamc@1201 368 | _ => NONE
adamc@1201 369
adamc@1201 370 fun follow p1 p2 chs =
adamc@1201 371 case p1 chs of
adamc@1201 372 NONE => NONE
adamc@1201 373 | SOME (v1, chs) =>
adamc@1201 374 case p2 chs of
adamc@1201 375 NONE => NONE
adamc@1201 376 | SOME (v2, chs) => SOME ((v1, v2), chs)
adamc@1201 377
adamc@1201 378 fun wrap p f chs =
adamc@1201 379 case p chs of
adamc@1201 380 NONE => NONE
adamc@1201 381 | SOME (v, chs) => SOME (f v, chs)
adamc@1201 382
adamc@1201 383 fun alt p1 p2 chs =
adamc@1201 384 case p1 chs of
adamc@1201 385 NONE => p2 chs
adamc@1201 386 | v => v
adamc@1201 387
adamc@1204 388 fun opt p chs =
adamc@1204 389 case p chs of
adamc@1204 390 NONE => SOME (NONE, chs)
adamc@1204 391 | SOME (v, chs) => SOME (SOME v, chs)
adamc@1204 392
adamc@1201 393 fun skip cp chs =
adamc@1201 394 case chs of
adamc@1201 395 String "" :: chs => skip cp chs
adamc@1201 396 | String s :: chs' => if cp (String.sub (s, 0)) then
adamc@1201 397 skip cp (String (String.extract (s, 1, NONE)) :: chs')
adamc@1201 398 else
adamc@1201 399 SOME ((), chs)
adamc@1201 400 | _ => SOME ((), chs)
adamc@1201 401
adamc@1201 402 fun keep cp chs =
adamc@1201 403 case chs of
adamc@1201 404 String "" :: chs => keep cp chs
adamc@1201 405 | String s :: chs' =>
adamc@1201 406 let
adamc@1201 407 val (befor, after) = Substring.splitl cp (Substring.full s)
adamc@1201 408 in
adamc@1201 409 if Substring.isEmpty befor then
adamc@1201 410 NONE
adamc@1201 411 else
adamc@1201 412 SOME (Substring.string befor,
adamc@1201 413 if Substring.isEmpty after then
adamc@1201 414 chs'
adamc@1201 415 else
adamc@1201 416 String (Substring.string after) :: chs')
adamc@1201 417 end
adamc@1201 418 | _ => NONE
adamc@1201 419
adamc@1204 420 fun ws p = wrap (follow (skip (fn ch => ch = #" "))
adamc@1204 421 (follow p (skip (fn ch => ch = #" ")))) (#1 o #2)
adamc@1204 422
adamc@1204 423 fun log name p chs =
adamc@1204 424 (case chs of
adamc@1204 425 String s :: [] => print (name ^ ": " ^ s ^ "\n")
adamc@1204 426 | _ => print (name ^ ": blocked!\n");
adamc@1204 427 p chs)
adamc@1201 428
adamc@1201 429 fun list p chs =
adamc@1201 430 (alt (wrap (follow p (follow (ws (const ",")) (list p)))
adamc@1201 431 (fn (v, ((), ls)) => v :: ls))
adamc@1201 432 (alt (wrap (ws p) (fn v => [v]))
adamc@1201 433 (always []))) chs
adamc@1201 434
adamc@1201 435 val ident = keep (fn ch => Char.isAlphaNum ch orelse ch = #"_")
adamc@1201 436
adamc@1201 437 val t_ident = wrap ident (fn s => if String.isPrefix "T_" s then
adamc@1201 438 String.extract (s, 2, NONE)
adamc@1201 439 else
adamc@1201 440 raise Fail "Iflow: Bad table variable")
adamc@1201 441 val uw_ident = wrap ident (fn s => if String.isPrefix "uw_" s then
adamc@1201 442 String.extract (s, 3, NONE)
adamc@1201 443 else
adamc@1201 444 raise Fail "Iflow: Bad uw_* variable")
adamc@1201 445
adamc@1201 446 val sitem = wrap (follow t_ident
adamc@1201 447 (follow (const ".")
adamc@1201 448 uw_ident))
adamc@1201 449 (fn (t, ((), f)) => (t, f))
adamc@1201 450
adamc@1204 451 datatype sqexp =
adamc@1204 452 Field of string * string
adamc@1204 453 | Binop of string * sqexp * sqexp
adamc@1204 454
adamc@1204 455 val sqbrel = wrap (const "=") (fn () => "=")
adamc@1204 456
adamc@1204 457 datatype ('a, 'b) sum = inl of 'a | inr of 'b
adamc@1204 458
adamc@1204 459 fun sqexp chs =
adamc@1204 460 alt
adamc@1204 461 (wrap (follow (ws (const "("))
adamc@1204 462 (follow (ws sqexp)
adamc@1204 463 (ws (const ")"))))
adamc@1204 464 (fn ((), (e, ())) => e))
adamc@1204 465 (wrap
adamc@1204 466 (follow (wrap sitem Field)
adamc@1204 467 (alt
adamc@1204 468 (wrap
adamc@1204 469 (follow (ws sqbrel)
adamc@1204 470 (ws sqexp))
adamc@1204 471 inl)
adamc@1204 472 (always (inr ()))))
adamc@1204 473 (fn (e1, sm) =>
adamc@1204 474 case sm of
adamc@1204 475 inl (bo, e2) => Binop (bo, e1, e2)
adamc@1204 476 | inr () => e1))
adamc@1204 477 chs
adamc@1204 478
adamc@1201 479 val select = wrap (follow (const "SELECT ") (list sitem))
adamc@1201 480 (fn ((), ls) => ls)
adamc@1201 481
adamc@1201 482 val fitem = wrap (follow uw_ident
adamc@1201 483 (follow (const " AS ")
adamc@1201 484 t_ident))
adamc@1201 485 (fn (t, ((), f)) => (t, f))
adamc@1201 486
adamc@1201 487 val from = wrap (follow (const "FROM ") (list fitem))
adamc@1201 488 (fn ((), ls) => ls)
adamc@1201 489
adamc@1204 490 val wher = wrap (follow (ws (const "WHERE ")) sqexp)
adamc@1204 491 (fn ((), ls) => ls)
adamc@1204 492
adamc@1204 493 val query = wrap (follow (follow select from) (opt wher))
adamc@1204 494 (fn ((fs, ts), wher) => {Select = fs, From = ts, Where = wher})
adamc@1201 495
adamc@1202 496 fun queryProp rv oe e =
adamc@1202 497 case parse query e of
adamc@1204 498 NONE => (print "Crap\n"; Unknown)
adamc@1201 499 | SOME r =>
adamc@1202 500 let
adamc@1202 501 val p =
adamc@1202 502 foldl (fn ((t, v), p) =>
adamc@1202 503 And (p,
adamc@1202 504 Reln (Sql t,
adamc@1202 505 [Recd (foldl (fn ((v', f), fs) =>
adamc@1202 506 if v' = v then
adamc@1202 507 (f, Proj (Proj (Lvar rv, v), f)) :: fs
adamc@1202 508 else
adamc@1202 509 fs) [] (#Select r))])))
adamc@1202 510 True (#From r)
adamc@1205 511
adamc@1205 512 fun expIn e =
adamc@1205 513 case e of
adamc@1205 514 Field (v, f) => inl (Proj (Proj (Lvar rv, v), f))
adamc@1205 515 | Binop (bo, e1, e2) =>
adamc@1205 516 (case (expIn e1, expIn e2) of
adamc@1205 517 (inr _, _) => inr Unknown
adamc@1205 518 | (_, inr _) => inr Unknown
adamc@1205 519 | (inl e1, inl e2) =>
adamc@1205 520 let
adamc@1205 521 val bo = case bo of
adamc@1205 522 "=" => SOME Eq
adamc@1205 523 | _ => NONE
adamc@1205 524 in
adamc@1205 525 case bo of
adamc@1205 526 NONE => inr Unknown
adamc@1205 527 | SOME bo => inr (Reln (bo, [e1, e2]))
adamc@1205 528 end)
adamc@1205 529
adamc@1205 530 val p = case #Where r of
adamc@1205 531 NONE => p
adamc@1205 532 | SOME e =>
adamc@1205 533 case expIn e of
adamc@1205 534 inr p' => And (p, p')
adamc@1205 535 | _ => p
adamc@1202 536 in
adamc@1202 537 case oe of
adamc@1202 538 NONE => p
adamc@1202 539 | SOME oe =>
adamc@1205 540 And (p, foldl (fn ((v, f), p) =>
adamc@1205 541 Or (p,
adamc@1205 542 Reln (Eq, [oe, Proj (Proj (Lvar rv, v), f)])))
adamc@1205 543 False (#Select r))
adamc@1202 544 end
adamc@1200 545
adamc@1202 546 fun evalExp env (e as (_, loc), st as (nv, p, sent)) =
adamc@1200 547 let
adamc@1200 548 fun default () =
adamc@1200 549 (Var nv, (nv+1, p, sent))
adamc@1200 550
adamc@1200 551 fun addSent (p, e, sent) =
adamc@1200 552 if isKnown e then
adamc@1200 553 sent
adamc@1200 554 else
adamc@1202 555 (loc, e, p) :: sent
adamc@1200 556 in
adamc@1200 557 case #1 e of
adamc@1200 558 EPrim p => (Const p, st)
adamc@1200 559 | ERel n => (List.nth (env, n), st)
adamc@1200 560 | ENamed _ => default ()
adamc@1200 561 | ECon (_, pc, NONE) => (Func (patCon pc, []), st)
adamc@1200 562 | ECon (_, pc, SOME e) =>
adamc@1200 563 let
adamc@1200 564 val (e, st) = evalExp env (e, st)
adamc@1200 565 in
adamc@1200 566 (Func (patCon pc, [e]), st)
adamc@1200 567 end
adamc@1200 568 | ENone _ => (Func ("None", []), st)
adamc@1200 569 | ESome (_, e) =>
adamc@1200 570 let
adamc@1200 571 val (e, st) = evalExp env (e, st)
adamc@1200 572 in
adamc@1200 573 (Func ("Some", [e]), st)
adamc@1200 574 end
adamc@1200 575 | EFfi _ => default ()
adamc@1200 576 | EFfiApp (m, s, es) =>
adamc@1200 577 if m = "Basis" andalso SS.member (writers, s) then
adamc@1200 578 let
adamc@1200 579 val (es, st) = ListUtil.foldlMap (evalExp env) st es
adamc@1200 580 in
adamc@1200 581 (Func ("unit", []), (#1 st, p, foldl (fn (e, sent) => addSent (#2 st, e, sent)) sent es))
adamc@1200 582 end
adamc@1200 583 else if Settings.isEffectful (m, s) andalso not (Settings.isBenignEffectful (m, s)) then
adamc@1200 584 default ()
adamc@1200 585 else
adamc@1200 586 let
adamc@1200 587 val (es, st) = ListUtil.foldlMap (evalExp env) st es
adamc@1200 588 in
adamc@1200 589 (Func (m ^ "." ^ s, es), st)
adamc@1200 590 end
adamc@1200 591 | EApp _ => default ()
adamc@1200 592 | EAbs _ => default ()
adamc@1200 593 | EUnop (s, e1) =>
adamc@1200 594 let
adamc@1200 595 val (e1, st) = evalExp env (e1, st)
adamc@1200 596 in
adamc@1200 597 (Func (s, [e1]), st)
adamc@1200 598 end
adamc@1200 599 | EBinop (s, e1, e2) =>
adamc@1200 600 let
adamc@1200 601 val (e1, st) = evalExp env (e1, st)
adamc@1200 602 val (e2, st) = evalExp env (e2, st)
adamc@1200 603 in
adamc@1200 604 (Func (s, [e1, e2]), st)
adamc@1200 605 end
adamc@1200 606 | ERecord xets =>
adamc@1200 607 let
adamc@1200 608 val (xes, st) = ListUtil.foldlMap (fn ((x, e, _), st) =>
adamc@1200 609 let
adamc@1200 610 val (e, st) = evalExp env (e, st)
adamc@1200 611 in
adamc@1200 612 ((x, e), st)
adamc@1200 613 end) st xets
adamc@1200 614 in
adamc@1200 615 (Recd xes, st)
adamc@1200 616 end
adamc@1200 617 | EField (e, s) =>
adamc@1200 618 let
adamc@1200 619 val (e, st) = evalExp env (e, st)
adamc@1200 620 in
adamc@1200 621 (Proj (e, s), st)
adamc@1200 622 end
adamc@1200 623 | ECase _ => default ()
adamc@1200 624 | EStrcat (e1, e2) =>
adamc@1200 625 let
adamc@1200 626 val (e1, st) = evalExp env (e1, st)
adamc@1200 627 val (e2, st) = evalExp env (e2, st)
adamc@1200 628 in
adamc@1200 629 (Func ("cat", [e1, e2]), st)
adamc@1200 630 end
adamc@1200 631 | EError _ => (Finish, st)
adamc@1200 632 | EReturnBlob {blob = b, mimeType = m, ...} =>
adamc@1200 633 let
adamc@1200 634 val (b, st) = evalExp env (b, st)
adamc@1200 635 val (m, st) = evalExp env (m, st)
adamc@1200 636 in
adamc@1200 637 (Finish, (#1 st, p, addSent (#2 st, b, addSent (#2 st, m, sent))))
adamc@1200 638 end
adamc@1200 639 | ERedirect (e, _) =>
adamc@1200 640 let
adamc@1200 641 val (e, st) = evalExp env (e, st)
adamc@1200 642 in
adamc@1200 643 (Finish, (#1 st, p, addSent (#2 st, e, sent)))
adamc@1200 644 end
adamc@1200 645 | EWrite e =>
adamc@1200 646 let
adamc@1200 647 val (e, st) = evalExp env (e, st)
adamc@1200 648 in
adamc@1200 649 (Func ("unit", []), (#1 st, p, addSent (#2 st, e, sent)))
adamc@1200 650 end
adamc@1200 651 | ESeq (e1, e2) =>
adamc@1200 652 let
adamc@1200 653 val (_, st) = evalExp env (e1, st)
adamc@1200 654 in
adamc@1200 655 evalExp env (e2, st)
adamc@1200 656 end
adamc@1200 657 | ELet (_, _, e1, e2) =>
adamc@1200 658 let
adamc@1200 659 val (e1, st) = evalExp env (e1, st)
adamc@1200 660 in
adamc@1200 661 evalExp (e1 :: env) (e2, st)
adamc@1200 662 end
adamc@1200 663 | EClosure (n, es) =>
adamc@1200 664 let
adamc@1200 665 val (es, st) = ListUtil.foldlMap (evalExp env) st es
adamc@1200 666 in
adamc@1200 667 (Func ("Cl" ^ Int.toString n, es), st)
adamc@1200 668 end
adamc@1200 669
adamc@1200 670 | EQuery {query = q, body = b, initial = i, ...} =>
adamc@1200 671 let
adamc@1200 672 val (_, st) = evalExp env (q, st)
adamc@1200 673 val (i, st) = evalExp env (i, st)
adamc@1200 674
adamc@1200 675 val r = #1 st
adamc@1200 676 val acc = #1 st + 1
adamc@1200 677 val st' = (#1 st + 2, #2 st, #3 st)
adamc@1200 678
adamc@1200 679 val (b, st') = evalExp (Var acc :: Var r :: env) (b, st')
adamc@1200 680
adamc@1200 681 val r' = newLvar ()
adamc@1200 682 val acc' = newLvar ()
adamc@1202 683 val qp = queryProp r' NONE q
adamc@1200 684
adamc@1200 685 val doSubExp = subExp (r, r') o subExp (acc, acc')
adamc@1200 686 val doSubProp = subProp (r, r') o subProp (acc, acc')
adamc@1200 687
adamc@1200 688 val p = doSubProp (#2 st')
adamc@1200 689 val p = And (p, qp)
adamc@1200 690 val p = Select (r, r', acc', p, doSubExp b)
adamc@1200 691 in
adamc@1202 692 (Var r, (#1 st + 1, And (#2 st, p), map (fn (loc, e, p) => (loc,
adamc@1202 693 doSubExp e,
adamc@1202 694 And (qp, doSubProp p))) (#3 st')))
adamc@1200 695 end
adamc@1200 696 | EDml _ => default ()
adamc@1200 697 | ENextval _ => default ()
adamc@1200 698 | ESetval _ => default ()
adamc@1200 699
adamc@1200 700 | EUnurlify _ => default ()
adamc@1200 701 | EJavaScript _ => default ()
adamc@1200 702 | ESignalReturn _ => default ()
adamc@1200 703 | ESignalBind _ => default ()
adamc@1200 704 | ESignalSource _ => default ()
adamc@1200 705 | EServerCall _ => default ()
adamc@1200 706 | ERecv _ => default ()
adamc@1200 707 | ESleep _ => default ()
adamc@1200 708 | ESpawn _ => default ()
adamc@1200 709 end
adamc@1200 710
adamc@1200 711 fun check file =
adamc@1200 712 let
adamc@1202 713 fun decl ((d, _), (vals, pols)) =
adamc@1200 714 case d of
adamc@1200 715 DVal (x, _, _, e, _) =>
adamc@1200 716 let
adamc@1200 717 fun deAbs (e, env, nv) =
adamc@1200 718 case #1 e of
adamc@1200 719 EAbs (_, _, _, e) => deAbs (e, Var nv :: env, nv + 1)
adamc@1200 720 | _ => (e, env, nv)
adamc@1200 721
adamc@1202 722 val (e, env, nv) = deAbs (e, [], 1)
adamc@1200 723
adamc@1200 724 val (e, (_, p, sent)) = evalExp env (e, (nv, True, []))
adamc@1200 725 in
adamc@1202 726 ((x, e, p, sent) :: vals, pols)
adamc@1200 727 end
adamc@1202 728
adamc@1202 729 | DPolicy (PolQuery e) => (vals, queryProp 0 (SOME (Var 0)) e :: pols)
adamc@1202 730
adamc@1202 731 | _ => (vals, pols)
adamc@1202 732
adamc@1203 733 val () = reset ()
adamc@1202 734
adamc@1202 735 val (vals, pols) = foldl decl ([], []) file
adamc@1200 736 in
adamc@1202 737 app (fn (name, _, _, sent) =>
adamc@1202 738 app (fn (loc, e, p) =>
adamc@1202 739 let
adamc@1202 740 val p = And (p, Reln (Eq, [Var 0, e]))
adamc@1202 741 in
adamc@1202 742 if List.exists (fn pol => imply (p, pol)) pols then
adamc@1202 743 ()
adamc@1202 744 else
adamc@1202 745 ErrorMsg.errorAt loc "The information flow policy may be violated here."
adamc@1202 746 end) sent) vals
adamc@1200 747 end
adamc@1200 748
adamc@1200 749 end