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::{CrateStore, 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::layout::{LayoutDetails, TargetDataLayout};
52 use util::nodemap::{DefIdSet, ItemLocalMap};
53 use util::nodemap::{FxHashMap, FxHashSet};
54 use rustc_data_structures::accumulate_vec::AccumulateVec;
55 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
56 StableHasher, StableHasherResult,
58 use arena::{TypedArena, SyncDroplessArena};
59 use rustc_data_structures::indexed_vec::IndexVec;
60 use rustc_data_structures::sync::{Lrc, Lock};
62 use std::borrow::Borrow;
63 use std::cmp::Ordering;
64 use std::collections::hash_map::{self, Entry};
65 use std::hash::{Hash, Hasher};
71 use rustc_target::spec::abi;
72 use syntax::ast::{self, NodeId};
74 use syntax::codemap::MultiSpan;
75 use syntax::feature_gate;
76 use syntax::symbol::{Symbol, keywords, InternedString};
81 pub struct AllArenas<'tcx> {
82 pub global: GlobalArenas<'tcx>,
83 pub interner: SyncDroplessArena,
86 impl<'tcx> AllArenas<'tcx> {
87 pub fn new() -> Self {
89 global: GlobalArenas::new(),
90 interner: SyncDroplessArena::new(),
96 pub struct GlobalArenas<'tcx> {
98 layout: TypedArena<LayoutDetails>,
101 generics: TypedArena<ty::Generics>,
102 trait_def: TypedArena<ty::TraitDef>,
103 adt_def: TypedArena<ty::AdtDef>,
104 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
105 mir: TypedArena<Mir<'tcx>>,
106 tables: TypedArena<ty::TypeckTables<'tcx>>,
108 const_allocs: TypedArena<interpret::Allocation>,
111 impl<'tcx> GlobalArenas<'tcx> {
112 pub fn new() -> GlobalArenas<'tcx> {
114 layout: TypedArena::new(),
115 generics: TypedArena::new(),
116 trait_def: TypedArena::new(),
117 adt_def: TypedArena::new(),
118 steal_mir: TypedArena::new(),
119 mir: TypedArena::new(),
120 tables: TypedArena::new(),
121 const_allocs: TypedArena::new(),
126 type InternedSet<'tcx, T> = Lock<FxHashSet<Interned<'tcx, T>>>;
128 pub struct CtxtInterners<'tcx> {
129 /// The arena that types, regions, etc are allocated from
130 arena: &'tcx SyncDroplessArena,
132 /// Specifically use a speedy hash algorithm for these hash sets,
133 /// they're accessed quite often.
134 type_: InternedSet<'tcx, TyS<'tcx>>,
135 type_list: InternedSet<'tcx, Slice<Ty<'tcx>>>,
136 substs: InternedSet<'tcx, Substs<'tcx>>,
137 canonical_var_infos: InternedSet<'tcx, Slice<CanonicalVarInfo>>,
138 region: InternedSet<'tcx, RegionKind>,
139 existential_predicates: InternedSet<'tcx, Slice<ExistentialPredicate<'tcx>>>,
140 predicates: InternedSet<'tcx, Slice<Predicate<'tcx>>>,
141 const_: InternedSet<'tcx, Const<'tcx>>,
142 clauses: InternedSet<'tcx, Slice<Clause<'tcx>>>,
143 goals: InternedSet<'tcx, Slice<Goal<'tcx>>>,
146 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
147 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
150 type_: Default::default(),
151 type_list: Default::default(),
152 substs: Default::default(),
153 region: Default::default(),
154 existential_predicates: Default::default(),
155 canonical_var_infos: Default::default(),
156 predicates: Default::default(),
157 const_: Default::default(),
158 clauses: Default::default(),
159 goals: Default::default(),
165 local: &CtxtInterners<'tcx>,
166 global: &CtxtInterners<'gcx>,
167 st: TypeVariants<'tcx>
169 let flags = super::flags::FlagComputation::for_sty(&st);
171 // HACK(eddyb) Depend on flags being accurate to
172 // determine that all contents are in the global tcx.
173 // See comments on Lift for why we can't use that.
174 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
175 let mut interner = local.type_.borrow_mut();
176 if let Some(&Interned(ty)) = interner.get(&st) {
180 let ty_struct = TyS {
183 region_depth: flags.depth,
186 // Make sure we don't end up with inference
187 // types/regions in the global interner
188 if local as *const _ as usize == global as *const _ as usize {
189 bug!("Attempted to intern `{:?}` which contains \
190 inference types/regions in the global type context",
194 // Don't be &mut TyS.
195 let ty: Ty<'tcx> = local.arena.alloc(ty_struct);
196 interner.insert(Interned(ty));
199 let mut interner = global.type_.borrow_mut();
200 if let Some(&Interned(ty)) = interner.get(&st) {
204 let ty_struct = TyS {
207 region_depth: flags.depth,
210 // This is safe because all the types the ty_struct can point to
211 // already is in the global arena
212 let ty_struct: TyS<'gcx> = unsafe {
213 mem::transmute(ty_struct)
216 // Don't be &mut TyS.
217 let ty: Ty<'gcx> = global.arena.alloc(ty_struct);
218 interner.insert(Interned(ty));
224 pub struct CommonTypes<'tcx> {
244 pub re_empty: Region<'tcx>,
245 pub re_static: Region<'tcx>,
246 pub re_erased: Region<'tcx>,
249 pub struct LocalTableInContext<'a, V: 'a> {
250 local_id_root: Option<DefId>,
251 data: &'a ItemLocalMap<V>
254 /// Validate that the given HirId (respectively its `local_id` part) can be
255 /// safely used as a key in the tables of a TypeckTable. For that to be
256 /// the case, the HirId must have the same `owner` as all the other IDs in
257 /// this table (signified by `local_id_root`). Otherwise the HirId
258 /// would be in a different frame of reference and using its `local_id`
259 /// would result in lookup errors, or worse, in silently wrong data being
261 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
264 if cfg!(debug_assertions) {
265 if let Some(local_id_root) = local_id_root {
266 if hir_id.owner != local_id_root.index {
267 ty::tls::with(|tcx| {
268 let node_id = tcx.hir
270 .find_node_for_hir_id(hir_id);
272 bug!("node {} with HirId::owner {:?} cannot be placed in \
273 TypeckTables with local_id_root {:?}",
274 tcx.hir.node_to_string(node_id),
275 DefId::local(hir_id.owner),
280 // We use "Null Object" TypeckTables in some of the analysis passes.
281 // These are just expected to be empty and their `local_id_root` is
282 // `None`. Therefore we cannot verify whether a given `HirId` would
283 // be a valid key for the given table. Instead we make sure that
284 // nobody tries to write to such a Null Object table.
286 bug!("access to invalid TypeckTables")
292 impl<'a, V> LocalTableInContext<'a, V> {
293 pub fn contains_key(&self, id: hir::HirId) -> bool {
294 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
295 self.data.contains_key(&id.local_id)
298 pub fn get(&self, id: hir::HirId) -> Option<&V> {
299 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
300 self.data.get(&id.local_id)
303 pub fn iter(&self) -> hash_map::Iter<hir::ItemLocalId, V> {
308 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
311 fn index(&self, key: hir::HirId) -> &V {
312 self.get(key).expect("LocalTableInContext: key not found")
316 pub struct LocalTableInContextMut<'a, V: 'a> {
317 local_id_root: Option<DefId>,
318 data: &'a mut ItemLocalMap<V>
321 impl<'a, V> LocalTableInContextMut<'a, V> {
322 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
323 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
324 self.data.get_mut(&id.local_id)
327 pub fn entry(&mut self, id: hir::HirId) -> Entry<hir::ItemLocalId, V> {
328 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
329 self.data.entry(id.local_id)
332 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
333 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
334 self.data.insert(id.local_id, val)
337 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
338 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
339 self.data.remove(&id.local_id)
343 #[derive(RustcEncodable, RustcDecodable, Debug)]
344 pub struct TypeckTables<'tcx> {
345 /// The HirId::owner all ItemLocalIds in this table are relative to.
346 pub local_id_root: Option<DefId>,
348 /// Resolved definitions for `<T>::X` associated paths and
349 /// method calls, including those of overloaded operators.
350 type_dependent_defs: ItemLocalMap<Def>,
352 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
353 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
354 /// about the field you also need definition of the variant to which the field
355 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
356 field_indices: ItemLocalMap<usize>,
358 /// Stores the canonicalized types provided by the user. See also `UserAssertTy` statement in
360 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
362 /// Stores the types for various nodes in the AST. Note that this table
363 /// is not guaranteed to be populated until after typeck. See
364 /// typeck::check::fn_ctxt for details.
365 node_types: ItemLocalMap<Ty<'tcx>>,
367 /// Stores the type parameters which were substituted to obtain the type
368 /// of this node. This only applies to nodes that refer to entities
369 /// parameterized by type parameters, such as generic fns, types, or
371 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
373 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
375 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
376 pat_binding_modes: ItemLocalMap<BindingMode>,
378 /// Stores the types which were implicitly dereferenced in pattern binding modes
379 /// for later usage in HAIR lowering. For example,
382 /// match &&Some(5i32) {
387 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
390 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
391 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
394 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
396 /// Records the reasons that we picked the kind of each closure;
397 /// not all closures are present in the map.
398 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
400 /// For each fn, records the "liberated" types of its arguments
401 /// and return type. Liberated means that all bound regions
402 /// (including late-bound regions) are replaced with free
403 /// equivalents. This table is not used in trans (since regions
404 /// are erased there) and hence is not serialized to metadata.
405 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
407 /// For each FRU expression, record the normalized types of the fields
408 /// of the struct - this is needed because it is non-trivial to
409 /// normalize while preserving regions. This table is used only in
410 /// MIR construction and hence is not serialized to metadata.
411 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
413 /// Maps a cast expression to its kind. This is keyed on the
414 /// *from* expression of the cast, not the cast itself.
415 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
417 /// Set of trait imports actually used in the method resolution.
418 /// This is used for warning unused imports. During type
419 /// checking, this `Lrc` should not be cloned: it must have a ref-count
420 /// of 1 so that we can insert things into the set mutably.
421 pub used_trait_imports: Lrc<DefIdSet>,
423 /// If any errors occurred while type-checking this body,
424 /// this field will be set to `true`.
425 pub tainted_by_errors: bool,
427 /// Stores the free-region relationships that were deduced from
428 /// its where clauses and parameter types. These are then
429 /// read-again by borrowck.
430 pub free_region_map: FreeRegionMap<'tcx>,
433 impl<'tcx> TypeckTables<'tcx> {
434 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
437 type_dependent_defs: ItemLocalMap(),
438 field_indices: ItemLocalMap(),
439 user_provided_tys: ItemLocalMap(),
440 node_types: ItemLocalMap(),
441 node_substs: ItemLocalMap(),
442 adjustments: ItemLocalMap(),
443 pat_binding_modes: ItemLocalMap(),
444 pat_adjustments: ItemLocalMap(),
445 upvar_capture_map: FxHashMap(),
446 closure_kind_origins: ItemLocalMap(),
447 liberated_fn_sigs: ItemLocalMap(),
448 fru_field_types: ItemLocalMap(),
449 cast_kinds: ItemLocalMap(),
450 used_trait_imports: Lrc::new(DefIdSet()),
451 tainted_by_errors: false,
452 free_region_map: FreeRegionMap::new(),
456 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
457 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
459 hir::QPath::Resolved(_, ref path) => path.def,
460 hir::QPath::TypeRelative(..) => {
461 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
462 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
467 pub fn type_dependent_defs(&self) -> LocalTableInContext<Def> {
468 LocalTableInContext {
469 local_id_root: self.local_id_root,
470 data: &self.type_dependent_defs
474 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<Def> {
475 LocalTableInContextMut {
476 local_id_root: self.local_id_root,
477 data: &mut self.type_dependent_defs
481 pub fn field_indices(&self) -> LocalTableInContext<usize> {
482 LocalTableInContext {
483 local_id_root: self.local_id_root,
484 data: &self.field_indices
488 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<usize> {
489 LocalTableInContextMut {
490 local_id_root: self.local_id_root,
491 data: &mut self.field_indices
495 pub fn user_provided_tys(&self) -> LocalTableInContext<CanonicalTy<'tcx>> {
496 LocalTableInContext {
497 local_id_root: self.local_id_root,
498 data: &self.user_provided_tys
502 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<CanonicalTy<'tcx>> {
503 LocalTableInContextMut {
504 local_id_root: self.local_id_root,
505 data: &mut self.user_provided_tys
509 pub fn node_types(&self) -> LocalTableInContext<Ty<'tcx>> {
510 LocalTableInContext {
511 local_id_root: self.local_id_root,
512 data: &self.node_types
516 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<Ty<'tcx>> {
517 LocalTableInContextMut {
518 local_id_root: self.local_id_root,
519 data: &mut self.node_types
523 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
524 match self.node_id_to_type_opt(id) {
527 bug!("node_id_to_type: no type for node `{}`",
529 let id = tcx.hir.definitions().find_node_for_hir_id(id);
530 tcx.hir.node_to_string(id)
536 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
537 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
538 self.node_types.get(&id.local_id).cloned()
541 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<&'tcx Substs<'tcx>> {
542 LocalTableInContextMut {
543 local_id_root: self.local_id_root,
544 data: &mut self.node_substs
548 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
549 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
550 self.node_substs.get(&id.local_id).cloned().unwrap_or(Substs::empty())
553 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
554 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
555 self.node_substs.get(&id.local_id).cloned()
558 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
559 // doesn't provide type parameter substitutions.
560 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
561 self.node_id_to_type(pat.hir_id)
564 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
565 self.node_id_to_type_opt(pat.hir_id)
568 // Returns the type of an expression as a monotype.
570 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
571 // some cases, we insert `Adjustment` annotations such as auto-deref or
572 // auto-ref. The type returned by this function does not consider such
573 // adjustments. See `expr_ty_adjusted()` instead.
575 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
576 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
577 // instead of "fn(ty) -> T with T = isize".
578 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
579 self.node_id_to_type(expr.hir_id)
582 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
583 self.node_id_to_type_opt(expr.hir_id)
586 pub fn adjustments(&self) -> LocalTableInContext<Vec<ty::adjustment::Adjustment<'tcx>>> {
587 LocalTableInContext {
588 local_id_root: self.local_id_root,
589 data: &self.adjustments
593 pub fn adjustments_mut(&mut self)
594 -> LocalTableInContextMut<Vec<ty::adjustment::Adjustment<'tcx>>> {
595 LocalTableInContextMut {
596 local_id_root: self.local_id_root,
597 data: &mut self.adjustments
601 pub fn expr_adjustments(&self, expr: &hir::Expr)
602 -> &[ty::adjustment::Adjustment<'tcx>] {
603 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
604 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
607 /// Returns the type of `expr`, considering any `Adjustment`
608 /// entry recorded for that expression.
609 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
610 self.expr_adjustments(expr)
612 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
615 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
616 self.expr_adjustments(expr)
618 .map(|adj| adj.target)
619 .or_else(|| self.expr_ty_opt(expr))
622 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
623 // Only paths and method calls/overloaded operators have
624 // entries in type_dependent_defs, ignore the former here.
625 if let hir::ExprPath(_) = expr.node {
629 match self.type_dependent_defs().get(expr.hir_id) {
630 Some(&Def::Method(_)) => true,
635 pub fn pat_binding_modes(&self) -> LocalTableInContext<BindingMode> {
636 LocalTableInContext {
637 local_id_root: self.local_id_root,
638 data: &self.pat_binding_modes
642 pub fn pat_binding_modes_mut(&mut self)
643 -> LocalTableInContextMut<BindingMode> {
644 LocalTableInContextMut {
645 local_id_root: self.local_id_root,
646 data: &mut self.pat_binding_modes
650 pub fn pat_adjustments(&self) -> LocalTableInContext<Vec<Ty<'tcx>>> {
651 LocalTableInContext {
652 local_id_root: self.local_id_root,
653 data: &self.pat_adjustments,
657 pub fn pat_adjustments_mut(&mut self)
658 -> LocalTableInContextMut<Vec<Ty<'tcx>>> {
659 LocalTableInContextMut {
660 local_id_root: self.local_id_root,
661 data: &mut self.pat_adjustments,
665 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
666 self.upvar_capture_map[&upvar_id]
669 pub fn closure_kind_origins(&self) -> LocalTableInContext<(Span, ast::Name)> {
670 LocalTableInContext {
671 local_id_root: self.local_id_root,
672 data: &self.closure_kind_origins
676 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<(Span, ast::Name)> {
677 LocalTableInContextMut {
678 local_id_root: self.local_id_root,
679 data: &mut self.closure_kind_origins
683 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<ty::FnSig<'tcx>> {
684 LocalTableInContext {
685 local_id_root: self.local_id_root,
686 data: &self.liberated_fn_sigs
690 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<ty::FnSig<'tcx>> {
691 LocalTableInContextMut {
692 local_id_root: self.local_id_root,
693 data: &mut self.liberated_fn_sigs
697 pub fn fru_field_types(&self) -> LocalTableInContext<Vec<Ty<'tcx>>> {
698 LocalTableInContext {
699 local_id_root: self.local_id_root,
700 data: &self.fru_field_types
704 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<Vec<Ty<'tcx>>> {
705 LocalTableInContextMut {
706 local_id_root: self.local_id_root,
707 data: &mut self.fru_field_types
711 pub fn cast_kinds(&self) -> LocalTableInContext<ty::cast::CastKind> {
712 LocalTableInContext {
713 local_id_root: self.local_id_root,
714 data: &self.cast_kinds
718 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<ty::cast::CastKind> {
719 LocalTableInContextMut {
720 local_id_root: self.local_id_root,
721 data: &mut self.cast_kinds
726 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
727 fn hash_stable<W: StableHasherResult>(&self,
728 hcx: &mut StableHashingContext<'a>,
729 hasher: &mut StableHasher<W>) {
730 let ty::TypeckTables {
732 ref type_dependent_defs,
734 ref user_provided_tys,
738 ref pat_binding_modes,
740 ref upvar_capture_map,
741 ref closure_kind_origins,
742 ref liberated_fn_sigs,
747 ref used_trait_imports,
752 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
753 type_dependent_defs.hash_stable(hcx, hasher);
754 field_indices.hash_stable(hcx, hasher);
755 user_provided_tys.hash_stable(hcx, hasher);
756 node_types.hash_stable(hcx, hasher);
757 node_substs.hash_stable(hcx, hasher);
758 adjustments.hash_stable(hcx, hasher);
759 pat_binding_modes.hash_stable(hcx, hasher);
760 pat_adjustments.hash_stable(hcx, hasher);
761 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
768 local_id_root.expect("trying to hash invalid TypeckTables");
770 let var_owner_def_id = DefId {
771 krate: local_id_root.krate,
774 let closure_def_id = DefId {
775 krate: local_id_root.krate,
776 index: closure_expr_id.to_def_id().index,
778 (hcx.def_path_hash(var_owner_def_id),
780 hcx.def_path_hash(closure_def_id))
783 closure_kind_origins.hash_stable(hcx, hasher);
784 liberated_fn_sigs.hash_stable(hcx, hasher);
785 fru_field_types.hash_stable(hcx, hasher);
786 cast_kinds.hash_stable(hcx, hasher);
787 used_trait_imports.hash_stable(hcx, hasher);
788 tainted_by_errors.hash_stable(hcx, hasher);
789 free_region_map.hash_stable(hcx, hasher);
794 impl<'tcx> CommonTypes<'tcx> {
795 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
796 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
797 let mk_region = |r| {
798 if let Some(r) = interners.region.borrow().get(&r) {
801 let r = interners.arena.alloc(r);
802 interners.region.borrow_mut().insert(Interned(r));
810 isize: mk(TyInt(ast::IntTy::Isize)),
811 i8: mk(TyInt(ast::IntTy::I8)),
812 i16: mk(TyInt(ast::IntTy::I16)),
813 i32: mk(TyInt(ast::IntTy::I32)),
814 i64: mk(TyInt(ast::IntTy::I64)),
815 i128: mk(TyInt(ast::IntTy::I128)),
816 usize: mk(TyUint(ast::UintTy::Usize)),
817 u8: mk(TyUint(ast::UintTy::U8)),
818 u16: mk(TyUint(ast::UintTy::U16)),
819 u32: mk(TyUint(ast::UintTy::U32)),
820 u64: mk(TyUint(ast::UintTy::U64)),
821 u128: mk(TyUint(ast::UintTy::U128)),
822 f32: mk(TyFloat(ast::FloatTy::F32)),
823 f64: mk(TyFloat(ast::FloatTy::F64)),
825 re_empty: mk_region(RegionKind::ReEmpty),
826 re_static: mk_region(RegionKind::ReStatic),
827 re_erased: mk_region(RegionKind::ReErased),
832 /// The central data structure of the compiler. It stores references
833 /// to the various **arenas** and also houses the results of the
834 /// various **compiler queries** that have been performed. See the
835 /// [rustc guide] for more details.
837 /// [rustc guide]: https://rust-lang-nursery.github.io/rustc-guide/ty.html
838 #[derive(Copy, Clone)]
839 pub struct TyCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
840 gcx: &'a GlobalCtxt<'gcx>,
841 interners: &'a CtxtInterners<'tcx>
844 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
845 type Target = &'a GlobalCtxt<'gcx>;
846 fn deref(&self) -> &Self::Target {
851 pub struct GlobalCtxt<'tcx> {
852 global_arenas: &'tcx GlobalArenas<'tcx>,
853 global_interners: CtxtInterners<'tcx>,
855 cstore: &'tcx dyn CrateStore,
857 pub sess: &'tcx Session,
859 pub dep_graph: DepGraph,
861 /// This provides access to the incr. comp. on-disk cache for query results.
862 /// Do not access this directly. It is only meant to be used by
863 /// `DepGraph::try_mark_green()` and the query infrastructure in `ty::maps`.
864 pub(crate) on_disk_query_result_cache: maps::OnDiskCache<'tcx>,
866 /// Common types, pre-interned for your convenience.
867 pub types: CommonTypes<'tcx>,
869 /// Map indicating what traits are in scope for places where this
870 /// is relevant; generated by resolve.
871 trait_map: FxHashMap<DefIndex,
872 Lrc<FxHashMap<ItemLocalId,
873 Lrc<StableVec<TraitCandidate>>>>>,
875 /// Export map produced by name resolution.
876 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
878 pub hir: hir_map::Map<'tcx>,
880 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
881 /// as well as all upstream crates. Only populated in incremental mode.
882 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
884 pub maps: maps::Maps<'tcx>,
886 // Records the free variables refrenced by every closure
887 // expression. Do not track deps for this, just recompute it from
888 // scratch every time.
889 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
891 maybe_unused_trait_imports: FxHashSet<DefId>,
893 maybe_unused_extern_crates: Vec<(DefId, Span)>,
895 // Internal cache for metadata decoding. No need to track deps on this.
896 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
898 /// Caches the results of trait selection. This cache is used
899 /// for things that do not have to do with the parameters in scope.
900 pub selection_cache: traits::SelectionCache<'tcx>,
902 /// Caches the results of trait evaluation. This cache is used
903 /// for things that do not have to do with the parameters in scope.
904 /// Merge this with `selection_cache`?
905 pub evaluation_cache: traits::EvaluationCache<'tcx>,
907 /// The definite name of the current crate after taking into account
908 /// attributes, commandline parameters, etc.
909 pub crate_name: Symbol,
911 /// Data layout specification for the current target.
912 pub data_layout: TargetDataLayout,
914 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
916 pub interpret_interner: InterpretInterner<'tcx>,
918 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
920 /// A general purpose channel to throw data out the back towards LLVM worker
923 /// This is intended to only get used during the trans phase of the compiler
924 /// when satisfying the query for a particular codegen unit. Internally in
925 /// the query it'll send data along this channel to get processed later.
926 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
928 output_filenames: Arc<OutputFilenames>,
931 /// Everything needed to efficiently work with interned allocations
932 #[derive(Debug, Default)]
933 pub struct InterpretInterner<'tcx> {
934 inner: Lock<InterpretInternerInner<'tcx>>,
937 #[derive(Debug, Default)]
938 struct InterpretInternerInner<'tcx> {
939 /// Stores the value of constants (and deduplicates the actual memory)
940 allocs: FxHashSet<&'tcx interpret::Allocation>,
942 /// Allows obtaining function instance handles via a unique identifier
943 functions: FxHashMap<interpret::AllocId, Instance<'tcx>>,
945 /// Inverse map of `interpret_functions`.
946 /// Used so we don't allocate a new pointer every time we need one
947 function_cache: FxHashMap<Instance<'tcx>, interpret::AllocId>,
949 /// Allows obtaining const allocs via a unique identifier
950 alloc_by_id: FxHashMap<interpret::AllocId, &'tcx interpret::Allocation>,
952 /// Allows obtaining static def ids via a unique id
953 statics: FxHashMap<interpret::AllocId, DefId>,
955 /// The AllocId to assign to the next new regular allocation.
956 /// Always incremented, never gets smaller.
957 next_id: interpret::AllocId,
959 /// Inverse map of `statics`
960 /// Used so we don't allocate a new pointer every time we need one
961 static_cache: FxHashMap<DefId, interpret::AllocId>,
963 /// A cache for basic byte allocations keyed by their contents. This is used to deduplicate
964 /// allocations for string and bytestring literals.
965 literal_alloc_cache: FxHashMap<Vec<u8>, interpret::AllocId>,
968 impl<'tcx> InterpretInterner<'tcx> {
969 pub fn create_fn_alloc(&self, instance: Instance<'tcx>) -> interpret::AllocId {
970 if let Some(&alloc_id) = self.inner.borrow().function_cache.get(&instance) {
973 let id = self.reserve();
974 debug!("creating fn ptr: {}", id);
975 let mut inner = self.inner.borrow_mut();
976 inner.functions.insert(id, instance);
977 inner.function_cache.insert(instance, id);
983 id: interpret::AllocId,
984 ) -> Option<Instance<'tcx>> {
985 self.inner.borrow().functions.get(&id).cloned()
990 id: interpret::AllocId,
991 ) -> Option<&'tcx interpret::Allocation> {
992 self.inner.borrow().alloc_by_id.get(&id).cloned()
998 ) -> interpret::AllocId {
999 if let Some(alloc_id) = self.inner.borrow().static_cache.get(&static_id).cloned() {
1002 let alloc_id = self.reserve();
1003 let mut inner = self.inner.borrow_mut();
1004 inner.static_cache.insert(static_id, alloc_id);
1005 inner.statics.insert(alloc_id, static_id);
1011 ptr: interpret::AllocId,
1012 ) -> Option<DefId> {
1013 self.inner.borrow().statics.get(&ptr).cloned()
1016 pub fn intern_at_reserved(
1018 id: interpret::AllocId,
1019 alloc: &'tcx interpret::Allocation,
1021 if let Some(old) = self.inner.borrow_mut().alloc_by_id.insert(id, alloc) {
1022 bug!("tried to intern allocation at {}, but was already existing as {:#?}", id, old);
1026 /// obtains a new allocation ID that can be referenced but does not
1027 /// yet have an allocation backing it.
1030 ) -> interpret::AllocId {
1031 let mut inner = self.inner.borrow_mut();
1032 let next = inner.next_id;
1033 inner.next_id.0 = inner.next_id.0
1035 .expect("You overflowed a u64 by incrementing by 1... \
1036 You've just earned yourself a free drink if we ever meet. \
1037 Seriously, how did you do that?!");
1042 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1043 /// Get the global TyCtxt.
1045 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
1048 interners: &self.gcx.global_interners,
1052 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
1053 self.global_arenas.generics.alloc(generics)
1056 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
1057 self.global_arenas.steal_mir.alloc(Steal::new(mir))
1060 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
1061 self.global_arenas.mir.alloc(mir)
1064 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1065 self.global_arenas.tables.alloc(tables)
1068 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1069 self.global_arenas.trait_def.alloc(def)
1072 pub fn alloc_adt_def(self,
1075 variants: Vec<ty::VariantDef>,
1077 -> &'gcx ty::AdtDef {
1078 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1079 self.global_arenas.adt_def.alloc(def)
1082 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1083 if bytes.is_empty() {
1086 self.global_interners.arena.alloc_slice(bytes)
1090 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1091 -> &'tcx [&'tcx ty::Const<'tcx>] {
1092 if values.is_empty() {
1095 self.interners.arena.alloc_slice(values)
1099 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1100 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1101 if values.is_empty() {
1104 self.interners.arena.alloc_slice(values)
1108 pub fn intern_const_alloc(
1110 alloc: interpret::Allocation,
1111 ) -> &'gcx interpret::Allocation {
1112 let allocs = &mut self.interpret_interner.inner.borrow_mut().allocs;
1113 if let Some(alloc) = allocs.get(&alloc) {
1117 let interned = self.global_arenas.const_allocs.alloc(alloc);
1118 if let Some(prev) = allocs.replace(interned) {
1119 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1124 /// Allocates a byte or string literal for `mir::interpret`
1125 pub fn allocate_cached(self, bytes: &[u8]) -> interpret::AllocId {
1126 // check whether we already allocated this literal or a constant with the same memory
1127 if let Some(&alloc_id) = self.interpret_interner.inner.borrow()
1128 .literal_alloc_cache.get(bytes) {
1131 // create an allocation that just contains these bytes
1132 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1133 let alloc = self.intern_const_alloc(alloc);
1135 // the next unique id
1136 let id = self.interpret_interner.reserve();
1137 // make the allocation identifiable
1138 self.interpret_interner.inner.borrow_mut().alloc_by_id.insert(id, alloc);
1139 // cache it for the future
1140 self.interpret_interner.inner.borrow_mut().literal_alloc_cache.insert(bytes.to_owned(), id);
1144 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1145 let mut stability_interner = self.stability_interner.borrow_mut();
1146 if let Some(st) = stability_interner.get(&stab) {
1150 let interned = self.global_interners.arena.alloc(stab);
1151 if let Some(prev) = stability_interner.replace(interned) {
1152 bug!("Tried to overwrite interned Stability: {:?}", prev)
1157 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1158 let mut layout_interner = self.layout_interner.borrow_mut();
1159 if let Some(layout) = layout_interner.get(&layout) {
1163 let interned = self.global_arenas.layout.alloc(layout);
1164 if let Some(prev) = layout_interner.replace(interned) {
1165 bug!("Tried to overwrite interned Layout: {:?}", prev)
1170 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1171 value.lift_to_tcx(self)
1174 /// Like lift, but only tries in the global tcx.
1175 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1176 value.lift_to_tcx(self.global_tcx())
1179 /// Returns true if self is the same as self.global_tcx().
1180 fn is_global(self) -> bool {
1181 let local = self.interners as *const _;
1182 let global = &self.global_interners as *const _;
1183 local as usize == global as usize
1186 /// Create a type context and call the closure with a `TyCtxt` reference
1187 /// to the context. The closure enforces that the type context and any interned
1188 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1189 /// reference to the context, to allow formatting values that need it.
1190 pub fn create_and_enter<F, R>(s: &'tcx Session,
1191 cstore: &'tcx dyn CrateStore,
1192 local_providers: ty::maps::Providers<'tcx>,
1193 extern_providers: ty::maps::Providers<'tcx>,
1194 arenas: &'tcx AllArenas<'tcx>,
1195 resolutions: ty::Resolutions,
1196 hir: hir_map::Map<'tcx>,
1197 on_disk_query_result_cache: maps::OnDiskCache<'tcx>,
1199 tx: mpsc::Sender<Box<dyn Any + Send>>,
1200 output_filenames: &OutputFilenames,
1202 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1204 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1207 let interners = CtxtInterners::new(&arenas.interner);
1208 let common_types = CommonTypes::new(&interners);
1209 let dep_graph = hir.dep_graph.clone();
1210 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1211 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1212 providers[LOCAL_CRATE] = local_providers;
1214 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1215 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1218 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1221 let def_path_tables = || {
1222 upstream_def_path_tables
1224 .map(|&(cnum, ref rc)| (cnum, &**rc))
1225 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1228 // Precompute the capacity of the hashmap so we don't have to
1229 // re-allocate when populating it.
1230 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1232 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1234 ::std::default::Default::default()
1237 for (cnum, def_path_table) in def_path_tables() {
1238 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1246 let mut trait_map = FxHashMap();
1247 for (k, v) in resolutions.trait_map {
1248 let hir_id = hir.node_to_hir_id(k);
1249 let map = trait_map.entry(hir_id.owner)
1250 .or_insert_with(|| Lrc::new(FxHashMap()));
1251 Lrc::get_mut(map).unwrap()
1252 .insert(hir_id.local_id,
1253 Lrc::new(StableVec::new(v)));
1256 let gcx = &GlobalCtxt {
1259 global_arenas: &arenas.global,
1260 global_interners: interners,
1261 dep_graph: dep_graph.clone(),
1262 on_disk_query_result_cache,
1263 types: common_types,
1265 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1268 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1269 (hir.local_def_id(k), Lrc::new(v))
1271 maybe_unused_trait_imports:
1272 resolutions.maybe_unused_trait_imports
1274 .map(|id| hir.local_def_id(id))
1276 maybe_unused_extern_crates:
1277 resolutions.maybe_unused_extern_crates
1279 .map(|(id, sp)| (hir.local_def_id(id), sp))
1282 def_path_hash_to_def_id,
1283 maps: maps::Maps::new(providers),
1284 rcache: Lock::new(FxHashMap()),
1285 selection_cache: traits::SelectionCache::new(),
1286 evaluation_cache: traits::EvaluationCache::new(),
1287 crate_name: Symbol::intern(crate_name),
1289 layout_interner: Lock::new(FxHashSet()),
1290 stability_interner: Lock::new(FxHashSet()),
1291 interpret_interner: Default::default(),
1292 tx_to_llvm_workers: Lock::new(tx),
1293 output_filenames: Arc::new(output_filenames.clone()),
1296 tls::enter_global(gcx, f)
1299 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1300 let cname = self.crate_name(LOCAL_CRATE).as_str();
1301 self.sess.consider_optimizing(&cname, msg)
1304 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1305 self.get_lang_items(LOCAL_CRATE)
1308 /// Due to missing llvm support for lowering 128 bit math to software emulation
1309 /// (on some targets), the lowering can be done in MIR.
1311 /// This function only exists until said support is implemented.
1312 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1313 let items = self.lang_items();
1314 let def_id = Some(def_id);
1315 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1316 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1317 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1318 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1319 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1320 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1321 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1322 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1323 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1324 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1325 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1326 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1327 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1328 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1329 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1330 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1331 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1332 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1333 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1334 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1335 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1336 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1337 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1338 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1342 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1343 self.stability_index(LOCAL_CRATE)
1346 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1347 self.all_crate_nums(LOCAL_CRATE)
1350 pub fn features(self) -> Lrc<feature_gate::Features> {
1351 self.features_query(LOCAL_CRATE)
1354 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1356 self.hir.def_key(id)
1358 self.cstore.def_key(id)
1362 /// Convert a `DefId` into its fully expanded `DefPath` (every
1363 /// `DefId` is really just an interned def-path).
1365 /// Note that if `id` is not local to this crate, the result will
1366 /// be a non-local `DefPath`.
1367 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1369 self.hir.def_path(id)
1371 self.cstore.def_path(id)
1376 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1377 if def_id.is_local() {
1378 self.hir.definitions().def_path_hash(def_id.index)
1380 self.cstore.def_path_hash(def_id)
1384 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1385 // We are explicitly not going through queries here in order to get
1386 // crate name and disambiguator since this code is called from debug!()
1387 // statements within the query system and we'd run into endless
1388 // recursion otherwise.
1389 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1390 (self.crate_name.clone(),
1391 self.sess.local_crate_disambiguator())
1393 (self.cstore.crate_name_untracked(def_id.krate),
1394 self.cstore.crate_disambiguator_untracked(def_id.krate))
1399 // Don't print the whole crate disambiguator. That's just
1400 // annoying in debug output.
1401 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1402 self.def_path(def_id).to_string_no_crate())
1405 pub fn metadata_encoding_version(self) -> Vec<u8> {
1406 self.cstore.metadata_encoding_version().to_vec()
1409 // Note that this is *untracked* and should only be used within the query
1410 // system if the result is otherwise tracked through queries
1411 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1412 self.cstore.crate_data_as_rc_any(cnum)
1415 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1416 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1418 StableHashingContext::new(self.sess,
1420 self.hir.definitions(),
1424 // This method makes sure that we have a DepNode and a Fingerprint for
1425 // every upstream crate. It needs to be called once right after the tcx is
1427 // With full-fledged red/green, the method will probably become unnecessary
1428 // as this will be done on-demand.
1429 pub fn allocate_metadata_dep_nodes(self) {
1430 // We cannot use the query versions of crates() and crate_hash(), since
1431 // those would need the DepNodes that we are allocating here.
1432 for cnum in self.cstore.crates_untracked() {
1433 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1434 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1435 self.dep_graph.with_task(dep_node,
1438 |_, x| x // No transformation needed
1443 // This method exercises the `in_scope_traits_map` query for all possible
1444 // values so that we have their fingerprints available in the DepGraph.
1445 // This is only required as long as we still use the old dependency tracking
1446 // which needs to have the fingerprints of all input nodes beforehand.
1447 pub fn precompute_in_scope_traits_hashes(self) {
1448 for &def_index in self.trait_map.keys() {
1449 self.in_scope_traits_map(def_index);
1453 pub fn serialize_query_result_cache<E>(self,
1455 -> Result<(), E::Error>
1456 where E: ty::codec::TyEncoder
1458 self.on_disk_query_result_cache.serialize(self.global_tcx(), encoder)
1461 /// If true, we should use the MIR-based borrowck (we may *also* use
1462 /// the AST-based borrowck).
1463 pub fn use_mir_borrowck(self) -> bool {
1464 self.borrowck_mode().use_mir()
1467 /// If true, pattern variables for use in guards on match arms
1468 /// will be bound as references to the data, and occurrences of
1469 /// those variables in the guard expression will implicitly
1470 /// dereference those bindings. (See rust-lang/rust#27282.)
1471 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1472 self.borrowck_mode().use_mir()
1475 /// If true, we should enable two-phase borrows checks. This is
1476 /// done with either `-Ztwo-phase-borrows` or with
1477 /// `#![feature(nll)]`.
1478 pub fn two_phase_borrows(self) -> bool {
1479 self.features().nll || self.sess.opts.debugging_opts.two_phase_borrows
1482 /// What mode(s) of borrowck should we run? AST? MIR? both?
1483 /// (Also considers the `#![feature(nll)]` setting.)
1484 pub fn borrowck_mode(&self) -> BorrowckMode {
1485 match self.sess.opts.borrowck_mode {
1486 mode @ BorrowckMode::Mir |
1487 mode @ BorrowckMode::Compare => mode,
1489 mode @ BorrowckMode::Ast => {
1490 if self.features().nll {
1500 /// Should we emit EndRegion MIR statements? These are consumed by
1501 /// MIR borrowck, but not when NLL is used. They are also consumed
1502 /// by the validation stuff.
1503 pub fn emit_end_regions(self) -> bool {
1504 self.sess.opts.debugging_opts.emit_end_regions ||
1505 self.sess.opts.debugging_opts.mir_emit_validate > 0 ||
1506 self.use_mir_borrowck()
1510 pub fn share_generics(self) -> bool {
1511 match self.sess.opts.debugging_opts.share_generics {
1512 Some(setting) => setting,
1514 self.sess.opts.incremental.is_some() ||
1515 match self.sess.opts.optimize {
1519 OptLevel::SizeMin => true,
1521 OptLevel::Aggressive => false,
1528 pub fn local_crate_exports_generics(self) -> bool {
1529 debug_assert!(self.share_generics());
1531 self.sess.crate_types.borrow().iter().any(|crate_type| {
1533 CrateTypeExecutable |
1534 CrateTypeStaticlib |
1535 CrateTypeProcMacro |
1536 CrateTypeCdylib => false,
1538 CrateTypeDylib => true,
1544 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1545 pub fn encode_metadata(self, link_meta: &LinkMeta)
1548 self.cstore.encode_metadata(self, link_meta)
1552 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1553 /// Call the closure with a local `TyCtxt` using the given arena.
1554 pub fn enter_local<F, R>(
1556 arena: &'tcx SyncDroplessArena,
1560 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1562 let interners = CtxtInterners::new(arena);
1565 interners: &interners,
1567 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1568 let new_icx = ty::tls::ImplicitCtxt {
1570 query: icx.query.clone(),
1571 layout_depth: icx.layout_depth,
1574 ty::tls::enter_context(&new_icx, |new_icx| {
1581 /// A trait implemented for all X<'a> types which can be safely and
1582 /// efficiently converted to X<'tcx> as long as they are part of the
1583 /// provided TyCtxt<'tcx>.
1584 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1585 /// by looking them up in their respective interners.
1587 /// However, this is still not the best implementation as it does
1588 /// need to compare the components, even for interned values.
1589 /// It would be more efficient if TypedArena provided a way to
1590 /// determine whether the address is in the allocated range.
1592 /// None is returned if the value or one of the components is not part
1593 /// of the provided context.
1594 /// For Ty, None can be returned if either the type interner doesn't
1595 /// contain the TypeVariants key or if the address of the interned
1596 /// pointer differs. The latter case is possible if a primitive type,
1597 /// e.g. `()` or `u8`, was interned in a different context.
1598 pub trait Lift<'tcx> {
1600 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1603 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1604 type Lifted = Ty<'tcx>;
1605 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1606 if tcx.interners.arena.in_arena(*self as *const _) {
1607 return Some(unsafe { mem::transmute(*self) });
1609 // Also try in the global tcx if we're not that.
1610 if !tcx.is_global() {
1611 self.lift_to_tcx(tcx.global_tcx())
1618 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1619 type Lifted = Region<'tcx>;
1620 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1621 if tcx.interners.arena.in_arena(*self as *const _) {
1622 return Some(unsafe { mem::transmute(*self) });
1624 // Also try in the global tcx if we're not that.
1625 if !tcx.is_global() {
1626 self.lift_to_tcx(tcx.global_tcx())
1633 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1634 type Lifted = &'tcx Const<'tcx>;
1635 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1636 if tcx.interners.arena.in_arena(*self as *const _) {
1637 return Some(unsafe { mem::transmute(*self) });
1639 // Also try in the global tcx if we're not that.
1640 if !tcx.is_global() {
1641 self.lift_to_tcx(tcx.global_tcx())
1648 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1649 type Lifted = &'tcx Substs<'tcx>;
1650 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1651 if self.len() == 0 {
1652 return Some(Slice::empty());
1654 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1655 return Some(unsafe { mem::transmute(*self) });
1657 // Also try in the global tcx if we're not that.
1658 if !tcx.is_global() {
1659 self.lift_to_tcx(tcx.global_tcx())
1666 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Ty<'a>> {
1667 type Lifted = &'tcx Slice<Ty<'tcx>>;
1668 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1669 -> Option<&'tcx Slice<Ty<'tcx>>> {
1670 if self.len() == 0 {
1671 return Some(Slice::empty());
1673 if tcx.interners.arena.in_arena(*self as *const _) {
1674 return Some(unsafe { mem::transmute(*self) });
1676 // Also try in the global tcx if we're not that.
1677 if !tcx.is_global() {
1678 self.lift_to_tcx(tcx.global_tcx())
1685 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<ExistentialPredicate<'a>> {
1686 type Lifted = &'tcx Slice<ExistentialPredicate<'tcx>>;
1687 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1688 -> Option<&'tcx Slice<ExistentialPredicate<'tcx>>> {
1689 if self.is_empty() {
1690 return Some(Slice::empty());
1692 if tcx.interners.arena.in_arena(*self as *const _) {
1693 return Some(unsafe { mem::transmute(*self) });
1695 // Also try in the global tcx if we're not that.
1696 if !tcx.is_global() {
1697 self.lift_to_tcx(tcx.global_tcx())
1704 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Predicate<'a>> {
1705 type Lifted = &'tcx Slice<Predicate<'tcx>>;
1706 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1707 -> Option<&'tcx Slice<Predicate<'tcx>>> {
1708 if self.is_empty() {
1709 return Some(Slice::empty());
1711 if tcx.interners.arena.in_arena(*self as *const _) {
1712 return Some(unsafe { mem::transmute(*self) });
1714 // Also try in the global tcx if we're not that.
1715 if !tcx.is_global() {
1716 self.lift_to_tcx(tcx.global_tcx())
1723 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<CanonicalVarInfo> {
1724 type Lifted = &'tcx Slice<CanonicalVarInfo>;
1725 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1726 if self.len() == 0 {
1727 return Some(Slice::empty());
1729 if tcx.interners.arena.in_arena(*self as *const _) {
1730 return Some(unsafe { mem::transmute(*self) });
1732 // Also try in the global tcx if we're not that.
1733 if !tcx.is_global() {
1734 self.lift_to_tcx(tcx.global_tcx())
1742 use super::{GlobalCtxt, TyCtxt};
1744 use std::cell::Cell;
1749 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1750 use rustc_data_structures::OnDrop;
1751 use rustc_data_structures::sync::Lrc;
1752 use dep_graph::OpenTask;
1754 /// This is the implicit state of rustc. It contains the current
1755 /// TyCtxt and query. It is updated when creating a local interner or
1756 /// executing a new query. Whenever there's a TyCtxt value available
1757 /// you should also have access to an ImplicitCtxt through the functions
1760 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1761 /// The current TyCtxt. Initially created by `enter_global` and updated
1762 /// by `enter_local` with a new local interner
1763 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1765 /// The current query job, if any. This is updated by start_job in
1766 /// ty::maps::plumbing when executing a query
1767 pub query: Option<Lrc<maps::QueryJob<'gcx>>>,
1769 /// Used to prevent layout from recursing too deeply.
1770 pub layout_depth: usize,
1772 /// The current dep graph task. This is used to add dependencies to queries
1773 /// when executing them
1774 pub task: &'a OpenTask,
1777 // A thread local value which stores a pointer to the current ImplicitCtxt
1778 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1780 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1781 let old = get_tlv();
1782 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1783 TLV.with(|tlv| tlv.set(value));
1787 fn get_tlv() -> usize {
1788 TLV.with(|tlv| tlv.get())
1791 /// This is a callback from libsyntax as it cannot access the implicit state
1792 /// in librustc otherwise
1793 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter) -> fmt::Result {
1795 write!(f, "{}", tcx.sess.codemap().span_to_string(span))
1799 /// This is a callback from libsyntax as it cannot access the implicit state
1800 /// in librustc otherwise. It is used to when diagnostic messages are
1801 /// emitted and stores them in the current query, if there is one.
1802 fn track_diagnostic(diagnostic: &Diagnostic) {
1803 with_context(|context| {
1804 if let Some(ref query) = context.query {
1805 query.diagnostics.lock().push(diagnostic.clone());
1810 /// Sets up the callbacks from libsyntax on the current thread
1811 pub fn with_thread_locals<F, R>(f: F) -> R
1812 where F: FnOnce() -> R
1814 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1815 let original_span_debug = span_dbg.get();
1816 span_dbg.set(span_debug);
1818 let _on_drop = OnDrop(move || {
1819 span_dbg.set(original_span_debug);
1822 TRACK_DIAGNOSTICS.with(|current| {
1823 let original = current.get();
1824 current.set(track_diagnostic);
1826 let _on_drop = OnDrop(move || {
1827 current.set(original);
1835 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1836 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1838 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1840 set_tlv(context as *const _ as usize, || {
1845 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1846 /// creating a initial TyCtxt and ImplicitCtxt.
1847 /// This happens once per rustc session and TyCtxts only exists
1848 /// inside the `f` function.
1849 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
1850 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
1852 with_thread_locals(|| {
1855 interners: &gcx.global_interners,
1857 let icx = ImplicitCtxt {
1861 task: &OpenTask::Ignore,
1863 enter_context(&icx, |_| {
1869 /// Allows access to the current ImplicitCtxt in a closure if one is available
1870 pub fn with_context_opt<F, R>(f: F) -> R
1871 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
1873 let context = get_tlv();
1877 unsafe { f(Some(&*(context as *const ImplicitCtxt))) }
1881 /// Allows access to the current ImplicitCtxt.
1882 /// Panics if there is no ImplicitCtxt available
1883 pub fn with_context<F, R>(f: F) -> R
1884 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1886 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
1889 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
1890 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
1891 /// with the same 'gcx lifetime as the TyCtxt passed in.
1892 /// This will panic if you pass it a TyCtxt which has a different global interner from
1893 /// the current ImplicitCtxt's tcx field.
1894 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
1895 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
1897 with_context(|context| {
1899 let gcx = tcx.gcx as *const _ as usize;
1900 assert!(context.tcx.gcx as *const _ as usize == gcx);
1901 let context: &ImplicitCtxt = mem::transmute(context);
1907 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
1908 /// interner and local interner as the tcx argument passed in. This means the closure
1909 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
1910 /// This will panic if you pass it a TyCtxt which has a different global interner or
1911 /// a different local interner from the current ImplicitCtxt's tcx field.
1912 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
1913 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
1915 with_context(|context| {
1917 let gcx = tcx.gcx as *const _ as usize;
1918 let interners = tcx.interners as *const _ as usize;
1919 assert!(context.tcx.gcx as *const _ as usize == gcx);
1920 assert!(context.tcx.interners as *const _ as usize == interners);
1921 let context: &ImplicitCtxt = mem::transmute(context);
1927 /// Allows access to the TyCtxt in the current ImplicitCtxt.
1928 /// Panics if there is no ImplicitCtxt available
1929 pub fn with<F, R>(f: F) -> R
1930 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1932 with_context(|context| f(context.tcx))
1935 /// Allows access to the TyCtxt in the current ImplicitCtxt.
1936 /// The closure is passed None if there is no ImplicitCtxt available
1937 pub fn with_opt<F, R>(f: F) -> R
1938 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
1940 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
1944 macro_rules! sty_debug_print {
1945 ($ctxt: expr, $($variant: ident),*) => {{
1946 // curious inner module to allow variant names to be used as
1948 #[allow(non_snake_case)]
1950 use ty::{self, TyCtxt};
1951 use ty::context::Interned;
1953 #[derive(Copy, Clone)]
1956 region_infer: usize,
1961 pub fn go(tcx: TyCtxt) {
1962 let mut total = DebugStat {
1964 region_infer: 0, ty_infer: 0, both_infer: 0,
1966 $(let mut $variant = total;)*
1969 for &Interned(t) in tcx.interners.type_.borrow().iter() {
1970 let variant = match t.sty {
1971 ty::TyBool | ty::TyChar | ty::TyInt(..) | ty::TyUint(..) |
1972 ty::TyFloat(..) | ty::TyStr | ty::TyNever => continue,
1973 ty::TyError => /* unimportant */ continue,
1974 $(ty::$variant(..) => &mut $variant,)*
1976 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
1977 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
1981 if region { total.region_infer += 1; variant.region_infer += 1 }
1982 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
1983 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
1985 println!("Ty interner total ty region both");
1986 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
1987 {ty:4.1}% {region:5.1}% {both:4.1}%",
1988 stringify!($variant),
1989 uses = $variant.total,
1990 usespc = $variant.total as f64 * 100.0 / total.total as f64,
1991 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
1992 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
1993 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
1995 println!(" total {uses:6} \
1996 {ty:4.1}% {region:5.1}% {both:4.1}%",
1998 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
1999 region = total.region_infer as f64 * 100.0 / total.total as f64,
2000 both = total.both_infer as f64 * 100.0 / total.total as f64)
2008 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2009 pub fn print_debug_stats(self) {
2012 TyAdt, TyArray, TySlice, TyRawPtr, TyRef, TyFnDef, TyFnPtr,
2013 TyGenerator, TyGeneratorWitness, TyDynamic, TyClosure, TyTuple,
2014 TyParam, TyInfer, TyProjection, TyAnon, TyForeign);
2016 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2017 println!("Region interner: #{}", self.interners.region.borrow().len());
2018 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2019 println!("Interpret interner: #{}", self.interpret_interner.inner.borrow().allocs.len());
2020 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2025 /// An entry in an interner.
2026 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2028 // NB: An Interned<Ty> compares and hashes as a sty.
2029 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2030 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2031 self.0.sty == other.0.sty
2035 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2037 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2038 fn hash<H: Hasher>(&self, s: &mut H) {
2043 impl<'tcx: 'lcx, 'lcx> Borrow<TypeVariants<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2044 fn borrow<'a>(&'a self) -> &'a TypeVariants<'lcx> {
2049 // NB: An Interned<Slice<T>> compares and hashes as its elements.
2050 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, Slice<T>> {
2051 fn eq(&self, other: &Interned<'tcx, Slice<T>>) -> bool {
2052 self.0[..] == other.0[..]
2056 impl<'tcx, T: Eq> Eq for Interned<'tcx, Slice<T>> {}
2058 impl<'tcx, T: Hash> Hash for Interned<'tcx, Slice<T>> {
2059 fn hash<H: Hasher>(&self, s: &mut H) {
2064 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, Slice<Ty<'tcx>>> {
2065 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2070 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, Slice<CanonicalVarInfo>> {
2071 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2076 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2077 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2082 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2083 fn borrow<'a>(&'a self) -> &'a RegionKind {
2088 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2089 for Interned<'tcx, Slice<ExistentialPredicate<'tcx>>> {
2090 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2095 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2096 for Interned<'tcx, Slice<Predicate<'tcx>>> {
2097 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2102 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2103 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2108 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2109 for Interned<'tcx, Slice<Clause<'tcx>>> {
2110 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2115 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2116 for Interned<'tcx, Slice<Goal<'tcx>>> {
2117 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2122 macro_rules! intern_method {
2123 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2124 $alloc_method:ident,
2127 $keep_in_local_tcx:expr) -> $ty:ty) => {
2128 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2129 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2130 let key = ($alloc_to_key)(&v);
2132 // HACK(eddyb) Depend on flags being accurate to
2133 // determine that all contents are in the global tcx.
2134 // See comments on Lift for why we can't use that.
2135 if ($keep_in_local_tcx)(&v) {
2136 let mut interner = self.interners.$name.borrow_mut();
2137 if let Some(&Interned(v)) = interner.get(key) {
2141 // Make sure we don't end up with inference
2142 // types/regions in the global tcx.
2143 if self.is_global() {
2144 bug!("Attempted to intern `{:?}` which contains \
2145 inference types/regions in the global type context",
2149 let i = ($alloc_to_ret)(self.interners.arena.$alloc_method(v));
2150 interner.insert(Interned(i));
2153 let mut interner = self.global_interners.$name.borrow_mut();
2154 if let Some(&Interned(v)) = interner.get(key) {
2158 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2162 let i = ($alloc_to_ret)(self.global_interners.arena.$alloc_method(v));
2163 interner.insert(Interned(i));
2171 macro_rules! direct_interners {
2172 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2173 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2174 fn eq(&self, other: &Self) -> bool {
2179 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2181 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2182 fn hash<H: Hasher>(&self, s: &mut H) {
2189 $name: $method($ty, alloc, |x| x, |x| x, $keep_in_local_tcx) -> $ty
2194 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2195 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2198 direct_interners!('tcx,
2199 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2200 const_: mk_const(|c: &Const| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>
2203 macro_rules! slice_interners {
2204 ($($field:ident: $method:ident($ty:ident)),+) => (
2205 $(intern_method!('tcx, $field: $method(&[$ty<'tcx>], alloc_slice, Deref::deref,
2206 |xs: &[$ty]| -> &Slice<$ty> {
2207 unsafe { mem::transmute(xs) }
2208 }, |xs: &[$ty]| xs.iter().any(keep_local)) -> Slice<$ty<'tcx>>);)+
2213 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2214 predicates: _intern_predicates(Predicate),
2215 type_list: _intern_type_list(Ty),
2216 substs: _intern_substs(Kind),
2217 clauses: _intern_clauses(Clause),
2218 goals: _intern_goals(Goal)
2221 // This isn't a perfect fit: CanonicalVarInfo slices are always
2222 // allocated in the global arena, so this `intern_method!` macro is
2223 // overly general. But we just return false for the code that checks
2224 // whether they belong in the thread-local arena, so no harm done, and
2225 // seems better than open-coding the rest.
2228 canonical_var_infos: _intern_canonical_var_infos(
2229 &[CanonicalVarInfo],
2232 |xs: &[CanonicalVarInfo]| -> &Slice<CanonicalVarInfo> { unsafe { mem::transmute(xs) } },
2233 |_xs: &[CanonicalVarInfo]| -> bool { false }
2234 ) -> Slice<CanonicalVarInfo>
2237 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2238 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2239 /// that is, a `fn` type that is equivalent in every way for being
2241 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2242 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2243 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2244 unsafety: hir::Unsafety::Unsafe,
2249 /// Given a closure signature `sig`, returns an equivalent `fn`
2250 /// type with the same signature. Detuples and so forth -- so
2251 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2252 /// a `fn(u32, i32)`.
2253 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2254 let converted_sig = sig.map_bound(|s| {
2255 let params_iter = match s.inputs()[0].sty {
2256 ty::TyTuple(params) => {
2257 params.into_iter().cloned()
2265 hir::Unsafety::Normal,
2270 self.mk_fn_ptr(converted_sig)
2273 pub fn mk_ty(&self, st: TypeVariants<'tcx>) -> Ty<'tcx> {
2274 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2277 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2279 ast::IntTy::Isize => self.types.isize,
2280 ast::IntTy::I8 => self.types.i8,
2281 ast::IntTy::I16 => self.types.i16,
2282 ast::IntTy::I32 => self.types.i32,
2283 ast::IntTy::I64 => self.types.i64,
2284 ast::IntTy::I128 => self.types.i128,
2288 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2290 ast::UintTy::Usize => self.types.usize,
2291 ast::UintTy::U8 => self.types.u8,
2292 ast::UintTy::U16 => self.types.u16,
2293 ast::UintTy::U32 => self.types.u32,
2294 ast::UintTy::U64 => self.types.u64,
2295 ast::UintTy::U128 => self.types.u128,
2299 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2301 ast::FloatTy::F32 => self.types.f32,
2302 ast::FloatTy::F64 => self.types.f64,
2306 pub fn mk_str(self) -> Ty<'tcx> {
2310 pub fn mk_static_str(self) -> Ty<'tcx> {
2311 self.mk_imm_ref(self.types.re_static, self.mk_str())
2314 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2315 // take a copy of substs so that we own the vectors inside
2316 self.mk_ty(TyAdt(def, substs))
2319 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2320 self.mk_ty(TyForeign(def_id))
2323 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2324 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2325 let adt_def = self.adt_def(def_id);
2326 let generics = self.generics_of(def_id);
2327 let mut substs = vec![Kind::from(ty)];
2328 // Add defaults for other generic params if there are some.
2329 for def in generics.types.iter().skip(1) {
2330 assert!(def.has_default);
2331 let ty = self.type_of(def.def_id).subst(self, &substs);
2332 substs.push(ty.into());
2334 let substs = self.mk_substs(substs.into_iter());
2335 self.mk_ty(TyAdt(adt_def, substs))
2338 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2339 self.mk_ty(TyRawPtr(tm))
2342 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2343 self.mk_ty(TyRef(r, tm.ty, tm.mutbl))
2346 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2347 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2350 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2351 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2354 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2355 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2358 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2359 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2362 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2363 self.mk_imm_ptr(self.mk_nil())
2366 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2367 self.mk_ty(TyArray(ty, ty::Const::from_usize(self, n)))
2370 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2371 self.mk_ty(TySlice(ty))
2374 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2375 self.mk_ty(TyTuple(self.intern_type_list(ts)))
2378 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2379 iter.intern_with(|ts| self.mk_ty(TyTuple(self.intern_type_list(ts))))
2382 pub fn mk_nil(self) -> Ty<'tcx> {
2383 self.intern_tup(&[])
2386 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2387 if self.features().never_type {
2390 self.intern_tup(&[])
2394 pub fn mk_bool(self) -> Ty<'tcx> {
2398 pub fn mk_fn_def(self, def_id: DefId,
2399 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2400 self.mk_ty(TyFnDef(def_id, substs))
2403 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2404 self.mk_ty(TyFnPtr(fty))
2409 obj: ty::Binder<&'tcx Slice<ExistentialPredicate<'tcx>>>,
2410 reg: ty::Region<'tcx>
2412 self.mk_ty(TyDynamic(obj, reg))
2415 pub fn mk_projection(self,
2417 substs: &'tcx Substs<'tcx>)
2419 self.mk_ty(TyProjection(ProjectionTy {
2425 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2427 self.mk_ty(TyClosure(closure_id, closure_substs))
2430 pub fn mk_generator(self,
2432 generator_substs: GeneratorSubsts<'tcx>,
2433 movability: hir::GeneratorMovability)
2435 self.mk_ty(TyGenerator(id, generator_substs, movability))
2438 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx Slice<Ty<'tcx>>>) -> Ty<'tcx> {
2439 self.mk_ty(TyGeneratorWitness(types))
2442 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2443 self.mk_infer(TyVar(v))
2446 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2447 self.mk_infer(IntVar(v))
2450 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2451 self.mk_infer(FloatVar(v))
2454 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2455 self.mk_ty(TyInfer(it))
2458 pub fn mk_param(self,
2460 name: InternedString) -> Ty<'tcx> {
2461 self.mk_ty(TyParam(ParamTy { idx: index, name: name }))
2464 pub fn mk_self_type(self) -> Ty<'tcx> {
2465 self.mk_param(0, keywords::SelfType.name().as_interned_str())
2468 pub fn mk_param_from_def(self, def: &ty::TypeParameterDef) -> Ty<'tcx> {
2469 self.mk_param(def.index, def.name)
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,
2577 -> &'tcx Substs<'tcx>
2579 self.mk_substs(iter::once(s).chain(t.into_iter().cloned()).map(Kind::from))
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.mk_goals(iter::once(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")