mirror of
https://github.com/rust-lang/rust.git
synced 2024-11-27 17:24:06 +00:00
Unified algebraic datatype representation implementation, initial version.
Later changes on this branch adapt the rest of rustc::middle::trans to use this module instead of scattered hard-coded knowledge of representations; a few of them also have improvements or cleanup for adt.rs (and many added comments) that weren't drastic enough to justify changing history to move them into this commit.
This commit is contained in:
Jed Davis
parent
b269ce2782
commit
626ad484fe
326
src/librustc/middle/trans/adt.rs
Normal file
326
src/librustc/middle/trans/adt.rs
Normal file
@ -0,0 +1,326 @@
|
||||
// Copyright 2013 The Rust Project Developers. See the COPYRIGHT
|
||||
// file at the top-level directory of this distribution and at
|
||||
// http://rust-lang.org/COPYRIGHT.
|
||||
//
|
||||
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
||||
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
||||
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
||||
// option. This file may not be copied, modified, or distributed
|
||||
// except according to those terms.
|
||||
|
||||
use core::option::{Option, Some, None};
|
||||
use core::vec;
|
||||
use lib::llvm::{ValueRef, TypeRef};
|
||||
use middle::trans::_match;
|
||||
use middle::trans::build::*;
|
||||
use middle::trans::common::*;
|
||||
use middle::trans::machine;
|
||||
use middle::trans::type_of;
|
||||
use middle::ty;
|
||||
use syntax::ast;
|
||||
use util::ppaux::ty_to_str;
|
||||
|
||||
|
||||
// XXX: should this be done with boxed traits instead of ML-style?
|
||||
pub enum Repr {
|
||||
CEnum,
|
||||
Univariant(Struct, Destructor),
|
||||
General(~[Struct])
|
||||
}
|
||||
|
||||
enum Destructor {
|
||||
DtorPresent,
|
||||
DtorAbsent,
|
||||
NoDtor
|
||||
}
|
||||
|
||||
struct Struct {
|
||||
size: u64,
|
||||
align: u64,
|
||||
fields: ~[ty::t]
|
||||
}
|
||||
|
||||
|
||||
pub fn represent_node(bcx: block, node: ast::node_id)
|
||||
-> Repr {
|
||||
represent_type(bcx.ccx(), node_id_type(bcx, node))
|
||||
}
|
||||
|
||||
pub fn represent_type(cx: @CrateContext, t: ty::t) -> Repr {
|
||||
debug!("Representing: %s", ty_to_str(cx.tcx, t));
|
||||
// XXX: cache this
|
||||
match ty::get(t).sty {
|
||||
ty::ty_tup(ref elems) => {
|
||||
Univariant(mk_struct(cx, *elems), NoDtor)
|
||||
}
|
||||
ty::ty_rec(ref fields) => {
|
||||
// XXX: Are these in the right order?
|
||||
Univariant(mk_struct(cx, fields.map(|f| f.mt.ty)), DtorAbsent)
|
||||
}
|
||||
ty::ty_struct(def_id, ref substs) => {
|
||||
let fields = ty::lookup_struct_fields(cx.tcx, def_id);
|
||||
let dt = ty::ty_dtor(cx.tcx, def_id).is_present();
|
||||
Univariant(mk_struct(cx, fields.map(|field| {
|
||||
ty::lookup_field_type(cx.tcx, def_id, field.id, substs)
|
||||
})), if dt { DtorPresent } else { DtorAbsent })
|
||||
}
|
||||
ty::ty_enum(def_id, ref substs) => {
|
||||
struct Case { discr: i64, tys: ~[ty::t] };
|
||||
|
||||
let cases = do ty::enum_variants(cx.tcx, def_id).map |vi| {
|
||||
let arg_tys = do vi.args.map |&raw_ty| {
|
||||
ty::subst(cx.tcx, substs, raw_ty)
|
||||
};
|
||||
Case { discr: vi.disr_val /*bad*/as i64, tys: arg_tys }
|
||||
};
|
||||
if cases.len() == 0 {
|
||||
// Uninhabitable; represent as unit
|
||||
Univariant(mk_struct(cx, ~[]), NoDtor)
|
||||
} else if cases.len() == 1 && cases[0].discr == 0 {
|
||||
// struct, tuple, newtype, etc.
|
||||
Univariant(mk_struct(cx, cases[0].tys), NoDtor)
|
||||
} else if cases.all(|c| c.tys.len() == 0) {
|
||||
CEnum
|
||||
} else {
|
||||
if !cases.alli(|i,c| c.discr == (i as i64)) {
|
||||
cx.sess.bug(fmt!("non-C-like enum %s with specified \
|
||||
discriminants",
|
||||
ty::item_path_str(cx.tcx, def_id)))
|
||||
}
|
||||
General(cases.map(|c| mk_struct(cx, c.tys)))
|
||||
}
|
||||
}
|
||||
_ => cx.sess.bug(~"adt::represent_type called on non-ADT type")
|
||||
}
|
||||
}
|
||||
|
||||
fn mk_struct(cx: @CrateContext, tys: &[ty::t]) -> Struct {
|
||||
let lltys = tys.map(|&ty| type_of::sizing_type_of(cx, ty));
|
||||
let llty_rec = T_struct(lltys);
|
||||
Struct {
|
||||
size: machine::llsize_of_alloc(cx, llty_rec) /*bad*/as u64,
|
||||
align: machine::llalign_of_min(cx, llty_rec) /*bad*/as u64,
|
||||
fields: vec::from_slice(tys)
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
pub fn sizing_fields_of(cx: @CrateContext, r: &Repr) -> ~[TypeRef] {
|
||||
generic_fields_of(cx, r, true)
|
||||
}
|
||||
pub fn fields_of(cx: @CrateContext, r: &Repr) -> ~[TypeRef] {
|
||||
generic_fields_of(cx, r, false)
|
||||
}
|
||||
fn generic_fields_of(cx: @CrateContext, r: &Repr, sizing: bool)
|
||||
-> ~[TypeRef] {
|
||||
match *r {
|
||||
CEnum => ~[T_enum_discrim(cx)],
|
||||
Univariant(ref st, dt) => {
|
||||
let f = if sizing {
|
||||
st.fields.map(|&ty| type_of::sizing_type_of(cx, ty))
|
||||
} else {
|
||||
st.fields.map(|&ty| type_of::type_of(cx, ty))
|
||||
};
|
||||
match dt {
|
||||
NoDtor => f,
|
||||
DtorAbsent => ~[T_struct(f)],
|
||||
DtorPresent => ~[T_struct(f), T_i8()]
|
||||
}
|
||||
}
|
||||
General(ref sts) => {
|
||||
~[T_enum_discrim(cx),
|
||||
T_array(T_i8(), sts.map(|st| st.size).max() /*bad*/as uint)]
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
pub fn trans_switch(bcx: block, r: &Repr, scrutinee: ValueRef) ->
|
||||
(_match::branch_kind, Option<ValueRef>) {
|
||||
// XXX: LoadRangeAssert
|
||||
match *r {
|
||||
CEnum => {
|
||||
(_match::switch, Some(Load(bcx, GEPi(bcx, scrutinee, [0, 0]))))
|
||||
}
|
||||
Univariant(*) => {
|
||||
(_match::single, None)
|
||||
}
|
||||
General(*) => {
|
||||
(_match::switch, Some(Load(bcx, GEPi(bcx, scrutinee, [0, 0]))))
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
pub fn trans_case(bcx: block, r: &Repr, discr: int) -> _match::opt_result {
|
||||
match *r {
|
||||
CEnum => {
|
||||
_match::single_result(rslt(bcx, C_int(bcx.ccx(), discr)))
|
||||
}
|
||||
Univariant(*) => {
|
||||
bcx.ccx().sess.bug(~"no cases for univariants or structs")
|
||||
}
|
||||
General(*) => {
|
||||
_match::single_result(rslt(bcx, C_int(bcx.ccx(), discr)))
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
pub fn trans_set_discr(bcx: block, r: &Repr, val: ValueRef, discr: int) {
|
||||
match *r {
|
||||
CEnum => {
|
||||
Store(bcx, C_int(bcx.ccx(), discr), GEPi(bcx, val, [0, 0]))
|
||||
}
|
||||
Univariant(_, DtorPresent) => {
|
||||
assert discr == 0;
|
||||
Store(bcx, C_u8(1), GEPi(bcx, val, [0, 1]))
|
||||
}
|
||||
Univariant(*) => {
|
||||
assert discr == 0;
|
||||
}
|
||||
General(*) => {
|
||||
Store(bcx, C_int(bcx.ccx(), discr), GEPi(bcx, val, [0, 0]))
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
pub fn num_args(r: &Repr, discr: int) -> uint {
|
||||
match *r {
|
||||
CEnum => 0,
|
||||
Univariant(ref st, _dt) => { assert discr == 0; st.fields.len() }
|
||||
General(ref cases) => cases[discr as uint].fields.len()
|
||||
}
|
||||
}
|
||||
|
||||
pub fn trans_GEP(bcx: block, r: &Repr, val: ValueRef, discr: int, ix: uint)
|
||||
-> ValueRef {
|
||||
// Note: if this ever needs to generate conditionals (e.g., if we
|
||||
// decide to do some kind of cdr-coding-like non-unique repr
|
||||
// someday), it'll need to return a possibly-new bcx as well.
|
||||
match *r {
|
||||
CEnum => {
|
||||
bcx.ccx().sess.bug(~"element access in C-like enum")
|
||||
}
|
||||
Univariant(ref st, dt) => {
|
||||
assert discr == 0;
|
||||
let val = match dt {
|
||||
NoDtor => val,
|
||||
DtorPresent | DtorAbsent => GEPi(bcx, val, [0, 0])
|
||||
};
|
||||
struct_GEP(bcx, st, val, ix)
|
||||
}
|
||||
General(ref cases) => {
|
||||
struct_GEP(bcx, &cases[discr as uint],
|
||||
GEPi(bcx, val, [0, 1]), ix)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fn struct_GEP(bcx: block, st: &Struct, val: ValueRef, ix: uint)
|
||||
-> ValueRef {
|
||||
let ccx = bcx.ccx();
|
||||
|
||||
let real_llty = T_struct(st.fields.map(
|
||||
|&ty| type_of::type_of(ccx, ty)));
|
||||
let cast_val = PointerCast(bcx, val, T_ptr(real_llty));
|
||||
|
||||
GEPi(bcx, cast_val, [0, ix])
|
||||
}
|
||||
|
||||
pub fn trans_const(ccx: @CrateContext, r: &Repr, discr: int,
|
||||
vals: &[ValueRef]) -> ValueRef {
|
||||
match *r {
|
||||
CEnum => {
|
||||
assert vals.len() == 0;
|
||||
C_int(ccx, discr)
|
||||
}
|
||||
Univariant(ref st, _dt) => {
|
||||
assert discr == 0;
|
||||
// consts are never destroyed, so the dtor flag is not needed
|
||||
C_struct(build_const_struct(ccx, st, vals))
|
||||
}
|
||||
General(ref cases) => {
|
||||
let case = &cases[discr as uint];
|
||||
let max_sz = cases.map(|s| s.size).max();
|
||||
let body = build_const_struct(ccx, case, vals);
|
||||
|
||||
C_struct([C_int(ccx, discr),
|
||||
C_packed_struct([C_struct(body)]),
|
||||
padding(max_sz - case.size)])
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fn padding(size: u64) -> ValueRef {
|
||||
C_undef(T_array(T_i8(), size /*bad*/as uint))
|
||||
}
|
||||
|
||||
fn build_const_struct(ccx: @CrateContext, st: &Struct, vals: &[ValueRef])
|
||||
-> ~[ValueRef] {
|
||||
assert vals.len() == st.fields.len();
|
||||
|
||||
let mut offset = 0;
|
||||
let mut cfields = ~[];
|
||||
for st.fields.eachi |i, &ty| {
|
||||
let llty = type_of::sizing_type_of(ccx, ty);
|
||||
let type_align = machine::llalign_of_min(ccx, llty)
|
||||
/*bad*/as u64;
|
||||
let val_align = machine::llalign_of_min(ccx, val_ty(vals[i]))
|
||||
/*bad*/as u64;
|
||||
let target_offset = roundup(offset, type_align);
|
||||
offset = roundup(offset, val_align);
|
||||
if (offset != target_offset) {
|
||||
cfields.push(padding(target_offset - offset));
|
||||
offset = target_offset;
|
||||
}
|
||||
assert !is_undef(vals[i]);
|
||||
// If that assert fails, could change it to wrap in a struct?
|
||||
cfields.push(vals[i]);
|
||||
}
|
||||
|
||||
return cfields;
|
||||
}
|
||||
|
||||
#[always_inline]
|
||||
fn roundup(x: u64, a: u64) -> u64 { ((x + (a - 1)) / a) * a }
|
||||
|
||||
|
||||
pub fn const_get_discrim(ccx: @CrateContext, r: &Repr, val: ValueRef)
|
||||
-> int {
|
||||
match *r {
|
||||
CEnum(*) => const_to_int(val) as int,
|
||||
Univariant(*) => 0,
|
||||
General(*) => const_to_int(const_get_elt(ccx, val, [0])) as int,
|
||||
}
|
||||
}
|
||||
|
||||
pub fn const_get_element(ccx: @CrateContext, r: &Repr, val: ValueRef,
|
||||
_discr: int, ix: uint) -> ValueRef {
|
||||
// Not to be confused with common::const_get_elt.
|
||||
match *r {
|
||||
CEnum(*) => ccx.sess.bug(~"element access in C-like enum const"),
|
||||
Univariant(*) => const_struct_field(ccx, val, ix),
|
||||
General(*) => const_struct_field(ccx, const_get_elt(ccx, val,
|
||||
[1, 0]), ix)
|
||||
}
|
||||
}
|
||||
|
||||
fn const_struct_field(ccx: @CrateContext, val: ValueRef, ix: uint)
|
||||
-> ValueRef {
|
||||
// Get the ix-th non-undef element of the struct.
|
||||
let mut real_ix = 0; // actual position in the struct
|
||||
let mut ix = ix; // logical index relative to real_ix
|
||||
let mut field;
|
||||
loop {
|
||||
loop {
|
||||
field = const_get_elt(ccx, val, [real_ix]);
|
||||
if !is_undef(field) {
|
||||
break;
|
||||
}
|
||||
real_ix = real_ix + 1;
|
||||
}
|
||||
if ix == 0 {
|
||||
return field;
|
||||
}
|
||||
ix = ix - 1;
|
||||
real_ix = real_ix + 1;
|
||||
}
|
||||
}
|
||||
@ -44,7 +44,7 @@ use util::ppaux::{expr_repr, ty_to_str};
|
||||
|
||||
use core::cast;
|
||||
use core::hash;
|
||||
use core::libc::c_uint;
|
||||
use core::libc::{c_uint, c_longlong, c_ulonglong};
|
||||
use core::ptr;
|
||||
use core::str;
|
||||
use core::to_bytes;
|
||||
@ -1087,6 +1087,12 @@ pub fn C_null(t: TypeRef) -> ValueRef {
|
||||
}
|
||||
}
|
||||
|
||||
pub fn C_undef(t: TypeRef) -> ValueRef {
|
||||
unsafe {
|
||||
return llvm::LLVMGetUndef(t);
|
||||
}
|
||||
}
|
||||
|
||||
pub fn C_integral(t: TypeRef, u: u64, sign_extend: Bool) -> ValueRef {
|
||||
unsafe {
|
||||
return llvm::LLVMConstInt(t, u, sign_extend);
|
||||
@ -1254,6 +1260,38 @@ pub fn get_param(fndecl: ValueRef, param: uint) -> ValueRef {
|
||||
}
|
||||
}
|
||||
|
||||
pub fn const_get_elt(cx: @CrateContext, v: ValueRef, us: &[c_uint])
|
||||
-> ValueRef {
|
||||
unsafe {
|
||||
let r = do vec::as_imm_buf(us) |p, len| {
|
||||
llvm::LLVMConstExtractValue(v, p, len as c_uint)
|
||||
};
|
||||
|
||||
debug!("const_get_elt(v=%s, us=%?, r=%s)",
|
||||
val_str(cx.tn, v), us, val_str(cx.tn, r));
|
||||
|
||||
return r;
|
||||
}
|
||||
}
|
||||
|
||||
pub fn const_to_int(v: ValueRef) -> c_longlong {
|
||||
unsafe {
|
||||
llvm::LLVMConstIntGetSExtValue(v)
|
||||
}
|
||||
}
|
||||
|
||||
pub fn const_to_uint(v: ValueRef) -> c_ulonglong {
|
||||
unsafe {
|
||||
llvm::LLVMConstIntGetZExtValue(v)
|
||||
}
|
||||
}
|
||||
|
||||
pub fn is_undef(val: ValueRef) -> bool {
|
||||
unsafe {
|
||||
llvm::LLVMIsUndef(val) != False
|
||||
}
|
||||
}
|
||||
|
||||
// Used to identify cached monomorphized functions and vtables
|
||||
#[deriving_eq]
|
||||
pub enum mono_param_id {
|
||||
|
||||
@ -103,20 +103,6 @@ pub fn const_deref(cx: @CrateContext, v: ValueRef) -> ValueRef {
|
||||
}
|
||||
}
|
||||
|
||||
pub fn const_get_elt(cx: @CrateContext, v: ValueRef, us: &[c_uint])
|
||||
-> ValueRef {
|
||||
unsafe {
|
||||
let r = do vec::as_imm_buf(us) |p, len| {
|
||||
llvm::LLVMConstExtractValue(v, p, len as c_uint)
|
||||
};
|
||||
|
||||
debug!("const_get_elt(v=%s, us=%?, r=%s)",
|
||||
val_str(cx.tn, v), us, val_str(cx.tn, r));
|
||||
|
||||
return r;
|
||||
}
|
||||
}
|
||||
|
||||
pub fn const_autoderef(cx: @CrateContext, ty: ty::t, v: ValueRef)
|
||||
-> (ty::t, ValueRef) {
|
||||
let mut t1 = ty;
|
||||
|
||||
@ -65,6 +65,7 @@ pub mod middle {
|
||||
pub mod type_use;
|
||||
pub mod reachable;
|
||||
pub mod machine;
|
||||
pub mod adt;
|
||||
}
|
||||
pub mod ty;
|
||||
pub mod resolve;
|
||||
|
||||
Loading…
Reference in New Issue
Block a user