1 //! type context book-keeping
3 use dep_graph::DepGraph;
4 use dep_graph::{DepNode, DepConstructor};
5 use errors::DiagnosticBuilder;
7 use session::config::{BorrowckMode, OutputFilenames};
8 use session::config::CrateType;
10 use hir::{TraitCandidate, HirId, ItemKind, ItemLocalId, Node};
11 use hir::def::{Def, Export};
12 use hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
13 use hir::map as hir_map;
14 use hir::map::DefPathHash;
15 use lint::{self, Lint};
16 use ich::{StableHashingContext, NodeIdHashingMode};
17 use infer::canonical::{Canonical, CanonicalVarInfo, CanonicalVarInfos};
18 use infer::outlives::free_region_map::FreeRegionMap;
19 use middle::cstore::CrateStoreDyn;
20 use middle::cstore::EncodedMetadata;
21 use middle::lang_items;
22 use middle::resolve_lifetime::{self, ObjectLifetimeDefault};
23 use middle::stability;
24 use mir::{self, Mir, interpret, ProjectionKind};
25 use mir::interpret::Allocation;
26 use ty::subst::{Kind, Substs, Subst};
29 use traits::{Clause, Clauses, GoalKind, Goal, Goals};
30 use ty::{self, Ty, TypeAndMut};
31 use ty::{TyS, TyKind, List};
32 use ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorSubsts, Region, Const, LazyConst};
33 use ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
35 use ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid};
37 use ty::GenericParamDefKind;
38 use ty::layout::{LayoutDetails, TargetDataLayout, VariantIdx};
41 use ty::subst::{UserSubsts, UnpackedKind};
42 use ty::{BoundVar, BindingMode};
43 use ty::CanonicalPolyFnSig;
44 use util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap};
45 use 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>>>,
132 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
133 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
136 type_: Default::default(),
137 type_list: Default::default(),
138 substs: Default::default(),
139 region: Default::default(),
140 existential_predicates: Default::default(),
141 canonical_var_infos: Default::default(),
142 predicates: Default::default(),
143 clauses: Default::default(),
144 goal: Default::default(),
145 goal_list: Default::default(),
146 projs: Default::default(),
153 local: &CtxtInterners<'tcx>,
154 global: &CtxtInterners<'gcx>,
157 let flags = super::flags::FlagComputation::for_sty(&st);
159 // HACK(eddyb) Depend on flags being accurate to
160 // determine that all contents are in the global tcx.
161 // See comments on Lift for why we can't use that.
162 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
163 local.type_.borrow_mut().intern(st, |st| {
164 let ty_struct = TyS {
167 outer_exclusive_binder: flags.outer_exclusive_binder,
170 // Make sure we don't end up with inference
171 // types/regions in the global interner
172 if ptr::eq(local, global) {
173 bug!("Attempted to intern `{:?}` which contains \
174 inference types/regions in the global type context",
178 Interned(local.arena.alloc(ty_struct))
181 global.type_.borrow_mut().intern(st, |st| {
182 let ty_struct = TyS {
185 outer_exclusive_binder: flags.outer_exclusive_binder,
188 // This is safe because all the types the ty_struct can point to
189 // already is in the global arena
190 let ty_struct: TyS<'gcx> = unsafe {
191 mem::transmute(ty_struct)
194 Interned(global.arena.alloc(ty_struct))
200 pub struct CommonTypes<'tcx> {
221 pub re_empty: Region<'tcx>,
222 pub re_static: Region<'tcx>,
223 pub re_erased: Region<'tcx>,
226 pub struct LocalTableInContext<'a, V: 'a> {
227 local_id_root: Option<DefId>,
228 data: &'a ItemLocalMap<V>
231 /// Validate that the given HirId (respectively its `local_id` part) can be
232 /// safely used as a key in the tables of a TypeckTable. For that to be
233 /// the case, the HirId must have the same `owner` as all the other IDs in
234 /// this table (signified by `local_id_root`). Otherwise the HirId
235 /// would be in a different frame of reference and using its `local_id`
236 /// would result in lookup errors, or worse, in silently wrong data being
238 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
241 if cfg!(debug_assertions) {
242 if let Some(local_id_root) = local_id_root {
243 if hir_id.owner != local_id_root.index {
244 ty::tls::with(|tcx| {
245 let node_id = tcx.hir().hir_to_node_id(hir_id);
247 bug!("node {} with HirId::owner {:?} cannot be placed in \
248 TypeckTables with local_id_root {:?}",
249 tcx.hir().node_to_string(node_id),
250 DefId::local(hir_id.owner),
255 // We use "Null Object" TypeckTables in some of the analysis passes.
256 // These are just expected to be empty and their `local_id_root` is
257 // `None`. Therefore we cannot verify whether a given `HirId` would
258 // be a valid key for the given table. Instead we make sure that
259 // nobody tries to write to such a Null Object table.
261 bug!("access to invalid TypeckTables")
267 impl<'a, V> LocalTableInContext<'a, V> {
268 pub fn contains_key(&self, id: hir::HirId) -> bool {
269 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
270 self.data.contains_key(&id.local_id)
273 pub fn get(&self, id: hir::HirId) -> Option<&V> {
274 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
275 self.data.get(&id.local_id)
278 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
283 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
286 fn index(&self, key: hir::HirId) -> &V {
287 self.get(key).expect("LocalTableInContext: key not found")
291 pub struct LocalTableInContextMut<'a, V: 'a> {
292 local_id_root: Option<DefId>,
293 data: &'a mut ItemLocalMap<V>
296 impl<'a, V> LocalTableInContextMut<'a, V> {
297 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
298 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
299 self.data.get_mut(&id.local_id)
302 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
303 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
304 self.data.entry(id.local_id)
307 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
308 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
309 self.data.insert(id.local_id, val)
312 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
313 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
314 self.data.remove(&id.local_id)
318 #[derive(RustcEncodable, RustcDecodable, Debug)]
319 pub struct TypeckTables<'tcx> {
320 /// The HirId::owner all ItemLocalIds in this table are relative to.
321 pub local_id_root: Option<DefId>,
323 /// Resolved definitions for `<T>::X` associated paths and
324 /// method calls, including those of overloaded operators.
325 type_dependent_defs: ItemLocalMap<Def>,
327 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
328 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
329 /// about the field you also need definition of the variant to which the field
330 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
331 field_indices: ItemLocalMap<usize>,
333 /// Stores the types for various nodes in the AST. Note that this table
334 /// is not guaranteed to be populated until after typeck. See
335 /// typeck::check::fn_ctxt for details.
336 node_types: ItemLocalMap<Ty<'tcx>>,
338 /// Stores the type parameters which were substituted to obtain the type
339 /// of this node. This only applies to nodes that refer to entities
340 /// parameterized by type parameters, such as generic fns, types, or
342 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
344 /// This will either store the canonicalized types provided by the user
345 /// or the substitutions that the user explicitly gave (if any) attached
346 /// to `id`. These will not include any inferred values. The canonical form
347 /// is used to capture things like `_` or other unspecified values.
349 /// For example, if the user wrote `foo.collect::<Vec<_>>()`, then the
350 /// canonical substitutions would include only `for<X> { Vec<X> }`.
352 /// See also `AscribeUserType` statement in MIR.
353 user_provided_types: ItemLocalMap<CanonicalUserType<'tcx>>,
355 /// Stores the canonicalized types provided by the user. See also
356 /// `AscribeUserType` statement in MIR.
357 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
359 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
361 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
362 pat_binding_modes: ItemLocalMap<BindingMode>,
364 /// Stores the types which were implicitly dereferenced in pattern binding modes
365 /// for later usage in HAIR lowering. For example,
368 /// match &&Some(5i32) {
373 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
376 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
377 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
380 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
382 /// Records the reasons that we picked the kind of each closure;
383 /// not all closures are present in the map.
384 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
386 /// For each fn, records the "liberated" types of its arguments
387 /// and return type. Liberated means that all bound regions
388 /// (including late-bound regions) are replaced with free
389 /// equivalents. This table is not used in codegen (since regions
390 /// are erased there) and hence is not serialized to metadata.
391 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
393 /// For each FRU expression, record the normalized types of the fields
394 /// of the struct - this is needed because it is non-trivial to
395 /// normalize while preserving regions. This table is used only in
396 /// MIR construction and hence is not serialized to metadata.
397 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
399 /// Maps a cast expression to its kind. This is keyed on the
400 /// *from* expression of the cast, not the cast itself.
401 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
403 /// Set of trait imports actually used in the method resolution.
404 /// This is used for warning unused imports. During type
405 /// checking, this `Lrc` should not be cloned: it must have a ref-count
406 /// of 1 so that we can insert things into the set mutably.
407 pub used_trait_imports: Lrc<DefIdSet>,
409 /// If any errors occurred while type-checking this body,
410 /// this field will be set to `true`.
411 pub tainted_by_errors: bool,
413 /// Stores the free-region relationships that were deduced from
414 /// its where clauses and parameter types. These are then
415 /// read-again by borrowck.
416 pub free_region_map: FreeRegionMap<'tcx>,
418 /// All the existential types that are restricted to concrete types
420 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
422 /// Given the closure ID this map provides the list of UpvarIDs used by it.
423 /// The upvarID contains the HIR node ID and it also contains the full path
424 /// leading to the member of the struct or tuple that is used instead of the
426 pub upvar_list: ty::UpvarListMap,
429 impl<'tcx> TypeckTables<'tcx> {
430 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
433 type_dependent_defs: Default::default(),
434 field_indices: Default::default(),
435 user_provided_types: Default::default(),
436 user_provided_sigs: Default::default(),
437 node_types: Default::default(),
438 node_substs: Default::default(),
439 adjustments: Default::default(),
440 pat_binding_modes: Default::default(),
441 pat_adjustments: Default::default(),
442 upvar_capture_map: Default::default(),
443 closure_kind_origins: Default::default(),
444 liberated_fn_sigs: Default::default(),
445 fru_field_types: Default::default(),
446 cast_kinds: Default::default(),
447 used_trait_imports: Lrc::new(Default::default()),
448 tainted_by_errors: false,
449 free_region_map: Default::default(),
450 concrete_existential_types: Default::default(),
451 upvar_list: Default::default(),
455 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
456 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
458 hir::QPath::Resolved(_, ref path) => path.def,
459 hir::QPath::TypeRelative(..) => {
460 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
461 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
466 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
467 LocalTableInContext {
468 local_id_root: self.local_id_root,
469 data: &self.type_dependent_defs
473 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
474 LocalTableInContextMut {
475 local_id_root: self.local_id_root,
476 data: &mut self.type_dependent_defs
480 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
481 LocalTableInContext {
482 local_id_root: self.local_id_root,
483 data: &self.field_indices
487 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
488 LocalTableInContextMut {
489 local_id_root: self.local_id_root,
490 data: &mut self.field_indices
494 pub fn user_provided_types(
496 ) -> LocalTableInContext<'_, CanonicalUserType<'tcx>> {
497 LocalTableInContext {
498 local_id_root: self.local_id_root,
499 data: &self.user_provided_types
503 pub fn user_provided_types_mut(
505 ) -> LocalTableInContextMut<'_, CanonicalUserType<'tcx>> {
506 LocalTableInContextMut {
507 local_id_root: self.local_id_root,
508 data: &mut self.user_provided_types
512 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
513 LocalTableInContext {
514 local_id_root: self.local_id_root,
515 data: &self.node_types
519 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
520 LocalTableInContextMut {
521 local_id_root: self.local_id_root,
522 data: &mut self.node_types
526 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
527 self.node_id_to_type_opt(id).unwrap_or_else(||
528 bug!("node_id_to_type: no type for node `{}`",
530 let id = tcx.hir().hir_to_node_id(id);
531 tcx.hir().node_to_string(id)
536 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
537 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
538 self.node_types.get(&id.local_id).cloned()
541 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
542 LocalTableInContextMut {
543 local_id_root: self.local_id_root,
544 data: &mut self.node_substs
548 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
549 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
550 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
553 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
554 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
555 self.node_substs.get(&id.local_id).cloned()
558 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
559 // doesn't provide type parameter substitutions.
560 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
561 self.node_id_to_type(pat.hir_id)
564 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
565 self.node_id_to_type_opt(pat.hir_id)
568 // Returns the type of an expression as a monotype.
570 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
571 // some cases, we insert `Adjustment` annotations such as auto-deref or
572 // auto-ref. The type returned by this function does not consider such
573 // adjustments. See `expr_ty_adjusted()` instead.
575 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
576 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
577 // instead of "fn(ty) -> T with T = isize".
578 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
579 self.node_id_to_type(expr.hir_id)
582 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
583 self.node_id_to_type_opt(expr.hir_id)
586 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
587 LocalTableInContext {
588 local_id_root: self.local_id_root,
589 data: &self.adjustments
593 pub fn adjustments_mut(&mut self)
594 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
595 LocalTableInContextMut {
596 local_id_root: self.local_id_root,
597 data: &mut self.adjustments
601 pub fn expr_adjustments(&self, expr: &hir::Expr)
602 -> &[ty::adjustment::Adjustment<'tcx>] {
603 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
604 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
607 /// Returns the type of `expr`, considering any `Adjustment`
608 /// entry recorded for that expression.
609 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
610 self.expr_adjustments(expr)
612 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
615 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
616 self.expr_adjustments(expr)
618 .map(|adj| adj.target)
619 .or_else(|| self.expr_ty_opt(expr))
622 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
623 // Only paths and method calls/overloaded operators have
624 // entries in type_dependent_defs, ignore the former here.
625 if let hir::ExprKind::Path(_) = expr.node {
629 match self.type_dependent_defs().get(expr.hir_id) {
630 Some(&Def::Method(_)) => true,
635 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
636 LocalTableInContext {
637 local_id_root: self.local_id_root,
638 data: &self.pat_binding_modes
642 pub fn pat_binding_modes_mut(&mut self)
643 -> LocalTableInContextMut<'_, BindingMode> {
644 LocalTableInContextMut {
645 local_id_root: self.local_id_root,
646 data: &mut self.pat_binding_modes
650 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
651 LocalTableInContext {
652 local_id_root: self.local_id_root,
653 data: &self.pat_adjustments,
657 pub fn pat_adjustments_mut(&mut self)
658 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
659 LocalTableInContextMut {
660 local_id_root: self.local_id_root,
661 data: &mut self.pat_adjustments,
665 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
666 self.upvar_capture_map[&upvar_id]
669 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
670 LocalTableInContext {
671 local_id_root: self.local_id_root,
672 data: &self.closure_kind_origins
676 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
677 LocalTableInContextMut {
678 local_id_root: self.local_id_root,
679 data: &mut self.closure_kind_origins
683 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
684 LocalTableInContext {
685 local_id_root: self.local_id_root,
686 data: &self.liberated_fn_sigs
690 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
691 LocalTableInContextMut {
692 local_id_root: self.local_id_root,
693 data: &mut self.liberated_fn_sigs
697 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
698 LocalTableInContext {
699 local_id_root: self.local_id_root,
700 data: &self.fru_field_types
704 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
705 LocalTableInContextMut {
706 local_id_root: self.local_id_root,
707 data: &mut self.fru_field_types
711 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
712 LocalTableInContext {
713 local_id_root: self.local_id_root,
714 data: &self.cast_kinds
718 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
719 LocalTableInContextMut {
720 local_id_root: self.local_id_root,
721 data: &mut self.cast_kinds
726 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
727 fn hash_stable<W: StableHasherResult>(&self,
728 hcx: &mut StableHashingContext<'a>,
729 hasher: &mut StableHasher<W>) {
730 let ty::TypeckTables {
732 ref type_dependent_defs,
734 ref user_provided_types,
735 ref user_provided_sigs,
739 ref pat_binding_modes,
741 ref upvar_capture_map,
742 ref closure_kind_origins,
743 ref liberated_fn_sigs,
748 ref used_trait_imports,
751 ref concrete_existential_types,
756 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
757 type_dependent_defs.hash_stable(hcx, hasher);
758 field_indices.hash_stable(hcx, hasher);
759 user_provided_types.hash_stable(hcx, hasher);
760 user_provided_sigs.hash_stable(hcx, hasher);
761 node_types.hash_stable(hcx, hasher);
762 node_substs.hash_stable(hcx, hasher);
763 adjustments.hash_stable(hcx, hasher);
764 pat_binding_modes.hash_stable(hcx, hasher);
765 pat_adjustments.hash_stable(hcx, hasher);
766 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
773 local_id_root.expect("trying to hash invalid TypeckTables");
775 let var_owner_def_id = DefId {
776 krate: local_id_root.krate,
777 index: var_path.hir_id.owner,
779 let closure_def_id = DefId {
780 krate: local_id_root.krate,
781 index: closure_expr_id.to_def_id().index,
783 (hcx.def_path_hash(var_owner_def_id),
784 var_path.hir_id.local_id,
785 hcx.def_path_hash(closure_def_id))
788 closure_kind_origins.hash_stable(hcx, hasher);
789 liberated_fn_sigs.hash_stable(hcx, hasher);
790 fru_field_types.hash_stable(hcx, hasher);
791 cast_kinds.hash_stable(hcx, hasher);
792 used_trait_imports.hash_stable(hcx, hasher);
793 tainted_by_errors.hash_stable(hcx, hasher);
794 free_region_map.hash_stable(hcx, hasher);
795 concrete_existential_types.hash_stable(hcx, hasher);
796 upvar_list.hash_stable(hcx, hasher);
802 pub struct UserTypeAnnotationIndex {
803 DEBUG_FORMAT = "UserType({})",
804 const START_INDEX = 0,
808 /// Mapping of type annotation indices to canonical user type annotations.
809 pub type CanonicalUserTypeAnnotations<'tcx> =
810 IndexVec<UserTypeAnnotationIndex, CanonicalUserTypeAnnotation<'tcx>>;
812 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
813 pub struct CanonicalUserTypeAnnotation<'tcx> {
814 pub user_ty: CanonicalUserType<'tcx>,
816 pub inferred_ty: Ty<'tcx>,
819 BraceStructTypeFoldableImpl! {
820 impl<'tcx> TypeFoldable<'tcx> for CanonicalUserTypeAnnotation<'tcx> {
821 user_ty, span, inferred_ty
825 BraceStructLiftImpl! {
826 impl<'a, 'tcx> Lift<'tcx> for CanonicalUserTypeAnnotation<'a> {
827 type Lifted = CanonicalUserTypeAnnotation<'tcx>;
828 user_ty, span, inferred_ty
833 /// Canonicalized user type annotation.
834 pub type CanonicalUserType<'gcx> = Canonical<'gcx, UserType<'gcx>>;
836 impl CanonicalUserType<'gcx> {
837 /// Returns `true` if this represents a substitution of the form `[?0, ?1, ?2]`,
838 /// i.e. each thing is mapped to a canonical variable with the same index.
839 pub fn is_identity(&self) -> bool {
841 UserType::Ty(_) => false,
842 UserType::TypeOf(_, user_substs) => {
843 if user_substs.user_self_ty.is_some() {
847 user_substs.substs.iter().zip(BoundVar::new(0)..).all(|(kind, cvar)| {
848 match kind.unpack() {
849 UnpackedKind::Type(ty) => match ty.sty {
850 ty::Bound(debruijn, b) => {
851 // We only allow a `ty::INNERMOST` index in substitutions.
852 assert_eq!(debruijn, ty::INNERMOST);
858 UnpackedKind::Lifetime(r) => match r {
859 ty::ReLateBound(debruijn, br) => {
860 // We only allow a `ty::INNERMOST` index in substitutions.
861 assert_eq!(*debruijn, ty::INNERMOST);
862 cvar == br.assert_bound_var()
873 /// A user-given type annotation attached to a constant. These arise
874 /// from constants that are named via paths, like `Foo::<A>::new` and
876 #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, RustcEncodable, RustcDecodable)]
877 pub enum UserType<'tcx> {
880 /// The canonical type is the result of `type_of(def_id)` with the
881 /// given substitutions applied.
882 TypeOf(DefId, UserSubsts<'tcx>),
885 EnumTypeFoldableImpl! {
886 impl<'tcx> TypeFoldable<'tcx> for UserType<'tcx> {
888 (UserType::TypeOf)(def, substs),
893 impl<'a, 'tcx> Lift<'tcx> for UserType<'a> {
894 type Lifted = UserType<'tcx>;
896 (UserType::TypeOf)(def, substs),
900 impl<'tcx> CommonTypes<'tcx> {
901 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
902 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
903 let mk_region = |r| {
904 interners.region.borrow_mut().intern(r, |r| {
905 Interned(interners.arena.alloc(r))
910 unit: mk(Tuple(List::empty())),
915 isize: mk(Int(ast::IntTy::Isize)),
916 i8: mk(Int(ast::IntTy::I8)),
917 i16: mk(Int(ast::IntTy::I16)),
918 i32: mk(Int(ast::IntTy::I32)),
919 i64: mk(Int(ast::IntTy::I64)),
920 i128: mk(Int(ast::IntTy::I128)),
921 usize: mk(Uint(ast::UintTy::Usize)),
922 u8: mk(Uint(ast::UintTy::U8)),
923 u16: mk(Uint(ast::UintTy::U16)),
924 u32: mk(Uint(ast::UintTy::U32)),
925 u64: mk(Uint(ast::UintTy::U64)),
926 u128: mk(Uint(ast::UintTy::U128)),
927 f32: mk(Float(ast::FloatTy::F32)),
928 f64: mk(Float(ast::FloatTy::F64)),
930 re_empty: mk_region(RegionKind::ReEmpty),
931 re_static: mk_region(RegionKind::ReStatic),
932 re_erased: mk_region(RegionKind::ReErased),
937 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
940 pub struct FreeRegionInfo {
941 // def id corresponding to FreeRegion
943 // the bound region corresponding to FreeRegion
944 pub boundregion: ty::BoundRegion,
945 // checks if bound region is in Impl Item
946 pub is_impl_item: bool,
949 /// The central data structure of the compiler. It stores references
950 /// to the various **arenas** and also houses the results of the
951 /// various **compiler queries** that have been performed. See the
952 /// [rustc guide] for more details.
954 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
955 #[derive(Copy, Clone)]
956 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
957 gcx: &'gcx GlobalCtxt<'gcx>,
958 interners: &'tcx CtxtInterners<'tcx>,
959 dummy: PhantomData<&'a ()>,
962 impl<'gcx> Deref for TyCtxt<'_, 'gcx, '_> {
963 type Target = &'gcx GlobalCtxt<'gcx>;
965 fn deref(&self) -> &Self::Target {
970 pub struct GlobalCtxt<'tcx> {
971 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
972 global_interners: CtxtInterners<'tcx>,
974 cstore: &'tcx CrateStoreDyn,
976 pub sess: &'tcx Session,
978 pub dep_graph: DepGraph,
980 /// Common types, pre-interned for your convenience.
981 pub types: CommonTypes<'tcx>,
983 /// Map indicating what traits are in scope for places where this
984 /// is relevant; generated by resolve.
985 trait_map: FxHashMap<DefIndex,
986 Lrc<FxHashMap<ItemLocalId,
987 Lrc<StableVec<TraitCandidate>>>>>,
989 /// Export map produced by name resolution.
990 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
992 hir_map: hir_map::Map<'tcx>,
994 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
995 /// as well as all upstream crates. Only populated in incremental mode.
996 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
998 pub queries: query::Queries<'tcx>,
1000 // Records the free variables referenced by every closure
1001 // expression. Do not track deps for this, just recompute it from
1002 // scratch every time.
1003 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
1005 maybe_unused_trait_imports: FxHashSet<DefId>,
1006 maybe_unused_extern_crates: Vec<(DefId, Span)>,
1007 /// A map of glob use to a set of names it actually imports. Currently only
1008 /// used in save-analysis.
1009 glob_map: FxHashMap<DefId, FxHashSet<ast::Name>>,
1010 /// Extern prelude entries. The value is `true` if the entry was introduced
1011 /// via `extern crate` item and not `--extern` option or compiler built-in.
1012 pub extern_prelude: FxHashMap<ast::Name, bool>,
1014 // Internal cache for metadata decoding. No need to track deps on this.
1015 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
1017 /// Caches the results of trait selection. This cache is used
1018 /// for things that do not have to do with the parameters in scope.
1019 pub selection_cache: traits::SelectionCache<'tcx>,
1021 /// Caches the results of trait evaluation. This cache is used
1022 /// for things that do not have to do with the parameters in scope.
1023 /// Merge this with `selection_cache`?
1024 pub evaluation_cache: traits::EvaluationCache<'tcx>,
1026 /// The definite name of the current crate after taking into account
1027 /// attributes, commandline parameters, etc.
1028 pub crate_name: Symbol,
1030 /// Data layout specification for the current target.
1031 pub data_layout: TargetDataLayout,
1033 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
1035 /// Stores the value of constants (and deduplicates the actual memory)
1036 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
1038 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
1040 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
1042 /// A general purpose channel to throw data out the back towards LLVM worker
1045 /// This is intended to only get used during the codegen phase of the compiler
1046 /// when satisfying the query for a particular codegen unit. Internally in
1047 /// the query it'll send data along this channel to get processed later.
1048 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
1050 output_filenames: Arc<OutputFilenames>,
1053 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
1054 /// Get the global TyCtxt.
1056 pub fn global_tcx(self) -> TyCtxt<'gcx, 'gcx, 'gcx> {
1059 interners: &self.gcx.global_interners,
1065 pub fn hir(self) -> &'a hir_map::Map<'gcx> {
1069 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
1070 self.global_arenas.generics.alloc(generics)
1073 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
1074 self.global_arenas.steal_mir.alloc(Steal::new(mir))
1077 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
1078 self.global_arenas.mir.alloc(mir)
1081 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1082 self.global_arenas.tables.alloc(tables)
1085 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1086 self.global_arenas.trait_def.alloc(def)
1089 pub fn alloc_adt_def(self,
1092 variants: IndexVec<VariantIdx, ty::VariantDef>,
1094 -> &'gcx ty::AdtDef {
1095 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1096 self.global_arenas.adt_def.alloc(def)
1099 pub fn intern_const_alloc(
1102 ) -> &'gcx Allocation {
1103 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1104 self.global_arenas.const_allocs.alloc(alloc)
1108 /// Allocates a byte or string literal for `mir::interpret`, read-only
1109 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1110 // create an allocation that just contains these bytes
1111 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes, ());
1112 let alloc = self.intern_const_alloc(alloc);
1113 self.alloc_map.lock().allocate(alloc)
1116 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1117 self.stability_interner.borrow_mut().intern(stab, |stab| {
1118 self.global_interners.arena.alloc(stab)
1122 pub fn intern_lazy_const(self, c: ty::LazyConst<'tcx>) -> &'tcx ty::LazyConst<'tcx> {
1123 self.global_interners.arena.alloc(c)
1126 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1127 self.layout_interner.borrow_mut().intern(layout, |layout| {
1128 self.global_arenas.layout.alloc(layout)
1132 /// Returns a range of the start/end indices specified with the
1133 /// `rustc_layout_scalar_valid_range` attribute.
1134 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1135 let attrs = self.get_attrs(def_id);
1137 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1139 None => return Bound::Unbounded,
1141 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1142 match meta.literal().expect("attribute takes lit").node {
1143 ast::LitKind::Int(a, _) => return Bound::Included(a),
1144 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1147 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1149 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1152 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1153 value.lift_to_tcx(self)
1156 /// Like lift, but only tries in the global tcx.
1157 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1158 value.lift_to_tcx(self.global_tcx())
1161 /// Returns true if self is the same as self.global_tcx().
1162 fn is_global(self) -> bool {
1163 ptr::eq(self.interners, &self.global_interners)
1166 /// Create a type context and call the closure with a `TyCtxt` reference
1167 /// to the context. The closure enforces that the type context and any interned
1168 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1169 /// reference to the context, to allow formatting values that need it.
1170 pub fn create_and_enter<F, R>(s: &'tcx Session,
1171 cstore: &'tcx CrateStoreDyn,
1172 local_providers: ty::query::Providers<'tcx>,
1173 extern_providers: ty::query::Providers<'tcx>,
1174 arenas: &'tcx mut AllArenas<'tcx>,
1175 resolutions: ty::Resolutions,
1176 hir: hir_map::Map<'tcx>,
1177 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1179 tx: mpsc::Sender<Box<dyn Any + Send>>,
1180 output_filenames: &OutputFilenames,
1182 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1184 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1187 let interners = CtxtInterners::new(&arenas.interner);
1188 let common_types = CommonTypes::new(&interners);
1189 let dep_graph = hir.dep_graph.clone();
1190 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1191 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1192 providers[LOCAL_CRATE] = local_providers;
1194 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1195 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1198 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1201 let def_path_tables = || {
1202 upstream_def_path_tables
1204 .map(|&(cnum, ref rc)| (cnum, &**rc))
1205 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1208 // Precompute the capacity of the hashmap so we don't have to
1209 // re-allocate when populating it.
1210 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1212 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1214 ::std::default::Default::default()
1217 for (cnum, def_path_table) in def_path_tables() {
1218 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1226 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1227 for (k, v) in resolutions.trait_map {
1228 let hir_id = hir.node_to_hir_id(k);
1229 let map = trait_map.entry(hir_id.owner).or_default();
1230 Lrc::get_mut(map).unwrap()
1231 .insert(hir_id.local_id,
1232 Lrc::new(StableVec::new(v)));
1235 arenas.global_ctxt = Some(GlobalCtxt {
1238 global_arenas: &arenas.global,
1239 global_interners: interners,
1241 types: common_types,
1243 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1246 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1247 (hir.local_def_id(k), Lrc::new(v))
1249 maybe_unused_trait_imports:
1250 resolutions.maybe_unused_trait_imports
1252 .map(|id| hir.local_def_id(id))
1254 maybe_unused_extern_crates:
1255 resolutions.maybe_unused_extern_crates
1257 .map(|(id, sp)| (hir.local_def_id(id), sp))
1259 glob_map: resolutions.glob_map.into_iter().map(|(id, names)| {
1260 (hir.local_def_id(id), names)
1262 extern_prelude: resolutions.extern_prelude,
1264 def_path_hash_to_def_id,
1265 queries: query::Queries::new(
1268 on_disk_query_result_cache,
1270 rcache: Default::default(),
1271 selection_cache: Default::default(),
1272 evaluation_cache: Default::default(),
1273 crate_name: Symbol::intern(crate_name),
1275 layout_interner: Default::default(),
1276 stability_interner: Default::default(),
1277 allocation_interner: Default::default(),
1278 alloc_map: Lock::new(interpret::AllocMap::new()),
1279 tx_to_llvm_workers: Lock::new(tx),
1280 output_filenames: Arc::new(output_filenames.clone()),
1283 let gcx = arenas.global_ctxt.as_ref().unwrap();
1285 sync::assert_send_val(&gcx);
1287 let r = tls::enter_global(gcx, f);
1289 gcx.queries.record_computed_queries(s);
1294 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1295 let cname = self.crate_name(LOCAL_CRATE).as_str();
1296 self.sess.consider_optimizing(&cname, msg)
1299 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1300 self.get_lib_features(LOCAL_CRATE)
1303 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1304 self.get_lang_items(LOCAL_CRATE)
1307 /// Due to missing llvm support for lowering 128 bit math to software emulation
1308 /// (on some targets), the lowering can be done in MIR.
1310 /// This function only exists until said support is implemented.
1311 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1312 let items = self.lang_items();
1313 let def_id = Some(def_id);
1314 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1315 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1316 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1317 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1318 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1319 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1320 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1321 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1322 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1323 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1324 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1325 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1326 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1327 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1328 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1329 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1330 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1331 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1332 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1333 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1334 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1335 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1336 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1337 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1341 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1342 self.stability_index(LOCAL_CRATE)
1345 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1346 self.all_crate_nums(LOCAL_CRATE)
1349 pub fn features(self) -> Lrc<feature_gate::Features> {
1350 self.features_query(LOCAL_CRATE)
1353 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1355 self.hir().def_key(id)
1357 self.cstore.def_key(id)
1361 /// Convert a `DefId` into its fully expanded `DefPath` (every
1362 /// `DefId` is really just an interned def-path).
1364 /// Note that if `id` is not local to this crate, the result will
1365 /// be a non-local `DefPath`.
1366 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1368 self.hir().def_path(id)
1370 self.cstore.def_path(id)
1375 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1376 if def_id.is_local() {
1377 self.hir().definitions().def_path_hash(def_id.index)
1379 self.cstore.def_path_hash(def_id)
1383 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1384 // We are explicitly not going through queries here in order to get
1385 // crate name and disambiguator since this code is called from debug!()
1386 // statements within the query system and we'd run into endless
1387 // recursion otherwise.
1388 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1389 (self.crate_name.clone(),
1390 self.sess.local_crate_disambiguator())
1392 (self.cstore.crate_name_untracked(def_id.krate),
1393 self.cstore.crate_disambiguator_untracked(def_id.krate))
1398 // Don't print the whole crate disambiguator. That's just
1399 // annoying in debug output.
1400 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1401 self.def_path(def_id).to_string_no_crate())
1404 pub fn metadata_encoding_version(self) -> Vec<u8> {
1405 self.cstore.metadata_encoding_version().to_vec()
1408 // Note that this is *untracked* and should only be used within the query
1409 // system if the result is otherwise tracked through queries
1410 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1411 self.cstore.crate_data_as_rc_any(cnum)
1415 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1416 let krate = self.gcx.hir_map.forest.untracked_krate();
1418 StableHashingContext::new(self.sess,
1420 self.hir().definitions(),
1424 // This method makes sure that we have a DepNode and a Fingerprint for
1425 // every upstream crate. It needs to be called once right after the tcx is
1427 // With full-fledged red/green, the method will probably become unnecessary
1428 // as this will be done on-demand.
1429 pub fn allocate_metadata_dep_nodes(self) {
1430 // We cannot use the query versions of crates() and crate_hash(), since
1431 // those would need the DepNodes that we are allocating here.
1432 for cnum in self.cstore.crates_untracked() {
1433 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1434 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1435 self.dep_graph.with_task(dep_node,
1438 |_, x| x // No transformation needed
1443 // This method exercises the `in_scope_traits_map` query for all possible
1444 // values so that we have their fingerprints available in the DepGraph.
1445 // This is only required as long as we still use the old dependency tracking
1446 // which needs to have the fingerprints of all input nodes beforehand.
1447 pub fn precompute_in_scope_traits_hashes(self) {
1448 for &def_index in self.trait_map.keys() {
1449 self.in_scope_traits_map(def_index);
1453 pub fn serialize_query_result_cache<E>(self,
1455 -> Result<(), E::Error>
1456 where E: ty::codec::TyEncoder
1458 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1461 /// This checks whether one is allowed to have pattern bindings
1462 /// that bind-by-move on a match arm that has a guard, e.g.:
1465 /// match foo { A(inner) if { /* something */ } => ..., ... }
1468 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1469 /// because that method has a narrower effect that can be toggled
1470 /// off via a separate `-Z` flag, at least for the short term.
1471 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1472 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1475 /// If true, we should use a naive AST walk to determine if match
1476 /// guard could perform bad mutations (or mutable-borrows).
1477 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1478 // If someone requests the feature, then be a little more
1479 // careful and ensure that MIR-borrowck is enabled (which can
1480 // happen via edition selection, via `feature(nll)`, or via an
1481 // appropriate `-Z` flag) before disabling the mutation check.
1482 if self.allow_bind_by_move_patterns_with_guards() {
1489 /// If true, we should use the AST-based borrowck (we may *also* use
1490 /// the MIR-based borrowck).
1491 pub fn use_ast_borrowck(self) -> bool {
1492 self.borrowck_mode().use_ast()
1495 /// If true, we should use the MIR-based borrowck (we may *also* use
1496 /// the AST-based borrowck).
1497 pub fn use_mir_borrowck(self) -> bool {
1498 self.borrowck_mode().use_mir()
1501 /// If true, we should use the MIR-based borrow check, but also
1502 /// fall back on the AST borrow check if the MIR-based one errors.
1503 pub fn migrate_borrowck(self) -> bool {
1504 self.borrowck_mode().migrate()
1507 /// If true, make MIR codegen for `match` emit a temp that holds a
1508 /// borrow of the input to the match expression.
1509 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1510 self.emit_read_for_match()
1513 /// If true, make MIR codegen for `match` emit FakeRead
1514 /// statements (which simulate the maximal effect of executing the
1515 /// patterns in a match arm).
1516 pub fn emit_read_for_match(&self) -> bool {
1517 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1520 /// If true, pattern variables for use in guards on match arms
1521 /// will be bound as references to the data, and occurrences of
1522 /// those variables in the guard expression will implicitly
1523 /// dereference those bindings. (See rust-lang/rust#27282.)
1524 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1525 self.borrowck_mode().use_mir()
1528 /// If true, we should enable two-phase borrows checks. This is
1529 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1530 /// or by opting into an edition after 2015.
1531 pub fn two_phase_borrows(self) -> bool {
1532 self.sess.rust_2018() || self.features().nll ||
1533 self.sess.opts.debugging_opts.two_phase_borrows
1536 /// What mode(s) of borrowck should we run? AST? MIR? both?
1537 /// (Also considers the `#![feature(nll)]` setting.)
1538 pub fn borrowck_mode(&self) -> BorrowckMode {
1539 // Here are the main constraints we need to deal with:
1541 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1542 // synonymous with no `-Z borrowck=...` flag at all.
1543 // (This is arguably a historical accident.)
1545 // 2. `BorrowckMode::Migrate` is the limited migration to
1546 // NLL that we are deploying with the 2018 edition.
1548 // 3. We want to allow developers on the Nightly channel
1549 // to opt back into the "hard error" mode for NLL,
1550 // (which they can do via specifying `#![feature(nll)]`
1551 // explicitly in their crate).
1553 // So, this precedence list is how pnkfelix chose to work with
1554 // the above constraints:
1556 // * `#![feature(nll)]` *always* means use NLL with hard
1557 // errors. (To simplify the code here, it now even overrides
1558 // a user's attempt to specify `-Z borrowck=compare`, which
1559 // we arguably do not need anymore and should remove.)
1561 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1562 // if `borrowck=ast` was specified), then use the default
1563 // as required by the edition.
1565 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1567 if self.features().nll { return BorrowckMode::Mir; }
1569 match self.sess.opts.borrowck_mode {
1570 mode @ BorrowckMode::Mir |
1571 mode @ BorrowckMode::Compare |
1572 mode @ BorrowckMode::Migrate => mode,
1574 BorrowckMode::Ast => match self.sess.edition() {
1575 Edition::Edition2015 => BorrowckMode::Ast,
1576 Edition::Edition2018 => BorrowckMode::Migrate,
1582 pub fn local_crate_exports_generics(self) -> bool {
1583 debug_assert!(self.sess.opts.share_generics());
1585 self.sess.crate_types.borrow().iter().any(|crate_type| {
1587 CrateType::Executable |
1588 CrateType::Staticlib |
1589 CrateType::ProcMacro |
1590 CrateType::Cdylib => false,
1592 CrateType::Dylib => true,
1597 // This method returns the DefId and the BoundRegion corresponding to the given region.
1598 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1599 let (suitable_region_binding_scope, bound_region) = match *region {
1600 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1601 ty::ReEarlyBound(ref ebr) => (
1602 self.parent_def_id(ebr.def_id).unwrap(),
1603 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1605 _ => return None, // not a free region
1608 let node_id = self.hir()
1609 .as_local_node_id(suitable_region_binding_scope)
1611 let is_impl_item = match self.hir().find(node_id) {
1612 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1613 Some(Node::ImplItem(..)) => {
1614 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1619 return Some(FreeRegionInfo {
1620 def_id: suitable_region_binding_scope,
1621 boundregion: bound_region,
1622 is_impl_item: is_impl_item,
1626 pub fn return_type_impl_trait(
1628 scope_def_id: DefId,
1629 ) -> Option<Ty<'tcx>> {
1630 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1631 let node_id = self.hir().as_local_node_id(scope_def_id).unwrap();
1632 match self.hir().get(node_id) {
1633 Node::Item(item) => {
1635 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1641 _ => { /* type_of_def_id() will work or panic */ }
1644 let ret_ty = self.type_of(scope_def_id);
1646 ty::FnDef(_, _) => {
1647 let sig = ret_ty.fn_sig(*self);
1648 let output = self.erase_late_bound_regions(&sig.output());
1649 if output.is_impl_trait() {
1659 // Here we check if the bound region is in Impl Item.
1660 pub fn is_bound_region_in_impl_item(
1662 suitable_region_binding_scope: DefId,
1664 let container_id = self.associated_item(suitable_region_binding_scope)
1667 if self.impl_trait_ref(container_id).is_some() {
1668 // For now, we do not try to target impls of traits. This is
1669 // because this message is going to suggest that the user
1670 // change the fn signature, but they may not be free to do so,
1671 // since the signature must match the trait.
1673 // FIXME(#42706) -- in some cases, we could do better here.
1679 /// Determine whether identifiers in the assembly have strict naming rules.
1680 /// Currently, only NVPTX* targets need it.
1681 pub fn has_strict_asm_symbol_naming(&self) -> bool {
1682 self.gcx.sess.target.target.arch.contains("nvptx")
1686 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1687 pub fn encode_metadata(self)
1690 self.cstore.encode_metadata(self)
1694 impl<'gcx> GlobalCtxt<'gcx> {
1695 /// Call the closure with a local `TyCtxt` using the given arena.
1696 /// `interners` is a slot passed so we can create a CtxtInterners
1697 /// with the same lifetime as `arena`.
1698 pub fn enter_local<'tcx, F, R>(
1700 arena: &'tcx SyncDroplessArena,
1701 interners: &'tcx mut Option<CtxtInterners<'tcx>>,
1705 F: FnOnce(TyCtxt<'tcx, 'gcx, 'tcx>) -> R,
1708 *interners = Some(CtxtInterners::new(&arena));
1711 interners: interners.as_ref().unwrap(),
1714 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1715 let new_icx = ty::tls::ImplicitCtxt {
1717 query: icx.query.clone(),
1718 diagnostics: icx.diagnostics,
1719 layout_depth: icx.layout_depth,
1720 task_deps: icx.task_deps,
1722 ty::tls::enter_context(&new_icx, |_| {
1729 /// A trait implemented for all X<'a> types which can be safely and
1730 /// efficiently converted to X<'tcx> as long as they are part of the
1731 /// provided TyCtxt<'tcx>.
1732 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1733 /// by looking them up in their respective interners.
1735 /// However, this is still not the best implementation as it does
1736 /// need to compare the components, even for interned values.
1737 /// It would be more efficient if TypedArena provided a way to
1738 /// determine whether the address is in the allocated range.
1740 /// None is returned if the value or one of the components is not part
1741 /// of the provided context.
1742 /// For Ty, None can be returned if either the type interner doesn't
1743 /// contain the TyKind key or if the address of the interned
1744 /// pointer differs. The latter case is possible if a primitive type,
1745 /// e.g., `()` or `u8`, was interned in a different context.
1746 pub trait Lift<'tcx>: fmt::Debug {
1747 type Lifted: fmt::Debug + 'tcx;
1748 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1752 macro_rules! nop_lift {
1753 ($ty:ty => $lifted:ty) => {
1754 impl<'a, 'tcx> Lift<'tcx> for $ty {
1755 type Lifted = $lifted;
1756 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1757 if tcx.interners.arena.in_arena(*self as *const _) {
1758 return Some(unsafe { mem::transmute(*self) });
1760 // Also try in the global tcx if we're not that.
1761 if !tcx.is_global() {
1762 self.lift_to_tcx(tcx.global_tcx())
1771 macro_rules! nop_list_lift {
1772 ($ty:ty => $lifted:ty) => {
1773 impl<'a, 'tcx> Lift<'tcx> for &'a List<$ty> {
1774 type Lifted = &'tcx List<$lifted>;
1775 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1776 if self.is_empty() {
1777 return Some(List::empty());
1779 if tcx.interners.arena.in_arena(*self as *const _) {
1780 return Some(unsafe { mem::transmute(*self) });
1782 // Also try in the global tcx if we're not that.
1783 if !tcx.is_global() {
1784 self.lift_to_tcx(tcx.global_tcx())
1793 nop_lift!{Ty<'a> => Ty<'tcx>}
1794 nop_lift!{Region<'a> => Region<'tcx>}
1795 nop_lift!{Goal<'a> => Goal<'tcx>}
1796 nop_lift!{&'a LazyConst<'a> => &'tcx LazyConst<'tcx>}
1798 nop_list_lift!{Goal<'a> => Goal<'tcx>}
1799 nop_list_lift!{Clause<'a> => Clause<'tcx>}
1800 nop_list_lift!{Ty<'a> => Ty<'tcx>}
1801 nop_list_lift!{ExistentialPredicate<'a> => ExistentialPredicate<'tcx>}
1802 nop_list_lift!{Predicate<'a> => Predicate<'tcx>}
1803 nop_list_lift!{CanonicalVarInfo => CanonicalVarInfo}
1804 nop_list_lift!{ProjectionKind<'a> => ProjectionKind<'tcx>}
1806 // this is the impl for `&'a Substs<'a>`
1807 nop_list_lift!{Kind<'a> => Kind<'tcx>}
1809 impl<'a, 'tcx> Lift<'tcx> for &'a mir::interpret::Allocation {
1810 type Lifted = &'tcx mir::interpret::Allocation;
1811 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1812 assert!(tcx.global_arenas.const_allocs.in_arena(*self as *const _));
1813 Some(unsafe { mem::transmute(*self) })
1818 use super::{GlobalCtxt, TyCtxt};
1822 use std::marker::PhantomData;
1826 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1827 use rustc_data_structures::OnDrop;
1828 use rustc_data_structures::sync::{self, Lrc, Lock};
1829 use rustc_data_structures::thin_vec::ThinVec;
1830 use dep_graph::TaskDeps;
1832 #[cfg(not(parallel_compiler))]
1833 use std::cell::Cell;
1835 #[cfg(parallel_compiler)]
1838 /// This is the implicit state of rustc. It contains the current
1839 /// TyCtxt and query. It is updated when creating a local interner or
1840 /// executing a new query. Whenever there's a TyCtxt value available
1841 /// you should also have access to an ImplicitCtxt through the functions
1844 pub struct ImplicitCtxt<'a, 'gcx: 'tcx, 'tcx> {
1845 /// The current TyCtxt. Initially created by `enter_global` and updated
1846 /// by `enter_local` with a new local interner
1847 pub tcx: TyCtxt<'tcx, 'gcx, 'tcx>,
1849 /// The current query job, if any. This is updated by JobOwner::start in
1850 /// ty::query::plumbing when executing a query
1851 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1853 /// Where to store diagnostics for the current query job, if any.
1854 /// This is updated by JobOwner::start in ty::query::plumbing when executing a query
1855 pub diagnostics: Option<&'a Lock<ThinVec<Diagnostic>>>,
1857 /// Used to prevent layout from recursing too deeply.
1858 pub layout_depth: usize,
1860 /// The current dep graph task. This is used to add dependencies to queries
1861 /// when executing them
1862 pub task_deps: Option<&'a Lock<TaskDeps>>,
1865 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1866 /// to `value` during the call to `f`. It is restored to its previous value after.
1867 /// This is used to set the pointer to the new ImplicitCtxt.
1868 #[cfg(parallel_compiler)]
1870 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1871 rayon_core::tlv::with(value, f)
1874 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1875 /// This is used to get the pointer to the current ImplicitCtxt.
1876 #[cfg(parallel_compiler)]
1878 fn get_tlv() -> usize {
1879 rayon_core::tlv::get()
1882 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1883 #[cfg(not(parallel_compiler))]
1884 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1886 /// Sets TLV to `value` during the call to `f`.
1887 /// It is restored to its previous value after.
1888 /// This is used to set the pointer to the new ImplicitCtxt.
1889 #[cfg(not(parallel_compiler))]
1891 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1892 let old = get_tlv();
1893 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1894 TLV.with(|tlv| tlv.set(value));
1898 /// This is used to get the pointer to the current ImplicitCtxt.
1899 #[cfg(not(parallel_compiler))]
1900 fn get_tlv() -> usize {
1901 TLV.with(|tlv| tlv.get())
1904 /// This is a callback from libsyntax as it cannot access the implicit state
1905 /// in librustc otherwise
1906 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1908 if let Some(tcx) = tcx {
1909 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1911 syntax_pos::default_span_debug(span, f)
1916 /// This is a callback from libsyntax as it cannot access the implicit state
1917 /// in librustc otherwise. It is used to when diagnostic messages are
1918 /// emitted and stores them in the current query, if there is one.
1919 fn track_diagnostic(diagnostic: &Diagnostic) {
1920 with_context_opt(|icx| {
1921 if let Some(icx) = icx {
1922 if let Some(ref diagnostics) = icx.diagnostics {
1923 let mut diagnostics = diagnostics.lock();
1924 diagnostics.extend(Some(diagnostic.clone()));
1930 /// Sets up the callbacks from libsyntax on the current thread
1931 pub fn with_thread_locals<F, R>(f: F) -> R
1932 where F: FnOnce() -> R
1934 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1935 let original_span_debug = span_dbg.get();
1936 span_dbg.set(span_debug);
1938 let _on_drop = OnDrop(move || {
1939 span_dbg.set(original_span_debug);
1942 TRACK_DIAGNOSTICS.with(|current| {
1943 let original = current.get();
1944 current.set(track_diagnostic);
1946 let _on_drop = OnDrop(move || {
1947 current.set(original);
1955 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1957 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1959 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1961 set_tlv(context as *const _ as usize, || {
1966 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1967 /// creating a initial TyCtxt and ImplicitCtxt.
1968 /// This happens once per rustc session and TyCtxts only exists
1969 /// inside the `f` function.
1970 pub fn enter_global<'gcx, F, R>(gcx: &'gcx GlobalCtxt<'gcx>, f: F) -> R
1971 where F: FnOnce(TyCtxt<'gcx, 'gcx, 'gcx>) -> R
1973 with_thread_locals(|| {
1974 // Update GCX_PTR to indicate there's a GlobalCtxt available
1975 GCX_PTR.with(|lock| {
1976 *lock.lock() = gcx as *const _ as usize;
1978 // Set GCX_PTR back to 0 when we exit
1979 let _on_drop = OnDrop(move || {
1980 GCX_PTR.with(|lock| *lock.lock() = 0);
1985 interners: &gcx.global_interners,
1988 let icx = ImplicitCtxt {
1995 enter_context(&icx, |_| {
2001 /// Stores a pointer to the GlobalCtxt if one is available.
2002 /// This is used to access the GlobalCtxt in the deadlock handler
2004 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2006 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2007 /// This is used in the deadlock handler.
2008 pub unsafe fn with_global<F, R>(f: F) -> R
2009 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2011 let gcx = GCX_PTR.with(|lock| *lock.lock());
2013 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2016 interners: &gcx.global_interners,
2019 let icx = ImplicitCtxt {
2026 enter_context(&icx, |_| f(tcx))
2029 /// Allows access to the current ImplicitCtxt in a closure if one is available
2031 pub fn with_context_opt<F, R>(f: F) -> R
2032 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2034 let context = get_tlv();
2038 // We could get a ImplicitCtxt pointer from another thread.
2039 // Ensure that ImplicitCtxt is Sync
2040 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2042 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2046 /// Allows access to the current ImplicitCtxt.
2047 /// Panics if there is no ImplicitCtxt available
2049 pub fn with_context<F, R>(f: F) -> R
2050 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2052 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2055 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2056 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2057 /// with the same 'gcx lifetime as the TyCtxt passed in.
2058 /// This will panic if you pass it a TyCtxt which has a different global interner from
2059 /// the current ImplicitCtxt's tcx field.
2061 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2062 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2064 with_context(|context| {
2066 assert!(ptr::eq(context.tcx.gcx, tcx.gcx));
2067 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2073 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2074 /// interner and local interner as the tcx argument passed in. This means the closure
2075 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2076 /// This will panic if you pass it a TyCtxt which has a different global interner or
2077 /// a different local interner from the current ImplicitCtxt's tcx field.
2079 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2080 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2082 with_context(|context| {
2084 assert!(ptr::eq(context.tcx.gcx, tcx.gcx));
2085 assert!(ptr::eq(context.tcx.interners, tcx.interners));
2086 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2092 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2093 /// Panics if there is no ImplicitCtxt available
2095 pub fn with<F, R>(f: F) -> R
2096 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2098 with_context(|context| f(context.tcx))
2101 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2102 /// The closure is passed None if there is no ImplicitCtxt available
2104 pub fn with_opt<F, R>(f: F) -> R
2105 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2107 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2111 macro_rules! sty_debug_print {
2112 ($ctxt: expr, $($variant: ident),*) => {{
2113 // curious inner module to allow variant names to be used as
2115 #[allow(non_snake_case)]
2117 use ty::{self, TyCtxt};
2118 use ty::context::Interned;
2120 #[derive(Copy, Clone)]
2123 region_infer: usize,
2128 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2129 let mut total = DebugStat {
2131 region_infer: 0, ty_infer: 0, both_infer: 0,
2133 $(let mut $variant = total;)*
2135 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2136 let variant = match t.sty {
2137 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2138 ty::Float(..) | ty::Str | ty::Never => continue,
2139 ty::Error => /* unimportant */ continue,
2140 $(ty::$variant(..) => &mut $variant,)*
2142 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2143 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2147 if region { total.region_infer += 1; variant.region_infer += 1 }
2148 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2149 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2151 println!("Ty interner total ty region both");
2152 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2153 {ty:4.1}% {region:5.1}% {both:4.1}%",
2154 stringify!($variant),
2155 uses = $variant.total,
2156 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2157 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2158 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2159 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2161 println!(" total {uses:6} \
2162 {ty:4.1}% {region:5.1}% {both:4.1}%",
2164 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2165 region = total.region_infer as f64 * 100.0 / total.total as f64,
2166 both = total.both_infer as f64 * 100.0 / total.total as f64)
2174 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2175 pub fn print_debug_stats(self) {
2178 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2179 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2180 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2182 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2183 println!("Region interner: #{}", self.interners.region.borrow().len());
2184 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2185 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2186 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2191 /// An entry in an interner.
2192 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2194 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2195 fn clone(&self) -> Self {
2199 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2201 // N.B., an `Interned<Ty>` compares and hashes as a sty.
2202 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2203 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2204 self.0.sty == other.0.sty
2208 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2210 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2211 fn hash<H: Hasher>(&self, s: &mut H) {
2216 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2217 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2222 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2223 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2224 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2225 self.0[..] == other.0[..]
2229 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2231 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2232 fn hash<H: Hasher>(&self, s: &mut H) {
2237 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2238 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2243 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2244 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2249 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2250 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2255 impl<'tcx: 'lcx, 'lcx> Borrow<[ProjectionKind<'lcx>]>
2256 for Interned<'tcx, List<ProjectionKind<'tcx>>> {
2257 fn borrow<'a>(&'a self) -> &'a [ProjectionKind<'lcx>] {
2262 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2263 fn borrow<'a>(&'a self) -> &'a RegionKind {
2268 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2269 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2274 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2275 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2276 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2281 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2282 for Interned<'tcx, List<Predicate<'tcx>>> {
2283 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2288 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2289 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2294 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2295 for Interned<'tcx, List<Clause<'tcx>>> {
2296 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2301 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2302 for Interned<'tcx, List<Goal<'tcx>>> {
2303 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2308 macro_rules! intern_method {
2309 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2312 $keep_in_local_tcx:expr) -> $ty:ty) => {
2313 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2314 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2315 let key = ($alloc_to_key)(&v);
2317 // HACK(eddyb) Depend on flags being accurate to
2318 // determine that all contents are in the global tcx.
2319 // See comments on Lift for why we can't use that.
2320 if ($keep_in_local_tcx)(&v) {
2321 self.interners.$name.borrow_mut().intern_ref(key, || {
2322 // Make sure we don't end up with inference
2323 // types/regions in the global tcx.
2324 if self.is_global() {
2325 bug!("Attempted to intern `{:?}` which contains \
2326 inference types/regions in the global type context",
2330 Interned($alloc_method(&self.interners.arena, v))
2333 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2334 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2338 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2340 let i = unsafe { mem::transmute(i) };
2349 macro_rules! direct_interners {
2350 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2351 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2352 fn eq(&self, other: &Self) -> bool {
2357 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2359 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2360 fn hash<H: Hasher>(&self, s: &mut H) {
2368 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2370 $keep_in_local_tcx) -> $ty);)+
2374 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2375 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2378 direct_interners!('tcx,
2379 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2380 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'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.intern_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")