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;
14 use dep_graph::{DepNode, DepConstructor};
15 use errors::DiagnosticBuilder;
17 use session::config::OutputFilenames;
19 use hir::{TraitCandidate, HirId, ItemLocalId};
20 use hir::def::{Def, Export};
21 use hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
22 use hir::map as hir_map;
23 use hir::map::DefPathHash;
24 use lint::{self, Lint};
25 use ich::{StableHashingContext, NodeIdHashingMode};
26 use middle::const_val::ConstVal;
27 use middle::cstore::{CrateStore, LinkMeta, EncodedMetadataHashes};
28 use middle::cstore::EncodedMetadata;
29 use middle::free_region::FreeRegionMap;
30 use middle::lang_items;
31 use middle::resolve_lifetime::{self, ObjectLifetimeDefault};
32 use middle::stability;
34 use mir::transform::Passes;
35 use ty::subst::{Kind, Substs};
38 use ty::{self, Ty, TypeAndMut};
39 use ty::{TyS, TypeVariants, Slice};
40 use ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorInterior, Region, Const};
41 use ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
43 use ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid};
44 use ty::TypeVariants::*;
45 use ty::layout::{Layout, TargetDataLayout};
49 use util::nodemap::{NodeMap, NodeSet, DefIdSet, ItemLocalMap};
50 use util::nodemap::{FxHashMap, FxHashSet};
51 use rustc_data_structures::accumulate_vec::AccumulateVec;
52 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
53 StableHasher, StableHasherResult,
55 use arena::{TypedArena, DroplessArena};
56 use rustc_const_math::{ConstInt, ConstUsize};
57 use rustc_data_structures::indexed_vec::IndexVec;
59 use std::borrow::Borrow;
60 use std::cell::{Cell, RefCell};
61 use std::cmp::Ordering;
62 use std::collections::hash_map::{self, Entry};
63 use std::hash::{Hash, Hasher};
71 use syntax::ast::{self, Name, NodeId};
73 use syntax::codemap::MultiSpan;
74 use syntax::symbol::{Symbol, keywords};
80 pub struct GlobalArenas<'tcx> {
82 layout: TypedArena<Layout>,
85 generics: TypedArena<ty::Generics>,
86 trait_def: TypedArena<ty::TraitDef>,
87 adt_def: TypedArena<ty::AdtDef>,
88 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
89 mir: TypedArena<Mir<'tcx>>,
90 tables: TypedArena<ty::TypeckTables<'tcx>>,
93 impl<'tcx> GlobalArenas<'tcx> {
94 pub fn new() -> GlobalArenas<'tcx> {
96 layout: TypedArena::new(),
97 generics: TypedArena::new(),
98 trait_def: TypedArena::new(),
99 adt_def: TypedArena::new(),
100 steal_mir: TypedArena::new(),
101 mir: TypedArena::new(),
102 tables: TypedArena::new(),
107 pub struct CtxtInterners<'tcx> {
108 /// The arena that types, regions, etc are allocated from
109 arena: &'tcx DroplessArena,
111 /// Specifically use a speedy hash algorithm for these hash sets,
112 /// they're accessed quite often.
113 type_: RefCell<FxHashSet<Interned<'tcx, TyS<'tcx>>>>,
114 type_list: RefCell<FxHashSet<Interned<'tcx, Slice<Ty<'tcx>>>>>,
115 substs: RefCell<FxHashSet<Interned<'tcx, Substs<'tcx>>>>,
116 region: RefCell<FxHashSet<Interned<'tcx, RegionKind>>>,
117 existential_predicates: RefCell<FxHashSet<Interned<'tcx, Slice<ExistentialPredicate<'tcx>>>>>,
118 predicates: RefCell<FxHashSet<Interned<'tcx, Slice<Predicate<'tcx>>>>>,
119 const_: RefCell<FxHashSet<Interned<'tcx, Const<'tcx>>>>,
122 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
123 fn new(arena: &'tcx DroplessArena) -> CtxtInterners<'tcx> {
126 type_: RefCell::new(FxHashSet()),
127 type_list: RefCell::new(FxHashSet()),
128 substs: RefCell::new(FxHashSet()),
129 region: RefCell::new(FxHashSet()),
130 existential_predicates: RefCell::new(FxHashSet()),
131 predicates: RefCell::new(FxHashSet()),
132 const_: RefCell::new(FxHashSet()),
136 /// Intern a type. global_interners is Some only if this is
137 /// a local interner and global_interners is its counterpart.
138 fn intern_ty(&self, st: TypeVariants<'tcx>,
139 global_interners: Option<&CtxtInterners<'gcx>>)
142 let mut interner = self.type_.borrow_mut();
143 let global_interner = global_interners.map(|interners| {
144 interners.type_.borrow_mut()
146 if let Some(&Interned(ty)) = interner.get(&st) {
149 if let Some(ref interner) = global_interner {
150 if let Some(&Interned(ty)) = interner.get(&st) {
155 let flags = super::flags::FlagComputation::for_sty(&st);
156 let ty_struct = TyS {
159 region_depth: flags.depth,
162 // HACK(eddyb) Depend on flags being accurate to
163 // determine that all contents are in the global tcx.
164 // See comments on Lift for why we can't use that.
165 if !flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
166 if let Some(interner) = global_interners {
167 let ty_struct: TyS<'gcx> = unsafe {
168 mem::transmute(ty_struct)
170 let ty: Ty<'gcx> = interner.arena.alloc(ty_struct);
171 global_interner.unwrap().insert(Interned(ty));
175 // Make sure we don't end up with inference
176 // types/regions in the global tcx.
177 if global_interners.is_none() {
179 bug!("Attempted to intern `{:?}` which contains \
180 inference types/regions in the global type context",
185 // Don't be &mut TyS.
186 let ty: Ty<'tcx> = self.arena.alloc(ty_struct);
187 interner.insert(Interned(ty));
191 debug!("Interned type: {:?} Pointer: {:?}",
192 ty, ty as *const TyS);
198 pub struct CommonTypes<'tcx> {
218 pub re_empty: Region<'tcx>,
219 pub re_static: Region<'tcx>,
220 pub re_erased: Region<'tcx>,
223 pub struct LocalTableInContext<'a, V: 'a> {
224 local_id_root: Option<DefId>,
225 data: &'a ItemLocalMap<V>
228 /// Validate that the given HirId (respectively its `local_id` part) can be
229 /// safely used as a key in the tables of a TypeckTable. For that to be
230 /// the case, the HirId must have the same `owner` as all the other IDs in
231 /// this table (signified by `local_id_root`). Otherwise the HirId
232 /// would be in a different frame of reference and using its `local_id`
233 /// would result in lookup errors, or worse, in silently wrong data being
235 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
238 if cfg!(debug_assertions) {
239 if let Some(local_id_root) = local_id_root {
240 if hir_id.owner != local_id_root.index {
241 ty::tls::with(|tcx| {
242 let node_id = tcx.hir
244 .find_node_for_hir_id(hir_id);
246 bug!("node {} with HirId::owner {:?} cannot be placed in \
247 TypeckTables with local_id_root {:?}",
248 tcx.hir.node_to_string(node_id),
249 DefId::local(hir_id.owner),
254 // We use "Null Object" TypeckTables in some of the analysis passes.
255 // These are just expected to be empty and their `local_id_root` is
256 // `None`. Therefore we cannot verify whether a given `HirId` would
257 // be a valid key for the given table. Instead we make sure that
258 // nobody tries to write to such a Null Object table.
260 bug!("access to invalid TypeckTables")
266 impl<'a, V> LocalTableInContext<'a, V> {
267 pub fn contains_key(&self, id: hir::HirId) -> bool {
268 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
269 self.data.contains_key(&id.local_id)
272 pub fn get(&self, id: hir::HirId) -> Option<&V> {
273 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
274 self.data.get(&id.local_id)
277 pub fn iter(&self) -> hash_map::Iter<hir::ItemLocalId, V> {
282 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
285 fn index(&self, key: hir::HirId) -> &V {
286 self.get(key).expect("LocalTableInContext: key not found")
290 pub struct LocalTableInContextMut<'a, V: 'a> {
291 local_id_root: Option<DefId>,
292 data: &'a mut ItemLocalMap<V>
295 impl<'a, V> LocalTableInContextMut<'a, V> {
296 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
297 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
298 self.data.get_mut(&id.local_id)
301 pub fn entry(&mut self, id: hir::HirId) -> Entry<hir::ItemLocalId, V> {
302 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
303 self.data.entry(id.local_id)
306 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
307 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
308 self.data.insert(id.local_id, val)
311 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
312 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
313 self.data.remove(&id.local_id)
317 #[derive(RustcEncodable, RustcDecodable, Debug)]
318 pub struct TypeckTables<'tcx> {
319 /// The HirId::owner all ItemLocalIds in this table are relative to.
320 pub local_id_root: Option<DefId>,
322 /// Resolved definitions for `<T>::X` associated paths and
323 /// method calls, including those of overloaded operators.
324 type_dependent_defs: ItemLocalMap<Def>,
326 /// Stores the types for various nodes in the AST. Note that this table
327 /// is not guaranteed to be populated until after typeck. See
328 /// typeck::check::fn_ctxt for details.
329 node_types: ItemLocalMap<Ty<'tcx>>,
331 /// Stores the type parameters which were substituted to obtain the type
332 /// of this node. This only applies to nodes that refer to entities
333 /// parameterized by type parameters, such as generic fns, types, or
335 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
337 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
339 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
340 pat_binding_modes: ItemLocalMap<BindingMode>,
342 /// Stores the types which were implicitly dereferenced in pattern binding modes
343 /// for later usage in HAIR lowering. For example,
346 /// match &&Some(5i32) {
351 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
354 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
355 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
358 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
360 /// Records the type of each closure.
361 closure_tys: ItemLocalMap<ty::PolyFnSig<'tcx>>,
363 /// Records the kind of each closure and the span and name of the variable
364 /// that caused the closure to be this kind.
365 closure_kinds: ItemLocalMap<(ty::ClosureKind, Option<(Span, ast::Name)>)>,
367 generator_sigs: ItemLocalMap<Option<ty::GenSig<'tcx>>>,
369 generator_interiors: ItemLocalMap<ty::GeneratorInterior<'tcx>>,
371 /// For each fn, records the "liberated" types of its arguments
372 /// and return type. Liberated means that all bound regions
373 /// (including late-bound regions) are replaced with free
374 /// equivalents. This table is not used in trans (since regions
375 /// are erased there) and hence is not serialized to metadata.
376 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
378 /// For each FRU expression, record the normalized types of the fields
379 /// of the struct - this is needed because it is non-trivial to
380 /// normalize while preserving regions. This table is used only in
381 /// MIR construction and hence is not serialized to metadata.
382 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
384 /// Maps a cast expression to its kind. This is keyed on the
385 /// *from* expression of the cast, not the cast itself.
386 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
388 /// Set of trait imports actually used in the method resolution.
389 /// This is used for warning unused imports.
390 pub used_trait_imports: DefIdSet,
392 /// If any errors occurred while type-checking this body,
393 /// this field will be set to `true`.
394 pub tainted_by_errors: bool,
396 /// Stores the free-region relationships that were deduced from
397 /// its where clauses and parameter types. These are then
398 /// read-again by borrowck.
399 pub free_region_map: FreeRegionMap<'tcx>,
402 impl<'tcx> TypeckTables<'tcx> {
403 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
406 type_dependent_defs: ItemLocalMap(),
407 node_types: ItemLocalMap(),
408 node_substs: ItemLocalMap(),
409 adjustments: ItemLocalMap(),
410 pat_binding_modes: ItemLocalMap(),
411 pat_adjustments: ItemLocalMap(),
412 upvar_capture_map: FxHashMap(),
413 generator_sigs: ItemLocalMap(),
414 generator_interiors: ItemLocalMap(),
415 closure_tys: ItemLocalMap(),
416 closure_kinds: ItemLocalMap(),
417 liberated_fn_sigs: ItemLocalMap(),
418 fru_field_types: ItemLocalMap(),
419 cast_kinds: ItemLocalMap(),
420 used_trait_imports: DefIdSet(),
421 tainted_by_errors: false,
422 free_region_map: FreeRegionMap::new(),
426 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
427 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
429 hir::QPath::Resolved(_, ref path) => path.def,
430 hir::QPath::TypeRelative(..) => {
431 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
432 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
437 pub fn type_dependent_defs(&self) -> LocalTableInContext<Def> {
438 LocalTableInContext {
439 local_id_root: self.local_id_root,
440 data: &self.type_dependent_defs
444 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<Def> {
445 LocalTableInContextMut {
446 local_id_root: self.local_id_root,
447 data: &mut self.type_dependent_defs
451 pub fn node_types(&self) -> LocalTableInContext<Ty<'tcx>> {
452 LocalTableInContext {
453 local_id_root: self.local_id_root,
454 data: &self.node_types
458 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<Ty<'tcx>> {
459 LocalTableInContextMut {
460 local_id_root: self.local_id_root,
461 data: &mut self.node_types
465 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
466 match self.node_id_to_type_opt(id) {
469 bug!("node_id_to_type: no type for node `{}`",
471 let id = tcx.hir.definitions().find_node_for_hir_id(id);
472 tcx.hir.node_to_string(id)
478 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
479 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
480 self.node_types.get(&id.local_id).cloned()
483 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<&'tcx Substs<'tcx>> {
484 LocalTableInContextMut {
485 local_id_root: self.local_id_root,
486 data: &mut self.node_substs
490 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
491 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
492 self.node_substs.get(&id.local_id).cloned().unwrap_or(Substs::empty())
495 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
496 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
497 self.node_substs.get(&id.local_id).cloned()
500 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
501 // doesn't provide type parameter substitutions.
502 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
503 self.node_id_to_type(pat.hir_id)
506 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
507 self.node_id_to_type_opt(pat.hir_id)
510 // Returns the type of an expression as a monotype.
512 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
513 // some cases, we insert `Adjustment` annotations such as auto-deref or
514 // auto-ref. The type returned by this function does not consider such
515 // adjustments. See `expr_ty_adjusted()` instead.
517 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
518 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
519 // instead of "fn(ty) -> T with T = isize".
520 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
521 self.node_id_to_type(expr.hir_id)
524 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
525 self.node_id_to_type_opt(expr.hir_id)
528 pub fn adjustments(&self) -> LocalTableInContext<Vec<ty::adjustment::Adjustment<'tcx>>> {
529 LocalTableInContext {
530 local_id_root: self.local_id_root,
531 data: &self.adjustments
535 pub fn adjustments_mut(&mut self)
536 -> LocalTableInContextMut<Vec<ty::adjustment::Adjustment<'tcx>>> {
537 LocalTableInContextMut {
538 local_id_root: self.local_id_root,
539 data: &mut self.adjustments
543 pub fn expr_adjustments(&self, expr: &hir::Expr)
544 -> &[ty::adjustment::Adjustment<'tcx>] {
545 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
546 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
549 /// Returns the type of `expr`, considering any `Adjustment`
550 /// entry recorded for that expression.
551 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
552 self.expr_adjustments(expr)
554 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
557 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
558 self.expr_adjustments(expr)
560 .map(|adj| adj.target)
561 .or_else(|| self.expr_ty_opt(expr))
564 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
565 // Only paths and method calls/overloaded operators have
566 // entries in type_dependent_defs, ignore the former here.
567 if let hir::ExprPath(_) = expr.node {
571 match self.type_dependent_defs().get(expr.hir_id) {
572 Some(&Def::Method(_)) => true,
577 pub fn pat_binding_modes(&self) -> LocalTableInContext<BindingMode> {
578 LocalTableInContext {
579 local_id_root: self.local_id_root,
580 data: &self.pat_binding_modes
584 pub fn pat_binding_modes_mut(&mut self)
585 -> LocalTableInContextMut<BindingMode> {
586 LocalTableInContextMut {
587 local_id_root: self.local_id_root,
588 data: &mut self.pat_binding_modes
592 pub fn pat_adjustments(&self) -> LocalTableInContext<Vec<Ty<'tcx>>> {
593 LocalTableInContext {
594 local_id_root: self.local_id_root,
595 data: &self.pat_adjustments,
599 pub fn pat_adjustments_mut(&mut self)
600 -> LocalTableInContextMut<Vec<Ty<'tcx>>> {
601 LocalTableInContextMut {
602 local_id_root: self.local_id_root,
603 data: &mut self.pat_adjustments,
607 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
608 self.upvar_capture_map[&upvar_id]
611 pub fn closure_tys(&self) -> LocalTableInContext<ty::PolyFnSig<'tcx>> {
612 LocalTableInContext {
613 local_id_root: self.local_id_root,
614 data: &self.closure_tys
618 pub fn closure_tys_mut(&mut self)
619 -> LocalTableInContextMut<ty::PolyFnSig<'tcx>> {
620 LocalTableInContextMut {
621 local_id_root: self.local_id_root,
622 data: &mut self.closure_tys
626 pub fn closure_kinds(&self) -> LocalTableInContext<(ty::ClosureKind,
627 Option<(Span, ast::Name)>)> {
628 LocalTableInContext {
629 local_id_root: self.local_id_root,
630 data: &self.closure_kinds
634 pub fn closure_kinds_mut(&mut self)
635 -> LocalTableInContextMut<(ty::ClosureKind, Option<(Span, ast::Name)>)> {
636 LocalTableInContextMut {
637 local_id_root: self.local_id_root,
638 data: &mut self.closure_kinds
642 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<ty::FnSig<'tcx>> {
643 LocalTableInContext {
644 local_id_root: self.local_id_root,
645 data: &self.liberated_fn_sigs
649 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<ty::FnSig<'tcx>> {
650 LocalTableInContextMut {
651 local_id_root: self.local_id_root,
652 data: &mut self.liberated_fn_sigs
656 pub fn fru_field_types(&self) -> LocalTableInContext<Vec<Ty<'tcx>>> {
657 LocalTableInContext {
658 local_id_root: self.local_id_root,
659 data: &self.fru_field_types
663 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<Vec<Ty<'tcx>>> {
664 LocalTableInContextMut {
665 local_id_root: self.local_id_root,
666 data: &mut self.fru_field_types
670 pub fn cast_kinds(&self) -> LocalTableInContext<ty::cast::CastKind> {
671 LocalTableInContext {
672 local_id_root: self.local_id_root,
673 data: &self.cast_kinds
677 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<ty::cast::CastKind> {
678 LocalTableInContextMut {
679 local_id_root: self.local_id_root,
680 data: &mut self.cast_kinds
684 pub fn generator_sigs(&self)
685 -> LocalTableInContext<Option<ty::GenSig<'tcx>>>
687 LocalTableInContext {
688 local_id_root: self.local_id_root,
689 data: &self.generator_sigs,
693 pub fn generator_sigs_mut(&mut self)
694 -> LocalTableInContextMut<Option<ty::GenSig<'tcx>>>
696 LocalTableInContextMut {
697 local_id_root: self.local_id_root,
698 data: &mut self.generator_sigs,
702 pub fn generator_interiors(&self)
703 -> LocalTableInContext<ty::GeneratorInterior<'tcx>>
705 LocalTableInContext {
706 local_id_root: self.local_id_root,
707 data: &self.generator_interiors,
711 pub fn generator_interiors_mut(&mut self)
712 -> LocalTableInContextMut<ty::GeneratorInterior<'tcx>>
714 LocalTableInContextMut {
715 local_id_root: self.local_id_root,
716 data: &mut self.generator_interiors,
721 impl<'gcx> HashStable<StableHashingContext<'gcx>> for TypeckTables<'gcx> {
722 fn hash_stable<W: StableHasherResult>(&self,
723 hcx: &mut StableHashingContext<'gcx>,
724 hasher: &mut StableHasher<W>) {
725 let ty::TypeckTables {
727 ref type_dependent_defs,
731 ref pat_binding_modes,
733 ref upvar_capture_map,
736 ref liberated_fn_sigs,
741 ref used_trait_imports,
745 ref generator_interiors,
748 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
749 type_dependent_defs.hash_stable(hcx, hasher);
750 node_types.hash_stable(hcx, hasher);
751 node_substs.hash_stable(hcx, hasher);
752 adjustments.hash_stable(hcx, hasher);
753 pat_binding_modes.hash_stable(hcx, hasher);
754 pat_adjustments.hash_stable(hcx, hasher);
755 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
762 local_id_root.expect("trying to hash invalid TypeckTables");
764 let var_owner_def_id = DefId {
765 krate: local_id_root.krate,
768 let closure_def_id = DefId {
769 krate: local_id_root.krate,
770 index: closure_expr_id,
772 (hcx.def_path_hash(var_owner_def_id),
774 hcx.def_path_hash(closure_def_id))
777 closure_tys.hash_stable(hcx, hasher);
778 closure_kinds.hash_stable(hcx, hasher);
779 liberated_fn_sigs.hash_stable(hcx, hasher);
780 fru_field_types.hash_stable(hcx, hasher);
781 cast_kinds.hash_stable(hcx, hasher);
782 generator_sigs.hash_stable(hcx, hasher);
783 generator_interiors.hash_stable(hcx, hasher);
784 used_trait_imports.hash_stable(hcx, hasher);
785 tainted_by_errors.hash_stable(hcx, hasher);
786 free_region_map.hash_stable(hcx, hasher);
791 impl<'tcx> CommonTypes<'tcx> {
792 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
793 let mk = |sty| interners.intern_ty(sty, None);
794 let mk_region = |r| {
795 if let Some(r) = interners.region.borrow().get(&r) {
798 let r = interners.arena.alloc(r);
799 interners.region.borrow_mut().insert(Interned(r));
807 isize: mk(TyInt(ast::IntTy::Is)),
808 i8: mk(TyInt(ast::IntTy::I8)),
809 i16: mk(TyInt(ast::IntTy::I16)),
810 i32: mk(TyInt(ast::IntTy::I32)),
811 i64: mk(TyInt(ast::IntTy::I64)),
812 i128: mk(TyInt(ast::IntTy::I128)),
813 usize: mk(TyUint(ast::UintTy::Us)),
814 u8: mk(TyUint(ast::UintTy::U8)),
815 u16: mk(TyUint(ast::UintTy::U16)),
816 u32: mk(TyUint(ast::UintTy::U32)),
817 u64: mk(TyUint(ast::UintTy::U64)),
818 u128: mk(TyUint(ast::UintTy::U128)),
819 f32: mk(TyFloat(ast::FloatTy::F32)),
820 f64: mk(TyFloat(ast::FloatTy::F64)),
822 re_empty: mk_region(RegionKind::ReEmpty),
823 re_static: mk_region(RegionKind::ReStatic),
824 re_erased: mk_region(RegionKind::ReErased),
829 /// The central data structure of the compiler. It stores references
830 /// to the various **arenas** and also houses the results of the
831 /// various **compiler queries** that have been performed. See [the
832 /// README](README.md) for more deatils.
833 #[derive(Copy, Clone)]
834 pub struct TyCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
835 gcx: &'a GlobalCtxt<'gcx>,
836 interners: &'a CtxtInterners<'tcx>
839 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
840 type Target = &'a GlobalCtxt<'gcx>;
841 fn deref(&self) -> &Self::Target {
846 pub struct GlobalCtxt<'tcx> {
847 global_arenas: &'tcx GlobalArenas<'tcx>,
848 global_interners: CtxtInterners<'tcx>,
850 cstore: &'tcx CrateStore,
852 pub sess: &'tcx Session,
854 pub dep_graph: DepGraph,
856 /// Common types, pre-interned for your convenience.
857 pub types: CommonTypes<'tcx>,
859 /// Map indicating what traits are in scope for places where this
860 /// is relevant; generated by resolve.
861 trait_map: FxHashMap<DefIndex,
862 Rc<FxHashMap<ItemLocalId,
863 Rc<StableVec<TraitCandidate>>>>>,
865 /// Export map produced by name resolution.
866 export_map: FxHashMap<DefId, Rc<Vec<Export>>>,
868 named_region_map: NamedRegionMap,
870 pub hir: hir_map::Map<'tcx>,
872 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
873 /// as well as all upstream crates. Only populated in incremental mode.
874 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
876 pub maps: maps::Maps<'tcx>,
878 pub mir_passes: Rc<Passes>,
880 // Records the free variables refrenced by every closure
881 // expression. Do not track deps for this, just recompute it from
882 // scratch every time.
883 freevars: FxHashMap<DefId, Rc<Vec<hir::Freevar>>>,
885 maybe_unused_trait_imports: FxHashSet<DefId>,
887 maybe_unused_extern_crates: Vec<(DefId, Span)>,
889 // Internal cache for metadata decoding. No need to track deps on this.
890 pub rcache: RefCell<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
892 /// Caches the results of trait selection. This cache is used
893 /// for things that do not have to do with the parameters in scope.
894 pub selection_cache: traits::SelectionCache<'tcx>,
896 /// Caches the results of trait evaluation. This cache is used
897 /// for things that do not have to do with the parameters in scope.
898 /// Merge this with `selection_cache`?
899 pub evaluation_cache: traits::EvaluationCache<'tcx>,
901 /// The definite name of the current crate after taking into account
902 /// attributes, commandline parameters, etc.
903 pub crate_name: Symbol,
905 /// Data layout specification for the current target.
906 pub data_layout: TargetDataLayout,
908 /// Used to prevent layout from recursing too deeply.
909 pub layout_depth: Cell<usize>,
911 /// Map from function to the `#[derive]` mode that it's defining. Only used
912 /// by `proc-macro` crates.
913 pub derive_macros: RefCell<NodeMap<Symbol>>,
915 stability_interner: RefCell<FxHashSet<&'tcx attr::Stability>>,
917 layout_interner: RefCell<FxHashSet<&'tcx Layout>>,
919 /// A vector of every trait accessible in the whole crate
920 /// (i.e. including those from subcrates). This is used only for
921 /// error reporting, and so is lazily initialized and generally
922 /// shouldn't taint the common path (hence the RefCell).
923 pub all_traits: RefCell<Option<Vec<DefId>>>,
925 /// A general purpose channel to throw data out the back towards LLVM worker
928 /// This is intended to only get used during the trans phase of the compiler
929 /// when satisfying the query for a particular codegen unit. Internally in
930 /// the query it'll send data along this channel to get processed later.
931 pub tx_to_llvm_workers: mpsc::Sender<Box<Any + Send>>,
933 output_filenames: Arc<OutputFilenames>,
936 impl<'tcx> GlobalCtxt<'tcx> {
937 /// Get the global TyCtxt.
938 pub fn global_tcx<'a>(&'a self) -> TyCtxt<'a, 'tcx, 'tcx> {
941 interners: &self.global_interners
946 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
947 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
948 self.global_arenas.generics.alloc(generics)
951 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
952 self.global_arenas.steal_mir.alloc(Steal::new(mir))
955 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
956 self.global_arenas.mir.alloc(mir)
959 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
960 self.global_arenas.tables.alloc(tables)
963 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
964 self.global_arenas.trait_def.alloc(def)
967 pub fn alloc_adt_def(self,
970 variants: Vec<ty::VariantDef>,
972 -> &'gcx ty::AdtDef {
973 let def = ty::AdtDef::new(self, did, kind, variants, repr);
974 self.global_arenas.adt_def.alloc(def)
977 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
978 if bytes.is_empty() {
981 self.global_interners.arena.alloc_slice(bytes)
985 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
986 -> &'tcx [&'tcx ty::Const<'tcx>] {
987 if values.is_empty() {
990 self.interners.arena.alloc_slice(values)
994 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
995 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
996 if values.is_empty() {
999 self.interners.arena.alloc_slice(values)
1003 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1004 if let Some(st) = self.stability_interner.borrow().get(&stab) {
1008 let interned = self.global_interners.arena.alloc(stab);
1009 if let Some(prev) = self.stability_interner.borrow_mut().replace(interned) {
1010 bug!("Tried to overwrite interned Stability: {:?}", prev)
1015 pub fn intern_layout(self, layout: Layout) -> &'gcx Layout {
1016 if let Some(layout) = self.layout_interner.borrow().get(&layout) {
1020 let interned = self.global_arenas.layout.alloc(layout);
1021 if let Some(prev) = self.layout_interner.borrow_mut().replace(interned) {
1022 bug!("Tried to overwrite interned Layout: {:?}", prev)
1027 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1028 value.lift_to_tcx(self)
1031 /// Like lift, but only tries in the global tcx.
1032 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1033 value.lift_to_tcx(self.global_tcx())
1036 /// Returns true if self is the same as self.global_tcx().
1037 fn is_global(self) -> bool {
1038 let local = self.interners as *const _;
1039 let global = &self.global_interners as *const _;
1040 local as usize == global as usize
1043 /// Create a type context and call the closure with a `TyCtxt` reference
1044 /// to the context. The closure enforces that the type context and any interned
1045 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1046 /// reference to the context, to allow formatting values that need it.
1047 pub fn create_and_enter<F, R>(s: &'tcx Session,
1048 cstore: &'tcx CrateStore,
1049 local_providers: ty::maps::Providers<'tcx>,
1050 extern_providers: ty::maps::Providers<'tcx>,
1051 mir_passes: Rc<Passes>,
1052 arenas: &'tcx GlobalArenas<'tcx>,
1053 arena: &'tcx DroplessArena,
1054 resolutions: ty::Resolutions,
1055 named_region_map: resolve_lifetime::NamedRegionMap,
1056 hir: hir_map::Map<'tcx>,
1058 tx: mpsc::Sender<Box<Any + Send>>,
1059 output_filenames: &OutputFilenames,
1061 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1063 let data_layout = TargetDataLayout::parse(s);
1064 let interners = CtxtInterners::new(arena);
1065 let common_types = CommonTypes::new(&interners);
1066 let dep_graph = hir.dep_graph.clone();
1067 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1068 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1069 providers[LOCAL_CRATE] = local_providers;
1071 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1072 let upstream_def_path_tables: Vec<(CrateNum, Rc<_>)> = cstore
1075 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1078 let def_path_tables = || {
1079 upstream_def_path_tables
1081 .map(|&(cnum, ref rc)| (cnum, &**rc))
1082 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1085 // Precompute the capacity of the hashmap so we don't have to
1086 // re-allocate when populating it.
1087 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1089 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1091 ::std::default::Default::default()
1094 for (cnum, def_path_table) in def_path_tables() {
1095 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1103 let mut trait_map = FxHashMap();
1104 for (k, v) in resolutions.trait_map {
1105 let hir_id = hir.node_to_hir_id(k);
1106 let map = trait_map.entry(hir_id.owner)
1107 .or_insert_with(|| Rc::new(FxHashMap()));
1108 Rc::get_mut(map).unwrap()
1109 .insert(hir_id.local_id,
1110 Rc::new(StableVec::new(v)));
1112 let mut defs = FxHashMap();
1113 for (k, v) in named_region_map.defs {
1114 let hir_id = hir.node_to_hir_id(k);
1115 let map = defs.entry(hir_id.owner)
1116 .or_insert_with(|| Rc::new(FxHashMap()));
1117 Rc::get_mut(map).unwrap().insert(hir_id.local_id, v);
1119 let mut late_bound = FxHashMap();
1120 for k in named_region_map.late_bound {
1121 let hir_id = hir.node_to_hir_id(k);
1122 let map = late_bound.entry(hir_id.owner)
1123 .or_insert_with(|| Rc::new(FxHashSet()));
1124 Rc::get_mut(map).unwrap().insert(hir_id.local_id);
1126 let mut object_lifetime_defaults = FxHashMap();
1127 for (k, v) in named_region_map.object_lifetime_defaults {
1128 let hir_id = hir.node_to_hir_id(k);
1129 let map = object_lifetime_defaults.entry(hir_id.owner)
1130 .or_insert_with(|| Rc::new(FxHashMap()));
1131 Rc::get_mut(map).unwrap().insert(hir_id.local_id, Rc::new(v));
1134 tls::enter_global(GlobalCtxt {
1137 global_arenas: arenas,
1138 global_interners: interners,
1139 dep_graph: dep_graph.clone(),
1140 types: common_types,
1141 named_region_map: NamedRegionMap {
1144 object_lifetime_defaults,
1147 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1150 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1151 (hir.local_def_id(k), Rc::new(v))
1153 maybe_unused_trait_imports:
1154 resolutions.maybe_unused_trait_imports
1156 .map(|id| hir.local_def_id(id))
1158 maybe_unused_extern_crates:
1159 resolutions.maybe_unused_extern_crates
1161 .map(|(id, sp)| (hir.local_def_id(id), sp))
1164 def_path_hash_to_def_id,
1165 maps: maps::Maps::new(providers),
1167 rcache: RefCell::new(FxHashMap()),
1168 selection_cache: traits::SelectionCache::new(),
1169 evaluation_cache: traits::EvaluationCache::new(),
1170 crate_name: Symbol::intern(crate_name),
1172 layout_interner: RefCell::new(FxHashSet()),
1173 layout_depth: Cell::new(0),
1174 derive_macros: RefCell::new(NodeMap()),
1175 stability_interner: RefCell::new(FxHashSet()),
1176 all_traits: RefCell::new(None),
1177 tx_to_llvm_workers: tx,
1178 output_filenames: Arc::new(output_filenames.clone()),
1182 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1183 let cname = self.crate_name(LOCAL_CRATE).as_str();
1184 self.sess.consider_optimizing(&cname, msg)
1187 pub fn lang_items(self) -> Rc<middle::lang_items::LanguageItems> {
1188 self.get_lang_items(LOCAL_CRATE)
1191 pub fn stability(self) -> Rc<stability::Index<'tcx>> {
1192 // FIXME(#42293) we should actually track this, but fails too many tests
1194 self.dep_graph.with_ignore(|| {
1195 self.stability_index(LOCAL_CRATE)
1199 pub fn crates(self) -> Rc<Vec<CrateNum>> {
1200 self.all_crate_nums(LOCAL_CRATE)
1203 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1205 self.hir.def_key(id)
1207 self.cstore.def_key(id)
1211 /// Convert a `DefId` into its fully expanded `DefPath` (every
1212 /// `DefId` is really just an interned def-path).
1214 /// Note that if `id` is not local to this crate, the result will
1215 /// be a non-local `DefPath`.
1216 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1218 self.hir.def_path(id)
1220 self.cstore.def_path(id)
1225 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1226 if def_id.is_local() {
1227 self.hir.definitions().def_path_hash(def_id.index)
1229 self.cstore.def_path_hash(def_id)
1233 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1234 // We are explicitly not going through queries here in order to get
1235 // crate name and disambiguator since this code is called from debug!()
1236 // statements within the query system and we'd run into endless
1237 // recursion otherwise.
1238 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1239 (self.crate_name.clone(),
1240 self.sess.local_crate_disambiguator())
1242 (self.cstore.crate_name_untracked(def_id.krate),
1243 self.cstore.crate_disambiguator_untracked(def_id.krate))
1248 // Don't print the whole crate disambiguator. That's just
1249 // annoying in debug output.
1250 &(crate_disambiguator.as_str())[..4],
1251 self.def_path(def_id).to_string_no_crate())
1254 pub fn metadata_encoding_version(self) -> Vec<u8> {
1255 self.cstore.metadata_encoding_version().to_vec()
1258 // Note that this is *untracked* and should only be used within the query
1259 // system if the result is otherwise tracked through queries
1260 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Rc<Any> {
1261 self.cstore.crate_data_as_rc_any(cnum)
1264 pub fn create_stable_hashing_context(self) -> StableHashingContext<'gcx> {
1265 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1267 StableHashingContext::new(self.sess,
1269 self.hir.definitions(),
1273 // This method makes sure that we have a DepNode and a Fingerprint for
1274 // every upstream crate. It needs to be called once right after the tcx is
1276 // With full-fledged red/green, the method will probably become unnecessary
1277 // as this will be done on-demand.
1278 pub fn allocate_metadata_dep_nodes(self) {
1279 // We cannot use the query versions of crates() and crate_hash(), since
1280 // those would need the DepNodes that we are allocating here.
1281 for cnum in self.cstore.crates_untracked() {
1282 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1283 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1284 self.dep_graph.with_task(dep_node,
1287 |_, x| x // No transformation needed
1292 // This method exercises the `in_scope_traits_map` query for all possible
1293 // values so that we have their fingerprints available in the DepGraph.
1294 // This is only required as long as we still use the old dependency tracking
1295 // which needs to have the fingerprints of all input nodes beforehand.
1296 pub fn precompute_in_scope_traits_hashes(self) {
1297 for &def_index in self.trait_map.keys() {
1298 self.in_scope_traits_map(def_index);
1303 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1304 pub fn encode_metadata(self, link_meta: &LinkMeta, reachable: &NodeSet)
1305 -> (EncodedMetadata, EncodedMetadataHashes)
1307 self.cstore.encode_metadata(self, link_meta, reachable)
1311 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1312 /// Call the closure with a local `TyCtxt` using the given arena.
1313 pub fn enter_local<F, R>(&self, arena: &'tcx DroplessArena, f: F) -> R
1314 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1316 let interners = CtxtInterners::new(arena);
1317 tls::enter(self, &interners, f)
1321 /// A trait implemented for all X<'a> types which can be safely and
1322 /// efficiently converted to X<'tcx> as long as they are part of the
1323 /// provided TyCtxt<'tcx>.
1324 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1325 /// by looking them up in their respective interners.
1327 /// However, this is still not the best implementation as it does
1328 /// need to compare the components, even for interned values.
1329 /// It would be more efficient if TypedArena provided a way to
1330 /// determine whether the address is in the allocated range.
1332 /// None is returned if the value or one of the components is not part
1333 /// of the provided context.
1334 /// For Ty, None can be returned if either the type interner doesn't
1335 /// contain the TypeVariants key or if the address of the interned
1336 /// pointer differs. The latter case is possible if a primitive type,
1337 /// e.g. `()` or `u8`, was interned in a different context.
1338 pub trait Lift<'tcx> {
1340 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1343 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1344 type Lifted = Ty<'tcx>;
1345 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1346 if tcx.interners.arena.in_arena(*self as *const _) {
1347 return Some(unsafe { mem::transmute(*self) });
1349 // Also try in the global tcx if we're not that.
1350 if !tcx.is_global() {
1351 self.lift_to_tcx(tcx.global_tcx())
1358 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1359 type Lifted = Region<'tcx>;
1360 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1361 if tcx.interners.arena.in_arena(*self as *const _) {
1362 return Some(unsafe { mem::transmute(*self) });
1364 // Also try in the global tcx if we're not that.
1365 if !tcx.is_global() {
1366 self.lift_to_tcx(tcx.global_tcx())
1373 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1374 type Lifted = &'tcx Const<'tcx>;
1375 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1376 if tcx.interners.arena.in_arena(*self as *const _) {
1377 return Some(unsafe { mem::transmute(*self) });
1379 // Also try in the global tcx if we're not that.
1380 if !tcx.is_global() {
1381 self.lift_to_tcx(tcx.global_tcx())
1388 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1389 type Lifted = &'tcx Substs<'tcx>;
1390 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1391 if self.len() == 0 {
1392 return Some(Slice::empty());
1394 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1395 return Some(unsafe { mem::transmute(*self) });
1397 // Also try in the global tcx if we're not that.
1398 if !tcx.is_global() {
1399 self.lift_to_tcx(tcx.global_tcx())
1406 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Ty<'a>> {
1407 type Lifted = &'tcx Slice<Ty<'tcx>>;
1408 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1409 -> Option<&'tcx Slice<Ty<'tcx>>> {
1410 if self.len() == 0 {
1411 return Some(Slice::empty());
1413 if tcx.interners.arena.in_arena(*self as *const _) {
1414 return Some(unsafe { mem::transmute(*self) });
1416 // Also try in the global tcx if we're not that.
1417 if !tcx.is_global() {
1418 self.lift_to_tcx(tcx.global_tcx())
1425 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<ExistentialPredicate<'a>> {
1426 type Lifted = &'tcx Slice<ExistentialPredicate<'tcx>>;
1427 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1428 -> Option<&'tcx Slice<ExistentialPredicate<'tcx>>> {
1429 if self.is_empty() {
1430 return Some(Slice::empty());
1432 if tcx.interners.arena.in_arena(*self as *const _) {
1433 return Some(unsafe { mem::transmute(*self) });
1435 // Also try in the global tcx if we're not that.
1436 if !tcx.is_global() {
1437 self.lift_to_tcx(tcx.global_tcx())
1444 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Predicate<'a>> {
1445 type Lifted = &'tcx Slice<Predicate<'tcx>>;
1446 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1447 -> Option<&'tcx Slice<Predicate<'tcx>>> {
1448 if self.is_empty() {
1449 return Some(Slice::empty());
1451 if tcx.interners.arena.in_arena(*self as *const _) {
1452 return Some(unsafe { mem::transmute(*self) });
1454 // Also try in the global tcx if we're not that.
1455 if !tcx.is_global() {
1456 self.lift_to_tcx(tcx.global_tcx())
1464 use super::{CtxtInterners, GlobalCtxt, TyCtxt};
1466 use std::cell::Cell;
1470 /// Marker types used for the scoped TLS slot.
1471 /// The type context cannot be used directly because the scoped TLS
1472 /// in libstd doesn't allow types generic over lifetimes.
1473 enum ThreadLocalGlobalCtxt {}
1474 enum ThreadLocalInterners {}
1477 static TLS_TCX: Cell<Option<(*const ThreadLocalGlobalCtxt,
1478 *const ThreadLocalInterners)>> = Cell::new(None)
1481 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter) -> fmt::Result {
1483 write!(f, "{}", tcx.sess.codemap().span_to_string(span))
1487 pub fn enter_global<'gcx, F, R>(gcx: GlobalCtxt<'gcx>, f: F) -> R
1488 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
1490 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1491 let original_span_debug = span_dbg.get();
1492 span_dbg.set(span_debug);
1493 let result = enter(&gcx, &gcx.global_interners, f);
1494 span_dbg.set(original_span_debug);
1499 pub fn enter<'a, 'gcx: 'tcx, 'tcx, F, R>(gcx: &'a GlobalCtxt<'gcx>,
1500 interners: &'a CtxtInterners<'tcx>,
1502 where F: FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1504 let gcx_ptr = gcx as *const _ as *const ThreadLocalGlobalCtxt;
1505 let interners_ptr = interners as *const _ as *const ThreadLocalInterners;
1506 TLS_TCX.with(|tls| {
1507 let prev = tls.get();
1508 tls.set(Some((gcx_ptr, interners_ptr)));
1509 let ret = f(TyCtxt {
1518 pub fn with<F, R>(f: F) -> R
1519 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1521 TLS_TCX.with(|tcx| {
1522 let (gcx, interners) = tcx.get().unwrap();
1523 let gcx = unsafe { &*(gcx as *const GlobalCtxt) };
1524 let interners = unsafe { &*(interners as *const CtxtInterners) };
1532 pub fn with_opt<F, R>(f: F) -> R
1533 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
1535 if TLS_TCX.with(|tcx| tcx.get().is_some()) {
1536 with(|v| f(Some(v)))
1543 macro_rules! sty_debug_print {
1544 ($ctxt: expr, $($variant: ident),*) => {{
1545 // curious inner module to allow variant names to be used as
1547 #[allow(non_snake_case)]
1549 use ty::{self, TyCtxt};
1550 use ty::context::Interned;
1552 #[derive(Copy, Clone)]
1555 region_infer: usize,
1560 pub fn go(tcx: TyCtxt) {
1561 let mut total = DebugStat {
1563 region_infer: 0, ty_infer: 0, both_infer: 0,
1565 $(let mut $variant = total;)*
1568 for &Interned(t) in tcx.interners.type_.borrow().iter() {
1569 let variant = match t.sty {
1570 ty::TyBool | ty::TyChar | ty::TyInt(..) | ty::TyUint(..) |
1571 ty::TyFloat(..) | ty::TyStr | ty::TyNever => continue,
1572 ty::TyError => /* unimportant */ continue,
1573 $(ty::$variant(..) => &mut $variant,)*
1575 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
1576 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
1580 if region { total.region_infer += 1; variant.region_infer += 1 }
1581 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
1582 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
1584 println!("Ty interner total ty region both");
1585 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
1586 {ty:4.1}% {region:5.1}% {both:4.1}%",
1587 stringify!($variant),
1588 uses = $variant.total,
1589 usespc = $variant.total as f64 * 100.0 / total.total as f64,
1590 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
1591 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
1592 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
1594 println!(" total {uses:6} \
1595 {ty:4.1}% {region:5.1}% {both:4.1}%",
1597 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
1598 region = total.region_infer as f64 * 100.0 / total.total as f64,
1599 both = total.both_infer as f64 * 100.0 / total.total as f64)
1607 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1608 pub fn print_debug_stats(self) {
1611 TyAdt, TyArray, TySlice, TyRawPtr, TyRef, TyFnDef, TyFnPtr, TyGenerator,
1612 TyDynamic, TyClosure, TyTuple, TyParam, TyInfer, TyProjection, TyAnon);
1614 println!("Substs interner: #{}", self.interners.substs.borrow().len());
1615 println!("Region interner: #{}", self.interners.region.borrow().len());
1616 println!("Stability interner: #{}", self.stability_interner.borrow().len());
1617 println!("Layout interner: #{}", self.layout_interner.borrow().len());
1622 /// An entry in an interner.
1623 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
1625 // NB: An Interned<Ty> compares and hashes as a sty.
1626 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
1627 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
1628 self.0.sty == other.0.sty
1632 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
1634 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
1635 fn hash<H: Hasher>(&self, s: &mut H) {
1640 impl<'tcx: 'lcx, 'lcx> Borrow<TypeVariants<'lcx>> for Interned<'tcx, TyS<'tcx>> {
1641 fn borrow<'a>(&'a self) -> &'a TypeVariants<'lcx> {
1646 // NB: An Interned<Slice<T>> compares and hashes as its elements.
1647 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, Slice<T>> {
1648 fn eq(&self, other: &Interned<'tcx, Slice<T>>) -> bool {
1649 self.0[..] == other.0[..]
1653 impl<'tcx, T: Eq> Eq for Interned<'tcx, Slice<T>> {}
1655 impl<'tcx, T: Hash> Hash for Interned<'tcx, Slice<T>> {
1656 fn hash<H: Hasher>(&self, s: &mut H) {
1661 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, Slice<Ty<'tcx>>> {
1662 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
1667 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
1668 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
1673 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
1674 fn borrow<'a>(&'a self) -> &'a RegionKind {
1679 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
1680 for Interned<'tcx, Slice<ExistentialPredicate<'tcx>>> {
1681 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
1686 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
1687 for Interned<'tcx, Slice<Predicate<'tcx>>> {
1688 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
1693 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
1694 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
1699 macro_rules! intern_method {
1700 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
1701 $alloc_method:ident,
1704 $needs_infer:expr) -> $ty:ty) => {
1705 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
1706 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
1708 let key = ($alloc_to_key)(&v);
1709 if let Some(i) = self.interners.$name.borrow().get(key) {
1712 if !self.is_global() {
1713 if let Some(i) = self.global_interners.$name.borrow().get(key) {
1719 // HACK(eddyb) Depend on flags being accurate to
1720 // determine that all contents are in the global tcx.
1721 // See comments on Lift for why we can't use that.
1722 if !($needs_infer)(&v) {
1723 if !self.is_global() {
1727 let i = ($alloc_to_ret)(self.global_interners.arena.$alloc_method(v));
1728 self.global_interners.$name.borrow_mut().insert(Interned(i));
1732 // Make sure we don't end up with inference
1733 // types/regions in the global tcx.
1734 if self.is_global() {
1735 bug!("Attempted to intern `{:?}` which contains \
1736 inference types/regions in the global type context",
1741 let i = ($alloc_to_ret)(self.interners.arena.$alloc_method(v));
1742 self.interners.$name.borrow_mut().insert(Interned(i));
1749 macro_rules! direct_interners {
1750 ($lt_tcx:tt, $($name:ident: $method:ident($needs_infer:expr) -> $ty:ty),+) => {
1751 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
1752 fn eq(&self, other: &Self) -> bool {
1757 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
1759 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
1760 fn hash<H: Hasher>(&self, s: &mut H) {
1765 intern_method!($lt_tcx, $name: $method($ty, alloc, |x| x, |x| x, $needs_infer) -> $ty);)+
1769 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
1770 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
1773 direct_interners!('tcx,
1774 region: mk_region(|r| {
1776 &ty::ReVar(_) | &ty::ReSkolemized(..) => true,
1780 const_: mk_const(|c: &Const| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>
1783 macro_rules! slice_interners {
1784 ($($field:ident: $method:ident($ty:ident)),+) => (
1785 $(intern_method!('tcx, $field: $method(&[$ty<'tcx>], alloc_slice, Deref::deref,
1786 |xs: &[$ty]| -> &Slice<$ty> {
1787 unsafe { mem::transmute(xs) }
1788 }, |xs: &[$ty]| xs.iter().any(keep_local)) -> Slice<$ty<'tcx>>);)+
1793 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
1794 predicates: _intern_predicates(Predicate),
1795 type_list: _intern_type_list(Ty),
1796 substs: _intern_substs(Kind)
1799 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1800 /// Create an unsafe fn ty based on a safe fn ty.
1801 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
1802 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
1803 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
1804 unsafety: hir::Unsafety::Unsafe,
1809 // Interns a type/name combination, stores the resulting box in cx.interners,
1810 // and returns the box as cast to an unsafe ptr (see comments for Ty above).
1811 pub fn mk_ty(self, st: TypeVariants<'tcx>) -> Ty<'tcx> {
1812 let global_interners = if !self.is_global() {
1813 Some(&self.global_interners)
1817 self.interners.intern_ty(st, global_interners)
1820 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
1822 ast::IntTy::Is => self.types.isize,
1823 ast::IntTy::I8 => self.types.i8,
1824 ast::IntTy::I16 => self.types.i16,
1825 ast::IntTy::I32 => self.types.i32,
1826 ast::IntTy::I64 => self.types.i64,
1827 ast::IntTy::I128 => self.types.i128,
1831 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
1833 ast::UintTy::Us => self.types.usize,
1834 ast::UintTy::U8 => self.types.u8,
1835 ast::UintTy::U16 => self.types.u16,
1836 ast::UintTy::U32 => self.types.u32,
1837 ast::UintTy::U64 => self.types.u64,
1838 ast::UintTy::U128 => self.types.u128,
1842 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
1844 ast::FloatTy::F32 => self.types.f32,
1845 ast::FloatTy::F64 => self.types.f64,
1849 pub fn mk_str(self) -> Ty<'tcx> {
1853 pub fn mk_static_str(self) -> Ty<'tcx> {
1854 self.mk_imm_ref(self.types.re_static, self.mk_str())
1857 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
1858 // take a copy of substs so that we own the vectors inside
1859 self.mk_ty(TyAdt(def, substs))
1862 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1863 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
1864 let adt_def = self.adt_def(def_id);
1865 let substs = self.mk_substs(iter::once(Kind::from(ty)));
1866 self.mk_ty(TyAdt(adt_def, substs))
1869 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
1870 self.mk_ty(TyRawPtr(tm))
1873 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
1874 self.mk_ty(TyRef(r, tm))
1877 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
1878 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
1881 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
1882 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
1885 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1886 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
1889 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1890 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
1893 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
1894 self.mk_imm_ptr(self.mk_nil())
1897 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
1898 let n = ConstUsize::new(n, self.sess.target.usize_ty).unwrap();
1899 self.mk_array_const_usize(ty, n)
1902 pub fn mk_array_const_usize(self, ty: Ty<'tcx>, n: ConstUsize) -> Ty<'tcx> {
1903 self.mk_ty(TyArray(ty, self.mk_const(ty::Const {
1904 val: ConstVal::Integral(ConstInt::Usize(n)),
1905 ty: self.types.usize
1909 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
1910 self.mk_ty(TySlice(ty))
1913 pub fn intern_tup(self, ts: &[Ty<'tcx>], defaulted: bool) -> Ty<'tcx> {
1914 self.mk_ty(TyTuple(self.intern_type_list(ts), defaulted))
1917 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I,
1918 defaulted: bool) -> I::Output {
1919 iter.intern_with(|ts| self.mk_ty(TyTuple(self.intern_type_list(ts), defaulted)))
1922 pub fn mk_nil(self) -> Ty<'tcx> {
1923 self.intern_tup(&[], false)
1926 pub fn mk_diverging_default(self) -> Ty<'tcx> {
1927 if self.sess.features.borrow().never_type {
1930 self.intern_tup(&[], true)
1934 pub fn mk_bool(self) -> Ty<'tcx> {
1938 pub fn mk_fn_def(self, def_id: DefId,
1939 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
1940 self.mk_ty(TyFnDef(def_id, substs))
1943 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
1944 self.mk_ty(TyFnPtr(fty))
1949 obj: ty::Binder<&'tcx Slice<ExistentialPredicate<'tcx>>>,
1950 reg: ty::Region<'tcx>
1952 self.mk_ty(TyDynamic(obj, reg))
1955 pub fn mk_projection(self,
1957 substs: &'tcx Substs<'tcx>)
1959 self.mk_ty(TyProjection(ProjectionTy {
1965 pub fn mk_closure(self,
1967 substs: &'tcx Substs<'tcx>)
1969 self.mk_closure_from_closure_substs(closure_id, ClosureSubsts {
1974 pub fn mk_closure_from_closure_substs(self,
1976 closure_substs: ClosureSubsts<'tcx>)
1978 self.mk_ty(TyClosure(closure_id, closure_substs))
1981 pub fn mk_generator(self,
1983 closure_substs: ClosureSubsts<'tcx>,
1984 interior: GeneratorInterior<'tcx>)
1986 self.mk_ty(TyGenerator(id, closure_substs, interior))
1989 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
1990 self.mk_infer(TyVar(v))
1993 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
1994 self.mk_infer(IntVar(v))
1997 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
1998 self.mk_infer(FloatVar(v))
2001 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2002 self.mk_ty(TyInfer(it))
2005 pub fn mk_param(self,
2007 name: Name) -> Ty<'tcx> {
2008 self.mk_ty(TyParam(ParamTy { idx: index, name: name }))
2011 pub fn mk_self_type(self) -> Ty<'tcx> {
2012 self.mk_param(0, keywords::SelfType.name())
2015 pub fn mk_param_from_def(self, def: &ty::TypeParameterDef) -> Ty<'tcx> {
2016 self.mk_param(def.index, def.name)
2019 pub fn mk_anon(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2020 self.mk_ty(TyAnon(def_id, substs))
2023 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2024 -> &'tcx Slice<ExistentialPredicate<'tcx>> {
2025 assert!(!eps.is_empty());
2026 assert!(eps.windows(2).all(|w| w[0].cmp(self, &w[1]) != Ordering::Greater));
2027 self._intern_existential_predicates(eps)
2030 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2031 -> &'tcx Slice<Predicate<'tcx>> {
2032 // FIXME consider asking the input slice to be sorted to avoid
2033 // re-interning permutations, in which case that would be asserted
2035 if preds.len() == 0 {
2036 // The macro-generated method below asserts we don't intern an empty slice.
2039 self._intern_predicates(preds)
2043 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx Slice<Ty<'tcx>> {
2047 self._intern_type_list(ts)
2051 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx Slice<Kind<'tcx>> {
2055 self._intern_substs(ts)
2059 pub fn mk_fn_sig<I>(self,
2063 unsafety: hir::Unsafety,
2065 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2067 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2069 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2070 inputs_and_output: self.intern_type_list(xs),
2071 variadic, unsafety, abi
2075 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2076 &'tcx Slice<ExistentialPredicate<'tcx>>>>(self, iter: I)
2078 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2081 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2082 &'tcx Slice<Predicate<'tcx>>>>(self, iter: I)
2084 iter.intern_with(|xs| self.intern_predicates(xs))
2087 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2088 &'tcx Slice<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2089 iter.intern_with(|xs| self.intern_type_list(xs))
2092 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2093 &'tcx Slice<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2094 iter.intern_with(|xs| self.intern_substs(xs))
2097 pub fn mk_substs_trait(self,
2100 -> &'tcx Substs<'tcx>
2102 self.mk_substs(iter::once(s).chain(t.into_iter().cloned()).map(Kind::from))
2105 pub fn lint_node<S: Into<MultiSpan>>(self,
2106 lint: &'static Lint,
2110 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2113 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2114 lint: &'static Lint,
2119 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2124 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2125 -> (lint::Level, lint::LintSource)
2127 // Right now we insert a `with_ignore` node in the dep graph here to
2128 // ignore the fact that `lint_levels` below depends on the entire crate.
2129 // For now this'll prevent false positives of recompiling too much when
2130 // anything changes.
2132 // Once red/green incremental compilation lands we should be able to
2133 // remove this because while the crate changes often the lint level map
2134 // will change rarely.
2135 self.dep_graph.with_ignore(|| {
2136 let sets = self.lint_levels(LOCAL_CRATE);
2138 let hir_id = self.hir.definitions().node_to_hir_id(id);
2139 if let Some(pair) = sets.level_and_source(lint, hir_id) {
2142 let next = self.hir.get_parent_node(id);
2144 bug!("lint traversal reached the root of the crate");
2151 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2152 lint: &'static Lint,
2156 -> DiagnosticBuilder<'tcx>
2158 let (level, src) = self.lint_level_at_node(lint, id);
2159 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2162 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2163 -> DiagnosticBuilder<'tcx>
2165 let (level, src) = self.lint_level_at_node(lint, id);
2166 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2169 pub fn in_scope_traits(self, id: HirId) -> Option<Rc<StableVec<TraitCandidate>>> {
2170 self.in_scope_traits_map(id.owner)
2171 .and_then(|map| map.get(&id.local_id).cloned())
2174 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2175 self.named_region_map(id.owner)
2176 .and_then(|map| map.get(&id.local_id).cloned())
2179 pub fn is_late_bound(self, id: HirId) -> bool {
2180 self.is_late_bound_map(id.owner)
2181 .map(|set| set.contains(&id.local_id))
2185 pub fn object_lifetime_defaults(self, id: HirId)
2186 -> Option<Rc<Vec<ObjectLifetimeDefault>>>
2188 self.object_lifetime_defaults_map(id.owner)
2189 .and_then(|map| map.get(&id.local_id).cloned())
2193 pub trait InternAs<T: ?Sized, R> {
2195 fn intern_with<F>(self, f: F) -> Self::Output
2196 where F: FnOnce(&T) -> R;
2199 impl<I, T, R, E> InternAs<[T], R> for I
2200 where E: InternIteratorElement<T, R>,
2201 I: Iterator<Item=E> {
2202 type Output = E::Output;
2203 fn intern_with<F>(self, f: F) -> Self::Output
2204 where F: FnOnce(&[T]) -> R {
2205 E::intern_with(self, f)
2209 pub trait InternIteratorElement<T, R>: Sized {
2211 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2214 impl<T, R> InternIteratorElement<T, R> for T {
2216 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2217 f(&iter.collect::<AccumulateVec<[_; 8]>>())
2221 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2225 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2226 f(&iter.cloned().collect::<AccumulateVec<[_; 8]>>())
2230 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2231 type Output = Result<R, E>;
2232 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2233 Ok(f(&iter.collect::<Result<AccumulateVec<[_; 8]>, _>>()?))
2237 struct NamedRegionMap {
2238 defs: FxHashMap<DefIndex, Rc<FxHashMap<ItemLocalId, resolve_lifetime::Region>>>,
2239 late_bound: FxHashMap<DefIndex, Rc<FxHashSet<ItemLocalId>>>,
2240 object_lifetime_defaults:
2243 Rc<FxHashMap<ItemLocalId, Rc<Vec<ObjectLifetimeDefault>>>>,
2247 pub fn provide(providers: &mut ty::maps::Providers) {
2248 // FIXME(#44234) - almost all of these queries have no sub-queries and
2249 // therefore no actual inputs, they're just reading tables calculated in
2250 // resolve! Does this work? Unsure! That's what the issue is about
2251 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2252 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2253 providers.named_region_map = |tcx, id| tcx.gcx.named_region_map.defs.get(&id).cloned();
2254 providers.is_late_bound_map = |tcx, id| tcx.gcx.named_region_map.late_bound.get(&id).cloned();
2255 providers.object_lifetime_defaults_map = |tcx, id| {
2256 tcx.gcx.named_region_map.object_lifetime_defaults.get(&id).cloned()
2258 providers.crate_name = |tcx, id| {
2259 assert_eq!(id, LOCAL_CRATE);
2262 providers.get_lang_items = |tcx, id| {
2263 assert_eq!(id, LOCAL_CRATE);
2264 // FIXME(#42293) Right now we insert a `with_ignore` node in the dep
2265 // graph here to ignore the fact that `get_lang_items` below depends on
2266 // the entire crate. For now this'll prevent false positives of
2267 // recompiling too much when anything changes.
2269 // Once red/green incremental compilation lands we should be able to
2270 // remove this because while the crate changes often the lint level map
2271 // will change rarely.
2272 tcx.dep_graph.with_ignore(|| Rc::new(middle::lang_items::collect(tcx)))
2274 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
2275 providers.maybe_unused_trait_import = |tcx, id| {
2276 tcx.maybe_unused_trait_imports.contains(&id)
2278 providers.maybe_unused_extern_crates = |tcx, cnum| {
2279 assert_eq!(cnum, LOCAL_CRATE);
2280 Rc::new(tcx.maybe_unused_extern_crates.clone())
2283 providers.stability_index = |tcx, cnum| {
2284 assert_eq!(cnum, LOCAL_CRATE);
2285 Rc::new(stability::Index::new(tcx))
2287 providers.lookup_stability = |tcx, id| {
2288 assert_eq!(id.krate, LOCAL_CRATE);
2289 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
2290 tcx.stability().local_stability(id)
2292 providers.lookup_deprecation_entry = |tcx, id| {
2293 assert_eq!(id.krate, LOCAL_CRATE);
2294 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
2295 tcx.stability().local_deprecation_entry(id)
2297 providers.extern_mod_stmt_cnum = |tcx, id| {
2298 let id = tcx.hir.as_local_node_id(id).unwrap();
2299 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
2301 providers.all_crate_nums = |tcx, cnum| {
2302 assert_eq!(cnum, LOCAL_CRATE);
2303 Rc::new(tcx.cstore.crates_untracked())
2305 providers.postorder_cnums = |tcx, cnum| {
2306 assert_eq!(cnum, LOCAL_CRATE);
2307 Rc::new(tcx.cstore.postorder_cnums_untracked())
2309 providers.output_filenames = |tcx, cnum| {
2310 assert_eq!(cnum, LOCAL_CRATE);
2311 tcx.output_filenames.clone()
2313 providers.has_copy_closures = |tcx, cnum| {
2314 assert_eq!(cnum, LOCAL_CRATE);
2315 tcx.sess.features.borrow().copy_closures
2317 providers.has_clone_closures = |tcx, cnum| {
2318 assert_eq!(cnum, LOCAL_CRATE);
2319 tcx.sess.features.borrow().clone_closures
2321 providers.fully_normalize_monormophic_ty = |tcx, ty| {
2322 tcx.fully_normalize_associated_types_in(&ty)