1 //! Type context book-keeping.
3 use crate::dep_graph::DepGraph;
4 use crate::dep_graph::{self, DepNode, DepConstructor};
5 use crate::session::Session;
6 use crate::session::config::{BorrowckMode, OutputFilenames};
7 use crate::session::config::CrateType;
9 use crate::hir::{TraitCandidate, HirId, ItemKind, ItemLocalId, Node};
10 use crate::hir::def::{Def, Export};
11 use crate::hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
12 use crate::hir::map as hir_map;
13 use crate::hir::map::DefPathHash;
14 use crate::lint::{self, Lint};
15 use crate::ich::{StableHashingContext, NodeIdHashingMode};
16 use crate::infer::canonical::{Canonical, CanonicalVarInfo, CanonicalVarInfos};
17 use crate::infer::outlives::free_region_map::FreeRegionMap;
18 use crate::middle::cstore::CrateStoreDyn;
19 use crate::middle::cstore::EncodedMetadata;
20 use crate::middle::lang_items;
21 use crate::middle::resolve_lifetime::{self, ObjectLifetimeDefault};
22 use crate::middle::stability;
23 use crate::mir::{self, Mir, interpret, ProjectionKind};
24 use crate::mir::interpret::Allocation;
25 use crate::ty::subst::{Kind, Substs, Subst};
26 use crate::ty::ReprOptions;
28 use crate::traits::{Clause, Clauses, GoalKind, Goal, Goals};
29 use crate::ty::{self, Ty, TypeAndMut};
30 use crate::ty::{TyS, TyKind, List};
31 use crate::ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorSubsts, Region, Const, LazyConst};
32 use crate::ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
33 use crate::ty::RegionKind;
34 use crate::ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid};
35 use crate::ty::TyKind::*;
36 use crate::ty::GenericParamDefKind;
37 use crate::ty::layout::{LayoutDetails, TargetDataLayout, VariantIdx};
39 use crate::ty::steal::Steal;
40 use crate::ty::subst::{UserSubsts, UnpackedKind};
41 use crate::ty::{BoundVar, BindingMode};
42 use crate::ty::CanonicalPolyFnSig;
43 use crate::util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap};
44 use crate::util::nodemap::{FxHashMap, FxHashSet};
45 use errors::DiagnosticBuilder;
46 use rustc_data_structures::interner::HashInterner;
47 use smallvec::SmallVec;
48 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
49 StableHasher, StableHasherResult,
51 use arena::{TypedArena, SyncDroplessArena};
52 use rustc_data_structures::indexed_vec::{Idx, IndexVec};
53 use rustc_data_structures::sync::{self, Lrc, Lock, WorkerLocal};
55 use std::borrow::Borrow;
56 use std::cmp::Ordering;
57 use std::collections::hash_map::{self, Entry};
58 use std::hash::{Hash, Hasher};
61 use std::ops::{Deref, Bound};
66 use std::marker::PhantomData;
67 use rustc_target::spec::abi;
68 use syntax::ast::{self, NodeId};
70 use syntax::source_map::MultiSpan;
71 use syntax::edition::Edition;
72 use syntax::feature_gate;
73 use syntax::symbol::{Symbol, keywords, InternedString};
78 pub struct AllArenas<'tcx> {
79 pub global: WorkerLocal<GlobalArenas<'tcx>>,
80 pub interner: SyncDroplessArena,
81 global_ctxt: Option<GlobalCtxt<'tcx>>,
84 impl<'tcx> AllArenas<'tcx> {
85 pub fn new() -> Self {
87 global: WorkerLocal::new(|_| GlobalArenas::default()),
88 interner: SyncDroplessArena::default(),
96 pub struct GlobalArenas<'tcx> {
98 layout: TypedArena<LayoutDetails>,
101 generics: TypedArena<ty::Generics>,
102 trait_def: TypedArena<ty::TraitDef>,
103 adt_def: TypedArena<ty::AdtDef>,
104 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
105 mir: TypedArena<Mir<'tcx>>,
106 tables: TypedArena<ty::TypeckTables<'tcx>>,
108 const_allocs: TypedArena<interpret::Allocation>,
111 type InternedSet<'tcx, T> = Lock<FxHashMap<Interned<'tcx, T>, ()>>;
113 pub struct CtxtInterners<'tcx> {
114 /// The arena that types, regions, etc are allocated from
115 arena: &'tcx SyncDroplessArena,
117 /// Specifically use a speedy hash algorithm for these hash sets,
118 /// they're accessed quite often.
119 type_: InternedSet<'tcx, TyS<'tcx>>,
120 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
121 substs: InternedSet<'tcx, Substs<'tcx>>,
122 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
123 region: InternedSet<'tcx, RegionKind>,
124 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
125 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
126 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
127 goal: InternedSet<'tcx, GoalKind<'tcx>>,
128 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
129 projs: InternedSet<'tcx, List<ProjectionKind<'tcx>>>,
130 lazy_const: InternedSet<'tcx, LazyConst<'tcx>>,
133 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
134 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
137 type_: Default::default(),
138 type_list: Default::default(),
139 substs: Default::default(),
140 region: Default::default(),
141 existential_predicates: Default::default(),
142 canonical_var_infos: Default::default(),
143 predicates: Default::default(),
144 clauses: Default::default(),
145 goal: Default::default(),
146 goal_list: Default::default(),
147 projs: Default::default(),
148 lazy_const: Default::default(),
155 local: &CtxtInterners<'tcx>,
156 global: &CtxtInterners<'gcx>,
159 let flags = super::flags::FlagComputation::for_sty(&st);
161 // HACK(eddyb) Depend on flags being accurate to
162 // determine that all contents are in the global tcx.
163 // See comments on Lift for why we can't use that.
164 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
165 local.type_.borrow_mut().intern(st, |st| {
166 let ty_struct = TyS {
169 outer_exclusive_binder: flags.outer_exclusive_binder,
172 // Make sure we don't end up with inference
173 // types/regions in the global interner
174 if ptr::eq(local, global) {
175 bug!("Attempted to intern `{:?}` which contains \
176 inference types/regions in the global type context",
180 Interned(local.arena.alloc(ty_struct))
183 global.type_.borrow_mut().intern(st, |st| {
184 let ty_struct = TyS {
187 outer_exclusive_binder: flags.outer_exclusive_binder,
190 // This is safe because all the types the ty_struct can point to
191 // already is in the global arena
192 let ty_struct: TyS<'gcx> = unsafe {
193 mem::transmute(ty_struct)
196 Interned(global.arena.alloc(ty_struct))
202 pub struct CommonTypes<'tcx> {
223 pub re_empty: Region<'tcx>,
224 pub re_static: Region<'tcx>,
225 pub re_erased: Region<'tcx>,
228 pub struct LocalTableInContext<'a, V: 'a> {
229 local_id_root: Option<DefId>,
230 data: &'a ItemLocalMap<V>
233 /// Validate that the given HirId (respectively its `local_id` part) can be
234 /// safely used as a key in the tables of a TypeckTable. For that to be
235 /// the case, the HirId must have the same `owner` as all the other IDs in
236 /// this table (signified by `local_id_root`). Otherwise the HirId
237 /// would be in a different frame of reference and using its `local_id`
238 /// would result in lookup errors, or worse, in silently wrong data being
240 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
243 if cfg!(debug_assertions) {
244 if let Some(local_id_root) = local_id_root {
245 if hir_id.owner != local_id_root.index {
246 ty::tls::with(|tcx| {
247 let node_id = tcx.hir().hir_to_node_id(hir_id);
249 bug!("node {} with HirId::owner {:?} cannot be placed in \
250 TypeckTables with local_id_root {:?}",
251 tcx.hir().node_to_string(node_id),
252 DefId::local(hir_id.owner),
257 // We use "Null Object" TypeckTables in some of the analysis passes.
258 // These are just expected to be empty and their `local_id_root` is
259 // `None`. Therefore we cannot verify whether a given `HirId` would
260 // be a valid key for the given table. Instead we make sure that
261 // nobody tries to write to such a Null Object table.
263 bug!("access to invalid TypeckTables")
269 impl<'a, V> LocalTableInContext<'a, V> {
270 pub fn contains_key(&self, id: hir::HirId) -> bool {
271 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
272 self.data.contains_key(&id.local_id)
275 pub fn get(&self, id: hir::HirId) -> Option<&V> {
276 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
277 self.data.get(&id.local_id)
280 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
285 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
288 fn index(&self, key: hir::HirId) -> &V {
289 self.get(key).expect("LocalTableInContext: key not found")
293 pub struct LocalTableInContextMut<'a, V: 'a> {
294 local_id_root: Option<DefId>,
295 data: &'a mut ItemLocalMap<V>
298 impl<'a, V> LocalTableInContextMut<'a, V> {
299 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
300 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
301 self.data.get_mut(&id.local_id)
304 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
305 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
306 self.data.entry(id.local_id)
309 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
310 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
311 self.data.insert(id.local_id, val)
314 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
315 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
316 self.data.remove(&id.local_id)
320 #[derive(RustcEncodable, RustcDecodable, Debug)]
321 pub struct TypeckTables<'tcx> {
322 /// The HirId::owner all ItemLocalIds in this table are relative to.
323 pub local_id_root: Option<DefId>,
325 /// Resolved definitions for `<T>::X` associated paths and
326 /// method calls, including those of overloaded operators.
327 type_dependent_defs: ItemLocalMap<Def>,
329 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
330 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
331 /// about the field you also need definition of the variant to which the field
332 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
333 field_indices: ItemLocalMap<usize>,
335 /// Stores the types for various nodes in the AST. Note that this table
336 /// is not guaranteed to be populated until after typeck. See
337 /// typeck::check::fn_ctxt for details.
338 node_types: ItemLocalMap<Ty<'tcx>>,
340 /// Stores the type parameters which were substituted to obtain the type
341 /// of this node. This only applies to nodes that refer to entities
342 /// parameterized by type parameters, such as generic fns, types, or
344 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
346 /// This will either store the canonicalized types provided by the user
347 /// or the substitutions that the user explicitly gave (if any) attached
348 /// to `id`. These will not include any inferred values. The canonical form
349 /// is used to capture things like `_` or other unspecified values.
351 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
352 /// canonical substitutions would include only `for<X> { Vec<X> }`.
354 /// See also `AscribeUserType` statement in MIR.
355 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
357 /// Stores the canonicalized types provided by the user. See also
358 /// `AscribeUserType` statement in MIR.
359 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
361 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
363 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
364 pat_binding_modes: ItemLocalMap<BindingMode>,
366 /// Stores the types which were implicitly dereferenced in pattern binding modes
367 /// for later usage in HAIR lowering. For example,
370 /// match &&Some(5i32) {
375 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
378 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
379 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
382 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
384 /// Records the reasons that we picked the kind of each closure;
385 /// not all closures are present in the map.
386 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
388 /// For each fn, records the "liberated" types of its arguments
389 /// and return type. Liberated means that all bound regions
390 /// (including late-bound regions) are replaced with free
391 /// equivalents. This table is not used in codegen (since regions
392 /// are erased there) and hence is not serialized to metadata.
393 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
395 /// For each FRU expression, record the normalized types of the fields
396 /// of the struct - this is needed because it is non-trivial to
397 /// normalize while preserving regions. This table is used only in
398 /// MIR construction and hence is not serialized to metadata.
399 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
401 /// Maps a cast expression to its kind. This is keyed on the
402 /// *from* expression of the cast, not the cast itself.
403 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
405 /// Set of trait imports actually used in the method resolution.
406 /// This is used for warning unused imports. During type
407 /// checking, this `Lrc` should not be cloned: it must have a ref-count
408 /// of 1 so that we can insert things into the set mutably.
409 pub used_trait_imports: Lrc<DefIdSet>,
411 /// If any errors occurred while type-checking this body,
412 /// this field will be set to `true`.
413 pub tainted_by_errors: bool,
415 /// Stores the free-region relationships that were deduced from
416 /// its where-clauses and parameter types. These are then
417 /// read-again by borrowck.
418 pub free_region_map: FreeRegionMap<'tcx>,
420 /// All the existential types that are restricted to concrete types
422 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
424 /// Given the closure ID this map provides the list of UpvarIDs used by it.
425 /// The upvarID contains the HIR node ID and it also contains the full path
426 /// leading to the member of the struct or tuple that is used instead of the
428 pub upvar_list: ty::UpvarListMap,
431 impl<'tcx> TypeckTables<'tcx> {
432 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
435 type_dependent_defs: Default::default(),
436 field_indices: Default::default(),
437 user_provided_types: Default::default(),
438 user_provided_sigs: Default::default(),
439 node_types: Default::default(),
440 node_substs: Default::default(),
441 adjustments: Default::default(),
442 pat_binding_modes: Default::default(),
443 pat_adjustments: Default::default(),
444 upvar_capture_map: Default::default(),
445 closure_kind_origins: Default::default(),
446 liberated_fn_sigs: Default::default(),
447 fru_field_types: Default::default(),
448 cast_kinds: Default::default(),
449 used_trait_imports: Lrc::new(Default::default()),
450 tainted_by_errors: false,
451 free_region_map: Default::default(),
452 concrete_existential_types: Default::default(),
453 upvar_list: Default::default(),
457 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
458 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
460 hir::QPath::Resolved(_, ref path) => path.def,
461 hir::QPath::TypeRelative(..) => {
462 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
463 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
468 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
469 LocalTableInContext {
470 local_id_root: self.local_id_root,
471 data: &self.type_dependent_defs
475 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
476 LocalTableInContextMut {
477 local_id_root: self.local_id_root,
478 data: &mut self.type_dependent_defs
482 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
483 LocalTableInContext {
484 local_id_root: self.local_id_root,
485 data: &self.field_indices
489 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
490 LocalTableInContextMut {
491 local_id_root: self.local_id_root,
492 data: &mut self.field_indices
496 pub fn user_provided_types(
498 ) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
499 LocalTableInContext {
500 local_id_root: self.local_id_root,
501 data: &self.user_provided_types
505 pub fn user_provided_types_mut(
507 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
508 LocalTableInContextMut {
509 local_id_root: self.local_id_root,
510 data: &mut self.user_provided_types
514 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
515 LocalTableInContext {
516 local_id_root: self.local_id_root,
517 data: &self.node_types
521 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
522 LocalTableInContextMut {
523 local_id_root: self.local_id_root,
524 data: &mut self.node_types
528 pub fn node_type(&self, id: hir::HirId) -> Ty<'tcx> {
529 self.node_type_opt(id).unwrap_or_else(||
530 bug!("node_type: no type for node `{}`",
531 tls::with(|tcx| tcx.hir().hir_to_string(id)))
535 pub fn node_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
536 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
537 self.node_types.get(&id.local_id).cloned()
540 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
541 LocalTableInContextMut {
542 local_id_root: self.local_id_root,
543 data: &mut self.node_substs
547 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
548 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
549 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
552 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
553 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
554 self.node_substs.get(&id.local_id).cloned()
557 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
558 // doesn't provide type parameter substitutions.
559 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
560 self.node_type(pat.hir_id)
563 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
564 self.node_type_opt(pat.hir_id)
567 // Returns the type of an expression as a monotype.
569 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
570 // some cases, we insert `Adjustment` annotations such as auto-deref or
571 // auto-ref. The type returned by this function does not consider such
572 // adjustments. See `expr_ty_adjusted()` instead.
574 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
575 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
576 // instead of "fn(ty) -> T with T = isize".
577 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
578 self.node_type(expr.hir_id)
581 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
582 self.node_type_opt(expr.hir_id)
585 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
586 LocalTableInContext {
587 local_id_root: self.local_id_root,
588 data: &self.adjustments
592 pub fn adjustments_mut(&mut self)
593 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
594 LocalTableInContextMut {
595 local_id_root: self.local_id_root,
596 data: &mut self.adjustments
600 pub fn expr_adjustments(&self, expr: &hir::Expr)
601 -> &[ty::adjustment::Adjustment<'tcx>] {
602 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
603 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
606 /// Returns the type of `expr`, considering any `Adjustment`
607 /// entry recorded for that expression.
608 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
609 self.expr_adjustments(expr)
611 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
614 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
615 self.expr_adjustments(expr)
617 .map(|adj| adj.target)
618 .or_else(|| self.expr_ty_opt(expr))
621 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
622 // Only paths and method calls/overloaded operators have
623 // entries in type_dependent_defs, ignore the former here.
624 if let hir::ExprKind::Path(_) = expr.node {
628 match self.type_dependent_defs().get(expr.hir_id) {
629 Some(&Def::Method(_)) => true,
634 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
635 LocalTableInContext {
636 local_id_root: self.local_id_root,
637 data: &self.pat_binding_modes
641 pub fn pat_binding_modes_mut(&mut self)
642 -> LocalTableInContextMut<'_, BindingMode> {
643 LocalTableInContextMut {
644 local_id_root: self.local_id_root,
645 data: &mut self.pat_binding_modes
649 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
650 LocalTableInContext {
651 local_id_root: self.local_id_root,
652 data: &self.pat_adjustments,
656 pub fn pat_adjustments_mut(&mut self)
657 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
658 LocalTableInContextMut {
659 local_id_root: self.local_id_root,
660 data: &mut self.pat_adjustments,
664 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
665 self.upvar_capture_map[&upvar_id]
668 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
669 LocalTableInContext {
670 local_id_root: self.local_id_root,
671 data: &self.closure_kind_origins
675 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
676 LocalTableInContextMut {
677 local_id_root: self.local_id_root,
678 data: &mut self.closure_kind_origins
682 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
683 LocalTableInContext {
684 local_id_root: self.local_id_root,
685 data: &self.liberated_fn_sigs
689 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
690 LocalTableInContextMut {
691 local_id_root: self.local_id_root,
692 data: &mut self.liberated_fn_sigs
696 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
697 LocalTableInContext {
698 local_id_root: self.local_id_root,
699 data: &self.fru_field_types
703 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
704 LocalTableInContextMut {
705 local_id_root: self.local_id_root,
706 data: &mut self.fru_field_types
710 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
711 LocalTableInContext {
712 local_id_root: self.local_id_root,
713 data: &self.cast_kinds
717 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
718 LocalTableInContextMut {
719 local_id_root: self.local_id_root,
720 data: &mut self.cast_kinds
725 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
726 fn hash_stable<W: StableHasherResult>(&self,
727 hcx: &mut StableHashingContext<'a>,
728 hasher: &mut StableHasher<W>) {
729 let ty::TypeckTables {
731 ref type_dependent_defs,
733 ref user_provided_types,
734 ref user_provided_sigs,
738 ref pat_binding_modes,
740 ref upvar_capture_map,
741 ref closure_kind_origins,
742 ref liberated_fn_sigs,
747 ref used_trait_imports,
750 ref concrete_existential_types,
755 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
756 type_dependent_defs.hash_stable(hcx, hasher);
757 field_indices.hash_stable(hcx, hasher);
758 user_provided_types.hash_stable(hcx, hasher);
759 user_provided_sigs.hash_stable(hcx, hasher);
760 node_types.hash_stable(hcx, hasher);
761 node_substs.hash_stable(hcx, hasher);
762 adjustments.hash_stable(hcx, hasher);
763 pat_binding_modes.hash_stable(hcx, hasher);
764 pat_adjustments.hash_stable(hcx, hasher);
765 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
772 local_id_root.expect("trying to hash invalid TypeckTables");
774 let var_owner_def_id = DefId {
775 krate: local_id_root.krate,
776 index: var_path.hir_id.owner,
778 let closure_def_id = DefId {
779 krate: local_id_root.krate,
780 index: closure_expr_id.to_def_id().index,
782 (hcx.def_path_hash(var_owner_def_id),
783 var_path.hir_id.local_id,
784 hcx.def_path_hash(closure_def_id))
787 closure_kind_origins.hash_stable(hcx, hasher);
788 liberated_fn_sigs.hash_stable(hcx, hasher);
789 fru_field_types.hash_stable(hcx, hasher);
790 cast_kinds.hash_stable(hcx, hasher);
791 used_trait_imports.hash_stable(hcx, hasher);
792 tainted_by_errors.hash_stable(hcx, hasher);
793 free_region_map.hash_stable(hcx, hasher);
794 concrete_existential_types.hash_stable(hcx, hasher);
795 upvar_list.hash_stable(hcx, hasher);
801 pub struct UserTypeAnnotationIndex {
802 DEBUG_FORMAT = "UserType({})",
803 const START_INDEX = 0,
807 /// Mapping of type annotation indices to canonical user type annotations.
808 pub type CanonicalUserTypeAnnotations<'tcx> =
809 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
811 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
812 pub struct CanonicalUserTypeAnnotation<'tcx> {
813 pub user_ty: CanonicalUserType<'tcx>,
815 pub inferred_ty: Ty<'tcx>,
818 BraceStructTypeFoldableImpl! {
819 impl<'tcx> TypeFoldable<'tcx> for CanonicalUserTypeAnnotation<'tcx> {
820 user_ty, span, inferred_ty
824 BraceStructLiftImpl! {
825 impl<'a, 'tcx> Lift<'tcx> for CanonicalUserTypeAnnotation<'a> {
826 type Lifted = CanonicalUserTypeAnnotation<'tcx>;
827 user_ty, span, inferred_ty
832 /// Canonicalized user type annotation.
833 pub type CanonicalUserType<'gcx> = Canonical<'gcx, UserType<'gcx>>;
835 impl CanonicalUserType<'gcx> {
836 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
837 /// i.e., each thing is mapped to a canonical variable with the same index.
838 pub fn is_identity(&self) -> bool {
840 UserType::Ty(_) => false,
841 UserType::TypeOf(_, user_substs) => {
842 if user_substs.user_self_ty.is_some() {
846 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
847 match kind.unpack() {
848 UnpackedKind::Type(ty) => match ty.sty {
849 ty::Bound(debruijn, b) => {
850 // We only allow a `ty::INNERMOST` index in substitutions.
851 assert_eq!(debruijn, ty::INNERMOST);
857 UnpackedKind::Lifetime(r) => match r {
858 ty::ReLateBound(debruijn, br) => {
859 // We only allow a `ty::INNERMOST` index in substitutions.
860 assert_eq!(*debruijn, ty::INNERMOST);
861 cvar == br.assert_bound_var()
872 /// A user-given type annotation attached to a constant. These arise
873 /// from constants that are named via paths, like `Foo::<A>::new` and
875 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
876 pub enum UserType<'tcx> {
879 /// The canonical type is the result of `type_of(def_id)` with the
880 /// given substitutions applied.
881 TypeOf(DefId, UserSubsts<'tcx>),
884 EnumTypeFoldableImpl! {
885 impl<'tcx> TypeFoldable<'tcx> for UserType<'tcx> {
887 (UserType::TypeOf)(def, substs),
892 impl<'a, 'tcx> Lift<'tcx> for UserType<'a> {
893 type Lifted = UserType<'tcx>;
895 (UserType::TypeOf)(def, substs),
899 impl<'tcx> CommonTypes<'tcx> {
900 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
901 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
902 let mk_region = |r| {
903 interners.region.borrow_mut().intern(r, |r| {
904 Interned(interners.arena.alloc(r))
909 unit: mk(Tuple(List::empty())),
914 isize: mk(Int(ast::IntTy::Isize)),
915 i8: mk(Int(ast::IntTy::I8)),
916 i16: mk(Int(ast::IntTy::I16)),
917 i32: mk(Int(ast::IntTy::I32)),
918 i64: mk(Int(ast::IntTy::I64)),
919 i128: mk(Int(ast::IntTy::I128)),
920 usize: mk(Uint(ast::UintTy::Usize)),
921 u8: mk(Uint(ast::UintTy::U8)),
922 u16: mk(Uint(ast::UintTy::U16)),
923 u32: mk(Uint(ast::UintTy::U32)),
924 u64: mk(Uint(ast::UintTy::U64)),
925 u128: mk(Uint(ast::UintTy::U128)),
926 f32: mk(Float(ast::FloatTy::F32)),
927 f64: mk(Float(ast::FloatTy::F64)),
929 re_empty: mk_region(RegionKind::ReEmpty),
930 re_static: mk_region(RegionKind::ReStatic),
931 re_erased: mk_region(RegionKind::ReErased),
936 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
939 pub struct FreeRegionInfo {
940 // def id corresponding to FreeRegion
942 // the bound region corresponding to FreeRegion
943 pub boundregion: ty::BoundRegion,
944 // checks if bound region is in Impl Item
945 pub is_impl_item: bool,
948 /// The central data structure of the compiler. It stores references
949 /// to the various **arenas** and also houses the results of the
950 /// various **compiler queries** that have been performed. See the
951 /// [rustc guide] for more details.
953 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
954 #[derive(Copy, Clone)]
955 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
956 gcx: &'gcx GlobalCtxt<'gcx>,
957 interners: &'tcx CtxtInterners<'tcx>,
958 dummy: PhantomData<&'a ()>,
961 impl<'gcx> Deref for TyCtxt<'_, 'gcx, '_> {
962 type Target = &'gcx GlobalCtxt<'gcx>;
964 fn deref(&self) -> &Self::Target {
969 pub struct GlobalCtxt<'tcx> {
970 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
971 global_interners: CtxtInterners<'tcx>,
973 cstore: &'tcx CrateStoreDyn,
975 pub sess: &'tcx Session,
977 pub dep_graph: DepGraph,
979 /// Common types, pre-interned for your convenience.
980 pub types: CommonTypes<'tcx>,
982 /// Map indicating what traits are in scope for places where this
983 /// is relevant; generated by resolve.
984 trait_map: FxHashMap<DefIndex,
985 Lrc<FxHashMap<ItemLocalId,
986 Lrc<StableVec<TraitCandidate>>>>>,
988 /// Export map produced by name resolution.
989 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
991 hir_map: hir_map::Map<'tcx>,
993 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
994 /// as well as all upstream crates. Only populated in incremental mode.
995 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
997 pub queries: query::Queries<'tcx>,
999 // Records the free variables referenced by every closure
1000 // expression. Do not track deps for this, just recompute it from
1001 // scratch every time.
1002 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
1004 maybe_unused_trait_imports: FxHashSet<DefId>,
1005 maybe_unused_extern_crates: Vec<(DefId, Span)>,
1006 /// A map of glob use to a set of names it actually imports. Currently only
1007 /// used in save-analysis.
1008 glob_map: FxHashMap<DefId, FxHashSet<ast::Name>>,
1009 /// Extern prelude entries. The value is `true` if the entry was introduced
1010 /// via `extern crate` item and not `--extern` option or compiler built-in.
1011 pub extern_prelude: FxHashMap<ast::Name, bool>,
1013 // Internal cache for metadata decoding. No need to track deps on this.
1014 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
1016 /// Caches the results of trait selection. This cache is used
1017 /// for things that do not have to do with the parameters in scope.
1018 pub selection_cache: traits::SelectionCache<'tcx>,
1020 /// Caches the results of trait evaluation. This cache is used
1021 /// for things that do not have to do with the parameters in scope.
1022 /// Merge this with `selection_cache`?
1023 pub evaluation_cache: traits::EvaluationCache<'tcx>,
1025 /// The definite name of the current crate after taking into account
1026 /// attributes, commandline parameters, etc.
1027 pub crate_name: Symbol,
1029 /// Data layout specification for the current target.
1030 pub data_layout: TargetDataLayout,
1032 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
1034 /// Stores the value of constants (and deduplicates the actual memory)
1035 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
1037 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1039 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
1041 /// A general purpose channel to throw data out the back towards LLVM worker
1044 /// This is intended to only get used during the codegen phase of the compiler
1045 /// when satisfying the query for a particular codegen unit. Internally in
1046 /// the query it'll send data along this channel to get processed later.
1047 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
1049 output_filenames: Arc<OutputFilenames>,
1052 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1053 /// Gets the global `TyCtxt`.
1055 pub fn global_tcx(self) -> TyCtxt<'gcx, 'gcx, 'gcx> {
1058 interners: &self.gcx.global_interners,
1064 pub fn hir(self) -> &'a hir_map::Map<'gcx> {
1068 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
1069 self.global_arenas.generics.alloc(generics)
1072 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
1073 self.global_arenas.steal_mir.alloc(Steal::new(mir))
1076 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
1077 self.global_arenas.mir.alloc(mir)
1080 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1081 self.global_arenas.tables.alloc(tables)
1084 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1085 self.global_arenas.trait_def.alloc(def)
1088 pub fn alloc_adt_def(self,
1091 variants: IndexVec<VariantIdx, ty::VariantDef>,
1093 -> &'gcx ty::AdtDef {
1094 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1095 self.global_arenas.adt_def.alloc(def)
1098 pub fn intern_const_alloc(self, alloc: Allocation) -> &'gcx Allocation {
1099 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1100 self.global_arenas.const_allocs.alloc(alloc)
1104 /// Allocates a byte or string literal for `mir::interpret`, read-only
1105 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1106 // create an allocation that just contains these bytes
1107 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes, ());
1108 let alloc = self.intern_const_alloc(alloc);
1109 self.alloc_map.lock().allocate(alloc)
1112 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1113 self.stability_interner.borrow_mut().intern(stab, |stab| {
1114 self.global_interners.arena.alloc(stab)
1118 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1119 self.layout_interner.borrow_mut().intern(layout, |layout| {
1120 self.global_arenas.layout.alloc(layout)
1124 /// Returns a range of the start/end indices specified with the
1125 /// `rustc_layout_scalar_valid_range` attribute.
1126 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1127 let attrs = self.get_attrs(def_id);
1129 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1131 None => return Bound::Unbounded,
1133 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1134 match meta.literal().expect("attribute takes lit").node {
1135 ast::LitKind::Int(a, _) => return Bound::Included(a),
1136 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1139 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1141 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1144 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1145 value.lift_to_tcx(self)
1148 /// Like lift, but only tries in the global tcx.
1149 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1150 value.lift_to_tcx(self.global_tcx())
1153 /// Returns `true` if self is the same as self.global_tcx().
1154 fn is_global(self) -> bool {
1155 ptr::eq(self.interners, &self.global_interners)
1158 /// Creates a type context and call the closure with a `TyCtxt` reference
1159 /// to the context. The closure enforces that the type context and any interned
1160 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1161 /// reference to the context, to allow formatting values that need it.
1162 pub fn create_and_enter<F, R>(s: &'tcx Session,
1163 cstore: &'tcx CrateStoreDyn,
1164 local_providers: ty::query::Providers<'tcx>,
1165 extern_providers: ty::query::Providers<'tcx>,
1166 arenas: &'tcx mut AllArenas<'tcx>,
1167 resolutions: ty::Resolutions,
1168 hir: hir_map::Map<'tcx>,
1169 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1171 tx: mpsc::Sender<Box<dyn Any + Send>>,
1172 output_filenames: &OutputFilenames,
1174 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1176 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1179 let interners = CtxtInterners::new(&arenas.interner);
1180 let common_types = CommonTypes::new(&interners);
1181 let dep_graph = hir.dep_graph.clone();
1182 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1183 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1184 providers[LOCAL_CRATE] = local_providers;
1186 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1187 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1190 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1193 let def_path_tables = || {
1194 upstream_def_path_tables
1196 .map(|&(cnum, ref rc)| (cnum, &**rc))
1197 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1200 // Precompute the capacity of the hashmap so we don't have to
1201 // re-allocate when populating it.
1202 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1204 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1206 ::std::default::Default::default()
1209 for (cnum, def_path_table) in def_path_tables() {
1210 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1218 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1219 for (k, v) in resolutions.trait_map {
1220 let hir_id = hir.node_to_hir_id(k);
1221 let map = trait_map.entry(hir_id.owner).or_default();
1222 Lrc::get_mut(map).unwrap()
1223 .insert(hir_id.local_id,
1224 Lrc::new(StableVec::new(v)));
1227 arenas.global_ctxt = Some(GlobalCtxt {
1230 global_arenas: &arenas.global,
1231 global_interners: interners,
1233 types: common_types,
1235 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1238 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1239 (hir.local_def_id(k), Lrc::new(v))
1241 maybe_unused_trait_imports:
1242 resolutions.maybe_unused_trait_imports
1244 .map(|id| hir.local_def_id(id))
1246 maybe_unused_extern_crates:
1247 resolutions.maybe_unused_extern_crates
1249 .map(|(id, sp)| (hir.local_def_id(id), sp))
1251 glob_map: resolutions.glob_map.into_iter().map(|(id, names)| {
1252 (hir.local_def_id(id), names)
1254 extern_prelude: resolutions.extern_prelude,
1256 def_path_hash_to_def_id,
1257 queries: query::Queries::new(
1260 on_disk_query_result_cache,
1262 rcache: Default::default(),
1263 selection_cache: Default::default(),
1264 evaluation_cache: Default::default(),
1265 crate_name: Symbol::intern(crate_name),
1267 layout_interner: Default::default(),
1268 stability_interner: Default::default(),
1269 allocation_interner: Default::default(),
1270 alloc_map: Lock::new(interpret::AllocMap::new()),
1271 tx_to_llvm_workers: Lock::new(tx),
1272 output_filenames: Arc::new(output_filenames.clone()),
1275 let gcx = arenas.global_ctxt.as_ref().unwrap();
1277 sync::assert_send_val(&gcx);
1279 let r = tls::enter_global(gcx, f);
1281 gcx.queries.record_computed_queries(s);
1286 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1287 let cname = self.crate_name(LOCAL_CRATE).as_str();
1288 self.sess.consider_optimizing(&cname, msg)
1291 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1292 self.get_lib_features(LOCAL_CRATE)
1295 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1296 self.get_lang_items(LOCAL_CRATE)
1299 /// Due to missing llvm support for lowering 128 bit math to software emulation
1300 /// (on some targets), the lowering can be done in MIR.
1302 /// This function only exists until said support is implemented.
1303 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1304 let items = self.lang_items();
1305 let def_id = Some(def_id);
1306 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1307 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1308 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1309 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1310 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1311 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1312 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1313 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1314 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1315 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1316 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1317 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1318 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1319 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1320 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1321 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1322 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1323 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1324 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1325 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1326 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1327 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1328 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1329 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1333 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1334 self.stability_index(LOCAL_CRATE)
1337 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1338 self.all_crate_nums(LOCAL_CRATE)
1341 pub fn features(self) -> Lrc<feature_gate::Features> {
1342 self.features_query(LOCAL_CRATE)
1345 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1347 self.hir().def_key(id)
1349 self.cstore.def_key(id)
1353 /// Converts a `DefId` into its fully expanded `DefPath` (every
1354 /// `DefId` is really just an interned def-path).
1356 /// Note that if `id` is not local to this crate, the result will
1357 /// be a non-local `DefPath`.
1358 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1360 self.hir().def_path(id)
1362 self.cstore.def_path(id)
1367 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1368 if def_id.is_local() {
1369 self.hir().definitions().def_path_hash(def_id.index)
1371 self.cstore.def_path_hash(def_id)
1375 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1376 // We are explicitly not going through queries here in order to get
1377 // crate name and disambiguator since this code is called from debug!()
1378 // statements within the query system and we'd run into endless
1379 // recursion otherwise.
1380 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1381 (self.crate_name.clone(),
1382 self.sess.local_crate_disambiguator())
1384 (self.cstore.crate_name_untracked(def_id.krate),
1385 self.cstore.crate_disambiguator_untracked(def_id.krate))
1390 // Don't print the whole crate disambiguator. That's just
1391 // annoying in debug output.
1392 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1393 self.def_path(def_id).to_string_no_crate())
1396 pub fn metadata_encoding_version(self) -> Vec<u8> {
1397 self.cstore.metadata_encoding_version().to_vec()
1400 // Note that this is *untracked* and should only be used within the query
1401 // system if the result is otherwise tracked through queries
1402 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1403 self.cstore.crate_data_as_rc_any(cnum)
1407 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1408 let krate = self.gcx.hir_map.forest.untracked_krate();
1410 StableHashingContext::new(self.sess,
1412 self.hir().definitions(),
1416 // This method makes sure that we have a DepNode and a Fingerprint for
1417 // every upstream crate. It needs to be called once right after the tcx is
1419 // With full-fledged red/green, the method will probably become unnecessary
1420 // as this will be done on-demand.
1421 pub fn allocate_metadata_dep_nodes(self) {
1422 // We cannot use the query versions of crates() and crate_hash(), since
1423 // those would need the DepNodes that we are allocating here.
1424 for cnum in self.cstore.crates_untracked() {
1425 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1426 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1427 self.dep_graph.with_task(dep_node,
1430 |_, x| x, // No transformation needed
1431 dep_graph::hash_result,
1436 // This method exercises the `in_scope_traits_map` query for all possible
1437 // values so that we have their fingerprints available in the DepGraph.
1438 // This is only required as long as we still use the old dependency tracking
1439 // which needs to have the fingerprints of all input nodes beforehand.
1440 pub fn precompute_in_scope_traits_hashes(self) {
1441 for &def_index in self.trait_map.keys() {
1442 self.in_scope_traits_map(def_index);
1446 pub fn serialize_query_result_cache<E>(self,
1448 -> Result<(), E::Error>
1449 where E: ty::codec::TyEncoder
1451 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1454 /// This checks whether one is allowed to have pattern bindings
1455 /// that bind-by-move on a match arm that has a guard, e.g.:
1458 /// match foo { A(inner) if { /* something */ } => ..., ... }
1461 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1462 /// because that method has a narrower effect that can be toggled
1463 /// off via a separate `-Z` flag, at least for the short term.
1464 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1465 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1468 /// If true, we should use a naive AST walk to determine if match
1469 /// guard could perform bad mutations (or mutable-borrows).
1470 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1471 // If someone requests the feature, then be a little more
1472 // careful and ensure that MIR-borrowck is enabled (which can
1473 // happen via edition selection, via `feature(nll)`, or via an
1474 // appropriate `-Z` flag) before disabling the mutation check.
1475 if self.allow_bind_by_move_patterns_with_guards() {
1482 /// If true, we should use the AST-based borrowck (we may *also* use
1483 /// the MIR-based borrowck).
1484 pub fn use_ast_borrowck(self) -> bool {
1485 self.borrowck_mode().use_ast()
1488 /// If true, we should use the MIR-based borrowck (we may *also* use
1489 /// the AST-based borrowck).
1490 pub fn use_mir_borrowck(self) -> bool {
1491 self.borrowck_mode().use_mir()
1494 /// If true, we should use the MIR-based borrow check, but also
1495 /// fall back on the AST borrow check if the MIR-based one errors.
1496 pub fn migrate_borrowck(self) -> bool {
1497 self.borrowck_mode().migrate()
1500 /// If true, make MIR codegen for `match` emit a temp that holds a
1501 /// borrow of the input to the match expression.
1502 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1503 self.emit_read_for_match()
1506 /// If true, make MIR codegen for `match` emit FakeRead
1507 /// statements (which simulate the maximal effect of executing the
1508 /// patterns in a match arm).
1509 pub fn emit_read_for_match(&self) -> bool {
1510 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1513 /// If true, pattern variables for use in guards on match arms
1514 /// will be bound as references to the data, and occurrences of
1515 /// those variables in the guard expression will implicitly
1516 /// dereference those bindings. (See rust-lang/rust#27282.)
1517 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1518 self.borrowck_mode().use_mir()
1521 /// If true, we should enable two-phase borrows checks. This is
1522 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1523 /// or by opting into an edition after 2015.
1524 pub fn two_phase_borrows(self) -> bool {
1525 self.sess.rust_2018() || self.features().nll ||
1526 self.sess.opts.debugging_opts.two_phase_borrows
1529 /// What mode(s) of borrowck should we run? AST? MIR? both?
1530 /// (Also considers the `#![feature(nll)]` setting.)
1531 pub fn borrowck_mode(&self) -> BorrowckMode {
1532 // Here are the main constraints we need to deal with:
1534 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1535 // synonymous with no `-Z borrowck=...` flag at all.
1536 // (This is arguably a historical accident.)
1538 // 2. `BorrowckMode::Migrate` is the limited migration to
1539 // NLL that we are deploying with the 2018 edition.
1541 // 3. We want to allow developers on the Nightly channel
1542 // to opt back into the "hard error" mode for NLL,
1543 // (which they can do via specifying `#![feature(nll)]`
1544 // explicitly in their crate).
1546 // So, this precedence list is how pnkfelix chose to work with
1547 // the above constraints:
1549 // * `#![feature(nll)]` *always* means use NLL with hard
1550 // errors. (To simplify the code here, it now even overrides
1551 // a user's attempt to specify `-Z borrowck=compare`, which
1552 // we arguably do not need anymore and should remove.)
1554 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1555 // if `borrowck=ast` was specified), then use the default
1556 // as required by the edition.
1558 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1560 if self.features().nll { return BorrowckMode::Mir; }
1562 match self.sess.opts.borrowck_mode {
1563 mode @ BorrowckMode::Mir |
1564 mode @ BorrowckMode::Compare |
1565 mode @ BorrowckMode::Migrate => mode,
1567 BorrowckMode::Ast => match self.sess.edition() {
1568 Edition::Edition2015 => BorrowckMode::Ast,
1569 Edition::Edition2018 => BorrowckMode::Migrate,
1575 pub fn local_crate_exports_generics(self) -> bool {
1576 debug_assert!(self.sess.opts.share_generics());
1578 self.sess.crate_types.borrow().iter().any(|crate_type| {
1580 CrateType::Executable |
1581 CrateType::Staticlib |
1582 CrateType::ProcMacro |
1583 CrateType::Cdylib => false,
1585 CrateType::Dylib => true,
1590 // This method returns the DefId and the BoundRegion corresponding to the given region.
1591 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1592 let (suitable_region_binding_scope, bound_region) = match *region {
1593 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1594 ty::ReEarlyBound(ref ebr) => (
1595 self.parent_def_id(ebr.def_id).unwrap(),
1596 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1598 _ => return None, // not a free region
1601 let node_id = self.hir()
1602 .as_local_node_id(suitable_region_binding_scope)
1604 let is_impl_item = match self.hir().find(node_id) {
1605 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1606 Some(Node::ImplItem(..)) => {
1607 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1612 return Some(FreeRegionInfo {
1613 def_id: suitable_region_binding_scope,
1614 boundregion: bound_region,
1615 is_impl_item: is_impl_item,
1619 pub fn return_type_impl_trait(
1621 scope_def_id: DefId,
1622 ) -> Option<Ty<'tcx>> {
1623 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1624 let node_id = self.hir().as_local_node_id(scope_def_id).unwrap();
1625 match self.hir().get(node_id) {
1626 Node::Item(item) => {
1628 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1634 _ => { /* type_of_def_id() will work or panic */ }
1637 let ret_ty = self.type_of(scope_def_id);
1639 ty::FnDef(_, _) => {
1640 let sig = ret_ty.fn_sig(*self);
1641 let output = self.erase_late_bound_regions(&sig.output());
1642 if output.is_impl_trait() {
1652 // Here we check if the bound region is in Impl Item.
1653 pub fn is_bound_region_in_impl_item(
1655 suitable_region_binding_scope: DefId,
1657 let container_id = self.associated_item(suitable_region_binding_scope)
1660 if self.impl_trait_ref(container_id).is_some() {
1661 // For now, we do not try to target impls of traits. This is
1662 // because this message is going to suggest that the user
1663 // change the fn signature, but they may not be free to do so,
1664 // since the signature must match the trait.
1666 // FIXME(#42706) -- in some cases, we could do better here.
1672 /// Determine whether identifiers in the assembly have strict naming rules.
1673 /// Currently, only NVPTX* targets need it.
1674 pub fn has_strict_asm_symbol_naming(&self) -> bool {
1675 self.gcx.sess.target.target.arch.contains("nvptx")
1679 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1680 pub fn encode_metadata(self)
1683 self.cstore.encode_metadata(self)
1687 impl<'gcx> GlobalCtxt<'gcx> {
1688 /// Call the closure with a local `TyCtxt` using the given arena.
1689 /// `interners` is a slot passed so we can create a CtxtInterners
1690 /// with the same lifetime as `arena`.
1691 pub fn enter_local<'tcx, F, R>(
1693 arena: &'tcx SyncDroplessArena,
1694 interners: &'tcx mut Option<CtxtInterners<'tcx>>,
1698 F: FnOnce(TyCtxt<'tcx, 'gcx, 'tcx>) -> R,
1701 *interners = Some(CtxtInterners::new(&arena));
1704 interners: interners.as_ref().unwrap(),
1707 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1708 let new_icx = ty::tls::ImplicitCtxt {
1710 query: icx.query.clone(),
1711 diagnostics: icx.diagnostics,
1712 layout_depth: icx.layout_depth,
1713 task_deps: icx.task_deps,
1715 ty::tls::enter_context(&new_icx, |_| {
1722 /// A trait implemented for all X<'a> types which can be safely and
1723 /// efficiently converted to X<'tcx> as long as they are part of the
1724 /// provided TyCtxt<'tcx>.
1725 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1726 /// by looking them up in their respective interners.
1728 /// However, this is still not the best implementation as it does
1729 /// need to compare the components, even for interned values.
1730 /// It would be more efficient if TypedArena provided a way to
1731 /// determine whether the address is in the allocated range.
1733 /// None is returned if the value or one of the components is not part
1734 /// of the provided context.
1735 /// For Ty, None can be returned if either the type interner doesn't
1736 /// contain the TyKind key or if the address of the interned
1737 /// pointer differs. The latter case is possible if a primitive type,
1738 /// e.g., `()` or `u8`, was interned in a different context.
1739 pub trait Lift<'tcx>: fmt::Debug {
1740 type Lifted: fmt::Debug + 'tcx;
1741 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1745 macro_rules! nop_lift {
1746 ($ty:ty => $lifted:ty) => {
1747 impl<'a, 'tcx> Lift<'tcx> for $ty {
1748 type Lifted = $lifted;
1749 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1750 if tcx.interners.arena.in_arena(*self as *const _) {
1751 return Some(unsafe { mem::transmute(*self) });
1753 // Also try in the global tcx if we're not that.
1754 if !tcx.is_global() {
1755 self.lift_to_tcx(tcx.global_tcx())
1764 macro_rules! nop_list_lift {
1765 ($ty:ty => $lifted:ty) => {
1766 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1767 type Lifted = &'tcx List<$lifted>;
1768 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1769 if self.is_empty() {
1770 return Some(List::empty());
1772 if tcx.interners.arena.in_arena(*self as *const _) {
1773 return Some(unsafe { mem::transmute(*self) });
1775 // Also try in the global tcx if we're not that.
1776 if !tcx.is_global() {
1777 self.lift_to_tcx(tcx.global_tcx())
1786 nop_lift!{Ty<'a> => Ty<'tcx>}
1787 nop_lift!{Region<'a> => Region<'tcx>}
1788 nop_lift!{Goal<'a> => Goal<'tcx>}
1789 nop_lift!{&'a LazyConst<'a> => &'tcx LazyConst<'tcx>}
1791 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1792 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1793 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1794 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1795 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1796 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1797 nop_list_lift!{ProjectionKind<'a> => ProjectionKind<'tcx>}
1799 // this is the impl for `&'a Substs<'a>`
1800 nop_list_lift!{Kind<'a> => Kind<'tcx>}
1802 impl<'a, 'tcx> Lift<'tcx> for &'a mir::interpret::Allocation {
1803 type Lifted = &'tcx mir::interpret::Allocation;
1804 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1805 assert!(tcx.global_arenas.const_allocs.in_arena(*self as *const _));
1806 Some(unsafe { mem::transmute(*self) })
1811 use super::{GlobalCtxt, TyCtxt};
1815 use std::marker::PhantomData;
1818 use crate::ty::query;
1819 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1820 use rustc_data_structures::OnDrop;
1821 use rustc_data_structures::sync::{self, Lrc, Lock};
1822 use rustc_data_structures::thin_vec::ThinVec;
1823 use crate::dep_graph::TaskDeps;
1825 #[cfg(not(parallel_compiler))]
1826 use std::cell::Cell;
1828 #[cfg(parallel_compiler)]
1829 use rustc_rayon_core as rayon_core;
1831 /// This is the implicit state of rustc. It contains the current
1832 /// TyCtxt and query. It is updated when creating a local interner or
1833 /// executing a new query. Whenever there's a TyCtxt value available
1834 /// you should also have access to an ImplicitCtxt through the functions
1837 pub struct ImplicitCtxt<'a, 'gcx: 'tcx, 'tcx> {
1838 /// The current TyCtxt. Initially created by `enter_global` and updated
1839 /// by `enter_local` with a new local interner
1840 pub tcx: TyCtxt<'tcx, 'gcx, 'tcx>,
1842 /// The current query job, if any. This is updated by JobOwner::start in
1843 /// ty::query::plumbing when executing a query
1844 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1846 /// Where to store diagnostics for the current query job, if any.
1847 /// This is updated by JobOwner::start in ty::query::plumbing when executing a query
1848 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1850 /// Used to prevent layout from recursing too deeply.
1851 pub layout_depth: usize,
1853 /// The current dep graph task. This is used to add dependencies to queries
1854 /// when executing them
1855 pub task_deps: Option<&'a Lock<TaskDeps>>,
1858 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1859 /// to `value` during the call to `f`. It is restored to its previous value after.
1860 /// This is used to set the pointer to the new ImplicitCtxt.
1861 #[cfg(parallel_compiler)]
1863 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1864 rayon_core::tlv::with(value, f)
1867 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1868 /// This is used to get the pointer to the current ImplicitCtxt.
1869 #[cfg(parallel_compiler)]
1871 fn get_tlv() -> usize {
1872 rayon_core::tlv::get()
1875 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1876 #[cfg(not(parallel_compiler))]
1877 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1879 /// Sets TLV to `value` during the call to `f`.
1880 /// It is restored to its previous value after.
1881 /// This is used to set the pointer to the new ImplicitCtxt.
1882 #[cfg(not(parallel_compiler))]
1884 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1885 let old = get_tlv();
1886 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1887 TLV.with(|tlv| tlv.set(value));
1891 /// This is used to get the pointer to the current ImplicitCtxt.
1892 #[cfg(not(parallel_compiler))]
1893 fn get_tlv() -> usize {
1894 TLV.with(|tlv| tlv.get())
1897 /// This is a callback from libsyntax as it cannot access the implicit state
1898 /// in librustc otherwise
1899 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1901 if let Some(tcx) = tcx {
1902 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1904 syntax_pos::default_span_debug(span, f)
1909 /// This is a callback from libsyntax as it cannot access the implicit state
1910 /// in librustc otherwise. It is used to when diagnostic messages are
1911 /// emitted and stores them in the current query, if there is one.
1912 fn track_diagnostic(diagnostic: &Diagnostic) {
1913 with_context_opt(|icx| {
1914 if let Some(icx) = icx {
1915 if let Some(ref diagnostics) = icx.diagnostics {
1916 let mut diagnostics = diagnostics.lock();
1917 diagnostics.extend(Some(diagnostic.clone()));
1923 /// Sets up the callbacks from libsyntax on the current thread
1924 pub fn with_thread_locals<F, R>(f: F) -> R
1925 where F: FnOnce() -> R
1927 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1928 let original_span_debug = span_dbg.get();
1929 span_dbg.set(span_debug);
1931 let _on_drop = OnDrop(move || {
1932 span_dbg.set(original_span_debug);
1935 TRACK_DIAGNOSTICS.with(|current| {
1936 let original = current.get();
1937 current.set(track_diagnostic);
1939 let _on_drop = OnDrop(move || {
1940 current.set(original);
1948 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1950 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1952 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1954 set_tlv(context as *const _ as usize, || {
1959 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1960 /// creating a initial TyCtxt and ImplicitCtxt.
1961 /// This happens once per rustc session and TyCtxts only exists
1962 /// inside the `f` function.
1963 pub fn enter_global<'gcx, F, R>(gcx: &'gcx GlobalCtxt<'gcx>, f: F) -> R
1964 where F: FnOnce(TyCtxt<'gcx, 'gcx, 'gcx>) -> R
1966 with_thread_locals(|| {
1967 // Update GCX_PTR to indicate there's a GlobalCtxt available
1968 GCX_PTR.with(|lock| {
1969 *lock.lock() = gcx as *const _ as usize;
1971 // Set GCX_PTR back to 0 when we exit
1972 let _on_drop = OnDrop(move || {
1973 GCX_PTR.with(|lock| *lock.lock() = 0);
1978 interners: &gcx.global_interners,
1981 let icx = ImplicitCtxt {
1988 enter_context(&icx, |_| {
1994 /// Stores a pointer to the GlobalCtxt if one is available.
1995 /// This is used to access the GlobalCtxt in the deadlock handler
1997 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
1999 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2000 /// This is used in the deadlock handler.
2001 pub unsafe fn with_global<F, R>(f: F) -> R
2002 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2004 let gcx = GCX_PTR.with(|lock| *lock.lock());
2006 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2009 interners: &gcx.global_interners,
2012 let icx = ImplicitCtxt {
2019 enter_context(&icx, |_| f(tcx))
2022 /// Allows access to the current ImplicitCtxt in a closure if one is available
2024 pub fn with_context_opt<F, R>(f: F) -> R
2025 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2027 let context = get_tlv();
2031 // We could get a ImplicitCtxt pointer from another thread.
2032 // Ensure that ImplicitCtxt is Sync
2033 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2035 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2039 /// Allows access to the current ImplicitCtxt.
2040 /// Panics if there is no ImplicitCtxt available
2042 pub fn with_context<F, R>(f: F) -> R
2043 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2045 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2048 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2049 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2050 /// with the same 'gcx lifetime as the TyCtxt passed in.
2051 /// This will panic if you pass it a TyCtxt which has a different global interner from
2052 /// the current ImplicitCtxt's tcx field.
2054 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2055 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2057 with_context(|context| {
2059 assert!(ptr::eq(context.tcx.gcx, tcx.gcx));
2060 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2066 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2067 /// interner and local interner as the tcx argument passed in. This means the closure
2068 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2069 /// This will panic if you pass it a TyCtxt which has a different global interner or
2070 /// a different local interner from the current ImplicitCtxt's tcx field.
2072 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2073 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2075 with_context(|context| {
2077 assert!(ptr::eq(context.tcx.gcx, tcx.gcx));
2078 assert!(ptr::eq(context.tcx.interners, tcx.interners));
2079 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2085 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2086 /// Panics if there is no ImplicitCtxt available
2088 pub fn with<F, R>(f: F) -> R
2089 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2091 with_context(|context| f(context.tcx))
2094 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2095 /// The closure is passed None if there is no ImplicitCtxt available
2097 pub fn with_opt<F, R>(f: F) -> R
2098 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2100 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2104 macro_rules! sty_debug_print {
2105 ($ctxt: expr, $($variant: ident),*) => {{
2106 // curious inner module to allow variant names to be used as
2108 #[allow(non_snake_case)]
2110 use crate::ty::{self, TyCtxt};
2111 use crate::ty::context::Interned;
2113 #[derive(Copy, Clone)]
2116 region_infer: usize,
2121 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2122 let mut total = DebugStat {
2124 region_infer: 0, ty_infer: 0, both_infer: 0,
2126 $(let mut $variant = total;)*
2128 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2129 let variant = match t.sty {
2130 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2131 ty::Float(..) | ty::Str | ty::Never => continue,
2132 ty::Error => /* unimportant */ continue,
2133 $(ty::$variant(..) => &mut $variant,)*
2135 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2136 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2140 if region { total.region_infer += 1; variant.region_infer += 1 }
2141 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2142 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2144 println!("Ty interner total ty region both");
2145 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2146 {ty:4.1}% {region:5.1}% {both:4.1}%",
2147 stringify!($variant),
2148 uses = $variant.total,
2149 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2150 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2151 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2152 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2154 println!(" total {uses:6} \
2155 {ty:4.1}% {region:5.1}% {both:4.1}%",
2157 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2158 region = total.region_infer as f64 * 100.0 / total.total as f64,
2159 both = total.both_infer as f64 * 100.0 / total.total as f64)
2167 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2168 pub fn print_debug_stats(self) {
2171 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2172 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2173 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2175 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2176 println!("Region interner: #{}", self.interners.region.borrow().len());
2177 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2178 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2179 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2184 /// An entry in an interner.
2185 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2187 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2188 fn clone(&self) -> Self {
2192 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2194 // N.B., an `Interned<Ty>` compares and hashes as a sty.
2195 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2196 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2197 self.0.sty == other.0.sty
2201 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2203 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2204 fn hash<H: Hasher>(&self, s: &mut H) {
2209 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2210 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2215 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2216 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2217 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2218 self.0[..] == other.0[..]
2222 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2224 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2225 fn hash<H: Hasher>(&self, s: &mut H) {
2230 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2231 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2236 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2237 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2242 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2243 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2248 impl<'tcx: 'lcx, 'lcx> Borrow<[ProjectionKind<'lcx>]>
2249 for Interned<'tcx, List<ProjectionKind<'tcx>>> {
2250 fn borrow<'a>(&'a self) -> &'a [ProjectionKind<'lcx>] {
2255 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2256 fn borrow<'a>(&'a self) -> &'a RegionKind {
2261 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2262 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2267 impl<'tcx: 'lcx, 'lcx> Borrow<LazyConst<'lcx>> for Interned<'tcx, LazyConst<'tcx>> {
2268 fn borrow<'a>(&'a self) -> &'a LazyConst<'lcx> {
2273 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2274 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2275 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2280 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2281 for Interned<'tcx, List<Predicate<'tcx>>> {
2282 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2287 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2288 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2293 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2294 for Interned<'tcx, List<Clause<'tcx>>> {
2295 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2300 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2301 for Interned<'tcx, List<Goal<'tcx>>> {
2302 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2307 macro_rules! intern_method {
2308 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2311 $keep_in_local_tcx:expr) -> $ty:ty) => {
2312 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2313 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2314 let key = ($alloc_to_key)(&v);
2316 // HACK(eddyb) Depend on flags being accurate to
2317 // determine that all contents are in the global tcx.
2318 // See comments on Lift for why we can't use that.
2319 if ($keep_in_local_tcx)(&v) {
2320 self.interners.$name.borrow_mut().intern_ref(key, || {
2321 // Make sure we don't end up with inference
2322 // types/regions in the global tcx.
2323 if self.is_global() {
2324 bug!("Attempted to intern `{:?}` which contains \
2325 inference types/regions in the global type context",
2329 Interned($alloc_method(&self.interners.arena, v))
2332 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2333 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2337 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2339 let i = unsafe { mem::transmute(i) };
2348 macro_rules! direct_interners {
2349 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2350 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2351 fn eq(&self, other: &Self) -> bool {
2356 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2358 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2359 fn hash<H: Hasher>(&self, s: &mut H) {
2367 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2369 $keep_in_local_tcx) -> $ty);)+
2373 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2374 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2377 direct_interners!('tcx,
2378 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2379 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>,
2380 lazy_const: mk_lazy_const(|c: &LazyConst<'_>| keep_local(&c)) -> LazyConst<'tcx>
2383 macro_rules! slice_interners {
2384 ($($field:ident: $method:ident($ty:ident)),+) => (
2385 $(intern_method!( 'tcx, $field: $method(
2387 |a, v| List::from_arena(a, v),
2389 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2394 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2395 predicates: _intern_predicates(Predicate),
2396 type_list: _intern_type_list(Ty),
2397 substs: _intern_substs(Kind),
2398 clauses: _intern_clauses(Clause),
2399 goal_list: _intern_goals(Goal),
2400 projs: _intern_projs(ProjectionKind)
2403 // This isn't a perfect fit: CanonicalVarInfo slices are always
2404 // allocated in the global arena, so this `intern_method!` macro is
2405 // overly general. But we just return false for the code that checks
2406 // whether they belong in the thread-local arena, so no harm done, and
2407 // seems better than open-coding the rest.
2410 canonical_var_infos: _intern_canonical_var_infos(
2411 &[CanonicalVarInfo],
2412 |a, v| List::from_arena(a, v),
2414 |_xs: &[CanonicalVarInfo]| -> bool { false }
2415 ) -> List<CanonicalVarInfo>
2418 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2419 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2420 /// that is, a `fn` type that is equivalent in every way for being
2422 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2423 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2424 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2425 unsafety: hir::Unsafety::Unsafe,
2430 /// Given a closure signature `sig`, returns an equivalent `fn`
2431 /// type with the same signature. Detuples and so forth -- so
2432 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2433 /// a `fn(u32, i32)`.
2434 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2435 let converted_sig = sig.map_bound(|s| {
2436 let params_iter = match s.inputs()[0].sty {
2437 ty::Tuple(params) => {
2438 params.into_iter().cloned()
2446 hir::Unsafety::Normal,
2451 self.mk_fn_ptr(converted_sig)
2455 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2456 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2459 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2461 ast::IntTy::Isize => self.types.isize,
2462 ast::IntTy::I8 => self.types.i8,
2463 ast::IntTy::I16 => self.types.i16,
2464 ast::IntTy::I32 => self.types.i32,
2465 ast::IntTy::I64 => self.types.i64,
2466 ast::IntTy::I128 => self.types.i128,
2470 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2472 ast::UintTy::Usize => self.types.usize,
2473 ast::UintTy::U8 => self.types.u8,
2474 ast::UintTy::U16 => self.types.u16,
2475 ast::UintTy::U32 => self.types.u32,
2476 ast::UintTy::U64 => self.types.u64,
2477 ast::UintTy::U128 => self.types.u128,
2481 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2483 ast::FloatTy::F32 => self.types.f32,
2484 ast::FloatTy::F64 => self.types.f64,
2489 pub fn mk_str(self) -> Ty<'tcx> {
2494 pub fn mk_static_str(self) -> Ty<'tcx> {
2495 self.mk_imm_ref(self.types.re_static, self.mk_str())
2499 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2500 // take a copy of substs so that we own the vectors inside
2501 self.mk_ty(Adt(def, substs))
2505 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2506 self.mk_ty(Foreign(def_id))
2509 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2510 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2511 let adt_def = self.adt_def(def_id);
2512 let substs = Substs::for_item(self, def_id, |param, substs| {
2514 GenericParamDefKind::Lifetime => bug!(),
2515 GenericParamDefKind::Type { has_default, .. } => {
2516 if param.index == 0 {
2519 assert!(has_default);
2520 self.type_of(param.def_id).subst(self, substs).into()
2525 self.mk_ty(Adt(adt_def, substs))
2529 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2530 self.mk_ty(RawPtr(tm))
2534 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2535 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2539 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2540 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2544 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2545 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2549 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2550 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2554 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2555 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2559 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2560 self.mk_imm_ptr(self.mk_unit())
2564 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2565 self.mk_ty(Array(ty, self.mk_lazy_const(
2566 ty::LazyConst::Evaluated(ty::Const::from_usize(self.global_tcx(), n))
2571 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2572 self.mk_ty(Slice(ty))
2576 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2577 self.mk_ty(Tuple(self.intern_type_list(ts)))
2580 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2581 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2585 pub fn mk_unit(self) -> Ty<'tcx> {
2590 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2591 if self.features().never_type {
2594 self.intern_tup(&[])
2599 pub fn mk_bool(self) -> Ty<'tcx> {
2604 pub fn mk_fn_def(self, def_id: DefId,
2605 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2606 self.mk_ty(FnDef(def_id, substs))
2610 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2611 self.mk_ty(FnPtr(fty))
2617 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2618 reg: ty::Region<'tcx>
2620 self.mk_ty(Dynamic(obj, reg))
2624 pub fn mk_projection(self,
2626 substs: &'tcx Substs<'tcx>)
2628 self.mk_ty(Projection(ProjectionTy {
2635 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2637 self.mk_ty(Closure(closure_id, closure_substs))
2641 pub fn mk_generator(self,
2643 generator_substs: GeneratorSubsts<'tcx>,
2644 movability: hir::GeneratorMovability)
2646 self.mk_ty(Generator(id, generator_substs, movability))
2650 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2651 self.mk_ty(GeneratorWitness(types))
2655 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2656 self.mk_infer(TyVar(v))
2660 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2661 self.mk_infer(IntVar(v))
2665 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2666 self.mk_infer(FloatVar(v))
2670 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2671 self.mk_ty(Infer(it))
2675 pub fn mk_ty_param(self,
2677 name: InternedString) -> Ty<'tcx> {
2678 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2682 pub fn mk_self_type(self) -> Ty<'tcx> {
2683 self.mk_ty_param(0, keywords::SelfUpper.name().as_interned_str())
2686 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2688 GenericParamDefKind::Lifetime => {
2689 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2691 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2696 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2697 self.mk_ty(Opaque(def_id, substs))
2700 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2701 -> &'tcx List<ExistentialPredicate<'tcx>> {
2702 assert!(!eps.is_empty());
2703 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2704 self._intern_existential_predicates(eps)
2707 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2708 -> &'tcx List<Predicate<'tcx>> {
2709 // FIXME consider asking the input slice to be sorted to avoid
2710 // re-interning permutations, in which case that would be asserted
2712 if preds.len() == 0 {
2713 // The macro-generated method below asserts we don't intern an empty slice.
2716 self._intern_predicates(preds)
2720 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2724 self._intern_type_list(ts)
2728 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2732 self._intern_substs(ts)
2736 pub fn intern_projs(self, ps: &[ProjectionKind<'tcx>]) -> &'tcx List<ProjectionKind<'tcx>> {
2740 self._intern_projs(ps)
2744 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2748 self.global_tcx()._intern_canonical_var_infos(ts)
2752 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2756 self._intern_clauses(ts)
2760 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2764 self._intern_goals(ts)
2768 pub fn mk_fn_sig<I>(self,
2772 unsafety: hir::Unsafety,
2774 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2776 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2778 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2779 inputs_and_output: self.intern_type_list(xs),
2780 variadic, unsafety, abi
2784 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2785 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2787 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2790 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2791 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2793 iter.intern_with(|xs| self.intern_predicates(xs))
2796 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2797 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2798 iter.intern_with(|xs| self.intern_type_list(xs))
2801 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2802 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2803 iter.intern_with(|xs| self.intern_substs(xs))
2806 pub fn mk_substs_trait(self,
2808 rest: &[Kind<'tcx>])
2809 -> &'tcx Substs<'tcx>
2811 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2814 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2815 iter.intern_with(|xs| self.intern_clauses(xs))
2818 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2819 iter.intern_with(|xs| self.intern_goals(xs))
2822 pub fn lint_hir<S: Into<MultiSpan>>(self,
2823 lint: &'static Lint,
2827 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2830 pub fn lint_node<S: Into<MultiSpan>>(self,
2831 lint: &'static Lint,
2835 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2838 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2839 lint: &'static Lint,
2844 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2849 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2850 lint: &'static Lint,
2855 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2860 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2861 -> (lint::Level, lint::LintSource)
2863 // Right now we insert a `with_ignore` node in the dep graph here to
2864 // ignore the fact that `lint_levels` below depends on the entire crate.
2865 // For now this'll prevent false positives of recompiling too much when
2866 // anything changes.
2868 // Once red/green incremental compilation lands we should be able to
2869 // remove this because while the crate changes often the lint level map
2870 // will change rarely.
2871 self.dep_graph.with_ignore(|| {
2872 let sets = self.lint_levels(LOCAL_CRATE);
2874 let hir_id = self.hir().definitions().node_to_hir_id(id);
2875 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2878 let next = self.hir().get_parent_node(id);
2880 bug!("lint traversal reached the root of the crate");
2887 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2888 lint: &'static Lint,
2892 -> DiagnosticBuilder<'tcx>
2894 let node_id = self.hir().hir_to_node_id(hir_id);
2895 let (level, src) = self.lint_level_at_node(lint, node_id);
2896 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2899 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2900 lint: &'static Lint,
2904 -> DiagnosticBuilder<'tcx>
2906 let (level, src) = self.lint_level_at_node(lint, id);
2907 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2910 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2911 -> DiagnosticBuilder<'tcx>
2913 let (level, src) = self.lint_level_at_node(lint, id);
2914 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2917 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2918 self.in_scope_traits_map(id.owner)
2919 .and_then(|map| map.get(&id.local_id).cloned())
2922 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2923 self.named_region_map(id.owner)
2924 .and_then(|map| map.get(&id.local_id).cloned())
2927 pub fn is_late_bound(self, id: HirId) -> bool {
2928 self.is_late_bound_map(id.owner)
2929 .map(|set| set.contains(&id.local_id))
2933 pub fn object_lifetime_defaults(self, id: HirId)
2934 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2936 self.object_lifetime_defaults_map(id.owner)
2937 .and_then(|map| map.get(&id.local_id).cloned())
2941 pub trait InternAs<T: ?Sized, R> {
2943 fn intern_with<F>(self, f: F) -> Self::Output
2944 where F: FnOnce(&T) -> R;
2947 impl<I, T, R, E> InternAs<[T], R> for I
2948 where E: InternIteratorElement<T, R>,
2949 I: Iterator<Item=E> {
2950 type Output = E::Output;
2951 fn intern_with<F>(self, f: F) -> Self::Output
2952 where F: FnOnce(&[T]) -> R {
2953 E::intern_with(self, f)
2957 pub trait InternIteratorElement<T, R>: Sized {
2959 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2962 impl<T, R> InternIteratorElement<T, R> for T {
2964 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2965 f(&iter.collect::<SmallVec<[_; 8]>>())
2969 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2973 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2974 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2978 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2979 type Output = Result<R, E>;
2980 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2981 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
2985 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2986 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2987 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2988 providers.crate_name = |tcx, id| {
2989 assert_eq!(id, LOCAL_CRATE);
2992 providers.get_lib_features = |tcx, id| {
2993 assert_eq!(id, LOCAL_CRATE);
2994 Lrc::new(middle::lib_features::collect(tcx))
2996 providers.get_lang_items = |tcx, id| {
2997 assert_eq!(id, LOCAL_CRATE);
2998 Lrc::new(middle::lang_items::collect(tcx))
3000 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3001 providers.maybe_unused_trait_import = |tcx, id| {
3002 tcx.maybe_unused_trait_imports.contains(&id)
3004 providers.maybe_unused_extern_crates = |tcx, cnum| {
3005 assert_eq!(cnum, LOCAL_CRATE);
3006 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3008 providers.names_imported_by_glob_use = |tcx, id| {
3009 assert_eq!(id.krate, LOCAL_CRATE);
3010 Lrc::new(tcx.glob_map.get(&id).cloned().unwrap_or_default())
3013 providers.stability_index = |tcx, cnum| {
3014 assert_eq!(cnum, LOCAL_CRATE);
3015 Lrc::new(stability::Index::new(tcx))
3017 providers.lookup_stability = |tcx, id| {
3018 assert_eq!(id.krate, LOCAL_CRATE);
3019 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3020 tcx.stability().local_stability(id)
3022 providers.lookup_deprecation_entry = |tcx, id| {
3023 assert_eq!(id.krate, LOCAL_CRATE);
3024 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3025 tcx.stability().local_deprecation_entry(id)
3027 providers.extern_mod_stmt_cnum = |tcx, id| {
3028 let id = tcx.hir().as_local_node_id(id).unwrap();
3029 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3031 providers.all_crate_nums = |tcx, cnum| {
3032 assert_eq!(cnum, LOCAL_CRATE);
3033 Lrc::new(tcx.cstore.crates_untracked())
3035 providers.postorder_cnums = |tcx, cnum| {
3036 assert_eq!(cnum, LOCAL_CRATE);
3037 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3039 providers.output_filenames = |tcx, cnum| {
3040 assert_eq!(cnum, LOCAL_CRATE);
3041 tcx.output_filenames.clone()
3043 providers.features_query = |tcx, cnum| {
3044 assert_eq!(cnum, LOCAL_CRATE);
3045 Lrc::new(tcx.sess.features_untracked().clone())
3047 providers.is_panic_runtime = |tcx, cnum| {
3048 assert_eq!(cnum, LOCAL_CRATE);
3049 attr::contains_name(tcx.hir().krate_attrs(), "panic_runtime")
3051 providers.is_compiler_builtins = |tcx, cnum| {
3052 assert_eq!(cnum, LOCAL_CRATE);
3053 attr::contains_name(tcx.hir().krate_attrs(), "compiler_builtins")