1 // ignore-tidy-filelength
3 //! Type context book-keeping.
5 use crate::arena::Arena;
6 use crate::dep_graph::DepGraph;
7 use crate::dep_graph::{self, DepNode, DepConstructor};
8 use crate::session::Session;
9 use crate::session::config::{BorrowckMode, OutputFilenames};
10 use crate::session::config::CrateType;
12 use crate::hir::{TraitCandidate, HirId, ItemKind, ItemLocalId, Node};
13 use crate::hir::def::{Def, Export};
14 use crate::hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
15 use crate::hir::map as hir_map;
16 use crate::hir::map::DefPathHash;
17 use crate::lint::{self, Lint};
18 use crate::ich::{StableHashingContext, NodeIdHashingMode};
19 use crate::infer::canonical::{Canonical, CanonicalVarInfo, CanonicalVarInfos};
20 use crate::infer::outlives::free_region_map::FreeRegionMap;
21 use crate::middle::cstore::CrateStoreDyn;
22 use crate::middle::cstore::EncodedMetadata;
23 use crate::middle::lang_items;
24 use crate::middle::resolve_lifetime::{self, ObjectLifetimeDefault};
25 use crate::middle::stability;
26 use crate::mir::{self, Mir, interpret, ProjectionKind};
27 use crate::mir::interpret::{ConstValue, Allocation};
28 use crate::ty::subst::{Kind, InternalSubsts, SubstsRef, Subst};
29 use crate::ty::ReprOptions;
31 use crate::traits::{Clause, Clauses, GoalKind, Goal, Goals};
32 use crate::ty::{self, DefIdTree, Ty, TypeAndMut};
33 use crate::ty::{TyS, TyKind, List};
34 use crate::ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorSubsts, Region, Const};
35 use crate::ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
36 use crate::ty::RegionKind;
37 use crate::ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid, ConstVid};
38 use crate::ty::TyKind::*;
39 use crate::ty::{InferConst, ParamConst};
40 use crate::ty::GenericParamDefKind;
41 use crate::ty::layout::{LayoutDetails, TargetDataLayout, VariantIdx};
43 use crate::ty::steal::Steal;
44 use crate::ty::subst::{UserSubsts, UnpackedKind};
45 use crate::ty::{BoundVar, BindingMode};
46 use crate::ty::CanonicalPolyFnSig;
47 use crate::util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap, ItemLocalSet};
48 use crate::util::nodemap::{FxHashMap, FxHashSet};
49 use errors::DiagnosticBuilder;
50 use rustc_data_structures::interner::HashInterner;
51 use smallvec::SmallVec;
52 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
53 StableHasher, StableHasherResult,
55 use arena::{TypedArena, SyncDroplessArena};
56 use rustc_data_structures::indexed_vec::{Idx, IndexVec};
57 use rustc_data_structures::sync::{Lrc, Lock, WorkerLocal};
59 use std::borrow::Borrow;
60 use std::cmp::Ordering;
61 use std::collections::hash_map::{self, Entry};
62 use std::hash::{Hash, Hasher};
65 use std::ops::{Deref, Bound};
69 use std::marker::PhantomData;
70 use rustc_target::spec::abi;
71 use rustc_macros::HashStable;
74 use syntax::source_map::MultiSpan;
75 use syntax::feature_gate;
76 use syntax::symbol::{Symbol, keywords, InternedString};
81 pub struct AllArenas<'tcx> {
82 pub global: WorkerLocal<GlobalArenas<'tcx>>,
83 pub interner: SyncDroplessArena,
86 impl<'tcx> AllArenas<'tcx> {
87 pub fn new() -> Self {
89 global: WorkerLocal::new(|_| GlobalArenas::default()),
90 interner: SyncDroplessArena::default(),
97 pub struct GlobalArenas<'tcx> {
99 layout: TypedArena<LayoutDetails>,
102 generics: TypedArena<ty::Generics>,
103 trait_def: TypedArena<ty::TraitDef>,
104 adt_def: TypedArena<ty::AdtDef>,
105 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
106 mir: TypedArena<Mir<'tcx>>,
107 tables: TypedArena<ty::TypeckTables<'tcx>>,
109 const_allocs: TypedArena<interpret::Allocation>,
112 type InternedSet<'tcx, T> = Lock<FxHashMap<Interned<'tcx, T>, ()>>;
114 pub struct CtxtInterners<'tcx> {
115 /// The arena that types, regions, etc are allocated from
116 arena: &'tcx SyncDroplessArena,
118 /// Specifically use a speedy hash algorithm for these hash sets,
119 /// they're accessed quite often.
120 type_: InternedSet<'tcx, TyS<'tcx>>,
121 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
122 substs: InternedSet<'tcx, InternalSubsts<'tcx>>,
123 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
124 region: InternedSet<'tcx, RegionKind>,
125 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
126 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
127 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
128 goal: InternedSet<'tcx, GoalKind<'tcx>>,
129 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
130 projs: InternedSet<'tcx, List<ProjectionKind>>,
131 const_: InternedSet<'tcx, Const<'tcx>>,
134 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
135 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
138 type_: Default::default(),
139 type_list: Default::default(),
140 substs: Default::default(),
141 region: Default::default(),
142 existential_predicates: Default::default(),
143 canonical_var_infos: Default::default(),
144 predicates: Default::default(),
145 clauses: Default::default(),
146 goal: Default::default(),
147 goal_list: Default::default(),
148 projs: Default::default(),
149 const_: Default::default(),
156 local: &CtxtInterners<'tcx>,
157 global: &CtxtInterners<'gcx>,
160 let flags = super::flags::FlagComputation::for_sty(&st);
162 // HACK(eddyb) Depend on flags being accurate to
163 // determine that all contents are in the global tcx.
164 // See comments on Lift for why we can't use that.
165 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
166 local.type_.borrow_mut().intern(st, |st| {
167 let ty_struct = TyS {
170 outer_exclusive_binder: flags.outer_exclusive_binder,
173 // Make sure we don't end up with inference
174 // types/regions in the global interner
175 if ptr_eq(local, global) {
176 bug!("Attempted to intern `{:?}` which contains \
177 inference types/regions in the global type context",
181 Interned(local.arena.alloc(ty_struct))
184 global.type_.borrow_mut().intern(st, |st| {
185 let ty_struct = TyS {
188 outer_exclusive_binder: flags.outer_exclusive_binder,
191 // This is safe because all the types the ty_struct can point to
192 // already is in the global arena
193 let ty_struct: TyS<'gcx> = unsafe {
194 mem::transmute(ty_struct)
197 Interned(global.arena.alloc(ty_struct))
203 pub struct CommonTypes<'tcx> {
224 /// Dummy type used for the `Self` of a `TraitRef` created for converting
225 /// a trait object, and which gets removed in `ExistentialTraitRef`.
226 /// This type must not appear anywhere in other converted types.
227 pub trait_object_dummy_self: Ty<'tcx>,
229 pub re_empty: Region<'tcx>,
230 pub re_static: Region<'tcx>,
231 pub re_erased: Region<'tcx>,
234 pub struct LocalTableInContext<'a, V: 'a> {
235 local_id_root: Option<DefId>,
236 data: &'a ItemLocalMap<V>
239 /// Validate that the given HirId (respectively its `local_id` part) can be
240 /// safely used as a key in the tables of a TypeckTable. For that to be
241 /// the case, the HirId must have the same `owner` as all the other IDs in
242 /// this table (signified by `local_id_root`). Otherwise the HirId
243 /// would be in a different frame of reference and using its `local_id`
244 /// would result in lookup errors, or worse, in silently wrong data being
246 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
249 if cfg!(debug_assertions) {
250 if let Some(local_id_root) = local_id_root {
251 if hir_id.owner != local_id_root.index {
252 ty::tls::with(|tcx| {
253 let node_id = tcx.hir().hir_to_node_id(hir_id);
255 bug!("node {} with HirId::owner {:?} cannot be placed in \
256 TypeckTables with local_id_root {:?}",
257 tcx.hir().node_to_string(node_id),
258 DefId::local(hir_id.owner),
263 // We use "Null Object" TypeckTables in some of the analysis passes.
264 // These are just expected to be empty and their `local_id_root` is
265 // `None`. Therefore we cannot verify whether a given `HirId` would
266 // be a valid key for the given table. Instead we make sure that
267 // nobody tries to write to such a Null Object table.
269 bug!("access to invalid TypeckTables")
275 impl<'a, V> LocalTableInContext<'a, V> {
276 pub fn contains_key(&self, id: hir::HirId) -> bool {
277 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
278 self.data.contains_key(&id.local_id)
281 pub fn get(&self, id: hir::HirId) -> Option<&V> {
282 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
283 self.data.get(&id.local_id)
286 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
291 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
294 fn index(&self, key: hir::HirId) -> &V {
295 self.get(key).expect("LocalTableInContext: key not found")
299 pub struct LocalTableInContextMut<'a, V: 'a> {
300 local_id_root: Option<DefId>,
301 data: &'a mut ItemLocalMap<V>
304 impl<'a, V> LocalTableInContextMut<'a, V> {
305 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
306 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
307 self.data.get_mut(&id.local_id)
310 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
311 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
312 self.data.entry(id.local_id)
315 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
316 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
317 self.data.insert(id.local_id, val)
320 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
321 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
322 self.data.remove(&id.local_id)
326 /// All information necessary to validate and reveal an `impl Trait` or `existential Type`
327 #[derive(RustcEncodable, RustcDecodable, Debug, HashStable)]
328 pub struct ResolvedOpaqueTy<'tcx> {
329 /// The revealed type as seen by this function.
330 pub concrete_type: Ty<'tcx>,
331 /// Generic parameters on the opaque type as passed by this function.
332 /// For `existential type Foo<A, B>; fn foo<T, U>() -> Foo<T, U> { .. }` this is `[T, U]`, not
334 pub substs: SubstsRef<'tcx>,
337 #[derive(RustcEncodable, RustcDecodable, Debug)]
338 pub struct TypeckTables<'tcx> {
339 /// The HirId::owner all ItemLocalIds in this table are relative to.
340 pub local_id_root: Option<DefId>,
342 /// Resolved definitions for `<T>::X` associated paths and
343 /// method calls, including those of overloaded operators.
344 type_dependent_defs: ItemLocalMap<Def>,
346 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
347 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
348 /// about the field you also need definition of the variant to which the field
349 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
350 field_indices: ItemLocalMap<usize>,
352 /// Stores the types for various nodes in the AST. Note that this table
353 /// is not guaranteed to be populated until after typeck. See
354 /// typeck::check::fn_ctxt for details.
355 node_types: ItemLocalMap<Ty<'tcx>>,
357 /// Stores the type parameters which were substituted to obtain the type
358 /// of this node. This only applies to nodes that refer to entities
359 /// parameterized by type parameters, such as generic fns, types, or
361 node_substs: ItemLocalMap<SubstsRef<'tcx>>,
363 /// This will either store the canonicalized types provided by the user
364 /// or the substitutions that the user explicitly gave (if any) attached
365 /// to `id`. These will not include any inferred values. The canonical form
366 /// is used to capture things like `_` or other unspecified values.
368 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
369 /// canonical substitutions would include only `for<X> { Vec<X> }`.
371 /// See also `AscribeUserType` statement in MIR.
372 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
374 /// Stores the canonicalized types provided by the user. See also
375 /// `AscribeUserType` statement in MIR.
376 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
378 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
380 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
381 pat_binding_modes: ItemLocalMap<BindingMode>,
383 /// Stores the types which were implicitly dereferenced in pattern binding modes
384 /// for later usage in HAIR lowering. For example,
387 /// match &&Some(5i32) {
392 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
395 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
396 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
399 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
401 /// Records the reasons that we picked the kind of each closure;
402 /// not all closures are present in the map.
403 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
405 /// For each fn, records the "liberated" types of its arguments
406 /// and return type. Liberated means that all bound regions
407 /// (including late-bound regions) are replaced with free
408 /// equivalents. This table is not used in codegen (since regions
409 /// are erased there) and hence is not serialized to metadata.
410 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
412 /// For each FRU expression, record the normalized types of the fields
413 /// of the struct - this is needed because it is non-trivial to
414 /// normalize while preserving regions. This table is used only in
415 /// MIR construction and hence is not serialized to metadata.
416 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
418 /// For every coercion cast we add the HIR node ID of the cast
419 /// expression to this set.
420 coercion_casts: ItemLocalSet,
422 /// Set of trait imports actually used in the method resolution.
423 /// This is used for warning unused imports. During type
424 /// checking, this `Lrc` should not be cloned: it must have a ref-count
425 /// of 1 so that we can insert things into the set mutably.
426 pub used_trait_imports: Lrc<DefIdSet>,
428 /// If any errors occurred while type-checking this body,
429 /// this field will be set to `true`.
430 pub tainted_by_errors: bool,
432 /// Stores the free-region relationships that were deduced from
433 /// its where-clauses and parameter types. These are then
434 /// read-again by borrowck.
435 pub free_region_map: FreeRegionMap<'tcx>,
437 /// All the existential types that are restricted to concrete types
439 pub concrete_existential_types: FxHashMap<DefId, ResolvedOpaqueTy<'tcx>>,
441 /// Given the closure ID this map provides the list of UpvarIDs used by it.
442 /// The upvarID contains the HIR node ID and it also contains the full path
443 /// leading to the member of the struct or tuple that is used instead of the
445 pub upvar_list: ty::UpvarListMap,
448 impl<'tcx> TypeckTables<'tcx> {
449 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
452 type_dependent_defs: Default::default(),
453 field_indices: Default::default(),
454 user_provided_types: Default::default(),
455 user_provided_sigs: Default::default(),
456 node_types: Default::default(),
457 node_substs: Default::default(),
458 adjustments: Default::default(),
459 pat_binding_modes: Default::default(),
460 pat_adjustments: Default::default(),
461 upvar_capture_map: Default::default(),
462 closure_kind_origins: Default::default(),
463 liberated_fn_sigs: Default::default(),
464 fru_field_types: Default::default(),
465 coercion_casts: Default::default(),
466 used_trait_imports: Lrc::new(Default::default()),
467 tainted_by_errors: false,
468 free_region_map: Default::default(),
469 concrete_existential_types: Default::default(),
470 upvar_list: Default::default(),
474 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
475 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
477 hir::QPath::Resolved(_, ref path) => path.def,
478 hir::QPath::TypeRelative(..) => {
479 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
480 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
485 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
486 LocalTableInContext {
487 local_id_root: self.local_id_root,
488 data: &self.type_dependent_defs
492 pub fn type_dependent_def(&self, id: HirId) -> Option<Def> {
493 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
494 self.type_dependent_defs.get(&id.local_id).cloned()
497 pub fn type_dependent_def_id(&self, id: HirId) -> Option<DefId> {
498 self.type_dependent_def(id).map(|def| def.def_id())
501 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
502 LocalTableInContextMut {
503 local_id_root: self.local_id_root,
504 data: &mut self.type_dependent_defs
508 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
509 LocalTableInContext {
510 local_id_root: self.local_id_root,
511 data: &self.field_indices
515 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
516 LocalTableInContextMut {
517 local_id_root: self.local_id_root,
518 data: &mut self.field_indices
522 pub fn user_provided_types(
524 ) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
525 LocalTableInContext {
526 local_id_root: self.local_id_root,
527 data: &self.user_provided_types
531 pub fn user_provided_types_mut(
533 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
534 LocalTableInContextMut {
535 local_id_root: self.local_id_root,
536 data: &mut self.user_provided_types
540 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
541 LocalTableInContext {
542 local_id_root: self.local_id_root,
543 data: &self.node_types
547 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
548 LocalTableInContextMut {
549 local_id_root: self.local_id_root,
550 data: &mut self.node_types
554 pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
555 self.node_type_opt(id).unwrap_or_else(||
556 bug!("node_type: no type for node `{}`",
557 tls::with(|tcx| tcx.hir().hir_to_string(id)))
561 pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
562 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
563 self.node_types.get(&id.local_id).cloned()
566 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> {
567 LocalTableInContextMut {
568 local_id_root: self.local_id_root,
569 data: &mut self.node_substs
573 pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> {
574 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
575 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| InternalSubsts::empty())
578 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<SubstsRef<'tcx>> {
579 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
580 self.node_substs.get(&id.local_id).cloned()
583 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
584 // doesn't provide type parameter substitutions.
585 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
586 self.node_type(pat.hir_id)
589 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
590 self.node_type_opt(pat.hir_id)
593 // Returns the type of an expression as a monotype.
595 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
596 // some cases, we insert `Adjustment` annotations such as auto-deref or
597 // auto-ref. The type returned by this function does not consider such
598 // adjustments. See `expr_ty_adjusted()` instead.
600 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
601 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
602 // instead of "fn(ty) -> T with T = isize".
603 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
604 self.node_type(expr.hir_id)
607 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
608 self.node_type_opt(expr.hir_id)
611 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
612 LocalTableInContext {
613 local_id_root: self.local_id_root,
614 data: &self.adjustments
618 pub fn adjustments_mut(&mut self)
619 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
620 LocalTableInContextMut {
621 local_id_root: self.local_id_root,
622 data: &mut self.adjustments
626 pub fn expr_adjustments(&self, expr: &hir::Expr)
627 -> &[ty::adjustment::Adjustment<'tcx>] {
628 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
629 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
632 /// Returns the type of `expr`, considering any `Adjustment`
633 /// entry recorded for that expression.
634 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
635 self.expr_adjustments(expr)
637 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
640 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
641 self.expr_adjustments(expr)
643 .map(|adj| adj.target)
644 .or_else(|| self.expr_ty_opt(expr))
647 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
648 // Only paths and method calls/overloaded operators have
649 // entries in type_dependent_defs, ignore the former here.
650 if let hir::ExprKind::Path(_) = expr.node {
654 match self.type_dependent_defs().get(expr.hir_id) {
655 Some(&Def::Method(_)) => true,
660 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
661 LocalTableInContext {
662 local_id_root: self.local_id_root,
663 data: &self.pat_binding_modes
667 pub fn pat_binding_modes_mut(&mut self)
668 -> LocalTableInContextMut<'_, BindingMode> {
669 LocalTableInContextMut {
670 local_id_root: self.local_id_root,
671 data: &mut self.pat_binding_modes
675 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
676 LocalTableInContext {
677 local_id_root: self.local_id_root,
678 data: &self.pat_adjustments,
682 pub fn pat_adjustments_mut(&mut self)
683 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
684 LocalTableInContextMut {
685 local_id_root: self.local_id_root,
686 data: &mut self.pat_adjustments,
690 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
691 self.upvar_capture_map[&upvar_id]
694 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
695 LocalTableInContext {
696 local_id_root: self.local_id_root,
697 data: &self.closure_kind_origins
701 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
702 LocalTableInContextMut {
703 local_id_root: self.local_id_root,
704 data: &mut self.closure_kind_origins
708 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
709 LocalTableInContext {
710 local_id_root: self.local_id_root,
711 data: &self.liberated_fn_sigs
715 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
716 LocalTableInContextMut {
717 local_id_root: self.local_id_root,
718 data: &mut self.liberated_fn_sigs
722 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
723 LocalTableInContext {
724 local_id_root: self.local_id_root,
725 data: &self.fru_field_types
729 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
730 LocalTableInContextMut {
731 local_id_root: self.local_id_root,
732 data: &mut self.fru_field_types
736 pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool {
737 validate_hir_id_for_typeck_tables(self.local_id_root, hir_id, true);
738 self.coercion_casts.contains(&hir_id.local_id)
741 pub fn set_coercion_cast(&mut self, id: ItemLocalId) {
742 self.coercion_casts.insert(id);
745 pub fn coercion_casts(&self) -> &ItemLocalSet {
751 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
752 fn hash_stable<W: StableHasherResult>(&self,
753 hcx: &mut StableHashingContext<'a>,
754 hasher: &mut StableHasher<W>) {
755 let ty::TypeckTables {
757 ref type_dependent_defs,
759 ref user_provided_types,
760 ref user_provided_sigs,
764 ref pat_binding_modes,
766 ref upvar_capture_map,
767 ref closure_kind_origins,
768 ref liberated_fn_sigs,
773 ref used_trait_imports,
776 ref concrete_existential_types,
781 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
782 type_dependent_defs.hash_stable(hcx, hasher);
783 field_indices.hash_stable(hcx, hasher);
784 user_provided_types.hash_stable(hcx, hasher);
785 user_provided_sigs.hash_stable(hcx, hasher);
786 node_types.hash_stable(hcx, hasher);
787 node_substs.hash_stable(hcx, hasher);
788 adjustments.hash_stable(hcx, hasher);
789 pat_binding_modes.hash_stable(hcx, hasher);
790 pat_adjustments.hash_stable(hcx, hasher);
791 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
798 local_id_root.expect("trying to hash invalid TypeckTables");
800 let var_owner_def_id = DefId {
801 krate: local_id_root.krate,
802 index: var_path.hir_id.owner,
804 let closure_def_id = DefId {
805 krate: local_id_root.krate,
806 index: closure_expr_id.to_def_id().index,
808 (hcx.def_path_hash(var_owner_def_id),
809 var_path.hir_id.local_id,
810 hcx.def_path_hash(closure_def_id))
813 closure_kind_origins.hash_stable(hcx, hasher);
814 liberated_fn_sigs.hash_stable(hcx, hasher);
815 fru_field_types.hash_stable(hcx, hasher);
816 coercion_casts.hash_stable(hcx, hasher);
817 used_trait_imports.hash_stable(hcx, hasher);
818 tainted_by_errors.hash_stable(hcx, hasher);
819 free_region_map.hash_stable(hcx, hasher);
820 concrete_existential_types.hash_stable(hcx, hasher);
821 upvar_list.hash_stable(hcx, hasher);
827 pub struct UserTypeAnnotationIndex {
829 DEBUG_FORMAT = "UserType({})",
830 const START_INDEX = 0,
834 /// Mapping of type annotation indices to canonical user type annotations.
835 pub type CanonicalUserTypeAnnotations<'tcx> =
836 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
838 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
839 pub struct CanonicalUserTypeAnnotation<'tcx> {
840 pub user_ty: CanonicalUserType<'tcx>,
842 pub inferred_ty: Ty<'tcx>,
845 BraceStructTypeFoldableImpl! {
846 impl<'tcx> TypeFoldable<'tcx> for CanonicalUserTypeAnnotation<'tcx> {
847 user_ty, span, inferred_ty
851 BraceStructLiftImpl! {
852 impl<'a, 'tcx> Lift<'tcx> for CanonicalUserTypeAnnotation<'a> {
853 type Lifted = CanonicalUserTypeAnnotation<'tcx>;
854 user_ty, span, inferred_ty
859 /// Canonicalized user type annotation.
860 pub type CanonicalUserType<'gcx> = Canonical<'gcx, UserType<'gcx>>;
862 impl CanonicalUserType<'gcx> {
863 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
864 /// i.e., each thing is mapped to a canonical variable with the same index.
865 pub fn is_identity(&self) -> bool {
867 UserType::Ty(_) => false,
868 UserType::TypeOf(_, user_substs) => {
869 if user_substs.user_self_ty.is_some() {
873 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
874 match kind.unpack() {
875 UnpackedKind::Type(ty) => match ty.sty {
876 ty::Bound(debruijn, b) => {
877 // We only allow a `ty::INNERMOST` index in substitutions.
878 assert_eq!(debruijn, ty::INNERMOST);
884 UnpackedKind::Lifetime(r) => match r {
885 ty::ReLateBound(debruijn, br) => {
886 // We only allow a `ty::INNERMOST` index in substitutions.
887 assert_eq!(*debruijn, ty::INNERMOST);
888 cvar == br.assert_bound_var()
893 UnpackedKind::Const(ct) => match ct.val {
894 ConstValue::Infer(InferConst::Canonical(debruijn, b)) => {
895 // We only allow a `ty::INNERMOST` index in substitutions.
896 assert_eq!(debruijn, ty::INNERMOST);
908 /// A user-given type annotation attached to a constant. These arise
909 /// from constants that are named via paths, like `Foo::<A>::new` and
911 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
912 pub enum UserType<'tcx> {
915 /// The canonical type is the result of `type_of(def_id)` with the
916 /// given substitutions applied.
917 TypeOf(DefId, UserSubsts<'tcx>),
920 EnumTypeFoldableImpl! {
921 impl<'tcx> TypeFoldable<'tcx> for UserType<'tcx> {
923 (UserType::TypeOf)(def, substs),
928 impl<'a, 'tcx> Lift<'tcx> for UserType<'a> {
929 type Lifted = UserType<'tcx>;
931 (UserType::TypeOf)(def, substs),
935 impl<'tcx> CommonTypes<'tcx> {
936 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
937 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
938 let mk_region = |r| {
939 interners.region.borrow_mut().intern(r, |r| {
940 Interned(interners.arena.alloc(r))
945 unit: mk(Tuple(List::empty())),
950 isize: mk(Int(ast::IntTy::Isize)),
951 i8: mk(Int(ast::IntTy::I8)),
952 i16: mk(Int(ast::IntTy::I16)),
953 i32: mk(Int(ast::IntTy::I32)),
954 i64: mk(Int(ast::IntTy::I64)),
955 i128: mk(Int(ast::IntTy::I128)),
956 usize: mk(Uint(ast::UintTy::Usize)),
957 u8: mk(Uint(ast::UintTy::U8)),
958 u16: mk(Uint(ast::UintTy::U16)),
959 u32: mk(Uint(ast::UintTy::U32)),
960 u64: mk(Uint(ast::UintTy::U64)),
961 u128: mk(Uint(ast::UintTy::U128)),
962 f32: mk(Float(ast::FloatTy::F32)),
963 f64: mk(Float(ast::FloatTy::F64)),
965 trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
967 re_empty: mk_region(RegionKind::ReEmpty),
968 re_static: mk_region(RegionKind::ReStatic),
969 re_erased: mk_region(RegionKind::ReErased),
974 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
977 pub struct FreeRegionInfo {
978 // def id corresponding to FreeRegion
980 // the bound region corresponding to FreeRegion
981 pub boundregion: ty::BoundRegion,
982 // checks if bound region is in Impl Item
983 pub is_impl_item: bool,
986 /// The central data structure of the compiler. It stores references
987 /// to the various **arenas** and also houses the results of the
988 /// various **compiler queries** that have been performed. See the
989 /// [rustc guide] for more details.
991 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
992 #[derive(Copy, Clone)]
993 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
994 gcx: &'gcx GlobalCtxt<'gcx>,
995 interners: &'tcx CtxtInterners<'tcx>,
996 dummy: PhantomData<&'a ()>,
999 impl<'gcx> Deref for TyCtxt<'_, 'gcx, '_> {
1000 type Target = &'gcx GlobalCtxt<'gcx>;
1002 fn deref(&self) -> &Self::Target {
1007 pub struct GlobalCtxt<'tcx> {
1008 pub arena: WorkerLocal<Arena<'tcx>>,
1009 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
1010 global_interners: CtxtInterners<'tcx>,
1012 cstore: &'tcx CrateStoreDyn,
1014 pub sess: &'tcx Session,
1016 pub dep_graph: DepGraph,
1018 /// Common types, pre-interned for your convenience.
1019 pub types: CommonTypes<'tcx>,
1021 /// Map indicating what traits are in scope for places where this
1022 /// is relevant; generated by resolve.
1023 trait_map: FxHashMap<DefIndex,
1024 Lrc<FxHashMap<ItemLocalId,
1025 Lrc<StableVec<TraitCandidate>>>>>,
1027 /// Export map produced by name resolution.
1028 export_map: FxHashMap<DefId, Lrc<Vec<Export<hir::HirId>>>>,
1030 hir_map: hir_map::Map<'tcx>,
1032 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
1033 /// as well as all upstream crates. Only populated in incremental mode.
1034 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
1036 pub queries: query::Queries<'tcx>,
1038 // Records the free variables referenced by every closure
1039 // expression. Do not track deps for this, just recompute it from
1040 // scratch every time.
1041 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
1043 maybe_unused_trait_imports: FxHashSet<DefId>,
1044 maybe_unused_extern_crates: Vec<(DefId, Span)>,
1045 /// A map of glob use to a set of names it actually imports. Currently only
1046 /// used in save-analysis.
1047 glob_map: FxHashMap<DefId, FxHashSet<ast::Name>>,
1048 /// Extern prelude entries. The value is `true` if the entry was introduced
1049 /// via `extern crate` item and not `--extern` option or compiler built-in.
1050 pub extern_prelude: FxHashMap<ast::Name, bool>,
1052 // Internal cache for metadata decoding. No need to track deps on this.
1053 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
1055 /// Caches the results of trait selection. This cache is used
1056 /// for things that do not have to do with the parameters in scope.
1057 pub selection_cache: traits::SelectionCache<'tcx>,
1059 /// Caches the results of trait evaluation. This cache is used
1060 /// for things that do not have to do with the parameters in scope.
1061 /// Merge this with `selection_cache`?
1062 pub evaluation_cache: traits::EvaluationCache<'tcx>,
1064 /// The definite name of the current crate after taking into account
1065 /// attributes, commandline parameters, etc.
1066 pub crate_name: Symbol,
1068 /// Data layout specification for the current target.
1069 pub data_layout: TargetDataLayout,
1071 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
1073 /// Stores the value of constants (and deduplicates the actual memory)
1074 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
1076 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1078 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
1080 /// A general purpose channel to throw data out the back towards LLVM worker
1083 /// This is intended to only get used during the codegen phase of the compiler
1084 /// when satisfying the query for a particular codegen unit. Internally in
1085 /// the query it'll send data along this channel to get processed later.
1086 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
1088 output_filenames: Arc<OutputFilenames>,
1091 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1092 /// Gets the global `TyCtxt`.
1094 pub fn global_tcx(self) -> TyCtxt<'gcx, 'gcx, 'gcx> {
1097 interners: &self.gcx.global_interners,
1103 pub fn hir(self) -> &'a hir_map::Map<'gcx> {
1107 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
1108 self.global_arenas.generics.alloc(generics)
1111 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
1112 self.global_arenas.steal_mir.alloc(Steal::new(mir))
1115 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
1116 self.global_arenas.mir.alloc(mir)
1119 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1120 self.global_arenas.tables.alloc(tables)
1123 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1124 self.global_arenas.trait_def.alloc(def)
1127 pub fn alloc_adt_def(self,
1130 variants: IndexVec<VariantIdx, ty::VariantDef>,
1132 -> &'gcx ty::AdtDef {
1133 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1134 self.global_arenas.adt_def.alloc(def)
1137 pub fn intern_const_alloc(self, alloc: Allocation) -> &'gcx Allocation {
1138 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1139 self.global_arenas.const_allocs.alloc(alloc)
1143 /// Allocates a byte or string literal for `mir::interpret`, read-only
1144 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1145 // create an allocation that just contains these bytes
1146 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes, ());
1147 let alloc = self.intern_const_alloc(alloc);
1148 self.alloc_map.lock().allocate(alloc)
1151 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1152 self.stability_interner.borrow_mut().intern(stab, |stab| {
1153 self.global_interners.arena.alloc(stab)
1157 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1158 self.layout_interner.borrow_mut().intern(layout, |layout| {
1159 self.global_arenas.layout.alloc(layout)
1163 /// Returns a range of the start/end indices specified with the
1164 /// `rustc_layout_scalar_valid_range` attribute.
1165 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1166 let attrs = self.get_attrs(def_id);
1168 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1170 None => return Bound::Unbounded,
1172 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1173 match meta.literal().expect("attribute takes lit").node {
1174 ast::LitKind::Int(a, _) => return Bound::Included(a),
1175 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1178 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1180 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1183 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1184 value.lift_to_tcx(self)
1187 /// Like lift, but only tries in the global tcx.
1188 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1189 value.lift_to_tcx(self.global_tcx())
1192 /// Returns `true` if self is the same as self.global_tcx().
1193 fn is_global(self) -> bool {
1194 ptr_eq(self.interners, &self.global_interners)
1197 /// Creates a type context and call the closure with a `TyCtxt` reference
1198 /// to the context. The closure enforces that the type context and any interned
1199 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1200 /// reference to the context, to allow formatting values that need it.
1201 pub fn create_global_ctxt(
1203 cstore: &'tcx CrateStoreDyn,
1204 local_providers: ty::query::Providers<'tcx>,
1205 extern_providers: ty::query::Providers<'tcx>,
1206 arenas: &'tcx AllArenas<'tcx>,
1207 resolutions: ty::Resolutions,
1208 hir: hir_map::Map<'tcx>,
1209 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1211 tx: mpsc::Sender<Box<dyn Any + Send>>,
1212 output_filenames: &OutputFilenames,
1213 ) -> GlobalCtxt<'tcx> {
1214 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1217 let interners = CtxtInterners::new(&arenas.interner);
1218 let common_types = CommonTypes::new(&interners);
1219 let dep_graph = hir.dep_graph.clone();
1220 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1221 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1222 providers[LOCAL_CRATE] = local_providers;
1224 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1225 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1228 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1231 let def_path_tables = || {
1232 upstream_def_path_tables
1234 .map(|&(cnum, ref rc)| (cnum, &**rc))
1235 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1238 // Precompute the capacity of the hashmap so we don't have to
1239 // re-allocate when populating it.
1240 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1242 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1244 ::std::default::Default::default()
1247 for (cnum, def_path_table) in def_path_tables() {
1248 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1256 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1257 for (k, v) in resolutions.trait_map {
1258 let hir_id = hir.node_to_hir_id(k);
1259 let map = trait_map.entry(hir_id.owner).or_default();
1260 Lrc::get_mut(map).unwrap()
1261 .insert(hir_id.local_id,
1262 Lrc::new(StableVec::new(v)));
1268 arena: WorkerLocal::new(|_| Arena::default()),
1269 global_arenas: &arenas.global,
1270 global_interners: interners,
1272 types: common_types,
1274 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1275 let exports: Vec<_> = v.into_iter().map(|e| {
1276 e.map_id(|id| hir.node_to_hir_id(id))
1278 (k, Lrc::new(exports))
1280 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1281 let vars: Vec<_> = v.into_iter().map(|e| {
1282 e.map_id(|id| hir.node_to_hir_id(id))
1284 (hir.local_def_id(k), Lrc::new(vars))
1286 maybe_unused_trait_imports:
1287 resolutions.maybe_unused_trait_imports
1289 .map(|id| hir.local_def_id(id))
1291 maybe_unused_extern_crates:
1292 resolutions.maybe_unused_extern_crates
1294 .map(|(id, sp)| (hir.local_def_id(id), sp))
1296 glob_map: resolutions.glob_map.into_iter().map(|(id, names)| {
1297 (hir.local_def_id(id), names)
1299 extern_prelude: resolutions.extern_prelude,
1301 def_path_hash_to_def_id,
1302 queries: query::Queries::new(
1305 on_disk_query_result_cache,
1307 rcache: Default::default(),
1308 selection_cache: Default::default(),
1309 evaluation_cache: Default::default(),
1310 crate_name: Symbol::intern(crate_name),
1312 layout_interner: Default::default(),
1313 stability_interner: Default::default(),
1314 allocation_interner: Default::default(),
1315 alloc_map: Lock::new(interpret::AllocMap::new()),
1316 tx_to_llvm_workers: Lock::new(tx),
1317 output_filenames: Arc::new(output_filenames.clone()),
1321 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1322 let cname = self.crate_name(LOCAL_CRATE).as_str();
1323 self.sess.consider_optimizing(&cname, msg)
1326 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1327 self.get_lib_features(LOCAL_CRATE)
1330 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1331 self.get_lang_items(LOCAL_CRATE)
1334 /// Due to missing llvm support for lowering 128 bit math to software emulation
1335 /// (on some targets), the lowering can be done in MIR.
1337 /// This function only exists until said support is implemented.
1338 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1339 let items = self.lang_items();
1340 let def_id = Some(def_id);
1341 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1342 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1343 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1344 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1345 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1346 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1347 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1348 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1349 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1350 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1351 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1352 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1353 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1354 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1355 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1356 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1357 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1358 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1359 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1360 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1361 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1362 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1363 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1364 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1368 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1369 self.stability_index(LOCAL_CRATE)
1372 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1373 self.all_crate_nums(LOCAL_CRATE)
1376 pub fn features(self) -> Lrc<feature_gate::Features> {
1377 self.features_query(LOCAL_CRATE)
1380 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1382 self.hir().def_key(id)
1384 self.cstore.def_key(id)
1388 /// Converts a `DefId` into its fully expanded `DefPath` (every
1389 /// `DefId` is really just an interned def-path).
1391 /// Note that if `id` is not local to this crate, the result will
1392 /// be a non-local `DefPath`.
1393 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1395 self.hir().def_path(id)
1397 self.cstore.def_path(id)
1401 /// Returns whether or not the crate with CrateNum 'cnum'
1402 /// is marked as a private dependency
1403 pub fn is_private_dep(self, cnum: CrateNum) -> bool {
1404 if cnum == LOCAL_CRATE {
1407 self.cstore.crate_is_private_dep_untracked(cnum)
1412 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1413 if def_id.is_local() {
1414 self.hir().definitions().def_path_hash(def_id.index)
1416 self.cstore.def_path_hash(def_id)
1420 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1421 // We are explicitly not going through queries here in order to get
1422 // crate name and disambiguator since this code is called from debug!()
1423 // statements within the query system and we'd run into endless
1424 // recursion otherwise.
1425 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1426 (self.crate_name.clone(),
1427 self.sess.local_crate_disambiguator())
1429 (self.cstore.crate_name_untracked(def_id.krate),
1430 self.cstore.crate_disambiguator_untracked(def_id.krate))
1435 // Don't print the whole crate disambiguator. That's just
1436 // annoying in debug output.
1437 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1438 self.def_path(def_id).to_string_no_crate())
1441 pub fn metadata_encoding_version(self) -> Vec<u8> {
1442 self.cstore.metadata_encoding_version().to_vec()
1445 // Note that this is *untracked* and should only be used within the query
1446 // system if the result is otherwise tracked through queries
1447 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1448 self.cstore.crate_data_as_rc_any(cnum)
1452 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1453 let krate = self.gcx.hir_map.forest.untracked_krate();
1455 StableHashingContext::new(self.sess,
1457 self.hir().definitions(),
1461 // This method makes sure that we have a DepNode and a Fingerprint for
1462 // every upstream crate. It needs to be called once right after the tcx is
1464 // With full-fledged red/green, the method will probably become unnecessary
1465 // as this will be done on-demand.
1466 pub fn allocate_metadata_dep_nodes(self) {
1467 // We cannot use the query versions of crates() and crate_hash(), since
1468 // those would need the DepNodes that we are allocating here.
1469 for cnum in self.cstore.crates_untracked() {
1470 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1471 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1472 self.dep_graph.with_task(dep_node,
1475 |_, x| x, // No transformation needed
1476 dep_graph::hash_result,
1481 pub fn serialize_query_result_cache<E>(self,
1483 -> Result<(), E::Error>
1484 where E: ty::codec::TyEncoder
1486 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1489 /// This checks whether one is allowed to have pattern bindings
1490 /// that bind-by-move on a match arm that has a guard, e.g.:
1493 /// match foo { A(inner) if { /* something */ } => ..., ... }
1496 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1497 /// because that method has a narrower effect that can be toggled
1498 /// off via a separate `-Z` flag, at least for the short term.
1499 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1500 self.features().bind_by_move_pattern_guards
1503 /// If true, we should use a naive AST walk to determine if match
1504 /// guard could perform bad mutations (or mutable-borrows).
1505 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1506 !self.allow_bind_by_move_patterns_with_guards()
1509 /// If true, we should use the AST-based borrowck (we may *also* use
1510 /// the MIR-based borrowck).
1511 pub fn use_ast_borrowck(self) -> bool {
1512 self.borrowck_mode().use_ast()
1515 /// If true, we should use the MIR-based borrow check, but also
1516 /// fall back on the AST borrow check if the MIR-based one errors.
1517 pub fn migrate_borrowck(self) -> bool {
1518 self.borrowck_mode().migrate()
1521 /// If true, make MIR codegen for `match` emit a temp that holds a
1522 /// borrow of the input to the match expression.
1523 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1524 self.emit_read_for_match()
1527 /// If true, make MIR codegen for `match` emit FakeRead
1528 /// statements (which simulate the maximal effect of executing the
1529 /// patterns in a match arm).
1530 pub fn emit_read_for_match(&self) -> bool {
1531 !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1534 /// What mode(s) of borrowck should we run? AST? MIR? both?
1535 /// (Also considers the `#![feature(nll)]` setting.)
1536 pub fn borrowck_mode(&self) -> BorrowckMode {
1537 // Here are the main constraints we need to deal with:
1539 // 1. An opts.borrowck_mode of `BorrowckMode::Migrate` is
1540 // synonymous with no `-Z borrowck=...` flag at all.
1542 // 2. We want to allow developers on the Nightly channel
1543 // to opt back into the "hard error" mode for NLL,
1544 // (which they can do via specifying `#![feature(nll)]`
1545 // explicitly in their crate).
1547 // So, this precedence list is how pnkfelix chose to work with
1548 // the above constraints:
1550 // * `#![feature(nll)]` *always* means use NLL with hard
1551 // errors. (To simplify the code here, it now even overrides
1552 // a user's attempt to specify `-Z borrowck=compare`, which
1553 // we arguably do not need anymore and should remove.)
1555 // * Otherwise, if no `-Z borrowck=...` then use migrate mode
1557 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1559 if self.features().nll { return BorrowckMode::Mir; }
1561 self.sess.opts.borrowck_mode
1565 pub fn local_crate_exports_generics(self) -> bool {
1566 debug_assert!(self.sess.opts.share_generics());
1568 self.sess.crate_types.borrow().iter().any(|crate_type| {
1570 CrateType::Executable |
1571 CrateType::Staticlib |
1572 CrateType::ProcMacro |
1573 CrateType::Cdylib => false,
1575 CrateType::Dylib => true,
1580 // This method returns the DefId and the BoundRegion corresponding to the given region.
1581 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1582 let (suitable_region_binding_scope, bound_region) = match *region {
1583 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1584 ty::ReEarlyBound(ref ebr) => (
1585 self.parent(ebr.def_id).unwrap(),
1586 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1588 _ => return None, // not a free region
1591 let hir_id = self.hir()
1592 .as_local_hir_id(suitable_region_binding_scope)
1594 let is_impl_item = match self.hir().find_by_hir_id(hir_id) {
1595 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1596 Some(Node::ImplItem(..)) => {
1597 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1602 return Some(FreeRegionInfo {
1603 def_id: suitable_region_binding_scope,
1604 boundregion: bound_region,
1605 is_impl_item: is_impl_item,
1609 pub fn return_type_impl_trait(
1611 scope_def_id: DefId,
1612 ) -> Option<Ty<'tcx>> {
1613 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1614 let hir_id = self.hir().as_local_hir_id(scope_def_id).unwrap();
1615 match self.hir().get_by_hir_id(hir_id) {
1616 Node::Item(item) => {
1618 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1624 _ => { /* type_of_def_id() will work or panic */ }
1627 let ret_ty = self.type_of(scope_def_id);
1629 ty::FnDef(_, _) => {
1630 let sig = ret_ty.fn_sig(*self);
1631 let output = self.erase_late_bound_regions(&sig.output());
1632 if output.is_impl_trait() {
1642 // Here we check if the bound region is in Impl Item.
1643 pub fn is_bound_region_in_impl_item(
1645 suitable_region_binding_scope: DefId,
1647 let container_id = self.associated_item(suitable_region_binding_scope)
1650 if self.impl_trait_ref(container_id).is_some() {
1651 // For now, we do not try to target impls of traits. This is
1652 // because this message is going to suggest that the user
1653 // change the fn signature, but they may not be free to do so,
1654 // since the signature must match the trait.
1656 // FIXME(#42706) -- in some cases, we could do better here.
1662 /// Determine whether identifiers in the assembly have strict naming rules.
1663 /// Currently, only NVPTX* targets need it.
1664 pub fn has_strict_asm_symbol_naming(&self) -> bool {
1665 self.gcx.sess.target.target.arch.contains("nvptx")
1669 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1670 pub fn encode_metadata(self)
1673 self.cstore.encode_metadata(self)
1677 impl<'gcx> GlobalCtxt<'gcx> {
1678 /// Call the closure with a local `TyCtxt` using the given arena.
1679 /// `interners` is a slot passed so we can create a CtxtInterners
1680 /// with the same lifetime as `arena`.
1681 pub fn enter_local<'tcx, F, R>(
1683 arena: &'tcx SyncDroplessArena,
1684 interners: &'tcx mut Option<CtxtInterners<'tcx>>,
1688 F: FnOnce(TyCtxt<'tcx, 'gcx, 'tcx>) -> R,
1691 *interners = Some(CtxtInterners::new(&arena));
1694 interners: interners.as_ref().unwrap(),
1697 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1698 let new_icx = ty::tls::ImplicitCtxt {
1700 query: icx.query.clone(),
1701 diagnostics: icx.diagnostics,
1702 layout_depth: icx.layout_depth,
1703 task_deps: icx.task_deps,
1705 ty::tls::enter_context(&new_icx, |_| {
1712 /// A trait implemented for all X<'a> types which can be safely and
1713 /// efficiently converted to X<'tcx> as long as they are part of the
1714 /// provided TyCtxt<'tcx>.
1715 /// This can be done, for example, for Ty<'tcx> or SubstsRef<'tcx>
1716 /// by looking them up in their respective interners.
1718 /// However, this is still not the best implementation as it does
1719 /// need to compare the components, even for interned values.
1720 /// It would be more efficient if TypedArena provided a way to
1721 /// determine whether the address is in the allocated range.
1723 /// None is returned if the value or one of the components is not part
1724 /// of the provided context.
1725 /// For Ty, None can be returned if either the type interner doesn't
1726 /// contain the TyKind key or if the address of the interned
1727 /// pointer differs. The latter case is possible if a primitive type,
1728 /// e.g., `()` or `u8`, was interned in a different context.
1729 pub trait Lift<'tcx>: fmt::Debug {
1730 type Lifted: fmt::Debug + 'tcx;
1731 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1735 macro_rules! nop_lift {
1736 ($ty:ty => $lifted:ty) => {
1737 impl<'a, 'tcx> Lift<'tcx> for $ty {
1738 type Lifted = $lifted;
1739 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1740 if tcx.interners.arena.in_arena(*self as *const _) {
1741 return Some(unsafe { mem::transmute(*self) });
1743 // Also try in the global tcx if we're not that.
1744 if !tcx.is_global() {
1745 self.lift_to_tcx(tcx.global_tcx())
1754 macro_rules! nop_list_lift {
1755 ($ty:ty => $lifted:ty) => {
1756 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1757 type Lifted = &'tcx List<$lifted>;
1758 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1759 if self.is_empty() {
1760 return Some(List::empty());
1762 if tcx.interners.arena.in_arena(*self as *const _) {
1763 return Some(unsafe { mem::transmute(*self) });
1765 // Also try in the global tcx if we're not that.
1766 if !tcx.is_global() {
1767 self.lift_to_tcx(tcx.global_tcx())
1776 nop_lift!{Ty<'a> => Ty<'tcx>}
1777 nop_lift!{Region<'a> => Region<'tcx>}
1778 nop_lift!{Goal<'a> => Goal<'tcx>}
1779 nop_lift!{&'a Const<'a> => &'tcx Const<'tcx>}
1781 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1782 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1783 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1784 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1785 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1786 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1787 nop_list_lift!{ProjectionKind => ProjectionKind}
1789 // this is the impl for `&'a InternalSubsts<'a>`
1790 nop_list_lift!{Kind<'a> => Kind<'tcx>}
1792 impl<'a, 'tcx> Lift<'tcx> for &'a mir::interpret::Allocation {
1793 type Lifted = &'tcx mir::interpret::Allocation;
1794 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1795 assert!(tcx.global_arenas.const_allocs.in_arena(*self as *const _));
1796 Some(unsafe { mem::transmute(*self) })
1801 use super::{GlobalCtxt, TyCtxt, ptr_eq};
1805 use std::marker::PhantomData;
1807 use crate::ty::query;
1808 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1809 use rustc_data_structures::OnDrop;
1810 use rustc_data_structures::sync::{self, Lrc, Lock};
1811 use rustc_data_structures::thin_vec::ThinVec;
1812 use crate::dep_graph::TaskDeps;
1814 #[cfg(not(parallel_compiler))]
1815 use std::cell::Cell;
1817 #[cfg(parallel_compiler)]
1818 use rustc_rayon_core as rayon_core;
1820 /// This is the implicit state of rustc. It contains the current
1821 /// TyCtxt and query. It is updated when creating a local interner or
1822 /// executing a new query. Whenever there's a TyCtxt value available
1823 /// you should also have access to an ImplicitCtxt through the functions
1826 pub struct ImplicitCtxt<'a, 'gcx: 'tcx, 'tcx> {
1827 /// The current TyCtxt. Initially created by `enter_global` and updated
1828 /// by `enter_local` with a new local interner
1829 pub tcx: TyCtxt<'tcx, 'gcx, 'tcx>,
1831 /// The current query job, if any. This is updated by JobOwner::start in
1832 /// ty::query::plumbing when executing a query
1833 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1835 /// Where to store diagnostics for the current query job, if any.
1836 /// This is updated by JobOwner::start in ty::query::plumbing when executing a query
1837 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1839 /// Used to prevent layout from recursing too deeply.
1840 pub layout_depth: usize,
1842 /// The current dep graph task. This is used to add dependencies to queries
1843 /// when executing them
1844 pub task_deps: Option<&'a Lock<TaskDeps>>,
1847 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1848 /// to `value` during the call to `f`. It is restored to its previous value after.
1849 /// This is used to set the pointer to the new ImplicitCtxt.
1850 #[cfg(parallel_compiler)]
1852 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1853 rayon_core::tlv::with(value, f)
1856 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1857 /// This is used to get the pointer to the current ImplicitCtxt.
1858 #[cfg(parallel_compiler)]
1860 fn get_tlv() -> usize {
1861 rayon_core::tlv::get()
1864 #[cfg(not(parallel_compiler))]
1866 /// A thread local variable which stores a pointer to the current ImplicitCtxt.
1867 static TLV: Cell<usize> = Cell::new(0);
1870 /// Sets TLV to `value` during the call to `f`.
1871 /// It is restored to its previous value after.
1872 /// This is used to set the pointer to the new ImplicitCtxt.
1873 #[cfg(not(parallel_compiler))]
1875 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1876 let old = get_tlv();
1877 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1878 TLV.with(|tlv| tlv.set(value));
1882 /// This is used to get the pointer to the current ImplicitCtxt.
1883 #[cfg(not(parallel_compiler))]
1884 fn get_tlv() -> usize {
1885 TLV.with(|tlv| tlv.get())
1888 /// This is a callback from libsyntax as it cannot access the implicit state
1889 /// in librustc otherwise
1890 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1892 if let Some(tcx) = tcx {
1893 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1895 syntax_pos::default_span_debug(span, f)
1900 /// This is a callback from libsyntax as it cannot access the implicit state
1901 /// in librustc otherwise. It is used to when diagnostic messages are
1902 /// emitted and stores them in the current query, if there is one.
1903 fn track_diagnostic(diagnostic: &Diagnostic) {
1904 with_context_opt(|icx| {
1905 if let Some(icx) = icx {
1906 if let Some(ref diagnostics) = icx.diagnostics {
1907 let mut diagnostics = diagnostics.lock();
1908 diagnostics.extend(Some(diagnostic.clone()));
1914 /// Sets up the callbacks from libsyntax on the current thread
1915 pub fn with_thread_locals<F, R>(f: F) -> R
1916 where F: FnOnce() -> R
1918 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1919 let original_span_debug = span_dbg.get();
1920 span_dbg.set(span_debug);
1922 let _on_drop = OnDrop(move || {
1923 span_dbg.set(original_span_debug);
1926 TRACK_DIAGNOSTICS.with(|current| {
1927 let original = current.get();
1928 current.set(track_diagnostic);
1930 let _on_drop = OnDrop(move || {
1931 current.set(original);
1939 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1941 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1943 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1945 set_tlv(context as *const _ as usize, || {
1950 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1951 /// creating a initial TyCtxt and ImplicitCtxt.
1952 /// This happens once per rustc session and TyCtxts only exists
1953 /// inside the `f` function.
1954 pub fn enter_global<'gcx, F, R>(gcx: &'gcx GlobalCtxt<'gcx>, f: F) -> R
1955 where F: FnOnce(TyCtxt<'gcx, 'gcx, 'gcx>) -> R
1957 // Update GCX_PTR to indicate there's a GlobalCtxt available
1958 GCX_PTR.with(|lock| {
1959 *lock.lock() = gcx as *const _ as usize;
1961 // Set GCX_PTR back to 0 when we exit
1962 let _on_drop = OnDrop(move || {
1963 GCX_PTR.with(|lock| *lock.lock() = 0);
1968 interners: &gcx.global_interners,
1971 let icx = ImplicitCtxt {
1978 enter_context(&icx, |_| {
1983 scoped_thread_local! {
1984 /// Stores a pointer to the GlobalCtxt if one is available.
1985 /// This is used to access the GlobalCtxt in the deadlock handler given to Rayon.
1986 pub static GCX_PTR: Lock<usize>
1989 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
1990 /// This is used in the deadlock handler.
1991 pub unsafe fn with_global<F, R>(f: F) -> R
1992 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1994 let gcx = GCX_PTR.with(|lock| *lock.lock());
1996 let gcx = &*(gcx as *const GlobalCtxt<'_>);
1999 interners: &gcx.global_interners,
2002 let icx = ImplicitCtxt {
2009 enter_context(&icx, |_| f(tcx))
2012 /// Allows access to the current ImplicitCtxt in a closure if one is available
2014 pub fn with_context_opt<F, R>(f: F) -> R
2015 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2017 let context = get_tlv();
2021 // We could get a ImplicitCtxt pointer from another thread.
2022 // Ensure that ImplicitCtxt is Sync
2023 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2025 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2029 /// Allows access to the current ImplicitCtxt.
2030 /// Panics if there is no ImplicitCtxt available
2032 pub fn with_context<F, R>(f: F) -> R
2033 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2035 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2038 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2039 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2040 /// with the same 'gcx lifetime as the TyCtxt passed in.
2041 /// This will panic if you pass it a TyCtxt which has a different global interner from
2042 /// the current ImplicitCtxt's tcx field.
2044 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2045 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2047 with_context(|context| {
2049 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
2050 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2056 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2057 /// interner and local interner as the tcx argument passed in. This means the closure
2058 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2059 /// This will panic if you pass it a TyCtxt which has a different global interner or
2060 /// a different local interner from the current ImplicitCtxt's tcx field.
2062 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2063 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2065 with_context(|context| {
2067 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
2068 assert!(ptr_eq(context.tcx.interners, tcx.interners));
2069 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2075 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2076 /// Panics if there is no ImplicitCtxt available
2078 pub fn with<F, R>(f: F) -> R
2079 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2081 with_context(|context| f(context.tcx))
2084 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2085 /// The closure is passed None if there is no ImplicitCtxt available
2087 pub fn with_opt<F, R>(f: F) -> R
2088 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2090 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2094 macro_rules! sty_debug_print {
2095 ($ctxt: expr, $($variant: ident),*) => {{
2096 // curious inner module to allow variant names to be used as
2098 #[allow(non_snake_case)]
2100 use crate::ty::{self, TyCtxt};
2101 use crate::ty::context::Interned;
2103 #[derive(Copy, Clone)]
2112 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2113 let mut total = DebugStat {
2120 $(let mut $variant = total;)*
2122 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2123 let variant = match t.sty {
2124 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2125 ty::Float(..) | ty::Str | ty::Never => continue,
2126 ty::Error => /* unimportant */ continue,
2127 $(ty::$variant(..) => &mut $variant,)*
2129 let lt = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2130 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2131 let ct = t.flags.intersects(ty::TypeFlags::HAS_CT_INFER);
2135 if lt { total.lt_infer += 1; variant.lt_infer += 1 }
2136 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2137 if ct { total.ct_infer += 1; variant.ct_infer += 1 }
2138 if lt && ty && ct { total.all_infer += 1; variant.all_infer += 1 }
2140 println!("Ty interner total ty lt ct all");
2141 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2142 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2143 stringify!($variant),
2144 uses = $variant.total,
2145 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2146 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2147 lt = $variant.lt_infer as f64 * 100.0 / total.total as f64,
2148 ct = $variant.ct_infer as f64 * 100.0 / total.total as f64,
2149 all = $variant.all_infer as f64 * 100.0 / total.total as f64);
2151 println!(" total {uses:6} \
2152 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2154 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2155 lt = total.lt_infer as f64 * 100.0 / total.total as f64,
2156 ct = total.ct_infer as f64 * 100.0 / total.total as f64,
2157 all = total.all_infer as f64 * 100.0 / total.total as f64)
2165 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2166 pub fn print_debug_stats(self) {
2169 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2170 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2171 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2173 println!("InternalSubsts interner: #{}", self.interners.substs.borrow().len());
2174 println!("Region interner: #{}", self.interners.region.borrow().len());
2175 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2176 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2177 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2182 /// An entry in an interner.
2183 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2185 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2186 fn clone(&self) -> Self {
2190 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2192 // N.B., an `Interned<Ty>` compares and hashes as a sty.
2193 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2194 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2195 self.0.sty == other.0.sty
2199 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2201 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2202 fn hash<H: Hasher>(&self, s: &mut H) {
2207 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2208 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2213 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2214 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2215 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2216 self.0[..] == other.0[..]
2220 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2222 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2223 fn hash<H: Hasher>(&self, s: &mut H) {
2228 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2229 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2234 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2235 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2240 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, InternalSubsts<'tcx>> {
2241 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2246 impl<'tcx> Borrow<[ProjectionKind]>
2247 for Interned<'tcx, List<ProjectionKind>> {
2248 fn borrow<'a>(&'a self) -> &'a [ProjectionKind] {
2253 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2254 fn borrow<'a>(&'a self) -> &'a RegionKind {
2259 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2260 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2265 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2266 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2267 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2272 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2273 for Interned<'tcx, List<Predicate<'tcx>>> {
2274 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2279 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2280 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2285 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2286 for Interned<'tcx, List<Clause<'tcx>>> {
2287 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2292 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2293 for Interned<'tcx, List<Goal<'tcx>>> {
2294 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2299 macro_rules! intern_method {
2300 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2303 $keep_in_local_tcx:expr) -> $ty:ty) => {
2304 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2305 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2306 let key = ($alloc_to_key)(&v);
2308 // HACK(eddyb) Depend on flags being accurate to
2309 // determine that all contents are in the global tcx.
2310 // See comments on Lift for why we can't use that.
2311 if ($keep_in_local_tcx)(&v) {
2312 self.interners.$name.borrow_mut().intern_ref(key, || {
2313 // Make sure we don't end up with inference
2314 // types/regions in the global tcx.
2315 if self.is_global() {
2316 bug!("Attempted to intern `{:?}` which contains \
2317 inference types/regions in the global type context",
2321 Interned($alloc_method(&self.interners.arena, v))
2324 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2325 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2329 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2331 let i = unsafe { mem::transmute(i) };
2340 macro_rules! direct_interners {
2341 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2342 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2343 fn eq(&self, other: &Self) -> bool {
2348 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2350 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2351 fn hash<H: Hasher>(&self, s: &mut H) {
2359 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2361 $keep_in_local_tcx) -> $ty);)+
2365 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2366 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2369 direct_interners!('tcx,
2370 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2371 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>,
2372 const_: mk_const(|c: &Const<'_>| keep_local(&c)) -> Const<'tcx>
2375 macro_rules! slice_interners {
2376 ($($field:ident: $method:ident($ty:ty)),+) => (
2377 $(intern_method!( 'tcx, $field: $method(
2379 |a, v| List::from_arena(a, v),
2381 |xs: &[$ty]| xs.iter().any(keep_local)) -> List<$ty>);)+
2386 existential_predicates: _intern_existential_predicates(ExistentialPredicate<'tcx>),
2387 predicates: _intern_predicates(Predicate<'tcx>),
2388 type_list: _intern_type_list(Ty<'tcx>),
2389 substs: _intern_substs(Kind<'tcx>),
2390 clauses: _intern_clauses(Clause<'tcx>),
2391 goal_list: _intern_goals(Goal<'tcx>),
2392 projs: _intern_projs(ProjectionKind)
2395 // This isn't a perfect fit: CanonicalVarInfo slices are always
2396 // allocated in the global arena, so this `intern_method!` macro is
2397 // overly general. But we just return false for the code that checks
2398 // whether they belong in the thread-local arena, so no harm done, and
2399 // seems better than open-coding the rest.
2402 canonical_var_infos: _intern_canonical_var_infos(
2403 &[CanonicalVarInfo],
2404 |a, v| List::from_arena(a, v),
2406 |_xs: &[CanonicalVarInfo]| -> bool { false }
2407 ) -> List<CanonicalVarInfo>
2410 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2411 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2412 /// that is, a `fn` type that is equivalent in every way for being
2414 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2415 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2416 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2417 unsafety: hir::Unsafety::Unsafe,
2422 /// Given a closure signature `sig`, returns an equivalent `fn`
2423 /// type with the same signature. Detuples and so forth -- so
2424 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2425 /// a `fn(u32, i32)`.
2426 /// `unsafety` determines the unsafety of the `fn` type. If you pass
2427 /// `hir::Unsafety::Unsafe` in the previous example, then you would get
2428 /// an `unsafe fn (u32, i32)`.
2429 /// It cannot convert a closure that requires unsafe.
2430 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>, unsafety: hir::Unsafety) -> Ty<'tcx> {
2431 let converted_sig = sig.map_bound(|s| {
2432 let params_iter = match s.inputs()[0].sty {
2433 ty::Tuple(params) => {
2434 params.into_iter().cloned()
2447 self.mk_fn_ptr(converted_sig)
2451 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2452 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2455 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2457 ast::IntTy::Isize => self.types.isize,
2458 ast::IntTy::I8 => self.types.i8,
2459 ast::IntTy::I16 => self.types.i16,
2460 ast::IntTy::I32 => self.types.i32,
2461 ast::IntTy::I64 => self.types.i64,
2462 ast::IntTy::I128 => self.types.i128,
2466 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2468 ast::UintTy::Usize => self.types.usize,
2469 ast::UintTy::U8 => self.types.u8,
2470 ast::UintTy::U16 => self.types.u16,
2471 ast::UintTy::U32 => self.types.u32,
2472 ast::UintTy::U64 => self.types.u64,
2473 ast::UintTy::U128 => self.types.u128,
2477 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2479 ast::FloatTy::F32 => self.types.f32,
2480 ast::FloatTy::F64 => self.types.f64,
2485 pub fn mk_str(self) -> Ty<'tcx> {
2490 pub fn mk_static_str(self) -> Ty<'tcx> {
2491 self.mk_imm_ref(self.types.re_static, self.mk_str())
2495 pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2496 // take a copy of substs so that we own the vectors inside
2497 self.mk_ty(Adt(def, substs))
2501 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2502 self.mk_ty(Foreign(def_id))
2505 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2506 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2507 let adt_def = self.adt_def(def_id);
2508 let substs = InternalSubsts::for_item(self, def_id, |param, substs| {
2510 GenericParamDefKind::Lifetime |
2511 GenericParamDefKind::Const => {
2514 GenericParamDefKind::Type { has_default, .. } => {
2515 if param.index == 0 {
2518 assert!(has_default);
2519 self.type_of(param.def_id).subst(self, substs).into()
2524 self.mk_ty(Adt(adt_def, substs))
2528 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2529 self.mk_ty(RawPtr(tm))
2533 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2534 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2538 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2539 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2543 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2544 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2548 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2549 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2553 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2554 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2558 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2559 self.mk_imm_ptr(self.mk_unit())
2563 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2564 self.mk_ty(Array(ty, self.mk_const(
2565 ty::Const::from_usize(self.global_tcx(), n)
2570 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2571 self.mk_ty(Slice(ty))
2575 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2576 self.mk_ty(Tuple(self.intern_type_list(ts)))
2579 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2580 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2584 pub fn mk_unit(self) -> Ty<'tcx> {
2589 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2590 if self.features().never_type {
2593 self.intern_tup(&[])
2598 pub fn mk_bool(self) -> Ty<'tcx> {
2603 pub fn mk_fn_def(self, def_id: DefId,
2604 substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2605 self.mk_ty(FnDef(def_id, substs))
2609 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2610 self.mk_ty(FnPtr(fty))
2616 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2617 reg: ty::Region<'tcx>
2619 self.mk_ty(Dynamic(obj, reg))
2623 pub fn mk_projection(self,
2625 substs: SubstsRef<'tcx>)
2627 self.mk_ty(Projection(ProjectionTy {
2634 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2636 self.mk_ty(Closure(closure_id, closure_substs))
2640 pub fn mk_generator(self,
2642 generator_substs: GeneratorSubsts<'tcx>,
2643 movability: hir::GeneratorMovability)
2645 self.mk_ty(Generator(id, generator_substs, movability))
2649 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2650 self.mk_ty(GeneratorWitness(types))
2654 pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> {
2655 self.mk_infer(TyVar(v))
2659 pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2660 self.mk_const(ty::Const {
2661 val: ConstValue::Infer(InferConst::Var(v)),
2667 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2668 self.mk_infer(IntVar(v))
2672 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2673 self.mk_infer(FloatVar(v))
2677 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2678 self.mk_ty(Infer(it))
2682 pub fn mk_ty_param(self,
2684 name: InternedString) -> Ty<'tcx> {
2685 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2689 pub fn mk_const_param(
2692 name: InternedString,
2694 ) -> &'tcx Const<'tcx> {
2695 self.mk_const(ty::Const {
2696 val: ConstValue::Param(ParamConst { index, name }),
2702 pub fn mk_self_type(self) -> Ty<'tcx> {
2703 self.mk_ty_param(0, keywords::SelfUpper.name().as_interned_str())
2706 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2708 GenericParamDefKind::Lifetime => {
2709 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2711 GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
2712 GenericParamDefKind::Const => {
2713 self.mk_const_param(param.index, param.name, self.type_of(param.def_id)).into()
2719 pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2720 self.mk_ty(Opaque(def_id, substs))
2723 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2724 -> &'tcx List<ExistentialPredicate<'tcx>> {
2725 assert!(!eps.is_empty());
2726 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2727 self._intern_existential_predicates(eps)
2730 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2731 -> &'tcx List<Predicate<'tcx>> {
2732 // FIXME consider asking the input slice to be sorted to avoid
2733 // re-interning permutations, in which case that would be asserted
2735 if preds.len() == 0 {
2736 // The macro-generated method below asserts we don't intern an empty slice.
2739 self._intern_predicates(preds)
2743 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2747 self._intern_type_list(ts)
2751 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2755 self._intern_substs(ts)
2759 pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
2763 self._intern_projs(ps)
2767 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2771 self.global_tcx()._intern_canonical_var_infos(ts)
2775 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2779 self._intern_clauses(ts)
2783 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2787 self._intern_goals(ts)
2791 pub fn mk_fn_sig<I>(self,
2795 unsafety: hir::Unsafety,
2797 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2799 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2801 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2802 inputs_and_output: self.intern_type_list(xs),
2803 c_variadic, unsafety, abi
2807 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2808 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2810 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2813 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2814 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2816 iter.intern_with(|xs| self.intern_predicates(xs))
2819 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2820 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2821 iter.intern_with(|xs| self.intern_type_list(xs))
2824 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2825 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2826 iter.intern_with(|xs| self.intern_substs(xs))
2829 pub fn mk_substs_trait(self,
2831 rest: &[Kind<'tcx>])
2834 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2837 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2838 iter.intern_with(|xs| self.intern_clauses(xs))
2841 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2842 iter.intern_with(|xs| self.intern_goals(xs))
2845 pub fn lint_hir<S: Into<MultiSpan>>(self,
2846 lint: &'static Lint,
2850 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2853 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2854 lint: &'static Lint,
2859 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2864 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2865 lint: &'static Lint,
2870 let mut err = self.struct_span_lint_hir(lint, id, span.into(), msg);
2875 /// Walks upwards from `id` to find a node which might change lint levels with attributes.
2876 /// It stops at `bound` and just returns it if reached.
2877 pub fn maybe_lint_level_root_bounded(
2886 if lint::maybe_lint_level_root(self, id) {
2889 let next = self.hir().get_parent_node_by_hir_id(id);
2891 bug!("lint traversal reached the root of the crate");
2897 pub fn lint_level_at_node(
2899 lint: &'static Lint,
2901 ) -> (lint::Level, lint::LintSource) {
2902 let sets = self.lint_levels(LOCAL_CRATE);
2904 if let Some(pair) = sets.level_and_source(lint, id, self.sess) {
2907 let next = self.hir().get_parent_node_by_hir_id(id);
2909 bug!("lint traversal reached the root of the crate");
2915 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2916 lint: &'static Lint,
2920 -> DiagnosticBuilder<'tcx>
2922 let (level, src) = self.lint_level_at_node(lint, hir_id);
2923 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2926 pub fn struct_lint_node(self, lint: &'static Lint, id: HirId, msg: &str)
2927 -> DiagnosticBuilder<'tcx>
2929 let (level, src) = self.lint_level_at_node(lint, id);
2930 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2933 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2934 self.in_scope_traits_map(id.owner)
2935 .and_then(|map| map.get(&id.local_id).cloned())
2938 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2939 self.named_region_map(id.owner)
2940 .and_then(|map| map.get(&id.local_id).cloned())
2943 pub fn is_late_bound(self, id: HirId) -> bool {
2944 self.is_late_bound_map(id.owner)
2945 .map(|set| set.contains(&id.local_id))
2949 pub fn object_lifetime_defaults(self, id: HirId)
2950 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2952 self.object_lifetime_defaults_map(id.owner)
2953 .and_then(|map| map.get(&id.local_id).cloned())
2957 pub trait InternAs<T: ?Sized, R> {
2959 fn intern_with<F>(self, f: F) -> Self::Output
2960 where F: FnOnce(&T) -> R;
2963 impl<I, T, R, E> InternAs<[T], R> for I
2964 where E: InternIteratorElement<T, R>,
2965 I: Iterator<Item=E> {
2966 type Output = E::Output;
2967 fn intern_with<F>(self, f: F) -> Self::Output
2968 where F: FnOnce(&[T]) -> R {
2969 E::intern_with(self, f)
2973 pub trait InternIteratorElement<T, R>: Sized {
2975 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2978 impl<T, R> InternIteratorElement<T, R> for T {
2980 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2981 f(&iter.collect::<SmallVec<[_; 8]>>())
2985 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2989 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2990 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2994 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2995 type Output = Result<R, E>;
2996 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2997 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
3001 // We are comparing types with different invariant lifetimes, so `ptr::eq`
3002 // won't work for us.
3003 fn ptr_eq<T, U>(t: *const T, u: *const U) -> bool {
3004 t as *const () == u as *const ()
3007 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3008 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
3009 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
3010 providers.crate_name = |tcx, id| {
3011 assert_eq!(id, LOCAL_CRATE);
3014 providers.get_lib_features = |tcx, id| {
3015 assert_eq!(id, LOCAL_CRATE);
3016 Lrc::new(middle::lib_features::collect(tcx))
3018 providers.get_lang_items = |tcx, id| {
3019 assert_eq!(id, LOCAL_CRATE);
3020 Lrc::new(middle::lang_items::collect(tcx))
3022 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3023 providers.maybe_unused_trait_import = |tcx, id| {
3024 tcx.maybe_unused_trait_imports.contains(&id)
3026 providers.maybe_unused_extern_crates = |tcx, cnum| {
3027 assert_eq!(cnum, LOCAL_CRATE);
3028 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3030 providers.names_imported_by_glob_use = |tcx, id| {
3031 assert_eq!(id.krate, LOCAL_CRATE);
3032 Lrc::new(tcx.glob_map.get(&id).cloned().unwrap_or_default())
3035 providers.stability_index = |tcx, cnum| {
3036 assert_eq!(cnum, LOCAL_CRATE);
3037 Lrc::new(stability::Index::new(tcx))
3039 providers.lookup_stability = |tcx, id| {
3040 assert_eq!(id.krate, LOCAL_CRATE);
3041 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3042 tcx.stability().local_stability(id)
3044 providers.lookup_deprecation_entry = |tcx, id| {
3045 assert_eq!(id.krate, LOCAL_CRATE);
3046 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3047 tcx.stability().local_deprecation_entry(id)
3049 providers.extern_mod_stmt_cnum = |tcx, id| {
3050 let id = tcx.hir().as_local_node_id(id).unwrap();
3051 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3053 providers.all_crate_nums = |tcx, cnum| {
3054 assert_eq!(cnum, LOCAL_CRATE);
3055 Lrc::new(tcx.cstore.crates_untracked())
3057 providers.postorder_cnums = |tcx, cnum| {
3058 assert_eq!(cnum, LOCAL_CRATE);
3059 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3061 providers.output_filenames = |tcx, cnum| {
3062 assert_eq!(cnum, LOCAL_CRATE);
3063 tcx.output_filenames.clone()
3065 providers.features_query = |tcx, cnum| {
3066 assert_eq!(cnum, LOCAL_CRATE);
3067 Lrc::new(tcx.sess.features_untracked().clone())
3069 providers.is_panic_runtime = |tcx, cnum| {
3070 assert_eq!(cnum, LOCAL_CRATE);
3071 attr::contains_name(tcx.hir().krate_attrs(), "panic_runtime")
3073 providers.is_compiler_builtins = |tcx, cnum| {
3074 assert_eq!(cnum, LOCAL_CRATE);
3075 attr::contains_name(tcx.hir().krate_attrs(), "compiler_builtins")