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,
87 pub fn new() -> Self {
89 interner: SyncDroplessArena::default(),
94 type InternedSet<'tcx, T> = Lock<FxHashMap<Interned<'tcx, T>, ()>>;
96 pub struct CtxtInterners<'tcx> {
97 /// The arena that types, regions, etc are allocated from
98 arena: &'tcx SyncDroplessArena,
100 /// Specifically use a speedy hash algorithm for these hash sets,
101 /// they're accessed quite often.
102 type_: InternedSet<'tcx, TyS<'tcx>>,
103 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
104 substs: InternedSet<'tcx, InternalSubsts<'tcx>>,
105 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
106 region: InternedSet<'tcx, RegionKind>,
107 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
108 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
109 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
110 goal: InternedSet<'tcx, GoalKind<'tcx>>,
111 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
112 projs: InternedSet<'tcx, List<ProjectionKind>>,
113 const_: InternedSet<'tcx, Const<'tcx>>,
116 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
117 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
120 type_: Default::default(),
121 type_list: Default::default(),
122 substs: Default::default(),
123 region: Default::default(),
124 existential_predicates: Default::default(),
125 canonical_var_infos: Default::default(),
126 predicates: Default::default(),
127 clauses: Default::default(),
128 goal: Default::default(),
129 goal_list: Default::default(),
130 projs: Default::default(),
131 const_: Default::default(),
138 local: &CtxtInterners<'tcx>,
139 global: &CtxtInterners<'gcx>,
142 let flags = super::flags::FlagComputation::for_sty(&st);
144 // HACK(eddyb) Depend on flags being accurate to
145 // determine that all contents are in the global tcx.
146 // See comments on Lift for why we can't use that.
147 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
148 local.type_.borrow_mut().intern(st, |st| {
149 let ty_struct = TyS {
152 outer_exclusive_binder: flags.outer_exclusive_binder,
155 // Make sure we don't end up with inference
156 // types/regions in the global interner
157 if ptr_eq(local, global) {
158 bug!("Attempted to intern `{:?}` which contains \
159 inference types/regions in the global type context",
163 Interned(local.arena.alloc(ty_struct))
166 global.type_.borrow_mut().intern(st, |st| {
167 let ty_struct = TyS {
170 outer_exclusive_binder: flags.outer_exclusive_binder,
173 // This is safe because all the types the ty_struct can point to
174 // already is in the global arena
175 let ty_struct: TyS<'gcx> = unsafe {
176 mem::transmute(ty_struct)
179 Interned(global.arena.alloc(ty_struct))
185 pub struct Common<'tcx> {
186 pub empty_predicates: ty::GenericPredicates<'tcx>,
189 pub struct CommonTypes<'tcx> {
210 /// Dummy type used for the `Self` of a `TraitRef` created for converting
211 /// a trait object, and which gets removed in `ExistentialTraitRef`.
212 /// This type must not appear anywhere in other converted types.
213 pub trait_object_dummy_self: Ty<'tcx>,
216 pub struct CommonLifetimes<'tcx> {
217 pub re_empty: Region<'tcx>,
218 pub re_static: Region<'tcx>,
219 pub re_erased: Region<'tcx>,
222 pub struct CommonConsts<'tcx> {
223 pub err: &'tcx Const<'tcx>,
226 pub struct LocalTableInContext<'a, V: 'a> {
227 local_id_root: Option<DefId>,
228 data: &'a ItemLocalMap<V>
231 /// Validate that the given HirId (respectively its `local_id` part) can be
232 /// safely used as a key in the tables of a TypeckTable. For that to be
233 /// the case, the HirId must have the same `owner` as all the other IDs in
234 /// this table (signified by `local_id_root`). Otherwise the HirId
235 /// would be in a different frame of reference and using its `local_id`
236 /// would result in lookup errors, or worse, in silently wrong data being
238 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
241 if cfg!(debug_assertions) {
242 if let Some(local_id_root) = local_id_root {
243 if hir_id.owner != local_id_root.index {
244 ty::tls::with(|tcx| {
245 let node_id = tcx.hir().hir_to_node_id(hir_id);
247 bug!("node {} with HirId::owner {:?} cannot be placed in \
248 TypeckTables with local_id_root {:?}",
249 tcx.hir().node_to_string(node_id),
250 DefId::local(hir_id.owner),
255 // We use "Null Object" TypeckTables in some of the analysis passes.
256 // These are just expected to be empty and their `local_id_root` is
257 // `None`. Therefore we cannot verify whether a given `HirId` would
258 // be a valid key for the given table. Instead we make sure that
259 // nobody tries to write to such a Null Object table.
261 bug!("access to invalid TypeckTables")
267 impl<'a, V> LocalTableInContext<'a, V> {
268 pub fn contains_key(&self, id: hir::HirId) -> bool {
269 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
270 self.data.contains_key(&id.local_id)
273 pub fn get(&self, id: hir::HirId) -> Option<&V> {
274 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
275 self.data.get(&id.local_id)
278 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
283 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
286 fn index(&self, key: hir::HirId) -> &V {
287 self.get(key).expect("LocalTableInContext: key not found")
291 pub struct LocalTableInContextMut<'a, V: 'a> {
292 local_id_root: Option<DefId>,
293 data: &'a mut ItemLocalMap<V>
296 impl<'a, V> LocalTableInContextMut<'a, V> {
297 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
298 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
299 self.data.get_mut(&id.local_id)
302 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
303 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
304 self.data.entry(id.local_id)
307 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
308 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
309 self.data.insert(id.local_id, val)
312 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
313 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
314 self.data.remove(&id.local_id)
318 /// All information necessary to validate and reveal an `impl Trait` or `existential Type`
319 #[derive(RustcEncodable, RustcDecodable, Debug, HashStable)]
320 pub struct ResolvedOpaqueTy<'tcx> {
321 /// The revealed type as seen by this function.
322 pub concrete_type: Ty<'tcx>,
323 /// Generic parameters on the opaque type as passed by this function.
324 /// For `existential type Foo<A, B>; fn foo<T, U>() -> Foo<T, U> { .. }` this is `[T, U]`, not
326 pub substs: SubstsRef<'tcx>,
329 #[derive(RustcEncodable, RustcDecodable, Debug)]
330 pub struct TypeckTables<'tcx> {
331 /// The HirId::owner all ItemLocalIds in this table are relative to.
332 pub local_id_root: Option<DefId>,
334 /// Resolved definitions for `<T>::X` associated paths and
335 /// method calls, including those of overloaded operators.
336 type_dependent_defs: ItemLocalMap<Result<(DefKind, DefId), ErrorReported>>,
338 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
339 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
340 /// about the field you also need definition of the variant to which the field
341 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
342 field_indices: ItemLocalMap<usize>,
344 /// Stores the types for various nodes in the AST. Note that this table
345 /// is not guaranteed to be populated until after typeck. See
346 /// typeck::check::fn_ctxt for details.
347 node_types: ItemLocalMap<Ty<'tcx>>,
349 /// Stores the type parameters which were substituted to obtain the type
350 /// of this node. This only applies to nodes that refer to entities
351 /// parameterized by type parameters, such as generic fns, types, or
353 node_substs: ItemLocalMap<SubstsRef<'tcx>>,
355 /// This will either store the canonicalized types provided by the user
356 /// or the substitutions that the user explicitly gave (if any) attached
357 /// to `id`. These will not include any inferred values. The canonical form
358 /// is used to capture things like `_` or other unspecified values.
360 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
361 /// canonical substitutions would include only `for<X> { Vec<X> }`.
363 /// See also `AscribeUserType` statement in MIR.
364 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
366 /// Stores the canonicalized types provided by the user. See also
367 /// `AscribeUserType` statement in MIR.
368 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
370 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
372 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
373 pat_binding_modes: ItemLocalMap<BindingMode>,
375 /// Stores the types which were implicitly dereferenced in pattern binding modes
376 /// for later usage in HAIR lowering. For example,
379 /// match &&Some(5i32) {
384 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
387 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
388 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
391 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
393 /// Records the reasons that we picked the kind of each closure;
394 /// not all closures are present in the map.
395 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
397 /// For each fn, records the "liberated" types of its arguments
398 /// and return type. Liberated means that all bound regions
399 /// (including late-bound regions) are replaced with free
400 /// equivalents. This table is not used in codegen (since regions
401 /// are erased there) and hence is not serialized to metadata.
402 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
404 /// For each FRU expression, record the normalized types of the fields
405 /// of the struct - this is needed because it is non-trivial to
406 /// normalize while preserving regions. This table is used only in
407 /// MIR construction and hence is not serialized to metadata.
408 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
410 /// For every coercion cast we add the HIR node ID of the cast
411 /// expression to this set.
412 coercion_casts: ItemLocalSet,
414 /// Set of trait imports actually used in the method resolution.
415 /// This is used for warning unused imports. During type
416 /// checking, this `Lrc` should not be cloned: it must have a ref-count
417 /// of 1 so that we can insert things into the set mutably.
418 pub used_trait_imports: Lrc<DefIdSet>,
420 /// If any errors occurred while type-checking this body,
421 /// this field will be set to `true`.
422 pub tainted_by_errors: bool,
424 /// Stores the free-region relationships that were deduced from
425 /// its where-clauses and parameter types. These are then
426 /// read-again by borrowck.
427 pub free_region_map: FreeRegionMap<'tcx>,
429 /// All the existential types that are restricted to concrete types
431 pub concrete_existential_types: FxHashMap<DefId, ResolvedOpaqueTy<'tcx>>,
433 /// Given the closure ID this map provides the list of UpvarIDs used by it.
434 /// The upvarID contains the HIR node ID and it also contains the full path
435 /// leading to the member of the struct or tuple that is used instead of the
437 pub upvar_list: ty::UpvarListMap,
440 impl<'tcx> TypeckTables<'tcx> {
441 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
444 type_dependent_defs: Default::default(),
445 field_indices: Default::default(),
446 user_provided_types: Default::default(),
447 user_provided_sigs: Default::default(),
448 node_types: Default::default(),
449 node_substs: Default::default(),
450 adjustments: Default::default(),
451 pat_binding_modes: Default::default(),
452 pat_adjustments: Default::default(),
453 upvar_capture_map: Default::default(),
454 closure_kind_origins: Default::default(),
455 liberated_fn_sigs: Default::default(),
456 fru_field_types: Default::default(),
457 coercion_casts: Default::default(),
458 used_trait_imports: Lrc::new(Default::default()),
459 tainted_by_errors: false,
460 free_region_map: Default::default(),
461 concrete_existential_types: Default::default(),
462 upvar_list: Default::default(),
466 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
467 pub fn qpath_res(&self, qpath: &hir::QPath, id: hir::HirId) -> Res {
469 hir::QPath::Resolved(_, ref path) => path.res,
470 hir::QPath::TypeRelative(..) => self.type_dependent_def(id)
471 .map_or(Res::Err, |(kind, def_id)| Res::Def(kind, def_id)),
475 pub fn type_dependent_defs(
477 ) -> LocalTableInContext<'_, Result<(DefKind, DefId), ErrorReported>> {
478 LocalTableInContext {
479 local_id_root: self.local_id_root,
480 data: &self.type_dependent_defs
484 pub fn type_dependent_def(&self, id: HirId) -> Option<(DefKind, DefId)> {
485 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
486 self.type_dependent_defs.get(&id.local_id).cloned().and_then(|r| r.ok())
489 pub fn type_dependent_def_id(&self, id: HirId) -> Option<DefId> {
490 self.type_dependent_def(id).map(|(_, def_id)| def_id)
493 pub fn type_dependent_defs_mut(
495 ) -> LocalTableInContextMut<'_, Result<(DefKind, DefId), ErrorReported>> {
496 LocalTableInContextMut {
497 local_id_root: self.local_id_root,
498 data: &mut self.type_dependent_defs
502 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
503 LocalTableInContext {
504 local_id_root: self.local_id_root,
505 data: &self.field_indices
509 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
510 LocalTableInContextMut {
511 local_id_root: self.local_id_root,
512 data: &mut self.field_indices
516 pub fn user_provided_types(
518 ) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
519 LocalTableInContext {
520 local_id_root: self.local_id_root,
521 data: &self.user_provided_types
525 pub fn user_provided_types_mut(
527 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
528 LocalTableInContextMut {
529 local_id_root: self.local_id_root,
530 data: &mut self.user_provided_types
534 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
535 LocalTableInContext {
536 local_id_root: self.local_id_root,
537 data: &self.node_types
541 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
542 LocalTableInContextMut {
543 local_id_root: self.local_id_root,
544 data: &mut self.node_types
548 pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
549 self.node_type_opt(id).unwrap_or_else(||
550 bug!("node_type: no type for node `{}`",
551 tls::with(|tcx| tcx.hir().hir_to_string(id)))
555 pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
556 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
557 self.node_types.get(&id.local_id).cloned()
560 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, SubstsRef<'tcx>> {
561 LocalTableInContextMut {
562 local_id_root: self.local_id_root,
563 data: &mut self.node_substs
567 pub fn node_substs(&self, id: hir::HirId) -> SubstsRef<'tcx> {
568 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
569 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| InternalSubsts::empty())
572 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<SubstsRef<'tcx>> {
573 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
574 self.node_substs.get(&id.local_id).cloned()
577 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
578 // doesn't provide type parameter substitutions.
579 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
580 self.node_type(pat.hir_id)
583 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
584 self.node_type_opt(pat.hir_id)
587 // Returns the type of an expression as a monotype.
589 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
590 // some cases, we insert `Adjustment` annotations such as auto-deref or
591 // auto-ref. The type returned by this function does not consider such
592 // adjustments. See `expr_ty_adjusted()` instead.
594 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
595 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
596 // instead of "fn(ty) -> T with T = isize".
597 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
598 self.node_type(expr.hir_id)
601 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
602 self.node_type_opt(expr.hir_id)
605 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
606 LocalTableInContext {
607 local_id_root: self.local_id_root,
608 data: &self.adjustments
612 pub fn adjustments_mut(&mut self)
613 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
614 LocalTableInContextMut {
615 local_id_root: self.local_id_root,
616 data: &mut self.adjustments
620 pub fn expr_adjustments(&self, expr: &hir::Expr)
621 -> &[ty::adjustment::Adjustment<'tcx>] {
622 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
623 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
626 /// Returns the type of `expr`, considering any `Adjustment`
627 /// entry recorded for that expression.
628 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
629 self.expr_adjustments(expr)
631 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
634 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
635 self.expr_adjustments(expr)
637 .map(|adj| adj.target)
638 .or_else(|| self.expr_ty_opt(expr))
641 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
642 // Only paths and method calls/overloaded operators have
643 // entries in type_dependent_defs, ignore the former here.
644 if let hir::ExprKind::Path(_) = expr.node {
648 match self.type_dependent_defs().get(expr.hir_id) {
649 Some(Ok((DefKind::Method, _))) => true,
654 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
655 LocalTableInContext {
656 local_id_root: self.local_id_root,
657 data: &self.pat_binding_modes
661 pub fn pat_binding_modes_mut(&mut self)
662 -> LocalTableInContextMut<'_, BindingMode> {
663 LocalTableInContextMut {
664 local_id_root: self.local_id_root,
665 data: &mut self.pat_binding_modes
669 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
670 LocalTableInContext {
671 local_id_root: self.local_id_root,
672 data: &self.pat_adjustments,
676 pub fn pat_adjustments_mut(&mut self)
677 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
678 LocalTableInContextMut {
679 local_id_root: self.local_id_root,
680 data: &mut self.pat_adjustments,
684 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
685 self.upvar_capture_map[&upvar_id]
688 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
689 LocalTableInContext {
690 local_id_root: self.local_id_root,
691 data: &self.closure_kind_origins
695 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
696 LocalTableInContextMut {
697 local_id_root: self.local_id_root,
698 data: &mut self.closure_kind_origins
702 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
703 LocalTableInContext {
704 local_id_root: self.local_id_root,
705 data: &self.liberated_fn_sigs
709 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
710 LocalTableInContextMut {
711 local_id_root: self.local_id_root,
712 data: &mut self.liberated_fn_sigs
716 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
717 LocalTableInContext {
718 local_id_root: self.local_id_root,
719 data: &self.fru_field_types
723 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
724 LocalTableInContextMut {
725 local_id_root: self.local_id_root,
726 data: &mut self.fru_field_types
730 pub fn is_coercion_cast(&self, hir_id: hir::HirId) -> bool {
731 validate_hir_id_for_typeck_tables(self.local_id_root, hir_id, true);
732 self.coercion_casts.contains(&hir_id.local_id)
735 pub fn set_coercion_cast(&mut self, id: ItemLocalId) {
736 self.coercion_casts.insert(id);
739 pub fn coercion_casts(&self) -> &ItemLocalSet {
745 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
746 fn hash_stable<W: StableHasherResult>(&self,
747 hcx: &mut StableHashingContext<'a>,
748 hasher: &mut StableHasher<W>) {
749 let ty::TypeckTables {
751 ref type_dependent_defs,
753 ref user_provided_types,
754 ref user_provided_sigs,
758 ref pat_binding_modes,
760 ref upvar_capture_map,
761 ref closure_kind_origins,
762 ref liberated_fn_sigs,
767 ref used_trait_imports,
770 ref concrete_existential_types,
775 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
776 type_dependent_defs.hash_stable(hcx, hasher);
777 field_indices.hash_stable(hcx, hasher);
778 user_provided_types.hash_stable(hcx, hasher);
779 user_provided_sigs.hash_stable(hcx, hasher);
780 node_types.hash_stable(hcx, hasher);
781 node_substs.hash_stable(hcx, hasher);
782 adjustments.hash_stable(hcx, hasher);
783 pat_binding_modes.hash_stable(hcx, hasher);
784 pat_adjustments.hash_stable(hcx, hasher);
785 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
792 local_id_root.expect("trying to hash invalid TypeckTables");
794 let var_owner_def_id = DefId {
795 krate: local_id_root.krate,
796 index: var_path.hir_id.owner,
798 let closure_def_id = DefId {
799 krate: local_id_root.krate,
800 index: closure_expr_id.to_def_id().index,
802 (hcx.def_path_hash(var_owner_def_id),
803 var_path.hir_id.local_id,
804 hcx.def_path_hash(closure_def_id))
807 closure_kind_origins.hash_stable(hcx, hasher);
808 liberated_fn_sigs.hash_stable(hcx, hasher);
809 fru_field_types.hash_stable(hcx, hasher);
810 coercion_casts.hash_stable(hcx, hasher);
811 used_trait_imports.hash_stable(hcx, hasher);
812 tainted_by_errors.hash_stable(hcx, hasher);
813 free_region_map.hash_stable(hcx, hasher);
814 concrete_existential_types.hash_stable(hcx, hasher);
815 upvar_list.hash_stable(hcx, hasher);
821 pub struct UserTypeAnnotationIndex {
823 DEBUG_FORMAT = "UserType({})",
824 const START_INDEX = 0,
828 /// Mapping of type annotation indices to canonical user type annotations.
829 pub type CanonicalUserTypeAnnotations<'tcx> =
830 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
832 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
833 pub struct CanonicalUserTypeAnnotation<'tcx> {
834 pub user_ty: CanonicalUserType<'tcx>,
836 pub inferred_ty: Ty<'tcx>,
839 BraceStructTypeFoldableImpl! {
840 impl<'tcx> TypeFoldable<'tcx> for CanonicalUserTypeAnnotation<'tcx> {
841 user_ty, span, inferred_ty
845 BraceStructLiftImpl! {
846 impl<'a, 'tcx> Lift<'tcx> for CanonicalUserTypeAnnotation<'a> {
847 type Lifted = CanonicalUserTypeAnnotation<'tcx>;
848 user_ty, span, inferred_ty
853 /// Canonicalized user type annotation.
854 pub type CanonicalUserType<'gcx> = Canonical<'gcx, UserType<'gcx>>;
856 impl CanonicalUserType<'gcx> {
857 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
858 /// i.e., each thing is mapped to a canonical variable with the same index.
859 pub fn is_identity(&self) -> bool {
861 UserType::Ty(_) => false,
862 UserType::TypeOf(_, user_substs) => {
863 if user_substs.user_self_ty.is_some() {
867 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
868 match kind.unpack() {
869 UnpackedKind::Type(ty) => match ty.sty {
870 ty::Bound(debruijn, b) => {
871 // We only allow a `ty::INNERMOST` index in substitutions.
872 assert_eq!(debruijn, ty::INNERMOST);
878 UnpackedKind::Lifetime(r) => match r {
879 ty::ReLateBound(debruijn, br) => {
880 // We only allow a `ty::INNERMOST` index in substitutions.
881 assert_eq!(*debruijn, ty::INNERMOST);
882 cvar == br.assert_bound_var()
887 UnpackedKind::Const(ct) => match ct.val {
888 ConstValue::Infer(InferConst::Canonical(debruijn, b)) => {
889 // We only allow a `ty::INNERMOST` index in substitutions.
890 assert_eq!(debruijn, ty::INNERMOST);
902 /// A user-given type annotation attached to a constant. These arise
903 /// from constants that are named via paths, like `Foo::<A>::new` and
905 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable, HashStable)]
906 pub enum UserType<'tcx> {
909 /// The canonical type is the result of `type_of(def_id)` with the
910 /// given substitutions applied.
911 TypeOf(DefId, UserSubsts<'tcx>),
914 EnumTypeFoldableImpl! {
915 impl<'tcx> TypeFoldable<'tcx> for UserType<'tcx> {
917 (UserType::TypeOf)(def, substs),
922 impl<'a, 'tcx> Lift<'tcx> for UserType<'a> {
923 type Lifted = UserType<'tcx>;
925 (UserType::TypeOf)(def, substs),
929 impl<'tcx> CommonTypes<'tcx> {
930 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
931 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
934 unit: mk(Tuple(List::empty())),
939 isize: mk(Int(ast::IntTy::Isize)),
940 i8: mk(Int(ast::IntTy::I8)),
941 i16: mk(Int(ast::IntTy::I16)),
942 i32: mk(Int(ast::IntTy::I32)),
943 i64: mk(Int(ast::IntTy::I64)),
944 i128: mk(Int(ast::IntTy::I128)),
945 usize: mk(Uint(ast::UintTy::Usize)),
946 u8: mk(Uint(ast::UintTy::U8)),
947 u16: mk(Uint(ast::UintTy::U16)),
948 u32: mk(Uint(ast::UintTy::U32)),
949 u64: mk(Uint(ast::UintTy::U64)),
950 u128: mk(Uint(ast::UintTy::U128)),
951 f32: mk(Float(ast::FloatTy::F32)),
952 f64: mk(Float(ast::FloatTy::F64)),
954 trait_object_dummy_self: mk(Infer(ty::FreshTy(0))),
959 impl<'tcx> CommonLifetimes<'tcx> {
960 fn new(interners: &CtxtInterners<'tcx>) -> CommonLifetimes<'tcx> {
962 interners.region.borrow_mut().intern(r, |r| {
963 Interned(interners.arena.alloc(r))
968 re_empty: mk(RegionKind::ReEmpty),
969 re_static: mk(RegionKind::ReStatic),
970 re_erased: mk(RegionKind::ReErased),
975 impl<'tcx> CommonConsts<'tcx> {
976 fn new(interners: &CtxtInterners<'tcx>, types: &CommonTypes<'tcx>) -> CommonConsts<'tcx> {
978 interners.const_.borrow_mut().intern(c, |c| {
979 Interned(interners.arena.alloc(c))
984 err: mk_const(ty::Const {
985 val: ConstValue::Scalar(Scalar::zst()),
992 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
995 pub struct FreeRegionInfo {
996 // def id corresponding to FreeRegion
998 // the bound region corresponding to FreeRegion
999 pub boundregion: ty::BoundRegion,
1000 // checks if bound region is in Impl Item
1001 pub is_impl_item: bool,
1004 /// The central data structure of the compiler. It stores references
1005 /// to the various **arenas** and also houses the results of the
1006 /// various **compiler queries** that have been performed. See the
1007 /// [rustc guide] for more details.
1009 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
1010 #[derive(Copy, Clone)]
1011 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
1012 gcx: &'gcx GlobalCtxt<'gcx>,
1013 interners: &'tcx CtxtInterners<'tcx>,
1014 dummy: PhantomData<&'a ()>,
1017 impl<'gcx> Deref for TyCtxt<'_, 'gcx, '_> {
1018 type Target = &'gcx GlobalCtxt<'gcx>;
1020 fn deref(&self) -> &Self::Target {
1025 pub struct GlobalCtxt<'tcx> {
1026 pub arena: WorkerLocal<Arena<'tcx>>,
1028 global_interners: CtxtInterners<'tcx>,
1030 cstore: &'tcx CrateStoreDyn,
1032 pub sess: &'tcx Session,
1034 pub dep_graph: DepGraph,
1037 pub common: Common<'tcx>,
1039 /// Common types, pre-interned for your convenience.
1040 pub types: CommonTypes<'tcx>,
1042 /// Common lifetimes, pre-interned for your convenience.
1043 pub lifetimes: CommonLifetimes<'tcx>,
1045 /// Common consts, pre-interned for your convenience.
1046 pub consts: CommonConsts<'tcx>,
1048 /// Map indicating what traits are in scope for places where this
1049 /// is relevant; generated by resolve.
1050 trait_map: FxHashMap<DefIndex,
1051 FxHashMap<ItemLocalId,
1052 StableVec<TraitCandidate>>>,
1054 /// Export map produced by name resolution.
1055 export_map: FxHashMap<DefId, Vec<Export<hir::HirId>>>,
1057 hir_map: hir_map::Map<'tcx>,
1059 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
1060 /// as well as all upstream crates. Only populated in incremental mode.
1061 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
1063 pub queries: query::Queries<'tcx>,
1065 // Records the captured variables referenced by every closure
1066 // expression. Do not track deps for this, just recompute it from
1067 // scratch every time.
1068 upvars: FxHashMap<DefId, Vec<hir::Upvar>>,
1070 maybe_unused_trait_imports: FxHashSet<DefId>,
1071 maybe_unused_extern_crates: Vec<(DefId, Span)>,
1072 /// A map of glob use to a set of names it actually imports. Currently only
1073 /// used in save-analysis.
1074 glob_map: FxHashMap<DefId, FxHashSet<ast::Name>>,
1075 /// Extern prelude entries. The value is `true` if the entry was introduced
1076 /// via `extern crate` item and not `--extern` option or compiler built-in.
1077 pub extern_prelude: FxHashMap<ast::Name, bool>,
1079 // Internal cache for metadata decoding. No need to track deps on this.
1080 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
1082 /// Caches the results of trait selection. This cache is used
1083 /// for things that do not have to do with the parameters in scope.
1084 pub selection_cache: traits::SelectionCache<'tcx>,
1086 /// Caches the results of trait evaluation. This cache is used
1087 /// for things that do not have to do with the parameters in scope.
1088 /// Merge this with `selection_cache`?
1089 pub evaluation_cache: traits::EvaluationCache<'tcx>,
1091 /// The definite name of the current crate after taking into account
1092 /// attributes, commandline parameters, etc.
1093 pub crate_name: Symbol,
1095 /// Data layout specification for the current target.
1096 pub data_layout: TargetDataLayout,
1098 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
1100 /// Stores the value of constants (and deduplicates the actual memory)
1101 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
1103 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1105 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
1107 /// A general purpose channel to throw data out the back towards LLVM worker
1110 /// This is intended to only get used during the codegen phase of the compiler
1111 /// when satisfying the query for a particular codegen unit. Internally in
1112 /// the query it'll send data along this channel to get processed later.
1113 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
1115 output_filenames: Arc<OutputFilenames>,
1118 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1119 /// Gets the global `TyCtxt`.
1121 pub fn global_tcx(self) -> TyCtxt<'gcx, 'gcx, 'gcx> {
1124 interners: &self.gcx.global_interners,
1130 pub fn hir(self) -> &'a hir_map::Map<'gcx> {
1134 pub fn alloc_steal_mir(self, mir: Body<'gcx>) -> &'gcx Steal<Body<'gcx>> {
1135 self.arena.alloc(Steal::new(mir))
1138 pub fn alloc_adt_def(self,
1141 variants: IndexVec<VariantIdx, ty::VariantDef>,
1143 -> &'gcx ty::AdtDef {
1144 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1145 self.arena.alloc(def)
1148 pub fn intern_const_alloc(self, alloc: Allocation) -> &'gcx Allocation {
1149 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1150 self.arena.alloc(alloc)
1154 /// Allocates a byte or string literal for `mir::interpret`, read-only
1155 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1156 // create an allocation that just contains these bytes
1157 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes, ());
1158 let alloc = self.intern_const_alloc(alloc);
1159 self.alloc_map.lock().allocate(alloc)
1162 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1163 self.stability_interner.borrow_mut().intern(stab, |stab| {
1164 self.arena.alloc(stab)
1168 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1169 self.layout_interner.borrow_mut().intern(layout, |layout| {
1170 self.arena.alloc(layout)
1174 /// Returns a range of the start/end indices specified with the
1175 /// `rustc_layout_scalar_valid_range` attribute.
1176 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1177 let attrs = self.get_attrs(def_id);
1179 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1181 None => return Bound::Unbounded,
1183 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1184 match meta.literal().expect("attribute takes lit").node {
1185 ast::LitKind::Int(a, _) => return Bound::Included(a),
1186 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1189 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1191 (get(sym::rustc_layout_scalar_valid_range_start),
1192 get(sym::rustc_layout_scalar_valid_range_end))
1195 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1196 value.lift_to_tcx(self)
1199 /// Like lift, but only tries in the global tcx.
1200 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1201 value.lift_to_tcx(self.global_tcx())
1204 /// Returns `true` if self is the same as self.global_tcx().
1205 fn is_global(self) -> bool {
1206 ptr_eq(self.interners, &self.global_interners)
1209 /// Creates a type context and call the closure with a `TyCtxt` reference
1210 /// to the context. The closure enforces that the type context and any interned
1211 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1212 /// reference to the context, to allow formatting values that need it.
1213 pub fn create_global_ctxt(
1215 cstore: &'tcx CrateStoreDyn,
1216 local_providers: ty::query::Providers<'tcx>,
1217 extern_providers: ty::query::Providers<'tcx>,
1218 arenas: &'tcx AllArenas,
1219 resolutions: ty::Resolutions,
1220 hir: hir_map::Map<'tcx>,
1221 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1223 tx: mpsc::Sender<Box<dyn Any + Send>>,
1224 output_filenames: &OutputFilenames,
1225 ) -> GlobalCtxt<'tcx> {
1226 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1229 let interners = CtxtInterners::new(&arenas.interner);
1230 let common = Common {
1231 empty_predicates: ty::GenericPredicates {
1236 let common_types = CommonTypes::new(&interners);
1237 let common_lifetimes = CommonLifetimes::new(&interners);
1238 let common_consts = CommonConsts::new(&interners, &common_types);
1239 let dep_graph = hir.dep_graph.clone();
1240 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1241 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1242 providers[LOCAL_CRATE] = local_providers;
1244 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1245 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1248 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1251 let def_path_tables = || {
1252 upstream_def_path_tables
1254 .map(|&(cnum, ref rc)| (cnum, &**rc))
1255 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1258 // Precompute the capacity of the hashmap so we don't have to
1259 // re-allocate when populating it.
1260 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1262 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1264 ::std::default::Default::default()
1267 for (cnum, def_path_table) in def_path_tables() {
1268 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1276 let mut trait_map: FxHashMap<_, FxHashMap<_, _>> = FxHashMap::default();
1277 for (k, v) in resolutions.trait_map {
1278 let hir_id = hir.node_to_hir_id(k);
1279 let map = trait_map.entry(hir_id.owner).or_default();
1280 map.insert(hir_id.local_id, StableVec::new(v));
1286 arena: WorkerLocal::new(|_| Arena::default()),
1287 global_interners: interners,
1290 types: common_types,
1291 lifetimes: common_lifetimes,
1292 consts: common_consts,
1294 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1295 let exports: Vec<_> = v.into_iter().map(|e| {
1296 e.map_id(|id| hir.node_to_hir_id(id))
1300 upvars: resolutions.upvars.into_iter().map(|(k, v)| {
1301 let vars: Vec<_> = v.into_iter().map(|e| {
1302 e.map_id(|id| hir.node_to_hir_id(id))
1304 (hir.local_def_id(k), vars)
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) -> &'gcx middle::lib_features::LibFeatures {
1347 self.get_lib_features(LOCAL_CRATE)
1350 pub fn lang_items(self) -> &'gcx 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) -> &'gcx stability::Index<'gcx> {
1389 self.stability_index(LOCAL_CRATE)
1392 pub fn crates(self) -> &'gcx [CrateNum] {
1393 self.all_crate_nums(LOCAL_CRATE)
1396 pub fn features(self) -> &'gcx 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<'a> {
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<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1670 pub fn encode_metadata(self)
1673 self.cstore.encode_metadata(self)
1677 impl<'gcx> GlobalCtxt<'gcx> {
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<'tcx, F, R>(
1683 arena: &'tcx SyncDroplessArena,
1684 interners: &'tcx mut Option<CtxtInterners<'tcx>>,
1688 F: FnOnce(TyCtxt<'tcx, 'gcx, 'tcx>) -> R,
1691 *interners = Some(CtxtInterners::new(&arena));
1694 interners: interners.as_ref().unwrap(),
1697 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1698 let new_icx = ty::tls::ImplicitCtxt {
1700 query: icx.query.clone(),
1701 diagnostics: icx.diagnostics,
1702 layout_depth: icx.layout_depth,
1703 task_deps: icx.task_deps,
1705 ty::tls::enter_context(&new_icx, |_| {
1712 /// A trait implemented for all X<'a> types which can be safely and
1713 /// efficiently converted to X<'tcx> as long as they are part of the
1714 /// provided TyCtxt<'tcx>.
1715 /// This can be done, for example, for Ty<'tcx> or SubstsRef<'tcx>
1716 /// by looking them up in their respective interners.
1718 /// However, this is still not the best implementation as it does
1719 /// need to compare the components, even for interned values.
1720 /// It would be more efficient if TypedArena provided a way to
1721 /// determine whether the address is in the allocated range.
1723 /// None is returned if the value or one of the components is not part
1724 /// of the provided context.
1725 /// For Ty, None can be returned if either the type interner doesn't
1726 /// contain the TyKind key or if the address of the interned
1727 /// pointer differs. The latter case is possible if a primitive type,
1728 /// e.g., `()` or `u8`, was interned in a different context.
1729 pub trait Lift<'tcx>: fmt::Debug {
1730 type Lifted: fmt::Debug + 'tcx;
1731 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1735 macro_rules! nop_lift {
1736 ($ty:ty => $lifted:ty) => {
1737 impl<'a, 'tcx> Lift<'tcx> for $ty {
1738 type Lifted = $lifted;
1739 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1740 if tcx.interners.arena.in_arena(*self as *const _) {
1741 return Some(unsafe { mem::transmute(*self) });
1743 // Also try in the global tcx if we're not that.
1744 if !tcx.is_global() {
1745 self.lift_to_tcx(tcx.global_tcx())
1754 macro_rules! nop_list_lift {
1755 ($ty:ty => $lifted:ty) => {
1756 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1757 type Lifted = &'tcx List<$lifted>;
1758 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1759 if self.is_empty() {
1760 return Some(List::empty());
1762 if tcx.interners.arena.in_arena(*self as *const _) {
1763 return Some(unsafe { mem::transmute(*self) });
1765 // Also try in the global tcx if we're not that.
1766 if !tcx.is_global() {
1767 self.lift_to_tcx(tcx.global_tcx())
1776 nop_lift!{Ty<'a> => Ty<'tcx>}
1777 nop_lift!{Region<'a> => Region<'tcx>}
1778 nop_lift!{Goal<'a> => Goal<'tcx>}
1779 nop_lift!{&'a Const<'a> => &'tcx Const<'tcx>}
1781 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1782 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1783 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1784 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1785 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1786 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1787 nop_list_lift!{ProjectionKind => ProjectionKind}
1789 // this is the impl for `&'a InternalSubsts<'a>`
1790 nop_list_lift!{Kind<'a> => Kind<'tcx>}
1793 use super::{GlobalCtxt, TyCtxt, ptr_eq};
1797 use std::marker::PhantomData;
1799 use crate::ty::query;
1800 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1801 use rustc_data_structures::OnDrop;
1802 use rustc_data_structures::sync::{self, Lrc, Lock};
1803 use rustc_data_structures::thin_vec::ThinVec;
1804 use crate::dep_graph::TaskDeps;
1806 #[cfg(not(parallel_compiler))]
1807 use std::cell::Cell;
1809 #[cfg(parallel_compiler)]
1810 use rustc_rayon_core as rayon_core;
1812 /// This is the implicit state of rustc. It contains the current
1813 /// TyCtxt and query. It is updated when creating a local interner or
1814 /// executing a new query. Whenever there's a TyCtxt value available
1815 /// you should also have access to an ImplicitCtxt through the functions
1818 pub struct ImplicitCtxt<'a, 'gcx: 'tcx, 'tcx> {
1819 /// The current TyCtxt. Initially created by `enter_global` and updated
1820 /// by `enter_local` with a new local interner
1821 pub tcx: TyCtxt<'tcx, 'gcx, 'tcx>,
1823 /// The current query job, if any. This is updated by JobOwner::start in
1824 /// ty::query::plumbing when executing a query
1825 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1827 /// Where to store diagnostics for the current query job, if any.
1828 /// This is updated by JobOwner::start in ty::query::plumbing when executing a query
1829 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1831 /// Used to prevent layout from recursing too deeply.
1832 pub layout_depth: usize,
1834 /// The current dep graph task. This is used to add dependencies to queries
1835 /// when executing them
1836 pub task_deps: Option<&'a Lock<TaskDeps>>,
1839 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1840 /// to `value` during the call to `f`. It is restored to its previous value after.
1841 /// This is used to set the pointer to the new ImplicitCtxt.
1842 #[cfg(parallel_compiler)]
1844 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1845 rayon_core::tlv::with(value, f)
1848 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1849 /// This is used to get the pointer to the current ImplicitCtxt.
1850 #[cfg(parallel_compiler)]
1852 fn get_tlv() -> usize {
1853 rayon_core::tlv::get()
1856 #[cfg(not(parallel_compiler))]
1858 /// A thread local variable which stores a pointer to the current ImplicitCtxt.
1859 static TLV: Cell<usize> = Cell::new(0);
1862 /// Sets TLV to `value` during the call to `f`.
1863 /// It is restored to its previous value after.
1864 /// This is used to set the pointer to the new ImplicitCtxt.
1865 #[cfg(not(parallel_compiler))]
1867 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1868 let old = get_tlv();
1869 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1870 TLV.with(|tlv| tlv.set(value));
1874 /// This is used to get the pointer to the current ImplicitCtxt.
1875 #[cfg(not(parallel_compiler))]
1876 fn get_tlv() -> usize {
1877 TLV.with(|tlv| tlv.get())
1880 /// This is a callback from libsyntax as it cannot access the implicit state
1881 /// in librustc otherwise
1882 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1884 if let Some(tcx) = tcx {
1885 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1887 syntax_pos::default_span_debug(span, f)
1892 /// This is a callback from libsyntax as it cannot access the implicit state
1893 /// in librustc otherwise. It is used to when diagnostic messages are
1894 /// emitted and stores them in the current query, if there is one.
1895 fn track_diagnostic(diagnostic: &Diagnostic) {
1896 with_context_opt(|icx| {
1897 if let Some(icx) = icx {
1898 if let Some(ref diagnostics) = icx.diagnostics {
1899 let mut diagnostics = diagnostics.lock();
1900 diagnostics.extend(Some(diagnostic.clone()));
1906 /// Sets up the callbacks from libsyntax on the current thread
1907 pub fn with_thread_locals<F, R>(f: F) -> R
1908 where F: FnOnce() -> R
1910 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1911 let original_span_debug = span_dbg.get();
1912 span_dbg.set(span_debug);
1914 let _on_drop = OnDrop(move || {
1915 span_dbg.set(original_span_debug);
1918 TRACK_DIAGNOSTICS.with(|current| {
1919 let original = current.get();
1920 current.set(track_diagnostic);
1922 let _on_drop = OnDrop(move || {
1923 current.set(original);
1931 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1933 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1935 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1937 set_tlv(context as *const _ as usize, || {
1942 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1943 /// creating a initial TyCtxt and ImplicitCtxt.
1944 /// This happens once per rustc session and TyCtxts only exists
1945 /// inside the `f` function.
1946 pub fn enter_global<'gcx, F, R>(gcx: &'gcx GlobalCtxt<'gcx>, f: F) -> R
1947 where F: FnOnce(TyCtxt<'gcx, 'gcx, 'gcx>) -> R
1949 // Update GCX_PTR to indicate there's a GlobalCtxt available
1950 GCX_PTR.with(|lock| {
1951 *lock.lock() = gcx as *const _ as usize;
1953 // Set GCX_PTR back to 0 when we exit
1954 let _on_drop = OnDrop(move || {
1955 GCX_PTR.with(|lock| *lock.lock() = 0);
1960 interners: &gcx.global_interners,
1963 let icx = ImplicitCtxt {
1970 enter_context(&icx, |_| {
1975 scoped_thread_local! {
1976 /// Stores a pointer to the GlobalCtxt if one is available.
1977 /// This is used to access the GlobalCtxt in the deadlock handler given to Rayon.
1978 pub static GCX_PTR: Lock<usize>
1981 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
1982 /// This is used in the deadlock handler.
1983 pub unsafe fn with_global<F, R>(f: F) -> R
1984 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1986 let gcx = GCX_PTR.with(|lock| *lock.lock());
1988 let gcx = &*(gcx as *const GlobalCtxt<'_>);
1991 interners: &gcx.global_interners,
1994 let icx = ImplicitCtxt {
2001 enter_context(&icx, |_| f(tcx))
2004 /// Allows access to the current ImplicitCtxt in a closure if one is available
2006 pub fn with_context_opt<F, R>(f: F) -> R
2007 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2009 let context = get_tlv();
2013 // We could get a ImplicitCtxt pointer from another thread.
2014 // Ensure that ImplicitCtxt is Sync
2015 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2017 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2021 /// Allows access to the current ImplicitCtxt.
2022 /// Panics if there is no ImplicitCtxt available
2024 pub fn with_context<F, R>(f: F) -> R
2025 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2027 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2030 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2031 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2032 /// with the same 'gcx lifetime as the TyCtxt passed in.
2033 /// This will panic if you pass it a TyCtxt which has a different global interner from
2034 /// the current ImplicitCtxt's tcx field.
2036 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2037 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2039 with_context(|context| {
2041 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
2042 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2048 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2049 /// interner and local interner as the tcx argument passed in. This means the closure
2050 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2051 /// This will panic if you pass it a TyCtxt which has a different global interner or
2052 /// a different local interner from the current ImplicitCtxt's tcx field.
2054 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2055 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2057 with_context(|context| {
2059 assert!(ptr_eq(context.tcx.gcx, tcx.gcx));
2060 assert!(ptr_eq(context.tcx.interners, tcx.interners));
2061 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2067 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2068 /// Panics if there is no ImplicitCtxt available
2070 pub fn with<F, R>(f: F) -> R
2071 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, '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
2080 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2082 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2086 macro_rules! sty_debug_print {
2087 ($ctxt: expr, $($variant: ident),*) => {{
2088 // curious inner module to allow variant names to be used as
2090 #[allow(non_snake_case)]
2092 use crate::ty::{self, TyCtxt};
2093 use crate::ty::context::Interned;
2095 #[derive(Copy, Clone)]
2104 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2105 let mut total = DebugStat {
2112 $(let mut $variant = total;)*
2114 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2115 let variant = match t.sty {
2116 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2117 ty::Float(..) | ty::Str | ty::Never => continue,
2118 ty::Error => /* unimportant */ continue,
2119 $(ty::$variant(..) => &mut $variant,)*
2121 let lt = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2122 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2123 let ct = t.flags.intersects(ty::TypeFlags::HAS_CT_INFER);
2127 if lt { total.lt_infer += 1; variant.lt_infer += 1 }
2128 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2129 if ct { total.ct_infer += 1; variant.ct_infer += 1 }
2130 if lt && ty && ct { total.all_infer += 1; variant.all_infer += 1 }
2132 println!("Ty interner total ty lt ct all");
2133 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2134 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2135 stringify!($variant),
2136 uses = $variant.total,
2137 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2138 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2139 lt = $variant.lt_infer as f64 * 100.0 / total.total as f64,
2140 ct = $variant.ct_infer as f64 * 100.0 / total.total as f64,
2141 all = $variant.all_infer as f64 * 100.0 / total.total as f64);
2143 println!(" total {uses:6} \
2144 {ty:4.1}% {lt:5.1}% {ct:4.1}% {all:4.1}%",
2146 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2147 lt = total.lt_infer as f64 * 100.0 / total.total as f64,
2148 ct = total.ct_infer as f64 * 100.0 / total.total as f64,
2149 all = total.all_infer as f64 * 100.0 / total.total as f64)
2157 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2158 pub fn print_debug_stats(self) {
2161 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2162 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2163 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2165 println!("InternalSubsts interner: #{}", self.interners.substs.borrow().len());
2166 println!("Region interner: #{}", self.interners.region.borrow().len());
2167 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2168 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2169 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2174 /// An entry in an interner.
2175 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2177 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2178 fn clone(&self) -> Self {
2182 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2184 // N.B., an `Interned<Ty>` compares and hashes as a sty.
2185 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2186 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2187 self.0.sty == other.0.sty
2191 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2193 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2194 fn hash<H: Hasher>(&self, s: &mut H) {
2199 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2200 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2205 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2206 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2207 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2208 self.0[..] == other.0[..]
2212 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2214 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2215 fn hash<H: Hasher>(&self, s: &mut H) {
2220 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2221 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2226 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2227 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2232 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, InternalSubsts<'tcx>> {
2233 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2238 impl<'tcx> Borrow<[ProjectionKind]>
2239 for Interned<'tcx, List<ProjectionKind>> {
2240 fn borrow<'a>(&'a self) -> &'a [ProjectionKind] {
2245 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2246 fn borrow<'a>(&'a self) -> &'a RegionKind {
2251 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2252 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2257 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2258 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2259 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2264 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2265 for Interned<'tcx, List<Predicate<'tcx>>> {
2266 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2271 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2272 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2277 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2278 for Interned<'tcx, List<Clause<'tcx>>> {
2279 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2284 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2285 for Interned<'tcx, List<Goal<'tcx>>> {
2286 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2291 macro_rules! intern_method {
2292 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2295 $keep_in_local_tcx:expr) -> $ty:ty) => {
2296 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2297 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2298 let key = ($alloc_to_key)(&v);
2300 // HACK(eddyb) Depend on flags being accurate to
2301 // determine that all contents are in the global tcx.
2302 // See comments on Lift for why we can't use that.
2303 if ($keep_in_local_tcx)(&v) {
2304 self.interners.$name.borrow_mut().intern_ref(key, || {
2305 // Make sure we don't end up with inference
2306 // types/regions in the global tcx.
2307 if self.is_global() {
2308 bug!("Attempted to intern `{:?}` which contains \
2309 inference types/regions in the global type context",
2313 Interned($alloc_method(&self.interners.arena, v))
2316 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2317 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2321 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2323 let i = unsafe { mem::transmute(i) };
2332 macro_rules! direct_interners {
2333 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2334 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2335 fn eq(&self, other: &Self) -> bool {
2340 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2342 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2343 fn hash<H: Hasher>(&self, s: &mut H) {
2351 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2353 $keep_in_local_tcx) -> $ty);)+
2357 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2358 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2361 direct_interners!('tcx,
2362 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2363 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>,
2364 const_: mk_const(|c: &Const<'_>| keep_local(&c)) -> Const<'tcx>
2367 macro_rules! slice_interners {
2368 ($($field:ident: $method:ident($ty:ty)),+) => (
2369 $(intern_method!( 'tcx, $field: $method(
2371 |a, v| List::from_arena(a, v),
2373 |xs: &[$ty]| xs.iter().any(keep_local)) -> List<$ty>);)+
2378 existential_predicates: _intern_existential_predicates(ExistentialPredicate<'tcx>),
2379 predicates: _intern_predicates(Predicate<'tcx>),
2380 type_list: _intern_type_list(Ty<'tcx>),
2381 substs: _intern_substs(Kind<'tcx>),
2382 clauses: _intern_clauses(Clause<'tcx>),
2383 goal_list: _intern_goals(Goal<'tcx>),
2384 projs: _intern_projs(ProjectionKind)
2387 // This isn't a perfect fit: CanonicalVarInfo slices are always
2388 // allocated in the global arena, so this `intern_method!` macro is
2389 // overly general. But we just return false for the code that checks
2390 // whether they belong in the thread-local arena, so no harm done, and
2391 // seems better than open-coding the rest.
2394 canonical_var_infos: _intern_canonical_var_infos(
2395 &[CanonicalVarInfo],
2396 |a, v| List::from_arena(a, v),
2398 |_xs: &[CanonicalVarInfo]| -> bool { false }
2399 ) -> List<CanonicalVarInfo>
2402 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2403 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2404 /// that is, a `fn` type that is equivalent in every way for being
2406 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2407 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2408 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2409 unsafety: hir::Unsafety::Unsafe,
2414 /// Given a closure signature `sig`, returns an equivalent `fn`
2415 /// type with the same signature. Detuples and so forth -- so
2416 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2417 /// a `fn(u32, i32)`.
2418 /// `unsafety` determines the unsafety of the `fn` type. If you pass
2419 /// `hir::Unsafety::Unsafe` in the previous example, then you would get
2420 /// an `unsafe fn (u32, i32)`.
2421 /// It cannot convert a closure that requires unsafe.
2422 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>, unsafety: hir::Unsafety) -> Ty<'tcx> {
2423 let converted_sig = sig.map_bound(|s| {
2424 let params_iter = match s.inputs()[0].sty {
2425 ty::Tuple(params) => {
2426 params.into_iter().map(|k| k.expect_ty())
2439 self.mk_fn_ptr(converted_sig)
2443 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2444 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2447 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2449 ast::IntTy::Isize => self.types.isize,
2450 ast::IntTy::I8 => self.types.i8,
2451 ast::IntTy::I16 => self.types.i16,
2452 ast::IntTy::I32 => self.types.i32,
2453 ast::IntTy::I64 => self.types.i64,
2454 ast::IntTy::I128 => self.types.i128,
2458 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2460 ast::UintTy::Usize => self.types.usize,
2461 ast::UintTy::U8 => self.types.u8,
2462 ast::UintTy::U16 => self.types.u16,
2463 ast::UintTy::U32 => self.types.u32,
2464 ast::UintTy::U64 => self.types.u64,
2465 ast::UintTy::U128 => self.types.u128,
2469 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2471 ast::FloatTy::F32 => self.types.f32,
2472 ast::FloatTy::F64 => self.types.f64,
2477 pub fn mk_str(self) -> Ty<'tcx> {
2482 pub fn mk_static_str(self) -> Ty<'tcx> {
2483 self.mk_imm_ref(self.lifetimes.re_static, self.mk_str())
2487 pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2488 // take a copy of substs so that we own the vectors inside
2489 self.mk_ty(Adt(def, substs))
2493 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2494 self.mk_ty(Foreign(def_id))
2497 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2498 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2499 let adt_def = self.adt_def(def_id);
2500 let substs = InternalSubsts::for_item(self, def_id, |param, substs| {
2502 GenericParamDefKind::Lifetime |
2503 GenericParamDefKind::Const => {
2506 GenericParamDefKind::Type { has_default, .. } => {
2507 if param.index == 0 {
2510 assert!(has_default);
2511 self.type_of(param.def_id).subst(self, substs).into()
2516 self.mk_ty(Adt(adt_def, substs))
2520 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2521 self.mk_ty(RawPtr(tm))
2525 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2526 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2530 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2531 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2535 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2536 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2540 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2541 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2545 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2546 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2550 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2551 self.mk_imm_ptr(self.mk_unit())
2555 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2556 self.mk_ty(Array(ty, ty::Const::from_usize(self.global_tcx(), n)))
2560 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2561 self.mk_ty(Slice(ty))
2565 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2566 let kinds: Vec<_> = ts.into_iter().map(|&t| Kind::from(t)).collect();
2567 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2570 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2571 iter.intern_with(|ts| {
2572 let kinds: Vec<_> = ts.into_iter().map(|&t| Kind::from(t)).collect();
2573 self.mk_ty(Tuple(self.intern_substs(&kinds)))
2578 pub fn mk_unit(self) -> Ty<'tcx> {
2583 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2584 if self.features().never_type {
2587 self.intern_tup(&[])
2592 pub fn mk_bool(self) -> Ty<'tcx> {
2597 pub fn mk_fn_def(self, def_id: DefId,
2598 substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2599 self.mk_ty(FnDef(def_id, substs))
2603 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2604 self.mk_ty(FnPtr(fty))
2610 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2611 reg: ty::Region<'tcx>
2613 self.mk_ty(Dynamic(obj, reg))
2617 pub fn mk_projection(self,
2619 substs: SubstsRef<'tcx>)
2621 self.mk_ty(Projection(ProjectionTy {
2628 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2630 self.mk_ty(Closure(closure_id, closure_substs))
2634 pub fn mk_generator(self,
2636 generator_substs: GeneratorSubsts<'tcx>,
2637 movability: hir::GeneratorMovability)
2639 self.mk_ty(Generator(id, generator_substs, movability))
2643 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2644 self.mk_ty(GeneratorWitness(types))
2648 pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx> {
2649 self.mk_ty_infer(TyVar(v))
2653 pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx> {
2654 self.mk_const(ty::Const {
2655 val: ConstValue::Infer(InferConst::Var(v)),
2661 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2662 self.mk_ty_infer(IntVar(v))
2666 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2667 self.mk_ty_infer(FloatVar(v))
2671 pub fn mk_ty_infer(self, it: InferTy) -> Ty<'tcx> {
2672 self.mk_ty(Infer(it))
2676 pub fn mk_const_infer(
2678 ic: InferConst<'tcx>,
2680 ) -> &'tcx ty::Const<'tcx> {
2681 self.mk_const(ty::Const {
2682 val: ConstValue::Infer(ic),
2688 pub fn mk_ty_param(self, index: u32, name: InternedString) -> Ty<'tcx> {
2689 self.mk_ty(Param(ParamTy { index, name: name }))
2693 pub fn mk_const_param(
2696 name: InternedString,
2698 ) -> &'tcx Const<'tcx> {
2699 self.mk_const(ty::Const {
2700 val: ConstValue::Param(ParamConst { index, name }),
2706 pub fn mk_self_type(self) -> Ty<'tcx> {
2707 self.mk_ty_param(0, kw::SelfUpper.as_interned_str())
2710 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2712 GenericParamDefKind::Lifetime => {
2713 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2715 GenericParamDefKind::Type { .. } => self.mk_ty_param(param.index, param.name).into(),
2716 GenericParamDefKind::Const => {
2717 self.mk_const_param(param.index, param.name, self.type_of(param.def_id)).into()
2723 pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx> {
2724 self.mk_ty(Opaque(def_id, substs))
2727 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2728 -> &'tcx List<ExistentialPredicate<'tcx>> {
2729 assert!(!eps.is_empty());
2730 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2731 self._intern_existential_predicates(eps)
2734 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2735 -> &'tcx List<Predicate<'tcx>> {
2736 // FIXME consider asking the input slice to be sorted to avoid
2737 // re-interning permutations, in which case that would be asserted
2739 if preds.len() == 0 {
2740 // The macro-generated method below asserts we don't intern an empty slice.
2743 self._intern_predicates(preds)
2747 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2751 self._intern_type_list(ts)
2755 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2759 self._intern_substs(ts)
2763 pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind> {
2767 self._intern_projs(ps)
2771 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2775 self.global_tcx()._intern_canonical_var_infos(ts)
2779 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2783 self._intern_clauses(ts)
2787 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2791 self._intern_goals(ts)
2795 pub fn mk_fn_sig<I>(self,
2799 unsafety: hir::Unsafety,
2801 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2803 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2805 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2806 inputs_and_output: self.intern_type_list(xs),
2807 c_variadic, unsafety, abi
2811 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2812 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2814 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2817 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2818 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2820 iter.intern_with(|xs| self.intern_predicates(xs))
2823 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2824 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2825 iter.intern_with(|xs| self.intern_type_list(xs))
2828 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2829 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2830 iter.intern_with(|xs| self.intern_substs(xs))
2833 pub fn mk_substs_trait(self,
2835 rest: &[Kind<'tcx>])
2838 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2841 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2842 iter.intern_with(|xs| self.intern_clauses(xs))
2845 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2846 iter.intern_with(|xs| self.intern_goals(xs))
2849 pub fn lint_hir<S: Into<MultiSpan>>(self,
2850 lint: &'static Lint,
2854 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2857 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2858 lint: &'static Lint,
2863 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2868 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2869 lint: &'static Lint,
2874 let mut err = self.struct_span_lint_hir(lint, id, span.into(), msg);
2879 /// Walks upwards from `id` to find a node which might change lint levels with attributes.
2880 /// It stops at `bound` and just returns it if reached.
2881 pub fn maybe_lint_level_root_bounded(
2890 if lint::maybe_lint_level_root(self, id) {
2893 let next = self.hir().get_parent_node_by_hir_id(id);
2895 bug!("lint traversal reached the root of the crate");
2901 pub fn lint_level_at_node(
2903 lint: &'static Lint,
2905 ) -> (lint::Level, lint::LintSource) {
2906 let sets = self.lint_levels(LOCAL_CRATE);
2908 if let Some(pair) = sets.level_and_source(lint, id, self.sess) {
2911 let next = self.hir().get_parent_node_by_hir_id(id);
2913 bug!("lint traversal reached the root of the crate");
2919 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2920 lint: &'static Lint,
2924 -> DiagnosticBuilder<'tcx>
2926 let (level, src) = self.lint_level_at_node(lint, hir_id);
2927 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2930 pub fn struct_lint_node(self, lint: &'static Lint, id: HirId, msg: &str)
2931 -> DiagnosticBuilder<'tcx>
2933 let (level, src) = self.lint_level_at_node(lint, id);
2934 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2937 pub fn in_scope_traits(self, id: HirId) -> Option<&'gcx StableVec<TraitCandidate>> {
2938 self.in_scope_traits_map(id.owner)
2939 .and_then(|map| map.get(&id.local_id))
2942 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2943 self.named_region_map(id.owner)
2944 .and_then(|map| map.get(&id.local_id).cloned())
2947 pub fn is_late_bound(self, id: HirId) -> bool {
2948 self.is_late_bound_map(id.owner)
2949 .map(|set| set.contains(&id.local_id))
2953 pub fn object_lifetime_defaults(self, id: HirId)
2954 -> Option<&'gcx [ObjectLifetimeDefault]>
2956 self.object_lifetime_defaults_map(id.owner)
2957 .and_then(|map| map.get(&id.local_id).map(|v| &**v))
2961 pub trait InternAs<T: ?Sized, R> {
2963 fn intern_with<F>(self, f: F) -> Self::Output
2964 where F: FnOnce(&T) -> R;
2967 impl<I, T, R, E> InternAs<[T], R> for I
2968 where E: InternIteratorElement<T, R>,
2969 I: Iterator<Item=E> {
2970 type Output = E::Output;
2971 fn intern_with<F>(self, f: F) -> Self::Output
2972 where F: FnOnce(&[T]) -> R {
2973 E::intern_with(self, f)
2977 pub trait InternIteratorElement<T, R>: Sized {
2979 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2982 impl<T, R> InternIteratorElement<T, R> for T {
2984 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2985 f(&iter.collect::<SmallVec<[_; 8]>>())
2989 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2993 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2994 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2998 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2999 type Output = Result<R, E>;
3000 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3001 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
3005 // We are comparing types with different invariant lifetimes, so `ptr::eq`
3006 // won't work for us.
3007 fn ptr_eq<T, U>(t: *const T, u: *const U) -> bool {
3008 t as *const () == u as *const ()
3011 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3012 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id);
3013 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).map(|v| &v[..]);
3014 providers.crate_name = |tcx, id| {
3015 assert_eq!(id, LOCAL_CRATE);
3018 providers.get_lib_features = |tcx, id| {
3019 assert_eq!(id, LOCAL_CRATE);
3020 tcx.arena.alloc(middle::lib_features::collect(tcx))
3022 providers.get_lang_items = |tcx, id| {
3023 assert_eq!(id, LOCAL_CRATE);
3024 tcx.arena.alloc(middle::lang_items::collect(tcx))
3026 providers.upvars = |tcx, id| tcx.gcx.upvars.get(&id).map(|v| &v[..]);
3027 providers.maybe_unused_trait_import = |tcx, id| {
3028 tcx.maybe_unused_trait_imports.contains(&id)
3030 providers.maybe_unused_extern_crates = |tcx, cnum| {
3031 assert_eq!(cnum, LOCAL_CRATE);
3032 &tcx.maybe_unused_extern_crates[..]
3034 providers.names_imported_by_glob_use = |tcx, id| {
3035 assert_eq!(id.krate, LOCAL_CRATE);
3036 Lrc::new(tcx.glob_map.get(&id).cloned().unwrap_or_default())
3039 providers.stability_index = |tcx, cnum| {
3040 assert_eq!(cnum, LOCAL_CRATE);
3041 tcx.arena.alloc(stability::Index::new(tcx))
3043 providers.lookup_stability = |tcx, id| {
3044 assert_eq!(id.krate, LOCAL_CRATE);
3045 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3046 tcx.stability().local_stability(id)
3048 providers.lookup_deprecation_entry = |tcx, id| {
3049 assert_eq!(id.krate, LOCAL_CRATE);
3050 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3051 tcx.stability().local_deprecation_entry(id)
3053 providers.extern_mod_stmt_cnum = |tcx, id| {
3054 let id = tcx.hir().as_local_node_id(id).unwrap();
3055 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3057 providers.all_crate_nums = |tcx, cnum| {
3058 assert_eq!(cnum, LOCAL_CRATE);
3059 tcx.arena.alloc_slice(&tcx.cstore.crates_untracked())
3061 providers.postorder_cnums = |tcx, cnum| {
3062 assert_eq!(cnum, LOCAL_CRATE);
3063 tcx.arena.alloc_slice(&tcx.cstore.postorder_cnums_untracked())
3065 providers.output_filenames = |tcx, cnum| {
3066 assert_eq!(cnum, LOCAL_CRATE);
3067 tcx.output_filenames.clone()
3069 providers.features_query = |tcx, cnum| {
3070 assert_eq!(cnum, LOCAL_CRATE);
3071 tcx.arena.alloc(tcx.sess.features_untracked().clone())
3073 providers.is_panic_runtime = |tcx, cnum| {
3074 assert_eq!(cnum, LOCAL_CRATE);
3075 attr::contains_name(tcx.hir().krate_attrs(), sym::panic_runtime)
3077 providers.is_compiler_builtins = |tcx, cnum| {
3078 assert_eq!(cnum, LOCAL_CRATE);
3079 attr::contains_name(tcx.hir().krate_attrs(), sym::compiler_builtins)