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::{TypedArena, 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<'tcx> {
83 pub global: WorkerLocal<GlobalArenas<'tcx>>,
84 pub interner: SyncDroplessArena,
87 impl<'tcx> AllArenas<'tcx> {
88 pub fn new() -> Self {
90 global: WorkerLocal::new(|_| GlobalArenas::default()),
91 interner: SyncDroplessArena::default(),
98 pub struct GlobalArenas<'tcx> {
100 layout: TypedArena<LayoutDetails>,
103 generics: TypedArena<ty::Generics>,
104 trait_def: TypedArena<ty::TraitDef>,
105 adt_def: TypedArena<ty::AdtDef>,
106 steal_mir: TypedArena<Steal<Body<'tcx>>>,
107 mir: TypedArena<Body<'tcx>>,
108 tables: TypedArena<ty::TypeckTables<'tcx>>,
110 const_allocs: TypedArena<interpret::Allocation>,
113 type InternedSet<'tcx, T> = Lock<FxHashMap<Interned<'tcx, T>, ()>>;
115 pub struct CtxtInterners<'tcx> {
116 /// The arena that types, regions, etc are allocated from
117 arena: &'tcx SyncDroplessArena,
119 /// Specifically use a speedy hash algorithm for these hash sets,
120 /// they're accessed quite often.
121 type_: InternedSet<'tcx, TyS<'tcx>>,
122 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
123 substs: InternedSet<'tcx, InternalSubsts<'tcx>>,
124 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
125 region: InternedSet<'tcx, RegionKind>,
126 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
127 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
128 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
129 goal: InternedSet<'tcx, GoalKind<'tcx>>,
130 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
131 projs: InternedSet<'tcx, List<ProjectionKind>>,
132 const_: InternedSet<'tcx, Const<'tcx>>,
135 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
136 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
139 type_: Default::default(),
140 type_list: Default::default(),
141 substs: Default::default(),
142 region: Default::default(),
143 existential_predicates: Default::default(),
144 canonical_var_infos: Default::default(),
145 predicates: Default::default(),
146 clauses: Default::default(),
147 goal: Default::default(),
148 goal_list: Default::default(),
149 projs: Default::default(),
150 const_: Default::default(),
157 local: &CtxtInterners<'tcx>,
158 global: &CtxtInterners<'gcx>,
161 let flags = super::flags::FlagComputation::for_sty(&st);
163 // HACK(eddyb) Depend on flags being accurate to
164 // determine that all contents are in the global tcx.
165 // See comments on Lift for why we can't use that.
166 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
167 local.type_.borrow_mut().intern(st, |st| {
168 let ty_struct = TyS {
171 outer_exclusive_binder: flags.outer_exclusive_binder,
174 // Make sure we don't end up with inference
175 // types/regions in the global interner
176 if ptr_eq(local, global) {
177 bug!("Attempted to intern `{:?}` which contains \
178 inference types/regions in the global type context",
182 Interned(local.arena.alloc(ty_struct))
185 global.type_.borrow_mut().intern(st, |st| {
186 let ty_struct = TyS {
189 outer_exclusive_binder: flags.outer_exclusive_binder,
192 // This is safe because all the types the ty_struct can point to
193 // already is in the global arena
194 let ty_struct: TyS<'gcx> = unsafe {
195 mem::transmute(ty_struct)
198 Interned(global.arena.alloc(ty_struct))
204 pub struct Common<'tcx> {
205 pub empty_predicates: ty::GenericPredicates<'tcx>,
208 pub struct CommonTypes<'tcx> {
229 /// Dummy type used for the `Self` of a `TraitRef` created for converting
230 /// a trait object, and which gets removed in `ExistentialTraitRef`.
231 /// This type must not appear anywhere in other converted types.
232 pub trait_object_dummy_self: Ty<'tcx>,
235 pub struct CommonLifetimes<'tcx> {
236 pub re_empty: Region<'tcx>,
237 pub re_static: Region<'tcx>,
238 pub re_erased: Region<'tcx>,
241 pub struct CommonConsts<'tcx> {
242 pub err: &'tcx Const<'tcx>,
245 pub struct LocalTableInContext<'a, V: 'a> {
246 local_id_root: Option<DefId>,
247 data: &'a ItemLocalMap<V>
250 /// Validate that the given HirId (respectively its `local_id` part) can be
251 /// safely used as a key in the tables of a TypeckTable. For that to be
252 /// the case, the HirId must have the same `owner` as all the other IDs in
253 /// this table (signified by `local_id_root`). Otherwise the HirId
254 /// would be in a different frame of reference and using its `local_id`
255 /// would result in lookup errors, or worse, in silently wrong data being
257 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
260 if cfg!(debug_assertions) {
261 if let Some(local_id_root) = local_id_root {
262 if hir_id.owner != local_id_root.index {
263 ty::tls::with(|tcx| {
264 let node_id = tcx.hir().hir_to_node_id(hir_id);
266 bug!("node {} with HirId::owner {:?} cannot be placed in \
267 TypeckTables with local_id_root {:?}",
268 tcx.hir().node_to_string(node_id),
269 DefId::local(hir_id.owner),
274 // We use "Null Object" TypeckTables in some of the analysis passes.
275 // These are just expected to be empty and their `local_id_root` is
276 // `None`. Therefore we cannot verify whether a given `HirId` would
277 // be a valid key for the given table. Instead we make sure that
278 // nobody tries to write to such a Null Object table.
280 bug!("access to invalid TypeckTables")
286 impl<'a, V> LocalTableInContext<'a, V> {
287 pub fn contains_key(&self, id: hir::HirId) -> bool {
288 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
289 self.data.contains_key(&id.local_id)
292 pub fn get(&self, id: hir::HirId) -> Option<&V> {
293 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
294 self.data.get(&id.local_id)
297 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
302 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
305 fn index(&self, key: hir::HirId) -> &V {
306 self.get(key).expect("LocalTableInContext: key not found")
310 pub struct LocalTableInContextMut<'a, V: 'a> {
311 local_id_root: Option<DefId>,
312 data: &'a mut ItemLocalMap<V>
315 impl<'a, V> LocalTableInContextMut<'a, V> {
316 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
317 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
318 self.data.get_mut(&id.local_id)
321 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
322 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
323 self.data.entry(id.local_id)
326 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
327 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
328 self.data.insert(id.local_id, val)
331 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
332 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
333 self.data.remove(&id.local_id)
337 /// All information necessary to validate and reveal an `impl Trait` or `existential Type`
338 #[derive(RustcEncodable, RustcDecodable, Debug, HashStable)]
339 pub struct ResolvedOpaqueTy<'tcx> {
340 /// The revealed type as seen by this function.
341 pub concrete_type: Ty<'tcx>,
342 /// Generic parameters on the opaque type as passed by this function.
343 /// For `existential type Foo<A, B>; fn foo<T, U>() -> Foo<T, U> { .. }` this is `[T, U]`, not
345 pub substs: SubstsRef<'tcx>,
348 #[derive(RustcEncodable, RustcDecodable, Debug)]
349 pub struct TypeckTables<'tcx> {
350 /// The HirId::owner all ItemLocalIds in this table are relative to.
351 pub local_id_root: Option<DefId>,
353 /// Resolved definitions for `<T>::X` associated paths and
354 /// method calls, including those of overloaded operators.
355 type_dependent_defs: ItemLocalMap<Result<(DefKind, DefId), ErrorReported>>,
357 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
358 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
359 /// about the field you also need definition of the variant to which the field
360 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
361 field_indices: ItemLocalMap<usize>,
363 /// Stores the types for various nodes in the AST. Note that this table
364 /// is not guaranteed to be populated until after typeck. See
365 /// typeck::check::fn_ctxt for details.
366 node_types: ItemLocalMap<Ty<'tcx>>,
368 /// Stores the type parameters which were substituted to obtain the type
369 /// of this node. This only applies to nodes that refer to entities
370 /// parameterized by type parameters, such as generic fns, types, or
372 node_substs: ItemLocalMap<SubstsRef<'tcx>>,
374 /// This will either store the canonicalized types provided by the user
375 /// or the substitutions that the user explicitly gave (if any) attached
376 /// to `id`. These will not include any inferred values. The canonical form
377 /// is used to capture things like `_` or other unspecified values.
379 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
380 /// canonical substitutions would include only `for<X> { Vec<X> }`.
382 /// See also `AscribeUserType` statement in MIR.
383 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
385 /// Stores the canonicalized types provided by the user. See also
386 /// `AscribeUserType` statement in MIR.
387 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
389 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
391 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
392 pat_binding_modes: ItemLocalMap<BindingMode>,
394 /// Stores the types which were implicitly dereferenced in pattern binding modes
395 /// for later usage in HAIR lowering. For example,
398 /// match &&Some(5i32) {
403 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
406 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
407 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
410 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
412 /// Records the reasons that we picked the kind of each closure;
413 /// not all closures are present in the map.
414 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
416 /// For each fn, records the "liberated" types of its arguments
417 /// and return type. Liberated means that all bound regions
418 /// (including late-bound regions) are replaced with free
419 /// equivalents. This table is not used in codegen (since regions
420 /// are erased there) and hence is not serialized to metadata.
421 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
423 /// For each FRU expression, record the normalized types of the fields
424 /// of the struct - this is needed because it is non-trivial to
425 /// normalize while preserving regions. This table is used only in
426 /// MIR construction and hence is not serialized to metadata.
427 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
429 /// For every coercion cast we add the HIR node ID of the cast
430 /// expression to this set.
431 coercion_casts: ItemLocalSet,
433 /// Set of trait imports actually used in the method resolution.
434 /// This is used for warning unused imports. During type
435 /// checking, this `Lrc` should not be cloned: it must have a ref-count
436 /// of 1 so that we can insert things into the set mutably.
437 pub used_trait_imports: Lrc<DefIdSet>,
439 /// If any errors occurred while type-checking this body,
440 /// this field will be set to `true`.
441 pub tainted_by_errors: bool,
443 /// Stores the free-region relationships that were deduced from
444 /// its where-clauses and parameter types. These are then
445 /// read-again by borrowck.
446 pub free_region_map: FreeRegionMap<'tcx>,
448 /// All the existential types that are restricted to concrete types
450 pub concrete_existential_types: FxHashMap<DefId, ResolvedOpaqueTy<'tcx>>,
452 /// Given the closure ID this map provides the list of UpvarIDs used by it.
453 /// The upvarID contains the HIR node ID and it also contains the full path
454 /// leading to the member of the struct or tuple that is used instead of the
456 pub upvar_list: ty::UpvarListMap,
459 impl<'tcx> TypeckTables<'tcx> {
460 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
463 type_dependent_defs: Default::default(),
464 field_indices: Default::default(),
465 user_provided_types: Default::default(),
466 user_provided_sigs: Default::default(),
467 node_types: Default::default(),
468 node_substs: Default::default(),
469 adjustments: Default::default(),
470 pat_binding_modes: Default::default(),
471 pat_adjustments: Default::default(),
472 upvar_capture_map: Default::default(),
473 closure_kind_origins: Default::default(),
474 liberated_fn_sigs: Default::default(),
475 fru_field_types: Default::default(),
476 coercion_casts: Default::default(),
477 used_trait_imports: Lrc::new(Default::default()),
478 tainted_by_errors: false,
479 free_region_map: Default::default(),
480 concrete_existential_types: Default::default(),
481 upvar_list: Default::default(),
485 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
486 pub fn qpath_res(&self, qpath: &hir::QPath, id: hir::HirId) -> Res {
488 hir::QPath::Resolved(_, ref path) => path.res,
489 hir::QPath::TypeRelative(..) => self.type_dependent_def(id)
490 .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)),
494 pub fn type_dependent_defs(
496 ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> {
497 LocalTableInContext {
498 local_id_root: self.local_id_root,
499 data: &self.type_dependent_defs
503 pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> {
504 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
505 self.type_dependent_defs.get(&id.local_id).cloned().and_then(|r| r.ok())
508 pub fn type_dependent_def_id(&self, id: HirId) -> Option<DefId> {
509 self.type_dependent_def(id).map(|(_, def_id)| def_id)
512 pub fn type_dependent_defs_mut(
514 ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> {
515 LocalTableInContextMut {
516 local_id_root: self.local_id_root,
517 data: &mut self.type_dependent_defs
521 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
522 LocalTableInContext {
523 local_id_root: self.local_id_root,
524 data: &self.field_indices
528 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
529 LocalTableInContextMut {
530 local_id_root: self.local_id_root,
531 data: &mut self.field_indices
535 pub fn user_provided_types(
537 ) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
538 LocalTableInContext {
539 local_id_root: self.local_id_root,
540 data: &self.user_provided_types
544 pub fn user_provided_types_mut(
546 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
547 LocalTableInContextMut {
548 local_id_root: self.local_id_root,
549 data: &mut self.user_provided_types
553 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
554 LocalTableInContext {
555 local_id_root: self.local_id_root,
556 data: &self.node_types
560 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
561 LocalTableInContextMut {
562 local_id_root: self.local_id_root,
563 data: &mut self.node_types
567 pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
568 self.node_type_opt(id).unwrap_or_else(||
569 bug!("node_type: no type for node `{}`",
570 tls::with(|tcx| tcx.hir().hir_to_string(id)))
574 pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
575 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
576 self.node_types.get(&id.local_id).cloned()
579 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> {
580 LocalTableInContextMut {
581 local_id_root: self.local_id_root,
582 data: &mut self.node_substs
586 pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> {
587 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
588 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| InternalSubsts::empty())
591 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<SubstsRef<'tcx>> {
592 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
593 self.node_substs.get(&id.local_id).cloned()
596 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
597 // doesn't provide type parameter substitutions.
598 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
599 self.node_type(pat.hir_id)
602 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
603 self.node_type_opt(pat.hir_id)
606 // Returns the type of an expression as a monotype.
608 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
609 // some cases, we insert `Adjustment` annotations such as auto-deref or
610 // auto-ref. The type returned by this function does not consider such
611 // adjustments. See `expr_ty_adjusted()` instead.
613 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
614 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
615 // instead of "fn(ty) -> T with T = isize".
616 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
617 self.node_type(expr.hir_id)
620 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
621 self.node_type_opt(expr.hir_id)
624 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
625 LocalTableInContext {
626 local_id_root: self.local_id_root,
627 data: &self.adjustments
631 pub fn adjustments_mut(&mut self)
632 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
633 LocalTableInContextMut {
634 local_id_root: self.local_id_root,
635 data: &mut self.adjustments
639 pub fn expr_adjustments(&self, expr: &hir::Expr)
640 -> &[ty::adjustment::Adjustment<'tcx>] {
641 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
642 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
645 /// Returns the type of `expr`, considering any `Adjustment`
646 /// entry recorded for that expression.
647 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
648 self.expr_adjustments(expr)
650 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
653 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
654 self.expr_adjustments(expr)
656 .map(|adj| adj.target)
657 .or_else(|| self.expr_ty_opt(expr))
660 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
661 // Only paths and method calls/overloaded operators have
662 // entries in type_dependent_defs, ignore the former here.
663 if let hir::ExprKind::Path(_) = expr.node {
667 match self.type_dependent_defs().get(expr.hir_id) {
668 Some(Ok((DefKind::Method, _))) => true,
673 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
674 LocalTableInContext {
675 local_id_root: self.local_id_root,
676 data: &self.pat_binding_modes
680 pub fn pat_binding_modes_mut(&mut self)
681 -> LocalTableInContextMut<'_, BindingMode> {
682 LocalTableInContextMut {
683 local_id_root: self.local_id_root,
684 data: &mut self.pat_binding_modes
688 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
689 LocalTableInContext {
690 local_id_root: self.local_id_root,
691 data: &self.pat_adjustments,
695 pub fn pat_adjustments_mut(&mut self)
696 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
697 LocalTableInContextMut {
698 local_id_root: self.local_id_root,
699 data: &mut self.pat_adjustments,
703 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
704 self.upvar_capture_map[&upvar_id]
707 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
708 LocalTableInContext {
709 local_id_root: self.local_id_root,
710 data: &self.closure_kind_origins
714 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
715 LocalTableInContextMut {
716 local_id_root: self.local_id_root,
717 data: &mut self.closure_kind_origins
721 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
722 LocalTableInContext {
723 local_id_root: self.local_id_root,
724 data: &self.liberated_fn_sigs
728 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
729 LocalTableInContextMut {
730 local_id_root: self.local_id_root,
731 data: &mut self.liberated_fn_sigs
735 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
736 LocalTableInContext {
737 local_id_root: self.local_id_root,
738 data: &self.fru_field_types
742 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
743 LocalTableInContextMut {
744 local_id_root: self.local_id_root,
745 data: &mut self.fru_field_types
749 pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool {
750 validate_hir_id_for_typeck_tables(self.local_id_root, hir_id, true);
751 self.coercion_casts.contains(&hir_id.local_id)
754 pub fn set_coercion_cast(&mut self, id: ItemLocalId) {
755 self.coercion_casts.insert(id);
758 pub fn coercion_casts(&self) -> &ItemLocalSet {
764 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
765 fn hash_stable<W: StableHasherResult>(&self,
766 hcx: &mut StableHashingContext<'a>,
767 hasher: &mut StableHasher<W>) {
768 let ty::TypeckTables {
770 ref type_dependent_defs,
772 ref user_provided_types,
773 ref user_provided_sigs,
777 ref pat_binding_modes,
779 ref upvar_capture_map,
780 ref closure_kind_origins,
781 ref liberated_fn_sigs,
786 ref used_trait_imports,
789 ref concrete_existential_types,
794 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
795 type_dependent_defs.hash_stable(hcx, hasher);
796 field_indices.hash_stable(hcx, hasher);
797 user_provided_types.hash_stable(hcx, hasher);
798 user_provided_sigs.hash_stable(hcx, hasher);
799 node_types.hash_stable(hcx, hasher);
800 node_substs.hash_stable(hcx, hasher);
801 adjustments.hash_stable(hcx, hasher);
802 pat_binding_modes.hash_stable(hcx, hasher);
803 pat_adjustments.hash_stable(hcx, hasher);
804 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
811 local_id_root.expect("trying to hash invalid TypeckTables");
813 let var_owner_def_id = DefId {
814 krate: local_id_root.krate,
815 index: var_path.hir_id.owner,
817 let closure_def_id = DefId {
818 krate: local_id_root.krate,
819 index: closure_expr_id.to_def_id().index,
821 (hcx.def_path_hash(var_owner_def_id),
822 var_path.hir_id.local_id,
823 hcx.def_path_hash(closure_def_id))
826 closure_kind_origins.hash_stable(hcx, hasher);
827 liberated_fn_sigs.hash_stable(hcx, hasher);
828 fru_field_types.hash_stable(hcx, hasher);
829 coercion_casts.hash_stable(hcx, hasher);
830 used_trait_imports.hash_stable(hcx, hasher);
831 tainted_by_errors.hash_stable(hcx, hasher);
832 free_region_map.hash_stable(hcx, hasher);
833 concrete_existential_types.hash_stable(hcx, hasher);
834 upvar_list.hash_stable(hcx, hasher);
840 pub struct UserTypeAnnotationIndex {
842 DEBUG_FORMAT = "UserType({})",
843 const START_INDEX = 0,
847 /// Mapping of type annotation indices to canonical user type annotations.
848 pub type CanonicalUserTypeAnnotations<'tcx> =
849 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
851 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
852 pub struct CanonicalUserTypeAnnotation<'tcx> {
853 pub user_ty: CanonicalUserType<'tcx>,
855 pub inferred_ty: Ty<'tcx>,
858 BraceStructTypeFoldableImpl! {
859 impl<'tcx> TypeFoldable<'tcx> for CanonicalUserTypeAnnotation<'tcx> {
860 user_ty, span, inferred_ty
864 BraceStructLiftImpl! {
865 impl<'a, 'tcx> Lift<'tcx> for CanonicalUserTypeAnnotation<'a> {
866 type Lifted = CanonicalUserTypeAnnotation<'tcx>;
867 user_ty, span, inferred_ty
872 /// Canonicalized user type annotation.
873 pub type CanonicalUserType<'gcx> = Canonical<'gcx, UserType<'gcx>>;
875 impl CanonicalUserType<'gcx> {
876 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
877 /// i.e., each thing is mapped to a canonical variable with the same index.
878 pub fn is_identity(&self) -> bool {
880 UserType::Ty(_) => false,
881 UserType::TypeOf(_, user_substs) => {
882 if user_substs.user_self_ty.is_some() {
886 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
887 match kind.unpack() {
888 UnpackedKind::Type(ty) => match ty.sty {
889 ty::Bound(debruijn, b) => {
890 // We only allow a `ty::INNERMOST` index in substitutions.
891 assert_eq!(debruijn, ty::INNERMOST);
897 UnpackedKind::Lifetime(r) => match r {
898 ty::ReLateBound(debruijn, br) => {
899 // We only allow a `ty::INNERMOST` index in substitutions.
900 assert_eq!(*debruijn, ty::INNERMOST);
901 cvar == br.assert_bound_var()
906 UnpackedKind::Const(ct) => match ct.val {
907 ConstValue::Infer(InferConst::Canonical(debruijn, b)) => {
908 // We only allow a `ty::INNERMOST` index in substitutions.
909 assert_eq!(debruijn, ty::INNERMOST);
921 /// A user-given type annotation attached to a constant. These arise
922 /// from constants that are named via paths, like `Foo::<A>::new` and
924 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
925 pub enum UserType<'tcx> {
928 /// The canonical type is the result of `type_of(def_id)` with the
929 /// given substitutions applied.
930 TypeOf(DefId, UserSubsts<'tcx>),
933 EnumTypeFoldableImpl! {
934 impl<'tcx> TypeFoldable<'tcx> for UserType<'tcx> {
936 (UserType::TypeOf)(def, substs),
941 impl<'a, 'tcx> Lift<'tcx> for UserType<'a> {
942 type Lifted = UserType<'tcx>;
944 (UserType::TypeOf)(def, substs),
948 impl<'tcx> CommonTypes<'tcx> {
949 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
950 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
953 unit: mk(Tuple(List::empty())),
958 isize: mk(Int(ast::IntTy::Isize)),
959 i8: mk(Int(ast::IntTy::I8)),
960 i16: mk(Int(ast::IntTy::I16)),
961 i32: mk(Int(ast::IntTy::I32)),
962 i64: mk(Int(ast::IntTy::I64)),
963 i128: mk(Int(ast::IntTy::I128)),
964 usize: mk(Uint(ast::UintTy::Usize)),
965 u8: mk(Uint(ast::UintTy::U8)),
966 u16: mk(Uint(ast::UintTy::U16)),
967 u32: mk(Uint(ast::UintTy::U32)),
968 u64: mk(Uint(ast::UintTy::U64)),
969 u128: mk(Uint(ast::UintTy::U128)),
970 f32: mk(Float(ast::FloatTy::F32)),
971 f64: mk(Float(ast::FloatTy::F64)),
973 trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
978 impl<'tcx> CommonLifetimes<'tcx> {
979 fn new(interners: &CtxtInterners<'tcx>) -> CommonLifetimes<'tcx> {
981 interners.region.borrow_mut().intern(r, |r| {
982 Interned(interners.arena.alloc(r))
987 re_empty: mk(RegionKind::ReEmpty),
988 re_static: mk(RegionKind::ReStatic),
989 re_erased: mk(RegionKind::ReErased),
994 impl<'tcx> CommonConsts<'tcx> {
995 fn new(interners: &CtxtInterners<'tcx>, types: &CommonTypes<'tcx>) -> CommonConsts<'tcx> {
997 interners.const_.borrow_mut().intern(c, |c| {
998 Interned(interners.arena.alloc(c))
1003 err: mk_const(ty::Const {
1004 val: ConstValue::Scalar(Scalar::zst()),
1011 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
1014 pub struct FreeRegionInfo {
1015 // def id corresponding to FreeRegion
1017 // the bound region corresponding to FreeRegion
1018 pub boundregion: ty::BoundRegion,
1019 // checks if bound region is in Impl Item
1020 pub is_impl_item: bool,
1023 /// The central data structure of the compiler. It stores references
1024 /// to the various **arenas** and also houses the results of the
1025 /// various **compiler queries** that have been performed. See the
1026 /// [rustc guide] for more details.
1028 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
1029 #[derive(Copy, Clone)]
1030 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
1031 gcx: &'gcx GlobalCtxt<'gcx>,
1032 interners: &'tcx CtxtInterners<'tcx>,
1033 dummy: PhantomData<&'a ()>,
1036 impl<'gcx> Deref for TyCtxt<'_, 'gcx, '_> {
1037 type Target = &'gcx GlobalCtxt<'gcx>;
1039 fn deref(&self) -> &Self::Target {
1044 pub struct GlobalCtxt<'tcx> {
1045 pub arena: WorkerLocal<Arena<'tcx>>,
1046 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
1047 global_interners: CtxtInterners<'tcx>,
1049 cstore: &'tcx CrateStoreDyn,
1051 pub sess: &'tcx Session,
1053 pub dep_graph: DepGraph,
1056 pub common: Common<'tcx>,
1058 /// Common types, pre-interned for your convenience.
1059 pub types: CommonTypes<'tcx>,
1061 /// Common lifetimes, pre-interned for your convenience.
1062 pub lifetimes: CommonLifetimes<'tcx>,
1064 /// Common consts, pre-interned for your convenience.
1065 pub consts: CommonConsts<'tcx>,
1067 /// Map indicating what traits are in scope for places where this
1068 /// is relevant; generated by resolve.
1069 trait_map: FxHashMap<DefIndex,
1070 FxHashMap<ItemLocalId,
1071 StableVec<TraitCandidate>>>,
1073 /// Export map produced by name resolution.
1074 export_map: FxHashMap<DefId, Vec<Export<hir::HirId>>>,
1076 hir_map: hir_map::Map<'tcx>,
1078 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
1079 /// as well as all upstream crates. Only populated in incremental mode.
1080 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
1082 pub queries: query::Queries<'tcx>,
1084 // Records the captured variables referenced by every closure
1085 // expression. Do not track deps for this, just recompute it from
1086 // scratch every time.
1087 upvars: FxHashMap<DefId, Vec<hir::Upvar>>,
1089 maybe_unused_trait_imports: FxHashSet<DefId>,
1090 maybe_unused_extern_crates: Vec<(DefId, Span)>,
1091 /// A map of glob use to a set of names it actually imports. Currently only
1092 /// used in save-analysis.
1093 glob_map: FxHashMap<DefId, FxHashSet<ast::Name>>,
1094 /// Extern prelude entries. The value is `true` if the entry was introduced
1095 /// via `extern crate` item and not `--extern` option or compiler built-in.
1096 pub extern_prelude: FxHashMap<ast::Name, bool>,
1098 // Internal cache for metadata decoding. No need to track deps on this.
1099 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
1101 /// Caches the results of trait selection. This cache is used
1102 /// for things that do not have to do with the parameters in scope.
1103 pub selection_cache: traits::SelectionCache<'tcx>,
1105 /// Caches the results of trait evaluation. This cache is used
1106 /// for things that do not have to do with the parameters in scope.
1107 /// Merge this with `selection_cache`?
1108 pub evaluation_cache: traits::EvaluationCache<'tcx>,
1110 /// The definite name of the current crate after taking into account
1111 /// attributes, commandline parameters, etc.
1112 pub crate_name: Symbol,
1114 /// Data layout specification for the current target.
1115 pub data_layout: TargetDataLayout,
1117 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
1119 /// Stores the value of constants (and deduplicates the actual memory)
1120 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
1122 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1124 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
1126 /// A general purpose channel to throw data out the back towards LLVM worker
1129 /// This is intended to only get used during the codegen phase of the compiler
1130 /// when satisfying the query for a particular codegen unit. Internally in
1131 /// the query it'll send data along this channel to get processed later.
1132 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
1134 output_filenames: Arc<OutputFilenames>,
1137 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1138 /// Gets the global `TyCtxt`.
1140 pub fn global_tcx(self) -> TyCtxt<'gcx, 'gcx, 'gcx> {
1143 interners: &self.gcx.global_interners,
1149 pub fn hir(self) -> &'a hir_map::Map<'gcx> {
1153 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
1154 self.global_arenas.generics.alloc(generics)
1157 pub fn alloc_steal_mir(self, mir: Body<'gcx>) -> &'gcx Steal<Body<'gcx>> {
1158 self.global_arenas.steal_mir.alloc(Steal::new(mir))
1161 pub fn alloc_mir(self, mir: Body<'gcx>) -> &'gcx Body<'gcx> {
1162 self.global_arenas.mir.alloc(mir)
1165 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1166 self.global_arenas.tables.alloc(tables)
1169 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1170 self.global_arenas.trait_def.alloc(def)
1173 pub fn alloc_adt_def(self,
1176 variants: IndexVec<VariantIdx, ty::VariantDef>,
1178 -> &'gcx ty::AdtDef {
1179 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1180 self.global_arenas.adt_def.alloc(def)
1183 pub fn intern_const_alloc(self, alloc: Allocation) -> &'gcx Allocation {
1184 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1185 self.global_arenas.const_allocs.alloc(alloc)
1189 /// Allocates a byte or string literal for `mir::interpret`, read-only
1190 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1191 // create an allocation that just contains these bytes
1192 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes, ());
1193 let alloc = self.intern_const_alloc(alloc);
1194 self.alloc_map.lock().allocate(alloc)
1197 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1198 self.stability_interner.borrow_mut().intern(stab, |stab| {
1199 self.global_interners.arena.alloc(stab)
1203 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1204 self.layout_interner.borrow_mut().intern(layout, |layout| {
1205 self.global_arenas.layout.alloc(layout)
1209 /// Returns a range of the start/end indices specified with the
1210 /// `rustc_layout_scalar_valid_range` attribute.
1211 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1212 let attrs = self.get_attrs(def_id);
1214 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1216 None => return Bound::Unbounded,
1218 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1219 match meta.literal().expect("attribute takes lit").node {
1220 ast::LitKind::Int(a, _) => return Bound::Included(a),
1221 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1224 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1226 (get(sym::rustc_layout_scalar_valid_range_start),
1227 get(sym::rustc_layout_scalar_valid_range_end))
1230 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1231 value.lift_to_tcx(self)
1234 /// Like lift, but only tries in the global tcx.
1235 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1236 value.lift_to_tcx(self.global_tcx())
1239 /// Returns `true` if self is the same as self.global_tcx().
1240 fn is_global(self) -> bool {
1241 ptr_eq(self.interners, &self.global_interners)
1244 /// Creates a type context and call the closure with a `TyCtxt` reference
1245 /// to the context. The closure enforces that the type context and any interned
1246 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1247 /// reference to the context, to allow formatting values that need it.
1248 pub fn create_global_ctxt(
1250 cstore: &'tcx CrateStoreDyn,
1251 local_providers: ty::query::Providers<'tcx>,
1252 extern_providers: ty::query::Providers<'tcx>,
1253 arenas: &'tcx AllArenas<'tcx>,
1254 resolutions: ty::Resolutions,
1255 hir: hir_map::Map<'tcx>,
1256 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1258 tx: mpsc::Sender<Box<dyn Any + Send>>,
1259 output_filenames: &OutputFilenames,
1260 ) -> GlobalCtxt<'tcx> {
1261 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1264 let interners = CtxtInterners::new(&arenas.interner);
1265 let common = Common {
1266 empty_predicates: ty::GenericPredicates {
1271 let common_types = CommonTypes::new(&interners);
1272 let common_lifetimes = CommonLifetimes::new(&interners);
1273 let common_consts = CommonConsts::new(&interners, &common_types);
1274 let dep_graph = hir.dep_graph.clone();
1275 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1276 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1277 providers[LOCAL_CRATE] = local_providers;
1279 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1280 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1283 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1286 let def_path_tables = || {
1287 upstream_def_path_tables
1289 .map(|&(cnum, ref rc)| (cnum, &**rc))
1290 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1293 // Precompute the capacity of the hashmap so we don't have to
1294 // re-allocate when populating it.
1295 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1297 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1299 ::std::default::Default::default()
1302 for (cnum, def_path_table) in def_path_tables() {
1303 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1311 let mut trait_map: FxHashMap<_, FxHashMap<_, _>> = FxHashMap::default();
1312 for (k, v) in resolutions.trait_map {
1313 let hir_id = hir.node_to_hir_id(k);
1314 let map = trait_map.entry(hir_id.owner).or_default();
1315 map.insert(hir_id.local_id, StableVec::new(v));
1321 arena: WorkerLocal::new(|_| Arena::default()),
1322 global_arenas: &arenas.global,
1323 global_interners: interners,
1326 types: common_types,
1327 lifetimes: common_lifetimes,
1328 consts: common_consts,
1330 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1331 let exports: Vec<_> = v.into_iter().map(|e| {
1332 e.map_id(|id| hir.node_to_hir_id(id))
1336 upvars: resolutions.upvars.into_iter().map(|(k, v)| {
1337 let vars: Vec<_> = v.into_iter().map(|e| {
1338 e.map_id(|id| hir.node_to_hir_id(id))
1340 (hir.local_def_id(k), vars)
1342 maybe_unused_trait_imports:
1343 resolutions.maybe_unused_trait_imports
1345 .map(|id| hir.local_def_id(id))
1347 maybe_unused_extern_crates:
1348 resolutions.maybe_unused_extern_crates
1350 .map(|(id, sp)| (hir.local_def_id(id), sp))
1352 glob_map: resolutions.glob_map.into_iter().map(|(id, names)| {
1353 (hir.local_def_id(id), names)
1355 extern_prelude: resolutions.extern_prelude,
1357 def_path_hash_to_def_id,
1358 queries: query::Queries::new(
1361 on_disk_query_result_cache,
1363 rcache: Default::default(),
1364 selection_cache: Default::default(),
1365 evaluation_cache: Default::default(),
1366 crate_name: Symbol::intern(crate_name),
1368 layout_interner: Default::default(),
1369 stability_interner: Default::default(),
1370 allocation_interner: Default::default(),
1371 alloc_map: Lock::new(interpret::AllocMap::new()),
1372 tx_to_llvm_workers: Lock::new(tx),
1373 output_filenames: Arc::new(output_filenames.clone()),
1377 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1378 let cname = self.crate_name(LOCAL_CRATE).as_str();
1379 self.sess.consider_optimizing(&cname, msg)
1382 pub fn lib_features(self) -> &'gcx middle::lib_features::LibFeatures {
1383 self.get_lib_features(LOCAL_CRATE)
1386 pub fn lang_items(self) -> &'gcx middle::lang_items::LanguageItems {
1387 self.get_lang_items(LOCAL_CRATE)
1390 /// Due to missing llvm support for lowering 128 bit math to software emulation
1391 /// (on some targets), the lowering can be done in MIR.
1393 /// This function only exists until said support is implemented.
1394 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1395 let items = self.lang_items();
1396 let def_id = Some(def_id);
1397 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1398 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1399 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1400 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1401 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1402 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1403 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1404 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1405 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1406 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1407 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1408 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1409 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1410 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1411 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1412 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1413 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1414 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1415 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1416 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1417 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1418 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1419 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1420 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1424 pub fn stability(self) -> &'gcx stability::Index<'gcx> {
1425 self.stability_index(LOCAL_CRATE)
1428 pub fn crates(self) -> &'gcx [CrateNum] {
1429 self.all_crate_nums(LOCAL_CRATE)
1432 pub fn features(self) -> &'gcx feature_gate::Features {
1433 self.features_query(LOCAL_CRATE)
1436 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1438 self.hir().def_key(id)
1440 self.cstore.def_key(id)
1444 /// Converts a `DefId` into its fully expanded `DefPath` (every
1445 /// `DefId` is really just an interned def-path).
1447 /// Note that if `id` is not local to this crate, the result will
1448 /// be a non-local `DefPath`.
1449 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1451 self.hir().def_path(id)
1453 self.cstore.def_path(id)
1457 /// Returns whether or not the crate with CrateNum 'cnum'
1458 /// is marked as a private dependency
1459 pub fn is_private_dep(self, cnum: CrateNum) -> bool {
1460 if cnum == LOCAL_CRATE {
1463 self.cstore.crate_is_private_dep_untracked(cnum)
1468 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1469 if def_id.is_local() {
1470 self.hir().definitions().def_path_hash(def_id.index)
1472 self.cstore.def_path_hash(def_id)
1476 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1477 // We are explicitly not going through queries here in order to get
1478 // crate name and disambiguator since this code is called from debug!()
1479 // statements within the query system and we'd run into endless
1480 // recursion otherwise.
1481 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1482 (self.crate_name.clone(),
1483 self.sess.local_crate_disambiguator())
1485 (self.cstore.crate_name_untracked(def_id.krate),
1486 self.cstore.crate_disambiguator_untracked(def_id.krate))
1491 // Don't print the whole crate disambiguator. That's just
1492 // annoying in debug output.
1493 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1494 self.def_path(def_id).to_string_no_crate())
1497 pub fn metadata_encoding_version(self) -> Vec<u8> {
1498 self.cstore.metadata_encoding_version().to_vec()
1501 // Note that this is *untracked* and should only be used within the query
1502 // system if the result is otherwise tracked through queries
1503 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1504 self.cstore.crate_data_as_rc_any(cnum)
1508 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1509 let krate = self.gcx.hir_map.forest.untracked_krate();
1511 StableHashingContext::new(self.sess,
1513 self.hir().definitions(),
1517 // This method makes sure that we have a DepNode and a Fingerprint for
1518 // every upstream crate. It needs to be called once right after the tcx is
1520 // With full-fledged red/green, the method will probably become unnecessary
1521 // as this will be done on-demand.
1522 pub fn allocate_metadata_dep_nodes(self) {
1523 // We cannot use the query versions of crates() and crate_hash(), since
1524 // those would need the DepNodes that we are allocating here.
1525 for cnum in self.cstore.crates_untracked() {
1526 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1527 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1528 self.dep_graph.with_task(dep_node,
1531 |_, x| x, // No transformation needed
1532 dep_graph::hash_result,
1537 pub fn serialize_query_result_cache<E>(self,
1539 -> Result<(), E::Error>
1540 where E: ty::codec::TyEncoder
1542 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1545 /// If true, we should use the AST-based borrowck (we may *also* use
1546 /// the MIR-based borrowck).
1547 pub fn use_ast_borrowck(self) -> bool {
1548 self.borrowck_mode().use_ast()
1551 /// If true, we should use the MIR-based borrow check, but also
1552 /// fall back on the AST borrow check if the MIR-based one errors.
1553 pub fn migrate_borrowck(self) -> bool {
1554 self.borrowck_mode().migrate()
1557 /// If true, make MIR codegen for `match` emit a temp that holds a
1558 /// borrow of the input to the match expression.
1559 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1560 self.emit_read_for_match()
1563 /// If true, make MIR codegen for `match` emit FakeRead
1564 /// statements (which simulate the maximal effect of executing the
1565 /// patterns in a match arm).
1566 pub fn emit_read_for_match(&self) -> bool {
1567 !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1570 /// What mode(s) of borrowck should we run? AST? MIR? both?
1571 /// (Also considers the `#![feature(nll)]` setting.)
1572 pub fn borrowck_mode(&self) -> BorrowckMode {
1573 // Here are the main constraints we need to deal with:
1575 // 1. An opts.borrowck_mode of `BorrowckMode::Migrate` is
1576 // synonymous with no `-Z borrowck=...` flag at all.
1578 // 2. We want to allow developers on the Nightly channel
1579 // to opt back into the "hard error" mode for NLL,
1580 // (which they can do via specifying `#![feature(nll)]`
1581 // explicitly in their crate).
1583 // So, this precedence list is how pnkfelix chose to work with
1584 // the above constraints:
1586 // * `#![feature(nll)]` *always* means use NLL with hard
1587 // errors. (To simplify the code here, it now even overrides
1588 // a user's attempt to specify `-Z borrowck=compare`, which
1589 // we arguably do not need anymore and should remove.)
1591 // * Otherwise, if no `-Z borrowck=...` then use migrate mode
1593 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1595 if self.features().nll { return BorrowckMode::Mir; }
1597 self.sess.opts.borrowck_mode
1601 pub fn local_crate_exports_generics(self) -> bool {
1602 debug_assert!(self.sess.opts.share_generics());
1604 self.sess.crate_types.borrow().iter().any(|crate_type| {
1606 CrateType::Executable |
1607 CrateType::Staticlib |
1608 CrateType::ProcMacro |
1609 CrateType::Cdylib => false,
1611 CrateType::Dylib => true,
1616 // This method returns the DefId and the BoundRegion corresponding to the given region.
1617 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1618 let (suitable_region_binding_scope, bound_region) = match *region {
1619 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1620 ty::ReEarlyBound(ref ebr) => (
1621 self.parent(ebr.def_id).unwrap(),
1622 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1624 _ => return None, // not a free region
1627 let hir_id = self.hir()
1628 .as_local_hir_id(suitable_region_binding_scope)
1630 let is_impl_item = match self.hir().find_by_hir_id(hir_id) {
1631 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1632 Some(Node::ImplItem(..)) => {
1633 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1638 return Some(FreeRegionInfo {
1639 def_id: suitable_region_binding_scope,
1640 boundregion: bound_region,
1641 is_impl_item: is_impl_item,
1645 pub fn return_type_impl_trait(
1647 scope_def_id: DefId,
1648 ) -> Option<Ty<'tcx>> {
1649 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1650 let hir_id = self.hir().as_local_hir_id(scope_def_id).unwrap();
1651 match self.hir().get_by_hir_id(hir_id) {
1652 Node::Item(item) => {
1654 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1660 _ => { /* type_of_def_id() will work or panic */ }
1663 let ret_ty = self.type_of(scope_def_id);
1665 ty::FnDef(_, _) => {
1666 let sig = ret_ty.fn_sig(*self);
1667 let output = self.erase_late_bound_regions(&sig.output());
1668 if output.is_impl_trait() {
1678 // Here we check if the bound region is in Impl Item.
1679 pub fn is_bound_region_in_impl_item(
1681 suitable_region_binding_scope: DefId,
1683 let container_id = self.associated_item(suitable_region_binding_scope)
1686 if self.impl_trait_ref(container_id).is_some() {
1687 // For now, we do not try to target impls of traits. This is
1688 // because this message is going to suggest that the user
1689 // change the fn signature, but they may not be free to do so,
1690 // since the signature must match the trait.
1692 // FIXME(#42706) -- in some cases, we could do better here.
1698 /// Determine whether identifiers in the assembly have strict naming rules.
1699 /// Currently, only NVPTX* targets need it.
1700 pub fn has_strict_asm_symbol_naming(&self) -> bool {
1701 self.gcx.sess.target.target.arch.contains("nvptx")
1705 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1706 pub fn encode_metadata(self)
1709 self.cstore.encode_metadata(self)
1713 impl<'gcx> GlobalCtxt<'gcx> {
1714 /// Call the closure with a local `TyCtxt` using the given arena.
1715 /// `interners` is a slot passed so we can create a CtxtInterners
1716 /// with the same lifetime as `arena`.
1717 pub fn enter_local<'tcx, F, R>(
1719 arena: &'tcx SyncDroplessArena,
1720 interners: &'tcx mut Option<CtxtInterners<'tcx>>,
1724 F: FnOnce(TyCtxt<'tcx, 'gcx, 'tcx>) -> R,
1727 *interners = Some(CtxtInterners::new(&arena));
1730 interners: interners.as_ref().unwrap(),
1733 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1734 let new_icx = ty::tls::ImplicitCtxt {
1736 query: icx.query.clone(),
1737 diagnostics: icx.diagnostics,
1738 layout_depth: icx.layout_depth,
1739 task_deps: icx.task_deps,
1741 ty::tls::enter_context(&new_icx, |_| {
1748 /// A trait implemented for all X<'a> types which can be safely and
1749 /// efficiently converted to X<'tcx> as long as they are part of the
1750 /// provided TyCtxt<'tcx>.
1751 /// This can be done, for example, for Ty<'tcx> or SubstsRef<'tcx>
1752 /// by looking them up in their respective interners.
1754 /// However, this is still not the best implementation as it does
1755 /// need to compare the components, even for interned values.
1756 /// It would be more efficient if TypedArena provided a way to
1757 /// determine whether the address is in the allocated range.
1759 /// None is returned if the value or one of the components is not part
1760 /// of the provided context.
1761 /// For Ty, None can be returned if either the type interner doesn't
1762 /// contain the TyKind key or if the address of the interned
1763 /// pointer differs. The latter case is possible if a primitive type,
1764 /// e.g., `()` or `u8`, was interned in a different context.
1765 pub trait Lift<'tcx>: fmt::Debug {
1766 type Lifted: fmt::Debug + 'tcx;
1767 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1771 macro_rules! nop_lift {
1772 ($ty:ty => $lifted:ty) => {
1773 impl<'a, 'tcx> Lift<'tcx> for $ty {
1774 type Lifted = $lifted;
1775 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1776 if tcx.interners.arena.in_arena(*self as *const _) {
1777 return Some(unsafe { mem::transmute(*self) });
1779 // Also try in the global tcx if we're not that.
1780 if !tcx.is_global() {
1781 self.lift_to_tcx(tcx.global_tcx())
1790 macro_rules! nop_list_lift {
1791 ($ty:ty => $lifted:ty) => {
1792 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1793 type Lifted = &'tcx List<$lifted>;
1794 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1795 if self.is_empty() {
1796 return Some(List::empty());
1798 if tcx.interners.arena.in_arena(*self as *const _) {
1799 return Some(unsafe { mem::transmute(*self) });
1801 // Also try in the global tcx if we're not that.
1802 if !tcx.is_global() {
1803 self.lift_to_tcx(tcx.global_tcx())
1812 nop_lift!{Ty<'a> => Ty<'tcx>}
1813 nop_lift!{Region<'a> => Region<'tcx>}
1814 nop_lift!{Goal<'a> => Goal<'tcx>}
1815 nop_lift!{&'a Const<'a> => &'tcx Const<'tcx>}
1817 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1818 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1819 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1820 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1821 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1822 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1823 nop_list_lift!{ProjectionKind => ProjectionKind}
1825 // this is the impl for `&'a InternalSubsts<'a>`
1826 nop_list_lift!{Kind<'a> => Kind<'tcx>}
1829 use super::{GlobalCtxt, TyCtxt, ptr_eq};
1833 use std::marker::PhantomData;
1835 use crate::ty::query;
1836 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1837 use rustc_data_structures::OnDrop;
1838 use rustc_data_structures::sync::{self, Lrc, Lock};
1839 use rustc_data_structures::thin_vec::ThinVec;
1840 use crate::dep_graph::TaskDeps;
1842 #[cfg(not(parallel_compiler))]
1843 use std::cell::Cell;
1845 #[cfg(parallel_compiler)]
1846 use rustc_rayon_core as rayon_core;
1848 /// This is the implicit state of rustc. It contains the current
1849 /// TyCtxt and query. It is updated when creating a local interner or
1850 /// executing a new query. Whenever there's a TyCtxt value available
1851 /// you should also have access to an ImplicitCtxt through the functions
1854 pub struct ImplicitCtxt<'a, 'gcx: 'tcx, 'tcx> {
1855 /// The current TyCtxt. Initially created by `enter_global` and updated
1856 /// by `enter_local` with a new local interner
1857 pub tcx: TyCtxt<'tcx, 'gcx, 'tcx>,
1859 /// The current query job, if any. This is updated by JobOwner::start in
1860 /// ty::query::plumbing when executing a query
1861 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1863 /// Where to store diagnostics for the current query job, if any.
1864 /// This is updated by JobOwner::start in ty::query::plumbing when executing a query
1865 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1867 /// Used to prevent layout from recursing too deeply.
1868 pub layout_depth: usize,
1870 /// The current dep graph task. This is used to add dependencies to queries
1871 /// when executing them
1872 pub task_deps: Option<&'a Lock<TaskDeps>>,
1875 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1876 /// to `value` during the call to `f`. It is restored to its previous value after.
1877 /// This is used to set the pointer to the new ImplicitCtxt.
1878 #[cfg(parallel_compiler)]
1880 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1881 rayon_core::tlv::with(value, f)
1884 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1885 /// This is used to get the pointer to the current ImplicitCtxt.
1886 #[cfg(parallel_compiler)]
1888 fn get_tlv() -> usize {
1889 rayon_core::tlv::get()
1892 #[cfg(not(parallel_compiler))]
1894 /// A thread local variable which stores a pointer to the current ImplicitCtxt.
1895 static TLV: Cell<usize> = Cell::new(0);
1898 /// Sets TLV to `value` during the call to `f`.
1899 /// It is restored to its previous value after.
1900 /// This is used to set the pointer to the new ImplicitCtxt.
1901 #[cfg(not(parallel_compiler))]
1903 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1904 let old = get_tlv();
1905 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1906 TLV.with(|tlv| tlv.set(value));
1910 /// This is used to get the pointer to the current ImplicitCtxt.
1911 #[cfg(not(parallel_compiler))]
1912 fn get_tlv() -> usize {
1913 TLV.with(|tlv| tlv.get())
1916 /// This is a callback from libsyntax as it cannot access the implicit state
1917 /// in librustc otherwise
1918 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1920 if let Some(tcx) = tcx {
1921 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1923 syntax_pos::default_span_debug(span, f)
1928 /// This is a callback from libsyntax as it cannot access the implicit state
1929 /// in librustc otherwise. It is used to when diagnostic messages are
1930 /// emitted and stores them in the current query, if there is one.
1931 fn track_diagnostic(diagnostic: &Diagnostic) {
1932 with_context_opt(|icx| {
1933 if let Some(icx) = icx {
1934 if let Some(ref diagnostics) = icx.diagnostics {
1935 let mut diagnostics = diagnostics.lock();
1936 diagnostics.extend(Some(diagnostic.clone()));
1942 /// Sets up the callbacks from libsyntax on the current thread
1943 pub fn with_thread_locals<F, R>(f: F) -> R
1944 where F: FnOnce() -> R
1946 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1947 let original_span_debug = span_dbg.get();
1948 span_dbg.set(span_debug);
1950 let _on_drop = OnDrop(move || {
1951 span_dbg.set(original_span_debug);
1954 TRACK_DIAGNOSTICS.with(|current| {
1955 let original = current.get();
1956 current.set(track_diagnostic);
1958 let _on_drop = OnDrop(move || {
1959 current.set(original);
1967 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1969 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1971 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1973 set_tlv(context as *const _ as usize, || {
1978 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1979 /// creating a initial TyCtxt and ImplicitCtxt.
1980 /// This happens once per rustc session and TyCtxts only exists
1981 /// inside the `f` function.
1982 pub fn enter_global<'gcx, F, R>(gcx: &'gcx GlobalCtxt<'gcx>, f: F) -> R
1983 where F: FnOnce(TyCtxt<'gcx, 'gcx, 'gcx>) -> R
1985 // Update GCX_PTR to indicate there's a GlobalCtxt available
1986 GCX_PTR.with(|lock| {
1987 *lock.lock() = gcx as *const _ as usize;
1989 // Set GCX_PTR back to 0 when we exit
1990 let _on_drop = OnDrop(move || {
1991 GCX_PTR.with(|lock| *lock.lock() = 0);
1996 interners: &gcx.global_interners,
1999 let icx = ImplicitCtxt {
2006 enter_context(&icx, |_| {
2011 scoped_thread_local! {
2012 /// Stores a pointer to the GlobalCtxt if one is available.
2013 /// This is used to access the GlobalCtxt in the deadlock handler given to Rayon.
2014 pub static GCX_PTR: Lock<usize>
2017 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2018 /// This is used in the deadlock handler.
2019 pub unsafe fn with_global<F, R>(f: F) -> R
2020 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2022 let gcx = GCX_PTR.with(|lock| *lock.lock());
2024 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2027 interners: &gcx.global_interners,
2030 let icx = ImplicitCtxt {
2037 enter_context(&icx, |_| f(tcx))
2040 /// Allows access to the current ImplicitCtxt in a closure if one is available
2042 pub fn with_context_opt<F, R>(f: F) -> R
2043 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2045 let context = get_tlv();
2049 // We could get a ImplicitCtxt pointer from another thread.
2050 // Ensure that ImplicitCtxt is Sync
2051 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2053 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2057 /// Allows access to the current ImplicitCtxt.
2058 /// Panics if there is no ImplicitCtxt available
2060 pub fn with_context<F, R>(f: F) -> R
2061 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2063 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2066 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2067 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2068 /// with the same 'gcx lifetime as the TyCtxt passed in.
2069 /// This will panic if you pass it a TyCtxt which has a different global interner from
2070 /// the current ImplicitCtxt's tcx field.
2072 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2073 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2075 with_context(|context| {
2077 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
2078 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2084 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2085 /// interner and local interner as the tcx argument passed in. This means the closure
2086 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2087 /// This will panic if you pass it a TyCtxt which has a different global interner or
2088 /// a different local interner from the current ImplicitCtxt's tcx field.
2090 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2091 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2093 with_context(|context| {
2095 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
2096 assert!(ptr_eq(context.tcx.interners, tcx.interners));
2097 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2103 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2104 /// Panics if there is no ImplicitCtxt available
2106 pub fn with<F, R>(f: F) -> R
2107 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2109 with_context(|context| f(context.tcx))
2112 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2113 /// The closure is passed None if there is no ImplicitCtxt available
2115 pub fn with_opt<F, R>(f: F) -> R
2116 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2118 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2122 macro_rules! sty_debug_print {
2123 ($ctxt: expr, $($variant: ident),*) => {{
2124 // curious inner module to allow variant names to be used as
2126 #[allow(non_snake_case)]
2128 use crate::ty::{self, TyCtxt};
2129 use crate::ty::context::Interned;
2131 #[derive(Copy, Clone)]
2140 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2141 let mut total = DebugStat {
2148 $(let mut $variant = total;)*
2150 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2151 let variant = match t.sty {
2152 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2153 ty::Float(..) | ty::Str | ty::Never => continue,
2154 ty::Error => /* unimportant */ continue,
2155 $(ty::$variant(..) => &mut $variant,)*
2157 let lt = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2158 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2159 let ct = t.flags.intersects(ty::TypeFlags::HAS_CT_INFER);
2163 if lt { total.lt_infer += 1; variant.lt_infer += 1 }
2164 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2165 if ct { total.ct_infer += 1; variant.ct_infer += 1 }
2166 if lt && ty && ct { total.all_infer += 1; variant.all_infer += 1 }
2168 println!("Ty interner total ty lt ct all");
2169 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2170 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2171 stringify!($variant),
2172 uses = $variant.total,
2173 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2174 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2175 lt = $variant.lt_infer as f64 * 100.0 / total.total as f64,
2176 ct = $variant.ct_infer as f64 * 100.0 / total.total as f64,
2177 all = $variant.all_infer as f64 * 100.0 / total.total as f64);
2179 println!(" total {uses:6} \
2180 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2182 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2183 lt = total.lt_infer as f64 * 100.0 / total.total as f64,
2184 ct = total.ct_infer as f64 * 100.0 / total.total as f64,
2185 all = total.all_infer as f64 * 100.0 / total.total as f64)
2193 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2194 pub fn print_debug_stats(self) {
2197 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2198 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2199 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2201 println!("InternalSubsts interner: #{}", self.interners.substs.borrow().len());
2202 println!("Region interner: #{}", self.interners.region.borrow().len());
2203 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2204 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2205 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2210 /// An entry in an interner.
2211 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2213 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2214 fn clone(&self) -> Self {
2218 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2220 // N.B., an `Interned<Ty>` compares and hashes as a sty.
2221 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2222 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2223 self.0.sty == other.0.sty
2227 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2229 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2230 fn hash<H: Hasher>(&self, s: &mut H) {
2235 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2236 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2241 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2242 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2243 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2244 self.0[..] == other.0[..]
2248 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2250 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2251 fn hash<H: Hasher>(&self, s: &mut H) {
2256 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2257 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2262 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2263 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2268 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, InternalSubsts<'tcx>> {
2269 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2274 impl<'tcx> Borrow<[ProjectionKind]>
2275 for Interned<'tcx, List<ProjectionKind>> {
2276 fn borrow<'a>(&'a self) -> &'a [ProjectionKind] {
2281 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2282 fn borrow<'a>(&'a self) -> &'a RegionKind {
2287 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2288 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2293 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2294 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2295 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2300 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2301 for Interned<'tcx, List<Predicate<'tcx>>> {
2302 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2307 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2308 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2313 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2314 for Interned<'tcx, List<Clause<'tcx>>> {
2315 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2320 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2321 for Interned<'tcx, List<Goal<'tcx>>> {
2322 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2327 macro_rules! intern_method {
2328 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2331 $keep_in_local_tcx:expr) -> $ty:ty) => {
2332 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2333 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2334 let key = ($alloc_to_key)(&v);
2336 // HACK(eddyb) Depend on flags being accurate to
2337 // determine that all contents are in the global tcx.
2338 // See comments on Lift for why we can't use that.
2339 if ($keep_in_local_tcx)(&v) {
2340 self.interners.$name.borrow_mut().intern_ref(key, || {
2341 // Make sure we don't end up with inference
2342 // types/regions in the global tcx.
2343 if self.is_global() {
2344 bug!("Attempted to intern `{:?}` which contains \
2345 inference types/regions in the global type context",
2349 Interned($alloc_method(&self.interners.arena, v))
2352 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2353 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2357 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2359 let i = unsafe { mem::transmute(i) };
2368 macro_rules! direct_interners {
2369 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2370 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2371 fn eq(&self, other: &Self) -> bool {
2376 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2378 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2379 fn hash<H: Hasher>(&self, s: &mut H) {
2387 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2389 $keep_in_local_tcx) -> $ty);)+
2393 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2394 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2397 direct_interners!('tcx,
2398 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2399 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>,
2400 const_: mk_const(|c: &Const<'_>| keep_local(&c)) -> Const<'tcx>
2403 macro_rules! slice_interners {
2404 ($($field:ident: $method:ident($ty:ty)),+) => (
2405 $(intern_method!( 'tcx, $field: $method(
2407 |a, v| List::from_arena(a, v),
2409 |xs: &[$ty]| xs.iter().any(keep_local)) -> List<$ty>);)+
2414 existential_predicates: _intern_existential_predicates(ExistentialPredicate<'tcx>),
2415 predicates: _intern_predicates(Predicate<'tcx>),
2416 type_list: _intern_type_list(Ty<'tcx>),
2417 substs: _intern_substs(Kind<'tcx>),
2418 clauses: _intern_clauses(Clause<'tcx>),
2419 goal_list: _intern_goals(Goal<'tcx>),
2420 projs: _intern_projs(ProjectionKind)
2423 // This isn't a perfect fit: CanonicalVarInfo slices are always
2424 // allocated in the global arena, so this `intern_method!` macro is
2425 // overly general. But we just return false for the code that checks
2426 // whether they belong in the thread-local arena, so no harm done, and
2427 // seems better than open-coding the rest.
2430 canonical_var_infos: _intern_canonical_var_infos(
2431 &[CanonicalVarInfo],
2432 |a, v| List::from_arena(a, v),
2434 |_xs: &[CanonicalVarInfo]| -> bool { false }
2435 ) -> List<CanonicalVarInfo>
2438 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2439 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2440 /// that is, a `fn` type that is equivalent in every way for being
2442 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2443 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2444 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2445 unsafety: hir::Unsafety::Unsafe,
2450 /// Given a closure signature `sig`, returns an equivalent `fn`
2451 /// type with the same signature. Detuples and so forth -- so
2452 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2453 /// a `fn(u32, i32)`.
2454 /// `unsafety` determines the unsafety of the `fn` type. If you pass
2455 /// `hir::Unsafety::Unsafe` in the previous example, then you would get
2456 /// an `unsafe fn (u32, i32)`.
2457 /// It cannot convert a closure that requires unsafe.
2458 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>, unsafety: hir::Unsafety) -> Ty<'tcx> {
2459 let converted_sig = sig.map_bound(|s| {
2460 let params_iter = match s.inputs()[0].sty {
2461 ty::Tuple(params) => {
2462 params.into_iter().map(|k| k.expect_ty())
2475 self.mk_fn_ptr(converted_sig)
2479 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2480 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2483 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2485 ast::IntTy::Isize => self.types.isize,
2486 ast::IntTy::I8 => self.types.i8,
2487 ast::IntTy::I16 => self.types.i16,
2488 ast::IntTy::I32 => self.types.i32,
2489 ast::IntTy::I64 => self.types.i64,
2490 ast::IntTy::I128 => self.types.i128,
2494 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2496 ast::UintTy::Usize => self.types.usize,
2497 ast::UintTy::U8 => self.types.u8,
2498 ast::UintTy::U16 => self.types.u16,
2499 ast::UintTy::U32 => self.types.u32,
2500 ast::UintTy::U64 => self.types.u64,
2501 ast::UintTy::U128 => self.types.u128,
2505 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2507 ast::FloatTy::F32 => self.types.f32,
2508 ast::FloatTy::F64 => self.types.f64,
2513 pub fn mk_str(self) -> Ty<'tcx> {
2518 pub fn mk_static_str(self) -> Ty<'tcx> {
2519 self.mk_imm_ref(self.lifetimes.re_static, self.mk_str())
2523 pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2524 // take a copy of substs so that we own the vectors inside
2525 self.mk_ty(Adt(def, substs))
2529 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2530 self.mk_ty(Foreign(def_id))
2533 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2534 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2535 let adt_def = self.adt_def(def_id);
2536 let substs = InternalSubsts::for_item(self, def_id, |param, substs| {
2538 GenericParamDefKind::Lifetime |
2539 GenericParamDefKind::Const => {
2542 GenericParamDefKind::Type { has_default, .. } => {
2543 if param.index == 0 {
2546 assert!(has_default);
2547 self.type_of(param.def_id).subst(self, substs).into()
2552 self.mk_ty(Adt(adt_def, substs))
2556 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2557 self.mk_ty(RawPtr(tm))
2561 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2562 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2566 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2567 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2571 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2572 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2576 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2577 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2581 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2582 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2586 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2587 self.mk_imm_ptr(self.mk_unit())
2591 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2592 self.mk_ty(Array(ty, ty::Const::from_usize(self.global_tcx(), n)))
2596 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2597 self.mk_ty(Slice(ty))
2601 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2602 let kinds: Vec<_> = ts.into_iter().map(|&t| Kind::from(t)).collect();
2603 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2606 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2607 iter.intern_with(|ts| {
2608 let kinds: Vec<_> = ts.into_iter().map(|&t| Kind::from(t)).collect();
2609 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2614 pub fn mk_unit(self) -> Ty<'tcx> {
2619 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2620 if self.features().never_type {
2623 self.intern_tup(&[])
2628 pub fn mk_bool(self) -> Ty<'tcx> {
2633 pub fn mk_fn_def(self, def_id: DefId,
2634 substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2635 self.mk_ty(FnDef(def_id, substs))
2639 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2640 self.mk_ty(FnPtr(fty))
2646 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2647 reg: ty::Region<'tcx>
2649 self.mk_ty(Dynamic(obj, reg))
2653 pub fn mk_projection(self,
2655 substs: SubstsRef<'tcx>)
2657 self.mk_ty(Projection(ProjectionTy {
2664 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2666 self.mk_ty(Closure(closure_id, closure_substs))
2670 pub fn mk_generator(self,
2672 generator_substs: GeneratorSubsts<'tcx>,
2673 movability: hir::GeneratorMovability)
2675 self.mk_ty(Generator(id, generator_substs, movability))
2679 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2680 self.mk_ty(GeneratorWitness(types))
2684 pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> {
2685 self.mk_ty_infer(TyVar(v))
2689 pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2690 self.mk_const(ty::Const {
2691 val: ConstValue::Infer(InferConst::Var(v)),
2697 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2698 self.mk_ty_infer(IntVar(v))
2702 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2703 self.mk_ty_infer(FloatVar(v))
2707 pub fn mk_ty_infer(self, it: InferTy) -> Ty<'tcx> {
2708 self.mk_ty(Infer(it))
2712 pub fn mk_const_infer(
2714 ic: InferConst<'tcx>,
2716 ) -> &'tcx ty::Const<'tcx> {
2717 self.mk_const(ty::Const {
2718 val: ConstValue::Infer(ic),
2724 pub fn mk_ty_param(self, index: u32, name: InternedString) -> Ty<'tcx> {
2725 self.mk_ty(Param(ParamTy { index, name: name }))
2729 pub fn mk_const_param(
2732 name: InternedString,
2734 ) -> &'tcx Const<'tcx> {
2735 self.mk_const(ty::Const {
2736 val: ConstValue::Param(ParamConst { index, name }),
2742 pub fn mk_self_type(self) -> Ty<'tcx> {
2743 self.mk_ty_param(0, kw::SelfUpper.as_interned_str())
2746 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2748 GenericParamDefKind::Lifetime => {
2749 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2751 GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
2752 GenericParamDefKind::Const => {
2753 self.mk_const_param(param.index, param.name, self.type_of(param.def_id)).into()
2759 pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2760 self.mk_ty(Opaque(def_id, substs))
2763 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2764 -> &'tcx List<ExistentialPredicate<'tcx>> {
2765 assert!(!eps.is_empty());
2766 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2767 self._intern_existential_predicates(eps)
2770 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2771 -> &'tcx List<Predicate<'tcx>> {
2772 // FIXME consider asking the input slice to be sorted to avoid
2773 // re-interning permutations, in which case that would be asserted
2775 if preds.len() == 0 {
2776 // The macro-generated method below asserts we don't intern an empty slice.
2779 self._intern_predicates(preds)
2783 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2787 self._intern_type_list(ts)
2791 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2795 self._intern_substs(ts)
2799 pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
2803 self._intern_projs(ps)
2807 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2811 self.global_tcx()._intern_canonical_var_infos(ts)
2815 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2819 self._intern_clauses(ts)
2823 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2827 self._intern_goals(ts)
2831 pub fn mk_fn_sig<I>(self,
2835 unsafety: hir::Unsafety,
2837 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2839 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2841 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2842 inputs_and_output: self.intern_type_list(xs),
2843 c_variadic, unsafety, abi
2847 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2848 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2850 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2853 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2854 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2856 iter.intern_with(|xs| self.intern_predicates(xs))
2859 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2860 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2861 iter.intern_with(|xs| self.intern_type_list(xs))
2864 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2865 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2866 iter.intern_with(|xs| self.intern_substs(xs))
2869 pub fn mk_substs_trait(self,
2871 rest: &[Kind<'tcx>])
2874 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2877 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2878 iter.intern_with(|xs| self.intern_clauses(xs))
2881 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2882 iter.intern_with(|xs| self.intern_goals(xs))
2885 pub fn lint_hir<S: Into<MultiSpan>>(self,
2886 lint: &'static Lint,
2890 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2893 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2894 lint: &'static Lint,
2899 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2904 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2905 lint: &'static Lint,
2910 let mut err = self.struct_span_lint_hir(lint, id, span.into(), msg);
2915 /// Walks upwards from `id` to find a node which might change lint levels with attributes.
2916 /// It stops at `bound` and just returns it if reached.
2917 pub fn maybe_lint_level_root_bounded(
2926 if lint::maybe_lint_level_root(self, id) {
2929 let next = self.hir().get_parent_node_by_hir_id(id);
2931 bug!("lint traversal reached the root of the crate");
2937 pub fn lint_level_at_node(
2939 lint: &'static Lint,
2941 ) -> (lint::Level, lint::LintSource) {
2942 let sets = self.lint_levels(LOCAL_CRATE);
2944 if let Some(pair) = sets.level_and_source(lint, id, self.sess) {
2947 let next = self.hir().get_parent_node_by_hir_id(id);
2949 bug!("lint traversal reached the root of the crate");
2955 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2956 lint: &'static Lint,
2960 -> DiagnosticBuilder<'tcx>
2962 let (level, src) = self.lint_level_at_node(lint, hir_id);
2963 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2966 pub fn struct_lint_node(self, lint: &'static Lint, id: HirId, msg: &str)
2967 -> DiagnosticBuilder<'tcx>
2969 let (level, src) = self.lint_level_at_node(lint, id);
2970 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2973 pub fn in_scope_traits(self, id: HirId) -> Option<&'gcx StableVec<TraitCandidate>> {
2974 self.in_scope_traits_map(id.owner)
2975 .and_then(|map| map.get(&id.local_id))
2978 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2979 self.named_region_map(id.owner)
2980 .and_then(|map| map.get(&id.local_id).cloned())
2983 pub fn is_late_bound(self, id: HirId) -> bool {
2984 self.is_late_bound_map(id.owner)
2985 .map(|set| set.contains(&id.local_id))
2989 pub fn object_lifetime_defaults(self, id: HirId)
2990 -> Option<&'gcx [ObjectLifetimeDefault]>
2992 self.object_lifetime_defaults_map(id.owner)
2993 .and_then(|map| map.get(&id.local_id).map(|v| &**v))
2997 pub trait InternAs<T: ?Sized, R> {
2999 fn intern_with<F>(self, f: F) -> Self::Output
3000 where F: FnOnce(&T) -> R;
3003 impl<I, T, R, E> InternAs<[T], R> for I
3004 where E: InternIteratorElement<T, R>,
3005 I: Iterator<Item=E> {
3006 type Output = E::Output;
3007 fn intern_with<F>(self, f: F) -> Self::Output
3008 where F: FnOnce(&[T]) -> R {
3009 E::intern_with(self, f)
3013 pub trait InternIteratorElement<T, R>: Sized {
3015 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
3018 impl<T, R> InternIteratorElement<T, R> for T {
3020 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3021 f(&iter.collect::<SmallVec<[_; 8]>>())
3025 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
3029 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3030 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
3034 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
3035 type Output = Result<R, E>;
3036 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3037 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
3041 // We are comparing types with different invariant lifetimes, so `ptr::eq`
3042 // won't work for us.
3043 fn ptr_eq<T, U>(t: *const T, u: *const U) -> bool {
3044 t as *const () == u as *const ()
3047 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3048 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id);
3049 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).map(|v| &v[..]);
3050 providers.crate_name = |tcx, id| {
3051 assert_eq!(id, LOCAL_CRATE);
3054 providers.get_lib_features = |tcx, id| {
3055 assert_eq!(id, LOCAL_CRATE);
3056 tcx.arena.alloc(middle::lib_features::collect(tcx))
3058 providers.get_lang_items = |tcx, id| {
3059 assert_eq!(id, LOCAL_CRATE);
3060 tcx.arena.alloc(middle::lang_items::collect(tcx))
3062 providers.upvars = |tcx, id| tcx.gcx.upvars.get(&id).map(|v| &v[..]);
3063 providers.maybe_unused_trait_import = |tcx, id| {
3064 tcx.maybe_unused_trait_imports.contains(&id)
3066 providers.maybe_unused_extern_crates = |tcx, cnum| {
3067 assert_eq!(cnum, LOCAL_CRATE);
3068 &tcx.maybe_unused_extern_crates[..]
3070 providers.names_imported_by_glob_use = |tcx, id| {
3071 assert_eq!(id.krate, LOCAL_CRATE);
3072 Lrc::new(tcx.glob_map.get(&id).cloned().unwrap_or_default())
3075 providers.stability_index = |tcx, cnum| {
3076 assert_eq!(cnum, LOCAL_CRATE);
3077 tcx.arena.alloc(stability::Index::new(tcx))
3079 providers.lookup_stability = |tcx, id| {
3080 assert_eq!(id.krate, LOCAL_CRATE);
3081 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3082 tcx.stability().local_stability(id)
3084 providers.lookup_deprecation_entry = |tcx, id| {
3085 assert_eq!(id.krate, LOCAL_CRATE);
3086 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3087 tcx.stability().local_deprecation_entry(id)
3089 providers.extern_mod_stmt_cnum = |tcx, id| {
3090 let id = tcx.hir().as_local_node_id(id).unwrap();
3091 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3093 providers.all_crate_nums = |tcx, cnum| {
3094 assert_eq!(cnum, LOCAL_CRATE);
3095 tcx.arena.alloc_slice(&tcx.cstore.crates_untracked())
3097 providers.postorder_cnums = |tcx, cnum| {
3098 assert_eq!(cnum, LOCAL_CRATE);
3099 tcx.arena.alloc_slice(&tcx.cstore.postorder_cnums_untracked())
3101 providers.output_filenames = |tcx, cnum| {
3102 assert_eq!(cnum, LOCAL_CRATE);
3103 tcx.output_filenames.clone()
3105 providers.features_query = |tcx, cnum| {
3106 assert_eq!(cnum, LOCAL_CRATE);
3107 tcx.arena.alloc(tcx.sess.features_untracked().clone())
3109 providers.is_panic_runtime = |tcx, cnum| {
3110 assert_eq!(cnum, LOCAL_CRATE);
3111 attr::contains_name(tcx.hir().krate_attrs(), sym::panic_runtime)
3113 providers.is_compiler_builtins = |tcx, cnum| {
3114 assert_eq!(cnum, LOCAL_CRATE);
3115 attr::contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins)