1 // Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! type context book-keeping
13 use dep_graph::DepGraph;
14 use dep_graph::{DepNode, DepConstructor};
15 use errors::DiagnosticBuilder;
17 use session::config::{BorrowckMode, OutputFilenames};
18 use session::config::CrateType;
20 use hir::{TraitCandidate, HirId, ItemLocalId, Node};
21 use hir::def::{Def, Export};
22 use hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
23 use hir::map as hir_map;
24 use hir::map::DefPathHash;
25 use lint::{self, Lint};
26 use ich::{StableHashingContext, NodeIdHashingMode};
27 use infer::canonical::{CanonicalVarInfo, CanonicalVarInfos};
28 use infer::outlives::free_region_map::FreeRegionMap;
29 use middle::cstore::CrateStoreDyn;
30 use middle::cstore::EncodedMetadata;
31 use middle::lang_items;
32 use middle::resolve_lifetime::{self, ObjectLifetimeDefault};
33 use middle::stability;
34 use mir::{self, Mir, interpret};
35 use mir::interpret::Allocation;
36 use ty::subst::{CanonicalSubsts, Kind, Substs, Subst};
39 use traits::{Clause, Clauses, Goal, Goals};
40 use ty::{self, Ty, TypeAndMut};
41 use ty::{TyS, TyKind, List};
42 use ty::{AdtKind, AdtDef, ClosureSubsts, GeneratorSubsts, Region, Const};
43 use ty::{PolyFnSig, InferTy, ParamTy, ProjectionTy, ExistentialPredicate, Predicate};
45 use ty::{TyVar, TyVid, IntVar, IntVid, FloatVar, FloatVid};
47 use ty::GenericParamDefKind;
48 use ty::layout::{LayoutDetails, TargetDataLayout};
53 use util::nodemap::{DefIdSet, ItemLocalMap};
54 use util::nodemap::{FxHashMap, FxHashSet};
55 use smallvec::SmallVec;
56 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
57 StableHasher, StableHasherResult,
59 use arena::{TypedArena, SyncDroplessArena};
60 use rustc_data_structures::indexed_vec::IndexVec;
61 use rustc_data_structures::sync::{self, Lrc, Lock, WorkerLocal};
63 use std::borrow::Borrow;
64 use std::cmp::Ordering;
65 use std::collections::hash_map::{self, Entry};
66 use std::hash::{Hash, Hasher};
69 use std::ops::{Deref, Bound};
73 use rustc_target::spec::abi;
74 use syntax::ast::{self, NodeId};
76 use syntax::source_map::MultiSpan;
77 use syntax::edition::Edition;
78 use syntax::feature_gate;
79 use syntax::symbol::{Symbol, keywords, InternedString};
84 pub struct AllArenas<'tcx> {
85 pub global: WorkerLocal<GlobalArenas<'tcx>>,
86 pub interner: SyncDroplessArena,
89 impl<'tcx> AllArenas<'tcx> {
90 pub fn new() -> Self {
92 global: WorkerLocal::new(|_| GlobalArenas::new()),
93 interner: SyncDroplessArena::new(),
99 pub struct GlobalArenas<'tcx> {
101 layout: TypedArena<LayoutDetails>,
104 generics: TypedArena<ty::Generics>,
105 trait_def: TypedArena<ty::TraitDef>,
106 adt_def: TypedArena<ty::AdtDef>,
107 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
108 mir: TypedArena<Mir<'tcx>>,
109 tables: TypedArena<ty::TypeckTables<'tcx>>,
111 const_allocs: TypedArena<interpret::Allocation>,
114 impl<'tcx> GlobalArenas<'tcx> {
115 pub fn new() -> GlobalArenas<'tcx> {
117 layout: TypedArena::new(),
118 generics: TypedArena::new(),
119 trait_def: TypedArena::new(),
120 adt_def: TypedArena::new(),
121 steal_mir: TypedArena::new(),
122 mir: TypedArena::new(),
123 tables: TypedArena::new(),
124 const_allocs: TypedArena::new(),
129 type InternedSet<'tcx, T> = Lock<FxHashSet<Interned<'tcx, T>>>;
131 pub struct CtxtInterners<'tcx> {
132 /// The arena that types, regions, etc are allocated from
133 arena: &'tcx SyncDroplessArena,
135 /// Specifically use a speedy hash algorithm for these hash sets,
136 /// they're accessed quite often.
137 type_: InternedSet<'tcx, TyS<'tcx>>,
138 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
139 substs: InternedSet<'tcx, Substs<'tcx>>,
140 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
141 region: InternedSet<'tcx, RegionKind>,
142 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
143 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
144 const_: InternedSet<'tcx, Const<'tcx>>,
145 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
146 goals: InternedSet<'tcx, List<Goal<'tcx>>>,
149 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
150 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
153 type_: Default::default(),
154 type_list: Default::default(),
155 substs: Default::default(),
156 region: Default::default(),
157 existential_predicates: Default::default(),
158 canonical_var_infos: Default::default(),
159 predicates: Default::default(),
160 const_: Default::default(),
161 clauses: Default::default(),
162 goals: Default::default(),
168 local: &CtxtInterners<'tcx>,
169 global: &CtxtInterners<'gcx>,
172 let flags = super::flags::FlagComputation::for_sty(&st);
174 // HACK(eddyb) Depend on flags being accurate to
175 // determine that all contents are in the global tcx.
176 // See comments on Lift for why we can't use that.
177 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
178 let mut interner = local.type_.borrow_mut();
179 if let Some(&Interned(ty)) = interner.get(&st) {
183 let ty_struct = TyS {
186 outer_exclusive_binder: flags.outer_exclusive_binder,
189 // Make sure we don't end up with inference
190 // types/regions in the global interner
191 if local as *const _ as usize == global as *const _ as usize {
192 bug!("Attempted to intern `{:?}` which contains \
193 inference types/regions in the global type context",
197 // Don't be &mut TyS.
198 let ty: Ty<'tcx> = local.arena.alloc(ty_struct);
199 interner.insert(Interned(ty));
202 let mut interner = global.type_.borrow_mut();
203 if let Some(&Interned(ty)) = interner.get(&st) {
207 let ty_struct = TyS {
210 outer_exclusive_binder: flags.outer_exclusive_binder,
213 // This is safe because all the types the ty_struct can point to
214 // already is in the global arena
215 let ty_struct: TyS<'gcx> = unsafe {
216 mem::transmute(ty_struct)
219 // Don't be &mut TyS.
220 let ty: Ty<'gcx> = global.arena.alloc(ty_struct);
221 interner.insert(Interned(ty));
227 pub struct CommonTypes<'tcx> {
247 pub re_empty: Region<'tcx>,
248 pub re_static: Region<'tcx>,
249 pub re_erased: Region<'tcx>,
252 pub struct LocalTableInContext<'a, V: 'a> {
253 local_id_root: Option<DefId>,
254 data: &'a ItemLocalMap<V>
257 /// Validate that the given HirId (respectively its `local_id` part) can be
258 /// safely used as a key in the tables of a TypeckTable. For that to be
259 /// the case, the HirId must have the same `owner` as all the other IDs in
260 /// this table (signified by `local_id_root`). Otherwise the HirId
261 /// would be in a different frame of reference and using its `local_id`
262 /// would result in lookup errors, or worse, in silently wrong data being
264 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
267 if cfg!(debug_assertions) {
268 if let Some(local_id_root) = local_id_root {
269 if hir_id.owner != local_id_root.index {
270 ty::tls::with(|tcx| {
271 let node_id = tcx.hir.hir_to_node_id(hir_id);
273 bug!("node {} with HirId::owner {:?} cannot be placed in \
274 TypeckTables with local_id_root {:?}",
275 tcx.hir.node_to_string(node_id),
276 DefId::local(hir_id.owner),
281 // We use "Null Object" TypeckTables in some of the analysis passes.
282 // These are just expected to be empty and their `local_id_root` is
283 // `None`. Therefore we cannot verify whether a given `HirId` would
284 // be a valid key for the given table. Instead we make sure that
285 // nobody tries to write to such a Null Object table.
287 bug!("access to invalid TypeckTables")
293 impl<'a, V> LocalTableInContext<'a, V> {
294 pub fn contains_key(&self, id: hir::HirId) -> bool {
295 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
296 self.data.contains_key(&id.local_id)
299 pub fn get(&self, id: hir::HirId) -> Option<&V> {
300 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
301 self.data.get(&id.local_id)
304 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
309 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
312 fn index(&self, key: hir::HirId) -> &V {
313 self.get(key).expect("LocalTableInContext: key not found")
317 pub struct LocalTableInContextMut<'a, V: 'a> {
318 local_id_root: Option<DefId>,
319 data: &'a mut ItemLocalMap<V>
322 impl<'a, V> LocalTableInContextMut<'a, V> {
323 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
324 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
325 self.data.get_mut(&id.local_id)
328 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
329 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
330 self.data.entry(id.local_id)
333 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
334 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
335 self.data.insert(id.local_id, val)
338 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
339 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
340 self.data.remove(&id.local_id)
344 #[derive(RustcEncodable, RustcDecodable, Debug)]
345 pub struct TypeckTables<'tcx> {
346 /// The HirId::owner all ItemLocalIds in this table are relative to.
347 pub local_id_root: Option<DefId>,
349 /// Resolved definitions for `<T>::X` associated paths and
350 /// method calls, including those of overloaded operators.
351 type_dependent_defs: ItemLocalMap<Def>,
353 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
354 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
355 /// about the field you also need definition of the variant to which the field
356 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
357 field_indices: ItemLocalMap<usize>,
359 /// Stores the canonicalized types provided by the user. See also
360 /// `AscribeUserType` statement in MIR.
361 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
363 /// Stores the types for various nodes in the AST. Note that this table
364 /// is not guaranteed to be populated until after typeck. See
365 /// typeck::check::fn_ctxt for details.
366 node_types: ItemLocalMap<Ty<'tcx>>,
368 /// Stores the type parameters which were substituted to obtain the type
369 /// of this node. This only applies to nodes that refer to entities
370 /// parameterized by type parameters, such as generic fns, types, or
372 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
374 /// Stores the substitutions that the user explicitly gave (if any)
375 /// attached to `id`. These will not include any inferred
376 /// values. The canonical form is used to capture things like `_`
377 /// or other unspecified values.
381 /// If the user wrote `foo.collect::<Vec<_>>()`, then the
382 /// canonical substitutions would include only `for<X> { Vec<X>
384 user_substs: ItemLocalMap<CanonicalSubsts<'tcx>>,
386 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
388 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
389 pat_binding_modes: ItemLocalMap<BindingMode>,
391 /// Stores the types which were implicitly dereferenced in pattern binding modes
392 /// for later usage in HAIR lowering. For example,
395 /// match &&Some(5i32) {
400 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
403 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
404 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
407 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
409 /// Records the reasons that we picked the kind of each closure;
410 /// not all closures are present in the map.
411 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
413 /// For each fn, records the "liberated" types of its arguments
414 /// and return type. Liberated means that all bound regions
415 /// (including late-bound regions) are replaced with free
416 /// equivalents. This table is not used in codegen (since regions
417 /// are erased there) and hence is not serialized to metadata.
418 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
420 /// For each FRU expression, record the normalized types of the fields
421 /// of the struct - this is needed because it is non-trivial to
422 /// normalize while preserving regions. This table is used only in
423 /// MIR construction and hence is not serialized to metadata.
424 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
426 /// Maps a cast expression to its kind. This is keyed on the
427 /// *from* expression of the cast, not the cast itself.
428 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
430 /// Set of trait imports actually used in the method resolution.
431 /// This is used for warning unused imports. During type
432 /// checking, this `Lrc` should not be cloned: it must have a ref-count
433 /// of 1 so that we can insert things into the set mutably.
434 pub used_trait_imports: Lrc<DefIdSet>,
436 /// If any errors occurred while type-checking this body,
437 /// this field will be set to `true`.
438 pub tainted_by_errors: bool,
440 /// Stores the free-region relationships that were deduced from
441 /// its where clauses and parameter types. These are then
442 /// read-again by borrowck.
443 pub free_region_map: FreeRegionMap<'tcx>,
445 /// All the existential types that are restricted to concrete types
447 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
450 impl<'tcx> TypeckTables<'tcx> {
451 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
454 type_dependent_defs: ItemLocalMap(),
455 field_indices: ItemLocalMap(),
456 user_provided_tys: ItemLocalMap(),
457 node_types: ItemLocalMap(),
458 node_substs: ItemLocalMap(),
459 user_substs: ItemLocalMap(),
460 adjustments: ItemLocalMap(),
461 pat_binding_modes: ItemLocalMap(),
462 pat_adjustments: ItemLocalMap(),
463 upvar_capture_map: FxHashMap(),
464 closure_kind_origins: ItemLocalMap(),
465 liberated_fn_sigs: ItemLocalMap(),
466 fru_field_types: ItemLocalMap(),
467 cast_kinds: ItemLocalMap(),
468 used_trait_imports: Lrc::new(DefIdSet()),
469 tainted_by_errors: false,
470 free_region_map: FreeRegionMap::new(),
471 concrete_existential_types: FxHashMap(),
475 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
476 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
478 hir::QPath::Resolved(_, ref path) => path.def,
479 hir::QPath::TypeRelative(..) => {
480 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
481 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
486 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
487 LocalTableInContext {
488 local_id_root: self.local_id_root,
489 data: &self.type_dependent_defs
493 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
494 LocalTableInContextMut {
495 local_id_root: self.local_id_root,
496 data: &mut self.type_dependent_defs
500 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
501 LocalTableInContext {
502 local_id_root: self.local_id_root,
503 data: &self.field_indices
507 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
508 LocalTableInContextMut {
509 local_id_root: self.local_id_root,
510 data: &mut self.field_indices
514 pub fn user_provided_tys(&self) -> LocalTableInContext<'_, CanonicalTy<'tcx>> {
515 LocalTableInContext {
516 local_id_root: self.local_id_root,
517 data: &self.user_provided_tys
521 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalTy<'tcx>> {
522 LocalTableInContextMut {
523 local_id_root: self.local_id_root,
524 data: &mut self.user_provided_tys
528 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
529 LocalTableInContext {
530 local_id_root: self.local_id_root,
531 data: &self.node_types
535 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
536 LocalTableInContextMut {
537 local_id_root: self.local_id_root,
538 data: &mut self.node_types
542 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
543 self.node_id_to_type_opt(id).unwrap_or_else(||
544 bug!("node_id_to_type: no type for node `{}`",
546 let id = tcx.hir.hir_to_node_id(id);
547 tcx.hir.node_to_string(id)
552 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
553 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
554 self.node_types.get(&id.local_id).cloned()
557 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
558 LocalTableInContextMut {
559 local_id_root: self.local_id_root,
560 data: &mut self.node_substs
564 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
565 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
566 self.node_substs.get(&id.local_id).cloned().unwrap_or(Substs::empty())
569 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
570 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
571 self.node_substs.get(&id.local_id).cloned()
574 pub fn user_substs_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalSubsts<'tcx>> {
575 LocalTableInContextMut {
576 local_id_root: self.local_id_root,
577 data: &mut self.user_substs
581 pub fn user_substs(&self, id: hir::HirId) -> Option<CanonicalSubsts<'tcx>> {
582 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
583 self.user_substs.get(&id.local_id).cloned()
586 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
587 // doesn't provide type parameter substitutions.
588 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
589 self.node_id_to_type(pat.hir_id)
592 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
593 self.node_id_to_type_opt(pat.hir_id)
596 // Returns the type of an expression as a monotype.
598 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
599 // some cases, we insert `Adjustment` annotations such as auto-deref or
600 // auto-ref. The type returned by this function does not consider such
601 // adjustments. See `expr_ty_adjusted()` instead.
603 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
604 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
605 // instead of "fn(ty) -> T with T = isize".
606 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
607 self.node_id_to_type(expr.hir_id)
610 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
611 self.node_id_to_type_opt(expr.hir_id)
614 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
615 LocalTableInContext {
616 local_id_root: self.local_id_root,
617 data: &self.adjustments
621 pub fn adjustments_mut(&mut self)
622 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
623 LocalTableInContextMut {
624 local_id_root: self.local_id_root,
625 data: &mut self.adjustments
629 pub fn expr_adjustments(&self, expr: &hir::Expr)
630 -> &[ty::adjustment::Adjustment<'tcx>] {
631 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
632 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
635 /// Returns the type of `expr`, considering any `Adjustment`
636 /// entry recorded for that expression.
637 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
638 self.expr_adjustments(expr)
640 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
643 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
644 self.expr_adjustments(expr)
646 .map(|adj| adj.target)
647 .or_else(|| self.expr_ty_opt(expr))
650 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
651 // Only paths and method calls/overloaded operators have
652 // entries in type_dependent_defs, ignore the former here.
653 if let hir::ExprKind::Path(_) = expr.node {
657 match self.type_dependent_defs().get(expr.hir_id) {
658 Some(&Def::Method(_)) => true,
663 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
664 LocalTableInContext {
665 local_id_root: self.local_id_root,
666 data: &self.pat_binding_modes
670 pub fn pat_binding_modes_mut(&mut self)
671 -> LocalTableInContextMut<'_, BindingMode> {
672 LocalTableInContextMut {
673 local_id_root: self.local_id_root,
674 data: &mut self.pat_binding_modes
678 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
679 LocalTableInContext {
680 local_id_root: self.local_id_root,
681 data: &self.pat_adjustments,
685 pub fn pat_adjustments_mut(&mut self)
686 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
687 LocalTableInContextMut {
688 local_id_root: self.local_id_root,
689 data: &mut self.pat_adjustments,
693 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
694 self.upvar_capture_map[&upvar_id]
697 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
698 LocalTableInContext {
699 local_id_root: self.local_id_root,
700 data: &self.closure_kind_origins
704 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
705 LocalTableInContextMut {
706 local_id_root: self.local_id_root,
707 data: &mut self.closure_kind_origins
711 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
712 LocalTableInContext {
713 local_id_root: self.local_id_root,
714 data: &self.liberated_fn_sigs
718 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
719 LocalTableInContextMut {
720 local_id_root: self.local_id_root,
721 data: &mut self.liberated_fn_sigs
725 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
726 LocalTableInContext {
727 local_id_root: self.local_id_root,
728 data: &self.fru_field_types
732 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
733 LocalTableInContextMut {
734 local_id_root: self.local_id_root,
735 data: &mut self.fru_field_types
739 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
740 LocalTableInContext {
741 local_id_root: self.local_id_root,
742 data: &self.cast_kinds
746 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
747 LocalTableInContextMut {
748 local_id_root: self.local_id_root,
749 data: &mut self.cast_kinds
754 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
755 fn hash_stable<W: StableHasherResult>(&self,
756 hcx: &mut StableHashingContext<'a>,
757 hasher: &mut StableHasher<W>) {
758 let ty::TypeckTables {
760 ref type_dependent_defs,
762 ref user_provided_tys,
767 ref pat_binding_modes,
769 ref upvar_capture_map,
770 ref closure_kind_origins,
771 ref liberated_fn_sigs,
776 ref used_trait_imports,
779 ref concrete_existential_types,
782 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
783 type_dependent_defs.hash_stable(hcx, hasher);
784 field_indices.hash_stable(hcx, hasher);
785 user_provided_tys.hash_stable(hcx, hasher);
786 node_types.hash_stable(hcx, hasher);
787 node_substs.hash_stable(hcx, hasher);
788 user_substs.hash_stable(hcx, hasher);
789 adjustments.hash_stable(hcx, hasher);
790 pat_binding_modes.hash_stable(hcx, hasher);
791 pat_adjustments.hash_stable(hcx, hasher);
792 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
799 local_id_root.expect("trying to hash invalid TypeckTables");
801 let var_owner_def_id = DefId {
802 krate: local_id_root.krate,
805 let closure_def_id = DefId {
806 krate: local_id_root.krate,
807 index: closure_expr_id.to_def_id().index,
809 (hcx.def_path_hash(var_owner_def_id),
811 hcx.def_path_hash(closure_def_id))
814 closure_kind_origins.hash_stable(hcx, hasher);
815 liberated_fn_sigs.hash_stable(hcx, hasher);
816 fru_field_types.hash_stable(hcx, hasher);
817 cast_kinds.hash_stable(hcx, hasher);
818 used_trait_imports.hash_stable(hcx, hasher);
819 tainted_by_errors.hash_stable(hcx, hasher);
820 free_region_map.hash_stable(hcx, hasher);
821 concrete_existential_types.hash_stable(hcx, hasher);
826 impl<'tcx> CommonTypes<'tcx> {
827 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
828 // Ensure our type representation does not grow
829 #[cfg(target_pointer_width = "64")]
830 static_assert!(ASSERT_TY_KIND: ::std::mem::size_of::<ty::TyKind<'_>>() <= 24);
831 #[cfg(target_pointer_width = "64")]
832 static_assert!(ASSERT_TYS: ::std::mem::size_of::<ty::TyS<'_>>() <= 32);
834 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
835 let mk_region = |r| {
836 if let Some(r) = interners.region.borrow().get(&r) {
839 let r = interners.arena.alloc(r);
840 interners.region.borrow_mut().insert(Interned(r));
848 isize: mk(Int(ast::IntTy::Isize)),
849 i8: mk(Int(ast::IntTy::I8)),
850 i16: mk(Int(ast::IntTy::I16)),
851 i32: mk(Int(ast::IntTy::I32)),
852 i64: mk(Int(ast::IntTy::I64)),
853 i128: mk(Int(ast::IntTy::I128)),
854 usize: mk(Uint(ast::UintTy::Usize)),
855 u8: mk(Uint(ast::UintTy::U8)),
856 u16: mk(Uint(ast::UintTy::U16)),
857 u32: mk(Uint(ast::UintTy::U32)),
858 u64: mk(Uint(ast::UintTy::U64)),
859 u128: mk(Uint(ast::UintTy::U128)),
860 f32: mk(Float(ast::FloatTy::F32)),
861 f64: mk(Float(ast::FloatTy::F64)),
863 re_empty: mk_region(RegionKind::ReEmpty),
864 re_static: mk_region(RegionKind::ReStatic),
865 re_erased: mk_region(RegionKind::ReErased),
870 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
873 pub struct FreeRegionInfo {
874 // def id corresponding to FreeRegion
876 // the bound region corresponding to FreeRegion
877 pub boundregion: ty::BoundRegion,
878 // checks if bound region is in Impl Item
879 pub is_impl_item: bool,
882 /// The central data structure of the compiler. It stores references
883 /// to the various **arenas** and also houses the results of the
884 /// various **compiler queries** that have been performed. See the
885 /// [rustc guide] for more details.
887 /// [rustc guide]: https://rust-lang-nursery.github.io/rustc-guide/ty.html
888 #[derive(Copy, Clone)]
889 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
890 gcx: &'a GlobalCtxt<'gcx>,
891 interners: &'a CtxtInterners<'tcx>
894 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
895 type Target = &'a GlobalCtxt<'gcx>;
896 fn deref(&self) -> &Self::Target {
901 pub struct GlobalCtxt<'tcx> {
902 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
903 global_interners: CtxtInterners<'tcx>,
905 cstore: &'tcx CrateStoreDyn,
907 pub sess: &'tcx Session,
909 pub dep_graph: DepGraph,
911 /// Common types, pre-interned for your convenience.
912 pub types: CommonTypes<'tcx>,
914 /// Map indicating what traits are in scope for places where this
915 /// is relevant; generated by resolve.
916 trait_map: FxHashMap<DefIndex,
917 Lrc<FxHashMap<ItemLocalId,
918 Lrc<StableVec<TraitCandidate>>>>>,
920 /// Export map produced by name resolution.
921 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
923 pub hir: hir_map::Map<'tcx>,
925 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
926 /// as well as all upstream crates. Only populated in incremental mode.
927 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
929 pub(crate) queries: query::Queries<'tcx>,
931 // Records the free variables referenced by every closure
932 // expression. Do not track deps for this, just recompute it from
933 // scratch every time.
934 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
936 maybe_unused_trait_imports: FxHashSet<DefId>,
938 maybe_unused_extern_crates: Vec<(DefId, Span)>,
940 // Internal cache for metadata decoding. No need to track deps on this.
941 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
943 /// Caches the results of trait selection. This cache is used
944 /// for things that do not have to do with the parameters in scope.
945 pub selection_cache: traits::SelectionCache<'tcx>,
947 /// Caches the results of trait evaluation. This cache is used
948 /// for things that do not have to do with the parameters in scope.
949 /// Merge this with `selection_cache`?
950 pub evaluation_cache: traits::EvaluationCache<'tcx>,
952 /// The definite name of the current crate after taking into account
953 /// attributes, commandline parameters, etc.
954 pub crate_name: Symbol,
956 /// Data layout specification for the current target.
957 pub data_layout: TargetDataLayout,
959 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
961 /// Stores the value of constants (and deduplicates the actual memory)
962 allocation_interner: Lock<FxHashSet<&'tcx Allocation>>,
964 pub alloc_map: Lock<interpret::AllocMap<'tcx, &'tcx Allocation>>,
966 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
968 /// A general purpose channel to throw data out the back towards LLVM worker
971 /// This is intended to only get used during the codegen phase of the compiler
972 /// when satisfying the query for a particular codegen unit. Internally in
973 /// the query it'll send data along this channel to get processed later.
974 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
976 output_filenames: Arc<OutputFilenames>,
979 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
980 /// Get the global TyCtxt.
982 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
985 interners: &self.gcx.global_interners,
989 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
990 self.global_arenas.generics.alloc(generics)
993 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
994 self.global_arenas.steal_mir.alloc(Steal::new(mir))
997 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
998 self.global_arenas.mir.alloc(mir)
1001 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1002 self.global_arenas.tables.alloc(tables)
1005 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1006 self.global_arenas.trait_def.alloc(def)
1009 pub fn alloc_adt_def(self,
1012 variants: Vec<ty::VariantDef>,
1014 -> &'gcx ty::AdtDef {
1015 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1016 self.global_arenas.adt_def.alloc(def)
1019 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1020 if bytes.is_empty() {
1023 self.global_interners.arena.alloc_slice(bytes)
1027 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1028 -> &'tcx [&'tcx ty::Const<'tcx>] {
1029 if values.is_empty() {
1032 self.interners.arena.alloc_slice(values)
1036 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1037 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1038 if values.is_empty() {
1041 self.interners.arena.alloc_slice(values)
1045 pub fn intern_const_alloc(
1048 ) -> &'gcx Allocation {
1049 let allocs = &mut self.allocation_interner.borrow_mut();
1050 if let Some(alloc) = allocs.get(&alloc) {
1054 let interned = self.global_arenas.const_allocs.alloc(alloc);
1055 if let Some(prev) = allocs.replace(interned) { // insert into interner
1056 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1061 /// Allocates a byte or string literal for `mir::interpret`, read-only
1062 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1063 // create an allocation that just contains these bytes
1064 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1065 let alloc = self.intern_const_alloc(alloc);
1066 self.alloc_map.lock().allocate(alloc)
1069 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1070 let mut stability_interner = self.stability_interner.borrow_mut();
1071 if let Some(st) = stability_interner.get(&stab) {
1075 let interned = self.global_interners.arena.alloc(stab);
1076 if let Some(prev) = stability_interner.replace(interned) {
1077 bug!("Tried to overwrite interned Stability: {:?}", prev)
1082 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1083 let mut layout_interner = self.layout_interner.borrow_mut();
1084 if let Some(layout) = layout_interner.get(&layout) {
1088 let interned = self.global_arenas.layout.alloc(layout);
1089 if let Some(prev) = layout_interner.replace(interned) {
1090 bug!("Tried to overwrite interned Layout: {:?}", prev)
1095 /// Returns a range of the start/end indices specified with the
1096 /// `rustc_layout_scalar_valid_range` attribute.
1097 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1098 let attrs = self.get_attrs(def_id);
1100 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1102 None => return Bound::Unbounded,
1104 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1105 match meta.literal().expect("attribute takes lit").node {
1106 ast::LitKind::Int(a, _) => return Bound::Included(a),
1107 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1110 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1112 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1115 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1116 value.lift_to_tcx(self)
1119 /// Like lift, but only tries in the global tcx.
1120 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1121 value.lift_to_tcx(self.global_tcx())
1124 /// Returns true if self is the same as self.global_tcx().
1125 fn is_global(self) -> bool {
1126 let local = self.interners as *const _;
1127 let global = &self.global_interners as *const _;
1128 local as usize == global as usize
1131 /// Create a type context and call the closure with a `TyCtxt` reference
1132 /// to the context. The closure enforces that the type context and any interned
1133 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1134 /// reference to the context, to allow formatting values that need it.
1135 pub fn create_and_enter<F, R>(s: &'tcx Session,
1136 cstore: &'tcx CrateStoreDyn,
1137 local_providers: ty::query::Providers<'tcx>,
1138 extern_providers: ty::query::Providers<'tcx>,
1139 arenas: &'tcx AllArenas<'tcx>,
1140 resolutions: ty::Resolutions,
1141 hir: hir_map::Map<'tcx>,
1142 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1144 tx: mpsc::Sender<Box<dyn Any + Send>>,
1145 output_filenames: &OutputFilenames,
1147 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1149 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1152 let interners = CtxtInterners::new(&arenas.interner);
1153 let common_types = CommonTypes::new(&interners);
1154 let dep_graph = hir.dep_graph.clone();
1155 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1156 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1157 providers[LOCAL_CRATE] = local_providers;
1159 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1160 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1163 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1166 let def_path_tables = || {
1167 upstream_def_path_tables
1169 .map(|&(cnum, ref rc)| (cnum, &**rc))
1170 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1173 // Precompute the capacity of the hashmap so we don't have to
1174 // re-allocate when populating it.
1175 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1177 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1179 ::std::default::Default::default()
1182 for (cnum, def_path_table) in def_path_tables() {
1183 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1191 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap();
1192 for (k, v) in resolutions.trait_map {
1193 let hir_id = hir.node_to_hir_id(k);
1194 let map = trait_map.entry(hir_id.owner).or_default();
1195 Lrc::get_mut(map).unwrap()
1196 .insert(hir_id.local_id,
1197 Lrc::new(StableVec::new(v)));
1200 let gcx = &GlobalCtxt {
1203 global_arenas: &arenas.global,
1204 global_interners: interners,
1205 dep_graph: dep_graph.clone(),
1206 types: common_types,
1208 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1211 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1212 (hir.local_def_id(k), Lrc::new(v))
1214 maybe_unused_trait_imports:
1215 resolutions.maybe_unused_trait_imports
1217 .map(|id| hir.local_def_id(id))
1219 maybe_unused_extern_crates:
1220 resolutions.maybe_unused_extern_crates
1222 .map(|(id, sp)| (hir.local_def_id(id), sp))
1225 def_path_hash_to_def_id,
1226 queries: query::Queries::new(
1229 on_disk_query_result_cache,
1231 rcache: Lock::new(FxHashMap()),
1232 selection_cache: traits::SelectionCache::new(),
1233 evaluation_cache: traits::EvaluationCache::new(),
1234 crate_name: Symbol::intern(crate_name),
1236 layout_interner: Lock::new(FxHashSet()),
1237 stability_interner: Lock::new(FxHashSet()),
1238 allocation_interner: Lock::new(FxHashSet()),
1239 alloc_map: Lock::new(interpret::AllocMap::new()),
1240 tx_to_llvm_workers: Lock::new(tx),
1241 output_filenames: Arc::new(output_filenames.clone()),
1244 sync::assert_send_val(&gcx);
1246 tls::enter_global(gcx, f)
1249 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1250 let cname = self.crate_name(LOCAL_CRATE).as_str();
1251 self.sess.consider_optimizing(&cname, msg)
1254 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1255 self.get_lib_features(LOCAL_CRATE)
1258 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1259 self.get_lang_items(LOCAL_CRATE)
1262 /// Due to missing llvm support for lowering 128 bit math to software emulation
1263 /// (on some targets), the lowering can be done in MIR.
1265 /// This function only exists until said support is implemented.
1266 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1267 let items = self.lang_items();
1268 let def_id = Some(def_id);
1269 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1270 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1271 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1272 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1273 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1274 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1275 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1276 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1277 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1278 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1279 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1280 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1281 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1282 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1283 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1284 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1285 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1286 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1287 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1288 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1289 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1290 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1291 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1292 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1296 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1297 self.stability_index(LOCAL_CRATE)
1300 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1301 self.all_crate_nums(LOCAL_CRATE)
1304 pub fn features(self) -> Lrc<feature_gate::Features> {
1305 self.features_query(LOCAL_CRATE)
1308 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1310 self.hir.def_key(id)
1312 self.cstore.def_key(id)
1316 /// Convert a `DefId` into its fully expanded `DefPath` (every
1317 /// `DefId` is really just an interned def-path).
1319 /// Note that if `id` is not local to this crate, the result will
1320 /// be a non-local `DefPath`.
1321 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1323 self.hir.def_path(id)
1325 self.cstore.def_path(id)
1330 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1331 if def_id.is_local() {
1332 self.hir.definitions().def_path_hash(def_id.index)
1334 self.cstore.def_path_hash(def_id)
1338 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1339 // We are explicitly not going through queries here in order to get
1340 // crate name and disambiguator since this code is called from debug!()
1341 // statements within the query system and we'd run into endless
1342 // recursion otherwise.
1343 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1344 (self.crate_name.clone(),
1345 self.sess.local_crate_disambiguator())
1347 (self.cstore.crate_name_untracked(def_id.krate),
1348 self.cstore.crate_disambiguator_untracked(def_id.krate))
1353 // Don't print the whole crate disambiguator. That's just
1354 // annoying in debug output.
1355 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1356 self.def_path(def_id).to_string_no_crate())
1359 pub fn metadata_encoding_version(self) -> Vec<u8> {
1360 self.cstore.metadata_encoding_version().to_vec()
1363 // Note that this is *untracked* and should only be used within the query
1364 // system if the result is otherwise tracked through queries
1365 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1366 self.cstore.crate_data_as_rc_any(cnum)
1369 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1370 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1372 StableHashingContext::new(self.sess,
1374 self.hir.definitions(),
1378 // This method makes sure that we have a DepNode and a Fingerprint for
1379 // every upstream crate. It needs to be called once right after the tcx is
1381 // With full-fledged red/green, the method will probably become unnecessary
1382 // as this will be done on-demand.
1383 pub fn allocate_metadata_dep_nodes(self) {
1384 // We cannot use the query versions of crates() and crate_hash(), since
1385 // those would need the DepNodes that we are allocating here.
1386 for cnum in self.cstore.crates_untracked() {
1387 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1388 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1389 self.dep_graph.with_task(dep_node,
1392 |_, x| x // No transformation needed
1397 // This method exercises the `in_scope_traits_map` query for all possible
1398 // values so that we have their fingerprints available in the DepGraph.
1399 // This is only required as long as we still use the old dependency tracking
1400 // which needs to have the fingerprints of all input nodes beforehand.
1401 pub fn precompute_in_scope_traits_hashes(self) {
1402 for &def_index in self.trait_map.keys() {
1403 self.in_scope_traits_map(def_index);
1407 pub fn serialize_query_result_cache<E>(self,
1409 -> Result<(), E::Error>
1410 where E: ty::codec::TyEncoder
1412 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1415 /// This checks whether one is allowed to have pattern bindings
1416 /// that bind-by-move on a match arm that has a guard, e.g.:
1419 /// match foo { A(inner) if { /* something */ } => ..., ... }
1422 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1423 /// because that method has a narrower effect that can be toggled
1424 /// off via a separate `-Z` flag, at least for the short term.
1425 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1426 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1429 /// If true, we should use a naive AST walk to determine if match
1430 /// guard could perform bad mutations (or mutable-borrows).
1431 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1432 // If someone requests the feature, then be a little more
1433 // careful and ensure that MIR-borrowck is enabled (which can
1434 // happen via edition selection, via `feature(nll)`, or via an
1435 // appropriate `-Z` flag) before disabling the mutation check.
1436 if self.allow_bind_by_move_patterns_with_guards() {
1443 /// If true, we should use the AST-based borrowck (we may *also* use
1444 /// the MIR-based borrowck).
1445 pub fn use_ast_borrowck(self) -> bool {
1446 self.borrowck_mode().use_ast()
1449 /// If true, we should use the MIR-based borrowck (we may *also* use
1450 /// the AST-based borrowck).
1451 pub fn use_mir_borrowck(self) -> bool {
1452 self.borrowck_mode().use_mir()
1455 /// If true, we should use the MIR-based borrow check, but also
1456 /// fall back on the AST borrow check if the MIR-based one errors.
1457 pub fn migrate_borrowck(self) -> bool {
1458 self.borrowck_mode().migrate()
1461 /// If true, make MIR codegen for `match` emit a temp that holds a
1462 /// borrow of the input to the match expression.
1463 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1464 self.emit_read_for_match()
1467 /// If true, make MIR codegen for `match` emit FakeRead
1468 /// statements (which simulate the maximal effect of executing the
1469 /// patterns in a match arm).
1470 pub fn emit_read_for_match(&self) -> bool {
1471 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1474 /// If true, pattern variables for use in guards on match arms
1475 /// will be bound as references to the data, and occurrences of
1476 /// those variables in the guard expression will implicitly
1477 /// dereference those bindings. (See rust-lang/rust#27282.)
1478 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1479 self.borrowck_mode().use_mir()
1482 /// If true, we should enable two-phase borrows checks. This is
1483 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1484 /// or by opting into an edition after 2015.
1485 pub fn two_phase_borrows(self) -> bool {
1486 if self.features().nll || self.sess.opts.debugging_opts.two_phase_borrows {
1490 match self.sess.edition() {
1491 Edition::Edition2015 => false,
1492 Edition::Edition2018 => true,
1497 /// What mode(s) of borrowck should we run? AST? MIR? both?
1498 /// (Also considers the `#![feature(nll)]` setting.)
1499 pub fn borrowck_mode(&self) -> BorrowckMode {
1500 // Here are the main constraints we need to deal with:
1502 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1503 // synonymous with no `-Z borrowck=...` flag at all.
1504 // (This is arguably a historical accident.)
1506 // 2. `BorrowckMode::Migrate` is the limited migration to
1507 // NLL that we are deploying with the 2018 edition.
1509 // 3. We want to allow developers on the Nightly channel
1510 // to opt back into the "hard error" mode for NLL,
1511 // (which they can do via specifying `#![feature(nll)]`
1512 // explicitly in their crate).
1514 // So, this precedence list is how pnkfelix chose to work with
1515 // the above constraints:
1517 // * `#![feature(nll)]` *always* means use NLL with hard
1518 // errors. (To simplify the code here, it now even overrides
1519 // a user's attempt to specify `-Z borrowck=compare`, which
1520 // we arguably do not need anymore and should remove.)
1522 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1523 // if `borrowck=ast` was specified), then use the default
1524 // as required by the edition.
1526 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1528 if self.features().nll { return BorrowckMode::Mir; }
1530 match self.sess.opts.borrowck_mode {
1531 mode @ BorrowckMode::Mir |
1532 mode @ BorrowckMode::Compare |
1533 mode @ BorrowckMode::Migrate => mode,
1535 BorrowckMode::Ast => match self.sess.edition() {
1536 Edition::Edition2015 => BorrowckMode::Ast,
1537 Edition::Edition2018 => BorrowckMode::Migrate,
1539 // For now, future editions mean Migrate. (But it
1540 // would make a lot of sense for it to be changed to
1541 // `BorrowckMode::Mir`, depending on how we plan to
1542 // time the forcing of full migration to NLL.)
1543 _ => BorrowckMode::Migrate,
1548 /// Should we emit EndRegion MIR statements? These are consumed by
1549 /// MIR borrowck, but not when NLL is used. They are also consumed
1550 /// by the validation stuff.
1551 pub fn emit_end_regions(self) -> bool {
1552 self.sess.opts.debugging_opts.emit_end_regions ||
1553 self.sess.opts.debugging_opts.mir_emit_validate > 0 ||
1554 self.use_mir_borrowck()
1558 pub fn local_crate_exports_generics(self) -> bool {
1559 debug_assert!(self.sess.opts.share_generics());
1561 self.sess.crate_types.borrow().iter().any(|crate_type| {
1563 CrateType::Executable |
1564 CrateType::Staticlib |
1565 CrateType::ProcMacro |
1566 CrateType::Cdylib => false,
1568 CrateType::Dylib => true,
1573 // This method returns the DefId and the BoundRegion corresponding to the given region.
1574 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1575 let (suitable_region_binding_scope, bound_region) = match *region {
1576 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1577 ty::ReEarlyBound(ref ebr) => (
1578 self.parent_def_id(ebr.def_id).unwrap(),
1579 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1581 _ => return None, // not a free region
1584 let node_id = self.hir
1585 .as_local_node_id(suitable_region_binding_scope)
1587 let is_impl_item = match self.hir.find(node_id) {
1588 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1589 Some(Node::ImplItem(..)) => {
1590 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1595 return Some(FreeRegionInfo {
1596 def_id: suitable_region_binding_scope,
1597 boundregion: bound_region,
1598 is_impl_item: is_impl_item,
1602 pub fn return_type_impl_trait(
1604 scope_def_id: DefId,
1605 ) -> Option<Ty<'tcx>> {
1606 let ret_ty = self.type_of(scope_def_id);
1608 ty::FnDef(_, _) => {
1609 let sig = ret_ty.fn_sig(*self);
1610 let output = self.erase_late_bound_regions(&sig.output());
1611 if output.is_impl_trait() {
1621 // Here we check if the bound region is in Impl Item.
1622 pub fn is_bound_region_in_impl_item(
1624 suitable_region_binding_scope: DefId,
1626 let container_id = self.associated_item(suitable_region_binding_scope)
1629 if self.impl_trait_ref(container_id).is_some() {
1630 // For now, we do not try to target impls of traits. This is
1631 // because this message is going to suggest that the user
1632 // change the fn signature, but they may not be free to do so,
1633 // since the signature must match the trait.
1635 // FIXME(#42706) -- in some cases, we could do better here.
1642 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1643 pub fn encode_metadata(self)
1646 self.cstore.encode_metadata(self)
1650 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1651 /// Call the closure with a local `TyCtxt` using the given arena.
1652 pub fn enter_local<F, R>(
1654 arena: &'tcx SyncDroplessArena,
1658 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1660 let interners = CtxtInterners::new(arena);
1663 interners: &interners,
1665 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1666 let new_icx = ty::tls::ImplicitCtxt {
1668 query: icx.query.clone(),
1669 layout_depth: icx.layout_depth,
1672 ty::tls::enter_context(&new_icx, |new_icx| {
1679 /// A trait implemented for all X<'a> types which can be safely and
1680 /// efficiently converted to X<'tcx> as long as they are part of the
1681 /// provided TyCtxt<'tcx>.
1682 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1683 /// by looking them up in their respective interners.
1685 /// However, this is still not the best implementation as it does
1686 /// need to compare the components, even for interned values.
1687 /// It would be more efficient if TypedArena provided a way to
1688 /// determine whether the address is in the allocated range.
1690 /// None is returned if the value or one of the components is not part
1691 /// of the provided context.
1692 /// For Ty, None can be returned if either the type interner doesn't
1693 /// contain the TyKind key or if the address of the interned
1694 /// pointer differs. The latter case is possible if a primitive type,
1695 /// e.g. `()` or `u8`, was interned in a different context.
1696 pub trait Lift<'tcx>: fmt::Debug {
1697 type Lifted: fmt::Debug + 'tcx;
1698 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1701 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1702 type Lifted = Ty<'tcx>;
1703 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1704 if tcx.interners.arena.in_arena(*self as *const _) {
1705 return Some(unsafe { mem::transmute(*self) });
1707 // Also try in the global tcx if we're not that.
1708 if !tcx.is_global() {
1709 self.lift_to_tcx(tcx.global_tcx())
1716 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1717 type Lifted = Region<'tcx>;
1718 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1719 if tcx.interners.arena.in_arena(*self as *const _) {
1720 return Some(unsafe { mem::transmute(*self) });
1722 // Also try in the global tcx if we're not that.
1723 if !tcx.is_global() {
1724 self.lift_to_tcx(tcx.global_tcx())
1731 impl<'a, 'tcx> Lift<'tcx> for &'a Goal<'a> {
1732 type Lifted = &'tcx Goal<'tcx>;
1733 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Goal<'tcx>> {
1734 if tcx.interners.arena.in_arena(*self as *const _) {
1735 return Some(unsafe { mem::transmute(*self) });
1737 // Also try in the global tcx if we're not that.
1738 if !tcx.is_global() {
1739 self.lift_to_tcx(tcx.global_tcx())
1746 impl<'a, 'tcx> Lift<'tcx> for &'a List<Goal<'a>> {
1747 type Lifted = &'tcx List<Goal<'tcx>>;
1748 fn lift_to_tcx<'b, 'gcx>(
1750 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1751 ) -> Option<&'tcx List<Goal<'tcx>>> {
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())
1764 impl<'a, 'tcx> Lift<'tcx> for &'a List<Clause<'a>> {
1765 type Lifted = &'tcx List<Clause<'tcx>>;
1766 fn lift_to_tcx<'b, 'gcx>(
1768 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1769 ) -> Option<&'tcx List<Clause<'tcx>>> {
1770 if tcx.interners.arena.in_arena(*self as *const _) {
1771 return Some(unsafe { mem::transmute(*self) });
1773 // Also try in the global tcx if we're not that.
1774 if !tcx.is_global() {
1775 self.lift_to_tcx(tcx.global_tcx())
1782 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1783 type Lifted = &'tcx Const<'tcx>;
1784 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1785 if tcx.interners.arena.in_arena(*self as *const _) {
1786 return Some(unsafe { mem::transmute(*self) });
1788 // Also try in the global tcx if we're not that.
1789 if !tcx.is_global() {
1790 self.lift_to_tcx(tcx.global_tcx())
1797 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1798 type Lifted = &'tcx Substs<'tcx>;
1799 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1800 if self.len() == 0 {
1801 return Some(List::empty());
1803 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1804 return Some(unsafe { mem::transmute(*self) });
1806 // Also try in the global tcx if we're not that.
1807 if !tcx.is_global() {
1808 self.lift_to_tcx(tcx.global_tcx())
1815 impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>> {
1816 type Lifted = &'tcx List<Ty<'tcx>>;
1817 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1818 -> Option<&'tcx List<Ty<'tcx>>> {
1819 if self.len() == 0 {
1820 return Some(List::empty());
1822 if tcx.interners.arena.in_arena(*self as *const _) {
1823 return Some(unsafe { mem::transmute(*self) });
1825 // Also try in the global tcx if we're not that.
1826 if !tcx.is_global() {
1827 self.lift_to_tcx(tcx.global_tcx())
1834 impl<'a, 'tcx> Lift<'tcx> for &'a List<ExistentialPredicate<'a>> {
1835 type Lifted = &'tcx List<ExistentialPredicate<'tcx>>;
1836 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1837 -> Option<&'tcx List<ExistentialPredicate<'tcx>>> {
1838 if self.is_empty() {
1839 return Some(List::empty());
1841 if tcx.interners.arena.in_arena(*self as *const _) {
1842 return Some(unsafe { mem::transmute(*self) });
1844 // Also try in the global tcx if we're not that.
1845 if !tcx.is_global() {
1846 self.lift_to_tcx(tcx.global_tcx())
1853 impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>> {
1854 type Lifted = &'tcx List<Predicate<'tcx>>;
1855 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1856 -> Option<&'tcx List<Predicate<'tcx>>> {
1857 if self.is_empty() {
1858 return Some(List::empty());
1860 if tcx.interners.arena.in_arena(*self as *const _) {
1861 return Some(unsafe { mem::transmute(*self) });
1863 // Also try in the global tcx if we're not that.
1864 if !tcx.is_global() {
1865 self.lift_to_tcx(tcx.global_tcx())
1872 impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo> {
1873 type Lifted = &'tcx List<CanonicalVarInfo>;
1874 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1875 if self.len() == 0 {
1876 return Some(List::empty());
1878 if tcx.interners.arena.in_arena(*self as *const _) {
1879 return Some(unsafe { mem::transmute(*self) });
1881 // Also try in the global tcx if we're not that.
1882 if !tcx.is_global() {
1883 self.lift_to_tcx(tcx.global_tcx())
1891 use super::{GlobalCtxt, TyCtxt};
1897 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1898 use rustc_data_structures::OnDrop;
1899 use rustc_data_structures::sync::{self, Lrc, Lock};
1900 use dep_graph::OpenTask;
1902 #[cfg(not(parallel_queries))]
1903 use std::cell::Cell;
1905 #[cfg(parallel_queries)]
1908 /// This is the implicit state of rustc. It contains the current
1909 /// TyCtxt and query. It is updated when creating a local interner or
1910 /// executing a new query. Whenever there's a TyCtxt value available
1911 /// you should also have access to an ImplicitCtxt through the functions
1914 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1915 /// The current TyCtxt. Initially created by `enter_global` and updated
1916 /// by `enter_local` with a new local interner
1917 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1919 /// The current query job, if any. This is updated by start_job in
1920 /// ty::query::plumbing when executing a query
1921 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1923 /// Used to prevent layout from recursing too deeply.
1924 pub layout_depth: usize,
1926 /// The current dep graph task. This is used to add dependencies to queries
1927 /// when executing them
1928 pub task: &'a OpenTask,
1931 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1932 /// to `value` during the call to `f`. It is restored to its previous value after.
1933 /// This is used to set the pointer to the new ImplicitCtxt.
1934 #[cfg(parallel_queries)]
1935 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1936 rayon_core::tlv::with(value, f)
1939 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1940 /// This is used to get the pointer to the current ImplicitCtxt.
1941 #[cfg(parallel_queries)]
1942 fn get_tlv() -> usize {
1943 rayon_core::tlv::get()
1946 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1947 #[cfg(not(parallel_queries))]
1948 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1950 /// Sets TLV to `value` during the call to `f`.
1951 /// It is restored to its previous value after.
1952 /// This is used to set the pointer to the new ImplicitCtxt.
1953 #[cfg(not(parallel_queries))]
1954 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1955 let old = get_tlv();
1956 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1957 TLV.with(|tlv| tlv.set(value));
1961 /// This is used to get the pointer to the current ImplicitCtxt.
1962 #[cfg(not(parallel_queries))]
1963 fn get_tlv() -> usize {
1964 TLV.with(|tlv| tlv.get())
1967 /// This is a callback from libsyntax as it cannot access the implicit state
1968 /// in librustc otherwise
1969 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1971 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1975 /// This is a callback from libsyntax as it cannot access the implicit state
1976 /// in librustc otherwise. It is used to when diagnostic messages are
1977 /// emitted and stores them in the current query, if there is one.
1978 fn track_diagnostic(diagnostic: &Diagnostic) {
1979 with_context_opt(|icx| {
1980 if let Some(icx) = icx {
1981 if let Some(ref query) = icx.query {
1982 query.diagnostics.lock().push(diagnostic.clone());
1988 /// Sets up the callbacks from libsyntax on the current thread
1989 pub fn with_thread_locals<F, R>(f: F) -> R
1990 where F: FnOnce() -> R
1992 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1993 let original_span_debug = span_dbg.get();
1994 span_dbg.set(span_debug);
1996 let _on_drop = OnDrop(move || {
1997 span_dbg.set(original_span_debug);
2000 TRACK_DIAGNOSTICS.with(|current| {
2001 let original = current.get();
2002 current.set(track_diagnostic);
2004 let _on_drop = OnDrop(move || {
2005 current.set(original);
2013 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
2014 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
2016 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2018 set_tlv(context as *const _ as usize, || {
2023 /// Enters GlobalCtxt by setting up libsyntax callbacks and
2024 /// creating a initial TyCtxt and ImplicitCtxt.
2025 /// This happens once per rustc session and TyCtxts only exists
2026 /// inside the `f` function.
2027 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
2028 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
2030 with_thread_locals(|| {
2031 // Update GCX_PTR to indicate there's a GlobalCtxt available
2032 GCX_PTR.with(|lock| {
2033 *lock.lock() = gcx as *const _ as usize;
2035 // Set GCX_PTR back to 0 when we exit
2036 let _on_drop = OnDrop(move || {
2037 GCX_PTR.with(|lock| *lock.lock() = 0);
2042 interners: &gcx.global_interners,
2044 let icx = ImplicitCtxt {
2048 task: &OpenTask::Ignore,
2050 enter_context(&icx, |_| {
2056 /// Stores a pointer to the GlobalCtxt if one is available.
2057 /// This is used to access the GlobalCtxt in the deadlock handler
2059 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2061 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2062 /// This is used in the deadlock handler.
2063 pub unsafe fn with_global<F, R>(f: F) -> R
2064 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2066 let gcx = GCX_PTR.with(|lock| *lock.lock());
2068 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2071 interners: &gcx.global_interners,
2073 let icx = ImplicitCtxt {
2077 task: &OpenTask::Ignore,
2079 enter_context(&icx, |_| f(tcx))
2082 /// Allows access to the current ImplicitCtxt in a closure if one is available
2083 pub fn with_context_opt<F, R>(f: F) -> R
2084 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2086 let context = get_tlv();
2090 // We could get a ImplicitCtxt pointer from another thread.
2091 // Ensure that ImplicitCtxt is Sync
2092 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2094 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2098 /// Allows access to the current ImplicitCtxt.
2099 /// Panics if there is no ImplicitCtxt available
2100 pub fn with_context<F, R>(f: F) -> R
2101 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2103 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2106 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2107 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2108 /// with the same 'gcx lifetime as the TyCtxt passed in.
2109 /// This will panic if you pass it a TyCtxt which has a different global interner from
2110 /// the current ImplicitCtxt's tcx field.
2111 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2112 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2114 with_context(|context| {
2116 let gcx = tcx.gcx as *const _ as usize;
2117 assert!(context.tcx.gcx as *const _ as usize == gcx);
2118 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2124 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2125 /// interner and local interner as the tcx argument passed in. This means the closure
2126 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2127 /// This will panic if you pass it a TyCtxt which has a different global interner or
2128 /// a different local interner from the current ImplicitCtxt's tcx field.
2129 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2130 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2132 with_context(|context| {
2134 let gcx = tcx.gcx as *const _ as usize;
2135 let interners = tcx.interners as *const _ as usize;
2136 assert!(context.tcx.gcx as *const _ as usize == gcx);
2137 assert!(context.tcx.interners as *const _ as usize == interners);
2138 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2144 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2145 /// Panics if there is no ImplicitCtxt available
2146 pub fn with<F, R>(f: F) -> R
2147 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2149 with_context(|context| f(context.tcx))
2152 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2153 /// The closure is passed None if there is no ImplicitCtxt available
2154 pub fn with_opt<F, R>(f: F) -> R
2155 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2157 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2161 macro_rules! sty_debug_print {
2162 ($ctxt: expr, $($variant: ident),*) => {{
2163 // curious inner module to allow variant names to be used as
2165 #[allow(non_snake_case)]
2167 use ty::{self, TyCtxt};
2168 use ty::context::Interned;
2170 #[derive(Copy, Clone)]
2173 region_infer: usize,
2178 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2179 let mut total = DebugStat {
2181 region_infer: 0, ty_infer: 0, both_infer: 0,
2183 $(let mut $variant = total;)*
2185 for &Interned(t) in tcx.interners.type_.borrow().iter() {
2186 let variant = match t.sty {
2187 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2188 ty::Float(..) | ty::Str | ty::Never => continue,
2189 ty::Error => /* unimportant */ continue,
2190 $(ty::$variant(..) => &mut $variant,)*
2192 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2193 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2197 if region { total.region_infer += 1; variant.region_infer += 1 }
2198 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2199 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2201 println!("Ty interner total ty region both");
2202 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2203 {ty:4.1}% {region:5.1}% {both:4.1}%",
2204 stringify!($variant),
2205 uses = $variant.total,
2206 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2207 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2208 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2209 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2211 println!(" total {uses:6} \
2212 {ty:4.1}% {region:5.1}% {both:4.1}%",
2214 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2215 region = total.region_infer as f64 * 100.0 / total.total as f64,
2216 both = total.both_infer as f64 * 100.0 / total.total as f64)
2224 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2225 pub fn print_debug_stats(self) {
2228 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr,
2229 Generator, GeneratorWitness, Dynamic, Closure, Tuple,
2230 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2232 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2233 println!("Region interner: #{}", self.interners.region.borrow().len());
2234 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2235 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2236 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2241 /// An entry in an interner.
2242 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2244 // NB: An Interned<Ty> compares and hashes as a sty.
2245 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2246 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2247 self.0.sty == other.0.sty
2251 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2253 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2254 fn hash<H: Hasher>(&self, s: &mut H) {
2259 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2260 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2265 // NB: An Interned<List<T>> compares and hashes as its elements.
2266 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2267 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2268 self.0[..] == other.0[..]
2272 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2274 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2275 fn hash<H: Hasher>(&self, s: &mut H) {
2280 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2281 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2286 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2287 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2292 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2293 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2298 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2299 fn borrow<'a>(&'a self) -> &'a RegionKind {
2304 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2305 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2306 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2311 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2312 for Interned<'tcx, List<Predicate<'tcx>>> {
2313 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2318 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2319 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2324 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2325 for Interned<'tcx, List<Clause<'tcx>>> {
2326 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2331 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2332 for Interned<'tcx, List<Goal<'tcx>>> {
2333 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2338 macro_rules! intern_method {
2339 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2342 $keep_in_local_tcx:expr) -> $ty:ty) => {
2343 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2344 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2345 let key = ($alloc_to_key)(&v);
2347 // HACK(eddyb) Depend on flags being accurate to
2348 // determine that all contents are in the global tcx.
2349 // See comments on Lift for why we can't use that.
2350 if ($keep_in_local_tcx)(&v) {
2351 let mut interner = self.interners.$name.borrow_mut();
2352 if let Some(&Interned(v)) = interner.get(key) {
2356 // Make sure we don't end up with inference
2357 // types/regions in the global tcx.
2358 if self.is_global() {
2359 bug!("Attempted to intern `{:?}` which contains \
2360 inference types/regions in the global type context",
2364 let i = $alloc_method(&self.interners.arena, v);
2365 interner.insert(Interned(i));
2368 let mut interner = self.global_interners.$name.borrow_mut();
2369 if let Some(&Interned(v)) = interner.get(key) {
2373 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2377 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2379 let i = unsafe { mem::transmute(i) };
2380 interner.insert(Interned(i));
2388 macro_rules! direct_interners {
2389 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2390 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2391 fn eq(&self, other: &Self) -> bool {
2396 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2398 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2399 fn hash<H: Hasher>(&self, s: &mut H) {
2407 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2409 $keep_in_local_tcx) -> $ty);)+
2413 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2414 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2417 direct_interners!('tcx,
2418 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2419 const_: mk_const(|c: &Const<'_>| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>
2422 macro_rules! slice_interners {
2423 ($($field:ident: $method:ident($ty:ident)),+) => (
2424 $(intern_method!( 'tcx, $field: $method(
2426 |a, v| List::from_arena(a, v),
2428 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2433 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2434 predicates: _intern_predicates(Predicate),
2435 type_list: _intern_type_list(Ty),
2436 substs: _intern_substs(Kind),
2437 clauses: _intern_clauses(Clause),
2438 goals: _intern_goals(Goal)
2441 // This isn't a perfect fit: CanonicalVarInfo slices are always
2442 // allocated in the global arena, so this `intern_method!` macro is
2443 // overly general. But we just return false for the code that checks
2444 // whether they belong in the thread-local arena, so no harm done, and
2445 // seems better than open-coding the rest.
2448 canonical_var_infos: _intern_canonical_var_infos(
2449 &[CanonicalVarInfo],
2450 |a, v| List::from_arena(a, v),
2452 |_xs: &[CanonicalVarInfo]| -> bool { false }
2453 ) -> List<CanonicalVarInfo>
2456 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2457 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2458 /// that is, a `fn` type that is equivalent in every way for being
2460 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2461 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2462 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2463 unsafety: hir::Unsafety::Unsafe,
2468 /// Given a closure signature `sig`, returns an equivalent `fn`
2469 /// type with the same signature. Detuples and so forth -- so
2470 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2471 /// a `fn(u32, i32)`.
2472 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2473 let converted_sig = sig.map_bound(|s| {
2474 let params_iter = match s.inputs()[0].sty {
2475 ty::Tuple(params) => {
2476 params.into_iter().cloned()
2484 hir::Unsafety::Normal,
2489 self.mk_fn_ptr(converted_sig)
2492 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2493 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2496 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2498 ast::IntTy::Isize => self.types.isize,
2499 ast::IntTy::I8 => self.types.i8,
2500 ast::IntTy::I16 => self.types.i16,
2501 ast::IntTy::I32 => self.types.i32,
2502 ast::IntTy::I64 => self.types.i64,
2503 ast::IntTy::I128 => self.types.i128,
2507 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2509 ast::UintTy::Usize => self.types.usize,
2510 ast::UintTy::U8 => self.types.u8,
2511 ast::UintTy::U16 => self.types.u16,
2512 ast::UintTy::U32 => self.types.u32,
2513 ast::UintTy::U64 => self.types.u64,
2514 ast::UintTy::U128 => self.types.u128,
2518 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2520 ast::FloatTy::F32 => self.types.f32,
2521 ast::FloatTy::F64 => self.types.f64,
2525 pub fn mk_str(self) -> Ty<'tcx> {
2529 pub fn mk_static_str(self) -> Ty<'tcx> {
2530 self.mk_imm_ref(self.types.re_static, self.mk_str())
2533 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2534 // take a copy of substs so that we own the vectors inside
2535 self.mk_ty(Adt(def, substs))
2538 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2539 self.mk_ty(Foreign(def_id))
2542 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2543 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2544 let adt_def = self.adt_def(def_id);
2545 let substs = Substs::for_item(self, def_id, |param, substs| {
2547 GenericParamDefKind::Lifetime => bug!(),
2548 GenericParamDefKind::Type { has_default, .. } => {
2549 if param.index == 0 {
2552 assert!(has_default);
2553 self.type_of(param.def_id).subst(self, substs).into()
2558 self.mk_ty(Adt(adt_def, substs))
2561 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2562 self.mk_ty(RawPtr(tm))
2565 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2566 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2569 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2570 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2573 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2574 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2577 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2578 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2581 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2582 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2585 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2586 self.mk_imm_ptr(self.mk_unit())
2589 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2590 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2593 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2594 self.mk_ty(Slice(ty))
2597 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2598 self.mk_ty(Tuple(self.intern_type_list(ts)))
2601 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2602 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2605 pub fn mk_unit(self) -> Ty<'tcx> {
2606 self.intern_tup(&[])
2609 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2610 if self.features().never_type {
2613 self.intern_tup(&[])
2617 pub fn mk_bool(self) -> Ty<'tcx> {
2621 pub fn mk_fn_def(self, def_id: DefId,
2622 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2623 self.mk_ty(FnDef(def_id, substs))
2626 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2627 self.mk_ty(FnPtr(fty))
2632 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2633 reg: ty::Region<'tcx>
2635 self.mk_ty(Dynamic(obj, reg))
2638 pub fn mk_projection(self,
2640 substs: &'tcx Substs<'tcx>)
2642 self.mk_ty(Projection(ProjectionTy {
2648 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2650 self.mk_ty(Closure(closure_id, closure_substs))
2653 pub fn mk_generator(self,
2655 generator_substs: GeneratorSubsts<'tcx>,
2656 movability: hir::GeneratorMovability)
2658 self.mk_ty(Generator(id, generator_substs, movability))
2661 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2662 self.mk_ty(GeneratorWitness(types))
2665 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2666 self.mk_infer(TyVar(v))
2669 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2670 self.mk_infer(IntVar(v))
2673 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2674 self.mk_infer(FloatVar(v))
2677 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2678 self.mk_ty(Infer(it))
2681 pub fn mk_ty_param(self,
2683 name: InternedString) -> Ty<'tcx> {
2684 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2687 pub fn mk_self_type(self) -> Ty<'tcx> {
2688 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2691 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2693 GenericParamDefKind::Lifetime => {
2694 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2696 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2700 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2701 self.mk_ty(Opaque(def_id, substs))
2704 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2705 -> &'tcx List<ExistentialPredicate<'tcx>> {
2706 assert!(!eps.is_empty());
2707 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2708 self._intern_existential_predicates(eps)
2711 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2712 -> &'tcx List<Predicate<'tcx>> {
2713 // FIXME consider asking the input slice to be sorted to avoid
2714 // re-interning permutations, in which case that would be asserted
2716 if preds.len() == 0 {
2717 // The macro-generated method below asserts we don't intern an empty slice.
2720 self._intern_predicates(preds)
2724 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2728 self._intern_type_list(ts)
2732 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2736 self._intern_substs(ts)
2740 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2744 self.global_tcx()._intern_canonical_var_infos(ts)
2748 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2752 self._intern_clauses(ts)
2756 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2760 self._intern_goals(ts)
2764 pub fn mk_fn_sig<I>(self,
2768 unsafety: hir::Unsafety,
2770 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2772 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2774 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2775 inputs_and_output: self.intern_type_list(xs),
2776 variadic, unsafety, abi
2780 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2781 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2783 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2786 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2787 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2789 iter.intern_with(|xs| self.intern_predicates(xs))
2792 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2793 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2794 iter.intern_with(|xs| self.intern_type_list(xs))
2797 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2798 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2799 iter.intern_with(|xs| self.intern_substs(xs))
2802 pub fn mk_substs_trait(self,
2804 rest: &[Kind<'tcx>])
2805 -> &'tcx Substs<'tcx>
2807 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2810 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2811 iter.intern_with(|xs| self.intern_clauses(xs))
2814 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2815 iter.intern_with(|xs| self.intern_goals(xs))
2818 pub fn mk_goal(self, goal: Goal<'tcx>) -> &'tcx Goal<'_> {
2819 &self.intern_goals(&[goal])[0]
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 // FIXME(#44234) - almost all of these queries have no sub-queries and
2987 // therefore no actual inputs, they're just reading tables calculated in
2988 // resolve! Does this work? Unsure! That's what the issue is about
2989 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2990 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2991 providers.crate_name = |tcx, id| {
2992 assert_eq!(id, LOCAL_CRATE);
2995 providers.get_lib_features = |tcx, id| {
2996 assert_eq!(id, LOCAL_CRATE);
2997 Lrc::new(middle::lib_features::collect(tcx))
2999 providers.get_lang_items = |tcx, id| {
3000 assert_eq!(id, LOCAL_CRATE);
3001 Lrc::new(middle::lang_items::collect(tcx))
3003 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3004 providers.maybe_unused_trait_import = |tcx, id| {
3005 tcx.maybe_unused_trait_imports.contains(&id)
3007 providers.maybe_unused_extern_crates = |tcx, cnum| {
3008 assert_eq!(cnum, LOCAL_CRATE);
3009 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3012 providers.stability_index = |tcx, cnum| {
3013 assert_eq!(cnum, LOCAL_CRATE);
3014 Lrc::new(stability::Index::new(tcx))
3016 providers.lookup_stability = |tcx, id| {
3017 assert_eq!(id.krate, LOCAL_CRATE);
3018 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3019 tcx.stability().local_stability(id)
3021 providers.lookup_deprecation_entry = |tcx, id| {
3022 assert_eq!(id.krate, LOCAL_CRATE);
3023 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3024 tcx.stability().local_deprecation_entry(id)
3026 providers.extern_mod_stmt_cnum = |tcx, id| {
3027 let id = tcx.hir.as_local_node_id(id).unwrap();
3028 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3030 providers.all_crate_nums = |tcx, cnum| {
3031 assert_eq!(cnum, LOCAL_CRATE);
3032 Lrc::new(tcx.cstore.crates_untracked())
3034 providers.postorder_cnums = |tcx, cnum| {
3035 assert_eq!(cnum, LOCAL_CRATE);
3036 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3038 providers.output_filenames = |tcx, cnum| {
3039 assert_eq!(cnum, LOCAL_CRATE);
3040 tcx.output_filenames.clone()
3042 providers.features_query = |tcx, cnum| {
3043 assert_eq!(cnum, LOCAL_CRATE);
3044 Lrc::new(tcx.sess.features_untracked().clone())
3046 providers.is_panic_runtime = |tcx, cnum| {
3047 assert_eq!(cnum, LOCAL_CRATE);
3048 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
3050 providers.is_compiler_builtins = |tcx, cnum| {
3051 assert_eq!(cnum, LOCAL_CRATE);
3052 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")