1 // Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! type context book-keeping
13 use dep_graph::DepGraph;
14 use dep_graph::{DepNode, DepConstructor};
15 use errors::DiagnosticBuilder;
17 use session::config::{BorrowckMode, OutputFilenames};
18 use session::config::CrateType;
20 use hir::{TraitCandidate, HirId, ItemLocalId, Node};
21 use hir::def::{Def, Export};
22 use hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
23 use hir::map as hir_map;
24 use hir::map::DefPathHash;
25 use lint::{self, Lint};
26 use ich::{StableHashingContext, NodeIdHashingMode};
27 use infer::canonical::{CanonicalVarInfo, CanonicalVarInfos};
28 use infer::outlives::free_region_map::FreeRegionMap;
29 use middle::cstore::CrateStoreDyn;
30 use middle::cstore::EncodedMetadata;
31 use middle::lang_items;
32 use middle::resolve_lifetime::{self, ObjectLifetimeDefault};
33 use middle::stability;
34 use mir::{self, Mir, interpret};
35 use mir::interpret::Allocation;
36 use ty::subst::{CanonicalUserSubsts, Kind, Substs, Subst};
39 use traits::{Clause, Clauses, GoalKind, Goal, Goals};
40 use ty::{self, Ty, TypeAndMut};
41 use ty::{TyS, TyKind, List};
42 use ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorSubsts, Region, Const};
43 use ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
45 use ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid};
47 use ty::GenericParamDefKind;
48 use ty::layout::{LayoutDetails, TargetDataLayout};
53 use ty::CanonicalPolyFnSig;
54 use util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap};
55 use util::nodemap::{FxHashMap, FxHashSet};
56 use smallvec::SmallVec;
57 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
58 StableHasher, StableHasherResult,
60 use arena::{TypedArena, SyncDroplessArena};
61 use rustc_data_structures::indexed_vec::IndexVec;
62 use rustc_data_structures::sync::{self, Lrc, Lock, WorkerLocal};
64 use std::borrow::Borrow;
65 use std::cmp::Ordering;
66 use std::collections::hash_map::{self, Entry};
67 use std::hash::{Hash, Hasher};
70 use std::ops::{Deref, Bound};
74 use rustc_target::spec::abi;
75 use syntax::ast::{self, NodeId};
77 use syntax::source_map::MultiSpan;
78 use syntax::edition::Edition;
79 use syntax::feature_gate;
80 use syntax::symbol::{Symbol, keywords, InternedString};
85 pub struct AllArenas<'tcx> {
86 pub global: WorkerLocal<GlobalArenas<'tcx>>,
87 pub interner: SyncDroplessArena,
90 impl<'tcx> AllArenas<'tcx> {
91 pub fn new() -> Self {
93 global: WorkerLocal::new(|_| GlobalArenas::default()),
94 interner: SyncDroplessArena::default(),
101 pub struct GlobalArenas<'tcx> {
103 layout: TypedArena<LayoutDetails>,
106 generics: TypedArena<ty::Generics>,
107 trait_def: TypedArena<ty::TraitDef>,
108 adt_def: TypedArena<ty::AdtDef>,
109 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
110 mir: TypedArena<Mir<'tcx>>,
111 tables: TypedArena<ty::TypeckTables<'tcx>>,
113 const_allocs: TypedArena<interpret::Allocation>,
116 type InternedSet<'tcx, T> = Lock<FxHashSet<Interned<'tcx, T>>>;
118 pub struct CtxtInterners<'tcx> {
119 /// The arena that types, regions, etc are allocated from
120 arena: &'tcx SyncDroplessArena,
122 /// Specifically use a speedy hash algorithm for these hash sets,
123 /// they're accessed quite often.
124 type_: InternedSet<'tcx, TyS<'tcx>>,
125 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
126 substs: InternedSet<'tcx, Substs<'tcx>>,
127 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
128 region: InternedSet<'tcx, RegionKind>,
129 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
130 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
131 const_: InternedSet<'tcx, Const<'tcx>>,
132 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
133 goal: InternedSet<'tcx, GoalKind<'tcx>>,
134 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
137 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
138 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
141 type_: Default::default(),
142 type_list: Default::default(),
143 substs: Default::default(),
144 region: Default::default(),
145 existential_predicates: Default::default(),
146 canonical_var_infos: Default::default(),
147 predicates: Default::default(),
148 const_: Default::default(),
149 clauses: Default::default(),
150 goal: Default::default(),
151 goal_list: Default::default(),
157 local: &CtxtInterners<'tcx>,
158 global: &CtxtInterners<'gcx>,
161 let flags = super::flags::FlagComputation::for_sty(&st);
163 // HACK(eddyb) Depend on flags being accurate to
164 // determine that all contents are in the global tcx.
165 // See comments on Lift for why we can't use that.
166 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
167 let mut interner = local.type_.borrow_mut();
168 if let Some(&Interned(ty)) = interner.get(&st) {
172 let ty_struct = TyS {
175 outer_exclusive_binder: flags.outer_exclusive_binder,
178 // Make sure we don't end up with inference
179 // types/regions in the global interner
180 if local as *const _ as usize == global as *const _ as usize {
181 bug!("Attempted to intern `{:?}` which contains \
182 inference types/regions in the global type context",
186 // Don't be &mut TyS.
187 let ty: Ty<'tcx> = local.arena.alloc(ty_struct);
188 interner.insert(Interned(ty));
191 let mut interner = global.type_.borrow_mut();
192 if let Some(&Interned(ty)) = interner.get(&st) {
196 let ty_struct = TyS {
199 outer_exclusive_binder: flags.outer_exclusive_binder,
202 // This is safe because all the types the ty_struct can point to
203 // already is in the global arena
204 let ty_struct: TyS<'gcx> = unsafe {
205 mem::transmute(ty_struct)
208 // Don't be &mut TyS.
209 let ty: Ty<'gcx> = global.arena.alloc(ty_struct);
210 interner.insert(Interned(ty));
216 pub struct CommonTypes<'tcx> {
236 pub re_empty: Region<'tcx>,
237 pub re_static: Region<'tcx>,
238 pub re_erased: Region<'tcx>,
241 pub struct LocalTableInContext<'a, V: 'a> {
242 local_id_root: Option<DefId>,
243 data: &'a ItemLocalMap<V>
246 /// Validate that the given HirId (respectively its `local_id` part) can be
247 /// safely used as a key in the tables of a TypeckTable. For that to be
248 /// the case, the HirId must have the same `owner` as all the other IDs in
249 /// this table (signified by `local_id_root`). Otherwise the HirId
250 /// would be in a different frame of reference and using its `local_id`
251 /// would result in lookup errors, or worse, in silently wrong data being
253 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
256 if cfg!(debug_assertions) {
257 if let Some(local_id_root) = local_id_root {
258 if hir_id.owner != local_id_root.index {
259 ty::tls::with(|tcx| {
260 let node_id = tcx.hir.hir_to_node_id(hir_id);
262 bug!("node {} with HirId::owner {:?} cannot be placed in \
263 TypeckTables with local_id_root {:?}",
264 tcx.hir.node_to_string(node_id),
265 DefId::local(hir_id.owner),
270 // We use "Null Object" TypeckTables in some of the analysis passes.
271 // These are just expected to be empty and their `local_id_root` is
272 // `None`. Therefore we cannot verify whether a given `HirId` would
273 // be a valid key for the given table. Instead we make sure that
274 // nobody tries to write to such a Null Object table.
276 bug!("access to invalid TypeckTables")
282 impl<'a, V> LocalTableInContext<'a, V> {
283 pub fn contains_key(&self, id: hir::HirId) -> bool {
284 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
285 self.data.contains_key(&id.local_id)
288 pub fn get(&self, id: hir::HirId) -> Option<&V> {
289 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
290 self.data.get(&id.local_id)
293 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
298 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
301 fn index(&self, key: hir::HirId) -> &V {
302 self.get(key).expect("LocalTableInContext: key not found")
306 pub struct LocalTableInContextMut<'a, V: 'a> {
307 local_id_root: Option<DefId>,
308 data: &'a mut ItemLocalMap<V>
311 impl<'a, V> LocalTableInContextMut<'a, V> {
312 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
313 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
314 self.data.get_mut(&id.local_id)
317 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
318 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
319 self.data.entry(id.local_id)
322 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
323 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
324 self.data.insert(id.local_id, val)
327 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
328 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
329 self.data.remove(&id.local_id)
333 #[derive(RustcEncodable, RustcDecodable, Debug)]
334 pub struct TypeckTables<'tcx> {
335 /// The HirId::owner all ItemLocalIds in this table are relative to.
336 pub local_id_root: Option<DefId>,
338 /// Resolved definitions for `<T>::X` associated paths and
339 /// method calls, including those of overloaded operators.
340 type_dependent_defs: ItemLocalMap<Def>,
342 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
343 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
344 /// about the field you also need definition of the variant to which the field
345 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
346 field_indices: ItemLocalMap<usize>,
348 /// Stores the types for various nodes in the AST. Note that this table
349 /// is not guaranteed to be populated until after typeck. See
350 /// typeck::check::fn_ctxt for details.
351 node_types: ItemLocalMap<Ty<'tcx>>,
353 /// Stores the type parameters which were substituted to obtain the type
354 /// of this node. This only applies to nodes that refer to entities
355 /// parameterized by type parameters, such as generic fns, types, or
357 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
359 /// Stores the canonicalized types provided by the user. See also
360 /// `AscribeUserType` statement in MIR.
361 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
363 /// Stores the canonicalized types provided by the user. See also
364 /// `AscribeUserType` statement in MIR.
365 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
367 /// Stores the substitutions that the user explicitly gave (if any)
368 /// attached to `id`. These will not include any inferred
369 /// values. The canonical form is used to capture things like `_`
370 /// or other unspecified values.
374 /// If the user wrote `foo.collect::<Vec<_>>()`, then the
375 /// canonical substitutions would include only `for<X> { Vec<X>
377 user_substs: ItemLocalMap<CanonicalUserSubsts<'tcx>>,
379 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
381 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
382 pat_binding_modes: ItemLocalMap<BindingMode>,
384 /// Stores the types which were implicitly dereferenced in pattern binding modes
385 /// for later usage in HAIR lowering. For example,
388 /// match &&Some(5i32) {
393 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
396 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
397 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
400 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
402 /// Records the reasons that we picked the kind of each closure;
403 /// not all closures are present in the map.
404 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
406 /// For each fn, records the "liberated" types of its arguments
407 /// and return type. Liberated means that all bound regions
408 /// (including late-bound regions) are replaced with free
409 /// equivalents. This table is not used in codegen (since regions
410 /// are erased there) and hence is not serialized to metadata.
411 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
413 /// For each FRU expression, record the normalized types of the fields
414 /// of the struct - this is needed because it is non-trivial to
415 /// normalize while preserving regions. This table is used only in
416 /// MIR construction and hence is not serialized to metadata.
417 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
419 /// Maps a cast expression to its kind. This is keyed on the
420 /// *from* expression of the cast, not the cast itself.
421 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
423 /// Set of trait imports actually used in the method resolution.
424 /// This is used for warning unused imports. During type
425 /// checking, this `Lrc` should not be cloned: it must have a ref-count
426 /// of 1 so that we can insert things into the set mutably.
427 pub used_trait_imports: Lrc<DefIdSet>,
429 /// If any errors occurred while type-checking this body,
430 /// this field will be set to `true`.
431 pub tainted_by_errors: bool,
433 /// Stores the free-region relationships that were deduced from
434 /// its where clauses and parameter types. These are then
435 /// read-again by borrowck.
436 pub free_region_map: FreeRegionMap<'tcx>,
438 /// All the existential types that are restricted to concrete types
440 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
443 impl<'tcx> TypeckTables<'tcx> {
444 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
447 type_dependent_defs: ItemLocalMap(),
448 field_indices: ItemLocalMap(),
449 user_provided_tys: ItemLocalMap(),
450 user_provided_sigs: Default::default(),
451 node_types: ItemLocalMap(),
452 node_substs: ItemLocalMap(),
453 user_substs: ItemLocalMap(),
454 adjustments: ItemLocalMap(),
455 pat_binding_modes: ItemLocalMap(),
456 pat_adjustments: ItemLocalMap(),
457 upvar_capture_map: Default::default(),
458 closure_kind_origins: ItemLocalMap(),
459 liberated_fn_sigs: ItemLocalMap(),
460 fru_field_types: ItemLocalMap(),
461 cast_kinds: ItemLocalMap(),
462 used_trait_imports: Lrc::new(DefIdSet()),
463 tainted_by_errors: false,
464 free_region_map: Default::default(),
465 concrete_existential_types: Default::default(),
469 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
470 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
472 hir::QPath::Resolved(_, ref path) => path.def,
473 hir::QPath::TypeRelative(..) => {
474 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
475 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
480 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
481 LocalTableInContext {
482 local_id_root: self.local_id_root,
483 data: &self.type_dependent_defs
487 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
488 LocalTableInContextMut {
489 local_id_root: self.local_id_root,
490 data: &mut self.type_dependent_defs
494 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
495 LocalTableInContext {
496 local_id_root: self.local_id_root,
497 data: &self.field_indices
501 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
502 LocalTableInContextMut {
503 local_id_root: self.local_id_root,
504 data: &mut self.field_indices
508 pub fn user_provided_tys(&self) -> LocalTableInContext<'_, CanonicalTy<'tcx>> {
509 LocalTableInContext {
510 local_id_root: self.local_id_root,
511 data: &self.user_provided_tys
515 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalTy<'tcx>> {
516 LocalTableInContextMut {
517 local_id_root: self.local_id_root,
518 data: &mut self.user_provided_tys
522 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
523 LocalTableInContext {
524 local_id_root: self.local_id_root,
525 data: &self.node_types
529 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
530 LocalTableInContextMut {
531 local_id_root: self.local_id_root,
532 data: &mut self.node_types
536 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
537 self.node_id_to_type_opt(id).unwrap_or_else(||
538 bug!("node_id_to_type: no type for node `{}`",
540 let id = tcx.hir.hir_to_node_id(id);
541 tcx.hir.node_to_string(id)
546 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
547 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
548 self.node_types.get(&id.local_id).cloned()
551 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
552 LocalTableInContextMut {
553 local_id_root: self.local_id_root,
554 data: &mut self.node_substs
558 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
559 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
560 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
563 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
564 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
565 self.node_substs.get(&id.local_id).cloned()
568 pub fn user_substs_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalUserSubsts<'tcx>> {
569 LocalTableInContextMut {
570 local_id_root: self.local_id_root,
571 data: &mut self.user_substs
575 pub fn user_substs(&self, id: hir::HirId) -> Option<CanonicalUserSubsts<'tcx>> {
576 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
577 self.user_substs.get(&id.local_id).cloned()
580 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
581 // doesn't provide type parameter substitutions.
582 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
583 self.node_id_to_type(pat.hir_id)
586 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
587 self.node_id_to_type_opt(pat.hir_id)
590 // Returns the type of an expression as a monotype.
592 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
593 // some cases, we insert `Adjustment` annotations such as auto-deref or
594 // auto-ref. The type returned by this function does not consider such
595 // adjustments. See `expr_ty_adjusted()` instead.
597 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
598 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
599 // instead of "fn(ty) -> T with T = isize".
600 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
601 self.node_id_to_type(expr.hir_id)
604 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
605 self.node_id_to_type_opt(expr.hir_id)
608 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
609 LocalTableInContext {
610 local_id_root: self.local_id_root,
611 data: &self.adjustments
615 pub fn adjustments_mut(&mut self)
616 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
617 LocalTableInContextMut {
618 local_id_root: self.local_id_root,
619 data: &mut self.adjustments
623 pub fn expr_adjustments(&self, expr: &hir::Expr)
624 -> &[ty::adjustment::Adjustment<'tcx>] {
625 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
626 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
629 /// Returns the type of `expr`, considering any `Adjustment`
630 /// entry recorded for that expression.
631 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
632 self.expr_adjustments(expr)
634 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
637 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
638 self.expr_adjustments(expr)
640 .map(|adj| adj.target)
641 .or_else(|| self.expr_ty_opt(expr))
644 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
645 // Only paths and method calls/overloaded operators have
646 // entries in type_dependent_defs, ignore the former here.
647 if let hir::ExprKind::Path(_) = expr.node {
651 match self.type_dependent_defs().get(expr.hir_id) {
652 Some(&Def::Method(_)) => true,
657 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
658 LocalTableInContext {
659 local_id_root: self.local_id_root,
660 data: &self.pat_binding_modes
664 pub fn pat_binding_modes_mut(&mut self)
665 -> LocalTableInContextMut<'_, BindingMode> {
666 LocalTableInContextMut {
667 local_id_root: self.local_id_root,
668 data: &mut self.pat_binding_modes
672 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
673 LocalTableInContext {
674 local_id_root: self.local_id_root,
675 data: &self.pat_adjustments,
679 pub fn pat_adjustments_mut(&mut self)
680 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
681 LocalTableInContextMut {
682 local_id_root: self.local_id_root,
683 data: &mut self.pat_adjustments,
687 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
688 self.upvar_capture_map[&upvar_id]
691 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
692 LocalTableInContext {
693 local_id_root: self.local_id_root,
694 data: &self.closure_kind_origins
698 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
699 LocalTableInContextMut {
700 local_id_root: self.local_id_root,
701 data: &mut self.closure_kind_origins
705 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
706 LocalTableInContext {
707 local_id_root: self.local_id_root,
708 data: &self.liberated_fn_sigs
712 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
713 LocalTableInContextMut {
714 local_id_root: self.local_id_root,
715 data: &mut self.liberated_fn_sigs
719 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
720 LocalTableInContext {
721 local_id_root: self.local_id_root,
722 data: &self.fru_field_types
726 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
727 LocalTableInContextMut {
728 local_id_root: self.local_id_root,
729 data: &mut self.fru_field_types
733 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
734 LocalTableInContext {
735 local_id_root: self.local_id_root,
736 data: &self.cast_kinds
740 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
741 LocalTableInContextMut {
742 local_id_root: self.local_id_root,
743 data: &mut self.cast_kinds
748 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
749 fn hash_stable<W: StableHasherResult>(&self,
750 hcx: &mut StableHashingContext<'a>,
751 hasher: &mut StableHasher<W>) {
752 let ty::TypeckTables {
754 ref type_dependent_defs,
756 ref user_provided_tys,
757 ref user_provided_sigs,
762 ref pat_binding_modes,
764 ref upvar_capture_map,
765 ref closure_kind_origins,
766 ref liberated_fn_sigs,
771 ref used_trait_imports,
774 ref concrete_existential_types,
777 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
778 type_dependent_defs.hash_stable(hcx, hasher);
779 field_indices.hash_stable(hcx, hasher);
780 user_provided_tys.hash_stable(hcx, hasher);
781 user_provided_sigs.hash_stable(hcx, hasher);
782 node_types.hash_stable(hcx, hasher);
783 node_substs.hash_stable(hcx, hasher);
784 user_substs.hash_stable(hcx, hasher);
785 adjustments.hash_stable(hcx, hasher);
786 pat_binding_modes.hash_stable(hcx, hasher);
787 pat_adjustments.hash_stable(hcx, hasher);
788 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
795 local_id_root.expect("trying to hash invalid TypeckTables");
797 let var_owner_def_id = DefId {
798 krate: local_id_root.krate,
801 let closure_def_id = DefId {
802 krate: local_id_root.krate,
803 index: closure_expr_id.to_def_id().index,
805 (hcx.def_path_hash(var_owner_def_id),
807 hcx.def_path_hash(closure_def_id))
810 closure_kind_origins.hash_stable(hcx, hasher);
811 liberated_fn_sigs.hash_stable(hcx, hasher);
812 fru_field_types.hash_stable(hcx, hasher);
813 cast_kinds.hash_stable(hcx, hasher);
814 used_trait_imports.hash_stable(hcx, hasher);
815 tainted_by_errors.hash_stable(hcx, hasher);
816 free_region_map.hash_stable(hcx, hasher);
817 concrete_existential_types.hash_stable(hcx, hasher);
822 impl<'tcx> CommonTypes<'tcx> {
823 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
824 // Ensure our type representation does not grow
825 #[cfg(target_pointer_width = "64")]
826 static_assert!(ASSERT_TY_KIND: ::std::mem::size_of::<ty::TyKind<'_>>() <= 24);
827 #[cfg(target_pointer_width = "64")]
828 static_assert!(ASSERT_TYS: ::std::mem::size_of::<ty::TyS<'_>>() <= 32);
830 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
831 let mk_region = |r| {
832 if let Some(r) = interners.region.borrow().get(&r) {
835 let r = interners.arena.alloc(r);
836 interners.region.borrow_mut().insert(Interned(r));
844 isize: mk(Int(ast::IntTy::Isize)),
845 i8: mk(Int(ast::IntTy::I8)),
846 i16: mk(Int(ast::IntTy::I16)),
847 i32: mk(Int(ast::IntTy::I32)),
848 i64: mk(Int(ast::IntTy::I64)),
849 i128: mk(Int(ast::IntTy::I128)),
850 usize: mk(Uint(ast::UintTy::Usize)),
851 u8: mk(Uint(ast::UintTy::U8)),
852 u16: mk(Uint(ast::UintTy::U16)),
853 u32: mk(Uint(ast::UintTy::U32)),
854 u64: mk(Uint(ast::UintTy::U64)),
855 u128: mk(Uint(ast::UintTy::U128)),
856 f32: mk(Float(ast::FloatTy::F32)),
857 f64: mk(Float(ast::FloatTy::F64)),
859 re_empty: mk_region(RegionKind::ReEmpty),
860 re_static: mk_region(RegionKind::ReStatic),
861 re_erased: mk_region(RegionKind::ReErased),
866 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
869 pub struct FreeRegionInfo {
870 // def id corresponding to FreeRegion
872 // the bound region corresponding to FreeRegion
873 pub boundregion: ty::BoundRegion,
874 // checks if bound region is in Impl Item
875 pub is_impl_item: bool,
878 /// The central data structure of the compiler. It stores references
879 /// to the various **arenas** and also houses the results of the
880 /// various **compiler queries** that have been performed. See the
881 /// [rustc guide] for more details.
883 /// [rustc guide]: https://rust-lang-nursery.github.io/rustc-guide/ty.html
884 #[derive(Copy, Clone)]
885 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
886 gcx: &'a GlobalCtxt<'gcx>,
887 interners: &'a CtxtInterners<'tcx>
890 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
891 type Target = &'a GlobalCtxt<'gcx>;
892 fn deref(&self) -> &Self::Target {
897 pub struct GlobalCtxt<'tcx> {
898 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
899 global_interners: CtxtInterners<'tcx>,
901 cstore: &'tcx CrateStoreDyn,
903 pub sess: &'tcx Session,
905 pub dep_graph: DepGraph,
907 /// Common types, pre-interned for your convenience.
908 pub types: CommonTypes<'tcx>,
910 /// Map indicating what traits are in scope for places where this
911 /// is relevant; generated by resolve.
912 trait_map: FxHashMap<DefIndex,
913 Lrc<FxHashMap<ItemLocalId,
914 Lrc<StableVec<TraitCandidate>>>>>,
916 /// Export map produced by name resolution.
917 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
919 pub hir: hir_map::Map<'tcx>,
921 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
922 /// as well as all upstream crates. Only populated in incremental mode.
923 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
925 pub(crate) queries: query::Queries<'tcx>,
927 // Records the free variables referenced by every closure
928 // expression. Do not track deps for this, just recompute it from
929 // scratch every time.
930 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
932 maybe_unused_trait_imports: FxHashSet<DefId>,
933 maybe_unused_extern_crates: Vec<(DefId, Span)>,
934 pub extern_prelude: FxHashMap<ast::Name, bool /* introduced by item */>,
936 // Internal cache for metadata decoding. No need to track deps on this.
937 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
939 /// Caches the results of trait selection. This cache is used
940 /// for things that do not have to do with the parameters in scope.
941 pub selection_cache: traits::SelectionCache<'tcx>,
943 /// Caches the results of trait evaluation. This cache is used
944 /// for things that do not have to do with the parameters in scope.
945 /// Merge this with `selection_cache`?
946 pub evaluation_cache: traits::EvaluationCache<'tcx>,
948 /// The definite name of the current crate after taking into account
949 /// attributes, commandline parameters, etc.
950 pub crate_name: Symbol,
952 /// Data layout specification for the current target.
953 pub data_layout: TargetDataLayout,
955 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
957 /// Stores the value of constants (and deduplicates the actual memory)
958 allocation_interner: Lock<FxHashSet<&'tcx Allocation>>,
960 pub alloc_map: Lock<interpret::AllocMap<'tcx, &'tcx Allocation>>,
962 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
964 /// A general purpose channel to throw data out the back towards LLVM worker
967 /// This is intended to only get used during the codegen phase of the compiler
968 /// when satisfying the query for a particular codegen unit. Internally in
969 /// the query it'll send data along this channel to get processed later.
970 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
972 output_filenames: Arc<OutputFilenames>,
975 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
976 /// Get the global TyCtxt.
978 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
981 interners: &self.gcx.global_interners,
985 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
986 self.global_arenas.generics.alloc(generics)
989 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
990 self.global_arenas.steal_mir.alloc(Steal::new(mir))
993 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
994 self.global_arenas.mir.alloc(mir)
997 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
998 self.global_arenas.tables.alloc(tables)
1001 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1002 self.global_arenas.trait_def.alloc(def)
1005 pub fn alloc_adt_def(self,
1008 variants: Vec<ty::VariantDef>,
1010 -> &'gcx ty::AdtDef {
1011 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1012 self.global_arenas.adt_def.alloc(def)
1015 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1016 if bytes.is_empty() {
1019 self.global_interners.arena.alloc_slice(bytes)
1023 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1024 -> &'tcx [&'tcx ty::Const<'tcx>] {
1025 if values.is_empty() {
1028 self.interners.arena.alloc_slice(values)
1032 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1033 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1034 if values.is_empty() {
1037 self.interners.arena.alloc_slice(values)
1041 pub fn intern_const_alloc(
1044 ) -> &'gcx Allocation {
1045 let allocs = &mut self.allocation_interner.borrow_mut();
1046 if let Some(alloc) = allocs.get(&alloc) {
1050 let interned = self.global_arenas.const_allocs.alloc(alloc);
1051 if let Some(prev) = allocs.replace(interned) { // insert into interner
1052 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1057 /// Allocates a byte or string literal for `mir::interpret`, read-only
1058 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1059 // create an allocation that just contains these bytes
1060 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1061 let alloc = self.intern_const_alloc(alloc);
1062 self.alloc_map.lock().allocate(alloc)
1065 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1066 let mut stability_interner = self.stability_interner.borrow_mut();
1067 if let Some(st) = stability_interner.get(&stab) {
1071 let interned = self.global_interners.arena.alloc(stab);
1072 if let Some(prev) = stability_interner.replace(interned) {
1073 bug!("Tried to overwrite interned Stability: {:?}", prev)
1078 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1079 let mut layout_interner = self.layout_interner.borrow_mut();
1080 if let Some(layout) = layout_interner.get(&layout) {
1084 let interned = self.global_arenas.layout.alloc(layout);
1085 if let Some(prev) = layout_interner.replace(interned) {
1086 bug!("Tried to overwrite interned Layout: {:?}", prev)
1091 /// Returns a range of the start/end indices specified with the
1092 /// `rustc_layout_scalar_valid_range` attribute.
1093 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1094 let attrs = self.get_attrs(def_id);
1096 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1098 None => return Bound::Unbounded,
1100 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1101 match meta.literal().expect("attribute takes lit").node {
1102 ast::LitKind::Int(a, _) => return Bound::Included(a),
1103 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1106 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1108 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1111 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1112 value.lift_to_tcx(self)
1115 /// Like lift, but only tries in the global tcx.
1116 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1117 value.lift_to_tcx(self.global_tcx())
1120 /// Returns true if self is the same as self.global_tcx().
1121 fn is_global(self) -> bool {
1122 let local = self.interners as *const _;
1123 let global = &self.global_interners as *const _;
1124 local as usize == global as usize
1127 /// Create a type context and call the closure with a `TyCtxt` reference
1128 /// to the context. The closure enforces that the type context and any interned
1129 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1130 /// reference to the context, to allow formatting values that need it.
1131 pub fn create_and_enter<F, R>(s: &'tcx Session,
1132 cstore: &'tcx CrateStoreDyn,
1133 local_providers: ty::query::Providers<'tcx>,
1134 extern_providers: ty::query::Providers<'tcx>,
1135 arenas: &'tcx AllArenas<'tcx>,
1136 resolutions: ty::Resolutions,
1137 hir: hir_map::Map<'tcx>,
1138 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1140 tx: mpsc::Sender<Box<dyn Any + Send>>,
1141 output_filenames: &OutputFilenames,
1143 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1145 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1148 let interners = CtxtInterners::new(&arenas.interner);
1149 let common_types = CommonTypes::new(&interners);
1150 let dep_graph = hir.dep_graph.clone();
1151 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1152 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1153 providers[LOCAL_CRATE] = local_providers;
1155 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1156 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1159 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1162 let def_path_tables = || {
1163 upstream_def_path_tables
1165 .map(|&(cnum, ref rc)| (cnum, &**rc))
1166 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1169 // Precompute the capacity of the hashmap so we don't have to
1170 // re-allocate when populating it.
1171 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1173 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1175 ::std::default::Default::default()
1178 for (cnum, def_path_table) in def_path_tables() {
1179 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1187 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1188 for (k, v) in resolutions.trait_map {
1189 let hir_id = hir.node_to_hir_id(k);
1190 let map = trait_map.entry(hir_id.owner).or_default();
1191 Lrc::get_mut(map).unwrap()
1192 .insert(hir_id.local_id,
1193 Lrc::new(StableVec::new(v)));
1196 let gcx = &GlobalCtxt {
1199 global_arenas: &arenas.global,
1200 global_interners: interners,
1201 dep_graph: dep_graph.clone(),
1202 types: common_types,
1204 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1207 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1208 (hir.local_def_id(k), Lrc::new(v))
1210 maybe_unused_trait_imports:
1211 resolutions.maybe_unused_trait_imports
1213 .map(|id| hir.local_def_id(id))
1215 maybe_unused_extern_crates:
1216 resolutions.maybe_unused_extern_crates
1218 .map(|(id, sp)| (hir.local_def_id(id), sp))
1220 extern_prelude: resolutions.extern_prelude,
1222 def_path_hash_to_def_id,
1223 queries: query::Queries::new(
1226 on_disk_query_result_cache,
1228 rcache: Default::default(),
1229 selection_cache: Default::default(),
1230 evaluation_cache: Default::default(),
1231 crate_name: Symbol::intern(crate_name),
1233 layout_interner: Default::default(),
1234 stability_interner: Default::default(),
1235 allocation_interner: Default::default(),
1236 alloc_map: Lock::new(interpret::AllocMap::new()),
1237 tx_to_llvm_workers: Lock::new(tx),
1238 output_filenames: Arc::new(output_filenames.clone()),
1241 sync::assert_send_val(&gcx);
1243 tls::enter_global(gcx, f)
1246 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1247 let cname = self.crate_name(LOCAL_CRATE).as_str();
1248 self.sess.consider_optimizing(&cname, msg)
1251 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1252 self.get_lib_features(LOCAL_CRATE)
1255 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1256 self.get_lang_items(LOCAL_CRATE)
1259 /// Due to missing llvm support for lowering 128 bit math to software emulation
1260 /// (on some targets), the lowering can be done in MIR.
1262 /// This function only exists until said support is implemented.
1263 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1264 let items = self.lang_items();
1265 let def_id = Some(def_id);
1266 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1267 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1268 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1269 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1270 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1271 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1272 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1273 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1274 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1275 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1276 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1277 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1278 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1279 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1280 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1281 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1282 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1283 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1284 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1285 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1286 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1287 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1288 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1289 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1293 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1294 self.stability_index(LOCAL_CRATE)
1297 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1298 self.all_crate_nums(LOCAL_CRATE)
1301 pub fn features(self) -> Lrc<feature_gate::Features> {
1302 self.features_query(LOCAL_CRATE)
1305 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1307 self.hir.def_key(id)
1309 self.cstore.def_key(id)
1313 /// Convert a `DefId` into its fully expanded `DefPath` (every
1314 /// `DefId` is really just an interned def-path).
1316 /// Note that if `id` is not local to this crate, the result will
1317 /// be a non-local `DefPath`.
1318 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1320 self.hir.def_path(id)
1322 self.cstore.def_path(id)
1327 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1328 if def_id.is_local() {
1329 self.hir.definitions().def_path_hash(def_id.index)
1331 self.cstore.def_path_hash(def_id)
1335 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1336 // We are explicitly not going through queries here in order to get
1337 // crate name and disambiguator since this code is called from debug!()
1338 // statements within the query system and we'd run into endless
1339 // recursion otherwise.
1340 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1341 (self.crate_name.clone(),
1342 self.sess.local_crate_disambiguator())
1344 (self.cstore.crate_name_untracked(def_id.krate),
1345 self.cstore.crate_disambiguator_untracked(def_id.krate))
1350 // Don't print the whole crate disambiguator. That's just
1351 // annoying in debug output.
1352 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1353 self.def_path(def_id).to_string_no_crate())
1356 pub fn metadata_encoding_version(self) -> Vec<u8> {
1357 self.cstore.metadata_encoding_version().to_vec()
1360 // Note that this is *untracked* and should only be used within the query
1361 // system if the result is otherwise tracked through queries
1362 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1363 self.cstore.crate_data_as_rc_any(cnum)
1366 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1367 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1369 StableHashingContext::new(self.sess,
1371 self.hir.definitions(),
1375 // This method makes sure that we have a DepNode and a Fingerprint for
1376 // every upstream crate. It needs to be called once right after the tcx is
1378 // With full-fledged red/green, the method will probably become unnecessary
1379 // as this will be done on-demand.
1380 pub fn allocate_metadata_dep_nodes(self) {
1381 // We cannot use the query versions of crates() and crate_hash(), since
1382 // those would need the DepNodes that we are allocating here.
1383 for cnum in self.cstore.crates_untracked() {
1384 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1385 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1386 self.dep_graph.with_task(dep_node,
1389 |_, x| x // No transformation needed
1394 // This method exercises the `in_scope_traits_map` query for all possible
1395 // values so that we have their fingerprints available in the DepGraph.
1396 // This is only required as long as we still use the old dependency tracking
1397 // which needs to have the fingerprints of all input nodes beforehand.
1398 pub fn precompute_in_scope_traits_hashes(self) {
1399 for &def_index in self.trait_map.keys() {
1400 self.in_scope_traits_map(def_index);
1404 pub fn serialize_query_result_cache<E>(self,
1406 -> Result<(), E::Error>
1407 where E: ty::codec::TyEncoder
1409 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1412 /// This checks whether one is allowed to have pattern bindings
1413 /// that bind-by-move on a match arm that has a guard, e.g.:
1416 /// match foo { A(inner) if { /* something */ } => ..., ... }
1419 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1420 /// because that method has a narrower effect that can be toggled
1421 /// off via a separate `-Z` flag, at least for the short term.
1422 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1423 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1426 /// If true, we should use a naive AST walk to determine if match
1427 /// guard could perform bad mutations (or mutable-borrows).
1428 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1429 // If someone requests the feature, then be a little more
1430 // careful and ensure that MIR-borrowck is enabled (which can
1431 // happen via edition selection, via `feature(nll)`, or via an
1432 // appropriate `-Z` flag) before disabling the mutation check.
1433 if self.allow_bind_by_move_patterns_with_guards() {
1440 /// If true, we should use the AST-based borrowck (we may *also* use
1441 /// the MIR-based borrowck).
1442 pub fn use_ast_borrowck(self) -> bool {
1443 self.borrowck_mode().use_ast()
1446 /// If true, we should use the MIR-based borrowck (we may *also* use
1447 /// the AST-based borrowck).
1448 pub fn use_mir_borrowck(self) -> bool {
1449 self.borrowck_mode().use_mir()
1452 /// If true, we should use the MIR-based borrow check, but also
1453 /// fall back on the AST borrow check if the MIR-based one errors.
1454 pub fn migrate_borrowck(self) -> bool {
1455 self.borrowck_mode().migrate()
1458 /// If true, make MIR codegen for `match` emit a temp that holds a
1459 /// borrow of the input to the match expression.
1460 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1461 self.emit_read_for_match()
1464 /// If true, make MIR codegen for `match` emit FakeRead
1465 /// statements (which simulate the maximal effect of executing the
1466 /// patterns in a match arm).
1467 pub fn emit_read_for_match(&self) -> bool {
1468 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1471 /// If true, pattern variables for use in guards on match arms
1472 /// will be bound as references to the data, and occurrences of
1473 /// those variables in the guard expression will implicitly
1474 /// dereference those bindings. (See rust-lang/rust#27282.)
1475 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1476 self.borrowck_mode().use_mir()
1479 /// If true, we should enable two-phase borrows checks. This is
1480 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1481 /// or by opting into an edition after 2015.
1482 pub fn two_phase_borrows(self) -> bool {
1483 if self.features().nll || self.sess.opts.debugging_opts.two_phase_borrows {
1487 match self.sess.edition() {
1488 Edition::Edition2015 => false,
1489 Edition::Edition2018 => true,
1494 /// What mode(s) of borrowck should we run? AST? MIR? both?
1495 /// (Also considers the `#![feature(nll)]` setting.)
1496 pub fn borrowck_mode(&self) -> BorrowckMode {
1497 // Here are the main constraints we need to deal with:
1499 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1500 // synonymous with no `-Z borrowck=...` flag at all.
1501 // (This is arguably a historical accident.)
1503 // 2. `BorrowckMode::Migrate` is the limited migration to
1504 // NLL that we are deploying with the 2018 edition.
1506 // 3. We want to allow developers on the Nightly channel
1507 // to opt back into the "hard error" mode for NLL,
1508 // (which they can do via specifying `#![feature(nll)]`
1509 // explicitly in their crate).
1511 // So, this precedence list is how pnkfelix chose to work with
1512 // the above constraints:
1514 // * `#![feature(nll)]` *always* means use NLL with hard
1515 // errors. (To simplify the code here, it now even overrides
1516 // a user's attempt to specify `-Z borrowck=compare`, which
1517 // we arguably do not need anymore and should remove.)
1519 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1520 // if `borrowck=ast` was specified), then use the default
1521 // as required by the edition.
1523 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1525 if self.features().nll { return BorrowckMode::Mir; }
1527 match self.sess.opts.borrowck_mode {
1528 mode @ BorrowckMode::Mir |
1529 mode @ BorrowckMode::Compare |
1530 mode @ BorrowckMode::Migrate => mode,
1532 BorrowckMode::Ast => match self.sess.edition() {
1533 Edition::Edition2015 => BorrowckMode::Ast,
1534 Edition::Edition2018 => BorrowckMode::Migrate,
1536 // For now, future editions mean Migrate. (But it
1537 // would make a lot of sense for it to be changed to
1538 // `BorrowckMode::Mir`, depending on how we plan to
1539 // time the forcing of full migration to NLL.)
1540 _ => BorrowckMode::Migrate,
1545 /// Should we emit EndRegion MIR statements? These are consumed by
1546 /// MIR borrowck, but not when NLL is used. They are also consumed
1547 /// by the validation stuff.
1548 pub fn emit_end_regions(self) -> bool {
1549 self.sess.opts.debugging_opts.emit_end_regions ||
1550 self.sess.opts.debugging_opts.mir_emit_validate > 0 ||
1551 self.use_mir_borrowck()
1555 pub fn local_crate_exports_generics(self) -> bool {
1556 debug_assert!(self.sess.opts.share_generics());
1558 self.sess.crate_types.borrow().iter().any(|crate_type| {
1560 CrateType::Executable |
1561 CrateType::Staticlib |
1562 CrateType::ProcMacro |
1563 CrateType::Cdylib => false,
1565 CrateType::Dylib => true,
1570 // This method returns the DefId and the BoundRegion corresponding to the given region.
1571 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1572 let (suitable_region_binding_scope, bound_region) = match *region {
1573 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1574 ty::ReEarlyBound(ref ebr) => (
1575 self.parent_def_id(ebr.def_id).unwrap(),
1576 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1578 _ => return None, // not a free region
1581 let node_id = self.hir
1582 .as_local_node_id(suitable_region_binding_scope)
1584 let is_impl_item = match self.hir.find(node_id) {
1585 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1586 Some(Node::ImplItem(..)) => {
1587 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1592 return Some(FreeRegionInfo {
1593 def_id: suitable_region_binding_scope,
1594 boundregion: bound_region,
1595 is_impl_item: is_impl_item,
1599 pub fn return_type_impl_trait(
1601 scope_def_id: DefId,
1602 ) -> Option<Ty<'tcx>> {
1603 let ret_ty = self.type_of(scope_def_id);
1605 ty::FnDef(_, _) => {
1606 let sig = ret_ty.fn_sig(*self);
1607 let output = self.erase_late_bound_regions(&sig.output());
1608 if output.is_impl_trait() {
1618 // Here we check if the bound region is in Impl Item.
1619 pub fn is_bound_region_in_impl_item(
1621 suitable_region_binding_scope: DefId,
1623 let container_id = self.associated_item(suitable_region_binding_scope)
1626 if self.impl_trait_ref(container_id).is_some() {
1627 // For now, we do not try to target impls of traits. This is
1628 // because this message is going to suggest that the user
1629 // change the fn signature, but they may not be free to do so,
1630 // since the signature must match the trait.
1632 // FIXME(#42706) -- in some cases, we could do better here.
1639 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1640 pub fn encode_metadata(self)
1643 self.cstore.encode_metadata(self)
1647 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1648 /// Call the closure with a local `TyCtxt` using the given arena.
1649 pub fn enter_local<F, R>(
1651 arena: &'tcx SyncDroplessArena,
1655 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1657 let interners = CtxtInterners::new(arena);
1660 interners: &interners,
1662 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1663 let new_icx = ty::tls::ImplicitCtxt {
1665 query: icx.query.clone(),
1666 layout_depth: icx.layout_depth,
1669 ty::tls::enter_context(&new_icx, |new_icx| {
1676 /// A trait implemented for all X<'a> types which can be safely and
1677 /// efficiently converted to X<'tcx> as long as they are part of the
1678 /// provided TyCtxt<'tcx>.
1679 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1680 /// by looking them up in their respective interners.
1682 /// However, this is still not the best implementation as it does
1683 /// need to compare the components, even for interned values.
1684 /// It would be more efficient if TypedArena provided a way to
1685 /// determine whether the address is in the allocated range.
1687 /// None is returned if the value or one of the components is not part
1688 /// of the provided context.
1689 /// For Ty, None can be returned if either the type interner doesn't
1690 /// contain the TyKind key or if the address of the interned
1691 /// pointer differs. The latter case is possible if a primitive type,
1692 /// e.g. `()` or `u8`, was interned in a different context.
1693 pub trait Lift<'tcx>: fmt::Debug {
1694 type Lifted: fmt::Debug + 'tcx;
1695 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1698 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1699 type Lifted = Ty<'tcx>;
1700 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1701 if tcx.interners.arena.in_arena(*self as *const _) {
1702 return Some(unsafe { mem::transmute(*self) });
1704 // Also try in the global tcx if we're not that.
1705 if !tcx.is_global() {
1706 self.lift_to_tcx(tcx.global_tcx())
1713 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1714 type Lifted = Region<'tcx>;
1715 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1716 if tcx.interners.arena.in_arena(*self as *const _) {
1717 return Some(unsafe { mem::transmute(*self) });
1719 // Also try in the global tcx if we're not that.
1720 if !tcx.is_global() {
1721 self.lift_to_tcx(tcx.global_tcx())
1728 impl<'a, 'tcx> Lift<'tcx> for Goal<'a> {
1729 type Lifted = Goal<'tcx>;
1730 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Goal<'tcx>> {
1731 if tcx.interners.arena.in_arena(*self as *const _) {
1732 return Some(unsafe { mem::transmute(*self) });
1734 // Also try in the global tcx if we're not that.
1735 if !tcx.is_global() {
1736 self.lift_to_tcx(tcx.global_tcx())
1743 impl<'a, 'tcx> Lift<'tcx> for &'a List<Goal<'a>> {
1744 type Lifted = &'tcx List<Goal<'tcx>>;
1745 fn lift_to_tcx<'b, 'gcx>(
1747 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1748 ) -> Option<&'tcx List<Goal<'tcx>>> {
1749 if tcx.interners.arena.in_arena(*self as *const _) {
1750 return Some(unsafe { mem::transmute(*self) });
1752 // Also try in the global tcx if we're not that.
1753 if !tcx.is_global() {
1754 self.lift_to_tcx(tcx.global_tcx())
1761 impl<'a, 'tcx> Lift<'tcx> for &'a List<Clause<'a>> {
1762 type Lifted = &'tcx List<Clause<'tcx>>;
1763 fn lift_to_tcx<'b, 'gcx>(
1765 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1766 ) -> Option<&'tcx List<Clause<'tcx>>> {
1767 if tcx.interners.arena.in_arena(*self as *const _) {
1768 return Some(unsafe { mem::transmute(*self) });
1770 // Also try in the global tcx if we're not that.
1771 if !tcx.is_global() {
1772 self.lift_to_tcx(tcx.global_tcx())
1779 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1780 type Lifted = &'tcx Const<'tcx>;
1781 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1782 if tcx.interners.arena.in_arena(*self as *const _) {
1783 return Some(unsafe { mem::transmute(*self) });
1785 // Also try in the global tcx if we're not that.
1786 if !tcx.is_global() {
1787 self.lift_to_tcx(tcx.global_tcx())
1794 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1795 type Lifted = &'tcx Substs<'tcx>;
1796 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1797 if self.len() == 0 {
1798 return Some(List::empty());
1800 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1801 return Some(unsafe { mem::transmute(*self) });
1803 // Also try in the global tcx if we're not that.
1804 if !tcx.is_global() {
1805 self.lift_to_tcx(tcx.global_tcx())
1812 impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>> {
1813 type Lifted = &'tcx List<Ty<'tcx>>;
1814 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1815 -> Option<&'tcx List<Ty<'tcx>>> {
1816 if self.len() == 0 {
1817 return Some(List::empty());
1819 if tcx.interners.arena.in_arena(*self as *const _) {
1820 return Some(unsafe { mem::transmute(*self) });
1822 // Also try in the global tcx if we're not that.
1823 if !tcx.is_global() {
1824 self.lift_to_tcx(tcx.global_tcx())
1831 impl<'a, 'tcx> Lift<'tcx> for &'a List<ExistentialPredicate<'a>> {
1832 type Lifted = &'tcx List<ExistentialPredicate<'tcx>>;
1833 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1834 -> Option<&'tcx List<ExistentialPredicate<'tcx>>> {
1835 if self.is_empty() {
1836 return Some(List::empty());
1838 if tcx.interners.arena.in_arena(*self as *const _) {
1839 return Some(unsafe { mem::transmute(*self) });
1841 // Also try in the global tcx if we're not that.
1842 if !tcx.is_global() {
1843 self.lift_to_tcx(tcx.global_tcx())
1850 impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>> {
1851 type Lifted = &'tcx List<Predicate<'tcx>>;
1852 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1853 -> Option<&'tcx List<Predicate<'tcx>>> {
1854 if self.is_empty() {
1855 return Some(List::empty());
1857 if tcx.interners.arena.in_arena(*self as *const _) {
1858 return Some(unsafe { mem::transmute(*self) });
1860 // Also try in the global tcx if we're not that.
1861 if !tcx.is_global() {
1862 self.lift_to_tcx(tcx.global_tcx())
1869 impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo> {
1870 type Lifted = &'tcx List<CanonicalVarInfo>;
1871 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1872 if self.len() == 0 {
1873 return Some(List::empty());
1875 if tcx.interners.arena.in_arena(*self as *const _) {
1876 return Some(unsafe { mem::transmute(*self) });
1878 // Also try in the global tcx if we're not that.
1879 if !tcx.is_global() {
1880 self.lift_to_tcx(tcx.global_tcx())
1888 use super::{GlobalCtxt, TyCtxt};
1894 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1895 use rustc_data_structures::OnDrop;
1896 use rustc_data_structures::sync::{self, Lrc, Lock};
1897 use dep_graph::OpenTask;
1899 #[cfg(not(parallel_queries))]
1900 use std::cell::Cell;
1902 #[cfg(parallel_queries)]
1905 /// This is the implicit state of rustc. It contains the current
1906 /// TyCtxt and query. It is updated when creating a local interner or
1907 /// executing a new query. Whenever there's a TyCtxt value available
1908 /// you should also have access to an ImplicitCtxt through the functions
1911 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1912 /// The current TyCtxt. Initially created by `enter_global` and updated
1913 /// by `enter_local` with a new local interner
1914 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1916 /// The current query job, if any. This is updated by start_job in
1917 /// ty::query::plumbing when executing a query
1918 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1920 /// Used to prevent layout from recursing too deeply.
1921 pub layout_depth: usize,
1923 /// The current dep graph task. This is used to add dependencies to queries
1924 /// when executing them
1925 pub task: &'a OpenTask,
1928 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1929 /// to `value` during the call to `f`. It is restored to its previous value after.
1930 /// This is used to set the pointer to the new ImplicitCtxt.
1931 #[cfg(parallel_queries)]
1932 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1933 rayon_core::tlv::with(value, f)
1936 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1937 /// This is used to get the pointer to the current ImplicitCtxt.
1938 #[cfg(parallel_queries)]
1939 fn get_tlv() -> usize {
1940 rayon_core::tlv::get()
1943 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1944 #[cfg(not(parallel_queries))]
1945 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1947 /// Sets TLV to `value` during the call to `f`.
1948 /// It is restored to its previous value after.
1949 /// This is used to set the pointer to the new ImplicitCtxt.
1950 #[cfg(not(parallel_queries))]
1951 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1952 let old = get_tlv();
1953 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1954 TLV.with(|tlv| tlv.set(value));
1958 /// This is used to get the pointer to the current ImplicitCtxt.
1959 #[cfg(not(parallel_queries))]
1960 fn get_tlv() -> usize {
1961 TLV.with(|tlv| tlv.get())
1964 /// This is a callback from libsyntax as it cannot access the implicit state
1965 /// in librustc otherwise
1966 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1968 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1972 /// This is a callback from libsyntax as it cannot access the implicit state
1973 /// in librustc otherwise. It is used to when diagnostic messages are
1974 /// emitted and stores them in the current query, if there is one.
1975 fn track_diagnostic(diagnostic: &Diagnostic) {
1976 with_context_opt(|icx| {
1977 if let Some(icx) = icx {
1978 if let Some(ref query) = icx.query {
1979 query.diagnostics.lock().push(diagnostic.clone());
1985 /// Sets up the callbacks from libsyntax on the current thread
1986 pub fn with_thread_locals<F, R>(f: F) -> R
1987 where F: FnOnce() -> R
1989 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1990 let original_span_debug = span_dbg.get();
1991 span_dbg.set(span_debug);
1993 let _on_drop = OnDrop(move || {
1994 span_dbg.set(original_span_debug);
1997 TRACK_DIAGNOSTICS.with(|current| {
1998 let original = current.get();
1999 current.set(track_diagnostic);
2001 let _on_drop = OnDrop(move || {
2002 current.set(original);
2010 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
2011 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
2013 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2015 set_tlv(context as *const _ as usize, || {
2020 /// Enters GlobalCtxt by setting up libsyntax callbacks and
2021 /// creating a initial TyCtxt and ImplicitCtxt.
2022 /// This happens once per rustc session and TyCtxts only exists
2023 /// inside the `f` function.
2024 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
2025 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
2027 with_thread_locals(|| {
2028 // Update GCX_PTR to indicate there's a GlobalCtxt available
2029 GCX_PTR.with(|lock| {
2030 *lock.lock() = gcx as *const _ as usize;
2032 // Set GCX_PTR back to 0 when we exit
2033 let _on_drop = OnDrop(move || {
2034 GCX_PTR.with(|lock| *lock.lock() = 0);
2039 interners: &gcx.global_interners,
2041 let icx = ImplicitCtxt {
2045 task: &OpenTask::Ignore,
2047 enter_context(&icx, |_| {
2053 /// Stores a pointer to the GlobalCtxt if one is available.
2054 /// This is used to access the GlobalCtxt in the deadlock handler
2056 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2058 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2059 /// This is used in the deadlock handler.
2060 pub unsafe fn with_global<F, R>(f: F) -> R
2061 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2063 let gcx = GCX_PTR.with(|lock| *lock.lock());
2065 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2068 interners: &gcx.global_interners,
2070 let icx = ImplicitCtxt {
2074 task: &OpenTask::Ignore,
2076 enter_context(&icx, |_| f(tcx))
2079 /// Allows access to the current ImplicitCtxt in a closure if one is available
2080 pub fn with_context_opt<F, R>(f: F) -> R
2081 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2083 let context = get_tlv();
2087 // We could get a ImplicitCtxt pointer from another thread.
2088 // Ensure that ImplicitCtxt is Sync
2089 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2091 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2095 /// Allows access to the current ImplicitCtxt.
2096 /// Panics if there is no ImplicitCtxt available
2097 pub fn with_context<F, R>(f: F) -> R
2098 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2100 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2103 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2104 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2105 /// with the same 'gcx lifetime as the TyCtxt passed in.
2106 /// This will panic if you pass it a TyCtxt which has a different global interner from
2107 /// the current ImplicitCtxt's tcx field.
2108 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2109 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2111 with_context(|context| {
2113 let gcx = tcx.gcx as *const _ as usize;
2114 assert!(context.tcx.gcx as *const _ as usize == gcx);
2115 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2121 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2122 /// interner and local interner as the tcx argument passed in. This means the closure
2123 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2124 /// This will panic if you pass it a TyCtxt which has a different global interner or
2125 /// a different local interner from the current ImplicitCtxt's tcx field.
2126 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2127 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2129 with_context(|context| {
2131 let gcx = tcx.gcx as *const _ as usize;
2132 let interners = tcx.interners as *const _ as usize;
2133 assert!(context.tcx.gcx as *const _ as usize == gcx);
2134 assert!(context.tcx.interners as *const _ as usize == interners);
2135 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2141 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2142 /// Panics if there is no ImplicitCtxt available
2143 pub fn with<F, R>(f: F) -> R
2144 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2146 with_context(|context| f(context.tcx))
2149 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2150 /// The closure is passed None if there is no ImplicitCtxt available
2151 pub fn with_opt<F, R>(f: F) -> R
2152 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2154 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2158 macro_rules! sty_debug_print {
2159 ($ctxt: expr, $($variant: ident),*) => {{
2160 // curious inner module to allow variant names to be used as
2162 #[allow(non_snake_case)]
2164 use ty::{self, TyCtxt};
2165 use ty::context::Interned;
2167 #[derive(Copy, Clone)]
2170 region_infer: usize,
2175 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2176 let mut total = DebugStat {
2178 region_infer: 0, ty_infer: 0, both_infer: 0,
2180 $(let mut $variant = total;)*
2182 for &Interned(t) in tcx.interners.type_.borrow().iter() {
2183 let variant = match t.sty {
2184 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2185 ty::Float(..) | ty::Str | ty::Never => continue,
2186 ty::Error => /* unimportant */ continue,
2187 $(ty::$variant(..) => &mut $variant,)*
2189 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2190 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2194 if region { total.region_infer += 1; variant.region_infer += 1 }
2195 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2196 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2198 println!("Ty interner total ty region both");
2199 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2200 {ty:4.1}% {region:5.1}% {both:4.1}%",
2201 stringify!($variant),
2202 uses = $variant.total,
2203 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2204 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2205 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2206 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2208 println!(" total {uses:6} \
2209 {ty:4.1}% {region:5.1}% {both:4.1}%",
2211 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2212 region = total.region_infer as f64 * 100.0 / total.total as f64,
2213 both = total.both_infer as f64 * 100.0 / total.total as f64)
2221 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2222 pub fn print_debug_stats(self) {
2225 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr,
2226 Generator, GeneratorWitness, Dynamic, Closure, Tuple,
2227 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2229 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2230 println!("Region interner: #{}", self.interners.region.borrow().len());
2231 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2232 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2233 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2238 /// An entry in an interner.
2239 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2241 // NB: An Interned<Ty> compares and hashes as a sty.
2242 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2243 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2244 self.0.sty == other.0.sty
2248 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2250 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2251 fn hash<H: Hasher>(&self, s: &mut H) {
2256 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2257 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2262 // NB: An Interned<List<T>> compares and hashes as its elements.
2263 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2264 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2265 self.0[..] == other.0[..]
2269 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2271 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2272 fn hash<H: Hasher>(&self, s: &mut H) {
2277 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2278 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2283 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2284 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2289 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2290 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2295 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2296 fn borrow<'a>(&'a self) -> &'a RegionKind {
2301 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2302 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2307 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2308 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2309 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2314 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2315 for Interned<'tcx, List<Predicate<'tcx>>> {
2316 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2321 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2322 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2327 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2328 for Interned<'tcx, List<Clause<'tcx>>> {
2329 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2334 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2335 for Interned<'tcx, List<Goal<'tcx>>> {
2336 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2341 macro_rules! intern_method {
2342 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2345 $keep_in_local_tcx:expr) -> $ty:ty) => {
2346 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2347 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2348 let key = ($alloc_to_key)(&v);
2350 // HACK(eddyb) Depend on flags being accurate to
2351 // determine that all contents are in the global tcx.
2352 // See comments on Lift for why we can't use that.
2353 if ($keep_in_local_tcx)(&v) {
2354 let mut interner = self.interners.$name.borrow_mut();
2355 if let Some(&Interned(v)) = interner.get(key) {
2359 // Make sure we don't end up with inference
2360 // types/regions in the global tcx.
2361 if self.is_global() {
2362 bug!("Attempted to intern `{:?}` which contains \
2363 inference types/regions in the global type context",
2367 let i = $alloc_method(&self.interners.arena, v);
2368 interner.insert(Interned(i));
2371 let mut interner = self.global_interners.$name.borrow_mut();
2372 if let Some(&Interned(v)) = interner.get(key) {
2376 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2380 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2382 let i = unsafe { mem::transmute(i) };
2383 interner.insert(Interned(i));
2391 macro_rules! direct_interners {
2392 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2393 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2394 fn eq(&self, other: &Self) -> bool {
2399 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2401 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2402 fn hash<H: Hasher>(&self, s: &mut H) {
2410 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2412 $keep_in_local_tcx) -> $ty);)+
2416 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2417 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2420 direct_interners!('tcx,
2421 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2422 const_: mk_const(|c: &Const<'_>| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>,
2423 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>
2426 macro_rules! slice_interners {
2427 ($($field:ident: $method:ident($ty:ident)),+) => (
2428 $(intern_method!( 'tcx, $field: $method(
2430 |a, v| List::from_arena(a, v),
2432 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2437 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2438 predicates: _intern_predicates(Predicate),
2439 type_list: _intern_type_list(Ty),
2440 substs: _intern_substs(Kind),
2441 clauses: _intern_clauses(Clause),
2442 goal_list: _intern_goals(Goal)
2445 // This isn't a perfect fit: CanonicalVarInfo slices are always
2446 // allocated in the global arena, so this `intern_method!` macro is
2447 // overly general. But we just return false for the code that checks
2448 // whether they belong in the thread-local arena, so no harm done, and
2449 // seems better than open-coding the rest.
2452 canonical_var_infos: _intern_canonical_var_infos(
2453 &[CanonicalVarInfo],
2454 |a, v| List::from_arena(a, v),
2456 |_xs: &[CanonicalVarInfo]| -> bool { false }
2457 ) -> List<CanonicalVarInfo>
2460 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2461 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2462 /// that is, a `fn` type that is equivalent in every way for being
2464 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2465 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2466 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2467 unsafety: hir::Unsafety::Unsafe,
2472 /// Given a closure signature `sig`, returns an equivalent `fn`
2473 /// type with the same signature. Detuples and so forth -- so
2474 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2475 /// a `fn(u32, i32)`.
2476 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2477 let converted_sig = sig.map_bound(|s| {
2478 let params_iter = match s.inputs()[0].sty {
2479 ty::Tuple(params) => {
2480 params.into_iter().cloned()
2488 hir::Unsafety::Normal,
2493 self.mk_fn_ptr(converted_sig)
2496 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2497 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2500 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2502 ast::IntTy::Isize => self.types.isize,
2503 ast::IntTy::I8 => self.types.i8,
2504 ast::IntTy::I16 => self.types.i16,
2505 ast::IntTy::I32 => self.types.i32,
2506 ast::IntTy::I64 => self.types.i64,
2507 ast::IntTy::I128 => self.types.i128,
2511 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2513 ast::UintTy::Usize => self.types.usize,
2514 ast::UintTy::U8 => self.types.u8,
2515 ast::UintTy::U16 => self.types.u16,
2516 ast::UintTy::U32 => self.types.u32,
2517 ast::UintTy::U64 => self.types.u64,
2518 ast::UintTy::U128 => self.types.u128,
2522 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2524 ast::FloatTy::F32 => self.types.f32,
2525 ast::FloatTy::F64 => self.types.f64,
2529 pub fn mk_str(self) -> Ty<'tcx> {
2533 pub fn mk_static_str(self) -> Ty<'tcx> {
2534 self.mk_imm_ref(self.types.re_static, self.mk_str())
2537 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2538 // take a copy of substs so that we own the vectors inside
2539 self.mk_ty(Adt(def, substs))
2542 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2543 self.mk_ty(Foreign(def_id))
2546 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2547 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2548 let adt_def = self.adt_def(def_id);
2549 let substs = Substs::for_item(self, def_id, |param, substs| {
2551 GenericParamDefKind::Lifetime => bug!(),
2552 GenericParamDefKind::Type { has_default, .. } => {
2553 if param.index == 0 {
2556 assert!(has_default);
2557 self.type_of(param.def_id).subst(self, substs).into()
2562 self.mk_ty(Adt(adt_def, substs))
2565 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2566 self.mk_ty(RawPtr(tm))
2569 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2570 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2573 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2574 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2577 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2578 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2581 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2582 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2585 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2586 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2589 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2590 self.mk_imm_ptr(self.mk_unit())
2593 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2594 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2597 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2598 self.mk_ty(Slice(ty))
2601 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2602 self.mk_ty(Tuple(self.intern_type_list(ts)))
2605 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2606 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2609 pub fn mk_unit(self) -> Ty<'tcx> {
2610 self.intern_tup(&[])
2613 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2614 if self.features().never_type {
2617 self.intern_tup(&[])
2621 pub fn mk_bool(self) -> Ty<'tcx> {
2625 pub fn mk_fn_def(self, def_id: DefId,
2626 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2627 self.mk_ty(FnDef(def_id, substs))
2630 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2631 self.mk_ty(FnPtr(fty))
2636 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2637 reg: ty::Region<'tcx>
2639 self.mk_ty(Dynamic(obj, reg))
2642 pub fn mk_projection(self,
2644 substs: &'tcx Substs<'tcx>)
2646 self.mk_ty(Projection(ProjectionTy {
2652 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2654 self.mk_ty(Closure(closure_id, closure_substs))
2657 pub fn mk_generator(self,
2659 generator_substs: GeneratorSubsts<'tcx>,
2660 movability: hir::GeneratorMovability)
2662 self.mk_ty(Generator(id, generator_substs, movability))
2665 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2666 self.mk_ty(GeneratorWitness(types))
2669 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2670 self.mk_infer(TyVar(v))
2673 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2674 self.mk_infer(IntVar(v))
2677 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2678 self.mk_infer(FloatVar(v))
2681 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2682 self.mk_ty(Infer(it))
2685 pub fn mk_ty_param(self,
2687 name: InternedString) -> Ty<'tcx> {
2688 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2691 pub fn mk_self_type(self) -> Ty<'tcx> {
2692 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2695 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2697 GenericParamDefKind::Lifetime => {
2698 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2700 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2704 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2705 self.mk_ty(Opaque(def_id, substs))
2708 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2709 -> &'tcx List<ExistentialPredicate<'tcx>> {
2710 assert!(!eps.is_empty());
2711 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2712 self._intern_existential_predicates(eps)
2715 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2716 -> &'tcx List<Predicate<'tcx>> {
2717 // FIXME consider asking the input slice to be sorted to avoid
2718 // re-interning permutations, in which case that would be asserted
2720 if preds.len() == 0 {
2721 // The macro-generated method below asserts we don't intern an empty slice.
2724 self._intern_predicates(preds)
2728 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2732 self._intern_type_list(ts)
2736 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2740 self._intern_substs(ts)
2744 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2748 self.global_tcx()._intern_canonical_var_infos(ts)
2752 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2756 self._intern_clauses(ts)
2760 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2764 self._intern_goals(ts)
2768 pub fn mk_fn_sig<I>(self,
2772 unsafety: hir::Unsafety,
2774 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2776 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2778 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2779 inputs_and_output: self.intern_type_list(xs),
2780 variadic, unsafety, abi
2784 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2785 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2787 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2790 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2791 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2793 iter.intern_with(|xs| self.intern_predicates(xs))
2796 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2797 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2798 iter.intern_with(|xs| self.intern_type_list(xs))
2801 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2802 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2803 iter.intern_with(|xs| self.intern_substs(xs))
2806 pub fn mk_substs_trait(self,
2808 rest: &[Kind<'tcx>])
2809 -> &'tcx Substs<'tcx>
2811 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2814 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2815 iter.intern_with(|xs| self.intern_clauses(xs))
2818 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2819 iter.intern_with(|xs| self.intern_goals(xs))
2822 pub fn lint_hir<S: Into<MultiSpan>>(self,
2823 lint: &'static Lint,
2827 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2830 pub fn lint_node<S: Into<MultiSpan>>(self,
2831 lint: &'static Lint,
2835 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2838 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2839 lint: &'static Lint,
2844 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2849 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2850 lint: &'static Lint,
2855 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2860 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2861 -> (lint::Level, lint::LintSource)
2863 // Right now we insert a `with_ignore` node in the dep graph here to
2864 // ignore the fact that `lint_levels` below depends on the entire crate.
2865 // For now this'll prevent false positives of recompiling too much when
2866 // anything changes.
2868 // Once red/green incremental compilation lands we should be able to
2869 // remove this because while the crate changes often the lint level map
2870 // will change rarely.
2871 self.dep_graph.with_ignore(|| {
2872 let sets = self.lint_levels(LOCAL_CRATE);
2874 let hir_id = self.hir.definitions().node_to_hir_id(id);
2875 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2878 let next = self.hir.get_parent_node(id);
2880 bug!("lint traversal reached the root of the crate");
2887 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2888 lint: &'static Lint,
2892 -> DiagnosticBuilder<'tcx>
2894 let node_id = self.hir.hir_to_node_id(hir_id);
2895 let (level, src) = self.lint_level_at_node(lint, node_id);
2896 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2899 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2900 lint: &'static Lint,
2904 -> DiagnosticBuilder<'tcx>
2906 let (level, src) = self.lint_level_at_node(lint, id);
2907 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2910 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2911 -> DiagnosticBuilder<'tcx>
2913 let (level, src) = self.lint_level_at_node(lint, id);
2914 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2917 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2918 self.in_scope_traits_map(id.owner)
2919 .and_then(|map| map.get(&id.local_id).cloned())
2922 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2923 self.named_region_map(id.owner)
2924 .and_then(|map| map.get(&id.local_id).cloned())
2927 pub fn is_late_bound(self, id: HirId) -> bool {
2928 self.is_late_bound_map(id.owner)
2929 .map(|set| set.contains(&id.local_id))
2933 pub fn object_lifetime_defaults(self, id: HirId)
2934 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2936 self.object_lifetime_defaults_map(id.owner)
2937 .and_then(|map| map.get(&id.local_id).cloned())
2941 pub trait InternAs<T: ?Sized, R> {
2943 fn intern_with<F>(self, f: F) -> Self::Output
2944 where F: FnOnce(&T) -> R;
2947 impl<I, T, R, E> InternAs<[T], R> for I
2948 where E: InternIteratorElement<T, R>,
2949 I: Iterator<Item=E> {
2950 type Output = E::Output;
2951 fn intern_with<F>(self, f: F) -> Self::Output
2952 where F: FnOnce(&[T]) -> R {
2953 E::intern_with(self, f)
2957 pub trait InternIteratorElement<T, R>: Sized {
2959 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2962 impl<T, R> InternIteratorElement<T, R> for T {
2964 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2965 f(&iter.collect::<SmallVec<[_; 8]>>())
2969 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2973 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2974 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2978 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2979 type Output = Result<R, E>;
2980 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2981 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
2985 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2986 // FIXME(#44234) - almost all of these queries have no sub-queries and
2987 // therefore no actual inputs, they're just reading tables calculated in
2988 // resolve! Does this work? Unsure! That's what the issue is about
2989 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2990 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2991 providers.crate_name = |tcx, id| {
2992 assert_eq!(id, LOCAL_CRATE);
2995 providers.get_lib_features = |tcx, id| {
2996 assert_eq!(id, LOCAL_CRATE);
2997 Lrc::new(middle::lib_features::collect(tcx))
2999 providers.get_lang_items = |tcx, id| {
3000 assert_eq!(id, LOCAL_CRATE);
3001 Lrc::new(middle::lang_items::collect(tcx))
3003 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3004 providers.maybe_unused_trait_import = |tcx, id| {
3005 tcx.maybe_unused_trait_imports.contains(&id)
3007 providers.maybe_unused_extern_crates = |tcx, cnum| {
3008 assert_eq!(cnum, LOCAL_CRATE);
3009 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3012 providers.stability_index = |tcx, cnum| {
3013 assert_eq!(cnum, LOCAL_CRATE);
3014 Lrc::new(stability::Index::new(tcx))
3016 providers.lookup_stability = |tcx, id| {
3017 assert_eq!(id.krate, LOCAL_CRATE);
3018 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3019 tcx.stability().local_stability(id)
3021 providers.lookup_deprecation_entry = |tcx, id| {
3022 assert_eq!(id.krate, LOCAL_CRATE);
3023 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3024 tcx.stability().local_deprecation_entry(id)
3026 providers.extern_mod_stmt_cnum = |tcx, id| {
3027 let id = tcx.hir.as_local_node_id(id).unwrap();
3028 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3030 providers.all_crate_nums = |tcx, cnum| {
3031 assert_eq!(cnum, LOCAL_CRATE);
3032 Lrc::new(tcx.cstore.crates_untracked())
3034 providers.postorder_cnums = |tcx, cnum| {
3035 assert_eq!(cnum, LOCAL_CRATE);
3036 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3038 providers.output_filenames = |tcx, cnum| {
3039 assert_eq!(cnum, LOCAL_CRATE);
3040 tcx.output_filenames.clone()
3042 providers.features_query = |tcx, cnum| {
3043 assert_eq!(cnum, LOCAL_CRATE);
3044 Lrc::new(tcx.sess.features_untracked().clone())
3046 providers.is_panic_runtime = |tcx, cnum| {
3047 assert_eq!(cnum, LOCAL_CRATE);
3048 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
3050 providers.is_compiler_builtins = |tcx, cnum| {
3051 assert_eq!(cnum, LOCAL_CRATE);
3052 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")