1 // ignore-tidy-filelength
2 //! Type context book-keeping.
4 use crate::arena::Arena;
5 use crate::dep_graph::DepGraph;
6 use crate::dep_graph::{self, DepNode, DepConstructor};
7 use crate::session::Session;
8 use crate::session::config::{BorrowckMode, OutputFilenames};
9 use crate::session::config::CrateType;
11 use crate::hir::{self, TraitCandidate, HirId, ItemKind, ItemLocalId, Node};
12 use crate::hir::def::{Res, DefKind, Export};
13 use crate::hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
14 use crate::hir::map as hir_map;
15 use crate::hir::map::DefPathHash;
16 use crate::lint::{self, Lint};
17 use crate::ich::{StableHashingContext, NodeIdHashingMode};
18 use crate::infer::canonical::{Canonical, CanonicalVarInfo, CanonicalVarInfos};
19 use crate::infer::outlives::free_region_map::FreeRegionMap;
20 use crate::middle::cstore::CrateStoreDyn;
21 use crate::middle::cstore::EncodedMetadata;
22 use crate::middle::lang_items;
23 use crate::middle::resolve_lifetime::{self, ObjectLifetimeDefault};
24 use crate::middle::stability;
25 use crate::mir::{Body, Field, interpret, Local, Place, PlaceElem, ProjectionKind, Promoted};
26 use crate::mir::interpret::{ConstValue, Allocation, Scalar};
27 use crate::ty::subst::{GenericArg, InternalSubsts, SubstsRef, Subst};
28 use crate::ty::ReprOptions;
30 use crate::traits::{Clause, Clauses, GoalKind, Goal, Goals};
31 use crate::ty::{self, DefIdTree, Ty, TypeAndMut};
32 use crate::ty::{TyS, TyKind, List};
33 use crate::ty::{AdtKind, AdtDef, Region, Const};
34 use crate::ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
35 use crate::ty::RegionKind;
36 use crate::ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid, ConstVid};
37 use crate::ty::TyKind::*;
38 use crate::ty::{InferConst, ParamConst};
39 use crate::ty::GenericParamDefKind;
40 use crate::ty::layout::{LayoutDetails, TargetDataLayout, VariantIdx};
42 use crate::ty::steal::Steal;
43 use crate::ty::subst::{UserSubsts, GenericArgKind};
44 use crate::ty::{BoundVar, BindingMode};
45 use crate::ty::CanonicalPolyFnSig;
46 use crate::util::common::ErrorReported;
47 use crate::util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap, ItemLocalSet, NodeMap};
48 use crate::util::nodemap::{FxHashMap, FxHashSet};
50 use errors::DiagnosticBuilder;
51 use arena::SyncDroplessArena;
52 use smallvec::SmallVec;
53 use rustc_data_structures::profiling::SelfProfilerRef;
54 use rustc_data_structures::stable_hasher::{
55 HashStable, StableHasher, StableVec, hash_stable_hashmap,
57 use rustc_index::vec::{Idx, IndexVec};
58 use rustc_data_structures::sharded::ShardedHashMap;
59 use rustc_data_structures::sync::{Lrc, Lock, WorkerLocal};
61 use std::borrow::Borrow;
62 use std::cmp::Ordering;
63 use std::collections::hash_map::{self, Entry};
64 use std::hash::{Hash, Hasher};
67 use std::ops::{Deref, Bound};
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, kw, sym};
78 use syntax::expand::allocator::AllocatorKind;
80 pub struct AllArenas {
81 pub interner: SyncDroplessArena,
85 pub fn new() -> Self {
87 interner: SyncDroplessArena::default(),
92 type InternedSet<'tcx, T> = ShardedHashMap<Interned<'tcx, T>, ()>;
94 pub struct CtxtInterners<'tcx> {
95 /// The arena that types, regions, etc. are allocated from.
96 arena: &'tcx SyncDroplessArena,
98 /// Specifically use a speedy hash algorithm for these hash sets, since
99 /// they're accessed quite often.
100 type_: InternedSet<'tcx, TyS<'tcx>>,
101 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
102 substs: InternedSet<'tcx, InternalSubsts<'tcx>>,
103 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
104 region: InternedSet<'tcx, RegionKind>,
105 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
106 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
107 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
108 goal: InternedSet<'tcx, GoalKind<'tcx>>,
109 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
110 projs: InternedSet<'tcx, List<ProjectionKind>>,
111 place_elems: InternedSet<'tcx, List<PlaceElem<'tcx>>>,
112 const_: InternedSet<'tcx, Const<'tcx>>,
115 impl<'tcx> CtxtInterners<'tcx> {
116 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
119 type_: Default::default(),
120 type_list: Default::default(),
121 substs: Default::default(),
122 region: Default::default(),
123 existential_predicates: Default::default(),
124 canonical_var_infos: Default::default(),
125 predicates: Default::default(),
126 clauses: Default::default(),
127 goal: Default::default(),
128 goal_list: Default::default(),
129 projs: Default::default(),
130 place_elems: Default::default(),
131 const_: Default::default(),
136 #[allow(rustc::usage_of_ty_tykind)]
141 self.type_.intern(kind, |kind| {
142 let flags = super::flags::FlagComputation::for_kind(&kind);
144 let ty_struct = TyS {
147 outer_exclusive_binder: flags.outer_exclusive_binder,
150 Interned(self.arena.alloc(ty_struct))
155 pub struct CommonTypes<'tcx> {
174 pub self_param: Ty<'tcx>,
177 /// Dummy type used for the `Self` of a `TraitRef` created for converting
178 /// a trait object, and which gets removed in `ExistentialTraitRef`.
179 /// This type must not appear anywhere in other converted types.
180 pub trait_object_dummy_self: Ty<'tcx>,
183 pub struct CommonLifetimes<'tcx> {
184 pub re_empty: Region<'tcx>,
185 pub re_static: Region<'tcx>,
186 pub re_erased: Region<'tcx>,
189 pub struct CommonConsts<'tcx> {
190 pub err: &'tcx Const<'tcx>,
193 pub struct LocalTableInContext<'a, V> {
194 local_id_root: Option<DefId>,
195 data: &'a ItemLocalMap<V>
198 /// Validate that the given HirId (respectively its `local_id` part) can be
199 /// safely used as a key in the tables of a TypeckTable. For that to be
200 /// the case, the HirId must have the same `owner` as all the other IDs in
201 /// this table (signified by `local_id_root`). Otherwise the HirId
202 /// would be in a different frame of reference and using its `local_id`
203 /// would result in lookup errors, or worse, in silently wrong data being
205 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
208 if let Some(local_id_root) = local_id_root {
209 if hir_id.owner != local_id_root.index {
210 ty::tls::with(|tcx| {
211 bug!("node {} with HirId::owner {:?} cannot be placed in \
212 TypeckTables with local_id_root {:?}",
213 tcx.hir().node_to_string(hir_id),
214 DefId::local(hir_id.owner),
219 // We use "Null Object" TypeckTables in some of the analysis passes.
220 // These are just expected to be empty and their `local_id_root` is
221 // `None`. Therefore we cannot verify whether a given `HirId` would
222 // be a valid key for the given table. Instead we make sure that
223 // nobody tries to write to such a Null Object table.
225 bug!("access to invalid TypeckTables")
230 impl<'a, V> LocalTableInContext<'a, V> {
231 pub fn contains_key(&self, id: hir::HirId) -> bool {
232 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
233 self.data.contains_key(&id.local_id)
236 pub fn get(&self, id: hir::HirId) -> Option<&V> {
237 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
238 self.data.get(&id.local_id)
241 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
246 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
249 fn index(&self, key: hir::HirId) -> &V {
250 self.get(key).expect("LocalTableInContext: key not found")
254 pub struct LocalTableInContextMut<'a, V> {
255 local_id_root: Option<DefId>,
256 data: &'a mut ItemLocalMap<V>
259 impl<'a, V> LocalTableInContextMut<'a, V> {
260 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
261 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
262 self.data.get_mut(&id.local_id)
265 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
266 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
267 self.data.entry(id.local_id)
270 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
271 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
272 self.data.insert(id.local_id, val)
275 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
276 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
277 self.data.remove(&id.local_id)
281 /// All information necessary to validate and reveal an `impl Trait`.
282 #[derive(RustcEncodable, RustcDecodable, Debug, HashStable)]
283 pub struct ResolvedOpaqueTy<'tcx> {
284 /// The revealed type as seen by this function.
285 pub concrete_type: Ty<'tcx>,
286 /// Generic parameters on the opaque type as passed by this function.
287 /// For `type Foo<A, B> = impl Bar<A, B>; fn foo<T, U>() -> Foo<T, U> { .. }`
288 /// this is `[T, U]`, not `[A, B]`.
289 pub substs: SubstsRef<'tcx>,
292 /// Whenever a value may be live across a generator yield, the type of that value winds up in the
293 /// `GeneratorInteriorTypeCause` struct. This struct adds additional information about such
294 /// captured types that can be useful for diagnostics. In particular, it stores the span that
295 /// caused a given type to be recorded, along with the scope that enclosed the value (which can
296 /// be used to find the await that the value is live across).
300 /// ```ignore (pseudo-Rust)
308 /// Here, we would store the type `T`, the span of the value `x`, and the "scope-span" for
309 /// the scope that contains `x`.
310 #[derive(RustcEncodable, RustcDecodable, Clone, Debug, Eq, Hash, PartialEq)]
311 #[derive(HashStable, TypeFoldable)]
312 pub struct GeneratorInteriorTypeCause<'tcx> {
313 /// Type of the captured binding.
315 /// Span of the binding that was captured.
317 /// Span of the scope of the captured binding.
318 pub scope_span: Option<Span>,
321 #[derive(RustcEncodable, RustcDecodable, Debug)]
322 pub struct TypeckTables<'tcx> {
323 /// The HirId::owner all ItemLocalIds in this table are relative to.
324 pub local_id_root: Option<DefId>,
326 /// Resolved definitions for `<T>::X` associated paths and
327 /// method calls, including those of overloaded operators.
328 type_dependent_defs: ItemLocalMap<Result<(DefKind, DefId), ErrorReported>>,
330 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
331 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
332 /// about the field you also need definition of the variant to which the field
333 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
334 field_indices: ItemLocalMap<usize>,
336 /// Stores the types for various nodes in the AST. Note that this table
337 /// is not guaranteed to be populated until after typeck. See
338 /// typeck::check::fn_ctxt for details.
339 node_types: ItemLocalMap<Ty<'tcx>>,
341 /// Stores the type parameters which were substituted to obtain the type
342 /// of this node. This only applies to nodes that refer to entities
343 /// parameterized by type parameters, such as generic fns, types, or
345 node_substs: ItemLocalMap<SubstsRef<'tcx>>,
347 /// This will either store the canonicalized types provided by the user
348 /// or the substitutions that the user explicitly gave (if any) attached
349 /// to `id`. These will not include any inferred values. The canonical form
350 /// is used to capture things like `_` or other unspecified values.
352 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
353 /// canonical substitutions would include only `for<X> { Vec<X> }`.
355 /// See also `AscribeUserType` statement in MIR.
356 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
358 /// Stores the canonicalized types provided by the user. See also
359 /// `AscribeUserType` statement in MIR.
360 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
362 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
364 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
365 pat_binding_modes: ItemLocalMap<BindingMode>,
367 /// Stores the types which were implicitly dereferenced in pattern binding modes
368 /// for later usage in HAIR lowering. For example,
371 /// match &&Some(5i32) {
376 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
379 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
380 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
383 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
385 /// Records the reasons that we picked the kind of each closure;
386 /// not all closures are present in the map.
387 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
389 /// For each fn, records the "liberated" types of its arguments
390 /// and return type. Liberated means that all bound regions
391 /// (including late-bound regions) are replaced with free
392 /// equivalents. This table is not used in codegen (since regions
393 /// are erased there) and hence is not serialized to metadata.
394 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
396 /// For each FRU expression, record the normalized types of the fields
397 /// of the struct - this is needed because it is non-trivial to
398 /// normalize while preserving regions. This table is used only in
399 /// MIR construction and hence is not serialized to metadata.
400 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
402 /// For every coercion cast we add the HIR node ID of the cast
403 /// expression to this set.
404 coercion_casts: ItemLocalSet,
406 /// Set of trait imports actually used in the method resolution.
407 /// This is used for warning unused imports. During type
408 /// checking, this `Lrc` should not be cloned: it must have a ref-count
409 /// of 1 so that we can insert things into the set mutably.
410 pub used_trait_imports: Lrc<DefIdSet>,
412 /// If any errors occurred while type-checking this body,
413 /// this field will be set to `true`.
414 pub tainted_by_errors: bool,
416 /// Stores the free-region relationships that were deduced from
417 /// its where-clauses and parameter types. These are then
418 /// read-again by borrowck.
419 pub free_region_map: FreeRegionMap<'tcx>,
421 /// All the opaque types that are restricted to concrete types
422 /// by this function.
423 pub concrete_opaque_types: FxHashMap<DefId, ResolvedOpaqueTy<'tcx>>,
425 /// Given the closure ID this map provides the list of UpvarIDs used by it.
426 /// The upvarID contains the HIR node ID and it also contains the full path
427 /// leading to the member of the struct or tuple that is used instead of the
429 pub upvar_list: ty::UpvarListMap,
431 /// Stores the type, span and optional scope span of all types
432 /// that are live across the yield of this generator (if a generator).
433 pub generator_interior_types: Vec<GeneratorInteriorTypeCause<'tcx>>,
436 impl<'tcx> TypeckTables<'tcx> {
437 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
440 type_dependent_defs: Default::default(),
441 field_indices: Default::default(),
442 user_provided_types: Default::default(),
443 user_provided_sigs: Default::default(),
444 node_types: Default::default(),
445 node_substs: Default::default(),
446 adjustments: Default::default(),
447 pat_binding_modes: Default::default(),
448 pat_adjustments: Default::default(),
449 upvar_capture_map: Default::default(),
450 closure_kind_origins: Default::default(),
451 liberated_fn_sigs: Default::default(),
452 fru_field_types: Default::default(),
453 coercion_casts: Default::default(),
454 used_trait_imports: Lrc::new(Default::default()),
455 tainted_by_errors: false,
456 free_region_map: Default::default(),
457 concrete_opaque_types: Default::default(),
458 upvar_list: Default::default(),
459 generator_interior_types: Default::default(),
463 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
464 pub fn qpath_res(&self, qpath: &hir::QPath, id: hir::HirId) -> Res {
466 hir::QPath::Resolved(_, ref path) => path.res,
467 hir::QPath::TypeRelative(..) => self.type_dependent_def(id)
468 .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)),
472 pub fn type_dependent_defs(
474 ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> {
475 LocalTableInContext {
476 local_id_root: self.local_id_root,
477 data: &self.type_dependent_defs
481 pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> {
482 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
483 self.type_dependent_defs.get(&id.local_id).cloned().and_then(|r| r.ok())
486 pub fn type_dependent_def_id(&self, id: HirId) -> Option<DefId> {
487 self.type_dependent_def(id).map(|(_, def_id)| def_id)
490 pub fn type_dependent_defs_mut(
492 ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> {
493 LocalTableInContextMut {
494 local_id_root: self.local_id_root,
495 data: &mut self.type_dependent_defs
499 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
500 LocalTableInContext {
501 local_id_root: self.local_id_root,
502 data: &self.field_indices
506 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
507 LocalTableInContextMut {
508 local_id_root: self.local_id_root,
509 data: &mut self.field_indices
513 pub fn user_provided_types(
515 ) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
516 LocalTableInContext {
517 local_id_root: self.local_id_root,
518 data: &self.user_provided_types
522 pub fn user_provided_types_mut(
524 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
525 LocalTableInContextMut {
526 local_id_root: self.local_id_root,
527 data: &mut self.user_provided_types
531 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
532 LocalTableInContext {
533 local_id_root: self.local_id_root,
534 data: &self.node_types
538 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
539 LocalTableInContextMut {
540 local_id_root: self.local_id_root,
541 data: &mut self.node_types
545 pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
546 self.node_type_opt(id).unwrap_or_else(||
547 bug!("node_type: no type for node `{}`",
548 tls::with(|tcx| tcx.hir().node_to_string(id)))
552 pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
553 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
554 self.node_types.get(&id.local_id).cloned()
557 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> {
558 LocalTableInContextMut {
559 local_id_root: self.local_id_root,
560 data: &mut self.node_substs
564 pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> {
565 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
566 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| InternalSubsts::empty())
569 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<SubstsRef<'tcx>> {
570 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
571 self.node_substs.get(&id.local_id).cloned()
574 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
575 // doesn't provide type parameter substitutions.
576 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
577 self.node_type(pat.hir_id)
580 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
581 self.node_type_opt(pat.hir_id)
584 // Returns the type of an expression as a monotype.
586 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
587 // some cases, we insert `Adjustment` annotations such as auto-deref or
588 // auto-ref. The type returned by this function does not consider such
589 // adjustments. See `expr_ty_adjusted()` instead.
591 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
592 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
593 // instead of "fn(ty) -> T with T = isize".
594 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
595 self.node_type(expr.hir_id)
598 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
599 self.node_type_opt(expr.hir_id)
602 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
603 LocalTableInContext {
604 local_id_root: self.local_id_root,
605 data: &self.adjustments
609 pub fn adjustments_mut(&mut self)
610 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
611 LocalTableInContextMut {
612 local_id_root: self.local_id_root,
613 data: &mut self.adjustments
617 pub fn expr_adjustments(&self, expr: &hir::Expr)
618 -> &[ty::adjustment::Adjustment<'tcx>] {
619 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
620 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
623 /// Returns the type of `expr`, considering any `Adjustment`
624 /// entry recorded for that expression.
625 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
626 self.expr_adjustments(expr)
628 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
631 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
632 self.expr_adjustments(expr)
634 .map(|adj| adj.target)
635 .or_else(|| self.expr_ty_opt(expr))
638 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
639 // Only paths and method calls/overloaded operators have
640 // entries in type_dependent_defs, ignore the former here.
641 if let hir::ExprKind::Path(_) = expr.kind {
645 match self.type_dependent_defs().get(expr.hir_id) {
646 Some(Ok((DefKind::Method, _))) => true,
651 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
652 LocalTableInContext {
653 local_id_root: self.local_id_root,
654 data: &self.pat_binding_modes
658 pub fn pat_binding_modes_mut(&mut self)
659 -> LocalTableInContextMut<'_, BindingMode> {
660 LocalTableInContextMut {
661 local_id_root: self.local_id_root,
662 data: &mut self.pat_binding_modes
666 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
667 LocalTableInContext {
668 local_id_root: self.local_id_root,
669 data: &self.pat_adjustments,
673 pub fn pat_adjustments_mut(&mut self)
674 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
675 LocalTableInContextMut {
676 local_id_root: self.local_id_root,
677 data: &mut self.pat_adjustments,
681 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
682 self.upvar_capture_map[&upvar_id]
685 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
686 LocalTableInContext {
687 local_id_root: self.local_id_root,
688 data: &self.closure_kind_origins
692 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
693 LocalTableInContextMut {
694 local_id_root: self.local_id_root,
695 data: &mut self.closure_kind_origins
699 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
700 LocalTableInContext {
701 local_id_root: self.local_id_root,
702 data: &self.liberated_fn_sigs
706 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
707 LocalTableInContextMut {
708 local_id_root: self.local_id_root,
709 data: &mut self.liberated_fn_sigs
713 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
714 LocalTableInContext {
715 local_id_root: self.local_id_root,
716 data: &self.fru_field_types
720 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
721 LocalTableInContextMut {
722 local_id_root: self.local_id_root,
723 data: &mut self.fru_field_types
727 pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool {
728 validate_hir_id_for_typeck_tables(self.local_id_root, hir_id, true);
729 self.coercion_casts.contains(&hir_id.local_id)
732 pub fn set_coercion_cast(&mut self, id: ItemLocalId) {
733 self.coercion_casts.insert(id);
736 pub fn coercion_casts(&self) -> &ItemLocalSet {
742 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for TypeckTables<'tcx> {
743 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
744 let ty::TypeckTables {
746 ref type_dependent_defs,
748 ref user_provided_types,
749 ref user_provided_sigs,
753 ref pat_binding_modes,
755 ref upvar_capture_map,
756 ref closure_kind_origins,
757 ref liberated_fn_sigs,
762 ref used_trait_imports,
765 ref concrete_opaque_types,
767 ref generator_interior_types,
771 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
772 type_dependent_defs.hash_stable(hcx, hasher);
773 field_indices.hash_stable(hcx, hasher);
774 user_provided_types.hash_stable(hcx, hasher);
775 user_provided_sigs.hash_stable(hcx, hasher);
776 node_types.hash_stable(hcx, hasher);
777 node_substs.hash_stable(hcx, hasher);
778 adjustments.hash_stable(hcx, hasher);
779 pat_binding_modes.hash_stable(hcx, hasher);
780 pat_adjustments.hash_stable(hcx, hasher);
781 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
788 local_id_root.expect("trying to hash invalid TypeckTables");
790 let var_owner_def_id = DefId {
791 krate: local_id_root.krate,
792 index: var_path.hir_id.owner,
794 let closure_def_id = DefId {
795 krate: local_id_root.krate,
796 index: closure_expr_id.to_def_id().index,
798 (hcx.def_path_hash(var_owner_def_id),
799 var_path.hir_id.local_id,
800 hcx.def_path_hash(closure_def_id))
803 closure_kind_origins.hash_stable(hcx, hasher);
804 liberated_fn_sigs.hash_stable(hcx, hasher);
805 fru_field_types.hash_stable(hcx, hasher);
806 coercion_casts.hash_stable(hcx, hasher);
807 used_trait_imports.hash_stable(hcx, hasher);
808 tainted_by_errors.hash_stable(hcx, hasher);
809 free_region_map.hash_stable(hcx, hasher);
810 concrete_opaque_types.hash_stable(hcx, hasher);
811 upvar_list.hash_stable(hcx, hasher);
812 generator_interior_types.hash_stable(hcx, hasher);
817 rustc_index::newtype_index! {
818 pub struct UserTypeAnnotationIndex {
820 DEBUG_FORMAT = "UserType({})",
821 const START_INDEX = 0,
825 /// Mapping of type annotation indices to canonical user type annotations.
826 pub type CanonicalUserTypeAnnotations<'tcx> =
827 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
829 #[derive(Clone, Debug, RustcEncodable, RustcDecodable, HashStable, TypeFoldable, Lift)]
830 pub struct CanonicalUserTypeAnnotation<'tcx> {
831 pub user_ty: CanonicalUserType<'tcx>,
833 pub inferred_ty: Ty<'tcx>,
836 /// Canonicalized user type annotation.
837 pub type CanonicalUserType<'tcx> = Canonical<'tcx, UserType<'tcx>>;
839 impl CanonicalUserType<'tcx> {
840 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
841 /// i.e., each thing is mapped to a canonical variable with the same index.
842 pub fn is_identity(&self) -> bool {
844 UserType::Ty(_) => false,
845 UserType::TypeOf(_, user_substs) => {
846 if user_substs.user_self_ty.is_some() {
850 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
851 match kind.unpack() {
852 GenericArgKind::Type(ty) => match ty.kind {
853 ty::Bound(debruijn, b) => {
854 // We only allow a `ty::INNERMOST` index in substitutions.
855 assert_eq!(debruijn, ty::INNERMOST);
861 GenericArgKind::Lifetime(r) => match r {
862 ty::ReLateBound(debruijn, br) => {
863 // We only allow a `ty::INNERMOST` index in substitutions.
864 assert_eq!(*debruijn, ty::INNERMOST);
865 cvar == br.assert_bound_var()
870 GenericArgKind::Const(ct) => match ct.val {
871 ty::ConstKind::Bound(debruijn, b) => {
872 // We only allow a `ty::INNERMOST` index in substitutions.
873 assert_eq!(debruijn, ty::INNERMOST);
885 /// A user-given type annotation attached to a constant. These arise
886 /// from constants that are named via paths, like `Foo::<A>::new` and
888 #[derive(Copy, Clone, Debug, PartialEq, RustcEncodable, RustcDecodable)]
889 #[derive(HashStable, TypeFoldable, Lift)]
890 pub enum UserType<'tcx> {
893 /// The canonical type is the result of `type_of(def_id)` with the
894 /// given substitutions applied.
895 TypeOf(DefId, UserSubsts<'tcx>),
898 impl<'tcx> CommonTypes<'tcx> {
899 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
900 let mk = |ty| interners.intern_ty(ty);
903 unit: mk(Tuple(List::empty())),
908 isize: mk(Int(ast::IntTy::Isize)),
909 i8: mk(Int(ast::IntTy::I8)),
910 i16: mk(Int(ast::IntTy::I16)),
911 i32: mk(Int(ast::IntTy::I32)),
912 i64: mk(Int(ast::IntTy::I64)),
913 i128: mk(Int(ast::IntTy::I128)),
914 usize: mk(Uint(ast::UintTy::Usize)),
915 u8: mk(Uint(ast::UintTy::U8)),
916 u16: mk(Uint(ast::UintTy::U16)),
917 u32: mk(Uint(ast::UintTy::U32)),
918 u64: mk(Uint(ast::UintTy::U64)),
919 u128: mk(Uint(ast::UintTy::U128)),
920 f32: mk(Float(ast::FloatTy::F32)),
921 f64: mk(Float(ast::FloatTy::F64)),
922 self_param: mk(ty::Param(ty::ParamTy {
927 trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
932 impl<'tcx> CommonLifetimes<'tcx> {
933 fn new(interners: &CtxtInterners<'tcx>) -> CommonLifetimes<'tcx> {
935 interners.region.intern(r, |r| {
936 Interned(interners.arena.alloc(r))
941 re_empty: mk(RegionKind::ReEmpty),
942 re_static: mk(RegionKind::ReStatic),
943 re_erased: mk(RegionKind::ReErased),
948 impl<'tcx> CommonConsts<'tcx> {
949 fn new(interners: &CtxtInterners<'tcx>, types: &CommonTypes<'tcx>) -> CommonConsts<'tcx> {
951 interners.const_.intern(c, |c| {
952 Interned(interners.arena.alloc(c))
957 err: mk_const(ty::Const {
958 val: ty::ConstKind::Value(ConstValue::Scalar(Scalar::zst())),
965 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
968 pub struct FreeRegionInfo {
969 // def id corresponding to FreeRegion
971 // the bound region corresponding to FreeRegion
972 pub boundregion: ty::BoundRegion,
973 // checks if bound region is in Impl Item
974 pub is_impl_item: bool,
977 /// The central data structure of the compiler. It stores references
978 /// to the various **arenas** and also houses the results of the
979 /// various **compiler queries** that have been performed. See the
980 /// [rustc guide] for more details.
982 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
983 #[derive(Copy, Clone)]
984 #[rustc_diagnostic_item = "TyCtxt"]
985 pub struct TyCtxt<'tcx> {
986 gcx: &'tcx GlobalCtxt<'tcx>,
989 impl<'tcx> Deref for TyCtxt<'tcx> {
990 type Target = &'tcx GlobalCtxt<'tcx>;
992 fn deref(&self) -> &Self::Target {
997 pub struct GlobalCtxt<'tcx> {
998 pub arena: WorkerLocal<Arena<'tcx>>,
1000 interners: CtxtInterners<'tcx>,
1002 cstore: Box<CrateStoreDyn>,
1004 pub sess: &'tcx Session,
1006 pub lint_store: Lrc<lint::LintStore>,
1008 pub dep_graph: DepGraph,
1010 pub prof: SelfProfilerRef,
1012 /// Common types, pre-interned for your convenience.
1013 pub types: CommonTypes<'tcx>,
1015 /// Common lifetimes, pre-interned for your convenience.
1016 pub lifetimes: CommonLifetimes<'tcx>,
1018 /// Common consts, pre-interned for your convenience.
1019 pub consts: CommonConsts<'tcx>,
1021 /// Resolutions of `extern crate` items produced by resolver.
1022 extern_crate_map: NodeMap<CrateNum>,
1024 /// Map indicating what traits are in scope for places where this
1025 /// is relevant; generated by resolve.
1026 trait_map: FxHashMap<DefIndex,
1027 FxHashMap<ItemLocalId,
1028 StableVec<TraitCandidate>>>,
1030 /// Export map produced by name resolution.
1031 export_map: FxHashMap<DefId, Vec<Export<hir::HirId>>>,
1033 hir_map: hir_map::Map<'tcx>,
1035 /// A map from `DefPathHash` -> `DefId`. Includes `DefId`s from the local crate
1036 /// as well as all upstream crates. Only populated in incremental mode.
1037 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
1039 pub queries: query::Queries<'tcx>,
1041 maybe_unused_trait_imports: FxHashSet<DefId>,
1042 maybe_unused_extern_crates: Vec<(DefId, Span)>,
1043 /// A map of glob use to a set of names it actually imports. Currently only
1044 /// used in save-analysis.
1045 glob_map: FxHashMap<DefId, FxHashSet<ast::Name>>,
1046 /// Extern prelude entries. The value is `true` if the entry was introduced
1047 /// via `extern crate` item and not `--extern` option or compiler built-in.
1048 pub extern_prelude: FxHashMap<ast::Name, bool>,
1050 // Internal cache for metadata decoding. No need to track deps on this.
1051 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
1053 /// Caches the results of trait selection. This cache is used
1054 /// for things that do not have to do with the parameters in scope.
1055 pub selection_cache: traits::SelectionCache<'tcx>,
1057 /// Caches the results of trait evaluation. This cache is used
1058 /// for things that do not have to do with the parameters in scope.
1059 /// Merge this with `selection_cache`?
1060 pub evaluation_cache: traits::EvaluationCache<'tcx>,
1062 /// The definite name of the current crate after taking into account
1063 /// attributes, commandline parameters, etc.
1064 pub crate_name: Symbol,
1066 /// Data layout specification for the current target.
1067 pub data_layout: TargetDataLayout,
1069 stability_interner: ShardedHashMap<&'tcx attr::Stability, ()>,
1071 /// Stores the value of constants (and deduplicates the actual memory)
1072 allocation_interner: ShardedHashMap<&'tcx Allocation, ()>,
1074 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1076 layout_interner: ShardedHashMap<&'tcx LayoutDetails, ()>,
1078 output_filenames: Arc<OutputFilenames>,
1081 impl<'tcx> TyCtxt<'tcx> {
1083 pub fn hir(self) -> &'tcx hir_map::Map<'tcx> {
1087 pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal<Body<'tcx>> {
1088 self.arena.alloc(Steal::new(mir))
1091 pub fn alloc_steal_promoted(self, promoted: IndexVec<Promoted, Body<'tcx>>) ->
1092 &'tcx Steal<IndexVec<Promoted, Body<'tcx>>> {
1093 self.arena.alloc(Steal::new(promoted))
1096 pub fn intern_promoted(self, promoted: IndexVec<Promoted, Body<'tcx>>) ->
1097 &'tcx IndexVec<Promoted, Body<'tcx>> {
1098 self.arena.alloc(promoted)
1101 pub fn alloc_adt_def(
1105 variants: IndexVec<VariantIdx, ty::VariantDef>,
1107 ) -> &'tcx ty::AdtDef {
1108 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1109 self.arena.alloc(def)
1112 pub fn intern_const_alloc(self, alloc: Allocation) -> &'tcx Allocation {
1113 self.allocation_interner.intern(alloc, |alloc| {
1114 self.arena.alloc(alloc)
1118 /// Allocates a read-only byte or string literal for `mir::interpret`.
1119 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1120 // Create an allocation that just contains these bytes.
1121 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1122 let alloc = self.intern_const_alloc(alloc);
1123 self.alloc_map.lock().create_memory_alloc(alloc)
1126 pub fn intern_stability(self, stab: attr::Stability) -> &'tcx attr::Stability {
1127 self.stability_interner.intern(stab, |stab| {
1128 self.arena.alloc(stab)
1132 pub fn intern_layout(self, layout: LayoutDetails) -> &'tcx LayoutDetails {
1133 self.layout_interner.intern(layout, |layout| {
1134 self.arena.alloc(layout)
1138 /// Returns a range of the start/end indices specified with the
1139 /// `rustc_layout_scalar_valid_range` attribute.
1140 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1141 let attrs = self.get_attrs(def_id);
1143 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1145 None => return Bound::Unbounded,
1147 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1148 match meta.literal().expect("attribute takes lit").kind {
1149 ast::LitKind::Int(a, _) => return Bound::Included(a),
1150 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1153 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1155 (get(sym::rustc_layout_scalar_valid_range_start),
1156 get(sym::rustc_layout_scalar_valid_range_end))
1159 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1160 value.lift_to_tcx(self)
1163 /// Creates a type context and call the closure with a `TyCtxt` reference
1164 /// to the context. The closure enforces that the type context and any interned
1165 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1166 /// reference to the context, to allow formatting values that need it.
1167 pub fn create_global_ctxt(
1169 lint_store: Lrc<lint::LintStore>,
1170 local_providers: ty::query::Providers<'tcx>,
1171 extern_providers: ty::query::Providers<'tcx>,
1172 arenas: &'tcx AllArenas,
1173 resolutions: ty::ResolverOutputs,
1174 hir: hir_map::Map<'tcx>,
1175 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1177 output_filenames: &OutputFilenames,
1178 ) -> GlobalCtxt<'tcx> {
1179 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1182 let interners = CtxtInterners::new(&arenas.interner);
1183 let common_types = CommonTypes::new(&interners);
1184 let common_lifetimes = CommonLifetimes::new(&interners);
1185 let common_consts = CommonConsts::new(&interners, &common_types);
1186 let dep_graph = hir.dep_graph.clone();
1187 let cstore = resolutions.cstore;
1188 let crates = cstore.crates_untracked();
1189 let max_cnum = crates.iter().map(|c| c.as_usize()).max().unwrap_or(0);
1190 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1191 providers[LOCAL_CRATE] = local_providers;
1193 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1194 let def_path_tables = crates
1196 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1197 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())));
1199 // Precompute the capacity of the hashmap so we don't have to
1200 // re-allocate when populating it.
1201 let capacity = def_path_tables.clone().map(|(_, t)| t.size()).sum::<usize>();
1203 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1205 ::std::default::Default::default()
1208 for (cnum, def_path_table) in def_path_tables {
1209 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1217 let mut trait_map: FxHashMap<_, FxHashMap<_, _>> = FxHashMap::default();
1218 for (k, v) in resolutions.trait_map {
1219 let hir_id = hir.node_to_hir_id(k);
1220 let map = trait_map.entry(hir_id.owner).or_default();
1221 map.insert(hir_id.local_id, StableVec::new(v));
1228 arena: WorkerLocal::new(|_| Arena::default()),
1231 prof: s.prof.clone(),
1232 types: common_types,
1233 lifetimes: common_lifetimes,
1234 consts: common_consts,
1235 extern_crate_map: resolutions.extern_crate_map,
1237 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1238 let exports: Vec<_> = v.into_iter().map(|e| {
1239 e.map_id(|id| hir.node_to_hir_id(id))
1243 maybe_unused_trait_imports:
1244 resolutions.maybe_unused_trait_imports
1246 .map(|id| hir.local_def_id_from_node_id(id))
1248 maybe_unused_extern_crates:
1249 resolutions.maybe_unused_extern_crates
1251 .map(|(id, sp)| (hir.local_def_id_from_node_id(id), sp))
1253 glob_map: resolutions.glob_map.into_iter().map(|(id, names)| {
1254 (hir.local_def_id_from_node_id(id), names)
1256 extern_prelude: resolutions.extern_prelude,
1258 def_path_hash_to_def_id,
1259 queries: query::Queries::new(
1262 on_disk_query_result_cache,
1264 rcache: Default::default(),
1265 selection_cache: Default::default(),
1266 evaluation_cache: Default::default(),
1267 crate_name: Symbol::intern(crate_name),
1269 layout_interner: Default::default(),
1270 stability_interner: Default::default(),
1271 allocation_interner: Default::default(),
1272 alloc_map: Lock::new(interpret::AllocMap::new()),
1273 output_filenames: Arc::new(output_filenames.clone()),
1277 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1278 let cname = self.crate_name(LOCAL_CRATE).as_str();
1279 self.sess.consider_optimizing(&cname, msg)
1282 pub fn lib_features(self) -> &'tcx middle::lib_features::LibFeatures {
1283 self.get_lib_features(LOCAL_CRATE)
1286 /// Obtain all lang items of this crate and all dependencies (recursively)
1287 pub fn lang_items(self) -> &'tcx middle::lang_items::LanguageItems {
1288 self.get_lang_items(LOCAL_CRATE)
1291 /// Obtain the given diagnostic item's `DefId`. Use `is_diagnostic_item` if you just want to
1292 /// compare against another `DefId`, since `is_diagnostic_item` is cheaper.
1293 pub fn get_diagnostic_item(self, name: Symbol) -> Option<DefId> {
1294 self.all_diagnostic_items(LOCAL_CRATE).get(&name).copied()
1297 /// Check whether the diagnostic item with the given `name` has the given `DefId`.
1298 pub fn is_diagnostic_item(self, name: Symbol, did: DefId) -> bool {
1299 self.diagnostic_items(did.krate).get(&name) == Some(&did)
1302 pub fn stability(self) -> &'tcx stability::Index<'tcx> {
1303 self.stability_index(LOCAL_CRATE)
1306 pub fn crates(self) -> &'tcx [CrateNum] {
1307 self.all_crate_nums(LOCAL_CRATE)
1310 pub fn injected_panic_runtime(self) -> Option<CrateNum> {
1311 self.cstore.injected_panic_runtime()
1314 pub fn allocator_kind(self) -> Option<AllocatorKind> {
1315 self.cstore.allocator_kind()
1318 pub fn features(self) -> &'tcx feature_gate::Features {
1319 self.features_query(LOCAL_CRATE)
1322 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1324 self.hir().def_key(id)
1326 self.cstore.def_key(id)
1330 /// Converts a `DefId` into its fully expanded `DefPath` (every
1331 /// `DefId` is really just an interned `DefPath`).
1333 /// Note that if `id` is not local to this crate, the result will
1334 /// be a non-local `DefPath`.
1335 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1337 self.hir().def_path(id)
1339 self.cstore.def_path(id)
1343 /// Returns whether or not the crate with CrateNum 'cnum'
1344 /// is marked as a private dependency
1345 pub fn is_private_dep(self, cnum: CrateNum) -> bool {
1346 if cnum == LOCAL_CRATE {
1349 self.cstore.crate_is_private_dep_untracked(cnum)
1354 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1355 if def_id.is_local() {
1356 self.hir().definitions().def_path_hash(def_id.index)
1358 self.cstore.def_path_hash(def_id)
1362 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1363 // We are explicitly not going through queries here in order to get
1364 // crate name and disambiguator since this code is called from debug!()
1365 // statements within the query system and we'd run into endless
1366 // recursion otherwise.
1367 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1368 (self.crate_name.clone(),
1369 self.sess.local_crate_disambiguator())
1371 (self.cstore.crate_name_untracked(def_id.krate),
1372 self.cstore.crate_disambiguator_untracked(def_id.krate))
1377 // Don't print the whole crate disambiguator. That's just
1378 // annoying in debug output.
1379 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1380 self.def_path(def_id).to_string_no_crate())
1383 pub fn metadata_encoding_version(self) -> Vec<u8> {
1384 self.cstore.metadata_encoding_version().to_vec()
1387 pub fn encode_metadata(self)-> EncodedMetadata {
1388 let _prof_timer = self.prof.generic_activity("generate_crate_metadata");
1389 self.cstore.encode_metadata(self)
1392 // Note that this is *untracked* and should only be used within the query
1393 // system if the result is otherwise tracked through queries
1394 pub fn crate_data_as_any(self, cnum: CrateNum) -> &'tcx dyn Any {
1395 self.cstore.crate_data_as_any(cnum)
1399 pub fn create_stable_hashing_context(self) -> StableHashingContext<'tcx> {
1400 let krate = self.gcx.hir_map.forest.untracked_krate();
1402 StableHashingContext::new(self.sess,
1404 self.hir().definitions(),
1408 // This method makes sure that we have a DepNode and a Fingerprint for
1409 // every upstream crate. It needs to be called once right after the tcx is
1411 // With full-fledged red/green, the method will probably become unnecessary
1412 // as this will be done on-demand.
1413 pub fn allocate_metadata_dep_nodes(self) {
1414 // We cannot use the query versions of crates() and crate_hash(), since
1415 // those would need the DepNodes that we are allocating here.
1416 for cnum in self.cstore.crates_untracked() {
1417 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1418 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1419 self.dep_graph.with_task(dep_node,
1422 |_, x| x, // No transformation needed
1423 dep_graph::hash_result,
1428 pub fn serialize_query_result_cache<E>(self,
1430 -> Result<(), E::Error>
1431 where E: ty::codec::TyEncoder
1433 self.queries.on_disk_cache.serialize(self, encoder)
1436 /// If `true`, we should use the MIR-based borrowck, but also
1437 /// fall back on the AST borrowck if the MIR-based one errors.
1438 pub fn migrate_borrowck(self) -> bool {
1439 self.borrowck_mode().migrate()
1442 /// If `true`, make MIR codegen for `match` emit a temp that holds a
1443 /// borrow of the input to the match expression.
1444 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1445 self.emit_read_for_match()
1448 /// If `true`, make MIR codegen for `match` emit FakeRead
1449 /// statements (which simulate the maximal effect of executing the
1450 /// patterns in a match arm).
1451 pub fn emit_read_for_match(&self) -> bool {
1452 !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1455 /// What mode(s) of borrowck should we run? AST? MIR? both?
1456 /// (Also considers the `#![feature(nll)]` setting.)
1457 pub fn borrowck_mode(&self) -> BorrowckMode {
1458 // Here are the main constraints we need to deal with:
1460 // 1. An opts.borrowck_mode of `BorrowckMode::Migrate` is
1461 // synonymous with no `-Z borrowck=...` flag at all.
1463 // 2. We want to allow developers on the Nightly channel
1464 // to opt back into the "hard error" mode for NLL,
1465 // (which they can do via specifying `#![feature(nll)]`
1466 // explicitly in their crate).
1468 // So, this precedence list is how pnkfelix chose to work with
1469 // the above constraints:
1471 // * `#![feature(nll)]` *always* means use NLL with hard
1472 // errors. (To simplify the code here, it now even overrides
1473 // a user's attempt to specify `-Z borrowck=compare`, which
1474 // we arguably do not need anymore and should remove.)
1476 // * Otherwise, if no `-Z borrowck=...` then use migrate mode
1478 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1480 if self.features().nll { return BorrowckMode::Mir; }
1482 self.sess.opts.borrowck_mode
1486 pub fn local_crate_exports_generics(self) -> bool {
1487 debug_assert!(self.sess.opts.share_generics());
1489 self.sess.crate_types.borrow().iter().any(|crate_type| {
1491 CrateType::Executable |
1492 CrateType::Staticlib |
1493 CrateType::ProcMacro |
1494 CrateType::Cdylib => false,
1496 // FIXME rust-lang/rust#64319, rust-lang/rust#64872:
1497 // We want to block export of generics from dylibs,
1498 // but we must fix rust-lang/rust#65890 before we can
1499 // do that robustly.
1500 CrateType::Dylib => true,
1502 CrateType::Rlib => true,
1507 // Returns the `DefId` and the `BoundRegion` corresponding to the given region.
1508 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1509 let (suitable_region_binding_scope, bound_region) = match *region {
1510 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1511 ty::ReEarlyBound(ref ebr) => (
1512 self.parent(ebr.def_id).unwrap(),
1513 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1515 _ => return None, // not a free region
1518 let hir_id = self.hir()
1519 .as_local_hir_id(suitable_region_binding_scope)
1521 let is_impl_item = match self.hir().find(hir_id) {
1522 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1523 Some(Node::ImplItem(..)) => {
1524 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1529 return Some(FreeRegionInfo {
1530 def_id: suitable_region_binding_scope,
1531 boundregion: bound_region,
1536 pub fn return_type_impl_trait(
1538 scope_def_id: DefId,
1539 ) -> Option<(Ty<'tcx>, Span)> {
1540 // HACK: `type_of_def_id()` will fail on these (#55796), so return `None`.
1541 let hir_id = self.hir().as_local_hir_id(scope_def_id).unwrap();
1542 match self.hir().get(hir_id) {
1543 Node::Item(item) => {
1545 ItemKind::Fn(..) => { /* `type_of_def_id()` will work */ }
1551 _ => { /* `type_of_def_id()` will work or panic */ }
1554 let ret_ty = self.type_of(scope_def_id);
1556 ty::FnDef(_, _) => {
1557 let sig = ret_ty.fn_sig(*self);
1558 let output = self.erase_late_bound_regions(&sig.output());
1559 if output.is_impl_trait() {
1560 let fn_decl = self.hir().fn_decl_by_hir_id(hir_id).unwrap();
1561 Some((output, fn_decl.output.span()))
1570 // Checks if the bound region is in Impl Item.
1571 pub fn is_bound_region_in_impl_item(
1573 suitable_region_binding_scope: DefId,
1575 let container_id = self.associated_item(suitable_region_binding_scope)
1578 if self.impl_trait_ref(container_id).is_some() {
1579 // For now, we do not try to target impls of traits. This is
1580 // because this message is going to suggest that the user
1581 // change the fn signature, but they may not be free to do so,
1582 // since the signature must match the trait.
1584 // FIXME(#42706) -- in some cases, we could do better here.
1590 /// Determines whether identifiers in the assembly have strict naming rules.
1591 /// Currently, only NVPTX* targets need it.
1592 pub fn has_strict_asm_symbol_naming(&self) -> bool {
1593 self.sess.target.target.arch.contains("nvptx")
1597 impl<'tcx> GlobalCtxt<'tcx> {
1598 /// Calls the closure with a local `TyCtxt` using the given arena.
1599 /// `interners` is a slot passed so we can create a CtxtInterners
1600 /// with the same lifetime as `arena`.
1601 pub fn enter_local<F, R>(&'tcx self, f: F) -> R
1603 F: FnOnce(TyCtxt<'tcx>) -> R,
1608 ty::tls::with_related_context(tcx, |icx| {
1609 let new_icx = ty::tls::ImplicitCtxt {
1611 query: icx.query.clone(),
1612 diagnostics: icx.diagnostics,
1613 layout_depth: icx.layout_depth,
1614 task_deps: icx.task_deps,
1616 ty::tls::enter_context(&new_icx, |_| {
1623 /// A trait implemented for all `X<'a>` types that can be safely and
1624 /// efficiently converted to `X<'tcx>` as long as they are part of the
1625 /// provided `TyCtxt<'tcx>`.
1626 /// This can be done, for example, for `Ty<'tcx>` or `SubstsRef<'tcx>`
1627 /// by looking them up in their respective interners.
1629 /// However, this is still not the best implementation as it does
1630 /// need to compare the components, even for interned values.
1631 /// It would be more efficient if `TypedArena` provided a way to
1632 /// determine whether the address is in the allocated range.
1634 /// `None` is returned if the value or one of the components is not part
1635 /// of the provided context.
1636 /// For `Ty`, `None` can be returned if either the type interner doesn't
1637 /// contain the `TyKind` key or if the address of the interned
1638 /// pointer differs. The latter case is possible if a primitive type,
1639 /// e.g., `()` or `u8`, was interned in a different context.
1640 pub trait Lift<'tcx>: fmt::Debug {
1641 type Lifted: fmt::Debug + 'tcx;
1642 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>;
1645 macro_rules! nop_lift {
1646 ($ty:ty => $lifted:ty) => {
1647 impl<'a, 'tcx> Lift<'tcx> for $ty {
1648 type Lifted = $lifted;
1649 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1650 if tcx.interners.arena.in_arena(*self as *const _) {
1651 Some(unsafe { mem::transmute(*self) })
1660 macro_rules! nop_list_lift {
1661 ($ty:ty => $lifted:ty) => {
1662 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1663 type Lifted = &'tcx List<$lifted>;
1664 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1665 if self.is_empty() {
1666 return Some(List::empty());
1668 if tcx.interners.arena.in_arena(*self as *const _) {
1669 Some(unsafe { mem::transmute(*self) })
1678 nop_lift!{Ty<'a> => Ty<'tcx>}
1679 nop_lift!{Region<'a> => Region<'tcx>}
1680 nop_lift!{Goal<'a> => Goal<'tcx>}
1681 nop_lift!{&'a Const<'a> => &'tcx Const<'tcx>}
1683 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1684 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1685 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1686 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1687 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1688 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1689 nop_list_lift!{ProjectionKind => ProjectionKind}
1691 // This is the impl for `&'a InternalSubsts<'a>`.
1692 nop_list_lift!{GenericArg<'a> => GenericArg<'tcx>}
1695 use super::{GlobalCtxt, TyCtxt, ptr_eq};
1700 use crate::ty::query;
1701 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1702 use rustc_data_structures::OnDrop;
1703 use rustc_data_structures::sync::{self, Lrc, Lock};
1704 use rustc_data_structures::thin_vec::ThinVec;
1705 use crate::dep_graph::TaskDeps;
1707 #[cfg(not(parallel_compiler))]
1708 use std::cell::Cell;
1710 #[cfg(parallel_compiler)]
1711 use rustc_rayon_core as rayon_core;
1713 /// This is the implicit state of rustc. It contains the current
1714 /// `TyCtxt` and query. It is updated when creating a local interner or
1715 /// executing a new query. Whenever there's a `TyCtxt` value available
1716 /// you should also have access to an `ImplicitCtxt` through the functions
1719 pub struct ImplicitCtxt<'a, 'tcx> {
1720 /// The current `TyCtxt`. Initially created by `enter_global` and updated
1721 /// by `enter_local` with a new local interner.
1722 pub tcx: TyCtxt<'tcx>,
1724 /// The current query job, if any. This is updated by `JobOwner::start` in
1725 /// `ty::query::plumbing` when executing a query.
1726 pub query: Option<Lrc<query::QueryJob<'tcx>>>,
1728 /// Where to store diagnostics for the current query job, if any.
1729 /// This is updated by `JobOwner::start` in `ty::query::plumbing` when executing a query.
1730 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1732 /// Used to prevent layout from recursing too deeply.
1733 pub layout_depth: usize,
1735 /// The current dep graph task. This is used to add dependencies to queries
1736 /// when executing them.
1737 pub task_deps: Option<&'a Lock<TaskDeps>>,
1740 /// Sets Rayon's thread-local variable, which is preserved for Rayon jobs
1741 /// to `value` during the call to `f`. It is restored to its previous value after.
1742 /// This is used to set the pointer to the new `ImplicitCtxt`.
1743 #[cfg(parallel_compiler)]
1745 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1746 rayon_core::tlv::with(value, f)
1749 /// Gets Rayon's thread-local variable, which is preserved for Rayon jobs.
1750 /// This is used to get the pointer to the current `ImplicitCtxt`.
1751 #[cfg(parallel_compiler)]
1753 fn get_tlv() -> usize {
1754 rayon_core::tlv::get()
1757 #[cfg(not(parallel_compiler))]
1759 /// A thread local variable that stores a pointer to the current `ImplicitCtxt`.
1760 static TLV: Cell<usize> = Cell::new(0);
1763 /// Sets TLV to `value` during the call to `f`.
1764 /// It is restored to its previous value after.
1765 /// This is used to set the pointer to the new `ImplicitCtxt`.
1766 #[cfg(not(parallel_compiler))]
1768 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1769 let old = get_tlv();
1770 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1771 TLV.with(|tlv| tlv.set(value));
1775 /// Gets the pointer to the current `ImplicitCtxt`.
1776 #[cfg(not(parallel_compiler))]
1777 fn get_tlv() -> usize {
1778 TLV.with(|tlv| tlv.get())
1781 /// This is a callback from libsyntax as it cannot access the implicit state
1782 /// in librustc otherwise.
1783 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1785 if let Some(tcx) = tcx {
1786 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1788 syntax_pos::default_span_debug(span, f)
1793 /// This is a callback from libsyntax as it cannot access the implicit state
1794 /// in librustc otherwise. It is used to when diagnostic messages are
1795 /// emitted and stores them in the current query, if there is one.
1796 fn track_diagnostic(diagnostic: &Diagnostic) {
1797 with_context_opt(|icx| {
1798 if let Some(icx) = icx {
1799 if let Some(ref diagnostics) = icx.diagnostics {
1800 let mut diagnostics = diagnostics.lock();
1801 diagnostics.extend(Some(diagnostic.clone()));
1807 /// Sets up the callbacks from libsyntax on the current thread.
1808 pub fn with_thread_locals<F, R>(f: F) -> R
1809 where F: FnOnce() -> R
1811 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1812 let original_span_debug = span_dbg.get();
1813 span_dbg.set(span_debug);
1815 let _on_drop = OnDrop(move || {
1816 span_dbg.set(original_span_debug);
1819 TRACK_DIAGNOSTICS.with(|current| {
1820 let original = current.get();
1821 current.set(track_diagnostic);
1823 let _on_drop = OnDrop(move || {
1824 current.set(original);
1832 /// Sets `context` as the new current `ImplicitCtxt` for the duration of the function `f`.
1834 pub fn enter_context<'a, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'tcx>, f: F) -> R
1836 F: FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1838 set_tlv(context as *const _ as usize, || {
1843 /// Enters `GlobalCtxt` by setting up libsyntax callbacks and
1844 /// creating a initial `TyCtxt` and `ImplicitCtxt`.
1845 /// This happens once per rustc session and `TyCtxt`s only exists
1846 /// inside the `f` function.
1847 pub fn enter_global<'tcx, F, R>(gcx: &'tcx GlobalCtxt<'tcx>, f: F) -> R
1849 F: FnOnce(TyCtxt<'tcx>) -> R,
1851 // Update `GCX_PTR` to indicate there's a `GlobalCtxt` available.
1852 GCX_PTR.with(|lock| {
1853 *lock.lock() = gcx as *const _ as usize;
1855 // Set `GCX_PTR` back to 0 when we exit.
1856 let _on_drop = OnDrop(move || {
1857 GCX_PTR.with(|lock| *lock.lock() = 0);
1863 let icx = ImplicitCtxt {
1870 enter_context(&icx, |_| {
1875 scoped_thread_local! {
1876 /// Stores a pointer to the `GlobalCtxt` if one is available.
1877 /// This is used to access the `GlobalCtxt` in the deadlock handler given to Rayon.
1878 pub static GCX_PTR: Lock<usize>
1881 /// Creates a `TyCtxt` and `ImplicitCtxt` based on the `GCX_PTR` thread local.
1882 /// This is used in the deadlock handler.
1883 pub unsafe fn with_global<F, R>(f: F) -> R
1885 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
1887 let gcx = GCX_PTR.with(|lock| *lock.lock());
1889 let gcx = &*(gcx as *const GlobalCtxt<'_>);
1893 let icx = ImplicitCtxt {
1900 enter_context(&icx, |_| f(tcx))
1903 /// Allows access to the current `ImplicitCtxt` in a closure if one is available.
1905 pub fn with_context_opt<F, R>(f: F) -> R
1907 F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R,
1909 let context = get_tlv();
1913 // We could get a `ImplicitCtxt` pointer from another thread.
1914 // Ensure that `ImplicitCtxt` is `Sync`.
1915 sync::assert_sync::<ImplicitCtxt<'_, '_>>();
1917 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_>))) }
1921 /// Allows access to the current `ImplicitCtxt`.
1922 /// Panics if there is no `ImplicitCtxt` available.
1924 pub fn with_context<F, R>(f: F) -> R
1926 F: for<'a, 'tcx> FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1928 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
1931 /// Allows access to the current `ImplicitCtxt` whose tcx field has the same global
1932 /// interner as the tcx argument passed in. This means the closure is given an `ImplicitCtxt`
1933 /// with the same `'tcx` lifetime as the `TyCtxt` passed in.
1934 /// This will panic if you pass it a `TyCtxt` which has a different global interner from
1935 /// the current `ImplicitCtxt`'s `tcx` field.
1937 pub fn with_related_context<'tcx, F, R>(tcx: TyCtxt<'tcx>, f: F) -> R
1939 F: FnOnce(&ImplicitCtxt<'_, 'tcx>) -> R,
1941 with_context(|context| {
1943 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
1944 let context: &ImplicitCtxt<'_, '_> = mem::transmute(context);
1950 /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
1951 /// Panics if there is no `ImplicitCtxt` available.
1953 pub fn with<F, R>(f: F) -> R
1955 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
1957 with_context(|context| f(context.tcx))
1960 /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
1961 /// The closure is passed None if there is no `ImplicitCtxt` available.
1963 pub fn with_opt<F, R>(f: F) -> R
1965 F: for<'tcx> FnOnce(Option<TyCtxt<'tcx>>) -> R,
1967 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
1971 macro_rules! sty_debug_print {
1972 ($ctxt: expr, $($variant: ident),*) => {{
1973 // Curious inner module to allow variant names to be used as
1975 #[allow(non_snake_case)]
1977 use crate::ty::{self, TyCtxt};
1978 use crate::ty::context::Interned;
1980 #[derive(Copy, Clone)]
1989 pub fn go(tcx: TyCtxt<'_>) {
1990 let mut total = DebugStat {
1997 $(let mut $variant = total;)*
1999 let shards = tcx.interners.type_.lock_shards();
2000 let types = shards.iter().flat_map(|shard| shard.keys());
2001 for &Interned(t) in types {
2002 let variant = match t.kind {
2003 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2004 ty::Float(..) | ty::Str | ty::Never => continue,
2005 ty::Error => /* unimportant */ continue,
2006 $(ty::$variant(..) => &mut $variant,)*
2008 let lt = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2009 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2010 let ct = t.flags.intersects(ty::TypeFlags::HAS_CT_INFER);
2014 if lt { total.lt_infer += 1; variant.lt_infer += 1 }
2015 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2016 if ct { total.ct_infer += 1; variant.ct_infer += 1 }
2017 if lt && ty && ct { total.all_infer += 1; variant.all_infer += 1 }
2019 println!("Ty interner total ty lt ct all");
2020 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2021 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2022 stringify!($variant),
2023 uses = $variant.total,
2024 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2025 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2026 lt = $variant.lt_infer as f64 * 100.0 / total.total as f64,
2027 ct = $variant.ct_infer as f64 * 100.0 / total.total as f64,
2028 all = $variant.all_infer as f64 * 100.0 / total.total as f64);
2030 println!(" total {uses:6} \
2031 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2033 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2034 lt = total.lt_infer as f64 * 100.0 / total.total as f64,
2035 ct = total.ct_infer as f64 * 100.0 / total.total as f64,
2036 all = total.all_infer as f64 * 100.0 / total.total as f64)
2044 impl<'tcx> TyCtxt<'tcx> {
2045 pub fn print_debug_stats(self) {
2048 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2049 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2050 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2052 println!("InternalSubsts interner: #{}", self.interners.substs.len());
2053 println!("Region interner: #{}", self.interners.region.len());
2054 println!("Stability interner: #{}", self.stability_interner.len());
2055 println!("Allocation interner: #{}", self.allocation_interner.len());
2056 println!("Layout interner: #{}", self.layout_interner.len());
2061 /// An entry in an interner.
2062 struct Interned<'tcx, T: ?Sized>(&'tcx T);
2064 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2065 fn clone(&self) -> Self {
2069 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2071 // N.B., an `Interned<Ty>` compares and hashes as a `TyKind`.
2072 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2073 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2074 self.0.kind == other.0.kind
2078 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2080 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2081 fn hash<H: Hasher>(&self, s: &mut H) {
2086 #[allow(rustc::usage_of_ty_tykind)]
2087 impl<'tcx> Borrow<TyKind<'tcx>> for Interned<'tcx, TyS<'tcx>> {
2088 fn borrow<'a>(&'a self) -> &'a TyKind<'tcx> {
2093 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2094 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2095 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2096 self.0[..] == other.0[..]
2100 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2102 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2103 fn hash<H: Hasher>(&self, s: &mut H) {
2108 impl<'tcx> Borrow<[Ty<'tcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2109 fn borrow<'a>(&'a self) -> &'a [Ty<'tcx>] {
2114 impl<'tcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2115 fn borrow(&self) -> &[CanonicalVarInfo] {
2120 impl<'tcx> Borrow<[GenericArg<'tcx>]> for Interned<'tcx, InternalSubsts<'tcx>> {
2121 fn borrow<'a>(&'a self) -> &'a [GenericArg<'tcx>] {
2126 impl<'tcx> Borrow<[ProjectionKind]>
2127 for Interned<'tcx, List<ProjectionKind>> {
2128 fn borrow(&self) -> &[ProjectionKind] {
2133 impl<'tcx> Borrow<[PlaceElem<'tcx>]>
2134 for Interned<'tcx, List<PlaceElem<'tcx>>> {
2135 fn borrow(&self) -> &[PlaceElem<'tcx>] {
2140 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2141 fn borrow(&self) -> &RegionKind {
2146 impl<'tcx> Borrow<GoalKind<'tcx>> for Interned<'tcx, GoalKind<'tcx>> {
2147 fn borrow<'a>(&'a self) -> &'a GoalKind<'tcx> {
2152 impl<'tcx> Borrow<[ExistentialPredicate<'tcx>]>
2153 for Interned<'tcx, List<ExistentialPredicate<'tcx>>>
2155 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'tcx>] {
2160 impl<'tcx> Borrow<[Predicate<'tcx>]> for Interned<'tcx, List<Predicate<'tcx>>> {
2161 fn borrow<'a>(&'a self) -> &'a [Predicate<'tcx>] {
2166 impl<'tcx> Borrow<Const<'tcx>> for Interned<'tcx, Const<'tcx>> {
2167 fn borrow<'a>(&'a self) -> &'a Const<'tcx> {
2172 impl<'tcx> Borrow<[Clause<'tcx>]> for Interned<'tcx, List<Clause<'tcx>>> {
2173 fn borrow<'a>(&'a self) -> &'a [Clause<'tcx>] {
2178 impl<'tcx> Borrow<[Goal<'tcx>]> for Interned<'tcx, List<Goal<'tcx>>> {
2179 fn borrow<'a>(&'a self) -> &'a [Goal<'tcx>] {
2184 macro_rules! direct_interners {
2185 ($($name:ident: $method:ident($ty:ty)),+) => {
2186 $(impl<'tcx> PartialEq for Interned<'tcx, $ty> {
2187 fn eq(&self, other: &Self) -> bool {
2192 impl<'tcx> Eq for Interned<'tcx, $ty> {}
2194 impl<'tcx> Hash for Interned<'tcx, $ty> {
2195 fn hash<H: Hasher>(&self, s: &mut H) {
2200 impl<'tcx> TyCtxt<'tcx> {
2201 pub fn $method(self, v: $ty) -> &'tcx $ty {
2202 self.interners.$name.intern_ref(&v, || {
2203 Interned(self.interners.arena.alloc(v))
2210 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2211 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2215 region: mk_region(RegionKind),
2216 goal: mk_goal(GoalKind<'tcx>),
2217 const_: mk_const(Const<'tcx>)
2220 macro_rules! slice_interners {
2221 ($($field:ident: $method:ident($ty:ty)),+) => (
2222 $(impl<'tcx> TyCtxt<'tcx> {
2223 pub fn $method(self, v: &[$ty]) -> &'tcx List<$ty> {
2224 self.interners.$field.intern_ref(v, || {
2225 Interned(List::from_arena(&self.interners.arena, v))
2233 type_list: _intern_type_list(Ty<'tcx>),
2234 substs: _intern_substs(GenericArg<'tcx>),
2235 canonical_var_infos: _intern_canonical_var_infos(CanonicalVarInfo),
2236 existential_predicates: _intern_existential_predicates(ExistentialPredicate<'tcx>),
2237 predicates: _intern_predicates(Predicate<'tcx>),
2238 clauses: _intern_clauses(Clause<'tcx>),
2239 goal_list: _intern_goals(Goal<'tcx>),
2240 projs: _intern_projs(ProjectionKind),
2241 place_elems: _intern_place_elems(PlaceElem<'tcx>)
2244 impl<'tcx> TyCtxt<'tcx> {
2245 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2246 /// that is, a `fn` type that is equivalent in every way for being
2248 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2249 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2250 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2251 unsafety: hir::Unsafety::Unsafe,
2256 /// Given a closure signature `sig`, returns an equivalent `fn`
2257 /// type with the same signature. Detuples and so forth -- so
2258 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2259 /// a `fn(u32, i32)`.
2260 /// `unsafety` determines the unsafety of the `fn` type. If you pass
2261 /// `hir::Unsafety::Unsafe` in the previous example, then you would get
2262 /// an `unsafe fn (u32, i32)`.
2263 /// It cannot convert a closure that requires unsafe.
2264 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>, unsafety: hir::Unsafety) -> Ty<'tcx> {
2265 let converted_sig = sig.map_bound(|s| {
2266 let params_iter = match s.inputs()[0].kind {
2267 ty::Tuple(params) => {
2268 params.into_iter().map(|k| k.expect_ty())
2281 self.mk_fn_ptr(converted_sig)
2284 #[allow(rustc::usage_of_ty_tykind)]
2286 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2287 self.interners.intern_ty(st)
2290 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2292 ast::IntTy::Isize => self.types.isize,
2293 ast::IntTy::I8 => self.types.i8,
2294 ast::IntTy::I16 => self.types.i16,
2295 ast::IntTy::I32 => self.types.i32,
2296 ast::IntTy::I64 => self.types.i64,
2297 ast::IntTy::I128 => self.types.i128,
2301 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2303 ast::UintTy::Usize => self.types.usize,
2304 ast::UintTy::U8 => self.types.u8,
2305 ast::UintTy::U16 => self.types.u16,
2306 ast::UintTy::U32 => self.types.u32,
2307 ast::UintTy::U64 => self.types.u64,
2308 ast::UintTy::U128 => self.types.u128,
2312 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2314 ast::FloatTy::F32 => self.types.f32,
2315 ast::FloatTy::F64 => self.types.f64,
2320 pub fn mk_str(self) -> Ty<'tcx> {
2325 pub fn mk_static_str(self) -> Ty<'tcx> {
2326 self.mk_imm_ref(self.lifetimes.re_static, self.mk_str())
2330 pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2331 // Take a copy of substs so that we own the vectors inside.
2332 self.mk_ty(Adt(def, substs))
2336 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2337 self.mk_ty(Foreign(def_id))
2340 fn mk_generic_adt(self, wrapper_def_id: DefId, ty_param: Ty<'tcx>) -> Ty<'tcx> {
2341 let adt_def = self.adt_def(wrapper_def_id);
2342 let substs = InternalSubsts::for_item(self, wrapper_def_id, |param, substs| {
2344 GenericParamDefKind::Lifetime |
2345 GenericParamDefKind::Const => {
2348 GenericParamDefKind::Type { has_default, .. } => {
2349 if param.index == 0 {
2352 assert!(has_default);
2353 self.type_of(param.def_id).subst(self, substs).into()
2358 self.mk_ty(Adt(adt_def, substs))
2362 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2363 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem, None);
2364 self.mk_generic_adt(def_id, ty)
2368 pub fn mk_lang_item(self, ty: Ty<'tcx>, item: lang_items::LangItem) -> Option<Ty<'tcx>> {
2369 let def_id = self.lang_items().require(item).ok()?;
2370 Some(self.mk_generic_adt(def_id, ty))
2374 pub fn mk_maybe_uninit(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2375 let def_id = self.require_lang_item(lang_items::MaybeUninitLangItem, None);
2376 self.mk_generic_adt(def_id, ty)
2380 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2381 self.mk_ty(RawPtr(tm))
2385 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2386 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2390 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2391 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::Mutability::Mutable})
2395 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2396 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::Mutability::Immutable})
2400 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2401 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::Mutability::Mutable})
2405 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2406 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::Mutability::Immutable})
2410 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2411 self.mk_imm_ptr(self.mk_unit())
2415 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2416 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2420 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2421 self.mk_ty(Slice(ty))
2425 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2426 let kinds: Vec<_> = ts.into_iter().map(|&t| GenericArg::from(t)).collect();
2427 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2430 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2431 iter.intern_with(|ts| {
2432 let kinds: Vec<_> = ts.into_iter().map(|&t| GenericArg::from(t)).collect();
2433 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2438 pub fn mk_unit(self) -> Ty<'tcx> {
2443 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2444 if self.features().never_type_fallback {
2452 pub fn mk_bool(self) -> Ty<'tcx> {
2457 pub fn mk_fn_def(self, def_id: DefId,
2458 substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2459 self.mk_ty(FnDef(def_id, substs))
2463 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2464 self.mk_ty(FnPtr(fty))
2470 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2471 reg: ty::Region<'tcx>
2473 self.mk_ty(Dynamic(obj, reg))
2477 pub fn mk_projection(self,
2479 substs: SubstsRef<'tcx>)
2481 self.mk_ty(Projection(ProjectionTy {
2488 pub fn mk_closure(self, closure_id: DefId, closure_substs: SubstsRef<'tcx>)
2490 self.mk_ty(Closure(closure_id, closure_substs))
2494 pub fn mk_generator(self,
2496 generator_substs: SubstsRef<'tcx>,
2497 movability: hir::Movability)
2499 self.mk_ty(Generator(id, generator_substs, movability))
2503 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2504 self.mk_ty(GeneratorWitness(types))
2508 pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> {
2509 self.mk_ty_infer(TyVar(v))
2513 pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2514 self.mk_const(ty::Const {
2515 val: ty::ConstKind::Infer(InferConst::Var(v)),
2521 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2522 self.mk_ty_infer(IntVar(v))
2526 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2527 self.mk_ty_infer(FloatVar(v))
2531 pub fn mk_ty_infer(self, it: InferTy) -> Ty<'tcx> {
2532 self.mk_ty(Infer(it))
2536 pub fn mk_const_infer(
2538 ic: InferConst<'tcx>,
2540 ) -> &'tcx ty::Const<'tcx> {
2541 self.mk_const(ty::Const {
2542 val: ty::ConstKind::Infer(ic),
2548 pub fn mk_ty_param(self, index: u32, name: Symbol) -> Ty<'tcx> {
2549 self.mk_ty(Param(ParamTy { index, name: name }))
2553 pub fn mk_const_param(
2558 ) -> &'tcx Const<'tcx> {
2559 self.mk_const(ty::Const {
2560 val: ty::ConstKind::Param(ParamConst { index, name }),
2566 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> {
2568 GenericParamDefKind::Lifetime => {
2569 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2571 GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
2572 GenericParamDefKind::Const => {
2573 self.mk_const_param(param.index, param.name, self.type_of(param.def_id)).into()
2579 pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2580 self.mk_ty(Opaque(def_id, substs))
2583 pub fn mk_place_field(self, place: Place<'tcx>, f: Field, ty: Ty<'tcx>) -> Place<'tcx> {
2584 self.mk_place_elem(place, PlaceElem::Field(f, ty))
2587 pub fn mk_place_deref(self, place: Place<'tcx>) -> Place<'tcx> {
2588 self.mk_place_elem(place, PlaceElem::Deref)
2591 pub fn mk_place_downcast(
2594 adt_def: &'tcx AdtDef,
2595 variant_index: VariantIdx,
2599 PlaceElem::Downcast(Some(adt_def.variants[variant_index].ident.name), variant_index),
2603 pub fn mk_place_downcast_unnamed(
2606 variant_index: VariantIdx,
2608 self.mk_place_elem(place, PlaceElem::Downcast(None, variant_index))
2611 pub fn mk_place_index(self, place: Place<'tcx>, index: Local) -> Place<'tcx> {
2612 self.mk_place_elem(place, PlaceElem::Index(index))
2615 /// This method copies `Place`'s projection, add an element and reintern it. Should not be used
2616 /// to build a full `Place` it's just a convenient way to grab a projection and modify it in
2618 pub fn mk_place_elem(self, place: Place<'tcx>, elem: PlaceElem<'tcx>) -> Place<'tcx> {
2619 let mut projection = place.projection.to_vec();
2620 projection.push(elem);
2622 Place { base: place.base, projection: self.intern_place_elems(&projection) }
2625 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2626 -> &'tcx List<ExistentialPredicate<'tcx>> {
2627 assert!(!eps.is_empty());
2628 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2629 self._intern_existential_predicates(eps)
2632 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2633 -> &'tcx List<Predicate<'tcx>> {
2634 // FIXME consider asking the input slice to be sorted to avoid
2635 // re-interning permutations, in which case that would be asserted
2637 if preds.len() == 0 {
2638 // The macro-generated method below asserts we don't intern an empty slice.
2641 self._intern_predicates(preds)
2645 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2649 self._intern_type_list(ts)
2653 pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List<GenericArg<'tcx>> {
2657 self._intern_substs(ts)
2661 pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
2665 self._intern_projs(ps)
2669 pub fn intern_place_elems(self, ts: &[PlaceElem<'tcx>]) -> &'tcx List<PlaceElem<'tcx>> {
2673 self._intern_place_elems(ts)
2677 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'tcx> {
2681 self._intern_canonical_var_infos(ts)
2685 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2689 self._intern_clauses(ts)
2693 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2697 self._intern_goals(ts)
2701 pub fn mk_fn_sig<I>(self,
2705 unsafety: hir::Unsafety,
2707 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2709 I: Iterator<Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>,
2711 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2712 inputs_and_output: self.intern_type_list(xs),
2713 c_variadic, unsafety, abi
2717 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2718 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2720 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2723 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2724 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2726 iter.intern_with(|xs| self.intern_predicates(xs))
2729 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2730 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2731 iter.intern_with(|xs| self.intern_type_list(xs))
2734 pub fn mk_substs<I: InternAs<[GenericArg<'tcx>],
2735 &'tcx List<GenericArg<'tcx>>>>(self, iter: I) -> I::Output {
2736 iter.intern_with(|xs| self.intern_substs(xs))
2739 pub fn mk_place_elems<I: InternAs<[PlaceElem<'tcx>],
2740 &'tcx List<PlaceElem<'tcx>>>>(self, iter: I) -> I::Output {
2741 iter.intern_with(|xs| self.intern_place_elems(xs))
2744 pub fn mk_substs_trait(self,
2746 rest: &[GenericArg<'tcx>])
2749 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2752 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2753 iter.intern_with(|xs| self.intern_clauses(xs))
2756 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2757 iter.intern_with(|xs| self.intern_goals(xs))
2760 pub fn lint_hir<S: Into<MultiSpan>>(self,
2761 lint: &'static Lint,
2765 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2768 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2769 lint: &'static Lint,
2774 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2779 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2780 lint: &'static Lint,
2785 let mut err = self.struct_span_lint_hir(lint, id, span.into(), msg);
2790 /// Walks upwards from `id` to find a node which might change lint levels with attributes.
2791 /// It stops at `bound` and just returns it if reached.
2792 pub fn maybe_lint_level_root_bounded(
2801 if lint::maybe_lint_level_root(self, id) {
2804 let next = self.hir().get_parent_node(id);
2806 bug!("lint traversal reached the root of the crate");
2812 pub fn lint_level_at_node(
2814 lint: &'static Lint,
2816 ) -> (lint::Level, lint::LintSource) {
2817 let sets = self.lint_levels(LOCAL_CRATE);
2819 if let Some(pair) = sets.level_and_source(lint, id, self.sess) {
2822 let next = self.hir().get_parent_node(id);
2824 bug!("lint traversal reached the root of the crate");
2830 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2831 lint: &'static Lint,
2835 -> DiagnosticBuilder<'tcx>
2837 let (level, src) = self.lint_level_at_node(lint, hir_id);
2838 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2841 pub fn struct_lint_node(self, lint: &'static Lint, id: HirId, msg: &str)
2842 -> DiagnosticBuilder<'tcx>
2844 let (level, src) = self.lint_level_at_node(lint, id);
2845 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2848 pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx StableVec<TraitCandidate>> {
2849 self.in_scope_traits_map(id.owner)
2850 .and_then(|map| map.get(&id.local_id))
2853 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2854 self.named_region_map(id.owner)
2855 .and_then(|map| map.get(&id.local_id).cloned())
2858 pub fn is_late_bound(self, id: HirId) -> bool {
2859 self.is_late_bound_map(id.owner)
2860 .map(|set| set.contains(&id.local_id))
2864 pub fn object_lifetime_defaults(self, id: HirId) -> Option<&'tcx [ObjectLifetimeDefault]> {
2865 self.object_lifetime_defaults_map(id.owner)
2866 .and_then(|map| map.get(&id.local_id).map(|v| &**v))
2870 pub trait InternAs<T: ?Sized, R> {
2872 fn intern_with<F>(self, f: F) -> Self::Output
2873 where F: FnOnce(&T) -> R;
2876 impl<I, T, R, E> InternAs<[T], R> for I
2877 where E: InternIteratorElement<T, R>,
2878 I: Iterator<Item=E> {
2879 type Output = E::Output;
2880 fn intern_with<F>(self, f: F) -> Self::Output
2881 where F: FnOnce(&[T]) -> R {
2882 E::intern_with(self, f)
2886 pub trait InternIteratorElement<T, R>: Sized {
2888 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2891 impl<T, R> InternIteratorElement<T, R> for T {
2893 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2894 f(&iter.collect::<SmallVec<[_; 8]>>())
2898 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2902 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2903 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2907 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2908 type Output = Result<R, E>;
2909 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(mut iter: I, f: F)
2911 // This code is hot enough that it's worth specializing for the most
2912 // common length lists, to avoid the overhead of `SmallVec` creation.
2913 // The match arms are in order of frequency. The 1, 2, and 0 cases are
2914 // typically hit in ~95% of cases. We assume that if the upper and
2915 // lower bounds from `size_hint` agree they are correct.
2916 Ok(match iter.size_hint() {
2918 let t0 = iter.next().unwrap()?;
2919 assert!(iter.next().is_none());
2923 let t0 = iter.next().unwrap()?;
2924 let t1 = iter.next().unwrap()?;
2925 assert!(iter.next().is_none());
2929 assert!(iter.next().is_none());
2933 f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?)
2939 // We are comparing types with different invariant lifetimes, so `ptr::eq`
2940 // won't work for us.
2941 fn ptr_eq<T, U>(t: *const T, u: *const U) -> bool {
2942 t as *const () == u as *const ()
2945 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2946 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id);
2947 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).map(|v| &v[..]);
2948 providers.crate_name = |tcx, id| {
2949 assert_eq!(id, LOCAL_CRATE);
2952 providers.get_lib_features = |tcx, id| {
2953 assert_eq!(id, LOCAL_CRATE);
2954 tcx.arena.alloc(middle::lib_features::collect(tcx))
2956 providers.get_lang_items = |tcx, id| {
2957 assert_eq!(id, LOCAL_CRATE);
2958 tcx.arena.alloc(middle::lang_items::collect(tcx))
2960 providers.diagnostic_items = |tcx, id| {
2961 assert_eq!(id, LOCAL_CRATE);
2962 middle::diagnostic_items::collect(tcx)
2964 providers.all_diagnostic_items = |tcx, id| {
2965 assert_eq!(id, LOCAL_CRATE);
2966 middle::diagnostic_items::collect_all(tcx)
2968 providers.maybe_unused_trait_import = |tcx, id| {
2969 tcx.maybe_unused_trait_imports.contains(&id)
2971 providers.maybe_unused_extern_crates = |tcx, cnum| {
2972 assert_eq!(cnum, LOCAL_CRATE);
2973 &tcx.maybe_unused_extern_crates[..]
2975 providers.names_imported_by_glob_use = |tcx, id| {
2976 assert_eq!(id.krate, LOCAL_CRATE);
2977 Lrc::new(tcx.glob_map.get(&id).cloned().unwrap_or_default())
2980 providers.stability_index = |tcx, cnum| {
2981 assert_eq!(cnum, LOCAL_CRATE);
2982 tcx.arena.alloc(stability::Index::new(tcx))
2984 providers.lookup_stability = |tcx, id| {
2985 assert_eq!(id.krate, LOCAL_CRATE);
2986 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
2987 tcx.stability().local_stability(id)
2989 providers.lookup_deprecation_entry = |tcx, id| {
2990 assert_eq!(id.krate, LOCAL_CRATE);
2991 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
2992 tcx.stability().local_deprecation_entry(id)
2994 providers.extern_mod_stmt_cnum = |tcx, id| {
2995 let id = tcx.hir().as_local_node_id(id).unwrap();
2996 tcx.extern_crate_map.get(&id).cloned()
2998 providers.all_crate_nums = |tcx, cnum| {
2999 assert_eq!(cnum, LOCAL_CRATE);
3000 tcx.arena.alloc_slice(&tcx.cstore.crates_untracked())
3002 providers.crate_host_hash = |tcx, cnum| {
3003 assert_ne!(cnum, LOCAL_CRATE);
3004 tcx.cstore.crate_host_hash_untracked(cnum)
3006 providers.postorder_cnums = |tcx, cnum| {
3007 assert_eq!(cnum, LOCAL_CRATE);
3008 tcx.arena.alloc_slice(&tcx.cstore.postorder_cnums_untracked())
3010 providers.output_filenames = |tcx, cnum| {
3011 assert_eq!(cnum, LOCAL_CRATE);
3012 tcx.output_filenames.clone()
3014 providers.features_query = |tcx, cnum| {
3015 assert_eq!(cnum, LOCAL_CRATE);
3016 tcx.arena.alloc(tcx.sess.features_untracked().clone())
3018 providers.is_panic_runtime = |tcx, cnum| {
3019 assert_eq!(cnum, LOCAL_CRATE);
3020 attr::contains_name(tcx.hir().krate_attrs(), sym::panic_runtime)
3022 providers.is_compiler_builtins = |tcx, cnum| {
3023 assert_eq!(cnum, LOCAL_CRATE);
3024 attr::contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins)
3026 providers.has_panic_handler = |tcx, cnum| {
3027 assert_eq!(cnum, LOCAL_CRATE);
3028 // We want to check if the panic handler was defined in this crate
3029 tcx.lang_items().panic_impl().map_or(false, |did| did.is_local())