1 // ignore-tidy-filelength
3 //! Type context book-keeping.
5 use crate::arena::Arena;
6 use crate::dep_graph::DepGraph;
7 use crate::dep_graph::{self, DepNode, DepConstructor};
8 use crate::session::Session;
9 use crate::session::config::{BorrowckMode, OutputFilenames};
10 use crate::session::config::CrateType;
12 use crate::hir::{TraitCandidate, HirId, ItemKind, ItemLocalId, Node};
13 use crate::hir::def::{Res, DefKind, Export};
14 use crate::hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
15 use crate::hir::map as hir_map;
16 use crate::hir::map::DefPathHash;
17 use crate::lint::{self, Lint};
18 use crate::ich::{StableHashingContext, NodeIdHashingMode};
19 use crate::infer::canonical::{Canonical, CanonicalVarInfo, CanonicalVarInfos};
20 use crate::infer::outlives::free_region_map::FreeRegionMap;
21 use crate::middle::cstore::CrateStoreDyn;
22 use crate::middle::cstore::EncodedMetadata;
23 use crate::middle::lang_items;
24 use crate::middle::resolve_lifetime::{self, ObjectLifetimeDefault};
25 use crate::middle::stability;
26 use crate::mir::{self, Body, interpret, ProjectionKind};
27 use crate::mir::interpret::{ConstValue, Allocation, Scalar};
28 use crate::ty::subst::{Kind, InternalSubsts, SubstsRef, Subst};
29 use crate::ty::ReprOptions;
31 use crate::traits::{Clause, Clauses, GoalKind, Goal, Goals};
32 use crate::ty::{self, DefIdTree, Ty, TypeAndMut};
33 use crate::ty::{TyS, TyKind, List};
34 use crate::ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorSubsts, Region, Const};
35 use crate::ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
36 use crate::ty::RegionKind;
37 use crate::ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid, ConstVid};
38 use crate::ty::TyKind::*;
39 use crate::ty::{InferConst, ParamConst};
40 use crate::ty::GenericParamDefKind;
41 use crate::ty::layout::{LayoutDetails, TargetDataLayout, VariantIdx};
43 use crate::ty::steal::Steal;
44 use crate::ty::subst::{UserSubsts, UnpackedKind};
45 use crate::ty::{BoundVar, BindingMode};
46 use crate::ty::CanonicalPolyFnSig;
47 use crate::util::common::ErrorReported;
48 use crate::util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap, ItemLocalSet};
49 use crate::util::nodemap::{FxHashMap, FxHashSet};
50 use errors::DiagnosticBuilder;
51 use rustc_data_structures::interner::HashInterner;
52 use smallvec::SmallVec;
53 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
54 StableHasher, StableHasherResult,
56 use arena::SyncDroplessArena;
57 use rustc_data_structures::indexed_vec::{Idx, IndexVec};
58 use rustc_data_structures::sync::{Lrc, Lock, WorkerLocal};
60 use std::borrow::Borrow;
61 use std::cmp::Ordering;
62 use std::collections::hash_map::{self, Entry};
63 use std::hash::{Hash, Hasher};
66 use std::ops::{Deref, Bound};
70 use std::marker::PhantomData;
71 use rustc_target::spec::abi;
72 use rustc_macros::HashStable;
75 use syntax::source_map::MultiSpan;
76 use syntax::feature_gate;
77 use syntax::symbol::{Symbol, InternedString, kw, sym};
82 pub struct AllArenas {
83 pub interner: SyncDroplessArena,
84 pub local_interner: SyncDroplessArena,
88 pub fn new() -> Self {
90 interner: SyncDroplessArena::default(),
91 local_interner: SyncDroplessArena::default(),
96 type InternedSet<'tcx, T> = Lock<FxHashMap<Interned<'tcx, T>, ()>>;
98 pub struct CtxtInterners<'tcx> {
99 /// The arena that types, regions, etc are allocated from
100 arena: &'tcx SyncDroplessArena,
102 /// Specifically use a speedy hash algorithm for these hash sets,
103 /// they're accessed quite often.
104 type_: InternedSet<'tcx, TyS<'tcx>>,
105 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
106 substs: InternedSet<'tcx, InternalSubsts<'tcx>>,
107 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
108 region: InternedSet<'tcx, RegionKind>,
109 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
110 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
111 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
112 goal: InternedSet<'tcx, GoalKind<'tcx>>,
113 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
114 projs: InternedSet<'tcx, List<ProjectionKind>>,
115 const_: InternedSet<'tcx, Const<'tcx>>,
118 impl<'tcx> CtxtInterners<'tcx> {
119 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
122 type_: Default::default(),
123 type_list: Default::default(),
124 substs: Default::default(),
125 region: Default::default(),
126 existential_predicates: Default::default(),
127 canonical_var_infos: Default::default(),
128 predicates: Default::default(),
129 clauses: Default::default(),
130 goal: Default::default(),
131 goal_list: Default::default(),
132 projs: Default::default(),
133 const_: Default::default(),
140 local: &CtxtInterners<'tcx>,
141 global: &CtxtInterners<'tcx>,
144 let flags = super::flags::FlagComputation::for_sty(&st);
146 // HACK(eddyb) Depend on flags being accurate to
147 // determine that all contents are in the global tcx.
148 // See comments on Lift for why we can't use that.
149 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
150 local.type_.borrow_mut().intern(st, |st| {
151 let ty_struct = TyS {
154 outer_exclusive_binder: flags.outer_exclusive_binder,
157 // Make sure we don't end up with inference
158 // types/regions in the global interner
159 if ptr_eq(local, global) {
160 bug!("Attempted to intern `{:?}` which contains \
161 inference types/regions in the global type context",
165 // This is safe because all the types the ty_struct can point to
166 // already is in the local arena or the global arena
167 let ty_struct: TyS<'tcx> = unsafe {
168 mem::transmute(ty_struct)
171 Interned(local.arena.alloc(ty_struct))
174 global.type_.borrow_mut().intern(st, |st| {
175 let ty_struct = TyS {
178 outer_exclusive_binder: flags.outer_exclusive_binder,
181 // This is safe because all the types the ty_struct can point to
182 // already is in the global arena
183 let ty_struct: TyS<'tcx> = unsafe {
184 mem::transmute(ty_struct)
187 Interned(global.arena.alloc(ty_struct))
193 pub struct Common<'tcx> {
194 pub empty_predicates: ty::GenericPredicates<'tcx>,
197 pub struct CommonTypes<'tcx> {
218 /// Dummy type used for the `Self` of a `TraitRef` created for converting
219 /// a trait object, and which gets removed in `ExistentialTraitRef`.
220 /// This type must not appear anywhere in other converted types.
221 pub trait_object_dummy_self: Ty<'tcx>,
224 pub struct CommonLifetimes<'tcx> {
225 pub re_empty: Region<'tcx>,
226 pub re_static: Region<'tcx>,
227 pub re_erased: Region<'tcx>,
230 pub struct CommonConsts<'tcx> {
231 pub err: &'tcx Const<'tcx>,
234 pub struct LocalTableInContext<'a, V: 'a> {
235 local_id_root: Option<DefId>,
236 data: &'a ItemLocalMap<V>
239 /// Validate that the given HirId (respectively its `local_id` part) can be
240 /// safely used as a key in the tables of a TypeckTable. For that to be
241 /// the case, the HirId must have the same `owner` as all the other IDs in
242 /// this table (signified by `local_id_root`). Otherwise the HirId
243 /// would be in a different frame of reference and using its `local_id`
244 /// would result in lookup errors, or worse, in silently wrong data being
246 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
249 if cfg!(debug_assertions) {
250 if let Some(local_id_root) = local_id_root {
251 if hir_id.owner != local_id_root.index {
252 ty::tls::with(|tcx| {
253 let node_id = tcx.hir().hir_to_node_id(hir_id);
255 bug!("node {} with HirId::owner {:?} cannot be placed in \
256 TypeckTables with local_id_root {:?}",
257 tcx.hir().node_to_string(node_id),
258 DefId::local(hir_id.owner),
263 // We use "Null Object" TypeckTables in some of the analysis passes.
264 // These are just expected to be empty and their `local_id_root` is
265 // `None`. Therefore we cannot verify whether a given `HirId` would
266 // be a valid key for the given table. Instead we make sure that
267 // nobody tries to write to such a Null Object table.
269 bug!("access to invalid TypeckTables")
275 impl<'a, V> LocalTableInContext<'a, V> {
276 pub fn contains_key(&self, id: hir::HirId) -> bool {
277 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
278 self.data.contains_key(&id.local_id)
281 pub fn get(&self, id: hir::HirId) -> Option<&V> {
282 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
283 self.data.get(&id.local_id)
286 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
291 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
294 fn index(&self, key: hir::HirId) -> &V {
295 self.get(key).expect("LocalTableInContext: key not found")
299 pub struct LocalTableInContextMut<'a, V: 'a> {
300 local_id_root: Option<DefId>,
301 data: &'a mut ItemLocalMap<V>
304 impl<'a, V> LocalTableInContextMut<'a, V> {
305 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
306 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
307 self.data.get_mut(&id.local_id)
310 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
311 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
312 self.data.entry(id.local_id)
315 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
316 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
317 self.data.insert(id.local_id, val)
320 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
321 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
322 self.data.remove(&id.local_id)
326 /// All information necessary to validate and reveal an `impl Trait` or `existential Type`
327 #[derive(RustcEncodable, RustcDecodable, Debug, HashStable)]
328 pub struct ResolvedOpaqueTy<'tcx> {
329 /// The revealed type as seen by this function.
330 pub concrete_type: Ty<'tcx>,
331 /// Generic parameters on the opaque type as passed by this function.
332 /// For `existential type Foo<A, B>; fn foo<T, U>() -> Foo<T, U> { .. }` this is `[T, U]`, not
334 pub substs: SubstsRef<'tcx>,
337 #[derive(RustcEncodable, RustcDecodable, Debug)]
338 pub struct TypeckTables<'tcx> {
339 /// The HirId::owner all ItemLocalIds in this table are relative to.
340 pub local_id_root: Option<DefId>,
342 /// Resolved definitions for `<T>::X` associated paths and
343 /// method calls, including those of overloaded operators.
344 type_dependent_defs: ItemLocalMap<Result<(DefKind, DefId), ErrorReported>>,
346 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
347 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
348 /// about the field you also need definition of the variant to which the field
349 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
350 field_indices: ItemLocalMap<usize>,
352 /// Stores the types for various nodes in the AST. Note that this table
353 /// is not guaranteed to be populated until after typeck. See
354 /// typeck::check::fn_ctxt for details.
355 node_types: ItemLocalMap<Ty<'tcx>>,
357 /// Stores the type parameters which were substituted to obtain the type
358 /// of this node. This only applies to nodes that refer to entities
359 /// parameterized by type parameters, such as generic fns, types, or
361 node_substs: ItemLocalMap<SubstsRef<'tcx>>,
363 /// This will either store the canonicalized types provided by the user
364 /// or the substitutions that the user explicitly gave (if any) attached
365 /// to `id`. These will not include any inferred values. The canonical form
366 /// is used to capture things like `_` or other unspecified values.
368 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
369 /// canonical substitutions would include only `for<X> { Vec<X> }`.
371 /// See also `AscribeUserType` statement in MIR.
372 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
374 /// Stores the canonicalized types provided by the user. See also
375 /// `AscribeUserType` statement in MIR.
376 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
378 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
380 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
381 pat_binding_modes: ItemLocalMap<BindingMode>,
383 /// Stores the types which were implicitly dereferenced in pattern binding modes
384 /// for later usage in HAIR lowering. For example,
387 /// match &&Some(5i32) {
392 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
395 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
396 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
399 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
401 /// Records the reasons that we picked the kind of each closure;
402 /// not all closures are present in the map.
403 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
405 /// For each fn, records the "liberated" types of its arguments
406 /// and return type. Liberated means that all bound regions
407 /// (including late-bound regions) are replaced with free
408 /// equivalents. This table is not used in codegen (since regions
409 /// are erased there) and hence is not serialized to metadata.
410 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
412 /// For each FRU expression, record the normalized types of the fields
413 /// of the struct - this is needed because it is non-trivial to
414 /// normalize while preserving regions. This table is used only in
415 /// MIR construction and hence is not serialized to metadata.
416 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
418 /// For every coercion cast we add the HIR node ID of the cast
419 /// expression to this set.
420 coercion_casts: ItemLocalSet,
422 /// Set of trait imports actually used in the method resolution.
423 /// This is used for warning unused imports. During type
424 /// checking, this `Lrc` should not be cloned: it must have a ref-count
425 /// of 1 so that we can insert things into the set mutably.
426 pub used_trait_imports: Lrc<DefIdSet>,
428 /// If any errors occurred while type-checking this body,
429 /// this field will be set to `true`.
430 pub tainted_by_errors: bool,
432 /// Stores the free-region relationships that were deduced from
433 /// its where-clauses and parameter types. These are then
434 /// read-again by borrowck.
435 pub free_region_map: FreeRegionMap<'tcx>,
437 /// All the existential types that are restricted to concrete types
439 pub concrete_existential_types: FxHashMap<DefId, ResolvedOpaqueTy<'tcx>>,
441 /// Given the closure ID this map provides the list of UpvarIDs used by it.
442 /// The upvarID contains the HIR node ID and it also contains the full path
443 /// leading to the member of the struct or tuple that is used instead of the
445 pub upvar_list: ty::UpvarListMap,
448 impl<'tcx> TypeckTables<'tcx> {
449 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
452 type_dependent_defs: Default::default(),
453 field_indices: Default::default(),
454 user_provided_types: Default::default(),
455 user_provided_sigs: Default::default(),
456 node_types: Default::default(),
457 node_substs: Default::default(),
458 adjustments: Default::default(),
459 pat_binding_modes: Default::default(),
460 pat_adjustments: Default::default(),
461 upvar_capture_map: Default::default(),
462 closure_kind_origins: Default::default(),
463 liberated_fn_sigs: Default::default(),
464 fru_field_types: Default::default(),
465 coercion_casts: Default::default(),
466 used_trait_imports: Lrc::new(Default::default()),
467 tainted_by_errors: false,
468 free_region_map: Default::default(),
469 concrete_existential_types: Default::default(),
470 upvar_list: Default::default(),
474 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
475 pub fn qpath_res(&self, qpath: &hir::QPath, id: hir::HirId) -> Res {
477 hir::QPath::Resolved(_, ref path) => path.res,
478 hir::QPath::TypeRelative(..) => self.type_dependent_def(id)
479 .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)),
483 pub fn type_dependent_defs(
485 ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> {
486 LocalTableInContext {
487 local_id_root: self.local_id_root,
488 data: &self.type_dependent_defs
492 pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> {
493 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
494 self.type_dependent_defs.get(&id.local_id).cloned().and_then(|r| r.ok())
497 pub fn type_dependent_def_id(&self, id: HirId) -> Option<DefId> {
498 self.type_dependent_def(id).map(|(_, def_id)| def_id)
501 pub fn type_dependent_defs_mut(
503 ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> {
504 LocalTableInContextMut {
505 local_id_root: self.local_id_root,
506 data: &mut self.type_dependent_defs
510 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
511 LocalTableInContext {
512 local_id_root: self.local_id_root,
513 data: &self.field_indices
517 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
518 LocalTableInContextMut {
519 local_id_root: self.local_id_root,
520 data: &mut self.field_indices
524 pub fn user_provided_types(
526 ) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
527 LocalTableInContext {
528 local_id_root: self.local_id_root,
529 data: &self.user_provided_types
533 pub fn user_provided_types_mut(
535 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
536 LocalTableInContextMut {
537 local_id_root: self.local_id_root,
538 data: &mut self.user_provided_types
542 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
543 LocalTableInContext {
544 local_id_root: self.local_id_root,
545 data: &self.node_types
549 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
550 LocalTableInContextMut {
551 local_id_root: self.local_id_root,
552 data: &mut self.node_types
556 pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
557 self.node_type_opt(id).unwrap_or_else(||
558 bug!("node_type: no type for node `{}`",
559 tls::with(|tcx| tcx.hir().hir_to_string(id)))
563 pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
564 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
565 self.node_types.get(&id.local_id).cloned()
568 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> {
569 LocalTableInContextMut {
570 local_id_root: self.local_id_root,
571 data: &mut self.node_substs
575 pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> {
576 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
577 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| InternalSubsts::empty())
580 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<SubstsRef<'tcx>> {
581 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
582 self.node_substs.get(&id.local_id).cloned()
585 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
586 // doesn't provide type parameter substitutions.
587 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
588 self.node_type(pat.hir_id)
591 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
592 self.node_type_opt(pat.hir_id)
595 // Returns the type of an expression as a monotype.
597 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
598 // some cases, we insert `Adjustment` annotations such as auto-deref or
599 // auto-ref. The type returned by this function does not consider such
600 // adjustments. See `expr_ty_adjusted()` instead.
602 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
603 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
604 // instead of "fn(ty) -> T with T = isize".
605 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
606 self.node_type(expr.hir_id)
609 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
610 self.node_type_opt(expr.hir_id)
613 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
614 LocalTableInContext {
615 local_id_root: self.local_id_root,
616 data: &self.adjustments
620 pub fn adjustments_mut(&mut self)
621 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
622 LocalTableInContextMut {
623 local_id_root: self.local_id_root,
624 data: &mut self.adjustments
628 pub fn expr_adjustments(&self, expr: &hir::Expr)
629 -> &[ty::adjustment::Adjustment<'tcx>] {
630 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
631 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
634 /// Returns the type of `expr`, considering any `Adjustment`
635 /// entry recorded for that expression.
636 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
637 self.expr_adjustments(expr)
639 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
642 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
643 self.expr_adjustments(expr)
645 .map(|adj| adj.target)
646 .or_else(|| self.expr_ty_opt(expr))
649 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
650 // Only paths and method calls/overloaded operators have
651 // entries in type_dependent_defs, ignore the former here.
652 if let hir::ExprKind::Path(_) = expr.node {
656 match self.type_dependent_defs().get(expr.hir_id) {
657 Some(Ok((DefKind::Method, _))) => true,
662 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
663 LocalTableInContext {
664 local_id_root: self.local_id_root,
665 data: &self.pat_binding_modes
669 pub fn pat_binding_modes_mut(&mut self)
670 -> LocalTableInContextMut<'_, BindingMode> {
671 LocalTableInContextMut {
672 local_id_root: self.local_id_root,
673 data: &mut self.pat_binding_modes
677 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
678 LocalTableInContext {
679 local_id_root: self.local_id_root,
680 data: &self.pat_adjustments,
684 pub fn pat_adjustments_mut(&mut self)
685 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
686 LocalTableInContextMut {
687 local_id_root: self.local_id_root,
688 data: &mut self.pat_adjustments,
692 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
693 self.upvar_capture_map[&upvar_id]
696 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
697 LocalTableInContext {
698 local_id_root: self.local_id_root,
699 data: &self.closure_kind_origins
703 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
704 LocalTableInContextMut {
705 local_id_root: self.local_id_root,
706 data: &mut self.closure_kind_origins
710 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
711 LocalTableInContext {
712 local_id_root: self.local_id_root,
713 data: &self.liberated_fn_sigs
717 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
718 LocalTableInContextMut {
719 local_id_root: self.local_id_root,
720 data: &mut self.liberated_fn_sigs
724 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
725 LocalTableInContext {
726 local_id_root: self.local_id_root,
727 data: &self.fru_field_types
731 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
732 LocalTableInContextMut {
733 local_id_root: self.local_id_root,
734 data: &mut self.fru_field_types
738 pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool {
739 validate_hir_id_for_typeck_tables(self.local_id_root, hir_id, true);
740 self.coercion_casts.contains(&hir_id.local_id)
743 pub fn set_coercion_cast(&mut self, id: ItemLocalId) {
744 self.coercion_casts.insert(id);
747 pub fn coercion_casts(&self) -> &ItemLocalSet {
753 impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for TypeckTables<'tcx> {
754 fn hash_stable<W: StableHasherResult>(&self,
755 hcx: &mut StableHashingContext<'a>,
756 hasher: &mut StableHasher<W>) {
757 let ty::TypeckTables {
759 ref type_dependent_defs,
761 ref user_provided_types,
762 ref user_provided_sigs,
766 ref pat_binding_modes,
768 ref upvar_capture_map,
769 ref closure_kind_origins,
770 ref liberated_fn_sigs,
775 ref used_trait_imports,
778 ref concrete_existential_types,
783 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
784 type_dependent_defs.hash_stable(hcx, hasher);
785 field_indices.hash_stable(hcx, hasher);
786 user_provided_types.hash_stable(hcx, hasher);
787 user_provided_sigs.hash_stable(hcx, hasher);
788 node_types.hash_stable(hcx, hasher);
789 node_substs.hash_stable(hcx, hasher);
790 adjustments.hash_stable(hcx, hasher);
791 pat_binding_modes.hash_stable(hcx, hasher);
792 pat_adjustments.hash_stable(hcx, hasher);
793 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
800 local_id_root.expect("trying to hash invalid TypeckTables");
802 let var_owner_def_id = DefId {
803 krate: local_id_root.krate,
804 index: var_path.hir_id.owner,
806 let closure_def_id = DefId {
807 krate: local_id_root.krate,
808 index: closure_expr_id.to_def_id().index,
810 (hcx.def_path_hash(var_owner_def_id),
811 var_path.hir_id.local_id,
812 hcx.def_path_hash(closure_def_id))
815 closure_kind_origins.hash_stable(hcx, hasher);
816 liberated_fn_sigs.hash_stable(hcx, hasher);
817 fru_field_types.hash_stable(hcx, hasher);
818 coercion_casts.hash_stable(hcx, hasher);
819 used_trait_imports.hash_stable(hcx, hasher);
820 tainted_by_errors.hash_stable(hcx, hasher);
821 free_region_map.hash_stable(hcx, hasher);
822 concrete_existential_types.hash_stable(hcx, hasher);
823 upvar_list.hash_stable(hcx, hasher);
829 pub struct UserTypeAnnotationIndex {
831 DEBUG_FORMAT = "UserType({})",
832 const START_INDEX = 0,
836 /// Mapping of type annotation indices to canonical user type annotations.
837 pub type CanonicalUserTypeAnnotations<'tcx> =
838 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
840 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
841 pub struct CanonicalUserTypeAnnotation<'tcx> {
842 pub user_ty: CanonicalUserType<'tcx>,
844 pub inferred_ty: Ty<'tcx>,
847 BraceStructTypeFoldableImpl! {
848 impl<'tcx> TypeFoldable<'tcx> for CanonicalUserTypeAnnotation<'tcx> {
849 user_ty, span, inferred_ty
853 BraceStructLiftImpl! {
854 impl<'a, 'tcx> Lift<'tcx> for CanonicalUserTypeAnnotation<'a> {
855 type Lifted = CanonicalUserTypeAnnotation<'tcx>;
856 user_ty, span, inferred_ty
860 /// Canonicalized user type annotation.
861 pub type CanonicalUserType<'tcx> = Canonical<'tcx, UserType<'tcx>>;
863 impl CanonicalUserType<'tcx> {
864 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
865 /// i.e., each thing is mapped to a canonical variable with the same index.
866 pub fn is_identity(&self) -> bool {
868 UserType::Ty(_) => false,
869 UserType::TypeOf(_, user_substs) => {
870 if user_substs.user_self_ty.is_some() {
874 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
875 match kind.unpack() {
876 UnpackedKind::Type(ty) => match ty.sty {
877 ty::Bound(debruijn, b) => {
878 // We only allow a `ty::INNERMOST` index in substitutions.
879 assert_eq!(debruijn, ty::INNERMOST);
885 UnpackedKind::Lifetime(r) => match r {
886 ty::ReLateBound(debruijn, br) => {
887 // We only allow a `ty::INNERMOST` index in substitutions.
888 assert_eq!(*debruijn, ty::INNERMOST);
889 cvar == br.assert_bound_var()
894 UnpackedKind::Const(ct) => match ct.val {
895 ConstValue::Infer(InferConst::Canonical(debruijn, b)) => {
896 // We only allow a `ty::INNERMOST` index in substitutions.
897 assert_eq!(debruijn, ty::INNERMOST);
909 /// A user-given type annotation attached to a constant. These arise
910 /// from constants that are named via paths, like `Foo::<A>::new` and
912 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
913 pub enum UserType<'tcx> {
916 /// The canonical type is the result of `type_of(def_id)` with the
917 /// given substitutions applied.
918 TypeOf(DefId, UserSubsts<'tcx>),
921 EnumTypeFoldableImpl! {
922 impl<'tcx> TypeFoldable<'tcx> for UserType<'tcx> {
924 (UserType::TypeOf)(def, substs),
929 impl<'a, 'tcx> Lift<'tcx> for UserType<'a> {
930 type Lifted = UserType<'tcx>;
932 (UserType::TypeOf)(def, substs),
936 impl<'tcx> CommonTypes<'tcx> {
937 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
938 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
941 unit: mk(Tuple(List::empty())),
946 isize: mk(Int(ast::IntTy::Isize)),
947 i8: mk(Int(ast::IntTy::I8)),
948 i16: mk(Int(ast::IntTy::I16)),
949 i32: mk(Int(ast::IntTy::I32)),
950 i64: mk(Int(ast::IntTy::I64)),
951 i128: mk(Int(ast::IntTy::I128)),
952 usize: mk(Uint(ast::UintTy::Usize)),
953 u8: mk(Uint(ast::UintTy::U8)),
954 u16: mk(Uint(ast::UintTy::U16)),
955 u32: mk(Uint(ast::UintTy::U32)),
956 u64: mk(Uint(ast::UintTy::U64)),
957 u128: mk(Uint(ast::UintTy::U128)),
958 f32: mk(Float(ast::FloatTy::F32)),
959 f64: mk(Float(ast::FloatTy::F64)),
961 trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
966 impl<'tcx> CommonLifetimes<'tcx> {
967 fn new(interners: &CtxtInterners<'tcx>) -> CommonLifetimes<'tcx> {
969 interners.region.borrow_mut().intern(r, |r| {
970 Interned(interners.arena.alloc(r))
975 re_empty: mk(RegionKind::ReEmpty),
976 re_static: mk(RegionKind::ReStatic),
977 re_erased: mk(RegionKind::ReErased),
982 impl<'tcx> CommonConsts<'tcx> {
983 fn new(interners: &CtxtInterners<'tcx>, types: &CommonTypes<'tcx>) -> CommonConsts<'tcx> {
985 interners.const_.borrow_mut().intern(c, |c| {
986 Interned(interners.arena.alloc(c))
991 err: mk_const(ty::Const {
992 val: ConstValue::Scalar(Scalar::zst()),
999 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
1002 pub struct FreeRegionInfo {
1003 // def id corresponding to FreeRegion
1005 // the bound region corresponding to FreeRegion
1006 pub boundregion: ty::BoundRegion,
1007 // checks if bound region is in Impl Item
1008 pub is_impl_item: bool,
1011 /// The central data structure of the compiler. It stores references
1012 /// to the various **arenas** and also houses the results of the
1013 /// various **compiler queries** that have been performed. See the
1014 /// [rustc guide] for more details.
1016 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
1017 #[derive(Copy, Clone)]
1018 pub struct TyCtxt<'tcx> {
1019 gcx: &'tcx GlobalCtxt<'tcx>,
1020 interners: &'tcx CtxtInterners<'tcx>,
1021 dummy: PhantomData<&'tcx ()>,
1024 impl<'tcx> Deref for TyCtxt<'tcx> {
1025 type Target = &'tcx GlobalCtxt<'tcx>;
1027 fn deref(&self) -> &Self::Target {
1032 pub struct GlobalCtxt<'tcx> {
1033 pub arena: WorkerLocal<Arena<'tcx>>,
1035 global_interners: CtxtInterners<'tcx>,
1036 local_interners: CtxtInterners<'tcx>,
1038 cstore: &'tcx CrateStoreDyn,
1040 pub sess: &'tcx Session,
1042 pub dep_graph: DepGraph,
1045 pub common: Common<'tcx>,
1047 /// Common types, pre-interned for your convenience.
1048 pub types: CommonTypes<'tcx>,
1050 /// Common lifetimes, pre-interned for your convenience.
1051 pub lifetimes: CommonLifetimes<'tcx>,
1053 /// Common consts, pre-interned for your convenience.
1054 pub consts: CommonConsts<'tcx>,
1056 /// Map indicating what traits are in scope for places where this
1057 /// is relevant; generated by resolve.
1058 trait_map: FxHashMap<DefIndex,
1059 FxHashMap<ItemLocalId,
1060 StableVec<TraitCandidate>>>,
1062 /// Export map produced by name resolution.
1063 export_map: FxHashMap<DefId, Vec<Export<hir::HirId>>>,
1065 hir_map: hir_map::Map<'tcx>,
1067 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
1068 /// as well as all upstream crates. Only populated in incremental mode.
1069 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
1071 pub queries: query::Queries<'tcx>,
1073 maybe_unused_trait_imports: FxHashSet<DefId>,
1074 maybe_unused_extern_crates: Vec<(DefId, Span)>,
1075 /// A map of glob use to a set of names it actually imports. Currently only
1076 /// used in save-analysis.
1077 glob_map: FxHashMap<DefId, FxHashSet<ast::Name>>,
1078 /// Extern prelude entries. The value is `true` if the entry was introduced
1079 /// via `extern crate` item and not `--extern` option or compiler built-in.
1080 pub extern_prelude: FxHashMap<ast::Name, bool>,
1082 // Internal cache for metadata decoding. No need to track deps on this.
1083 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
1085 /// Caches the results of trait selection. This cache is used
1086 /// for things that do not have to do with the parameters in scope.
1087 pub selection_cache: traits::SelectionCache<'tcx>,
1089 /// Caches the results of trait evaluation. This cache is used
1090 /// for things that do not have to do with the parameters in scope.
1091 /// Merge this with `selection_cache`?
1092 pub evaluation_cache: traits::EvaluationCache<'tcx>,
1094 /// The definite name of the current crate after taking into account
1095 /// attributes, commandline parameters, etc.
1096 pub crate_name: Symbol,
1098 /// Data layout specification for the current target.
1099 pub data_layout: TargetDataLayout,
1101 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
1103 /// Stores the value of constants (and deduplicates the actual memory)
1104 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
1106 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1108 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
1110 /// A general purpose channel to throw data out the back towards LLVM worker
1113 /// This is intended to only get used during the codegen phase of the compiler
1114 /// when satisfying the query for a particular codegen unit. Internally in
1115 /// the query it'll send data along this channel to get processed later.
1116 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
1118 output_filenames: Arc<OutputFilenames>,
1121 impl<'tcx> TyCtxt<'tcx> {
1122 /// Gets the global `TyCtxt`.
1124 pub fn global_tcx(self) -> TyCtxt<'tcx> {
1127 interners: &self.gcx.global_interners,
1133 pub fn hir(self) -> &'tcx hir_map::Map<'tcx> {
1137 pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal<Body<'tcx>> {
1138 self.arena.alloc(Steal::new(mir))
1141 pub fn alloc_adt_def(
1145 variants: IndexVec<VariantIdx, ty::VariantDef>,
1147 ) -> &'tcx ty::AdtDef {
1148 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1149 self.arena.alloc(def)
1152 pub fn intern_const_alloc(self, alloc: Allocation) -> &'tcx Allocation {
1153 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1154 self.arena.alloc(alloc)
1158 /// Allocates a byte or string literal for `mir::interpret`, read-only
1159 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1160 // create an allocation that just contains these bytes
1161 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1162 let alloc = self.intern_const_alloc(alloc);
1163 self.alloc_map.lock().create_memory_alloc(alloc)
1166 pub fn intern_stability(self, stab: attr::Stability) -> &'tcx attr::Stability {
1167 self.stability_interner.borrow_mut().intern(stab, |stab| {
1168 self.arena.alloc(stab)
1172 pub fn intern_layout(self, layout: LayoutDetails) -> &'tcx LayoutDetails {
1173 self.layout_interner.borrow_mut().intern(layout, |layout| {
1174 self.arena.alloc(layout)
1178 /// Returns a range of the start/end indices specified with the
1179 /// `rustc_layout_scalar_valid_range` attribute.
1180 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1181 let attrs = self.get_attrs(def_id);
1183 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1185 None => return Bound::Unbounded,
1187 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1188 match meta.literal().expect("attribute takes lit").node {
1189 ast::LitKind::Int(a, _) => return Bound::Included(a),
1190 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1193 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1195 (get(sym::rustc_layout_scalar_valid_range_start),
1196 get(sym::rustc_layout_scalar_valid_range_end))
1199 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1200 value.lift_to_tcx(self)
1203 /// Like lift, but only tries in the global tcx.
1204 pub fn lift_to_global<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1205 value.lift_to_tcx(self.global_tcx())
1208 /// Returns `true` if self is the same as self.global_tcx().
1209 fn is_global(self) -> bool {
1210 ptr_eq(self.interners, &self.global_interners)
1213 /// Creates a type context and call the closure with a `TyCtxt` reference
1214 /// to the context. The closure enforces that the type context and any interned
1215 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1216 /// reference to the context, to allow formatting values that need it.
1217 pub fn create_global_ctxt(
1219 cstore: &'tcx CrateStoreDyn,
1220 local_providers: ty::query::Providers<'tcx>,
1221 extern_providers: ty::query::Providers<'tcx>,
1222 arenas: &'tcx AllArenas,
1223 resolutions: ty::Resolutions,
1224 hir: hir_map::Map<'tcx>,
1225 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1227 tx: mpsc::Sender<Box<dyn Any + Send>>,
1228 output_filenames: &OutputFilenames,
1229 ) -> GlobalCtxt<'tcx> {
1230 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1233 let interners = CtxtInterners::new(&arenas.interner);
1234 let local_interners = CtxtInterners::new(&arenas.local_interner);
1235 let common = Common {
1236 empty_predicates: ty::GenericPredicates {
1241 let common_types = CommonTypes::new(&interners);
1242 let common_lifetimes = CommonLifetimes::new(&interners);
1243 let common_consts = CommonConsts::new(&interners, &common_types);
1244 let dep_graph = hir.dep_graph.clone();
1245 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1246 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1247 providers[LOCAL_CRATE] = local_providers;
1249 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1250 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1253 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1256 let def_path_tables = || {
1257 upstream_def_path_tables
1259 .map(|&(cnum, ref rc)| (cnum, &**rc))
1260 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1263 // Precompute the capacity of the hashmap so we don't have to
1264 // re-allocate when populating it.
1265 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1267 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1269 ::std::default::Default::default()
1272 for (cnum, def_path_table) in def_path_tables() {
1273 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1281 let mut trait_map: FxHashMap<_, FxHashMap<_, _>> = FxHashMap::default();
1282 for (k, v) in resolutions.trait_map {
1283 let hir_id = hir.node_to_hir_id(k);
1284 let map = trait_map.entry(hir_id.owner).or_default();
1285 map.insert(hir_id.local_id, StableVec::new(v));
1291 arena: WorkerLocal::new(|_| Arena::default()),
1292 global_interners: interners,
1293 local_interners: local_interners,
1296 types: common_types,
1297 lifetimes: common_lifetimes,
1298 consts: common_consts,
1300 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1301 let exports: Vec<_> = v.into_iter().map(|e| {
1302 e.map_id(|id| hir.node_to_hir_id(id))
1306 maybe_unused_trait_imports:
1307 resolutions.maybe_unused_trait_imports
1309 .map(|id| hir.local_def_id(id))
1311 maybe_unused_extern_crates:
1312 resolutions.maybe_unused_extern_crates
1314 .map(|(id, sp)| (hir.local_def_id(id), sp))
1316 glob_map: resolutions.glob_map.into_iter().map(|(id, names)| {
1317 (hir.local_def_id(id), names)
1319 extern_prelude: resolutions.extern_prelude,
1321 def_path_hash_to_def_id,
1322 queries: query::Queries::new(
1325 on_disk_query_result_cache,
1327 rcache: Default::default(),
1328 selection_cache: Default::default(),
1329 evaluation_cache: Default::default(),
1330 crate_name: Symbol::intern(crate_name),
1332 layout_interner: Default::default(),
1333 stability_interner: Default::default(),
1334 allocation_interner: Default::default(),
1335 alloc_map: Lock::new(interpret::AllocMap::new()),
1336 tx_to_llvm_workers: Lock::new(tx),
1337 output_filenames: Arc::new(output_filenames.clone()),
1341 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1342 let cname = self.crate_name(LOCAL_CRATE).as_str();
1343 self.sess.consider_optimizing(&cname, msg)
1346 pub fn lib_features(self) -> &'tcx middle::lib_features::LibFeatures {
1347 self.get_lib_features(LOCAL_CRATE)
1350 pub fn lang_items(self) -> &'tcx middle::lang_items::LanguageItems {
1351 self.get_lang_items(LOCAL_CRATE)
1354 /// Due to missing llvm support for lowering 128 bit math to software emulation
1355 /// (on some targets), the lowering can be done in MIR.
1357 /// This function only exists until said support is implemented.
1358 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1359 let items = self.lang_items();
1360 let def_id = Some(def_id);
1361 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1362 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1363 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1364 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1365 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1366 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1367 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1368 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1369 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1370 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1371 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1372 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1373 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1374 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1375 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1376 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1377 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1378 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1379 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1380 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1381 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1382 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1383 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1384 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1388 pub fn stability(self) -> &'tcx stability::Index<'tcx> {
1389 self.stability_index(LOCAL_CRATE)
1392 pub fn crates(self) -> &'tcx [CrateNum] {
1393 self.all_crate_nums(LOCAL_CRATE)
1396 pub fn features(self) -> &'tcx feature_gate::Features {
1397 self.features_query(LOCAL_CRATE)
1400 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1402 self.hir().def_key(id)
1404 self.cstore.def_key(id)
1408 /// Converts a `DefId` into its fully expanded `DefPath` (every
1409 /// `DefId` is really just an interned def-path).
1411 /// Note that if `id` is not local to this crate, the result will
1412 /// be a non-local `DefPath`.
1413 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1415 self.hir().def_path(id)
1417 self.cstore.def_path(id)
1421 /// Returns whether or not the crate with CrateNum 'cnum'
1422 /// is marked as a private dependency
1423 pub fn is_private_dep(self, cnum: CrateNum) -> bool {
1424 if cnum == LOCAL_CRATE {
1427 self.cstore.crate_is_private_dep_untracked(cnum)
1432 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1433 if def_id.is_local() {
1434 self.hir().definitions().def_path_hash(def_id.index)
1436 self.cstore.def_path_hash(def_id)
1440 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1441 // We are explicitly not going through queries here in order to get
1442 // crate name and disambiguator since this code is called from debug!()
1443 // statements within the query system and we'd run into endless
1444 // recursion otherwise.
1445 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1446 (self.crate_name.clone(),
1447 self.sess.local_crate_disambiguator())
1449 (self.cstore.crate_name_untracked(def_id.krate),
1450 self.cstore.crate_disambiguator_untracked(def_id.krate))
1455 // Don't print the whole crate disambiguator. That's just
1456 // annoying in debug output.
1457 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1458 self.def_path(def_id).to_string_no_crate())
1461 pub fn metadata_encoding_version(self) -> Vec<u8> {
1462 self.cstore.metadata_encoding_version().to_vec()
1465 // Note that this is *untracked* and should only be used within the query
1466 // system if the result is otherwise tracked through queries
1467 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1468 self.cstore.crate_data_as_rc_any(cnum)
1472 pub fn create_stable_hashing_context(self) -> StableHashingContext<'tcx> {
1473 let krate = self.gcx.hir_map.forest.untracked_krate();
1475 StableHashingContext::new(self.sess,
1477 self.hir().definitions(),
1481 // This method makes sure that we have a DepNode and a Fingerprint for
1482 // every upstream crate. It needs to be called once right after the tcx is
1484 // With full-fledged red/green, the method will probably become unnecessary
1485 // as this will be done on-demand.
1486 pub fn allocate_metadata_dep_nodes(self) {
1487 // We cannot use the query versions of crates() and crate_hash(), since
1488 // those would need the DepNodes that we are allocating here.
1489 for cnum in self.cstore.crates_untracked() {
1490 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1491 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1492 self.dep_graph.with_task(dep_node,
1495 |_, x| x, // No transformation needed
1496 dep_graph::hash_result,
1501 pub fn serialize_query_result_cache<E>(self,
1503 -> Result<(), E::Error>
1504 where E: ty::codec::TyEncoder
1506 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1509 /// If true, we should use the AST-based borrowck (we may *also* use
1510 /// the MIR-based borrowck).
1511 pub fn use_ast_borrowck(self) -> bool {
1512 self.borrowck_mode().use_ast()
1515 /// If true, we should use the MIR-based borrow check, but also
1516 /// fall back on the AST borrow check if the MIR-based one errors.
1517 pub fn migrate_borrowck(self) -> bool {
1518 self.borrowck_mode().migrate()
1521 /// If true, make MIR codegen for `match` emit a temp that holds a
1522 /// borrow of the input to the match expression.
1523 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1524 self.emit_read_for_match()
1527 /// If true, make MIR codegen for `match` emit FakeRead
1528 /// statements (which simulate the maximal effect of executing the
1529 /// patterns in a match arm).
1530 pub fn emit_read_for_match(&self) -> bool {
1531 !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1534 /// What mode(s) of borrowck should we run? AST? MIR? both?
1535 /// (Also considers the `#![feature(nll)]` setting.)
1536 pub fn borrowck_mode(&self) -> BorrowckMode {
1537 // Here are the main constraints we need to deal with:
1539 // 1. An opts.borrowck_mode of `BorrowckMode::Migrate` is
1540 // synonymous with no `-Z borrowck=...` flag at all.
1542 // 2. We want to allow developers on the Nightly channel
1543 // to opt back into the "hard error" mode for NLL,
1544 // (which they can do via specifying `#![feature(nll)]`
1545 // explicitly in their crate).
1547 // So, this precedence list is how pnkfelix chose to work with
1548 // the above constraints:
1550 // * `#![feature(nll)]` *always* means use NLL with hard
1551 // errors. (To simplify the code here, it now even overrides
1552 // a user's attempt to specify `-Z borrowck=compare`, which
1553 // we arguably do not need anymore and should remove.)
1555 // * Otherwise, if no `-Z borrowck=...` then use migrate mode
1557 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1559 if self.features().nll { return BorrowckMode::Mir; }
1561 self.sess.opts.borrowck_mode
1565 pub fn local_crate_exports_generics(self) -> bool {
1566 debug_assert!(self.sess.opts.share_generics());
1568 self.sess.crate_types.borrow().iter().any(|crate_type| {
1570 CrateType::Executable |
1571 CrateType::Staticlib |
1572 CrateType::ProcMacro |
1573 CrateType::Cdylib => false,
1575 CrateType::Dylib => true,
1580 // This method returns the DefId and the BoundRegion corresponding to the given region.
1581 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1582 let (suitable_region_binding_scope, bound_region) = match *region {
1583 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1584 ty::ReEarlyBound(ref ebr) => (
1585 self.parent(ebr.def_id).unwrap(),
1586 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1588 _ => return None, // not a free region
1591 let hir_id = self.hir()
1592 .as_local_hir_id(suitable_region_binding_scope)
1594 let is_impl_item = match self.hir().find_by_hir_id(hir_id) {
1595 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1596 Some(Node::ImplItem(..)) => {
1597 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1602 return Some(FreeRegionInfo {
1603 def_id: suitable_region_binding_scope,
1604 boundregion: bound_region,
1605 is_impl_item: is_impl_item,
1609 pub fn return_type_impl_trait(
1611 scope_def_id: DefId,
1612 ) -> Option<Ty<'tcx>> {
1613 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1614 let hir_id = self.hir().as_local_hir_id(scope_def_id).unwrap();
1615 match self.hir().get_by_hir_id(hir_id) {
1616 Node::Item(item) => {
1618 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1624 _ => { /* type_of_def_id() will work or panic */ }
1627 let ret_ty = self.type_of(scope_def_id);
1629 ty::FnDef(_, _) => {
1630 let sig = ret_ty.fn_sig(*self);
1631 let output = self.erase_late_bound_regions(&sig.output());
1632 if output.is_impl_trait() {
1642 // Here we check if the bound region is in Impl Item.
1643 pub fn is_bound_region_in_impl_item(
1645 suitable_region_binding_scope: DefId,
1647 let container_id = self.associated_item(suitable_region_binding_scope)
1650 if self.impl_trait_ref(container_id).is_some() {
1651 // For now, we do not try to target impls of traits. This is
1652 // because this message is going to suggest that the user
1653 // change the fn signature, but they may not be free to do so,
1654 // since the signature must match the trait.
1656 // FIXME(#42706) -- in some cases, we could do better here.
1662 /// Determine whether identifiers in the assembly have strict naming rules.
1663 /// Currently, only NVPTX* targets need it.
1664 pub fn has_strict_asm_symbol_naming(&self) -> bool {
1665 self.gcx.sess.target.target.arch.contains("nvptx")
1669 impl<'tcx> TyCtxt<'tcx> {
1670 pub fn encode_metadata(self)
1673 self.cstore.encode_metadata(self)
1677 impl<'tcx> GlobalCtxt<'tcx> {
1678 /// Call the closure with a local `TyCtxt` using the given arena.
1679 /// `interners` is a slot passed so we can create a CtxtInterners
1680 /// with the same lifetime as `arena`.
1681 pub fn enter_local<F, R>(&'tcx self, f: F) -> R
1683 F: FnOnce(TyCtxt<'tcx>) -> R,
1687 interners: &self.local_interners,
1690 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1691 let new_icx = ty::tls::ImplicitCtxt {
1693 query: icx.query.clone(),
1694 diagnostics: icx.diagnostics,
1695 layout_depth: icx.layout_depth,
1696 task_deps: icx.task_deps,
1698 ty::tls::enter_context(&new_icx, |_| {
1705 /// A trait implemented for all `X<'a>` types that can be safely and
1706 /// efficiently converted to `X<'tcx>` as long as they are part of the
1707 /// provided `TyCtxt<'tcx>`.
1708 /// This can be done, for example, for `Ty<'tcx>` or `SubstsRef<'tcx>`
1709 /// by looking them up in their respective interners.
1711 /// However, this is still not the best implementation as it does
1712 /// need to compare the components, even for interned values.
1713 /// It would be more efficient if `TypedArena` provided a way to
1714 /// determine whether the address is in the allocated range.
1716 /// None is returned if the value or one of the components is not part
1717 /// of the provided context.
1718 /// For `Ty`, `None` can be returned if either the type interner doesn't
1719 /// contain the `TyKind` key or if the address of the interned
1720 /// pointer differs. The latter case is possible if a primitive type,
1721 /// e.g., `()` or `u8`, was interned in a different context.
1722 pub trait Lift<'tcx>: fmt::Debug {
1723 type Lifted: fmt::Debug + 'tcx;
1724 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>;
1728 macro_rules! nop_lift {
1729 ($ty:ty => $lifted:ty) => {
1730 impl<'a, 'tcx> Lift<'tcx> for $ty {
1731 type Lifted = $lifted;
1732 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1733 if tcx.interners.arena.in_arena(*self as *const _) {
1734 return Some(unsafe { mem::transmute(*self) });
1736 // Also try in the global tcx if we're not that.
1737 if !tcx.is_global() {
1738 self.lift_to_tcx(tcx.global_tcx())
1747 macro_rules! nop_list_lift {
1748 ($ty:ty => $lifted:ty) => {
1749 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1750 type Lifted = &'tcx List<$lifted>;
1751 fn lift_to_tcx(&self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted> {
1752 if self.is_empty() {
1753 return Some(List::empty());
1755 if tcx.interners.arena.in_arena(*self as *const _) {
1756 return Some(unsafe { mem::transmute(*self) });
1758 // Also try in the global tcx if we're not that.
1759 if !tcx.is_global() {
1760 self.lift_to_tcx(tcx.global_tcx())
1769 nop_lift!{Ty<'a> => Ty<'tcx>}
1770 nop_lift!{Region<'a> => Region<'tcx>}
1771 nop_lift!{Goal<'a> => Goal<'tcx>}
1772 nop_lift!{&'a Const<'a> => &'tcx Const<'tcx>}
1774 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1775 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1776 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1777 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1778 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1779 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1780 nop_list_lift!{ProjectionKind => ProjectionKind}
1782 // this is the impl for `&'a InternalSubsts<'a>`
1783 nop_list_lift!{Kind<'a> => Kind<'tcx>}
1786 use super::{GlobalCtxt, TyCtxt, ptr_eq};
1790 use std::marker::PhantomData;
1792 use crate::ty::query;
1793 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1794 use rustc_data_structures::OnDrop;
1795 use rustc_data_structures::sync::{self, Lrc, Lock};
1796 use rustc_data_structures::thin_vec::ThinVec;
1797 use crate::dep_graph::TaskDeps;
1799 #[cfg(not(parallel_compiler))]
1800 use std::cell::Cell;
1802 #[cfg(parallel_compiler)]
1803 use rustc_rayon_core as rayon_core;
1805 /// This is the implicit state of rustc. It contains the current
1806 /// TyCtxt and query. It is updated when creating a local interner or
1807 /// executing a new query. Whenever there's a TyCtxt value available
1808 /// you should also have access to an ImplicitCtxt through the functions
1811 pub struct ImplicitCtxt<'a, 'tcx> {
1812 /// The current TyCtxt. Initially created by `enter_global` and updated
1813 /// by `enter_local` with a new local interner
1814 pub tcx: TyCtxt<'tcx>,
1816 /// The current query job, if any. This is updated by JobOwner::start in
1817 /// ty::query::plumbing when executing a query
1818 pub query: Option<Lrc<query::QueryJob<'tcx>>>,
1820 /// Where to store diagnostics for the current query job, if any.
1821 /// This is updated by JobOwner::start in ty::query::plumbing when executing a query
1822 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1824 /// Used to prevent layout from recursing too deeply.
1825 pub layout_depth: usize,
1827 /// The current dep graph task. This is used to add dependencies to queries
1828 /// when executing them
1829 pub task_deps: Option<&'a Lock<TaskDeps>>,
1832 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1833 /// to `value` during the call to `f`. It is restored to its previous value after.
1834 /// This is used to set the pointer to the new ImplicitCtxt.
1835 #[cfg(parallel_compiler)]
1837 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1838 rayon_core::tlv::with(value, f)
1841 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1842 /// This is used to get the pointer to the current ImplicitCtxt.
1843 #[cfg(parallel_compiler)]
1845 fn get_tlv() -> usize {
1846 rayon_core::tlv::get()
1849 #[cfg(not(parallel_compiler))]
1851 /// A thread local variable which stores a pointer to the current ImplicitCtxt.
1852 static TLV: Cell<usize> = Cell::new(0);
1855 /// Sets TLV to `value` during the call to `f`.
1856 /// It is restored to its previous value after.
1857 /// This is used to set the pointer to the new ImplicitCtxt.
1858 #[cfg(not(parallel_compiler))]
1860 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1861 let old = get_tlv();
1862 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1863 TLV.with(|tlv| tlv.set(value));
1867 /// This is used to get the pointer to the current ImplicitCtxt.
1868 #[cfg(not(parallel_compiler))]
1869 fn get_tlv() -> usize {
1870 TLV.with(|tlv| tlv.get())
1873 /// This is a callback from libsyntax as it cannot access the implicit state
1874 /// in librustc otherwise
1875 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1877 if let Some(tcx) = tcx {
1878 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1880 syntax_pos::default_span_debug(span, f)
1885 /// This is a callback from libsyntax as it cannot access the implicit state
1886 /// in librustc otherwise. It is used to when diagnostic messages are
1887 /// emitted and stores them in the current query, if there is one.
1888 fn track_diagnostic(diagnostic: &Diagnostic) {
1889 with_context_opt(|icx| {
1890 if let Some(icx) = icx {
1891 if let Some(ref diagnostics) = icx.diagnostics {
1892 let mut diagnostics = diagnostics.lock();
1893 diagnostics.extend(Some(diagnostic.clone()));
1899 /// Sets up the callbacks from libsyntax on the current thread
1900 pub fn with_thread_locals<F, R>(f: F) -> R
1901 where F: FnOnce() -> R
1903 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1904 let original_span_debug = span_dbg.get();
1905 span_dbg.set(span_debug);
1907 let _on_drop = OnDrop(move || {
1908 span_dbg.set(original_span_debug);
1911 TRACK_DIAGNOSTICS.with(|current| {
1912 let original = current.get();
1913 current.set(track_diagnostic);
1915 let _on_drop = OnDrop(move || {
1916 current.set(original);
1924 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1926 pub fn enter_context<'a, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'tcx>, f: F) -> R
1928 F: FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
1930 set_tlv(context as *const _ as usize, || {
1935 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1936 /// creating a initial TyCtxt and ImplicitCtxt.
1937 /// This happens once per rustc session and TyCtxts only exists
1938 /// inside the `f` function.
1939 pub fn enter_global<'tcx, F, R>(gcx: &'tcx GlobalCtxt<'tcx>, f: F) -> R
1941 F: FnOnce(TyCtxt<'tcx>) -> R,
1943 // Update GCX_PTR to indicate there's a GlobalCtxt available
1944 GCX_PTR.with(|lock| {
1945 *lock.lock() = gcx as *const _ as usize;
1947 // Set GCX_PTR back to 0 when we exit
1948 let _on_drop = OnDrop(move || {
1949 GCX_PTR.with(|lock| *lock.lock() = 0);
1954 interners: &gcx.global_interners,
1957 let icx = ImplicitCtxt {
1964 enter_context(&icx, |_| {
1969 scoped_thread_local! {
1970 /// Stores a pointer to the GlobalCtxt if one is available.
1971 /// This is used to access the GlobalCtxt in the deadlock handler given to Rayon.
1972 pub static GCX_PTR: Lock<usize>
1975 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
1976 /// This is used in the deadlock handler.
1977 pub unsafe fn with_global<F, R>(f: F) -> R
1979 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
1981 let gcx = GCX_PTR.with(|lock| *lock.lock());
1983 let gcx = &*(gcx as *const GlobalCtxt<'_>);
1986 interners: &gcx.global_interners,
1989 let icx = ImplicitCtxt {
1996 enter_context(&icx, |_| f(tcx))
1999 /// Allows access to the current ImplicitCtxt in a closure if one is available
2001 pub fn with_context_opt<F, R>(f: F) -> R
2003 F: for<'a, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'tcx>>) -> R,
2005 let context = get_tlv();
2009 // We could get a ImplicitCtxt pointer from another thread.
2010 // Ensure that ImplicitCtxt is Sync
2011 sync::assert_sync::<ImplicitCtxt<'_, '_>>();
2013 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_>))) }
2017 /// Allows access to the current ImplicitCtxt.
2018 /// Panics if there is no ImplicitCtxt available
2020 pub fn with_context<F, R>(f: F) -> R
2022 F: for<'a, 'tcx> FnOnce(&ImplicitCtxt<'a, 'tcx>) -> R,
2024 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2027 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2028 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2029 /// with the same 'tcx lifetime as the TyCtxt passed in.
2030 /// This will panic if you pass it a TyCtxt which has a different global interner from
2031 /// the current ImplicitCtxt's tcx field.
2033 pub fn with_related_context<'tcx, F, R>(tcx: TyCtxt<'tcx>, f: F) -> R
2035 F: FnOnce(&ImplicitCtxt<'_, 'tcx>) -> R,
2037 with_context(|context| {
2039 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
2040 let context: &ImplicitCtxt<'_, '_> = mem::transmute(context);
2046 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2047 /// interner and local interner as the tcx argument passed in. This means the closure
2048 /// is given an ImplicitCtxt with the same 'tcx and 'tcx lifetimes as the TyCtxt passed in.
2049 /// This will panic if you pass it a TyCtxt which has a different global interner or
2050 /// a different local interner from the current ImplicitCtxt's tcx field.
2052 pub fn with_fully_related_context<'tcx, F, R>(tcx: TyCtxt<'tcx>, f: F) -> R
2054 F: for<'b> FnOnce(&ImplicitCtxt<'b, 'tcx>) -> R,
2056 with_context(|context| {
2058 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
2059 assert!(ptr_eq(context.tcx.interners, tcx.interners));
2060 let context: &ImplicitCtxt<'_, '_> = mem::transmute(context);
2066 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2067 /// Panics if there is no ImplicitCtxt available
2069 pub fn with<F, R>(f: F) -> R
2071 F: for<'tcx> FnOnce(TyCtxt<'tcx>) -> R,
2073 with_context(|context| f(context.tcx))
2076 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2077 /// The closure is passed None if there is no ImplicitCtxt available
2079 pub fn with_opt<F, R>(f: F) -> R
2081 F: for<'tcx> FnOnce(Option<TyCtxt<'tcx>>) -> R,
2083 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2087 macro_rules! sty_debug_print {
2088 ($ctxt: expr, $($variant: ident),*) => {{
2089 // curious inner module to allow variant names to be used as
2091 #[allow(non_snake_case)]
2093 use crate::ty::{self, TyCtxt};
2094 use crate::ty::context::Interned;
2096 #[derive(Copy, Clone)]
2105 pub fn go(tcx: TyCtxt<'_>) {
2106 let mut total = DebugStat {
2113 $(let mut $variant = total;)*
2115 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2116 let variant = match t.sty {
2117 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2118 ty::Float(..) | ty::Str | ty::Never => continue,
2119 ty::Error => /* unimportant */ continue,
2120 $(ty::$variant(..) => &mut $variant,)*
2122 let lt = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2123 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2124 let ct = t.flags.intersects(ty::TypeFlags::HAS_CT_INFER);
2128 if lt { total.lt_infer += 1; variant.lt_infer += 1 }
2129 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2130 if ct { total.ct_infer += 1; variant.ct_infer += 1 }
2131 if lt && ty && ct { total.all_infer += 1; variant.all_infer += 1 }
2133 println!("Ty interner total ty lt ct all");
2134 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2135 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2136 stringify!($variant),
2137 uses = $variant.total,
2138 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2139 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2140 lt = $variant.lt_infer as f64 * 100.0 / total.total as f64,
2141 ct = $variant.ct_infer as f64 * 100.0 / total.total as f64,
2142 all = $variant.all_infer as f64 * 100.0 / total.total as f64);
2144 println!(" total {uses:6} \
2145 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2147 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2148 lt = total.lt_infer as f64 * 100.0 / total.total as f64,
2149 ct = total.ct_infer as f64 * 100.0 / total.total as f64,
2150 all = total.all_infer as f64 * 100.0 / total.total as f64)
2158 impl<'tcx> TyCtxt<'tcx> {
2159 pub fn print_debug_stats(self) {
2162 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2163 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2164 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2166 println!("InternalSubsts interner: #{}", self.interners.substs.borrow().len());
2167 println!("Region interner: #{}", self.interners.region.borrow().len());
2168 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2169 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2170 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2175 /// An entry in an interner.
2176 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2178 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2179 fn clone(&self) -> Self {
2183 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2185 // N.B., an `Interned<Ty>` compares and hashes as a sty.
2186 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2187 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2188 self.0.sty == other.0.sty
2192 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2194 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2195 fn hash<H: Hasher>(&self, s: &mut H) {
2200 impl<'tcx> Borrow<TyKind<'tcx>> for Interned<'tcx, TyS<'tcx>> {
2201 fn borrow<'a>(&'a self) -> &'a TyKind<'tcx> {
2206 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2207 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2208 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2209 self.0[..] == other.0[..]
2213 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2215 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2216 fn hash<H: Hasher>(&self, s: &mut H) {
2221 impl<'tcx> Borrow<[Ty<'tcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2222 fn borrow<'a>(&'a self) -> &'a [Ty<'tcx>] {
2227 impl<'tcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2228 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2233 impl<'tcx> Borrow<[Kind<'tcx>]> for Interned<'tcx, InternalSubsts<'tcx>> {
2234 fn borrow<'a>(&'a self) -> &'a [Kind<'tcx>] {
2239 impl<'tcx> Borrow<[ProjectionKind]>
2240 for Interned<'tcx, List<ProjectionKind>> {
2241 fn borrow<'a>(&'a self) -> &'a [ProjectionKind] {
2246 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2247 fn borrow<'a>(&'a self) -> &'a RegionKind {
2252 impl<'tcx> Borrow<GoalKind<'tcx>> for Interned<'tcx, GoalKind<'tcx>> {
2253 fn borrow<'a>(&'a self) -> &'a GoalKind<'tcx> {
2258 impl<'tcx> Borrow<[ExistentialPredicate<'tcx>]>
2259 for Interned<'tcx, List<ExistentialPredicate<'tcx>>>
2261 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'tcx>] {
2266 impl<'tcx> Borrow<[Predicate<'tcx>]> for Interned<'tcx, List<Predicate<'tcx>>> {
2267 fn borrow<'a>(&'a self) -> &'a [Predicate<'tcx>] {
2272 impl<'tcx> Borrow<Const<'tcx>> for Interned<'tcx, Const<'tcx>> {
2273 fn borrow<'a>(&'a self) -> &'a Const<'tcx> {
2278 impl<'tcx> Borrow<[Clause<'tcx>]> for Interned<'tcx, List<Clause<'tcx>>> {
2279 fn borrow<'a>(&'a self) -> &'a [Clause<'tcx>] {
2284 impl<'tcx> Borrow<[Goal<'tcx>]> for Interned<'tcx, List<Goal<'tcx>>> {
2285 fn borrow<'a>(&'a self) -> &'a [Goal<'tcx>] {
2290 macro_rules! intern_method {
2291 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2294 $keep_in_local_tcx:expr) -> $ty:ty) => {
2295 impl<$lt_tcx> TyCtxt<$lt_tcx> {
2296 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2297 let key = ($alloc_to_key)(&v);
2299 // HACK(eddyb) Depend on flags being accurate to
2300 // determine that all contents are in the global tcx.
2301 // See comments on Lift for why we can't use that.
2302 if ($keep_in_local_tcx)(&v) {
2303 self.interners.$name.borrow_mut().intern_ref(key, || {
2304 // Make sure we don't end up with inference
2305 // types/regions in the global tcx.
2306 if self.is_global() {
2307 bug!("Attempted to intern `{:?}` which contains \
2308 inference types/regions in the global type context",
2312 Interned($alloc_method(&self.interners.arena, v))
2315 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2316 Interned($alloc_method(&self.global_interners.arena, v))
2324 macro_rules! direct_interners {
2325 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2326 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2327 fn eq(&self, other: &Self) -> bool {
2332 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2334 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2335 fn hash<H: Hasher>(&self, s: &mut H) {
2343 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2345 $keep_in_local_tcx) -> $ty);)+
2349 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2350 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2353 direct_interners!('tcx,
2354 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2355 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>,
2356 const_: mk_const(|c: &Const<'_>| keep_local(&c)) -> Const<'tcx>
2359 macro_rules! slice_interners {
2360 ($($field:ident: $method:ident($ty:ty)),+) => (
2361 $(intern_method!( 'tcx, $field: $method(
2363 |a, v| List::from_arena(a, v),
2365 |xs: &[$ty]| xs.iter().any(keep_local)) -> List<$ty>);)+
2370 existential_predicates: _intern_existential_predicates(ExistentialPredicate<'tcx>),
2371 predicates: _intern_predicates(Predicate<'tcx>),
2372 type_list: _intern_type_list(Ty<'tcx>),
2373 substs: _intern_substs(Kind<'tcx>),
2374 clauses: _intern_clauses(Clause<'tcx>),
2375 goal_list: _intern_goals(Goal<'tcx>),
2376 projs: _intern_projs(ProjectionKind)
2379 // This isn't a perfect fit: CanonicalVarInfo slices are always
2380 // allocated in the global arena, so this `intern_method!` macro is
2381 // overly general. But we just return false for the code that checks
2382 // whether they belong in the thread-local arena, so no harm done, and
2383 // seems better than open-coding the rest.
2386 canonical_var_infos: _intern_canonical_var_infos(
2387 &[CanonicalVarInfo],
2388 |a, v| List::from_arena(a, v),
2390 |_xs: &[CanonicalVarInfo]| -> bool { false }
2391 ) -> List<CanonicalVarInfo>
2394 impl<'tcx> TyCtxt<'tcx> {
2395 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2396 /// that is, a `fn` type that is equivalent in every way for being
2398 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2399 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2400 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2401 unsafety: hir::Unsafety::Unsafe,
2406 /// Given a closure signature `sig`, returns an equivalent `fn`
2407 /// type with the same signature. Detuples and so forth -- so
2408 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2409 /// a `fn(u32, i32)`.
2410 /// `unsafety` determines the unsafety of the `fn` type. If you pass
2411 /// `hir::Unsafety::Unsafe` in the previous example, then you would get
2412 /// an `unsafe fn (u32, i32)`.
2413 /// It cannot convert a closure that requires unsafe.
2414 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>, unsafety: hir::Unsafety) -> Ty<'tcx> {
2415 let converted_sig = sig.map_bound(|s| {
2416 let params_iter = match s.inputs()[0].sty {
2417 ty::Tuple(params) => {
2418 params.into_iter().map(|k| k.expect_ty())
2431 self.mk_fn_ptr(converted_sig)
2435 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2436 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2439 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2441 ast::IntTy::Isize => self.types.isize,
2442 ast::IntTy::I8 => self.types.i8,
2443 ast::IntTy::I16 => self.types.i16,
2444 ast::IntTy::I32 => self.types.i32,
2445 ast::IntTy::I64 => self.types.i64,
2446 ast::IntTy::I128 => self.types.i128,
2450 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2452 ast::UintTy::Usize => self.types.usize,
2453 ast::UintTy::U8 => self.types.u8,
2454 ast::UintTy::U16 => self.types.u16,
2455 ast::UintTy::U32 => self.types.u32,
2456 ast::UintTy::U64 => self.types.u64,
2457 ast::UintTy::U128 => self.types.u128,
2461 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2463 ast::FloatTy::F32 => self.types.f32,
2464 ast::FloatTy::F64 => self.types.f64,
2469 pub fn mk_str(self) -> Ty<'tcx> {
2474 pub fn mk_static_str(self) -> Ty<'tcx> {
2475 self.mk_imm_ref(self.lifetimes.re_static, self.mk_str())
2479 pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2480 // take a copy of substs so that we own the vectors inside
2481 self.mk_ty(Adt(def, substs))
2485 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2486 self.mk_ty(Foreign(def_id))
2489 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2490 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2491 let adt_def = self.adt_def(def_id);
2492 let substs = InternalSubsts::for_item(self, def_id, |param, substs| {
2494 GenericParamDefKind::Lifetime |
2495 GenericParamDefKind::Const => {
2498 GenericParamDefKind::Type { has_default, .. } => {
2499 if param.index == 0 {
2502 assert!(has_default);
2503 self.type_of(param.def_id).subst(self, substs).into()
2508 self.mk_ty(Adt(adt_def, substs))
2512 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2513 self.mk_ty(RawPtr(tm))
2517 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2518 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2522 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2523 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2527 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2528 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2532 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2533 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2537 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2538 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2542 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2543 self.mk_imm_ptr(self.mk_unit())
2547 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2548 self.mk_ty(Array(ty, ty::Const::from_usize(self.global_tcx(), n)))
2552 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2553 self.mk_ty(Slice(ty))
2557 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2558 let kinds: Vec<_> = ts.into_iter().map(|&t| Kind::from(t)).collect();
2559 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2562 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2563 iter.intern_with(|ts| {
2564 let kinds: Vec<_> = ts.into_iter().map(|&t| Kind::from(t)).collect();
2565 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2570 pub fn mk_unit(self) -> Ty<'tcx> {
2575 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2576 if self.features().never_type {
2579 self.intern_tup(&[])
2584 pub fn mk_bool(self) -> Ty<'tcx> {
2589 pub fn mk_fn_def(self, def_id: DefId,
2590 substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2591 self.mk_ty(FnDef(def_id, substs))
2595 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2596 self.mk_ty(FnPtr(fty))
2602 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2603 reg: ty::Region<'tcx>
2605 self.mk_ty(Dynamic(obj, reg))
2609 pub fn mk_projection(self,
2611 substs: SubstsRef<'tcx>)
2613 self.mk_ty(Projection(ProjectionTy {
2620 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2622 self.mk_ty(Closure(closure_id, closure_substs))
2626 pub fn mk_generator(self,
2628 generator_substs: GeneratorSubsts<'tcx>,
2629 movability: hir::GeneratorMovability)
2631 self.mk_ty(Generator(id, generator_substs, movability))
2635 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2636 self.mk_ty(GeneratorWitness(types))
2640 pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> {
2641 self.mk_ty_infer(TyVar(v))
2645 pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2646 self.mk_const(ty::Const {
2647 val: ConstValue::Infer(InferConst::Var(v)),
2653 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2654 self.mk_ty_infer(IntVar(v))
2658 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2659 self.mk_ty_infer(FloatVar(v))
2663 pub fn mk_ty_infer(self, it: InferTy) -> Ty<'tcx> {
2664 self.mk_ty(Infer(it))
2668 pub fn mk_const_infer(
2670 ic: InferConst<'tcx>,
2672 ) -> &'tcx ty::Const<'tcx> {
2673 self.mk_const(ty::Const {
2674 val: ConstValue::Infer(ic),
2680 pub fn mk_ty_param(self, index: u32, name: InternedString) -> Ty<'tcx> {
2681 self.mk_ty(Param(ParamTy { index, name: name }))
2685 pub fn mk_const_param(
2688 name: InternedString,
2690 ) -> &'tcx Const<'tcx> {
2691 self.mk_const(ty::Const {
2692 val: ConstValue::Param(ParamConst { index, name }),
2698 pub fn mk_self_type(self) -> Ty<'tcx> {
2699 self.mk_ty_param(0, kw::SelfUpper.as_interned_str())
2702 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2704 GenericParamDefKind::Lifetime => {
2705 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2707 GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
2708 GenericParamDefKind::Const => {
2709 self.mk_const_param(param.index, param.name, self.type_of(param.def_id)).into()
2715 pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2716 self.mk_ty(Opaque(def_id, substs))
2719 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2720 -> &'tcx List<ExistentialPredicate<'tcx>> {
2721 assert!(!eps.is_empty());
2722 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2723 self._intern_existential_predicates(eps)
2726 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2727 -> &'tcx List<Predicate<'tcx>> {
2728 // FIXME consider asking the input slice to be sorted to avoid
2729 // re-interning permutations, in which case that would be asserted
2731 if preds.len() == 0 {
2732 // The macro-generated method below asserts we don't intern an empty slice.
2735 self._intern_predicates(preds)
2739 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2743 self._intern_type_list(ts)
2747 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2751 self._intern_substs(ts)
2755 pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
2759 self._intern_projs(ps)
2763 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'tcx> {
2767 self.global_tcx()._intern_canonical_var_infos(ts)
2771 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2775 self._intern_clauses(ts)
2779 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2783 self._intern_goals(ts)
2787 pub fn mk_fn_sig<I>(self,
2791 unsafety: hir::Unsafety,
2793 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2795 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2797 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2798 inputs_and_output: self.intern_type_list(xs),
2799 c_variadic, unsafety, abi
2803 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2804 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2806 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2809 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2810 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2812 iter.intern_with(|xs| self.intern_predicates(xs))
2815 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2816 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2817 iter.intern_with(|xs| self.intern_type_list(xs))
2820 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2821 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2822 iter.intern_with(|xs| self.intern_substs(xs))
2825 pub fn mk_substs_trait(self,
2827 rest: &[Kind<'tcx>])
2830 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2833 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2834 iter.intern_with(|xs| self.intern_clauses(xs))
2837 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2838 iter.intern_with(|xs| self.intern_goals(xs))
2841 pub fn lint_hir<S: Into<MultiSpan>>(self,
2842 lint: &'static Lint,
2846 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2849 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2850 lint: &'static Lint,
2855 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2860 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2861 lint: &'static Lint,
2866 let mut err = self.struct_span_lint_hir(lint, id, span.into(), msg);
2871 /// Walks upwards from `id` to find a node which might change lint levels with attributes.
2872 /// It stops at `bound` and just returns it if reached.
2873 pub fn maybe_lint_level_root_bounded(
2882 if lint::maybe_lint_level_root(self, id) {
2885 let next = self.hir().get_parent_node_by_hir_id(id);
2887 bug!("lint traversal reached the root of the crate");
2893 pub fn lint_level_at_node(
2895 lint: &'static Lint,
2897 ) -> (lint::Level, lint::LintSource) {
2898 let sets = self.lint_levels(LOCAL_CRATE);
2900 if let Some(pair) = sets.level_and_source(lint, id, self.sess) {
2903 let next = self.hir().get_parent_node_by_hir_id(id);
2905 bug!("lint traversal reached the root of the crate");
2911 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2912 lint: &'static Lint,
2916 -> DiagnosticBuilder<'tcx>
2918 let (level, src) = self.lint_level_at_node(lint, hir_id);
2919 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2922 pub fn struct_lint_node(self, lint: &'static Lint, id: HirId, msg: &str)
2923 -> DiagnosticBuilder<'tcx>
2925 let (level, src) = self.lint_level_at_node(lint, id);
2926 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2929 pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx StableVec<TraitCandidate>> {
2930 self.in_scope_traits_map(id.owner)
2931 .and_then(|map| map.get(&id.local_id))
2934 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2935 self.named_region_map(id.owner)
2936 .and_then(|map| map.get(&id.local_id).cloned())
2939 pub fn is_late_bound(self, id: HirId) -> bool {
2940 self.is_late_bound_map(id.owner)
2941 .map(|set| set.contains(&id.local_id))
2945 pub fn object_lifetime_defaults(self, id: HirId) -> Option<&'tcx [ObjectLifetimeDefault]> {
2946 self.object_lifetime_defaults_map(id.owner)
2947 .and_then(|map| map.get(&id.local_id).map(|v| &**v))
2951 pub trait InternAs<T: ?Sized, R> {
2953 fn intern_with<F>(self, f: F) -> Self::Output
2954 where F: FnOnce(&T) -> R;
2957 impl<I, T, R, E> InternAs<[T], R> for I
2958 where E: InternIteratorElement<T, R>,
2959 I: Iterator<Item=E> {
2960 type Output = E::Output;
2961 fn intern_with<F>(self, f: F) -> Self::Output
2962 where F: FnOnce(&[T]) -> R {
2963 E::intern_with(self, f)
2967 pub trait InternIteratorElement<T, R>: Sized {
2969 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2972 impl<T, R> InternIteratorElement<T, R> for T {
2974 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2975 f(&iter.collect::<SmallVec<[_; 8]>>())
2979 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2983 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2984 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2988 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2989 type Output = Result<R, E>;
2990 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2991 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
2995 // We are comparing types with different invariant lifetimes, so `ptr::eq`
2996 // won't work for us.
2997 fn ptr_eq<T, U>(t: *const T, u: *const U) -> bool {
2998 t as *const () == u as *const ()
3001 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3002 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id);
3003 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).map(|v| &v[..]);
3004 providers.crate_name = |tcx, id| {
3005 assert_eq!(id, LOCAL_CRATE);
3008 providers.get_lib_features = |tcx, id| {
3009 assert_eq!(id, LOCAL_CRATE);
3010 tcx.arena.alloc(middle::lib_features::collect(tcx))
3012 providers.get_lang_items = |tcx, id| {
3013 assert_eq!(id, LOCAL_CRATE);
3014 tcx.arena.alloc(middle::lang_items::collect(tcx))
3016 providers.maybe_unused_trait_import = |tcx, id| {
3017 tcx.maybe_unused_trait_imports.contains(&id)
3019 providers.maybe_unused_extern_crates = |tcx, cnum| {
3020 assert_eq!(cnum, LOCAL_CRATE);
3021 &tcx.maybe_unused_extern_crates[..]
3023 providers.names_imported_by_glob_use = |tcx, id| {
3024 assert_eq!(id.krate, LOCAL_CRATE);
3025 Lrc::new(tcx.glob_map.get(&id).cloned().unwrap_or_default())
3028 providers.stability_index = |tcx, cnum| {
3029 assert_eq!(cnum, LOCAL_CRATE);
3030 tcx.arena.alloc(stability::Index::new(tcx))
3032 providers.lookup_stability = |tcx, id| {
3033 assert_eq!(id.krate, LOCAL_CRATE);
3034 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3035 tcx.stability().local_stability(id)
3037 providers.lookup_deprecation_entry = |tcx, id| {
3038 assert_eq!(id.krate, LOCAL_CRATE);
3039 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3040 tcx.stability().local_deprecation_entry(id)
3042 providers.extern_mod_stmt_cnum = |tcx, id| {
3043 let id = tcx.hir().as_local_node_id(id).unwrap();
3044 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3046 providers.all_crate_nums = |tcx, cnum| {
3047 assert_eq!(cnum, LOCAL_CRATE);
3048 tcx.arena.alloc_slice(&tcx.cstore.crates_untracked())
3050 providers.postorder_cnums = |tcx, cnum| {
3051 assert_eq!(cnum, LOCAL_CRATE);
3052 tcx.arena.alloc_slice(&tcx.cstore.postorder_cnums_untracked())
3054 providers.output_filenames = |tcx, cnum| {
3055 assert_eq!(cnum, LOCAL_CRATE);
3056 tcx.output_filenames.clone()
3058 providers.features_query = |tcx, cnum| {
3059 assert_eq!(cnum, LOCAL_CRATE);
3060 tcx.arena.alloc(tcx.sess.features_untracked().clone())
3062 providers.is_panic_runtime = |tcx, cnum| {
3063 assert_eq!(cnum, LOCAL_CRATE);
3064 attr::contains_name(tcx.hir().krate_attrs(), sym::panic_runtime)
3066 providers.is_compiler_builtins = |tcx, cnum| {
3067 assert_eq!(cnum, LOCAL_CRATE);
3068 attr::contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins)