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, ClosureSubsts, 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};
49 use errors::DiagnosticBuilder;
50 use arena::SyncDroplessArena;
51 use smallvec::SmallVec;
52 use rustc_data_structures::stable_hasher::{
53 HashStable, StableHasher, StableHasherResult, StableVec, hash_stable_hashmap,
55 use rustc_data_structures::indexed_vec::{Idx, IndexVec};
56 use rustc_data_structures::sharded::ShardedHashMap;
57 use rustc_data_structures::sync::{Lrc, Lock, WorkerLocal};
59 use std::borrow::Borrow;
60 use std::cmp::Ordering;
61 use std::collections::hash_map::{self, Entry};
62 use std::hash::{Hash, Hasher};
65 use std::ops::{Deref, Bound};
69 use 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 #[derive(RustcEncodable, RustcDecodable, Debug)]
293 pub struct TypeckTables<'tcx> {
294 /// The HirId::owner all ItemLocalIds in this table are relative to.
295 pub local_id_root: Option<DefId>,
297 /// Resolved definitions for `<T>::X` associated paths and
298 /// method calls, including those of overloaded operators.
299 type_dependent_defs: ItemLocalMap<Result<(DefKind, DefId), ErrorReported>>,
301 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
302 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
303 /// about the field you also need definition of the variant to which the field
304 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
305 field_indices: ItemLocalMap<usize>,
307 /// Stores the types for various nodes in the AST. Note that this table
308 /// is not guaranteed to be populated until after typeck. See
309 /// typeck::check::fn_ctxt for details.
310 node_types: ItemLocalMap<Ty<'tcx>>,
312 /// Stores the type parameters which were substituted to obtain the type
313 /// of this node. This only applies to nodes that refer to entities
314 /// parameterized by type parameters, such as generic fns, types, or
316 node_substs: ItemLocalMap<SubstsRef<'tcx>>,
318 /// This will either store the canonicalized types provided by the user
319 /// or the substitutions that the user explicitly gave (if any) attached
320 /// to `id`. These will not include any inferred values. The canonical form
321 /// is used to capture things like `_` or other unspecified values.
323 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
324 /// canonical substitutions would include only `for<X> { Vec<X> }`.
326 /// See also `AscribeUserType` statement in MIR.
327 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
329 /// Stores the canonicalized types provided by the user. See also
330 /// `AscribeUserType` statement in MIR.
331 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
333 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
335 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
336 pat_binding_modes: ItemLocalMap<BindingMode>,
338 /// Stores the types which were implicitly dereferenced in pattern binding modes
339 /// for later usage in HAIR lowering. For example,
342 /// match &&Some(5i32) {
347 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
350 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
351 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
354 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
356 /// Records the reasons that we picked the kind of each closure;
357 /// not all closures are present in the map.
358 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
360 /// For each fn, records the "liberated" types of its arguments
361 /// and return type. Liberated means that all bound regions
362 /// (including late-bound regions) are replaced with free
363 /// equivalents. This table is not used in codegen (since regions
364 /// are erased there) and hence is not serialized to metadata.
365 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
367 /// For each FRU expression, record the normalized types of the fields
368 /// of the struct - this is needed because it is non-trivial to
369 /// normalize while preserving regions. This table is used only in
370 /// MIR construction and hence is not serialized to metadata.
371 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
373 /// For every coercion cast we add the HIR node ID of the cast
374 /// expression to this set.
375 coercion_casts: ItemLocalSet,
377 /// Set of trait imports actually used in the method resolution.
378 /// This is used for warning unused imports. During type
379 /// checking, this `Lrc` should not be cloned: it must have a ref-count
380 /// of 1 so that we can insert things into the set mutably.
381 pub used_trait_imports: Lrc<DefIdSet>,
383 /// If any errors occurred while type-checking this body,
384 /// this field will be set to `true`.
385 pub tainted_by_errors: bool,
387 /// Stores the free-region relationships that were deduced from
388 /// its where-clauses and parameter types. These are then
389 /// read-again by borrowck.
390 pub free_region_map: FreeRegionMap<'tcx>,
392 /// All the opaque types that are restricted to concrete types
393 /// by this function.
394 pub concrete_opaque_types: FxHashMap<DefId, ResolvedOpaqueTy<'tcx>>,
396 /// Given the closure ID this map provides the list of UpvarIDs used by it.
397 /// The upvarID contains the HIR node ID and it also contains the full path
398 /// leading to the member of the struct or tuple that is used instead of the
400 pub upvar_list: ty::UpvarListMap,
403 impl<'tcx> TypeckTables<'tcx> {
404 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
407 type_dependent_defs: Default::default(),
408 field_indices: Default::default(),
409 user_provided_types: Default::default(),
410 user_provided_sigs: Default::default(),
411 node_types: Default::default(),
412 node_substs: Default::default(),
413 adjustments: Default::default(),
414 pat_binding_modes: Default::default(),
415 pat_adjustments: Default::default(),
416 upvar_capture_map: Default::default(),
417 closure_kind_origins: Default::default(),
418 liberated_fn_sigs: Default::default(),
419 fru_field_types: Default::default(),
420 coercion_casts: Default::default(),
421 used_trait_imports: Lrc::new(Default::default()),
422 tainted_by_errors: false,
423 free_region_map: Default::default(),
424 concrete_opaque_types: Default::default(),
425 upvar_list: Default::default(),
429 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
430 pub fn qpath_res(&self, qpath: &hir::QPath, id: hir::HirId) -> Res {
432 hir::QPath::Resolved(_, ref path) => path.res,
433 hir::QPath::TypeRelative(..) => self.type_dependent_def(id)
434 .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)),
438 pub fn type_dependent_defs(
440 ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> {
441 LocalTableInContext {
442 local_id_root: self.local_id_root,
443 data: &self.type_dependent_defs
447 pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> {
448 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
449 self.type_dependent_defs.get(&id.local_id).cloned().and_then(|r| r.ok())
452 pub fn type_dependent_def_id(&self, id: HirId) -> Option<DefId> {
453 self.type_dependent_def(id).map(|(_, def_id)| def_id)
456 pub fn type_dependent_defs_mut(
458 ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> {
459 LocalTableInContextMut {
460 local_id_root: self.local_id_root,
461 data: &mut self.type_dependent_defs
465 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
466 LocalTableInContext {
467 local_id_root: self.local_id_root,
468 data: &self.field_indices
472 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
473 LocalTableInContextMut {
474 local_id_root: self.local_id_root,
475 data: &mut self.field_indices
479 pub fn user_provided_types(
481 ) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
482 LocalTableInContext {
483 local_id_root: self.local_id_root,
484 data: &self.user_provided_types
488 pub fn user_provided_types_mut(
490 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
491 LocalTableInContextMut {
492 local_id_root: self.local_id_root,
493 data: &mut self.user_provided_types
497 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
498 LocalTableInContext {
499 local_id_root: self.local_id_root,
500 data: &self.node_types
504 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
505 LocalTableInContextMut {
506 local_id_root: self.local_id_root,
507 data: &mut self.node_types
511 pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
512 self.node_type_opt(id).unwrap_or_else(||
513 bug!("node_type: no type for node `{}`",
514 tls::with(|tcx| tcx.hir().node_to_string(id)))
518 pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
519 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
520 self.node_types.get(&id.local_id).cloned()
523 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> {
524 LocalTableInContextMut {
525 local_id_root: self.local_id_root,
526 data: &mut self.node_substs
530 pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> {
531 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
532 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| InternalSubsts::empty())
535 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<SubstsRef<'tcx>> {
536 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
537 self.node_substs.get(&id.local_id).cloned()
540 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
541 // doesn't provide type parameter substitutions.
542 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
543 self.node_type(pat.hir_id)
546 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
547 self.node_type_opt(pat.hir_id)
550 // Returns the type of an expression as a monotype.
552 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
553 // some cases, we insert `Adjustment` annotations such as auto-deref or
554 // auto-ref. The type returned by this function does not consider such
555 // adjustments. See `expr_ty_adjusted()` instead.
557 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
558 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
559 // instead of "fn(ty) -> T with T = isize".
560 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
561 self.node_type(expr.hir_id)
564 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
565 self.node_type_opt(expr.hir_id)
568 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
569 LocalTableInContext {
570 local_id_root: self.local_id_root,
571 data: &self.adjustments
575 pub fn adjustments_mut(&mut self)
576 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
577 LocalTableInContextMut {
578 local_id_root: self.local_id_root,
579 data: &mut self.adjustments
583 pub fn expr_adjustments(&self, expr: &hir::Expr)
584 -> &[ty::adjustment::Adjustment<'tcx>] {
585 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
586 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
589 /// Returns the type of `expr`, considering any `Adjustment`
590 /// entry recorded for that expression.
591 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
592 self.expr_adjustments(expr)
594 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
597 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
598 self.expr_adjustments(expr)
600 .map(|adj| adj.target)
601 .or_else(|| self.expr_ty_opt(expr))
604 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
605 // Only paths and method calls/overloaded operators have
606 // entries in type_dependent_defs, ignore the former here.
607 if let hir::ExprKind::Path(_) = expr.kind {
611 match self.type_dependent_defs().get(expr.hir_id) {
612 Some(Ok((DefKind::Method, _))) => true,
617 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
618 LocalTableInContext {
619 local_id_root: self.local_id_root,
620 data: &self.pat_binding_modes
624 pub fn pat_binding_modes_mut(&mut self)
625 -> LocalTableInContextMut<'_, BindingMode> {
626 LocalTableInContextMut {
627 local_id_root: self.local_id_root,
628 data: &mut self.pat_binding_modes
632 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
633 LocalTableInContext {
634 local_id_root: self.local_id_root,
635 data: &self.pat_adjustments,
639 pub fn pat_adjustments_mut(&mut self)
640 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
641 LocalTableInContextMut {
642 local_id_root: self.local_id_root,
643 data: &mut self.pat_adjustments,
647 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
648 self.upvar_capture_map[&upvar_id]
651 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
652 LocalTableInContext {
653 local_id_root: self.local_id_root,
654 data: &self.closure_kind_origins
658 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
659 LocalTableInContextMut {
660 local_id_root: self.local_id_root,
661 data: &mut self.closure_kind_origins
665 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
666 LocalTableInContext {
667 local_id_root: self.local_id_root,
668 data: &self.liberated_fn_sigs
672 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
673 LocalTableInContextMut {
674 local_id_root: self.local_id_root,
675 data: &mut self.liberated_fn_sigs
679 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
680 LocalTableInContext {
681 local_id_root: self.local_id_root,
682 data: &self.fru_field_types
686 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
687 LocalTableInContextMut {
688 local_id_root: self.local_id_root,
689 data: &mut self.fru_field_types
693 pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool {
694 validate_hir_id_for_typeck_tables(self.local_id_root, hir_id, true);
695 self.coercion_casts.contains(&hir_id.local_id)
698 pub fn set_coercion_cast(&mut self, id: ItemLocalId) {
699 self.coercion_casts.insert(id);
702 pub fn coercion_casts(&self) -> &ItemLocalSet {
708 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for TypeckTables<'tcx> {
709 fn hash_stable<W: StableHasherResult>(&self,
710 hcx: &mut StableHashingContext<'a>,
711 hasher: &mut StableHasher<W>) {
712 let ty::TypeckTables {
714 ref type_dependent_defs,
716 ref user_provided_types,
717 ref user_provided_sigs,
721 ref pat_binding_modes,
723 ref upvar_capture_map,
724 ref closure_kind_origins,
725 ref liberated_fn_sigs,
730 ref used_trait_imports,
733 ref concrete_opaque_types,
738 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
739 type_dependent_defs.hash_stable(hcx, hasher);
740 field_indices.hash_stable(hcx, hasher);
741 user_provided_types.hash_stable(hcx, hasher);
742 user_provided_sigs.hash_stable(hcx, hasher);
743 node_types.hash_stable(hcx, hasher);
744 node_substs.hash_stable(hcx, hasher);
745 adjustments.hash_stable(hcx, hasher);
746 pat_binding_modes.hash_stable(hcx, hasher);
747 pat_adjustments.hash_stable(hcx, hasher);
748 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
755 local_id_root.expect("trying to hash invalid TypeckTables");
757 let var_owner_def_id = DefId {
758 krate: local_id_root.krate,
759 index: var_path.hir_id.owner,
761 let closure_def_id = DefId {
762 krate: local_id_root.krate,
763 index: closure_expr_id.to_def_id().index,
765 (hcx.def_path_hash(var_owner_def_id),
766 var_path.hir_id.local_id,
767 hcx.def_path_hash(closure_def_id))
770 closure_kind_origins.hash_stable(hcx, hasher);
771 liberated_fn_sigs.hash_stable(hcx, hasher);
772 fru_field_types.hash_stable(hcx, hasher);
773 coercion_casts.hash_stable(hcx, hasher);
774 used_trait_imports.hash_stable(hcx, hasher);
775 tainted_by_errors.hash_stable(hcx, hasher);
776 free_region_map.hash_stable(hcx, hasher);
777 concrete_opaque_types.hash_stable(hcx, hasher);
778 upvar_list.hash_stable(hcx, hasher);
784 pub struct UserTypeAnnotationIndex {
786 DEBUG_FORMAT = "UserType({})",
787 const START_INDEX = 0,
791 /// Mapping of type annotation indices to canonical user type annotations.
792 pub type CanonicalUserTypeAnnotations<'tcx> =
793 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
795 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
796 pub struct CanonicalUserTypeAnnotation<'tcx> {
797 pub user_ty: CanonicalUserType<'tcx>,
799 pub inferred_ty: Ty<'tcx>,
802 BraceStructTypeFoldableImpl! {
803 impl<'tcx> TypeFoldable<'tcx> for CanonicalUserTypeAnnotation<'tcx> {
804 user_ty, span, inferred_ty
808 BraceStructLiftImpl! {
809 impl<'a, 'tcx> Lift<'tcx> for CanonicalUserTypeAnnotation<'a> {
810 type Lifted = CanonicalUserTypeAnnotation<'tcx>;
811 user_ty, span, inferred_ty
815 /// Canonicalized user type annotation.
816 pub type CanonicalUserType<'tcx> = Canonical<'tcx, UserType<'tcx>>;
818 impl CanonicalUserType<'tcx> {
819 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
820 /// i.e., each thing is mapped to a canonical variable with the same index.
821 pub fn is_identity(&self) -> bool {
823 UserType::Ty(_) => false,
824 UserType::TypeOf(_, user_substs) => {
825 if user_substs.user_self_ty.is_some() {
829 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
830 match kind.unpack() {
831 GenericArgKind::Type(ty) => match ty.kind {
832 ty::Bound(debruijn, b) => {
833 // We only allow a `ty::INNERMOST` index in substitutions.
834 assert_eq!(debruijn, ty::INNERMOST);
840 GenericArgKind::Lifetime(r) => match r {
841 ty::ReLateBound(debruijn, br) => {
842 // We only allow a `ty::INNERMOST` index in substitutions.
843 assert_eq!(*debruijn, ty::INNERMOST);
844 cvar == br.assert_bound_var()
849 GenericArgKind::Const(ct) => match ct.val {
850 ConstValue::Infer(InferConst::Canonical(debruijn, b)) => {
851 // We only allow a `ty::INNERMOST` index in substitutions.
852 assert_eq!(debruijn, ty::INNERMOST);
864 /// A user-given type annotation attached to a constant. These arise
865 /// from constants that are named via paths, like `Foo::<A>::new` and
867 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
868 pub enum UserType<'tcx> {
871 /// The canonical type is the result of `type_of(def_id)` with the
872 /// given substitutions applied.
873 TypeOf(DefId, UserSubsts<'tcx>),
876 EnumTypeFoldableImpl! {
877 impl<'tcx> TypeFoldable<'tcx> for UserType<'tcx> {
879 (UserType::TypeOf)(def, substs),
884 impl<'a, 'tcx> Lift<'tcx> for UserType<'a> {
885 type Lifted = UserType<'tcx>;
887 (UserType::TypeOf)(def, substs),
891 impl<'tcx> CommonTypes<'tcx> {
892 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
893 let mk = |ty| interners.intern_ty(ty);
896 unit: mk(Tuple(List::empty())),
901 isize: mk(Int(ast::IntTy::Isize)),
902 i8: mk(Int(ast::IntTy::I8)),
903 i16: mk(Int(ast::IntTy::I16)),
904 i32: mk(Int(ast::IntTy::I32)),
905 i64: mk(Int(ast::IntTy::I64)),
906 i128: mk(Int(ast::IntTy::I128)),
907 usize: mk(Uint(ast::UintTy::Usize)),
908 u8: mk(Uint(ast::UintTy::U8)),
909 u16: mk(Uint(ast::UintTy::U16)),
910 u32: mk(Uint(ast::UintTy::U32)),
911 u64: mk(Uint(ast::UintTy::U64)),
912 u128: mk(Uint(ast::UintTy::U128)),
913 f32: mk(Float(ast::FloatTy::F32)),
914 f64: mk(Float(ast::FloatTy::F64)),
915 self_param: mk(ty::Param(ty::ParamTy {
917 name: kw::SelfUpper.as_interned_str(),
920 trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
925 impl<'tcx> CommonLifetimes<'tcx> {
926 fn new(interners: &CtxtInterners<'tcx>) -> CommonLifetimes<'tcx> {
928 interners.region.intern(r, |r| {
929 Interned(interners.arena.alloc(r))
934 re_empty: mk(RegionKind::ReEmpty),
935 re_static: mk(RegionKind::ReStatic),
936 re_erased: mk(RegionKind::ReErased),
941 impl<'tcx> CommonConsts<'tcx> {
942 fn new(interners: &CtxtInterners<'tcx>, types: &CommonTypes<'tcx>) -> CommonConsts<'tcx> {
944 interners.const_.intern(c, |c| {
945 Interned(interners.arena.alloc(c))
950 err: mk_const(ty::Const {
951 val: ConstValue::Scalar(Scalar::zst()),
958 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
961 pub struct FreeRegionInfo {
962 // def id corresponding to FreeRegion
964 // the bound region corresponding to FreeRegion
965 pub boundregion: ty::BoundRegion,
966 // checks if bound region is in Impl Item
967 pub is_impl_item: bool,
970 /// The central data structure of the compiler. It stores references
971 /// to the various **arenas** and also houses the results of the
972 /// various **compiler queries** that have been performed. See the
973 /// [rustc guide] for more details.
975 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
976 #[derive(Copy, Clone)]
977 #[rustc_diagnostic_item = "TyCtxt"]
978 pub struct TyCtxt<'tcx> {
979 gcx: &'tcx GlobalCtxt<'tcx>,
982 impl<'tcx> Deref for TyCtxt<'tcx> {
983 type Target = &'tcx GlobalCtxt<'tcx>;
985 fn deref(&self) -> &Self::Target {
990 pub struct GlobalCtxt<'tcx> {
991 pub arena: WorkerLocal<Arena<'tcx>>,
993 interners: CtxtInterners<'tcx>,
995 cstore: &'tcx CrateStoreDyn,
997 pub sess: &'tcx Session,
999 pub dep_graph: DepGraph,
1002 pub common: Common<'tcx>,
1004 /// Common types, pre-interned for your convenience.
1005 pub types: CommonTypes<'tcx>,
1007 /// Common lifetimes, pre-interned for your convenience.
1008 pub lifetimes: CommonLifetimes<'tcx>,
1010 /// Common consts, pre-interned for your convenience.
1011 pub consts: CommonConsts<'tcx>,
1013 /// Map indicating what traits are in scope for places where this
1014 /// is relevant; generated by resolve.
1015 trait_map: FxHashMap<DefIndex,
1016 FxHashMap<ItemLocalId,
1017 StableVec<TraitCandidate>>>,
1019 /// Export map produced by name resolution.
1020 export_map: FxHashMap<DefId, Vec<Export<hir::HirId>>>,
1022 hir_map: hir_map::Map<'tcx>,
1024 /// A map from `DefPathHash` -> `DefId`. Includes `DefId`s from the local crate
1025 /// as well as all upstream crates. Only populated in incremental mode.
1026 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
1028 pub queries: query::Queries<'tcx>,
1030 maybe_unused_trait_imports: FxHashSet<DefId>,
1031 maybe_unused_extern_crates: Vec<(DefId, Span)>,
1032 /// A map of glob use to a set of names it actually imports. Currently only
1033 /// used in save-analysis.
1034 glob_map: FxHashMap<DefId, FxHashSet<ast::Name>>,
1035 /// Extern prelude entries. The value is `true` if the entry was introduced
1036 /// via `extern crate` item and not `--extern` option or compiler built-in.
1037 pub extern_prelude: FxHashMap<ast::Name, bool>,
1039 // Internal cache for metadata decoding. No need to track deps on this.
1040 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
1042 /// Caches the results of trait selection. This cache is used
1043 /// for things that do not have to do with the parameters in scope.
1044 pub selection_cache: traits::SelectionCache<'tcx>,
1046 /// Caches the results of trait evaluation. This cache is used
1047 /// for things that do not have to do with the parameters in scope.
1048 /// Merge this with `selection_cache`?
1049 pub evaluation_cache: traits::EvaluationCache<'tcx>,
1051 /// The definite name of the current crate after taking into account
1052 /// attributes, commandline parameters, etc.
1053 pub crate_name: Symbol,
1055 /// Data layout specification for the current target.
1056 pub data_layout: TargetDataLayout,
1058 stability_interner: ShardedHashMap<&'tcx attr::Stability, ()>,
1060 /// Stores the value of constants (and deduplicates the actual memory)
1061 allocation_interner: ShardedHashMap<&'tcx Allocation, ()>,
1063 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1065 layout_interner: ShardedHashMap<&'tcx LayoutDetails, ()>,
1067 /// A general purpose channel to throw data out the back towards LLVM worker
1070 /// This is intended to only get used during the codegen phase of the compiler
1071 /// when satisfying the query for a particular codegen unit. Internally in
1072 /// the query it'll send data along this channel to get processed later.
1073 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
1075 output_filenames: Arc<OutputFilenames>,
1078 impl<'tcx> TyCtxt<'tcx> {
1079 /// Gets the global `TyCtxt`.
1081 pub fn global_tcx(self) -> TyCtxt<'tcx> {
1088 pub fn hir(self) -> &'tcx hir_map::Map<'tcx> {
1092 pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal<Body<'tcx>> {
1093 self.arena.alloc(Steal::new(mir))
1096 pub fn alloc_steal_promoted(self, promoted: IndexVec<Promoted, Body<'tcx>>) ->
1097 &'tcx Steal<IndexVec<Promoted, Body<'tcx>>> {
1098 self.arena.alloc(Steal::new(promoted))
1101 pub fn intern_promoted(self, promoted: IndexVec<Promoted, Body<'tcx>>) ->
1102 &'tcx IndexVec<Promoted, Body<'tcx>> {
1103 self.arena.alloc(promoted)
1106 pub fn alloc_adt_def(
1110 variants: IndexVec<VariantIdx, ty::VariantDef>,
1112 ) -> &'tcx ty::AdtDef {
1113 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1114 self.arena.alloc(def)
1117 pub fn intern_const_alloc(self, alloc: Allocation) -> &'tcx Allocation {
1118 self.allocation_interner.intern(alloc, |alloc| {
1119 self.arena.alloc(alloc)
1123 /// Allocates a read-only byte or string literal for `mir::interpret`.
1124 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1125 // Create an allocation that just contains these bytes.
1126 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1127 let alloc = self.intern_const_alloc(alloc);
1128 self.alloc_map.lock().create_memory_alloc(alloc)
1131 pub fn intern_stability(self, stab: attr::Stability) -> &'tcx attr::Stability {
1132 self.stability_interner.intern(stab, |stab| {
1133 self.arena.alloc(stab)
1137 pub fn intern_layout(self, layout: LayoutDetails) -> &'tcx LayoutDetails {
1138 self.layout_interner.intern(layout, |layout| {
1139 self.arena.alloc(layout)
1143 /// Returns a range of the start/end indices specified with the
1144 /// `rustc_layout_scalar_valid_range` attribute.
1145 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1146 let attrs = self.get_attrs(def_id);
1148 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1150 None => return Bound::Unbounded,
1152 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1153 match meta.literal().expect("attribute takes lit").kind {
1154 ast::LitKind::Int(a, _) => return Bound::Included(a),
1155 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1158 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1160 (get(sym::rustc_layout_scalar_valid_range_start),
1161 get(sym::rustc_layout_scalar_valid_range_end))
1164 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1165 value.lift_to_tcx(self)
1168 /// Like lift, but only tries in the global tcx.
1169 pub fn lift_to_global<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1170 value.lift_to_tcx(self.global_tcx())
1173 /// Creates a type context and call the closure with a `TyCtxt` reference
1174 /// to the context. The closure enforces that the type context and any interned
1175 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1176 /// reference to the context, to allow formatting values that need it.
1177 pub fn create_global_ctxt(
1179 cstore: &'tcx CrateStoreDyn,
1180 local_providers: ty::query::Providers<'tcx>,
1181 extern_providers: ty::query::Providers<'tcx>,
1182 arenas: &'tcx AllArenas,
1183 resolutions: ty::Resolutions,
1184 hir: hir_map::Map<'tcx>,
1185 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1187 tx: mpsc::Sender<Box<dyn Any + Send>>,
1188 output_filenames: &OutputFilenames,
1189 ) -> GlobalCtxt<'tcx> {
1190 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1193 let interners = CtxtInterners::new(&arenas.interner);
1194 let common = Common {
1195 empty_predicates: ty::GenericPredicates {
1200 let common_types = CommonTypes::new(&interners);
1201 let common_lifetimes = CommonLifetimes::new(&interners);
1202 let common_consts = CommonConsts::new(&interners, &common_types);
1203 let dep_graph = hir.dep_graph.clone();
1204 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1205 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1206 providers[LOCAL_CRATE] = local_providers;
1208 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1209 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1212 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1215 let def_path_tables = || {
1216 upstream_def_path_tables
1218 .map(|&(cnum, ref rc)| (cnum, &**rc))
1219 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1222 // Precompute the capacity of the hashmap so we don't have to
1223 // re-allocate when populating it.
1224 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1226 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1228 ::std::default::Default::default()
1231 for (cnum, def_path_table) in def_path_tables() {
1232 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1240 let mut trait_map: FxHashMap<_, FxHashMap<_, _>> = FxHashMap::default();
1241 for (k, v) in resolutions.trait_map {
1242 let hir_id = hir.node_to_hir_id(k);
1243 let map = trait_map.entry(hir_id.owner).or_default();
1244 map.insert(hir_id.local_id, StableVec::new(v));
1250 arena: WorkerLocal::new(|_| Arena::default()),
1254 types: common_types,
1255 lifetimes: common_lifetimes,
1256 consts: common_consts,
1258 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1259 let exports: Vec<_> = v.into_iter().map(|e| {
1260 e.map_id(|id| hir.node_to_hir_id(id))
1264 maybe_unused_trait_imports:
1265 resolutions.maybe_unused_trait_imports
1267 .map(|id| hir.local_def_id_from_node_id(id))
1269 maybe_unused_extern_crates:
1270 resolutions.maybe_unused_extern_crates
1272 .map(|(id, sp)| (hir.local_def_id_from_node_id(id), sp))
1274 glob_map: resolutions.glob_map.into_iter().map(|(id, names)| {
1275 (hir.local_def_id_from_node_id(id), names)
1277 extern_prelude: resolutions.extern_prelude,
1279 def_path_hash_to_def_id,
1280 queries: query::Queries::new(
1283 on_disk_query_result_cache,
1285 rcache: Default::default(),
1286 selection_cache: Default::default(),
1287 evaluation_cache: Default::default(),
1288 crate_name: Symbol::intern(crate_name),
1290 layout_interner: Default::default(),
1291 stability_interner: Default::default(),
1292 allocation_interner: Default::default(),
1293 alloc_map: Lock::new(interpret::AllocMap::new()),
1294 tx_to_llvm_workers: Lock::new(tx),
1295 output_filenames: Arc::new(output_filenames.clone()),
1299 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1300 let cname = self.crate_name(LOCAL_CRATE).as_str();
1301 self.sess.consider_optimizing(&cname, msg)
1304 pub fn lib_features(self) -> &'tcx middle::lib_features::LibFeatures {
1305 self.get_lib_features(LOCAL_CRATE)
1308 /// Obtain all lang items of this crate and all dependencies (recursively)
1309 pub fn lang_items(self) -> &'tcx middle::lang_items::LanguageItems {
1310 self.get_lang_items(LOCAL_CRATE)
1313 /// Obtain the given diagnostic item's `DefId`. Use `is_diagnostic_item` if you just want to
1314 /// compare against another `DefId`, since `is_diagnostic_item` is cheaper.
1315 pub fn get_diagnostic_item(self, name: Symbol) -> Option<DefId> {
1316 self.all_diagnostic_items(LOCAL_CRATE).get(&name).copied()
1319 /// Check whether the diagnostic item with the given `name` has the given `DefId`.
1320 pub fn is_diagnostic_item(self, name: Symbol, did: DefId) -> bool {
1321 self.diagnostic_items(did.krate).get(&name) == Some(&did)
1324 pub fn stability(self) -> &'tcx stability::Index<'tcx> {
1325 self.stability_index(LOCAL_CRATE)
1328 pub fn crates(self) -> &'tcx [CrateNum] {
1329 self.all_crate_nums(LOCAL_CRATE)
1332 pub fn features(self) -> &'tcx feature_gate::Features {
1333 self.features_query(LOCAL_CRATE)
1336 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1338 self.hir().def_key(id)
1340 self.cstore.def_key(id)
1344 /// Converts a `DefId` into its fully expanded `DefPath` (every
1345 /// `DefId` is really just an interned `DefPath`).
1347 /// Note that if `id` is not local to this crate, the result will
1348 /// be a non-local `DefPath`.
1349 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1351 self.hir().def_path(id)
1353 self.cstore.def_path(id)
1357 /// Returns whether or not the crate with CrateNum 'cnum'
1358 /// is marked as a private dependency
1359 pub fn is_private_dep(self, cnum: CrateNum) -> bool {
1360 if cnum == LOCAL_CRATE {
1363 self.cstore.crate_is_private_dep_untracked(cnum)
1368 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1369 if def_id.is_local() {
1370 self.hir().definitions().def_path_hash(def_id.index)
1372 self.cstore.def_path_hash(def_id)
1376 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1377 // We are explicitly not going through queries here in order to get
1378 // crate name and disambiguator since this code is called from debug!()
1379 // statements within the query system and we'd run into endless
1380 // recursion otherwise.
1381 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1382 (self.crate_name.clone(),
1383 self.sess.local_crate_disambiguator())
1385 (self.cstore.crate_name_untracked(def_id.krate),
1386 self.cstore.crate_disambiguator_untracked(def_id.krate))
1391 // Don't print the whole crate disambiguator. That's just
1392 // annoying in debug output.
1393 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1394 self.def_path(def_id).to_string_no_crate())
1397 pub fn metadata_encoding_version(self) -> Vec<u8> {
1398 self.cstore.metadata_encoding_version().to_vec()
1401 pub fn encode_metadata(self)-> EncodedMetadata {
1402 self.cstore.encode_metadata(self)
1405 // Note that this is *untracked* and should only be used within the query
1406 // system if the result is otherwise tracked through queries
1407 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1408 self.cstore.crate_data_as_rc_any(cnum)
1412 pub fn create_stable_hashing_context(self) -> StableHashingContext<'tcx> {
1413 let krate = self.gcx.hir_map.forest.untracked_krate();
1415 StableHashingContext::new(self.sess,
1417 self.hir().definitions(),
1421 // This method makes sure that we have a DepNode and a Fingerprint for
1422 // every upstream crate. It needs to be called once right after the tcx is
1424 // With full-fledged red/green, the method will probably become unnecessary
1425 // as this will be done on-demand.
1426 pub fn allocate_metadata_dep_nodes(self) {
1427 // We cannot use the query versions of crates() and crate_hash(), since
1428 // those would need the DepNodes that we are allocating here.
1429 for cnum in self.cstore.crates_untracked() {
1430 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1431 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1432 self.dep_graph.with_task(dep_node,
1435 |_, x| x, // No transformation needed
1436 dep_graph::hash_result,
1441 pub fn serialize_query_result_cache<E>(self,
1443 -> Result<(), E::Error>
1444 where E: ty::codec::TyEncoder
1446 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1449 /// If `true`, we should use the AST-based borrowck (we may *also* use
1450 /// the MIR-based borrowck).
1451 pub fn use_ast_borrowck(self) -> bool {
1452 self.borrowck_mode().use_ast()
1455 /// If `true`, we should use the MIR-based borrowck, but also
1456 /// fall back on the AST borrowck if the MIR-based one errors.
1457 pub fn migrate_borrowck(self) -> bool {
1458 self.borrowck_mode().migrate()
1461 /// If `true`, make MIR codegen for `match` emit a temp that holds a
1462 /// borrow of the input to the match expression.
1463 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1464 self.emit_read_for_match()
1467 /// If `true`, make MIR codegen for `match` emit FakeRead
1468 /// statements (which simulate the maximal effect of executing the
1469 /// patterns in a match arm).
1470 pub fn emit_read_for_match(&self) -> bool {
1471 !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1474 /// What mode(s) of borrowck should we run? AST? MIR? both?
1475 /// (Also considers the `#![feature(nll)]` setting.)
1476 pub fn borrowck_mode(&self) -> BorrowckMode {
1477 // Here are the main constraints we need to deal with:
1479 // 1. An opts.borrowck_mode of `BorrowckMode::Migrate` is
1480 // synonymous with no `-Z borrowck=...` flag at all.
1482 // 2. We want to allow developers on the Nightly channel
1483 // to opt back into the "hard error" mode for NLL,
1484 // (which they can do via specifying `#![feature(nll)]`
1485 // explicitly in their crate).
1487 // So, this precedence list is how pnkfelix chose to work with
1488 // the above constraints:
1490 // * `#![feature(nll)]` *always* means use NLL with hard
1491 // errors. (To simplify the code here, it now even overrides
1492 // a user's attempt to specify `-Z borrowck=compare`, which
1493 // we arguably do not need anymore and should remove.)
1495 // * Otherwise, if no `-Z borrowck=...` then use migrate mode
1497 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1499 if self.features().nll { return BorrowckMode::Mir; }
1501 self.sess.opts.borrowck_mode
1505 pub fn local_crate_exports_generics(self) -> bool {
1506 debug_assert!(self.sess.opts.share_generics());
1508 self.sess.crate_types.borrow().iter().any(|crate_type| {
1510 CrateType::Executable |
1511 CrateType::Staticlib |
1512 CrateType::ProcMacro |
1514 CrateType::Cdylib => false,
1515 CrateType::Rlib => true,
1520 // Returns the `DefId` and the `BoundRegion` corresponding to the given region.
1521 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1522 let (suitable_region_binding_scope, bound_region) = match *region {
1523 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1524 ty::ReEarlyBound(ref ebr) => (
1525 self.parent(ebr.def_id).unwrap(),
1526 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1528 _ => return None, // not a free region
1531 let hir_id = self.hir()
1532 .as_local_hir_id(suitable_region_binding_scope)
1534 let is_impl_item = match self.hir().find(hir_id) {
1535 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1536 Some(Node::ImplItem(..)) => {
1537 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1542 return Some(FreeRegionInfo {
1543 def_id: suitable_region_binding_scope,
1544 boundregion: bound_region,
1545 is_impl_item: is_impl_item,
1549 pub fn return_type_impl_trait(
1551 scope_def_id: DefId,
1552 ) -> Option<Ty<'tcx>> {
1553 // HACK: `type_of_def_id()` will fail on these (#55796), so return `None`.
1554 let hir_id = self.hir().as_local_hir_id(scope_def_id).unwrap();
1555 match self.hir().get(hir_id) {
1556 Node::Item(item) => {
1558 ItemKind::Fn(..) => { /* `type_of_def_id()` will work */ }
1564 _ => { /* `type_of_def_id()` will work or panic */ }
1567 let ret_ty = self.type_of(scope_def_id);
1569 ty::FnDef(_, _) => {
1570 let sig = ret_ty.fn_sig(*self);
1571 let output = self.erase_late_bound_regions(&sig.output());
1572 if output.is_impl_trait() {
1582 // Checks if the bound region is in Impl Item.
1583 pub fn is_bound_region_in_impl_item(
1585 suitable_region_binding_scope: DefId,
1587 let container_id = self.associated_item(suitable_region_binding_scope)
1590 if self.impl_trait_ref(container_id).is_some() {
1591 // For now, we do not try to target impls of traits. This is
1592 // because this message is going to suggest that the user
1593 // change the fn signature, but they may not be free to do so,
1594 // since the signature must match the trait.
1596 // FIXME(#42706) -- in some cases, we could do better here.
1602 /// Determines whether identifiers in the assembly have strict naming rules.
1603 /// Currently, only NVPTX* targets need it.
1604 pub fn has_strict_asm_symbol_naming(&self) -> bool {
1605 self.sess.target.target.arch.contains("nvptx")
1609 impl<'tcx> GlobalCtxt<'tcx> {
1610 /// Calls the closure with a local `TyCtxt` using the given arena.
1611 /// `interners` is a slot passed so we can create a CtxtInterners
1612 /// with the same lifetime as `arena`.
1613 pub fn enter_local<F, R>(&'tcx self, f: F) -> R
1615 F: FnOnce(TyCtxt<'tcx>) -> R,
1620 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1621 let new_icx = ty::tls::ImplicitCtxt {
1623 query: icx.query.clone(),
1624 diagnostics: icx.diagnostics,
1625 layout_depth: icx.layout_depth,
1626 task_deps: icx.task_deps,
1628 ty::tls::enter_context(&new_icx, |_| {
1635 /// A trait implemented for all `X<'a>` types that can be safely and
1636 /// efficiently converted to `X<'tcx>` as long as they are part of the
1637 /// provided `TyCtxt<'tcx>`.
1638 /// This can be done, for example, for `Ty<'tcx>` or `SubstsRef<'tcx>`
1639 /// by looking them up in their respective interners.
1641 /// However, this is still not the best implementation as it does
1642 /// need to compare the components, even for interned values.
1643 /// It would be more efficient if `TypedArena` provided a way to
1644 /// determine whether the address is in the allocated range.
1646 /// `None` is returned if the value or one of the components is not part
1647 /// of the provided context.
1648 /// For `Ty`, `None` can be returned if either the type interner doesn't
1649 /// contain the `TyKind` key or if the address of the interned
1650 /// pointer differs. The latter case is possible if a primitive type,
1651 /// e.g., `()` or `u8`, was interned in a different context.
1652 pub trait Lift<'tcx>: fmt::Debug {
1653 type Lifted: fmt::Debug + 'tcx;
1654 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>;
1657 macro_rules! nop_lift {
1658 ($ty:ty => $lifted:ty) => {
1659 impl<'a, 'tcx> Lift<'tcx> for $ty {
1660 type Lifted = $lifted;
1661 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1662 if tcx.interners.arena.in_arena(*self as *const _) {
1663 Some(unsafe { mem::transmute(*self) })
1672 macro_rules! nop_list_lift {
1673 ($ty:ty => $lifted:ty) => {
1674 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1675 type Lifted = &'tcx List<$lifted>;
1676 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1677 if self.is_empty() {
1678 return Some(List::empty());
1680 if tcx.interners.arena.in_arena(*self as *const _) {
1681 Some(unsafe { mem::transmute(*self) })
1690 nop_lift!{Ty<'a> => Ty<'tcx>}
1691 nop_lift!{Region<'a> => Region<'tcx>}
1692 nop_lift!{Goal<'a> => Goal<'tcx>}
1693 nop_lift!{&'a Const<'a> => &'tcx Const<'tcx>}
1695 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1696 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1697 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1698 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1699 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1700 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1701 nop_list_lift!{ProjectionKind => ProjectionKind}
1703 // This is the impl for `&'a InternalSubsts<'a>`.
1704 nop_list_lift!{GenericArg<'a> => GenericArg<'tcx>}
1707 use super::{GlobalCtxt, TyCtxt, ptr_eq};
1712 use crate::ty::query;
1713 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1714 use rustc_data_structures::OnDrop;
1715 use rustc_data_structures::sync::{self, Lrc, Lock};
1716 use rustc_data_structures::thin_vec::ThinVec;
1717 use crate::dep_graph::TaskDeps;
1719 #[cfg(not(parallel_compiler))]
1720 use std::cell::Cell;
1722 #[cfg(parallel_compiler)]
1723 use rustc_rayon_core as rayon_core;
1725 /// This is the implicit state of rustc. It contains the current
1726 /// `TyCtxt` and query. It is updated when creating a local interner or
1727 /// executing a new query. Whenever there's a `TyCtxt` value available
1728 /// you should also have access to an `ImplicitCtxt` through the functions
1731 pub struct ImplicitCtxt<'a, 'tcx> {
1732 /// The current `TyCtxt`. Initially created by `enter_global` and updated
1733 /// by `enter_local` with a new local interner.
1734 pub tcx: TyCtxt<'tcx>,
1736 /// The current query job, if any. This is updated by `JobOwner::start` in
1737 /// `ty::query::plumbing` when executing a query.
1738 pub query: Option<Lrc<query::QueryJob<'tcx>>>,
1740 /// Where to store diagnostics for the current query job, if any.
1741 /// This is updated by `JobOwner::start` in `ty::query::plumbing` when executing a query.
1742 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1744 /// Used to prevent layout from recursing too deeply.
1745 pub layout_depth: usize,
1747 /// The current dep graph task. This is used to add dependencies to queries
1748 /// when executing them.
1749 pub task_deps: Option<&'a Lock<TaskDeps>>,
1752 /// Sets Rayon's thread-local variable, which is preserved for Rayon jobs
1753 /// to `value` during the call to `f`. It is restored to its previous value after.
1754 /// This is used to set the pointer to the new `ImplicitCtxt`.
1755 #[cfg(parallel_compiler)]
1757 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1758 rayon_core::tlv::with(value, f)
1761 /// Gets Rayon's thread-local variable, which is preserved for Rayon jobs.
1762 /// This is used to get the pointer to the current `ImplicitCtxt`.
1763 #[cfg(parallel_compiler)]
1765 fn get_tlv() -> usize {
1766 rayon_core::tlv::get()
1769 #[cfg(not(parallel_compiler))]
1771 /// A thread local variable that stores a pointer to the current `ImplicitCtxt`.
1772 static TLV: Cell<usize> = Cell::new(0);
1775 /// Sets TLV to `value` during the call to `f`.
1776 /// It is restored to its previous value after.
1777 /// This is used to set the pointer to the new `ImplicitCtxt`.
1778 #[cfg(not(parallel_compiler))]
1780 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1781 let old = get_tlv();
1782 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1783 TLV.with(|tlv| tlv.set(value));
1787 /// Gets the pointer to the current `ImplicitCtxt`.
1788 #[cfg(not(parallel_compiler))]
1789 fn get_tlv() -> usize {
1790 TLV.with(|tlv| tlv.get())
1793 /// This is a callback from libsyntax as it cannot access the implicit state
1794 /// in librustc otherwise.
1795 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1797 if let Some(tcx) = tcx {
1798 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1800 syntax_pos::default_span_debug(span, f)
1805 /// This is a callback from libsyntax as it cannot access the implicit state
1806 /// in librustc otherwise. It is used to when diagnostic messages are
1807 /// emitted and stores them in the current query, if there is one.
1808 fn track_diagnostic(diagnostic: &Diagnostic) {
1809 with_context_opt(|icx| {
1810 if let Some(icx) = icx {
1811 if let Some(ref diagnostics) = icx.diagnostics {
1812 let mut diagnostics = diagnostics.lock();
1813 diagnostics.extend(Some(diagnostic.clone()));
1819 /// Sets up the callbacks from libsyntax on the current thread.
1820 pub fn with_thread_locals<F, R>(f: F) -> R
1821 where F: FnOnce() -> R
1823 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1824 let original_span_debug = span_dbg.get();
1825 span_dbg.set(span_debug);
1827 let _on_drop = OnDrop(move || {
1828 span_dbg.set(original_span_debug);
1831 TRACK_DIAGNOSTICS.with(|current| {
1832 let original = current.get();
1833 current.set(track_diagnostic);
1835 let _on_drop = OnDrop(move || {
1836 current.set(original);
1844 /// Sets `context` as the new current `ImplicitCtxt` for the duration of the function `f`.
1846 pub fn enter_context<'a, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'tcx>, f: F) -> R
1848 F: FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1850 set_tlv(context as *const _ as usize, || {
1855 /// Enters `GlobalCtxt` by setting up libsyntax callbacks and
1856 /// creating a initial `TyCtxt` and `ImplicitCtxt`.
1857 /// This happens once per rustc session and `TyCtxt`s only exists
1858 /// inside the `f` function.
1859 pub fn enter_global<'tcx, F, R>(gcx: &'tcx GlobalCtxt<'tcx>, f: F) -> R
1861 F: FnOnce(TyCtxt<'tcx>) -> R,
1863 // Update `GCX_PTR` to indicate there's a `GlobalCtxt` available.
1864 GCX_PTR.with(|lock| {
1865 *lock.lock() = gcx as *const _ as usize;
1867 // Set `GCX_PTR` back to 0 when we exit.
1868 let _on_drop = OnDrop(move || {
1869 GCX_PTR.with(|lock| *lock.lock() = 0);
1875 let icx = ImplicitCtxt {
1882 enter_context(&icx, |_| {
1887 scoped_thread_local! {
1888 /// Stores a pointer to the `GlobalCtxt` if one is available.
1889 /// This is used to access the `GlobalCtxt` in the deadlock handler given to Rayon.
1890 pub static GCX_PTR: Lock<usize>
1893 /// Creates a `TyCtxt` and `ImplicitCtxt` based on the `GCX_PTR` thread local.
1894 /// This is used in the deadlock handler.
1895 pub unsafe fn with_global<F, R>(f: F) -> R
1897 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
1899 let gcx = GCX_PTR.with(|lock| *lock.lock());
1901 let gcx = &*(gcx as *const GlobalCtxt<'_>);
1905 let icx = ImplicitCtxt {
1912 enter_context(&icx, |_| f(tcx))
1915 /// Allows access to the current `ImplicitCtxt` in a closure if one is available.
1917 pub fn with_context_opt<F, R>(f: F) -> R
1919 F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R,
1921 let context = get_tlv();
1925 // We could get a `ImplicitCtxt` pointer from another thread.
1926 // Ensure that `ImplicitCtxt` is `Sync`.
1927 sync::assert_sync::<ImplicitCtxt<'_, '_>>();
1929 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_>))) }
1933 /// Allows access to the current `ImplicitCtxt`.
1934 /// Panics if there is no `ImplicitCtxt` available.
1936 pub fn with_context<F, R>(f: F) -> R
1938 F: for<'a, 'tcx> FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1940 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
1943 /// Allows access to the current `ImplicitCtxt` whose tcx field has the same global
1944 /// interner as the tcx argument passed in. This means the closure is given an `ImplicitCtxt`
1945 /// with the same `'tcx` lifetime as the `TyCtxt` passed in.
1946 /// This will panic if you pass it a `TyCtxt` which has a different global interner from
1947 /// the current `ImplicitCtxt`'s `tcx` field.
1949 pub fn with_related_context<'tcx, F, R>(tcx: TyCtxt<'tcx>, f: F) -> R
1951 F: FnOnce(&ImplicitCtxt<'_, 'tcx>) -> R,
1953 with_context(|context| {
1955 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
1956 let context: &ImplicitCtxt<'_, '_> = mem::transmute(context);
1962 /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
1963 /// Panics if there is no `ImplicitCtxt` available.
1965 pub fn with<F, R>(f: F) -> R
1967 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
1969 with_context(|context| f(context.tcx))
1972 /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
1973 /// The closure is passed None if there is no `ImplicitCtxt` available.
1975 pub fn with_opt<F, R>(f: F) -> R
1977 F: for<'tcx> FnOnce(Option<TyCtxt<'tcx>>) -> R,
1979 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
1983 macro_rules! sty_debug_print {
1984 ($ctxt: expr, $($variant: ident),*) => {{
1985 // Curious inner module to allow variant names to be used as
1987 #[allow(non_snake_case)]
1989 use crate::ty::{self, TyCtxt};
1990 use crate::ty::context::Interned;
1992 #[derive(Copy, Clone)]
2001 pub fn go(tcx: TyCtxt<'_>) {
2002 let mut total = DebugStat {
2009 $(let mut $variant = total;)*
2011 let shards = tcx.interners.type_.lock_shards();
2012 let types = shards.iter().flat_map(|shard| shard.keys());
2013 for &Interned(t) in types {
2014 let variant = match t.kind {
2015 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2016 ty::Float(..) | ty::Str | ty::Never => continue,
2017 ty::Error => /* unimportant */ continue,
2018 $(ty::$variant(..) => &mut $variant,)*
2020 let lt = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2021 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2022 let ct = t.flags.intersects(ty::TypeFlags::HAS_CT_INFER);
2026 if lt { total.lt_infer += 1; variant.lt_infer += 1 }
2027 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2028 if ct { total.ct_infer += 1; variant.ct_infer += 1 }
2029 if lt && ty && ct { total.all_infer += 1; variant.all_infer += 1 }
2031 println!("Ty interner total ty lt ct all");
2032 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2033 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2034 stringify!($variant),
2035 uses = $variant.total,
2036 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2037 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2038 lt = $variant.lt_infer as f64 * 100.0 / total.total as f64,
2039 ct = $variant.ct_infer as f64 * 100.0 / total.total as f64,
2040 all = $variant.all_infer as f64 * 100.0 / total.total as f64);
2042 println!(" total {uses:6} \
2043 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2045 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2046 lt = total.lt_infer as f64 * 100.0 / total.total as f64,
2047 ct = total.ct_infer as f64 * 100.0 / total.total as f64,
2048 all = total.all_infer as f64 * 100.0 / total.total as f64)
2056 impl<'tcx> TyCtxt<'tcx> {
2057 pub fn print_debug_stats(self) {
2060 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2061 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2062 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2064 println!("InternalSubsts interner: #{}", self.interners.substs.len());
2065 println!("Region interner: #{}", self.interners.region.len());
2066 println!("Stability interner: #{}", self.stability_interner.len());
2067 println!("Allocation interner: #{}", self.allocation_interner.len());
2068 println!("Layout interner: #{}", self.layout_interner.len());
2073 /// An entry in an interner.
2074 struct Interned<'tcx, T: ?Sized>(&'tcx T);
2076 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2077 fn clone(&self) -> Self {
2081 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2083 // N.B., an `Interned<Ty>` compares and hashes as a `TyKind`.
2084 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2085 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2086 self.0.kind == other.0.kind
2090 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2092 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2093 fn hash<H: Hasher>(&self, s: &mut H) {
2098 #[allow(rustc::usage_of_ty_tykind)]
2099 impl<'tcx> Borrow<TyKind<'tcx>> for Interned<'tcx, TyS<'tcx>> {
2100 fn borrow<'a>(&'a self) -> &'a TyKind<'tcx> {
2105 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2106 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2107 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2108 self.0[..] == other.0[..]
2112 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2114 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2115 fn hash<H: Hasher>(&self, s: &mut H) {
2120 impl<'tcx> Borrow<[Ty<'tcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2121 fn borrow<'a>(&'a self) -> &'a [Ty<'tcx>] {
2126 impl<'tcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2127 fn borrow(&self) -> &[CanonicalVarInfo] {
2132 impl<'tcx> Borrow<[GenericArg<'tcx>]> for Interned<'tcx, InternalSubsts<'tcx>> {
2133 fn borrow<'a>(&'a self) -> &'a [GenericArg<'tcx>] {
2138 impl<'tcx> Borrow<[ProjectionKind]>
2139 for Interned<'tcx, List<ProjectionKind>> {
2140 fn borrow(&self) -> &[ProjectionKind] {
2145 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2146 fn borrow(&self) -> &RegionKind {
2151 impl<'tcx> Borrow<GoalKind<'tcx>> for Interned<'tcx, GoalKind<'tcx>> {
2152 fn borrow<'a>(&'a self) -> &'a GoalKind<'tcx> {
2157 impl<'tcx> Borrow<[ExistentialPredicate<'tcx>]>
2158 for Interned<'tcx, List<ExistentialPredicate<'tcx>>>
2160 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'tcx>] {
2165 impl<'tcx> Borrow<[Predicate<'tcx>]> for Interned<'tcx, List<Predicate<'tcx>>> {
2166 fn borrow<'a>(&'a self) -> &'a [Predicate<'tcx>] {
2171 impl<'tcx> Borrow<Const<'tcx>> for Interned<'tcx, Const<'tcx>> {
2172 fn borrow<'a>(&'a self) -> &'a Const<'tcx> {
2177 impl<'tcx> Borrow<[Clause<'tcx>]> for Interned<'tcx, List<Clause<'tcx>>> {
2178 fn borrow<'a>(&'a self) -> &'a [Clause<'tcx>] {
2183 impl<'tcx> Borrow<[Goal<'tcx>]> for Interned<'tcx, List<Goal<'tcx>>> {
2184 fn borrow<'a>(&'a self) -> &'a [Goal<'tcx>] {
2189 macro_rules! intern_method {
2190 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2192 $alloc_to_key:expr) -> $ty:ty) => {
2193 impl<$lt_tcx> TyCtxt<$lt_tcx> {
2194 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2195 let key = ($alloc_to_key)(&v);
2197 self.interners.$name.intern_ref(key, || {
2198 Interned($alloc_method(&self.interners.arena, v))
2206 macro_rules! direct_interners {
2207 ($lt_tcx:tt, $($name:ident: $method:ident($ty:ty)),+) => {
2208 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2209 fn eq(&self, other: &Self) -> bool {
2214 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2216 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2217 fn hash<H: Hasher>(&self, s: &mut H) {
2225 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2230 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2231 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2234 direct_interners!('tcx,
2235 region: mk_region(RegionKind),
2236 goal: mk_goal(GoalKind<'tcx>),
2237 const_: mk_const(Const<'tcx>)
2240 macro_rules! slice_interners {
2241 ($($field:ident: $method:ident($ty:ty)),+) => (
2242 $(intern_method!( 'tcx, $field: $method(
2244 |a, v| List::from_arena(a, v),
2245 Deref::deref) -> List<$ty>);)+
2250 existential_predicates: _intern_existential_predicates(ExistentialPredicate<'tcx>),
2251 predicates: _intern_predicates(Predicate<'tcx>),
2252 type_list: _intern_type_list(Ty<'tcx>),
2253 substs: _intern_substs(GenericArg<'tcx>),
2254 clauses: _intern_clauses(Clause<'tcx>),
2255 goal_list: _intern_goals(Goal<'tcx>),
2256 projs: _intern_projs(ProjectionKind)
2259 // This isn't a perfect fit: `CanonicalVarInfo` slices are always
2260 // allocated in the global arena, so this `intern_method!` macro is
2261 // overly general. However, we just return `false` for the code that checks
2262 // whether they belong in the thread-local arena, so no harm done, and
2263 // seems better than open-coding the rest.
2266 canonical_var_infos: _intern_canonical_var_infos(
2267 &[CanonicalVarInfo],
2268 |a, v| List::from_arena(a, v),
2270 ) -> List<CanonicalVarInfo>
2273 impl<'tcx> TyCtxt<'tcx> {
2274 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2275 /// that is, a `fn` type that is equivalent in every way for being
2277 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2278 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2279 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2280 unsafety: hir::Unsafety::Unsafe,
2285 /// Given a closure signature `sig`, returns an equivalent `fn`
2286 /// type with the same signature. Detuples and so forth -- so
2287 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2288 /// a `fn(u32, i32)`.
2289 /// `unsafety` determines the unsafety of the `fn` type. If you pass
2290 /// `hir::Unsafety::Unsafe` in the previous example, then you would get
2291 /// an `unsafe fn (u32, i32)`.
2292 /// It cannot convert a closure that requires unsafe.
2293 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>, unsafety: hir::Unsafety) -> Ty<'tcx> {
2294 let converted_sig = sig.map_bound(|s| {
2295 let params_iter = match s.inputs()[0].kind {
2296 ty::Tuple(params) => {
2297 params.into_iter().map(|k| k.expect_ty())
2310 self.mk_fn_ptr(converted_sig)
2313 #[allow(rustc::usage_of_ty_tykind)]
2315 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2316 self.interners.intern_ty(st)
2319 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2321 ast::IntTy::Isize => self.types.isize,
2322 ast::IntTy::I8 => self.types.i8,
2323 ast::IntTy::I16 => self.types.i16,
2324 ast::IntTy::I32 => self.types.i32,
2325 ast::IntTy::I64 => self.types.i64,
2326 ast::IntTy::I128 => self.types.i128,
2330 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2332 ast::UintTy::Usize => self.types.usize,
2333 ast::UintTy::U8 => self.types.u8,
2334 ast::UintTy::U16 => self.types.u16,
2335 ast::UintTy::U32 => self.types.u32,
2336 ast::UintTy::U64 => self.types.u64,
2337 ast::UintTy::U128 => self.types.u128,
2341 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2343 ast::FloatTy::F32 => self.types.f32,
2344 ast::FloatTy::F64 => self.types.f64,
2349 pub fn mk_str(self) -> Ty<'tcx> {
2354 pub fn mk_static_str(self) -> Ty<'tcx> {
2355 self.mk_imm_ref(self.lifetimes.re_static, self.mk_str())
2359 pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2360 // Take a copy of substs so that we own the vectors inside.
2361 self.mk_ty(Adt(def, substs))
2365 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2366 self.mk_ty(Foreign(def_id))
2369 fn mk_generic_adt(self, wrapper_def_id: DefId, ty_param: Ty<'tcx>) -> Ty<'tcx> {
2370 let adt_def = self.adt_def(wrapper_def_id);
2371 let substs = InternalSubsts::for_item(self, wrapper_def_id, |param, substs| {
2373 GenericParamDefKind::Lifetime |
2374 GenericParamDefKind::Const => {
2377 GenericParamDefKind::Type { has_default, .. } => {
2378 if param.index == 0 {
2381 assert!(has_default);
2382 self.type_of(param.def_id).subst(self, substs).into()
2387 self.mk_ty(Adt(adt_def, substs))
2391 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2392 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem, None);
2393 self.mk_generic_adt(def_id, ty)
2397 pub fn mk_lang_item(self, ty: Ty<'tcx>, item: lang_items::LangItem) -> Option<Ty<'tcx>> {
2398 let def_id = self.lang_items().require(item).ok()?;
2399 Some(self.mk_generic_adt(def_id, ty))
2403 pub fn mk_maybe_uninit(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2404 let def_id = self.require_lang_item(lang_items::MaybeUninitLangItem, None);
2405 self.mk_generic_adt(def_id, ty)
2409 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2410 self.mk_ty(RawPtr(tm))
2414 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2415 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2419 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2420 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2424 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2425 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2429 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2430 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2434 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2435 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2439 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2440 self.mk_imm_ptr(self.mk_unit())
2444 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2445 self.mk_ty(Array(ty, ty::Const::from_usize(self.global_tcx(), n)))
2449 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2450 self.mk_ty(Slice(ty))
2454 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2455 let kinds: Vec<_> = ts.into_iter().map(|&t| GenericArg::from(t)).collect();
2456 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2459 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2460 iter.intern_with(|ts| {
2461 let kinds: Vec<_> = ts.into_iter().map(|&t| GenericArg::from(t)).collect();
2462 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2467 pub fn mk_unit(self) -> Ty<'tcx> {
2472 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2473 if self.features().never_type {
2476 self.intern_tup(&[])
2481 pub fn mk_bool(self) -> Ty<'tcx> {
2486 pub fn mk_fn_def(self, def_id: DefId,
2487 substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2488 self.mk_ty(FnDef(def_id, substs))
2492 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2493 self.mk_ty(FnPtr(fty))
2499 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2500 reg: ty::Region<'tcx>
2502 self.mk_ty(Dynamic(obj, reg))
2506 pub fn mk_projection(self,
2508 substs: SubstsRef<'tcx>)
2510 self.mk_ty(Projection(ProjectionTy {
2517 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2519 self.mk_ty(Closure(closure_id, closure_substs))
2523 pub fn mk_generator(self,
2525 generator_substs: GeneratorSubsts<'tcx>,
2526 movability: hir::GeneratorMovability)
2528 self.mk_ty(Generator(id, generator_substs, movability))
2532 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2533 self.mk_ty(GeneratorWitness(types))
2537 pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> {
2538 self.mk_ty_infer(TyVar(v))
2542 pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2543 self.mk_const(ty::Const {
2544 val: ConstValue::Infer(InferConst::Var(v)),
2550 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2551 self.mk_ty_infer(IntVar(v))
2555 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2556 self.mk_ty_infer(FloatVar(v))
2560 pub fn mk_ty_infer(self, it: InferTy) -> Ty<'tcx> {
2561 self.mk_ty(Infer(it))
2565 pub fn mk_const_infer(
2567 ic: InferConst<'tcx>,
2569 ) -> &'tcx ty::Const<'tcx> {
2570 self.mk_const(ty::Const {
2571 val: ConstValue::Infer(ic),
2577 pub fn mk_ty_param(self, index: u32, name: InternedString) -> Ty<'tcx> {
2578 self.mk_ty(Param(ParamTy { index, name: name }))
2582 pub fn mk_const_param(
2585 name: InternedString,
2587 ) -> &'tcx Const<'tcx> {
2588 self.mk_const(ty::Const {
2589 val: ConstValue::Param(ParamConst { index, name }),
2595 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> {
2597 GenericParamDefKind::Lifetime => {
2598 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2600 GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
2601 GenericParamDefKind::Const => {
2602 self.mk_const_param(param.index, param.name, self.type_of(param.def_id)).into()
2608 pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2609 self.mk_ty(Opaque(def_id, substs))
2612 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2613 -> &'tcx List<ExistentialPredicate<'tcx>> {
2614 assert!(!eps.is_empty());
2615 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2616 self._intern_existential_predicates(eps)
2619 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2620 -> &'tcx List<Predicate<'tcx>> {
2621 // FIXME consider asking the input slice to be sorted to avoid
2622 // re-interning permutations, in which case that would be asserted
2624 if preds.len() == 0 {
2625 // The macro-generated method below asserts we don't intern an empty slice.
2628 self._intern_predicates(preds)
2632 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2636 self._intern_type_list(ts)
2640 pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List<GenericArg<'tcx>> {
2644 self._intern_substs(ts)
2648 pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
2652 self._intern_projs(ps)
2656 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'tcx> {
2660 self.global_tcx()._intern_canonical_var_infos(ts)
2664 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2668 self._intern_clauses(ts)
2672 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2676 self._intern_goals(ts)
2680 pub fn mk_fn_sig<I>(self,
2684 unsafety: hir::Unsafety,
2686 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2688 I: Iterator<Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>,
2690 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2691 inputs_and_output: self.intern_type_list(xs),
2692 c_variadic, unsafety, abi
2696 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2697 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2699 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2702 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2703 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2705 iter.intern_with(|xs| self.intern_predicates(xs))
2708 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2709 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2710 iter.intern_with(|xs| self.intern_type_list(xs))
2713 pub fn mk_substs<I: InternAs<[GenericArg<'tcx>],
2714 &'tcx List<GenericArg<'tcx>>>>(self, iter: I) -> I::Output {
2715 iter.intern_with(|xs| self.intern_substs(xs))
2718 pub fn mk_substs_trait(self,
2720 rest: &[GenericArg<'tcx>])
2723 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2726 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2727 iter.intern_with(|xs| self.intern_clauses(xs))
2730 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2731 iter.intern_with(|xs| self.intern_goals(xs))
2734 pub fn lint_hir<S: Into<MultiSpan>>(self,
2735 lint: &'static Lint,
2739 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2742 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2743 lint: &'static Lint,
2748 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2753 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2754 lint: &'static Lint,
2759 let mut err = self.struct_span_lint_hir(lint, id, span.into(), msg);
2764 /// Walks upwards from `id` to find a node which might change lint levels with attributes.
2765 /// It stops at `bound` and just returns it if reached.
2766 pub fn maybe_lint_level_root_bounded(
2775 if lint::maybe_lint_level_root(self, id) {
2778 let next = self.hir().get_parent_node(id);
2780 bug!("lint traversal reached the root of the crate");
2786 pub fn lint_level_at_node(
2788 lint: &'static Lint,
2790 ) -> (lint::Level, lint::LintSource) {
2791 let sets = self.lint_levels(LOCAL_CRATE);
2793 if let Some(pair) = sets.level_and_source(lint, id, self.sess) {
2796 let next = self.hir().get_parent_node(id);
2798 bug!("lint traversal reached the root of the crate");
2804 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2805 lint: &'static Lint,
2809 -> DiagnosticBuilder<'tcx>
2811 let (level, src) = self.lint_level_at_node(lint, hir_id);
2812 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2815 pub fn struct_lint_node(self, lint: &'static Lint, id: HirId, msg: &str)
2816 -> DiagnosticBuilder<'tcx>
2818 let (level, src) = self.lint_level_at_node(lint, id);
2819 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2822 pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx StableVec<TraitCandidate>> {
2823 self.in_scope_traits_map(id.owner)
2824 .and_then(|map| map.get(&id.local_id))
2827 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2828 self.named_region_map(id.owner)
2829 .and_then(|map| map.get(&id.local_id).cloned())
2832 pub fn is_late_bound(self, id: HirId) -> bool {
2833 self.is_late_bound_map(id.owner)
2834 .map(|set| set.contains(&id.local_id))
2838 pub fn object_lifetime_defaults(self, id: HirId) -> Option<&'tcx [ObjectLifetimeDefault]> {
2839 self.object_lifetime_defaults_map(id.owner)
2840 .and_then(|map| map.get(&id.local_id).map(|v| &**v))
2844 pub trait InternAs<T: ?Sized, R> {
2846 fn intern_with<F>(self, f: F) -> Self::Output
2847 where F: FnOnce(&T) -> R;
2850 impl<I, T, R, E> InternAs<[T], R> for I
2851 where E: InternIteratorElement<T, R>,
2852 I: Iterator<Item=E> {
2853 type Output = E::Output;
2854 fn intern_with<F>(self, f: F) -> Self::Output
2855 where F: FnOnce(&[T]) -> R {
2856 E::intern_with(self, f)
2860 pub trait InternIteratorElement<T, R>: Sized {
2862 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2865 impl<T, R> InternIteratorElement<T, R> for T {
2867 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2868 f(&iter.collect::<SmallVec<[_; 8]>>())
2872 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2876 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2877 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2881 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2882 type Output = Result<R, E>;
2883 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2884 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
2888 // We are comparing types with different invariant lifetimes, so `ptr::eq`
2889 // won't work for us.
2890 fn ptr_eq<T, U>(t: *const T, u: *const U) -> bool {
2891 t as *const () == u as *const ()
2894 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2895 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id);
2896 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).map(|v| &v[..]);
2897 providers.crate_name = |tcx, id| {
2898 assert_eq!(id, LOCAL_CRATE);
2901 providers.get_lib_features = |tcx, id| {
2902 assert_eq!(id, LOCAL_CRATE);
2903 tcx.arena.alloc(middle::lib_features::collect(tcx))
2905 providers.get_lang_items = |tcx, id| {
2906 assert_eq!(id, LOCAL_CRATE);
2907 tcx.arena.alloc(middle::lang_items::collect(tcx))
2909 providers.diagnostic_items = |tcx, id| {
2910 assert_eq!(id, LOCAL_CRATE);
2911 middle::diagnostic_items::collect(tcx)
2913 providers.all_diagnostic_items = |tcx, id| {
2914 assert_eq!(id, LOCAL_CRATE);
2915 middle::diagnostic_items::collect_all(tcx)
2917 providers.maybe_unused_trait_import = |tcx, id| {
2918 tcx.maybe_unused_trait_imports.contains(&id)
2920 providers.maybe_unused_extern_crates = |tcx, cnum| {
2921 assert_eq!(cnum, LOCAL_CRATE);
2922 &tcx.maybe_unused_extern_crates[..]
2924 providers.names_imported_by_glob_use = |tcx, id| {
2925 assert_eq!(id.krate, LOCAL_CRATE);
2926 Lrc::new(tcx.glob_map.get(&id).cloned().unwrap_or_default())
2929 providers.stability_index = |tcx, cnum| {
2930 assert_eq!(cnum, LOCAL_CRATE);
2931 tcx.arena.alloc(stability::Index::new(tcx))
2933 providers.lookup_stability = |tcx, id| {
2934 assert_eq!(id.krate, LOCAL_CRATE);
2935 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
2936 tcx.stability().local_stability(id)
2938 providers.lookup_deprecation_entry = |tcx, id| {
2939 assert_eq!(id.krate, LOCAL_CRATE);
2940 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
2941 tcx.stability().local_deprecation_entry(id)
2943 providers.extern_mod_stmt_cnum = |tcx, id| {
2944 let id = tcx.hir().as_local_node_id(id).unwrap();
2945 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
2947 providers.all_crate_nums = |tcx, cnum| {
2948 assert_eq!(cnum, LOCAL_CRATE);
2949 tcx.arena.alloc_slice(&tcx.cstore.crates_untracked())
2951 providers.postorder_cnums = |tcx, cnum| {
2952 assert_eq!(cnum, LOCAL_CRATE);
2953 tcx.arena.alloc_slice(&tcx.cstore.postorder_cnums_untracked())
2955 providers.output_filenames = |tcx, cnum| {
2956 assert_eq!(cnum, LOCAL_CRATE);
2957 tcx.output_filenames.clone()
2959 providers.features_query = |tcx, cnum| {
2960 assert_eq!(cnum, LOCAL_CRATE);
2961 tcx.arena.alloc(tcx.sess.features_untracked().clone())
2963 providers.is_panic_runtime = |tcx, cnum| {
2964 assert_eq!(cnum, LOCAL_CRATE);
2965 attr::contains_name(tcx.hir().krate_attrs(), sym::panic_runtime)
2967 providers.is_compiler_builtins = |tcx, cnum| {
2968 assert_eq!(cnum, LOCAL_CRATE);
2969 attr::contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins)