1 //! type context book-keeping
3 use dep_graph::DepGraph;
4 use dep_graph::{DepNode, DepConstructor};
5 use errors::DiagnosticBuilder;
7 use session::config::{BorrowckMode, OutputFilenames};
8 use session::config::CrateType;
10 use hir::{TraitCandidate, HirId, ItemKind, ItemLocalId, Node};
11 use hir::def::{Def, Export};
12 use hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
13 use hir::map as hir_map;
14 use hir::map::DefPathHash;
15 use lint::{self, Lint};
16 use ich::{StableHashingContext, NodeIdHashingMode};
17 use infer::canonical::{Canonical, CanonicalVarInfo, CanonicalVarInfos};
18 use infer::outlives::free_region_map::FreeRegionMap;
19 use middle::cstore::CrateStoreDyn;
20 use middle::cstore::EncodedMetadata;
21 use middle::lang_items;
22 use middle::resolve_lifetime::{self, ObjectLifetimeDefault};
23 use middle::stability;
24 use mir::{self, Mir, interpret, ProjectionKind};
25 use mir::interpret::Allocation;
26 use ty::subst::{Kind, Substs, Subst};
29 use traits::{Clause, Clauses, GoalKind, Goal, Goals};
30 use ty::{self, Ty, TypeAndMut};
31 use ty::{TyS, TyKind, List};
32 use ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorSubsts, Region, Const, LazyConst};
33 use ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
35 use ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid};
37 use ty::GenericParamDefKind;
38 use ty::layout::{LayoutDetails, TargetDataLayout, VariantIdx};
41 use ty::subst::{UserSubsts, UnpackedKind};
42 use ty::{BoundVar, BindingMode};
43 use ty::CanonicalPolyFnSig;
44 use util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap};
45 use util::nodemap::{FxHashMap, FxHashSet};
46 use rustc_data_structures::interner::HashInterner;
47 use smallvec::SmallVec;
48 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
49 StableHasher, StableHasherResult,
51 use arena::{TypedArena, SyncDroplessArena};
52 use rustc_data_structures::indexed_vec::{Idx, IndexVec};
53 use rustc_data_structures::sync::{self, Lrc, Lock, WorkerLocal};
55 use std::borrow::Borrow;
56 use std::cmp::Ordering;
57 use std::collections::hash_map::{self, Entry};
58 use std::hash::{Hash, Hasher};
61 use std::ops::{Deref, Bound};
65 use std::marker::PhantomData;
66 use rustc_target::spec::abi;
67 use syntax::ast::{self, NodeId};
69 use syntax::source_map::MultiSpan;
70 use syntax::edition::Edition;
71 use syntax::feature_gate;
72 use syntax::symbol::{Symbol, keywords, InternedString};
77 pub struct AllArenas<'tcx> {
78 pub global: WorkerLocal<GlobalArenas<'tcx>>,
79 pub interner: SyncDroplessArena,
80 global_ctxt: Option<GlobalCtxt<'tcx>>,
83 impl<'tcx> AllArenas<'tcx> {
84 pub fn new() -> Self {
86 global: WorkerLocal::new(|_| GlobalArenas::default()),
87 interner: SyncDroplessArena::default(),
95 pub struct GlobalArenas<'tcx> {
97 layout: TypedArena<LayoutDetails>,
100 generics: TypedArena<ty::Generics>,
101 trait_def: TypedArena<ty::TraitDef>,
102 adt_def: TypedArena<ty::AdtDef>,
103 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
104 mir: TypedArena<Mir<'tcx>>,
105 tables: TypedArena<ty::TypeckTables<'tcx>>,
107 const_allocs: TypedArena<interpret::Allocation>,
110 type InternedSet<'tcx, T> = Lock<FxHashMap<Interned<'tcx, T>, ()>>;
112 pub struct CtxtInterners<'tcx> {
113 /// The arena that types, regions, etc are allocated from
114 arena: &'tcx SyncDroplessArena,
116 /// Specifically use a speedy hash algorithm for these hash sets,
117 /// they're accessed quite often.
118 type_: InternedSet<'tcx, TyS<'tcx>>,
119 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
120 substs: InternedSet<'tcx, Substs<'tcx>>,
121 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
122 region: InternedSet<'tcx, RegionKind>,
123 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
124 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
125 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
126 goal: InternedSet<'tcx, GoalKind<'tcx>>,
127 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
128 projs: InternedSet<'tcx, List<ProjectionKind<'tcx>>>,
131 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
132 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
135 type_: Default::default(),
136 type_list: Default::default(),
137 substs: Default::default(),
138 region: Default::default(),
139 existential_predicates: Default::default(),
140 canonical_var_infos: Default::default(),
141 predicates: Default::default(),
142 clauses: Default::default(),
143 goal: Default::default(),
144 goal_list: Default::default(),
145 projs: Default::default(),
152 local: &CtxtInterners<'tcx>,
153 global: &CtxtInterners<'gcx>,
156 let flags = super::flags::FlagComputation::for_sty(&st);
158 // HACK(eddyb) Depend on flags being accurate to
159 // determine that all contents are in the global tcx.
160 // See comments on Lift for why we can't use that.
161 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
162 local.type_.borrow_mut().intern(st, |st| {
163 let ty_struct = TyS {
166 outer_exclusive_binder: flags.outer_exclusive_binder,
169 // Make sure we don't end up with inference
170 // types/regions in the global interner
171 if local as *const _ as usize == global as *const _ as usize {
172 bug!("Attempted to intern `{:?}` which contains \
173 inference types/regions in the global type context",
177 Interned(local.arena.alloc(ty_struct))
180 global.type_.borrow_mut().intern(st, |st| {
181 let ty_struct = TyS {
184 outer_exclusive_binder: flags.outer_exclusive_binder,
187 // This is safe because all the types the ty_struct can point to
188 // already is in the global arena
189 let ty_struct: TyS<'gcx> = unsafe {
190 mem::transmute(ty_struct)
193 Interned(global.arena.alloc(ty_struct))
199 pub struct CommonTypes<'tcx> {
220 pub re_empty: Region<'tcx>,
221 pub re_static: Region<'tcx>,
222 pub re_erased: Region<'tcx>,
225 pub struct LocalTableInContext<'a, V: 'a> {
226 local_id_root: Option<DefId>,
227 data: &'a ItemLocalMap<V>
230 /// Validate that the given HirId (respectively its `local_id` part) can be
231 /// safely used as a key in the tables of a TypeckTable. For that to be
232 /// the case, the HirId must have the same `owner` as all the other IDs in
233 /// this table (signified by `local_id_root`). Otherwise the HirId
234 /// would be in a different frame of reference and using its `local_id`
235 /// would result in lookup errors, or worse, in silently wrong data being
237 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
240 if cfg!(debug_assertions) {
241 if let Some(local_id_root) = local_id_root {
242 if hir_id.owner != local_id_root.index {
243 ty::tls::with(|tcx| {
244 let node_id = tcx.hir().hir_to_node_id(hir_id);
246 bug!("node {} with HirId::owner {:?} cannot be placed in \
247 TypeckTables with local_id_root {:?}",
248 tcx.hir().node_to_string(node_id),
249 DefId::local(hir_id.owner),
254 // We use "Null Object" TypeckTables in some of the analysis passes.
255 // These are just expected to be empty and their `local_id_root` is
256 // `None`. Therefore we cannot verify whether a given `HirId` would
257 // be a valid key for the given table. Instead we make sure that
258 // nobody tries to write to such a Null Object table.
260 bug!("access to invalid TypeckTables")
266 impl<'a, V> LocalTableInContext<'a, V> {
267 pub fn contains_key(&self, id: hir::HirId) -> bool {
268 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
269 self.data.contains_key(&id.local_id)
272 pub fn get(&self, id: hir::HirId) -> Option<&V> {
273 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
274 self.data.get(&id.local_id)
277 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
282 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
285 fn index(&self, key: hir::HirId) -> &V {
286 self.get(key).expect("LocalTableInContext: key not found")
290 pub struct LocalTableInContextMut<'a, V: 'a> {
291 local_id_root: Option<DefId>,
292 data: &'a mut ItemLocalMap<V>
295 impl<'a, V> LocalTableInContextMut<'a, V> {
296 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
297 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
298 self.data.get_mut(&id.local_id)
301 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
302 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
303 self.data.entry(id.local_id)
306 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
307 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
308 self.data.insert(id.local_id, val)
311 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
312 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
313 self.data.remove(&id.local_id)
317 #[derive(RustcEncodable, RustcDecodable, Debug)]
318 pub struct TypeckTables<'tcx> {
319 /// The HirId::owner all ItemLocalIds in this table are relative to.
320 pub local_id_root: Option<DefId>,
322 /// Resolved definitions for `<T>::X` associated paths and
323 /// method calls, including those of overloaded operators.
324 type_dependent_defs: ItemLocalMap<Def>,
326 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
327 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
328 /// about the field you also need definition of the variant to which the field
329 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
330 field_indices: ItemLocalMap<usize>,
332 /// Stores the types for various nodes in the AST. Note that this table
333 /// is not guaranteed to be populated until after typeck. See
334 /// typeck::check::fn_ctxt for details.
335 node_types: ItemLocalMap<Ty<'tcx>>,
337 /// Stores the type parameters which were substituted to obtain the type
338 /// of this node. This only applies to nodes that refer to entities
339 /// parameterized by type parameters, such as generic fns, types, or
341 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
343 /// This will either store the canonicalized types provided by the user
344 /// or the substitutions that the user explicitly gave (if any) attached
345 /// to `id`. These will not include any inferred values. The canonical form
346 /// is used to capture things like `_` or other unspecified values.
348 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
349 /// canonical substitutions would include only `for<X> { Vec<X> }`.
351 /// See also `AscribeUserType` statement in MIR.
352 user_provided_types: ItemLocalMap<CanonicalUserTypeAnnotation<'tcx>>,
354 /// Stores the canonicalized types provided by the user. See also
355 /// `AscribeUserType` statement in MIR.
356 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
358 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
360 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
361 pat_binding_modes: ItemLocalMap<BindingMode>,
363 /// Stores the types which were implicitly dereferenced in pattern binding modes
364 /// for later usage in HAIR lowering. For example,
367 /// match &&Some(5i32) {
372 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
375 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
376 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
379 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
381 /// Records the reasons that we picked the kind of each closure;
382 /// not all closures are present in the map.
383 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
385 /// For each fn, records the "liberated" types of its arguments
386 /// and return type. Liberated means that all bound regions
387 /// (including late-bound regions) are replaced with free
388 /// equivalents. This table is not used in codegen (since regions
389 /// are erased there) and hence is not serialized to metadata.
390 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
392 /// For each FRU expression, record the normalized types of the fields
393 /// of the struct - this is needed because it is non-trivial to
394 /// normalize while preserving regions. This table is used only in
395 /// MIR construction and hence is not serialized to metadata.
396 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
398 /// Maps a cast expression to its kind. This is keyed on the
399 /// *from* expression of the cast, not the cast itself.
400 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
402 /// Set of trait imports actually used in the method resolution.
403 /// This is used for warning unused imports. During type
404 /// checking, this `Lrc` should not be cloned: it must have a ref-count
405 /// of 1 so that we can insert things into the set mutably.
406 pub used_trait_imports: Lrc<DefIdSet>,
408 /// If any errors occurred while type-checking this body,
409 /// this field will be set to `true`.
410 pub tainted_by_errors: bool,
412 /// Stores the free-region relationships that were deduced from
413 /// its where clauses and parameter types. These are then
414 /// read-again by borrowck.
415 pub free_region_map: FreeRegionMap<'tcx>,
417 /// All the existential types that are restricted to concrete types
419 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
422 impl<'tcx> TypeckTables<'tcx> {
423 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
426 type_dependent_defs: Default::default(),
427 field_indices: Default::default(),
428 user_provided_types: Default::default(),
429 user_provided_sigs: Default::default(),
430 node_types: Default::default(),
431 node_substs: Default::default(),
432 adjustments: Default::default(),
433 pat_binding_modes: Default::default(),
434 pat_adjustments: Default::default(),
435 upvar_capture_map: Default::default(),
436 closure_kind_origins: Default::default(),
437 liberated_fn_sigs: Default::default(),
438 fru_field_types: Default::default(),
439 cast_kinds: Default::default(),
440 used_trait_imports: Lrc::new(Default::default()),
441 tainted_by_errors: false,
442 free_region_map: Default::default(),
443 concrete_existential_types: Default::default(),
447 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
448 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
450 hir::QPath::Resolved(_, ref path) => path.def,
451 hir::QPath::TypeRelative(..) => {
452 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
453 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
458 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
459 LocalTableInContext {
460 local_id_root: self.local_id_root,
461 data: &self.type_dependent_defs
465 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
466 LocalTableInContextMut {
467 local_id_root: self.local_id_root,
468 data: &mut self.type_dependent_defs
472 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
473 LocalTableInContext {
474 local_id_root: self.local_id_root,
475 data: &self.field_indices
479 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
480 LocalTableInContextMut {
481 local_id_root: self.local_id_root,
482 data: &mut self.field_indices
486 pub fn user_provided_types(
488 ) -> LocalTableInContext<'_, CanonicalUserTypeAnnotation<'tcx>> {
489 LocalTableInContext {
490 local_id_root: self.local_id_root,
491 data: &self.user_provided_types
495 pub fn user_provided_types_mut(
497 ) -> LocalTableInContextMut<'_, CanonicalUserTypeAnnotation<'tcx>> {
498 LocalTableInContextMut {
499 local_id_root: self.local_id_root,
500 data: &mut self.user_provided_types
504 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
505 LocalTableInContext {
506 local_id_root: self.local_id_root,
507 data: &self.node_types
511 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
512 LocalTableInContextMut {
513 local_id_root: self.local_id_root,
514 data: &mut self.node_types
518 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
519 self.node_id_to_type_opt(id).unwrap_or_else(||
520 bug!("node_id_to_type: no type for node `{}`",
522 let id = tcx.hir().hir_to_node_id(id);
523 tcx.hir().node_to_string(id)
528 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
529 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
530 self.node_types.get(&id.local_id).cloned()
533 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
534 LocalTableInContextMut {
535 local_id_root: self.local_id_root,
536 data: &mut self.node_substs
540 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
541 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
542 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
545 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
546 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
547 self.node_substs.get(&id.local_id).cloned()
550 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
551 // doesn't provide type parameter substitutions.
552 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
553 self.node_id_to_type(pat.hir_id)
556 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
557 self.node_id_to_type_opt(pat.hir_id)
560 // Returns the type of an expression as a monotype.
562 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
563 // some cases, we insert `Adjustment` annotations such as auto-deref or
564 // auto-ref. The type returned by this function does not consider such
565 // adjustments. See `expr_ty_adjusted()` instead.
567 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
568 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
569 // instead of "fn(ty) -> T with T = isize".
570 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
571 self.node_id_to_type(expr.hir_id)
574 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
575 self.node_id_to_type_opt(expr.hir_id)
578 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
579 LocalTableInContext {
580 local_id_root: self.local_id_root,
581 data: &self.adjustments
585 pub fn adjustments_mut(&mut self)
586 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
587 LocalTableInContextMut {
588 local_id_root: self.local_id_root,
589 data: &mut self.adjustments
593 pub fn expr_adjustments(&self, expr: &hir::Expr)
594 -> &[ty::adjustment::Adjustment<'tcx>] {
595 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
596 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
599 /// Returns the type of `expr`, considering any `Adjustment`
600 /// entry recorded for that expression.
601 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
602 self.expr_adjustments(expr)
604 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
607 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
608 self.expr_adjustments(expr)
610 .map(|adj| adj.target)
611 .or_else(|| self.expr_ty_opt(expr))
614 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
615 // Only paths and method calls/overloaded operators have
616 // entries in type_dependent_defs, ignore the former here.
617 if let hir::ExprKind::Path(_) = expr.node {
621 match self.type_dependent_defs().get(expr.hir_id) {
622 Some(&Def::Method(_)) => true,
627 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
628 LocalTableInContext {
629 local_id_root: self.local_id_root,
630 data: &self.pat_binding_modes
634 pub fn pat_binding_modes_mut(&mut self)
635 -> LocalTableInContextMut<'_, BindingMode> {
636 LocalTableInContextMut {
637 local_id_root: self.local_id_root,
638 data: &mut self.pat_binding_modes
642 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
643 LocalTableInContext {
644 local_id_root: self.local_id_root,
645 data: &self.pat_adjustments,
649 pub fn pat_adjustments_mut(&mut self)
650 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
651 LocalTableInContextMut {
652 local_id_root: self.local_id_root,
653 data: &mut self.pat_adjustments,
657 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
658 self.upvar_capture_map[&upvar_id]
661 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
662 LocalTableInContext {
663 local_id_root: self.local_id_root,
664 data: &self.closure_kind_origins
668 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
669 LocalTableInContextMut {
670 local_id_root: self.local_id_root,
671 data: &mut self.closure_kind_origins
675 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
676 LocalTableInContext {
677 local_id_root: self.local_id_root,
678 data: &self.liberated_fn_sigs
682 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
683 LocalTableInContextMut {
684 local_id_root: self.local_id_root,
685 data: &mut self.liberated_fn_sigs
689 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
690 LocalTableInContext {
691 local_id_root: self.local_id_root,
692 data: &self.fru_field_types
696 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
697 LocalTableInContextMut {
698 local_id_root: self.local_id_root,
699 data: &mut self.fru_field_types
703 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
704 LocalTableInContext {
705 local_id_root: self.local_id_root,
706 data: &self.cast_kinds
710 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
711 LocalTableInContextMut {
712 local_id_root: self.local_id_root,
713 data: &mut self.cast_kinds
718 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
719 fn hash_stable<W: StableHasherResult>(&self,
720 hcx: &mut StableHashingContext<'a>,
721 hasher: &mut StableHasher<W>) {
722 let ty::TypeckTables {
724 ref type_dependent_defs,
726 ref user_provided_types,
727 ref user_provided_sigs,
731 ref pat_binding_modes,
733 ref upvar_capture_map,
734 ref closure_kind_origins,
735 ref liberated_fn_sigs,
740 ref used_trait_imports,
743 ref concrete_existential_types,
746 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
747 type_dependent_defs.hash_stable(hcx, hasher);
748 field_indices.hash_stable(hcx, hasher);
749 user_provided_types.hash_stable(hcx, hasher);
750 user_provided_sigs.hash_stable(hcx, hasher);
751 node_types.hash_stable(hcx, hasher);
752 node_substs.hash_stable(hcx, hasher);
753 adjustments.hash_stable(hcx, hasher);
754 pat_binding_modes.hash_stable(hcx, hasher);
755 pat_adjustments.hash_stable(hcx, hasher);
756 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
763 local_id_root.expect("trying to hash invalid TypeckTables");
765 let var_owner_def_id = DefId {
766 krate: local_id_root.krate,
767 index: var_path.hir_id.owner,
769 let closure_def_id = DefId {
770 krate: local_id_root.krate,
771 index: closure_expr_id.to_def_id().index,
773 (hcx.def_path_hash(var_owner_def_id),
774 var_path.hir_id.local_id,
775 hcx.def_path_hash(closure_def_id))
778 closure_kind_origins.hash_stable(hcx, hasher);
779 liberated_fn_sigs.hash_stable(hcx, hasher);
780 fru_field_types.hash_stable(hcx, hasher);
781 cast_kinds.hash_stable(hcx, hasher);
782 used_trait_imports.hash_stable(hcx, hasher);
783 tainted_by_errors.hash_stable(hcx, hasher);
784 free_region_map.hash_stable(hcx, hasher);
785 concrete_existential_types.hash_stable(hcx, hasher);
791 pub struct UserTypeAnnotationIndex {
792 DEBUG_FORMAT = "UserTypeAnnotation({})",
793 const START_INDEX = 0,
797 /// Mapping of type annotation indices to canonical user type annotations.
798 pub type CanonicalUserTypeAnnotations<'tcx> =
799 IndexVec<UserTypeAnnotationIndex, (Span, CanonicalUserTypeAnnotation<'tcx>)>;
801 /// Canonicalized user type annotation.
802 pub type CanonicalUserTypeAnnotation<'gcx> = Canonical<'gcx, UserTypeAnnotation<'gcx>>;
804 impl CanonicalUserTypeAnnotation<'gcx> {
805 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
806 /// i.e. each thing is mapped to a canonical variable with the same index.
807 pub fn is_identity(&self) -> bool {
809 UserTypeAnnotation::Ty(_) => false,
810 UserTypeAnnotation::TypeOf(_, user_substs) => {
811 if user_substs.user_self_ty.is_some() {
815 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
816 match kind.unpack() {
817 UnpackedKind::Type(ty) => match ty.sty {
818 ty::Bound(debruijn, b) => {
819 // We only allow a `ty::INNERMOST` index in substitutions.
820 assert_eq!(debruijn, ty::INNERMOST);
826 UnpackedKind::Lifetime(r) => match r {
827 ty::ReLateBound(debruijn, br) => {
828 // We only allow a `ty::INNERMOST` index in substitutions.
829 assert_eq!(*debruijn, ty::INNERMOST);
830 cvar == br.assert_bound_var()
841 /// A user-given type annotation attached to a constant. These arise
842 /// from constants that are named via paths, like `Foo::<A>::new` and
844 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
845 pub enum UserTypeAnnotation<'tcx> {
848 /// The canonical type is the result of `type_of(def_id)` with the
849 /// given substitutions applied.
850 TypeOf(DefId, UserSubsts<'tcx>),
853 EnumTypeFoldableImpl! {
854 impl<'tcx> TypeFoldable<'tcx> for UserTypeAnnotation<'tcx> {
855 (UserTypeAnnotation::Ty)(ty),
856 (UserTypeAnnotation::TypeOf)(def, substs),
861 impl<'a, 'tcx> Lift<'tcx> for UserTypeAnnotation<'a> {
862 type Lifted = UserTypeAnnotation<'tcx>;
863 (UserTypeAnnotation::Ty)(ty),
864 (UserTypeAnnotation::TypeOf)(def, substs),
868 impl<'tcx> CommonTypes<'tcx> {
869 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
870 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
871 let mk_region = |r| {
872 interners.region.borrow_mut().intern(r, |r| {
873 Interned(interners.arena.alloc(r))
878 unit: mk(Tuple(List::empty())),
883 isize: mk(Int(ast::IntTy::Isize)),
884 i8: mk(Int(ast::IntTy::I8)),
885 i16: mk(Int(ast::IntTy::I16)),
886 i32: mk(Int(ast::IntTy::I32)),
887 i64: mk(Int(ast::IntTy::I64)),
888 i128: mk(Int(ast::IntTy::I128)),
889 usize: mk(Uint(ast::UintTy::Usize)),
890 u8: mk(Uint(ast::UintTy::U8)),
891 u16: mk(Uint(ast::UintTy::U16)),
892 u32: mk(Uint(ast::UintTy::U32)),
893 u64: mk(Uint(ast::UintTy::U64)),
894 u128: mk(Uint(ast::UintTy::U128)),
895 f32: mk(Float(ast::FloatTy::F32)),
896 f64: mk(Float(ast::FloatTy::F64)),
898 re_empty: mk_region(RegionKind::ReEmpty),
899 re_static: mk_region(RegionKind::ReStatic),
900 re_erased: mk_region(RegionKind::ReErased),
905 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
908 pub struct FreeRegionInfo {
909 // def id corresponding to FreeRegion
911 // the bound region corresponding to FreeRegion
912 pub boundregion: ty::BoundRegion,
913 // checks if bound region is in Impl Item
914 pub is_impl_item: bool,
917 /// The central data structure of the compiler. It stores references
918 /// to the various **arenas** and also houses the results of the
919 /// various **compiler queries** that have been performed. See the
920 /// [rustc guide] for more details.
922 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
923 #[derive(Copy, Clone)]
924 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
925 gcx: &'gcx GlobalCtxt<'gcx>,
926 interners: &'tcx CtxtInterners<'tcx>,
927 dummy: PhantomData<&'a ()>,
930 impl<'gcx> Deref for TyCtxt<'_, 'gcx, '_> {
931 type Target = &'gcx GlobalCtxt<'gcx>;
933 fn deref(&self) -> &Self::Target {
938 pub struct GlobalCtxt<'tcx> {
939 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
940 global_interners: CtxtInterners<'tcx>,
942 cstore: &'tcx CrateStoreDyn,
944 pub sess: &'tcx Session,
946 pub dep_graph: DepGraph,
948 /// Common types, pre-interned for your convenience.
949 pub types: CommonTypes<'tcx>,
951 /// Map indicating what traits are in scope for places where this
952 /// is relevant; generated by resolve.
953 trait_map: FxHashMap<DefIndex,
954 Lrc<FxHashMap<ItemLocalId,
955 Lrc<StableVec<TraitCandidate>>>>>,
957 /// Export map produced by name resolution.
958 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
960 hir_map: hir_map::Map<'tcx>,
962 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
963 /// as well as all upstream crates. Only populated in incremental mode.
964 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
966 pub queries: query::Queries<'tcx>,
968 // Records the free variables referenced by every closure
969 // expression. Do not track deps for this, just recompute it from
970 // scratch every time.
971 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
973 maybe_unused_trait_imports: FxHashSet<DefId>,
974 maybe_unused_extern_crates: Vec<(DefId, Span)>,
975 /// Extern prelude entries. The value is `true` if the entry was introduced
976 /// via `extern crate` item and not `--extern` option or compiler built-in.
977 pub extern_prelude: FxHashMap<ast::Name, bool>,
979 // Internal cache for metadata decoding. No need to track deps on this.
980 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
982 /// Caches the results of trait selection. This cache is used
983 /// for things that do not have to do with the parameters in scope.
984 pub selection_cache: traits::SelectionCache<'tcx>,
986 /// Caches the results of trait evaluation. This cache is used
987 /// for things that do not have to do with the parameters in scope.
988 /// Merge this with `selection_cache`?
989 pub evaluation_cache: traits::EvaluationCache<'tcx>,
991 /// The definite name of the current crate after taking into account
992 /// attributes, commandline parameters, etc.
993 pub crate_name: Symbol,
995 /// Data layout specification for the current target.
996 pub data_layout: TargetDataLayout,
998 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
1000 /// Stores the value of constants (and deduplicates the actual memory)
1001 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
1003 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1005 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
1007 /// A general purpose channel to throw data out the back towards LLVM worker
1010 /// This is intended to only get used during the codegen phase of the compiler
1011 /// when satisfying the query for a particular codegen unit. Internally in
1012 /// the query it'll send data along this channel to get processed later.
1013 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
1015 output_filenames: Arc<OutputFilenames>,
1018 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1019 /// Get the global TyCtxt.
1021 pub fn global_tcx(self) -> TyCtxt<'gcx, 'gcx, 'gcx> {
1024 interners: &self.gcx.global_interners,
1030 pub fn hir(self) -> &'a hir_map::Map<'gcx> {
1034 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
1035 self.global_arenas.generics.alloc(generics)
1038 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
1039 self.global_arenas.steal_mir.alloc(Steal::new(mir))
1042 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
1043 self.global_arenas.mir.alloc(mir)
1046 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1047 self.global_arenas.tables.alloc(tables)
1050 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1051 self.global_arenas.trait_def.alloc(def)
1054 pub fn alloc_adt_def(self,
1057 variants: IndexVec<VariantIdx, ty::VariantDef>,
1059 -> &'gcx ty::AdtDef {
1060 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1061 self.global_arenas.adt_def.alloc(def)
1064 pub fn intern_const_alloc(
1067 ) -> &'gcx Allocation {
1068 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1069 self.global_arenas.const_allocs.alloc(alloc)
1073 /// Allocates a byte or string literal for `mir::interpret`, read-only
1074 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1075 // create an allocation that just contains these bytes
1076 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes, ());
1077 let alloc = self.intern_const_alloc(alloc);
1078 self.alloc_map.lock().allocate(alloc)
1081 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1082 self.stability_interner.borrow_mut().intern(stab, |stab| {
1083 self.global_interners.arena.alloc(stab)
1087 pub fn intern_lazy_const(self, c: ty::LazyConst<'tcx>) -> &'tcx ty::LazyConst<'tcx> {
1088 self.global_interners.arena.alloc(c)
1091 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1092 self.layout_interner.borrow_mut().intern(layout, |layout| {
1093 self.global_arenas.layout.alloc(layout)
1097 /// Returns a range of the start/end indices specified with the
1098 /// `rustc_layout_scalar_valid_range` attribute.
1099 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1100 let attrs = self.get_attrs(def_id);
1102 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1104 None => return Bound::Unbounded,
1106 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1107 match meta.literal().expect("attribute takes lit").node {
1108 ast::LitKind::Int(a, _) => return Bound::Included(a),
1109 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1112 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1114 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1117 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1118 value.lift_to_tcx(self)
1121 /// Like lift, but only tries in the global tcx.
1122 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1123 value.lift_to_tcx(self.global_tcx())
1126 /// Returns true if self is the same as self.global_tcx().
1127 fn is_global(self) -> bool {
1128 let local = self.interners as *const _;
1129 let global = &self.global_interners as *const _;
1130 local as usize == global as usize
1133 /// Create a type context and call the closure with a `TyCtxt` reference
1134 /// to the context. The closure enforces that the type context and any interned
1135 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1136 /// reference to the context, to allow formatting values that need it.
1137 pub fn create_and_enter<F, R>(s: &'tcx Session,
1138 cstore: &'tcx CrateStoreDyn,
1139 local_providers: ty::query::Providers<'tcx>,
1140 extern_providers: ty::query::Providers<'tcx>,
1141 arenas: &'tcx mut AllArenas<'tcx>,
1142 resolutions: ty::Resolutions,
1143 hir: hir_map::Map<'tcx>,
1144 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1146 tx: mpsc::Sender<Box<dyn Any + Send>>,
1147 output_filenames: &OutputFilenames,
1149 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1151 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1154 let interners = CtxtInterners::new(&arenas.interner);
1155 let common_types = CommonTypes::new(&interners);
1156 let dep_graph = hir.dep_graph.clone();
1157 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1158 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1159 providers[LOCAL_CRATE] = local_providers;
1161 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1162 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1165 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1168 let def_path_tables = || {
1169 upstream_def_path_tables
1171 .map(|&(cnum, ref rc)| (cnum, &**rc))
1172 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1175 // Precompute the capacity of the hashmap so we don't have to
1176 // re-allocate when populating it.
1177 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1179 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1181 ::std::default::Default::default()
1184 for (cnum, def_path_table) in def_path_tables() {
1185 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1193 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1194 for (k, v) in resolutions.trait_map {
1195 let hir_id = hir.node_to_hir_id(k);
1196 let map = trait_map.entry(hir_id.owner).or_default();
1197 Lrc::get_mut(map).unwrap()
1198 .insert(hir_id.local_id,
1199 Lrc::new(StableVec::new(v)));
1202 arenas.global_ctxt = Some(GlobalCtxt {
1205 global_arenas: &arenas.global,
1206 global_interners: interners,
1208 types: common_types,
1210 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1213 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1214 (hir.local_def_id(k), Lrc::new(v))
1216 maybe_unused_trait_imports:
1217 resolutions.maybe_unused_trait_imports
1219 .map(|id| hir.local_def_id(id))
1221 maybe_unused_extern_crates:
1222 resolutions.maybe_unused_extern_crates
1224 .map(|(id, sp)| (hir.local_def_id(id), sp))
1226 extern_prelude: resolutions.extern_prelude,
1228 def_path_hash_to_def_id,
1229 queries: query::Queries::new(
1232 on_disk_query_result_cache,
1234 rcache: Default::default(),
1235 selection_cache: Default::default(),
1236 evaluation_cache: Default::default(),
1237 crate_name: Symbol::intern(crate_name),
1239 layout_interner: Default::default(),
1240 stability_interner: Default::default(),
1241 allocation_interner: Default::default(),
1242 alloc_map: Lock::new(interpret::AllocMap::new()),
1243 tx_to_llvm_workers: Lock::new(tx),
1244 output_filenames: Arc::new(output_filenames.clone()),
1247 let gcx = arenas.global_ctxt.as_ref().unwrap();
1249 sync::assert_send_val(&gcx);
1251 tls::enter_global(gcx, f)
1254 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1255 let cname = self.crate_name(LOCAL_CRATE).as_str();
1256 self.sess.consider_optimizing(&cname, msg)
1259 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1260 self.get_lib_features(LOCAL_CRATE)
1263 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1264 self.get_lang_items(LOCAL_CRATE)
1267 /// Due to missing llvm support for lowering 128 bit math to software emulation
1268 /// (on some targets), the lowering can be done in MIR.
1270 /// This function only exists until said support is implemented.
1271 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1272 let items = self.lang_items();
1273 let def_id = Some(def_id);
1274 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1275 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1276 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1277 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1278 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1279 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1280 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1281 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1282 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1283 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1284 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1285 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1286 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1287 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1288 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1289 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1290 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1291 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1292 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1293 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1294 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1295 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1296 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1297 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1301 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1302 self.stability_index(LOCAL_CRATE)
1305 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1306 self.all_crate_nums(LOCAL_CRATE)
1309 pub fn features(self) -> Lrc<feature_gate::Features> {
1310 self.features_query(LOCAL_CRATE)
1313 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1315 self.hir().def_key(id)
1317 self.cstore.def_key(id)
1321 /// Convert a `DefId` into its fully expanded `DefPath` (every
1322 /// `DefId` is really just an interned def-path).
1324 /// Note that if `id` is not local to this crate, the result will
1325 /// be a non-local `DefPath`.
1326 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1328 self.hir().def_path(id)
1330 self.cstore.def_path(id)
1335 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1336 if def_id.is_local() {
1337 self.hir().definitions().def_path_hash(def_id.index)
1339 self.cstore.def_path_hash(def_id)
1343 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1344 // We are explicitly not going through queries here in order to get
1345 // crate name and disambiguator since this code is called from debug!()
1346 // statements within the query system and we'd run into endless
1347 // recursion otherwise.
1348 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1349 (self.crate_name.clone(),
1350 self.sess.local_crate_disambiguator())
1352 (self.cstore.crate_name_untracked(def_id.krate),
1353 self.cstore.crate_disambiguator_untracked(def_id.krate))
1358 // Don't print the whole crate disambiguator. That's just
1359 // annoying in debug output.
1360 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1361 self.def_path(def_id).to_string_no_crate())
1364 pub fn metadata_encoding_version(self) -> Vec<u8> {
1365 self.cstore.metadata_encoding_version().to_vec()
1368 // Note that this is *untracked* and should only be used within the query
1369 // system if the result is otherwise tracked through queries
1370 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1371 self.cstore.crate_data_as_rc_any(cnum)
1375 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1376 let krate = self.gcx.hir_map.forest.untracked_krate();
1378 StableHashingContext::new(self.sess,
1380 self.hir().definitions(),
1384 // This method makes sure that we have a DepNode and a Fingerprint for
1385 // every upstream crate. It needs to be called once right after the tcx is
1387 // With full-fledged red/green, the method will probably become unnecessary
1388 // as this will be done on-demand.
1389 pub fn allocate_metadata_dep_nodes(self) {
1390 // We cannot use the query versions of crates() and crate_hash(), since
1391 // those would need the DepNodes that we are allocating here.
1392 for cnum in self.cstore.crates_untracked() {
1393 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1394 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1395 self.dep_graph.with_task(dep_node,
1398 |_, x| x // No transformation needed
1403 // This method exercises the `in_scope_traits_map` query for all possible
1404 // values so that we have their fingerprints available in the DepGraph.
1405 // This is only required as long as we still use the old dependency tracking
1406 // which needs to have the fingerprints of all input nodes beforehand.
1407 pub fn precompute_in_scope_traits_hashes(self) {
1408 for &def_index in self.trait_map.keys() {
1409 self.in_scope_traits_map(def_index);
1413 pub fn serialize_query_result_cache<E>(self,
1415 -> Result<(), E::Error>
1416 where E: ty::codec::TyEncoder
1418 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1421 /// This checks whether one is allowed to have pattern bindings
1422 /// that bind-by-move on a match arm that has a guard, e.g.:
1425 /// match foo { A(inner) if { /* something */ } => ..., ... }
1428 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1429 /// because that method has a narrower effect that can be toggled
1430 /// off via a separate `-Z` flag, at least for the short term.
1431 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1432 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1435 /// If true, we should use a naive AST walk to determine if match
1436 /// guard could perform bad mutations (or mutable-borrows).
1437 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1438 // If someone requests the feature, then be a little more
1439 // careful and ensure that MIR-borrowck is enabled (which can
1440 // happen via edition selection, via `feature(nll)`, or via an
1441 // appropriate `-Z` flag) before disabling the mutation check.
1442 if self.allow_bind_by_move_patterns_with_guards() {
1449 /// If true, we should use the AST-based borrowck (we may *also* use
1450 /// the MIR-based borrowck).
1451 pub fn use_ast_borrowck(self) -> bool {
1452 self.borrowck_mode().use_ast()
1455 /// If true, we should use the MIR-based borrowck (we may *also* use
1456 /// the AST-based borrowck).
1457 pub fn use_mir_borrowck(self) -> bool {
1458 self.borrowck_mode().use_mir()
1461 /// If true, we should use the MIR-based borrow check, but also
1462 /// fall back on the AST borrow check if the MIR-based one errors.
1463 pub fn migrate_borrowck(self) -> bool {
1464 self.borrowck_mode().migrate()
1467 /// If true, make MIR codegen for `match` emit a temp that holds a
1468 /// borrow of the input to the match expression.
1469 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1470 self.emit_read_for_match()
1473 /// If true, make MIR codegen for `match` emit FakeRead
1474 /// statements (which simulate the maximal effect of executing the
1475 /// patterns in a match arm).
1476 pub fn emit_read_for_match(&self) -> bool {
1477 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1480 /// If true, pattern variables for use in guards on match arms
1481 /// will be bound as references to the data, and occurrences of
1482 /// those variables in the guard expression will implicitly
1483 /// dereference those bindings. (See rust-lang/rust#27282.)
1484 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1485 self.borrowck_mode().use_mir()
1488 /// If true, we should enable two-phase borrows checks. This is
1489 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1490 /// or by opting into an edition after 2015.
1491 pub fn two_phase_borrows(self) -> bool {
1492 self.sess.rust_2018() || self.features().nll ||
1493 self.sess.opts.debugging_opts.two_phase_borrows
1496 /// What mode(s) of borrowck should we run? AST? MIR? both?
1497 /// (Also considers the `#![feature(nll)]` setting.)
1498 pub fn borrowck_mode(&self) -> BorrowckMode {
1499 // Here are the main constraints we need to deal with:
1501 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1502 // synonymous with no `-Z borrowck=...` flag at all.
1503 // (This is arguably a historical accident.)
1505 // 2. `BorrowckMode::Migrate` is the limited migration to
1506 // NLL that we are deploying with the 2018 edition.
1508 // 3. We want to allow developers on the Nightly channel
1509 // to opt back into the "hard error" mode for NLL,
1510 // (which they can do via specifying `#![feature(nll)]`
1511 // explicitly in their crate).
1513 // So, this precedence list is how pnkfelix chose to work with
1514 // the above constraints:
1516 // * `#![feature(nll)]` *always* means use NLL with hard
1517 // errors. (To simplify the code here, it now even overrides
1518 // a user's attempt to specify `-Z borrowck=compare`, which
1519 // we arguably do not need anymore and should remove.)
1521 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1522 // if `borrowck=ast` was specified), then use the default
1523 // as required by the edition.
1525 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1527 if self.features().nll { return BorrowckMode::Mir; }
1529 match self.sess.opts.borrowck_mode {
1530 mode @ BorrowckMode::Mir |
1531 mode @ BorrowckMode::Compare |
1532 mode @ BorrowckMode::Migrate => mode,
1534 BorrowckMode::Ast => match self.sess.edition() {
1535 Edition::Edition2015 => BorrowckMode::Ast,
1536 Edition::Edition2018 => BorrowckMode::Migrate,
1542 pub fn local_crate_exports_generics(self) -> bool {
1543 debug_assert!(self.sess.opts.share_generics());
1545 self.sess.crate_types.borrow().iter().any(|crate_type| {
1547 CrateType::Executable |
1548 CrateType::Staticlib |
1549 CrateType::ProcMacro |
1550 CrateType::Cdylib => false,
1552 CrateType::Dylib => true,
1557 // This method returns the DefId and the BoundRegion corresponding to the given region.
1558 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1559 let (suitable_region_binding_scope, bound_region) = match *region {
1560 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1561 ty::ReEarlyBound(ref ebr) => (
1562 self.parent_def_id(ebr.def_id).unwrap(),
1563 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1565 _ => return None, // not a free region
1568 let node_id = self.hir()
1569 .as_local_node_id(suitable_region_binding_scope)
1571 let is_impl_item = match self.hir().find(node_id) {
1572 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1573 Some(Node::ImplItem(..)) => {
1574 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1579 return Some(FreeRegionInfo {
1580 def_id: suitable_region_binding_scope,
1581 boundregion: bound_region,
1582 is_impl_item: is_impl_item,
1586 pub fn return_type_impl_trait(
1588 scope_def_id: DefId,
1589 ) -> Option<Ty<'tcx>> {
1590 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1591 let node_id = self.hir().as_local_node_id(scope_def_id).unwrap();
1592 match self.hir().get(node_id) {
1593 Node::Item(item) => {
1595 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1601 _ => { /* type_of_def_id() will work or panic */ }
1604 let ret_ty = self.type_of(scope_def_id);
1606 ty::FnDef(_, _) => {
1607 let sig = ret_ty.fn_sig(*self);
1608 let output = self.erase_late_bound_regions(&sig.output());
1609 if output.is_impl_trait() {
1619 // Here we check if the bound region is in Impl Item.
1620 pub fn is_bound_region_in_impl_item(
1622 suitable_region_binding_scope: DefId,
1624 let container_id = self.associated_item(suitable_region_binding_scope)
1627 if self.impl_trait_ref(container_id).is_some() {
1628 // For now, we do not try to target impls of traits. This is
1629 // because this message is going to suggest that the user
1630 // change the fn signature, but they may not be free to do so,
1631 // since the signature must match the trait.
1633 // FIXME(#42706) -- in some cases, we could do better here.
1640 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1641 pub fn encode_metadata(self)
1644 self.cstore.encode_metadata(self)
1648 impl<'gcx> GlobalCtxt<'gcx> {
1649 /// Call the closure with a local `TyCtxt` using the given arena.
1650 /// `interners` is a slot passed so we can create a CtxtInterners
1651 /// with the same lifetime as `arena`.
1652 pub fn enter_local<'tcx, F, R>(
1654 arena: &'tcx SyncDroplessArena,
1655 interners: &'tcx mut Option<CtxtInterners<'tcx>>,
1659 F: FnOnce(TyCtxt<'tcx, 'gcx, 'tcx>) -> R,
1662 *interners = Some(CtxtInterners::new(&arena));
1665 interners: interners.as_ref().unwrap(),
1668 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1669 let new_icx = ty::tls::ImplicitCtxt {
1671 query: icx.query.clone(),
1672 layout_depth: icx.layout_depth,
1675 ty::tls::enter_context(&new_icx, |_| {
1682 /// A trait implemented for all X<'a> types which can be safely and
1683 /// efficiently converted to X<'tcx> as long as they are part of the
1684 /// provided TyCtxt<'tcx>.
1685 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1686 /// by looking them up in their respective interners.
1688 /// However, this is still not the best implementation as it does
1689 /// need to compare the components, even for interned values.
1690 /// It would be more efficient if TypedArena provided a way to
1691 /// determine whether the address is in the allocated range.
1693 /// None is returned if the value or one of the components is not part
1694 /// of the provided context.
1695 /// For Ty, None can be returned if either the type interner doesn't
1696 /// contain the TyKind key or if the address of the interned
1697 /// pointer differs. The latter case is possible if a primitive type,
1698 /// e.g., `()` or `u8`, was interned in a different context.
1699 pub trait Lift<'tcx>: fmt::Debug {
1700 type Lifted: fmt::Debug + 'tcx;
1701 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1705 macro_rules! nop_lift {
1706 ($ty:ty => $lifted:ty) => {
1707 impl<'a, 'tcx> Lift<'tcx> for $ty {
1708 type Lifted = $lifted;
1709 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1710 if tcx.interners.arena.in_arena(*self as *const _) {
1711 return Some(unsafe { mem::transmute(*self) });
1713 // Also try in the global tcx if we're not that.
1714 if !tcx.is_global() {
1715 self.lift_to_tcx(tcx.global_tcx())
1724 macro_rules! nop_list_lift {
1725 ($ty:ty => $lifted:ty) => {
1726 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1727 type Lifted = &'tcx List<$lifted>;
1728 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1729 if self.is_empty() {
1730 return Some(List::empty());
1732 if tcx.interners.arena.in_arena(*self as *const _) {
1733 return Some(unsafe { mem::transmute(*self) });
1735 // Also try in the global tcx if we're not that.
1736 if !tcx.is_global() {
1737 self.lift_to_tcx(tcx.global_tcx())
1746 nop_lift!{Ty<'a> => Ty<'tcx>}
1747 nop_lift!{Region<'a> => Region<'tcx>}
1748 nop_lift!{Goal<'a> => Goal<'tcx>}
1749 nop_lift!{&'a LazyConst<'a> => &'tcx LazyConst<'tcx>}
1751 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1752 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1753 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1754 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1755 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1756 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1757 nop_list_lift!{ProjectionKind<'a> => ProjectionKind<'tcx>}
1759 // this is the impl for `&'a Substs<'a>`
1760 nop_list_lift!{Kind<'a> => Kind<'tcx>}
1762 impl<'a, 'tcx> Lift<'tcx> for &'a mir::interpret::Allocation {
1763 type Lifted = &'tcx mir::interpret::Allocation;
1764 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1765 assert!(tcx.global_arenas.const_allocs.in_arena(*self as *const _));
1766 Some(unsafe { mem::transmute(*self) })
1771 use super::{GlobalCtxt, TyCtxt};
1775 use std::marker::PhantomData;
1778 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1779 use rustc_data_structures::OnDrop;
1780 use rustc_data_structures::sync::{self, Lrc, Lock};
1781 use dep_graph::OpenTask;
1783 #[cfg(not(parallel_queries))]
1784 use std::cell::Cell;
1786 #[cfg(parallel_queries)]
1789 /// This is the implicit state of rustc. It contains the current
1790 /// TyCtxt and query. It is updated when creating a local interner or
1791 /// executing a new query. Whenever there's a TyCtxt value available
1792 /// you should also have access to an ImplicitCtxt through the functions
1795 pub struct ImplicitCtxt<'a, 'gcx: 'tcx, 'tcx> {
1796 /// The current TyCtxt. Initially created by `enter_global` and updated
1797 /// by `enter_local` with a new local interner
1798 pub tcx: TyCtxt<'tcx, 'gcx, 'tcx>,
1800 /// The current query job, if any. This is updated by start_job in
1801 /// ty::query::plumbing when executing a query
1802 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1804 /// Used to prevent layout from recursing too deeply.
1805 pub layout_depth: usize,
1807 /// The current dep graph task. This is used to add dependencies to queries
1808 /// when executing them
1809 pub task: &'a OpenTask,
1812 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1813 /// to `value` during the call to `f`. It is restored to its previous value after.
1814 /// This is used to set the pointer to the new ImplicitCtxt.
1815 #[cfg(parallel_queries)]
1817 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1818 rayon_core::tlv::with(value, f)
1821 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1822 /// This is used to get the pointer to the current ImplicitCtxt.
1823 #[cfg(parallel_queries)]
1825 fn get_tlv() -> usize {
1826 rayon_core::tlv::get()
1829 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1830 #[cfg(not(parallel_queries))]
1831 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1833 /// Sets TLV to `value` during the call to `f`.
1834 /// It is restored to its previous value after.
1835 /// This is used to set the pointer to the new ImplicitCtxt.
1836 #[cfg(not(parallel_queries))]
1838 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1839 let old = get_tlv();
1840 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1841 TLV.with(|tlv| tlv.set(value));
1845 /// This is used to get the pointer to the current ImplicitCtxt.
1846 #[cfg(not(parallel_queries))]
1847 fn get_tlv() -> usize {
1848 TLV.with(|tlv| tlv.get())
1851 /// This is a callback from libsyntax as it cannot access the implicit state
1852 /// in librustc otherwise
1853 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1855 if let Some(tcx) = tcx {
1856 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1858 syntax_pos::default_span_debug(span, f)
1863 /// This is a callback from libsyntax as it cannot access the implicit state
1864 /// in librustc otherwise. It is used to when diagnostic messages are
1865 /// emitted and stores them in the current query, if there is one.
1866 fn track_diagnostic(diagnostic: &Diagnostic) {
1867 with_context_opt(|icx| {
1868 if let Some(icx) = icx {
1869 if let Some(ref query) = icx.query {
1870 query.diagnostics.lock().push(diagnostic.clone());
1876 /// Sets up the callbacks from libsyntax on the current thread
1877 pub fn with_thread_locals<F, R>(f: F) -> R
1878 where F: FnOnce() -> R
1880 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1881 let original_span_debug = span_dbg.get();
1882 span_dbg.set(span_debug);
1884 let _on_drop = OnDrop(move || {
1885 span_dbg.set(original_span_debug);
1888 TRACK_DIAGNOSTICS.with(|current| {
1889 let original = current.get();
1890 current.set(track_diagnostic);
1892 let _on_drop = OnDrop(move || {
1893 current.set(original);
1901 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1903 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1905 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1907 set_tlv(context as *const _ as usize, || {
1912 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1913 /// creating a initial TyCtxt and ImplicitCtxt.
1914 /// This happens once per rustc session and TyCtxts only exists
1915 /// inside the `f` function.
1916 pub fn enter_global<'gcx, F, R>(gcx: &'gcx GlobalCtxt<'gcx>, f: F) -> R
1917 where F: FnOnce(TyCtxt<'gcx, 'gcx, 'gcx>) -> R
1919 with_thread_locals(|| {
1920 // Update GCX_PTR to indicate there's a GlobalCtxt available
1921 GCX_PTR.with(|lock| {
1922 *lock.lock() = gcx as *const _ as usize;
1924 // Set GCX_PTR back to 0 when we exit
1925 let _on_drop = OnDrop(move || {
1926 GCX_PTR.with(|lock| *lock.lock() = 0);
1931 interners: &gcx.global_interners,
1934 let icx = ImplicitCtxt {
1938 task: &OpenTask::Ignore,
1940 enter_context(&icx, |_| {
1946 /// Stores a pointer to the GlobalCtxt if one is available.
1947 /// This is used to access the GlobalCtxt in the deadlock handler
1949 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
1951 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
1952 /// This is used in the deadlock handler.
1953 pub unsafe fn with_global<F, R>(f: F) -> R
1954 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1956 let gcx = GCX_PTR.with(|lock| *lock.lock());
1958 let gcx = &*(gcx as *const GlobalCtxt<'_>);
1961 interners: &gcx.global_interners,
1964 let icx = ImplicitCtxt {
1968 task: &OpenTask::Ignore,
1970 enter_context(&icx, |_| f(tcx))
1973 /// Allows access to the current ImplicitCtxt in a closure if one is available
1975 pub fn with_context_opt<F, R>(f: F) -> R
1976 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
1978 let context = get_tlv();
1982 // We could get a ImplicitCtxt pointer from another thread.
1983 // Ensure that ImplicitCtxt is Sync
1984 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
1986 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
1990 /// Allows access to the current ImplicitCtxt.
1991 /// Panics if there is no ImplicitCtxt available
1993 pub fn with_context<F, R>(f: F) -> R
1994 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1996 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
1999 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2000 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2001 /// with the same 'gcx lifetime as the TyCtxt passed in.
2002 /// This will panic if you pass it a TyCtxt which has a different global interner from
2003 /// the current ImplicitCtxt's tcx field.
2005 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2006 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2008 with_context(|context| {
2010 let gcx = tcx.gcx as *const _ as usize;
2011 assert!(context.tcx.gcx as *const _ as usize == gcx);
2012 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2018 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2019 /// interner and local interner as the tcx argument passed in. This means the closure
2020 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2021 /// This will panic if you pass it a TyCtxt which has a different global interner or
2022 /// a different local interner from the current ImplicitCtxt's tcx field.
2024 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2025 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2027 with_context(|context| {
2029 let gcx = tcx.gcx as *const _ as usize;
2030 let interners = tcx.interners as *const _ as usize;
2031 assert!(context.tcx.gcx as *const _ as usize == gcx);
2032 assert!(context.tcx.interners as *const _ as usize == interners);
2033 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2039 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2040 /// Panics if there is no ImplicitCtxt available
2042 pub fn with<F, R>(f: F) -> R
2043 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2045 with_context(|context| f(context.tcx))
2048 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2049 /// The closure is passed None if there is no ImplicitCtxt available
2051 pub fn with_opt<F, R>(f: F) -> R
2052 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2054 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2058 macro_rules! sty_debug_print {
2059 ($ctxt: expr, $($variant: ident),*) => {{
2060 // curious inner module to allow variant names to be used as
2062 #[allow(non_snake_case)]
2064 use ty::{self, TyCtxt};
2065 use ty::context::Interned;
2067 #[derive(Copy, Clone)]
2070 region_infer: usize,
2075 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2076 let mut total = DebugStat {
2078 region_infer: 0, ty_infer: 0, both_infer: 0,
2080 $(let mut $variant = total;)*
2082 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2083 let variant = match t.sty {
2084 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2085 ty::Float(..) | ty::Str | ty::Never => continue,
2086 ty::Error => /* unimportant */ continue,
2087 $(ty::$variant(..) => &mut $variant,)*
2089 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2090 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2094 if region { total.region_infer += 1; variant.region_infer += 1 }
2095 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2096 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2098 println!("Ty interner total ty region both");
2099 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2100 {ty:4.1}% {region:5.1}% {both:4.1}%",
2101 stringify!($variant),
2102 uses = $variant.total,
2103 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2104 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2105 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2106 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2108 println!(" total {uses:6} \
2109 {ty:4.1}% {region:5.1}% {both:4.1}%",
2111 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2112 region = total.region_infer as f64 * 100.0 / total.total as f64,
2113 both = total.both_infer as f64 * 100.0 / total.total as f64)
2121 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2122 pub fn print_debug_stats(self) {
2125 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2126 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2127 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2129 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2130 println!("Region interner: #{}", self.interners.region.borrow().len());
2131 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2132 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2133 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2138 /// An entry in an interner.
2139 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2141 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2142 fn clone(&self) -> Self {
2146 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2148 // N.B., an `Interned<Ty>` compares and hashes as a sty.
2149 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2150 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2151 self.0.sty == other.0.sty
2155 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2157 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2158 fn hash<H: Hasher>(&self, s: &mut H) {
2163 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2164 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2169 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2170 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2171 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2172 self.0[..] == other.0[..]
2176 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2178 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2179 fn hash<H: Hasher>(&self, s: &mut H) {
2184 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2185 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2190 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2191 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2196 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2197 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2202 impl<'tcx: 'lcx, 'lcx> Borrow<[ProjectionKind<'lcx>]>
2203 for Interned<'tcx, List<ProjectionKind<'tcx>>> {
2204 fn borrow<'a>(&'a self) -> &'a [ProjectionKind<'lcx>] {
2209 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2210 fn borrow<'a>(&'a self) -> &'a RegionKind {
2215 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2216 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2221 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2222 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2223 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2228 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2229 for Interned<'tcx, List<Predicate<'tcx>>> {
2230 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2235 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2236 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2241 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2242 for Interned<'tcx, List<Clause<'tcx>>> {
2243 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2248 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2249 for Interned<'tcx, List<Goal<'tcx>>> {
2250 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2255 macro_rules! intern_method {
2256 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2259 $keep_in_local_tcx:expr) -> $ty:ty) => {
2260 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2261 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2262 let key = ($alloc_to_key)(&v);
2264 // HACK(eddyb) Depend on flags being accurate to
2265 // determine that all contents are in the global tcx.
2266 // See comments on Lift for why we can't use that.
2267 if ($keep_in_local_tcx)(&v) {
2268 self.interners.$name.borrow_mut().intern_ref(key, || {
2269 // Make sure we don't end up with inference
2270 // types/regions in the global tcx.
2271 if self.is_global() {
2272 bug!("Attempted to intern `{:?}` which contains \
2273 inference types/regions in the global type context",
2277 Interned($alloc_method(&self.interners.arena, v))
2280 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2281 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2285 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2287 let i = unsafe { mem::transmute(i) };
2296 macro_rules! direct_interners {
2297 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2298 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2299 fn eq(&self, other: &Self) -> bool {
2304 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2306 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2307 fn hash<H: Hasher>(&self, s: &mut H) {
2315 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2317 $keep_in_local_tcx) -> $ty);)+
2321 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2322 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2325 direct_interners!('tcx,
2326 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2327 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>
2330 macro_rules! slice_interners {
2331 ($($field:ident: $method:ident($ty:ident)),+) => (
2332 $(intern_method!( 'tcx, $field: $method(
2334 |a, v| List::from_arena(a, v),
2336 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2341 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2342 predicates: _intern_predicates(Predicate),
2343 type_list: _intern_type_list(Ty),
2344 substs: _intern_substs(Kind),
2345 clauses: _intern_clauses(Clause),
2346 goal_list: _intern_goals(Goal),
2347 projs: _intern_projs(ProjectionKind)
2350 // This isn't a perfect fit: CanonicalVarInfo slices are always
2351 // allocated in the global arena, so this `intern_method!` macro is
2352 // overly general. But we just return false for the code that checks
2353 // whether they belong in the thread-local arena, so no harm done, and
2354 // seems better than open-coding the rest.
2357 canonical_var_infos: _intern_canonical_var_infos(
2358 &[CanonicalVarInfo],
2359 |a, v| List::from_arena(a, v),
2361 |_xs: &[CanonicalVarInfo]| -> bool { false }
2362 ) -> List<CanonicalVarInfo>
2365 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2366 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2367 /// that is, a `fn` type that is equivalent in every way for being
2369 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2370 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2371 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2372 unsafety: hir::Unsafety::Unsafe,
2377 /// Given a closure signature `sig`, returns an equivalent `fn`
2378 /// type with the same signature. Detuples and so forth -- so
2379 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2380 /// a `fn(u32, i32)`.
2381 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2382 let converted_sig = sig.map_bound(|s| {
2383 let params_iter = match s.inputs()[0].sty {
2384 ty::Tuple(params) => {
2385 params.into_iter().cloned()
2393 hir::Unsafety::Normal,
2398 self.mk_fn_ptr(converted_sig)
2402 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2403 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2406 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2408 ast::IntTy::Isize => self.types.isize,
2409 ast::IntTy::I8 => self.types.i8,
2410 ast::IntTy::I16 => self.types.i16,
2411 ast::IntTy::I32 => self.types.i32,
2412 ast::IntTy::I64 => self.types.i64,
2413 ast::IntTy::I128 => self.types.i128,
2417 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2419 ast::UintTy::Usize => self.types.usize,
2420 ast::UintTy::U8 => self.types.u8,
2421 ast::UintTy::U16 => self.types.u16,
2422 ast::UintTy::U32 => self.types.u32,
2423 ast::UintTy::U64 => self.types.u64,
2424 ast::UintTy::U128 => self.types.u128,
2428 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2430 ast::FloatTy::F32 => self.types.f32,
2431 ast::FloatTy::F64 => self.types.f64,
2436 pub fn mk_str(self) -> Ty<'tcx> {
2441 pub fn mk_static_str(self) -> Ty<'tcx> {
2442 self.mk_imm_ref(self.types.re_static, self.mk_str())
2446 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2447 // take a copy of substs so that we own the vectors inside
2448 self.mk_ty(Adt(def, substs))
2452 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2453 self.mk_ty(Foreign(def_id))
2456 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2457 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2458 let adt_def = self.adt_def(def_id);
2459 let substs = Substs::for_item(self, def_id, |param, substs| {
2461 GenericParamDefKind::Lifetime => bug!(),
2462 GenericParamDefKind::Type { has_default, .. } => {
2463 if param.index == 0 {
2466 assert!(has_default);
2467 self.type_of(param.def_id).subst(self, substs).into()
2472 self.mk_ty(Adt(adt_def, substs))
2476 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2477 self.mk_ty(RawPtr(tm))
2481 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2482 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2486 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2487 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2491 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2492 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2496 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2497 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2501 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2502 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2506 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2507 self.mk_imm_ptr(self.mk_unit())
2511 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2512 self.mk_ty(Array(ty, self.intern_lazy_const(
2513 ty::LazyConst::Evaluated(ty::Const::from_usize(self.global_tcx(), n))
2518 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2519 self.mk_ty(Slice(ty))
2523 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2524 self.mk_ty(Tuple(self.intern_type_list(ts)))
2527 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2528 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2532 pub fn mk_unit(self) -> Ty<'tcx> {
2537 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2538 if self.features().never_type {
2541 self.intern_tup(&[])
2546 pub fn mk_bool(self) -> Ty<'tcx> {
2551 pub fn mk_fn_def(self, def_id: DefId,
2552 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2553 self.mk_ty(FnDef(def_id, substs))
2557 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2558 self.mk_ty(FnPtr(fty))
2564 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2565 reg: ty::Region<'tcx>
2567 self.mk_ty(Dynamic(obj, reg))
2571 pub fn mk_projection(self,
2573 substs: &'tcx Substs<'tcx>)
2575 self.mk_ty(Projection(ProjectionTy {
2582 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2584 self.mk_ty(Closure(closure_id, closure_substs))
2588 pub fn mk_generator(self,
2590 generator_substs: GeneratorSubsts<'tcx>,
2591 movability: hir::GeneratorMovability)
2593 self.mk_ty(Generator(id, generator_substs, movability))
2597 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2598 self.mk_ty(GeneratorWitness(types))
2602 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2603 self.mk_infer(TyVar(v))
2607 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2608 self.mk_infer(IntVar(v))
2612 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2613 self.mk_infer(FloatVar(v))
2617 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2618 self.mk_ty(Infer(it))
2622 pub fn mk_ty_param(self,
2624 name: InternedString) -> Ty<'tcx> {
2625 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2629 pub fn mk_self_type(self) -> Ty<'tcx> {
2630 self.mk_ty_param(0, keywords::SelfUpper.name().as_interned_str())
2633 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2635 GenericParamDefKind::Lifetime => {
2636 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2638 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2643 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2644 self.mk_ty(Opaque(def_id, substs))
2647 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2648 -> &'tcx List<ExistentialPredicate<'tcx>> {
2649 assert!(!eps.is_empty());
2650 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2651 self._intern_existential_predicates(eps)
2654 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2655 -> &'tcx List<Predicate<'tcx>> {
2656 // FIXME consider asking the input slice to be sorted to avoid
2657 // re-interning permutations, in which case that would be asserted
2659 if preds.len() == 0 {
2660 // The macro-generated method below asserts we don't intern an empty slice.
2663 self._intern_predicates(preds)
2667 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2671 self._intern_type_list(ts)
2675 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2679 self._intern_substs(ts)
2683 pub fn intern_projs(self, ps: &[ProjectionKind<'tcx>]) -> &'tcx List<ProjectionKind<'tcx>> {
2687 self._intern_projs(ps)
2691 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2695 self.global_tcx()._intern_canonical_var_infos(ts)
2699 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2703 self._intern_clauses(ts)
2707 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2711 self._intern_goals(ts)
2715 pub fn mk_fn_sig<I>(self,
2719 unsafety: hir::Unsafety,
2721 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2723 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2725 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2726 inputs_and_output: self.intern_type_list(xs),
2727 variadic, unsafety, abi
2731 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2732 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2734 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2737 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2738 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2740 iter.intern_with(|xs| self.intern_predicates(xs))
2743 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2744 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2745 iter.intern_with(|xs| self.intern_type_list(xs))
2748 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2749 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2750 iter.intern_with(|xs| self.intern_substs(xs))
2753 pub fn mk_substs_trait(self,
2755 rest: &[Kind<'tcx>])
2756 -> &'tcx Substs<'tcx>
2758 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2761 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2762 iter.intern_with(|xs| self.intern_clauses(xs))
2765 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2766 iter.intern_with(|xs| self.intern_goals(xs))
2769 pub fn lint_hir<S: Into<MultiSpan>>(self,
2770 lint: &'static Lint,
2774 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2777 pub fn lint_node<S: Into<MultiSpan>>(self,
2778 lint: &'static Lint,
2782 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2785 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2786 lint: &'static Lint,
2791 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2796 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2797 lint: &'static Lint,
2802 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2807 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2808 -> (lint::Level, lint::LintSource)
2810 // Right now we insert a `with_ignore` node in the dep graph here to
2811 // ignore the fact that `lint_levels` below depends on the entire crate.
2812 // For now this'll prevent false positives of recompiling too much when
2813 // anything changes.
2815 // Once red/green incremental compilation lands we should be able to
2816 // remove this because while the crate changes often the lint level map
2817 // will change rarely.
2818 self.dep_graph.with_ignore(|| {
2819 let sets = self.lint_levels(LOCAL_CRATE);
2821 let hir_id = self.hir().definitions().node_to_hir_id(id);
2822 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2825 let next = self.hir().get_parent_node(id);
2827 bug!("lint traversal reached the root of the crate");
2834 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2835 lint: &'static Lint,
2839 -> DiagnosticBuilder<'tcx>
2841 let node_id = self.hir().hir_to_node_id(hir_id);
2842 let (level, src) = self.lint_level_at_node(lint, node_id);
2843 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2846 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2847 lint: &'static Lint,
2851 -> DiagnosticBuilder<'tcx>
2853 let (level, src) = self.lint_level_at_node(lint, id);
2854 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2857 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2858 -> DiagnosticBuilder<'tcx>
2860 let (level, src) = self.lint_level_at_node(lint, id);
2861 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2864 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2865 self.in_scope_traits_map(id.owner)
2866 .and_then(|map| map.get(&id.local_id).cloned())
2869 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2870 self.named_region_map(id.owner)
2871 .and_then(|map| map.get(&id.local_id).cloned())
2874 pub fn is_late_bound(self, id: HirId) -> bool {
2875 self.is_late_bound_map(id.owner)
2876 .map(|set| set.contains(&id.local_id))
2880 pub fn object_lifetime_defaults(self, id: HirId)
2881 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2883 self.object_lifetime_defaults_map(id.owner)
2884 .and_then(|map| map.get(&id.local_id).cloned())
2888 pub trait InternAs<T: ?Sized, R> {
2890 fn intern_with<F>(self, f: F) -> Self::Output
2891 where F: FnOnce(&T) -> R;
2894 impl<I, T, R, E> InternAs<[T], R> for I
2895 where E: InternIteratorElement<T, R>,
2896 I: Iterator<Item=E> {
2897 type Output = E::Output;
2898 fn intern_with<F>(self, f: F) -> Self::Output
2899 where F: FnOnce(&[T]) -> R {
2900 E::intern_with(self, f)
2904 pub trait InternIteratorElement<T, R>: Sized {
2906 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2909 impl<T, R> InternIteratorElement<T, R> for T {
2911 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2912 f(&iter.collect::<SmallVec<[_; 8]>>())
2916 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2920 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2921 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2925 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2926 type Output = Result<R, E>;
2927 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2928 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
2932 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2933 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2934 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2935 providers.crate_name = |tcx, id| {
2936 assert_eq!(id, LOCAL_CRATE);
2939 providers.get_lib_features = |tcx, id| {
2940 assert_eq!(id, LOCAL_CRATE);
2941 Lrc::new(middle::lib_features::collect(tcx))
2943 providers.get_lang_items = |tcx, id| {
2944 assert_eq!(id, LOCAL_CRATE);
2945 Lrc::new(middle::lang_items::collect(tcx))
2947 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
2948 providers.maybe_unused_trait_import = |tcx, id| {
2949 tcx.maybe_unused_trait_imports.contains(&id)
2951 providers.maybe_unused_extern_crates = |tcx, cnum| {
2952 assert_eq!(cnum, LOCAL_CRATE);
2953 Lrc::new(tcx.maybe_unused_extern_crates.clone())
2956 providers.stability_index = |tcx, cnum| {
2957 assert_eq!(cnum, LOCAL_CRATE);
2958 Lrc::new(stability::Index::new(tcx))
2960 providers.lookup_stability = |tcx, id| {
2961 assert_eq!(id.krate, LOCAL_CRATE);
2962 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
2963 tcx.stability().local_stability(id)
2965 providers.lookup_deprecation_entry = |tcx, id| {
2966 assert_eq!(id.krate, LOCAL_CRATE);
2967 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
2968 tcx.stability().local_deprecation_entry(id)
2970 providers.extern_mod_stmt_cnum = |tcx, id| {
2971 let id = tcx.hir().as_local_node_id(id).unwrap();
2972 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
2974 providers.all_crate_nums = |tcx, cnum| {
2975 assert_eq!(cnum, LOCAL_CRATE);
2976 Lrc::new(tcx.cstore.crates_untracked())
2978 providers.postorder_cnums = |tcx, cnum| {
2979 assert_eq!(cnum, LOCAL_CRATE);
2980 Lrc::new(tcx.cstore.postorder_cnums_untracked())
2982 providers.output_filenames = |tcx, cnum| {
2983 assert_eq!(cnum, LOCAL_CRATE);
2984 tcx.output_filenames.clone()
2986 providers.features_query = |tcx, cnum| {
2987 assert_eq!(cnum, LOCAL_CRATE);
2988 Lrc::new(tcx.sess.features_untracked().clone())
2990 providers.is_panic_runtime = |tcx, cnum| {
2991 assert_eq!(cnum, LOCAL_CRATE);
2992 attr::contains_name(tcx.hir().krate_attrs(), "panic_runtime")
2994 providers.is_compiler_builtins = |tcx, cnum| {
2995 assert_eq!(cnum, LOCAL_CRATE);
2996 attr::contains_name(tcx.hir().krate_attrs(), "compiler_builtins")