6b6bea9531
Doesn't exactly eliminate a match check, but simplifies the logic a bit
208 lines
6.5 KiB
Rust
208 lines
6.5 KiB
Rust
import syntax::ast::*;
|
|
import syntax::{visit, ast_util, ast_map};
|
|
import driver::session::session;
|
|
import std::map::hashmap;
|
|
import dvec::{DVec, dvec};
|
|
|
|
fn check_crate(sess: session, crate: @crate, ast_map: ast_map::map,
|
|
def_map: resolve3::DefMap,
|
|
method_map: typeck::method_map, tcx: ty::ctxt) {
|
|
visit::visit_crate(*crate, false, visit::mk_vt(@{
|
|
visit_item: |a,b,c| check_item(sess, ast_map, def_map, a, b, c),
|
|
visit_pat: check_pat,
|
|
visit_expr: |a,b,c|
|
|
check_expr(sess, def_map, method_map, tcx, a, b, c)
|
|
with *visit::default_visitor()
|
|
}));
|
|
sess.abort_if_errors();
|
|
}
|
|
|
|
fn check_item(sess: session, ast_map: ast_map::map,
|
|
def_map: resolve3::DefMap,
|
|
it: @item, &&_is_const: bool, v: visit::vt<bool>) {
|
|
match it.node {
|
|
item_const(_, ex) => {
|
|
v.visit_expr(ex, true, v);
|
|
check_item_recursion(sess, ast_map, def_map, it);
|
|
}
|
|
item_enum(enum_definition, _) => {
|
|
for enum_definition.variants.each |var| {
|
|
do option::iter(var.node.disr_expr) |ex| {
|
|
v.visit_expr(ex, true, v);
|
|
}
|
|
}
|
|
}
|
|
_ => visit::visit_item(it, false, v)
|
|
}
|
|
}
|
|
|
|
fn check_pat(p: @pat, &&_is_const: bool, v: visit::vt<bool>) {
|
|
fn is_str(e: @expr) -> bool {
|
|
match e.node {
|
|
expr_vstore(@{node: expr_lit(@{node: lit_str(_), _}), _},
|
|
vstore_uniq) => true,
|
|
_ => false
|
|
}
|
|
}
|
|
match p.node {
|
|
// Let through plain ~-string literals here
|
|
pat_lit(a) => if !is_str(a) { v.visit_expr(a, true, v); },
|
|
pat_range(a, b) => {
|
|
if !is_str(a) { v.visit_expr(a, true, v); }
|
|
if !is_str(b) { v.visit_expr(b, true, v); }
|
|
}
|
|
_ => visit::visit_pat(p, false, v)
|
|
}
|
|
}
|
|
|
|
fn check_expr(sess: session, def_map: resolve3::DefMap,
|
|
method_map: typeck::method_map, tcx: ty::ctxt,
|
|
e: @expr, &&is_const: bool, v: visit::vt<bool>) {
|
|
if is_const {
|
|
match e.node {
|
|
expr_unary(box(_), _) | expr_unary(uniq(_), _) |
|
|
expr_unary(deref, _) => {
|
|
sess.span_err(e.span,
|
|
~"disallowed operator in constant expression");
|
|
return;
|
|
}
|
|
expr_lit(@{node: lit_str(_), _}) => { }
|
|
expr_binary(_, _, _) | expr_unary(_, _) => {
|
|
if method_map.contains_key(e.id) {
|
|
sess.span_err(e.span, ~"user-defined operators are not \
|
|
allowed in constant expressions");
|
|
}
|
|
}
|
|
expr_lit(_) => (),
|
|
expr_cast(_, _) => {
|
|
let ety = ty::expr_ty(tcx, e);
|
|
if !ty::type_is_numeric(ety) {
|
|
sess.span_err(e.span, ~"can not cast to `" +
|
|
util::ppaux::ty_to_str(tcx, ety) +
|
|
~"` in a constant expression");
|
|
}
|
|
}
|
|
expr_path(_) => {
|
|
match def_map.find(e.id) {
|
|
some(def_const(def_id)) => {
|
|
if !ast_util::is_local(def_id) {
|
|
sess.span_err(
|
|
e.span, ~"paths in constants may only refer to \
|
|
crate-local constants");
|
|
}
|
|
}
|
|
_ => {
|
|
sess.span_err(
|
|
e.span,
|
|
~"paths in constants may only refer to constants");
|
|
}
|
|
}
|
|
}
|
|
expr_vstore(_, vstore_slice(_)) |
|
|
expr_vstore(_, vstore_fixed(_)) |
|
|
expr_vec(_, m_imm) |
|
|
expr_addr_of(m_imm, _) |
|
|
expr_field(*) |
|
|
expr_index(*) |
|
|
expr_tup(*) |
|
|
expr_struct(*) |
|
|
expr_rec(*) => { }
|
|
expr_addr_of(*) => {
|
|
sess.span_err(
|
|
e.span,
|
|
~"borrowed pointers in constants may only refer to \
|
|
immutable values");
|
|
}
|
|
_ => {
|
|
sess.span_err(e.span,
|
|
~"constant contains unimplemented expression type");
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
match e.node {
|
|
expr_lit(@{node: lit_int(v, t), _}) => {
|
|
if t != ty_char {
|
|
if (v as u64) > ast_util::int_ty_max(
|
|
if t == ty_i { sess.targ_cfg.int_type } else { t }) {
|
|
sess.span_err(e.span, ~"literal out of range for its type");
|
|
}
|
|
}
|
|
}
|
|
expr_lit(@{node: lit_uint(v, t), _}) => {
|
|
if v > ast_util::uint_ty_max(
|
|
if t == ty_u { sess.targ_cfg.uint_type } else { t }) {
|
|
sess.span_err(e.span, ~"literal out of range for its type");
|
|
}
|
|
}
|
|
_ => ()
|
|
}
|
|
visit::visit_expr(e, is_const, v);
|
|
}
|
|
|
|
// Make sure a const item doesn't recursively refer to itself
|
|
// FIXME: Should use the dependency graph when it's available (#1356)
|
|
fn check_item_recursion(sess: session, ast_map: ast_map::map,
|
|
def_map: resolve3::DefMap, it: @item) {
|
|
|
|
type env = {
|
|
root_it: @item,
|
|
sess: session,
|
|
ast_map: ast_map::map,
|
|
def_map: resolve3::DefMap,
|
|
idstack: @DVec<node_id>,
|
|
};
|
|
|
|
let env = {
|
|
root_it: it,
|
|
sess: sess,
|
|
ast_map: ast_map,
|
|
def_map: def_map,
|
|
idstack: @dvec()
|
|
};
|
|
|
|
let visitor = visit::mk_vt(@{
|
|
visit_item: visit_item,
|
|
visit_expr: visit_expr
|
|
with *visit::default_visitor()
|
|
});
|
|
visitor.visit_item(it, env, visitor);
|
|
|
|
fn visit_item(it: @item, &&env: env, v: visit::vt<env>) {
|
|
if (*env.idstack).contains(it.id) {
|
|
env.sess.span_fatal(env.root_it.span, ~"recursive constant");
|
|
}
|
|
(*env.idstack).push(it.id);
|
|
visit::visit_item(it, env, v);
|
|
(*env.idstack).pop();
|
|
}
|
|
|
|
fn visit_expr(e: @expr, &&env: env, v: visit::vt<env>) {
|
|
match e.node {
|
|
expr_path(path) => {
|
|
match env.def_map.find(e.id) {
|
|
some(def_const(def_id)) => {
|
|
match env.ast_map.get(def_id.node) {
|
|
ast_map::node_item(it, _) => {
|
|
v.visit_item(it, env, v);
|
|
}
|
|
_ => fail ~"const not bound to an item"
|
|
}
|
|
}
|
|
_ => ()
|
|
}
|
|
}
|
|
_ => ()
|
|
}
|
|
visit::visit_expr(e, env, v);
|
|
}
|
|
}
|
|
|
|
// Local Variables:
|
|
// mode: rust
|
|
// fill-column: 78;
|
|
// indent-tabs-mode: nil
|
|
// c-basic-offset: 4
|
|
// buffer-file-coding-system: utf-8-unix
|
|
// End:
|