1 // Copyright 2012-2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 #![allow(non_camel_case_types)]
14 use driver::session::Session;
15 use metadata::csearch;
16 use mc = middle::mem_categorization;
18 use middle::const_eval;
20 use middle::dependency_format;
21 use middle::lang_items::OpaqueStructLangItem;
22 use middle::lang_items::{TyDescStructLangItem, TyVisitorTraitLangItem};
25 use middle::resolve_lifetime;
27 use middle::subst::{Subst, Substs, VecPerParamSpace};
28 use middle::stability;
31 use middle::typeck::MethodCall;
33 use middle::ty_fold::{TypeFoldable,TypeFolder};
35 use util::ppaux::{note_and_explain_region, bound_region_ptr_to_str};
36 use util::ppaux::{trait_store_to_str, ty_to_str};
37 use util::ppaux::{Repr, UserString};
38 use util::common::{indenter};
39 use util::nodemap::{NodeMap, NodeSet, DefIdMap, DefIdSet, FnvHashMap};
41 use std::cell::{Cell, RefCell};
45 use std::hash::{Hash, sip, Writer};
47 use std::iter::AdditiveIterator;
51 use std::collections::{HashMap, HashSet};
54 use syntax::ast_util::{is_local, lit_is_str};
57 use syntax::attr::AttrMetaMethods;
58 use syntax::codemap::Span;
59 use syntax::parse::token;
60 use syntax::parse::token::InternedString;
61 use syntax::{ast, ast_map};
62 use syntax::util::small_vector::SmallVector;
63 use std::collections::enum_set::{EnumSet, CLike};
67 pub static INITIAL_DISCRIMINANT_VALUE: Disr = 0;
71 #[deriving(PartialEq, Eq, Hash)]
73 pub ident: ast::Ident,
78 pub enum MethodContainer {
79 TraitContainer(ast::DefId),
80 ImplContainer(ast::DefId),
85 pub ident: ast::Ident,
86 pub generics: ty::Generics,
88 pub explicit_self: ast::ExplicitSelf_,
89 pub vis: ast::Visibility,
90 pub def_id: ast::DefId,
91 pub container: MethodContainer,
93 // If this method is provided, we need to know where it came from
94 pub provided_source: Option<ast::DefId>
98 pub fn new(ident: ast::Ident,
99 generics: ty::Generics,
101 explicit_self: ast::ExplicitSelf_,
102 vis: ast::Visibility,
104 container: MethodContainer,
105 provided_source: Option<ast::DefId>)
111 explicit_self: explicit_self,
114 container: container,
115 provided_source: provided_source
119 pub fn container_id(&self) -> ast::DefId {
120 match self.container {
121 TraitContainer(id) => id,
122 ImplContainer(id) => id,
127 #[deriving(Clone, PartialEq, Eq, Hash)]
130 pub mutbl: ast::Mutability,
133 #[deriving(Clone, PartialEq, Eq, Hash, Encodable, Decodable, Show)]
134 pub enum TraitStore {
137 /// &Trait and &mut Trait
138 RegionTraitStore(Region, ast::Mutability),
142 pub struct field_ty {
145 pub vis: ast::Visibility,
146 pub origin: ast::DefId, // The DefId of the struct in which the field is declared.
149 // Contains information needed to resolve types and (in the future) look up
150 // the types of AST nodes.
151 #[deriving(PartialEq, Eq, Hash)]
152 pub struct creader_cache_key {
158 pub type creader_cache = RefCell<HashMap<creader_cache_key, t>>;
160 pub struct intern_key {
164 // NB: Do not replace this with #[deriving(PartialEq)]. The automatically-derived
165 // implementation will not recurse through sty and you will get stack
167 impl cmp::PartialEq for intern_key {
168 fn eq(&self, other: &intern_key) -> bool {
170 *self.sty == *other.sty
173 fn ne(&self, other: &intern_key) -> bool {
178 impl Eq for intern_key {}
180 impl<W:Writer> Hash<W> for intern_key {
181 fn hash(&self, s: &mut W) {
182 unsafe { (*self.sty).hash(s) }
186 pub enum ast_ty_to_ty_cache_entry {
187 atttce_unresolved, /* not resolved yet */
188 atttce_resolved(t) /* resolved to a type, irrespective of region */
191 #[deriving(Clone, PartialEq, Decodable, Encodable)]
192 pub struct ItemVariances {
193 pub types: VecPerParamSpace<Variance>,
194 pub regions: VecPerParamSpace<Variance>,
197 #[deriving(Clone, PartialEq, Decodable, Encodable, Show)]
199 Covariant, // T<A> <: T<B> iff A <: B -- e.g., function return type
200 Invariant, // T<A> <: T<B> iff B == A -- e.g., type of mutable cell
201 Contravariant, // T<A> <: T<B> iff B <: A -- e.g., function param type
202 Bivariant, // T<A> <: T<B> -- e.g., unused type parameter
206 pub enum AutoAdjustment {
207 AutoAddEnv(ty::TraitStore),
208 AutoDerefRef(AutoDerefRef),
209 AutoObject(ty::TraitStore,
211 ast::DefId, /* Trait ID */
212 subst::Substs /* Trait substitutions */)
215 #[deriving(Clone, Decodable, Encodable)]
216 pub struct AutoDerefRef {
217 pub autoderefs: uint,
218 pub autoref: Option<AutoRef>
221 #[deriving(Clone, Decodable, Encodable, PartialEq, Show)]
223 /// Convert from T to &T
224 AutoPtr(Region, ast::Mutability),
226 /// Convert from ~[]/&[] to &[] or str
227 AutoBorrowVec(Region, ast::Mutability),
229 /// Convert from ~[]/&[] to &&[] or str
230 AutoBorrowVecRef(Region, ast::Mutability),
232 /// Convert from T to *T
233 AutoUnsafe(ast::Mutability),
235 /// Convert from Box<Trait>/&Trait to &Trait
236 AutoBorrowObj(Region, ast::Mutability),
239 /// A restriction that certain types must be the same size. The use of
240 /// `transmute` gives rise to these restrictions.
241 pub struct TransmuteRestriction {
242 /// The span from whence the restriction comes.
244 /// The type being transmuted from.
246 /// The type being transmuted to.
250 /// The data structure to keep track of all the information that typechecker
251 /// generates so that so that it can be reused and doesn't have to be redone
254 /// Specifically use a speedy hash algorithm for this hash map, it's used
256 pub interner: RefCell<FnvHashMap<intern_key, Box<t_box_>>>,
257 pub next_id: Cell<uint>,
259 pub def_map: resolve::DefMap,
261 pub named_region_map: resolve_lifetime::NamedRegionMap,
263 pub region_maps: middle::region::RegionMaps,
265 /// Stores the types for various nodes in the AST. Note that this table
266 /// is not guaranteed to be populated until after typeck. See
267 /// typeck::check::fn_ctxt for details.
268 pub node_types: node_type_table,
270 /// Stores the type parameters which were substituted to obtain the type
271 /// of this node. This only applies to nodes that refer to entities
272 /// param<eterized by type parameters, such as generic fns, types, or
274 pub item_substs: RefCell<NodeMap<ItemSubsts>>,
276 /// Maps from a method to the method "descriptor"
277 pub methods: RefCell<DefIdMap<Rc<Method>>>,
279 /// Maps from a trait def-id to a list of the def-ids of its methods
280 pub trait_method_def_ids: RefCell<DefIdMap<Rc<Vec<DefId>>>>,
282 /// A cache for the trait_methods() routine
283 pub trait_methods_cache: RefCell<DefIdMap<Rc<Vec<Rc<Method>>>>>,
285 pub impl_trait_cache: RefCell<DefIdMap<Option<Rc<ty::TraitRef>>>>,
287 pub trait_refs: RefCell<NodeMap<Rc<TraitRef>>>,
288 pub trait_defs: RefCell<DefIdMap<Rc<TraitDef>>>,
290 pub map: ast_map::Map,
291 pub intrinsic_defs: RefCell<DefIdMap<t>>,
292 pub freevars: RefCell<freevars::freevar_map>,
293 pub tcache: type_cache,
294 pub rcache: creader_cache,
295 pub short_names_cache: RefCell<HashMap<t, String>>,
296 pub needs_unwind_cleanup_cache: RefCell<HashMap<t, bool>>,
297 pub tc_cache: RefCell<HashMap<uint, TypeContents>>,
298 pub ast_ty_to_ty_cache: RefCell<NodeMap<ast_ty_to_ty_cache_entry>>,
299 pub enum_var_cache: RefCell<DefIdMap<Rc<Vec<Rc<VariantInfo>>>>>,
300 pub ty_param_defs: RefCell<NodeMap<TypeParameterDef>>,
301 pub adjustments: RefCell<NodeMap<AutoAdjustment>>,
302 pub normalized_cache: RefCell<HashMap<t, t>>,
303 pub lang_items: middle::lang_items::LanguageItems,
304 /// A mapping of fake provided method def_ids to the default implementation
305 pub provided_method_sources: RefCell<DefIdMap<ast::DefId>>,
306 pub supertraits: RefCell<DefIdMap<Rc<Vec<Rc<TraitRef>>>>>,
307 pub superstructs: RefCell<DefIdMap<Option<ast::DefId>>>,
308 pub struct_fields: RefCell<DefIdMap<Rc<Vec<field_ty>>>>,
310 /// Maps from def-id of a type or region parameter to its
311 /// (inferred) variance.
312 pub item_variance_map: RefCell<DefIdMap<Rc<ItemVariances>>>,
314 /// A mapping from the def ID of an enum or struct type to the def ID
315 /// of the method that implements its destructor. If the type is not
316 /// present in this map, it does not have a destructor. This map is
317 /// populated during the coherence phase of typechecking.
318 pub destructor_for_type: RefCell<DefIdMap<ast::DefId>>,
320 /// A method will be in this list if and only if it is a destructor.
321 pub destructors: RefCell<DefIdSet>,
323 /// Maps a trait onto a list of impls of that trait.
324 pub trait_impls: RefCell<DefIdMap<Rc<RefCell<Vec<ast::DefId>>>>>,
326 /// Maps a DefId of a type to a list of its inherent impls.
327 /// Contains implementations of methods that are inherent to a type.
328 /// Methods in these implementations don't need to be exported.
329 pub inherent_impls: RefCell<DefIdMap<Rc<RefCell<Vec<ast::DefId>>>>>,
331 /// Maps a DefId of an impl to a list of its methods.
332 /// Note that this contains all of the impls that we know about,
333 /// including ones in other crates. It's not clear that this is the best
335 pub impl_methods: RefCell<DefIdMap<Vec<ast::DefId>>>,
337 /// Set of used unsafe nodes (functions or blocks). Unsafe nodes not
338 /// present in this set can be warned about.
339 pub used_unsafe: RefCell<NodeSet>,
341 /// Set of nodes which mark locals as mutable which end up getting used at
342 /// some point. Local variable definitions not in this set can be warned
344 pub used_mut_nodes: RefCell<NodeSet>,
346 /// vtable resolution information for impl declarations
347 pub impl_vtables: typeck::impl_vtable_map,
349 /// The set of external nominal types whose implementations have been read.
350 /// This is used for lazy resolution of methods.
351 pub populated_external_types: RefCell<DefIdSet>,
353 /// The set of external traits whose implementations have been read. This
354 /// is used for lazy resolution of traits.
355 pub populated_external_traits: RefCell<DefIdSet>,
358 pub upvar_borrow_map: RefCell<UpvarBorrowMap>,
360 /// These two caches are used by const_eval when decoding external statics
361 /// and variants that are found.
362 pub extern_const_statics: RefCell<DefIdMap<Option<Gc<ast::Expr>>>>,
363 pub extern_const_variants: RefCell<DefIdMap<Option<Gc<ast::Expr>>>>,
365 pub method_map: typeck::MethodMap,
366 pub vtable_map: typeck::vtable_map,
368 pub dependency_formats: RefCell<dependency_format::Dependencies>,
370 pub node_lint_levels: RefCell<HashMap<(ast::NodeId, lint::Lint),
371 (lint::Level, lint::LintSource)>>,
373 /// The types that must be asserted to be the same size for `transmute`
374 /// to be valid. We gather up these restrictions in the intrinsicck pass
375 /// and check them in trans.
376 pub transmute_restrictions: RefCell<Vec<TransmuteRestriction>>,
378 /// Maps any item's def-id to its stability index.
379 pub stability: RefCell<stability::Index>,
390 // a meta-pub flag: subst may be required if the type has parameters, a self
391 // type, or references bound regions
392 needs_subst = 1 | 2 | 8
395 pub type t_box = &'static t_box_;
403 // To reduce refcounting cost, we're representing types as unsafe pointers
404 // throughout the compiler. These are simply casted t_box values. Use ty::get
405 // to cast them back to a box. (Without the cast, compiler performance suffers
406 // ~15%.) This does mean that a t value relies on the ctxt to keep its box
407 // alive, and using ty::get is unsafe when the ctxt is no longer alive.
410 #[allow(raw_pointer_deriving)]
411 #[deriving(Clone, PartialEq, Eq, Hash)]
412 pub struct t { inner: *t_opaque }
414 impl fmt::Show for t {
415 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
420 pub fn get(t: t) -> t_box {
422 let t2: t_box = mem::transmute(t);
427 pub fn tbox_has_flag(tb: t_box, flag: tbox_flag) -> bool {
428 (tb.flags & (flag as uint)) != 0u
430 pub fn type_has_params(t: t) -> bool {
431 tbox_has_flag(get(t), has_params)
433 pub fn type_has_self(t: t) -> bool { tbox_has_flag(get(t), has_self) }
434 pub fn type_needs_infer(t: t) -> bool {
435 tbox_has_flag(get(t), needs_infer)
437 pub fn type_id(t: t) -> uint { get(t).id }
439 #[deriving(Clone, PartialEq, Eq, Hash)]
440 pub struct BareFnTy {
441 pub fn_style: ast::FnStyle,
446 #[deriving(Clone, PartialEq, Eq, Hash)]
447 pub struct ClosureTy {
448 pub fn_style: ast::FnStyle,
449 pub onceness: ast::Onceness,
450 pub store: TraitStore,
451 pub bounds: BuiltinBounds,
456 * Signature of a function type, which I have arbitrarily
457 * decided to use to refer to the input/output types.
459 * - `binder_id` is the node id where this fn type appeared;
460 * it is used to identify all the bound regions appearing
461 * in the input/output types that are bound by this fn type
462 * (vs some enclosing or enclosed fn type)
463 * - `inputs` is the list of arguments and their modes.
464 * - `output` is the return type.
465 * - `variadic` indicates whether this is a varidic function. (only true for foreign fns)
467 #[deriving(Clone, PartialEq, Eq, Hash)]
469 pub binder_id: ast::NodeId,
475 #[deriving(Clone, PartialEq, Eq, Hash)]
477 pub space: subst::ParamSpace,
482 /// Representation of regions:
483 #[deriving(Clone, PartialEq, Eq, Hash, Encodable, Decodable, Show)]
485 // Region bound in a type or fn declaration which will be
486 // substituted 'early' -- that is, at the same time when type
487 // parameters are substituted.
488 ReEarlyBound(/* param id */ ast::NodeId,
493 // Region bound in a function scope, which will be substituted when the
494 // function is called. The first argument must be the `binder_id` of
495 // some enclosing function signature.
496 ReLateBound(/* binder_id */ ast::NodeId, BoundRegion),
498 /// When checking a function body, the types of all arguments and so forth
499 /// that refer to bound region parameters are modified to refer to free
500 /// region parameters.
503 /// A concrete region naming some expression within the current function.
506 /// Static data that has an "infinite" lifetime. Top in the region lattice.
509 /// A region variable. Should not exist after typeck.
510 ReInfer(InferRegion),
512 /// Empty lifetime is for data that is never accessed.
513 /// Bottom in the region lattice. We treat ReEmpty somewhat
514 /// specially; at least right now, we do not generate instances of
515 /// it during the GLB computations, but rather
516 /// generate an error instead. This is to improve error messages.
517 /// The only way to get an instance of ReEmpty is to have a region
518 /// variable with no constraints.
523 * Upvars do not get their own node-id. Instead, we use the pair of
524 * the original var id (that is, the root variable that is referenced
525 * by the upvar) and the id of the closure expression.
527 #[deriving(Clone, PartialEq, Eq, Hash)]
529 pub var_id: ast::NodeId,
530 pub closure_expr_id: ast::NodeId,
533 #[deriving(Clone, PartialEq, Eq, Hash, Show)]
534 pub enum BorrowKind {
535 /// Data must be immutable and is aliasable.
538 /// Data must be immutable but not aliasable. This kind of borrow
539 /// cannot currently be expressed by the user and is used only in
540 /// implicit closure bindings. It is needed when you the closure
541 /// is borrowing or mutating a mutable referent, e.g.:
543 /// let x: &mut int = ...;
544 /// let y = || *x += 5;
546 /// If we were to try to translate this closure into a more explicit
547 /// form, we'd encounter an error with the code as written:
549 /// struct Env { x: & &mut int }
550 /// let x: &mut int = ...;
551 /// let y = (&mut Env { &x }, fn_ptr); // Closure is pair of env and fn
552 /// fn fn_ptr(env: &mut Env) { **env.x += 5; }
554 /// This is then illegal because you cannot mutate a `&mut` found
555 /// in an aliasable location. To solve, you'd have to translate with
556 /// an `&mut` borrow:
558 /// struct Env { x: & &mut int }
559 /// let x: &mut int = ...;
560 /// let y = (&mut Env { &mut x }, fn_ptr); // changed from &x to &mut x
561 /// fn fn_ptr(env: &mut Env) { **env.x += 5; }
563 /// Now the assignment to `**env.x` is legal, but creating a
564 /// mutable pointer to `x` is not because `x` is not mutable. We
565 /// could fix this by declaring `x` as `let mut x`. This is ok in
566 /// user code, if awkward, but extra weird for closures, since the
567 /// borrow is hidden.
569 /// So we introduce a "unique imm" borrow -- the referent is
570 /// immutable, but not aliasable. This solves the problem. For
571 /// simplicity, we don't give users the way to express this
572 /// borrow, it's just used when translating closures.
575 /// Data is mutable and not aliasable.
580 * Information describing the borrowing of an upvar. This is computed
581 * during `typeck`, specifically by `regionck`. The general idea is
582 * that the compiler analyses treat closures like:
584 * let closure: &'e fn() = || {
585 * x = 1; // upvar x is assigned to
586 * use(y); // upvar y is read
587 * foo(&z); // upvar z is borrowed immutably
590 * as if they were "desugared" to something loosely like:
592 * struct Vars<'x,'y,'z> { x: &'x mut int,
595 * let closure: &'e fn() = {
601 * let env: &'e mut Vars<'x,'y,'z> = &mut Vars { x: &'x mut x,
607 * This is basically what happens at runtime. The closure is basically
608 * an existentially quantified version of the `(env, f)` pair.
610 * This data structure indicates the region and mutability of a single
611 * one of the `x...z` borrows.
613 * It may not be obvious why each borrowed variable gets its own
614 * lifetime (in the desugared version of the example, these are indicated
615 * by the lifetime parameters `'x`, `'y`, and `'z` in the `Vars` definition).
616 * Each such lifetime must encompass the lifetime `'e` of the closure itself,
617 * but need not be identical to it. The reason that this makes sense:
619 * - Callers are only permitted to invoke the closure, and hence to
620 * use the pointers, within the lifetime `'e`, so clearly `'e` must
621 * be a sublifetime of `'x...'z`.
622 * - The closure creator knows which upvars were borrowed by the closure
623 * and thus `x...z` will be reserved for `'x...'z` respectively.
624 * - Through mutation, the borrowed upvars can actually escape
625 * the closure, so sometimes it is necessary for them to be larger
626 * than the closure lifetime itself.
628 #[deriving(PartialEq, Clone)]
629 pub struct UpvarBorrow {
630 pub kind: BorrowKind,
631 pub region: ty::Region,
634 pub type UpvarBorrowMap = HashMap<UpvarId, UpvarBorrow>;
637 pub fn is_bound(&self) -> bool {
639 &ty::ReEarlyBound(..) => true,
640 &ty::ReLateBound(..) => true,
646 #[deriving(Clone, PartialEq, PartialOrd, Eq, Ord, Hash, Encodable, Decodable, Show)]
647 pub struct FreeRegion {
648 pub scope_id: NodeId,
649 pub bound_region: BoundRegion
652 #[deriving(Clone, PartialEq, PartialOrd, Eq, Ord, Hash, Encodable, Decodable, Show)]
653 pub enum BoundRegion {
654 /// An anonymous region parameter for a given fn (&T)
657 /// Named region parameters for functions (a in &'a T)
659 /// The def-id is needed to distinguish free regions in
660 /// the event of shadowing.
661 BrNamed(ast::DefId, ast::Name),
663 /// Fresh bound identifiers created during GLB computations.
672 macro_rules! def_prim_ty(
673 ($name:ident, $sty:expr, $id:expr) => (
674 pub static $name: t_box_ = t_box_ {
682 def_prim_ty!(TY_NIL, super::ty_nil, 0)
683 def_prim_ty!(TY_BOOL, super::ty_bool, 1)
684 def_prim_ty!(TY_CHAR, super::ty_char, 2)
685 def_prim_ty!(TY_INT, super::ty_int(ast::TyI), 3)
686 def_prim_ty!(TY_I8, super::ty_int(ast::TyI8), 4)
687 def_prim_ty!(TY_I16, super::ty_int(ast::TyI16), 5)
688 def_prim_ty!(TY_I32, super::ty_int(ast::TyI32), 6)
689 def_prim_ty!(TY_I64, super::ty_int(ast::TyI64), 7)
690 def_prim_ty!(TY_UINT, super::ty_uint(ast::TyU), 8)
691 def_prim_ty!(TY_U8, super::ty_uint(ast::TyU8), 9)
692 def_prim_ty!(TY_U16, super::ty_uint(ast::TyU16), 10)
693 def_prim_ty!(TY_U32, super::ty_uint(ast::TyU32), 11)
694 def_prim_ty!(TY_U64, super::ty_uint(ast::TyU64), 12)
695 def_prim_ty!(TY_F32, super::ty_float(ast::TyF32), 14)
696 def_prim_ty!(TY_F64, super::ty_float(ast::TyF64), 15)
697 def_prim_ty!(TY_F128, super::ty_float(ast::TyF128), 16)
699 pub static TY_BOT: t_box_ = t_box_ {
702 flags: super::has_ty_bot as uint,
705 pub static TY_ERR: t_box_ = t_box_ {
708 flags: super::has_ty_err as uint,
711 pub static LAST_PRIMITIVE_ID: uint = 18;
714 // NB: If you change this, you'll probably want to change the corresponding
715 // AST structure in libsyntax/ast.rs as well.
716 #[deriving(Clone, PartialEq, Eq, Hash)]
723 ty_uint(ast::UintTy),
724 ty_float(ast::FloatTy),
725 ty_enum(DefId, Substs),
729 ty_vec(mt, Option<uint>), // Second field is length.
732 ty_bare_fn(BareFnTy),
733 ty_closure(Box<ClosureTy>),
734 ty_trait(Box<TyTrait>),
735 ty_struct(DefId, Substs),
738 ty_param(ParamTy), // type parameter
739 ty_infer(InferTy), // something used only during inference/typeck
740 ty_err, // Also only used during inference/typeck, to represent
741 // the type of an erroneous expression (helps cut down
742 // on non-useful type error messages)
745 #[deriving(Clone, PartialEq, Eq, Hash)]
749 pub bounds: BuiltinBounds
752 #[deriving(PartialEq, Eq, Hash)]
753 pub struct TraitRef {
758 #[deriving(Clone, PartialEq)]
759 pub enum IntVarValue {
761 UintType(ast::UintTy),
764 #[deriving(Clone, Show)]
765 pub enum terr_vstore_kind {
772 #[deriving(Clone, Show)]
773 pub struct expected_found<T> {
778 // Data structures used in type unification
779 #[deriving(Clone, Show)]
782 terr_fn_style_mismatch(expected_found<FnStyle>),
783 terr_onceness_mismatch(expected_found<Onceness>),
784 terr_abi_mismatch(expected_found<abi::Abi>),
786 terr_sigil_mismatch(expected_found<TraitStore>),
791 terr_tuple_size(expected_found<uint>),
792 terr_ty_param_size(expected_found<uint>),
793 terr_record_size(expected_found<uint>),
794 terr_record_mutability,
795 terr_record_fields(expected_found<Ident>),
797 terr_regions_does_not_outlive(Region, Region),
798 terr_regions_not_same(Region, Region),
799 terr_regions_no_overlap(Region, Region),
800 terr_regions_insufficiently_polymorphic(BoundRegion, Region),
801 terr_regions_overly_polymorphic(BoundRegion, Region),
802 terr_trait_stores_differ(terr_vstore_kind, expected_found<TraitStore>),
803 terr_sorts(expected_found<t>),
804 terr_integer_as_char,
805 terr_int_mismatch(expected_found<IntVarValue>),
806 terr_float_mismatch(expected_found<ast::FloatTy>),
807 terr_traits(expected_found<ast::DefId>),
808 terr_builtin_bounds(expected_found<BuiltinBounds>),
809 terr_variadic_mismatch(expected_found<bool>)
812 #[deriving(PartialEq, Eq, Hash)]
813 pub struct ParamBounds {
814 pub builtin_bounds: BuiltinBounds,
815 pub trait_bounds: Vec<Rc<TraitRef>>
818 pub type BuiltinBounds = EnumSet<BuiltinBound>;
820 #[deriving(Clone, Encodable, PartialEq, Eq, Decodable, Hash, Show)]
822 pub enum BuiltinBound {
830 pub fn empty_builtin_bounds() -> BuiltinBounds {
834 pub fn all_builtin_bounds() -> BuiltinBounds {
835 let mut set = EnumSet::empty();
836 set.add(BoundStatic);
843 impl CLike for BuiltinBound {
844 fn to_uint(&self) -> uint {
847 fn from_uint(v: uint) -> BuiltinBound {
848 unsafe { mem::transmute(v) }
852 #[deriving(Clone, PartialEq, Eq, Hash)]
857 #[deriving(Clone, PartialEq, Eq, Hash)]
862 #[deriving(Clone, PartialEq, Eq, Hash)]
863 pub struct FloatVid {
867 #[deriving(Clone, PartialEq, Eq, Encodable, Decodable, Hash)]
868 pub struct RegionVid {
872 #[deriving(Clone, PartialEq, Eq, Hash)]
879 #[deriving(Clone, Encodable, Decodable, Eq, Hash, Show)]
880 pub enum InferRegion {
882 ReSkolemized(uint, BoundRegion)
885 impl cmp::PartialEq for InferRegion {
886 fn eq(&self, other: &InferRegion) -> bool {
887 match ((*self), *other) {
888 (ReVar(rva), ReVar(rvb)) => {
891 (ReSkolemized(rva, _), ReSkolemized(rvb, _)) => {
897 fn ne(&self, other: &InferRegion) -> bool {
898 !((*self) == (*other))
902 impl fmt::Show for TyVid {
903 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result{
904 write!(f, "<generic #{}>", self.index)
908 impl fmt::Show for IntVid {
909 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
910 write!(f, "<generic integer #{}>", self.index)
914 impl fmt::Show for FloatVid {
915 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
916 write!(f, "<generic float #{}>", self.index)
920 impl fmt::Show for RegionVid {
921 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
922 write!(f, "'<generic lifetime #{}>", self.index)
926 impl fmt::Show for FnSig {
927 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
928 // grr, without tcx not much we can do.
933 impl fmt::Show for InferTy {
934 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
936 TyVar(ref v) => v.fmt(f),
937 IntVar(ref v) => v.fmt(f),
938 FloatVar(ref v) => v.fmt(f),
943 impl fmt::Show for IntVarValue {
944 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
946 IntType(ref v) => v.fmt(f),
947 UintType(ref v) => v.fmt(f),
953 pub struct TypeParameterDef {
954 pub ident: ast::Ident,
955 pub def_id: ast::DefId,
956 pub space: subst::ParamSpace,
958 pub bounds: Rc<ParamBounds>,
959 pub default: Option<ty::t>
962 #[deriving(Encodable, Decodable, Clone)]
963 pub struct RegionParameterDef {
965 pub def_id: ast::DefId,
966 pub space: subst::ParamSpace,
970 /// Information about the type/lifetime parameters associated with an
971 /// item or method. Analogous to ast::Generics.
973 pub struct Generics {
974 pub types: VecPerParamSpace<TypeParameterDef>,
975 pub regions: VecPerParamSpace<RegionParameterDef>,
979 pub fn empty() -> Generics {
980 Generics { types: VecPerParamSpace::empty(),
981 regions: VecPerParamSpace::empty() }
984 pub fn has_type_params(&self, space: subst::ParamSpace) -> bool {
985 !self.types.get_vec(space).is_empty()
989 /// When type checking, we use the `ParameterEnvironment` to track
990 /// details about the type/lifetime parameters that are in scope.
991 /// It primarily stores the bounds information.
993 /// Note: This information might seem to be redundant with the data in
994 /// `tcx.ty_param_defs`, but it is not. That table contains the
995 /// parameter definitions from an "outside" perspective, but this
996 /// struct will contain the bounds for a parameter as seen from inside
997 /// the function body. Currently the only real distinction is that
998 /// bound lifetime parameters are replaced with free ones, but in the
999 /// future I hope to refine the representation of types so as to make
1000 /// more distinctions clearer.
1001 pub struct ParameterEnvironment {
1002 /// A substitution that can be applied to move from
1003 /// the "outer" view of a type or method to the "inner" view.
1004 /// In general, this means converting from bound parameters to
1005 /// free parameters. Since we currently represent bound/free type
1006 /// parameters in the same way, this only has an affect on regions.
1007 pub free_substs: Substs,
1009 /// Bounds on the various type parameters
1010 pub bounds: VecPerParamSpace<ParamBounds>,
1015 /// - `generics`: the set of type parameters and their bounds
1016 /// - `ty`: the base types, which may reference the parameters defined
1019 pub struct Polytype {
1020 pub generics: Generics,
1024 /// As `Polytype` but for a trait ref.
1025 pub struct TraitDef {
1026 pub generics: Generics,
1027 pub bounds: BuiltinBounds,
1028 pub trait_ref: Rc<ty::TraitRef>,
1031 /// Records the substitutions used to translate the polytype for an
1032 /// item into the monotype of an item reference.
1034 pub struct ItemSubsts {
1038 pub type type_cache = RefCell<DefIdMap<Polytype>>;
1040 pub type node_type_table = RefCell<HashMap<uint,t>>;
1042 pub fn mk_ctxt(s: Session,
1043 dm: resolve::DefMap,
1044 named_region_map: resolve_lifetime::NamedRegionMap,
1046 freevars: freevars::freevar_map,
1047 region_maps: middle::region::RegionMaps,
1048 lang_items: middle::lang_items::LanguageItems,
1049 stability: stability::Index)
1052 named_region_map: named_region_map,
1053 item_variance_map: RefCell::new(DefIdMap::new()),
1054 interner: RefCell::new(FnvHashMap::new()),
1055 next_id: Cell::new(primitives::LAST_PRIMITIVE_ID),
1058 region_maps: region_maps,
1059 node_types: RefCell::new(HashMap::new()),
1060 item_substs: RefCell::new(NodeMap::new()),
1061 trait_refs: RefCell::new(NodeMap::new()),
1062 trait_defs: RefCell::new(DefIdMap::new()),
1064 intrinsic_defs: RefCell::new(DefIdMap::new()),
1065 freevars: RefCell::new(freevars),
1066 tcache: RefCell::new(DefIdMap::new()),
1067 rcache: RefCell::new(HashMap::new()),
1068 short_names_cache: RefCell::new(HashMap::new()),
1069 needs_unwind_cleanup_cache: RefCell::new(HashMap::new()),
1070 tc_cache: RefCell::new(HashMap::new()),
1071 ast_ty_to_ty_cache: RefCell::new(NodeMap::new()),
1072 enum_var_cache: RefCell::new(DefIdMap::new()),
1073 methods: RefCell::new(DefIdMap::new()),
1074 trait_method_def_ids: RefCell::new(DefIdMap::new()),
1075 trait_methods_cache: RefCell::new(DefIdMap::new()),
1076 impl_trait_cache: RefCell::new(DefIdMap::new()),
1077 ty_param_defs: RefCell::new(NodeMap::new()),
1078 adjustments: RefCell::new(NodeMap::new()),
1079 normalized_cache: RefCell::new(HashMap::new()),
1080 lang_items: lang_items,
1081 provided_method_sources: RefCell::new(DefIdMap::new()),
1082 supertraits: RefCell::new(DefIdMap::new()),
1083 superstructs: RefCell::new(DefIdMap::new()),
1084 struct_fields: RefCell::new(DefIdMap::new()),
1085 destructor_for_type: RefCell::new(DefIdMap::new()),
1086 destructors: RefCell::new(DefIdSet::new()),
1087 trait_impls: RefCell::new(DefIdMap::new()),
1088 inherent_impls: RefCell::new(DefIdMap::new()),
1089 impl_methods: RefCell::new(DefIdMap::new()),
1090 used_unsafe: RefCell::new(NodeSet::new()),
1091 used_mut_nodes: RefCell::new(NodeSet::new()),
1092 impl_vtables: RefCell::new(DefIdMap::new()),
1093 populated_external_types: RefCell::new(DefIdSet::new()),
1094 populated_external_traits: RefCell::new(DefIdSet::new()),
1095 upvar_borrow_map: RefCell::new(HashMap::new()),
1096 extern_const_statics: RefCell::new(DefIdMap::new()),
1097 extern_const_variants: RefCell::new(DefIdMap::new()),
1098 method_map: RefCell::new(FnvHashMap::new()),
1099 vtable_map: RefCell::new(FnvHashMap::new()),
1100 dependency_formats: RefCell::new(HashMap::new()),
1101 node_lint_levels: RefCell::new(HashMap::new()),
1102 transmute_restrictions: RefCell::new(Vec::new()),
1103 stability: RefCell::new(stability)
1107 // Type constructors
1109 // Interns a type/name combination, stores the resulting box in cx.interner,
1110 // and returns the box as cast to an unsafe ptr (see comments for t above).
1111 pub fn mk_t(cx: &ctxt, st: sty) -> t {
1112 // Check for primitive types.
1114 ty_nil => return mk_nil(),
1115 ty_err => return mk_err(),
1116 ty_bool => return mk_bool(),
1117 ty_int(i) => return mk_mach_int(i),
1118 ty_uint(u) => return mk_mach_uint(u),
1119 ty_float(f) => return mk_mach_float(f),
1120 ty_char => return mk_char(),
1121 ty_bot => return mk_bot(),
1125 let key = intern_key { sty: &st };
1127 match cx.interner.borrow().find(&key) {
1128 Some(t) => unsafe { return mem::transmute(&t.sty); },
1133 fn rflags(r: Region) -> uint {
1134 (has_regions as uint) | {
1136 ty::ReInfer(_) => needs_infer as uint,
1141 fn sflags(substs: &Substs) -> uint {
1143 let mut i = substs.types.iter();
1145 f |= get(*tt).flags;
1147 match substs.regions {
1148 subst::ErasedRegions => {}
1149 subst::NonerasedRegions(ref regions) => {
1150 for r in regions.iter() {
1158 &ty_nil | &ty_bool | &ty_char | &ty_int(_) | &ty_float(_) | &ty_uint(_) |
1160 // You might think that we could just return ty_err for
1161 // any type containing ty_err as a component, and get
1162 // rid of the has_ty_err flag -- likewise for ty_bot (with
1163 // the exception of function types that return bot).
1164 // But doing so caused sporadic memory corruption, and
1165 // neither I (tjc) nor nmatsakis could figure out why,
1166 // so we're doing it this way.
1167 &ty_bot => flags |= has_ty_bot as uint,
1168 &ty_err => flags |= has_ty_err as uint,
1169 &ty_param(ref p) => {
1170 if p.space == subst::SelfSpace {
1171 flags |= has_self as uint;
1173 flags |= has_params as uint;
1176 &ty_infer(_) => flags |= needs_infer as uint,
1177 &ty_enum(_, ref substs) | &ty_struct(_, ref substs) => {
1178 flags |= sflags(substs);
1180 &ty_trait(box ty::TyTrait { ref substs, .. }) => {
1181 flags |= sflags(substs);
1183 &ty_box(tt) | &ty_uniq(tt) => {
1184 flags |= get(tt).flags
1186 &ty_ptr(ref m) | &ty_vec(ref m, _) => {
1187 flags |= get(m.ty).flags;
1189 &ty_rptr(r, ref m) => {
1191 flags |= get(m.ty).flags;
1193 &ty_tup(ref ts) => for tt in ts.iter() { flags |= get(*tt).flags; },
1194 &ty_bare_fn(ref f) => {
1195 for a in f.sig.inputs.iter() { flags |= get(*a).flags; }
1196 flags |= get(f.sig.output).flags;
1197 // T -> _|_ is *not* _|_ !
1198 flags &= !(has_ty_bot as uint);
1200 &ty_closure(ref f) => {
1202 RegionTraitStore(r, _) => {
1207 for a in f.sig.inputs.iter() { flags |= get(*a).flags; }
1208 flags |= get(f.sig.output).flags;
1209 // T -> _|_ is *not* _|_ !
1210 flags &= !(has_ty_bot as uint);
1214 let t = box t_box_ {
1216 id: cx.next_id.get(),
1220 let sty_ptr = &t.sty as *sty;
1222 let key = intern_key {
1226 cx.interner.borrow_mut().insert(key, t);
1228 cx.next_id.set(cx.next_id.get() + 1);
1231 mem::transmute::<*sty, t>(sty_ptr)
1236 pub fn mk_prim_t(primitive: &'static t_box_) -> t {
1238 mem::transmute::<&'static t_box_, t>(primitive)
1243 pub fn mk_nil() -> t { mk_prim_t(&primitives::TY_NIL) }
1246 pub fn mk_err() -> t { mk_prim_t(&primitives::TY_ERR) }
1249 pub fn mk_bot() -> t { mk_prim_t(&primitives::TY_BOT) }
1252 pub fn mk_bool() -> t { mk_prim_t(&primitives::TY_BOOL) }
1255 pub fn mk_int() -> t { mk_prim_t(&primitives::TY_INT) }
1258 pub fn mk_i8() -> t { mk_prim_t(&primitives::TY_I8) }
1261 pub fn mk_i16() -> t { mk_prim_t(&primitives::TY_I16) }
1264 pub fn mk_i32() -> t { mk_prim_t(&primitives::TY_I32) }
1267 pub fn mk_i64() -> t { mk_prim_t(&primitives::TY_I64) }
1270 pub fn mk_f32() -> t { mk_prim_t(&primitives::TY_F32) }
1273 pub fn mk_f64() -> t { mk_prim_t(&primitives::TY_F64) }
1276 pub fn mk_f128() -> t { mk_prim_t(&primitives::TY_F128) }
1279 pub fn mk_uint() -> t { mk_prim_t(&primitives::TY_UINT) }
1282 pub fn mk_u8() -> t { mk_prim_t(&primitives::TY_U8) }
1285 pub fn mk_u16() -> t { mk_prim_t(&primitives::TY_U16) }
1288 pub fn mk_u32() -> t { mk_prim_t(&primitives::TY_U32) }
1291 pub fn mk_u64() -> t { mk_prim_t(&primitives::TY_U64) }
1293 pub fn mk_mach_int(tm: ast::IntTy) -> t {
1295 ast::TyI => mk_int(),
1296 ast::TyI8 => mk_i8(),
1297 ast::TyI16 => mk_i16(),
1298 ast::TyI32 => mk_i32(),
1299 ast::TyI64 => mk_i64(),
1303 pub fn mk_mach_uint(tm: ast::UintTy) -> t {
1305 ast::TyU => mk_uint(),
1306 ast::TyU8 => mk_u8(),
1307 ast::TyU16 => mk_u16(),
1308 ast::TyU32 => mk_u32(),
1309 ast::TyU64 => mk_u64(),
1313 pub fn mk_mach_float(tm: ast::FloatTy) -> t {
1315 ast::TyF32 => mk_f32(),
1316 ast::TyF64 => mk_f64(),
1317 ast::TyF128 => mk_f128()
1322 pub fn mk_char() -> t { mk_prim_t(&primitives::TY_CHAR) }
1324 pub fn mk_str(cx: &ctxt) -> t {
1328 pub fn mk_str_slice(cx: &ctxt, r: Region, m: ast::Mutability) -> t {
1331 ty: mk_t(cx, ty_str),
1336 pub fn mk_enum(cx: &ctxt, did: ast::DefId, substs: Substs) -> t {
1337 // take a copy of substs so that we own the vectors inside
1338 mk_t(cx, ty_enum(did, substs))
1341 pub fn mk_box(cx: &ctxt, ty: t) -> t { mk_t(cx, ty_box(ty)) }
1343 pub fn mk_uniq(cx: &ctxt, ty: t) -> t { mk_t(cx, ty_uniq(ty)) }
1345 pub fn mk_ptr(cx: &ctxt, tm: mt) -> t { mk_t(cx, ty_ptr(tm)) }
1347 pub fn mk_rptr(cx: &ctxt, r: Region, tm: mt) -> t { mk_t(cx, ty_rptr(r, tm)) }
1349 pub fn mk_mut_rptr(cx: &ctxt, r: Region, ty: t) -> t {
1350 mk_rptr(cx, r, mt {ty: ty, mutbl: ast::MutMutable})
1352 pub fn mk_imm_rptr(cx: &ctxt, r: Region, ty: t) -> t {
1353 mk_rptr(cx, r, mt {ty: ty, mutbl: ast::MutImmutable})
1356 pub fn mk_mut_ptr(cx: &ctxt, ty: t) -> t {
1357 mk_ptr(cx, mt {ty: ty, mutbl: ast::MutMutable})
1360 pub fn mk_imm_ptr(cx: &ctxt, ty: t) -> t {
1361 mk_ptr(cx, mt {ty: ty, mutbl: ast::MutImmutable})
1364 pub fn mk_nil_ptr(cx: &ctxt) -> t {
1365 mk_ptr(cx, mt {ty: mk_nil(), mutbl: ast::MutImmutable})
1368 pub fn mk_vec(cx: &ctxt, tm: mt, sz: Option<uint>) -> t {
1369 mk_t(cx, ty_vec(tm, sz))
1372 pub fn mk_slice(cx: &ctxt, r: Region, tm: mt) -> t {
1375 ty: mk_vec(cx, tm, None),
1380 pub fn mk_tup(cx: &ctxt, ts: Vec<t>) -> t { mk_t(cx, ty_tup(ts)) }
1382 pub fn mk_closure(cx: &ctxt, fty: ClosureTy) -> t {
1383 mk_t(cx, ty_closure(box fty))
1386 pub fn mk_bare_fn(cx: &ctxt, fty: BareFnTy) -> t {
1387 mk_t(cx, ty_bare_fn(fty))
1390 pub fn mk_ctor_fn(cx: &ctxt,
1391 binder_id: ast::NodeId,
1392 input_tys: &[ty::t],
1393 output: ty::t) -> t {
1394 let input_args = input_tys.iter().map(|t| *t).collect();
1397 fn_style: ast::NormalFn,
1400 binder_id: binder_id,
1409 pub fn mk_trait(cx: &ctxt,
1412 bounds: BuiltinBounds)
1414 // take a copy of substs so that we own the vectors inside
1415 let inner = box TyTrait {
1420 mk_t(cx, ty_trait(inner))
1423 pub fn mk_struct(cx: &ctxt, struct_id: ast::DefId, substs: Substs) -> t {
1424 // take a copy of substs so that we own the vectors inside
1425 mk_t(cx, ty_struct(struct_id, substs))
1428 pub fn mk_var(cx: &ctxt, v: TyVid) -> t { mk_infer(cx, TyVar(v)) }
1430 pub fn mk_int_var(cx: &ctxt, v: IntVid) -> t { mk_infer(cx, IntVar(v)) }
1432 pub fn mk_float_var(cx: &ctxt, v: FloatVid) -> t { mk_infer(cx, FloatVar(v)) }
1434 pub fn mk_infer(cx: &ctxt, it: InferTy) -> t { mk_t(cx, ty_infer(it)) }
1436 pub fn mk_param(cx: &ctxt, space: subst::ParamSpace, n: uint, k: DefId) -> t {
1437 mk_t(cx, ty_param(ParamTy { space: space, idx: n, def_id: k }))
1440 pub fn mk_self_type(cx: &ctxt, did: ast::DefId) -> t {
1441 mk_param(cx, subst::SelfSpace, 0, did)
1444 pub fn mk_param_from_def(cx: &ctxt, def: &TypeParameterDef) -> t {
1445 mk_param(cx, def.space, def.index, def.def_id)
1448 pub fn walk_ty(ty: t, f: |t|) {
1449 maybe_walk_ty(ty, |t| { f(t); true });
1452 pub fn maybe_walk_ty(ty: t, f: |t| -> bool) {
1457 ty_nil | ty_bot | ty_bool | ty_char | ty_int(_) | ty_uint(_) | ty_float(_) |
1458 ty_str | ty_infer(_) | ty_param(_) | ty_err => {
1460 ty_box(ty) | ty_uniq(ty) => maybe_walk_ty(ty, f),
1461 ty_ptr(ref tm) | ty_rptr(_, ref tm) | ty_vec(ref tm, _) => {
1462 maybe_walk_ty(tm.ty, f);
1464 ty_enum(_, ref substs) | ty_struct(_, ref substs) |
1465 ty_trait(box TyTrait { ref substs, .. }) => {
1466 for subty in (*substs).types.iter() {
1467 maybe_walk_ty(*subty, |x| f(x));
1470 ty_tup(ref ts) => { for tt in ts.iter() { maybe_walk_ty(*tt, |x| f(x)); } }
1471 ty_bare_fn(ref ft) => {
1472 for a in ft.sig.inputs.iter() { maybe_walk_ty(*a, |x| f(x)); }
1473 maybe_walk_ty(ft.sig.output, f);
1475 ty_closure(ref ft) => {
1476 for a in ft.sig.inputs.iter() { maybe_walk_ty(*a, |x| f(x)); }
1477 maybe_walk_ty(ft.sig.output, f);
1482 // Folds types from the bottom up.
1483 pub fn fold_ty(cx: &ctxt, t0: t, fldop: |t| -> t) -> t {
1484 let mut f = ty_fold::BottomUpFolder {tcx: cx, fldop: fldop};
1488 pub fn walk_regions_and_ty(cx: &ctxt, ty: t, fldr: |r: Region|, fldt: |t: t|)
1490 ty_fold::RegionFolder::general(cx,
1492 |t| { fldt(t); t }).fold_ty(ty)
1496 pub fn empty() -> ItemSubsts {
1497 ItemSubsts { substs: Substs::empty() }
1500 pub fn is_noop(&self) -> bool {
1501 self.substs.is_noop()
1507 pub fn type_is_nil(ty: t) -> bool { get(ty).sty == ty_nil }
1509 pub fn type_is_bot(ty: t) -> bool {
1510 (get(ty).flags & (has_ty_bot as uint)) != 0
1513 pub fn type_is_error(ty: t) -> bool {
1514 (get(ty).flags & (has_ty_err as uint)) != 0
1517 pub fn type_needs_subst(ty: t) -> bool {
1518 tbox_has_flag(get(ty), needs_subst)
1521 pub fn trait_ref_contains_error(tref: &ty::TraitRef) -> bool {
1522 tref.substs.types.any(|&t| type_is_error(t))
1525 pub fn type_is_ty_var(ty: t) -> bool {
1527 ty_infer(TyVar(_)) => true,
1532 pub fn type_is_bool(ty: t) -> bool { get(ty).sty == ty_bool }
1534 pub fn type_is_self(ty: t) -> bool {
1536 ty_param(ref p) => p.space == subst::SelfSpace,
1541 fn type_is_slice(ty:t) -> bool {
1543 ty_rptr(_, mt) => match get(mt.ty).sty {
1544 ty_vec(_, None) | ty_str => true,
1551 pub fn type_is_structural(ty: t) -> bool {
1553 ty_struct(..) | ty_tup(_) | ty_enum(..) | ty_closure(_) |
1554 ty_vec(_, Some(_)) => true,
1555 _ => type_is_slice(ty) | type_is_trait(ty)
1559 pub fn type_is_simd(cx: &ctxt, ty: t) -> bool {
1561 ty_struct(did, _) => lookup_simd(cx, did),
1566 pub fn sequence_element_type(cx: &ctxt, ty: t) -> t {
1568 ty_vec(mt, Some(_)) => mt.ty,
1569 ty_ptr(mt{ty: t, ..}) | ty_rptr(_, mt{ty: t, ..}) |
1570 ty_box(t) | ty_uniq(t) => match get(t).sty {
1571 ty_vec(mt, None) => mt.ty,
1572 ty_str => mk_mach_uint(ast::TyU8),
1573 _ => cx.sess.bug("sequence_element_type called on non-sequence value"),
1575 _ => cx.sess.bug("sequence_element_type called on non-sequence value"),
1579 pub fn simd_type(cx: &ctxt, ty: t) -> t {
1581 ty_struct(did, ref substs) => {
1582 let fields = lookup_struct_fields(cx, did);
1583 lookup_field_type(cx, did, fields.get(0).id, substs)
1585 _ => fail!("simd_type called on invalid type")
1589 pub fn simd_size(cx: &ctxt, ty: t) -> uint {
1591 ty_struct(did, _) => {
1592 let fields = lookup_struct_fields(cx, did);
1595 _ => fail!("simd_size called on invalid type")
1599 pub fn type_is_boxed(ty: t) -> bool {
1606 pub fn type_is_region_ptr(ty: t) -> bool {
1608 ty_rptr(_, mt) => match get(mt.ty).sty {
1609 // FIXME(nrc, DST) slices weren't regarded as rptrs, so we preserve this
1610 // odd behaviour for now. (But ~[] were unique. I have no idea why).
1611 ty_vec(_, None) | ty_str | ty_trait(..) => false,
1618 pub fn type_is_unsafe_ptr(ty: t) -> bool {
1620 ty_ptr(_) => return true,
1625 pub fn type_is_unique(ty: t) -> bool {
1627 ty_uniq(_) => match get(ty).sty {
1628 ty_trait(..) => false,
1636 A scalar type is one that denotes an atomic datum, with no sub-components.
1637 (A ty_ptr is scalar because it represents a non-managed pointer, so its
1638 contents are abstract to rustc.)
1640 pub fn type_is_scalar(ty: t) -> bool {
1642 ty_nil | ty_bool | ty_char | ty_int(_) | ty_float(_) | ty_uint(_) |
1643 ty_infer(IntVar(_)) | ty_infer(FloatVar(_)) |
1644 ty_bare_fn(..) | ty_ptr(_) => true,
1649 /// Returns true if this type is a floating point type and false otherwise.
1650 pub fn type_is_floating_point(ty: t) -> bool {
1652 ty_float(_) => true,
1657 pub fn type_needs_drop(cx: &ctxt, ty: t) -> bool {
1658 type_contents(cx, ty).needs_drop(cx)
1661 // Some things don't need cleanups during unwinding because the
1662 // task can free them all at once later. Currently only things
1663 // that only contain scalars and shared boxes can avoid unwind
1665 pub fn type_needs_unwind_cleanup(cx: &ctxt, ty: t) -> bool {
1666 match cx.needs_unwind_cleanup_cache.borrow().find(&ty) {
1667 Some(&result) => return result,
1671 let mut tycache = HashSet::new();
1672 let needs_unwind_cleanup =
1673 type_needs_unwind_cleanup_(cx, ty, &mut tycache, false);
1674 cx.needs_unwind_cleanup_cache.borrow_mut().insert(ty, needs_unwind_cleanup);
1675 return needs_unwind_cleanup;
1678 fn type_needs_unwind_cleanup_(cx: &ctxt, ty: t,
1679 tycache: &mut HashSet<t>,
1680 encountered_box: bool) -> bool {
1682 // Prevent infinite recursion
1683 if !tycache.insert(ty) {
1687 let mut encountered_box = encountered_box;
1688 let mut needs_unwind_cleanup = false;
1689 maybe_walk_ty(ty, |ty| {
1690 let old_encountered_box = encountered_box;
1691 let result = match get(ty).sty {
1693 encountered_box = true;
1696 ty_nil | ty_bot | ty_bool | ty_int(_) | ty_uint(_) | ty_float(_) |
1697 ty_tup(_) | ty_ptr(_) => {
1700 ty_enum(did, ref substs) => {
1701 for v in (*enum_variants(cx, did)).iter() {
1702 for aty in v.args.iter() {
1703 let t = aty.subst(cx, substs);
1704 needs_unwind_cleanup |=
1705 type_needs_unwind_cleanup_(cx, t, tycache,
1709 !needs_unwind_cleanup
1712 // Once we're inside a box, the annihilator will find
1713 // it and destroy it.
1714 if !encountered_box {
1715 needs_unwind_cleanup = true;
1722 needs_unwind_cleanup = true;
1727 encountered_box = old_encountered_box;
1731 return needs_unwind_cleanup;
1735 * Type contents is how the type checker reasons about kinds.
1736 * They track what kinds of things are found within a type. You can
1737 * think of them as kind of an "anti-kind". They track the kinds of values
1738 * and thinks that are contained in types. Having a larger contents for
1739 * a type tends to rule that type *out* from various kinds. For example,
1740 * a type that contains a reference is not sendable.
1742 * The reason we compute type contents and not kinds is that it is
1743 * easier for me (nmatsakis) to think about what is contained within
1744 * a type than to think about what is *not* contained within a type.
1746 pub struct TypeContents {
1750 macro_rules! def_type_content_sets(
1751 (mod $mname:ident { $($name:ident = $bits:expr),+ }) => {
1753 use middle::ty::TypeContents;
1754 $(pub static $name: TypeContents = TypeContents { bits: $bits };)+
1759 def_type_content_sets!(
1761 None = 0b0000_0000__0000_0000__0000,
1763 // Things that are interior to the value (first nibble):
1764 InteriorUnsized = 0b0000_0000__0000_0000__0001,
1765 InteriorUnsafe = 0b0000_0000__0000_0000__0010,
1766 // InteriorAll = 0b00000000__00000000__1111,
1768 // Things that are owned by the value (second and third nibbles):
1769 OwnsOwned = 0b0000_0000__0000_0001__0000,
1770 OwnsDtor = 0b0000_0000__0000_0010__0000,
1771 OwnsManaged /* see [1] below */ = 0b0000_0000__0000_0100__0000,
1772 OwnsAffine = 0b0000_0000__0000_1000__0000,
1773 OwnsAll = 0b0000_0000__1111_1111__0000,
1775 // Things that are reachable by the value in any way (fourth nibble):
1776 ReachesNonsendAnnot = 0b0000_0001__0000_0000__0000,
1777 ReachesBorrowed = 0b0000_0010__0000_0000__0000,
1778 // ReachesManaged /* see [1] below */ = 0b0000_0100__0000_0000__0000,
1779 ReachesMutable = 0b0000_1000__0000_0000__0000,
1780 ReachesNoShare = 0b0001_0000__0000_0000__0000,
1781 ReachesAll = 0b0001_1111__0000_0000__0000,
1783 // Things that cause values to *move* rather than *copy*
1784 Moves = 0b0000_0000__0000_1011__0000,
1786 // Things that mean drop glue is necessary
1787 NeedsDrop = 0b0000_0000__0000_0111__0000,
1789 // Things that prevent values from being sent
1791 // Note: For checking whether something is sendable, it'd
1792 // be sufficient to have ReachesManaged. However, we include
1793 // both ReachesManaged and OwnsManaged so that when
1794 // a parameter has a bound T:Send, we are able to deduce
1795 // that it neither reaches nor owns a managed pointer.
1796 Nonsendable = 0b0000_0111__0000_0100__0000,
1798 // Things that prevent values from being considered 'static
1799 Nonstatic = 0b0000_0010__0000_0000__0000,
1801 // Things that prevent values from being considered sized
1802 Nonsized = 0b0000_0000__0000_0000__0001,
1804 // Things that prevent values from being shared
1805 Nonsharable = 0b0001_0000__0000_0000__0000,
1807 // Things that make values considered not POD (would be same
1808 // as `Moves`, but for the fact that managed data `@` is
1809 // not considered POD)
1810 Noncopy = 0b0000_0000__0000_1111__0000,
1812 // Bits to set when a managed value is encountered
1814 // [1] Do not set the bits TC::OwnsManaged or
1815 // TC::ReachesManaged directly, instead reference
1816 // TC::Managed to set them both at once.
1817 Managed = 0b0000_0100__0000_0100__0000,
1820 All = 0b1111_1111__1111_1111__1111
1825 pub fn meets_bound(&self, cx: &ctxt, bb: BuiltinBound) -> bool {
1827 BoundStatic => self.is_static(cx),
1828 BoundSend => self.is_sendable(cx),
1829 BoundSized => self.is_sized(cx),
1830 BoundCopy => self.is_copy(cx),
1831 BoundShare => self.is_sharable(cx),
1835 pub fn when(&self, cond: bool) -> TypeContents {
1836 if cond {*self} else {TC::None}
1839 pub fn intersects(&self, tc: TypeContents) -> bool {
1840 (self.bits & tc.bits) != 0
1843 pub fn is_static(&self, _: &ctxt) -> bool {
1844 !self.intersects(TC::Nonstatic)
1847 pub fn is_sendable(&self, _: &ctxt) -> bool {
1848 !self.intersects(TC::Nonsendable)
1851 pub fn is_sharable(&self, _: &ctxt) -> bool {
1852 !self.intersects(TC::Nonsharable)
1855 pub fn owns_managed(&self) -> bool {
1856 self.intersects(TC::OwnsManaged)
1859 pub fn owns_owned(&self) -> bool {
1860 self.intersects(TC::OwnsOwned)
1863 pub fn is_sized(&self, _: &ctxt) -> bool {
1864 !self.intersects(TC::Nonsized)
1867 pub fn is_copy(&self, _: &ctxt) -> bool {
1868 !self.intersects(TC::Noncopy)
1871 pub fn interior_unsafe(&self) -> bool {
1872 self.intersects(TC::InteriorUnsafe)
1875 pub fn interior_unsized(&self) -> bool {
1876 self.intersects(TC::InteriorUnsized)
1879 pub fn moves_by_default(&self, _: &ctxt) -> bool {
1880 self.intersects(TC::Moves)
1883 pub fn needs_drop(&self, _: &ctxt) -> bool {
1884 self.intersects(TC::NeedsDrop)
1887 pub fn owned_pointer(&self) -> TypeContents {
1889 * Includes only those bits that still apply
1890 * when indirected through a `Box` pointer
1893 *self & (TC::OwnsAll | TC::ReachesAll))
1896 pub fn reference(&self, bits: TypeContents) -> TypeContents {
1898 * Includes only those bits that still apply
1899 * when indirected through a reference (`&`)
1902 *self & TC::ReachesAll)
1905 pub fn managed_pointer(&self) -> TypeContents {
1907 * Includes only those bits that still apply
1908 * when indirected through a managed pointer (`@`)
1911 *self & TC::ReachesAll)
1914 pub fn unsafe_pointer(&self) -> TypeContents {
1916 * Includes only those bits that still apply
1917 * when indirected through an unsafe pointer (`*`)
1919 *self & TC::ReachesAll
1922 pub fn union<T>(v: &[T], f: |&T| -> TypeContents) -> TypeContents {
1923 v.iter().fold(TC::None, |tc, t| tc | f(t))
1926 pub fn has_dtor(&self) -> bool {
1927 self.intersects(TC::OwnsDtor)
1931 impl ops::BitOr<TypeContents,TypeContents> for TypeContents {
1932 fn bitor(&self, other: &TypeContents) -> TypeContents {
1933 TypeContents {bits: self.bits | other.bits}
1937 impl ops::BitAnd<TypeContents,TypeContents> for TypeContents {
1938 fn bitand(&self, other: &TypeContents) -> TypeContents {
1939 TypeContents {bits: self.bits & other.bits}
1943 impl ops::Sub<TypeContents,TypeContents> for TypeContents {
1944 fn sub(&self, other: &TypeContents) -> TypeContents {
1945 TypeContents {bits: self.bits & !other.bits}
1949 impl fmt::Show for TypeContents {
1950 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
1951 write!(f, "TypeContents({:t})", self.bits)
1955 pub fn type_is_static(cx: &ctxt, t: ty::t) -> bool {
1956 type_contents(cx, t).is_static(cx)
1959 pub fn type_is_sendable(cx: &ctxt, t: ty::t) -> bool {
1960 type_contents(cx, t).is_sendable(cx)
1963 pub fn type_interior_is_unsafe(cx: &ctxt, t: ty::t) -> bool {
1964 type_contents(cx, t).interior_unsafe()
1967 pub fn type_contents(cx: &ctxt, ty: t) -> TypeContents {
1968 let ty_id = type_id(ty);
1970 match cx.tc_cache.borrow().find(&ty_id) {
1971 Some(tc) => { return *tc; }
1975 let mut cache = HashMap::new();
1976 let result = tc_ty(cx, ty, &mut cache);
1978 cx.tc_cache.borrow_mut().insert(ty_id, result);
1983 cache: &mut HashMap<uint, TypeContents>) -> TypeContents
1985 // Subtle: Note that we are *not* using cx.tc_cache here but rather a
1986 // private cache for this walk. This is needed in the case of cyclic
1989 // struct List { next: Box<Option<List>>, ... }
1991 // When computing the type contents of such a type, we wind up deeply
1992 // recursing as we go. So when we encounter the recursive reference
1993 // to List, we temporarily use TC::None as its contents. Later we'll
1994 // patch up the cache with the correct value, once we've computed it
1995 // (this is basically a co-inductive process, if that helps). So in
1996 // the end we'll compute TC::OwnsOwned, in this case.
1998 // The problem is, as we are doing the computation, we will also
1999 // compute an *intermediate* contents for, e.g., Option<List> of
2000 // TC::None. This is ok during the computation of List itself, but if
2001 // we stored this intermediate value into cx.tc_cache, then later
2002 // requests for the contents of Option<List> would also yield TC::None
2003 // which is incorrect. This value was computed based on the crutch
2004 // value for the type contents of list. The correct value is
2005 // TC::OwnsOwned. This manifested as issue #4821.
2006 let ty_id = type_id(ty);
2007 match cache.find(&ty_id) {
2008 Some(tc) => { return *tc; }
2011 match cx.tc_cache.borrow().find(&ty_id) { // Must check both caches!
2012 Some(tc) => { return *tc; }
2015 cache.insert(ty_id, TC::None);
2017 let result = match get(ty).sty {
2018 // Scalar and unique types are sendable, and durable
2019 ty_nil | ty_bot | ty_bool | ty_int(_) | ty_uint(_) | ty_float(_) |
2020 ty_bare_fn(_) | ty::ty_char | ty_str => {
2024 ty_closure(ref c) => {
2025 closure_contents(cx, *c)
2029 tc_ty(cx, typ, cache).managed_pointer()
2033 match get(typ).sty {
2034 ty_str => TC::OwnsOwned,
2035 _ => tc_ty(cx, typ, cache).owned_pointer(),
2039 ty_trait(box ty::TyTrait { bounds, .. }) => {
2040 object_contents(cx, bounds)
2044 tc_ty(cx, mt.ty, cache).unsafe_pointer()
2047 ty_rptr(r, ref mt) => {
2048 match get(mt.ty).sty {
2049 ty_str => borrowed_contents(r, ast::MutImmutable),
2050 _ => tc_ty(cx, mt.ty, cache).reference(borrowed_contents(r, mt.mutbl)),
2055 tc_mt(cx, mt, cache)
2058 ty_struct(did, ref substs) => {
2059 let flds = struct_fields(cx, did, substs);
2061 TypeContents::union(flds.as_slice(),
2062 |f| tc_mt(cx, f.mt, cache));
2063 if ty::has_dtor(cx, did) {
2064 res = res | TC::OwnsDtor;
2066 apply_lang_items(cx, did, res)
2069 ty_tup(ref tys) => {
2070 TypeContents::union(tys.as_slice(),
2071 |ty| tc_ty(cx, *ty, cache))
2074 ty_enum(did, ref substs) => {
2075 let variants = substd_enum_variants(cx, did, substs);
2077 TypeContents::union(variants.as_slice(), |variant| {
2078 TypeContents::union(variant.args.as_slice(),
2080 tc_ty(cx, *arg_ty, cache)
2083 apply_lang_items(cx, did, res)
2087 // We only ever ask for the kind of types that are defined in
2088 // the current crate; therefore, the only type parameters that
2089 // could be in scope are those defined in the current crate.
2090 // If this assertion failures, it is likely because of a
2091 // failure in the cross-crate inlining code to translate a
2093 assert_eq!(p.def_id.krate, ast::LOCAL_CRATE);
2095 let ty_param_defs = cx.ty_param_defs.borrow();
2096 let tp_def = ty_param_defs.get(&p.def_id.node);
2097 kind_bounds_to_contents(cx,
2098 tp_def.bounds.builtin_bounds,
2099 tp_def.bounds.trait_bounds.as_slice())
2103 // This occurs during coherence, but shouldn't occur at other
2109 cx.sess.bug("asked to compute contents of error type");
2113 cache.insert(ty_id, result);
2119 cache: &mut HashMap<uint, TypeContents>) -> TypeContents
2121 let mc = TC::ReachesMutable.when(mt.mutbl == MutMutable);
2122 mc | tc_ty(cx, mt.ty, cache)
2125 fn apply_lang_items(cx: &ctxt,
2129 if Some(did) == cx.lang_items.no_send_bound() {
2130 tc | TC::ReachesNonsendAnnot
2131 } else if Some(did) == cx.lang_items.managed_bound() {
2133 } else if Some(did) == cx.lang_items.no_copy_bound() {
2135 } else if Some(did) == cx.lang_items.no_share_bound() {
2136 tc | TC::ReachesNoShare
2137 } else if Some(did) == cx.lang_items.unsafe_type() {
2138 // FIXME(#13231): This shouldn't be needed after
2139 // opt-in built-in bounds are implemented.
2140 (tc | TC::InteriorUnsafe) - TC::Nonsharable
2146 fn borrowed_contents(region: ty::Region,
2147 mutbl: ast::Mutability)
2150 * Type contents due to containing a reference
2151 * with the region `region` and borrow kind `bk`
2154 let b = match mutbl {
2155 ast::MutMutable => TC::ReachesMutable | TC::OwnsAffine,
2156 ast::MutImmutable => TC::None,
2158 b | (TC::ReachesBorrowed).when(region != ty::ReStatic)
2161 fn closure_contents(cx: &ctxt, cty: &ClosureTy) -> TypeContents {
2162 // Closure contents are just like trait contents, but with potentially
2164 let st = object_contents(cx, cty.bounds);
2166 let st = match cty.store {
2170 RegionTraitStore(r, mutbl) => {
2171 st.reference(borrowed_contents(r, mutbl))
2175 // This also prohibits "@once fn" from being copied, which allows it to
2176 // be called. Neither way really makes much sense.
2177 let ot = match cty.onceness {
2178 ast::Once => TC::OwnsAffine,
2179 ast::Many => TC::None,
2185 fn object_contents(cx: &ctxt,
2186 bounds: BuiltinBounds)
2188 // These are the type contents of the (opaque) interior
2189 kind_bounds_to_contents(cx, bounds, [])
2192 fn kind_bounds_to_contents(cx: &ctxt,
2193 bounds: BuiltinBounds,
2194 traits: &[Rc<TraitRef>])
2196 let _i = indenter();
2197 let mut tc = TC::All;
2198 each_inherited_builtin_bound(cx, bounds, traits, |bound| {
2199 tc = tc - match bound {
2200 BoundStatic => TC::Nonstatic,
2201 BoundSend => TC::Nonsendable,
2202 BoundSized => TC::Nonsized,
2203 BoundCopy => TC::Noncopy,
2204 BoundShare => TC::Nonsharable,
2209 // Iterates over all builtin bounds on the type parameter def, including
2210 // those inherited from traits with builtin-kind-supertraits.
2211 fn each_inherited_builtin_bound(cx: &ctxt,
2212 bounds: BuiltinBounds,
2213 traits: &[Rc<TraitRef>],
2214 f: |BuiltinBound|) {
2215 for bound in bounds.iter() {
2219 each_bound_trait_and_supertraits(cx, traits, |trait_ref| {
2220 let trait_def = lookup_trait_def(cx, trait_ref.def_id);
2221 for bound in trait_def.bounds.iter() {
2230 pub fn type_moves_by_default(cx: &ctxt, ty: t) -> bool {
2231 type_contents(cx, ty).moves_by_default(cx)
2234 // True if instantiating an instance of `r_ty` requires an instance of `r_ty`.
2235 pub fn is_instantiable(cx: &ctxt, r_ty: t) -> bool {
2236 fn type_requires(cx: &ctxt, seen: &mut Vec<DefId>,
2237 r_ty: t, ty: t) -> bool {
2238 debug!("type_requires({}, {})?",
2239 ::util::ppaux::ty_to_str(cx, r_ty),
2240 ::util::ppaux::ty_to_str(cx, ty));
2243 get(r_ty).sty == get(ty).sty ||
2244 subtypes_require(cx, seen, r_ty, ty)
2247 debug!("type_requires({}, {})? {}",
2248 ::util::ppaux::ty_to_str(cx, r_ty),
2249 ::util::ppaux::ty_to_str(cx, ty),
2254 fn subtypes_require(cx: &ctxt, seen: &mut Vec<DefId>,
2255 r_ty: t, ty: t) -> bool {
2256 debug!("subtypes_require({}, {})?",
2257 ::util::ppaux::ty_to_str(cx, r_ty),
2258 ::util::ppaux::ty_to_str(cx, ty));
2260 let r = match get(ty).sty {
2261 // fixed length vectors need special treatment compared to
2262 // normal vectors, since they don't necessarily have the
2263 // possibility to have length zero.
2264 ty_vec(_, Some(0)) => false, // don't need no contents
2265 ty_vec(mt, Some(_)) => type_requires(cx, seen, r_ty, mt.ty),
2280 ty_vec(_, None) => {
2283 ty_box(typ) | ty_uniq(typ) => {
2284 type_requires(cx, seen, r_ty, typ)
2286 ty_rptr(_, ref mt) => {
2287 type_requires(cx, seen, r_ty, mt.ty)
2291 false // unsafe ptrs can always be NULL
2298 ty_struct(ref did, _) if seen.contains(did) => {
2302 ty_struct(did, ref substs) => {
2304 let fields = struct_fields(cx, did, substs);
2305 let r = fields.iter().any(|f| type_requires(cx, seen, r_ty, f.mt.ty));
2306 seen.pop().unwrap();
2311 ts.iter().any(|t| type_requires(cx, seen, r_ty, *t))
2314 ty_enum(ref did, _) if seen.contains(did) => {
2318 ty_enum(did, ref substs) => {
2320 let vs = enum_variants(cx, did);
2321 let r = !vs.is_empty() && vs.iter().all(|variant| {
2322 variant.args.iter().any(|aty| {
2323 let sty = aty.subst(cx, substs);
2324 type_requires(cx, seen, r_ty, sty)
2327 seen.pop().unwrap();
2332 debug!("subtypes_require({}, {})? {}",
2333 ::util::ppaux::ty_to_str(cx, r_ty),
2334 ::util::ppaux::ty_to_str(cx, ty),
2340 let mut seen = Vec::new();
2341 !subtypes_require(cx, &mut seen, r_ty, r_ty)
2344 /// Describes whether a type is representable. For types that are not
2345 /// representable, 'SelfRecursive' and 'ContainsRecursive' are used to
2346 /// distinguish between types that are recursive with themselves and types that
2347 /// contain a different recursive type. These cases can therefore be treated
2348 /// differently when reporting errors.
2349 #[deriving(PartialEq)]
2350 pub enum Representability {
2356 /// Check whether a type is representable. This means it cannot contain unboxed
2357 /// structural recursion. This check is needed for structs and enums.
2358 pub fn is_type_representable(cx: &ctxt, sp: Span, ty: t) -> Representability {
2360 // Iterate until something non-representable is found
2361 fn find_nonrepresentable<It: Iterator<t>>(cx: &ctxt, sp: Span, seen: &mut Vec<DefId>,
2362 mut iter: It) -> Representability {
2364 let r = type_structurally_recursive(cx, sp, seen, ty);
2365 if r != Representable {
2372 // Does the type `ty` directly (without indirection through a pointer)
2373 // contain any types on stack `seen`?
2374 fn type_structurally_recursive(cx: &ctxt, sp: Span, seen: &mut Vec<DefId>,
2375 ty: t) -> Representability {
2376 debug!("type_structurally_recursive: {}",
2377 ::util::ppaux::ty_to_str(cx, ty));
2379 // Compare current type to previously seen types
2382 ty_enum(did, _) => {
2383 for (i, &seen_did) in seen.iter().enumerate() {
2384 if did == seen_did {
2385 return if i == 0 { SelfRecursive }
2386 else { ContainsRecursive }
2393 // Check inner types
2397 find_nonrepresentable(cx, sp, seen, ts.iter().map(|t| *t))
2399 // Fixed-length vectors.
2400 // FIXME(#11924) Behavior undecided for zero-length vectors.
2401 ty_vec(mt, Some(_)) => {
2402 type_structurally_recursive(cx, sp, seen, mt.ty)
2405 // Push struct and enum def-ids onto `seen` before recursing.
2406 ty_struct(did, ref substs) => {
2408 let fields = struct_fields(cx, did, substs);
2409 let r = find_nonrepresentable(cx, sp, seen,
2410 fields.iter().map(|f| f.mt.ty));
2414 ty_enum(did, ref substs) => {
2416 let vs = enum_variants(cx, did);
2418 let mut r = Representable;
2419 for variant in vs.iter() {
2420 let iter = variant.args.iter().map(|aty| {
2421 aty.subst_spanned(cx, substs, Some(sp))
2423 r = find_nonrepresentable(cx, sp, seen, iter);
2425 if r != Representable { break }
2436 debug!("is_type_representable: {}",
2437 ::util::ppaux::ty_to_str(cx, ty));
2439 // To avoid a stack overflow when checking an enum variant or struct that
2440 // contains a different, structurally recursive type, maintain a stack
2441 // of seen types and check recursion for each of them (issues #3008, #3779).
2442 let mut seen: Vec<DefId> = Vec::new();
2443 type_structurally_recursive(cx, sp, &mut seen, ty)
2446 pub fn type_is_trait(ty: t) -> bool {
2448 ty_uniq(ty) | ty_rptr(_, mt { ty, ..}) => match get(ty).sty {
2449 ty_trait(..) => true,
2452 ty_trait(..) => true,
2457 pub fn type_is_integral(ty: t) -> bool {
2459 ty_infer(IntVar(_)) | ty_int(_) | ty_uint(_) => true,
2464 pub fn type_is_uint(ty: t) -> bool {
2466 ty_infer(IntVar(_)) | ty_uint(ast::TyU) => true,
2471 pub fn type_is_char(ty: t) -> bool {
2478 pub fn type_is_bare_fn(ty: t) -> bool {
2480 ty_bare_fn(..) => true,
2485 pub fn type_is_fp(ty: t) -> bool {
2487 ty_infer(FloatVar(_)) | ty_float(_) => true,
2492 pub fn type_is_numeric(ty: t) -> bool {
2493 return type_is_integral(ty) || type_is_fp(ty);
2496 pub fn type_is_signed(ty: t) -> bool {
2503 pub fn type_is_machine(ty: t) -> bool {
2505 ty_int(ast::TyI) | ty_uint(ast::TyU) => false,
2506 ty_int(..) | ty_uint(..) | ty_float(..) => true,
2511 // Is the type's representation size known at compile time?
2512 #[allow(dead_code)] // leaving in for DST
2513 pub fn type_is_sized(cx: &ctxt, ty: ty::t) -> bool {
2514 type_contents(cx, ty).is_sized(cx)
2517 // Whether a type is enum like, that is an enum type with only nullary
2519 pub fn type_is_c_like_enum(cx: &ctxt, ty: t) -> bool {
2521 ty_enum(did, _) => {
2522 let variants = enum_variants(cx, did);
2523 if variants.len() == 0 {
2526 variants.iter().all(|v| v.args.len() == 0)
2533 // Returns the type and mutability of *t.
2535 // The parameter `explicit` indicates if this is an *explicit* dereference.
2536 // Some types---notably unsafe ptrs---can only be dereferenced explicitly.
2537 pub fn deref(t: t, explicit: bool) -> Option<mt> {
2539 ty_box(typ) | ty_uniq(typ) => match get(typ).sty {
2540 // Don't deref ~[] etc., might need to generalise this to all DST.
2541 ty_vec(_, None) | ty_str | ty_trait(..) => None,
2544 mutbl: ast::MutImmutable,
2547 ty_rptr(_, mt) => match get(mt.ty).sty {
2548 // Don't deref &[], might need to generalise this to all DST.
2549 ty_vec(_, None) | ty_str | ty_trait(..) => None,
2552 ty_ptr(mt) if explicit => Some(mt),
2557 // Returns the type of t[i]
2558 pub fn index(t: t) -> Option<mt> {
2560 ty_vec(mt, Some(_)) => Some(mt),
2561 ty_ptr(mt{ty: t, ..}) | ty_rptr(_, mt{ty: t, ..}) |
2562 ty_box(t) | ty_uniq(t) => match get(t).sty {
2563 ty_vec(mt, None) => Some(mt),
2564 ty_str => Some(mt {ty: mk_u8(), mutbl: ast::MutImmutable}),
2571 pub fn node_id_to_trait_ref(cx: &ctxt, id: ast::NodeId) -> Rc<ty::TraitRef> {
2572 match cx.trait_refs.borrow().find(&id) {
2573 Some(t) => t.clone(),
2574 None => cx.sess.bug(
2575 format!("node_id_to_trait_ref: no trait ref for node `{}`",
2576 cx.map.node_to_str(id)).as_slice())
2580 pub fn try_node_id_to_type(cx: &ctxt, id: ast::NodeId) -> Option<t> {
2581 cx.node_types.borrow().find_copy(&(id as uint))
2584 pub fn node_id_to_type(cx: &ctxt, id: ast::NodeId) -> t {
2585 match try_node_id_to_type(cx, id) {
2587 None => cx.sess.bug(
2588 format!("node_id_to_type: no type for node `{}`",
2589 cx.map.node_to_str(id)).as_slice())
2593 pub fn node_id_to_type_opt(cx: &ctxt, id: ast::NodeId) -> Option<t> {
2594 match cx.node_types.borrow().find(&(id as uint)) {
2595 Some(&t) => Some(t),
2600 pub fn node_id_item_substs(cx: &ctxt, id: ast::NodeId) -> ItemSubsts {
2601 match cx.item_substs.borrow().find(&id) {
2602 None => ItemSubsts::empty(),
2603 Some(ts) => ts.clone(),
2607 pub fn fn_is_variadic(fty: t) -> bool {
2608 match get(fty).sty {
2609 ty_bare_fn(ref f) => f.sig.variadic,
2610 ty_closure(ref f) => f.sig.variadic,
2612 fail!("fn_is_variadic() called on non-fn type: {:?}", s)
2617 pub fn ty_fn_sig(fty: t) -> FnSig {
2618 match get(fty).sty {
2619 ty_bare_fn(ref f) => f.sig.clone(),
2620 ty_closure(ref f) => f.sig.clone(),
2622 fail!("ty_fn_sig() called on non-fn type: {:?}", s)
2627 // Type accessors for substructures of types
2628 pub fn ty_fn_args(fty: t) -> Vec<t> {
2629 match get(fty).sty {
2630 ty_bare_fn(ref f) => f.sig.inputs.clone(),
2631 ty_closure(ref f) => f.sig.inputs.clone(),
2633 fail!("ty_fn_args() called on non-fn type: {:?}", s)
2638 pub fn ty_closure_store(fty: t) -> TraitStore {
2639 match get(fty).sty {
2640 ty_closure(ref f) => f.store,
2642 fail!("ty_closure_store() called on non-closure type: {:?}", s)
2647 pub fn ty_fn_ret(fty: t) -> t {
2648 match get(fty).sty {
2649 ty_bare_fn(ref f) => f.sig.output,
2650 ty_closure(ref f) => f.sig.output,
2652 fail!("ty_fn_ret() called on non-fn type: {:?}", s)
2657 pub fn is_fn_ty(fty: t) -> bool {
2658 match get(fty).sty {
2659 ty_bare_fn(_) => true,
2660 ty_closure(_) => true,
2665 pub fn ty_region(tcx: &ctxt,
2673 format!("ty_region() invoked on in appropriate ty: {:?}",
2679 pub fn free_region_from_def(free_id: ast::NodeId, def: &RegionParameterDef)
2682 ty::ReFree(ty::FreeRegion { scope_id: free_id,
2683 bound_region: ty::BrNamed(def.def_id,
2687 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
2688 // doesn't provide type parameter substitutions.
2689 pub fn pat_ty(cx: &ctxt, pat: &ast::Pat) -> t {
2690 return node_id_to_type(cx, pat.id);
2694 // Returns the type of an expression as a monotype.
2696 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
2697 // some cases, we insert `AutoAdjustment` annotations such as auto-deref or
2698 // auto-ref. The type returned by this function does not consider such
2699 // adjustments. See `expr_ty_adjusted()` instead.
2701 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
2702 // ask for the type of "id" in "id(3)", it will return "fn(&int) -> int"
2703 // instead of "fn(t) -> T with T = int".
2704 pub fn expr_ty(cx: &ctxt, expr: &ast::Expr) -> t {
2705 return node_id_to_type(cx, expr.id);
2708 pub fn expr_ty_opt(cx: &ctxt, expr: &ast::Expr) -> Option<t> {
2709 return node_id_to_type_opt(cx, expr.id);
2712 pub fn expr_ty_adjusted(cx: &ctxt, expr: &ast::Expr) -> t {
2715 * Returns the type of `expr`, considering any `AutoAdjustment`
2716 * entry recorded for that expression.
2718 * It would almost certainly be better to store the adjusted ty in with
2719 * the `AutoAdjustment`, but I opted not to do this because it would
2720 * require serializing and deserializing the type and, although that's not
2721 * hard to do, I just hate that code so much I didn't want to touch it
2722 * unless it was to fix it properly, which seemed a distraction from the
2723 * task at hand! -nmatsakis
2726 adjust_ty(cx, expr.span, expr.id, expr_ty(cx, expr),
2727 cx.adjustments.borrow().find(&expr.id),
2728 |method_call| cx.method_map.borrow().find(&method_call).map(|method| method.ty))
2731 pub fn expr_span(cx: &ctxt, id: NodeId) -> Span {
2732 match cx.map.find(id) {
2733 Some(ast_map::NodeExpr(e)) => {
2737 cx.sess.bug(format!("Node id {} is not an expr: {:?}",
2742 cx.sess.bug(format!("Node id {} is not present \
2743 in the node map", id).as_slice());
2748 pub fn local_var_name_str(cx: &ctxt, id: NodeId) -> InternedString {
2749 match cx.map.find(id) {
2750 Some(ast_map::NodeLocal(pat)) => {
2752 ast::PatIdent(_, ref path, _) => {
2753 token::get_ident(ast_util::path_to_ident(path))
2757 format!("Variable id {} maps to {:?}, not local",
2764 cx.sess.bug(format!("Variable id {} maps to {:?}, not local",
2771 pub fn adjust_ty(cx: &ctxt,
2773 expr_id: ast::NodeId,
2774 unadjusted_ty: ty::t,
2775 adjustment: Option<&AutoAdjustment>,
2776 method_type: |typeck::MethodCall| -> Option<ty::t>)
2778 /*! See `expr_ty_adjusted` */
2780 return match adjustment {
2781 Some(adjustment) => {
2783 AutoAddEnv(store) => {
2784 match ty::get(unadjusted_ty).sty {
2785 ty::ty_bare_fn(ref b) => {
2788 ty::ClosureTy {fn_style: b.fn_style,
2789 onceness: ast::Many,
2791 bounds: ty::all_builtin_bounds(),
2792 sig: b.sig.clone()})
2796 format!("add_env adjustment on non-bare-fn: \
2803 AutoDerefRef(ref adj) => {
2804 let mut adjusted_ty = unadjusted_ty;
2806 if !ty::type_is_error(adjusted_ty) {
2807 for i in range(0, adj.autoderefs) {
2808 let method_call = typeck::MethodCall::autoderef(expr_id, i);
2809 match method_type(method_call) {
2810 Some(method_ty) => {
2811 adjusted_ty = ty_fn_ret(method_ty);
2815 match deref(adjusted_ty, true) {
2816 Some(mt) => { adjusted_ty = mt.ty; }
2820 format!("the {}th autoderef failed: \
2823 ty_to_str(cx, adjusted_ty))
2831 None => adjusted_ty,
2832 Some(ref autoref) => {
2841 AutoBorrowVec(r, m) => {
2842 borrow_vec(cx, span, r, m, adjusted_ty)
2845 AutoBorrowVecRef(r, m) => {
2846 adjusted_ty = borrow_vec(cx,
2853 mutbl: ast::MutImmutable
2858 mk_ptr(cx, mt {ty: adjusted_ty, mutbl: m})
2861 AutoBorrowObj(r, m) => {
2862 borrow_obj(cx, span, r, m, adjusted_ty)
2869 AutoObject(store, bounds, def_id, ref substs) => {
2871 let tr = mk_trait(cx, def_id, substs.clone(), bounds);
2876 RegionTraitStore(r, m) => {
2886 None => unadjusted_ty
2889 fn borrow_vec(cx: &ctxt,
2893 ty: ty::t) -> ty::t {
2895 ty_uniq(t) | ty_ptr(mt{ty: t, ..}) |
2896 ty_rptr(_, mt{ty: t, ..}) => match get(t).sty {
2897 ty::ty_vec(mt, None) => ty::mk_slice(cx, r, ty::mt {ty: mt.ty, mutbl: m}),
2898 ty::ty_str => ty::mk_str_slice(cx, r, m),
2902 format!("borrow-vec associated with bad sty: {:?}",
2903 get(ty).sty).as_slice());
2906 ty_vec(mt, Some(_)) => ty::mk_slice(cx, r, ty::mt {ty: mt.ty, mutbl: m}),
2911 format!("borrow-vec associated with bad sty: {:?}",
2917 fn borrow_obj(cx: &ctxt, span: Span, r: Region,
2918 m: ast::Mutability, ty: ty::t) -> ty::t {
2920 ty_uniq(t) | ty_rptr(_, mt{ty: t, ..}) => match get(t).sty {
2921 ty_trait(box ty::TyTrait {def_id, ref substs, bounds, .. }) => {
2923 ty: ty::mk_trait(cx, def_id, substs.clone(), bounds),
2930 format!("borrow-trait-obj associated with bad sty: {:?}",
2931 get(ty).sty).as_slice());
2937 format!("borrow-trait-obj associated with bad sty: {:?}",
2945 pub fn map_region(&self, f: |Region| -> Region) -> AutoRef {
2947 ty::AutoPtr(r, m) => ty::AutoPtr(f(r), m),
2948 ty::AutoBorrowVec(r, m) => ty::AutoBorrowVec(f(r), m),
2949 ty::AutoBorrowVecRef(r, m) => ty::AutoBorrowVecRef(f(r), m),
2950 ty::AutoUnsafe(m) => ty::AutoUnsafe(m),
2951 ty::AutoBorrowObj(r, m) => ty::AutoBorrowObj(f(r), m),
2956 pub fn method_call_type_param_defs(tcx: &ctxt, origin: typeck::MethodOrigin)
2957 -> VecPerParamSpace<TypeParameterDef> {
2959 typeck::MethodStatic(did) => {
2960 ty::lookup_item_type(tcx, did).generics.types.clone()
2962 typeck::MethodParam(typeck::MethodParam{trait_id: trt_id,
2963 method_num: n_mth, ..}) |
2964 typeck::MethodObject(typeck::MethodObject{trait_id: trt_id,
2965 method_num: n_mth, ..}) => {
2966 ty::trait_method(tcx, trt_id, n_mth).generics.types.clone()
2971 pub fn resolve_expr(tcx: &ctxt, expr: &ast::Expr) -> def::Def {
2972 match tcx.def_map.borrow().find(&expr.id) {
2975 tcx.sess.span_bug(expr.span, format!(
2976 "no def-map entry for expr {:?}", expr.id).as_slice());
2981 pub fn expr_is_lval(tcx: &ctxt, e: &ast::Expr) -> bool {
2982 match expr_kind(tcx, e) {
2984 RvalueDpsExpr | RvalueDatumExpr | RvalueStmtExpr => false
2988 /// We categorize expressions into three kinds. The distinction between
2989 /// lvalue/rvalue is fundamental to the language. The distinction between the
2990 /// two kinds of rvalues is an artifact of trans which reflects how we will
2991 /// generate code for that kind of expression. See trans/expr.rs for more
3000 pub fn expr_kind(tcx: &ctxt, expr: &ast::Expr) -> ExprKind {
3001 if tcx.method_map.borrow().contains_key(&typeck::MethodCall::expr(expr.id)) {
3002 // Overloaded operations are generally calls, and hence they are
3003 // generated via DPS, but there are two exceptions:
3004 return match expr.node {
3005 // `a += b` has a unit result.
3006 ast::ExprAssignOp(..) => RvalueStmtExpr,
3008 // the deref method invoked for `*a` always yields an `&T`
3009 ast::ExprUnary(ast::UnDeref, _) => LvalueExpr,
3011 // in the general case, result could be any type, use DPS
3017 ast::ExprPath(..) => {
3018 match resolve_expr(tcx, expr) {
3019 def::DefVariant(tid, vid, _) => {
3020 let variant_info = enum_variant_with_id(tcx, tid, vid);
3021 if variant_info.args.len() > 0u {
3030 def::DefStruct(_) => {
3031 match get(expr_ty(tcx, expr)).sty {
3032 ty_bare_fn(..) => RvalueDatumExpr,
3037 // Fn pointers are just scalar values.
3038 def::DefFn(..) | def::DefStaticMethod(..) => RvalueDatumExpr,
3040 // Note: there is actually a good case to be made that
3041 // DefArg's, particularly those of immediate type, ought to
3042 // considered rvalues.
3043 def::DefStatic(..) |
3044 def::DefBinding(..) |
3047 def::DefLocal(..) => LvalueExpr,
3052 format!("uncategorized def for expr {:?}: {:?}",
3059 ast::ExprUnary(ast::UnDeref, _) |
3060 ast::ExprField(..) |
3061 ast::ExprIndex(..) => {
3066 ast::ExprMethodCall(..) |
3067 ast::ExprStruct(..) |
3070 ast::ExprMatch(..) |
3071 ast::ExprFnBlock(..) |
3073 ast::ExprBlock(..) |
3074 ast::ExprRepeat(..) |
3075 ast::ExprVstore(_, ast::ExprVstoreSlice) |
3076 ast::ExprVstore(_, ast::ExprVstoreMutSlice) |
3077 ast::ExprVec(..) => {
3081 ast::ExprLit(lit) if lit_is_str(lit) => {
3085 ast::ExprCast(..) => {
3086 match tcx.node_types.borrow().find(&(expr.id as uint)) {
3088 if type_is_trait(t) {
3095 // Technically, it should not happen that the expr is not
3096 // present within the table. However, it DOES happen
3097 // during type check, because the final types from the
3098 // expressions are not yet recorded in the tcx. At that
3099 // time, though, we are only interested in knowing lvalue
3100 // vs rvalue. It would be better to base this decision on
3101 // the AST type in cast node---but (at the time of this
3102 // writing) it's not easy to distinguish casts to traits
3103 // from other casts based on the AST. This should be
3104 // easier in the future, when casts to traits
3105 // would like @Foo, Box<Foo>, or &Foo.
3111 ast::ExprBreak(..) |
3112 ast::ExprAgain(..) |
3114 ast::ExprWhile(..) |
3116 ast::ExprAssign(..) |
3117 ast::ExprInlineAsm(..) |
3118 ast::ExprAssignOp(..) => {
3122 ast::ExprForLoop(..) => fail!("non-desugared expr_for_loop"),
3124 ast::ExprLit(_) | // Note: LitStr is carved out above
3125 ast::ExprUnary(..) |
3126 ast::ExprAddrOf(..) |
3127 ast::ExprBinary(..) |
3128 ast::ExprVstore(_, ast::ExprVstoreUniq) => {
3132 ast::ExprBox(place, _) => {
3133 // Special case `Box<T>`/`Gc<T>` for now:
3134 let definition = match tcx.def_map.borrow().find(&place.id) {
3136 None => fail!("no def for place"),
3138 let def_id = definition.def_id();
3139 if tcx.lang_items.exchange_heap() == Some(def_id) ||
3140 tcx.lang_items.managed_heap() == Some(def_id) {
3147 ast::ExprParen(ref e) => expr_kind(tcx, &**e),
3149 ast::ExprMac(..) => {
3152 "macro expression remains after expansion");
3157 pub fn stmt_node_id(s: &ast::Stmt) -> ast::NodeId {
3159 ast::StmtDecl(_, id) | StmtExpr(_, id) | StmtSemi(_, id) => {
3162 ast::StmtMac(..) => fail!("unexpanded macro in trans")
3166 pub fn field_idx_strict(tcx: &ctxt, name: ast::Name, fields: &[field])
3169 for f in fields.iter() { if f.ident.name == name { return i; } i += 1u; }
3170 tcx.sess.bug(format!(
3171 "no field named `{}` found in the list of fields `{:?}`",
3172 token::get_name(name),
3174 .map(|f| token::get_ident(f.ident).get().to_string())
3175 .collect::<Vec<String>>()).as_slice());
3178 pub fn method_idx(id: ast::Ident, meths: &[Rc<Method>]) -> Option<uint> {
3179 meths.iter().position(|m| m.ident == id)
3182 /// Returns a vector containing the indices of all type parameters that appear
3183 /// in `ty`. The vector may contain duplicates. Probably should be converted
3184 /// to a bitset or some other representation.
3185 pub fn param_tys_in_type(ty: t) -> Vec<ParamTy> {
3186 let mut rslt = Vec::new();
3198 pub fn ty_sort_str(cx: &ctxt, t: t) -> String {
3200 ty_nil | ty_bot | ty_bool | ty_char | ty_int(_) |
3201 ty_uint(_) | ty_float(_) | ty_str => {
3202 ::util::ppaux::ty_to_str(cx, t)
3205 ty_enum(id, _) => format!("enum {}", item_path_str(cx, id)),
3206 ty_box(_) => "Gc-ptr".to_string(),
3207 ty_uniq(_) => "box".to_string(),
3208 ty_vec(_, _) => "vector".to_string(),
3209 ty_ptr(_) => "*-ptr".to_string(),
3210 ty_rptr(_, _) => "&-ptr".to_string(),
3211 ty_bare_fn(_) => "extern fn".to_string(),
3212 ty_closure(_) => "fn".to_string(),
3213 ty_trait(ref inner) => {
3214 format!("trait {}", item_path_str(cx, inner.def_id))
3216 ty_struct(id, _) => {
3217 format!("struct {}", item_path_str(cx, id))
3219 ty_tup(_) => "tuple".to_string(),
3220 ty_infer(TyVar(_)) => "inferred type".to_string(),
3221 ty_infer(IntVar(_)) => "integral variable".to_string(),
3222 ty_infer(FloatVar(_)) => "floating-point variable".to_string(),
3223 ty_param(ref p) => {
3224 if p.space == subst::SelfSpace {
3227 "type parameter".to_string()
3230 ty_err => "type error".to_string(),
3234 pub fn type_err_to_str(cx: &ctxt, err: &type_err) -> String {
3237 * Explains the source of a type err in a short,
3238 * human readable way. This is meant to be placed in
3239 * parentheses after some larger message. You should
3240 * also invoke `note_and_explain_type_err()` afterwards
3241 * to present additional details, particularly when
3242 * it comes to lifetime-related errors. */
3244 fn tstore_to_closure(s: &TraitStore) -> String {
3246 &UniqTraitStore => "proc".to_string(),
3247 &RegionTraitStore(..) => "closure".to_string()
3252 terr_mismatch => "types differ".to_string(),
3253 terr_fn_style_mismatch(values) => {
3254 format!("expected {} fn but found {} fn",
3255 values.expected.to_str(),
3256 values.found.to_str())
3258 terr_abi_mismatch(values) => {
3259 format!("expected {} fn but found {} fn",
3260 values.expected.to_str(),
3261 values.found.to_str())
3263 terr_onceness_mismatch(values) => {
3264 format!("expected {} fn but found {} fn",
3265 values.expected.to_str(),
3266 values.found.to_str())
3268 terr_sigil_mismatch(values) => {
3269 format!("expected {}, found {}",
3270 tstore_to_closure(&values.expected),
3271 tstore_to_closure(&values.found))
3273 terr_mutability => "values differ in mutability".to_string(),
3274 terr_box_mutability => {
3275 "boxed values differ in mutability".to_string()
3277 terr_vec_mutability => "vectors differ in mutability".to_string(),
3278 terr_ptr_mutability => "pointers differ in mutability".to_string(),
3279 terr_ref_mutability => "references differ in mutability".to_string(),
3280 terr_ty_param_size(values) => {
3281 format!("expected a type with {} type params \
3282 but found one with {} type params",
3286 terr_tuple_size(values) => {
3287 format!("expected a tuple with {} elements \
3288 but found one with {} elements",
3292 terr_record_size(values) => {
3293 format!("expected a record with {} fields \
3294 but found one with {} fields",
3298 terr_record_mutability => {
3299 "record elements differ in mutability".to_string()
3301 terr_record_fields(values) => {
3302 format!("expected a record with field `{}` but found one \
3304 token::get_ident(values.expected),
3305 token::get_ident(values.found))
3308 "incorrect number of function parameters".to_string()
3310 terr_regions_does_not_outlive(..) => {
3311 "lifetime mismatch".to_string()
3313 terr_regions_not_same(..) => {
3314 "lifetimes are not the same".to_string()
3316 terr_regions_no_overlap(..) => {
3317 "lifetimes do not intersect".to_string()
3319 terr_regions_insufficiently_polymorphic(br, _) => {
3320 format!("expected bound lifetime parameter {}, \
3321 but found concrete lifetime",
3322 bound_region_ptr_to_str(cx, br))
3324 terr_regions_overly_polymorphic(br, _) => {
3325 format!("expected concrete lifetime, \
3326 but found bound lifetime parameter {}",
3327 bound_region_ptr_to_str(cx, br))
3329 terr_trait_stores_differ(_, ref values) => {
3330 format!("trait storage differs: expected `{}` but found `{}`",
3331 trait_store_to_str(cx, (*values).expected),
3332 trait_store_to_str(cx, (*values).found))
3334 terr_sorts(values) => {
3335 format!("expected {} but found {}",
3336 ty_sort_str(cx, values.expected),
3337 ty_sort_str(cx, values.found))
3339 terr_traits(values) => {
3340 format!("expected trait `{}` but found trait `{}`",
3341 item_path_str(cx, values.expected),
3342 item_path_str(cx, values.found))
3344 terr_builtin_bounds(values) => {
3345 if values.expected.is_empty() {
3346 format!("expected no bounds but found `{}`",
3347 values.found.user_string(cx))
3348 } else if values.found.is_empty() {
3349 format!("expected bounds `{}` but found no bounds",
3350 values.expected.user_string(cx))
3352 format!("expected bounds `{}` but found bounds `{}`",
3353 values.expected.user_string(cx),
3354 values.found.user_string(cx))
3357 terr_integer_as_char => {
3358 "expected an integral type but found `char`".to_string()
3360 terr_int_mismatch(ref values) => {
3361 format!("expected `{}` but found `{}`",
3362 values.expected.to_str(),
3363 values.found.to_str())
3365 terr_float_mismatch(ref values) => {
3366 format!("expected `{}` but found `{}`",
3367 values.expected.to_str(),
3368 values.found.to_str())
3370 terr_variadic_mismatch(ref values) => {
3371 format!("expected {} fn but found {} function",
3372 if values.expected { "variadic" } else { "non-variadic" },
3373 if values.found { "variadic" } else { "non-variadic" })
3378 pub fn note_and_explain_type_err(cx: &ctxt, err: &type_err) {
3380 terr_regions_does_not_outlive(subregion, superregion) => {
3381 note_and_explain_region(cx, "", subregion, "...");
3382 note_and_explain_region(cx, "...does not necessarily outlive ",
3385 terr_regions_not_same(region1, region2) => {
3386 note_and_explain_region(cx, "", region1, "...");
3387 note_and_explain_region(cx, "...is not the same lifetime as ",
3390 terr_regions_no_overlap(region1, region2) => {
3391 note_and_explain_region(cx, "", region1, "...");
3392 note_and_explain_region(cx, "...does not overlap ",
3395 terr_regions_insufficiently_polymorphic(_, conc_region) => {
3396 note_and_explain_region(cx,
3397 "concrete lifetime that was found is ",
3400 terr_regions_overly_polymorphic(_, conc_region) => {
3401 note_and_explain_region(cx,
3402 "expected concrete lifetime is ",
3409 pub fn provided_source(cx: &ctxt, id: ast::DefId) -> Option<ast::DefId> {
3410 cx.provided_method_sources.borrow().find(&id).map(|x| *x)
3413 pub fn provided_trait_methods(cx: &ctxt, id: ast::DefId) -> Vec<Rc<Method>> {
3415 match cx.map.find(id.node) {
3416 Some(ast_map::NodeItem(item)) => {
3418 ItemTrait(_, _, _, ref ms) => {
3419 let (_, p) = ast_util::split_trait_methods(ms.as_slice());
3420 p.iter().map(|m| method(cx, ast_util::local_def(m.id))).collect()
3423 cx.sess.bug(format!("provided_trait_methods: `{}` is \
3430 cx.sess.bug(format!("provided_trait_methods: `{}` is not a \
3436 csearch::get_provided_trait_methods(cx, id)
3440 pub fn trait_supertraits(cx: &ctxt, id: ast::DefId) -> Rc<Vec<Rc<TraitRef>>> {
3442 match cx.supertraits.borrow().find(&id) {
3443 Some(trait_refs) => { return trait_refs.clone(); }
3444 None => {} // Continue.
3447 // Not in the cache. It had better be in the metadata, which means it
3448 // shouldn't be local.
3449 assert!(!is_local(id));
3451 // Get the supertraits out of the metadata and create the
3452 // TraitRef for each.
3453 let result = Rc::new(csearch::get_supertraits(cx, id));
3454 cx.supertraits.borrow_mut().insert(id, result.clone());
3458 pub fn trait_ref_supertraits(cx: &ctxt, trait_ref: &ty::TraitRef) -> Vec<Rc<TraitRef>> {
3459 let supertrait_refs = trait_supertraits(cx, trait_ref.def_id);
3460 supertrait_refs.iter().map(
3461 |supertrait_ref| supertrait_ref.subst(cx, &trait_ref.substs)).collect()
3464 fn lookup_locally_or_in_crate_store<V:Clone>(
3467 map: &mut DefIdMap<V>,
3468 load_external: || -> V) -> V {
3470 * Helper for looking things up in the various maps
3471 * that are populated during typeck::collect (e.g.,
3472 * `cx.methods`, `cx.tcache`, etc). All of these share
3473 * the pattern that if the id is local, it should have
3474 * been loaded into the map by the `typeck::collect` phase.
3475 * If the def-id is external, then we have to go consult
3476 * the crate loading code (and cache the result for the future).
3479 match map.find_copy(&def_id) {
3480 Some(v) => { return v; }
3484 if def_id.krate == ast::LOCAL_CRATE {
3485 fail!("No def'n found for {:?} in tcx.{}", def_id, descr);
3487 let v = load_external();
3488 map.insert(def_id, v.clone());
3492 pub fn trait_method(cx: &ctxt, trait_did: ast::DefId, idx: uint) -> Rc<Method> {
3493 let method_def_id = *ty::trait_method_def_ids(cx, trait_did).get(idx);
3494 ty::method(cx, method_def_id)
3498 pub fn trait_methods(cx: &ctxt, trait_did: ast::DefId) -> Rc<Vec<Rc<Method>>> {
3499 let mut trait_methods = cx.trait_methods_cache.borrow_mut();
3500 match trait_methods.find_copy(&trait_did) {
3501 Some(methods) => methods,
3503 let def_ids = ty::trait_method_def_ids(cx, trait_did);
3504 let methods: Rc<Vec<Rc<Method>>> = Rc::new(def_ids.iter().map(|d| {
3507 trait_methods.insert(trait_did, methods.clone());
3513 pub fn method(cx: &ctxt, id: ast::DefId) -> Rc<Method> {
3514 lookup_locally_or_in_crate_store("methods", id,
3515 &mut *cx.methods.borrow_mut(), || {
3516 Rc::new(csearch::get_method(cx, id))
3520 pub fn trait_method_def_ids(cx: &ctxt, id: ast::DefId) -> Rc<Vec<DefId>> {
3521 lookup_locally_or_in_crate_store("trait_method_def_ids",
3523 &mut *cx.trait_method_def_ids.borrow_mut(),
3525 Rc::new(csearch::get_trait_method_def_ids(&cx.sess.cstore, id))
3529 pub fn impl_trait_ref(cx: &ctxt, id: ast::DefId) -> Option<Rc<TraitRef>> {
3530 match cx.impl_trait_cache.borrow().find(&id) {
3531 Some(ret) => { return ret.clone(); }
3535 let ret = if id.krate == ast::LOCAL_CRATE {
3536 debug!("(impl_trait_ref) searching for trait impl {:?}", id);
3537 match cx.map.find(id.node) {
3538 Some(ast_map::NodeItem(item)) => {
3540 ast::ItemImpl(_, ref opt_trait, _, _) => {
3543 Some(ty::node_id_to_trait_ref(cx, t.ref_id))
3554 csearch::get_impl_trait(cx, id)
3557 cx.impl_trait_cache.borrow_mut().insert(id, ret.clone());
3561 pub fn trait_ref_to_def_id(tcx: &ctxt, tr: &ast::TraitRef) -> ast::DefId {
3562 let def = *tcx.def_map.borrow()
3564 .expect("no def-map entry for trait");
3568 pub fn try_add_builtin_trait(tcx: &ctxt,
3569 trait_def_id: ast::DefId,
3570 builtin_bounds: &mut BuiltinBounds) -> bool {
3571 //! Checks whether `trait_ref` refers to one of the builtin
3572 //! traits, like `Send`, and adds the corresponding
3573 //! bound to the set `builtin_bounds` if so. Returns true if `trait_ref`
3574 //! is a builtin trait.
3576 match tcx.lang_items.to_builtin_kind(trait_def_id) {
3577 Some(bound) => { builtin_bounds.add(bound); true }
3582 pub fn ty_to_def_id(ty: t) -> Option<ast::DefId> {
3584 ty_trait(box TyTrait { def_id: id, .. }) |
3586 ty_enum(id, _) => Some(id),
3593 pub struct VariantInfo {
3595 pub arg_names: Option<Vec<ast::Ident> >,
3597 pub name: ast::Ident,
3605 /// Creates a new VariantInfo from the corresponding ast representation.
3607 /// Does not do any caching of the value in the type context.
3608 pub fn from_ast_variant(cx: &ctxt,
3609 ast_variant: &ast::Variant,
3610 discriminant: Disr) -> VariantInfo {
3611 let ctor_ty = node_id_to_type(cx, ast_variant.node.id);
3613 match ast_variant.node.kind {
3614 ast::TupleVariantKind(ref args) => {
3615 let arg_tys = if args.len() > 0 {
3616 ty_fn_args(ctor_ty).iter().map(|a| *a).collect()
3621 return VariantInfo {
3625 name: ast_variant.node.name,
3626 id: ast_util::local_def(ast_variant.node.id),
3627 disr_val: discriminant,
3628 vis: ast_variant.node.vis
3631 ast::StructVariantKind(ref struct_def) => {
3633 let fields: &[StructField] = struct_def.fields.as_slice();
3635 assert!(fields.len() > 0);
3637 let arg_tys = ty_fn_args(ctor_ty).iter().map(|a| *a).collect();
3638 let arg_names = fields.iter().map(|field| {
3639 match field.node.kind {
3640 NamedField(ident, _) => ident,
3641 UnnamedField(..) => cx.sess.bug(
3642 "enum_variants: all fields in struct must have a name")
3646 return VariantInfo {
3648 arg_names: Some(arg_names),
3650 name: ast_variant.node.name,
3651 id: ast_util::local_def(ast_variant.node.id),
3652 disr_val: discriminant,
3653 vis: ast_variant.node.vis
3660 pub fn substd_enum_variants(cx: &ctxt,
3663 -> Vec<Rc<VariantInfo>> {
3664 enum_variants(cx, id).iter().map(|variant_info| {
3665 let substd_args = variant_info.args.iter()
3666 .map(|aty| aty.subst(cx, substs)).collect();
3668 let substd_ctor_ty = variant_info.ctor_ty.subst(cx, substs);
3670 Rc::new(VariantInfo {
3672 ctor_ty: substd_ctor_ty,
3673 ..(**variant_info).clone()
3678 pub fn item_path_str(cx: &ctxt, id: ast::DefId) -> String {
3679 with_path(cx, id, |path| ast_map::path_to_str(path)).to_string()
3684 TraitDtor(DefId, bool)
3688 pub fn is_not_present(&self) -> bool {
3695 pub fn is_present(&self) -> bool {
3696 !self.is_not_present()
3699 pub fn has_drop_flag(&self) -> bool {
3702 &TraitDtor(_, flag) => flag
3707 /* If struct_id names a struct with a dtor, return Some(the dtor's id).
3708 Otherwise return none. */
3709 pub fn ty_dtor(cx: &ctxt, struct_id: DefId) -> DtorKind {
3710 match cx.destructor_for_type.borrow().find(&struct_id) {
3711 Some(&method_def_id) => {
3712 let flag = !has_attr(cx, struct_id, "unsafe_no_drop_flag");
3714 TraitDtor(method_def_id, flag)
3720 pub fn has_dtor(cx: &ctxt, struct_id: DefId) -> bool {
3721 ty_dtor(cx, struct_id).is_present()
3724 pub fn with_path<T>(cx: &ctxt, id: ast::DefId, f: |ast_map::PathElems| -> T) -> T {
3725 if id.krate == ast::LOCAL_CRATE {
3726 cx.map.with_path(id.node, f)
3728 f(ast_map::Values(csearch::get_item_path(cx, id).iter()).chain(None))
3732 pub fn enum_is_univariant(cx: &ctxt, id: ast::DefId) -> bool {
3733 enum_variants(cx, id).len() == 1
3736 pub fn type_is_empty(cx: &ctxt, t: t) -> bool {
3737 match ty::get(t).sty {
3738 ty_enum(did, _) => (*enum_variants(cx, did)).is_empty(),
3743 pub fn enum_variants(cx: &ctxt, id: ast::DefId) -> Rc<Vec<Rc<VariantInfo>>> {
3744 match cx.enum_var_cache.borrow().find(&id) {
3745 Some(variants) => return variants.clone(),
3746 _ => { /* fallthrough */ }
3749 let result = if ast::LOCAL_CRATE != id.krate {
3750 Rc::new(csearch::get_enum_variants(cx, id))
3753 Although both this code and check_enum_variants in typeck/check
3754 call eval_const_expr, it should never get called twice for the same
3755 expr, since check_enum_variants also updates the enum_var_cache
3757 match cx.map.get(id.node) {
3758 ast_map::NodeItem(item) => {
3760 ast::ItemEnum(ref enum_definition, _) => {
3761 let mut last_discriminant: Option<Disr> = None;
3762 Rc::new(enum_definition.variants.iter().map(|&variant| {
3764 let mut discriminant = match last_discriminant {
3765 Some(val) => val + 1,
3766 None => INITIAL_DISCRIMINANT_VALUE
3769 match variant.node.disr_expr {
3770 Some(ref e) => match const_eval::eval_const_expr_partial(cx, &**e) {
3771 Ok(const_eval::const_int(val)) => {
3772 discriminant = val as Disr
3774 Ok(const_eval::const_uint(val)) => {
3775 discriminant = val as Disr
3780 "expected signed integer constant");
3785 format!("expected constant: {}",
3792 last_discriminant = Some(discriminant);
3793 Rc::new(VariantInfo::from_ast_variant(cx, &*variant,
3798 cx.sess.bug("enum_variants: id not bound to an enum")
3802 _ => cx.sess.bug("enum_variants: id not bound to an enum")
3806 cx.enum_var_cache.borrow_mut().insert(id, result.clone());
3811 // Returns information about the enum variant with the given ID:
3812 pub fn enum_variant_with_id(cx: &ctxt,
3813 enum_id: ast::DefId,
3814 variant_id: ast::DefId)
3815 -> Rc<VariantInfo> {
3816 enum_variants(cx, enum_id).iter()
3817 .find(|variant| variant.id == variant_id)
3818 .expect("enum_variant_with_id(): no variant exists with that ID")
3823 // If the given item is in an external crate, looks up its type and adds it to
3824 // the type cache. Returns the type parameters and type.
3825 pub fn lookup_item_type(cx: &ctxt,
3828 lookup_locally_or_in_crate_store(
3829 "tcache", did, &mut *cx.tcache.borrow_mut(),
3830 || csearch::get_type(cx, did))
3833 pub fn lookup_impl_vtables(cx: &ctxt,
3835 -> typeck::vtable_res {
3836 lookup_locally_or_in_crate_store(
3837 "impl_vtables", did, &mut *cx.impl_vtables.borrow_mut(),
3838 || csearch::get_impl_vtables(cx, did) )
3841 /// Given the did of a trait, returns its canonical trait ref.
3842 pub fn lookup_trait_def(cx: &ctxt, did: ast::DefId) -> Rc<ty::TraitDef> {
3843 let mut trait_defs = cx.trait_defs.borrow_mut();
3844 match trait_defs.find_copy(&did) {
3845 Some(trait_def) => {
3846 // The item is in this crate. The caller should have added it to the
3847 // type cache already
3851 assert!(did.krate != ast::LOCAL_CRATE);
3852 let trait_def = Rc::new(csearch::get_trait_def(cx, did));
3853 trait_defs.insert(did, trait_def.clone());
3859 /// Iterate over attributes of a definition.
3860 // (This should really be an iterator, but that would require csearch and
3861 // decoder to use iterators instead of higher-order functions.)
3862 pub fn each_attr(tcx: &ctxt, did: DefId, f: |&ast::Attribute| -> bool) -> bool {
3864 let item = tcx.map.expect_item(did.node);
3865 item.attrs.iter().advance(|attr| f(attr))
3867 info!("getting foreign attrs");
3868 let mut cont = true;
3869 csearch::get_item_attrs(&tcx.sess.cstore, did, |attrs| {
3871 cont = attrs.iter().advance(|attr| f(attr));
3879 /// Determine whether an item is annotated with an attribute
3880 pub fn has_attr(tcx: &ctxt, did: DefId, attr: &str) -> bool {
3881 let mut found = false;
3882 each_attr(tcx, did, |item| {
3883 if item.check_name(attr) {
3893 /// Determine whether an item is annotated with `#[packed]`
3894 pub fn lookup_packed(tcx: &ctxt, did: DefId) -> bool {
3895 has_attr(tcx, did, "packed")
3898 /// Determine whether an item is annotated with `#[simd]`
3899 pub fn lookup_simd(tcx: &ctxt, did: DefId) -> bool {
3900 has_attr(tcx, did, "simd")
3903 // Obtain the representation annotation for a definition.
3904 pub fn lookup_repr_hint(tcx: &ctxt, did: DefId) -> attr::ReprAttr {
3905 let mut acc = attr::ReprAny;
3906 ty::each_attr(tcx, did, |meta| {
3907 acc = attr::find_repr_attr(tcx.sess.diagnostic(), meta, acc);
3913 // Look up a field ID, whether or not it's local
3914 // Takes a list of type substs in case the struct is generic
3915 pub fn lookup_field_type(tcx: &ctxt,
3920 let t = if id.krate == ast::LOCAL_CRATE {
3921 node_id_to_type(tcx, id.node)
3923 let mut tcache = tcx.tcache.borrow_mut();
3924 match tcache.find(&id) {
3925 Some(&Polytype {ty, ..}) => ty,
3927 let tpt = csearch::get_field_type(tcx, struct_id, id);
3928 tcache.insert(id, tpt.clone());
3933 t.subst(tcx, substs)
3936 // Lookup all ancestor structs of a struct indicated by did. That is the reflexive,
3937 // transitive closure of doing a single lookup in cx.superstructs.
3938 fn each_super_struct(cx: &ctxt, mut did: ast::DefId, f: |ast::DefId|) {
3939 let superstructs = cx.superstructs.borrow();
3943 match superstructs.find(&did) {
3944 Some(&Some(def_id)) => {
3947 Some(&None) => break,
3950 format!("ID not mapped to super-struct: {}",
3951 cx.map.node_to_str(did.node)).as_slice());
3957 // Look up the list of field names and IDs for a given struct.
3958 // Fails if the id is not bound to a struct.
3959 pub fn lookup_struct_fields(cx: &ctxt, did: ast::DefId) -> Vec<field_ty> {
3960 if did.krate == ast::LOCAL_CRATE {
3961 // We store the fields which are syntactically in each struct in cx. So
3962 // we have to walk the inheritance chain of the struct to get all the
3963 // structs (explicit and inherited) for a struct. If this is expensive
3964 // we could cache the whole list of fields here.
3965 let struct_fields = cx.struct_fields.borrow();
3966 let mut results: SmallVector<&[field_ty]> = SmallVector::zero();
3967 each_super_struct(cx, did, |s| {
3968 match struct_fields.find(&s) {
3969 Some(fields) => results.push(fields.as_slice()),
3972 format!("ID not mapped to struct fields: {}",
3973 cx.map.node_to_str(did.node)).as_slice());
3978 let len = results.as_slice().iter().map(|x| x.len()).sum();
3979 let mut result: Vec<field_ty> = Vec::with_capacity(len);
3980 result.extend(results.as_slice().iter().flat_map(|rs| rs.iter().map(|&f| f)));
3981 assert!(result.len() == len);
3984 csearch::get_struct_fields(&cx.sess.cstore, did)
3988 pub fn lookup_struct_field(cx: &ctxt,
3990 field_id: ast::DefId)
3992 let r = lookup_struct_fields(cx, parent);
3993 match r.iter().find(|f| f.id.node == field_id.node) {
3995 None => cx.sess.bug("struct ID not found in parent's fields")
3999 // Returns a list of fields corresponding to the struct's items. trans uses
4000 // this. Takes a list of substs with which to instantiate field types.
4001 pub fn struct_fields(cx: &ctxt, did: ast::DefId, substs: &Substs)
4003 lookup_struct_fields(cx, did).iter().map(|f| {
4005 // FIXME #6993: change type of field to Name and get rid of new()
4006 ident: ast::Ident::new(f.name),
4008 ty: lookup_field_type(cx, did, f.id, substs),
4015 pub fn is_binopable(cx: &ctxt, ty: t, op: ast::BinOp) -> bool {
4016 static tycat_other: int = 0;
4017 static tycat_bool: int = 1;
4018 static tycat_char: int = 2;
4019 static tycat_int: int = 3;
4020 static tycat_float: int = 4;
4021 static tycat_bot: int = 5;
4022 static tycat_raw_ptr: int = 6;
4024 static opcat_add: int = 0;
4025 static opcat_sub: int = 1;
4026 static opcat_mult: int = 2;
4027 static opcat_shift: int = 3;
4028 static opcat_rel: int = 4;
4029 static opcat_eq: int = 5;
4030 static opcat_bit: int = 6;
4031 static opcat_logic: int = 7;
4032 static opcat_mod: int = 8;
4034 fn opcat(op: ast::BinOp) -> int {
4036 ast::BiAdd => opcat_add,
4037 ast::BiSub => opcat_sub,
4038 ast::BiMul => opcat_mult,
4039 ast::BiDiv => opcat_mult,
4040 ast::BiRem => opcat_mod,
4041 ast::BiAnd => opcat_logic,
4042 ast::BiOr => opcat_logic,
4043 ast::BiBitXor => opcat_bit,
4044 ast::BiBitAnd => opcat_bit,
4045 ast::BiBitOr => opcat_bit,
4046 ast::BiShl => opcat_shift,
4047 ast::BiShr => opcat_shift,
4048 ast::BiEq => opcat_eq,
4049 ast::BiNe => opcat_eq,
4050 ast::BiLt => opcat_rel,
4051 ast::BiLe => opcat_rel,
4052 ast::BiGe => opcat_rel,
4053 ast::BiGt => opcat_rel
4057 fn tycat(cx: &ctxt, ty: t) -> int {
4058 if type_is_simd(cx, ty) {
4059 return tycat(cx, simd_type(cx, ty))
4062 ty_char => tycat_char,
4063 ty_bool => tycat_bool,
4064 ty_int(_) | ty_uint(_) | ty_infer(IntVar(_)) => tycat_int,
4065 ty_float(_) | ty_infer(FloatVar(_)) => tycat_float,
4066 ty_bot => tycat_bot,
4067 ty_ptr(_) => tycat_raw_ptr,
4072 static t: bool = true;
4073 static f: bool = false;
4076 // +, -, *, shift, rel, ==, bit, logic, mod
4077 /*other*/ [f, f, f, f, f, f, f, f, f],
4078 /*bool*/ [f, f, f, f, t, t, t, t, f],
4079 /*char*/ [f, f, f, f, t, t, f, f, f],
4080 /*int*/ [t, t, t, t, t, t, t, f, t],
4081 /*float*/ [t, t, t, f, t, t, f, f, f],
4082 /*bot*/ [t, t, t, t, t, t, t, t, t],
4083 /*raw ptr*/ [f, f, f, f, t, t, f, f, f]];
4085 return tbl[tycat(cx, ty) as uint ][opcat(op) as uint];
4088 /// Returns an equivalent type with all the typedefs and self regions removed.
4089 pub fn normalize_ty(cx: &ctxt, t: t) -> t {
4090 let u = TypeNormalizer(cx).fold_ty(t);
4093 struct TypeNormalizer<'a>(&'a ctxt);
4095 impl<'a> TypeFolder for TypeNormalizer<'a> {
4096 fn tcx<'a>(&'a self) -> &'a ctxt { let TypeNormalizer(c) = *self; c }
4098 fn fold_ty(&mut self, t: ty::t) -> ty::t {
4099 match self.tcx().normalized_cache.borrow().find_copy(&t) {
4104 let t_norm = ty_fold::super_fold_ty(self, t);
4105 self.tcx().normalized_cache.borrow_mut().insert(t, t_norm);
4109 fn fold_region(&mut self, _: ty::Region) -> ty::Region {
4113 fn fold_substs(&mut self,
4114 substs: &subst::Substs)
4116 subst::Substs { regions: subst::ErasedRegions,
4117 types: substs.types.fold_with(self) }
4120 fn fold_sig(&mut self,
4123 // The binder-id is only relevant to bound regions, which
4124 // are erased at trans time.
4126 binder_id: ast::DUMMY_NODE_ID,
4127 inputs: sig.inputs.fold_with(self),
4128 output: sig.output.fold_with(self),
4129 variadic: sig.variadic,
4135 pub trait ExprTyProvider {
4136 fn expr_ty(&self, ex: &ast::Expr) -> t;
4137 fn ty_ctxt<'a>(&'a self) -> &'a ctxt;
4140 impl ExprTyProvider for ctxt {
4141 fn expr_ty(&self, ex: &ast::Expr) -> t {
4145 fn ty_ctxt<'a>(&'a self) -> &'a ctxt {
4150 // Returns the repeat count for a repeating vector expression.
4151 pub fn eval_repeat_count<T: ExprTyProvider>(tcx: &T, count_expr: &ast::Expr) -> uint {
4152 match const_eval::eval_const_expr_partial(tcx, count_expr) {
4153 Ok(ref const_val) => match *const_val {
4154 const_eval::const_int(count) => if count < 0 {
4155 tcx.ty_ctxt().sess.span_err(count_expr.span,
4156 "expected positive integer for \
4157 repeat count but found negative integer");
4160 return count as uint
4162 const_eval::const_uint(count) => return count as uint,
4163 const_eval::const_float(count) => {
4164 tcx.ty_ctxt().sess.span_err(count_expr.span,
4165 "expected positive integer for \
4166 repeat count but found float");
4167 return count as uint;
4169 const_eval::const_str(_) => {
4170 tcx.ty_ctxt().sess.span_err(count_expr.span,
4171 "expected positive integer for \
4172 repeat count but found string");
4175 const_eval::const_bool(_) => {
4176 tcx.ty_ctxt().sess.span_err(count_expr.span,
4177 "expected positive integer for \
4178 repeat count but found boolean");
4181 const_eval::const_binary(_) => {
4182 tcx.ty_ctxt().sess.span_err(count_expr.span,
4183 "expected positive integer for \
4184 repeat count but found binary array");
4189 tcx.ty_ctxt().sess.span_err(count_expr.span,
4190 "expected constant integer for repeat count \
4191 but found variable");
4197 // Iterate over a type parameter's bounded traits and any supertraits
4198 // of those traits, ignoring kinds.
4199 // Here, the supertraits are the transitive closure of the supertrait
4200 // relation on the supertraits from each bounded trait's constraint
4202 pub fn each_bound_trait_and_supertraits(tcx: &ctxt,
4203 bounds: &[Rc<TraitRef>],
4204 f: |Rc<TraitRef>| -> bool)
4206 for bound_trait_ref in bounds.iter() {
4207 let mut supertrait_set = HashMap::new();
4208 let mut trait_refs = Vec::new();
4211 // Seed the worklist with the trait from the bound
4212 supertrait_set.insert(bound_trait_ref.def_id, ());
4213 trait_refs.push(bound_trait_ref.clone());
4215 // Add the given trait ty to the hash map
4216 while i < trait_refs.len() {
4217 debug!("each_bound_trait_and_supertraits(i={:?}, trait_ref={})",
4218 i, trait_refs.get(i).repr(tcx));
4220 if !f(trait_refs.get(i).clone()) {
4224 // Add supertraits to supertrait_set
4225 let supertrait_refs = trait_ref_supertraits(tcx,
4226 &**trait_refs.get(i));
4227 for supertrait_ref in supertrait_refs.iter() {
4228 debug!("each_bound_trait_and_supertraits(supertrait_ref={})",
4229 supertrait_ref.repr(tcx));
4231 let d_id = supertrait_ref.def_id;
4232 if !supertrait_set.contains_key(&d_id) {
4233 // FIXME(#5527) Could have same trait multiple times
4234 supertrait_set.insert(d_id, ());
4235 trait_refs.push(supertrait_ref.clone());
4245 pub fn get_tydesc_ty(tcx: &ctxt) -> Result<t, String> {
4246 tcx.lang_items.require(TyDescStructLangItem).map(|tydesc_lang_item| {
4247 tcx.intrinsic_defs.borrow().find_copy(&tydesc_lang_item)
4248 .expect("Failed to resolve TyDesc")
4252 pub fn get_opaque_ty(tcx: &ctxt) -> Result<t, String> {
4253 tcx.lang_items.require(OpaqueStructLangItem).map(|opaque_lang_item| {
4254 tcx.intrinsic_defs.borrow().find_copy(&opaque_lang_item)
4255 .expect("Failed to resolve Opaque")
4259 pub fn visitor_object_ty(tcx: &ctxt,
4260 region: ty::Region) -> Result<(Rc<TraitRef>, t), String> {
4261 let trait_lang_item = match tcx.lang_items.require(TyVisitorTraitLangItem) {
4263 Err(s) => { return Err(s); }
4265 let substs = Substs::empty();
4266 let trait_ref = Rc::new(TraitRef { def_id: trait_lang_item, substs: substs });
4267 Ok((trait_ref.clone(),
4268 mk_rptr(tcx, region, mt {mutbl: ast::MutMutable,
4271 trait_ref.substs.clone(),
4272 empty_builtin_bounds()) })))
4275 pub fn item_variances(tcx: &ctxt, item_id: ast::DefId) -> Rc<ItemVariances> {
4276 lookup_locally_or_in_crate_store(
4277 "item_variance_map", item_id, &mut *tcx.item_variance_map.borrow_mut(),
4278 || Rc::new(csearch::get_item_variances(&tcx.sess.cstore, item_id)))
4281 /// Records a trait-to-implementation mapping.
4282 pub fn record_trait_implementation(tcx: &ctxt,
4283 trait_def_id: DefId,
4284 impl_def_id: DefId) {
4285 match tcx.trait_impls.borrow().find(&trait_def_id) {
4286 Some(impls_for_trait) => {
4287 impls_for_trait.borrow_mut().push(impl_def_id);
4292 tcx.trait_impls.borrow_mut().insert(trait_def_id, Rc::new(RefCell::new(vec!(impl_def_id))));
4295 /// Populates the type context with all the implementations for the given type
4297 pub fn populate_implementations_for_type_if_necessary(tcx: &ctxt,
4298 type_id: ast::DefId) {
4299 if type_id.krate == LOCAL_CRATE {
4302 if tcx.populated_external_types.borrow().contains(&type_id) {
4306 csearch::each_implementation_for_type(&tcx.sess.cstore, type_id,
4308 let methods = csearch::get_impl_methods(&tcx.sess.cstore, impl_def_id);
4310 // Record the trait->implementation mappings, if applicable.
4311 let associated_traits = csearch::get_impl_trait(tcx, impl_def_id);
4312 for trait_ref in associated_traits.iter() {
4313 record_trait_implementation(tcx, trait_ref.def_id, impl_def_id);
4316 // For any methods that use a default implementation, add them to
4317 // the map. This is a bit unfortunate.
4318 for &method_def_id in methods.iter() {
4319 for &source in ty::method(tcx, method_def_id).provided_source.iter() {
4320 tcx.provided_method_sources.borrow_mut().insert(method_def_id, source);
4324 // Store the implementation info.
4325 tcx.impl_methods.borrow_mut().insert(impl_def_id, methods);
4327 // If this is an inherent implementation, record it.
4328 if associated_traits.is_none() {
4329 match tcx.inherent_impls.borrow().find(&type_id) {
4330 Some(implementation_list) => {
4331 implementation_list.borrow_mut().push(impl_def_id);
4336 tcx.inherent_impls.borrow_mut().insert(type_id,
4337 Rc::new(RefCell::new(vec!(impl_def_id))));
4341 tcx.populated_external_types.borrow_mut().insert(type_id);
4344 /// Populates the type context with all the implementations for the given
4345 /// trait if necessary.
4346 pub fn populate_implementations_for_trait_if_necessary(
4348 trait_id: ast::DefId) {
4349 if trait_id.krate == LOCAL_CRATE {
4352 if tcx.populated_external_traits.borrow().contains(&trait_id) {
4356 csearch::each_implementation_for_trait(&tcx.sess.cstore, trait_id,
4357 |implementation_def_id| {
4358 let methods = csearch::get_impl_methods(&tcx.sess.cstore, implementation_def_id);
4360 // Record the trait->implementation mapping.
4361 record_trait_implementation(tcx, trait_id, implementation_def_id);
4363 // For any methods that use a default implementation, add them to
4364 // the map. This is a bit unfortunate.
4365 for &method_def_id in methods.iter() {
4366 for &source in ty::method(tcx, method_def_id).provided_source.iter() {
4367 tcx.provided_method_sources.borrow_mut().insert(method_def_id, source);
4371 // Store the implementation info.
4372 tcx.impl_methods.borrow_mut().insert(implementation_def_id, methods);
4375 tcx.populated_external_traits.borrow_mut().insert(trait_id);
4378 /// Given the def_id of an impl, return the def_id of the trait it implements.
4379 /// If it implements no trait, return `None`.
4380 pub fn trait_id_of_impl(tcx: &ctxt,
4381 def_id: ast::DefId) -> Option<ast::DefId> {
4382 let node = match tcx.map.find(def_id.node) {
4387 ast_map::NodeItem(item) => {
4389 ast::ItemImpl(_, Some(ref trait_ref), _, _) => {
4390 Some(node_id_to_trait_ref(tcx, trait_ref.ref_id).def_id)
4399 /// If the given def ID describes a method belonging to an impl, return the
4400 /// ID of the impl that the method belongs to. Otherwise, return `None`.
4401 pub fn impl_of_method(tcx: &ctxt, def_id: ast::DefId)
4402 -> Option<ast::DefId> {
4403 if def_id.krate != LOCAL_CRATE {
4404 return match csearch::get_method(tcx, def_id).container {
4405 TraitContainer(_) => None,
4406 ImplContainer(def_id) => Some(def_id),
4409 match tcx.methods.borrow().find_copy(&def_id) {
4411 match method.container {
4412 TraitContainer(_) => None,
4413 ImplContainer(def_id) => Some(def_id),
4420 /// If the given def ID describes a method belonging to a trait (either a
4421 /// default method or an implementation of a trait method), return the ID of
4422 /// the trait that the method belongs to. Otherwise, return `None`.
4423 pub fn trait_of_method(tcx: &ctxt, def_id: ast::DefId)
4424 -> Option<ast::DefId> {
4425 if def_id.krate != LOCAL_CRATE {
4426 return csearch::get_trait_of_method(&tcx.sess.cstore, def_id, tcx);
4428 match tcx.methods.borrow().find_copy(&def_id) {
4430 match method.container {
4431 TraitContainer(def_id) => Some(def_id),
4432 ImplContainer(def_id) => trait_id_of_impl(tcx, def_id),
4439 /// If the given def ID describes a method belonging to a trait, (either a
4440 /// default method or an implementation of a trait method), return the ID of
4441 /// the method inside trait definition (this means that if the given def ID
4442 /// is already that of the original trait method, then the return value is
4444 /// Otherwise, return `None`.
4445 pub fn trait_method_of_method(tcx: &ctxt,
4446 def_id: ast::DefId) -> Option<ast::DefId> {
4447 let method = match tcx.methods.borrow().find(&def_id) {
4448 Some(m) => m.clone(),
4449 None => return None,
4451 let name = method.ident.name;
4452 match trait_of_method(tcx, def_id) {
4453 Some(trait_did) => {
4454 let trait_methods = ty::trait_methods(tcx, trait_did);
4455 trait_methods.iter()
4456 .position(|m| m.ident.name == name)
4457 .map(|idx| ty::trait_method(tcx, trait_did, idx).def_id)
4463 /// Creates a hash of the type `t` which will be the same no matter what crate
4464 /// context it's calculated within. This is used by the `type_id` intrinsic.
4465 pub fn hash_crate_independent(tcx: &ctxt, t: t, svh: &Svh) -> u64 {
4466 let mut state = sip::SipState::new();
4467 macro_rules! byte( ($b:expr) => { ($b as u8).hash(&mut state) } );
4468 macro_rules! hash( ($e:expr) => { $e.hash(&mut state) } );
4470 let region = |_state: &mut sip::SipState, r: Region| {
4480 tcx.sess.bug("non-static region found when hashing a type")
4484 let did = |state: &mut sip::SipState, did: DefId| {
4485 let h = if ast_util::is_local(did) {
4488 tcx.sess.cstore.get_crate_hash(did.krate)
4490 h.as_str().hash(state);
4491 did.node.hash(state);
4493 let mt = |state: &mut sip::SipState, mt: mt| {
4494 mt.mutbl.hash(state);
4496 ty::walk_ty(t, |t| {
4497 match ty::get(t).sty {
4500 ty_bool => byte!(2),
4501 ty_char => byte!(3),
4527 ty_vec(m, Some(n)) => {
4531 1u8.hash(&mut state);
4533 ty_vec(m, None) => {
4536 0u8.hash(&mut state);
4544 region(&mut state, r);
4547 ty_bare_fn(ref b) => {
4552 ty_closure(ref c) => {
4558 UniqTraitStore => byte!(0),
4559 RegionTraitStore(r, m) => {
4561 region(&mut state, r);
4562 assert_eq!(m, ast::MutMutable);
4566 ty_trait(box ty::TyTrait { def_id: d, bounds, .. }) => {
4571 ty_struct(d, _) => {
4575 ty_tup(ref inner) => {
4582 did(&mut state, p.def_id);
4584 ty_infer(_) => unreachable!(),
4585 ty_err => byte!(23),
4593 pub fn to_str(self) -> &'static str {
4596 Contravariant => "-",
4603 pub fn construct_parameter_environment(
4605 generics: &ty::Generics,
4606 free_id: ast::NodeId)
4607 -> ParameterEnvironment
4609 /*! See `ParameterEnvironment` struct def'n for details */
4612 // Construct the free substs.
4616 let mut types = VecPerParamSpace::empty();
4617 for &space in subst::ParamSpace::all().iter() {
4618 push_types_from_defs(tcx, &mut types, space,
4619 generics.types.get_vec(space));
4622 // map bound 'a => free 'a
4623 let mut regions = VecPerParamSpace::empty();
4624 for &space in subst::ParamSpace::all().iter() {
4625 push_region_params(&mut regions, space, free_id,
4626 generics.regions.get_vec(space));
4629 let free_substs = Substs {
4631 regions: subst::NonerasedRegions(regions)
4635 // Compute the bounds on Self and the type parameters.
4638 let mut bounds = VecPerParamSpace::empty();
4639 for &space in subst::ParamSpace::all().iter() {
4640 push_bounds_from_defs(tcx, &mut bounds, space, &free_substs,
4641 generics.types.get_vec(space));
4644 debug!("construct_parameter_environment: free_id={} \
4648 free_substs.repr(tcx),
4651 return ty::ParameterEnvironment {
4652 free_substs: free_substs,
4656 fn push_region_params(regions: &mut VecPerParamSpace<ty::Region>,
4657 space: subst::ParamSpace,
4658 free_id: ast::NodeId,
4659 region_params: &Vec<RegionParameterDef>)
4661 for r in region_params.iter() {
4662 regions.push(space, ty::free_region_from_def(free_id, r));
4666 fn push_types_from_defs(tcx: &ty::ctxt,
4667 types: &mut subst::VecPerParamSpace<ty::t>,
4668 space: subst::ParamSpace,
4669 defs: &Vec<TypeParameterDef>) {
4670 for (i, def) in defs.iter().enumerate() {
4671 let ty = ty::mk_param(tcx, space, i, def.def_id);
4672 types.push(space, ty);
4676 fn push_bounds_from_defs(tcx: &ty::ctxt,
4677 bounds: &mut subst::VecPerParamSpace<ParamBounds>,
4678 space: subst::ParamSpace,
4679 free_substs: &subst::Substs,
4680 defs: &Vec<TypeParameterDef>) {
4681 for def in defs.iter() {
4682 let b = (*def.bounds).subst(tcx, free_substs);
4683 bounds.push(space, b);
4689 pub fn from_mutbl(m: ast::Mutability) -> BorrowKind {
4691 ast::MutMutable => MutBorrow,
4692 ast::MutImmutable => ImmBorrow,
4696 pub fn to_user_str(&self) -> &'static str {
4698 MutBorrow => "mutable",
4699 ImmBorrow => "immutable",
4700 UniqueImmBorrow => "uniquely immutable",
4705 impl mc::Typer for ty::ctxt {
4706 fn tcx<'a>(&'a self) -> &'a ty::ctxt {
4710 fn node_ty(&self, id: ast::NodeId) -> mc::McResult<ty::t> {
4711 Ok(ty::node_id_to_type(self, id))
4714 fn node_method_ty(&self, method_call: typeck::MethodCall) -> Option<ty::t> {
4715 self.method_map.borrow().find(&method_call).map(|method| method.ty)
4718 fn adjustments<'a>(&'a self) -> &'a RefCell<NodeMap<ty::AutoAdjustment>> {
4722 fn is_method_call(&self, id: ast::NodeId) -> bool {
4723 self.method_map.borrow().contains_key(&typeck::MethodCall::expr(id))
4726 fn temporary_scope(&self, rvalue_id: ast::NodeId) -> Option<ast::NodeId> {
4727 self.region_maps.temporary_scope(rvalue_id)
4730 fn upvar_borrow(&self, upvar_id: ty::UpvarId) -> ty::UpvarBorrow {
4731 self.upvar_borrow_map.borrow().get_copy(&upvar_id)