1 //! Type context book-keeping.
3 use crate::arena::Arena;
4 use crate::dep_graph::DepGraph;
5 use crate::dep_graph::{self, DepNode, DepConstructor};
6 use crate::session::Session;
7 use crate::session::config::{BorrowckMode, OutputFilenames};
8 use crate::session::config::CrateType;
10 use crate::hir::{self, TraitCandidate, HirId, ItemKind, ItemLocalId, Node};
11 use crate::hir::def::{Res, DefKind, Export};
12 use crate::hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
13 use crate::hir::map as hir_map;
14 use crate::hir::map::DefPathHash;
15 use crate::lint::{self, Lint};
16 use crate::ich::{StableHashingContext, NodeIdHashingMode};
17 use crate::infer::canonical::{Canonical, CanonicalVarInfo, CanonicalVarInfos};
18 use crate::infer::outlives::free_region_map::FreeRegionMap;
19 use crate::middle::cstore::CrateStoreDyn;
20 use crate::middle::cstore::EncodedMetadata;
21 use crate::middle::lang_items;
22 use crate::middle::resolve_lifetime::{self, ObjectLifetimeDefault};
23 use crate::middle::stability;
24 use crate::mir::{Body, interpret, ProjectionKind, Promoted};
25 use crate::mir::interpret::{ConstValue, Allocation, Scalar};
26 use crate::ty::subst::{GenericArg, InternalSubsts, SubstsRef, Subst};
27 use crate::ty::ReprOptions;
29 use crate::traits::{Clause, Clauses, GoalKind, Goal, Goals};
30 use crate::ty::{self, DefIdTree, Ty, TypeAndMut};
31 use crate::ty::{TyS, TyKind, List};
32 use crate::ty::{AdtKind, AdtDef, GeneratorSubsts, Region, Const};
33 use crate::ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
34 use crate::ty::RegionKind;
35 use crate::ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid, ConstVid};
36 use crate::ty::TyKind::*;
37 use crate::ty::{InferConst, ParamConst};
38 use crate::ty::GenericParamDefKind;
39 use crate::ty::layout::{LayoutDetails, TargetDataLayout, VariantIdx};
41 use crate::ty::steal::Steal;
42 use crate::ty::subst::{UserSubsts, GenericArgKind};
43 use crate::ty::{BoundVar, BindingMode};
44 use crate::ty::CanonicalPolyFnSig;
45 use crate::util::common::ErrorReported;
46 use crate::util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap, ItemLocalSet};
47 use crate::util::nodemap::{FxHashMap, FxHashSet};
48 use crate::util::profiling::SelfProfilerRef;
50 use errors::DiagnosticBuilder;
51 use arena::SyncDroplessArena;
52 use smallvec::SmallVec;
53 use rustc_data_structures::stable_hasher::{
54 HashStable, StableHasher, StableVec, hash_stable_hashmap,
56 use rustc_index::vec::{Idx, IndexVec};
57 use rustc_data_structures::sharded::ShardedHashMap;
58 use rustc_data_structures::sync::{Lrc, Lock, WorkerLocal};
60 use std::borrow::Borrow;
61 use std::cmp::Ordering;
62 use std::collections::hash_map::{self, Entry};
63 use std::hash::{Hash, Hasher};
66 use std::ops::{Deref, Bound};
69 use rustc_target::spec::abi;
70 use rustc_macros::HashStable;
73 use syntax::source_map::MultiSpan;
74 use syntax::feature_gate;
75 use syntax::symbol::{Symbol, InternedString, kw, sym};
78 pub struct AllArenas {
79 pub interner: SyncDroplessArena,
83 pub fn new() -> Self {
85 interner: SyncDroplessArena::default(),
90 type InternedSet<'tcx, T> = ShardedHashMap<Interned<'tcx, T>, ()>;
92 pub struct CtxtInterners<'tcx> {
93 /// The arena that types, regions, etc. are allocated from.
94 arena: &'tcx SyncDroplessArena,
96 /// Specifically use a speedy hash algorithm for these hash sets, since
97 /// they're accessed quite often.
98 type_: InternedSet<'tcx, TyS<'tcx>>,
99 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
100 substs: InternedSet<'tcx, InternalSubsts<'tcx>>,
101 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
102 region: InternedSet<'tcx, RegionKind>,
103 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
104 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
105 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
106 goal: InternedSet<'tcx, GoalKind<'tcx>>,
107 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
108 projs: InternedSet<'tcx, List<ProjectionKind>>,
109 const_: InternedSet<'tcx, Const<'tcx>>,
112 impl<'tcx> CtxtInterners<'tcx> {
113 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
116 type_: Default::default(),
117 type_list: Default::default(),
118 substs: Default::default(),
119 region: Default::default(),
120 existential_predicates: Default::default(),
121 canonical_var_infos: Default::default(),
122 predicates: Default::default(),
123 clauses: Default::default(),
124 goal: Default::default(),
125 goal_list: Default::default(),
126 projs: Default::default(),
127 const_: Default::default(),
132 #[allow(rustc::usage_of_ty_tykind)]
137 self.type_.intern(kind, |kind| {
138 let flags = super::flags::FlagComputation::for_kind(&kind);
140 let ty_struct = TyS {
143 outer_exclusive_binder: flags.outer_exclusive_binder,
146 Interned(self.arena.alloc(ty_struct))
151 pub struct Common<'tcx> {
152 pub empty_predicates: ty::GenericPredicates<'tcx>,
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, HashStable, PartialEq)]
311 pub struct GeneratorInteriorTypeCause<'tcx> {
312 /// Type of the captured binding.
314 /// Span of the binding that was captured.
316 /// Span of the scope of the captured binding.
317 pub scope_span: Option<Span>,
320 BraceStructTypeFoldableImpl! {
321 impl<'tcx> TypeFoldable<'tcx> for GeneratorInteriorTypeCause<'tcx> {
326 #[derive(RustcEncodable, RustcDecodable, Debug)]
327 pub struct TypeckTables<'tcx> {
328 /// The HirId::owner all ItemLocalIds in this table are relative to.
329 pub local_id_root: Option<DefId>,
331 /// Resolved definitions for `<T>::X` associated paths and
332 /// method calls, including those of overloaded operators.
333 type_dependent_defs: ItemLocalMap<Result<(DefKind, DefId), ErrorReported>>,
335 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
336 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
337 /// about the field you also need definition of the variant to which the field
338 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
339 field_indices: ItemLocalMap<usize>,
341 /// Stores the types for various nodes in the AST. Note that this table
342 /// is not guaranteed to be populated until after typeck. See
343 /// typeck::check::fn_ctxt for details.
344 node_types: ItemLocalMap<Ty<'tcx>>,
346 /// Stores the type parameters which were substituted to obtain the type
347 /// of this node. This only applies to nodes that refer to entities
348 /// parameterized by type parameters, such as generic fns, types, or
350 node_substs: ItemLocalMap<SubstsRef<'tcx>>,
352 /// This will either store the canonicalized types provided by the user
353 /// or the substitutions that the user explicitly gave (if any) attached
354 /// to `id`. These will not include any inferred values. The canonical form
355 /// is used to capture things like `_` or other unspecified values.
357 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
358 /// canonical substitutions would include only `for<X> { Vec<X> }`.
360 /// See also `AscribeUserType` statement in MIR.
361 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
363 /// Stores the canonicalized types provided by the user. See also
364 /// `AscribeUserType` statement in MIR.
365 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
367 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
369 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
370 pat_binding_modes: ItemLocalMap<BindingMode>,
372 /// Stores the types which were implicitly dereferenced in pattern binding modes
373 /// for later usage in HAIR lowering. For example,
376 /// match &&Some(5i32) {
381 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
384 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
385 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
388 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
390 /// Records the reasons that we picked the kind of each closure;
391 /// not all closures are present in the map.
392 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
394 /// For each fn, records the "liberated" types of its arguments
395 /// and return type. Liberated means that all bound regions
396 /// (including late-bound regions) are replaced with free
397 /// equivalents. This table is not used in codegen (since regions
398 /// are erased there) and hence is not serialized to metadata.
399 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
401 /// For each FRU expression, record the normalized types of the fields
402 /// of the struct - this is needed because it is non-trivial to
403 /// normalize while preserving regions. This table is used only in
404 /// MIR construction and hence is not serialized to metadata.
405 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
407 /// For every coercion cast we add the HIR node ID of the cast
408 /// expression to this set.
409 coercion_casts: ItemLocalSet,
411 /// Set of trait imports actually used in the method resolution.
412 /// This is used for warning unused imports. During type
413 /// checking, this `Lrc` should not be cloned: it must have a ref-count
414 /// of 1 so that we can insert things into the set mutably.
415 pub used_trait_imports: Lrc<DefIdSet>,
417 /// If any errors occurred while type-checking this body,
418 /// this field will be set to `true`.
419 pub tainted_by_errors: bool,
421 /// Stores the free-region relationships that were deduced from
422 /// its where-clauses and parameter types. These are then
423 /// read-again by borrowck.
424 pub free_region_map: FreeRegionMap<'tcx>,
426 /// All the opaque types that are restricted to concrete types
427 /// by this function.
428 pub concrete_opaque_types: FxHashMap<DefId, ResolvedOpaqueTy<'tcx>>,
430 /// Given the closure ID this map provides the list of UpvarIDs used by it.
431 /// The upvarID contains the HIR node ID and it also contains the full path
432 /// leading to the member of the struct or tuple that is used instead of the
434 pub upvar_list: ty::UpvarListMap,
436 /// Stores the type, span and optional scope span of all types
437 /// that are live across the yield of this generator (if a generator).
438 pub generator_interior_types: Vec<GeneratorInteriorTypeCause<'tcx>>,
441 impl<'tcx> TypeckTables<'tcx> {
442 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
445 type_dependent_defs: Default::default(),
446 field_indices: Default::default(),
447 user_provided_types: Default::default(),
448 user_provided_sigs: Default::default(),
449 node_types: Default::default(),
450 node_substs: Default::default(),
451 adjustments: Default::default(),
452 pat_binding_modes: Default::default(),
453 pat_adjustments: Default::default(),
454 upvar_capture_map: Default::default(),
455 closure_kind_origins: Default::default(),
456 liberated_fn_sigs: Default::default(),
457 fru_field_types: Default::default(),
458 coercion_casts: Default::default(),
459 used_trait_imports: Lrc::new(Default::default()),
460 tainted_by_errors: false,
461 free_region_map: Default::default(),
462 concrete_opaque_types: Default::default(),
463 upvar_list: Default::default(),
464 generator_interior_types: Default::default(),
468 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
469 pub fn qpath_res(&self, qpath: &hir::QPath, id: hir::HirId) -> Res {
471 hir::QPath::Resolved(_, ref path) => path.res,
472 hir::QPath::TypeRelative(..) => self.type_dependent_def(id)
473 .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)),
477 pub fn type_dependent_defs(
479 ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> {
480 LocalTableInContext {
481 local_id_root: self.local_id_root,
482 data: &self.type_dependent_defs
486 pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> {
487 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
488 self.type_dependent_defs.get(&id.local_id).cloned().and_then(|r| r.ok())
491 pub fn type_dependent_def_id(&self, id: HirId) -> Option<DefId> {
492 self.type_dependent_def(id).map(|(_, def_id)| def_id)
495 pub fn type_dependent_defs_mut(
497 ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> {
498 LocalTableInContextMut {
499 local_id_root: self.local_id_root,
500 data: &mut self.type_dependent_defs
504 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
505 LocalTableInContext {
506 local_id_root: self.local_id_root,
507 data: &self.field_indices
511 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
512 LocalTableInContextMut {
513 local_id_root: self.local_id_root,
514 data: &mut self.field_indices
518 pub fn user_provided_types(
520 ) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
521 LocalTableInContext {
522 local_id_root: self.local_id_root,
523 data: &self.user_provided_types
527 pub fn user_provided_types_mut(
529 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
530 LocalTableInContextMut {
531 local_id_root: self.local_id_root,
532 data: &mut self.user_provided_types
536 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
537 LocalTableInContext {
538 local_id_root: self.local_id_root,
539 data: &self.node_types
543 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
544 LocalTableInContextMut {
545 local_id_root: self.local_id_root,
546 data: &mut self.node_types
550 pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
551 self.node_type_opt(id).unwrap_or_else(||
552 bug!("node_type: no type for node `{}`",
553 tls::with(|tcx| tcx.hir().node_to_string(id)))
557 pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
558 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
559 self.node_types.get(&id.local_id).cloned()
562 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> {
563 LocalTableInContextMut {
564 local_id_root: self.local_id_root,
565 data: &mut self.node_substs
569 pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> {
570 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
571 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| InternalSubsts::empty())
574 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<SubstsRef<'tcx>> {
575 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
576 self.node_substs.get(&id.local_id).cloned()
579 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
580 // doesn't provide type parameter substitutions.
581 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
582 self.node_type(pat.hir_id)
585 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
586 self.node_type_opt(pat.hir_id)
589 // Returns the type of an expression as a monotype.
591 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
592 // some cases, we insert `Adjustment` annotations such as auto-deref or
593 // auto-ref. The type returned by this function does not consider such
594 // adjustments. See `expr_ty_adjusted()` instead.
596 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
597 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
598 // instead of "fn(ty) -> T with T = isize".
599 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
600 self.node_type(expr.hir_id)
603 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
604 self.node_type_opt(expr.hir_id)
607 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
608 LocalTableInContext {
609 local_id_root: self.local_id_root,
610 data: &self.adjustments
614 pub fn adjustments_mut(&mut self)
615 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
616 LocalTableInContextMut {
617 local_id_root: self.local_id_root,
618 data: &mut self.adjustments
622 pub fn expr_adjustments(&self, expr: &hir::Expr)
623 -> &[ty::adjustment::Adjustment<'tcx>] {
624 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
625 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
628 /// Returns the type of `expr`, considering any `Adjustment`
629 /// entry recorded for that expression.
630 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
631 self.expr_adjustments(expr)
633 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
636 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
637 self.expr_adjustments(expr)
639 .map(|adj| adj.target)
640 .or_else(|| self.expr_ty_opt(expr))
643 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
644 // Only paths and method calls/overloaded operators have
645 // entries in type_dependent_defs, ignore the former here.
646 if let hir::ExprKind::Path(_) = expr.kind {
650 match self.type_dependent_defs().get(expr.hir_id) {
651 Some(Ok((DefKind::Method, _))) => true,
656 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
657 LocalTableInContext {
658 local_id_root: self.local_id_root,
659 data: &self.pat_binding_modes
663 pub fn pat_binding_modes_mut(&mut self)
664 -> LocalTableInContextMut<'_, BindingMode> {
665 LocalTableInContextMut {
666 local_id_root: self.local_id_root,
667 data: &mut self.pat_binding_modes
671 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
672 LocalTableInContext {
673 local_id_root: self.local_id_root,
674 data: &self.pat_adjustments,
678 pub fn pat_adjustments_mut(&mut self)
679 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
680 LocalTableInContextMut {
681 local_id_root: self.local_id_root,
682 data: &mut self.pat_adjustments,
686 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
687 self.upvar_capture_map[&upvar_id]
690 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
691 LocalTableInContext {
692 local_id_root: self.local_id_root,
693 data: &self.closure_kind_origins
697 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
698 LocalTableInContextMut {
699 local_id_root: self.local_id_root,
700 data: &mut self.closure_kind_origins
704 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
705 LocalTableInContext {
706 local_id_root: self.local_id_root,
707 data: &self.liberated_fn_sigs
711 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
712 LocalTableInContextMut {
713 local_id_root: self.local_id_root,
714 data: &mut self.liberated_fn_sigs
718 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
719 LocalTableInContext {
720 local_id_root: self.local_id_root,
721 data: &self.fru_field_types
725 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
726 LocalTableInContextMut {
727 local_id_root: self.local_id_root,
728 data: &mut self.fru_field_types
732 pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool {
733 validate_hir_id_for_typeck_tables(self.local_id_root, hir_id, true);
734 self.coercion_casts.contains(&hir_id.local_id)
737 pub fn set_coercion_cast(&mut self, id: ItemLocalId) {
738 self.coercion_casts.insert(id);
741 pub fn coercion_casts(&self) -> &ItemLocalSet {
747 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for TypeckTables<'tcx> {
748 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
749 let ty::TypeckTables {
751 ref type_dependent_defs,
753 ref user_provided_types,
754 ref user_provided_sigs,
758 ref pat_binding_modes,
760 ref upvar_capture_map,
761 ref closure_kind_origins,
762 ref liberated_fn_sigs,
767 ref used_trait_imports,
770 ref concrete_opaque_types,
772 ref generator_interior_types,
776 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
777 type_dependent_defs.hash_stable(hcx, hasher);
778 field_indices.hash_stable(hcx, hasher);
779 user_provided_types.hash_stable(hcx, hasher);
780 user_provided_sigs.hash_stable(hcx, hasher);
781 node_types.hash_stable(hcx, hasher);
782 node_substs.hash_stable(hcx, hasher);
783 adjustments.hash_stable(hcx, hasher);
784 pat_binding_modes.hash_stable(hcx, hasher);
785 pat_adjustments.hash_stable(hcx, hasher);
786 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
793 local_id_root.expect("trying to hash invalid TypeckTables");
795 let var_owner_def_id = DefId {
796 krate: local_id_root.krate,
797 index: var_path.hir_id.owner,
799 let closure_def_id = DefId {
800 krate: local_id_root.krate,
801 index: closure_expr_id.to_def_id().index,
803 (hcx.def_path_hash(var_owner_def_id),
804 var_path.hir_id.local_id,
805 hcx.def_path_hash(closure_def_id))
808 closure_kind_origins.hash_stable(hcx, hasher);
809 liberated_fn_sigs.hash_stable(hcx, hasher);
810 fru_field_types.hash_stable(hcx, hasher);
811 coercion_casts.hash_stable(hcx, hasher);
812 used_trait_imports.hash_stable(hcx, hasher);
813 tainted_by_errors.hash_stable(hcx, hasher);
814 free_region_map.hash_stable(hcx, hasher);
815 concrete_opaque_types.hash_stable(hcx, hasher);
816 upvar_list.hash_stable(hcx, hasher);
817 generator_interior_types.hash_stable(hcx, hasher);
822 rustc_index::newtype_index! {
823 pub struct UserTypeAnnotationIndex {
825 DEBUG_FORMAT = "UserType({})",
826 const START_INDEX = 0,
830 /// Mapping of type annotation indices to canonical user type annotations.
831 pub type CanonicalUserTypeAnnotations<'tcx> =
832 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
834 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
835 pub struct CanonicalUserTypeAnnotation<'tcx> {
836 pub user_ty: CanonicalUserType<'tcx>,
838 pub inferred_ty: Ty<'tcx>,
841 BraceStructTypeFoldableImpl! {
842 impl<'tcx> TypeFoldable<'tcx> for CanonicalUserTypeAnnotation<'tcx> {
843 user_ty, span, inferred_ty
847 BraceStructLiftImpl! {
848 impl<'a, 'tcx> Lift<'tcx> for CanonicalUserTypeAnnotation<'a> {
849 type Lifted = CanonicalUserTypeAnnotation<'tcx>;
850 user_ty, span, inferred_ty
854 /// Canonicalized user type annotation.
855 pub type CanonicalUserType<'tcx> = Canonical<'tcx, UserType<'tcx>>;
857 impl CanonicalUserType<'tcx> {
858 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
859 /// i.e., each thing is mapped to a canonical variable with the same index.
860 pub fn is_identity(&self) -> bool {
862 UserType::Ty(_) => false,
863 UserType::TypeOf(_, user_substs) => {
864 if user_substs.user_self_ty.is_some() {
868 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
869 match kind.unpack() {
870 GenericArgKind::Type(ty) => match ty.kind {
871 ty::Bound(debruijn, b) => {
872 // We only allow a `ty::INNERMOST` index in substitutions.
873 assert_eq!(debruijn, ty::INNERMOST);
879 GenericArgKind::Lifetime(r) => match r {
880 ty::ReLateBound(debruijn, br) => {
881 // We only allow a `ty::INNERMOST` index in substitutions.
882 assert_eq!(*debruijn, ty::INNERMOST);
883 cvar == br.assert_bound_var()
888 GenericArgKind::Const(ct) => match ct.val {
889 ConstValue::Infer(InferConst::Canonical(debruijn, b)) => {
890 // We only allow a `ty::INNERMOST` index in substitutions.
891 assert_eq!(debruijn, ty::INNERMOST);
903 /// A user-given type annotation attached to a constant. These arise
904 /// from constants that are named via paths, like `Foo::<A>::new` and
906 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
907 pub enum UserType<'tcx> {
910 /// The canonical type is the result of `type_of(def_id)` with the
911 /// given substitutions applied.
912 TypeOf(DefId, UserSubsts<'tcx>),
915 EnumTypeFoldableImpl! {
916 impl<'tcx> TypeFoldable<'tcx> for UserType<'tcx> {
918 (UserType::TypeOf)(def, substs),
923 impl<'a, 'tcx> Lift<'tcx> for UserType<'a> {
924 type Lifted = UserType<'tcx>;
926 (UserType::TypeOf)(def, substs),
930 impl<'tcx> CommonTypes<'tcx> {
931 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
932 let mk = |ty| interners.intern_ty(ty);
935 unit: mk(Tuple(List::empty())),
940 isize: mk(Int(ast::IntTy::Isize)),
941 i8: mk(Int(ast::IntTy::I8)),
942 i16: mk(Int(ast::IntTy::I16)),
943 i32: mk(Int(ast::IntTy::I32)),
944 i64: mk(Int(ast::IntTy::I64)),
945 i128: mk(Int(ast::IntTy::I128)),
946 usize: mk(Uint(ast::UintTy::Usize)),
947 u8: mk(Uint(ast::UintTy::U8)),
948 u16: mk(Uint(ast::UintTy::U16)),
949 u32: mk(Uint(ast::UintTy::U32)),
950 u64: mk(Uint(ast::UintTy::U64)),
951 u128: mk(Uint(ast::UintTy::U128)),
952 f32: mk(Float(ast::FloatTy::F32)),
953 f64: mk(Float(ast::FloatTy::F64)),
954 self_param: mk(ty::Param(ty::ParamTy {
956 name: kw::SelfUpper.as_interned_str(),
959 trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
964 impl<'tcx> CommonLifetimes<'tcx> {
965 fn new(interners: &CtxtInterners<'tcx>) -> CommonLifetimes<'tcx> {
967 interners.region.intern(r, |r| {
968 Interned(interners.arena.alloc(r))
973 re_empty: mk(RegionKind::ReEmpty),
974 re_static: mk(RegionKind::ReStatic),
975 re_erased: mk(RegionKind::ReErased),
980 impl<'tcx> CommonConsts<'tcx> {
981 fn new(interners: &CtxtInterners<'tcx>, types: &CommonTypes<'tcx>) -> CommonConsts<'tcx> {
983 interners.const_.intern(c, |c| {
984 Interned(interners.arena.alloc(c))
989 err: mk_const(ty::Const {
990 val: ConstValue::Scalar(Scalar::zst()),
997 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
1000 pub struct FreeRegionInfo {
1001 // def id corresponding to FreeRegion
1003 // the bound region corresponding to FreeRegion
1004 pub boundregion: ty::BoundRegion,
1005 // checks if bound region is in Impl Item
1006 pub is_impl_item: bool,
1009 /// The central data structure of the compiler. It stores references
1010 /// to the various **arenas** and also houses the results of the
1011 /// various **compiler queries** that have been performed. See the
1012 /// [rustc guide] for more details.
1014 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
1015 #[derive(Copy, Clone)]
1016 #[rustc_diagnostic_item = "TyCtxt"]
1017 pub struct TyCtxt<'tcx> {
1018 gcx: &'tcx GlobalCtxt<'tcx>,
1021 impl<'tcx> Deref for TyCtxt<'tcx> {
1022 type Target = &'tcx GlobalCtxt<'tcx>;
1024 fn deref(&self) -> &Self::Target {
1029 pub struct GlobalCtxt<'tcx> {
1030 pub arena: WorkerLocal<Arena<'tcx>>,
1032 interners: CtxtInterners<'tcx>,
1034 cstore: &'tcx CrateStoreDyn,
1036 pub sess: &'tcx Session,
1038 pub dep_graph: DepGraph,
1040 pub prof: SelfProfilerRef,
1043 pub common: Common<'tcx>,
1045 /// Common types, pre-interned for your convenience.
1046 pub types: CommonTypes<'tcx>,
1048 /// Common lifetimes, pre-interned for your convenience.
1049 pub lifetimes: CommonLifetimes<'tcx>,
1051 /// Common consts, pre-interned for your convenience.
1052 pub consts: CommonConsts<'tcx>,
1054 /// Map indicating what traits are in scope for places where this
1055 /// is relevant; generated by resolve.
1056 trait_map: FxHashMap<DefIndex,
1057 FxHashMap<ItemLocalId,
1058 StableVec<TraitCandidate>>>,
1060 /// Export map produced by name resolution.
1061 export_map: FxHashMap<DefId, Vec<Export<hir::HirId>>>,
1063 hir_map: hir_map::Map<'tcx>,
1065 /// A map from `DefPathHash` -> `DefId`. Includes `DefId`s from the local crate
1066 /// as well as all upstream crates. Only populated in incremental mode.
1067 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
1069 pub queries: query::Queries<'tcx>,
1071 maybe_unused_trait_imports: FxHashSet<DefId>,
1072 maybe_unused_extern_crates: Vec<(DefId, Span)>,
1073 /// A map of glob use to a set of names it actually imports. Currently only
1074 /// used in save-analysis.
1075 glob_map: FxHashMap<DefId, FxHashSet<ast::Name>>,
1076 /// Extern prelude entries. The value is `true` if the entry was introduced
1077 /// via `extern crate` item and not `--extern` option or compiler built-in.
1078 pub extern_prelude: FxHashMap<ast::Name, bool>,
1080 // Internal cache for metadata decoding. No need to track deps on this.
1081 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
1083 /// Caches the results of trait selection. This cache is used
1084 /// for things that do not have to do with the parameters in scope.
1085 pub selection_cache: traits::SelectionCache<'tcx>,
1087 /// Caches the results of trait evaluation. This cache is used
1088 /// for things that do not have to do with the parameters in scope.
1089 /// Merge this with `selection_cache`?
1090 pub evaluation_cache: traits::EvaluationCache<'tcx>,
1092 /// The definite name of the current crate after taking into account
1093 /// attributes, commandline parameters, etc.
1094 pub crate_name: Symbol,
1096 /// Data layout specification for the current target.
1097 pub data_layout: TargetDataLayout,
1099 stability_interner: ShardedHashMap<&'tcx attr::Stability, ()>,
1101 /// Stores the value of constants (and deduplicates the actual memory)
1102 allocation_interner: ShardedHashMap<&'tcx Allocation, ()>,
1104 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1106 layout_interner: ShardedHashMap<&'tcx LayoutDetails, ()>,
1108 output_filenames: Arc<OutputFilenames>,
1111 impl<'tcx> TyCtxt<'tcx> {
1113 pub fn hir(self) -> &'tcx hir_map::Map<'tcx> {
1117 pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal<Body<'tcx>> {
1118 self.arena.alloc(Steal::new(mir))
1121 pub fn alloc_steal_promoted(self, promoted: IndexVec<Promoted, Body<'tcx>>) ->
1122 &'tcx Steal<IndexVec<Promoted, Body<'tcx>>> {
1123 self.arena.alloc(Steal::new(promoted))
1126 pub fn intern_promoted(self, promoted: IndexVec<Promoted, Body<'tcx>>) ->
1127 &'tcx IndexVec<Promoted, Body<'tcx>> {
1128 self.arena.alloc(promoted)
1131 pub fn alloc_adt_def(
1135 variants: IndexVec<VariantIdx, ty::VariantDef>,
1137 ) -> &'tcx ty::AdtDef {
1138 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1139 self.arena.alloc(def)
1142 pub fn intern_const_alloc(self, alloc: Allocation) -> &'tcx Allocation {
1143 self.allocation_interner.intern(alloc, |alloc| {
1144 self.arena.alloc(alloc)
1148 /// Allocates a read-only byte or string literal for `mir::interpret`.
1149 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1150 // Create an allocation that just contains these bytes.
1151 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1152 let alloc = self.intern_const_alloc(alloc);
1153 self.alloc_map.lock().create_memory_alloc(alloc)
1156 pub fn intern_stability(self, stab: attr::Stability) -> &'tcx attr::Stability {
1157 self.stability_interner.intern(stab, |stab| {
1158 self.arena.alloc(stab)
1162 pub fn intern_layout(self, layout: LayoutDetails) -> &'tcx LayoutDetails {
1163 self.layout_interner.intern(layout, |layout| {
1164 self.arena.alloc(layout)
1168 /// Returns a range of the start/end indices specified with the
1169 /// `rustc_layout_scalar_valid_range` attribute.
1170 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1171 let attrs = self.get_attrs(def_id);
1173 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1175 None => return Bound::Unbounded,
1177 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1178 match meta.literal().expect("attribute takes lit").kind {
1179 ast::LitKind::Int(a, _) => return Bound::Included(a),
1180 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1183 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1185 (get(sym::rustc_layout_scalar_valid_range_start),
1186 get(sym::rustc_layout_scalar_valid_range_end))
1189 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1190 value.lift_to_tcx(self)
1193 /// Creates a type context and call the closure with a `TyCtxt` reference
1194 /// to the context. The closure enforces that the type context and any interned
1195 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1196 /// reference to the context, to allow formatting values that need it.
1197 pub fn create_global_ctxt(
1199 cstore: &'tcx CrateStoreDyn,
1200 local_providers: ty::query::Providers<'tcx>,
1201 extern_providers: ty::query::Providers<'tcx>,
1202 arenas: &'tcx AllArenas,
1203 resolutions: ty::Resolutions,
1204 hir: hir_map::Map<'tcx>,
1205 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1207 output_filenames: &OutputFilenames,
1208 ) -> GlobalCtxt<'tcx> {
1209 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1212 let interners = CtxtInterners::new(&arenas.interner);
1213 let common = Common {
1214 empty_predicates: ty::GenericPredicates {
1219 let common_types = CommonTypes::new(&interners);
1220 let common_lifetimes = CommonLifetimes::new(&interners);
1221 let common_consts = CommonConsts::new(&interners, &common_types);
1222 let dep_graph = hir.dep_graph.clone();
1223 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1224 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1225 providers[LOCAL_CRATE] = local_providers;
1227 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1228 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1231 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1234 let def_path_tables = || {
1235 upstream_def_path_tables
1237 .map(|&(cnum, ref rc)| (cnum, &**rc))
1238 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1241 // Precompute the capacity of the hashmap so we don't have to
1242 // re-allocate when populating it.
1243 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1245 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1247 ::std::default::Default::default()
1250 for (cnum, def_path_table) in def_path_tables() {
1251 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1259 let mut trait_map: FxHashMap<_, FxHashMap<_, _>> = FxHashMap::default();
1260 for (k, v) in resolutions.trait_map {
1261 let hir_id = hir.node_to_hir_id(k);
1262 let map = trait_map.entry(hir_id.owner).or_default();
1263 map.insert(hir_id.local_id, StableVec::new(v));
1269 arena: WorkerLocal::new(|_| Arena::default()),
1272 prof: s.prof.clone(),
1274 types: common_types,
1275 lifetimes: common_lifetimes,
1276 consts: common_consts,
1278 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1279 let exports: Vec<_> = v.into_iter().map(|e| {
1280 e.map_id(|id| hir.node_to_hir_id(id))
1284 maybe_unused_trait_imports:
1285 resolutions.maybe_unused_trait_imports
1287 .map(|id| hir.local_def_id_from_node_id(id))
1289 maybe_unused_extern_crates:
1290 resolutions.maybe_unused_extern_crates
1292 .map(|(id, sp)| (hir.local_def_id_from_node_id(id), sp))
1294 glob_map: resolutions.glob_map.into_iter().map(|(id, names)| {
1295 (hir.local_def_id_from_node_id(id), names)
1297 extern_prelude: resolutions.extern_prelude,
1299 def_path_hash_to_def_id,
1300 queries: query::Queries::new(
1303 on_disk_query_result_cache,
1305 rcache: Default::default(),
1306 selection_cache: Default::default(),
1307 evaluation_cache: Default::default(),
1308 crate_name: Symbol::intern(crate_name),
1310 layout_interner: Default::default(),
1311 stability_interner: Default::default(),
1312 allocation_interner: Default::default(),
1313 alloc_map: Lock::new(interpret::AllocMap::new()),
1314 output_filenames: Arc::new(output_filenames.clone()),
1318 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1319 let cname = self.crate_name(LOCAL_CRATE).as_str();
1320 self.sess.consider_optimizing(&cname, msg)
1323 pub fn lib_features(self) -> &'tcx middle::lib_features::LibFeatures {
1324 self.get_lib_features(LOCAL_CRATE)
1327 /// Obtain all lang items of this crate and all dependencies (recursively)
1328 pub fn lang_items(self) -> &'tcx middle::lang_items::LanguageItems {
1329 self.get_lang_items(LOCAL_CRATE)
1332 /// Obtain the given diagnostic item's `DefId`. Use `is_diagnostic_item` if you just want to
1333 /// compare against another `DefId`, since `is_diagnostic_item` is cheaper.
1334 pub fn get_diagnostic_item(self, name: Symbol) -> Option<DefId> {
1335 self.all_diagnostic_items(LOCAL_CRATE).get(&name).copied()
1338 /// Check whether the diagnostic item with the given `name` has the given `DefId`.
1339 pub fn is_diagnostic_item(self, name: Symbol, did: DefId) -> bool {
1340 self.diagnostic_items(did.krate).get(&name) == Some(&did)
1343 pub fn stability(self) -> &'tcx stability::Index<'tcx> {
1344 self.stability_index(LOCAL_CRATE)
1347 pub fn crates(self) -> &'tcx [CrateNum] {
1348 self.all_crate_nums(LOCAL_CRATE)
1351 pub fn features(self) -> &'tcx feature_gate::Features {
1352 self.features_query(LOCAL_CRATE)
1355 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1357 self.hir().def_key(id)
1359 self.cstore.def_key(id)
1363 /// Converts a `DefId` into its fully expanded `DefPath` (every
1364 /// `DefId` is really just an interned `DefPath`).
1366 /// Note that if `id` is not local to this crate, the result will
1367 /// be a non-local `DefPath`.
1368 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1370 self.hir().def_path(id)
1372 self.cstore.def_path(id)
1376 /// Returns whether or not the crate with CrateNum 'cnum'
1377 /// is marked as a private dependency
1378 pub fn is_private_dep(self, cnum: CrateNum) -> bool {
1379 if cnum == LOCAL_CRATE {
1382 self.cstore.crate_is_private_dep_untracked(cnum)
1387 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1388 if def_id.is_local() {
1389 self.hir().definitions().def_path_hash(def_id.index)
1391 self.cstore.def_path_hash(def_id)
1395 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1396 // We are explicitly not going through queries here in order to get
1397 // crate name and disambiguator since this code is called from debug!()
1398 // statements within the query system and we'd run into endless
1399 // recursion otherwise.
1400 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1401 (self.crate_name.clone(),
1402 self.sess.local_crate_disambiguator())
1404 (self.cstore.crate_name_untracked(def_id.krate),
1405 self.cstore.crate_disambiguator_untracked(def_id.krate))
1410 // Don't print the whole crate disambiguator. That's just
1411 // annoying in debug output.
1412 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1413 self.def_path(def_id).to_string_no_crate())
1416 pub fn metadata_encoding_version(self) -> Vec<u8> {
1417 self.cstore.metadata_encoding_version().to_vec()
1420 pub fn encode_metadata(self)-> EncodedMetadata {
1421 self.cstore.encode_metadata(self)
1424 // Note that this is *untracked* and should only be used within the query
1425 // system if the result is otherwise tracked through queries
1426 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1427 self.cstore.crate_data_as_rc_any(cnum)
1431 pub fn create_stable_hashing_context(self) -> StableHashingContext<'tcx> {
1432 let krate = self.gcx.hir_map.forest.untracked_krate();
1434 StableHashingContext::new(self.sess,
1436 self.hir().definitions(),
1440 // This method makes sure that we have a DepNode and a Fingerprint for
1441 // every upstream crate. It needs to be called once right after the tcx is
1443 // With full-fledged red/green, the method will probably become unnecessary
1444 // as this will be done on-demand.
1445 pub fn allocate_metadata_dep_nodes(self) {
1446 // We cannot use the query versions of crates() and crate_hash(), since
1447 // those would need the DepNodes that we are allocating here.
1448 for cnum in self.cstore.crates_untracked() {
1449 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1450 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1451 self.dep_graph.with_task(dep_node,
1454 |_, x| x, // No transformation needed
1455 dep_graph::hash_result,
1460 pub fn serialize_query_result_cache<E>(self,
1462 -> Result<(), E::Error>
1463 where E: ty::codec::TyEncoder
1465 self.queries.on_disk_cache.serialize(self, encoder)
1468 /// If `true`, we should use the MIR-based borrowck, but also
1469 /// fall back on the AST borrowck if the MIR-based one errors.
1470 pub fn migrate_borrowck(self) -> bool {
1471 self.borrowck_mode().migrate()
1474 /// If `true`, make MIR codegen for `match` emit a temp that holds a
1475 /// borrow of the input to the match expression.
1476 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1477 self.emit_read_for_match()
1480 /// If `true`, make MIR codegen for `match` emit FakeRead
1481 /// statements (which simulate the maximal effect of executing the
1482 /// patterns in a match arm).
1483 pub fn emit_read_for_match(&self) -> bool {
1484 !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1487 /// What mode(s) of borrowck should we run? AST? MIR? both?
1488 /// (Also considers the `#![feature(nll)]` setting.)
1489 pub fn borrowck_mode(&self) -> BorrowckMode {
1490 // Here are the main constraints we need to deal with:
1492 // 1. An opts.borrowck_mode of `BorrowckMode::Migrate` is
1493 // synonymous with no `-Z borrowck=...` flag at all.
1495 // 2. We want to allow developers on the Nightly channel
1496 // to opt back into the "hard error" mode for NLL,
1497 // (which they can do via specifying `#![feature(nll)]`
1498 // explicitly in their crate).
1500 // So, this precedence list is how pnkfelix chose to work with
1501 // the above constraints:
1503 // * `#![feature(nll)]` *always* means use NLL with hard
1504 // errors. (To simplify the code here, it now even overrides
1505 // a user's attempt to specify `-Z borrowck=compare`, which
1506 // we arguably do not need anymore and should remove.)
1508 // * Otherwise, if no `-Z borrowck=...` then use migrate mode
1510 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1512 if self.features().nll { return BorrowckMode::Mir; }
1514 self.sess.opts.borrowck_mode
1518 pub fn local_crate_exports_generics(self) -> bool {
1519 debug_assert!(self.sess.opts.share_generics());
1521 self.sess.crate_types.borrow().iter().any(|crate_type| {
1523 CrateType::Executable |
1524 CrateType::Staticlib |
1525 CrateType::ProcMacro |
1527 CrateType::Cdylib => false,
1528 CrateType::Rlib => true,
1533 // Returns the `DefId` and the `BoundRegion` corresponding to the given region.
1534 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1535 let (suitable_region_binding_scope, bound_region) = match *region {
1536 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1537 ty::ReEarlyBound(ref ebr) => (
1538 self.parent(ebr.def_id).unwrap(),
1539 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1541 _ => return None, // not a free region
1544 let hir_id = self.hir()
1545 .as_local_hir_id(suitable_region_binding_scope)
1547 let is_impl_item = match self.hir().find(hir_id) {
1548 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1549 Some(Node::ImplItem(..)) => {
1550 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1555 return Some(FreeRegionInfo {
1556 def_id: suitable_region_binding_scope,
1557 boundregion: bound_region,
1558 is_impl_item: is_impl_item,
1562 pub fn return_type_impl_trait(
1564 scope_def_id: DefId,
1565 ) -> Option<Ty<'tcx>> {
1566 // HACK: `type_of_def_id()` will fail on these (#55796), so return `None`.
1567 let hir_id = self.hir().as_local_hir_id(scope_def_id).unwrap();
1568 match self.hir().get(hir_id) {
1569 Node::Item(item) => {
1571 ItemKind::Fn(..) => { /* `type_of_def_id()` will work */ }
1577 _ => { /* `type_of_def_id()` will work or panic */ }
1580 let ret_ty = self.type_of(scope_def_id);
1582 ty::FnDef(_, _) => {
1583 let sig = ret_ty.fn_sig(*self);
1584 let output = self.erase_late_bound_regions(&sig.output());
1585 if output.is_impl_trait() {
1595 // Checks if the bound region is in Impl Item.
1596 pub fn is_bound_region_in_impl_item(
1598 suitable_region_binding_scope: DefId,
1600 let container_id = self.associated_item(suitable_region_binding_scope)
1603 if self.impl_trait_ref(container_id).is_some() {
1604 // For now, we do not try to target impls of traits. This is
1605 // because this message is going to suggest that the user
1606 // change the fn signature, but they may not be free to do so,
1607 // since the signature must match the trait.
1609 // FIXME(#42706) -- in some cases, we could do better here.
1615 /// Determines whether identifiers in the assembly have strict naming rules.
1616 /// Currently, only NVPTX* targets need it.
1617 pub fn has_strict_asm_symbol_naming(&self) -> bool {
1618 self.sess.target.target.arch.contains("nvptx")
1622 impl<'tcx> GlobalCtxt<'tcx> {
1623 /// Calls the closure with a local `TyCtxt` using the given arena.
1624 /// `interners` is a slot passed so we can create a CtxtInterners
1625 /// with the same lifetime as `arena`.
1626 pub fn enter_local<F, R>(&'tcx self, f: F) -> R
1628 F: FnOnce(TyCtxt<'tcx>) -> R,
1633 ty::tls::with_related_context(tcx, |icx| {
1634 let new_icx = ty::tls::ImplicitCtxt {
1636 query: icx.query.clone(),
1637 diagnostics: icx.diagnostics,
1638 layout_depth: icx.layout_depth,
1639 task_deps: icx.task_deps,
1641 ty::tls::enter_context(&new_icx, |_| {
1648 /// A trait implemented for all `X<'a>` types that can be safely and
1649 /// efficiently converted to `X<'tcx>` as long as they are part of the
1650 /// provided `TyCtxt<'tcx>`.
1651 /// This can be done, for example, for `Ty<'tcx>` or `SubstsRef<'tcx>`
1652 /// by looking them up in their respective interners.
1654 /// However, this is still not the best implementation as it does
1655 /// need to compare the components, even for interned values.
1656 /// It would be more efficient if `TypedArena` provided a way to
1657 /// determine whether the address is in the allocated range.
1659 /// `None` is returned if the value or one of the components is not part
1660 /// of the provided context.
1661 /// For `Ty`, `None` can be returned if either the type interner doesn't
1662 /// contain the `TyKind` key or if the address of the interned
1663 /// pointer differs. The latter case is possible if a primitive type,
1664 /// e.g., `()` or `u8`, was interned in a different context.
1665 pub trait Lift<'tcx>: fmt::Debug {
1666 type Lifted: fmt::Debug + 'tcx;
1667 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>;
1670 macro_rules! nop_lift {
1671 ($ty:ty => $lifted:ty) => {
1672 impl<'a, 'tcx> Lift<'tcx> for $ty {
1673 type Lifted = $lifted;
1674 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1675 if tcx.interners.arena.in_arena(*self as *const _) {
1676 Some(unsafe { mem::transmute(*self) })
1685 macro_rules! nop_list_lift {
1686 ($ty:ty => $lifted:ty) => {
1687 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1688 type Lifted = &'tcx List<$lifted>;
1689 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1690 if self.is_empty() {
1691 return Some(List::empty());
1693 if tcx.interners.arena.in_arena(*self as *const _) {
1694 Some(unsafe { mem::transmute(*self) })
1703 nop_lift!{Ty<'a> => Ty<'tcx>}
1704 nop_lift!{Region<'a> => Region<'tcx>}
1705 nop_lift!{Goal<'a> => Goal<'tcx>}
1706 nop_lift!{&'a Const<'a> => &'tcx Const<'tcx>}
1708 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1709 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1710 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1711 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1712 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1713 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1714 nop_list_lift!{ProjectionKind => ProjectionKind}
1716 // This is the impl for `&'a InternalSubsts<'a>`.
1717 nop_list_lift!{GenericArg<'a> => GenericArg<'tcx>}
1720 use super::{GlobalCtxt, TyCtxt, ptr_eq};
1725 use crate::ty::query;
1726 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1727 use rustc_data_structures::OnDrop;
1728 use rustc_data_structures::sync::{self, Lrc, Lock};
1729 use rustc_data_structures::thin_vec::ThinVec;
1730 use crate::dep_graph::TaskDeps;
1732 #[cfg(not(parallel_compiler))]
1733 use std::cell::Cell;
1735 #[cfg(parallel_compiler)]
1736 use rustc_rayon_core as rayon_core;
1738 /// This is the implicit state of rustc. It contains the current
1739 /// `TyCtxt` and query. It is updated when creating a local interner or
1740 /// executing a new query. Whenever there's a `TyCtxt` value available
1741 /// you should also have access to an `ImplicitCtxt` through the functions
1744 pub struct ImplicitCtxt<'a, 'tcx> {
1745 /// The current `TyCtxt`. Initially created by `enter_global` and updated
1746 /// by `enter_local` with a new local interner.
1747 pub tcx: TyCtxt<'tcx>,
1749 /// The current query job, if any. This is updated by `JobOwner::start` in
1750 /// `ty::query::plumbing` when executing a query.
1751 pub query: Option<Lrc<query::QueryJob<'tcx>>>,
1753 /// Where to store diagnostics for the current query job, if any.
1754 /// This is updated by `JobOwner::start` in `ty::query::plumbing` when executing a query.
1755 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1757 /// Used to prevent layout from recursing too deeply.
1758 pub layout_depth: usize,
1760 /// The current dep graph task. This is used to add dependencies to queries
1761 /// when executing them.
1762 pub task_deps: Option<&'a Lock<TaskDeps>>,
1765 /// Sets Rayon's thread-local variable, which is preserved for Rayon jobs
1766 /// to `value` during the call to `f`. It is restored to its previous value after.
1767 /// This is used to set the pointer to the new `ImplicitCtxt`.
1768 #[cfg(parallel_compiler)]
1770 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1771 rayon_core::tlv::with(value, f)
1774 /// Gets Rayon's thread-local variable, which is preserved for Rayon jobs.
1775 /// This is used to get the pointer to the current `ImplicitCtxt`.
1776 #[cfg(parallel_compiler)]
1778 fn get_tlv() -> usize {
1779 rayon_core::tlv::get()
1782 #[cfg(not(parallel_compiler))]
1784 /// A thread local variable that stores a pointer to the current `ImplicitCtxt`.
1785 static TLV: Cell<usize> = Cell::new(0);
1788 /// Sets TLV to `value` during the call to `f`.
1789 /// It is restored to its previous value after.
1790 /// This is used to set the pointer to the new `ImplicitCtxt`.
1791 #[cfg(not(parallel_compiler))]
1793 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1794 let old = get_tlv();
1795 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1796 TLV.with(|tlv| tlv.set(value));
1800 /// Gets the pointer to the current `ImplicitCtxt`.
1801 #[cfg(not(parallel_compiler))]
1802 fn get_tlv() -> usize {
1803 TLV.with(|tlv| tlv.get())
1806 /// This is a callback from libsyntax as it cannot access the implicit state
1807 /// in librustc otherwise.
1808 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1810 if let Some(tcx) = tcx {
1811 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1813 syntax_pos::default_span_debug(span, f)
1818 /// This is a callback from libsyntax as it cannot access the implicit state
1819 /// in librustc otherwise. It is used to when diagnostic messages are
1820 /// emitted and stores them in the current query, if there is one.
1821 fn track_diagnostic(diagnostic: &Diagnostic) {
1822 with_context_opt(|icx| {
1823 if let Some(icx) = icx {
1824 if let Some(ref diagnostics) = icx.diagnostics {
1825 let mut diagnostics = diagnostics.lock();
1826 diagnostics.extend(Some(diagnostic.clone()));
1832 /// Sets up the callbacks from libsyntax on the current thread.
1833 pub fn with_thread_locals<F, R>(f: F) -> R
1834 where F: FnOnce() -> R
1836 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1837 let original_span_debug = span_dbg.get();
1838 span_dbg.set(span_debug);
1840 let _on_drop = OnDrop(move || {
1841 span_dbg.set(original_span_debug);
1844 TRACK_DIAGNOSTICS.with(|current| {
1845 let original = current.get();
1846 current.set(track_diagnostic);
1848 let _on_drop = OnDrop(move || {
1849 current.set(original);
1857 /// Sets `context` as the new current `ImplicitCtxt` for the duration of the function `f`.
1859 pub fn enter_context<'a, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'tcx>, f: F) -> R
1861 F: FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1863 set_tlv(context as *const _ as usize, || {
1868 /// Enters `GlobalCtxt` by setting up libsyntax callbacks and
1869 /// creating a initial `TyCtxt` and `ImplicitCtxt`.
1870 /// This happens once per rustc session and `TyCtxt`s only exists
1871 /// inside the `f` function.
1872 pub fn enter_global<'tcx, F, R>(gcx: &'tcx GlobalCtxt<'tcx>, f: F) -> R
1874 F: FnOnce(TyCtxt<'tcx>) -> R,
1876 // Update `GCX_PTR` to indicate there's a `GlobalCtxt` available.
1877 GCX_PTR.with(|lock| {
1878 *lock.lock() = gcx as *const _ as usize;
1880 // Set `GCX_PTR` back to 0 when we exit.
1881 let _on_drop = OnDrop(move || {
1882 GCX_PTR.with(|lock| *lock.lock() = 0);
1888 let icx = ImplicitCtxt {
1895 enter_context(&icx, |_| {
1900 scoped_thread_local! {
1901 /// Stores a pointer to the `GlobalCtxt` if one is available.
1902 /// This is used to access the `GlobalCtxt` in the deadlock handler given to Rayon.
1903 pub static GCX_PTR: Lock<usize>
1906 /// Creates a `TyCtxt` and `ImplicitCtxt` based on the `GCX_PTR` thread local.
1907 /// This is used in the deadlock handler.
1908 pub unsafe fn with_global<F, R>(f: F) -> R
1910 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
1912 let gcx = GCX_PTR.with(|lock| *lock.lock());
1914 let gcx = &*(gcx as *const GlobalCtxt<'_>);
1918 let icx = ImplicitCtxt {
1925 enter_context(&icx, |_| f(tcx))
1928 /// Allows access to the current `ImplicitCtxt` in a closure if one is available.
1930 pub fn with_context_opt<F, R>(f: F) -> R
1932 F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R,
1934 let context = get_tlv();
1938 // We could get a `ImplicitCtxt` pointer from another thread.
1939 // Ensure that `ImplicitCtxt` is `Sync`.
1940 sync::assert_sync::<ImplicitCtxt<'_, '_>>();
1942 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_>))) }
1946 /// Allows access to the current `ImplicitCtxt`.
1947 /// Panics if there is no `ImplicitCtxt` available.
1949 pub fn with_context<F, R>(f: F) -> R
1951 F: for<'a, 'tcx> FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1953 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
1956 /// Allows access to the current `ImplicitCtxt` whose tcx field has the same global
1957 /// interner as the tcx argument passed in. This means the closure is given an `ImplicitCtxt`
1958 /// with the same `'tcx` lifetime as the `TyCtxt` passed in.
1959 /// This will panic if you pass it a `TyCtxt` which has a different global interner from
1960 /// the current `ImplicitCtxt`'s `tcx` field.
1962 pub fn with_related_context<'tcx, F, R>(tcx: TyCtxt<'tcx>, f: F) -> R
1964 F: FnOnce(&ImplicitCtxt<'_, 'tcx>) -> R,
1966 with_context(|context| {
1968 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
1969 let context: &ImplicitCtxt<'_, '_> = mem::transmute(context);
1975 /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
1976 /// Panics if there is no `ImplicitCtxt` available.
1978 pub fn with<F, R>(f: F) -> R
1980 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
1982 with_context(|context| f(context.tcx))
1985 /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
1986 /// The closure is passed None if there is no `ImplicitCtxt` available.
1988 pub fn with_opt<F, R>(f: F) -> R
1990 F: for<'tcx> FnOnce(Option<TyCtxt<'tcx>>) -> R,
1992 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
1996 macro_rules! sty_debug_print {
1997 ($ctxt: expr, $($variant: ident),*) => {{
1998 // Curious inner module to allow variant names to be used as
2000 #[allow(non_snake_case)]
2002 use crate::ty::{self, TyCtxt};
2003 use crate::ty::context::Interned;
2005 #[derive(Copy, Clone)]
2014 pub fn go(tcx: TyCtxt<'_>) {
2015 let mut total = DebugStat {
2022 $(let mut $variant = total;)*
2024 let shards = tcx.interners.type_.lock_shards();
2025 let types = shards.iter().flat_map(|shard| shard.keys());
2026 for &Interned(t) in types {
2027 let variant = match t.kind {
2028 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2029 ty::Float(..) | ty::Str | ty::Never => continue,
2030 ty::Error => /* unimportant */ continue,
2031 $(ty::$variant(..) => &mut $variant,)*
2033 let lt = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2034 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2035 let ct = t.flags.intersects(ty::TypeFlags::HAS_CT_INFER);
2039 if lt { total.lt_infer += 1; variant.lt_infer += 1 }
2040 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2041 if ct { total.ct_infer += 1; variant.ct_infer += 1 }
2042 if lt && ty && ct { total.all_infer += 1; variant.all_infer += 1 }
2044 println!("Ty interner total ty lt ct all");
2045 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2046 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2047 stringify!($variant),
2048 uses = $variant.total,
2049 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2050 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2051 lt = $variant.lt_infer as f64 * 100.0 / total.total as f64,
2052 ct = $variant.ct_infer as f64 * 100.0 / total.total as f64,
2053 all = $variant.all_infer as f64 * 100.0 / total.total as f64);
2055 println!(" total {uses:6} \
2056 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2058 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2059 lt = total.lt_infer as f64 * 100.0 / total.total as f64,
2060 ct = total.ct_infer as f64 * 100.0 / total.total as f64,
2061 all = total.all_infer as f64 * 100.0 / total.total as f64)
2069 impl<'tcx> TyCtxt<'tcx> {
2070 pub fn print_debug_stats(self) {
2073 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2074 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2075 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2077 println!("InternalSubsts interner: #{}", self.interners.substs.len());
2078 println!("Region interner: #{}", self.interners.region.len());
2079 println!("Stability interner: #{}", self.stability_interner.len());
2080 println!("Allocation interner: #{}", self.allocation_interner.len());
2081 println!("Layout interner: #{}", self.layout_interner.len());
2086 /// An entry in an interner.
2087 struct Interned<'tcx, T: ?Sized>(&'tcx T);
2089 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2090 fn clone(&self) -> Self {
2094 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2096 // N.B., an `Interned<Ty>` compares and hashes as a `TyKind`.
2097 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2098 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2099 self.0.kind == other.0.kind
2103 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2105 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2106 fn hash<H: Hasher>(&self, s: &mut H) {
2111 #[allow(rustc::usage_of_ty_tykind)]
2112 impl<'tcx> Borrow<TyKind<'tcx>> for Interned<'tcx, TyS<'tcx>> {
2113 fn borrow<'a>(&'a self) -> &'a TyKind<'tcx> {
2118 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2119 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2120 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2121 self.0[..] == other.0[..]
2125 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2127 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2128 fn hash<H: Hasher>(&self, s: &mut H) {
2133 impl<'tcx> Borrow<[Ty<'tcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2134 fn borrow<'a>(&'a self) -> &'a [Ty<'tcx>] {
2139 impl<'tcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2140 fn borrow(&self) -> &[CanonicalVarInfo] {
2145 impl<'tcx> Borrow<[GenericArg<'tcx>]> for Interned<'tcx, InternalSubsts<'tcx>> {
2146 fn borrow<'a>(&'a self) -> &'a [GenericArg<'tcx>] {
2151 impl<'tcx> Borrow<[ProjectionKind]>
2152 for Interned<'tcx, List<ProjectionKind>> {
2153 fn borrow(&self) -> &[ProjectionKind] {
2158 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2159 fn borrow(&self) -> &RegionKind {
2164 impl<'tcx> Borrow<GoalKind<'tcx>> for Interned<'tcx, GoalKind<'tcx>> {
2165 fn borrow<'a>(&'a self) -> &'a GoalKind<'tcx> {
2170 impl<'tcx> Borrow<[ExistentialPredicate<'tcx>]>
2171 for Interned<'tcx, List<ExistentialPredicate<'tcx>>>
2173 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'tcx>] {
2178 impl<'tcx> Borrow<[Predicate<'tcx>]> for Interned<'tcx, List<Predicate<'tcx>>> {
2179 fn borrow<'a>(&'a self) -> &'a [Predicate<'tcx>] {
2184 impl<'tcx> Borrow<Const<'tcx>> for Interned<'tcx, Const<'tcx>> {
2185 fn borrow<'a>(&'a self) -> &'a Const<'tcx> {
2190 impl<'tcx> Borrow<[Clause<'tcx>]> for Interned<'tcx, List<Clause<'tcx>>> {
2191 fn borrow<'a>(&'a self) -> &'a [Clause<'tcx>] {
2196 impl<'tcx> Borrow<[Goal<'tcx>]> for Interned<'tcx, List<Goal<'tcx>>> {
2197 fn borrow<'a>(&'a self) -> &'a [Goal<'tcx>] {
2202 macro_rules! direct_interners {
2203 ($($name:ident: $method:ident($ty:ty)),+) => {
2204 $(impl<'tcx> PartialEq for Interned<'tcx, $ty> {
2205 fn eq(&self, other: &Self) -> bool {
2210 impl<'tcx> Eq for Interned<'tcx, $ty> {}
2212 impl<'tcx> Hash for Interned<'tcx, $ty> {
2213 fn hash<H: Hasher>(&self, s: &mut H) {
2218 impl<'tcx> TyCtxt<'tcx> {
2219 pub fn $method(self, v: $ty) -> &'tcx $ty {
2220 self.interners.$name.intern_ref(&v, || {
2221 Interned(self.interners.arena.alloc(v))
2228 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2229 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2233 region: mk_region(RegionKind),
2234 goal: mk_goal(GoalKind<'tcx>),
2235 const_: mk_const(Const<'tcx>)
2238 macro_rules! slice_interners {
2239 ($($field:ident: $method:ident($ty:ty)),+) => (
2240 $(impl<'tcx> TyCtxt<'tcx> {
2241 pub fn $method(self, v: &[$ty]) -> &'tcx List<$ty> {
2242 self.interners.$field.intern_ref(v, || {
2243 Interned(List::from_arena(&self.interners.arena, v))
2251 type_list: _intern_type_list(Ty<'tcx>),
2252 substs: _intern_substs(GenericArg<'tcx>),
2253 canonical_var_infos: _intern_canonical_var_infos(CanonicalVarInfo),
2254 existential_predicates: _intern_existential_predicates(ExistentialPredicate<'tcx>),
2255 predicates: _intern_predicates(Predicate<'tcx>),
2256 clauses: _intern_clauses(Clause<'tcx>),
2257 goal_list: _intern_goals(Goal<'tcx>),
2258 projs: _intern_projs(ProjectionKind)
2261 impl<'tcx> TyCtxt<'tcx> {
2262 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2263 /// that is, a `fn` type that is equivalent in every way for being
2265 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2266 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2267 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2268 unsafety: hir::Unsafety::Unsafe,
2273 /// Given a closure signature `sig`, returns an equivalent `fn`
2274 /// type with the same signature. Detuples and so forth -- so
2275 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2276 /// a `fn(u32, i32)`.
2277 /// `unsafety` determines the unsafety of the `fn` type. If you pass
2278 /// `hir::Unsafety::Unsafe` in the previous example, then you would get
2279 /// an `unsafe fn (u32, i32)`.
2280 /// It cannot convert a closure that requires unsafe.
2281 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>, unsafety: hir::Unsafety) -> Ty<'tcx> {
2282 let converted_sig = sig.map_bound(|s| {
2283 let params_iter = match s.inputs()[0].kind {
2284 ty::Tuple(params) => {
2285 params.into_iter().map(|k| k.expect_ty())
2298 self.mk_fn_ptr(converted_sig)
2301 #[allow(rustc::usage_of_ty_tykind)]
2303 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2304 self.interners.intern_ty(st)
2307 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2309 ast::IntTy::Isize => self.types.isize,
2310 ast::IntTy::I8 => self.types.i8,
2311 ast::IntTy::I16 => self.types.i16,
2312 ast::IntTy::I32 => self.types.i32,
2313 ast::IntTy::I64 => self.types.i64,
2314 ast::IntTy::I128 => self.types.i128,
2318 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2320 ast::UintTy::Usize => self.types.usize,
2321 ast::UintTy::U8 => self.types.u8,
2322 ast::UintTy::U16 => self.types.u16,
2323 ast::UintTy::U32 => self.types.u32,
2324 ast::UintTy::U64 => self.types.u64,
2325 ast::UintTy::U128 => self.types.u128,
2329 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2331 ast::FloatTy::F32 => self.types.f32,
2332 ast::FloatTy::F64 => self.types.f64,
2337 pub fn mk_str(self) -> Ty<'tcx> {
2342 pub fn mk_static_str(self) -> Ty<'tcx> {
2343 self.mk_imm_ref(self.lifetimes.re_static, self.mk_str())
2347 pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2348 // Take a copy of substs so that we own the vectors inside.
2349 self.mk_ty(Adt(def, substs))
2353 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2354 self.mk_ty(Foreign(def_id))
2357 fn mk_generic_adt(self, wrapper_def_id: DefId, ty_param: Ty<'tcx>) -> Ty<'tcx> {
2358 let adt_def = self.adt_def(wrapper_def_id);
2359 let substs = InternalSubsts::for_item(self, wrapper_def_id, |param, substs| {
2361 GenericParamDefKind::Lifetime |
2362 GenericParamDefKind::Const => {
2365 GenericParamDefKind::Type { has_default, .. } => {
2366 if param.index == 0 {
2369 assert!(has_default);
2370 self.type_of(param.def_id).subst(self, substs).into()
2375 self.mk_ty(Adt(adt_def, substs))
2379 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2380 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem, None);
2381 self.mk_generic_adt(def_id, ty)
2385 pub fn mk_lang_item(self, ty: Ty<'tcx>, item: lang_items::LangItem) -> Option<Ty<'tcx>> {
2386 let def_id = self.lang_items().require(item).ok()?;
2387 Some(self.mk_generic_adt(def_id, ty))
2391 pub fn mk_maybe_uninit(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2392 let def_id = self.require_lang_item(lang_items::MaybeUninitLangItem, None);
2393 self.mk_generic_adt(def_id, ty)
2397 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2398 self.mk_ty(RawPtr(tm))
2402 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2403 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2407 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2408 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2412 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2413 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2417 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2418 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2422 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2423 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2427 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2428 self.mk_imm_ptr(self.mk_unit())
2432 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2433 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2437 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2438 self.mk_ty(Slice(ty))
2442 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2443 let kinds: Vec<_> = ts.into_iter().map(|&t| GenericArg::from(t)).collect();
2444 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2447 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2448 iter.intern_with(|ts| {
2449 let kinds: Vec<_> = ts.into_iter().map(|&t| GenericArg::from(t)).collect();
2450 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2455 pub fn mk_unit(self) -> Ty<'tcx> {
2460 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2461 if self.features().never_type {
2464 self.intern_tup(&[])
2469 pub fn mk_bool(self) -> Ty<'tcx> {
2474 pub fn mk_fn_def(self, def_id: DefId,
2475 substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2476 self.mk_ty(FnDef(def_id, substs))
2480 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2481 self.mk_ty(FnPtr(fty))
2487 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2488 reg: ty::Region<'tcx>
2490 self.mk_ty(Dynamic(obj, reg))
2494 pub fn mk_projection(self,
2496 substs: SubstsRef<'tcx>)
2498 self.mk_ty(Projection(ProjectionTy {
2505 pub fn mk_closure(self, closure_id: DefId, closure_substs: SubstsRef<'tcx>)
2507 self.mk_ty(Closure(closure_id, closure_substs))
2511 pub fn mk_generator(self,
2513 generator_substs: GeneratorSubsts<'tcx>,
2514 movability: hir::GeneratorMovability)
2516 self.mk_ty(Generator(id, generator_substs, movability))
2520 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2521 self.mk_ty(GeneratorWitness(types))
2525 pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> {
2526 self.mk_ty_infer(TyVar(v))
2530 pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2531 self.mk_const(ty::Const {
2532 val: ConstValue::Infer(InferConst::Var(v)),
2538 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2539 self.mk_ty_infer(IntVar(v))
2543 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2544 self.mk_ty_infer(FloatVar(v))
2548 pub fn mk_ty_infer(self, it: InferTy) -> Ty<'tcx> {
2549 self.mk_ty(Infer(it))
2553 pub fn mk_const_infer(
2555 ic: InferConst<'tcx>,
2557 ) -> &'tcx ty::Const<'tcx> {
2558 self.mk_const(ty::Const {
2559 val: ConstValue::Infer(ic),
2565 pub fn mk_ty_param(self, index: u32, name: InternedString) -> Ty<'tcx> {
2566 self.mk_ty(Param(ParamTy { index, name: name }))
2570 pub fn mk_const_param(
2573 name: InternedString,
2575 ) -> &'tcx Const<'tcx> {
2576 self.mk_const(ty::Const {
2577 val: ConstValue::Param(ParamConst { index, name }),
2583 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> {
2585 GenericParamDefKind::Lifetime => {
2586 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2588 GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
2589 GenericParamDefKind::Const => {
2590 self.mk_const_param(param.index, param.name, self.type_of(param.def_id)).into()
2596 pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2597 self.mk_ty(Opaque(def_id, substs))
2600 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2601 -> &'tcx List<ExistentialPredicate<'tcx>> {
2602 assert!(!eps.is_empty());
2603 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2604 self._intern_existential_predicates(eps)
2607 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2608 -> &'tcx List<Predicate<'tcx>> {
2609 // FIXME consider asking the input slice to be sorted to avoid
2610 // re-interning permutations, in which case that would be asserted
2612 if preds.len() == 0 {
2613 // The macro-generated method below asserts we don't intern an empty slice.
2616 self._intern_predicates(preds)
2620 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2624 self._intern_type_list(ts)
2628 pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List<GenericArg<'tcx>> {
2632 self._intern_substs(ts)
2636 pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
2640 self._intern_projs(ps)
2644 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'tcx> {
2648 self._intern_canonical_var_infos(ts)
2652 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2656 self._intern_clauses(ts)
2660 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2664 self._intern_goals(ts)
2668 pub fn mk_fn_sig<I>(self,
2672 unsafety: hir::Unsafety,
2674 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2676 I: Iterator<Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>,
2678 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2679 inputs_and_output: self.intern_type_list(xs),
2680 c_variadic, unsafety, abi
2684 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2685 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2687 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2690 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2691 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2693 iter.intern_with(|xs| self.intern_predicates(xs))
2696 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2697 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2698 iter.intern_with(|xs| self.intern_type_list(xs))
2701 pub fn mk_substs<I: InternAs<[GenericArg<'tcx>],
2702 &'tcx List<GenericArg<'tcx>>>>(self, iter: I) -> I::Output {
2703 iter.intern_with(|xs| self.intern_substs(xs))
2706 pub fn mk_substs_trait(self,
2708 rest: &[GenericArg<'tcx>])
2711 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2714 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2715 iter.intern_with(|xs| self.intern_clauses(xs))
2718 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2719 iter.intern_with(|xs| self.intern_goals(xs))
2722 pub fn lint_hir<S: Into<MultiSpan>>(self,
2723 lint: &'static Lint,
2727 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2730 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2731 lint: &'static Lint,
2736 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2741 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2742 lint: &'static Lint,
2747 let mut err = self.struct_span_lint_hir(lint, id, span.into(), msg);
2752 /// Walks upwards from `id` to find a node which might change lint levels with attributes.
2753 /// It stops at `bound` and just returns it if reached.
2754 pub fn maybe_lint_level_root_bounded(
2763 if lint::maybe_lint_level_root(self, id) {
2766 let next = self.hir().get_parent_node(id);
2768 bug!("lint traversal reached the root of the crate");
2774 pub fn lint_level_at_node(
2776 lint: &'static Lint,
2778 ) -> (lint::Level, lint::LintSource) {
2779 let sets = self.lint_levels(LOCAL_CRATE);
2781 if let Some(pair) = sets.level_and_source(lint, id, self.sess) {
2784 let next = self.hir().get_parent_node(id);
2786 bug!("lint traversal reached the root of the crate");
2792 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2793 lint: &'static Lint,
2797 -> DiagnosticBuilder<'tcx>
2799 let (level, src) = self.lint_level_at_node(lint, hir_id);
2800 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2803 pub fn struct_lint_node(self, lint: &'static Lint, id: HirId, msg: &str)
2804 -> DiagnosticBuilder<'tcx>
2806 let (level, src) = self.lint_level_at_node(lint, id);
2807 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2810 pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx StableVec<TraitCandidate>> {
2811 self.in_scope_traits_map(id.owner)
2812 .and_then(|map| map.get(&id.local_id))
2815 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2816 self.named_region_map(id.owner)
2817 .and_then(|map| map.get(&id.local_id).cloned())
2820 pub fn is_late_bound(self, id: HirId) -> bool {
2821 self.is_late_bound_map(id.owner)
2822 .map(|set| set.contains(&id.local_id))
2826 pub fn object_lifetime_defaults(self, id: HirId) -> Option<&'tcx [ObjectLifetimeDefault]> {
2827 self.object_lifetime_defaults_map(id.owner)
2828 .and_then(|map| map.get(&id.local_id).map(|v| &**v))
2832 pub trait InternAs<T: ?Sized, R> {
2834 fn intern_with<F>(self, f: F) -> Self::Output
2835 where F: FnOnce(&T) -> R;
2838 impl<I, T, R, E> InternAs<[T], R> for I
2839 where E: InternIteratorElement<T, R>,
2840 I: Iterator<Item=E> {
2841 type Output = E::Output;
2842 fn intern_with<F>(self, f: F) -> Self::Output
2843 where F: FnOnce(&[T]) -> R {
2844 E::intern_with(self, f)
2848 pub trait InternIteratorElement<T, R>: Sized {
2850 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2853 impl<T, R> InternIteratorElement<T, R> for T {
2855 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2856 f(&iter.collect::<SmallVec<[_; 8]>>())
2860 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2864 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2865 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2869 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2870 type Output = Result<R, E>;
2871 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2872 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
2876 // We are comparing types with different invariant lifetimes, so `ptr::eq`
2877 // won't work for us.
2878 fn ptr_eq<T, U>(t: *const T, u: *const U) -> bool {
2879 t as *const () == u as *const ()
2882 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2883 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id);
2884 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).map(|v| &v[..]);
2885 providers.crate_name = |tcx, id| {
2886 assert_eq!(id, LOCAL_CRATE);
2889 providers.get_lib_features = |tcx, id| {
2890 assert_eq!(id, LOCAL_CRATE);
2891 tcx.arena.alloc(middle::lib_features::collect(tcx))
2893 providers.get_lang_items = |tcx, id| {
2894 assert_eq!(id, LOCAL_CRATE);
2895 tcx.arena.alloc(middle::lang_items::collect(tcx))
2897 providers.diagnostic_items = |tcx, id| {
2898 assert_eq!(id, LOCAL_CRATE);
2899 middle::diagnostic_items::collect(tcx)
2901 providers.all_diagnostic_items = |tcx, id| {
2902 assert_eq!(id, LOCAL_CRATE);
2903 middle::diagnostic_items::collect_all(tcx)
2905 providers.maybe_unused_trait_import = |tcx, id| {
2906 tcx.maybe_unused_trait_imports.contains(&id)
2908 providers.maybe_unused_extern_crates = |tcx, cnum| {
2909 assert_eq!(cnum, LOCAL_CRATE);
2910 &tcx.maybe_unused_extern_crates[..]
2912 providers.names_imported_by_glob_use = |tcx, id| {
2913 assert_eq!(id.krate, LOCAL_CRATE);
2914 Lrc::new(tcx.glob_map.get(&id).cloned().unwrap_or_default())
2917 providers.stability_index = |tcx, cnum| {
2918 assert_eq!(cnum, LOCAL_CRATE);
2919 tcx.arena.alloc(stability::Index::new(tcx))
2921 providers.lookup_stability = |tcx, id| {
2922 assert_eq!(id.krate, LOCAL_CRATE);
2923 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
2924 tcx.stability().local_stability(id)
2926 providers.lookup_deprecation_entry = |tcx, id| {
2927 assert_eq!(id.krate, LOCAL_CRATE);
2928 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
2929 tcx.stability().local_deprecation_entry(id)
2931 providers.extern_mod_stmt_cnum = |tcx, id| {
2932 let id = tcx.hir().as_local_node_id(id).unwrap();
2933 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
2935 providers.all_crate_nums = |tcx, cnum| {
2936 assert_eq!(cnum, LOCAL_CRATE);
2937 tcx.arena.alloc_slice(&tcx.cstore.crates_untracked())
2939 providers.postorder_cnums = |tcx, cnum| {
2940 assert_eq!(cnum, LOCAL_CRATE);
2941 tcx.arena.alloc_slice(&tcx.cstore.postorder_cnums_untracked())
2943 providers.output_filenames = |tcx, cnum| {
2944 assert_eq!(cnum, LOCAL_CRATE);
2945 tcx.output_filenames.clone()
2947 providers.features_query = |tcx, cnum| {
2948 assert_eq!(cnum, LOCAL_CRATE);
2949 tcx.arena.alloc(tcx.sess.features_untracked().clone())
2951 providers.is_panic_runtime = |tcx, cnum| {
2952 assert_eq!(cnum, LOCAL_CRATE);
2953 attr::contains_name(tcx.hir().krate_attrs(), sym::panic_runtime)
2955 providers.is_compiler_builtins = |tcx, cnum| {
2956 assert_eq!(cnum, LOCAL_CRATE);
2957 attr::contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins)