2011-09-12 18:13:28 -05:00
|
|
|
import std::{str, option};
|
2011-08-21 23:44:41 -05:00
|
|
|
import codemap::span;
|
|
|
|
import ast::*;
|
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn respan<@T>(sp: span, t: T) -> spanned<T> { ret {node: t, span: sp}; }
|
2011-08-21 23:44:41 -05:00
|
|
|
|
|
|
|
/* assuming that we're not in macro expansion */
|
|
|
|
fn mk_sp(lo: uint, hi: uint) -> span {
|
|
|
|
ret {lo: lo, hi: hi, expanded_from: codemap::os_none};
|
|
|
|
}
|
|
|
|
|
|
|
|
// make this a const, once the compiler supports it
|
|
|
|
fn dummy_sp() -> span { ret mk_sp(0u, 0u); }
|
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn path_name(p: path) -> str { path_name_i(p.node.idents) }
|
2011-08-21 23:44:41 -05:00
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn path_name_i(idents: [ident]) -> str { str::connect(idents, "::") }
|
2011-08-21 23:44:41 -05:00
|
|
|
|
|
|
|
fn local_def(id: node_id) -> def_id { ret {crate: local_crate, node: id}; }
|
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn variant_def_ids(d: def) -> {tg: def_id, var: def_id} {
|
2011-08-21 23:44:41 -05:00
|
|
|
alt d { def_variant(tag_id, var_id) { ret {tg: tag_id, var: var_id}; } }
|
|
|
|
}
|
|
|
|
|
|
|
|
fn def_id_of_def(d: def) -> def_id {
|
|
|
|
alt d {
|
|
|
|
def_fn(id, _) { ret id; }
|
2011-09-01 03:03:17 -05:00
|
|
|
def_obj_field(id, _) { ret id; }
|
2011-08-21 23:44:41 -05:00
|
|
|
def_mod(id) { ret id; }
|
|
|
|
def_native_mod(id) { ret id; }
|
|
|
|
def_const(id) { ret id; }
|
2011-09-01 03:03:17 -05:00
|
|
|
def_arg(id, _) { ret id; }
|
2011-09-15 07:08:54 -05:00
|
|
|
def_local(id, _) { ret id; }
|
2011-08-21 23:44:41 -05:00
|
|
|
def_variant(_, id) { ret id; }
|
|
|
|
def_ty(id) { ret id; }
|
|
|
|
def_ty_arg(_, _) { fail; }
|
|
|
|
def_binding(id) { ret id; }
|
|
|
|
def_use(id) { ret id; }
|
|
|
|
def_native_ty(id) { ret id; }
|
|
|
|
def_native_fn(id) { ret id; }
|
2011-09-01 07:35:00 -05:00
|
|
|
def_upvar(id, _, _) { ret id; }
|
2011-08-21 23:44:41 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-02 17:34:58 -05:00
|
|
|
type pat_id_map = std::map::hashmap<str, node_id>;
|
2011-08-25 16:15:54 -05:00
|
|
|
|
2011-08-21 23:44:41 -05:00
|
|
|
// This is used because same-named variables in alternative patterns need to
|
|
|
|
// use the node_id of their namesake in the first pattern.
|
2011-09-12 04:27:30 -05:00
|
|
|
fn pat_id_map(pat: @pat) -> pat_id_map {
|
2011-08-21 23:44:41 -05:00
|
|
|
let map = std::map::new_str_hash::<node_id>();
|
|
|
|
for each bound in pat_bindings(pat) {
|
|
|
|
let name = alt bound.node { pat_bind(n) { n } };
|
2011-08-25 19:00:12 -05:00
|
|
|
map.insert(name, bound.id);
|
2011-08-21 23:44:41 -05:00
|
|
|
}
|
|
|
|
ret map;
|
|
|
|
}
|
|
|
|
|
|
|
|
// FIXME: could return a constrained type
|
2011-09-12 04:27:30 -05:00
|
|
|
iter pat_bindings(pat: @pat) -> @pat {
|
2011-08-21 23:44:41 -05:00
|
|
|
alt pat.node {
|
|
|
|
pat_bind(_) { put pat; }
|
|
|
|
pat_tag(_, sub) {
|
|
|
|
for p in sub { for each b in pat_bindings(p) { put b; } }
|
|
|
|
}
|
|
|
|
pat_rec(fields, _) {
|
|
|
|
for f in fields { for each b in pat_bindings(f.pat) { put b; } }
|
|
|
|
}
|
|
|
|
pat_tup(elts) {
|
|
|
|
for elt in elts { for each b in pat_bindings(elt) { put b; } }
|
|
|
|
}
|
|
|
|
pat_box(sub) { for each b in pat_bindings(sub) { put b; } }
|
2011-09-23 13:15:17 -05:00
|
|
|
pat_uniq(sub) { for each b in pat_bindings(sub) { put b; } }
|
2011-09-21 10:31:43 -05:00
|
|
|
pat_wild. | pat_lit(_) { }
|
2011-08-21 23:44:41 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn pat_binding_ids(pat: @pat) -> [node_id] {
|
2011-08-21 23:44:41 -05:00
|
|
|
let found = [];
|
|
|
|
for each b in pat_bindings(pat) { found += [b.id]; }
|
|
|
|
ret found;
|
|
|
|
}
|
|
|
|
|
2011-09-02 17:34:58 -05:00
|
|
|
fn binop_to_str(op: binop) -> str {
|
2011-08-21 23:44:41 -05:00
|
|
|
alt op {
|
2011-09-02 17:34:58 -05:00
|
|
|
add. { ret "+"; }
|
|
|
|
sub. { ret "-"; }
|
|
|
|
mul. { ret "*"; }
|
|
|
|
div. { ret "/"; }
|
|
|
|
rem. { ret "%"; }
|
|
|
|
and. { ret "&&"; }
|
|
|
|
or. { ret "||"; }
|
|
|
|
bitxor. { ret "^"; }
|
|
|
|
bitand. { ret "&"; }
|
|
|
|
bitor. { ret "|"; }
|
|
|
|
lsl. { ret "<<"; }
|
|
|
|
lsr. { ret ">>"; }
|
|
|
|
asr. { ret ">>>"; }
|
|
|
|
eq. { ret "=="; }
|
|
|
|
lt. { ret "<"; }
|
|
|
|
le. { ret "<="; }
|
|
|
|
ne. { ret "!="; }
|
|
|
|
ge. { ret ">="; }
|
|
|
|
gt. { ret ">"; }
|
2011-08-21 23:44:41 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-08-24 15:41:50 -05:00
|
|
|
pure fn lazy_binop(b: binop) -> bool {
|
2011-08-21 23:44:41 -05:00
|
|
|
alt b { and. { true } or. { true } _ { false } }
|
|
|
|
}
|
|
|
|
|
2011-09-02 17:34:58 -05:00
|
|
|
fn unop_to_str(op: unop) -> str {
|
2011-08-21 23:44:41 -05:00
|
|
|
alt op {
|
2011-09-02 17:34:58 -05:00
|
|
|
box(mt) { if mt == mut { ret "@mutable "; } ret "@"; }
|
2011-09-20 20:06:47 -05:00
|
|
|
uniq(mt) { if mt == mut { ret "~mutable "; } ret "~"; }
|
2011-09-02 17:34:58 -05:00
|
|
|
deref. { ret "*"; }
|
|
|
|
not. { ret "!"; }
|
|
|
|
neg. { ret "-"; }
|
2011-08-21 23:44:41 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn is_path(e: @expr) -> bool {
|
2011-08-21 23:44:41 -05:00
|
|
|
ret alt e.node { expr_path(_) { true } _ { false } };
|
|
|
|
}
|
|
|
|
|
2011-09-02 17:34:58 -05:00
|
|
|
fn ty_mach_to_str(tm: ty_mach) -> str {
|
2011-08-21 23:44:41 -05:00
|
|
|
alt tm {
|
2011-09-02 17:34:58 -05:00
|
|
|
ty_u8. { ret "u8"; }
|
|
|
|
ty_u16. { ret "u16"; }
|
|
|
|
ty_u32. { ret "u32"; }
|
|
|
|
ty_u64. { ret "u64"; }
|
|
|
|
ty_i8. { ret "i8"; }
|
|
|
|
ty_i16. { ret "i16"; }
|
|
|
|
ty_i32. { ret "i32"; }
|
|
|
|
ty_i64. { ret "i64"; }
|
|
|
|
ty_f32. { ret "f32"; }
|
|
|
|
ty_f64. { ret "f64"; }
|
2011-08-21 23:44:41 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fn is_exported(i: ident, m: _mod) -> bool {
|
|
|
|
let nonlocal = true;
|
2011-08-31 11:45:37 -05:00
|
|
|
for it: @item in m.items {
|
2011-08-21 23:44:41 -05:00
|
|
|
if it.ident == i { nonlocal = false; }
|
|
|
|
alt it.node {
|
|
|
|
item_tag(variants, _) {
|
|
|
|
for v: variant in variants {
|
|
|
|
if v.node.name == i { nonlocal = false; }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
_ { }
|
|
|
|
}
|
|
|
|
if !nonlocal { break; }
|
|
|
|
}
|
|
|
|
let count = 0u;
|
2011-08-31 11:45:37 -05:00
|
|
|
for vi: @view_item in m.view_items {
|
2011-08-21 23:44:41 -05:00
|
|
|
alt vi.node {
|
2011-08-31 11:45:37 -05:00
|
|
|
view_item_export(ids, _) {
|
2011-09-01 19:27:58 -05:00
|
|
|
for id in ids { if str::eq(i, id) { ret true; } }
|
2011-08-21 23:44:41 -05:00
|
|
|
count += 1u;
|
|
|
|
}
|
|
|
|
_ {/* fall through */ }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// If there are no declared exports then
|
|
|
|
// everything not imported is exported
|
|
|
|
// even if it's nonlocal (since it's explicit)
|
|
|
|
ret count == 0u && !nonlocal;
|
|
|
|
}
|
|
|
|
|
2011-08-26 12:14:58 -05:00
|
|
|
pure fn is_call_expr(e: @expr) -> bool {
|
|
|
|
alt e.node { expr_call(_, _) { true } _ { false } }
|
2011-08-21 23:44:41 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
fn is_constraint_arg(e: @expr) -> bool {
|
|
|
|
alt e.node {
|
|
|
|
expr_lit(_) { ret true; }
|
|
|
|
expr_path(_) { ret true; }
|
|
|
|
_ { ret false; }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn eq_ty(a: @ty, b: @ty) -> bool { ret std::box::ptr_eq(a, b); }
|
2011-08-21 23:44:41 -05:00
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn hash_ty(t: @ty) -> uint { ret t.span.lo << 16u + t.span.hi; }
|
2011-08-21 23:44:41 -05:00
|
|
|
|
|
|
|
fn block_from_expr(e: @expr) -> blk {
|
2011-08-25 19:42:38 -05:00
|
|
|
let blk_ = checked_blk([], option::some::<@expr>(e), e.id);
|
2011-08-21 23:44:41 -05:00
|
|
|
ret {node: blk_, span: e.span};
|
|
|
|
}
|
|
|
|
|
2011-09-02 17:34:58 -05:00
|
|
|
fn checked_blk(stmts1: [@stmt], expr1: option::t<@expr>, id1: node_id) ->
|
|
|
|
blk_ {
|
2011-08-25 19:42:38 -05:00
|
|
|
ret {stmts: stmts1, expr: expr1, id: id1, rules: checked};
|
|
|
|
}
|
2011-08-21 23:44:41 -05:00
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn obj_field_from_anon_obj_field(f: anon_obj_field) -> obj_field {
|
2011-08-21 23:44:41 -05:00
|
|
|
ret {mut: f.mut, ty: f.ty, ident: f.ident, id: f.id};
|
|
|
|
}
|
|
|
|
|
|
|
|
// This is a convenience function to transfor ternary expressions to if
|
|
|
|
// expressions so that they can be treated the same
|
2011-09-12 04:27:30 -05:00
|
|
|
fn ternary_to_if(e: @expr) -> @expr {
|
2011-08-21 23:44:41 -05:00
|
|
|
alt e.node {
|
|
|
|
expr_ternary(cond, then, els) {
|
|
|
|
let then_blk = block_from_expr(then);
|
|
|
|
let els_blk = block_from_expr(els);
|
|
|
|
let els_expr =
|
|
|
|
@{id: els.id, node: expr_block(els_blk), span: els.span};
|
|
|
|
ret @{id: e.id,
|
|
|
|
node: expr_if(cond, then_blk, option::some(els_expr)),
|
|
|
|
span: e.span};
|
|
|
|
}
|
|
|
|
_ { fail; }
|
|
|
|
}
|
|
|
|
}
|
2011-09-01 07:35:00 -05:00
|
|
|
|
2011-09-14 10:18:48 -05:00
|
|
|
fn ret_by_ref(style: ret_style) -> bool {
|
|
|
|
alt style {
|
2011-09-15 09:15:17 -05:00
|
|
|
return_ref(_, _) { true }
|
2011-09-14 10:18:48 -05:00
|
|
|
_ { false }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-01 07:35:00 -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:
|