2011-06-15 13:19:50 -05:00
|
|
|
|
2011-05-17 13:41:41 -05:00
|
|
|
import std::vec;
|
|
|
|
import std::vec::plus_option;
|
2011-05-14 21:02:30 -05:00
|
|
|
import std::option;
|
|
|
|
import std::option::none;
|
|
|
|
import std::option::some;
|
|
|
|
|
|
|
|
import tstate::ann::pre_and_post;
|
|
|
|
import tstate::ann::get_post;
|
|
|
|
import tstate::ann::postcond;
|
|
|
|
import tstate::ann::true_precond;
|
|
|
|
import tstate::ann::false_postcond;
|
|
|
|
import tstate::ann::empty_poststate;
|
2011-06-09 11:56:35 -05:00
|
|
|
import tstate::ann::require;
|
2011-05-14 21:02:30 -05:00
|
|
|
import tstate::ann::require_and_preserve;
|
|
|
|
import tstate::ann::union;
|
|
|
|
import tstate::ann::intersect;
|
|
|
|
import tstate::ann::pp_clone;
|
|
|
|
import tstate::ann::empty_prestate;
|
2011-05-18 17:43:05 -05:00
|
|
|
import tstate::ann::set_precondition;
|
|
|
|
import tstate::ann::set_postcondition;
|
2011-05-14 21:02:30 -05:00
|
|
|
import aux::crate_ctxt;
|
|
|
|
import aux::fn_ctxt;
|
2011-06-01 20:10:10 -05:00
|
|
|
import aux::num_constraints;
|
|
|
|
import aux::constraint;
|
2011-05-14 21:02:30 -05:00
|
|
|
import aux::expr_pp;
|
|
|
|
import aux::stmt_pp;
|
|
|
|
import aux::block_pp;
|
2011-05-18 17:43:05 -05:00
|
|
|
import aux::clear_pp;
|
|
|
|
import aux::clear_precond;
|
2011-05-14 21:02:30 -05:00
|
|
|
import aux::set_pre_and_post;
|
2011-05-18 17:43:05 -05:00
|
|
|
import aux::copy_pre_post;
|
2011-06-17 21:07:23 -05:00
|
|
|
import aux::copy_pre_post_;
|
2011-05-14 21:02:30 -05:00
|
|
|
import aux::expr_precond;
|
|
|
|
import aux::expr_postcond;
|
|
|
|
import aux::expr_prestate;
|
|
|
|
import aux::expr_poststate;
|
|
|
|
import aux::block_postcond;
|
|
|
|
import aux::fn_info;
|
|
|
|
import aux::log_pp;
|
2011-06-19 15:41:21 -05:00
|
|
|
import aux::node_id_to_def;
|
|
|
|
import aux::node_id_to_def_strict;
|
|
|
|
import aux::node_id_to_ts_ann;
|
2011-05-18 17:43:05 -05:00
|
|
|
import aux::set_postcond_false;
|
2011-05-27 22:41:48 -05:00
|
|
|
import aux::controlflow_expr;
|
2011-06-09 11:56:35 -05:00
|
|
|
import aux::expr_to_constr;
|
2011-06-17 21:07:23 -05:00
|
|
|
import aux::if_ty;
|
|
|
|
import aux::if_check;
|
|
|
|
import aux::plain_if;
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
import aux::forget_in_postcond;
|
2011-06-25 00:17:17 -05:00
|
|
|
import aux::forget_in_postcond_still_init;
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-06-09 11:56:35 -05:00
|
|
|
import aux::constraints_expr;
|
|
|
|
import aux::substitute_constr_args;
|
2011-06-13 20:10:33 -05:00
|
|
|
import aux::ninit;
|
|
|
|
import aux::npred;
|
|
|
|
import aux::path_to_ident;
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
import bitvectors::bit_num;
|
|
|
|
import bitvectors::promises;
|
2011-05-14 21:02:30 -05:00
|
|
|
import bitvectors::seq_preconds;
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
import bitvectors::seq_postconds;
|
2011-06-27 20:12:37 -05:00
|
|
|
import bitvectors::intersect_states;
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
import bitvectors::declare_var;
|
|
|
|
import bitvectors::gen_poststate;
|
2011-06-17 21:07:23 -05:00
|
|
|
import bitvectors::relax_precond_block;
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
import bitvectors::gen;
|
2011-05-31 20:24:06 -05:00
|
|
|
import front::ast::*;
|
2011-06-19 15:41:21 -05:00
|
|
|
import util::common::new_int_hash;
|
2011-05-14 21:02:30 -05:00
|
|
|
import util::common::new_def_hash;
|
|
|
|
import util::common::uistr;
|
|
|
|
import util::common::log_expr;
|
|
|
|
import util::common::log_fn;
|
|
|
|
import util::common::elt_exprs;
|
|
|
|
import util::common::field_exprs;
|
|
|
|
import util::common::has_nonlocal_exits;
|
|
|
|
import util::common::log_stmt;
|
|
|
|
import util::common::log_expr_err;
|
2011-05-18 17:43:05 -05:00
|
|
|
import util::common::log_block_err;
|
|
|
|
import util::common::log_block;
|
2011-05-31 20:24:06 -05:00
|
|
|
import util::common::span;
|
2011-06-24 17:11:22 -05:00
|
|
|
import pretty::ppaux::fn_ident_to_string;
|
2011-05-26 18:02:25 -05:00
|
|
|
|
2011-05-14 21:02:30 -05:00
|
|
|
fn find_pre_post_mod(&_mod m) -> _mod {
|
2011-06-15 13:19:50 -05:00
|
|
|
log "implement find_pre_post_mod!";
|
2011-05-14 21:02:30 -05:00
|
|
|
fail;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn find_pre_post_native_mod(&native_mod m) -> native_mod {
|
2011-06-15 13:19:50 -05:00
|
|
|
log "implement find_pre_post_native_mod";
|
2011-05-14 21:02:30 -05:00
|
|
|
fail;
|
|
|
|
}
|
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
fn find_pre_post_obj(&crate_ctxt ccx, _obj o) {
|
|
|
|
fn do_a_method(crate_ctxt ccx, &@method m) {
|
2011-05-14 21:02:30 -05:00
|
|
|
assert (ccx.fm.contains_key(m.node.id));
|
2011-06-15 13:19:50 -05:00
|
|
|
let fn_ctxt fcx =
|
|
|
|
rec(enclosing=ccx.fm.get(m.node.id),
|
|
|
|
id=m.node.id,
|
|
|
|
name=m.node.ident,
|
|
|
|
ccx=ccx);
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_fn(fcx, m.node.meth);
|
|
|
|
}
|
2011-06-15 13:19:50 -05:00
|
|
|
auto f = bind do_a_method(ccx, _);
|
2011-05-17 13:41:41 -05:00
|
|
|
vec::map[@method, ()](f, o.methods);
|
2011-05-14 21:02:30 -05:00
|
|
|
option::map[@method, ()](f, o.dtor);
|
|
|
|
}
|
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
fn find_pre_post_item(&crate_ctxt ccx, &item i) {
|
2011-05-14 21:02:30 -05:00
|
|
|
alt (i.node) {
|
2011-06-16 04:53:06 -05:00
|
|
|
case (item_const(_, ?e)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
// make a fake fcx
|
2011-06-16 18:55:46 -05:00
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
auto fake_fcx =
|
2011-06-19 15:41:21 -05:00
|
|
|
rec(enclosing=rec(constrs=@new_int_hash[constraint](),
|
2011-06-15 13:19:50 -05:00
|
|
|
num_constraints=0u,
|
|
|
|
cf=return),
|
2011-06-19 15:41:21 -05:00
|
|
|
id=0,
|
2011-06-15 13:19:50 -05:00
|
|
|
name="",
|
|
|
|
ccx=ccx);
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fake_fcx, e);
|
|
|
|
}
|
2011-06-24 11:10:40 -05:00
|
|
|
case (item_fn(?f, _)) {
|
2011-06-16 04:53:06 -05:00
|
|
|
assert (ccx.fm.contains_key(i.id));
|
2011-06-16 18:55:46 -05:00
|
|
|
auto fcx =
|
|
|
|
rec(enclosing=ccx.fm.get(i.id),
|
|
|
|
id=i.id,
|
|
|
|
name=i.ident,
|
|
|
|
ccx=ccx);
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_fn(fcx, f);
|
|
|
|
}
|
2011-06-16 04:53:06 -05:00
|
|
|
case (item_mod(?m)) { find_pre_post_mod(m); }
|
2011-06-16 18:55:46 -05:00
|
|
|
case (item_native_mod(?nm)) { find_pre_post_native_mod(nm); }
|
2011-06-16 04:53:06 -05:00
|
|
|
case (item_ty(_, _)) { ret; }
|
|
|
|
case (item_tag(_, _)) { ret; }
|
2011-06-24 11:10:40 -05:00
|
|
|
case (item_res(?dtor, ?dtor_id, _, _)) {
|
|
|
|
auto fcx = rec(enclosing=ccx.fm.get(dtor_id),
|
|
|
|
id=dtor_id,
|
|
|
|
name=i.ident,
|
|
|
|
ccx=ccx);
|
|
|
|
find_pre_post_fn(fcx, dtor);
|
|
|
|
}
|
2011-06-16 18:55:46 -05:00
|
|
|
case (item_obj(?o, _, _)) { find_pre_post_obj(ccx, o); }
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-05-14 21:02:30 -05:00
|
|
|
/* Finds the pre and postcondition for each expr in <args>;
|
|
|
|
sets the precondition in a to be the result of combining
|
|
|
|
the preconditions for <args>, and the postcondition in a to
|
|
|
|
be the union of all postconditions for <args> */
|
2011-06-19 15:41:21 -05:00
|
|
|
fn find_pre_post_exprs(&fn_ctxt fcx, &vec[@expr] args, node_id id) {
|
2011-05-18 17:43:05 -05:00
|
|
|
if (vec::len[@expr](args) > 0u) {
|
2011-06-15 13:19:50 -05:00
|
|
|
log "find_pre_post_exprs: oper =";
|
|
|
|
log_expr(*args.(0));
|
2011-05-18 17:43:05 -05:00
|
|
|
}
|
2011-05-14 21:02:30 -05:00
|
|
|
auto enclosing = fcx.enclosing;
|
2011-06-15 13:19:50 -05:00
|
|
|
auto fm = fcx.ccx.fm;
|
|
|
|
auto nv = num_constraints(enclosing);
|
|
|
|
fn do_one(fn_ctxt fcx, &@expr e) { find_pre_post_expr(fcx, e); }
|
2011-05-14 21:02:30 -05:00
|
|
|
auto f = bind do_one(fcx, _);
|
2011-05-17 13:41:41 -05:00
|
|
|
vec::map[@expr, ()](f, args);
|
2011-05-18 17:43:05 -05:00
|
|
|
fn get_pp(crate_ctxt ccx, &@expr e) -> pre_and_post {
|
|
|
|
ret expr_pp(ccx, e);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-05-18 17:43:05 -05:00
|
|
|
auto g = bind get_pp(fcx.ccx, _);
|
2011-05-17 13:41:41 -05:00
|
|
|
auto pps = vec::map[@expr, pre_and_post](g, args);
|
2011-05-14 21:02:30 -05:00
|
|
|
auto h = get_post;
|
2011-06-19 15:41:21 -05:00
|
|
|
set_pre_and_post(fcx.ccx, id, seq_preconds(fcx, pps),
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
seq_postconds(fcx, vec::map(h, pps)));
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
fn find_pre_post_loop(&fn_ctxt fcx, &@local l, &@expr index, &block body,
|
2011-06-19 15:41:21 -05:00
|
|
|
node_id id) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, index);
|
|
|
|
find_pre_post_block(fcx, body);
|
2011-06-17 21:07:23 -05:00
|
|
|
auto v_init = rec(id=l.node.id, c=ninit(l.node.ident));
|
2011-06-19 15:41:21 -05:00
|
|
|
relax_precond_block(fcx, bit_num(fcx, v_init) as node_id, body);
|
2011-06-17 21:07:23 -05:00
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
auto loop_precond =
|
2011-06-17 21:07:23 -05:00
|
|
|
seq_preconds(fcx,
|
|
|
|
[expr_pp(fcx.ccx, index),
|
|
|
|
block_pp(fcx.ccx, body)]);
|
2011-06-27 20:12:37 -05:00
|
|
|
auto loop_postcond = intersect_states(expr_postcond(fcx.ccx, index),
|
|
|
|
block_postcond(fcx.ccx, body));
|
2011-06-19 15:41:21 -05:00
|
|
|
copy_pre_post_(fcx.ccx, id, loop_precond, loop_postcond);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
|
2011-06-16 13:56:34 -05:00
|
|
|
// Generates a pre/post assuming that a is the
|
|
|
|
// annotation for an if-expression with consequent conseq
|
|
|
|
// and alternative maybe_alt
|
|
|
|
fn join_then_else(&fn_ctxt fcx, &@expr antec, &block conseq,
|
2011-06-19 15:41:21 -05:00
|
|
|
&option::t[@expr] maybe_alt, node_id id, &if_ty chck) {
|
2011-06-16 13:56:34 -05:00
|
|
|
auto num_local_vars = num_constraints(fcx.enclosing);
|
2011-06-17 21:07:23 -05:00
|
|
|
find_pre_post_expr(fcx, antec);
|
2011-06-16 13:56:34 -05:00
|
|
|
find_pre_post_block(fcx, conseq);
|
|
|
|
alt (maybe_alt) {
|
|
|
|
case (none) {
|
2011-06-17 21:07:23 -05:00
|
|
|
alt (chck) {
|
|
|
|
case (if_check) {
|
|
|
|
let aux::constr c = expr_to_constr(fcx.ccx.tcx, antec);
|
2011-06-21 15:16:40 -05:00
|
|
|
gen(fcx, antec.id, c.node);
|
2011-06-17 21:07:23 -05:00
|
|
|
}
|
|
|
|
case (_) {}
|
|
|
|
}
|
|
|
|
|
2011-06-16 13:56:34 -05:00
|
|
|
auto precond_res =
|
|
|
|
seq_preconds(fcx,
|
|
|
|
[expr_pp(fcx.ccx, antec),
|
|
|
|
block_pp(fcx.ccx, conseq)]);
|
2011-06-19 15:41:21 -05:00
|
|
|
set_pre_and_post(fcx.ccx, id, precond_res,
|
2011-06-16 13:56:34 -05:00
|
|
|
expr_poststate(fcx.ccx, antec));
|
|
|
|
}
|
|
|
|
case (some(?altern)) {
|
2011-06-17 21:07:23 -05:00
|
|
|
/*
|
|
|
|
if check = if_check, then
|
|
|
|
be sure that the predicate implied by antec
|
|
|
|
is *not* true in the alternative
|
|
|
|
*/
|
2011-06-16 13:56:34 -05:00
|
|
|
find_pre_post_expr(fcx, altern);
|
|
|
|
auto precond_false_case =
|
|
|
|
seq_preconds(fcx,
|
|
|
|
[expr_pp(fcx.ccx, antec),
|
|
|
|
expr_pp(fcx.ccx, altern)]);
|
|
|
|
auto postcond_false_case =
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
seq_postconds(fcx, [expr_postcond(fcx.ccx, antec),
|
|
|
|
expr_postcond(fcx.ccx, altern)]);
|
2011-06-17 21:07:23 -05:00
|
|
|
|
|
|
|
/* Be sure to set the bit for the check condition here,
|
|
|
|
so that it's *not* set in the alternative. */
|
|
|
|
alt (chck) {
|
|
|
|
case (if_check) {
|
|
|
|
let aux::constr c = expr_to_constr(fcx.ccx.tcx, antec);
|
2011-06-21 15:16:40 -05:00
|
|
|
gen(fcx, antec.id, c.node);
|
2011-06-17 21:07:23 -05:00
|
|
|
}
|
|
|
|
case (_) {}
|
|
|
|
}
|
|
|
|
auto precond_true_case =
|
|
|
|
seq_preconds(fcx,
|
|
|
|
[expr_pp(fcx.ccx, antec),
|
|
|
|
block_pp(fcx.ccx, conseq)]);
|
|
|
|
auto postcond_true_case =
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
seq_postconds(fcx, [expr_postcond(fcx.ccx, antec),
|
|
|
|
block_postcond(fcx.ccx, conseq)]);
|
2011-06-17 21:07:23 -05:00
|
|
|
|
2011-06-16 13:56:34 -05:00
|
|
|
auto precond_res =
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
seq_postconds(fcx, [precond_true_case,
|
|
|
|
precond_false_case]);
|
2011-06-16 13:56:34 -05:00
|
|
|
auto postcond_res =
|
2011-06-27 20:12:37 -05:00
|
|
|
intersect_states(postcond_true_case, postcond_false_case);
|
2011-06-19 15:41:21 -05:00
|
|
|
set_pre_and_post(fcx.ccx, id, precond_res, postcond_res);
|
2011-06-16 13:56:34 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-19 15:41:21 -05:00
|
|
|
fn gen_if_local(&fn_ctxt fcx, @expr lhs, @expr rhs, node_id larger_id,
|
|
|
|
node_id new_var, &path pth) {
|
|
|
|
alt (node_id_to_def(fcx.ccx, new_var)) {
|
2011-06-15 13:19:50 -05:00
|
|
|
case (some(?d)) {
|
|
|
|
alt (d) {
|
|
|
|
case (def_local(?d_id)) {
|
|
|
|
find_pre_post_expr(fcx, rhs);
|
|
|
|
auto p = expr_pp(fcx.ccx, rhs);
|
2011-06-19 15:41:21 -05:00
|
|
|
set_pre_and_post(fcx.ccx, larger_id, p.precondition,
|
2011-06-15 13:19:50 -05:00
|
|
|
p.postcondition);
|
2011-06-19 15:41:21 -05:00
|
|
|
gen(fcx, larger_id,
|
|
|
|
rec(id=d_id._1,
|
2011-06-15 13:19:50 -05:00
|
|
|
c=ninit(path_to_ident(fcx.ccx.tcx, pth))));
|
|
|
|
}
|
2011-06-19 15:41:21 -05:00
|
|
|
case (_) { find_pre_post_exprs(fcx, [lhs, rhs], larger_id); }
|
2011-06-15 13:19:50 -05:00
|
|
|
}
|
|
|
|
}
|
2011-06-19 15:41:21 -05:00
|
|
|
case (_) { find_pre_post_exprs(fcx, [lhs, rhs], larger_id); }
|
2011-06-15 13:19:50 -05:00
|
|
|
}
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-05-14 21:02:30 -05:00
|
|
|
/* Fills in annotations as a side effect. Does not rebuild the expr */
|
2011-06-15 13:19:50 -05:00
|
|
|
fn find_pre_post_expr(&fn_ctxt fcx, @expr e) {
|
|
|
|
auto enclosing = fcx.enclosing;
|
2011-06-01 20:10:10 -05:00
|
|
|
auto num_local_vars = num_constraints(enclosing);
|
2011-06-15 13:19:50 -05:00
|
|
|
fn do_rand_(fn_ctxt fcx, &@expr e) { find_pre_post_expr(fcx, e); }
|
2011-06-25 00:17:17 -05:00
|
|
|
|
2011-05-14 21:02:30 -05:00
|
|
|
alt (e.node) {
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_call(?operator, ?operands)) {
|
2011-06-25 00:17:17 -05:00
|
|
|
auto args = vec::clone(operands);
|
|
|
|
vec::push(args, operator);
|
2011-06-21 15:16:40 -05:00
|
|
|
find_pre_post_exprs(fcx, args, e.id);
|
2011-06-15 17:14:30 -05:00
|
|
|
/* see if the call has any constraints on its type */
|
2011-06-16 18:55:46 -05:00
|
|
|
for (@ty::constr_def c in constraints_expr(fcx.ccx.tcx, operator))
|
|
|
|
{
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
auto i =
|
|
|
|
bit_num(fcx,
|
|
|
|
rec(id=c.node.id._1,
|
|
|
|
c=substitute_constr_args(fcx.ccx.tcx,
|
|
|
|
operands, c)));
|
2011-06-25 00:17:17 -05:00
|
|
|
require(i, expr_pp(fcx.ccx, e));
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
}
|
2011-06-16 18:55:46 -05:00
|
|
|
|
2011-05-27 22:41:48 -05:00
|
|
|
/* if this is a failing call, its postcondition sets everything */
|
|
|
|
alt (controlflow_expr(fcx.ccx, operator)) {
|
2011-06-21 15:16:40 -05:00
|
|
|
case (noreturn) { set_postcond_false(fcx.ccx, e.id); }
|
2011-05-27 22:41:48 -05:00
|
|
|
case (_) { }
|
|
|
|
}
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_spawn(_, _, ?operator, ?operands)) {
|
2011-06-25 00:17:17 -05:00
|
|
|
auto args = vec::clone(operands);
|
|
|
|
vec::push(args, operator);
|
2011-06-21 15:16:40 -05:00
|
|
|
find_pre_post_exprs(fcx, args, e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_vec(?args, _, _)) {
|
|
|
|
find_pre_post_exprs(fcx, args, e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_tup(?elts)) {
|
|
|
|
find_pre_post_exprs(fcx, elt_exprs(elts), e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_path(?p)) {
|
2011-06-24 12:04:08 -05:00
|
|
|
auto rslt = expr_pp(fcx.ccx, e);
|
|
|
|
clear_pp(rslt);
|
2011-06-21 15:16:40 -05:00
|
|
|
auto df = node_id_to_def_strict(fcx.ccx.tcx, e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
alt (df) {
|
|
|
|
case (def_local(?d_id)) {
|
2011-06-15 13:19:50 -05:00
|
|
|
auto i =
|
|
|
|
bit_num(fcx,
|
2011-06-19 15:41:21 -05:00
|
|
|
rec(id=d_id._1,
|
2011-06-15 13:19:50 -05:00
|
|
|
c=ninit(path_to_ident(fcx.ccx.tcx, p))));
|
2011-06-24 12:04:08 -05:00
|
|
|
require_and_preserve(i, rslt);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-15 13:19:50 -05:00
|
|
|
case (_) {/* nothing to check */ }
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_self_method(?v)) { clear_pp(expr_pp(fcx.ccx, e)); }
|
|
|
|
case (expr_log(_, ?arg)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, arg);
|
2011-06-21 15:16:40 -05:00
|
|
|
copy_pre_post(fcx.ccx, e.id, arg);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_chan(?arg)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, arg);
|
2011-06-21 15:16:40 -05:00
|
|
|
copy_pre_post(fcx.ccx, e.id, arg);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_put(?opt)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
alt (opt) {
|
2011-05-30 23:39:19 -05:00
|
|
|
case (some(?arg)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, arg);
|
2011-06-21 15:16:40 -05:00
|
|
|
copy_pre_post(fcx.ccx, e.id, arg);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-15 13:19:50 -05:00
|
|
|
case (none) { clear_pp(expr_pp(fcx.ccx, e)); }
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
// FIXME this was just put in here as a placeholder
|
|
|
|
case (expr_fn(?f)) { clear_pp(expr_pp(fcx.ccx, e)); }
|
|
|
|
case (expr_block(?b)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_block(fcx, b);
|
2011-05-18 17:43:05 -05:00
|
|
|
auto p = block_pp(fcx.ccx, b);
|
2011-06-21 15:16:40 -05:00
|
|
|
set_pre_and_post(fcx.ccx, e.id, p.precondition, p.postcondition);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_rec(?fields, ?maybe_base)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
auto es = field_exprs(fields);
|
2011-06-25 00:17:17 -05:00
|
|
|
vec::plus_option(es, maybe_base);
|
2011-06-21 15:16:40 -05:00
|
|
|
find_pre_post_exprs(fcx, es, e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_move(?lhs, ?rhs)) {
|
2011-05-27 19:38:52 -05:00
|
|
|
alt (lhs.node) {
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_path(?p)) {
|
|
|
|
gen_if_local(fcx, lhs, rhs, e.id, lhs.id, p);
|
2011-05-27 19:38:52 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (_) { find_pre_post_exprs(fcx, [lhs, rhs], e.id); }
|
2011-05-27 19:38:52 -05:00
|
|
|
}
|
2011-06-25 05:16:48 -05:00
|
|
|
if (is_path(rhs)) {
|
|
|
|
forget_in_postcond(fcx, e.id, rhs.id);
|
|
|
|
}
|
2011-05-27 19:38:52 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_swap(?lhs, ?rhs)) {
|
2011-06-13 19:34:54 -05:00
|
|
|
// Both sides must already be initialized
|
2011-06-21 15:16:40 -05:00
|
|
|
find_pre_post_exprs(fcx, [lhs, rhs], e.id);
|
2011-06-25 00:17:17 -05:00
|
|
|
forget_in_postcond_still_init(fcx, e.id, lhs.id);
|
|
|
|
forget_in_postcond_still_init(fcx, e.id, rhs.id);
|
|
|
|
// Could be more precise and swap the roles of lhs and rhs
|
|
|
|
// in any constraints
|
2011-06-13 19:34:54 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_assign(?lhs, ?rhs)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
alt (lhs.node) {
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_path(?p)) {
|
|
|
|
gen_if_local(fcx, lhs, rhs, e.id, lhs.id, p);
|
2011-06-25 00:17:17 -05:00
|
|
|
forget_in_postcond_still_init(fcx, e.id, lhs.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (_) { find_pre_post_exprs(fcx, [lhs, rhs], e.id); }
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_recv(?lhs, ?rhs)) {
|
2011-06-18 22:16:30 -05:00
|
|
|
alt (rhs.node) {
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_path(?p)) {
|
|
|
|
gen_if_local(fcx, rhs, lhs, e.id, rhs.id, p);
|
2011-06-25 00:17:17 -05:00
|
|
|
forget_in_postcond_still_init(fcx, e.id, lhs.id);
|
|
|
|
}
|
2011-05-14 21:02:30 -05:00
|
|
|
case (_) {
|
2011-06-18 22:16:30 -05:00
|
|
|
// doesn't check that rhs is an lval, but
|
2011-05-14 21:02:30 -05:00
|
|
|
// that's probably ok
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-06-21 15:16:40 -05:00
|
|
|
find_pre_post_exprs(fcx, [lhs, rhs], e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_assign_op(_, ?lhs, ?rhs)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
/* Different from expr_assign in that the lhs *must*
|
|
|
|
already be initialized */
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-06-21 15:16:40 -05:00
|
|
|
find_pre_post_exprs(fcx, [lhs, rhs], e.id);
|
2011-06-25 00:17:17 -05:00
|
|
|
forget_in_postcond_still_init(fcx, e.id, lhs.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_lit(_)) { clear_pp(expr_pp(fcx.ccx, e)); }
|
|
|
|
case (expr_ret(?maybe_val)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
alt (maybe_val) {
|
2011-05-30 23:39:19 -05:00
|
|
|
case (none) {
|
2011-06-21 15:16:40 -05:00
|
|
|
clear_precond(fcx.ccx, e.id);
|
|
|
|
set_postcond_false(fcx.ccx, e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-05-30 23:39:19 -05:00
|
|
|
case (some(?ret_val)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, ret_val);
|
2011-06-21 15:16:40 -05:00
|
|
|
set_precondition(node_id_to_ts_ann(fcx.ccx, e.id),
|
2011-05-18 17:43:05 -05:00
|
|
|
expr_precond(fcx.ccx, ret_val));
|
2011-06-21 15:16:40 -05:00
|
|
|
set_postcond_false(fcx.ccx, e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_be(?val)) {
|
|
|
|
find_pre_post_expr(fcx, val);
|
|
|
|
set_pre_and_post(fcx.ccx, e.id, expr_prestate(fcx.ccx, val),
|
2011-06-15 13:19:50 -05:00
|
|
|
false_postcond(num_local_vars));
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_if(?antec, ?conseq, ?maybe_alt)) {
|
|
|
|
join_then_else(fcx, antec, conseq, maybe_alt, e.id, plain_if);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-23 17:15:50 -05:00
|
|
|
case (expr_ternary(_, _, _)) {
|
|
|
|
find_pre_post_expr(fcx, ternary_to_if(e));
|
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_binary(?bop, ?l, ?r)) {
|
2011-06-28 15:07:05 -05:00
|
|
|
if (lazy_binop(bop)) {
|
|
|
|
find_pre_post_expr(fcx, l);
|
|
|
|
find_pre_post_expr(fcx, r);
|
|
|
|
auto overall_pre = seq_preconds(fcx,
|
|
|
|
[expr_pp(fcx.ccx, l), expr_pp(fcx.ccx, r)]);
|
|
|
|
set_precondition(node_id_to_ts_ann(fcx.ccx, e.id),
|
|
|
|
overall_pre);
|
|
|
|
set_postcondition(node_id_to_ts_ann(fcx.ccx, e.id),
|
|
|
|
expr_postcond(fcx.ccx, l));
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
find_pre_post_exprs(fcx, [l, r], e.id);
|
|
|
|
}
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_send(?l, ?r)) {
|
|
|
|
find_pre_post_exprs(fcx, [l, r], e.id);
|
2011-06-19 15:41:21 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_unary(_, ?operand)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, operand);
|
2011-06-21 15:16:40 -05:00
|
|
|
copy_pre_post(fcx.ccx, e.id, operand);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_cast(?operand, _)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, operand);
|
2011-06-21 15:16:40 -05:00
|
|
|
copy_pre_post(fcx.ccx, e.id, operand);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_while(?test, ?body)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, test);
|
|
|
|
find_pre_post_block(fcx, body);
|
2011-06-21 15:16:40 -05:00
|
|
|
set_pre_and_post(fcx.ccx, e.id,
|
2011-05-26 18:02:25 -05:00
|
|
|
seq_preconds(fcx,
|
2011-06-15 13:19:50 -05:00
|
|
|
[expr_pp(fcx.ccx, test),
|
|
|
|
block_pp(fcx.ccx, body)]),
|
2011-06-27 20:12:37 -05:00
|
|
|
intersect_states(expr_postcond(fcx.ccx, test),
|
|
|
|
block_postcond(fcx.ccx,
|
|
|
|
body)));
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_do_while(?body, ?test)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_block(fcx, body);
|
|
|
|
find_pre_post_expr(fcx, test);
|
2011-06-15 13:19:50 -05:00
|
|
|
auto loop_postcond =
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
seq_postconds(fcx, [block_postcond(fcx.ccx, body),
|
|
|
|
expr_postcond(fcx.ccx, test)]);
|
2011-05-14 21:02:30 -05:00
|
|
|
/* conservative approximination: if the body
|
|
|
|
could break or cont, the test may never be executed */
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-05-14 21:02:30 -05:00
|
|
|
if (has_nonlocal_exits(body)) {
|
|
|
|
loop_postcond = empty_poststate(num_local_vars);
|
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
set_pre_and_post(fcx.ccx, e.id,
|
2011-06-15 13:19:50 -05:00
|
|
|
seq_preconds(fcx,
|
2011-06-13 19:04:15 -05:00
|
|
|
[block_pp(fcx.ccx, body),
|
|
|
|
expr_pp(fcx.ccx, test)]),
|
|
|
|
loop_postcond);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_for(?d, ?index, ?body)) {
|
|
|
|
find_pre_post_loop(fcx, d, index, body, e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_for_each(?d, ?index, ?body)) {
|
|
|
|
find_pre_post_loop(fcx, d, index, body, e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_index(?val, ?sub)) {
|
|
|
|
find_pre_post_exprs(fcx, [val, sub], e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_alt(?ex, ?alts)) {
|
2011-05-27 22:41:48 -05:00
|
|
|
find_pre_post_expr(fcx, ex);
|
2011-05-14 21:02:30 -05:00
|
|
|
fn do_an_alt(&fn_ctxt fcx, &arm an_alt) -> pre_and_post {
|
|
|
|
find_pre_post_block(fcx, an_alt.block);
|
2011-05-18 17:43:05 -05:00
|
|
|
ret block_pp(fcx.ccx, an_alt.block);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
auto f = bind do_an_alt(fcx, _);
|
2011-05-17 13:41:41 -05:00
|
|
|
auto alt_pps = vec::map[arm, pre_and_post](f, alts);
|
2011-05-26 18:02:25 -05:00
|
|
|
fn combine_pp(pre_and_post antec, fn_ctxt fcx, &pre_and_post pp,
|
2011-05-14 21:02:30 -05:00
|
|
|
&pre_and_post next) -> pre_and_post {
|
2011-05-26 18:02:25 -05:00
|
|
|
union(pp.precondition, seq_preconds(fcx, [antec, next]));
|
2011-05-14 21:02:30 -05:00
|
|
|
intersect(pp.postcondition, next.postcondition);
|
|
|
|
ret pp;
|
|
|
|
}
|
2011-06-15 13:19:50 -05:00
|
|
|
auto antec_pp = pp_clone(expr_pp(fcx.ccx, ex));
|
|
|
|
auto e_pp =
|
|
|
|
@rec(precondition=empty_prestate(num_local_vars),
|
|
|
|
postcondition=false_postcond(num_local_vars));
|
2011-05-26 18:02:25 -05:00
|
|
|
auto g = bind combine_pp(antec_pp, fcx, _, _);
|
2011-06-15 13:19:50 -05:00
|
|
|
auto alts_overall_pp =
|
|
|
|
vec::foldl[pre_and_post, pre_and_post](g, e_pp, alt_pps);
|
2011-06-21 15:16:40 -05:00
|
|
|
set_pre_and_post(fcx.ccx, e.id, alts_overall_pp.precondition,
|
2011-05-18 17:43:05 -05:00
|
|
|
alts_overall_pp.postcondition);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_field(?operator, _)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, operator);
|
2011-06-21 15:16:40 -05:00
|
|
|
copy_pre_post(fcx.ccx, e.id, operator);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_fail(_)) {
|
|
|
|
set_pre_and_post(fcx.ccx, e.id,
|
2011-05-14 21:02:30 -05:00
|
|
|
/* if execution continues after fail,
|
|
|
|
then everything is true! */
|
2011-06-15 13:19:50 -05:00
|
|
|
empty_prestate(num_local_vars),
|
|
|
|
false_postcond(num_local_vars));
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_assert(?p)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, p);
|
2011-06-21 15:16:40 -05:00
|
|
|
copy_pre_post(fcx.ccx, e.id, p);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_check(?p)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, p);
|
2011-06-21 15:16:40 -05:00
|
|
|
copy_pre_post(fcx.ccx, e.id, p);
|
2011-06-09 11:56:35 -05:00
|
|
|
/* predicate p holds after this expression executes */
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-06-10 21:12:42 -05:00
|
|
|
let aux::constr c = expr_to_constr(fcx.ccx.tcx, p);
|
2011-06-21 15:16:40 -05:00
|
|
|
gen(fcx, e.id, c.node);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_if_check(?p, ?conseq, ?maybe_alt)) {
|
|
|
|
join_then_else(fcx, p, conseq, maybe_alt, e.id, if_check);
|
2011-06-16 13:56:34 -05:00
|
|
|
}
|
|
|
|
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_bind(?operator, ?maybe_args)) {
|
2011-05-17 13:41:41 -05:00
|
|
|
auto args = vec::cat_options[@expr](maybe_args);
|
|
|
|
vec::push[@expr](args, operator); /* ??? order of eval? */
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-06-21 15:16:40 -05:00
|
|
|
find_pre_post_exprs(fcx, args, e.id);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_break) { clear_pp(expr_pp(fcx.ccx, e)); }
|
|
|
|
case (expr_cont) { clear_pp(expr_pp(fcx.ccx, e)); }
|
2011-06-28 17:54:16 -05:00
|
|
|
case (expr_port(_)) { clear_pp(expr_pp(fcx.ccx, e)); }
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_ext(_, _, _, ?expanded)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, expanded);
|
2011-06-21 15:16:40 -05:00
|
|
|
copy_pre_post(fcx.ccx, e.id, expanded);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-21 15:16:40 -05:00
|
|
|
case (expr_anon_obj(?anon_obj, _, _)) {
|
2011-05-20 19:41:36 -05:00
|
|
|
alt (anon_obj.with_obj) {
|
2011-05-30 23:39:19 -05:00
|
|
|
case (some(?ex)) {
|
2011-05-20 19:41:36 -05:00
|
|
|
find_pre_post_expr(fcx, ex);
|
2011-06-21 15:16:40 -05:00
|
|
|
copy_pre_post(fcx.ccx, e.id, ex);
|
2011-05-20 19:41:36 -05:00
|
|
|
}
|
2011-06-15 13:19:50 -05:00
|
|
|
case (none) { clear_pp(expr_pp(fcx.ccx, e)); }
|
2011-05-20 19:41:36 -05:00
|
|
|
}
|
|
|
|
}
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
fn find_pre_post_stmt(&fn_ctxt fcx, &stmt s) {
|
|
|
|
log "stmt =";
|
2011-05-14 21:02:30 -05:00
|
|
|
log_stmt(s);
|
2011-06-15 13:19:50 -05:00
|
|
|
auto enclosing = fcx.enclosing;
|
2011-06-01 20:10:10 -05:00
|
|
|
auto num_local_vars = num_constraints(enclosing);
|
2011-06-15 13:19:50 -05:00
|
|
|
alt (s.node) {
|
2011-06-19 15:41:21 -05:00
|
|
|
case (stmt_decl(?adecl, ?id)) {
|
2011-06-15 13:19:50 -05:00
|
|
|
alt (adecl.node) {
|
|
|
|
case (decl_local(?alocal)) {
|
2011-06-16 17:58:25 -05:00
|
|
|
alt (alocal.node.init) {
|
2011-06-15 13:19:50 -05:00
|
|
|
case (some(?an_init)) {
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
/* LHS always becomes initialized,
|
|
|
|
whether or not this is a move */
|
|
|
|
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, an_init.expr);
|
2011-06-19 15:41:21 -05:00
|
|
|
copy_pre_post(fcx.ccx, alocal.node.id,
|
2011-06-16 17:58:25 -05:00
|
|
|
an_init.expr);
|
2011-05-14 21:02:30 -05:00
|
|
|
/* Inherit ann from initializer, and add var being
|
|
|
|
initialized to the postcondition */
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-06-19 15:41:21 -05:00
|
|
|
copy_pre_post(fcx.ccx, id, an_init.expr);
|
|
|
|
gen(fcx, id,
|
2011-06-16 17:58:25 -05:00
|
|
|
rec(id=alocal.node.id,
|
|
|
|
c=ninit(alocal.node.ident)));
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
|
2011-06-25 05:16:48 -05:00
|
|
|
if (an_init.op == init_move &&
|
|
|
|
is_path(an_init.expr)) {
|
|
|
|
forget_in_postcond(fcx, id, an_init.expr.id);
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
}
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-15 13:19:50 -05:00
|
|
|
case (none) {
|
2011-06-19 15:41:21 -05:00
|
|
|
clear_pp(node_id_to_ts_ann(fcx.ccx,
|
|
|
|
alocal.node.id)
|
|
|
|
.conditions);
|
|
|
|
clear_pp(node_id_to_ts_ann(fcx.ccx, id)
|
2011-06-16 17:58:25 -05:00
|
|
|
.conditions);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-06-15 13:19:50 -05:00
|
|
|
case (decl_item(?anitem)) {
|
2011-06-19 15:41:21 -05:00
|
|
|
clear_pp(node_id_to_ts_ann(fcx.ccx, id).conditions);
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_item(fcx.ccx, *anitem);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-06-19 15:41:21 -05:00
|
|
|
case (stmt_expr(?e, ?id)) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_expr(fcx, e);
|
2011-06-19 15:41:21 -05:00
|
|
|
copy_pre_post(fcx.ccx, id, e);
|
2011-06-15 13:19:50 -05:00
|
|
|
}
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
fn find_pre_post_block(&fn_ctxt fcx, block b) {
|
2011-05-14 21:02:30 -05:00
|
|
|
/* Want to say that if there is a break or cont in this
|
|
|
|
block, then that invalidates the poststate upheld by
|
|
|
|
any of the stmts after it.
|
|
|
|
Given that the typechecker has run, we know any break will be in
|
|
|
|
a block that forms a loop body. So that's ok. There'll never be an
|
|
|
|
expr_break outside a loop body, therefore, no expr_break outside a block.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Conservative approximation for now: This says that if a block contains
|
|
|
|
*any* breaks or conts, then its postcondition doesn't promise anything.
|
|
|
|
This will mean that:
|
|
|
|
x = 0;
|
|
|
|
break;
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-05-14 21:02:30 -05:00
|
|
|
won't have a postcondition that says x is initialized, but that's ok.
|
|
|
|
*/
|
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
auto nv = num_constraints(fcx.enclosing);
|
|
|
|
fn do_one_(fn_ctxt fcx, &@stmt s) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_stmt(fcx, *s);
|
2011-06-15 13:19:50 -05:00
|
|
|
log "pre_post for stmt:";
|
2011-05-14 21:02:30 -05:00
|
|
|
log_stmt(*s);
|
2011-06-15 13:19:50 -05:00
|
|
|
log "is:";
|
2011-05-18 17:43:05 -05:00
|
|
|
log_pp(stmt_pp(fcx.ccx, *s));
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
auto do_one = bind do_one_(fcx, _);
|
2011-05-17 13:41:41 -05:00
|
|
|
vec::map[@stmt, ()](do_one, b.node.stmts);
|
2011-06-15 13:19:50 -05:00
|
|
|
fn do_inner_(fn_ctxt fcx, &@expr e) { find_pre_post_expr(fcx, e); }
|
2011-05-14 21:02:30 -05:00
|
|
|
auto do_inner = bind do_inner_(fcx, _);
|
|
|
|
option::map[@expr, ()](do_inner, b.node.expr);
|
2011-05-16 21:04:45 -05:00
|
|
|
let vec[pre_and_post] pps = [];
|
2011-05-18 17:43:05 -05:00
|
|
|
fn get_pp_stmt(crate_ctxt ccx, &@stmt s) -> pre_and_post {
|
|
|
|
ret stmt_pp(ccx, *s);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-15 13:19:50 -05:00
|
|
|
auto f = bind get_pp_stmt(fcx.ccx, _);
|
2011-05-17 13:41:41 -05:00
|
|
|
pps += vec::map[@stmt, pre_and_post](f, b.node.stmts);
|
2011-05-18 17:43:05 -05:00
|
|
|
fn get_pp_expr(crate_ctxt ccx, &@expr e) -> pre_and_post {
|
|
|
|
ret expr_pp(ccx, e);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-05-18 17:43:05 -05:00
|
|
|
auto g = bind get_pp_expr(fcx.ccx, _);
|
2011-05-14 21:02:30 -05:00
|
|
|
plus_option[pre_and_post](pps,
|
2011-06-15 13:19:50 -05:00
|
|
|
option::map[@expr,
|
|
|
|
pre_and_post](g, b.node.expr));
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
auto block_precond = seq_preconds(fcx, pps);
|
2011-05-14 21:02:30 -05:00
|
|
|
auto h = get_post;
|
2011-06-15 13:19:50 -05:00
|
|
|
auto postconds = vec::map[pre_and_post, postcond](h, pps);
|
2011-05-14 21:02:30 -05:00
|
|
|
/* A block may be empty, so this next line ensures that the postconds
|
|
|
|
vector is non-empty. */
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-05-17 13:41:41 -05:00
|
|
|
vec::push[postcond](postconds, block_precond);
|
2011-05-14 21:02:30 -05:00
|
|
|
auto block_postcond = empty_poststate(nv);
|
|
|
|
/* conservative approximation */
|
2011-06-15 13:19:50 -05:00
|
|
|
|
|
|
|
if (!has_nonlocal_exits(b)) {
|
Compute typestate properly for move
typestate now drops constraints correctly in the post-state of
a move expression or a declaration whose op is a move. It doesn't
yet drop constraints mentioning variables that get updated.
To do this, I had to change typestate to use trit-vectors instead
of bit-vectors, because for every constraint, there are three
possible values: known-to-be-false (e.g. after x <- y, init(y) is
known-to-be-false), known-to-be-true, and unknown. Before, we
conflated known-to-be-false with unknown. But move requires them
to be treated differently. Consider:
(program a)
(a1) x = 1;
(a2) y <- x;
(a3) log x;
(program b)
(b1) x = 1;
(b2) y <- z;
(b3) log x;
With only two values, the postcondition of statement a2 for
constraint init(x) is the same as that of b2: 0. But in (a2)'s
postcondition, init(x) *must* be false, but in (b2)'s condition,
it's just whatever it was in the postcondition of the preceding statement.
2011-06-22 23:26:34 -05:00
|
|
|
block_postcond = seq_postconds(fcx, postconds);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
2011-06-19 15:41:21 -05:00
|
|
|
set_pre_and_post(fcx.ccx, b.node.id, block_precond, block_postcond);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
fn find_pre_post_fn(&fn_ctxt fcx, &_fn f) {
|
2011-05-14 21:02:30 -05:00
|
|
|
find_pre_post_block(fcx, f.body);
|
2011-05-31 14:24:18 -05:00
|
|
|
|
|
|
|
// Treat the tail expression as a return statement
|
|
|
|
alt (f.body.node.expr) {
|
|
|
|
case (some(?tailexpr)) {
|
2011-06-21 15:16:40 -05:00
|
|
|
set_postcond_false(fcx.ccx, tailexpr.id);
|
2011-05-31 14:24:18 -05:00
|
|
|
}
|
2011-06-15 13:19:50 -05:00
|
|
|
case (none) {/* fallthrough */ }
|
2011-05-31 14:24:18 -05:00
|
|
|
}
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
|
2011-06-24 17:11:22 -05:00
|
|
|
fn fn_pre_post(crate_ctxt ccx, &_fn f, &span sp, &fn_ident i,
|
|
|
|
node_id id) {
|
2011-05-14 21:02:30 -05:00
|
|
|
assert (ccx.fm.contains_key(id));
|
2011-06-24 17:11:22 -05:00
|
|
|
auto fcx = rec(enclosing=ccx.fm.get(id), id=id,
|
|
|
|
name=fn_ident_to_string(id, i), ccx=ccx);
|
2011-06-15 13:19:50 -05:00
|
|
|
find_pre_post_fn(fcx, f);
|
2011-05-14 21:02:30 -05:00
|
|
|
}
|
|
|
|
//
|
|
|
|
// Local Variables:
|
|
|
|
// mode: rust
|
|
|
|
// fill-column: 78;
|
|
|
|
// indent-tabs-mode: nil
|
|
|
|
// c-basic-offset: 4
|
|
|
|
// buffer-file-coding-system: utf-8-unix
|
|
|
|
// compile-command: "make -k -C $RBUILD 2>&1 | sed -e 's/\\/x\\//x:\\//g'";
|
|
|
|
// End:
|
|
|
|
//
|