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 ty::subst::{Kind, Substs, Subst};
39 use traits::{Clause, Clauses, Goal, Goals};
40 use ty::{self, Ty, TypeAndMut};
41 use ty::{TyS, TypeVariants, Slice};
42 use ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorSubsts, Region, Const};
43 use ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
45 use ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid};
46 use ty::TypeVariants::*;
47 use ty::GenericParamDefKind;
48 use ty::layout::{LayoutDetails, TargetDataLayout};
53 use util::nodemap::{DefIdSet, ItemLocalMap};
54 use util::nodemap::{FxHashMap, FxHashSet};
55 use rustc_data_structures::accumulate_vec::AccumulateVec;
56 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
57 StableHasher, StableHasherResult,
59 use arena::{TypedArena, SyncDroplessArena};
60 use rustc_data_structures::indexed_vec::IndexVec;
61 use rustc_data_structures::sync::{Lrc, Lock};
63 use std::borrow::Borrow;
64 use std::cmp::Ordering;
65 use std::collections::hash_map::{self, Entry};
66 use std::hash::{Hash, Hasher};
72 use rustc_target::spec::abi;
73 use syntax::ast::{self, NodeId};
75 use syntax::codemap::MultiSpan;
76 use syntax::feature_gate;
77 use syntax::symbol::{Symbol, keywords, InternedString};
82 pub struct AllArenas<'tcx> {
83 pub global: GlobalArenas<'tcx>,
84 pub interner: SyncDroplessArena,
87 impl<'tcx> AllArenas<'tcx> {
88 pub fn new() -> Self {
90 global: GlobalArenas::new(),
91 interner: SyncDroplessArena::new(),
97 pub struct GlobalArenas<'tcx> {
99 layout: TypedArena<LayoutDetails>,
102 generics: TypedArena<ty::Generics>,
103 trait_def: TypedArena<ty::TraitDef>,
104 adt_def: TypedArena<ty::AdtDef>,
105 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
106 mir: TypedArena<Mir<'tcx>>,
107 tables: TypedArena<ty::TypeckTables<'tcx>>,
109 const_allocs: TypedArena<interpret::Allocation>,
112 impl<'tcx> GlobalArenas<'tcx> {
113 pub fn new() -> GlobalArenas<'tcx> {
115 layout: TypedArena::new(),
116 generics: TypedArena::new(),
117 trait_def: TypedArena::new(),
118 adt_def: TypedArena::new(),
119 steal_mir: TypedArena::new(),
120 mir: TypedArena::new(),
121 tables: TypedArena::new(),
122 const_allocs: TypedArena::new(),
127 type InternedSet<'tcx, T> = Lock<FxHashSet<Interned<'tcx, T>>>;
129 pub struct CtxtInterners<'tcx> {
130 /// The arena that types, regions, etc are allocated from
131 arena: &'tcx SyncDroplessArena,
133 /// Specifically use a speedy hash algorithm for these hash sets,
134 /// they're accessed quite often.
135 type_: InternedSet<'tcx, TyS<'tcx>>,
136 type_list: InternedSet<'tcx, Slice<Ty<'tcx>>>,
137 substs: InternedSet<'tcx, Substs<'tcx>>,
138 canonical_var_infos: InternedSet<'tcx, Slice<CanonicalVarInfo>>,
139 region: InternedSet<'tcx, RegionKind>,
140 existential_predicates: InternedSet<'tcx, Slice<ExistentialPredicate<'tcx>>>,
141 predicates: InternedSet<'tcx, Slice<Predicate<'tcx>>>,
142 const_: InternedSet<'tcx, Const<'tcx>>,
143 clauses: InternedSet<'tcx, Slice<Clause<'tcx>>>,
144 goals: InternedSet<'tcx, Slice<Goal<'tcx>>>,
147 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
148 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
151 type_: Default::default(),
152 type_list: Default::default(),
153 substs: Default::default(),
154 region: Default::default(),
155 existential_predicates: Default::default(),
156 canonical_var_infos: Default::default(),
157 predicates: Default::default(),
158 const_: Default::default(),
159 clauses: Default::default(),
160 goals: Default::default(),
166 local: &CtxtInterners<'tcx>,
167 global: &CtxtInterners<'gcx>,
168 st: TypeVariants<'tcx>
170 let flags = super::flags::FlagComputation::for_sty(&st);
172 // HACK(eddyb) Depend on flags being accurate to
173 // determine that all contents are in the global tcx.
174 // See comments on Lift for why we can't use that.
175 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
176 let mut interner = local.type_.borrow_mut();
177 if let Some(&Interned(ty)) = interner.get(&st) {
181 let ty_struct = TyS {
184 region_depth: flags.depth,
187 // Make sure we don't end up with inference
188 // types/regions in the global interner
189 if local as *const _ as usize == global as *const _ as usize {
190 bug!("Attempted to intern `{:?}` which contains \
191 inference types/regions in the global type context",
195 // Don't be &mut TyS.
196 let ty: Ty<'tcx> = local.arena.alloc(ty_struct);
197 interner.insert(Interned(ty));
200 let mut interner = global.type_.borrow_mut();
201 if let Some(&Interned(ty)) = interner.get(&st) {
205 let ty_struct = TyS {
208 region_depth: flags.depth,
211 // This is safe because all the types the ty_struct can point to
212 // already is in the global arena
213 let ty_struct: TyS<'gcx> = unsafe {
214 mem::transmute(ty_struct)
217 // Don't be &mut TyS.
218 let ty: Ty<'gcx> = global.arena.alloc(ty_struct);
219 interner.insert(Interned(ty));
225 pub struct CommonTypes<'tcx> {
245 pub re_empty: Region<'tcx>,
246 pub re_static: Region<'tcx>,
247 pub re_erased: Region<'tcx>,
250 pub struct LocalTableInContext<'a, V: 'a> {
251 local_id_root: Option<DefId>,
252 data: &'a ItemLocalMap<V>
255 /// Validate that the given HirId (respectively its `local_id` part) can be
256 /// safely used as a key in the tables of a TypeckTable. For that to be
257 /// the case, the HirId must have the same `owner` as all the other IDs in
258 /// this table (signified by `local_id_root`). Otherwise the HirId
259 /// would be in a different frame of reference and using its `local_id`
260 /// would result in lookup errors, or worse, in silently wrong data being
262 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
265 if cfg!(debug_assertions) {
266 if let Some(local_id_root) = local_id_root {
267 if hir_id.owner != local_id_root.index {
268 ty::tls::with(|tcx| {
269 let node_id = tcx.hir
271 .find_node_for_hir_id(hir_id);
273 bug!("node {} with HirId::owner {:?} cannot be placed in \
274 TypeckTables with local_id_root {:?}",
275 tcx.hir.node_to_string(node_id),
276 DefId::local(hir_id.owner),
281 // We use "Null Object" TypeckTables in some of the analysis passes.
282 // These are just expected to be empty and their `local_id_root` is
283 // `None`. Therefore we cannot verify whether a given `HirId` would
284 // be a valid key for the given table. Instead we make sure that
285 // nobody tries to write to such a Null Object table.
287 bug!("access to invalid TypeckTables")
293 impl<'a, V> LocalTableInContext<'a, V> {
294 pub fn contains_key(&self, id: hir::HirId) -> bool {
295 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
296 self.data.contains_key(&id.local_id)
299 pub fn get(&self, id: hir::HirId) -> Option<&V> {
300 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
301 self.data.get(&id.local_id)
304 pub fn iter(&self) -> hash_map::Iter<hir::ItemLocalId, V> {
309 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
312 fn index(&self, key: hir::HirId) -> &V {
313 self.get(key).expect("LocalTableInContext: key not found")
317 pub struct LocalTableInContextMut<'a, V: 'a> {
318 local_id_root: Option<DefId>,
319 data: &'a mut ItemLocalMap<V>
322 impl<'a, V> LocalTableInContextMut<'a, V> {
323 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
324 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
325 self.data.get_mut(&id.local_id)
328 pub fn entry(&mut self, id: hir::HirId) -> Entry<hir::ItemLocalId, V> {
329 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
330 self.data.entry(id.local_id)
333 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
334 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
335 self.data.insert(id.local_id, val)
338 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
339 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
340 self.data.remove(&id.local_id)
344 #[derive(RustcEncodable, RustcDecodable, Debug)]
345 pub struct TypeckTables<'tcx> {
346 /// The HirId::owner all ItemLocalIds in this table are relative to.
347 pub local_id_root: Option<DefId>,
349 /// Resolved definitions for `<T>::X` associated paths and
350 /// method calls, including those of overloaded operators.
351 type_dependent_defs: ItemLocalMap<Def>,
353 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
354 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
355 /// about the field you also need definition of the variant to which the field
356 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
357 field_indices: ItemLocalMap<usize>,
359 /// Stores the canonicalized types provided by the user. See also `UserAssertTy` statement in
361 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
363 /// Stores the types for various nodes in the AST. Note that this table
364 /// is not guaranteed to be populated until after typeck. See
365 /// typeck::check::fn_ctxt for details.
366 node_types: ItemLocalMap<Ty<'tcx>>,
368 /// Stores the type parameters which were substituted to obtain the type
369 /// of this node. This only applies to nodes that refer to entities
370 /// parameterized by type parameters, such as generic fns, types, or
372 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
374 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
376 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
377 pat_binding_modes: ItemLocalMap<BindingMode>,
379 /// Stores the types which were implicitly dereferenced in pattern binding modes
380 /// for later usage in HAIR lowering. For example,
383 /// match &&Some(5i32) {
388 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
391 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
392 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
395 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
397 /// Records the reasons that we picked the kind of each closure;
398 /// not all closures are present in the map.
399 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
401 /// For each fn, records the "liberated" types of its arguments
402 /// and return type. Liberated means that all bound regions
403 /// (including late-bound regions) are replaced with free
404 /// equivalents. This table is not used in codegen (since regions
405 /// are erased there) and hence is not serialized to metadata.
406 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
408 /// For each FRU expression, record the normalized types of the fields
409 /// of the struct - this is needed because it is non-trivial to
410 /// normalize while preserving regions. This table is used only in
411 /// MIR construction and hence is not serialized to metadata.
412 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
414 /// Maps a cast expression to its kind. This is keyed on the
415 /// *from* expression of the cast, not the cast itself.
416 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
418 /// Set of trait imports actually used in the method resolution.
419 /// This is used for warning unused imports. During type
420 /// checking, this `Lrc` should not be cloned: it must have a ref-count
421 /// of 1 so that we can insert things into the set mutably.
422 pub used_trait_imports: Lrc<DefIdSet>,
424 /// If any errors occurred while type-checking this body,
425 /// this field will be set to `true`.
426 pub tainted_by_errors: bool,
428 /// Stores the free-region relationships that were deduced from
429 /// its where clauses and parameter types. These are then
430 /// read-again by borrowck.
431 pub free_region_map: FreeRegionMap<'tcx>,
434 impl<'tcx> TypeckTables<'tcx> {
435 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
438 type_dependent_defs: ItemLocalMap(),
439 field_indices: ItemLocalMap(),
440 user_provided_tys: ItemLocalMap(),
441 node_types: ItemLocalMap(),
442 node_substs: ItemLocalMap(),
443 adjustments: ItemLocalMap(),
444 pat_binding_modes: ItemLocalMap(),
445 pat_adjustments: ItemLocalMap(),
446 upvar_capture_map: FxHashMap(),
447 closure_kind_origins: ItemLocalMap(),
448 liberated_fn_sigs: ItemLocalMap(),
449 fru_field_types: ItemLocalMap(),
450 cast_kinds: ItemLocalMap(),
451 used_trait_imports: Lrc::new(DefIdSet()),
452 tainted_by_errors: false,
453 free_region_map: FreeRegionMap::new(),
457 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
458 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
460 hir::QPath::Resolved(_, ref path) => path.def,
461 hir::QPath::TypeRelative(..) => {
462 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
463 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
468 pub fn type_dependent_defs(&self) -> LocalTableInContext<Def> {
469 LocalTableInContext {
470 local_id_root: self.local_id_root,
471 data: &self.type_dependent_defs
475 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<Def> {
476 LocalTableInContextMut {
477 local_id_root: self.local_id_root,
478 data: &mut self.type_dependent_defs
482 pub fn field_indices(&self) -> LocalTableInContext<usize> {
483 LocalTableInContext {
484 local_id_root: self.local_id_root,
485 data: &self.field_indices
489 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<usize> {
490 LocalTableInContextMut {
491 local_id_root: self.local_id_root,
492 data: &mut self.field_indices
496 pub fn user_provided_tys(&self) -> LocalTableInContext<CanonicalTy<'tcx>> {
497 LocalTableInContext {
498 local_id_root: self.local_id_root,
499 data: &self.user_provided_tys
503 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<CanonicalTy<'tcx>> {
504 LocalTableInContextMut {
505 local_id_root: self.local_id_root,
506 data: &mut self.user_provided_tys
510 pub fn node_types(&self) -> LocalTableInContext<Ty<'tcx>> {
511 LocalTableInContext {
512 local_id_root: self.local_id_root,
513 data: &self.node_types
517 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<Ty<'tcx>> {
518 LocalTableInContextMut {
519 local_id_root: self.local_id_root,
520 data: &mut self.node_types
524 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
525 match self.node_id_to_type_opt(id) {
528 bug!("node_id_to_type: no type for node `{}`",
530 let id = tcx.hir.definitions().find_node_for_hir_id(id);
531 tcx.hir.node_to_string(id)
537 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
538 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
539 self.node_types.get(&id.local_id).cloned()
542 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<&'tcx Substs<'tcx>> {
543 LocalTableInContextMut {
544 local_id_root: self.local_id_root,
545 data: &mut self.node_substs
549 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
550 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
551 self.node_substs.get(&id.local_id).cloned().unwrap_or(Substs::empty())
554 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
555 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
556 self.node_substs.get(&id.local_id).cloned()
559 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
560 // doesn't provide type parameter substitutions.
561 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
562 self.node_id_to_type(pat.hir_id)
565 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
566 self.node_id_to_type_opt(pat.hir_id)
569 // Returns the type of an expression as a monotype.
571 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
572 // some cases, we insert `Adjustment` annotations such as auto-deref or
573 // auto-ref. The type returned by this function does not consider such
574 // adjustments. See `expr_ty_adjusted()` instead.
576 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
577 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
578 // instead of "fn(ty) -> T with T = isize".
579 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
580 self.node_id_to_type(expr.hir_id)
583 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
584 self.node_id_to_type_opt(expr.hir_id)
587 pub fn adjustments(&self) -> LocalTableInContext<Vec<ty::adjustment::Adjustment<'tcx>>> {
588 LocalTableInContext {
589 local_id_root: self.local_id_root,
590 data: &self.adjustments
594 pub fn adjustments_mut(&mut self)
595 -> LocalTableInContextMut<Vec<ty::adjustment::Adjustment<'tcx>>> {
596 LocalTableInContextMut {
597 local_id_root: self.local_id_root,
598 data: &mut self.adjustments
602 pub fn expr_adjustments(&self, expr: &hir::Expr)
603 -> &[ty::adjustment::Adjustment<'tcx>] {
604 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
605 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
608 /// Returns the type of `expr`, considering any `Adjustment`
609 /// entry recorded for that expression.
610 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
611 self.expr_adjustments(expr)
613 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
616 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
617 self.expr_adjustments(expr)
619 .map(|adj| adj.target)
620 .or_else(|| self.expr_ty_opt(expr))
623 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
624 // Only paths and method calls/overloaded operators have
625 // entries in type_dependent_defs, ignore the former here.
626 if let hir::ExprPath(_) = expr.node {
630 match self.type_dependent_defs().get(expr.hir_id) {
631 Some(&Def::Method(_)) => true,
636 pub fn pat_binding_modes(&self) -> LocalTableInContext<BindingMode> {
637 LocalTableInContext {
638 local_id_root: self.local_id_root,
639 data: &self.pat_binding_modes
643 pub fn pat_binding_modes_mut(&mut self)
644 -> LocalTableInContextMut<BindingMode> {
645 LocalTableInContextMut {
646 local_id_root: self.local_id_root,
647 data: &mut self.pat_binding_modes
651 pub fn pat_adjustments(&self) -> LocalTableInContext<Vec<Ty<'tcx>>> {
652 LocalTableInContext {
653 local_id_root: self.local_id_root,
654 data: &self.pat_adjustments,
658 pub fn pat_adjustments_mut(&mut self)
659 -> LocalTableInContextMut<Vec<Ty<'tcx>>> {
660 LocalTableInContextMut {
661 local_id_root: self.local_id_root,
662 data: &mut self.pat_adjustments,
666 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
667 self.upvar_capture_map[&upvar_id]
670 pub fn closure_kind_origins(&self) -> LocalTableInContext<(Span, ast::Name)> {
671 LocalTableInContext {
672 local_id_root: self.local_id_root,
673 data: &self.closure_kind_origins
677 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<(Span, ast::Name)> {
678 LocalTableInContextMut {
679 local_id_root: self.local_id_root,
680 data: &mut self.closure_kind_origins
684 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<ty::FnSig<'tcx>> {
685 LocalTableInContext {
686 local_id_root: self.local_id_root,
687 data: &self.liberated_fn_sigs
691 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<ty::FnSig<'tcx>> {
692 LocalTableInContextMut {
693 local_id_root: self.local_id_root,
694 data: &mut self.liberated_fn_sigs
698 pub fn fru_field_types(&self) -> LocalTableInContext<Vec<Ty<'tcx>>> {
699 LocalTableInContext {
700 local_id_root: self.local_id_root,
701 data: &self.fru_field_types
705 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<Vec<Ty<'tcx>>> {
706 LocalTableInContextMut {
707 local_id_root: self.local_id_root,
708 data: &mut self.fru_field_types
712 pub fn cast_kinds(&self) -> LocalTableInContext<ty::cast::CastKind> {
713 LocalTableInContext {
714 local_id_root: self.local_id_root,
715 data: &self.cast_kinds
719 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<ty::cast::CastKind> {
720 LocalTableInContextMut {
721 local_id_root: self.local_id_root,
722 data: &mut self.cast_kinds
727 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
728 fn hash_stable<W: StableHasherResult>(&self,
729 hcx: &mut StableHashingContext<'a>,
730 hasher: &mut StableHasher<W>) {
731 let ty::TypeckTables {
733 ref type_dependent_defs,
735 ref user_provided_tys,
739 ref pat_binding_modes,
741 ref upvar_capture_map,
742 ref closure_kind_origins,
743 ref liberated_fn_sigs,
748 ref used_trait_imports,
753 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
754 type_dependent_defs.hash_stable(hcx, hasher);
755 field_indices.hash_stable(hcx, hasher);
756 user_provided_tys.hash_stable(hcx, hasher);
757 node_types.hash_stable(hcx, hasher);
758 node_substs.hash_stable(hcx, hasher);
759 adjustments.hash_stable(hcx, hasher);
760 pat_binding_modes.hash_stable(hcx, hasher);
761 pat_adjustments.hash_stable(hcx, hasher);
762 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
769 local_id_root.expect("trying to hash invalid TypeckTables");
771 let var_owner_def_id = DefId {
772 krate: local_id_root.krate,
775 let closure_def_id = DefId {
776 krate: local_id_root.krate,
777 index: closure_expr_id.to_def_id().index,
779 (hcx.def_path_hash(var_owner_def_id),
781 hcx.def_path_hash(closure_def_id))
784 closure_kind_origins.hash_stable(hcx, hasher);
785 liberated_fn_sigs.hash_stable(hcx, hasher);
786 fru_field_types.hash_stable(hcx, hasher);
787 cast_kinds.hash_stable(hcx, hasher);
788 used_trait_imports.hash_stable(hcx, hasher);
789 tainted_by_errors.hash_stable(hcx, hasher);
790 free_region_map.hash_stable(hcx, hasher);
795 impl<'tcx> CommonTypes<'tcx> {
796 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
797 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
798 let mk_region = |r| {
799 if let Some(r) = interners.region.borrow().get(&r) {
802 let r = interners.arena.alloc(r);
803 interners.region.borrow_mut().insert(Interned(r));
811 isize: mk(TyInt(ast::IntTy::Isize)),
812 i8: mk(TyInt(ast::IntTy::I8)),
813 i16: mk(TyInt(ast::IntTy::I16)),
814 i32: mk(TyInt(ast::IntTy::I32)),
815 i64: mk(TyInt(ast::IntTy::I64)),
816 i128: mk(TyInt(ast::IntTy::I128)),
817 usize: mk(TyUint(ast::UintTy::Usize)),
818 u8: mk(TyUint(ast::UintTy::U8)),
819 u16: mk(TyUint(ast::UintTy::U16)),
820 u32: mk(TyUint(ast::UintTy::U32)),
821 u64: mk(TyUint(ast::UintTy::U64)),
822 u128: mk(TyUint(ast::UintTy::U128)),
823 f32: mk(TyFloat(ast::FloatTy::F32)),
824 f64: mk(TyFloat(ast::FloatTy::F64)),
826 re_empty: mk_region(RegionKind::ReEmpty),
827 re_static: mk_region(RegionKind::ReStatic),
828 re_erased: mk_region(RegionKind::ReErased),
833 /// The central data structure of the compiler. It stores references
834 /// to the various **arenas** and also houses the results of the
835 /// various **compiler queries** that have been performed. See the
836 /// [rustc guide] for more details.
838 /// [rustc guide]: https://rust-lang-nursery.github.io/rustc-guide/ty.html
839 #[derive(Copy, Clone)]
840 pub struct TyCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
841 gcx: &'a GlobalCtxt<'gcx>,
842 interners: &'a CtxtInterners<'tcx>
845 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
846 type Target = &'a GlobalCtxt<'gcx>;
847 fn deref(&self) -> &Self::Target {
852 pub struct GlobalCtxt<'tcx> {
853 global_arenas: &'tcx GlobalArenas<'tcx>,
854 global_interners: CtxtInterners<'tcx>,
856 cstore: &'tcx CrateStoreDyn,
858 pub sess: &'tcx Session,
860 pub dep_graph: DepGraph,
862 /// This provides access to the incr. comp. on-disk cache for query results.
863 /// Do not access this directly. It is only meant to be used by
864 /// `DepGraph::try_mark_green()` and the query infrastructure in `ty::maps`.
865 pub(crate) on_disk_query_result_cache: maps::OnDiskCache<'tcx>,
867 /// Common types, pre-interned for your convenience.
868 pub types: CommonTypes<'tcx>,
870 /// Map indicating what traits are in scope for places where this
871 /// is relevant; generated by resolve.
872 trait_map: FxHashMap<DefIndex,
873 Lrc<FxHashMap<ItemLocalId,
874 Lrc<StableVec<TraitCandidate>>>>>,
876 /// Export map produced by name resolution.
877 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
879 pub hir: hir_map::Map<'tcx>,
881 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
882 /// as well as all upstream crates. Only populated in incremental mode.
883 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
885 pub maps: maps::Maps<'tcx>,
887 // Records the free variables refrenced by every closure
888 // expression. Do not track deps for this, just recompute it from
889 // scratch every time.
890 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
892 maybe_unused_trait_imports: FxHashSet<DefId>,
894 maybe_unused_extern_crates: Vec<(DefId, Span)>,
896 // Internal cache for metadata decoding. No need to track deps on this.
897 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
899 /// Caches the results of trait selection. This cache is used
900 /// for things that do not have to do with the parameters in scope.
901 pub selection_cache: traits::SelectionCache<'tcx>,
903 /// Caches the results of trait evaluation. This cache is used
904 /// for things that do not have to do with the parameters in scope.
905 /// Merge this with `selection_cache`?
906 pub evaluation_cache: traits::EvaluationCache<'tcx>,
908 /// The definite name of the current crate after taking into account
909 /// attributes, commandline parameters, etc.
910 pub crate_name: Symbol,
912 /// Data layout specification for the current target.
913 pub data_layout: TargetDataLayout,
915 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
917 pub interpret_interner: InterpretInterner<'tcx>,
919 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
921 /// A general purpose channel to throw data out the back towards LLVM worker
924 /// This is intended to only get used during the codegen phase of the compiler
925 /// when satisfying the query for a particular codegen unit. Internally in
926 /// the query it'll send data along this channel to get processed later.
927 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
929 output_filenames: Arc<OutputFilenames>,
932 /// Everything needed to efficiently work with interned allocations
933 #[derive(Debug, Default)]
934 pub struct InterpretInterner<'tcx> {
935 inner: Lock<InterpretInternerInner<'tcx>>,
938 #[derive(Debug, Default)]
939 struct InterpretInternerInner<'tcx> {
940 /// Stores the value of constants (and deduplicates the actual memory)
941 allocs: FxHashSet<&'tcx interpret::Allocation>,
943 /// Allows obtaining function instance handles via a unique identifier
944 functions: FxHashMap<interpret::AllocId, Instance<'tcx>>,
946 /// Inverse map of `interpret_functions`.
947 /// Used so we don't allocate a new pointer every time we need one
948 function_cache: FxHashMap<Instance<'tcx>, interpret::AllocId>,
950 /// Allows obtaining const allocs via a unique identifier
951 alloc_by_id: FxHashMap<interpret::AllocId, &'tcx interpret::Allocation>,
953 /// Allows obtaining static def ids via a unique id
954 statics: FxHashMap<interpret::AllocId, DefId>,
956 /// The AllocId to assign to the next new regular allocation.
957 /// Always incremented, never gets smaller.
958 next_id: interpret::AllocId,
960 /// Inverse map of `statics`
961 /// Used so we don't allocate a new pointer every time we need one
962 static_cache: FxHashMap<DefId, interpret::AllocId>,
965 impl<'tcx> InterpretInterner<'tcx> {
966 pub fn create_fn_alloc(&self, instance: Instance<'tcx>) -> interpret::AllocId {
967 if let Some(&alloc_id) = self.inner.borrow().function_cache.get(&instance) {
970 let id = self.reserve();
971 debug!("creating fn ptr: {}", id);
972 let mut inner = self.inner.borrow_mut();
973 inner.functions.insert(id, instance);
974 inner.function_cache.insert(instance, id);
980 id: interpret::AllocId,
981 ) -> Option<Instance<'tcx>> {
982 self.inner.borrow().functions.get(&id).cloned()
987 id: interpret::AllocId,
988 ) -> Option<&'tcx interpret::Allocation> {
989 self.inner.borrow().alloc_by_id.get(&id).cloned()
995 ) -> interpret::AllocId {
996 if let Some(alloc_id) = self.inner.borrow().static_cache.get(&static_id).cloned() {
999 let alloc_id = self.reserve();
1000 let mut inner = self.inner.borrow_mut();
1001 inner.static_cache.insert(static_id, alloc_id);
1002 inner.statics.insert(alloc_id, static_id);
1008 ptr: interpret::AllocId,
1009 ) -> Option<DefId> {
1010 self.inner.borrow().statics.get(&ptr).cloned()
1013 pub fn intern_at_reserved(
1015 id: interpret::AllocId,
1016 alloc: &'tcx interpret::Allocation,
1018 if let Some(old) = self.inner.borrow_mut().alloc_by_id.insert(id, alloc) {
1019 bug!("tried to intern allocation at {}, but was already existing as {:#?}", id, old);
1023 /// obtains a new allocation ID that can be referenced but does not
1024 /// yet have an allocation backing it.
1027 ) -> interpret::AllocId {
1028 let mut inner = self.inner.borrow_mut();
1029 let next = inner.next_id;
1030 inner.next_id.0 = inner.next_id.0
1032 .expect("You overflowed a u64 by incrementing by 1... \
1033 You've just earned yourself a free drink if we ever meet. \
1034 Seriously, how did you do that?!");
1039 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1040 /// Get the global TyCtxt.
1042 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
1045 interners: &self.gcx.global_interners,
1049 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
1050 self.global_arenas.generics.alloc(generics)
1053 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
1054 self.global_arenas.steal_mir.alloc(Steal::new(mir))
1057 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
1058 self.global_arenas.mir.alloc(mir)
1061 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1062 self.global_arenas.tables.alloc(tables)
1065 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1066 self.global_arenas.trait_def.alloc(def)
1069 pub fn alloc_adt_def(self,
1072 variants: Vec<ty::VariantDef>,
1074 -> &'gcx ty::AdtDef {
1075 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1076 self.global_arenas.adt_def.alloc(def)
1079 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1080 if bytes.is_empty() {
1083 self.global_interners.arena.alloc_slice(bytes)
1087 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1088 -> &'tcx [&'tcx ty::Const<'tcx>] {
1089 if values.is_empty() {
1092 self.interners.arena.alloc_slice(values)
1096 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1097 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1098 if values.is_empty() {
1101 self.interners.arena.alloc_slice(values)
1105 pub fn intern_const_alloc(
1107 alloc: interpret::Allocation,
1108 ) -> &'gcx interpret::Allocation {
1109 let allocs = &mut self.interpret_interner.inner.borrow_mut().allocs;
1110 if let Some(alloc) = allocs.get(&alloc) {
1114 let interned = self.global_arenas.const_allocs.alloc(alloc);
1115 if let Some(prev) = allocs.replace(interned) {
1116 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1121 /// Allocates a byte or string literal for `mir::interpret`
1122 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1123 // create an allocation that just contains these bytes
1124 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1125 let alloc = self.intern_const_alloc(alloc);
1127 // the next unique id
1128 let id = self.interpret_interner.reserve();
1129 self.interpret_interner.intern_at_reserved(id, alloc);
1133 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1134 let mut stability_interner = self.stability_interner.borrow_mut();
1135 if let Some(st) = stability_interner.get(&stab) {
1139 let interned = self.global_interners.arena.alloc(stab);
1140 if let Some(prev) = stability_interner.replace(interned) {
1141 bug!("Tried to overwrite interned Stability: {:?}", prev)
1146 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1147 let mut layout_interner = self.layout_interner.borrow_mut();
1148 if let Some(layout) = layout_interner.get(&layout) {
1152 let interned = self.global_arenas.layout.alloc(layout);
1153 if let Some(prev) = layout_interner.replace(interned) {
1154 bug!("Tried to overwrite interned Layout: {:?}", prev)
1159 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1160 value.lift_to_tcx(self)
1163 /// Like lift, but only tries in the global tcx.
1164 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1165 value.lift_to_tcx(self.global_tcx())
1168 /// Returns true if self is the same as self.global_tcx().
1169 fn is_global(self) -> bool {
1170 let local = self.interners as *const _;
1171 let global = &self.global_interners as *const _;
1172 local as usize == global as usize
1175 /// Create a type context and call the closure with a `TyCtxt` reference
1176 /// to the context. The closure enforces that the type context and any interned
1177 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1178 /// reference to the context, to allow formatting values that need it.
1179 pub fn create_and_enter<F, R>(s: &'tcx Session,
1180 cstore: &'tcx CrateStoreDyn,
1181 local_providers: ty::maps::Providers<'tcx>,
1182 extern_providers: ty::maps::Providers<'tcx>,
1183 arenas: &'tcx AllArenas<'tcx>,
1184 resolutions: ty::Resolutions,
1185 hir: hir_map::Map<'tcx>,
1186 on_disk_query_result_cache: maps::OnDiskCache<'tcx>,
1188 tx: mpsc::Sender<Box<dyn Any + Send>>,
1189 output_filenames: &OutputFilenames,
1191 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1193 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1196 let interners = CtxtInterners::new(&arenas.interner);
1197 let common_types = CommonTypes::new(&interners);
1198 let dep_graph = hir.dep_graph.clone();
1199 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1200 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1201 providers[LOCAL_CRATE] = local_providers;
1203 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1204 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1207 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1210 let def_path_tables = || {
1211 upstream_def_path_tables
1213 .map(|&(cnum, ref rc)| (cnum, &**rc))
1214 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1217 // Precompute the capacity of the hashmap so we don't have to
1218 // re-allocate when populating it.
1219 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1221 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1223 ::std::default::Default::default()
1226 for (cnum, def_path_table) in def_path_tables() {
1227 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1235 let mut trait_map = FxHashMap();
1236 for (k, v) in resolutions.trait_map {
1237 let hir_id = hir.node_to_hir_id(k);
1238 let map = trait_map.entry(hir_id.owner)
1239 .or_insert_with(|| Lrc::new(FxHashMap()));
1240 Lrc::get_mut(map).unwrap()
1241 .insert(hir_id.local_id,
1242 Lrc::new(StableVec::new(v)));
1245 let gcx = &GlobalCtxt {
1248 global_arenas: &arenas.global,
1249 global_interners: interners,
1250 dep_graph: dep_graph.clone(),
1251 on_disk_query_result_cache,
1252 types: common_types,
1254 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1257 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1258 (hir.local_def_id(k), Lrc::new(v))
1260 maybe_unused_trait_imports:
1261 resolutions.maybe_unused_trait_imports
1263 .map(|id| hir.local_def_id(id))
1265 maybe_unused_extern_crates:
1266 resolutions.maybe_unused_extern_crates
1268 .map(|(id, sp)| (hir.local_def_id(id), sp))
1271 def_path_hash_to_def_id,
1272 maps: maps::Maps::new(providers),
1273 rcache: Lock::new(FxHashMap()),
1274 selection_cache: traits::SelectionCache::new(),
1275 evaluation_cache: traits::EvaluationCache::new(),
1276 crate_name: Symbol::intern(crate_name),
1278 layout_interner: Lock::new(FxHashSet()),
1279 stability_interner: Lock::new(FxHashSet()),
1280 interpret_interner: Default::default(),
1281 tx_to_llvm_workers: Lock::new(tx),
1282 output_filenames: Arc::new(output_filenames.clone()),
1285 tls::enter_global(gcx, f)
1288 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1289 let cname = self.crate_name(LOCAL_CRATE).as_str();
1290 self.sess.consider_optimizing(&cname, msg)
1293 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1294 self.get_lang_items(LOCAL_CRATE)
1297 /// Due to missing llvm support for lowering 128 bit math to software emulation
1298 /// (on some targets), the lowering can be done in MIR.
1300 /// This function only exists until said support is implemented.
1301 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1302 let items = self.lang_items();
1303 let def_id = Some(def_id);
1304 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1305 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1306 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1307 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1308 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1309 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1310 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1311 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1312 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1313 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1314 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1315 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1316 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1317 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1318 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1319 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1320 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1321 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1322 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1323 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1324 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1325 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1326 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1327 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1331 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1332 self.stability_index(LOCAL_CRATE)
1335 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1336 self.all_crate_nums(LOCAL_CRATE)
1339 pub fn features(self) -> Lrc<feature_gate::Features> {
1340 self.features_query(LOCAL_CRATE)
1343 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1345 self.hir.def_key(id)
1347 self.cstore.def_key(id)
1351 /// Convert a `DefId` into its fully expanded `DefPath` (every
1352 /// `DefId` is really just an interned def-path).
1354 /// Note that if `id` is not local to this crate, the result will
1355 /// be a non-local `DefPath`.
1356 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1358 self.hir.def_path(id)
1360 self.cstore.def_path(id)
1365 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1366 if def_id.is_local() {
1367 self.hir.definitions().def_path_hash(def_id.index)
1369 self.cstore.def_path_hash(def_id)
1373 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1374 // We are explicitly not going through queries here in order to get
1375 // crate name and disambiguator since this code is called from debug!()
1376 // statements within the query system and we'd run into endless
1377 // recursion otherwise.
1378 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1379 (self.crate_name.clone(),
1380 self.sess.local_crate_disambiguator())
1382 (self.cstore.crate_name_untracked(def_id.krate),
1383 self.cstore.crate_disambiguator_untracked(def_id.krate))
1388 // Don't print the whole crate disambiguator. That's just
1389 // annoying in debug output.
1390 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1391 self.def_path(def_id).to_string_no_crate())
1394 pub fn metadata_encoding_version(self) -> Vec<u8> {
1395 self.cstore.metadata_encoding_version().to_vec()
1398 // Note that this is *untracked* and should only be used within the query
1399 // system if the result is otherwise tracked through queries
1400 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1401 self.cstore.crate_data_as_rc_any(cnum)
1404 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1405 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1407 StableHashingContext::new(self.sess,
1409 self.hir.definitions(),
1413 // This method makes sure that we have a DepNode and a Fingerprint for
1414 // every upstream crate. It needs to be called once right after the tcx is
1416 // With full-fledged red/green, the method will probably become unnecessary
1417 // as this will be done on-demand.
1418 pub fn allocate_metadata_dep_nodes(self) {
1419 // We cannot use the query versions of crates() and crate_hash(), since
1420 // those would need the DepNodes that we are allocating here.
1421 for cnum in self.cstore.crates_untracked() {
1422 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1423 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1424 self.dep_graph.with_task(dep_node,
1427 |_, x| x // No transformation needed
1432 // This method exercises the `in_scope_traits_map` query for all possible
1433 // values so that we have their fingerprints available in the DepGraph.
1434 // This is only required as long as we still use the old dependency tracking
1435 // which needs to have the fingerprints of all input nodes beforehand.
1436 pub fn precompute_in_scope_traits_hashes(self) {
1437 for &def_index in self.trait_map.keys() {
1438 self.in_scope_traits_map(def_index);
1442 pub fn serialize_query_result_cache<E>(self,
1444 -> Result<(), E::Error>
1445 where E: ty::codec::TyEncoder
1447 self.on_disk_query_result_cache.serialize(self.global_tcx(), encoder)
1450 /// If true, we should use the MIR-based borrowck (we may *also* use
1451 /// the AST-based borrowck).
1452 pub fn use_mir_borrowck(self) -> bool {
1453 self.borrowck_mode().use_mir()
1456 /// If true, pattern variables for use in guards on match arms
1457 /// will be bound as references to the data, and occurrences of
1458 /// those variables in the guard expression will implicitly
1459 /// dereference those bindings. (See rust-lang/rust#27282.)
1460 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1461 self.borrowck_mode().use_mir()
1464 /// If true, we should enable two-phase borrows checks. This is
1465 /// done with either `-Ztwo-phase-borrows` or with
1466 /// `#![feature(nll)]`.
1467 pub fn two_phase_borrows(self) -> bool {
1468 self.features().nll || self.sess.opts.debugging_opts.two_phase_borrows
1471 /// What mode(s) of borrowck should we run? AST? MIR? both?
1472 /// (Also considers the `#![feature(nll)]` setting.)
1473 pub fn borrowck_mode(&self) -> BorrowckMode {
1474 match self.sess.opts.borrowck_mode {
1475 mode @ BorrowckMode::Mir |
1476 mode @ BorrowckMode::Compare => mode,
1478 mode @ BorrowckMode::Ast => {
1479 if self.features().nll {
1489 /// Should we emit EndRegion MIR statements? These are consumed by
1490 /// MIR borrowck, but not when NLL is used. They are also consumed
1491 /// by the validation stuff.
1492 pub fn emit_end_regions(self) -> bool {
1493 self.sess.opts.debugging_opts.emit_end_regions ||
1494 self.sess.opts.debugging_opts.mir_emit_validate > 0 ||
1495 self.use_mir_borrowck()
1499 pub fn share_generics(self) -> bool {
1500 match self.sess.opts.debugging_opts.share_generics {
1501 Some(setting) => setting,
1503 self.sess.opts.incremental.is_some() ||
1504 match self.sess.opts.optimize {
1508 OptLevel::SizeMin => true,
1510 OptLevel::Aggressive => false,
1517 pub fn local_crate_exports_generics(self) -> bool {
1518 debug_assert!(self.share_generics());
1520 self.sess.crate_types.borrow().iter().any(|crate_type| {
1522 CrateTypeExecutable |
1523 CrateTypeStaticlib |
1524 CrateTypeProcMacro |
1525 CrateTypeCdylib => false,
1527 CrateTypeDylib => true,
1533 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1534 pub fn encode_metadata(self, link_meta: &LinkMeta)
1537 self.cstore.encode_metadata(self, link_meta)
1541 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1542 /// Call the closure with a local `TyCtxt` using the given arena.
1543 pub fn enter_local<F, R>(
1545 arena: &'tcx SyncDroplessArena,
1549 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1551 let interners = CtxtInterners::new(arena);
1554 interners: &interners,
1556 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1557 let new_icx = ty::tls::ImplicitCtxt {
1559 query: icx.query.clone(),
1560 layout_depth: icx.layout_depth,
1563 ty::tls::enter_context(&new_icx, |new_icx| {
1570 /// A trait implemented for all X<'a> types which can be safely and
1571 /// efficiently converted to X<'tcx> as long as they are part of the
1572 /// provided TyCtxt<'tcx>.
1573 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1574 /// by looking them up in their respective interners.
1576 /// However, this is still not the best implementation as it does
1577 /// need to compare the components, even for interned values.
1578 /// It would be more efficient if TypedArena provided a way to
1579 /// determine whether the address is in the allocated range.
1581 /// None is returned if the value or one of the components is not part
1582 /// of the provided context.
1583 /// For Ty, None can be returned if either the type interner doesn't
1584 /// contain the TypeVariants key or if the address of the interned
1585 /// pointer differs. The latter case is possible if a primitive type,
1586 /// e.g. `()` or `u8`, was interned in a different context.
1587 pub trait Lift<'tcx> {
1589 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1592 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1593 type Lifted = Ty<'tcx>;
1594 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1595 if tcx.interners.arena.in_arena(*self as *const _) {
1596 return Some(unsafe { mem::transmute(*self) });
1598 // Also try in the global tcx if we're not that.
1599 if !tcx.is_global() {
1600 self.lift_to_tcx(tcx.global_tcx())
1607 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1608 type Lifted = Region<'tcx>;
1609 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1610 if tcx.interners.arena.in_arena(*self as *const _) {
1611 return Some(unsafe { mem::transmute(*self) });
1613 // Also try in the global tcx if we're not that.
1614 if !tcx.is_global() {
1615 self.lift_to_tcx(tcx.global_tcx())
1622 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1623 type Lifted = &'tcx Const<'tcx>;
1624 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1625 if tcx.interners.arena.in_arena(*self as *const _) {
1626 return Some(unsafe { mem::transmute(*self) });
1628 // Also try in the global tcx if we're not that.
1629 if !tcx.is_global() {
1630 self.lift_to_tcx(tcx.global_tcx())
1637 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1638 type Lifted = &'tcx Substs<'tcx>;
1639 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1640 if self.len() == 0 {
1641 return Some(Slice::empty());
1643 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1644 return Some(unsafe { mem::transmute(*self) });
1646 // Also try in the global tcx if we're not that.
1647 if !tcx.is_global() {
1648 self.lift_to_tcx(tcx.global_tcx())
1655 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Ty<'a>> {
1656 type Lifted = &'tcx Slice<Ty<'tcx>>;
1657 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1658 -> Option<&'tcx Slice<Ty<'tcx>>> {
1659 if self.len() == 0 {
1660 return Some(Slice::empty());
1662 if tcx.interners.arena.in_arena(*self as *const _) {
1663 return Some(unsafe { mem::transmute(*self) });
1665 // Also try in the global tcx if we're not that.
1666 if !tcx.is_global() {
1667 self.lift_to_tcx(tcx.global_tcx())
1674 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<ExistentialPredicate<'a>> {
1675 type Lifted = &'tcx Slice<ExistentialPredicate<'tcx>>;
1676 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1677 -> Option<&'tcx Slice<ExistentialPredicate<'tcx>>> {
1678 if self.is_empty() {
1679 return Some(Slice::empty());
1681 if tcx.interners.arena.in_arena(*self as *const _) {
1682 return Some(unsafe { mem::transmute(*self) });
1684 // Also try in the global tcx if we're not that.
1685 if !tcx.is_global() {
1686 self.lift_to_tcx(tcx.global_tcx())
1693 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Predicate<'a>> {
1694 type Lifted = &'tcx Slice<Predicate<'tcx>>;
1695 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1696 -> Option<&'tcx Slice<Predicate<'tcx>>> {
1697 if self.is_empty() {
1698 return Some(Slice::empty());
1700 if tcx.interners.arena.in_arena(*self as *const _) {
1701 return Some(unsafe { mem::transmute(*self) });
1703 // Also try in the global tcx if we're not that.
1704 if !tcx.is_global() {
1705 self.lift_to_tcx(tcx.global_tcx())
1712 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<CanonicalVarInfo> {
1713 type Lifted = &'tcx Slice<CanonicalVarInfo>;
1714 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1715 if self.len() == 0 {
1716 return Some(Slice::empty());
1718 if tcx.interners.arena.in_arena(*self as *const _) {
1719 return Some(unsafe { mem::transmute(*self) });
1721 // Also try in the global tcx if we're not that.
1722 if !tcx.is_global() {
1723 self.lift_to_tcx(tcx.global_tcx())
1731 use super::{GlobalCtxt, TyCtxt};
1733 use std::cell::Cell;
1738 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1739 use rustc_data_structures::OnDrop;
1740 use rustc_data_structures::sync::Lrc;
1741 use dep_graph::OpenTask;
1743 /// This is the implicit state of rustc. It contains the current
1744 /// TyCtxt and query. It is updated when creating a local interner or
1745 /// executing a new query. Whenever there's a TyCtxt value available
1746 /// you should also have access to an ImplicitCtxt through the functions
1749 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1750 /// The current TyCtxt. Initially created by `enter_global` and updated
1751 /// by `enter_local` with a new local interner
1752 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1754 /// The current query job, if any. This is updated by start_job in
1755 /// ty::maps::plumbing when executing a query
1756 pub query: Option<Lrc<maps::QueryJob<'gcx>>>,
1758 /// Used to prevent layout from recursing too deeply.
1759 pub layout_depth: usize,
1761 /// The current dep graph task. This is used to add dependencies to queries
1762 /// when executing them
1763 pub task: &'a OpenTask,
1766 // A thread local value which stores a pointer to the current ImplicitCtxt
1767 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1769 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1770 let old = get_tlv();
1771 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1772 TLV.with(|tlv| tlv.set(value));
1776 fn get_tlv() -> usize {
1777 TLV.with(|tlv| tlv.get())
1780 /// This is a callback from libsyntax as it cannot access the implicit state
1781 /// in librustc otherwise
1782 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter) -> fmt::Result {
1784 write!(f, "{}", tcx.sess.codemap().span_to_string(span))
1788 /// This is a callback from libsyntax as it cannot access the implicit state
1789 /// in librustc otherwise. It is used to when diagnostic messages are
1790 /// emitted and stores them in the current query, if there is one.
1791 fn track_diagnostic(diagnostic: &Diagnostic) {
1792 with_context_opt(|icx| {
1793 if let Some(icx) = icx {
1794 if let Some(ref query) = icx.query {
1795 query.diagnostics.lock().push(diagnostic.clone());
1801 /// Sets up the callbacks from libsyntax on the current thread
1802 pub fn with_thread_locals<F, R>(f: F) -> R
1803 where F: FnOnce() -> R
1805 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1806 let original_span_debug = span_dbg.get();
1807 span_dbg.set(span_debug);
1809 let _on_drop = OnDrop(move || {
1810 span_dbg.set(original_span_debug);
1813 TRACK_DIAGNOSTICS.with(|current| {
1814 let original = current.get();
1815 current.set(track_diagnostic);
1817 let _on_drop = OnDrop(move || {
1818 current.set(original);
1826 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1827 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1829 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1831 set_tlv(context as *const _ as usize, || {
1836 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1837 /// creating a initial TyCtxt and ImplicitCtxt.
1838 /// This happens once per rustc session and TyCtxts only exists
1839 /// inside the `f` function.
1840 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
1841 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
1843 with_thread_locals(|| {
1846 interners: &gcx.global_interners,
1848 let icx = ImplicitCtxt {
1852 task: &OpenTask::Ignore,
1854 enter_context(&icx, |_| {
1860 /// Allows access to the current ImplicitCtxt in a closure if one is available
1861 pub fn with_context_opt<F, R>(f: F) -> R
1862 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
1864 let context = get_tlv();
1868 unsafe { f(Some(&*(context as *const ImplicitCtxt))) }
1872 /// Allows access to the current ImplicitCtxt.
1873 /// Panics if there is no ImplicitCtxt available
1874 pub fn with_context<F, R>(f: F) -> R
1875 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1877 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
1880 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
1881 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
1882 /// with the same 'gcx lifetime as the TyCtxt passed in.
1883 /// This will panic if you pass it a TyCtxt which has a different global interner from
1884 /// the current ImplicitCtxt's tcx field.
1885 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
1886 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
1888 with_context(|context| {
1890 let gcx = tcx.gcx as *const _ as usize;
1891 assert!(context.tcx.gcx as *const _ as usize == gcx);
1892 let context: &ImplicitCtxt = mem::transmute(context);
1898 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
1899 /// interner and local interner as the tcx argument passed in. This means the closure
1900 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
1901 /// This will panic if you pass it a TyCtxt which has a different global interner or
1902 /// a different local interner from the current ImplicitCtxt's tcx field.
1903 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
1904 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
1906 with_context(|context| {
1908 let gcx = tcx.gcx as *const _ as usize;
1909 let interners = tcx.interners as *const _ as usize;
1910 assert!(context.tcx.gcx as *const _ as usize == gcx);
1911 assert!(context.tcx.interners as *const _ as usize == interners);
1912 let context: &ImplicitCtxt = mem::transmute(context);
1918 /// Allows access to the TyCtxt in the current ImplicitCtxt.
1919 /// Panics if there is no ImplicitCtxt available
1920 pub fn with<F, R>(f: F) -> R
1921 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1923 with_context(|context| f(context.tcx))
1926 /// Allows access to the TyCtxt in the current ImplicitCtxt.
1927 /// The closure is passed None if there is no ImplicitCtxt available
1928 pub fn with_opt<F, R>(f: F) -> R
1929 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
1931 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
1935 macro_rules! sty_debug_print {
1936 ($ctxt: expr, $($variant: ident),*) => {{
1937 // curious inner module to allow variant names to be used as
1939 #[allow(non_snake_case)]
1941 use ty::{self, TyCtxt};
1942 use ty::context::Interned;
1944 #[derive(Copy, Clone)]
1947 region_infer: usize,
1952 pub fn go(tcx: TyCtxt) {
1953 let mut total = DebugStat {
1955 region_infer: 0, ty_infer: 0, both_infer: 0,
1957 $(let mut $variant = total;)*
1960 for &Interned(t) in tcx.interners.type_.borrow().iter() {
1961 let variant = match t.sty {
1962 ty::TyBool | ty::TyChar | ty::TyInt(..) | ty::TyUint(..) |
1963 ty::TyFloat(..) | ty::TyStr | ty::TyNever => continue,
1964 ty::TyError => /* unimportant */ continue,
1965 $(ty::$variant(..) => &mut $variant,)*
1967 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
1968 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
1972 if region { total.region_infer += 1; variant.region_infer += 1 }
1973 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
1974 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
1976 println!("Ty interner total ty region both");
1977 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
1978 {ty:4.1}% {region:5.1}% {both:4.1}%",
1979 stringify!($variant),
1980 uses = $variant.total,
1981 usespc = $variant.total as f64 * 100.0 / total.total as f64,
1982 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
1983 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
1984 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
1986 println!(" total {uses:6} \
1987 {ty:4.1}% {region:5.1}% {both:4.1}%",
1989 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
1990 region = total.region_infer as f64 * 100.0 / total.total as f64,
1991 both = total.both_infer as f64 * 100.0 / total.total as f64)
1999 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2000 pub fn print_debug_stats(self) {
2003 TyAdt, TyArray, TySlice, TyRawPtr, TyRef, TyFnDef, TyFnPtr,
2004 TyGenerator, TyGeneratorWitness, TyDynamic, TyClosure, TyTuple,
2005 TyParam, TyInfer, TyProjection, TyAnon, TyForeign);
2007 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2008 println!("Region interner: #{}", self.interners.region.borrow().len());
2009 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2010 println!("Interpret interner: #{}", self.interpret_interner.inner.borrow().allocs.len());
2011 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2016 /// An entry in an interner.
2017 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2019 // NB: An Interned<Ty> compares and hashes as a sty.
2020 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2021 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2022 self.0.sty == other.0.sty
2026 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2028 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2029 fn hash<H: Hasher>(&self, s: &mut H) {
2034 impl<'tcx: 'lcx, 'lcx> Borrow<TypeVariants<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2035 fn borrow<'a>(&'a self) -> &'a TypeVariants<'lcx> {
2040 // NB: An Interned<Slice<T>> compares and hashes as its elements.
2041 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, Slice<T>> {
2042 fn eq(&self, other: &Interned<'tcx, Slice<T>>) -> bool {
2043 self.0[..] == other.0[..]
2047 impl<'tcx, T: Eq> Eq for Interned<'tcx, Slice<T>> {}
2049 impl<'tcx, T: Hash> Hash for Interned<'tcx, Slice<T>> {
2050 fn hash<H: Hasher>(&self, s: &mut H) {
2055 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, Slice<Ty<'tcx>>> {
2056 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2061 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, Slice<CanonicalVarInfo>> {
2062 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2067 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2068 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2073 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2074 fn borrow<'a>(&'a self) -> &'a RegionKind {
2079 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2080 for Interned<'tcx, Slice<ExistentialPredicate<'tcx>>> {
2081 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2086 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2087 for Interned<'tcx, Slice<Predicate<'tcx>>> {
2088 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2093 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2094 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2099 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2100 for Interned<'tcx, Slice<Clause<'tcx>>> {
2101 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2106 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2107 for Interned<'tcx, Slice<Goal<'tcx>>> {
2108 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2113 macro_rules! intern_method {
2114 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2115 $alloc_method:ident,
2118 $keep_in_local_tcx:expr) -> $ty:ty) => {
2119 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2120 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2121 let key = ($alloc_to_key)(&v);
2123 // HACK(eddyb) Depend on flags being accurate to
2124 // determine that all contents are in the global tcx.
2125 // See comments on Lift for why we can't use that.
2126 if ($keep_in_local_tcx)(&v) {
2127 let mut interner = self.interners.$name.borrow_mut();
2128 if let Some(&Interned(v)) = interner.get(key) {
2132 // Make sure we don't end up with inference
2133 // types/regions in the global tcx.
2134 if self.is_global() {
2135 bug!("Attempted to intern `{:?}` which contains \
2136 inference types/regions in the global type context",
2140 let i = ($alloc_to_ret)(self.interners.arena.$alloc_method(v));
2141 interner.insert(Interned(i));
2144 let mut interner = self.global_interners.$name.borrow_mut();
2145 if let Some(&Interned(v)) = interner.get(key) {
2149 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2153 let i = ($alloc_to_ret)(self.global_interners.arena.$alloc_method(v));
2154 interner.insert(Interned(i));
2162 macro_rules! direct_interners {
2163 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2164 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2165 fn eq(&self, other: &Self) -> bool {
2170 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2172 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2173 fn hash<H: Hasher>(&self, s: &mut H) {
2180 $name: $method($ty, alloc, |x| x, |x| x, $keep_in_local_tcx) -> $ty
2185 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2186 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2189 direct_interners!('tcx,
2190 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2191 const_: mk_const(|c: &Const| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>
2194 macro_rules! slice_interners {
2195 ($($field:ident: $method:ident($ty:ident)),+) => (
2196 $(intern_method!('tcx, $field: $method(&[$ty<'tcx>], alloc_slice, Deref::deref,
2197 |xs: &[$ty]| -> &Slice<$ty> {
2198 unsafe { mem::transmute(xs) }
2199 }, |xs: &[$ty]| xs.iter().any(keep_local)) -> Slice<$ty<'tcx>>);)+
2204 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2205 predicates: _intern_predicates(Predicate),
2206 type_list: _intern_type_list(Ty),
2207 substs: _intern_substs(Kind),
2208 clauses: _intern_clauses(Clause),
2209 goals: _intern_goals(Goal)
2212 // This isn't a perfect fit: CanonicalVarInfo slices are always
2213 // allocated in the global arena, so this `intern_method!` macro is
2214 // overly general. But we just return false for the code that checks
2215 // whether they belong in the thread-local arena, so no harm done, and
2216 // seems better than open-coding the rest.
2219 canonical_var_infos: _intern_canonical_var_infos(
2220 &[CanonicalVarInfo],
2223 |xs: &[CanonicalVarInfo]| -> &Slice<CanonicalVarInfo> { unsafe { mem::transmute(xs) } },
2224 |_xs: &[CanonicalVarInfo]| -> bool { false }
2225 ) -> Slice<CanonicalVarInfo>
2228 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2229 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2230 /// that is, a `fn` type that is equivalent in every way for being
2232 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2233 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2234 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2235 unsafety: hir::Unsafety::Unsafe,
2240 /// Given a closure signature `sig`, returns an equivalent `fn`
2241 /// type with the same signature. Detuples and so forth -- so
2242 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2243 /// a `fn(u32, i32)`.
2244 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2245 let converted_sig = sig.map_bound(|s| {
2246 let params_iter = match s.inputs()[0].sty {
2247 ty::TyTuple(params) => {
2248 params.into_iter().cloned()
2256 hir::Unsafety::Normal,
2261 self.mk_fn_ptr(converted_sig)
2264 pub fn mk_ty(&self, st: TypeVariants<'tcx>) -> Ty<'tcx> {
2265 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2268 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2270 ast::IntTy::Isize => self.types.isize,
2271 ast::IntTy::I8 => self.types.i8,
2272 ast::IntTy::I16 => self.types.i16,
2273 ast::IntTy::I32 => self.types.i32,
2274 ast::IntTy::I64 => self.types.i64,
2275 ast::IntTy::I128 => self.types.i128,
2279 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2281 ast::UintTy::Usize => self.types.usize,
2282 ast::UintTy::U8 => self.types.u8,
2283 ast::UintTy::U16 => self.types.u16,
2284 ast::UintTy::U32 => self.types.u32,
2285 ast::UintTy::U64 => self.types.u64,
2286 ast::UintTy::U128 => self.types.u128,
2290 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2292 ast::FloatTy::F32 => self.types.f32,
2293 ast::FloatTy::F64 => self.types.f64,
2297 pub fn mk_str(self) -> Ty<'tcx> {
2301 pub fn mk_static_str(self) -> Ty<'tcx> {
2302 self.mk_imm_ref(self.types.re_static, self.mk_str())
2305 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2306 // take a copy of substs so that we own the vectors inside
2307 self.mk_ty(TyAdt(def, substs))
2310 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2311 self.mk_ty(TyForeign(def_id))
2314 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2315 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2316 let adt_def = self.adt_def(def_id);
2317 let substs = Substs::for_item(self, def_id, |param, substs| {
2319 GenericParamDefKind::Lifetime => bug!(),
2320 GenericParamDefKind::Type { has_default, .. } => {
2321 if param.index == 0 {
2324 assert!(has_default);
2325 self.type_of(param.def_id).subst(self, substs).into()
2330 self.mk_ty(TyAdt(adt_def, substs))
2333 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2334 self.mk_ty(TyRawPtr(tm))
2337 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2338 self.mk_ty(TyRef(r, tm.ty, tm.mutbl))
2341 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2342 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2345 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2346 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2349 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2350 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2353 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2354 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2357 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2358 self.mk_imm_ptr(self.mk_nil())
2361 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2362 self.mk_ty(TyArray(ty, ty::Const::from_usize(self, n)))
2365 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2366 self.mk_ty(TySlice(ty))
2369 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2370 self.mk_ty(TyTuple(self.intern_type_list(ts)))
2373 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2374 iter.intern_with(|ts| self.mk_ty(TyTuple(self.intern_type_list(ts))))
2377 pub fn mk_nil(self) -> Ty<'tcx> {
2378 self.intern_tup(&[])
2381 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2382 if self.features().never_type {
2385 self.intern_tup(&[])
2389 pub fn mk_bool(self) -> Ty<'tcx> {
2393 pub fn mk_fn_def(self, def_id: DefId,
2394 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2395 self.mk_ty(TyFnDef(def_id, substs))
2398 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2399 self.mk_ty(TyFnPtr(fty))
2404 obj: ty::Binder<&'tcx Slice<ExistentialPredicate<'tcx>>>,
2405 reg: ty::Region<'tcx>
2407 self.mk_ty(TyDynamic(obj, reg))
2410 pub fn mk_projection(self,
2412 substs: &'tcx Substs<'tcx>)
2414 self.mk_ty(TyProjection(ProjectionTy {
2420 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2422 self.mk_ty(TyClosure(closure_id, closure_substs))
2425 pub fn mk_generator(self,
2427 generator_substs: GeneratorSubsts<'tcx>,
2428 movability: hir::GeneratorMovability)
2430 self.mk_ty(TyGenerator(id, generator_substs, movability))
2433 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx Slice<Ty<'tcx>>>) -> Ty<'tcx> {
2434 self.mk_ty(TyGeneratorWitness(types))
2437 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2438 self.mk_infer(TyVar(v))
2441 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2442 self.mk_infer(IntVar(v))
2445 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2446 self.mk_infer(FloatVar(v))
2449 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2450 self.mk_ty(TyInfer(it))
2453 pub fn mk_ty_param(self,
2455 name: InternedString) -> Ty<'tcx> {
2456 self.mk_ty(TyParam(ParamTy { idx: index, name: name }))
2459 pub fn mk_self_type(self) -> Ty<'tcx> {
2460 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2463 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2465 GenericParamDefKind::Lifetime => {
2466 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2468 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2472 pub fn mk_anon(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2473 self.mk_ty(TyAnon(def_id, substs))
2476 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2477 -> &'tcx Slice<ExistentialPredicate<'tcx>> {
2478 assert!(!eps.is_empty());
2479 assert!(eps.windows(2).all(|w| w[0].cmp(self, &w[1]) != Ordering::Greater));
2480 self._intern_existential_predicates(eps)
2483 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2484 -> &'tcx Slice<Predicate<'tcx>> {
2485 // FIXME consider asking the input slice to be sorted to avoid
2486 // re-interning permutations, in which case that would be asserted
2488 if preds.len() == 0 {
2489 // The macro-generated method below asserts we don't intern an empty slice.
2492 self._intern_predicates(preds)
2496 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx Slice<Ty<'tcx>> {
2500 self._intern_type_list(ts)
2504 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx Slice<Kind<'tcx>> {
2508 self._intern_substs(ts)
2512 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2516 self.global_tcx()._intern_canonical_var_infos(ts)
2520 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2524 self._intern_clauses(ts)
2528 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2532 self._intern_goals(ts)
2536 pub fn mk_fn_sig<I>(self,
2540 unsafety: hir::Unsafety,
2542 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2544 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2546 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2547 inputs_and_output: self.intern_type_list(xs),
2548 variadic, unsafety, abi
2552 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2553 &'tcx Slice<ExistentialPredicate<'tcx>>>>(self, iter: I)
2555 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2558 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2559 &'tcx Slice<Predicate<'tcx>>>>(self, iter: I)
2561 iter.intern_with(|xs| self.intern_predicates(xs))
2564 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2565 &'tcx Slice<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2566 iter.intern_with(|xs| self.intern_type_list(xs))
2569 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2570 &'tcx Slice<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2571 iter.intern_with(|xs| self.intern_substs(xs))
2574 pub fn mk_substs_trait(self,
2576 rest: &[Kind<'tcx>])
2577 -> &'tcx Substs<'tcx>
2579 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2582 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2583 iter.intern_with(|xs| self.intern_clauses(xs))
2586 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2587 iter.intern_with(|xs| self.intern_goals(xs))
2590 pub fn mk_goal(self, goal: Goal<'tcx>) -> &'tcx Goal {
2591 &self.intern_goals(&[goal])[0]
2594 pub fn lint_node<S: Into<MultiSpan>>(self,
2595 lint: &'static Lint,
2599 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2602 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2603 lint: &'static Lint,
2608 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2613 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2614 -> (lint::Level, lint::LintSource)
2616 // Right now we insert a `with_ignore` node in the dep graph here to
2617 // ignore the fact that `lint_levels` below depends on the entire crate.
2618 // For now this'll prevent false positives of recompiling too much when
2619 // anything changes.
2621 // Once red/green incremental compilation lands we should be able to
2622 // remove this because while the crate changes often the lint level map
2623 // will change rarely.
2624 self.dep_graph.with_ignore(|| {
2625 let sets = self.lint_levels(LOCAL_CRATE);
2627 let hir_id = self.hir.definitions().node_to_hir_id(id);
2628 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2631 let next = self.hir.get_parent_node(id);
2633 bug!("lint traversal reached the root of the crate");
2640 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2641 lint: &'static Lint,
2645 -> DiagnosticBuilder<'tcx>
2647 let (level, src) = self.lint_level_at_node(lint, id);
2648 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2651 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2652 -> DiagnosticBuilder<'tcx>
2654 let (level, src) = self.lint_level_at_node(lint, id);
2655 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2658 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2659 self.in_scope_traits_map(id.owner)
2660 .and_then(|map| map.get(&id.local_id).cloned())
2663 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2664 self.named_region_map(id.owner)
2665 .and_then(|map| map.get(&id.local_id).cloned())
2668 pub fn is_late_bound(self, id: HirId) -> bool {
2669 self.is_late_bound_map(id.owner)
2670 .map(|set| set.contains(&id.local_id))
2674 pub fn object_lifetime_defaults(self, id: HirId)
2675 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2677 self.object_lifetime_defaults_map(id.owner)
2678 .and_then(|map| map.get(&id.local_id).cloned())
2682 pub trait InternAs<T: ?Sized, R> {
2684 fn intern_with<F>(self, f: F) -> Self::Output
2685 where F: FnOnce(&T) -> R;
2688 impl<I, T, R, E> InternAs<[T], R> for I
2689 where E: InternIteratorElement<T, R>,
2690 I: Iterator<Item=E> {
2691 type Output = E::Output;
2692 fn intern_with<F>(self, f: F) -> Self::Output
2693 where F: FnOnce(&[T]) -> R {
2694 E::intern_with(self, f)
2698 pub trait InternIteratorElement<T, R>: Sized {
2700 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2703 impl<T, R> InternIteratorElement<T, R> for T {
2705 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2706 f(&iter.collect::<AccumulateVec<[_; 8]>>())
2710 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2714 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2715 f(&iter.cloned().collect::<AccumulateVec<[_; 8]>>())
2719 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2720 type Output = Result<R, E>;
2721 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2722 Ok(f(&iter.collect::<Result<AccumulateVec<[_; 8]>, _>>()?))
2726 pub fn provide(providers: &mut ty::maps::Providers) {
2727 // FIXME(#44234) - almost all of these queries have no sub-queries and
2728 // therefore no actual inputs, they're just reading tables calculated in
2729 // resolve! Does this work? Unsure! That's what the issue is about
2730 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2731 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2732 providers.crate_name = |tcx, id| {
2733 assert_eq!(id, LOCAL_CRATE);
2736 providers.get_lang_items = |tcx, id| {
2737 assert_eq!(id, LOCAL_CRATE);
2738 // FIXME(#42293) Right now we insert a `with_ignore` node in the dep
2739 // graph here to ignore the fact that `get_lang_items` below depends on
2740 // the entire crate. For now this'll prevent false positives of
2741 // recompiling too much when anything changes.
2743 // Once red/green incremental compilation lands we should be able to
2744 // remove this because while the crate changes often the lint level map
2745 // will change rarely.
2746 tcx.dep_graph.with_ignore(|| Lrc::new(middle::lang_items::collect(tcx)))
2748 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
2749 providers.maybe_unused_trait_import = |tcx, id| {
2750 tcx.maybe_unused_trait_imports.contains(&id)
2752 providers.maybe_unused_extern_crates = |tcx, cnum| {
2753 assert_eq!(cnum, LOCAL_CRATE);
2754 Lrc::new(tcx.maybe_unused_extern_crates.clone())
2757 providers.stability_index = |tcx, cnum| {
2758 assert_eq!(cnum, LOCAL_CRATE);
2759 Lrc::new(stability::Index::new(tcx))
2761 providers.lookup_stability = |tcx, id| {
2762 assert_eq!(id.krate, LOCAL_CRATE);
2763 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
2764 tcx.stability().local_stability(id)
2766 providers.lookup_deprecation_entry = |tcx, id| {
2767 assert_eq!(id.krate, LOCAL_CRATE);
2768 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
2769 tcx.stability().local_deprecation_entry(id)
2771 providers.extern_mod_stmt_cnum = |tcx, id| {
2772 let id = tcx.hir.as_local_node_id(id).unwrap();
2773 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
2775 providers.all_crate_nums = |tcx, cnum| {
2776 assert_eq!(cnum, LOCAL_CRATE);
2777 Lrc::new(tcx.cstore.crates_untracked())
2779 providers.postorder_cnums = |tcx, cnum| {
2780 assert_eq!(cnum, LOCAL_CRATE);
2781 Lrc::new(tcx.cstore.postorder_cnums_untracked())
2783 providers.output_filenames = |tcx, cnum| {
2784 assert_eq!(cnum, LOCAL_CRATE);
2785 tcx.output_filenames.clone()
2787 providers.features_query = |tcx, cnum| {
2788 assert_eq!(cnum, LOCAL_CRATE);
2789 Lrc::new(tcx.sess.features_untracked().clone())
2791 providers.is_panic_runtime = |tcx, cnum| {
2792 assert_eq!(cnum, LOCAL_CRATE);
2793 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
2795 providers.is_compiler_builtins = |tcx, cnum| {
2796 assert_eq!(cnum, LOCAL_CRATE);
2797 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")