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::{BorrowckMode, OutputFilenames, OptLevel};
18 use session::config::CrateType::*;
20 use hir::{TraitCandidate, HirId, ItemLocalId};
21 use hir::def::{Def, Export};
22 use hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
23 use hir::map as hir_map;
24 use hir::map::DefPathHash;
25 use lint::{self, Lint};
26 use ich::{StableHashingContext, NodeIdHashingMode};
27 use infer::canonical::{CanonicalVarInfo, CanonicalVarInfos};
28 use infer::outlives::free_region_map::FreeRegionMap;
29 use middle::cstore::{CrateStoreDyn, LinkMeta};
30 use middle::cstore::EncodedMetadata;
31 use middle::lang_items;
32 use middle::resolve_lifetime::{self, ObjectLifetimeDefault};
33 use middle::stability;
34 use mir::{self, Mir, interpret};
35 use mir::interpret::Allocation;
36 use ty::subst::{Kind, Substs, Subst};
40 use traits::{Clause, Clauses, Goal, Goals};
41 use ty::{self, Ty, TypeAndMut};
42 use ty::{TyS, TypeVariants, Slice};
43 use ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorSubsts, Region, Const};
44 use ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
46 use ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid};
47 use ty::TypeVariants::*;
48 use ty::GenericParamDefKind;
49 use ty::layout::{LayoutDetails, TargetDataLayout};
54 use util::nodemap::{DefIdSet, ItemLocalMap};
55 use util::nodemap::{FxHashMap, FxHashSet};
56 use rustc_data_structures::accumulate_vec::AccumulateVec;
57 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
58 StableHasher, StableHasherResult,
60 use arena::{TypedArena, SyncDroplessArena};
61 use rustc_data_structures::indexed_vec::IndexVec;
62 use rustc_data_structures::sync::{Lrc, Lock};
64 use std::borrow::Borrow;
65 use std::cmp::Ordering;
66 use std::collections::hash_map::{self, Entry};
67 use std::hash::{Hash, Hasher};
73 use rustc_target::spec::abi;
74 use syntax::ast::{self, NodeId};
76 use syntax::codemap::MultiSpan;
77 use syntax::feature_gate;
78 use syntax::symbol::{Symbol, keywords, InternedString};
83 pub struct AllArenas<'tcx> {
84 pub global: GlobalArenas<'tcx>,
85 pub interner: SyncDroplessArena,
88 impl<'tcx> AllArenas<'tcx> {
89 pub fn new() -> Self {
91 global: GlobalArenas::new(),
92 interner: SyncDroplessArena::new(),
98 pub struct GlobalArenas<'tcx> {
100 layout: TypedArena<LayoutDetails>,
103 generics: TypedArena<ty::Generics>,
104 trait_def: TypedArena<ty::TraitDef>,
105 adt_def: TypedArena<ty::AdtDef>,
106 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
107 mir: TypedArena<Mir<'tcx>>,
108 tables: TypedArena<ty::TypeckTables<'tcx>>,
110 const_allocs: TypedArena<interpret::Allocation>,
113 impl<'tcx> GlobalArenas<'tcx> {
114 pub fn new() -> GlobalArenas<'tcx> {
116 layout: TypedArena::new(),
117 generics: TypedArena::new(),
118 trait_def: TypedArena::new(),
119 adt_def: TypedArena::new(),
120 steal_mir: TypedArena::new(),
121 mir: TypedArena::new(),
122 tables: TypedArena::new(),
123 const_allocs: TypedArena::new(),
128 type InternedSet<'tcx, T> = Lock<FxHashSet<Interned<'tcx, T>>>;
130 pub struct CtxtInterners<'tcx> {
131 /// The arena that types, regions, etc are allocated from
132 arena: &'tcx SyncDroplessArena,
134 /// Specifically use a speedy hash algorithm for these hash sets,
135 /// they're accessed quite often.
136 type_: InternedSet<'tcx, TyS<'tcx>>,
137 type_list: InternedSet<'tcx, Slice<Ty<'tcx>>>,
138 substs: InternedSet<'tcx, Substs<'tcx>>,
139 canonical_var_infos: InternedSet<'tcx, Slice<CanonicalVarInfo>>,
140 region: InternedSet<'tcx, RegionKind>,
141 existential_predicates: InternedSet<'tcx, Slice<ExistentialPredicate<'tcx>>>,
142 predicates: InternedSet<'tcx, Slice<Predicate<'tcx>>>,
143 const_: InternedSet<'tcx, Const<'tcx>>,
144 clauses: InternedSet<'tcx, Slice<Clause<'tcx>>>,
145 goals: InternedSet<'tcx, Slice<Goal<'tcx>>>,
148 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
149 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
152 type_: Default::default(),
153 type_list: Default::default(),
154 substs: Default::default(),
155 region: Default::default(),
156 existential_predicates: Default::default(),
157 canonical_var_infos: Default::default(),
158 predicates: Default::default(),
159 const_: Default::default(),
160 clauses: Default::default(),
161 goals: Default::default(),
167 local: &CtxtInterners<'tcx>,
168 global: &CtxtInterners<'gcx>,
169 st: TypeVariants<'tcx>
171 let flags = super::flags::FlagComputation::for_sty(&st);
173 // HACK(eddyb) Depend on flags being accurate to
174 // determine that all contents are in the global tcx.
175 // See comments on Lift for why we can't use that.
176 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
177 let mut interner = local.type_.borrow_mut();
178 if let Some(&Interned(ty)) = interner.get(&st) {
182 let ty_struct = TyS {
185 region_depth: flags.depth,
188 // Make sure we don't end up with inference
189 // types/regions in the global interner
190 if local as *const _ as usize == global as *const _ as usize {
191 bug!("Attempted to intern `{:?}` which contains \
192 inference types/regions in the global type context",
196 // Don't be &mut TyS.
197 let ty: Ty<'tcx> = local.arena.alloc(ty_struct);
198 interner.insert(Interned(ty));
201 let mut interner = global.type_.borrow_mut();
202 if let Some(&Interned(ty)) = interner.get(&st) {
206 let ty_struct = TyS {
209 region_depth: flags.depth,
212 // This is safe because all the types the ty_struct can point to
213 // already is in the global arena
214 let ty_struct: TyS<'gcx> = unsafe {
215 mem::transmute(ty_struct)
218 // Don't be &mut TyS.
219 let ty: Ty<'gcx> = global.arena.alloc(ty_struct);
220 interner.insert(Interned(ty));
226 pub struct CommonTypes<'tcx> {
246 pub re_empty: Region<'tcx>,
247 pub re_static: Region<'tcx>,
248 pub re_erased: Region<'tcx>,
251 pub struct LocalTableInContext<'a, V: 'a> {
252 local_id_root: Option<DefId>,
253 data: &'a ItemLocalMap<V>
256 /// Validate that the given HirId (respectively its `local_id` part) can be
257 /// safely used as a key in the tables of a TypeckTable. For that to be
258 /// the case, the HirId must have the same `owner` as all the other IDs in
259 /// this table (signified by `local_id_root`). Otherwise the HirId
260 /// would be in a different frame of reference and using its `local_id`
261 /// would result in lookup errors, or worse, in silently wrong data being
263 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
266 if cfg!(debug_assertions) {
267 if let Some(local_id_root) = local_id_root {
268 if hir_id.owner != local_id_root.index {
269 ty::tls::with(|tcx| {
270 let node_id = tcx.hir
272 .find_node_for_hir_id(hir_id);
274 bug!("node {} with HirId::owner {:?} cannot be placed in \
275 TypeckTables with local_id_root {:?}",
276 tcx.hir.node_to_string(node_id),
277 DefId::local(hir_id.owner),
282 // We use "Null Object" TypeckTables in some of the analysis passes.
283 // These are just expected to be empty and their `local_id_root` is
284 // `None`. Therefore we cannot verify whether a given `HirId` would
285 // be a valid key for the given table. Instead we make sure that
286 // nobody tries to write to such a Null Object table.
288 bug!("access to invalid TypeckTables")
294 impl<'a, V> LocalTableInContext<'a, V> {
295 pub fn contains_key(&self, id: hir::HirId) -> bool {
296 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
297 self.data.contains_key(&id.local_id)
300 pub fn get(&self, id: hir::HirId) -> Option<&V> {
301 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
302 self.data.get(&id.local_id)
305 pub fn iter(&self) -> hash_map::Iter<hir::ItemLocalId, V> {
310 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
313 fn index(&self, key: hir::HirId) -> &V {
314 self.get(key).expect("LocalTableInContext: key not found")
318 pub struct LocalTableInContextMut<'a, V: 'a> {
319 local_id_root: Option<DefId>,
320 data: &'a mut ItemLocalMap<V>
323 impl<'a, V> LocalTableInContextMut<'a, V> {
324 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
325 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
326 self.data.get_mut(&id.local_id)
329 pub fn entry(&mut self, id: hir::HirId) -> Entry<hir::ItemLocalId, V> {
330 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
331 self.data.entry(id.local_id)
334 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
335 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
336 self.data.insert(id.local_id, val)
339 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
340 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
341 self.data.remove(&id.local_id)
345 #[derive(RustcEncodable, RustcDecodable, Debug)]
346 pub struct TypeckTables<'tcx> {
347 /// The HirId::owner all ItemLocalIds in this table are relative to.
348 pub local_id_root: Option<DefId>,
350 /// Resolved definitions for `<T>::X` associated paths and
351 /// method calls, including those of overloaded operators.
352 type_dependent_defs: ItemLocalMap<Def>,
354 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
355 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
356 /// about the field you also need definition of the variant to which the field
357 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
358 field_indices: ItemLocalMap<usize>,
360 /// Stores the canonicalized types provided by the user. See also `UserAssertTy` statement in
362 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
364 /// Stores the types for various nodes in the AST. Note that this table
365 /// is not guaranteed to be populated until after typeck. See
366 /// typeck::check::fn_ctxt for details.
367 node_types: ItemLocalMap<Ty<'tcx>>,
369 /// Stores the type parameters which were substituted to obtain the type
370 /// of this node. This only applies to nodes that refer to entities
371 /// parameterized by type parameters, such as generic fns, types, or
373 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
375 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
377 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
378 pat_binding_modes: ItemLocalMap<BindingMode>,
380 /// Stores the types which were implicitly dereferenced in pattern binding modes
381 /// for later usage in HAIR lowering. For example,
384 /// match &&Some(5i32) {
389 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
392 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
393 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
396 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
398 /// Records the reasons that we picked the kind of each closure;
399 /// not all closures are present in the map.
400 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
402 /// For each fn, records the "liberated" types of its arguments
403 /// and return type. Liberated means that all bound regions
404 /// (including late-bound regions) are replaced with free
405 /// equivalents. This table is not used in codegen (since regions
406 /// are erased there) and hence is not serialized to metadata.
407 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
409 /// For each FRU expression, record the normalized types of the fields
410 /// of the struct - this is needed because it is non-trivial to
411 /// normalize while preserving regions. This table is used only in
412 /// MIR construction and hence is not serialized to metadata.
413 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
415 /// Maps a cast expression to its kind. This is keyed on the
416 /// *from* expression of the cast, not the cast itself.
417 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
419 /// Set of trait imports actually used in the method resolution.
420 /// This is used for warning unused imports. During type
421 /// checking, this `Lrc` should not be cloned: it must have a ref-count
422 /// of 1 so that we can insert things into the set mutably.
423 pub used_trait_imports: Lrc<DefIdSet>,
425 /// If any errors occurred while type-checking this body,
426 /// this field will be set to `true`.
427 pub tainted_by_errors: bool,
429 /// Stores the free-region relationships that were deduced from
430 /// its where clauses and parameter types. These are then
431 /// read-again by borrowck.
432 pub free_region_map: FreeRegionMap<'tcx>,
435 impl<'tcx> TypeckTables<'tcx> {
436 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
439 type_dependent_defs: ItemLocalMap(),
440 field_indices: ItemLocalMap(),
441 user_provided_tys: ItemLocalMap(),
442 node_types: ItemLocalMap(),
443 node_substs: ItemLocalMap(),
444 adjustments: ItemLocalMap(),
445 pat_binding_modes: ItemLocalMap(),
446 pat_adjustments: ItemLocalMap(),
447 upvar_capture_map: FxHashMap(),
448 closure_kind_origins: ItemLocalMap(),
449 liberated_fn_sigs: ItemLocalMap(),
450 fru_field_types: ItemLocalMap(),
451 cast_kinds: ItemLocalMap(),
452 used_trait_imports: Lrc::new(DefIdSet()),
453 tainted_by_errors: false,
454 free_region_map: FreeRegionMap::new(),
458 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
459 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
461 hir::QPath::Resolved(_, ref path) => path.def,
462 hir::QPath::TypeRelative(..) => {
463 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
464 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
469 pub fn type_dependent_defs(&self) -> LocalTableInContext<Def> {
470 LocalTableInContext {
471 local_id_root: self.local_id_root,
472 data: &self.type_dependent_defs
476 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<Def> {
477 LocalTableInContextMut {
478 local_id_root: self.local_id_root,
479 data: &mut self.type_dependent_defs
483 pub fn field_indices(&self) -> LocalTableInContext<usize> {
484 LocalTableInContext {
485 local_id_root: self.local_id_root,
486 data: &self.field_indices
490 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<usize> {
491 LocalTableInContextMut {
492 local_id_root: self.local_id_root,
493 data: &mut self.field_indices
497 pub fn user_provided_tys(&self) -> LocalTableInContext<CanonicalTy<'tcx>> {
498 LocalTableInContext {
499 local_id_root: self.local_id_root,
500 data: &self.user_provided_tys
504 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<CanonicalTy<'tcx>> {
505 LocalTableInContextMut {
506 local_id_root: self.local_id_root,
507 data: &mut self.user_provided_tys
511 pub fn node_types(&self) -> LocalTableInContext<Ty<'tcx>> {
512 LocalTableInContext {
513 local_id_root: self.local_id_root,
514 data: &self.node_types
518 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<Ty<'tcx>> {
519 LocalTableInContextMut {
520 local_id_root: self.local_id_root,
521 data: &mut self.node_types
525 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
526 match self.node_id_to_type_opt(id) {
529 bug!("node_id_to_type: no type for node `{}`",
531 let id = tcx.hir.definitions().find_node_for_hir_id(id);
532 tcx.hir.node_to_string(id)
538 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
539 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
540 self.node_types.get(&id.local_id).cloned()
543 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<&'tcx Substs<'tcx>> {
544 LocalTableInContextMut {
545 local_id_root: self.local_id_root,
546 data: &mut self.node_substs
550 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
551 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
552 self.node_substs.get(&id.local_id).cloned().unwrap_or(Substs::empty())
555 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
556 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
557 self.node_substs.get(&id.local_id).cloned()
560 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
561 // doesn't provide type parameter substitutions.
562 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
563 self.node_id_to_type(pat.hir_id)
566 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
567 self.node_id_to_type_opt(pat.hir_id)
570 // Returns the type of an expression as a monotype.
572 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
573 // some cases, we insert `Adjustment` annotations such as auto-deref or
574 // auto-ref. The type returned by this function does not consider such
575 // adjustments. See `expr_ty_adjusted()` instead.
577 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
578 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
579 // instead of "fn(ty) -> T with T = isize".
580 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
581 self.node_id_to_type(expr.hir_id)
584 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
585 self.node_id_to_type_opt(expr.hir_id)
588 pub fn adjustments(&self) -> LocalTableInContext<Vec<ty::adjustment::Adjustment<'tcx>>> {
589 LocalTableInContext {
590 local_id_root: self.local_id_root,
591 data: &self.adjustments
595 pub fn adjustments_mut(&mut self)
596 -> LocalTableInContextMut<Vec<ty::adjustment::Adjustment<'tcx>>> {
597 LocalTableInContextMut {
598 local_id_root: self.local_id_root,
599 data: &mut self.adjustments
603 pub fn expr_adjustments(&self, expr: &hir::Expr)
604 -> &[ty::adjustment::Adjustment<'tcx>] {
605 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
606 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
609 /// Returns the type of `expr`, considering any `Adjustment`
610 /// entry recorded for that expression.
611 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
612 self.expr_adjustments(expr)
614 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
617 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
618 self.expr_adjustments(expr)
620 .map(|adj| adj.target)
621 .or_else(|| self.expr_ty_opt(expr))
624 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
625 // Only paths and method calls/overloaded operators have
626 // entries in type_dependent_defs, ignore the former here.
627 if let hir::ExprPath(_) = expr.node {
631 match self.type_dependent_defs().get(expr.hir_id) {
632 Some(&Def::Method(_)) => true,
637 pub fn pat_binding_modes(&self) -> LocalTableInContext<BindingMode> {
638 LocalTableInContext {
639 local_id_root: self.local_id_root,
640 data: &self.pat_binding_modes
644 pub fn pat_binding_modes_mut(&mut self)
645 -> LocalTableInContextMut<BindingMode> {
646 LocalTableInContextMut {
647 local_id_root: self.local_id_root,
648 data: &mut self.pat_binding_modes
652 pub fn pat_adjustments(&self) -> LocalTableInContext<Vec<Ty<'tcx>>> {
653 LocalTableInContext {
654 local_id_root: self.local_id_root,
655 data: &self.pat_adjustments,
659 pub fn pat_adjustments_mut(&mut self)
660 -> LocalTableInContextMut<Vec<Ty<'tcx>>> {
661 LocalTableInContextMut {
662 local_id_root: self.local_id_root,
663 data: &mut self.pat_adjustments,
667 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
668 self.upvar_capture_map[&upvar_id]
671 pub fn closure_kind_origins(&self) -> LocalTableInContext<(Span, ast::Name)> {
672 LocalTableInContext {
673 local_id_root: self.local_id_root,
674 data: &self.closure_kind_origins
678 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<(Span, ast::Name)> {
679 LocalTableInContextMut {
680 local_id_root: self.local_id_root,
681 data: &mut self.closure_kind_origins
685 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<ty::FnSig<'tcx>> {
686 LocalTableInContext {
687 local_id_root: self.local_id_root,
688 data: &self.liberated_fn_sigs
692 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<ty::FnSig<'tcx>> {
693 LocalTableInContextMut {
694 local_id_root: self.local_id_root,
695 data: &mut self.liberated_fn_sigs
699 pub fn fru_field_types(&self) -> LocalTableInContext<Vec<Ty<'tcx>>> {
700 LocalTableInContext {
701 local_id_root: self.local_id_root,
702 data: &self.fru_field_types
706 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<Vec<Ty<'tcx>>> {
707 LocalTableInContextMut {
708 local_id_root: self.local_id_root,
709 data: &mut self.fru_field_types
713 pub fn cast_kinds(&self) -> LocalTableInContext<ty::cast::CastKind> {
714 LocalTableInContext {
715 local_id_root: self.local_id_root,
716 data: &self.cast_kinds
720 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<ty::cast::CastKind> {
721 LocalTableInContextMut {
722 local_id_root: self.local_id_root,
723 data: &mut self.cast_kinds
728 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
729 fn hash_stable<W: StableHasherResult>(&self,
730 hcx: &mut StableHashingContext<'a>,
731 hasher: &mut StableHasher<W>) {
732 let ty::TypeckTables {
734 ref type_dependent_defs,
736 ref user_provided_tys,
740 ref pat_binding_modes,
742 ref upvar_capture_map,
743 ref closure_kind_origins,
744 ref liberated_fn_sigs,
749 ref used_trait_imports,
754 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
755 type_dependent_defs.hash_stable(hcx, hasher);
756 field_indices.hash_stable(hcx, hasher);
757 user_provided_tys.hash_stable(hcx, hasher);
758 node_types.hash_stable(hcx, hasher);
759 node_substs.hash_stable(hcx, hasher);
760 adjustments.hash_stable(hcx, hasher);
761 pat_binding_modes.hash_stable(hcx, hasher);
762 pat_adjustments.hash_stable(hcx, hasher);
763 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
770 local_id_root.expect("trying to hash invalid TypeckTables");
772 let var_owner_def_id = DefId {
773 krate: local_id_root.krate,
776 let closure_def_id = DefId {
777 krate: local_id_root.krate,
778 index: closure_expr_id.to_def_id().index,
780 (hcx.def_path_hash(var_owner_def_id),
782 hcx.def_path_hash(closure_def_id))
785 closure_kind_origins.hash_stable(hcx, hasher);
786 liberated_fn_sigs.hash_stable(hcx, hasher);
787 fru_field_types.hash_stable(hcx, hasher);
788 cast_kinds.hash_stable(hcx, hasher);
789 used_trait_imports.hash_stable(hcx, hasher);
790 tainted_by_errors.hash_stable(hcx, hasher);
791 free_region_map.hash_stable(hcx, hasher);
796 impl<'tcx> CommonTypes<'tcx> {
797 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
798 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
799 let mk_region = |r| {
800 if let Some(r) = interners.region.borrow().get(&r) {
803 let r = interners.arena.alloc(r);
804 interners.region.borrow_mut().insert(Interned(r));
812 isize: mk(TyInt(ast::IntTy::Isize)),
813 i8: mk(TyInt(ast::IntTy::I8)),
814 i16: mk(TyInt(ast::IntTy::I16)),
815 i32: mk(TyInt(ast::IntTy::I32)),
816 i64: mk(TyInt(ast::IntTy::I64)),
817 i128: mk(TyInt(ast::IntTy::I128)),
818 usize: mk(TyUint(ast::UintTy::Usize)),
819 u8: mk(TyUint(ast::UintTy::U8)),
820 u16: mk(TyUint(ast::UintTy::U16)),
821 u32: mk(TyUint(ast::UintTy::U32)),
822 u64: mk(TyUint(ast::UintTy::U64)),
823 u128: mk(TyUint(ast::UintTy::U128)),
824 f32: mk(TyFloat(ast::FloatTy::F32)),
825 f64: mk(TyFloat(ast::FloatTy::F64)),
827 re_empty: mk_region(RegionKind::ReEmpty),
828 re_static: mk_region(RegionKind::ReStatic),
829 re_erased: mk_region(RegionKind::ReErased),
834 /// The central data structure of the compiler. It stores references
835 /// to the various **arenas** and also houses the results of the
836 /// various **compiler queries** that have been performed. See the
837 /// [rustc guide] for more details.
839 /// [rustc guide]: https://rust-lang-nursery.github.io/rustc-guide/ty.html
840 #[derive(Copy, Clone)]
841 pub struct TyCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
842 gcx: &'a GlobalCtxt<'gcx>,
843 interners: &'a CtxtInterners<'tcx>
846 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
847 type Target = &'a GlobalCtxt<'gcx>;
848 fn deref(&self) -> &Self::Target {
853 pub struct GlobalCtxt<'tcx> {
854 global_arenas: &'tcx GlobalArenas<'tcx>,
855 global_interners: CtxtInterners<'tcx>,
857 cstore: &'tcx CrateStoreDyn,
859 pub sess: &'tcx Session,
861 pub dep_graph: DepGraph,
863 /// This provides access to the incr. comp. on-disk cache for query results.
864 /// Do not access this directly. It is only meant to be used by
865 /// `DepGraph::try_mark_green()` and the query infrastructure in `ty::maps`.
866 pub(crate) on_disk_query_result_cache: maps::OnDiskCache<'tcx>,
868 /// Common types, pre-interned for your convenience.
869 pub types: CommonTypes<'tcx>,
871 /// Map indicating what traits are in scope for places where this
872 /// is relevant; generated by resolve.
873 trait_map: FxHashMap<DefIndex,
874 Lrc<FxHashMap<ItemLocalId,
875 Lrc<StableVec<TraitCandidate>>>>>,
877 /// Export map produced by name resolution.
878 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
880 pub hir: hir_map::Map<'tcx>,
882 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
883 /// as well as all upstream crates. Only populated in incremental mode.
884 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
886 pub maps: maps::Maps<'tcx>,
888 // Records the free variables refrenced by every closure
889 // expression. Do not track deps for this, just recompute it from
890 // scratch every time.
891 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
893 maybe_unused_trait_imports: FxHashSet<DefId>,
895 maybe_unused_extern_crates: Vec<(DefId, Span)>,
897 // Internal cache for metadata decoding. No need to track deps on this.
898 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
900 /// Caches the results of trait selection. This cache is used
901 /// for things that do not have to do with the parameters in scope.
902 pub selection_cache: traits::SelectionCache<'tcx>,
904 /// Caches the results of trait evaluation. This cache is used
905 /// for things that do not have to do with the parameters in scope.
906 /// Merge this with `selection_cache`?
907 pub evaluation_cache: traits::EvaluationCache<'tcx>,
909 /// The definite name of the current crate after taking into account
910 /// attributes, commandline parameters, etc.
911 pub crate_name: Symbol,
913 /// Data layout specification for the current target.
914 pub data_layout: TargetDataLayout,
916 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
918 /// Stores the value of constants (and deduplicates the actual memory)
919 allocation_interner: Lock<FxHashSet<&'tcx Allocation>>,
921 pub interpret_interner: InterpretInterner<'tcx>,
923 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
925 /// A general purpose channel to throw data out the back towards LLVM worker
928 /// This is intended to only get used during the codegen 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: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
933 output_filenames: Arc<OutputFilenames>,
936 /// Everything needed to efficiently work with interned allocations
937 #[derive(Debug, Default)]
938 pub struct InterpretInterner<'tcx> {
939 inner: Lock<InterpretInternerInner<'tcx>>,
942 #[derive(Debug, Default)]
943 struct InterpretInternerInner<'tcx> {
944 /// Allows obtaining function instance handles via a unique identifier
945 functions: FxHashMap<interpret::AllocId, Instance<'tcx>>,
947 /// Inverse map of `interpret_functions`.
948 /// Used so we don't allocate a new pointer every time we need one
949 function_cache: FxHashMap<Instance<'tcx>, interpret::AllocId>,
951 /// Allows obtaining const allocs via a unique identifier
952 alloc_by_id: FxHashMap<interpret::AllocId, &'tcx interpret::Allocation>,
954 /// Allows obtaining static def ids via a unique id
955 statics: FxHashMap<interpret::AllocId, DefId>,
957 /// The AllocId to assign to the next new regular allocation.
958 /// Always incremented, never gets smaller.
959 next_id: interpret::AllocId,
961 /// Inverse map of `statics`
962 /// Used so we don't allocate a new pointer every time we need one
963 static_cache: FxHashMap<DefId, interpret::AllocId>,
966 impl<'tcx> InterpretInterner<'tcx> {
967 pub fn create_fn_alloc(&self, instance: Instance<'tcx>) -> interpret::AllocId {
968 if let Some(&alloc_id) = self.inner.borrow().function_cache.get(&instance) {
971 let id = self.reserve();
972 debug!("creating fn ptr: {}", id);
973 let mut inner = self.inner.borrow_mut();
974 inner.functions.insert(id, instance);
975 inner.function_cache.insert(instance, id);
981 id: interpret::AllocId,
982 ) -> Option<Instance<'tcx>> {
983 self.inner.borrow().functions.get(&id).cloned()
988 id: interpret::AllocId,
989 ) -> Option<&'tcx interpret::Allocation> {
990 self.inner.borrow().alloc_by_id.get(&id).cloned()
996 ) -> interpret::AllocId {
997 if let Some(alloc_id) = self.inner.borrow().static_cache.get(&static_id).cloned() {
1000 let alloc_id = self.reserve();
1001 let mut inner = self.inner.borrow_mut();
1002 inner.static_cache.insert(static_id, alloc_id);
1003 inner.statics.insert(alloc_id, static_id);
1009 ptr: interpret::AllocId,
1010 ) -> Option<DefId> {
1011 self.inner.borrow().statics.get(&ptr).cloned()
1014 pub fn intern_at_reserved(
1016 id: interpret::AllocId,
1017 alloc: &'tcx interpret::Allocation,
1019 if let Some(old) = self.inner.borrow_mut().alloc_by_id.insert(id, alloc) {
1020 bug!("tried to intern allocation at {}, but was already existing as {:#?}", id, old);
1024 /// obtains a new allocation ID that can be referenced but does not
1025 /// yet have an allocation backing it.
1028 ) -> interpret::AllocId {
1029 let mut inner = self.inner.borrow_mut();
1030 let next = inner.next_id;
1031 inner.next_id.0 = inner.next_id.0
1033 .expect("You overflowed a u64 by incrementing by 1... \
1034 You've just earned yourself a free drink if we ever meet. \
1035 Seriously, how did you do that?!");
1040 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1041 /// Get the global TyCtxt.
1043 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
1046 interners: &self.gcx.global_interners,
1050 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
1051 self.global_arenas.generics.alloc(generics)
1054 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
1055 self.global_arenas.steal_mir.alloc(Steal::new(mir))
1058 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
1059 self.global_arenas.mir.alloc(mir)
1062 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1063 self.global_arenas.tables.alloc(tables)
1066 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1067 self.global_arenas.trait_def.alloc(def)
1070 pub fn alloc_adt_def(self,
1073 variants: Vec<ty::VariantDef>,
1075 -> &'gcx ty::AdtDef {
1076 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1077 self.global_arenas.adt_def.alloc(def)
1080 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1081 if bytes.is_empty() {
1084 self.global_interners.arena.alloc_slice(bytes)
1088 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1089 -> &'tcx [&'tcx ty::Const<'tcx>] {
1090 if values.is_empty() {
1093 self.interners.arena.alloc_slice(values)
1097 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1098 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1099 if values.is_empty() {
1102 self.interners.arena.alloc_slice(values)
1106 pub fn intern_const_alloc(
1109 ) -> &'gcx Allocation {
1110 let allocs = &mut self.allocation_interner.borrow_mut();
1111 if let Some(alloc) = allocs.get(&alloc) {
1115 let interned = self.global_arenas.const_allocs.alloc(alloc);
1116 if let Some(prev) = allocs.replace(interned) {
1117 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1122 /// Allocates a byte or string literal for `mir::interpret`
1123 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1124 // create an allocation that just contains these bytes
1125 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1126 let alloc = self.intern_const_alloc(alloc);
1128 // the next unique id
1129 let id = self.interpret_interner.reserve();
1130 self.interpret_interner.intern_at_reserved(id, alloc);
1134 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1135 let mut stability_interner = self.stability_interner.borrow_mut();
1136 if let Some(st) = stability_interner.get(&stab) {
1140 let interned = self.global_interners.arena.alloc(stab);
1141 if let Some(prev) = stability_interner.replace(interned) {
1142 bug!("Tried to overwrite interned Stability: {:?}", prev)
1147 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1148 let mut layout_interner = self.layout_interner.borrow_mut();
1149 if let Some(layout) = layout_interner.get(&layout) {
1153 let interned = self.global_arenas.layout.alloc(layout);
1154 if let Some(prev) = layout_interner.replace(interned) {
1155 bug!("Tried to overwrite interned Layout: {:?}", prev)
1160 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1161 value.lift_to_tcx(self)
1164 /// Like lift, but only tries in the global tcx.
1165 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1166 value.lift_to_tcx(self.global_tcx())
1169 /// Returns true if self is the same as self.global_tcx().
1170 fn is_global(self) -> bool {
1171 let local = self.interners as *const _;
1172 let global = &self.global_interners as *const _;
1173 local as usize == global as usize
1176 /// Create a type context and call the closure with a `TyCtxt` reference
1177 /// to the context. The closure enforces that the type context and any interned
1178 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1179 /// reference to the context, to allow formatting values that need it.
1180 pub fn create_and_enter<F, R>(s: &'tcx Session,
1181 cstore: &'tcx CrateStoreDyn,
1182 local_providers: ty::maps::Providers<'tcx>,
1183 extern_providers: ty::maps::Providers<'tcx>,
1184 arenas: &'tcx AllArenas<'tcx>,
1185 resolutions: ty::Resolutions,
1186 hir: hir_map::Map<'tcx>,
1187 on_disk_query_result_cache: maps::OnDiskCache<'tcx>,
1189 tx: mpsc::Sender<Box<dyn Any + Send>>,
1190 output_filenames: &OutputFilenames,
1192 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1194 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1197 let interners = CtxtInterners::new(&arenas.interner);
1198 let common_types = CommonTypes::new(&interners);
1199 let dep_graph = hir.dep_graph.clone();
1200 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1201 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1202 providers[LOCAL_CRATE] = local_providers;
1204 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1205 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1208 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1211 let def_path_tables = || {
1212 upstream_def_path_tables
1214 .map(|&(cnum, ref rc)| (cnum, &**rc))
1215 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1218 // Precompute the capacity of the hashmap so we don't have to
1219 // re-allocate when populating it.
1220 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1222 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1224 ::std::default::Default::default()
1227 for (cnum, def_path_table) in def_path_tables() {
1228 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1236 let mut trait_map = FxHashMap();
1237 for (k, v) in resolutions.trait_map {
1238 let hir_id = hir.node_to_hir_id(k);
1239 let map = trait_map.entry(hir_id.owner)
1240 .or_insert_with(|| Lrc::new(FxHashMap()));
1241 Lrc::get_mut(map).unwrap()
1242 .insert(hir_id.local_id,
1243 Lrc::new(StableVec::new(v)));
1246 let gcx = &GlobalCtxt {
1249 global_arenas: &arenas.global,
1250 global_interners: interners,
1251 dep_graph: dep_graph.clone(),
1252 on_disk_query_result_cache,
1253 types: common_types,
1255 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1258 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1259 (hir.local_def_id(k), Lrc::new(v))
1261 maybe_unused_trait_imports:
1262 resolutions.maybe_unused_trait_imports
1264 .map(|id| hir.local_def_id(id))
1266 maybe_unused_extern_crates:
1267 resolutions.maybe_unused_extern_crates
1269 .map(|(id, sp)| (hir.local_def_id(id), sp))
1272 def_path_hash_to_def_id,
1273 maps: maps::Maps::new(providers),
1274 rcache: Lock::new(FxHashMap()),
1275 selection_cache: traits::SelectionCache::new(),
1276 evaluation_cache: traits::EvaluationCache::new(),
1277 crate_name: Symbol::intern(crate_name),
1279 layout_interner: Lock::new(FxHashSet()),
1280 stability_interner: Lock::new(FxHashSet()),
1281 allocation_interner: Lock::new(FxHashSet()),
1282 interpret_interner: Default::default(),
1283 tx_to_llvm_workers: Lock::new(tx),
1284 output_filenames: Arc::new(output_filenames.clone()),
1287 tls::enter_global(gcx, f)
1290 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1291 let cname = self.crate_name(LOCAL_CRATE).as_str();
1292 self.sess.consider_optimizing(&cname, msg)
1295 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1296 self.get_lang_items(LOCAL_CRATE)
1299 /// Due to missing llvm support for lowering 128 bit math to software emulation
1300 /// (on some targets), the lowering can be done in MIR.
1302 /// This function only exists until said support is implemented.
1303 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1304 let items = self.lang_items();
1305 let def_id = Some(def_id);
1306 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1307 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1308 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1309 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1310 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1311 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1312 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1313 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1314 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1315 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1316 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1317 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1318 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1319 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1320 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1321 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1322 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1323 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1324 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1325 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1326 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1327 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1328 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1329 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1333 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1334 self.stability_index(LOCAL_CRATE)
1337 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1338 self.all_crate_nums(LOCAL_CRATE)
1341 pub fn features(self) -> Lrc<feature_gate::Features> {
1342 self.features_query(LOCAL_CRATE)
1345 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1347 self.hir.def_key(id)
1349 self.cstore.def_key(id)
1353 /// Convert a `DefId` into its fully expanded `DefPath` (every
1354 /// `DefId` is really just an interned def-path).
1356 /// Note that if `id` is not local to this crate, the result will
1357 /// be a non-local `DefPath`.
1358 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1360 self.hir.def_path(id)
1362 self.cstore.def_path(id)
1367 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1368 if def_id.is_local() {
1369 self.hir.definitions().def_path_hash(def_id.index)
1371 self.cstore.def_path_hash(def_id)
1375 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1376 // We are explicitly not going through queries here in order to get
1377 // crate name and disambiguator since this code is called from debug!()
1378 // statements within the query system and we'd run into endless
1379 // recursion otherwise.
1380 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1381 (self.crate_name.clone(),
1382 self.sess.local_crate_disambiguator())
1384 (self.cstore.crate_name_untracked(def_id.krate),
1385 self.cstore.crate_disambiguator_untracked(def_id.krate))
1390 // Don't print the whole crate disambiguator. That's just
1391 // annoying in debug output.
1392 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1393 self.def_path(def_id).to_string_no_crate())
1396 pub fn metadata_encoding_version(self) -> Vec<u8> {
1397 self.cstore.metadata_encoding_version().to_vec()
1400 // Note that this is *untracked* and should only be used within the query
1401 // system if the result is otherwise tracked through queries
1402 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1403 self.cstore.crate_data_as_rc_any(cnum)
1406 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1407 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1409 StableHashingContext::new(self.sess,
1411 self.hir.definitions(),
1415 // This method makes sure that we have a DepNode and a Fingerprint for
1416 // every upstream crate. It needs to be called once right after the tcx is
1418 // With full-fledged red/green, the method will probably become unnecessary
1419 // as this will be done on-demand.
1420 pub fn allocate_metadata_dep_nodes(self) {
1421 // We cannot use the query versions of crates() and crate_hash(), since
1422 // those would need the DepNodes that we are allocating here.
1423 for cnum in self.cstore.crates_untracked() {
1424 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1425 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1426 self.dep_graph.with_task(dep_node,
1429 |_, x| x // No transformation needed
1434 // This method exercises the `in_scope_traits_map` query for all possible
1435 // values so that we have their fingerprints available in the DepGraph.
1436 // This is only required as long as we still use the old dependency tracking
1437 // which needs to have the fingerprints of all input nodes beforehand.
1438 pub fn precompute_in_scope_traits_hashes(self) {
1439 for &def_index in self.trait_map.keys() {
1440 self.in_scope_traits_map(def_index);
1444 pub fn serialize_query_result_cache<E>(self,
1446 -> Result<(), E::Error>
1447 where E: ty::codec::TyEncoder
1449 self.on_disk_query_result_cache.serialize(self.global_tcx(), encoder)
1452 /// If true, we should use the MIR-based borrowck (we may *also* use
1453 /// the AST-based borrowck).
1454 pub fn use_mir_borrowck(self) -> bool {
1455 self.borrowck_mode().use_mir()
1458 /// If true, pattern variables for use in guards on match arms
1459 /// will be bound as references to the data, and occurrences of
1460 /// those variables in the guard expression will implicitly
1461 /// dereference those bindings. (See rust-lang/rust#27282.)
1462 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1463 self.borrowck_mode().use_mir()
1466 /// If true, we should enable two-phase borrows checks. This is
1467 /// done with either `-Ztwo-phase-borrows` or with
1468 /// `#![feature(nll)]`.
1469 pub fn two_phase_borrows(self) -> bool {
1470 self.features().nll || self.sess.opts.debugging_opts.two_phase_borrows
1473 /// What mode(s) of borrowck should we run? AST? MIR? both?
1474 /// (Also considers the `#![feature(nll)]` setting.)
1475 pub fn borrowck_mode(&self) -> BorrowckMode {
1476 match self.sess.opts.borrowck_mode {
1477 mode @ BorrowckMode::Mir |
1478 mode @ BorrowckMode::Compare => mode,
1480 mode @ BorrowckMode::Ast => {
1481 if self.features().nll {
1491 /// Should we emit EndRegion MIR statements? These are consumed by
1492 /// MIR borrowck, but not when NLL is used. They are also consumed
1493 /// by the validation stuff.
1494 pub fn emit_end_regions(self) -> bool {
1495 self.sess.opts.debugging_opts.emit_end_regions ||
1496 self.sess.opts.debugging_opts.mir_emit_validate > 0 ||
1497 self.use_mir_borrowck()
1501 pub fn share_generics(self) -> bool {
1502 match self.sess.opts.debugging_opts.share_generics {
1503 Some(setting) => setting,
1505 self.sess.opts.incremental.is_some() ||
1506 match self.sess.opts.optimize {
1510 OptLevel::SizeMin => true,
1512 OptLevel::Aggressive => false,
1519 pub fn local_crate_exports_generics(self) -> bool {
1520 debug_assert!(self.share_generics());
1522 self.sess.crate_types.borrow().iter().any(|crate_type| {
1524 CrateTypeExecutable |
1525 CrateTypeStaticlib |
1526 CrateTypeProcMacro |
1527 CrateTypeCdylib => false,
1529 CrateTypeDylib => true,
1535 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1536 pub fn encode_metadata(self, link_meta: &LinkMeta)
1539 self.cstore.encode_metadata(self, link_meta)
1543 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1544 /// Call the closure with a local `TyCtxt` using the given arena.
1545 pub fn enter_local<F, R>(
1547 arena: &'tcx SyncDroplessArena,
1551 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1553 let interners = CtxtInterners::new(arena);
1556 interners: &interners,
1558 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1559 let new_icx = ty::tls::ImplicitCtxt {
1561 query: icx.query.clone(),
1562 layout_depth: icx.layout_depth,
1565 ty::tls::enter_context(&new_icx, |new_icx| {
1572 /// A trait implemented for all X<'a> types which can be safely and
1573 /// efficiently converted to X<'tcx> as long as they are part of the
1574 /// provided TyCtxt<'tcx>.
1575 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1576 /// by looking them up in their respective interners.
1578 /// However, this is still not the best implementation as it does
1579 /// need to compare the components, even for interned values.
1580 /// It would be more efficient if TypedArena provided a way to
1581 /// determine whether the address is in the allocated range.
1583 /// None is returned if the value or one of the components is not part
1584 /// of the provided context.
1585 /// For Ty, None can be returned if either the type interner doesn't
1586 /// contain the TypeVariants key or if the address of the interned
1587 /// pointer differs. The latter case is possible if a primitive type,
1588 /// e.g. `()` or `u8`, was interned in a different context.
1589 pub trait Lift<'tcx> {
1591 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1594 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1595 type Lifted = Ty<'tcx>;
1596 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1597 if tcx.interners.arena.in_arena(*self as *const _) {
1598 return Some(unsafe { mem::transmute(*self) });
1600 // Also try in the global tcx if we're not that.
1601 if !tcx.is_global() {
1602 self.lift_to_tcx(tcx.global_tcx())
1609 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1610 type Lifted = Region<'tcx>;
1611 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1612 if tcx.interners.arena.in_arena(*self as *const _) {
1613 return Some(unsafe { mem::transmute(*self) });
1615 // Also try in the global tcx if we're not that.
1616 if !tcx.is_global() {
1617 self.lift_to_tcx(tcx.global_tcx())
1624 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1625 type Lifted = &'tcx Const<'tcx>;
1626 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1627 if tcx.interners.arena.in_arena(*self as *const _) {
1628 return Some(unsafe { mem::transmute(*self) });
1630 // Also try in the global tcx if we're not that.
1631 if !tcx.is_global() {
1632 self.lift_to_tcx(tcx.global_tcx())
1639 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1640 type Lifted = &'tcx Substs<'tcx>;
1641 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1642 if self.len() == 0 {
1643 return Some(Slice::empty());
1645 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1646 return Some(unsafe { mem::transmute(*self) });
1648 // Also try in the global tcx if we're not that.
1649 if !tcx.is_global() {
1650 self.lift_to_tcx(tcx.global_tcx())
1657 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Ty<'a>> {
1658 type Lifted = &'tcx Slice<Ty<'tcx>>;
1659 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1660 -> Option<&'tcx Slice<Ty<'tcx>>> {
1661 if self.len() == 0 {
1662 return Some(Slice::empty());
1664 if tcx.interners.arena.in_arena(*self as *const _) {
1665 return Some(unsafe { mem::transmute(*self) });
1667 // Also try in the global tcx if we're not that.
1668 if !tcx.is_global() {
1669 self.lift_to_tcx(tcx.global_tcx())
1676 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<ExistentialPredicate<'a>> {
1677 type Lifted = &'tcx Slice<ExistentialPredicate<'tcx>>;
1678 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1679 -> Option<&'tcx Slice<ExistentialPredicate<'tcx>>> {
1680 if self.is_empty() {
1681 return Some(Slice::empty());
1683 if tcx.interners.arena.in_arena(*self as *const _) {
1684 return Some(unsafe { mem::transmute(*self) });
1686 // Also try in the global tcx if we're not that.
1687 if !tcx.is_global() {
1688 self.lift_to_tcx(tcx.global_tcx())
1695 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Predicate<'a>> {
1696 type Lifted = &'tcx Slice<Predicate<'tcx>>;
1697 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1698 -> Option<&'tcx Slice<Predicate<'tcx>>> {
1699 if self.is_empty() {
1700 return Some(Slice::empty());
1702 if tcx.interners.arena.in_arena(*self as *const _) {
1703 return Some(unsafe { mem::transmute(*self) });
1705 // Also try in the global tcx if we're not that.
1706 if !tcx.is_global() {
1707 self.lift_to_tcx(tcx.global_tcx())
1714 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<CanonicalVarInfo> {
1715 type Lifted = &'tcx Slice<CanonicalVarInfo>;
1716 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1717 if self.len() == 0 {
1718 return Some(Slice::empty());
1720 if tcx.interners.arena.in_arena(*self as *const _) {
1721 return Some(unsafe { mem::transmute(*self) });
1723 // Also try in the global tcx if we're not that.
1724 if !tcx.is_global() {
1725 self.lift_to_tcx(tcx.global_tcx())
1733 use super::{GlobalCtxt, TyCtxt};
1735 use std::cell::Cell;
1740 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1741 use rustc_data_structures::OnDrop;
1742 use rustc_data_structures::sync::Lrc;
1743 use dep_graph::OpenTask;
1745 /// This is the implicit state of rustc. It contains the current
1746 /// TyCtxt and query. It is updated when creating a local interner or
1747 /// executing a new query. Whenever there's a TyCtxt value available
1748 /// you should also have access to an ImplicitCtxt through the functions
1751 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1752 /// The current TyCtxt. Initially created by `enter_global` and updated
1753 /// by `enter_local` with a new local interner
1754 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1756 /// The current query job, if any. This is updated by start_job in
1757 /// ty::maps::plumbing when executing a query
1758 pub query: Option<Lrc<maps::QueryJob<'gcx>>>,
1760 /// Used to prevent layout from recursing too deeply.
1761 pub layout_depth: usize,
1763 /// The current dep graph task. This is used to add dependencies to queries
1764 /// when executing them
1765 pub task: &'a OpenTask,
1768 // A thread local value which stores a pointer to the current ImplicitCtxt
1769 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1771 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1772 let old = get_tlv();
1773 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1774 TLV.with(|tlv| tlv.set(value));
1778 fn get_tlv() -> usize {
1779 TLV.with(|tlv| tlv.get())
1782 /// This is a callback from libsyntax as it cannot access the implicit state
1783 /// in librustc otherwise
1784 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter) -> fmt::Result {
1786 write!(f, "{}", tcx.sess.codemap().span_to_string(span))
1790 /// This is a callback from libsyntax as it cannot access the implicit state
1791 /// in librustc otherwise. It is used to when diagnostic messages are
1792 /// emitted and stores them in the current query, if there is one.
1793 fn track_diagnostic(diagnostic: &Diagnostic) {
1794 with_context_opt(|icx| {
1795 if let Some(icx) = icx {
1796 if let Some(ref query) = icx.query {
1797 query.diagnostics.lock().push(diagnostic.clone());
1803 /// Sets up the callbacks from libsyntax on the current thread
1804 pub fn with_thread_locals<F, R>(f: F) -> R
1805 where F: FnOnce() -> R
1807 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1808 let original_span_debug = span_dbg.get();
1809 span_dbg.set(span_debug);
1811 let _on_drop = OnDrop(move || {
1812 span_dbg.set(original_span_debug);
1815 TRACK_DIAGNOSTICS.with(|current| {
1816 let original = current.get();
1817 current.set(track_diagnostic);
1819 let _on_drop = OnDrop(move || {
1820 current.set(original);
1828 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1829 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1831 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1833 set_tlv(context as *const _ as usize, || {
1838 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1839 /// creating a initial TyCtxt and ImplicitCtxt.
1840 /// This happens once per rustc session and TyCtxts only exists
1841 /// inside the `f` function.
1842 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
1843 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
1845 with_thread_locals(|| {
1848 interners: &gcx.global_interners,
1850 let icx = ImplicitCtxt {
1854 task: &OpenTask::Ignore,
1856 enter_context(&icx, |_| {
1862 /// Allows access to the current ImplicitCtxt in a closure if one is available
1863 pub fn with_context_opt<F, R>(f: F) -> R
1864 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
1866 let context = get_tlv();
1870 unsafe { f(Some(&*(context as *const ImplicitCtxt))) }
1874 /// Allows access to the current ImplicitCtxt.
1875 /// Panics if there is no ImplicitCtxt available
1876 pub fn with_context<F, R>(f: F) -> R
1877 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1879 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
1882 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
1883 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
1884 /// with the same 'gcx lifetime as the TyCtxt passed in.
1885 /// This will panic if you pass it a TyCtxt which has a different global interner from
1886 /// the current ImplicitCtxt's tcx field.
1887 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
1888 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
1890 with_context(|context| {
1892 let gcx = tcx.gcx as *const _ as usize;
1893 assert!(context.tcx.gcx as *const _ as usize == gcx);
1894 let context: &ImplicitCtxt = mem::transmute(context);
1900 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
1901 /// interner and local interner as the tcx argument passed in. This means the closure
1902 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
1903 /// This will panic if you pass it a TyCtxt which has a different global interner or
1904 /// a different local interner from the current ImplicitCtxt's tcx field.
1905 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
1906 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
1908 with_context(|context| {
1910 let gcx = tcx.gcx as *const _ as usize;
1911 let interners = tcx.interners as *const _ as usize;
1912 assert!(context.tcx.gcx as *const _ as usize == gcx);
1913 assert!(context.tcx.interners as *const _ as usize == interners);
1914 let context: &ImplicitCtxt = mem::transmute(context);
1920 /// Allows access to the TyCtxt in the current ImplicitCtxt.
1921 /// Panics if there is no ImplicitCtxt available
1922 pub fn with<F, R>(f: F) -> R
1923 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1925 with_context(|context| f(context.tcx))
1928 /// Allows access to the TyCtxt in the current ImplicitCtxt.
1929 /// The closure is passed None if there is no ImplicitCtxt available
1930 pub fn with_opt<F, R>(f: F) -> R
1931 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
1933 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
1937 macro_rules! sty_debug_print {
1938 ($ctxt: expr, $($variant: ident),*) => {{
1939 // curious inner module to allow variant names to be used as
1941 #[allow(non_snake_case)]
1943 use ty::{self, TyCtxt};
1944 use ty::context::Interned;
1946 #[derive(Copy, Clone)]
1949 region_infer: usize,
1954 pub fn go(tcx: TyCtxt) {
1955 let mut total = DebugStat {
1957 region_infer: 0, ty_infer: 0, both_infer: 0,
1959 $(let mut $variant = total;)*
1962 for &Interned(t) in tcx.interners.type_.borrow().iter() {
1963 let variant = match t.sty {
1964 ty::TyBool | ty::TyChar | ty::TyInt(..) | ty::TyUint(..) |
1965 ty::TyFloat(..) | ty::TyStr | ty::TyNever => continue,
1966 ty::TyError => /* unimportant */ continue,
1967 $(ty::$variant(..) => &mut $variant,)*
1969 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
1970 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
1974 if region { total.region_infer += 1; variant.region_infer += 1 }
1975 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
1976 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
1978 println!("Ty interner total ty region both");
1979 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
1980 {ty:4.1}% {region:5.1}% {both:4.1}%",
1981 stringify!($variant),
1982 uses = $variant.total,
1983 usespc = $variant.total as f64 * 100.0 / total.total as f64,
1984 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
1985 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
1986 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
1988 println!(" total {uses:6} \
1989 {ty:4.1}% {region:5.1}% {both:4.1}%",
1991 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
1992 region = total.region_infer as f64 * 100.0 / total.total as f64,
1993 both = total.both_infer as f64 * 100.0 / total.total as f64)
2001 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2002 pub fn print_debug_stats(self) {
2005 TyAdt, TyArray, TySlice, TyRawPtr, TyRef, TyFnDef, TyFnPtr,
2006 TyGenerator, TyGeneratorWitness, TyDynamic, TyClosure, TyTuple,
2007 TyParam, TyInfer, TyProjection, TyAnon, TyForeign);
2009 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2010 println!("Region interner: #{}", self.interners.region.borrow().len());
2011 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2012 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2013 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2018 /// An entry in an interner.
2019 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2021 // NB: An Interned<Ty> compares and hashes as a sty.
2022 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2023 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2024 self.0.sty == other.0.sty
2028 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2030 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2031 fn hash<H: Hasher>(&self, s: &mut H) {
2036 impl<'tcx: 'lcx, 'lcx> Borrow<TypeVariants<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2037 fn borrow<'a>(&'a self) -> &'a TypeVariants<'lcx> {
2042 // NB: An Interned<Slice<T>> compares and hashes as its elements.
2043 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, Slice<T>> {
2044 fn eq(&self, other: &Interned<'tcx, Slice<T>>) -> bool {
2045 self.0[..] == other.0[..]
2049 impl<'tcx, T: Eq> Eq for Interned<'tcx, Slice<T>> {}
2051 impl<'tcx, T: Hash> Hash for Interned<'tcx, Slice<T>> {
2052 fn hash<H: Hasher>(&self, s: &mut H) {
2057 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, Slice<Ty<'tcx>>> {
2058 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2063 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, Slice<CanonicalVarInfo>> {
2064 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2069 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2070 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2075 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2076 fn borrow<'a>(&'a self) -> &'a RegionKind {
2081 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2082 for Interned<'tcx, Slice<ExistentialPredicate<'tcx>>> {
2083 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2088 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2089 for Interned<'tcx, Slice<Predicate<'tcx>>> {
2090 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2095 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2096 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2101 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2102 for Interned<'tcx, Slice<Clause<'tcx>>> {
2103 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2108 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2109 for Interned<'tcx, Slice<Goal<'tcx>>> {
2110 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2115 macro_rules! intern_method {
2116 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2117 $alloc_method:ident,
2120 $keep_in_local_tcx:expr) -> $ty:ty) => {
2121 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2122 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2123 let key = ($alloc_to_key)(&v);
2125 // HACK(eddyb) Depend on flags being accurate to
2126 // determine that all contents are in the global tcx.
2127 // See comments on Lift for why we can't use that.
2128 if ($keep_in_local_tcx)(&v) {
2129 let mut interner = self.interners.$name.borrow_mut();
2130 if let Some(&Interned(v)) = interner.get(key) {
2134 // Make sure we don't end up with inference
2135 // types/regions in the global tcx.
2136 if self.is_global() {
2137 bug!("Attempted to intern `{:?}` which contains \
2138 inference types/regions in the global type context",
2142 let i = ($alloc_to_ret)(self.interners.arena.$alloc_method(v));
2143 interner.insert(Interned(i));
2146 let mut interner = self.global_interners.$name.borrow_mut();
2147 if let Some(&Interned(v)) = interner.get(key) {
2151 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2155 let i = ($alloc_to_ret)(self.global_interners.arena.$alloc_method(v));
2156 interner.insert(Interned(i));
2164 macro_rules! direct_interners {
2165 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2166 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2167 fn eq(&self, other: &Self) -> bool {
2172 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2174 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2175 fn hash<H: Hasher>(&self, s: &mut H) {
2182 $name: $method($ty, alloc, |x| x, |x| x, $keep_in_local_tcx) -> $ty
2187 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2188 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2191 direct_interners!('tcx,
2192 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2193 const_: mk_const(|c: &Const| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>
2196 macro_rules! slice_interners {
2197 ($($field:ident: $method:ident($ty:ident)),+) => (
2198 $(intern_method!('tcx, $field: $method(&[$ty<'tcx>], alloc_slice, Deref::deref,
2199 |xs: &[$ty]| -> &Slice<$ty> {
2200 unsafe { mem::transmute(xs) }
2201 }, |xs: &[$ty]| xs.iter().any(keep_local)) -> Slice<$ty<'tcx>>);)+
2206 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2207 predicates: _intern_predicates(Predicate),
2208 type_list: _intern_type_list(Ty),
2209 substs: _intern_substs(Kind),
2210 clauses: _intern_clauses(Clause),
2211 goals: _intern_goals(Goal)
2214 // This isn't a perfect fit: CanonicalVarInfo slices are always
2215 // allocated in the global arena, so this `intern_method!` macro is
2216 // overly general. But we just return false for the code that checks
2217 // whether they belong in the thread-local arena, so no harm done, and
2218 // seems better than open-coding the rest.
2221 canonical_var_infos: _intern_canonical_var_infos(
2222 &[CanonicalVarInfo],
2225 |xs: &[CanonicalVarInfo]| -> &Slice<CanonicalVarInfo> { unsafe { mem::transmute(xs) } },
2226 |_xs: &[CanonicalVarInfo]| -> bool { false }
2227 ) -> Slice<CanonicalVarInfo>
2230 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2231 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2232 /// that is, a `fn` type that is equivalent in every way for being
2234 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2235 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2236 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2237 unsafety: hir::Unsafety::Unsafe,
2242 /// Given a closure signature `sig`, returns an equivalent `fn`
2243 /// type with the same signature. Detuples and so forth -- so
2244 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2245 /// a `fn(u32, i32)`.
2246 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2247 let converted_sig = sig.map_bound(|s| {
2248 let params_iter = match s.inputs()[0].sty {
2249 ty::TyTuple(params) => {
2250 params.into_iter().cloned()
2258 hir::Unsafety::Normal,
2263 self.mk_fn_ptr(converted_sig)
2266 pub fn mk_ty(&self, st: TypeVariants<'tcx>) -> Ty<'tcx> {
2267 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2270 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2272 ast::IntTy::Isize => self.types.isize,
2273 ast::IntTy::I8 => self.types.i8,
2274 ast::IntTy::I16 => self.types.i16,
2275 ast::IntTy::I32 => self.types.i32,
2276 ast::IntTy::I64 => self.types.i64,
2277 ast::IntTy::I128 => self.types.i128,
2281 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2283 ast::UintTy::Usize => self.types.usize,
2284 ast::UintTy::U8 => self.types.u8,
2285 ast::UintTy::U16 => self.types.u16,
2286 ast::UintTy::U32 => self.types.u32,
2287 ast::UintTy::U64 => self.types.u64,
2288 ast::UintTy::U128 => self.types.u128,
2292 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2294 ast::FloatTy::F32 => self.types.f32,
2295 ast::FloatTy::F64 => self.types.f64,
2299 pub fn mk_str(self) -> Ty<'tcx> {
2303 pub fn mk_static_str(self) -> Ty<'tcx> {
2304 self.mk_imm_ref(self.types.re_static, self.mk_str())
2307 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2308 // take a copy of substs so that we own the vectors inside
2309 self.mk_ty(TyAdt(def, substs))
2312 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2313 self.mk_ty(TyForeign(def_id))
2316 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2317 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2318 let adt_def = self.adt_def(def_id);
2319 let substs = Substs::for_item(self, def_id, |param, substs| {
2321 GenericParamDefKind::Lifetime => bug!(),
2322 GenericParamDefKind::Type { has_default, .. } => {
2323 if param.index == 0 {
2326 assert!(has_default);
2327 self.type_of(param.def_id).subst(self, substs).into()
2332 self.mk_ty(TyAdt(adt_def, substs))
2335 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2336 self.mk_ty(TyRawPtr(tm))
2339 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2340 self.mk_ty(TyRef(r, tm.ty, tm.mutbl))
2343 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2344 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2347 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2348 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2351 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2352 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2355 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2356 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2359 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2360 self.mk_imm_ptr(self.mk_nil())
2363 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2364 self.mk_ty(TyArray(ty, ty::Const::from_usize(self, n)))
2367 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2368 self.mk_ty(TySlice(ty))
2371 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2372 self.mk_ty(TyTuple(self.intern_type_list(ts)))
2375 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2376 iter.intern_with(|ts| self.mk_ty(TyTuple(self.intern_type_list(ts))))
2379 pub fn mk_nil(self) -> Ty<'tcx> {
2380 self.intern_tup(&[])
2383 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2384 if self.features().never_type {
2387 self.intern_tup(&[])
2391 pub fn mk_bool(self) -> Ty<'tcx> {
2395 pub fn mk_fn_def(self, def_id: DefId,
2396 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2397 self.mk_ty(TyFnDef(def_id, substs))
2400 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2401 self.mk_ty(TyFnPtr(fty))
2406 obj: ty::Binder<&'tcx Slice<ExistentialPredicate<'tcx>>>,
2407 reg: ty::Region<'tcx>
2409 self.mk_ty(TyDynamic(obj, reg))
2412 pub fn mk_projection(self,
2414 substs: &'tcx Substs<'tcx>)
2416 self.mk_ty(TyProjection(ProjectionTy {
2422 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2424 self.mk_ty(TyClosure(closure_id, closure_substs))
2427 pub fn mk_generator(self,
2429 generator_substs: GeneratorSubsts<'tcx>,
2430 movability: hir::GeneratorMovability)
2432 self.mk_ty(TyGenerator(id, generator_substs, movability))
2435 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx Slice<Ty<'tcx>>>) -> Ty<'tcx> {
2436 self.mk_ty(TyGeneratorWitness(types))
2439 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2440 self.mk_infer(TyVar(v))
2443 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2444 self.mk_infer(IntVar(v))
2447 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2448 self.mk_infer(FloatVar(v))
2451 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2452 self.mk_ty(TyInfer(it))
2455 pub fn mk_ty_param(self,
2457 name: InternedString) -> Ty<'tcx> {
2458 self.mk_ty(TyParam(ParamTy { idx: index, name: name }))
2461 pub fn mk_self_type(self) -> Ty<'tcx> {
2462 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2465 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2467 GenericParamDefKind::Lifetime => {
2468 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2470 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2474 pub fn mk_anon(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2475 self.mk_ty(TyAnon(def_id, substs))
2478 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2479 -> &'tcx Slice<ExistentialPredicate<'tcx>> {
2480 assert!(!eps.is_empty());
2481 assert!(eps.windows(2).all(|w| w[0].cmp(self, &w[1]) != Ordering::Greater));
2482 self._intern_existential_predicates(eps)
2485 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2486 -> &'tcx Slice<Predicate<'tcx>> {
2487 // FIXME consider asking the input slice to be sorted to avoid
2488 // re-interning permutations, in which case that would be asserted
2490 if preds.len() == 0 {
2491 // The macro-generated method below asserts we don't intern an empty slice.
2494 self._intern_predicates(preds)
2498 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx Slice<Ty<'tcx>> {
2502 self._intern_type_list(ts)
2506 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx Slice<Kind<'tcx>> {
2510 self._intern_substs(ts)
2514 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2518 self.global_tcx()._intern_canonical_var_infos(ts)
2522 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2526 self._intern_clauses(ts)
2530 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2534 self._intern_goals(ts)
2538 pub fn mk_fn_sig<I>(self,
2542 unsafety: hir::Unsafety,
2544 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2546 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2548 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2549 inputs_and_output: self.intern_type_list(xs),
2550 variadic, unsafety, abi
2554 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2555 &'tcx Slice<ExistentialPredicate<'tcx>>>>(self, iter: I)
2557 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2560 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2561 &'tcx Slice<Predicate<'tcx>>>>(self, iter: I)
2563 iter.intern_with(|xs| self.intern_predicates(xs))
2566 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2567 &'tcx Slice<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2568 iter.intern_with(|xs| self.intern_type_list(xs))
2571 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2572 &'tcx Slice<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2573 iter.intern_with(|xs| self.intern_substs(xs))
2576 pub fn mk_substs_trait(self,
2578 rest: &[Kind<'tcx>])
2579 -> &'tcx Substs<'tcx>
2581 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2584 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2585 iter.intern_with(|xs| self.intern_clauses(xs))
2588 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2589 iter.intern_with(|xs| self.intern_goals(xs))
2592 pub fn mk_goal(self, goal: Goal<'tcx>) -> &'tcx Goal {
2593 &self.intern_goals(&[goal])[0]
2596 pub fn lint_node<S: Into<MultiSpan>>(self,
2597 lint: &'static Lint,
2601 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2604 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2605 lint: &'static Lint,
2610 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2615 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2616 -> (lint::Level, lint::LintSource)
2618 // Right now we insert a `with_ignore` node in the dep graph here to
2619 // ignore the fact that `lint_levels` below depends on the entire crate.
2620 // For now this'll prevent false positives of recompiling too much when
2621 // anything changes.
2623 // Once red/green incremental compilation lands we should be able to
2624 // remove this because while the crate changes often the lint level map
2625 // will change rarely.
2626 self.dep_graph.with_ignore(|| {
2627 let sets = self.lint_levels(LOCAL_CRATE);
2629 let hir_id = self.hir.definitions().node_to_hir_id(id);
2630 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2633 let next = self.hir.get_parent_node(id);
2635 bug!("lint traversal reached the root of the crate");
2642 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2643 lint: &'static Lint,
2647 -> DiagnosticBuilder<'tcx>
2649 let (level, src) = self.lint_level_at_node(lint, id);
2650 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2653 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2654 -> DiagnosticBuilder<'tcx>
2656 let (level, src) = self.lint_level_at_node(lint, id);
2657 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2660 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2661 self.in_scope_traits_map(id.owner)
2662 .and_then(|map| map.get(&id.local_id).cloned())
2665 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2666 self.named_region_map(id.owner)
2667 .and_then(|map| map.get(&id.local_id).cloned())
2670 pub fn is_late_bound(self, id: HirId) -> bool {
2671 self.is_late_bound_map(id.owner)
2672 .map(|set| set.contains(&id.local_id))
2676 pub fn object_lifetime_defaults(self, id: HirId)
2677 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2679 self.object_lifetime_defaults_map(id.owner)
2680 .and_then(|map| map.get(&id.local_id).cloned())
2684 pub trait InternAs<T: ?Sized, R> {
2686 fn intern_with<F>(self, f: F) -> Self::Output
2687 where F: FnOnce(&T) -> R;
2690 impl<I, T, R, E> InternAs<[T], R> for I
2691 where E: InternIteratorElement<T, R>,
2692 I: Iterator<Item=E> {
2693 type Output = E::Output;
2694 fn intern_with<F>(self, f: F) -> Self::Output
2695 where F: FnOnce(&[T]) -> R {
2696 E::intern_with(self, f)
2700 pub trait InternIteratorElement<T, R>: Sized {
2702 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2705 impl<T, R> InternIteratorElement<T, R> for T {
2707 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2708 f(&iter.collect::<AccumulateVec<[_; 8]>>())
2712 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2716 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2717 f(&iter.cloned().collect::<AccumulateVec<[_; 8]>>())
2721 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2722 type Output = Result<R, E>;
2723 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2724 Ok(f(&iter.collect::<Result<AccumulateVec<[_; 8]>, _>>()?))
2728 pub fn provide(providers: &mut ty::maps::Providers) {
2729 // FIXME(#44234) - almost all of these queries have no sub-queries and
2730 // therefore no actual inputs, they're just reading tables calculated in
2731 // resolve! Does this work? Unsure! That's what the issue is about
2732 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2733 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2734 providers.crate_name = |tcx, id| {
2735 assert_eq!(id, LOCAL_CRATE);
2738 providers.get_lang_items = |tcx, id| {
2739 assert_eq!(id, LOCAL_CRATE);
2740 // FIXME(#42293) Right now we insert a `with_ignore` node in the dep
2741 // graph here to ignore the fact that `get_lang_items` below depends on
2742 // the entire crate. For now this'll prevent false positives of
2743 // recompiling too much when anything changes.
2745 // Once red/green incremental compilation lands we should be able to
2746 // remove this because while the crate changes often the lint level map
2747 // will change rarely.
2748 tcx.dep_graph.with_ignore(|| Lrc::new(middle::lang_items::collect(tcx)))
2750 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
2751 providers.maybe_unused_trait_import = |tcx, id| {
2752 tcx.maybe_unused_trait_imports.contains(&id)
2754 providers.maybe_unused_extern_crates = |tcx, cnum| {
2755 assert_eq!(cnum, LOCAL_CRATE);
2756 Lrc::new(tcx.maybe_unused_extern_crates.clone())
2759 providers.stability_index = |tcx, cnum| {
2760 assert_eq!(cnum, LOCAL_CRATE);
2761 Lrc::new(stability::Index::new(tcx))
2763 providers.lookup_stability = |tcx, id| {
2764 assert_eq!(id.krate, LOCAL_CRATE);
2765 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
2766 tcx.stability().local_stability(id)
2768 providers.lookup_deprecation_entry = |tcx, id| {
2769 assert_eq!(id.krate, LOCAL_CRATE);
2770 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
2771 tcx.stability().local_deprecation_entry(id)
2773 providers.extern_mod_stmt_cnum = |tcx, id| {
2774 let id = tcx.hir.as_local_node_id(id).unwrap();
2775 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
2777 providers.all_crate_nums = |tcx, cnum| {
2778 assert_eq!(cnum, LOCAL_CRATE);
2779 Lrc::new(tcx.cstore.crates_untracked())
2781 providers.postorder_cnums = |tcx, cnum| {
2782 assert_eq!(cnum, LOCAL_CRATE);
2783 Lrc::new(tcx.cstore.postorder_cnums_untracked())
2785 providers.output_filenames = |tcx, cnum| {
2786 assert_eq!(cnum, LOCAL_CRATE);
2787 tcx.output_filenames.clone()
2789 providers.features_query = |tcx, cnum| {
2790 assert_eq!(cnum, LOCAL_CRATE);
2791 Lrc::new(tcx.sess.features_untracked().clone())
2793 providers.is_panic_runtime = |tcx, cnum| {
2794 assert_eq!(cnum, LOCAL_CRATE);
2795 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
2797 providers.is_compiler_builtins = |tcx, cnum| {
2798 assert_eq!(cnum, LOCAL_CRATE);
2799 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")