1 // Copyright 2012-2015 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 //! type context book-keeping
13 use dep_graph::DepGraph;
18 use hir::def::{Def, ExportMap};
19 use hir::def_id::{CrateNum, DefId, LOCAL_CRATE};
20 use hir::map as hir_map;
21 use hir::map::{DisambiguatedDefPathData, DefPathHash};
22 use middle::free_region::FreeRegionMap;
23 use middle::lang_items;
24 use middle::resolve_lifetime;
25 use middle::stability;
27 use mir::transform::Passes;
28 use ty::subst::{Kind, Substs};
31 use ty::{self, TraitRef, Ty, TypeAndMut};
32 use ty::{TyS, TypeVariants, Slice};
33 use ty::{AdtKind, AdtDef, ClosureSubsts, Region};
35 use ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
37 use ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid};
38 use ty::TypeVariants::*;
39 use ty::layout::{Layout, TargetDataLayout};
40 use ty::inhabitedness::DefIdForest;
43 use util::nodemap::{NodeMap, NodeSet, DefIdSet};
44 use util::nodemap::{FxHashMap, FxHashSet};
45 use rustc_data_structures::accumulate_vec::AccumulateVec;
47 use arena::{TypedArena, DroplessArena};
48 use rustc_data_structures::indexed_vec::IndexVec;
49 use std::borrow::Borrow;
50 use std::cell::{Cell, RefCell};
51 use std::cmp::Ordering;
52 use std::hash::{Hash, Hasher};
58 use syntax::ast::{self, Name, NodeId};
60 use syntax::symbol::{Symbol, keywords};
66 pub struct GlobalArenas<'tcx> {
68 layout: TypedArena<Layout>,
71 generics: TypedArena<ty::Generics>,
72 trait_def: TypedArena<ty::TraitDef>,
73 adt_def: TypedArena<ty::AdtDef>,
74 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
75 mir: TypedArena<Mir<'tcx>>,
76 tables: TypedArena<ty::TypeckTables<'tcx>>,
79 impl<'tcx> GlobalArenas<'tcx> {
80 pub fn new() -> GlobalArenas<'tcx> {
82 layout: TypedArena::new(),
83 generics: TypedArena::new(),
84 trait_def: TypedArena::new(),
85 adt_def: TypedArena::new(),
86 steal_mir: TypedArena::new(),
87 mir: TypedArena::new(),
88 tables: TypedArena::new(),
93 pub struct CtxtInterners<'tcx> {
94 /// The arena that types, regions, etc are allocated from
95 arena: &'tcx DroplessArena,
97 /// Specifically use a speedy hash algorithm for these hash sets,
98 /// they're accessed quite often.
99 type_: RefCell<FxHashSet<Interned<'tcx, TyS<'tcx>>>>,
100 type_list: RefCell<FxHashSet<Interned<'tcx, Slice<Ty<'tcx>>>>>,
101 substs: RefCell<FxHashSet<Interned<'tcx, Substs<'tcx>>>>,
102 region: RefCell<FxHashSet<Interned<'tcx, RegionKind>>>,
103 existential_predicates: RefCell<FxHashSet<Interned<'tcx, Slice<ExistentialPredicate<'tcx>>>>>,
104 predicates: RefCell<FxHashSet<Interned<'tcx, Slice<Predicate<'tcx>>>>>,
107 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
108 fn new(arena: &'tcx DroplessArena) -> CtxtInterners<'tcx> {
111 type_: RefCell::new(FxHashSet()),
112 type_list: RefCell::new(FxHashSet()),
113 substs: RefCell::new(FxHashSet()),
114 region: RefCell::new(FxHashSet()),
115 existential_predicates: RefCell::new(FxHashSet()),
116 predicates: RefCell::new(FxHashSet()),
120 /// Intern a type. global_interners is Some only if this is
121 /// a local interner and global_interners is its counterpart.
122 fn intern_ty(&self, st: TypeVariants<'tcx>,
123 global_interners: Option<&CtxtInterners<'gcx>>)
126 let mut interner = self.type_.borrow_mut();
127 let global_interner = global_interners.map(|interners| {
128 interners.type_.borrow_mut()
130 if let Some(&Interned(ty)) = interner.get(&st) {
133 if let Some(ref interner) = global_interner {
134 if let Some(&Interned(ty)) = interner.get(&st) {
139 let flags = super::flags::FlagComputation::for_sty(&st);
140 let ty_struct = TyS {
143 region_depth: flags.depth,
146 // HACK(eddyb) Depend on flags being accurate to
147 // determine that all contents are in the global tcx.
148 // See comments on Lift for why we can't use that.
149 if !flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
150 if let Some(interner) = global_interners {
151 let ty_struct: TyS<'gcx> = unsafe {
152 mem::transmute(ty_struct)
154 let ty: Ty<'gcx> = interner.arena.alloc(ty_struct);
155 global_interner.unwrap().insert(Interned(ty));
159 // Make sure we don't end up with inference
160 // types/regions in the global tcx.
161 if global_interners.is_none() {
163 bug!("Attempted to intern `{:?}` which contains \
164 inference types/regions in the global type context",
169 // Don't be &mut TyS.
170 let ty: Ty<'tcx> = self.arena.alloc(ty_struct);
171 interner.insert(Interned(ty));
175 debug!("Interned type: {:?} Pointer: {:?}",
176 ty, ty as *const TyS);
182 pub struct CommonTypes<'tcx> {
202 pub re_empty: Region<'tcx>,
203 pub re_static: Region<'tcx>,
204 pub re_erased: Region<'tcx>,
207 #[derive(RustcEncodable, RustcDecodable)]
208 pub struct TypeckTables<'tcx> {
209 /// Resolved definitions for `<T>::X` associated paths and
210 /// method calls, including those of overloaded operators.
211 pub type_dependent_defs: NodeMap<Def>,
213 /// Stores the types for various nodes in the AST. Note that this table
214 /// is not guaranteed to be populated until after typeck. See
215 /// typeck::check::fn_ctxt for details.
216 pub node_types: NodeMap<Ty<'tcx>>,
218 /// Stores the type parameters which were substituted to obtain the type
219 /// of this node. This only applies to nodes that refer to entities
220 /// parameterized by type parameters, such as generic fns, types, or
222 pub node_substs: NodeMap<&'tcx Substs<'tcx>>,
224 pub adjustments: NodeMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
227 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
229 /// Records the type of each closure.
230 pub closure_tys: NodeMap<ty::PolyFnSig<'tcx>>,
232 /// Records the kind of each closure and the span and name of the variable
233 /// that caused the closure to be this kind.
234 pub closure_kinds: NodeMap<(ty::ClosureKind, Option<(Span, ast::Name)>)>,
236 /// For each fn, records the "liberated" types of its arguments
237 /// and return type. Liberated means that all bound regions
238 /// (including late-bound regions) are replaced with free
239 /// equivalents. This table is not used in trans (since regions
240 /// are erased there) and hence is not serialized to metadata.
241 pub liberated_fn_sigs: NodeMap<ty::FnSig<'tcx>>,
243 /// For each FRU expression, record the normalized types of the fields
244 /// of the struct - this is needed because it is non-trivial to
245 /// normalize while preserving regions. This table is used only in
246 /// MIR construction and hence is not serialized to metadata.
247 pub fru_field_types: NodeMap<Vec<Ty<'tcx>>>,
249 /// Maps a cast expression to its kind. This is keyed on the
250 /// *from* expression of the cast, not the cast itself.
251 pub cast_kinds: NodeMap<ty::cast::CastKind>,
253 /// Lints for the body of this fn generated by typeck.
254 pub lints: lint::LintTable,
256 /// Set of trait imports actually used in the method resolution.
257 /// This is used for warning unused imports.
258 pub used_trait_imports: DefIdSet,
260 /// If any errors occurred while type-checking this body,
261 /// this field will be set to `true`.
262 pub tainted_by_errors: bool,
264 /// Stores the free-region relationships that were deduced from
265 /// its where clauses and parameter types. These are then
266 /// read-again by borrowck.
267 pub free_region_map: FreeRegionMap<'tcx>,
270 impl<'tcx> TypeckTables<'tcx> {
271 pub fn empty() -> TypeckTables<'tcx> {
273 type_dependent_defs: NodeMap(),
274 node_types: FxHashMap(),
275 node_substs: NodeMap(),
276 adjustments: NodeMap(),
277 upvar_capture_map: FxHashMap(),
278 closure_tys: NodeMap(),
279 closure_kinds: NodeMap(),
280 liberated_fn_sigs: NodeMap(),
281 fru_field_types: NodeMap(),
282 cast_kinds: NodeMap(),
283 lints: lint::LintTable::new(),
284 used_trait_imports: DefIdSet(),
285 tainted_by_errors: false,
286 free_region_map: FreeRegionMap::new(),
290 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
291 pub fn qpath_def(&self, qpath: &hir::QPath, id: NodeId) -> Def {
293 hir::QPath::Resolved(_, ref path) => path.def,
294 hir::QPath::TypeRelative(..) => {
295 self.type_dependent_defs.get(&id).cloned().unwrap_or(Def::Err)
300 pub fn node_id_to_type(&self, id: NodeId) -> Ty<'tcx> {
301 match self.node_id_to_type_opt(id) {
304 bug!("node_id_to_type: no type for node `{}`",
305 tls::with(|tcx| tcx.hir.node_to_string(id)))
310 pub fn node_id_to_type_opt(&self, id: NodeId) -> Option<Ty<'tcx>> {
311 self.node_types.get(&id).cloned()
314 pub fn node_substs(&self, id: NodeId) -> &'tcx Substs<'tcx> {
315 self.node_substs.get(&id).cloned().unwrap_or(Substs::empty())
318 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
319 // doesn't provide type parameter substitutions.
320 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
321 self.node_id_to_type(pat.id)
324 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
325 self.node_id_to_type_opt(pat.id)
328 // Returns the type of an expression as a monotype.
330 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
331 // some cases, we insert `Adjustment` annotations such as auto-deref or
332 // auto-ref. The type returned by this function does not consider such
333 // adjustments. See `expr_ty_adjusted()` instead.
335 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
336 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
337 // instead of "fn(ty) -> T with T = isize".
338 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
339 self.node_id_to_type(expr.id)
342 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
343 self.node_id_to_type_opt(expr.id)
346 pub fn expr_adjustments(&self, expr: &hir::Expr)
347 -> &[ty::adjustment::Adjustment<'tcx>] {
348 self.adjustments.get(&expr.id).map_or(&[], |a| &a[..])
351 /// Returns the type of `expr`, considering any `Adjustment`
352 /// entry recorded for that expression.
353 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
354 self.expr_adjustments(expr)
356 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
359 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
360 self.expr_adjustments(expr)
362 .map(|adj| adj.target)
363 .or_else(|| self.expr_ty_opt(expr))
366 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
367 // Only paths and method calls/overloaded operators have
368 // entries in type_dependent_defs, ignore the former here.
369 if let hir::ExprPath(_) = expr.node {
373 match self.type_dependent_defs.get(&expr.id) {
374 Some(&Def::Method(_)) => true,
379 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> Option<ty::UpvarCapture<'tcx>> {
380 Some(self.upvar_capture_map.get(&upvar_id).unwrap().clone())
384 impl<'tcx> CommonTypes<'tcx> {
385 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
386 let mk = |sty| interners.intern_ty(sty, None);
387 let mk_region = |r| {
388 if let Some(r) = interners.region.borrow().get(&r) {
391 let r = interners.arena.alloc(r);
392 interners.region.borrow_mut().insert(Interned(r));
400 isize: mk(TyInt(ast::IntTy::Is)),
401 i8: mk(TyInt(ast::IntTy::I8)),
402 i16: mk(TyInt(ast::IntTy::I16)),
403 i32: mk(TyInt(ast::IntTy::I32)),
404 i64: mk(TyInt(ast::IntTy::I64)),
405 i128: mk(TyInt(ast::IntTy::I128)),
406 usize: mk(TyUint(ast::UintTy::Us)),
407 u8: mk(TyUint(ast::UintTy::U8)),
408 u16: mk(TyUint(ast::UintTy::U16)),
409 u32: mk(TyUint(ast::UintTy::U32)),
410 u64: mk(TyUint(ast::UintTy::U64)),
411 u128: mk(TyUint(ast::UintTy::U128)),
412 f32: mk(TyFloat(ast::FloatTy::F32)),
413 f64: mk(TyFloat(ast::FloatTy::F64)),
415 re_empty: mk_region(RegionKind::ReEmpty),
416 re_static: mk_region(RegionKind::ReStatic),
417 re_erased: mk_region(RegionKind::ReErased),
422 /// The data structure to keep track of all the information that typechecker
423 /// generates so that so that it can be reused and doesn't have to be redone
425 #[derive(Copy, Clone)]
426 pub struct TyCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
427 gcx: &'a GlobalCtxt<'gcx>,
428 interners: &'a CtxtInterners<'tcx>
431 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
432 type Target = &'a GlobalCtxt<'gcx>;
433 fn deref(&self) -> &Self::Target {
438 pub struct GlobalCtxt<'tcx> {
439 global_arenas: &'tcx GlobalArenas<'tcx>,
440 global_interners: CtxtInterners<'tcx>,
442 pub sess: &'tcx Session,
444 pub specializes_cache: RefCell<traits::SpecializesCache>,
446 pub trans_trait_caches: traits::trans::TransTraitCaches<'tcx>,
448 pub dep_graph: DepGraph,
450 /// Common types, pre-interned for your convenience.
451 pub types: CommonTypes<'tcx>,
453 /// Map indicating what traits are in scope for places where this
454 /// is relevant; generated by resolve.
455 pub trait_map: TraitMap,
457 /// Export map produced by name resolution.
458 pub export_map: ExportMap,
460 pub named_region_map: resolve_lifetime::NamedRegionMap,
462 pub hir: hir_map::Map<'tcx>,
464 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
465 /// as well as all upstream crates. Only populated in incremental mode.
466 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
468 pub maps: maps::Maps<'tcx>,
470 pub mir_passes: Rc<Passes>,
472 // Records the free variables refrenced by every closure
473 // expression. Do not track deps for this, just recompute it from
474 // scratch every time.
475 pub freevars: RefCell<FreevarMap>,
477 pub maybe_unused_trait_imports: NodeSet,
479 // Internal cache for metadata decoding. No need to track deps on this.
480 pub rcache: RefCell<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
482 // FIXME dep tracking -- should be harmless enough
483 pub normalized_cache: RefCell<FxHashMap<Ty<'tcx>, Ty<'tcx>>>,
485 pub inhabitedness_cache: RefCell<FxHashMap<Ty<'tcx>, DefIdForest>>,
487 pub lang_items: middle::lang_items::LanguageItems,
489 /// Set of used unsafe nodes (functions or blocks). Unsafe nodes not
490 /// present in this set can be warned about.
491 pub used_unsafe: RefCell<NodeSet>,
493 /// Set of nodes which mark locals as mutable which end up getting used at
494 /// some point. Local variable definitions not in this set can be warned
496 pub used_mut_nodes: RefCell<NodeSet>,
498 /// Maps any item's def-id to its stability index.
499 pub stability: RefCell<stability::Index<'tcx>>,
501 /// Caches the results of trait selection. This cache is used
502 /// for things that do not have to do with the parameters in scope.
503 pub selection_cache: traits::SelectionCache<'tcx>,
505 /// Caches the results of trait evaluation. This cache is used
506 /// for things that do not have to do with the parameters in scope.
507 /// Merge this with `selection_cache`?
508 pub evaluation_cache: traits::EvaluationCache<'tcx>,
510 /// A set of predicates that have been fulfilled *somewhere*.
511 /// This is used to avoid duplicate work. Predicates are only
512 /// added to this set when they mention only "global" names
513 /// (i.e., no type or lifetime parameters).
514 pub fulfilled_predicates: RefCell<traits::GlobalFulfilledPredicates<'tcx>>,
516 /// Maps Expr NodeId's to `true` iff `&expr` can have 'static lifetime.
517 pub rvalue_promotable_to_static: RefCell<NodeMap<bool>>,
519 /// The definite name of the current crate after taking into account
520 /// attributes, commandline parameters, etc.
521 pub crate_name: Symbol,
523 /// Data layout specification for the current target.
524 pub data_layout: TargetDataLayout,
526 /// Used to prevent layout from recursing too deeply.
527 pub layout_depth: Cell<usize>,
529 /// Map from function to the `#[derive]` mode that it's defining. Only used
530 /// by `proc-macro` crates.
531 pub derive_macros: RefCell<NodeMap<Symbol>>,
533 stability_interner: RefCell<FxHashSet<&'tcx attr::Stability>>,
535 layout_interner: RefCell<FxHashSet<&'tcx Layout>>,
537 /// A vector of every trait accessible in the whole crate
538 /// (i.e. including those from subcrates). This is used only for
539 /// error reporting, and so is lazily initialised and generally
540 /// shouldn't taint the common path (hence the RefCell).
541 pub all_traits: RefCell<Option<Vec<DefId>>>,
544 impl<'tcx> GlobalCtxt<'tcx> {
545 /// Get the global TyCtxt.
546 pub fn global_tcx<'a>(&'a self) -> TyCtxt<'a, 'tcx, 'tcx> {
549 interners: &self.global_interners
554 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
555 pub fn crate_name(self, cnum: CrateNum) -> Symbol {
556 if cnum == LOCAL_CRATE {
559 self.sess.cstore.crate_name(cnum)
563 pub fn original_crate_name(self, cnum: CrateNum) -> Symbol {
564 if cnum == LOCAL_CRATE {
565 self.crate_name.clone()
567 self.sess.cstore.original_crate_name(cnum)
571 pub fn crate_disambiguator(self, cnum: CrateNum) -> Symbol {
572 if cnum == LOCAL_CRATE {
573 self.sess.local_crate_disambiguator()
575 self.sess.cstore.crate_disambiguator(cnum)
579 pub fn retrace_path(self,
581 path_data: &[DisambiguatedDefPathData])
583 debug!("retrace_path(path={:?}, krate={:?})", path_data, self.crate_name(krate));
585 if krate == LOCAL_CRATE {
589 .retrace_path(path_data)
590 .map(|def_index| DefId { krate: krate, index: def_index })
592 self.sess.cstore.retrace_path(krate, path_data)
596 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
597 self.global_arenas.generics.alloc(generics)
600 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
601 self.global_arenas.steal_mir.alloc(Steal::new(mir))
604 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
605 self.global_arenas.mir.alloc(mir)
608 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
609 self.global_arenas.tables.alloc(tables)
612 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
613 self.global_arenas.trait_def.alloc(def)
616 pub fn alloc_adt_def(self,
619 variants: Vec<ty::VariantDef>,
621 -> &'gcx ty::AdtDef {
622 let def = ty::AdtDef::new(self, did, kind, variants, repr);
623 self.global_arenas.adt_def.alloc(def)
626 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
627 if let Some(st) = self.stability_interner.borrow().get(&stab) {
631 let interned = self.global_interners.arena.alloc(stab);
632 if let Some(prev) = self.stability_interner.borrow_mut().replace(interned) {
633 bug!("Tried to overwrite interned Stability: {:?}", prev)
638 pub fn intern_layout(self, layout: Layout) -> &'gcx Layout {
639 if let Some(layout) = self.layout_interner.borrow().get(&layout) {
643 let interned = self.global_arenas.layout.alloc(layout);
644 if let Some(prev) = self.layout_interner.borrow_mut().replace(interned) {
645 bug!("Tried to overwrite interned Layout: {:?}", prev)
650 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
651 value.lift_to_tcx(self)
654 /// Like lift, but only tries in the global tcx.
655 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
656 value.lift_to_tcx(self.global_tcx())
659 /// Returns true if self is the same as self.global_tcx().
660 fn is_global(self) -> bool {
661 let local = self.interners as *const _;
662 let global = &self.global_interners as *const _;
663 local as usize == global as usize
666 /// Create a type context and call the closure with a `TyCtxt` reference
667 /// to the context. The closure enforces that the type context and any interned
668 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
669 /// reference to the context, to allow formatting values that need it.
670 pub fn create_and_enter<F, R>(s: &'tcx Session,
671 local_providers: ty::maps::Providers<'tcx>,
672 extern_providers: ty::maps::Providers<'tcx>,
673 mir_passes: Rc<Passes>,
674 arenas: &'tcx GlobalArenas<'tcx>,
675 arena: &'tcx DroplessArena,
676 resolutions: ty::Resolutions,
677 named_region_map: resolve_lifetime::NamedRegionMap,
678 hir: hir_map::Map<'tcx>,
679 lang_items: middle::lang_items::LanguageItems,
680 stability: stability::Index<'tcx>,
683 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
685 let data_layout = TargetDataLayout::parse(s);
686 let interners = CtxtInterners::new(arena);
687 let common_types = CommonTypes::new(&interners);
688 let dep_graph = hir.dep_graph.clone();
689 let fulfilled_predicates = traits::GlobalFulfilledPredicates::new(dep_graph.clone());
690 let max_cnum = s.cstore.crates().iter().map(|c| c.as_usize()).max().unwrap_or(0);
691 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
692 providers[LOCAL_CRATE] = local_providers;
694 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
695 let upstream_def_path_tables: Vec<(CrateNum, Rc<_>)> = s
699 .map(|&cnum| (cnum, s.cstore.def_path_table(cnum)))
702 let def_path_tables = || {
703 upstream_def_path_tables
705 .map(|&(cnum, ref rc)| (cnum, &**rc))
706 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
709 // Precompute the capacity of the hashmap so we don't have to
710 // re-allocate when populating it.
711 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
713 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
715 ::std::default::Default::default()
718 for (cnum, def_path_table) in def_path_tables() {
719 def_path_table.add_def_path_hashes_to(cnum, &mut map);
727 tls::enter_global(GlobalCtxt {
729 trans_trait_caches: traits::trans::TransTraitCaches::new(dep_graph.clone()),
730 specializes_cache: RefCell::new(traits::SpecializesCache::new()),
731 global_arenas: arenas,
732 global_interners: interners,
733 dep_graph: dep_graph.clone(),
735 named_region_map: named_region_map,
736 trait_map: resolutions.trait_map,
737 export_map: resolutions.export_map,
738 fulfilled_predicates: RefCell::new(fulfilled_predicates),
740 def_path_hash_to_def_id: def_path_hash_to_def_id,
741 maps: maps::Maps::new(providers),
743 freevars: RefCell::new(resolutions.freevars),
744 maybe_unused_trait_imports: resolutions.maybe_unused_trait_imports,
745 rcache: RefCell::new(FxHashMap()),
746 normalized_cache: RefCell::new(FxHashMap()),
747 inhabitedness_cache: RefCell::new(FxHashMap()),
748 lang_items: lang_items,
749 used_unsafe: RefCell::new(NodeSet()),
750 used_mut_nodes: RefCell::new(NodeSet()),
751 stability: RefCell::new(stability),
752 selection_cache: traits::SelectionCache::new(),
753 evaluation_cache: traits::EvaluationCache::new(),
754 rvalue_promotable_to_static: RefCell::new(NodeMap()),
755 crate_name: Symbol::intern(crate_name),
756 data_layout: data_layout,
757 layout_interner: RefCell::new(FxHashSet()),
758 layout_depth: Cell::new(0),
759 derive_macros: RefCell::new(NodeMap()),
760 stability_interner: RefCell::new(FxHashSet()),
761 all_traits: RefCell::new(None),
765 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
766 let cname = self.crate_name(LOCAL_CRATE).as_str();
767 self.sess.consider_optimizing(&cname, msg)
771 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
772 /// Call the closure with a local `TyCtxt` using the given arena.
773 pub fn enter_local<F, R>(&self, arena: &'tcx DroplessArena, f: F) -> R
774 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
776 let interners = CtxtInterners::new(arena);
777 tls::enter(self, &interners, f)
781 /// A trait implemented for all X<'a> types which can be safely and
782 /// efficiently converted to X<'tcx> as long as they are part of the
783 /// provided TyCtxt<'tcx>.
784 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
785 /// by looking them up in their respective interners.
787 /// However, this is still not the best implementation as it does
788 /// need to compare the components, even for interned values.
789 /// It would be more efficient if TypedArena provided a way to
790 /// determine whether the address is in the allocated range.
792 /// None is returned if the value or one of the components is not part
793 /// of the provided context.
794 /// For Ty, None can be returned if either the type interner doesn't
795 /// contain the TypeVariants key or if the address of the interned
796 /// pointer differs. The latter case is possible if a primitive type,
797 /// e.g. `()` or `u8`, was interned in a different context.
798 pub trait Lift<'tcx> {
800 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
803 impl<'a, 'tcx> Lift<'tcx> for ty::ParamEnv<'a> {
804 type Lifted = ty::ParamEnv<'tcx>;
805 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<ty::ParamEnv<'tcx>> {
806 self.caller_bounds.lift_to_tcx(tcx).and_then(|caller_bounds| {
815 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
816 type Lifted = Ty<'tcx>;
817 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
818 if tcx.interners.arena.in_arena(*self as *const _) {
819 return Some(unsafe { mem::transmute(*self) });
821 // Also try in the global tcx if we're not that.
822 if !tcx.is_global() {
823 self.lift_to_tcx(tcx.global_tcx())
830 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
831 type Lifted = &'tcx Substs<'tcx>;
832 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
834 return Some(Slice::empty());
836 if tcx.interners.arena.in_arena(&self[..] as *const _) {
837 return Some(unsafe { mem::transmute(*self) });
839 // Also try in the global tcx if we're not that.
840 if !tcx.is_global() {
841 self.lift_to_tcx(tcx.global_tcx())
848 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
849 type Lifted = Region<'tcx>;
850 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
851 if tcx.interners.arena.in_arena(*self as *const _) {
852 return Some(unsafe { mem::transmute(*self) });
854 // Also try in the global tcx if we're not that.
855 if !tcx.is_global() {
856 self.lift_to_tcx(tcx.global_tcx())
863 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Ty<'a>> {
864 type Lifted = &'tcx Slice<Ty<'tcx>>;
865 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
866 -> Option<&'tcx Slice<Ty<'tcx>>> {
868 return Some(Slice::empty());
870 if tcx.interners.arena.in_arena(*self as *const _) {
871 return Some(unsafe { mem::transmute(*self) });
873 // Also try in the global tcx if we're not that.
874 if !tcx.is_global() {
875 self.lift_to_tcx(tcx.global_tcx())
882 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<ExistentialPredicate<'a>> {
883 type Lifted = &'tcx Slice<ExistentialPredicate<'tcx>>;
884 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
885 -> Option<&'tcx Slice<ExistentialPredicate<'tcx>>> {
887 return Some(Slice::empty());
889 if tcx.interners.arena.in_arena(*self as *const _) {
890 return Some(unsafe { mem::transmute(*self) });
892 // Also try in the global tcx if we're not that.
893 if !tcx.is_global() {
894 self.lift_to_tcx(tcx.global_tcx())
901 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Predicate<'a>> {
902 type Lifted = &'tcx Slice<Predicate<'tcx>>;
903 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
904 -> Option<&'tcx Slice<Predicate<'tcx>>> {
906 return Some(Slice::empty());
908 if tcx.interners.arena.in_arena(*self as *const _) {
909 return Some(unsafe { mem::transmute(*self) });
911 // Also try in the global tcx if we're not that.
912 if !tcx.is_global() {
913 self.lift_to_tcx(tcx.global_tcx())
921 use super::{CtxtInterners, GlobalCtxt, TyCtxt};
927 /// Marker types used for the scoped TLS slot.
928 /// The type context cannot be used directly because the scoped TLS
929 /// in libstd doesn't allow types generic over lifetimes.
930 enum ThreadLocalGlobalCtxt {}
931 enum ThreadLocalInterners {}
934 static TLS_TCX: Cell<Option<(*const ThreadLocalGlobalCtxt,
935 *const ThreadLocalInterners)>> = Cell::new(None)
938 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter) -> fmt::Result {
940 write!(f, "{}", tcx.sess.codemap().span_to_string(span))
944 pub fn enter_global<'gcx, F, R>(gcx: GlobalCtxt<'gcx>, f: F) -> R
945 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
947 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
948 let original_span_debug = span_dbg.get();
949 span_dbg.set(span_debug);
950 let result = enter(&gcx, &gcx.global_interners, f);
951 span_dbg.set(original_span_debug);
956 pub fn enter<'a, 'gcx: 'tcx, 'tcx, F, R>(gcx: &'a GlobalCtxt<'gcx>,
957 interners: &'a CtxtInterners<'tcx>,
959 where F: FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
961 let gcx_ptr = gcx as *const _ as *const ThreadLocalGlobalCtxt;
962 let interners_ptr = interners as *const _ as *const ThreadLocalInterners;
964 let prev = tls.get();
965 tls.set(Some((gcx_ptr, interners_ptr)));
975 pub fn with<F, R>(f: F) -> R
976 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
979 let (gcx, interners) = tcx.get().unwrap();
980 let gcx = unsafe { &*(gcx as *const GlobalCtxt) };
981 let interners = unsafe { &*(interners as *const CtxtInterners) };
989 pub fn with_opt<F, R>(f: F) -> R
990 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
992 if TLS_TCX.with(|tcx| tcx.get().is_some()) {
1000 macro_rules! sty_debug_print {
1001 ($ctxt: expr, $($variant: ident),*) => {{
1002 // curious inner module to allow variant names to be used as
1004 #[allow(non_snake_case)]
1006 use ty::{self, TyCtxt};
1007 use ty::context::Interned;
1009 #[derive(Copy, Clone)]
1012 region_infer: usize,
1017 pub fn go(tcx: TyCtxt) {
1018 let mut total = DebugStat {
1020 region_infer: 0, ty_infer: 0, both_infer: 0,
1022 $(let mut $variant = total;)*
1025 for &Interned(t) in tcx.interners.type_.borrow().iter() {
1026 let variant = match t.sty {
1027 ty::TyBool | ty::TyChar | ty::TyInt(..) | ty::TyUint(..) |
1028 ty::TyFloat(..) | ty::TyStr | ty::TyNever => continue,
1029 ty::TyError => /* unimportant */ continue,
1030 $(ty::$variant(..) => &mut $variant,)*
1032 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
1033 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
1037 if region { total.region_infer += 1; variant.region_infer += 1 }
1038 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
1039 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
1041 println!("Ty interner total ty region both");
1042 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
1043 {ty:4.1}% {region:5.1}% {both:4.1}%",
1044 stringify!($variant),
1045 uses = $variant.total,
1046 usespc = $variant.total as f64 * 100.0 / total.total as f64,
1047 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
1048 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
1049 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
1051 println!(" total {uses:6} \
1052 {ty:4.1}% {region:5.1}% {both:4.1}%",
1054 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
1055 region = total.region_infer as f64 * 100.0 / total.total as f64,
1056 both = total.both_infer as f64 * 100.0 / total.total as f64)
1064 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1065 pub fn print_debug_stats(self) {
1068 TyAdt, TyArray, TySlice, TyRawPtr, TyRef, TyFnDef, TyFnPtr,
1069 TyDynamic, TyClosure, TyTuple, TyParam, TyInfer, TyProjection, TyAnon);
1071 println!("Substs interner: #{}", self.interners.substs.borrow().len());
1072 println!("Region interner: #{}", self.interners.region.borrow().len());
1073 println!("Stability interner: #{}", self.stability_interner.borrow().len());
1074 println!("Layout interner: #{}", self.layout_interner.borrow().len());
1079 /// An entry in an interner.
1080 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
1082 // NB: An Interned<Ty> compares and hashes as a sty.
1083 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
1084 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
1085 self.0.sty == other.0.sty
1089 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
1091 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
1092 fn hash<H: Hasher>(&self, s: &mut H) {
1097 impl<'tcx: 'lcx, 'lcx> Borrow<TypeVariants<'lcx>> for Interned<'tcx, TyS<'tcx>> {
1098 fn borrow<'a>(&'a self) -> &'a TypeVariants<'lcx> {
1103 // NB: An Interned<Slice<T>> compares and hashes as its elements.
1104 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, Slice<T>> {
1105 fn eq(&self, other: &Interned<'tcx, Slice<T>>) -> bool {
1106 self.0[..] == other.0[..]
1110 impl<'tcx, T: Eq> Eq for Interned<'tcx, Slice<T>> {}
1112 impl<'tcx, T: Hash> Hash for Interned<'tcx, Slice<T>> {
1113 fn hash<H: Hasher>(&self, s: &mut H) {
1118 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, Slice<Ty<'tcx>>> {
1119 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
1124 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
1125 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
1130 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
1131 fn borrow<'a>(&'a self) -> &'a RegionKind {
1136 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
1137 for Interned<'tcx, Slice<ExistentialPredicate<'tcx>>> {
1138 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
1143 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
1144 for Interned<'tcx, Slice<Predicate<'tcx>>> {
1145 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
1150 macro_rules! intern_method {
1151 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
1152 $alloc_method:ident,
1155 $needs_infer:expr) -> $ty:ty) => {
1156 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
1157 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
1159 let key = ($alloc_to_key)(&v);
1160 if let Some(i) = self.interners.$name.borrow().get(key) {
1163 if !self.is_global() {
1164 if let Some(i) = self.global_interners.$name.borrow().get(key) {
1170 // HACK(eddyb) Depend on flags being accurate to
1171 // determine that all contents are in the global tcx.
1172 // See comments on Lift for why we can't use that.
1173 if !($needs_infer)(&v) {
1174 if !self.is_global() {
1178 let i = ($alloc_to_ret)(self.global_interners.arena.$alloc_method(v));
1179 self.global_interners.$name.borrow_mut().insert(Interned(i));
1183 // Make sure we don't end up with inference
1184 // types/regions in the global tcx.
1185 if self.is_global() {
1186 bug!("Attempted to intern `{:?}` which contains \
1187 inference types/regions in the global type context",
1192 let i = ($alloc_to_ret)(self.interners.arena.$alloc_method(v));
1193 self.interners.$name.borrow_mut().insert(Interned(i));
1200 macro_rules! direct_interners {
1201 ($lt_tcx:tt, $($name:ident: $method:ident($needs_infer:expr) -> $ty:ty),+) => {
1202 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
1203 fn eq(&self, other: &Self) -> bool {
1208 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
1210 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
1211 fn hash<H: Hasher>(&self, s: &mut H) {
1216 intern_method!($lt_tcx, $name: $method($ty, alloc, |x| x, |x| x, $needs_infer) -> $ty);)+
1220 fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
1221 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
1224 direct_interners!('tcx,
1225 region: mk_region(|r| {
1227 &ty::ReVar(_) | &ty::ReSkolemized(..) => true,
1233 macro_rules! slice_interners {
1234 ($($field:ident: $method:ident($ty:ident)),+) => (
1235 $(intern_method!('tcx, $field: $method(&[$ty<'tcx>], alloc_slice, Deref::deref,
1236 |xs: &[$ty]| -> &Slice<$ty> {
1237 unsafe { mem::transmute(xs) }
1238 }, |xs: &[$ty]| xs.iter().any(keep_local)) -> Slice<$ty<'tcx>>);)+
1243 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
1244 predicates: _intern_predicates(Predicate),
1245 type_list: _intern_type_list(Ty),
1246 substs: _intern_substs(Kind)
1249 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1250 /// Create an unsafe fn ty based on a safe fn ty.
1251 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
1252 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
1253 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
1254 unsafety: hir::Unsafety::Unsafe,
1259 // Interns a type/name combination, stores the resulting box in cx.interners,
1260 // and returns the box as cast to an unsafe ptr (see comments for Ty above).
1261 pub fn mk_ty(self, st: TypeVariants<'tcx>) -> Ty<'tcx> {
1262 let global_interners = if !self.is_global() {
1263 Some(&self.global_interners)
1267 self.interners.intern_ty(st, global_interners)
1270 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
1272 ast::IntTy::Is => self.types.isize,
1273 ast::IntTy::I8 => self.types.i8,
1274 ast::IntTy::I16 => self.types.i16,
1275 ast::IntTy::I32 => self.types.i32,
1276 ast::IntTy::I64 => self.types.i64,
1277 ast::IntTy::I128 => self.types.i128,
1281 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
1283 ast::UintTy::Us => self.types.usize,
1284 ast::UintTy::U8 => self.types.u8,
1285 ast::UintTy::U16 => self.types.u16,
1286 ast::UintTy::U32 => self.types.u32,
1287 ast::UintTy::U64 => self.types.u64,
1288 ast::UintTy::U128 => self.types.u128,
1292 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
1294 ast::FloatTy::F32 => self.types.f32,
1295 ast::FloatTy::F64 => self.types.f64,
1299 pub fn mk_str(self) -> Ty<'tcx> {
1303 pub fn mk_static_str(self) -> Ty<'tcx> {
1304 self.mk_imm_ref(self.types.re_static, self.mk_str())
1307 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
1308 // take a copy of substs so that we own the vectors inside
1309 self.mk_ty(TyAdt(def, substs))
1312 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1313 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
1314 let adt_def = self.adt_def(def_id);
1315 let substs = self.mk_substs(iter::once(Kind::from(ty)));
1316 self.mk_ty(TyAdt(adt_def, substs))
1319 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
1320 self.mk_ty(TyRawPtr(tm))
1323 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
1324 self.mk_ty(TyRef(r, tm))
1327 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
1328 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
1331 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
1332 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
1335 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1336 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
1339 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1340 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
1343 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
1344 self.mk_imm_ptr(self.mk_nil())
1347 pub fn mk_array(self, ty: Ty<'tcx>, n: usize) -> Ty<'tcx> {
1348 self.mk_ty(TyArray(ty, n))
1351 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1352 self.mk_ty(TySlice(ty))
1355 pub fn intern_tup(self, ts: &[Ty<'tcx>], defaulted: bool) -> Ty<'tcx> {
1356 self.mk_ty(TyTuple(self.intern_type_list(ts), defaulted))
1359 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I,
1360 defaulted: bool) -> I::Output {
1361 iter.intern_with(|ts| self.mk_ty(TyTuple(self.intern_type_list(ts), defaulted)))
1364 pub fn mk_nil(self) -> Ty<'tcx> {
1365 self.intern_tup(&[], false)
1368 pub fn mk_diverging_default(self) -> Ty<'tcx> {
1369 if self.sess.features.borrow().never_type {
1372 self.intern_tup(&[], true)
1376 pub fn mk_bool(self) -> Ty<'tcx> {
1380 pub fn mk_fn_def(self, def_id: DefId,
1381 substs: &'tcx Substs<'tcx>,
1382 fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
1383 self.mk_ty(TyFnDef(def_id, substs, fty))
1386 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
1387 self.mk_ty(TyFnPtr(fty))
1392 obj: ty::Binder<&'tcx Slice<ExistentialPredicate<'tcx>>>,
1393 reg: ty::Region<'tcx>
1395 self.mk_ty(TyDynamic(obj, reg))
1398 pub fn mk_projection(self,
1399 trait_ref: TraitRef<'tcx>,
1402 // take a copy of substs so that we own the vectors inside
1403 let inner = ProjectionTy::from_ref_and_name(self, trait_ref, item_name);
1404 self.mk_ty(TyProjection(inner))
1407 pub fn mk_closure(self,
1409 substs: &'tcx Substs<'tcx>)
1411 self.mk_closure_from_closure_substs(closure_id, ClosureSubsts {
1416 pub fn mk_closure_from_closure_substs(self,
1418 closure_substs: ClosureSubsts<'tcx>)
1420 self.mk_ty(TyClosure(closure_id, closure_substs))
1423 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
1424 self.mk_infer(TyVar(v))
1427 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
1428 self.mk_infer(IntVar(v))
1431 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
1432 self.mk_infer(FloatVar(v))
1435 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
1436 self.mk_ty(TyInfer(it))
1439 pub fn mk_param(self,
1441 name: Name) -> Ty<'tcx> {
1442 self.mk_ty(TyParam(ParamTy { idx: index, name: name }))
1445 pub fn mk_self_type(self) -> Ty<'tcx> {
1446 self.mk_param(0, keywords::SelfType.name())
1449 pub fn mk_param_from_def(self, def: &ty::TypeParameterDef) -> Ty<'tcx> {
1450 self.mk_param(def.index, def.name)
1453 pub fn mk_anon(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
1454 self.mk_ty(TyAnon(def_id, substs))
1457 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
1458 -> &'tcx Slice<ExistentialPredicate<'tcx>> {
1459 assert!(!eps.is_empty());
1460 assert!(eps.windows(2).all(|w| w[0].cmp(self, &w[1]) != Ordering::Greater));
1461 self._intern_existential_predicates(eps)
1464 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
1465 -> &'tcx Slice<Predicate<'tcx>> {
1466 // FIXME consider asking the input slice to be sorted to avoid
1467 // re-interning permutations, in which case that would be asserted
1469 if preds.len() == 0 {
1470 // The macro-generated method below asserts we don't intern an empty slice.
1473 self._intern_predicates(preds)
1477 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx Slice<Ty<'tcx>> {
1481 self._intern_type_list(ts)
1485 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx Slice<Kind<'tcx>> {
1489 self._intern_substs(ts)
1493 pub fn mk_fn_sig<I>(self,
1497 unsafety: hir::Unsafety,
1499 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
1501 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
1503 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
1504 inputs_and_output: self.intern_type_list(xs),
1505 variadic, unsafety, abi
1509 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
1510 &'tcx Slice<ExistentialPredicate<'tcx>>>>(self, iter: I)
1512 iter.intern_with(|xs| self.intern_existential_predicates(xs))
1515 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
1516 &'tcx Slice<Predicate<'tcx>>>>(self, iter: I)
1518 iter.intern_with(|xs| self.intern_predicates(xs))
1521 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
1522 &'tcx Slice<Ty<'tcx>>>>(self, iter: I) -> I::Output {
1523 iter.intern_with(|xs| self.intern_type_list(xs))
1526 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
1527 &'tcx Slice<Kind<'tcx>>>>(self, iter: I) -> I::Output {
1528 iter.intern_with(|xs| self.intern_substs(xs))
1531 pub fn mk_substs_trait(self,
1534 -> &'tcx Substs<'tcx>
1536 self.mk_substs(iter::once(s).chain(t.into_iter().cloned()).map(Kind::from))
1540 pub trait InternAs<T: ?Sized, R> {
1542 fn intern_with<F>(self, f: F) -> Self::Output
1543 where F: FnOnce(&T) -> R;
1546 impl<I, T, R, E> InternAs<[T], R> for I
1547 where E: InternIteratorElement<T, R>,
1548 I: Iterator<Item=E> {
1549 type Output = E::Output;
1550 fn intern_with<F>(self, f: F) -> Self::Output
1551 where F: FnOnce(&[T]) -> R {
1552 E::intern_with(self, f)
1556 pub trait InternIteratorElement<T, R>: Sized {
1558 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
1561 impl<T, R> InternIteratorElement<T, R> for T {
1563 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
1564 f(&iter.collect::<AccumulateVec<[_; 8]>>())
1568 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
1572 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
1573 f(&iter.cloned().collect::<AccumulateVec<[_; 8]>>())
1577 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
1578 type Output = Result<R, E>;
1579 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
1580 Ok(f(&iter.collect::<Result<AccumulateVec<[_; 8]>, _>>()?))