1 //! Type context book-keeping.
3 use crate::arena::Arena;
4 use crate::dep_graph::{self, DepConstructor, DepGraph};
5 use crate::hir::exports::ExportMap;
6 use crate::ich::{NodeIdHashingMode, StableHashingContext};
7 use crate::infer::canonical::{Canonical, CanonicalVarInfo, CanonicalVarInfos};
8 use crate::lint::{struct_lint_level, LintDiagnosticBuilder, LintSource};
10 use crate::middle::cstore::{CrateStoreDyn, EncodedMetadata};
11 use crate::middle::resolve_lifetime::{self, ObjectLifetimeDefault};
12 use crate::middle::stability;
13 use crate::mir::interpret::{self, Allocation, ConstValue, Scalar};
14 use crate::mir::{Body, Field, Local, Place, PlaceElem, ProjectionKind, Promoted};
16 use crate::ty::steal::Steal;
17 use crate::ty::subst::{GenericArg, GenericArgKind, InternalSubsts, Subst, SubstsRef, UserSubsts};
18 use crate::ty::TyKind::*;
20 self, query, AdtDef, AdtKind, BindingMode, BoundVar, CanonicalPolyFnSig, Const, ConstVid,
21 DefIdTree, ExistentialPredicate, FloatVar, FloatVid, GenericParamDefKind, InferConst, InferTy,
22 IntVar, IntVid, List, ParamConst, ParamTy, PolyFnSig, Predicate, PredicateKind, ProjectionTy,
23 Region, RegionKind, ReprOptions, TraitObjectVisitor, Ty, TyKind, TyS, TyVar, TyVid, TypeAndMut,
26 use rustc_ast::expand::allocator::AllocatorKind;
27 use rustc_attr as attr;
28 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
29 use rustc_data_structures::profiling::SelfProfilerRef;
30 use rustc_data_structures::sharded::{IntoPointer, ShardedHashMap};
31 use rustc_data_structures::stable_hasher::{
32 hash_stable_hashmap, HashStable, StableHasher, StableVec,
34 use rustc_data_structures::sync::{self, Lock, Lrc, WorkerLocal};
35 use rustc_errors::ErrorReported;
37 use rustc_hir::def::{DefKind, Res};
38 use rustc_hir::def_id::{CrateNum, DefId, DefIdMap, DefIdSet, LocalDefId, LOCAL_CRATE};
39 use rustc_hir::definitions::{DefPathHash, Definitions};
40 use rustc_hir::lang_items::{self, PanicLocationLangItem};
41 use rustc_hir::{HirId, ItemKind, ItemLocalId, ItemLocalMap, ItemLocalSet, Node, TraitCandidate};
42 use rustc_index::vec::{Idx, IndexVec};
43 use rustc_macros::HashStable;
44 use rustc_session::config::{BorrowckMode, CrateType, OutputFilenames};
45 use rustc_session::lint::{Level, Lint};
46 use rustc_session::Session;
47 use rustc_span::source_map::MultiSpan;
48 use rustc_span::symbol::{kw, sym, Symbol};
49 use rustc_span::{Span, DUMMY_SP};
50 use rustc_target::abi::{Layout, TargetDataLayout, VariantIdx};
51 use rustc_target::spec::abi;
53 use smallvec::SmallVec;
55 use std::borrow::Borrow;
56 use std::cmp::Ordering;
57 use std::collections::hash_map::{self, Entry};
59 use std::hash::{Hash, Hasher};
62 use std::ops::{Bound, Deref};
65 type InternedSet<'tcx, T> = ShardedHashMap<Interned<'tcx, T>, ()>;
67 pub struct CtxtInterners<'tcx> {
68 /// The arena that types, regions, etc. are allocated from.
69 arena: &'tcx WorkerLocal<Arena<'tcx>>,
71 /// Specifically use a speedy hash algorithm for these hash sets, since
72 /// they're accessed quite often.
73 type_: InternedSet<'tcx, TyS<'tcx>>,
74 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
75 substs: InternedSet<'tcx, InternalSubsts<'tcx>>,
76 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
77 region: InternedSet<'tcx, RegionKind>,
78 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
79 predicate_kind: InternedSet<'tcx, PredicateKind<'tcx>>,
80 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
81 projs: InternedSet<'tcx, List<ProjectionKind>>,
82 place_elems: InternedSet<'tcx, List<PlaceElem<'tcx>>>,
83 const_: InternedSet<'tcx, Const<'tcx>>,
85 chalk_environment_clause_list: InternedSet<'tcx, List<traits::ChalkEnvironmentClause<'tcx>>>,
88 impl<'tcx> CtxtInterners<'tcx> {
89 fn new(arena: &'tcx WorkerLocal<Arena<'tcx>>) -> CtxtInterners<'tcx> {
92 type_: Default::default(),
93 type_list: Default::default(),
94 substs: Default::default(),
95 region: Default::default(),
96 existential_predicates: Default::default(),
97 canonical_var_infos: Default::default(),
98 predicate_kind: Default::default(),
99 predicates: Default::default(),
100 projs: Default::default(),
101 place_elems: Default::default(),
102 const_: Default::default(),
104 chalk_environment_clause_list: Default::default(),
109 #[allow(rustc::usage_of_ty_tykind)]
111 fn intern_ty(&self, kind: TyKind<'tcx>) -> Ty<'tcx> {
113 .intern(kind, |kind| {
114 let flags = super::flags::FlagComputation::for_kind(&kind);
116 let ty_struct = TyS {
119 outer_exclusive_binder: flags.outer_exclusive_binder,
122 Interned(self.arena.alloc(ty_struct))
128 pub struct CommonTypes<'tcx> {
147 pub self_param: Ty<'tcx>,
149 /// Dummy type used for the `Self` of a `TraitRef` created for converting
150 /// a trait object, and which gets removed in `ExistentialTraitRef`.
151 /// This type must not appear anywhere in other converted types.
152 pub trait_object_dummy_self: Ty<'tcx>,
155 pub struct CommonLifetimes<'tcx> {
156 /// `ReEmpty` in the root universe.
157 pub re_root_empty: Region<'tcx>,
160 pub re_static: Region<'tcx>,
162 /// Erased region, used after type-checking
163 pub re_erased: Region<'tcx>,
166 pub struct CommonConsts<'tcx> {
167 pub unit: &'tcx Const<'tcx>,
170 pub struct LocalTableInContext<'a, V> {
171 hir_owner: Option<LocalDefId>,
172 data: &'a ItemLocalMap<V>,
175 /// Validate that the given HirId (respectively its `local_id` part) can be
176 /// safely used as a key in the tables of a TypeckTable. For that to be
177 /// the case, the HirId must have the same `owner` as all the other IDs in
178 /// this table (signified by `hir_owner`). Otherwise the HirId
179 /// would be in a different frame of reference and using its `local_id`
180 /// would result in lookup errors, or worse, in silently wrong data being
182 fn validate_hir_id_for_typeck_tables(
183 hir_owner: Option<LocalDefId>,
187 if let Some(hir_owner) = hir_owner {
188 if hir_id.owner != hir_owner {
189 ty::tls::with(|tcx| {
191 "node {} with HirId::owner {:?} cannot be placed in TypeckTables with hir_owner {:?}",
192 tcx.hir().node_to_string(hir_id),
199 // We use "Null Object" TypeckTables in some of the analysis passes.
200 // These are just expected to be empty and their `hir_owner` is
201 // `None`. Therefore we cannot verify whether a given `HirId` would
202 // be a valid key for the given table. Instead we make sure that
203 // nobody tries to write to such a Null Object table.
205 bug!("access to invalid TypeckTables")
210 impl<'a, V> LocalTableInContext<'a, V> {
211 pub fn contains_key(&self, id: hir::HirId) -> bool {
212 validate_hir_id_for_typeck_tables(self.hir_owner, id, false);
213 self.data.contains_key(&id.local_id)
216 pub fn get(&self, id: hir::HirId) -> Option<&V> {
217 validate_hir_id_for_typeck_tables(self.hir_owner, id, false);
218 self.data.get(&id.local_id)
221 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
226 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
229 fn index(&self, key: hir::HirId) -> &V {
230 self.get(key).expect("LocalTableInContext: key not found")
234 pub struct LocalTableInContextMut<'a, V> {
235 hir_owner: Option<LocalDefId>,
236 data: &'a mut ItemLocalMap<V>,
239 impl<'a, V> LocalTableInContextMut<'a, V> {
240 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
241 validate_hir_id_for_typeck_tables(self.hir_owner, id, true);
242 self.data.get_mut(&id.local_id)
245 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
246 validate_hir_id_for_typeck_tables(self.hir_owner, id, true);
247 self.data.entry(id.local_id)
250 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
251 validate_hir_id_for_typeck_tables(self.hir_owner, id, true);
252 self.data.insert(id.local_id, val)
255 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
256 validate_hir_id_for_typeck_tables(self.hir_owner, id, true);
257 self.data.remove(&id.local_id)
261 /// All information necessary to validate and reveal an `impl Trait`.
262 #[derive(RustcEncodable, RustcDecodable, Debug, HashStable)]
263 pub struct ResolvedOpaqueTy<'tcx> {
264 /// The revealed type as seen by this function.
265 pub concrete_type: Ty<'tcx>,
266 /// Generic parameters on the opaque type as passed by this function.
267 /// For `type Foo<A, B> = impl Bar<A, B>; fn foo<T, U>() -> Foo<T, U> { .. }`
268 /// this is `[T, U]`, not `[A, B]`.
269 pub substs: SubstsRef<'tcx>,
272 /// Whenever a value may be live across a generator yield, the type of that value winds up in the
273 /// `GeneratorInteriorTypeCause` struct. This struct adds additional information about such
274 /// captured types that can be useful for diagnostics. In particular, it stores the span that
275 /// caused a given type to be recorded, along with the scope that enclosed the value (which can
276 /// be used to find the await that the value is live across).
280 /// ```ignore (pseudo-Rust)
288 /// Here, we would store the type `T`, the span of the value `x`, the "scope-span" for
289 /// the scope that contains `x`, the expr `T` evaluated from, and the span of `foo.await`.
290 #[derive(RustcEncodable, RustcDecodable, Clone, Debug, Eq, Hash, PartialEq, HashStable)]
291 pub struct GeneratorInteriorTypeCause<'tcx> {
292 /// Type of the captured binding.
294 /// Span of the binding that was captured.
296 /// Span of the scope of the captured binding.
297 pub scope_span: Option<Span>,
298 /// Span of `.await` or `yield` expression.
299 pub yield_span: Span,
300 /// Expr which the type evaluated from.
301 pub expr: Option<hir::HirId>,
304 #[derive(RustcEncodable, RustcDecodable, Debug)]
305 pub struct TypeckTables<'tcx> {
306 /// The `HirId::owner` all `ItemLocalId`s in this table are relative to.
307 pub hir_owner: Option<LocalDefId>,
309 /// Resolved definitions for `<T>::X` associated paths and
310 /// method calls, including those of overloaded operators.
311 type_dependent_defs: ItemLocalMap<Result<(DefKind, DefId), ErrorReported>>,
313 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
314 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
315 /// about the field you also need definition of the variant to which the field
316 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
317 field_indices: ItemLocalMap<usize>,
319 /// Stores the types for various nodes in the AST. Note that this table
320 /// is not guaranteed to be populated until after typeck. See
321 /// typeck::check::fn_ctxt for details.
322 node_types: ItemLocalMap<Ty<'tcx>>,
324 /// Stores the type parameters which were substituted to obtain the type
325 /// of this node. This only applies to nodes that refer to entities
326 /// parameterized by type parameters, such as generic fns, types, or
328 node_substs: ItemLocalMap<SubstsRef<'tcx>>,
330 /// This will either store the canonicalized types provided by the user
331 /// or the substitutions that the user explicitly gave (if any) attached
332 /// to `id`. These will not include any inferred values. The canonical form
333 /// is used to capture things like `_` or other unspecified values.
335 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
336 /// canonical substitutions would include only `for<X> { Vec<X> }`.
338 /// See also `AscribeUserType` statement in MIR.
339 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
341 /// Stores the canonicalized types provided by the user. See also
342 /// `AscribeUserType` statement in MIR.
343 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
345 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
347 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
348 pat_binding_modes: ItemLocalMap<BindingMode>,
350 /// Stores the types which were implicitly dereferenced in pattern binding modes
351 /// for later usage in HAIR lowering. For example,
354 /// match &&Some(5i32) {
359 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
362 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
363 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
366 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
368 /// Records the reasons that we picked the kind of each closure;
369 /// not all closures are present in the map.
370 closure_kind_origins: ItemLocalMap<(Span, Symbol)>,
372 /// For each fn, records the "liberated" types of its arguments
373 /// and return type. Liberated means that all bound regions
374 /// (including late-bound regions) are replaced with free
375 /// equivalents. This table is not used in codegen (since regions
376 /// are erased there) and hence is not serialized to metadata.
377 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
379 /// For each FRU expression, record the normalized types of the fields
380 /// of the struct - this is needed because it is non-trivial to
381 /// normalize while preserving regions. This table is used only in
382 /// MIR construction and hence is not serialized to metadata.
383 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
385 /// For every coercion cast we add the HIR node ID of the cast
386 /// expression to this set.
387 coercion_casts: ItemLocalSet,
389 /// Set of trait imports actually used in the method resolution.
390 /// This is used for warning unused imports. During type
391 /// checking, this `Lrc` should not be cloned: it must have a ref-count
392 /// of 1 so that we can insert things into the set mutably.
393 pub used_trait_imports: Lrc<DefIdSet>,
395 /// If any errors occurred while type-checking this body,
396 /// this field will be set to `Some(ErrorReported)`.
397 pub tainted_by_errors: Option<ErrorReported>,
399 /// All the opaque types that are restricted to concrete types
400 /// by this function.
401 pub concrete_opaque_types: FxHashMap<DefId, ResolvedOpaqueTy<'tcx>>,
403 /// Given the closure ID this map provides the list of UpvarIDs used by it.
404 /// The upvarID contains the HIR node ID and it also contains the full path
405 /// leading to the member of the struct or tuple that is used instead of the
407 pub closure_captures: ty::UpvarListMap,
409 /// Stores the type, expression, span and optional scope span of all types
410 /// that are live across the yield of this generator (if a generator).
411 pub generator_interior_types: Vec<GeneratorInteriorTypeCause<'tcx>>,
414 impl<'tcx> TypeckTables<'tcx> {
415 pub fn empty(hir_owner: Option<LocalDefId>) -> TypeckTables<'tcx> {
418 type_dependent_defs: Default::default(),
419 field_indices: Default::default(),
420 user_provided_types: Default::default(),
421 user_provided_sigs: Default::default(),
422 node_types: Default::default(),
423 node_substs: Default::default(),
424 adjustments: Default::default(),
425 pat_binding_modes: Default::default(),
426 pat_adjustments: Default::default(),
427 upvar_capture_map: Default::default(),
428 closure_kind_origins: Default::default(),
429 liberated_fn_sigs: Default::default(),
430 fru_field_types: Default::default(),
431 coercion_casts: Default::default(),
432 used_trait_imports: Lrc::new(Default::default()),
433 tainted_by_errors: None,
434 concrete_opaque_types: Default::default(),
435 closure_captures: Default::default(),
436 generator_interior_types: Default::default(),
440 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
441 pub fn qpath_res(&self, qpath: &hir::QPath<'_>, id: hir::HirId) -> Res {
443 hir::QPath::Resolved(_, ref path) => path.res,
444 hir::QPath::TypeRelative(..) => self
445 .type_dependent_def(id)
446 .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)),
450 pub fn type_dependent_defs(
452 ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> {
453 LocalTableInContext { hir_owner: self.hir_owner, data: &self.type_dependent_defs }
456 pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> {
457 validate_hir_id_for_typeck_tables(self.hir_owner, id, false);
458 self.type_dependent_defs.get(&id.local_id).cloned().and_then(|r| r.ok())
461 pub fn type_dependent_def_id(&self, id: HirId) -> Option<DefId> {
462 self.type_dependent_def(id).map(|(_, def_id)| def_id)
465 pub fn type_dependent_defs_mut(
467 ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> {
468 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.type_dependent_defs }
471 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
472 LocalTableInContext { hir_owner: self.hir_owner, data: &self.field_indices }
475 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
476 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.field_indices }
479 pub fn user_provided_types(&self) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
480 LocalTableInContext { hir_owner: self.hir_owner, data: &self.user_provided_types }
483 pub fn user_provided_types_mut(
485 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
486 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.user_provided_types }
489 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
490 LocalTableInContext { hir_owner: self.hir_owner, data: &self.node_types }
493 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
494 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_types }
497 pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
498 self.node_type_opt(id).unwrap_or_else(|| {
499 bug!("node_type: no type for node `{}`", tls::with(|tcx| tcx.hir().node_to_string(id)))
503 pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
504 validate_hir_id_for_typeck_tables(self.hir_owner, id, false);
505 self.node_types.get(&id.local_id).cloned()
508 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> {
509 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.node_substs }
512 pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> {
513 validate_hir_id_for_typeck_tables(self.hir_owner, id, false);
514 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| InternalSubsts::empty())
517 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<SubstsRef<'tcx>> {
518 validate_hir_id_for_typeck_tables(self.hir_owner, id, false);
519 self.node_substs.get(&id.local_id).cloned()
522 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
523 // doesn't provide type parameter substitutions.
524 pub fn pat_ty(&self, pat: &hir::Pat<'_>) -> Ty<'tcx> {
525 self.node_type(pat.hir_id)
528 pub fn pat_ty_opt(&self, pat: &hir::Pat<'_>) -> Option<Ty<'tcx>> {
529 self.node_type_opt(pat.hir_id)
532 // Returns the type of an expression as a monotype.
534 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
535 // some cases, we insert `Adjustment` annotations such as auto-deref or
536 // auto-ref. The type returned by this function does not consider such
537 // adjustments. See `expr_ty_adjusted()` instead.
539 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
540 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
541 // instead of "fn(ty) -> T with T = isize".
542 pub fn expr_ty(&self, expr: &hir::Expr<'_>) -> Ty<'tcx> {
543 self.node_type(expr.hir_id)
546 pub fn expr_ty_opt(&self, expr: &hir::Expr<'_>) -> Option<Ty<'tcx>> {
547 self.node_type_opt(expr.hir_id)
550 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
551 LocalTableInContext { hir_owner: self.hir_owner, data: &self.adjustments }
554 pub fn adjustments_mut(
556 ) -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
557 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.adjustments }
560 pub fn expr_adjustments(&self, expr: &hir::Expr<'_>) -> &[ty::adjustment::Adjustment<'tcx>] {
561 validate_hir_id_for_typeck_tables(self.hir_owner, expr.hir_id, false);
562 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
565 /// Returns the type of `expr`, considering any `Adjustment`
566 /// entry recorded for that expression.
567 pub fn expr_ty_adjusted(&self, expr: &hir::Expr<'_>) -> Ty<'tcx> {
568 self.expr_adjustments(expr).last().map_or_else(|| self.expr_ty(expr), |adj| adj.target)
571 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr<'_>) -> Option<Ty<'tcx>> {
572 self.expr_adjustments(expr).last().map(|adj| adj.target).or_else(|| self.expr_ty_opt(expr))
575 pub fn is_method_call(&self, expr: &hir::Expr<'_>) -> bool {
576 // Only paths and method calls/overloaded operators have
577 // entries in type_dependent_defs, ignore the former here.
578 if let hir::ExprKind::Path(_) = expr.kind {
582 match self.type_dependent_defs().get(expr.hir_id) {
583 Some(Ok((DefKind::AssocFn, _))) => true,
588 pub fn extract_binding_mode(&self, s: &Session, id: HirId, sp: Span) -> Option<BindingMode> {
589 self.pat_binding_modes().get(id).copied().or_else(|| {
590 s.delay_span_bug(sp, "missing binding mode");
595 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
596 LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_binding_modes }
599 pub fn pat_binding_modes_mut(&mut self) -> LocalTableInContextMut<'_, BindingMode> {
600 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_binding_modes }
603 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
604 LocalTableInContext { hir_owner: self.hir_owner, data: &self.pat_adjustments }
607 pub fn pat_adjustments_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
608 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.pat_adjustments }
611 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
612 self.upvar_capture_map[&upvar_id]
615 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, Symbol)> {
616 LocalTableInContext { hir_owner: self.hir_owner, data: &self.closure_kind_origins }
619 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, Symbol)> {
620 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.closure_kind_origins }
623 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
624 LocalTableInContext { hir_owner: self.hir_owner, data: &self.liberated_fn_sigs }
627 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
628 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.liberated_fn_sigs }
631 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
632 LocalTableInContext { hir_owner: self.hir_owner, data: &self.fru_field_types }
635 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
636 LocalTableInContextMut { hir_owner: self.hir_owner, data: &mut self.fru_field_types }
639 pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool {
640 validate_hir_id_for_typeck_tables(self.hir_owner, hir_id, true);
641 self.coercion_casts.contains(&hir_id.local_id)
644 pub fn set_coercion_cast(&mut self, id: ItemLocalId) {
645 self.coercion_casts.insert(id);
648 pub fn coercion_casts(&self) -> &ItemLocalSet {
653 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for TypeckTables<'tcx> {
654 fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
655 let ty::TypeckTables {
657 ref type_dependent_defs,
659 ref user_provided_types,
660 ref user_provided_sigs,
664 ref pat_binding_modes,
666 ref upvar_capture_map,
667 ref closure_kind_origins,
668 ref liberated_fn_sigs,
673 ref used_trait_imports,
675 ref concrete_opaque_types,
676 ref closure_captures,
677 ref generator_interior_types,
680 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
681 type_dependent_defs.hash_stable(hcx, hasher);
682 field_indices.hash_stable(hcx, hasher);
683 user_provided_types.hash_stable(hcx, hasher);
684 user_provided_sigs.hash_stable(hcx, hasher);
685 node_types.hash_stable(hcx, hasher);
686 node_substs.hash_stable(hcx, hasher);
687 adjustments.hash_stable(hcx, hasher);
688 pat_binding_modes.hash_stable(hcx, hasher);
689 pat_adjustments.hash_stable(hcx, hasher);
690 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
691 let ty::UpvarId { var_path, closure_expr_id } = *up_var_id;
693 assert_eq!(Some(var_path.hir_id.owner), hir_owner);
696 hcx.local_def_path_hash(var_path.hir_id.owner),
697 var_path.hir_id.local_id,
698 hcx.local_def_path_hash(closure_expr_id),
702 closure_kind_origins.hash_stable(hcx, hasher);
703 liberated_fn_sigs.hash_stable(hcx, hasher);
704 fru_field_types.hash_stable(hcx, hasher);
705 coercion_casts.hash_stable(hcx, hasher);
706 used_trait_imports.hash_stable(hcx, hasher);
707 tainted_by_errors.hash_stable(hcx, hasher);
708 concrete_opaque_types.hash_stable(hcx, hasher);
709 closure_captures.hash_stable(hcx, hasher);
710 generator_interior_types.hash_stable(hcx, hasher);
715 rustc_index::newtype_index! {
716 pub struct UserTypeAnnotationIndex {
718 DEBUG_FORMAT = "UserType({})",
719 const START_INDEX = 0,
723 /// Mapping of type annotation indices to canonical user type annotations.
724 pub type CanonicalUserTypeAnnotations<'tcx> =
725 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
727 #[derive(Clone, Debug, RustcEncodable, RustcDecodable, HashStable, TypeFoldable, Lift)]
728 pub struct CanonicalUserTypeAnnotation<'tcx> {
729 pub user_ty: CanonicalUserType<'tcx>,
731 pub inferred_ty: Ty<'tcx>,
734 /// Canonicalized user type annotation.
735 pub type CanonicalUserType<'tcx> = Canonical<'tcx, UserType<'tcx>>;
737 impl CanonicalUserType<'tcx> {
738 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
739 /// i.e., each thing is mapped to a canonical variable with the same index.
740 pub fn is_identity(&self) -> bool {
742 UserType::Ty(_) => false,
743 UserType::TypeOf(_, user_substs) => {
744 if user_substs.user_self_ty.is_some() {
748 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
749 match kind.unpack() {
750 GenericArgKind::Type(ty) => match ty.kind {
751 ty::Bound(debruijn, b) => {
752 // We only allow a `ty::INNERMOST` index in substitutions.
753 assert_eq!(debruijn, ty::INNERMOST);
759 GenericArgKind::Lifetime(r) => match r {
760 ty::ReLateBound(debruijn, br) => {
761 // We only allow a `ty::INNERMOST` index in substitutions.
762 assert_eq!(*debruijn, ty::INNERMOST);
763 cvar == br.assert_bound_var()
768 GenericArgKind::Const(ct) => match ct.val {
769 ty::ConstKind::Bound(debruijn, b) => {
770 // We only allow a `ty::INNERMOST` index in substitutions.
771 assert_eq!(debruijn, ty::INNERMOST);
783 /// A user-given type annotation attached to a constant. These arise
784 /// from constants that are named via paths, like `Foo::<A>::new` and
786 #[derive(Copy, Clone, Debug, PartialEq, RustcEncodable, RustcDecodable)]
787 #[derive(HashStable, TypeFoldable, Lift)]
788 pub enum UserType<'tcx> {
791 /// The canonical type is the result of `type_of(def_id)` with the
792 /// given substitutions applied.
793 TypeOf(DefId, UserSubsts<'tcx>),
796 impl<'tcx> CommonTypes<'tcx> {
797 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
798 let mk = |ty| interners.intern_ty(ty);
801 unit: mk(Tuple(List::empty())),
805 isize: mk(Int(ast::IntTy::Isize)),
806 i8: mk(Int(ast::IntTy::I8)),
807 i16: mk(Int(ast::IntTy::I16)),
808 i32: mk(Int(ast::IntTy::I32)),
809 i64: mk(Int(ast::IntTy::I64)),
810 i128: mk(Int(ast::IntTy::I128)),
811 usize: mk(Uint(ast::UintTy::Usize)),
812 u8: mk(Uint(ast::UintTy::U8)),
813 u16: mk(Uint(ast::UintTy::U16)),
814 u32: mk(Uint(ast::UintTy::U32)),
815 u64: mk(Uint(ast::UintTy::U64)),
816 u128: mk(Uint(ast::UintTy::U128)),
817 f32: mk(Float(ast::FloatTy::F32)),
818 f64: mk(Float(ast::FloatTy::F64)),
819 self_param: mk(ty::Param(ty::ParamTy { index: 0, name: kw::SelfUpper })),
821 trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
826 impl<'tcx> CommonLifetimes<'tcx> {
827 fn new(interners: &CtxtInterners<'tcx>) -> CommonLifetimes<'tcx> {
828 let mk = |r| interners.region.intern(r, |r| Interned(interners.arena.alloc(r))).0;
831 re_root_empty: mk(RegionKind::ReEmpty(ty::UniverseIndex::ROOT)),
832 re_static: mk(RegionKind::ReStatic),
833 re_erased: mk(RegionKind::ReErased),
838 impl<'tcx> CommonConsts<'tcx> {
839 fn new(interners: &CtxtInterners<'tcx>, types: &CommonTypes<'tcx>) -> CommonConsts<'tcx> {
840 let mk_const = |c| interners.const_.intern(c, |c| Interned(interners.arena.alloc(c))).0;
843 unit: mk_const(ty::Const {
844 val: ty::ConstKind::Value(ConstValue::Scalar(Scalar::zst())),
851 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
854 pub struct FreeRegionInfo {
855 // def id corresponding to FreeRegion
857 // the bound region corresponding to FreeRegion
858 pub boundregion: ty::BoundRegion,
859 // checks if bound region is in Impl Item
860 pub is_impl_item: bool,
863 /// The central data structure of the compiler. It stores references
864 /// to the various **arenas** and also houses the results of the
865 /// various **compiler queries** that have been performed. See the
866 /// [rustc dev guide] for more details.
868 /// [rustc dev guide]: https://rustc-dev-guide.rust-lang.org/ty.html
869 #[derive(Copy, Clone)]
870 #[rustc_diagnostic_item = "TyCtxt"]
871 pub struct TyCtxt<'tcx> {
872 gcx: &'tcx GlobalCtxt<'tcx>,
875 impl<'tcx> Deref for TyCtxt<'tcx> {
876 type Target = &'tcx GlobalCtxt<'tcx>;
878 fn deref(&self) -> &Self::Target {
883 pub struct GlobalCtxt<'tcx> {
884 pub arena: &'tcx WorkerLocal<Arena<'tcx>>,
886 interners: CtxtInterners<'tcx>,
888 pub(crate) cstore: Box<CrateStoreDyn>,
890 pub sess: &'tcx Session,
892 /// This only ever stores a `LintStore` but we don't want a dependency on that type here.
894 /// FIXME(Centril): consider `dyn LintStoreMarker` once
895 /// we can upcast to `Any` for some additional type safety.
896 pub lint_store: Lrc<dyn Any + sync::Sync + sync::Send>,
898 pub dep_graph: DepGraph,
900 pub prof: SelfProfilerRef,
902 /// Common types, pre-interned for your convenience.
903 pub types: CommonTypes<'tcx>,
905 /// Common lifetimes, pre-interned for your convenience.
906 pub lifetimes: CommonLifetimes<'tcx>,
908 /// Common consts, pre-interned for your convenience.
909 pub consts: CommonConsts<'tcx>,
911 /// Resolutions of `extern crate` items produced by resolver.
912 extern_crate_map: FxHashMap<LocalDefId, CrateNum>,
914 /// Map indicating what traits are in scope for places where this
915 /// is relevant; generated by resolve.
916 trait_map: FxHashMap<LocalDefId, FxHashMap<ItemLocalId, StableVec<TraitCandidate>>>,
918 /// Export map produced by name resolution.
919 export_map: ExportMap<LocalDefId>,
921 pub(crate) untracked_crate: &'tcx hir::Crate<'tcx>,
922 pub(crate) definitions: &'tcx Definitions,
924 /// A map from `DefPathHash` -> `DefId`. Includes `DefId`s from the local crate
925 /// as well as all upstream crates. Only populated in incremental mode.
926 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
928 pub queries: query::Queries<'tcx>,
930 maybe_unused_trait_imports: FxHashSet<LocalDefId>,
931 maybe_unused_extern_crates: Vec<(LocalDefId, Span)>,
932 /// A map of glob use to a set of names it actually imports. Currently only
933 /// used in save-analysis.
934 glob_map: FxHashMap<LocalDefId, FxHashSet<Symbol>>,
935 /// Extern prelude entries. The value is `true` if the entry was introduced
936 /// via `extern crate` item and not `--extern` option or compiler built-in.
937 pub extern_prelude: FxHashMap<Symbol, bool>,
939 // Internal cache for metadata decoding. No need to track deps on this.
940 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
942 /// Caches the results of trait selection. This cache is used
943 /// for things that do not have to do with the parameters in scope.
944 pub selection_cache: traits::SelectionCache<'tcx>,
946 /// Caches the results of trait evaluation. This cache is used
947 /// for things that do not have to do with the parameters in scope.
948 /// Merge this with `selection_cache`?
949 pub evaluation_cache: traits::EvaluationCache<'tcx>,
951 /// The definite name of the current crate after taking into account
952 /// attributes, commandline parameters, etc.
953 pub crate_name: Symbol,
955 /// Data layout specification for the current target.
956 pub data_layout: TargetDataLayout,
958 /// `#[stable]` and `#[unstable]` attributes
959 stability_interner: ShardedHashMap<&'tcx attr::Stability, ()>,
961 /// `#[rustc_const_stable]` and `#[rustc_const_unstable]` attributes
962 const_stability_interner: ShardedHashMap<&'tcx attr::ConstStability, ()>,
964 /// Stores the value of constants (and deduplicates the actual memory)
965 allocation_interner: ShardedHashMap<&'tcx Allocation, ()>,
967 /// Stores memory for globals (statics/consts).
968 pub(crate) alloc_map: Lock<interpret::AllocMap<'tcx>>,
970 layout_interner: ShardedHashMap<&'tcx Layout, ()>,
972 output_filenames: Arc<OutputFilenames>,
975 impl<'tcx> TyCtxt<'tcx> {
976 pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> Steal<Body<'tcx>> {
980 pub fn alloc_steal_promoted(
982 promoted: IndexVec<Promoted, Body<'tcx>>,
983 ) -> Steal<IndexVec<Promoted, Body<'tcx>>> {
987 pub fn alloc_adt_def(
991 variants: IndexVec<VariantIdx, ty::VariantDef>,
993 ) -> &'tcx ty::AdtDef {
994 self.arena.alloc(ty::AdtDef::new(self, did, kind, variants, repr))
997 pub fn intern_const_alloc(self, alloc: Allocation) -> &'tcx Allocation {
998 self.allocation_interner.intern(alloc, |alloc| self.arena.alloc(alloc))
1001 /// Allocates a read-only byte or string literal for `mir::interpret`.
1002 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1003 // Create an allocation that just contains these bytes.
1004 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1005 let alloc = self.intern_const_alloc(alloc);
1006 self.create_memory_alloc(alloc)
1009 pub fn intern_stability(self, stab: attr::Stability) -> &'tcx attr::Stability {
1010 self.stability_interner.intern(stab, |stab| self.arena.alloc(stab))
1013 pub fn intern_const_stability(self, stab: attr::ConstStability) -> &'tcx attr::ConstStability {
1014 self.const_stability_interner.intern(stab, |stab| self.arena.alloc(stab))
1017 pub fn intern_layout(self, layout: Layout) -> &'tcx Layout {
1018 self.layout_interner.intern(layout, |layout| self.arena.alloc(layout))
1021 /// Returns a range of the start/end indices specified with the
1022 /// `rustc_layout_scalar_valid_range` attribute.
1023 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1024 let attrs = self.get_attrs(def_id);
1026 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1028 None => return Bound::Unbounded,
1030 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1031 match meta.literal().expect("attribute takes lit").kind {
1032 ast::LitKind::Int(a, _) => return Bound::Included(a),
1033 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1036 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1039 get(sym::rustc_layout_scalar_valid_range_start),
1040 get(sym::rustc_layout_scalar_valid_range_end),
1044 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1045 value.lift_to_tcx(self)
1048 /// Creates a type context and call the closure with a `TyCtxt` reference
1049 /// to the context. The closure enforces that the type context and any interned
1050 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1051 /// reference to the context, to allow formatting values that need it.
1052 pub fn create_global_ctxt(
1054 lint_store: Lrc<dyn Any + sync::Send + sync::Sync>,
1055 local_providers: ty::query::Providers<'tcx>,
1056 extern_providers: ty::query::Providers<'tcx>,
1057 arena: &'tcx WorkerLocal<Arena<'tcx>>,
1058 resolutions: ty::ResolverOutputs,
1059 krate: &'tcx hir::Crate<'tcx>,
1060 definitions: &'tcx Definitions,
1061 dep_graph: DepGraph,
1062 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1064 output_filenames: &OutputFilenames,
1065 ) -> GlobalCtxt<'tcx> {
1066 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1069 let interners = CtxtInterners::new(arena);
1070 let common_types = CommonTypes::new(&interners);
1071 let common_lifetimes = CommonLifetimes::new(&interners);
1072 let common_consts = CommonConsts::new(&interners, &common_types);
1073 let cstore = resolutions.cstore;
1074 let crates = cstore.crates_untracked();
1075 let max_cnum = crates.iter().map(|c| c.as_usize()).max().unwrap_or(0);
1076 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1077 providers[LOCAL_CRATE] = local_providers;
1079 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1080 let def_path_tables = crates
1082 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1083 .chain(iter::once((LOCAL_CRATE, definitions.def_path_table())));
1085 // Precompute the capacity of the hashmap so we don't have to
1086 // re-allocate when populating it.
1087 let capacity = def_path_tables.clone().map(|(_, t)| t.size()).sum::<usize>();
1089 let mut map: FxHashMap<_, _> =
1090 FxHashMap::with_capacity_and_hasher(capacity, ::std::default::Default::default());
1092 for (cnum, def_path_table) in def_path_tables {
1093 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1101 let mut trait_map: FxHashMap<_, FxHashMap<_, _>> = FxHashMap::default();
1102 for (hir_id, v) in resolutions.trait_map.into_iter() {
1103 let map = trait_map.entry(hir_id.owner).or_default();
1104 map.insert(hir_id.local_id, StableVec::new(v));
1114 prof: s.prof.clone(),
1115 types: common_types,
1116 lifetimes: common_lifetimes,
1117 consts: common_consts,
1118 extern_crate_map: resolutions.extern_crate_map,
1120 export_map: resolutions.export_map,
1121 maybe_unused_trait_imports: resolutions.maybe_unused_trait_imports,
1122 maybe_unused_extern_crates: resolutions.maybe_unused_extern_crates,
1123 glob_map: resolutions.glob_map,
1124 extern_prelude: resolutions.extern_prelude,
1125 untracked_crate: krate,
1127 def_path_hash_to_def_id,
1128 queries: query::Queries::new(providers, extern_providers, on_disk_query_result_cache),
1129 rcache: Default::default(),
1130 selection_cache: Default::default(),
1131 evaluation_cache: Default::default(),
1132 crate_name: Symbol::intern(crate_name),
1134 layout_interner: Default::default(),
1135 stability_interner: Default::default(),
1136 const_stability_interner: Default::default(),
1137 allocation_interner: Default::default(),
1138 alloc_map: Lock::new(interpret::AllocMap::new()),
1139 output_filenames: Arc::new(output_filenames.clone()),
1143 /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` to ensure it gets used.
1145 pub fn ty_error(self) -> Ty<'tcx> {
1146 self.ty_error_with_message(DUMMY_SP, "TyKind::Error constructed but no error reported")
1149 /// Constructs a `TyKind::Error` type and registers a `delay_span_bug` with the given `msg to
1150 /// ensure it gets used.
1152 pub fn ty_error_with_message<S: Into<MultiSpan>>(self, span: S, msg: &str) -> Ty<'tcx> {
1153 self.sess.delay_span_bug(span, msg);
1154 self.mk_ty(Error(super::sty::DelaySpanBugEmitted(())))
1157 /// Like `err` but for constants.
1159 pub fn const_error(self, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
1161 .delay_span_bug(DUMMY_SP, "ty::ConstKind::Error constructed but no error reported.");
1162 self.mk_const(ty::Const {
1163 val: ty::ConstKind::Error(super::sty::DelaySpanBugEmitted(())),
1168 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1169 let cname = self.crate_name(LOCAL_CRATE).as_str();
1170 self.sess.consider_optimizing(&cname, msg)
1173 pub fn lib_features(self) -> &'tcx middle::lib_features::LibFeatures {
1174 self.get_lib_features(LOCAL_CRATE)
1177 /// Obtain all lang items of this crate and all dependencies (recursively)
1178 pub fn lang_items(self) -> &'tcx rustc_hir::lang_items::LanguageItems {
1179 self.get_lang_items(LOCAL_CRATE)
1182 /// Obtain the given diagnostic item's `DefId`. Use `is_diagnostic_item` if you just want to
1183 /// compare against another `DefId`, since `is_diagnostic_item` is cheaper.
1184 pub fn get_diagnostic_item(self, name: Symbol) -> Option<DefId> {
1185 self.all_diagnostic_items(LOCAL_CRATE).get(&name).copied()
1188 /// Check whether the diagnostic item with the given `name` has the given `DefId`.
1189 pub fn is_diagnostic_item(self, name: Symbol, did: DefId) -> bool {
1190 self.diagnostic_items(did.krate).get(&name) == Some(&did)
1193 pub fn stability(self) -> &'tcx stability::Index<'tcx> {
1194 self.stability_index(LOCAL_CRATE)
1197 pub fn crates(self) -> &'tcx [CrateNum] {
1198 self.all_crate_nums(LOCAL_CRATE)
1201 pub fn allocator_kind(self) -> Option<AllocatorKind> {
1202 self.cstore.allocator_kind()
1205 pub fn features(self) -> &'tcx rustc_feature::Features {
1206 self.features_query(LOCAL_CRATE)
1209 pub fn def_key(self, id: DefId) -> rustc_hir::definitions::DefKey {
1210 if let Some(id) = id.as_local() { self.hir().def_key(id) } else { self.cstore.def_key(id) }
1213 /// Converts a `DefId` into its fully expanded `DefPath` (every
1214 /// `DefId` is really just an interned `DefPath`).
1216 /// Note that if `id` is not local to this crate, the result will
1217 /// be a non-local `DefPath`.
1218 pub fn def_path(self, id: DefId) -> rustc_hir::definitions::DefPath {
1219 if let Some(id) = id.as_local() {
1220 self.hir().def_path(id)
1222 self.cstore.def_path(id)
1226 /// Returns whether or not the crate with CrateNum 'cnum'
1227 /// is marked as a private dependency
1228 pub fn is_private_dep(self, cnum: CrateNum) -> bool {
1229 if cnum == LOCAL_CRATE { false } else { self.cstore.crate_is_private_dep_untracked(cnum) }
1233 pub fn def_path_hash(self, def_id: DefId) -> rustc_hir::definitions::DefPathHash {
1234 if let Some(def_id) = def_id.as_local() {
1235 self.definitions.def_path_hash(def_id)
1237 self.cstore.def_path_hash(def_id)
1241 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1242 // We are explicitly not going through queries here in order to get
1243 // crate name and disambiguator since this code is called from debug!()
1244 // statements within the query system and we'd run into endless
1245 // recursion otherwise.
1246 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1247 (self.crate_name, self.sess.local_crate_disambiguator())
1250 self.cstore.crate_name_untracked(def_id.krate),
1251 self.cstore.crate_disambiguator_untracked(def_id.krate),
1258 // Don't print the whole crate disambiguator. That's just
1259 // annoying in debug output.
1260 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1261 self.def_path(def_id).to_string_no_crate()
1265 pub fn metadata_encoding_version(self) -> Vec<u8> {
1266 self.cstore.metadata_encoding_version().to_vec()
1269 pub fn encode_metadata(self) -> EncodedMetadata {
1270 let _prof_timer = self.prof.verbose_generic_activity("generate_crate_metadata");
1271 self.cstore.encode_metadata(self)
1274 // Note that this is *untracked* and should only be used within the query
1275 // system if the result is otherwise tracked through queries
1276 pub fn cstore_as_any(self) -> &'tcx dyn Any {
1277 self.cstore.as_any()
1281 pub fn create_stable_hashing_context(self) -> StableHashingContext<'tcx> {
1282 let krate = self.gcx.untracked_crate;
1284 StableHashingContext::new(self.sess, krate, self.definitions, &*self.cstore)
1287 // This method makes sure that we have a DepNode and a Fingerprint for
1288 // every upstream crate. It needs to be called once right after the tcx is
1290 // With full-fledged red/green, the method will probably become unnecessary
1291 // as this will be done on-demand.
1292 pub fn allocate_metadata_dep_nodes(self) {
1293 // We cannot use the query versions of crates() and crate_hash(), since
1294 // those would need the DepNodes that we are allocating here.
1295 for cnum in self.cstore.crates_untracked() {
1296 let dep_node = DepConstructor::CrateMetadata(self, cnum);
1297 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1298 self.dep_graph.with_task(
1302 |_, x| x, // No transformation needed
1303 dep_graph::hash_result,
1308 pub fn serialize_query_result_cache<E>(self, encoder: &mut E) -> Result<(), E::Error>
1310 E: ty::codec::TyEncoder,
1312 self.queries.on_disk_cache.serialize(self, encoder)
1315 /// If `true`, we should use the MIR-based borrowck, but also
1316 /// fall back on the AST borrowck if the MIR-based one errors.
1317 pub fn migrate_borrowck(self) -> bool {
1318 self.borrowck_mode().migrate()
1321 /// What mode(s) of borrowck should we run? AST? MIR? both?
1322 /// (Also considers the `#![feature(nll)]` setting.)
1323 pub fn borrowck_mode(self) -> BorrowckMode {
1324 // Here are the main constraints we need to deal with:
1326 // 1. An opts.borrowck_mode of `BorrowckMode::Migrate` is
1327 // synonymous with no `-Z borrowck=...` flag at all.
1329 // 2. We want to allow developers on the Nightly channel
1330 // to opt back into the "hard error" mode for NLL,
1331 // (which they can do via specifying `#![feature(nll)]`
1332 // explicitly in their crate).
1334 // So, this precedence list is how pnkfelix chose to work with
1335 // the above constraints:
1337 // * `#![feature(nll)]` *always* means use NLL with hard
1338 // errors. (To simplify the code here, it now even overrides
1339 // a user's attempt to specify `-Z borrowck=compare`, which
1340 // we arguably do not need anymore and should remove.)
1342 // * Otherwise, if no `-Z borrowck=...` then use migrate mode
1344 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1346 if self.features().nll {
1347 return BorrowckMode::Mir;
1350 self.sess.opts.borrowck_mode
1353 /// If `true`, we should use lazy normalization for constants, otherwise
1354 /// we still evaluate them eagerly.
1356 pub fn lazy_normalization(self) -> bool {
1357 self.features().const_generics
1361 pub fn local_crate_exports_generics(self) -> bool {
1362 debug_assert!(self.sess.opts.share_generics());
1364 self.sess.crate_types().iter().any(|crate_type| {
1366 CrateType::Executable
1367 | CrateType::Staticlib
1368 | CrateType::ProcMacro
1369 | CrateType::Cdylib => false,
1371 // FIXME rust-lang/rust#64319, rust-lang/rust#64872:
1372 // We want to block export of generics from dylibs,
1373 // but we must fix rust-lang/rust#65890 before we can
1374 // do that robustly.
1375 CrateType::Dylib => true,
1377 CrateType::Rlib => true,
1382 // Returns the `DefId` and the `BoundRegion` corresponding to the given region.
1383 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1384 let (suitable_region_binding_scope, bound_region) = match *region {
1385 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1386 ty::ReEarlyBound(ref ebr) => {
1387 (self.parent(ebr.def_id).unwrap(), ty::BoundRegion::BrNamed(ebr.def_id, ebr.name))
1389 _ => return None, // not a free region
1392 let hir_id = self.hir().as_local_hir_id(suitable_region_binding_scope.expect_local());
1393 let is_impl_item = match self.hir().find(hir_id) {
1394 Some(Node::Item(..) | Node::TraitItem(..)) => false,
1395 Some(Node::ImplItem(..)) => {
1396 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1401 Some(FreeRegionInfo {
1402 def_id: suitable_region_binding_scope,
1403 boundregion: bound_region,
1408 pub fn return_type_impl_or_dyn_trait(
1410 scope_def_id: DefId,
1411 ) -> Option<&'tcx hir::Ty<'tcx>> {
1412 let hir_id = self.hir().as_local_hir_id(scope_def_id.expect_local());
1413 let hir_output = match self.hir().get(hir_id) {
1414 Node::Item(hir::Item {
1418 decl: hir::FnDecl { output: hir::FnRetTy::Return(ty), .. },
1425 | Node::ImplItem(hir::ImplItem {
1427 hir::ImplItemKind::Fn(
1429 decl: hir::FnDecl { output: hir::FnRetTy::Return(ty), .. },
1436 | Node::TraitItem(hir::TraitItem {
1438 hir::TraitItemKind::Fn(
1440 decl: hir::FnDecl { output: hir::FnRetTy::Return(ty), .. },
1450 let ret_ty = self.type_of(scope_def_id);
1452 ty::FnDef(_, _) => {
1453 let sig = ret_ty.fn_sig(*self);
1454 let output = self.erase_late_bound_regions(&sig.output());
1455 if output.is_impl_trait() {
1456 let fn_decl = self.hir().fn_decl_by_hir_id(hir_id).unwrap();
1457 if let hir::FnRetTy::Return(ty) = fn_decl.output {
1461 let mut v = TraitObjectVisitor(vec![]);
1462 rustc_hir::intravisit::walk_ty(&mut v, hir_output);
1464 return Some(v.0[0]);
1473 pub fn return_type_impl_trait(&self, scope_def_id: DefId) -> Option<(Ty<'tcx>, Span)> {
1474 // HACK: `type_of_def_id()` will fail on these (#55796), so return `None`.
1475 let hir_id = self.hir().as_local_hir_id(scope_def_id.expect_local());
1476 match self.hir().get(hir_id) {
1477 Node::Item(item) => {
1479 ItemKind::Fn(..) => { /* `type_of_def_id()` will work */ }
1485 _ => { /* `type_of_def_id()` will work or panic */ }
1488 let ret_ty = self.type_of(scope_def_id);
1490 ty::FnDef(_, _) => {
1491 let sig = ret_ty.fn_sig(*self);
1492 let output = self.erase_late_bound_regions(&sig.output());
1493 if output.is_impl_trait() {
1494 let fn_decl = self.hir().fn_decl_by_hir_id(hir_id).unwrap();
1495 Some((output, fn_decl.output.span()))
1504 // Checks if the bound region is in Impl Item.
1505 pub fn is_bound_region_in_impl_item(&self, suitable_region_binding_scope: DefId) -> bool {
1506 let container_id = self.associated_item(suitable_region_binding_scope).container.id();
1507 if self.impl_trait_ref(container_id).is_some() {
1508 // For now, we do not try to target impls of traits. This is
1509 // because this message is going to suggest that the user
1510 // change the fn signature, but they may not be free to do so,
1511 // since the signature must match the trait.
1513 // FIXME(#42706) -- in some cases, we could do better here.
1519 /// Determines whether identifiers in the assembly have strict naming rules.
1520 /// Currently, only NVPTX* targets need it.
1521 pub fn has_strict_asm_symbol_naming(&self) -> bool {
1522 self.sess.target.target.arch.contains("nvptx")
1525 /// Returns `&'static core::panic::Location<'static>`.
1526 pub fn caller_location_ty(&self) -> Ty<'tcx> {
1528 self.lifetimes.re_static,
1529 self.type_of(self.require_lang_item(PanicLocationLangItem, None))
1530 .subst(*self, self.mk_substs([self.lifetimes.re_static.into()].iter())),
1534 /// Returns a displayable description and article for the given `def_id` (e.g. `("a", "struct")`).
1535 pub fn article_and_description(&self, def_id: DefId) -> (&'static str, &'static str) {
1536 match self.def_kind(def_id) {
1537 DefKind::Generator => match self.generator_kind(def_id).unwrap() {
1538 rustc_hir::GeneratorKind::Async(..) => ("an", "async closure"),
1539 rustc_hir::GeneratorKind::Gen => ("a", "generator"),
1541 def_kind => (def_kind.article(), def_kind.descr(def_id)),
1546 impl<'tcx> GlobalCtxt<'tcx> {
1547 /// Calls the closure with a local `TyCtxt` using the given arena.
1548 /// `interners` is a slot passed so we can create a CtxtInterners
1549 /// with the same lifetime as `arena`.
1550 pub fn enter_local<F, R>(&'tcx self, f: F) -> R
1552 F: FnOnce(TyCtxt<'tcx>) -> R,
1554 let tcx = TyCtxt { gcx: self };
1555 ty::tls::with_related_context(tcx, |icx| {
1556 let new_icx = ty::tls::ImplicitCtxt {
1559 diagnostics: icx.diagnostics,
1560 layout_depth: icx.layout_depth,
1561 task_deps: icx.task_deps,
1563 ty::tls::enter_context(&new_icx, |_| f(tcx))
1568 /// A trait implemented for all `X<'a>` types that can be safely and
1569 /// efficiently converted to `X<'tcx>` as long as they are part of the
1570 /// provided `TyCtxt<'tcx>`.
1571 /// This can be done, for example, for `Ty<'tcx>` or `SubstsRef<'tcx>`
1572 /// by looking them up in their respective interners.
1574 /// However, this is still not the best implementation as it does
1575 /// need to compare the components, even for interned values.
1576 /// It would be more efficient if `TypedArena` provided a way to
1577 /// determine whether the address is in the allocated range.
1579 /// `None` is returned if the value or one of the components is not part
1580 /// of the provided context.
1581 /// For `Ty`, `None` can be returned if either the type interner doesn't
1582 /// contain the `TyKind` key or if the address of the interned
1583 /// pointer differs. The latter case is possible if a primitive type,
1584 /// e.g., `()` or `u8`, was interned in a different context.
1585 pub trait Lift<'tcx>: fmt::Debug {
1586 type Lifted: fmt::Debug + 'tcx;
1587 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>;
1590 macro_rules! nop_lift {
1591 ($set:ident; $ty:ty => $lifted:ty) => {
1592 impl<'a, 'tcx> Lift<'tcx> for $ty {
1593 type Lifted = $lifted;
1594 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1595 if tcx.interners.$set.contains_pointer_to(&Interned(*self)) {
1596 Some(unsafe { mem::transmute(*self) })
1605 macro_rules! nop_list_lift {
1606 ($set:ident; $ty:ty => $lifted:ty) => {
1607 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1608 type Lifted = &'tcx List<$lifted>;
1609 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1610 if self.is_empty() {
1611 return Some(List::empty());
1613 if tcx.interners.$set.contains_pointer_to(&Interned(*self)) {
1614 Some(unsafe { mem::transmute(*self) })
1623 nop_lift! {type_; Ty<'a> => Ty<'tcx>}
1624 nop_lift! {region; Region<'a> => Region<'tcx>}
1625 nop_lift! {const_; &'a Const<'a> => &'tcx Const<'tcx>}
1626 nop_lift! {predicate_kind; &'a PredicateKind<'a> => &'tcx PredicateKind<'tcx>}
1628 nop_list_lift! {type_list; Ty<'a> => Ty<'tcx>}
1629 nop_list_lift! {existential_predicates; ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1630 nop_list_lift! {predicates; Predicate<'a> => Predicate<'tcx>}
1631 nop_list_lift! {canonical_var_infos; CanonicalVarInfo => CanonicalVarInfo}
1632 nop_list_lift! {projs; ProjectionKind => ProjectionKind}
1634 // This is the impl for `&'a InternalSubsts<'a>`.
1635 nop_list_lift! {substs; GenericArg<'a> => GenericArg<'tcx>}
1638 use super::{ptr_eq, GlobalCtxt, TyCtxt};
1640 use crate::dep_graph::{DepKind, TaskDeps};
1641 use crate::ty::query;
1642 use rustc_data_structures::sync::{self, Lock};
1643 use rustc_data_structures::thin_vec::ThinVec;
1644 use rustc_data_structures::OnDrop;
1645 use rustc_errors::Diagnostic;
1648 #[cfg(not(parallel_compiler))]
1649 use std::cell::Cell;
1651 #[cfg(parallel_compiler)]
1652 use rustc_rayon_core as rayon_core;
1654 /// This is the implicit state of rustc. It contains the current
1655 /// `TyCtxt` and query. It is updated when creating a local interner or
1656 /// executing a new query. Whenever there's a `TyCtxt` value available
1657 /// you should also have access to an `ImplicitCtxt` through the functions
1660 pub struct ImplicitCtxt<'a, 'tcx> {
1661 /// The current `TyCtxt`. Initially created by `enter_global` and updated
1662 /// by `enter_local` with a new local interner.
1663 pub tcx: TyCtxt<'tcx>,
1665 /// The current query job, if any. This is updated by `JobOwner::start` in
1666 /// `ty::query::plumbing` when executing a query.
1667 pub query: Option<query::QueryJobId<DepKind>>,
1669 /// Where to store diagnostics for the current query job, if any.
1670 /// This is updated by `JobOwner::start` in `ty::query::plumbing` when executing a query.
1671 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1673 /// Used to prevent layout from recursing too deeply.
1674 pub layout_depth: usize,
1676 /// The current dep graph task. This is used to add dependencies to queries
1677 /// when executing them.
1678 pub task_deps: Option<&'a Lock<TaskDeps>>,
1681 /// Sets Rayon's thread-local variable, which is preserved for Rayon jobs
1682 /// to `value` during the call to `f`. It is restored to its previous value after.
1683 /// This is used to set the pointer to the new `ImplicitCtxt`.
1684 #[cfg(parallel_compiler)]
1686 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1687 rayon_core::tlv::with(value, f)
1690 /// Gets Rayon's thread-local variable, which is preserved for Rayon jobs.
1691 /// This is used to get the pointer to the current `ImplicitCtxt`.
1692 #[cfg(parallel_compiler)]
1694 fn get_tlv() -> usize {
1695 rayon_core::tlv::get()
1698 #[cfg(not(parallel_compiler))]
1700 /// A thread local variable that stores a pointer to the current `ImplicitCtxt`.
1701 static TLV: Cell<usize> = Cell::new(0);
1704 /// Sets TLV to `value` during the call to `f`.
1705 /// It is restored to its previous value after.
1706 /// This is used to set the pointer to the new `ImplicitCtxt`.
1707 #[cfg(not(parallel_compiler))]
1709 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1710 let old = get_tlv();
1711 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1712 TLV.with(|tlv| tlv.set(value));
1716 /// Gets the pointer to the current `ImplicitCtxt`.
1717 #[cfg(not(parallel_compiler))]
1719 fn get_tlv() -> usize {
1720 TLV.with(|tlv| tlv.get())
1723 /// Sets `context` as the new current `ImplicitCtxt` for the duration of the function `f`.
1725 pub fn enter_context<'a, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'tcx>, f: F) -> R
1727 F: FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1729 set_tlv(context as *const _ as usize, || f(&context))
1732 /// Enters `GlobalCtxt` by setting up librustc_ast callbacks and
1733 /// creating a initial `TyCtxt` and `ImplicitCtxt`.
1734 /// This happens once per rustc session and `TyCtxt`s only exists
1735 /// inside the `f` function.
1736 pub fn enter_global<'tcx, F, R>(gcx: &'tcx GlobalCtxt<'tcx>, f: F) -> R
1738 F: FnOnce(TyCtxt<'tcx>) -> R,
1740 // Update `GCX_PTR` to indicate there's a `GlobalCtxt` available.
1741 GCX_PTR.with(|lock| {
1742 *lock.lock() = gcx as *const _ as usize;
1744 // Set `GCX_PTR` back to 0 when we exit.
1745 let _on_drop = OnDrop(move || {
1746 GCX_PTR.with(|lock| *lock.lock() = 0);
1749 let tcx = TyCtxt { gcx };
1751 ImplicitCtxt { tcx, query: None, diagnostics: None, layout_depth: 0, task_deps: None };
1752 enter_context(&icx, |_| f(tcx))
1755 scoped_thread_local! {
1756 /// Stores a pointer to the `GlobalCtxt` if one is available.
1757 /// This is used to access the `GlobalCtxt` in the deadlock handler given to Rayon.
1758 pub static GCX_PTR: Lock<usize>
1761 /// Creates a `TyCtxt` and `ImplicitCtxt` based on the `GCX_PTR` thread local.
1762 /// This is used in the deadlock handler.
1763 pub unsafe fn with_global<F, R>(f: F) -> R
1765 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
1767 let gcx = GCX_PTR.with(|lock| *lock.lock());
1769 let gcx = &*(gcx as *const GlobalCtxt<'_>);
1770 let tcx = TyCtxt { gcx };
1772 ImplicitCtxt { query: None, diagnostics: None, tcx, layout_depth: 0, task_deps: None };
1773 enter_context(&icx, |_| f(tcx))
1776 /// Allows access to the current `ImplicitCtxt` in a closure if one is available.
1778 pub fn with_context_opt<F, R>(f: F) -> R
1780 F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R,
1782 let context = get_tlv();
1786 // We could get a `ImplicitCtxt` pointer from another thread.
1787 // Ensure that `ImplicitCtxt` is `Sync`.
1788 sync::assert_sync::<ImplicitCtxt<'_, '_>>();
1790 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_>))) }
1794 /// Allows access to the current `ImplicitCtxt`.
1795 /// Panics if there is no `ImplicitCtxt` available.
1797 pub fn with_context<F, R>(f: F) -> R
1799 F: for<'a, 'tcx> FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1801 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
1804 /// Allows access to the current `ImplicitCtxt` whose tcx field has the same global
1805 /// interner as the tcx argument passed in. This means the closure is given an `ImplicitCtxt`
1806 /// with the same `'tcx` lifetime as the `TyCtxt` passed in.
1807 /// This will panic if you pass it a `TyCtxt` which has a different global interner from
1808 /// the current `ImplicitCtxt`'s `tcx` field.
1810 pub fn with_related_context<'tcx, F, R>(tcx: TyCtxt<'tcx>, f: F) -> R
1812 F: FnOnce(&ImplicitCtxt<'_, 'tcx>) -> R,
1814 with_context(|context| unsafe {
1815 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
1816 let context: &ImplicitCtxt<'_, '_> = mem::transmute(context);
1821 /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
1822 /// Panics if there is no `ImplicitCtxt` available.
1824 pub fn with<F, R>(f: F) -> R
1826 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
1828 with_context(|context| f(context.tcx))
1831 /// Allows access to the `TyCtxt` in the current `ImplicitCtxt`.
1832 /// The closure is passed None if there is no `ImplicitCtxt` available.
1834 pub fn with_opt<F, R>(f: F) -> R
1836 F: for<'tcx> FnOnce(Option<TyCtxt<'tcx>>) -> R,
1838 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
1842 macro_rules! sty_debug_print {
1843 ($ctxt: expr, $($variant: ident),*) => {{
1844 // Curious inner module to allow variant names to be used as
1846 #[allow(non_snake_case)]
1848 use crate::ty::{self, TyCtxt};
1849 use crate::ty::context::Interned;
1851 #[derive(Copy, Clone)]
1860 pub fn go(tcx: TyCtxt<'_>) {
1861 let mut total = DebugStat {
1868 $(let mut $variant = total;)*
1870 let shards = tcx.interners.type_.lock_shards();
1871 let types = shards.iter().flat_map(|shard| shard.keys());
1872 for &Interned(t) in types {
1873 let variant = match t.kind {
1874 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
1875 ty::Float(..) | ty::Str | ty::Never => continue,
1876 ty::Error(_) => /* unimportant */ continue,
1877 $(ty::$variant(..) => &mut $variant,)*
1879 let lt = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
1880 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
1881 let ct = t.flags.intersects(ty::TypeFlags::HAS_CT_INFER);
1885 if lt { total.lt_infer += 1; variant.lt_infer += 1 }
1886 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
1887 if ct { total.ct_infer += 1; variant.ct_infer += 1 }
1888 if lt && ty && ct { total.all_infer += 1; variant.all_infer += 1 }
1890 println!("Ty interner total ty lt ct all");
1891 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
1892 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
1893 stringify!($variant),
1894 uses = $variant.total,
1895 usespc = $variant.total as f64 * 100.0 / total.total as f64,
1896 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
1897 lt = $variant.lt_infer as f64 * 100.0 / total.total as f64,
1898 ct = $variant.ct_infer as f64 * 100.0 / total.total as f64,
1899 all = $variant.all_infer as f64 * 100.0 / total.total as f64);
1901 println!(" total {uses:6} \
1902 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
1904 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
1905 lt = total.lt_infer as f64 * 100.0 / total.total as f64,
1906 ct = total.ct_infer as f64 * 100.0 / total.total as f64,
1907 all = total.all_infer as f64 * 100.0 / total.total as f64)
1915 impl<'tcx> TyCtxt<'tcx> {
1916 pub fn print_debug_stats(self) {
1940 println!("InternalSubsts interner: #{}", self.interners.substs.len());
1941 println!("Region interner: #{}", self.interners.region.len());
1942 println!("Stability interner: #{}", self.stability_interner.len());
1943 println!("Const Stability interner: #{}", self.const_stability_interner.len());
1944 println!("Allocation interner: #{}", self.allocation_interner.len());
1945 println!("Layout interner: #{}", self.layout_interner.len());
1949 /// An entry in an interner.
1950 struct Interned<'tcx, T: ?Sized>(&'tcx T);
1952 impl<'tcx, T: 'tcx + ?Sized> Clone for Interned<'tcx, T> {
1953 fn clone(&self) -> Self {
1957 impl<'tcx, T: 'tcx + ?Sized> Copy for Interned<'tcx, T> {}
1959 impl<'tcx, T: 'tcx + ?Sized> IntoPointer for Interned<'tcx, T> {
1960 fn into_pointer(&self) -> *const () {
1961 self.0 as *const _ as *const ()
1964 // N.B., an `Interned<Ty>` compares and hashes as a `TyKind`.
1965 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
1966 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
1967 self.0.kind == other.0.kind
1971 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
1973 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
1974 fn hash<H: Hasher>(&self, s: &mut H) {
1979 #[allow(rustc::usage_of_ty_tykind)]
1980 impl<'tcx> Borrow<TyKind<'tcx>> for Interned<'tcx, TyS<'tcx>> {
1981 fn borrow<'a>(&'a self) -> &'a TyKind<'tcx> {
1986 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
1987 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
1988 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
1989 self.0[..] == other.0[..]
1993 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
1995 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
1996 fn hash<H: Hasher>(&self, s: &mut H) {
2001 impl<'tcx, T> Borrow<[T]> for Interned<'tcx, List<T>> {
2002 fn borrow<'a>(&'a self) -> &'a [T] {
2007 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2008 fn borrow(&self) -> &RegionKind {
2013 impl<'tcx> Borrow<Const<'tcx>> for Interned<'tcx, Const<'tcx>> {
2014 fn borrow<'a>(&'a self) -> &'a Const<'tcx> {
2019 impl<'tcx> Borrow<PredicateKind<'tcx>> for Interned<'tcx, PredicateKind<'tcx>> {
2020 fn borrow<'a>(&'a self) -> &'a PredicateKind<'tcx> {
2025 macro_rules! direct_interners {
2026 ($($name:ident: $method:ident($ty:ty),)+) => {
2027 $(impl<'tcx> PartialEq for Interned<'tcx, $ty> {
2028 fn eq(&self, other: &Self) -> bool {
2033 impl<'tcx> Eq for Interned<'tcx, $ty> {}
2035 impl<'tcx> Hash for Interned<'tcx, $ty> {
2036 fn hash<H: Hasher>(&self, s: &mut H) {
2041 impl<'tcx> TyCtxt<'tcx> {
2042 pub fn $method(self, v: $ty) -> &'tcx $ty {
2043 self.interners.$name.intern_ref(&v, || {
2044 Interned(self.interners.arena.alloc(v))
2052 region: mk_region(RegionKind),
2053 const_: mk_const(Const<'tcx>),
2054 predicate_kind: intern_predicate_kind(PredicateKind<'tcx>),
2057 macro_rules! slice_interners {
2058 ($($field:ident: $method:ident($ty:ty)),+) => (
2059 $(impl<'tcx> TyCtxt<'tcx> {
2060 pub fn $method(self, v: &[$ty]) -> &'tcx List<$ty> {
2061 self.interners.$field.intern_ref(v, || {
2062 Interned(List::from_arena(&*self.arena, v))
2070 type_list: _intern_type_list(Ty<'tcx>),
2071 substs: _intern_substs(GenericArg<'tcx>),
2072 canonical_var_infos: _intern_canonical_var_infos(CanonicalVarInfo),
2073 existential_predicates: _intern_existential_predicates(ExistentialPredicate<'tcx>),
2074 predicates: _intern_predicates(Predicate<'tcx>),
2075 projs: _intern_projs(ProjectionKind),
2076 place_elems: _intern_place_elems(PlaceElem<'tcx>),
2077 chalk_environment_clause_list:
2078 _intern_chalk_environment_clause_list(traits::ChalkEnvironmentClause<'tcx>)
2081 impl<'tcx> TyCtxt<'tcx> {
2082 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2083 /// that is, a `fn` type that is equivalent in every way for being
2085 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2086 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2087 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig { unsafety: hir::Unsafety::Unsafe, ..sig }))
2090 /// Given a closure signature, returns an equivalent fn signature. Detuples
2091 /// and so forth -- so e.g., if we have a sig with `Fn<(u32, i32)>` then
2092 /// you would get a `fn(u32, i32)`.
2093 /// `unsafety` determines the unsafety of the fn signature. If you pass
2094 /// `hir::Unsafety::Unsafe` in the previous example, then you would get
2095 /// an `unsafe fn (u32, i32)`.
2096 /// It cannot convert a closure that requires unsafe.
2097 pub fn signature_unclosure(
2099 sig: PolyFnSig<'tcx>,
2100 unsafety: hir::Unsafety,
2101 ) -> PolyFnSig<'tcx> {
2103 let params_iter = match s.inputs()[0].kind {
2104 ty::Tuple(params) => params.into_iter().map(|k| k.expect_ty()),
2107 self.mk_fn_sig(params_iter, s.output(), s.c_variadic, unsafety, abi::Abi::Rust)
2111 #[allow(rustc::usage_of_ty_tykind)]
2113 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2114 self.interners.intern_ty(st)
2118 pub fn mk_predicate(&self, kind: PredicateKind<'tcx>) -> Predicate<'tcx> {
2119 let kind = self.intern_predicate_kind(kind);
2123 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2125 ast::IntTy::Isize => self.types.isize,
2126 ast::IntTy::I8 => self.types.i8,
2127 ast::IntTy::I16 => self.types.i16,
2128 ast::IntTy::I32 => self.types.i32,
2129 ast::IntTy::I64 => self.types.i64,
2130 ast::IntTy::I128 => self.types.i128,
2134 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2136 ast::UintTy::Usize => self.types.usize,
2137 ast::UintTy::U8 => self.types.u8,
2138 ast::UintTy::U16 => self.types.u16,
2139 ast::UintTy::U32 => self.types.u32,
2140 ast::UintTy::U64 => self.types.u64,
2141 ast::UintTy::U128 => self.types.u128,
2145 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2147 ast::FloatTy::F32 => self.types.f32,
2148 ast::FloatTy::F64 => self.types.f64,
2153 pub fn mk_str(self) -> Ty<'tcx> {
2158 pub fn mk_static_str(self) -> Ty<'tcx> {
2159 self.mk_imm_ref(self.lifetimes.re_static, self.mk_str())
2163 pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2164 // Take a copy of substs so that we own the vectors inside.
2165 self.mk_ty(Adt(def, substs))
2169 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2170 self.mk_ty(Foreign(def_id))
2173 fn mk_generic_adt(self, wrapper_def_id: DefId, ty_param: Ty<'tcx>) -> Ty<'tcx> {
2174 let adt_def = self.adt_def(wrapper_def_id);
2176 InternalSubsts::for_item(self, wrapper_def_id, |param, substs| match param.kind {
2177 GenericParamDefKind::Lifetime | GenericParamDefKind::Const => bug!(),
2178 GenericParamDefKind::Type { has_default, .. } => {
2179 if param.index == 0 {
2182 assert!(has_default);
2183 self.type_of(param.def_id).subst(self, substs).into()
2187 self.mk_ty(Adt(adt_def, substs))
2191 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2192 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem, None);
2193 self.mk_generic_adt(def_id, ty)
2197 pub fn mk_lang_item(self, ty: Ty<'tcx>, item: lang_items::LangItem) -> Option<Ty<'tcx>> {
2198 let def_id = self.lang_items().require(item).ok()?;
2199 Some(self.mk_generic_adt(def_id, ty))
2203 pub fn mk_diagnostic_item(self, ty: Ty<'tcx>, name: Symbol) -> Option<Ty<'tcx>> {
2204 let def_id = self.get_diagnostic_item(name)?;
2205 Some(self.mk_generic_adt(def_id, ty))
2209 pub fn mk_maybe_uninit(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2210 let def_id = self.require_lang_item(lang_items::MaybeUninitLangItem, None);
2211 self.mk_generic_adt(def_id, ty)
2215 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2216 self.mk_ty(RawPtr(tm))
2220 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2221 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2225 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2226 self.mk_ref(r, TypeAndMut { ty, mutbl: hir::Mutability::Mut })
2230 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2231 self.mk_ref(r, TypeAndMut { ty, mutbl: hir::Mutability::Not })
2235 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2236 self.mk_ptr(TypeAndMut { ty, mutbl: hir::Mutability::Mut })
2240 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2241 self.mk_ptr(TypeAndMut { ty, mutbl: hir::Mutability::Not })
2245 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2246 self.mk_imm_ptr(self.mk_unit())
2250 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2251 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2255 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2256 self.mk_ty(Slice(ty))
2260 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2261 let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect();
2262 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2265 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2266 iter.intern_with(|ts| {
2267 let kinds: Vec<_> = ts.iter().map(|&t| GenericArg::from(t)).collect();
2268 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2273 pub fn mk_unit(self) -> Ty<'tcx> {
2278 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2279 if self.features().never_type_fallback { self.types.never } else { self.types.unit }
2283 pub fn mk_fn_def(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2284 self.mk_ty(FnDef(def_id, substs))
2288 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2289 self.mk_ty(FnPtr(fty))
2295 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2296 reg: ty::Region<'tcx>,
2298 self.mk_ty(Dynamic(obj, reg))
2302 pub fn mk_projection(self, item_def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2303 self.mk_ty(Projection(ProjectionTy { item_def_id, substs }))
2307 pub fn mk_closure(self, closure_id: DefId, closure_substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2308 self.mk_ty(Closure(closure_id, closure_substs))
2312 pub fn mk_generator(
2315 generator_substs: SubstsRef<'tcx>,
2316 movability: hir::Movability,
2318 self.mk_ty(Generator(id, generator_substs, movability))
2322 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2323 self.mk_ty(GeneratorWitness(types))
2327 pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> {
2328 self.mk_ty_infer(TyVar(v))
2332 pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2333 self.mk_const(ty::Const { val: ty::ConstKind::Infer(InferConst::Var(v)), ty })
2337 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2338 self.mk_ty_infer(IntVar(v))
2342 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2343 self.mk_ty_infer(FloatVar(v))
2347 pub fn mk_ty_infer(self, it: InferTy) -> Ty<'tcx> {
2348 self.mk_ty(Infer(it))
2352 pub fn mk_const_infer(self, ic: InferConst<'tcx>, ty: Ty<'tcx>) -> &'tcx ty::Const<'tcx> {
2353 self.mk_const(ty::Const { val: ty::ConstKind::Infer(ic), ty })
2357 pub fn mk_ty_param(self, index: u32, name: Symbol) -> Ty<'tcx> {
2358 self.mk_ty(Param(ParamTy { index, name }))
2362 pub fn mk_const_param(self, index: u32, name: Symbol, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2363 self.mk_const(ty::Const { val: ty::ConstKind::Param(ParamConst { index, name }), ty })
2366 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> GenericArg<'tcx> {
2368 GenericParamDefKind::Lifetime => {
2369 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2371 GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
2372 GenericParamDefKind::Const => {
2373 self.mk_const_param(param.index, param.name, self.type_of(param.def_id)).into()
2379 pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2380 self.mk_ty(Opaque(def_id, substs))
2383 pub fn mk_place_field(self, place: Place<'tcx>, f: Field, ty: Ty<'tcx>) -> Place<'tcx> {
2384 self.mk_place_elem(place, PlaceElem::Field(f, ty))
2387 pub fn mk_place_deref(self, place: Place<'tcx>) -> Place<'tcx> {
2388 self.mk_place_elem(place, PlaceElem::Deref)
2391 pub fn mk_place_downcast(
2394 adt_def: &'tcx AdtDef,
2395 variant_index: VariantIdx,
2399 PlaceElem::Downcast(Some(adt_def.variants[variant_index].ident.name), variant_index),
2403 pub fn mk_place_downcast_unnamed(
2406 variant_index: VariantIdx,
2408 self.mk_place_elem(place, PlaceElem::Downcast(None, variant_index))
2411 pub fn mk_place_index(self, place: Place<'tcx>, index: Local) -> Place<'tcx> {
2412 self.mk_place_elem(place, PlaceElem::Index(index))
2415 /// This method copies `Place`'s projection, add an element and reintern it. Should not be used
2416 /// to build a full `Place` it's just a convenient way to grab a projection and modify it in
2418 pub fn mk_place_elem(self, place: Place<'tcx>, elem: PlaceElem<'tcx>) -> Place<'tcx> {
2419 let mut projection = place.projection.to_vec();
2420 projection.push(elem);
2422 Place { local: place.local, projection: self.intern_place_elems(&projection) }
2425 pub fn intern_existential_predicates(
2427 eps: &[ExistentialPredicate<'tcx>],
2428 ) -> &'tcx List<ExistentialPredicate<'tcx>> {
2429 assert!(!eps.is_empty());
2430 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2431 self._intern_existential_predicates(eps)
2434 pub fn intern_predicates(self, preds: &[Predicate<'tcx>]) -> &'tcx List<Predicate<'tcx>> {
2435 // FIXME consider asking the input slice to be sorted to avoid
2436 // re-interning permutations, in which case that would be asserted
2438 if preds.is_empty() {
2439 // The macro-generated method below asserts we don't intern an empty slice.
2442 self._intern_predicates(preds)
2446 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2447 if ts.is_empty() { List::empty() } else { self._intern_type_list(ts) }
2450 pub fn intern_substs(self, ts: &[GenericArg<'tcx>]) -> &'tcx List<GenericArg<'tcx>> {
2451 if ts.is_empty() { List::empty() } else { self._intern_substs(ts) }
2454 pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
2455 if ps.is_empty() { List::empty() } else { self._intern_projs(ps) }
2458 pub fn intern_place_elems(self, ts: &[PlaceElem<'tcx>]) -> &'tcx List<PlaceElem<'tcx>> {
2459 if ts.is_empty() { List::empty() } else { self._intern_place_elems(ts) }
2462 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'tcx> {
2463 if ts.is_empty() { List::empty() } else { self._intern_canonical_var_infos(ts) }
2466 pub fn intern_chalk_environment_clause_list(
2468 ts: &[traits::ChalkEnvironmentClause<'tcx>],
2469 ) -> &'tcx List<traits::ChalkEnvironmentClause<'tcx>> {
2470 if ts.is_empty() { List::empty() } else { self._intern_chalk_environment_clause_list(ts) }
2473 pub fn mk_fn_sig<I>(
2478 unsafety: hir::Unsafety,
2480 ) -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2482 I: Iterator<Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>,
2484 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2485 inputs_and_output: self.intern_type_list(xs),
2492 pub fn mk_existential_predicates<
2493 I: InternAs<[ExistentialPredicate<'tcx>], &'tcx List<ExistentialPredicate<'tcx>>>,
2498 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2501 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>], &'tcx List<Predicate<'tcx>>>>(
2505 iter.intern_with(|xs| self.intern_predicates(xs))
2508 pub fn mk_type_list<I: InternAs<[Ty<'tcx>], &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2509 iter.intern_with(|xs| self.intern_type_list(xs))
2512 pub fn mk_substs<I: InternAs<[GenericArg<'tcx>], &'tcx List<GenericArg<'tcx>>>>(
2516 iter.intern_with(|xs| self.intern_substs(xs))
2519 pub fn mk_place_elems<I: InternAs<[PlaceElem<'tcx>], &'tcx List<PlaceElem<'tcx>>>>(
2523 iter.intern_with(|xs| self.intern_place_elems(xs))
2526 pub fn mk_substs_trait(self, self_ty: Ty<'tcx>, rest: &[GenericArg<'tcx>]) -> SubstsRef<'tcx> {
2527 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2530 pub fn mk_chalk_environment_clause_list<
2532 [traits::ChalkEnvironmentClause<'tcx>],
2533 &'tcx List<traits::ChalkEnvironmentClause<'tcx>>,
2539 iter.intern_with(|xs| self.intern_chalk_environment_clause_list(xs))
2542 /// Walks upwards from `id` to find a node which might change lint levels with attributes.
2543 /// It stops at `bound` and just returns it if reached.
2544 pub fn maybe_lint_level_root_bounded(self, mut id: HirId, bound: HirId) -> HirId {
2545 let hir = self.hir();
2551 if hir.attrs(id).iter().any(|attr| Level::from_symbol(attr.name_or_empty()).is_some()) {
2554 let next = hir.get_parent_node(id);
2556 bug!("lint traversal reached the root of the crate");
2562 pub fn lint_level_at_node(
2564 lint: &'static Lint,
2566 ) -> (Level, LintSource) {
2567 let sets = self.lint_levels(LOCAL_CRATE);
2569 if let Some(pair) = sets.level_and_source(lint, id, self.sess) {
2572 let next = self.hir().get_parent_node(id);
2574 bug!("lint traversal reached the root of the crate");
2580 pub fn struct_span_lint_hir(
2582 lint: &'static Lint,
2584 span: impl Into<MultiSpan>,
2585 decorate: impl for<'a> FnOnce(LintDiagnosticBuilder<'a>),
2587 let (level, src) = self.lint_level_at_node(lint, hir_id);
2588 struct_lint_level(self.sess, lint, level, src, Some(span.into()), decorate);
2591 pub fn struct_lint_node(
2593 lint: &'static Lint,
2595 decorate: impl for<'a> FnOnce(LintDiagnosticBuilder<'a>),
2597 let (level, src) = self.lint_level_at_node(lint, id);
2598 struct_lint_level(self.sess, lint, level, src, None, decorate);
2601 pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx StableVec<TraitCandidate>> {
2602 self.in_scope_traits_map(id.owner).and_then(|map| map.get(&id.local_id))
2605 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2606 self.named_region_map(id.owner).and_then(|map| map.get(&id.local_id).cloned())
2609 pub fn is_late_bound(self, id: HirId) -> bool {
2610 self.is_late_bound_map(id.owner).map(|set| set.contains(&id.local_id)).unwrap_or(false)
2613 pub fn object_lifetime_defaults(self, id: HirId) -> Option<&'tcx [ObjectLifetimeDefault]> {
2614 self.object_lifetime_defaults_map(id.owner)
2615 .and_then(|map| map.get(&id.local_id).map(|v| &**v))
2619 pub trait InternAs<T: ?Sized, R> {
2621 fn intern_with<F>(self, f: F) -> Self::Output
2626 impl<I, T, R, E> InternAs<[T], R> for I
2628 E: InternIteratorElement<T, R>,
2629 I: Iterator<Item = E>,
2631 type Output = E::Output;
2632 fn intern_with<F>(self, f: F) -> Self::Output
2634 F: FnOnce(&[T]) -> R,
2636 E::intern_with(self, f)
2640 pub trait InternIteratorElement<T, R>: Sized {
2642 fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2645 impl<T, R> InternIteratorElement<T, R> for T {
2647 fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2648 f(&iter.collect::<SmallVec<[_; 8]>>())
2652 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2657 fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2658 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2662 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2663 type Output = Result<R, E>;
2664 fn intern_with<I: Iterator<Item = Self>, F: FnOnce(&[T]) -> R>(
2668 // This code is hot enough that it's worth specializing for the most
2669 // common length lists, to avoid the overhead of `SmallVec` creation.
2670 // The match arms are in order of frequency. The 1, 2, and 0 cases are
2671 // typically hit in ~95% of cases. We assume that if the upper and
2672 // lower bounds from `size_hint` agree they are correct.
2673 Ok(match iter.size_hint() {
2675 let t0 = iter.next().unwrap()?;
2676 assert!(iter.next().is_none());
2680 let t0 = iter.next().unwrap()?;
2681 let t1 = iter.next().unwrap()?;
2682 assert!(iter.next().is_none());
2686 assert!(iter.next().is_none());
2689 _ => f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?),
2694 // We are comparing types with different invariant lifetimes, so `ptr::eq`
2695 // won't work for us.
2696 fn ptr_eq<T, U>(t: *const T, u: *const U) -> bool {
2697 t as *const () == u as *const ()
2700 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2701 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id);
2702 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).map(|v| &v[..]);
2703 providers.crate_name = |tcx, id| {
2704 assert_eq!(id, LOCAL_CRATE);
2707 providers.maybe_unused_trait_import = |tcx, id| tcx.maybe_unused_trait_imports.contains(&id);
2708 providers.maybe_unused_extern_crates = |tcx, cnum| {
2709 assert_eq!(cnum, LOCAL_CRATE);
2710 &tcx.maybe_unused_extern_crates[..]
2712 providers.names_imported_by_glob_use =
2713 |tcx, id| tcx.arena.alloc(tcx.glob_map.get(&id).cloned().unwrap_or_default());
2715 providers.lookup_stability = |tcx, id| {
2716 let id = tcx.hir().local_def_id_to_hir_id(id.expect_local());
2717 tcx.stability().local_stability(id)
2719 providers.lookup_const_stability = |tcx, id| {
2720 let id = tcx.hir().local_def_id_to_hir_id(id.expect_local());
2721 tcx.stability().local_const_stability(id)
2723 providers.lookup_deprecation_entry = |tcx, id| {
2724 let id = tcx.hir().local_def_id_to_hir_id(id.expect_local());
2725 tcx.stability().local_deprecation_entry(id)
2727 providers.extern_mod_stmt_cnum = |tcx, id| tcx.extern_crate_map.get(&id).cloned();
2728 providers.all_crate_nums = |tcx, cnum| {
2729 assert_eq!(cnum, LOCAL_CRATE);
2730 tcx.arena.alloc_slice(&tcx.cstore.crates_untracked())
2732 providers.output_filenames = |tcx, cnum| {
2733 assert_eq!(cnum, LOCAL_CRATE);
2734 tcx.output_filenames.clone()
2736 providers.features_query = |tcx, cnum| {
2737 assert_eq!(cnum, LOCAL_CRATE);
2738 tcx.sess.features_untracked()
2740 providers.is_panic_runtime = |tcx, cnum| {
2741 assert_eq!(cnum, LOCAL_CRATE);
2742 attr::contains_name(tcx.hir().krate_attrs(), sym::panic_runtime)
2744 providers.is_compiler_builtins = |tcx, cnum| {
2745 assert_eq!(cnum, LOCAL_CRATE);
2746 attr::contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins)
2748 providers.has_panic_handler = |tcx, cnum| {
2749 assert_eq!(cnum, LOCAL_CRATE);
2750 // We want to check if the panic handler was defined in this crate
2751 tcx.lang_items().panic_impl().map_or(false, |did| did.is_local())