1 //! type context book-keeping
3 use crate::dep_graph::DepGraph;
4 use crate::dep_graph::{DepNode, DepConstructor};
5 use crate::errors::DiagnosticBuilder;
6 use crate::session::Session;
7 use crate::session::config::{BorrowckMode, OutputFilenames};
8 use crate::session::config::CrateType;
10 use crate::hir::{TraitCandidate, HirId, ItemKind, ItemLocalId, Node};
11 use crate::hir::def::{Def, Export};
12 use crate::hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
13 use crate::hir::map as hir_map;
14 use crate::hir::map::DefPathHash;
15 use crate::lint::{self, Lint};
16 use crate::ich::{StableHashingContext, NodeIdHashingMode};
17 use crate::infer::canonical::{Canonical, CanonicalVarInfo, CanonicalVarInfos};
18 use crate::infer::outlives::free_region_map::FreeRegionMap;
19 use crate::middle::cstore::CrateStoreDyn;
20 use crate::middle::cstore::EncodedMetadata;
21 use crate::middle::lang_items;
22 use crate::middle::resolve_lifetime::{self, ObjectLifetimeDefault};
23 use crate::middle::stability;
24 use crate::mir::{self, Mir, interpret, ProjectionKind};
25 use crate::mir::interpret::Allocation;
26 use crate::ty::subst::{Kind, Substs, Subst};
27 use crate::ty::ReprOptions;
29 use crate::traits::{Clause, Clauses, GoalKind, Goal, Goals};
30 use crate::ty::{self, Ty, TypeAndMut};
31 use crate::ty::{TyS, TyKind, List};
32 use crate::ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorSubsts, Region, Const, LazyConst};
33 use crate::ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
34 use crate::ty::RegionKind;
35 use crate::ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid};
36 use crate::ty::TyKind::*;
37 use crate::ty::GenericParamDefKind;
38 use crate::ty::layout::{LayoutDetails, TargetDataLayout, VariantIdx};
40 use crate::ty::steal::Steal;
41 use crate::ty::subst::{UserSubsts, UnpackedKind};
42 use crate::ty::{BoundVar, BindingMode};
43 use crate::ty::CanonicalPolyFnSig;
44 use crate::util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap};
45 use crate::util::nodemap::{FxHashMap, FxHashSet};
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_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
529 self.node_id_to_type_opt(id).unwrap_or_else(||
530 bug!("node_id_to_type: no type for node `{}`",
532 let id = tcx.hir().hir_to_node_id(id);
533 tcx.hir().node_to_string(id)
538 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
539 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
540 self.node_types.get(&id.local_id).cloned()
543 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
544 LocalTableInContextMut {
545 local_id_root: self.local_id_root,
546 data: &mut self.node_substs
550 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
551 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
552 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
555 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
556 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
557 self.node_substs.get(&id.local_id).cloned()
560 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
561 // doesn't provide type parameter substitutions.
562 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
563 self.node_id_to_type(pat.hir_id)
566 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
567 self.node_id_to_type_opt(pat.hir_id)
570 // Returns the type of an expression as a monotype.
572 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
573 // some cases, we insert `Adjustment` annotations such as auto-deref or
574 // auto-ref. The type returned by this function does not consider such
575 // adjustments. See `expr_ty_adjusted()` instead.
577 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
578 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
579 // instead of "fn(ty) -> T with T = isize".
580 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
581 self.node_id_to_type(expr.hir_id)
584 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
585 self.node_id_to_type_opt(expr.hir_id)
588 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
589 LocalTableInContext {
590 local_id_root: self.local_id_root,
591 data: &self.adjustments
595 pub fn adjustments_mut(&mut self)
596 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
597 LocalTableInContextMut {
598 local_id_root: self.local_id_root,
599 data: &mut self.adjustments
603 pub fn expr_adjustments(&self, expr: &hir::Expr)
604 -> &[ty::adjustment::Adjustment<'tcx>] {
605 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
606 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
609 /// Returns the type of `expr`, considering any `Adjustment`
610 /// entry recorded for that expression.
611 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
612 self.expr_adjustments(expr)
614 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
617 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
618 self.expr_adjustments(expr)
620 .map(|adj| adj.target)
621 .or_else(|| self.expr_ty_opt(expr))
624 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
625 // Only paths and method calls/overloaded operators have
626 // entries in type_dependent_defs, ignore the former here.
627 if let hir::ExprKind::Path(_) = expr.node {
631 match self.type_dependent_defs().get(expr.hir_id) {
632 Some(&Def::Method(_)) => true,
637 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
638 LocalTableInContext {
639 local_id_root: self.local_id_root,
640 data: &self.pat_binding_modes
644 pub fn pat_binding_modes_mut(&mut self)
645 -> LocalTableInContextMut<'_, BindingMode> {
646 LocalTableInContextMut {
647 local_id_root: self.local_id_root,
648 data: &mut self.pat_binding_modes
652 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
653 LocalTableInContext {
654 local_id_root: self.local_id_root,
655 data: &self.pat_adjustments,
659 pub fn pat_adjustments_mut(&mut self)
660 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
661 LocalTableInContextMut {
662 local_id_root: self.local_id_root,
663 data: &mut self.pat_adjustments,
667 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
668 self.upvar_capture_map[&upvar_id]
671 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
672 LocalTableInContext {
673 local_id_root: self.local_id_root,
674 data: &self.closure_kind_origins
678 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
679 LocalTableInContextMut {
680 local_id_root: self.local_id_root,
681 data: &mut self.closure_kind_origins
685 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
686 LocalTableInContext {
687 local_id_root: self.local_id_root,
688 data: &self.liberated_fn_sigs
692 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
693 LocalTableInContextMut {
694 local_id_root: self.local_id_root,
695 data: &mut self.liberated_fn_sigs
699 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
700 LocalTableInContext {
701 local_id_root: self.local_id_root,
702 data: &self.fru_field_types
706 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
707 LocalTableInContextMut {
708 local_id_root: self.local_id_root,
709 data: &mut self.fru_field_types
713 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
714 LocalTableInContext {
715 local_id_root: self.local_id_root,
716 data: &self.cast_kinds
720 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
721 LocalTableInContextMut {
722 local_id_root: self.local_id_root,
723 data: &mut self.cast_kinds
728 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
729 fn hash_stable<W: StableHasherResult>(&self,
730 hcx: &mut StableHashingContext<'a>,
731 hasher: &mut StableHasher<W>) {
732 let ty::TypeckTables {
734 ref type_dependent_defs,
736 ref user_provided_types,
737 ref user_provided_sigs,
741 ref pat_binding_modes,
743 ref upvar_capture_map,
744 ref closure_kind_origins,
745 ref liberated_fn_sigs,
750 ref used_trait_imports,
753 ref concrete_existential_types,
758 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
759 type_dependent_defs.hash_stable(hcx, hasher);
760 field_indices.hash_stable(hcx, hasher);
761 user_provided_types.hash_stable(hcx, hasher);
762 user_provided_sigs.hash_stable(hcx, hasher);
763 node_types.hash_stable(hcx, hasher);
764 node_substs.hash_stable(hcx, hasher);
765 adjustments.hash_stable(hcx, hasher);
766 pat_binding_modes.hash_stable(hcx, hasher);
767 pat_adjustments.hash_stable(hcx, hasher);
768 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
775 local_id_root.expect("trying to hash invalid TypeckTables");
777 let var_owner_def_id = DefId {
778 krate: local_id_root.krate,
779 index: var_path.hir_id.owner,
781 let closure_def_id = DefId {
782 krate: local_id_root.krate,
783 index: closure_expr_id.to_def_id().index,
785 (hcx.def_path_hash(var_owner_def_id),
786 var_path.hir_id.local_id,
787 hcx.def_path_hash(closure_def_id))
790 closure_kind_origins.hash_stable(hcx, hasher);
791 liberated_fn_sigs.hash_stable(hcx, hasher);
792 fru_field_types.hash_stable(hcx, hasher);
793 cast_kinds.hash_stable(hcx, hasher);
794 used_trait_imports.hash_stable(hcx, hasher);
795 tainted_by_errors.hash_stable(hcx, hasher);
796 free_region_map.hash_stable(hcx, hasher);
797 concrete_existential_types.hash_stable(hcx, hasher);
798 upvar_list.hash_stable(hcx, hasher);
804 pub struct UserTypeAnnotationIndex {
805 DEBUG_FORMAT = "UserType({})",
806 const START_INDEX = 0,
810 /// Mapping of type annotation indices to canonical user type annotations.
811 pub type CanonicalUserTypeAnnotations<'tcx> =
812 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
814 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
815 pub struct CanonicalUserTypeAnnotation<'tcx> {
816 pub user_ty: CanonicalUserType<'tcx>,
818 pub inferred_ty: Ty<'tcx>,
821 BraceStructTypeFoldableImpl! {
822 impl<'tcx> TypeFoldable<'tcx> for CanonicalUserTypeAnnotation<'tcx> {
823 user_ty, span, inferred_ty
827 BraceStructLiftImpl! {
828 impl<'a, 'tcx> Lift<'tcx> for CanonicalUserTypeAnnotation<'a> {
829 type Lifted = CanonicalUserTypeAnnotation<'tcx>;
830 user_ty, span, inferred_ty
835 /// Canonicalized user type annotation.
836 pub type CanonicalUserType<'gcx> = Canonical<'gcx, UserType<'gcx>>;
838 impl CanonicalUserType<'gcx> {
839 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
840 /// i.e. each thing is mapped to a canonical variable with the same index.
841 pub fn is_identity(&self) -> bool {
843 UserType::Ty(_) => false,
844 UserType::TypeOf(_, user_substs) => {
845 if user_substs.user_self_ty.is_some() {
849 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
850 match kind.unpack() {
851 UnpackedKind::Type(ty) => match ty.sty {
852 ty::Bound(debruijn, b) => {
853 // We only allow a `ty::INNERMOST` index in substitutions.
854 assert_eq!(debruijn, ty::INNERMOST);
860 UnpackedKind::Lifetime(r) => match r {
861 ty::ReLateBound(debruijn, br) => {
862 // We only allow a `ty::INNERMOST` index in substitutions.
863 assert_eq!(*debruijn, ty::INNERMOST);
864 cvar == br.assert_bound_var()
875 /// A user-given type annotation attached to a constant. These arise
876 /// from constants that are named via paths, like `Foo::<A>::new` and
878 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
879 pub enum UserType<'tcx> {
882 /// The canonical type is the result of `type_of(def_id)` with the
883 /// given substitutions applied.
884 TypeOf(DefId, UserSubsts<'tcx>),
887 EnumTypeFoldableImpl! {
888 impl<'tcx> TypeFoldable<'tcx> for UserType<'tcx> {
890 (UserType::TypeOf)(def, substs),
895 impl<'a, 'tcx> Lift<'tcx> for UserType<'a> {
896 type Lifted = UserType<'tcx>;
898 (UserType::TypeOf)(def, substs),
902 impl<'tcx> CommonTypes<'tcx> {
903 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
904 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
905 let mk_region = |r| {
906 interners.region.borrow_mut().intern(r, |r| {
907 Interned(interners.arena.alloc(r))
912 unit: mk(Tuple(List::empty())),
917 isize: mk(Int(ast::IntTy::Isize)),
918 i8: mk(Int(ast::IntTy::I8)),
919 i16: mk(Int(ast::IntTy::I16)),
920 i32: mk(Int(ast::IntTy::I32)),
921 i64: mk(Int(ast::IntTy::I64)),
922 i128: mk(Int(ast::IntTy::I128)),
923 usize: mk(Uint(ast::UintTy::Usize)),
924 u8: mk(Uint(ast::UintTy::U8)),
925 u16: mk(Uint(ast::UintTy::U16)),
926 u32: mk(Uint(ast::UintTy::U32)),
927 u64: mk(Uint(ast::UintTy::U64)),
928 u128: mk(Uint(ast::UintTy::U128)),
929 f32: mk(Float(ast::FloatTy::F32)),
930 f64: mk(Float(ast::FloatTy::F64)),
932 re_empty: mk_region(RegionKind::ReEmpty),
933 re_static: mk_region(RegionKind::ReStatic),
934 re_erased: mk_region(RegionKind::ReErased),
939 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
942 pub struct FreeRegionInfo {
943 // def id corresponding to FreeRegion
945 // the bound region corresponding to FreeRegion
946 pub boundregion: ty::BoundRegion,
947 // checks if bound region is in Impl Item
948 pub is_impl_item: bool,
951 /// The central data structure of the compiler. It stores references
952 /// to the various **arenas** and also houses the results of the
953 /// various **compiler queries** that have been performed. See the
954 /// [rustc guide] for more details.
956 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
957 #[derive(Copy, Clone)]
958 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
959 gcx: &'gcx GlobalCtxt<'gcx>,
960 interners: &'tcx CtxtInterners<'tcx>,
961 dummy: PhantomData<&'a ()>,
964 impl<'gcx> Deref for TyCtxt<'_, 'gcx, '_> {
965 type Target = &'gcx GlobalCtxt<'gcx>;
967 fn deref(&self) -> &Self::Target {
972 pub struct GlobalCtxt<'tcx> {
973 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
974 global_interners: CtxtInterners<'tcx>,
976 cstore: &'tcx CrateStoreDyn,
978 pub sess: &'tcx Session,
980 pub dep_graph: DepGraph,
982 /// Common types, pre-interned for your convenience.
983 pub types: CommonTypes<'tcx>,
985 /// Map indicating what traits are in scope for places where this
986 /// is relevant; generated by resolve.
987 trait_map: FxHashMap<DefIndex,
988 Lrc<FxHashMap<ItemLocalId,
989 Lrc<StableVec<TraitCandidate>>>>>,
991 /// Export map produced by name resolution.
992 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
994 hir_map: hir_map::Map<'tcx>,
996 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
997 /// as well as all upstream crates. Only populated in incremental mode.
998 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
1000 pub queries: query::Queries<'tcx>,
1002 // Records the free variables referenced by every closure
1003 // expression. Do not track deps for this, just recompute it from
1004 // scratch every time.
1005 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
1007 maybe_unused_trait_imports: FxHashSet<DefId>,
1008 maybe_unused_extern_crates: Vec<(DefId, Span)>,
1009 /// A map of glob use to a set of names it actually imports. Currently only
1010 /// used in save-analysis.
1011 glob_map: FxHashMap<DefId, FxHashSet<ast::Name>>,
1012 /// Extern prelude entries. The value is `true` if the entry was introduced
1013 /// via `extern crate` item and not `--extern` option or compiler built-in.
1014 pub extern_prelude: FxHashMap<ast::Name, bool>,
1016 // Internal cache for metadata decoding. No need to track deps on this.
1017 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
1019 /// Caches the results of trait selection. This cache is used
1020 /// for things that do not have to do with the parameters in scope.
1021 pub selection_cache: traits::SelectionCache<'tcx>,
1023 /// Caches the results of trait evaluation. This cache is used
1024 /// for things that do not have to do with the parameters in scope.
1025 /// Merge this with `selection_cache`?
1026 pub evaluation_cache: traits::EvaluationCache<'tcx>,
1028 /// The definite name of the current crate after taking into account
1029 /// attributes, commandline parameters, etc.
1030 pub crate_name: Symbol,
1032 /// Data layout specification for the current target.
1033 pub data_layout: TargetDataLayout,
1035 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
1037 /// Stores the value of constants (and deduplicates the actual memory)
1038 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
1040 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1042 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
1044 /// A general purpose channel to throw data out the back towards LLVM worker
1047 /// This is intended to only get used during the codegen phase of the compiler
1048 /// when satisfying the query for a particular codegen unit. Internally in
1049 /// the query it'll send data along this channel to get processed later.
1050 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
1052 output_filenames: Arc<OutputFilenames>,
1055 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1056 /// Get the global TyCtxt.
1058 pub fn global_tcx(self) -> TyCtxt<'gcx, 'gcx, 'gcx> {
1061 interners: &self.gcx.global_interners,
1067 pub fn hir(self) -> &'a hir_map::Map<'gcx> {
1071 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
1072 self.global_arenas.generics.alloc(generics)
1075 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
1076 self.global_arenas.steal_mir.alloc(Steal::new(mir))
1079 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
1080 self.global_arenas.mir.alloc(mir)
1083 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1084 self.global_arenas.tables.alloc(tables)
1087 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1088 self.global_arenas.trait_def.alloc(def)
1091 pub fn alloc_adt_def(self,
1094 variants: IndexVec<VariantIdx, ty::VariantDef>,
1096 -> &'gcx ty::AdtDef {
1097 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1098 self.global_arenas.adt_def.alloc(def)
1101 pub fn intern_const_alloc(self, alloc: Allocation) -> &'gcx Allocation {
1102 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1103 self.global_arenas.const_allocs.alloc(alloc)
1107 /// Allocates a byte or string literal for `mir::interpret`, read-only
1108 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1109 // create an allocation that just contains these bytes
1110 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes, ());
1111 let alloc = self.intern_const_alloc(alloc);
1112 self.alloc_map.lock().allocate(alloc)
1115 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1116 self.stability_interner.borrow_mut().intern(stab, |stab| {
1117 self.global_interners.arena.alloc(stab)
1121 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1122 self.layout_interner.borrow_mut().intern(layout, |layout| {
1123 self.global_arenas.layout.alloc(layout)
1127 /// Returns a range of the start/end indices specified with the
1128 /// `rustc_layout_scalar_valid_range` attribute.
1129 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1130 let attrs = self.get_attrs(def_id);
1132 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1134 None => return Bound::Unbounded,
1136 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1137 match meta.literal().expect("attribute takes lit").node {
1138 ast::LitKind::Int(a, _) => return Bound::Included(a),
1139 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1142 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1144 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1147 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1148 value.lift_to_tcx(self)
1151 /// Like lift, but only tries in the global tcx.
1152 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1153 value.lift_to_tcx(self.global_tcx())
1156 /// Returns true if self is the same as self.global_tcx().
1157 fn is_global(self) -> bool {
1158 ptr::eq(self.interners, &self.global_interners)
1161 /// Create a type context and call the closure with a `TyCtxt` reference
1162 /// to the context. The closure enforces that the type context and any interned
1163 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1164 /// reference to the context, to allow formatting values that need it.
1165 pub fn create_and_enter<F, R>(s: &'tcx Session,
1166 cstore: &'tcx CrateStoreDyn,
1167 local_providers: ty::query::Providers<'tcx>,
1168 extern_providers: ty::query::Providers<'tcx>,
1169 arenas: &'tcx mut AllArenas<'tcx>,
1170 resolutions: ty::Resolutions,
1171 hir: hir_map::Map<'tcx>,
1172 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1174 tx: mpsc::Sender<Box<dyn Any + Send>>,
1175 output_filenames: &OutputFilenames,
1177 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1179 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1182 let interners = CtxtInterners::new(&arenas.interner);
1183 let common_types = CommonTypes::new(&interners);
1184 let dep_graph = hir.dep_graph.clone();
1185 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1186 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1187 providers[LOCAL_CRATE] = local_providers;
1189 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1190 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1193 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1196 let def_path_tables = || {
1197 upstream_def_path_tables
1199 .map(|&(cnum, ref rc)| (cnum, &**rc))
1200 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1203 // Precompute the capacity of the hashmap so we don't have to
1204 // re-allocate when populating it.
1205 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1207 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1209 ::std::default::Default::default()
1212 for (cnum, def_path_table) in def_path_tables() {
1213 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1221 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1222 for (k, v) in resolutions.trait_map {
1223 let hir_id = hir.node_to_hir_id(k);
1224 let map = trait_map.entry(hir_id.owner).or_default();
1225 Lrc::get_mut(map).unwrap()
1226 .insert(hir_id.local_id,
1227 Lrc::new(StableVec::new(v)));
1230 arenas.global_ctxt = Some(GlobalCtxt {
1233 global_arenas: &arenas.global,
1234 global_interners: interners,
1236 types: common_types,
1238 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1241 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1242 (hir.local_def_id(k), Lrc::new(v))
1244 maybe_unused_trait_imports:
1245 resolutions.maybe_unused_trait_imports
1247 .map(|id| hir.local_def_id(id))
1249 maybe_unused_extern_crates:
1250 resolutions.maybe_unused_extern_crates
1252 .map(|(id, sp)| (hir.local_def_id(id), sp))
1254 glob_map: resolutions.glob_map.into_iter().map(|(id, names)| {
1255 (hir.local_def_id(id), names)
1257 extern_prelude: resolutions.extern_prelude,
1259 def_path_hash_to_def_id,
1260 queries: query::Queries::new(
1263 on_disk_query_result_cache,
1265 rcache: Default::default(),
1266 selection_cache: Default::default(),
1267 evaluation_cache: Default::default(),
1268 crate_name: Symbol::intern(crate_name),
1270 layout_interner: Default::default(),
1271 stability_interner: Default::default(),
1272 allocation_interner: Default::default(),
1273 alloc_map: Lock::new(interpret::AllocMap::new()),
1274 tx_to_llvm_workers: Lock::new(tx),
1275 output_filenames: Arc::new(output_filenames.clone()),
1278 let gcx = arenas.global_ctxt.as_ref().unwrap();
1280 sync::assert_send_val(&gcx);
1282 let r = tls::enter_global(gcx, f);
1284 gcx.queries.record_computed_queries(s);
1289 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1290 let cname = self.crate_name(LOCAL_CRATE).as_str();
1291 self.sess.consider_optimizing(&cname, msg)
1294 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1295 self.get_lib_features(LOCAL_CRATE)
1298 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1299 self.get_lang_items(LOCAL_CRATE)
1302 /// Due to missing llvm support for lowering 128 bit math to software emulation
1303 /// (on some targets), the lowering can be done in MIR.
1305 /// This function only exists until said support is implemented.
1306 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1307 let items = self.lang_items();
1308 let def_id = Some(def_id);
1309 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1310 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1311 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1312 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1313 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1314 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1315 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1316 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1317 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1318 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1319 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1320 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1321 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1322 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1323 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1324 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1325 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1326 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1327 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1328 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1329 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1330 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1331 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1332 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1336 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1337 self.stability_index(LOCAL_CRATE)
1340 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1341 self.all_crate_nums(LOCAL_CRATE)
1344 pub fn features(self) -> Lrc<feature_gate::Features> {
1345 self.features_query(LOCAL_CRATE)
1348 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1350 self.hir().def_key(id)
1352 self.cstore.def_key(id)
1356 /// Convert a `DefId` into its fully expanded `DefPath` (every
1357 /// `DefId` is really just an interned def-path).
1359 /// Note that if `id` is not local to this crate, the result will
1360 /// be a non-local `DefPath`.
1361 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1363 self.hir().def_path(id)
1365 self.cstore.def_path(id)
1370 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1371 if def_id.is_local() {
1372 self.hir().definitions().def_path_hash(def_id.index)
1374 self.cstore.def_path_hash(def_id)
1378 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1379 // We are explicitly not going through queries here in order to get
1380 // crate name and disambiguator since this code is called from debug!()
1381 // statements within the query system and we'd run into endless
1382 // recursion otherwise.
1383 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1384 (self.crate_name.clone(),
1385 self.sess.local_crate_disambiguator())
1387 (self.cstore.crate_name_untracked(def_id.krate),
1388 self.cstore.crate_disambiguator_untracked(def_id.krate))
1393 // Don't print the whole crate disambiguator. That's just
1394 // annoying in debug output.
1395 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1396 self.def_path(def_id).to_string_no_crate())
1399 pub fn metadata_encoding_version(self) -> Vec<u8> {
1400 self.cstore.metadata_encoding_version().to_vec()
1403 // Note that this is *untracked* and should only be used within the query
1404 // system if the result is otherwise tracked through queries
1405 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1406 self.cstore.crate_data_as_rc_any(cnum)
1410 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1411 let krate = self.gcx.hir_map.forest.untracked_krate();
1413 StableHashingContext::new(self.sess,
1415 self.hir().definitions(),
1419 // This method makes sure that we have a DepNode and a Fingerprint for
1420 // every upstream crate. It needs to be called once right after the tcx is
1422 // With full-fledged red/green, the method will probably become unnecessary
1423 // as this will be done on-demand.
1424 pub fn allocate_metadata_dep_nodes(self) {
1425 // We cannot use the query versions of crates() and crate_hash(), since
1426 // those would need the DepNodes that we are allocating here.
1427 for cnum in self.cstore.crates_untracked() {
1428 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1429 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1430 self.dep_graph.with_task(dep_node,
1433 |_, x| x // No transformation needed
1438 // This method exercises the `in_scope_traits_map` query for all possible
1439 // values so that we have their fingerprints available in the DepGraph.
1440 // This is only required as long as we still use the old dependency tracking
1441 // which needs to have the fingerprints of all input nodes beforehand.
1442 pub fn precompute_in_scope_traits_hashes(self) {
1443 for &def_index in self.trait_map.keys() {
1444 self.in_scope_traits_map(def_index);
1448 pub fn serialize_query_result_cache<E>(self,
1450 -> Result<(), E::Error>
1451 where E: ty::codec::TyEncoder
1453 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1456 /// This checks whether one is allowed to have pattern bindings
1457 /// that bind-by-move on a match arm that has a guard, e.g.:
1460 /// match foo { A(inner) if { /* something */ } => ..., ... }
1463 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1464 /// because that method has a narrower effect that can be toggled
1465 /// off via a separate `-Z` flag, at least for the short term.
1466 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1467 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1470 /// If true, we should use a naive AST walk to determine if match
1471 /// guard could perform bad mutations (or mutable-borrows).
1472 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1473 // If someone requests the feature, then be a little more
1474 // careful and ensure that MIR-borrowck is enabled (which can
1475 // happen via edition selection, via `feature(nll)`, or via an
1476 // appropriate `-Z` flag) before disabling the mutation check.
1477 if self.allow_bind_by_move_patterns_with_guards() {
1484 /// If true, we should use the AST-based borrowck (we may *also* use
1485 /// the MIR-based borrowck).
1486 pub fn use_ast_borrowck(self) -> bool {
1487 self.borrowck_mode().use_ast()
1490 /// If true, we should use the MIR-based borrowck (we may *also* use
1491 /// the AST-based borrowck).
1492 pub fn use_mir_borrowck(self) -> bool {
1493 self.borrowck_mode().use_mir()
1496 /// If true, we should use the MIR-based borrow check, but also
1497 /// fall back on the AST borrow check if the MIR-based one errors.
1498 pub fn migrate_borrowck(self) -> bool {
1499 self.borrowck_mode().migrate()
1502 /// If true, make MIR codegen for `match` emit a temp that holds a
1503 /// borrow of the input to the match expression.
1504 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1505 self.emit_read_for_match()
1508 /// If true, make MIR codegen for `match` emit FakeRead
1509 /// statements (which simulate the maximal effect of executing the
1510 /// patterns in a match arm).
1511 pub fn emit_read_for_match(&self) -> bool {
1512 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1515 /// If true, pattern variables for use in guards on match arms
1516 /// will be bound as references to the data, and occurrences of
1517 /// those variables in the guard expression will implicitly
1518 /// dereference those bindings. (See rust-lang/rust#27282.)
1519 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1520 self.borrowck_mode().use_mir()
1523 /// If true, we should enable two-phase borrows checks. This is
1524 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1525 /// or by opting into an edition after 2015.
1526 pub fn two_phase_borrows(self) -> bool {
1527 self.sess.rust_2018() || self.features().nll ||
1528 self.sess.opts.debugging_opts.two_phase_borrows
1531 /// What mode(s) of borrowck should we run? AST? MIR? both?
1532 /// (Also considers the `#![feature(nll)]` setting.)
1533 pub fn borrowck_mode(&self) -> BorrowckMode {
1534 // Here are the main constraints we need to deal with:
1536 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1537 // synonymous with no `-Z borrowck=...` flag at all.
1538 // (This is arguably a historical accident.)
1540 // 2. `BorrowckMode::Migrate` is the limited migration to
1541 // NLL that we are deploying with the 2018 edition.
1543 // 3. We want to allow developers on the Nightly channel
1544 // to opt back into the "hard error" mode for NLL,
1545 // (which they can do via specifying `#![feature(nll)]`
1546 // explicitly in their crate).
1548 // So, this precedence list is how pnkfelix chose to work with
1549 // the above constraints:
1551 // * `#![feature(nll)]` *always* means use NLL with hard
1552 // errors. (To simplify the code here, it now even overrides
1553 // a user's attempt to specify `-Z borrowck=compare`, which
1554 // we arguably do not need anymore and should remove.)
1556 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1557 // if `borrowck=ast` was specified), then use the default
1558 // as required by the edition.
1560 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1562 if self.features().nll { return BorrowckMode::Mir; }
1564 match self.sess.opts.borrowck_mode {
1565 mode @ BorrowckMode::Mir |
1566 mode @ BorrowckMode::Compare |
1567 mode @ BorrowckMode::Migrate => mode,
1569 BorrowckMode::Ast => match self.sess.edition() {
1570 Edition::Edition2015 => BorrowckMode::Ast,
1571 Edition::Edition2018 => BorrowckMode::Migrate,
1577 pub fn local_crate_exports_generics(self) -> bool {
1578 debug_assert!(self.sess.opts.share_generics());
1580 self.sess.crate_types.borrow().iter().any(|crate_type| {
1582 CrateType::Executable |
1583 CrateType::Staticlib |
1584 CrateType::ProcMacro |
1585 CrateType::Cdylib => false,
1587 CrateType::Dylib => true,
1592 // This method returns the DefId and the BoundRegion corresponding to the given region.
1593 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1594 let (suitable_region_binding_scope, bound_region) = match *region {
1595 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1596 ty::ReEarlyBound(ref ebr) => (
1597 self.parent_def_id(ebr.def_id).unwrap(),
1598 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1600 _ => return None, // not a free region
1603 let node_id = self.hir()
1604 .as_local_node_id(suitable_region_binding_scope)
1606 let is_impl_item = match self.hir().find(node_id) {
1607 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1608 Some(Node::ImplItem(..)) => {
1609 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1614 return Some(FreeRegionInfo {
1615 def_id: suitable_region_binding_scope,
1616 boundregion: bound_region,
1617 is_impl_item: is_impl_item,
1621 pub fn return_type_impl_trait(
1623 scope_def_id: DefId,
1624 ) -> Option<Ty<'tcx>> {
1625 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1626 let node_id = self.hir().as_local_node_id(scope_def_id).unwrap();
1627 match self.hir().get(node_id) {
1628 Node::Item(item) => {
1630 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1636 _ => { /* type_of_def_id() will work or panic */ }
1639 let ret_ty = self.type_of(scope_def_id);
1641 ty::FnDef(_, _) => {
1642 let sig = ret_ty.fn_sig(*self);
1643 let output = self.erase_late_bound_regions(&sig.output());
1644 if output.is_impl_trait() {
1654 // Here we check if the bound region is in Impl Item.
1655 pub fn is_bound_region_in_impl_item(
1657 suitable_region_binding_scope: DefId,
1659 let container_id = self.associated_item(suitable_region_binding_scope)
1662 if self.impl_trait_ref(container_id).is_some() {
1663 // For now, we do not try to target impls of traits. This is
1664 // because this message is going to suggest that the user
1665 // change the fn signature, but they may not be free to do so,
1666 // since the signature must match the trait.
1668 // FIXME(#42706) -- in some cases, we could do better here.
1674 /// Determine whether identifiers in the assembly have strict naming rules.
1675 /// Currently, only NVPTX* targets need it.
1676 pub fn has_strict_asm_symbol_naming(&self) -> bool {
1677 self.gcx.sess.target.target.arch.contains("nvptx")
1681 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1682 pub fn encode_metadata(self)
1685 self.cstore.encode_metadata(self)
1689 impl<'gcx> GlobalCtxt<'gcx> {
1690 /// Call the closure with a local `TyCtxt` using the given arena.
1691 /// `interners` is a slot passed so we can create a CtxtInterners
1692 /// with the same lifetime as `arena`.
1693 pub fn enter_local<'tcx, F, R>(
1695 arena: &'tcx SyncDroplessArena,
1696 interners: &'tcx mut Option<CtxtInterners<'tcx>>,
1700 F: FnOnce(TyCtxt<'tcx, 'gcx, 'tcx>) -> R,
1703 *interners = Some(CtxtInterners::new(&arena));
1706 interners: interners.as_ref().unwrap(),
1709 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1710 let new_icx = ty::tls::ImplicitCtxt {
1712 query: icx.query.clone(),
1713 diagnostics: icx.diagnostics,
1714 layout_depth: icx.layout_depth,
1715 task_deps: icx.task_deps,
1717 ty::tls::enter_context(&new_icx, |_| {
1724 /// A trait implemented for all X<'a> types which can be safely and
1725 /// efficiently converted to X<'tcx> as long as they are part of the
1726 /// provided TyCtxt<'tcx>.
1727 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1728 /// by looking them up in their respective interners.
1730 /// However, this is still not the best implementation as it does
1731 /// need to compare the components, even for interned values.
1732 /// It would be more efficient if TypedArena provided a way to
1733 /// determine whether the address is in the allocated range.
1735 /// None is returned if the value or one of the components is not part
1736 /// of the provided context.
1737 /// For Ty, None can be returned if either the type interner doesn't
1738 /// contain the TyKind key or if the address of the interned
1739 /// pointer differs. The latter case is possible if a primitive type,
1740 /// e.g., `()` or `u8`, was interned in a different context.
1741 pub trait Lift<'tcx>: fmt::Debug {
1742 type Lifted: fmt::Debug + 'tcx;
1743 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1747 macro_rules! nop_lift {
1748 ($ty:ty => $lifted:ty) => {
1749 impl<'a, 'tcx> Lift<'tcx> for $ty {
1750 type Lifted = $lifted;
1751 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1752 if tcx.interners.arena.in_arena(*self as *const _) {
1753 return Some(unsafe { mem::transmute(*self) });
1755 // Also try in the global tcx if we're not that.
1756 if !tcx.is_global() {
1757 self.lift_to_tcx(tcx.global_tcx())
1766 macro_rules! nop_list_lift {
1767 ($ty:ty => $lifted:ty) => {
1768 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1769 type Lifted = &'tcx List<$lifted>;
1770 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1771 if self.is_empty() {
1772 return Some(List::empty());
1774 if tcx.interners.arena.in_arena(*self as *const _) {
1775 return Some(unsafe { mem::transmute(*self) });
1777 // Also try in the global tcx if we're not that.
1778 if !tcx.is_global() {
1779 self.lift_to_tcx(tcx.global_tcx())
1788 nop_lift!{Ty<'a> => Ty<'tcx>}
1789 nop_lift!{Region<'a> => Region<'tcx>}
1790 nop_lift!{Goal<'a> => Goal<'tcx>}
1791 nop_lift!{&'a LazyConst<'a> => &'tcx LazyConst<'tcx>}
1793 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1794 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1795 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1796 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1797 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1798 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1799 nop_list_lift!{ProjectionKind<'a> => ProjectionKind<'tcx>}
1801 // this is the impl for `&'a Substs<'a>`
1802 nop_list_lift!{Kind<'a> => Kind<'tcx>}
1804 impl<'a, 'tcx> Lift<'tcx> for &'a mir::interpret::Allocation {
1805 type Lifted = &'tcx mir::interpret::Allocation;
1806 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1807 assert!(tcx.global_arenas.const_allocs.in_arena(*self as *const _));
1808 Some(unsafe { mem::transmute(*self) })
1813 use super::{GlobalCtxt, TyCtxt};
1817 use std::marker::PhantomData;
1820 use crate::ty::query;
1821 use crate::errors::{Diagnostic, TRACK_DIAGNOSTICS};
1822 use rustc_data_structures::OnDrop;
1823 use rustc_data_structures::sync::{self, Lrc, Lock};
1824 use rustc_data_structures::thin_vec::ThinVec;
1825 use crate::dep_graph::TaskDeps;
1827 #[cfg(not(parallel_compiler))]
1828 use std::cell::Cell;
1830 #[cfg(parallel_compiler)]
1831 use rustc_rayon_core as rayon_core;
1833 /// This is the implicit state of rustc. It contains the current
1834 /// TyCtxt and query. It is updated when creating a local interner or
1835 /// executing a new query. Whenever there's a TyCtxt value available
1836 /// you should also have access to an ImplicitCtxt through the functions
1839 pub struct ImplicitCtxt<'a, 'gcx: 'tcx, 'tcx> {
1840 /// The current TyCtxt. Initially created by `enter_global` and updated
1841 /// by `enter_local` with a new local interner
1842 pub tcx: TyCtxt<'tcx, 'gcx, 'tcx>,
1844 /// The current query job, if any. This is updated by JobOwner::start in
1845 /// ty::query::plumbing when executing a query
1846 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1848 /// Where to store diagnostics for the current query job, if any.
1849 /// This is updated by JobOwner::start in ty::query::plumbing when executing a query
1850 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1852 /// Used to prevent layout from recursing too deeply.
1853 pub layout_depth: usize,
1855 /// The current dep graph task. This is used to add dependencies to queries
1856 /// when executing them
1857 pub task_deps: Option<&'a Lock<TaskDeps>>,
1860 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1861 /// to `value` during the call to `f`. It is restored to its previous value after.
1862 /// This is used to set the pointer to the new ImplicitCtxt.
1863 #[cfg(parallel_compiler)]
1865 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1866 rayon_core::tlv::with(value, f)
1869 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1870 /// This is used to get the pointer to the current ImplicitCtxt.
1871 #[cfg(parallel_compiler)]
1873 fn get_tlv() -> usize {
1874 rayon_core::tlv::get()
1877 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1878 #[cfg(not(parallel_compiler))]
1879 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1881 /// Sets TLV to `value` during the call to `f`.
1882 /// It is restored to its previous value after.
1883 /// This is used to set the pointer to the new ImplicitCtxt.
1884 #[cfg(not(parallel_compiler))]
1886 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1887 let old = get_tlv();
1888 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1889 TLV.with(|tlv| tlv.set(value));
1893 /// This is used to get the pointer to the current ImplicitCtxt.
1894 #[cfg(not(parallel_compiler))]
1895 fn get_tlv() -> usize {
1896 TLV.with(|tlv| tlv.get())
1899 /// This is a callback from libsyntax as it cannot access the implicit state
1900 /// in librustc otherwise
1901 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1903 if let Some(tcx) = tcx {
1904 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1906 syntax_pos::default_span_debug(span, f)
1911 /// This is a callback from libsyntax as it cannot access the implicit state
1912 /// in librustc otherwise. It is used to when diagnostic messages are
1913 /// emitted and stores them in the current query, if there is one.
1914 fn track_diagnostic(diagnostic: &Diagnostic) {
1915 with_context_opt(|icx| {
1916 if let Some(icx) = icx {
1917 if let Some(ref diagnostics) = icx.diagnostics {
1918 let mut diagnostics = diagnostics.lock();
1919 diagnostics.extend(Some(diagnostic.clone()));
1925 /// Sets up the callbacks from libsyntax on the current thread
1926 pub fn with_thread_locals<F, R>(f: F) -> R
1927 where F: FnOnce() -> R
1929 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1930 let original_span_debug = span_dbg.get();
1931 span_dbg.set(span_debug);
1933 let _on_drop = OnDrop(move || {
1934 span_dbg.set(original_span_debug);
1937 TRACK_DIAGNOSTICS.with(|current| {
1938 let original = current.get();
1939 current.set(track_diagnostic);
1941 let _on_drop = OnDrop(move || {
1942 current.set(original);
1950 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1952 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1954 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1956 set_tlv(context as *const _ as usize, || {
1961 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1962 /// creating a initial TyCtxt and ImplicitCtxt.
1963 /// This happens once per rustc session and TyCtxts only exists
1964 /// inside the `f` function.
1965 pub fn enter_global<'gcx, F, R>(gcx: &'gcx GlobalCtxt<'gcx>, f: F) -> R
1966 where F: FnOnce(TyCtxt<'gcx, 'gcx, 'gcx>) -> R
1968 with_thread_locals(|| {
1969 // Update GCX_PTR to indicate there's a GlobalCtxt available
1970 GCX_PTR.with(|lock| {
1971 *lock.lock() = gcx as *const _ as usize;
1973 // Set GCX_PTR back to 0 when we exit
1974 let _on_drop = OnDrop(move || {
1975 GCX_PTR.with(|lock| *lock.lock() = 0);
1980 interners: &gcx.global_interners,
1983 let icx = ImplicitCtxt {
1990 enter_context(&icx, |_| {
1996 /// Stores a pointer to the GlobalCtxt if one is available.
1997 /// This is used to access the GlobalCtxt in the deadlock handler
1999 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2001 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2002 /// This is used in the deadlock handler.
2003 pub unsafe fn with_global<F, R>(f: F) -> R
2004 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2006 let gcx = GCX_PTR.with(|lock| *lock.lock());
2008 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2011 interners: &gcx.global_interners,
2014 let icx = ImplicitCtxt {
2021 enter_context(&icx, |_| f(tcx))
2024 /// Allows access to the current ImplicitCtxt in a closure if one is available
2026 pub fn with_context_opt<F, R>(f: F) -> R
2027 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2029 let context = get_tlv();
2033 // We could get a ImplicitCtxt pointer from another thread.
2034 // Ensure that ImplicitCtxt is Sync
2035 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2037 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2041 /// Allows access to the current ImplicitCtxt.
2042 /// Panics if there is no ImplicitCtxt available
2044 pub fn with_context<F, R>(f: F) -> R
2045 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2047 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2050 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2051 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2052 /// with the same 'gcx lifetime as the TyCtxt passed in.
2053 /// This will panic if you pass it a TyCtxt which has a different global interner from
2054 /// the current ImplicitCtxt's tcx field.
2056 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2057 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2059 with_context(|context| {
2061 assert!(ptr::eq(context.tcx.gcx, tcx.gcx));
2062 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2068 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2069 /// interner and local interner as the tcx argument passed in. This means the closure
2070 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2071 /// This will panic if you pass it a TyCtxt which has a different global interner or
2072 /// a different local interner from the current ImplicitCtxt's tcx field.
2074 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2075 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2077 with_context(|context| {
2079 assert!(ptr::eq(context.tcx.gcx, tcx.gcx));
2080 assert!(ptr::eq(context.tcx.interners, tcx.interners));
2081 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2087 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2088 /// Panics if there is no ImplicitCtxt available
2090 pub fn with<F, R>(f: F) -> R
2091 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2093 with_context(|context| f(context.tcx))
2096 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2097 /// The closure is passed None if there is no ImplicitCtxt available
2099 pub fn with_opt<F, R>(f: F) -> R
2100 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2102 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2106 macro_rules! sty_debug_print {
2107 ($ctxt: expr, $($variant: ident),*) => {{
2108 // curious inner module to allow variant names to be used as
2110 #[allow(non_snake_case)]
2112 use crate::ty::{self, TyCtxt};
2113 use crate::ty::context::Interned;
2115 #[derive(Copy, Clone)]
2118 region_infer: usize,
2123 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2124 let mut total = DebugStat {
2126 region_infer: 0, ty_infer: 0, both_infer: 0,
2128 $(let mut $variant = total;)*
2130 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2131 let variant = match t.sty {
2132 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2133 ty::Float(..) | ty::Str | ty::Never => continue,
2134 ty::Error => /* unimportant */ continue,
2135 $(ty::$variant(..) => &mut $variant,)*
2137 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2138 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2142 if region { total.region_infer += 1; variant.region_infer += 1 }
2143 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2144 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2146 println!("Ty interner total ty region both");
2147 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2148 {ty:4.1}% {region:5.1}% {both:4.1}%",
2149 stringify!($variant),
2150 uses = $variant.total,
2151 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2152 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2153 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2154 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2156 println!(" total {uses:6} \
2157 {ty:4.1}% {region:5.1}% {both:4.1}%",
2159 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2160 region = total.region_infer as f64 * 100.0 / total.total as f64,
2161 both = total.both_infer as f64 * 100.0 / total.total as f64)
2169 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2170 pub fn print_debug_stats(self) {
2173 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2174 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2175 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2177 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2178 println!("Region interner: #{}", self.interners.region.borrow().len());
2179 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2180 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2181 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2186 /// An entry in an interner.
2187 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2189 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2190 fn clone(&self) -> Self {
2194 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2196 // N.B., an `Interned<Ty>` compares and hashes as a sty.
2197 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2198 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2199 self.0.sty == other.0.sty
2203 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2205 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2206 fn hash<H: Hasher>(&self, s: &mut H) {
2211 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2212 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2217 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2218 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2219 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2220 self.0[..] == other.0[..]
2224 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2226 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2227 fn hash<H: Hasher>(&self, s: &mut H) {
2232 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2233 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2238 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2239 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2244 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2245 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2250 impl<'tcx: 'lcx, 'lcx> Borrow<[ProjectionKind<'lcx>]>
2251 for Interned<'tcx, List<ProjectionKind<'tcx>>> {
2252 fn borrow<'a>(&'a self) -> &'a [ProjectionKind<'lcx>] {
2257 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2258 fn borrow<'a>(&'a self) -> &'a RegionKind {
2263 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2264 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2269 impl<'tcx: 'lcx, 'lcx> Borrow<LazyConst<'lcx>> for Interned<'tcx, LazyConst<'tcx>> {
2270 fn borrow<'a>(&'a self) -> &'a LazyConst<'lcx> {
2275 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2276 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2277 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2282 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2283 for Interned<'tcx, List<Predicate<'tcx>>> {
2284 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2289 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2290 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2295 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2296 for Interned<'tcx, List<Clause<'tcx>>> {
2297 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2302 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2303 for Interned<'tcx, List<Goal<'tcx>>> {
2304 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2309 macro_rules! intern_method {
2310 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2313 $keep_in_local_tcx:expr) -> $ty:ty) => {
2314 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2315 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2316 let key = ($alloc_to_key)(&v);
2318 // HACK(eddyb) Depend on flags being accurate to
2319 // determine that all contents are in the global tcx.
2320 // See comments on Lift for why we can't use that.
2321 if ($keep_in_local_tcx)(&v) {
2322 self.interners.$name.borrow_mut().intern_ref(key, || {
2323 // Make sure we don't end up with inference
2324 // types/regions in the global tcx.
2325 if self.is_global() {
2326 bug!("Attempted to intern `{:?}` which contains \
2327 inference types/regions in the global type context",
2331 Interned($alloc_method(&self.interners.arena, v))
2334 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2335 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2339 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2341 let i = unsafe { mem::transmute(i) };
2350 macro_rules! direct_interners {
2351 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2352 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2353 fn eq(&self, other: &Self) -> bool {
2358 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2360 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2361 fn hash<H: Hasher>(&self, s: &mut H) {
2369 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2371 $keep_in_local_tcx) -> $ty);)+
2375 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2376 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2379 direct_interners!('tcx,
2380 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2381 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>,
2382 lazy_const: mk_lazy_const(|c: &LazyConst<'_>| keep_local(&c)) -> LazyConst<'tcx>
2385 macro_rules! slice_interners {
2386 ($($field:ident: $method:ident($ty:ident)),+) => (
2387 $(intern_method!( 'tcx, $field: $method(
2389 |a, v| List::from_arena(a, v),
2391 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2396 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2397 predicates: _intern_predicates(Predicate),
2398 type_list: _intern_type_list(Ty),
2399 substs: _intern_substs(Kind),
2400 clauses: _intern_clauses(Clause),
2401 goal_list: _intern_goals(Goal),
2402 projs: _intern_projs(ProjectionKind)
2405 // This isn't a perfect fit: CanonicalVarInfo slices are always
2406 // allocated in the global arena, so this `intern_method!` macro is
2407 // overly general. But we just return false for the code that checks
2408 // whether they belong in the thread-local arena, so no harm done, and
2409 // seems better than open-coding the rest.
2412 canonical_var_infos: _intern_canonical_var_infos(
2413 &[CanonicalVarInfo],
2414 |a, v| List::from_arena(a, v),
2416 |_xs: &[CanonicalVarInfo]| -> bool { false }
2417 ) -> List<CanonicalVarInfo>
2420 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2421 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2422 /// that is, a `fn` type that is equivalent in every way for being
2424 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2425 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2426 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2427 unsafety: hir::Unsafety::Unsafe,
2432 /// Given a closure signature `sig`, returns an equivalent `fn`
2433 /// type with the same signature. Detuples and so forth -- so
2434 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2435 /// a `fn(u32, i32)`.
2436 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2437 let converted_sig = sig.map_bound(|s| {
2438 let params_iter = match s.inputs()[0].sty {
2439 ty::Tuple(params) => {
2440 params.into_iter().cloned()
2448 hir::Unsafety::Normal,
2453 self.mk_fn_ptr(converted_sig)
2457 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2458 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2461 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2463 ast::IntTy::Isize => self.types.isize,
2464 ast::IntTy::I8 => self.types.i8,
2465 ast::IntTy::I16 => self.types.i16,
2466 ast::IntTy::I32 => self.types.i32,
2467 ast::IntTy::I64 => self.types.i64,
2468 ast::IntTy::I128 => self.types.i128,
2472 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2474 ast::UintTy::Usize => self.types.usize,
2475 ast::UintTy::U8 => self.types.u8,
2476 ast::UintTy::U16 => self.types.u16,
2477 ast::UintTy::U32 => self.types.u32,
2478 ast::UintTy::U64 => self.types.u64,
2479 ast::UintTy::U128 => self.types.u128,
2483 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2485 ast::FloatTy::F32 => self.types.f32,
2486 ast::FloatTy::F64 => self.types.f64,
2491 pub fn mk_str(self) -> Ty<'tcx> {
2496 pub fn mk_static_str(self) -> Ty<'tcx> {
2497 self.mk_imm_ref(self.types.re_static, self.mk_str())
2501 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2502 // take a copy of substs so that we own the vectors inside
2503 self.mk_ty(Adt(def, substs))
2507 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2508 self.mk_ty(Foreign(def_id))
2511 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2512 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2513 let adt_def = self.adt_def(def_id);
2514 let substs = Substs::for_item(self, def_id, |param, substs| {
2516 GenericParamDefKind::Lifetime => bug!(),
2517 GenericParamDefKind::Type { has_default, .. } => {
2518 if param.index == 0 {
2521 assert!(has_default);
2522 self.type_of(param.def_id).subst(self, substs).into()
2527 self.mk_ty(Adt(adt_def, substs))
2531 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2532 self.mk_ty(RawPtr(tm))
2536 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2537 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2541 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2542 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2546 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2547 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2551 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2552 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2556 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2557 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2561 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2562 self.mk_imm_ptr(self.mk_unit())
2566 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2567 self.mk_ty(Array(ty, self.mk_lazy_const(
2568 ty::LazyConst::Evaluated(ty::Const::from_usize(self.global_tcx(), n))
2573 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2574 self.mk_ty(Slice(ty))
2578 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2579 self.mk_ty(Tuple(self.intern_type_list(ts)))
2582 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2583 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2587 pub fn mk_unit(self) -> Ty<'tcx> {
2592 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2593 if self.features().never_type {
2596 self.intern_tup(&[])
2601 pub fn mk_bool(self) -> Ty<'tcx> {
2606 pub fn mk_fn_def(self, def_id: DefId,
2607 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2608 self.mk_ty(FnDef(def_id, substs))
2612 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2613 self.mk_ty(FnPtr(fty))
2619 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2620 reg: ty::Region<'tcx>
2622 self.mk_ty(Dynamic(obj, reg))
2626 pub fn mk_projection(self,
2628 substs: &'tcx Substs<'tcx>)
2630 self.mk_ty(Projection(ProjectionTy {
2637 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2639 self.mk_ty(Closure(closure_id, closure_substs))
2643 pub fn mk_generator(self,
2645 generator_substs: GeneratorSubsts<'tcx>,
2646 movability: hir::GeneratorMovability)
2648 self.mk_ty(Generator(id, generator_substs, movability))
2652 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2653 self.mk_ty(GeneratorWitness(types))
2657 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2658 self.mk_infer(TyVar(v))
2662 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2663 self.mk_infer(IntVar(v))
2667 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2668 self.mk_infer(FloatVar(v))
2672 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2673 self.mk_ty(Infer(it))
2677 pub fn mk_ty_param(self,
2679 name: InternedString) -> Ty<'tcx> {
2680 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2684 pub fn mk_self_type(self) -> Ty<'tcx> {
2685 self.mk_ty_param(0, keywords::SelfUpper.name().as_interned_str())
2688 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2690 GenericParamDefKind::Lifetime => {
2691 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2693 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2698 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2699 self.mk_ty(Opaque(def_id, substs))
2702 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2703 -> &'tcx List<ExistentialPredicate<'tcx>> {
2704 assert!(!eps.is_empty());
2705 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2706 self._intern_existential_predicates(eps)
2709 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2710 -> &'tcx List<Predicate<'tcx>> {
2711 // FIXME consider asking the input slice to be sorted to avoid
2712 // re-interning permutations, in which case that would be asserted
2714 if preds.len() == 0 {
2715 // The macro-generated method below asserts we don't intern an empty slice.
2718 self._intern_predicates(preds)
2722 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2726 self._intern_type_list(ts)
2730 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2734 self._intern_substs(ts)
2738 pub fn intern_projs(self, ps: &[ProjectionKind<'tcx>]) -> &'tcx List<ProjectionKind<'tcx>> {
2742 self._intern_projs(ps)
2746 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2750 self.global_tcx()._intern_canonical_var_infos(ts)
2754 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2758 self._intern_clauses(ts)
2762 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2766 self._intern_goals(ts)
2770 pub fn mk_fn_sig<I>(self,
2774 unsafety: hir::Unsafety,
2776 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2778 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2780 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2781 inputs_and_output: self.intern_type_list(xs),
2782 variadic, unsafety, abi
2786 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2787 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2789 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2792 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2793 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2795 iter.intern_with(|xs| self.intern_predicates(xs))
2798 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2799 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2800 iter.intern_with(|xs| self.intern_type_list(xs))
2803 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2804 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2805 iter.intern_with(|xs| self.intern_substs(xs))
2808 pub fn mk_substs_trait(self,
2810 rest: &[Kind<'tcx>])
2811 -> &'tcx Substs<'tcx>
2813 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2816 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2817 iter.intern_with(|xs| self.intern_clauses(xs))
2820 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2821 iter.intern_with(|xs| self.intern_goals(xs))
2824 pub fn lint_hir<S: Into<MultiSpan>>(self,
2825 lint: &'static Lint,
2829 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2832 pub fn lint_node<S: Into<MultiSpan>>(self,
2833 lint: &'static Lint,
2837 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2840 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2841 lint: &'static Lint,
2846 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2851 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2852 lint: &'static Lint,
2857 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2862 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2863 -> (lint::Level, lint::LintSource)
2865 // Right now we insert a `with_ignore` node in the dep graph here to
2866 // ignore the fact that `lint_levels` below depends on the entire crate.
2867 // For now this'll prevent false positives of recompiling too much when
2868 // anything changes.
2870 // Once red/green incremental compilation lands we should be able to
2871 // remove this because while the crate changes often the lint level map
2872 // will change rarely.
2873 self.dep_graph.with_ignore(|| {
2874 let sets = self.lint_levels(LOCAL_CRATE);
2876 let hir_id = self.hir().definitions().node_to_hir_id(id);
2877 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2880 let next = self.hir().get_parent_node(id);
2882 bug!("lint traversal reached the root of the crate");
2889 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2890 lint: &'static Lint,
2894 -> DiagnosticBuilder<'tcx>
2896 let node_id = self.hir().hir_to_node_id(hir_id);
2897 let (level, src) = self.lint_level_at_node(lint, node_id);
2898 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2901 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2902 lint: &'static Lint,
2906 -> DiagnosticBuilder<'tcx>
2908 let (level, src) = self.lint_level_at_node(lint, id);
2909 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2912 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2913 -> DiagnosticBuilder<'tcx>
2915 let (level, src) = self.lint_level_at_node(lint, id);
2916 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2919 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2920 self.in_scope_traits_map(id.owner)
2921 .and_then(|map| map.get(&id.local_id).cloned())
2924 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2925 self.named_region_map(id.owner)
2926 .and_then(|map| map.get(&id.local_id).cloned())
2929 pub fn is_late_bound(self, id: HirId) -> bool {
2930 self.is_late_bound_map(id.owner)
2931 .map(|set| set.contains(&id.local_id))
2935 pub fn object_lifetime_defaults(self, id: HirId)
2936 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2938 self.object_lifetime_defaults_map(id.owner)
2939 .and_then(|map| map.get(&id.local_id).cloned())
2943 pub trait InternAs<T: ?Sized, R> {
2945 fn intern_with<F>(self, f: F) -> Self::Output
2946 where F: FnOnce(&T) -> R;
2949 impl<I, T, R, E> InternAs<[T], R> for I
2950 where E: InternIteratorElement<T, R>,
2951 I: Iterator<Item=E> {
2952 type Output = E::Output;
2953 fn intern_with<F>(self, f: F) -> Self::Output
2954 where F: FnOnce(&[T]) -> R {
2955 E::intern_with(self, f)
2959 pub trait InternIteratorElement<T, R>: Sized {
2961 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2964 impl<T, R> InternIteratorElement<T, R> for T {
2966 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2967 f(&iter.collect::<SmallVec<[_; 8]>>())
2971 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2975 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2976 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2980 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2981 type Output = Result<R, E>;
2982 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2983 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
2987 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2988 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2989 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2990 providers.crate_name = |tcx, id| {
2991 assert_eq!(id, LOCAL_CRATE);
2994 providers.get_lib_features = |tcx, id| {
2995 assert_eq!(id, LOCAL_CRATE);
2996 Lrc::new(middle::lib_features::collect(tcx))
2998 providers.get_lang_items = |tcx, id| {
2999 assert_eq!(id, LOCAL_CRATE);
3000 Lrc::new(middle::lang_items::collect(tcx))
3002 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3003 providers.maybe_unused_trait_import = |tcx, id| {
3004 tcx.maybe_unused_trait_imports.contains(&id)
3006 providers.maybe_unused_extern_crates = |tcx, cnum| {
3007 assert_eq!(cnum, LOCAL_CRATE);
3008 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3010 providers.names_imported_by_glob_use = |tcx, id| {
3011 assert_eq!(id.krate, LOCAL_CRATE);
3012 Lrc::new(tcx.glob_map.get(&id).cloned().unwrap_or_default())
3015 providers.stability_index = |tcx, cnum| {
3016 assert_eq!(cnum, LOCAL_CRATE);
3017 Lrc::new(stability::Index::new(tcx))
3019 providers.lookup_stability = |tcx, id| {
3020 assert_eq!(id.krate, LOCAL_CRATE);
3021 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3022 tcx.stability().local_stability(id)
3024 providers.lookup_deprecation_entry = |tcx, id| {
3025 assert_eq!(id.krate, LOCAL_CRATE);
3026 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3027 tcx.stability().local_deprecation_entry(id)
3029 providers.extern_mod_stmt_cnum = |tcx, id| {
3030 let id = tcx.hir().as_local_node_id(id).unwrap();
3031 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3033 providers.all_crate_nums = |tcx, cnum| {
3034 assert_eq!(cnum, LOCAL_CRATE);
3035 Lrc::new(tcx.cstore.crates_untracked())
3037 providers.postorder_cnums = |tcx, cnum| {
3038 assert_eq!(cnum, LOCAL_CRATE);
3039 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3041 providers.output_filenames = |tcx, cnum| {
3042 assert_eq!(cnum, LOCAL_CRATE);
3043 tcx.output_filenames.clone()
3045 providers.features_query = |tcx, cnum| {
3046 assert_eq!(cnum, LOCAL_CRATE);
3047 Lrc::new(tcx.sess.features_untracked().clone())
3049 providers.is_panic_runtime = |tcx, cnum| {
3050 assert_eq!(cnum, LOCAL_CRATE);
3051 attr::contains_name(tcx.hir().krate_attrs(), "panic_runtime")
3053 providers.is_compiler_builtins = |tcx, cnum| {
3054 assert_eq!(cnum, LOCAL_CRATE);
3055 attr::contains_name(tcx.hir().krate_attrs(), "compiler_builtins")