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::{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::{CanonicalUserSubsts, 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};
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};
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::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 const_: InternedSet<'tcx, Const<'tcx>>,
126 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
127 goal: InternedSet<'tcx, GoalKind<'tcx>>,
128 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
129 projs: InternedSet<'tcx, List<ProjectionKind<'tcx>>>,
132 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
133 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
136 type_: Default::default(),
137 type_list: Default::default(),
138 substs: Default::default(),
139 region: Default::default(),
140 existential_predicates: Default::default(),
141 canonical_var_infos: Default::default(),
142 predicates: Default::default(),
143 const_: Default::default(),
144 clauses: Default::default(),
145 goal: Default::default(),
146 goal_list: Default::default(),
147 projs: Default::default(),
154 local: &CtxtInterners<'tcx>,
155 global: &CtxtInterners<'gcx>,
158 let flags = super::flags::FlagComputation::for_sty(&st);
160 // HACK(eddyb) Depend on flags being accurate to
161 // determine that all contents are in the global tcx.
162 // See comments on Lift for why we can't use that.
163 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
164 local.type_.borrow_mut().intern(st, |st| {
165 let ty_struct = TyS {
168 outer_exclusive_binder: flags.outer_exclusive_binder,
171 // Make sure we don't end up with inference
172 // types/regions in the global interner
173 if local as *const _ as usize == global as *const _ as usize {
174 bug!("Attempted to intern `{:?}` which contains \
175 inference types/regions in the global type context",
179 Interned(local.arena.alloc(ty_struct))
182 global.type_.borrow_mut().intern(st, |st| {
183 let ty_struct = TyS {
186 outer_exclusive_binder: flags.outer_exclusive_binder,
189 // This is safe because all the types the ty_struct can point to
190 // already is in the global arena
191 let ty_struct: TyS<'gcx> = unsafe {
192 mem::transmute(ty_struct)
195 Interned(global.arena.alloc(ty_struct))
201 pub struct CommonTypes<'tcx> {
222 pub re_empty: Region<'tcx>,
223 pub re_static: Region<'tcx>,
224 pub re_erased: Region<'tcx>,
227 pub struct LocalTableInContext<'a, V: 'a> {
228 local_id_root: Option<DefId>,
229 data: &'a ItemLocalMap<V>
232 /// Validate that the given HirId (respectively its `local_id` part) can be
233 /// safely used as a key in the tables of a TypeckTable. For that to be
234 /// the case, the HirId must have the same `owner` as all the other IDs in
235 /// this table (signified by `local_id_root`). Otherwise the HirId
236 /// would be in a different frame of reference and using its `local_id`
237 /// would result in lookup errors, or worse, in silently wrong data being
239 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
242 if cfg!(debug_assertions) {
243 if let Some(local_id_root) = local_id_root {
244 if hir_id.owner != local_id_root.index {
245 ty::tls::with(|tcx| {
246 let node_id = tcx.hir().hir_to_node_id(hir_id);
248 bug!("node {} with HirId::owner {:?} cannot be placed in \
249 TypeckTables with local_id_root {:?}",
250 tcx.hir().node_to_string(node_id),
251 DefId::local(hir_id.owner),
256 // We use "Null Object" TypeckTables in some of the analysis passes.
257 // These are just expected to be empty and their `local_id_root` is
258 // `None`. Therefore we cannot verify whether a given `HirId` would
259 // be a valid key for the given table. Instead we make sure that
260 // nobody tries to write to such a Null Object table.
262 bug!("access to invalid TypeckTables")
268 impl<'a, V> LocalTableInContext<'a, V> {
269 pub fn contains_key(&self, id: hir::HirId) -> bool {
270 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
271 self.data.contains_key(&id.local_id)
274 pub fn get(&self, id: hir::HirId) -> Option<&V> {
275 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
276 self.data.get(&id.local_id)
279 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
284 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
287 fn index(&self, key: hir::HirId) -> &V {
288 self.get(key).expect("LocalTableInContext: key not found")
292 pub struct LocalTableInContextMut<'a, V: 'a> {
293 local_id_root: Option<DefId>,
294 data: &'a mut ItemLocalMap<V>
297 impl<'a, V> LocalTableInContextMut<'a, V> {
298 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
299 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
300 self.data.get_mut(&id.local_id)
303 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
304 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
305 self.data.entry(id.local_id)
308 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
309 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
310 self.data.insert(id.local_id, val)
313 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
314 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
315 self.data.remove(&id.local_id)
319 #[derive(RustcEncodable, RustcDecodable, Debug)]
320 pub struct TypeckTables<'tcx> {
321 /// The HirId::owner all ItemLocalIds in this table are relative to.
322 pub local_id_root: Option<DefId>,
324 /// Resolved definitions for `<T>::X` associated paths and
325 /// method calls, including those of overloaded operators.
326 type_dependent_defs: ItemLocalMap<Def>,
328 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
329 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
330 /// about the field you also need definition of the variant to which the field
331 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
332 field_indices: ItemLocalMap<usize>,
334 /// Stores the types for various nodes in the AST. Note that this table
335 /// is not guaranteed to be populated until after typeck. See
336 /// typeck::check::fn_ctxt for details.
337 node_types: ItemLocalMap<Ty<'tcx>>,
339 /// Stores the type parameters which were substituted to obtain the type
340 /// of this node. This only applies to nodes that refer to entities
341 /// parameterized by type parameters, such as generic fns, types, or
343 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
345 /// Stores the canonicalized types provided by the user. See also
346 /// `AscribeUserType` statement in MIR.
347 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
349 /// Stores the canonicalized types provided by the user. See also
350 /// `AscribeUserType` statement in MIR.
351 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
353 /// Stores the substitutions that the user explicitly gave (if any)
354 /// attached to `id`. These will not include any inferred
355 /// values. The canonical form is used to capture things like `_`
356 /// or other unspecified values.
360 /// If the user wrote `foo.collect::<Vec<_>>()`, then the
361 /// canonical substitutions would include only `for<X> { Vec<X>
363 user_substs: ItemLocalMap<CanonicalUserSubsts<'tcx>>,
365 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
367 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
368 pat_binding_modes: ItemLocalMap<BindingMode>,
370 /// Stores the types which were implicitly dereferenced in pattern binding modes
371 /// for later usage in HAIR lowering. For example,
374 /// match &&Some(5i32) {
379 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
382 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
383 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
386 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
388 /// Records the reasons that we picked the kind of each closure;
389 /// not all closures are present in the map.
390 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
392 /// For each fn, records the "liberated" types of its arguments
393 /// and return type. Liberated means that all bound regions
394 /// (including late-bound regions) are replaced with free
395 /// equivalents. This table is not used in codegen (since regions
396 /// are erased there) and hence is not serialized to metadata.
397 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
399 /// For each FRU expression, record the normalized types of the fields
400 /// of the struct - this is needed because it is non-trivial to
401 /// normalize while preserving regions. This table is used only in
402 /// MIR construction and hence is not serialized to metadata.
403 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
405 /// Maps a cast expression to its kind. This is keyed on the
406 /// *from* expression of the cast, not the cast itself.
407 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
409 /// Set of trait imports actually used in the method resolution.
410 /// This is used for warning unused imports. During type
411 /// checking, this `Lrc` should not be cloned: it must have a ref-count
412 /// of 1 so that we can insert things into the set mutably.
413 pub used_trait_imports: Lrc<DefIdSet>,
415 /// If any errors occurred while type-checking this body,
416 /// this field will be set to `true`.
417 pub tainted_by_errors: bool,
419 /// Stores the free-region relationships that were deduced from
420 /// its where clauses and parameter types. These are then
421 /// read-again by borrowck.
422 pub free_region_map: FreeRegionMap<'tcx>,
424 /// All the existential types that are restricted to concrete types
426 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
429 impl<'tcx> TypeckTables<'tcx> {
430 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
433 type_dependent_defs: Default::default(),
434 field_indices: Default::default(),
435 user_provided_tys: Default::default(),
436 user_provided_sigs: Default::default(),
437 node_types: Default::default(),
438 node_substs: Default::default(),
439 user_substs: Default::default(),
440 adjustments: Default::default(),
441 pat_binding_modes: Default::default(),
442 pat_adjustments: Default::default(),
443 upvar_capture_map: Default::default(),
444 closure_kind_origins: Default::default(),
445 liberated_fn_sigs: Default::default(),
446 fru_field_types: Default::default(),
447 cast_kinds: Default::default(),
448 used_trait_imports: Lrc::new(Default::default()),
449 tainted_by_errors: false,
450 free_region_map: Default::default(),
451 concrete_existential_types: Default::default(),
455 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
456 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
458 hir::QPath::Resolved(_, ref path) => path.def,
459 hir::QPath::TypeRelative(..) => {
460 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
461 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
466 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
467 LocalTableInContext {
468 local_id_root: self.local_id_root,
469 data: &self.type_dependent_defs
473 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
474 LocalTableInContextMut {
475 local_id_root: self.local_id_root,
476 data: &mut self.type_dependent_defs
480 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
481 LocalTableInContext {
482 local_id_root: self.local_id_root,
483 data: &self.field_indices
487 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
488 LocalTableInContextMut {
489 local_id_root: self.local_id_root,
490 data: &mut self.field_indices
494 pub fn user_provided_tys(&self) -> LocalTableInContext<'_, CanonicalTy<'tcx>> {
495 LocalTableInContext {
496 local_id_root: self.local_id_root,
497 data: &self.user_provided_tys
501 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalTy<'tcx>> {
502 LocalTableInContextMut {
503 local_id_root: self.local_id_root,
504 data: &mut self.user_provided_tys
508 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
509 LocalTableInContext {
510 local_id_root: self.local_id_root,
511 data: &self.node_types
515 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
516 LocalTableInContextMut {
517 local_id_root: self.local_id_root,
518 data: &mut self.node_types
522 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
523 self.node_id_to_type_opt(id).unwrap_or_else(||
524 bug!("node_id_to_type: no type for node `{}`",
526 let id = tcx.hir().hir_to_node_id(id);
527 tcx.hir().node_to_string(id)
532 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
533 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
534 self.node_types.get(&id.local_id).cloned()
537 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
538 LocalTableInContextMut {
539 local_id_root: self.local_id_root,
540 data: &mut self.node_substs
544 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
545 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
546 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
549 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
550 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
551 self.node_substs.get(&id.local_id).cloned()
554 pub fn user_substs_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalUserSubsts<'tcx>> {
555 LocalTableInContextMut {
556 local_id_root: self.local_id_root,
557 data: &mut self.user_substs
561 pub fn user_substs(&self, id: hir::HirId) -> Option<CanonicalUserSubsts<'tcx>> {
562 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
563 self.user_substs.get(&id.local_id).cloned()
566 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
567 // doesn't provide type parameter substitutions.
568 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
569 self.node_id_to_type(pat.hir_id)
572 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
573 self.node_id_to_type_opt(pat.hir_id)
576 // Returns the type of an expression as a monotype.
578 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
579 // some cases, we insert `Adjustment` annotations such as auto-deref or
580 // auto-ref. The type returned by this function does not consider such
581 // adjustments. See `expr_ty_adjusted()` instead.
583 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
584 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
585 // instead of "fn(ty) -> T with T = isize".
586 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
587 self.node_id_to_type(expr.hir_id)
590 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
591 self.node_id_to_type_opt(expr.hir_id)
594 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
595 LocalTableInContext {
596 local_id_root: self.local_id_root,
597 data: &self.adjustments
601 pub fn adjustments_mut(&mut self)
602 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
603 LocalTableInContextMut {
604 local_id_root: self.local_id_root,
605 data: &mut self.adjustments
609 pub fn expr_adjustments(&self, expr: &hir::Expr)
610 -> &[ty::adjustment::Adjustment<'tcx>] {
611 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
612 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
615 /// Returns the type of `expr`, considering any `Adjustment`
616 /// entry recorded for that expression.
617 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
618 self.expr_adjustments(expr)
620 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
623 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
624 self.expr_adjustments(expr)
626 .map(|adj| adj.target)
627 .or_else(|| self.expr_ty_opt(expr))
630 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
631 // Only paths and method calls/overloaded operators have
632 // entries in type_dependent_defs, ignore the former here.
633 if let hir::ExprKind::Path(_) = expr.node {
637 match self.type_dependent_defs().get(expr.hir_id) {
638 Some(&Def::Method(_)) => true,
643 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
644 LocalTableInContext {
645 local_id_root: self.local_id_root,
646 data: &self.pat_binding_modes
650 pub fn pat_binding_modes_mut(&mut self)
651 -> LocalTableInContextMut<'_, BindingMode> {
652 LocalTableInContextMut {
653 local_id_root: self.local_id_root,
654 data: &mut self.pat_binding_modes
658 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
659 LocalTableInContext {
660 local_id_root: self.local_id_root,
661 data: &self.pat_adjustments,
665 pub fn pat_adjustments_mut(&mut self)
666 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
667 LocalTableInContextMut {
668 local_id_root: self.local_id_root,
669 data: &mut self.pat_adjustments,
673 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
674 self.upvar_capture_map[&upvar_id]
677 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
678 LocalTableInContext {
679 local_id_root: self.local_id_root,
680 data: &self.closure_kind_origins
684 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
685 LocalTableInContextMut {
686 local_id_root: self.local_id_root,
687 data: &mut self.closure_kind_origins
691 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
692 LocalTableInContext {
693 local_id_root: self.local_id_root,
694 data: &self.liberated_fn_sigs
698 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
699 LocalTableInContextMut {
700 local_id_root: self.local_id_root,
701 data: &mut self.liberated_fn_sigs
705 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
706 LocalTableInContext {
707 local_id_root: self.local_id_root,
708 data: &self.fru_field_types
712 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
713 LocalTableInContextMut {
714 local_id_root: self.local_id_root,
715 data: &mut self.fru_field_types
719 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
720 LocalTableInContext {
721 local_id_root: self.local_id_root,
722 data: &self.cast_kinds
726 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
727 LocalTableInContextMut {
728 local_id_root: self.local_id_root,
729 data: &mut self.cast_kinds
734 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
735 fn hash_stable<W: StableHasherResult>(&self,
736 hcx: &mut StableHashingContext<'a>,
737 hasher: &mut StableHasher<W>) {
738 let ty::TypeckTables {
740 ref type_dependent_defs,
742 ref user_provided_tys,
743 ref user_provided_sigs,
748 ref pat_binding_modes,
750 ref upvar_capture_map,
751 ref closure_kind_origins,
752 ref liberated_fn_sigs,
757 ref used_trait_imports,
760 ref concrete_existential_types,
763 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
764 type_dependent_defs.hash_stable(hcx, hasher);
765 field_indices.hash_stable(hcx, hasher);
766 user_provided_tys.hash_stable(hcx, hasher);
767 user_provided_sigs.hash_stable(hcx, hasher);
768 node_types.hash_stable(hcx, hasher);
769 node_substs.hash_stable(hcx, hasher);
770 user_substs.hash_stable(hcx, hasher);
771 adjustments.hash_stable(hcx, hasher);
772 pat_binding_modes.hash_stable(hcx, hasher);
773 pat_adjustments.hash_stable(hcx, hasher);
774 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
781 local_id_root.expect("trying to hash invalid TypeckTables");
783 let var_owner_def_id = DefId {
784 krate: local_id_root.krate,
785 index: var_path.hir_id.owner,
787 let closure_def_id = DefId {
788 krate: local_id_root.krate,
789 index: closure_expr_id.to_def_id().index,
791 (hcx.def_path_hash(var_owner_def_id),
792 var_path.hir_id.local_id,
793 hcx.def_path_hash(closure_def_id))
796 closure_kind_origins.hash_stable(hcx, hasher);
797 liberated_fn_sigs.hash_stable(hcx, hasher);
798 fru_field_types.hash_stable(hcx, hasher);
799 cast_kinds.hash_stable(hcx, hasher);
800 used_trait_imports.hash_stable(hcx, hasher);
801 tainted_by_errors.hash_stable(hcx, hasher);
802 free_region_map.hash_stable(hcx, hasher);
803 concrete_existential_types.hash_stable(hcx, hasher);
808 impl<'tcx> CommonTypes<'tcx> {
809 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
810 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
811 let mk_region = |r| {
812 interners.region.borrow_mut().intern(r, |r| {
813 Interned(interners.arena.alloc(r))
818 unit: mk(Tuple(List::empty())),
823 isize: mk(Int(ast::IntTy::Isize)),
824 i8: mk(Int(ast::IntTy::I8)),
825 i16: mk(Int(ast::IntTy::I16)),
826 i32: mk(Int(ast::IntTy::I32)),
827 i64: mk(Int(ast::IntTy::I64)),
828 i128: mk(Int(ast::IntTy::I128)),
829 usize: mk(Uint(ast::UintTy::Usize)),
830 u8: mk(Uint(ast::UintTy::U8)),
831 u16: mk(Uint(ast::UintTy::U16)),
832 u32: mk(Uint(ast::UintTy::U32)),
833 u64: mk(Uint(ast::UintTy::U64)),
834 u128: mk(Uint(ast::UintTy::U128)),
835 f32: mk(Float(ast::FloatTy::F32)),
836 f64: mk(Float(ast::FloatTy::F64)),
838 re_empty: mk_region(RegionKind::ReEmpty),
839 re_static: mk_region(RegionKind::ReStatic),
840 re_erased: mk_region(RegionKind::ReErased),
845 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
848 pub struct FreeRegionInfo {
849 // def id corresponding to FreeRegion
851 // the bound region corresponding to FreeRegion
852 pub boundregion: ty::BoundRegion,
853 // checks if bound region is in Impl Item
854 pub is_impl_item: bool,
857 /// The central data structure of the compiler. It stores references
858 /// to the various **arenas** and also houses the results of the
859 /// various **compiler queries** that have been performed. See the
860 /// [rustc guide] for more details.
862 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
863 #[derive(Copy, Clone)]
864 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
865 gcx: &'gcx GlobalCtxt<'gcx>,
866 interners: &'tcx CtxtInterners<'tcx>,
867 dummy: PhantomData<&'a ()>,
870 impl<'gcx> Deref for TyCtxt<'_, 'gcx, '_> {
871 type Target = &'gcx GlobalCtxt<'gcx>;
873 fn deref(&self) -> &Self::Target {
878 pub struct GlobalCtxt<'tcx> {
879 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
880 global_interners: CtxtInterners<'tcx>,
882 cstore: &'tcx CrateStoreDyn,
884 pub sess: &'tcx Session,
886 pub dep_graph: DepGraph,
888 /// Common types, pre-interned for your convenience.
889 pub types: CommonTypes<'tcx>,
891 /// Map indicating what traits are in scope for places where this
892 /// is relevant; generated by resolve.
893 trait_map: FxHashMap<DefIndex,
894 Lrc<FxHashMap<ItemLocalId,
895 Lrc<StableVec<TraitCandidate>>>>>,
897 /// Export map produced by name resolution.
898 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
900 hir_map: hir_map::Map<'tcx>,
902 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
903 /// as well as all upstream crates. Only populated in incremental mode.
904 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
906 pub(crate) queries: query::Queries<'tcx>,
908 // Records the free variables referenced by every closure
909 // expression. Do not track deps for this, just recompute it from
910 // scratch every time.
911 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
913 maybe_unused_trait_imports: FxHashSet<DefId>,
914 maybe_unused_extern_crates: Vec<(DefId, Span)>,
915 /// Extern prelude entries. The value is `true` if the entry was introduced
916 /// via `extern crate` item and not `--extern` option or compiler built-in.
917 pub extern_prelude: FxHashMap<ast::Name, bool>,
919 // Internal cache for metadata decoding. No need to track deps on this.
920 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
922 /// Caches the results of trait selection. This cache is used
923 /// for things that do not have to do with the parameters in scope.
924 pub selection_cache: traits::SelectionCache<'tcx>,
926 /// Caches the results of trait evaluation. This cache is used
927 /// for things that do not have to do with the parameters in scope.
928 /// Merge this with `selection_cache`?
929 pub evaluation_cache: traits::EvaluationCache<'tcx>,
931 /// The definite name of the current crate after taking into account
932 /// attributes, commandline parameters, etc.
933 pub crate_name: Symbol,
935 /// Data layout specification for the current target.
936 pub data_layout: TargetDataLayout,
938 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
940 /// Stores the value of constants (and deduplicates the actual memory)
941 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
943 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
945 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
947 /// A general purpose channel to throw data out the back towards LLVM worker
950 /// This is intended to only get used during the codegen phase of the compiler
951 /// when satisfying the query for a particular codegen unit. Internally in
952 /// the query it'll send data along this channel to get processed later.
953 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
955 output_filenames: Arc<OutputFilenames>,
958 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
959 /// Get the global TyCtxt.
961 pub fn global_tcx(self) -> TyCtxt<'gcx, 'gcx, 'gcx> {
964 interners: &self.gcx.global_interners,
970 pub fn hir(self) -> &'a hir_map::Map<'gcx> {
974 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
975 self.global_arenas.generics.alloc(generics)
978 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
979 self.global_arenas.steal_mir.alloc(Steal::new(mir))
982 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
983 self.global_arenas.mir.alloc(mir)
986 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
987 self.global_arenas.tables.alloc(tables)
990 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
991 self.global_arenas.trait_def.alloc(def)
994 pub fn alloc_adt_def(self,
997 variants: IndexVec<VariantIdx, ty::VariantDef>,
999 -> &'gcx ty::AdtDef {
1000 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1001 self.global_arenas.adt_def.alloc(def)
1004 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1005 if bytes.is_empty() {
1008 self.global_interners.arena.alloc_slice(bytes)
1012 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1013 -> &'tcx [&'tcx ty::Const<'tcx>] {
1014 if values.is_empty() {
1017 self.interners.arena.alloc_slice(values)
1021 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1022 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1023 if values.is_empty() {
1026 self.interners.arena.alloc_slice(values)
1030 pub fn intern_const_alloc(
1033 ) -> &'gcx Allocation {
1034 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1035 self.global_arenas.const_allocs.alloc(alloc)
1039 /// Allocates a byte or string literal for `mir::interpret`, read-only
1040 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1041 // create an allocation that just contains these bytes
1042 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes, ());
1043 let alloc = self.intern_const_alloc(alloc);
1044 self.alloc_map.lock().allocate(alloc)
1047 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1048 self.stability_interner.borrow_mut().intern(stab, |stab| {
1049 self.global_interners.arena.alloc(stab)
1053 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1054 self.layout_interner.borrow_mut().intern(layout, |layout| {
1055 self.global_arenas.layout.alloc(layout)
1059 /// Returns a range of the start/end indices specified with the
1060 /// `rustc_layout_scalar_valid_range` attribute.
1061 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1062 let attrs = self.get_attrs(def_id);
1064 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1066 None => return Bound::Unbounded,
1068 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1069 match meta.literal().expect("attribute takes lit").node {
1070 ast::LitKind::Int(a, _) => return Bound::Included(a),
1071 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1074 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1076 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1079 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1080 value.lift_to_tcx(self)
1083 /// Like lift, but only tries in the global tcx.
1084 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1085 value.lift_to_tcx(self.global_tcx())
1088 /// Returns true if self is the same as self.global_tcx().
1089 fn is_global(self) -> bool {
1090 let local = self.interners as *const _;
1091 let global = &self.global_interners as *const _;
1092 local as usize == global as usize
1095 /// Create a type context and call the closure with a `TyCtxt` reference
1096 /// to the context. The closure enforces that the type context and any interned
1097 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1098 /// reference to the context, to allow formatting values that need it.
1099 pub fn create_and_enter<F, R>(s: &'tcx Session,
1100 cstore: &'tcx CrateStoreDyn,
1101 local_providers: ty::query::Providers<'tcx>,
1102 extern_providers: ty::query::Providers<'tcx>,
1103 arenas: &'tcx mut AllArenas<'tcx>,
1104 resolutions: ty::Resolutions,
1105 hir: hir_map::Map<'tcx>,
1106 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1108 tx: mpsc::Sender<Box<dyn Any + Send>>,
1109 output_filenames: &OutputFilenames,
1111 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1113 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1116 let interners = CtxtInterners::new(&arenas.interner);
1117 let common_types = CommonTypes::new(&interners);
1118 let dep_graph = hir.dep_graph.clone();
1119 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1120 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1121 providers[LOCAL_CRATE] = local_providers;
1123 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1124 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1127 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1130 let def_path_tables = || {
1131 upstream_def_path_tables
1133 .map(|&(cnum, ref rc)| (cnum, &**rc))
1134 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1137 // Precompute the capacity of the hashmap so we don't have to
1138 // re-allocate when populating it.
1139 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1141 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1143 ::std::default::Default::default()
1146 for (cnum, def_path_table) in def_path_tables() {
1147 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1155 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1156 for (k, v) in resolutions.trait_map {
1157 let hir_id = hir.node_to_hir_id(k);
1158 let map = trait_map.entry(hir_id.owner).or_default();
1159 Lrc::get_mut(map).unwrap()
1160 .insert(hir_id.local_id,
1161 Lrc::new(StableVec::new(v)));
1164 arenas.global_ctxt = Some(GlobalCtxt {
1167 global_arenas: &arenas.global,
1168 global_interners: interners,
1170 types: common_types,
1172 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1175 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1176 (hir.local_def_id(k), Lrc::new(v))
1178 maybe_unused_trait_imports:
1179 resolutions.maybe_unused_trait_imports
1181 .map(|id| hir.local_def_id(id))
1183 maybe_unused_extern_crates:
1184 resolutions.maybe_unused_extern_crates
1186 .map(|(id, sp)| (hir.local_def_id(id), sp))
1188 extern_prelude: resolutions.extern_prelude,
1190 def_path_hash_to_def_id,
1191 queries: query::Queries::new(
1194 on_disk_query_result_cache,
1196 rcache: Default::default(),
1197 selection_cache: Default::default(),
1198 evaluation_cache: Default::default(),
1199 crate_name: Symbol::intern(crate_name),
1201 layout_interner: Default::default(),
1202 stability_interner: Default::default(),
1203 allocation_interner: Default::default(),
1204 alloc_map: Lock::new(interpret::AllocMap::new()),
1205 tx_to_llvm_workers: Lock::new(tx),
1206 output_filenames: Arc::new(output_filenames.clone()),
1209 let gcx = arenas.global_ctxt.as_ref().unwrap();
1211 sync::assert_send_val(&gcx);
1213 tls::enter_global(gcx, f)
1216 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1217 let cname = self.crate_name(LOCAL_CRATE).as_str();
1218 self.sess.consider_optimizing(&cname, msg)
1221 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1222 self.get_lib_features(LOCAL_CRATE)
1225 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1226 self.get_lang_items(LOCAL_CRATE)
1229 /// Due to missing llvm support for lowering 128 bit math to software emulation
1230 /// (on some targets), the lowering can be done in MIR.
1232 /// This function only exists until said support is implemented.
1233 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1234 let items = self.lang_items();
1235 let def_id = Some(def_id);
1236 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1237 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1238 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1239 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1240 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1241 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1242 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1243 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1244 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1245 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1246 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1247 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1248 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1249 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1250 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1251 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1252 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1253 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1254 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1255 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1256 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1257 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1258 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1259 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1263 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1264 self.stability_index(LOCAL_CRATE)
1267 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1268 self.all_crate_nums(LOCAL_CRATE)
1271 pub fn features(self) -> Lrc<feature_gate::Features> {
1272 self.features_query(LOCAL_CRATE)
1275 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1277 self.hir().def_key(id)
1279 self.cstore.def_key(id)
1283 /// Convert a `DefId` into its fully expanded `DefPath` (every
1284 /// `DefId` is really just an interned def-path).
1286 /// Note that if `id` is not local to this crate, the result will
1287 /// be a non-local `DefPath`.
1288 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1290 self.hir().def_path(id)
1292 self.cstore.def_path(id)
1297 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1298 if def_id.is_local() {
1299 self.hir().definitions().def_path_hash(def_id.index)
1301 self.cstore.def_path_hash(def_id)
1305 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1306 // We are explicitly not going through queries here in order to get
1307 // crate name and disambiguator since this code is called from debug!()
1308 // statements within the query system and we'd run into endless
1309 // recursion otherwise.
1310 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1311 (self.crate_name.clone(),
1312 self.sess.local_crate_disambiguator())
1314 (self.cstore.crate_name_untracked(def_id.krate),
1315 self.cstore.crate_disambiguator_untracked(def_id.krate))
1320 // Don't print the whole crate disambiguator. That's just
1321 // annoying in debug output.
1322 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1323 self.def_path(def_id).to_string_no_crate())
1326 pub fn metadata_encoding_version(self) -> Vec<u8> {
1327 self.cstore.metadata_encoding_version().to_vec()
1330 // Note that this is *untracked* and should only be used within the query
1331 // system if the result is otherwise tracked through queries
1332 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1333 self.cstore.crate_data_as_rc_any(cnum)
1337 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1338 let krate = self.gcx.hir_map.forest.untracked_krate();
1340 StableHashingContext::new(self.sess,
1342 self.hir().definitions(),
1346 // This method makes sure that we have a DepNode and a Fingerprint for
1347 // every upstream crate. It needs to be called once right after the tcx is
1349 // With full-fledged red/green, the method will probably become unnecessary
1350 // as this will be done on-demand.
1351 pub fn allocate_metadata_dep_nodes(self) {
1352 // We cannot use the query versions of crates() and crate_hash(), since
1353 // those would need the DepNodes that we are allocating here.
1354 for cnum in self.cstore.crates_untracked() {
1355 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1356 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1357 self.dep_graph.with_task(dep_node,
1360 |_, x| x // No transformation needed
1365 // This method exercises the `in_scope_traits_map` query for all possible
1366 // values so that we have their fingerprints available in the DepGraph.
1367 // This is only required as long as we still use the old dependency tracking
1368 // which needs to have the fingerprints of all input nodes beforehand.
1369 pub fn precompute_in_scope_traits_hashes(self) {
1370 for &def_index in self.trait_map.keys() {
1371 self.in_scope_traits_map(def_index);
1375 pub fn serialize_query_result_cache<E>(self,
1377 -> Result<(), E::Error>
1378 where E: ty::codec::TyEncoder
1380 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1383 /// This checks whether one is allowed to have pattern bindings
1384 /// that bind-by-move on a match arm that has a guard, e.g.:
1387 /// match foo { A(inner) if { /* something */ } => ..., ... }
1390 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1391 /// because that method has a narrower effect that can be toggled
1392 /// off via a separate `-Z` flag, at least for the short term.
1393 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1394 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1397 /// If true, we should use a naive AST walk to determine if match
1398 /// guard could perform bad mutations (or mutable-borrows).
1399 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1400 // If someone requests the feature, then be a little more
1401 // careful and ensure that MIR-borrowck is enabled (which can
1402 // happen via edition selection, via `feature(nll)`, or via an
1403 // appropriate `-Z` flag) before disabling the mutation check.
1404 if self.allow_bind_by_move_patterns_with_guards() {
1411 /// If true, we should use the AST-based borrowck (we may *also* use
1412 /// the MIR-based borrowck).
1413 pub fn use_ast_borrowck(self) -> bool {
1414 self.borrowck_mode().use_ast()
1417 /// If true, we should use the MIR-based borrowck (we may *also* use
1418 /// the AST-based borrowck).
1419 pub fn use_mir_borrowck(self) -> bool {
1420 self.borrowck_mode().use_mir()
1423 /// If true, we should use the MIR-based borrow check, but also
1424 /// fall back on the AST borrow check if the MIR-based one errors.
1425 pub fn migrate_borrowck(self) -> bool {
1426 self.borrowck_mode().migrate()
1429 /// If true, make MIR codegen for `match` emit a temp that holds a
1430 /// borrow of the input to the match expression.
1431 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1432 self.emit_read_for_match()
1435 /// If true, make MIR codegen for `match` emit FakeRead
1436 /// statements (which simulate the maximal effect of executing the
1437 /// patterns in a match arm).
1438 pub fn emit_read_for_match(&self) -> bool {
1439 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1442 /// If true, pattern variables for use in guards on match arms
1443 /// will be bound as references to the data, and occurrences of
1444 /// those variables in the guard expression will implicitly
1445 /// dereference those bindings. (See rust-lang/rust#27282.)
1446 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1447 self.borrowck_mode().use_mir()
1450 /// If true, we should enable two-phase borrows checks. This is
1451 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1452 /// or by opting into an edition after 2015.
1453 pub fn two_phase_borrows(self) -> bool {
1454 self.sess.rust_2018() || self.features().nll ||
1455 self.sess.opts.debugging_opts.two_phase_borrows
1458 /// What mode(s) of borrowck should we run? AST? MIR? both?
1459 /// (Also considers the `#![feature(nll)]` setting.)
1460 pub fn borrowck_mode(&self) -> BorrowckMode {
1461 // Here are the main constraints we need to deal with:
1463 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1464 // synonymous with no `-Z borrowck=...` flag at all.
1465 // (This is arguably a historical accident.)
1467 // 2. `BorrowckMode::Migrate` is the limited migration to
1468 // NLL that we are deploying with the 2018 edition.
1470 // 3. We want to allow developers on the Nightly channel
1471 // to opt back into the "hard error" mode for NLL,
1472 // (which they can do via specifying `#![feature(nll)]`
1473 // explicitly in their crate).
1475 // So, this precedence list is how pnkfelix chose to work with
1476 // the above constraints:
1478 // * `#![feature(nll)]` *always* means use NLL with hard
1479 // errors. (To simplify the code here, it now even overrides
1480 // a user's attempt to specify `-Z borrowck=compare`, which
1481 // we arguably do not need anymore and should remove.)
1483 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1484 // if `borrowck=ast` was specified), then use the default
1485 // as required by the edition.
1487 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1489 if self.features().nll { return BorrowckMode::Mir; }
1491 match self.sess.opts.borrowck_mode {
1492 mode @ BorrowckMode::Mir |
1493 mode @ BorrowckMode::Compare |
1494 mode @ BorrowckMode::Migrate => mode,
1496 BorrowckMode::Ast => match self.sess.edition() {
1497 Edition::Edition2015 => BorrowckMode::Ast,
1498 Edition::Edition2018 => BorrowckMode::Migrate,
1504 pub fn local_crate_exports_generics(self) -> bool {
1505 debug_assert!(self.sess.opts.share_generics());
1507 self.sess.crate_types.borrow().iter().any(|crate_type| {
1509 CrateType::Executable |
1510 CrateType::Staticlib |
1511 CrateType::ProcMacro |
1512 CrateType::Cdylib => false,
1514 CrateType::Dylib => true,
1519 // This method returns the DefId and the BoundRegion corresponding to the given region.
1520 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1521 let (suitable_region_binding_scope, bound_region) = match *region {
1522 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1523 ty::ReEarlyBound(ref ebr) => (
1524 self.parent_def_id(ebr.def_id).unwrap(),
1525 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1527 _ => return None, // not a free region
1530 let node_id = self.hir()
1531 .as_local_node_id(suitable_region_binding_scope)
1533 let is_impl_item = match self.hir().find(node_id) {
1534 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1535 Some(Node::ImplItem(..)) => {
1536 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1541 return Some(FreeRegionInfo {
1542 def_id: suitable_region_binding_scope,
1543 boundregion: bound_region,
1544 is_impl_item: is_impl_item,
1548 pub fn return_type_impl_trait(
1550 scope_def_id: DefId,
1551 ) -> Option<Ty<'tcx>> {
1552 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1553 let node_id = self.hir().as_local_node_id(scope_def_id).unwrap();
1554 match self.hir().get(node_id) {
1555 Node::Item(item) => {
1557 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1563 _ => { /* type_of_def_id() will work or panic */ }
1566 let ret_ty = self.type_of(scope_def_id);
1568 ty::FnDef(_, _) => {
1569 let sig = ret_ty.fn_sig(*self);
1570 let output = self.erase_late_bound_regions(&sig.output());
1571 if output.is_impl_trait() {
1581 // Here we check if the bound region is in Impl Item.
1582 pub fn is_bound_region_in_impl_item(
1584 suitable_region_binding_scope: DefId,
1586 let container_id = self.associated_item(suitable_region_binding_scope)
1589 if self.impl_trait_ref(container_id).is_some() {
1590 // For now, we do not try to target impls of traits. This is
1591 // because this message is going to suggest that the user
1592 // change the fn signature, but they may not be free to do so,
1593 // since the signature must match the trait.
1595 // FIXME(#42706) -- in some cases, we could do better here.
1602 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1603 pub fn encode_metadata(self)
1606 self.cstore.encode_metadata(self)
1610 impl<'gcx> GlobalCtxt<'gcx> {
1611 /// Call the closure with a local `TyCtxt` using the given arena.
1612 /// `interners` is a slot passed so we can create a CtxtInterners
1613 /// with the same lifetime as `arena`.
1614 pub fn enter_local<'tcx, F, R>(
1616 arena: &'tcx SyncDroplessArena,
1617 interners: &'tcx mut Option<CtxtInterners<'tcx>>,
1621 F: FnOnce(TyCtxt<'tcx, 'gcx, 'tcx>) -> R,
1624 *interners = Some(CtxtInterners::new(&arena));
1627 interners: interners.as_ref().unwrap(),
1630 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1631 let new_icx = ty::tls::ImplicitCtxt {
1633 query: icx.query.clone(),
1634 layout_depth: icx.layout_depth,
1637 ty::tls::enter_context(&new_icx, |_| {
1644 /// A trait implemented for all X<'a> types which can be safely and
1645 /// efficiently converted to X<'tcx> as long as they are part of the
1646 /// provided TyCtxt<'tcx>.
1647 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1648 /// by looking them up in their respective interners.
1650 /// However, this is still not the best implementation as it does
1651 /// need to compare the components, even for interned values.
1652 /// It would be more efficient if TypedArena provided a way to
1653 /// determine whether the address is in the allocated range.
1655 /// None is returned if the value or one of the components is not part
1656 /// of the provided context.
1657 /// For Ty, None can be returned if either the type interner doesn't
1658 /// contain the TyKind key or if the address of the interned
1659 /// pointer differs. The latter case is possible if a primitive type,
1660 /// e.g., `()` or `u8`, was interned in a different context.
1661 pub trait Lift<'tcx>: fmt::Debug {
1662 type Lifted: fmt::Debug + 'tcx;
1663 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1666 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1667 type Lifted = Ty<'tcx>;
1668 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1669 if tcx.interners.arena.in_arena(*self as *const _) {
1670 return Some(unsafe { mem::transmute(*self) });
1672 // Also try in the global tcx if we're not that.
1673 if !tcx.is_global() {
1674 self.lift_to_tcx(tcx.global_tcx())
1681 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1682 type Lifted = Region<'tcx>;
1683 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1684 if tcx.interners.arena.in_arena(*self as *const _) {
1685 return Some(unsafe { mem::transmute(*self) });
1687 // Also try in the global tcx if we're not that.
1688 if !tcx.is_global() {
1689 self.lift_to_tcx(tcx.global_tcx())
1696 impl<'a, 'tcx> Lift<'tcx> for Goal<'a> {
1697 type Lifted = Goal<'tcx>;
1698 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Goal<'tcx>> {
1699 if tcx.interners.arena.in_arena(*self as *const _) {
1700 return Some(unsafe { mem::transmute(*self) });
1702 // Also try in the global tcx if we're not that.
1703 if !tcx.is_global() {
1704 self.lift_to_tcx(tcx.global_tcx())
1711 impl<'a, 'tcx> Lift<'tcx> for &'a List<Goal<'a>> {
1712 type Lifted = &'tcx List<Goal<'tcx>>;
1713 fn lift_to_tcx<'b, 'gcx>(
1715 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1716 ) -> Option<&'tcx List<Goal<'tcx>>> {
1717 if self.is_empty() {
1718 return Some(List::empty());
1721 if tcx.interners.arena.in_arena(*self as *const _) {
1722 return Some(unsafe { mem::transmute(*self) });
1724 // Also try in the global tcx if we're not that.
1725 if !tcx.is_global() {
1726 self.lift_to_tcx(tcx.global_tcx())
1733 impl<'a, 'tcx> Lift<'tcx> for &'a List<Clause<'a>> {
1734 type Lifted = &'tcx List<Clause<'tcx>>;
1735 fn lift_to_tcx<'b, 'gcx>(
1737 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1738 ) -> Option<&'tcx List<Clause<'tcx>>> {
1739 if self.is_empty() {
1740 return Some(List::empty());
1743 if tcx.interners.arena.in_arena(*self as *const _) {
1744 return Some(unsafe { mem::transmute(*self) });
1746 // Also try in the global tcx if we're not that.
1747 if !tcx.is_global() {
1748 self.lift_to_tcx(tcx.global_tcx())
1755 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1756 type Lifted = &'tcx Const<'tcx>;
1757 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1758 if tcx.interners.arena.in_arena(*self as *const _) {
1759 return Some(unsafe { mem::transmute(*self) });
1761 // Also try in the global tcx if we're not that.
1762 if !tcx.is_global() {
1763 self.lift_to_tcx(tcx.global_tcx())
1770 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1771 type Lifted = &'tcx Substs<'tcx>;
1772 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1773 if self.len() == 0 {
1774 return Some(List::empty());
1776 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1777 return Some(unsafe { mem::transmute(*self) });
1779 // Also try in the global tcx if we're not that.
1780 if !tcx.is_global() {
1781 self.lift_to_tcx(tcx.global_tcx())
1788 impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>> {
1789 type Lifted = &'tcx List<Ty<'tcx>>;
1790 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1791 -> Option<&'tcx List<Ty<'tcx>>> {
1792 if self.len() == 0 {
1793 return Some(List::empty());
1795 if tcx.interners.arena.in_arena(*self as *const _) {
1796 return Some(unsafe { mem::transmute(*self) });
1798 // Also try in the global tcx if we're not that.
1799 if !tcx.is_global() {
1800 self.lift_to_tcx(tcx.global_tcx())
1807 impl<'a, 'tcx> Lift<'tcx> for &'a List<ExistentialPredicate<'a>> {
1808 type Lifted = &'tcx List<ExistentialPredicate<'tcx>>;
1809 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1810 -> Option<&'tcx List<ExistentialPredicate<'tcx>>> {
1811 if self.is_empty() {
1812 return Some(List::empty());
1814 if tcx.interners.arena.in_arena(*self as *const _) {
1815 return Some(unsafe { mem::transmute(*self) });
1817 // Also try in the global tcx if we're not that.
1818 if !tcx.is_global() {
1819 self.lift_to_tcx(tcx.global_tcx())
1826 impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>> {
1827 type Lifted = &'tcx List<Predicate<'tcx>>;
1828 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1829 -> Option<&'tcx List<Predicate<'tcx>>> {
1830 if self.is_empty() {
1831 return Some(List::empty());
1833 if tcx.interners.arena.in_arena(*self as *const _) {
1834 return Some(unsafe { mem::transmute(*self) });
1836 // Also try in the global tcx if we're not that.
1837 if !tcx.is_global() {
1838 self.lift_to_tcx(tcx.global_tcx())
1845 impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo> {
1846 type Lifted = &'tcx List<CanonicalVarInfo>;
1847 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1848 if self.len() == 0 {
1849 return Some(List::empty());
1851 if tcx.interners.arena.in_arena(*self as *const _) {
1852 return Some(unsafe { mem::transmute(*self) });
1854 // Also try in the global tcx if we're not that.
1855 if !tcx.is_global() {
1856 self.lift_to_tcx(tcx.global_tcx())
1863 impl<'a, 'tcx> Lift<'tcx> for &'a List<ProjectionKind<'a>> {
1864 type Lifted = &'tcx List<ProjectionKind<'tcx>>;
1865 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1866 if self.len() == 0 {
1867 return Some(List::empty());
1869 if tcx.interners.arena.in_arena(*self as *const _) {
1870 return Some(unsafe { mem::transmute(*self) });
1872 // Also try in the global tcx if we're not that.
1873 if !tcx.is_global() {
1874 self.lift_to_tcx(tcx.global_tcx())
1882 use super::{GlobalCtxt, TyCtxt};
1886 use std::marker::PhantomData;
1889 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1890 use rustc_data_structures::OnDrop;
1891 use rustc_data_structures::sync::{self, Lrc, Lock};
1892 use dep_graph::OpenTask;
1894 #[cfg(not(parallel_queries))]
1895 use std::cell::Cell;
1897 #[cfg(parallel_queries)]
1900 /// This is the implicit state of rustc. It contains the current
1901 /// TyCtxt and query. It is updated when creating a local interner or
1902 /// executing a new query. Whenever there's a TyCtxt value available
1903 /// you should also have access to an ImplicitCtxt through the functions
1906 pub struct ImplicitCtxt<'a, 'gcx: 'tcx, 'tcx> {
1907 /// The current TyCtxt. Initially created by `enter_global` and updated
1908 /// by `enter_local` with a new local interner
1909 pub tcx: TyCtxt<'tcx, 'gcx, 'tcx>,
1911 /// The current query job, if any. This is updated by start_job in
1912 /// ty::query::plumbing when executing a query
1913 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1915 /// Used to prevent layout from recursing too deeply.
1916 pub layout_depth: usize,
1918 /// The current dep graph task. This is used to add dependencies to queries
1919 /// when executing them
1920 pub task: &'a OpenTask,
1923 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1924 /// to `value` during the call to `f`. It is restored to its previous value after.
1925 /// This is used to set the pointer to the new ImplicitCtxt.
1926 #[cfg(parallel_queries)]
1928 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1929 rayon_core::tlv::with(value, f)
1932 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1933 /// This is used to get the pointer to the current ImplicitCtxt.
1934 #[cfg(parallel_queries)]
1936 fn get_tlv() -> usize {
1937 rayon_core::tlv::get()
1940 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1941 #[cfg(not(parallel_queries))]
1942 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1944 /// Sets TLV to `value` during the call to `f`.
1945 /// It is restored to its previous value after.
1946 /// This is used to set the pointer to the new ImplicitCtxt.
1947 #[cfg(not(parallel_queries))]
1949 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1950 let old = get_tlv();
1951 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1952 TLV.with(|tlv| tlv.set(value));
1956 /// This is used to get the pointer to the current ImplicitCtxt.
1957 #[cfg(not(parallel_queries))]
1958 fn get_tlv() -> usize {
1959 TLV.with(|tlv| tlv.get())
1962 /// This is a callback from libsyntax as it cannot access the implicit state
1963 /// in librustc otherwise
1964 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1966 if let Some(tcx) = tcx {
1967 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1969 syntax_pos::default_span_debug(span, f)
1974 /// This is a callback from libsyntax as it cannot access the implicit state
1975 /// in librustc otherwise. It is used to when diagnostic messages are
1976 /// emitted and stores them in the current query, if there is one.
1977 fn track_diagnostic(diagnostic: &Diagnostic) {
1978 with_context_opt(|icx| {
1979 if let Some(icx) = icx {
1980 if let Some(ref query) = icx.query {
1981 query.diagnostics.lock().push(diagnostic.clone());
1987 /// Sets up the callbacks from libsyntax on the current thread
1988 pub fn with_thread_locals<F, R>(f: F) -> R
1989 where F: FnOnce() -> R
1991 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1992 let original_span_debug = span_dbg.get();
1993 span_dbg.set(span_debug);
1995 let _on_drop = OnDrop(move || {
1996 span_dbg.set(original_span_debug);
1999 TRACK_DIAGNOSTICS.with(|current| {
2000 let original = current.get();
2001 current.set(track_diagnostic);
2003 let _on_drop = OnDrop(move || {
2004 current.set(original);
2012 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
2014 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
2016 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2018 set_tlv(context as *const _ as usize, || {
2023 /// Enters GlobalCtxt by setting up libsyntax callbacks and
2024 /// creating a initial TyCtxt and ImplicitCtxt.
2025 /// This happens once per rustc session and TyCtxts only exists
2026 /// inside the `f` function.
2027 pub fn enter_global<'gcx, F, R>(gcx: &'gcx GlobalCtxt<'gcx>, f: F) -> R
2028 where F: FnOnce(TyCtxt<'gcx, 'gcx, 'gcx>) -> R
2030 with_thread_locals(|| {
2031 // Update GCX_PTR to indicate there's a GlobalCtxt available
2032 GCX_PTR.with(|lock| {
2033 *lock.lock() = gcx as *const _ as usize;
2035 // Set GCX_PTR back to 0 when we exit
2036 let _on_drop = OnDrop(move || {
2037 GCX_PTR.with(|lock| *lock.lock() = 0);
2042 interners: &gcx.global_interners,
2045 let icx = ImplicitCtxt {
2049 task: &OpenTask::Ignore,
2051 enter_context(&icx, |_| {
2057 /// Stores a pointer to the GlobalCtxt if one is available.
2058 /// This is used to access the GlobalCtxt in the deadlock handler
2060 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2062 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2063 /// This is used in the deadlock handler.
2064 pub unsafe fn with_global<F, R>(f: F) -> R
2065 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2067 let gcx = GCX_PTR.with(|lock| *lock.lock());
2069 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2072 interners: &gcx.global_interners,
2075 let icx = ImplicitCtxt {
2079 task: &OpenTask::Ignore,
2081 enter_context(&icx, |_| f(tcx))
2084 /// Allows access to the current ImplicitCtxt in a closure if one is available
2086 pub fn with_context_opt<F, R>(f: F) -> R
2087 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2089 let context = get_tlv();
2093 // We could get a ImplicitCtxt pointer from another thread.
2094 // Ensure that ImplicitCtxt is Sync
2095 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2097 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2101 /// Allows access to the current ImplicitCtxt.
2102 /// Panics if there is no ImplicitCtxt available
2104 pub fn with_context<F, R>(f: F) -> R
2105 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2107 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2110 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2111 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2112 /// with the same 'gcx lifetime as the TyCtxt passed in.
2113 /// This will panic if you pass it a TyCtxt which has a different global interner from
2114 /// the current ImplicitCtxt's tcx field.
2116 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2117 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2119 with_context(|context| {
2121 let gcx = tcx.gcx as *const _ as usize;
2122 assert!(context.tcx.gcx as *const _ as usize == gcx);
2123 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2129 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2130 /// interner and local interner as the tcx argument passed in. This means the closure
2131 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2132 /// This will panic if you pass it a TyCtxt which has a different global interner or
2133 /// a different local interner from the current ImplicitCtxt's tcx field.
2135 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2136 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2138 with_context(|context| {
2140 let gcx = tcx.gcx as *const _ as usize;
2141 let interners = tcx.interners as *const _ as usize;
2142 assert!(context.tcx.gcx as *const _ as usize == gcx);
2143 assert!(context.tcx.interners as *const _ as usize == interners);
2144 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2150 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2151 /// Panics if there is no ImplicitCtxt available
2153 pub fn with<F, R>(f: F) -> R
2154 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2156 with_context(|context| f(context.tcx))
2159 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2160 /// The closure is passed None if there is no ImplicitCtxt available
2162 pub fn with_opt<F, R>(f: F) -> R
2163 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2165 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2169 macro_rules! sty_debug_print {
2170 ($ctxt: expr, $($variant: ident),*) => {{
2171 // curious inner module to allow variant names to be used as
2173 #[allow(non_snake_case)]
2175 use ty::{self, TyCtxt};
2176 use ty::context::Interned;
2178 #[derive(Copy, Clone)]
2181 region_infer: usize,
2186 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2187 let mut total = DebugStat {
2189 region_infer: 0, ty_infer: 0, both_infer: 0,
2191 $(let mut $variant = total;)*
2193 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2194 let variant = match t.sty {
2195 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2196 ty::Float(..) | ty::Str | ty::Never => continue,
2197 ty::Error => /* unimportant */ continue,
2198 $(ty::$variant(..) => &mut $variant,)*
2200 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2201 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2205 if region { total.region_infer += 1; variant.region_infer += 1 }
2206 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2207 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2209 println!("Ty interner total ty region both");
2210 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2211 {ty:4.1}% {region:5.1}% {both:4.1}%",
2212 stringify!($variant),
2213 uses = $variant.total,
2214 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2215 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2216 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2217 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2219 println!(" total {uses:6} \
2220 {ty:4.1}% {region:5.1}% {both:4.1}%",
2222 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2223 region = total.region_infer as f64 * 100.0 / total.total as f64,
2224 both = total.both_infer as f64 * 100.0 / total.total as f64)
2232 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2233 pub fn print_debug_stats(self) {
2236 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2237 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2238 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2240 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2241 println!("Region interner: #{}", self.interners.region.borrow().len());
2242 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2243 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2244 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2249 /// An entry in an interner.
2250 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2252 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2253 fn clone(&self) -> Self {
2257 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2259 // N.B., an `Interned<Ty>` compares and hashes as a sty.
2260 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2261 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2262 self.0.sty == other.0.sty
2266 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2268 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2269 fn hash<H: Hasher>(&self, s: &mut H) {
2274 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2275 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2280 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2281 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2282 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2283 self.0[..] == other.0[..]
2287 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2289 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2290 fn hash<H: Hasher>(&self, s: &mut H) {
2295 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2296 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2301 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2302 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2307 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2308 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2313 impl<'tcx: 'lcx, 'lcx> Borrow<[ProjectionKind<'lcx>]>
2314 for Interned<'tcx, List<ProjectionKind<'tcx>>> {
2315 fn borrow<'a>(&'a self) -> &'a [ProjectionKind<'lcx>] {
2320 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2321 fn borrow<'a>(&'a self) -> &'a RegionKind {
2326 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2327 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2332 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2333 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2334 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2339 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2340 for Interned<'tcx, List<Predicate<'tcx>>> {
2341 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2346 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2347 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2352 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2353 for Interned<'tcx, List<Clause<'tcx>>> {
2354 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2359 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2360 for Interned<'tcx, List<Goal<'tcx>>> {
2361 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2366 macro_rules! intern_method {
2367 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2370 $keep_in_local_tcx:expr) -> $ty:ty) => {
2371 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2372 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2373 let key = ($alloc_to_key)(&v);
2375 // HACK(eddyb) Depend on flags being accurate to
2376 // determine that all contents are in the global tcx.
2377 // See comments on Lift for why we can't use that.
2378 if ($keep_in_local_tcx)(&v) {
2379 self.interners.$name.borrow_mut().intern_ref(key, || {
2380 // Make sure we don't end up with inference
2381 // types/regions in the global tcx.
2382 if self.is_global() {
2383 bug!("Attempted to intern `{:?}` which contains \
2384 inference types/regions in the global type context",
2388 Interned($alloc_method(&self.interners.arena, v))
2391 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2392 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2396 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2398 let i = unsafe { mem::transmute(i) };
2407 macro_rules! direct_interners {
2408 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2409 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2410 fn eq(&self, other: &Self) -> bool {
2415 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2417 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2418 fn hash<H: Hasher>(&self, s: &mut H) {
2426 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2428 $keep_in_local_tcx) -> $ty);)+
2432 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2433 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2436 direct_interners!('tcx,
2437 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2438 const_: mk_const(|c: &Const<'_>| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>,
2439 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>
2442 macro_rules! slice_interners {
2443 ($($field:ident: $method:ident($ty:ident)),+) => (
2444 $(intern_method!( 'tcx, $field: $method(
2446 |a, v| List::from_arena(a, v),
2448 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2453 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2454 predicates: _intern_predicates(Predicate),
2455 type_list: _intern_type_list(Ty),
2456 substs: _intern_substs(Kind),
2457 clauses: _intern_clauses(Clause),
2458 goal_list: _intern_goals(Goal),
2459 projs: _intern_projs(ProjectionKind)
2462 // This isn't a perfect fit: CanonicalVarInfo slices are always
2463 // allocated in the global arena, so this `intern_method!` macro is
2464 // overly general. But we just return false for the code that checks
2465 // whether they belong in the thread-local arena, so no harm done, and
2466 // seems better than open-coding the rest.
2469 canonical_var_infos: _intern_canonical_var_infos(
2470 &[CanonicalVarInfo],
2471 |a, v| List::from_arena(a, v),
2473 |_xs: &[CanonicalVarInfo]| -> bool { false }
2474 ) -> List<CanonicalVarInfo>
2477 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2478 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2479 /// that is, a `fn` type that is equivalent in every way for being
2481 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2482 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2483 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2484 unsafety: hir::Unsafety::Unsafe,
2489 /// Given a closure signature `sig`, returns an equivalent `fn`
2490 /// type with the same signature. Detuples and so forth -- so
2491 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2492 /// a `fn(u32, i32)`.
2493 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2494 let converted_sig = sig.map_bound(|s| {
2495 let params_iter = match s.inputs()[0].sty {
2496 ty::Tuple(params) => {
2497 params.into_iter().cloned()
2505 hir::Unsafety::Normal,
2510 self.mk_fn_ptr(converted_sig)
2514 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2515 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2518 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2520 ast::IntTy::Isize => self.types.isize,
2521 ast::IntTy::I8 => self.types.i8,
2522 ast::IntTy::I16 => self.types.i16,
2523 ast::IntTy::I32 => self.types.i32,
2524 ast::IntTy::I64 => self.types.i64,
2525 ast::IntTy::I128 => self.types.i128,
2529 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2531 ast::UintTy::Usize => self.types.usize,
2532 ast::UintTy::U8 => self.types.u8,
2533 ast::UintTy::U16 => self.types.u16,
2534 ast::UintTy::U32 => self.types.u32,
2535 ast::UintTy::U64 => self.types.u64,
2536 ast::UintTy::U128 => self.types.u128,
2540 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2542 ast::FloatTy::F32 => self.types.f32,
2543 ast::FloatTy::F64 => self.types.f64,
2548 pub fn mk_str(self) -> Ty<'tcx> {
2553 pub fn mk_static_str(self) -> Ty<'tcx> {
2554 self.mk_imm_ref(self.types.re_static, self.mk_str())
2558 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2559 // take a copy of substs so that we own the vectors inside
2560 self.mk_ty(Adt(def, substs))
2564 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2565 self.mk_ty(Foreign(def_id))
2568 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2569 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2570 let adt_def = self.adt_def(def_id);
2571 let substs = Substs::for_item(self, def_id, |param, substs| {
2573 GenericParamDefKind::Lifetime => bug!(),
2574 GenericParamDefKind::Type { has_default, .. } => {
2575 if param.index == 0 {
2578 assert!(has_default);
2579 self.type_of(param.def_id).subst(self, substs).into()
2584 self.mk_ty(Adt(adt_def, substs))
2588 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2589 self.mk_ty(RawPtr(tm))
2593 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2594 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2598 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2599 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2603 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2604 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2608 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2609 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2613 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2614 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2618 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2619 self.mk_imm_ptr(self.mk_unit())
2623 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2624 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2628 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2629 self.mk_ty(Slice(ty))
2633 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2634 self.mk_ty(Tuple(self.intern_type_list(ts)))
2637 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2638 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2642 pub fn mk_unit(self) -> Ty<'tcx> {
2647 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2648 if self.features().never_type {
2651 self.intern_tup(&[])
2656 pub fn mk_bool(self) -> Ty<'tcx> {
2661 pub fn mk_fn_def(self, def_id: DefId,
2662 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2663 self.mk_ty(FnDef(def_id, substs))
2667 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2668 self.mk_ty(FnPtr(fty))
2674 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2675 reg: ty::Region<'tcx>
2677 self.mk_ty(Dynamic(obj, reg))
2681 pub fn mk_projection(self,
2683 substs: &'tcx Substs<'tcx>)
2685 self.mk_ty(Projection(ProjectionTy {
2692 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2694 self.mk_ty(Closure(closure_id, closure_substs))
2698 pub fn mk_generator(self,
2700 generator_substs: GeneratorSubsts<'tcx>,
2701 movability: hir::GeneratorMovability)
2703 self.mk_ty(Generator(id, generator_substs, movability))
2707 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2708 self.mk_ty(GeneratorWitness(types))
2712 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2713 self.mk_infer(TyVar(v))
2717 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2718 self.mk_infer(IntVar(v))
2722 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2723 self.mk_infer(FloatVar(v))
2727 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2728 self.mk_ty(Infer(it))
2732 pub fn mk_ty_param(self,
2734 name: InternedString) -> Ty<'tcx> {
2735 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2739 pub fn mk_self_type(self) -> Ty<'tcx> {
2740 self.mk_ty_param(0, keywords::SelfUpper.name().as_interned_str())
2743 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2745 GenericParamDefKind::Lifetime => {
2746 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2748 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2753 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2754 self.mk_ty(Opaque(def_id, substs))
2757 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2758 -> &'tcx List<ExistentialPredicate<'tcx>> {
2759 assert!(!eps.is_empty());
2760 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2761 self._intern_existential_predicates(eps)
2764 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2765 -> &'tcx List<Predicate<'tcx>> {
2766 // FIXME consider asking the input slice to be sorted to avoid
2767 // re-interning permutations, in which case that would be asserted
2769 if preds.len() == 0 {
2770 // The macro-generated method below asserts we don't intern an empty slice.
2773 self._intern_predicates(preds)
2777 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2781 self._intern_type_list(ts)
2785 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2789 self._intern_substs(ts)
2793 pub fn intern_projs(self, ps: &[ProjectionKind<'tcx>]) -> &'tcx List<ProjectionKind<'tcx>> {
2797 self._intern_projs(ps)
2801 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2805 self.global_tcx()._intern_canonical_var_infos(ts)
2809 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2813 self._intern_clauses(ts)
2817 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2821 self._intern_goals(ts)
2825 pub fn mk_fn_sig<I>(self,
2829 unsafety: hir::Unsafety,
2831 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2833 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2835 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2836 inputs_and_output: self.intern_type_list(xs),
2837 variadic, unsafety, abi
2841 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2842 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2844 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2847 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2848 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2850 iter.intern_with(|xs| self.intern_predicates(xs))
2853 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2854 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2855 iter.intern_with(|xs| self.intern_type_list(xs))
2858 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2859 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2860 iter.intern_with(|xs| self.intern_substs(xs))
2863 pub fn mk_substs_trait(self,
2865 rest: &[Kind<'tcx>])
2866 -> &'tcx Substs<'tcx>
2868 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2871 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2872 iter.intern_with(|xs| self.intern_clauses(xs))
2875 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2876 iter.intern_with(|xs| self.intern_goals(xs))
2879 pub fn lint_hir<S: Into<MultiSpan>>(self,
2880 lint: &'static Lint,
2884 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2887 pub fn lint_node<S: Into<MultiSpan>>(self,
2888 lint: &'static Lint,
2892 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2895 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2896 lint: &'static Lint,
2901 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2906 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2907 lint: &'static Lint,
2912 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2917 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2918 -> (lint::Level, lint::LintSource)
2920 // Right now we insert a `with_ignore` node in the dep graph here to
2921 // ignore the fact that `lint_levels` below depends on the entire crate.
2922 // For now this'll prevent false positives of recompiling too much when
2923 // anything changes.
2925 // Once red/green incremental compilation lands we should be able to
2926 // remove this because while the crate changes often the lint level map
2927 // will change rarely.
2928 self.dep_graph.with_ignore(|| {
2929 let sets = self.lint_levels(LOCAL_CRATE);
2931 let hir_id = self.hir().definitions().node_to_hir_id(id);
2932 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2935 let next = self.hir().get_parent_node(id);
2937 bug!("lint traversal reached the root of the crate");
2944 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2945 lint: &'static Lint,
2949 -> DiagnosticBuilder<'tcx>
2951 let node_id = self.hir().hir_to_node_id(hir_id);
2952 let (level, src) = self.lint_level_at_node(lint, node_id);
2953 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2956 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2957 lint: &'static Lint,
2961 -> DiagnosticBuilder<'tcx>
2963 let (level, src) = self.lint_level_at_node(lint, id);
2964 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2967 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2968 -> DiagnosticBuilder<'tcx>
2970 let (level, src) = self.lint_level_at_node(lint, id);
2971 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2974 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2975 self.in_scope_traits_map(id.owner)
2976 .and_then(|map| map.get(&id.local_id).cloned())
2979 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2980 self.named_region_map(id.owner)
2981 .and_then(|map| map.get(&id.local_id).cloned())
2984 pub fn is_late_bound(self, id: HirId) -> bool {
2985 self.is_late_bound_map(id.owner)
2986 .map(|set| set.contains(&id.local_id))
2990 pub fn object_lifetime_defaults(self, id: HirId)
2991 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2993 self.object_lifetime_defaults_map(id.owner)
2994 .and_then(|map| map.get(&id.local_id).cloned())
2998 pub trait InternAs<T: ?Sized, R> {
3000 fn intern_with<F>(self, f: F) -> Self::Output
3001 where F: FnOnce(&T) -> R;
3004 impl<I, T, R, E> InternAs<[T], R> for I
3005 where E: InternIteratorElement<T, R>,
3006 I: Iterator<Item=E> {
3007 type Output = E::Output;
3008 fn intern_with<F>(self, f: F) -> Self::Output
3009 where F: FnOnce(&[T]) -> R {
3010 E::intern_with(self, f)
3014 pub trait InternIteratorElement<T, R>: Sized {
3016 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
3019 impl<T, R> InternIteratorElement<T, R> for T {
3021 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3022 f(&iter.collect::<SmallVec<[_; 8]>>())
3026 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
3030 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3031 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
3035 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
3036 type Output = Result<R, E>;
3037 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3038 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
3042 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3043 // FIXME(#44234): almost all of these queries have no sub-queries and
3044 // therefore no actual inputs, they're just reading tables calculated in
3045 // resolve! Does this work? Unsure! That's what the issue is about.
3046 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
3047 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
3048 providers.crate_name = |tcx, id| {
3049 assert_eq!(id, LOCAL_CRATE);
3052 providers.get_lib_features = |tcx, id| {
3053 assert_eq!(id, LOCAL_CRATE);
3054 Lrc::new(middle::lib_features::collect(tcx))
3056 providers.get_lang_items = |tcx, id| {
3057 assert_eq!(id, LOCAL_CRATE);
3058 Lrc::new(middle::lang_items::collect(tcx))
3060 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3061 providers.maybe_unused_trait_import = |tcx, id| {
3062 tcx.maybe_unused_trait_imports.contains(&id)
3064 providers.maybe_unused_extern_crates = |tcx, cnum| {
3065 assert_eq!(cnum, LOCAL_CRATE);
3066 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3069 providers.stability_index = |tcx, cnum| {
3070 assert_eq!(cnum, LOCAL_CRATE);
3071 Lrc::new(stability::Index::new(tcx))
3073 providers.lookup_stability = |tcx, id| {
3074 assert_eq!(id.krate, LOCAL_CRATE);
3075 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3076 tcx.stability().local_stability(id)
3078 providers.lookup_deprecation_entry = |tcx, id| {
3079 assert_eq!(id.krate, LOCAL_CRATE);
3080 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3081 tcx.stability().local_deprecation_entry(id)
3083 providers.extern_mod_stmt_cnum = |tcx, id| {
3084 let id = tcx.hir().as_local_node_id(id).unwrap();
3085 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3087 providers.all_crate_nums = |tcx, cnum| {
3088 assert_eq!(cnum, LOCAL_CRATE);
3089 Lrc::new(tcx.cstore.crates_untracked())
3091 providers.postorder_cnums = |tcx, cnum| {
3092 assert_eq!(cnum, LOCAL_CRATE);
3093 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3095 providers.output_filenames = |tcx, cnum| {
3096 assert_eq!(cnum, LOCAL_CRATE);
3097 tcx.output_filenames.clone()
3099 providers.features_query = |tcx, cnum| {
3100 assert_eq!(cnum, LOCAL_CRATE);
3101 Lrc::new(tcx.sess.features_untracked().clone())
3103 providers.is_panic_runtime = |tcx, cnum| {
3104 assert_eq!(cnum, LOCAL_CRATE);
3105 attr::contains_name(tcx.hir().krate_attrs(), "panic_runtime")
3107 providers.is_compiler_builtins = |tcx, cnum| {
3108 assert_eq!(cnum, LOCAL_CRATE);
3109 attr::contains_name(tcx.hir().krate_attrs(), "compiler_builtins")