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, GoalKind, 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 goal: InternedSet<'tcx, GoalKind<'tcx>>,
147 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
150 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
151 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
154 type_: Default::default(),
155 type_list: Default::default(),
156 substs: Default::default(),
157 region: Default::default(),
158 existential_predicates: Default::default(),
159 canonical_var_infos: Default::default(),
160 predicates: Default::default(),
161 const_: Default::default(),
162 clauses: Default::default(),
163 goal: Default::default(),
164 goal_list: Default::default(),
170 local: &CtxtInterners<'tcx>,
171 global: &CtxtInterners<'gcx>,
174 let flags = super::flags::FlagComputation::for_sty(&st);
176 // HACK(eddyb) Depend on flags being accurate to
177 // determine that all contents are in the global tcx.
178 // See comments on Lift for why we can't use that.
179 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
180 let mut interner = local.type_.borrow_mut();
181 if let Some(&Interned(ty)) = interner.get(&st) {
185 let ty_struct = TyS {
188 outer_exclusive_binder: flags.outer_exclusive_binder,
191 // Make sure we don't end up with inference
192 // types/regions in the global interner
193 if local as *const _ as usize == global as *const _ as usize {
194 bug!("Attempted to intern `{:?}` which contains \
195 inference types/regions in the global type context",
199 // Don't be &mut TyS.
200 let ty: Ty<'tcx> = local.arena.alloc(ty_struct);
201 interner.insert(Interned(ty));
204 let mut interner = global.type_.borrow_mut();
205 if let Some(&Interned(ty)) = interner.get(&st) {
209 let ty_struct = TyS {
212 outer_exclusive_binder: flags.outer_exclusive_binder,
215 // This is safe because all the types the ty_struct can point to
216 // already is in the global arena
217 let ty_struct: TyS<'gcx> = unsafe {
218 mem::transmute(ty_struct)
221 // Don't be &mut TyS.
222 let ty: Ty<'gcx> = global.arena.alloc(ty_struct);
223 interner.insert(Interned(ty));
229 pub struct CommonTypes<'tcx> {
249 pub re_empty: Region<'tcx>,
250 pub re_static: Region<'tcx>,
251 pub re_erased: Region<'tcx>,
254 pub struct LocalTableInContext<'a, V: 'a> {
255 local_id_root: Option<DefId>,
256 data: &'a ItemLocalMap<V>
259 /// Validate that the given HirId (respectively its `local_id` part) can be
260 /// safely used as a key in the tables of a TypeckTable. For that to be
261 /// the case, the HirId must have the same `owner` as all the other IDs in
262 /// this table (signified by `local_id_root`). Otherwise the HirId
263 /// would be in a different frame of reference and using its `local_id`
264 /// would result in lookup errors, or worse, in silently wrong data being
266 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
269 if cfg!(debug_assertions) {
270 if let Some(local_id_root) = local_id_root {
271 if hir_id.owner != local_id_root.index {
272 ty::tls::with(|tcx| {
273 let node_id = tcx.hir.hir_to_node_id(hir_id);
275 bug!("node {} with HirId::owner {:?} cannot be placed in \
276 TypeckTables with local_id_root {:?}",
277 tcx.hir.node_to_string(node_id),
278 DefId::local(hir_id.owner),
283 // We use "Null Object" TypeckTables in some of the analysis passes.
284 // These are just expected to be empty and their `local_id_root` is
285 // `None`. Therefore we cannot verify whether a given `HirId` would
286 // be a valid key for the given table. Instead we make sure that
287 // nobody tries to write to such a Null Object table.
289 bug!("access to invalid TypeckTables")
295 impl<'a, V> LocalTableInContext<'a, V> {
296 pub fn contains_key(&self, id: hir::HirId) -> bool {
297 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
298 self.data.contains_key(&id.local_id)
301 pub fn get(&self, id: hir::HirId) -> Option<&V> {
302 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
303 self.data.get(&id.local_id)
306 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
311 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
314 fn index(&self, key: hir::HirId) -> &V {
315 self.get(key).expect("LocalTableInContext: key not found")
319 pub struct LocalTableInContextMut<'a, V: 'a> {
320 local_id_root: Option<DefId>,
321 data: &'a mut ItemLocalMap<V>
324 impl<'a, V> LocalTableInContextMut<'a, V> {
325 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
326 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
327 self.data.get_mut(&id.local_id)
330 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
331 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
332 self.data.entry(id.local_id)
335 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
336 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
337 self.data.insert(id.local_id, val)
340 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
341 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
342 self.data.remove(&id.local_id)
346 #[derive(RustcEncodable, RustcDecodable, Debug)]
347 pub struct TypeckTables<'tcx> {
348 /// The HirId::owner all ItemLocalIds in this table are relative to.
349 pub local_id_root: Option<DefId>,
351 /// Resolved definitions for `<T>::X` associated paths and
352 /// method calls, including those of overloaded operators.
353 type_dependent_defs: ItemLocalMap<Def>,
355 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
356 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
357 /// about the field you also need definition of the variant to which the field
358 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
359 field_indices: ItemLocalMap<usize>,
361 /// Stores the canonicalized types provided by the user. See also
362 /// `AscribeUserType` statement in MIR.
363 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
365 /// Stores the types for various nodes in the AST. Note that this table
366 /// is not guaranteed to be populated until after typeck. See
367 /// typeck::check::fn_ctxt for details.
368 node_types: ItemLocalMap<Ty<'tcx>>,
370 /// Stores the type parameters which were substituted to obtain the type
371 /// of this node. This only applies to nodes that refer to entities
372 /// parameterized by type parameters, such as generic fns, types, or
374 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
376 /// Stores the substitutions that the user explicitly gave (if any)
377 /// attached to `id`. These will not include any inferred
378 /// values. The canonical form is used to capture things like `_`
379 /// or other unspecified values.
383 /// If the user wrote `foo.collect::<Vec<_>>()`, then the
384 /// canonical substitutions would include only `for<X> { Vec<X>
386 user_substs: ItemLocalMap<CanonicalSubsts<'tcx>>,
388 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
390 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
391 pat_binding_modes: ItemLocalMap<BindingMode>,
393 /// Stores the types which were implicitly dereferenced in pattern binding modes
394 /// for later usage in HAIR lowering. For example,
397 /// match &&Some(5i32) {
402 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
405 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
406 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
409 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
411 /// Records the reasons that we picked the kind of each closure;
412 /// not all closures are present in the map.
413 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
415 /// For each fn, records the "liberated" types of its arguments
416 /// and return type. Liberated means that all bound regions
417 /// (including late-bound regions) are replaced with free
418 /// equivalents. This table is not used in codegen (since regions
419 /// are erased there) and hence is not serialized to metadata.
420 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
422 /// For each FRU expression, record the normalized types of the fields
423 /// of the struct - this is needed because it is non-trivial to
424 /// normalize while preserving regions. This table is used only in
425 /// MIR construction and hence is not serialized to metadata.
426 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
428 /// Maps a cast expression to its kind. This is keyed on the
429 /// *from* expression of the cast, not the cast itself.
430 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
432 /// Set of trait imports actually used in the method resolution.
433 /// This is used for warning unused imports. During type
434 /// checking, this `Lrc` should not be cloned: it must have a ref-count
435 /// of 1 so that we can insert things into the set mutably.
436 pub used_trait_imports: Lrc<DefIdSet>,
438 /// If any errors occurred while type-checking this body,
439 /// this field will be set to `true`.
440 pub tainted_by_errors: bool,
442 /// Stores the free-region relationships that were deduced from
443 /// its where clauses and parameter types. These are then
444 /// read-again by borrowck.
445 pub free_region_map: FreeRegionMap<'tcx>,
447 /// All the existential types that are restricted to concrete types
449 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
452 impl<'tcx> TypeckTables<'tcx> {
453 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
456 type_dependent_defs: ItemLocalMap(),
457 field_indices: ItemLocalMap(),
458 user_provided_tys: ItemLocalMap(),
459 node_types: ItemLocalMap(),
460 node_substs: ItemLocalMap(),
461 user_substs: ItemLocalMap(),
462 adjustments: ItemLocalMap(),
463 pat_binding_modes: ItemLocalMap(),
464 pat_adjustments: ItemLocalMap(),
465 upvar_capture_map: FxHashMap(),
466 closure_kind_origins: ItemLocalMap(),
467 liberated_fn_sigs: ItemLocalMap(),
468 fru_field_types: ItemLocalMap(),
469 cast_kinds: ItemLocalMap(),
470 used_trait_imports: Lrc::new(DefIdSet()),
471 tainted_by_errors: false,
472 free_region_map: FreeRegionMap::new(),
473 concrete_existential_types: FxHashMap(),
477 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
478 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
480 hir::QPath::Resolved(_, ref path) => path.def,
481 hir::QPath::TypeRelative(..) => {
482 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
483 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
488 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
489 LocalTableInContext {
490 local_id_root: self.local_id_root,
491 data: &self.type_dependent_defs
495 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
496 LocalTableInContextMut {
497 local_id_root: self.local_id_root,
498 data: &mut self.type_dependent_defs
502 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
503 LocalTableInContext {
504 local_id_root: self.local_id_root,
505 data: &self.field_indices
509 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
510 LocalTableInContextMut {
511 local_id_root: self.local_id_root,
512 data: &mut self.field_indices
516 pub fn user_provided_tys(&self) -> LocalTableInContext<'_, CanonicalTy<'tcx>> {
517 LocalTableInContext {
518 local_id_root: self.local_id_root,
519 data: &self.user_provided_tys
523 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalTy<'tcx>> {
524 LocalTableInContextMut {
525 local_id_root: self.local_id_root,
526 data: &mut self.user_provided_tys
530 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
531 LocalTableInContext {
532 local_id_root: self.local_id_root,
533 data: &self.node_types
537 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
538 LocalTableInContextMut {
539 local_id_root: self.local_id_root,
540 data: &mut self.node_types
544 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
545 self.node_id_to_type_opt(id).unwrap_or_else(||
546 bug!("node_id_to_type: no type for node `{}`",
548 let id = tcx.hir.hir_to_node_id(id);
549 tcx.hir.node_to_string(id)
554 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
555 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
556 self.node_types.get(&id.local_id).cloned()
559 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
560 LocalTableInContextMut {
561 local_id_root: self.local_id_root,
562 data: &mut self.node_substs
566 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
567 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
568 self.node_substs.get(&id.local_id).cloned().unwrap_or(Substs::empty())
571 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
572 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
573 self.node_substs.get(&id.local_id).cloned()
576 pub fn user_substs_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalSubsts<'tcx>> {
577 LocalTableInContextMut {
578 local_id_root: self.local_id_root,
579 data: &mut self.user_substs
583 pub fn user_substs(&self, id: hir::HirId) -> Option<CanonicalSubsts<'tcx>> {
584 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
585 self.user_substs.get(&id.local_id).cloned()
588 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
589 // doesn't provide type parameter substitutions.
590 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
591 self.node_id_to_type(pat.hir_id)
594 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
595 self.node_id_to_type_opt(pat.hir_id)
598 // Returns the type of an expression as a monotype.
600 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
601 // some cases, we insert `Adjustment` annotations such as auto-deref or
602 // auto-ref. The type returned by this function does not consider such
603 // adjustments. See `expr_ty_adjusted()` instead.
605 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
606 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
607 // instead of "fn(ty) -> T with T = isize".
608 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
609 self.node_id_to_type(expr.hir_id)
612 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
613 self.node_id_to_type_opt(expr.hir_id)
616 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
617 LocalTableInContext {
618 local_id_root: self.local_id_root,
619 data: &self.adjustments
623 pub fn adjustments_mut(&mut self)
624 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
625 LocalTableInContextMut {
626 local_id_root: self.local_id_root,
627 data: &mut self.adjustments
631 pub fn expr_adjustments(&self, expr: &hir::Expr)
632 -> &[ty::adjustment::Adjustment<'tcx>] {
633 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
634 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
637 /// Returns the type of `expr`, considering any `Adjustment`
638 /// entry recorded for that expression.
639 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
640 self.expr_adjustments(expr)
642 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
645 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
646 self.expr_adjustments(expr)
648 .map(|adj| adj.target)
649 .or_else(|| self.expr_ty_opt(expr))
652 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
653 // Only paths and method calls/overloaded operators have
654 // entries in type_dependent_defs, ignore the former here.
655 if let hir::ExprKind::Path(_) = expr.node {
659 match self.type_dependent_defs().get(expr.hir_id) {
660 Some(&Def::Method(_)) => true,
665 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
666 LocalTableInContext {
667 local_id_root: self.local_id_root,
668 data: &self.pat_binding_modes
672 pub fn pat_binding_modes_mut(&mut self)
673 -> LocalTableInContextMut<'_, BindingMode> {
674 LocalTableInContextMut {
675 local_id_root: self.local_id_root,
676 data: &mut self.pat_binding_modes
680 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
681 LocalTableInContext {
682 local_id_root: self.local_id_root,
683 data: &self.pat_adjustments,
687 pub fn pat_adjustments_mut(&mut self)
688 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
689 LocalTableInContextMut {
690 local_id_root: self.local_id_root,
691 data: &mut self.pat_adjustments,
695 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
696 self.upvar_capture_map[&upvar_id]
699 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
700 LocalTableInContext {
701 local_id_root: self.local_id_root,
702 data: &self.closure_kind_origins
706 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
707 LocalTableInContextMut {
708 local_id_root: self.local_id_root,
709 data: &mut self.closure_kind_origins
713 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
714 LocalTableInContext {
715 local_id_root: self.local_id_root,
716 data: &self.liberated_fn_sigs
720 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
721 LocalTableInContextMut {
722 local_id_root: self.local_id_root,
723 data: &mut self.liberated_fn_sigs
727 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
728 LocalTableInContext {
729 local_id_root: self.local_id_root,
730 data: &self.fru_field_types
734 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
735 LocalTableInContextMut {
736 local_id_root: self.local_id_root,
737 data: &mut self.fru_field_types
741 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
742 LocalTableInContext {
743 local_id_root: self.local_id_root,
744 data: &self.cast_kinds
748 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
749 LocalTableInContextMut {
750 local_id_root: self.local_id_root,
751 data: &mut self.cast_kinds
756 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
757 fn hash_stable<W: StableHasherResult>(&self,
758 hcx: &mut StableHashingContext<'a>,
759 hasher: &mut StableHasher<W>) {
760 let ty::TypeckTables {
762 ref type_dependent_defs,
764 ref user_provided_tys,
769 ref pat_binding_modes,
771 ref upvar_capture_map,
772 ref closure_kind_origins,
773 ref liberated_fn_sigs,
778 ref used_trait_imports,
781 ref concrete_existential_types,
784 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
785 type_dependent_defs.hash_stable(hcx, hasher);
786 field_indices.hash_stable(hcx, hasher);
787 user_provided_tys.hash_stable(hcx, hasher);
788 node_types.hash_stable(hcx, hasher);
789 node_substs.hash_stable(hcx, hasher);
790 user_substs.hash_stable(hcx, hasher);
791 adjustments.hash_stable(hcx, hasher);
792 pat_binding_modes.hash_stable(hcx, hasher);
793 pat_adjustments.hash_stable(hcx, hasher);
794 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
801 local_id_root.expect("trying to hash invalid TypeckTables");
803 let var_owner_def_id = DefId {
804 krate: local_id_root.krate,
807 let closure_def_id = DefId {
808 krate: local_id_root.krate,
809 index: closure_expr_id.to_def_id().index,
811 (hcx.def_path_hash(var_owner_def_id),
813 hcx.def_path_hash(closure_def_id))
816 closure_kind_origins.hash_stable(hcx, hasher);
817 liberated_fn_sigs.hash_stable(hcx, hasher);
818 fru_field_types.hash_stable(hcx, hasher);
819 cast_kinds.hash_stable(hcx, hasher);
820 used_trait_imports.hash_stable(hcx, hasher);
821 tainted_by_errors.hash_stable(hcx, hasher);
822 free_region_map.hash_stable(hcx, hasher);
823 concrete_existential_types.hash_stable(hcx, hasher);
828 impl<'tcx> CommonTypes<'tcx> {
829 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
830 // Ensure our type representation does not grow
831 #[cfg(target_pointer_width = "64")]
832 static_assert!(ASSERT_TY_KIND: ::std::mem::size_of::<ty::TyKind<'_>>() <= 24);
833 #[cfg(target_pointer_width = "64")]
834 static_assert!(ASSERT_TYS: ::std::mem::size_of::<ty::TyS<'_>>() <= 32);
836 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
837 let mk_region = |r| {
838 if let Some(r) = interners.region.borrow().get(&r) {
841 let r = interners.arena.alloc(r);
842 interners.region.borrow_mut().insert(Interned(r));
850 isize: mk(Int(ast::IntTy::Isize)),
851 i8: mk(Int(ast::IntTy::I8)),
852 i16: mk(Int(ast::IntTy::I16)),
853 i32: mk(Int(ast::IntTy::I32)),
854 i64: mk(Int(ast::IntTy::I64)),
855 i128: mk(Int(ast::IntTy::I128)),
856 usize: mk(Uint(ast::UintTy::Usize)),
857 u8: mk(Uint(ast::UintTy::U8)),
858 u16: mk(Uint(ast::UintTy::U16)),
859 u32: mk(Uint(ast::UintTy::U32)),
860 u64: mk(Uint(ast::UintTy::U64)),
861 u128: mk(Uint(ast::UintTy::U128)),
862 f32: mk(Float(ast::FloatTy::F32)),
863 f64: mk(Float(ast::FloatTy::F64)),
865 re_empty: mk_region(RegionKind::ReEmpty),
866 re_static: mk_region(RegionKind::ReStatic),
867 re_erased: mk_region(RegionKind::ReErased),
872 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
875 pub struct FreeRegionInfo {
876 // def id corresponding to FreeRegion
878 // the bound region corresponding to FreeRegion
879 pub boundregion: ty::BoundRegion,
880 // checks if bound region is in Impl Item
881 pub is_impl_item: bool,
884 /// The central data structure of the compiler. It stores references
885 /// to the various **arenas** and also houses the results of the
886 /// various **compiler queries** that have been performed. See the
887 /// [rustc guide] for more details.
889 /// [rustc guide]: https://rust-lang-nursery.github.io/rustc-guide/ty.html
890 #[derive(Copy, Clone)]
891 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
892 gcx: &'a GlobalCtxt<'gcx>,
893 interners: &'a CtxtInterners<'tcx>
896 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
897 type Target = &'a GlobalCtxt<'gcx>;
898 fn deref(&self) -> &Self::Target {
903 pub struct GlobalCtxt<'tcx> {
904 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
905 global_interners: CtxtInterners<'tcx>,
907 cstore: &'tcx CrateStoreDyn,
909 pub sess: &'tcx Session,
911 pub dep_graph: DepGraph,
913 /// Common types, pre-interned for your convenience.
914 pub types: CommonTypes<'tcx>,
916 /// Map indicating what traits are in scope for places where this
917 /// is relevant; generated by resolve.
918 trait_map: FxHashMap<DefIndex,
919 Lrc<FxHashMap<ItemLocalId,
920 Lrc<StableVec<TraitCandidate>>>>>,
922 /// Export map produced by name resolution.
923 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
925 pub hir: hir_map::Map<'tcx>,
927 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
928 /// as well as all upstream crates. Only populated in incremental mode.
929 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
931 pub(crate) queries: query::Queries<'tcx>,
933 // Records the free variables referenced by every closure
934 // expression. Do not track deps for this, just recompute it from
935 // scratch every time.
936 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
938 maybe_unused_trait_imports: FxHashSet<DefId>,
940 maybe_unused_extern_crates: Vec<(DefId, Span)>,
942 // Internal cache for metadata decoding. No need to track deps on this.
943 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
945 /// Caches the results of trait selection. This cache is used
946 /// for things that do not have to do with the parameters in scope.
947 pub selection_cache: traits::SelectionCache<'tcx>,
949 /// Caches the results of trait evaluation. This cache is used
950 /// for things that do not have to do with the parameters in scope.
951 /// Merge this with `selection_cache`?
952 pub evaluation_cache: traits::EvaluationCache<'tcx>,
954 /// The definite name of the current crate after taking into account
955 /// attributes, commandline parameters, etc.
956 pub crate_name: Symbol,
958 /// Data layout specification for the current target.
959 pub data_layout: TargetDataLayout,
961 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
963 /// Stores the value of constants (and deduplicates the actual memory)
964 allocation_interner: Lock<FxHashSet<&'tcx Allocation>>,
966 pub alloc_map: Lock<interpret::AllocMap<'tcx, &'tcx Allocation>>,
968 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
970 /// A general purpose channel to throw data out the back towards LLVM worker
973 /// This is intended to only get used during the codegen phase of the compiler
974 /// when satisfying the query for a particular codegen unit. Internally in
975 /// the query it'll send data along this channel to get processed later.
976 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
978 output_filenames: Arc<OutputFilenames>,
981 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
982 /// Get the global TyCtxt.
984 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
987 interners: &self.gcx.global_interners,
991 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
992 self.global_arenas.generics.alloc(generics)
995 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
996 self.global_arenas.steal_mir.alloc(Steal::new(mir))
999 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
1000 self.global_arenas.mir.alloc(mir)
1003 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1004 self.global_arenas.tables.alloc(tables)
1007 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1008 self.global_arenas.trait_def.alloc(def)
1011 pub fn alloc_adt_def(self,
1014 variants: Vec<ty::VariantDef>,
1016 -> &'gcx ty::AdtDef {
1017 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1018 self.global_arenas.adt_def.alloc(def)
1021 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1022 if bytes.is_empty() {
1025 self.global_interners.arena.alloc_slice(bytes)
1029 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1030 -> &'tcx [&'tcx ty::Const<'tcx>] {
1031 if values.is_empty() {
1034 self.interners.arena.alloc_slice(values)
1038 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1039 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1040 if values.is_empty() {
1043 self.interners.arena.alloc_slice(values)
1047 pub fn intern_const_alloc(
1050 ) -> &'gcx Allocation {
1051 let allocs = &mut self.allocation_interner.borrow_mut();
1052 if let Some(alloc) = allocs.get(&alloc) {
1056 let interned = self.global_arenas.const_allocs.alloc(alloc);
1057 if let Some(prev) = allocs.replace(interned) { // insert into interner
1058 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1063 /// Allocates a byte or string literal for `mir::interpret`, read-only
1064 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1065 // create an allocation that just contains these bytes
1066 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1067 let alloc = self.intern_const_alloc(alloc);
1068 self.alloc_map.lock().allocate(alloc)
1071 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1072 let mut stability_interner = self.stability_interner.borrow_mut();
1073 if let Some(st) = stability_interner.get(&stab) {
1077 let interned = self.global_interners.arena.alloc(stab);
1078 if let Some(prev) = stability_interner.replace(interned) {
1079 bug!("Tried to overwrite interned Stability: {:?}", prev)
1084 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1085 let mut layout_interner = self.layout_interner.borrow_mut();
1086 if let Some(layout) = layout_interner.get(&layout) {
1090 let interned = self.global_arenas.layout.alloc(layout);
1091 if let Some(prev) = layout_interner.replace(interned) {
1092 bug!("Tried to overwrite interned Layout: {:?}", prev)
1097 /// Returns a range of the start/end indices specified with the
1098 /// `rustc_layout_scalar_valid_range` attribute.
1099 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1100 let attrs = self.get_attrs(def_id);
1102 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1104 None => return Bound::Unbounded,
1106 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1107 match meta.literal().expect("attribute takes lit").node {
1108 ast::LitKind::Int(a, _) => return Bound::Included(a),
1109 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1112 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1114 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1117 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1118 value.lift_to_tcx(self)
1121 /// Like lift, but only tries in the global tcx.
1122 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1123 value.lift_to_tcx(self.global_tcx())
1126 /// Returns true if self is the same as self.global_tcx().
1127 fn is_global(self) -> bool {
1128 let local = self.interners as *const _;
1129 let global = &self.global_interners as *const _;
1130 local as usize == global as usize
1133 /// Create a type context and call the closure with a `TyCtxt` reference
1134 /// to the context. The closure enforces that the type context and any interned
1135 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1136 /// reference to the context, to allow formatting values that need it.
1137 pub fn create_and_enter<F, R>(s: &'tcx Session,
1138 cstore: &'tcx CrateStoreDyn,
1139 local_providers: ty::query::Providers<'tcx>,
1140 extern_providers: ty::query::Providers<'tcx>,
1141 arenas: &'tcx AllArenas<'tcx>,
1142 resolutions: ty::Resolutions,
1143 hir: hir_map::Map<'tcx>,
1144 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1146 tx: mpsc::Sender<Box<dyn Any + Send>>,
1147 output_filenames: &OutputFilenames,
1149 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1151 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1154 let interners = CtxtInterners::new(&arenas.interner);
1155 let common_types = CommonTypes::new(&interners);
1156 let dep_graph = hir.dep_graph.clone();
1157 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1158 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1159 providers[LOCAL_CRATE] = local_providers;
1161 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1162 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1165 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1168 let def_path_tables = || {
1169 upstream_def_path_tables
1171 .map(|&(cnum, ref rc)| (cnum, &**rc))
1172 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1175 // Precompute the capacity of the hashmap so we don't have to
1176 // re-allocate when populating it.
1177 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1179 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1181 ::std::default::Default::default()
1184 for (cnum, def_path_table) in def_path_tables() {
1185 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1193 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap();
1194 for (k, v) in resolutions.trait_map {
1195 let hir_id = hir.node_to_hir_id(k);
1196 let map = trait_map.entry(hir_id.owner).or_default();
1197 Lrc::get_mut(map).unwrap()
1198 .insert(hir_id.local_id,
1199 Lrc::new(StableVec::new(v)));
1202 let gcx = &GlobalCtxt {
1205 global_arenas: &arenas.global,
1206 global_interners: interners,
1207 dep_graph: dep_graph.clone(),
1208 types: common_types,
1210 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1213 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1214 (hir.local_def_id(k), Lrc::new(v))
1216 maybe_unused_trait_imports:
1217 resolutions.maybe_unused_trait_imports
1219 .map(|id| hir.local_def_id(id))
1221 maybe_unused_extern_crates:
1222 resolutions.maybe_unused_extern_crates
1224 .map(|(id, sp)| (hir.local_def_id(id), sp))
1227 def_path_hash_to_def_id,
1228 queries: query::Queries::new(
1231 on_disk_query_result_cache,
1233 rcache: Lock::new(FxHashMap()),
1234 selection_cache: traits::SelectionCache::new(),
1235 evaluation_cache: traits::EvaluationCache::new(),
1236 crate_name: Symbol::intern(crate_name),
1238 layout_interner: Lock::new(FxHashSet()),
1239 stability_interner: Lock::new(FxHashSet()),
1240 allocation_interner: Lock::new(FxHashSet()),
1241 alloc_map: Lock::new(interpret::AllocMap::new()),
1242 tx_to_llvm_workers: Lock::new(tx),
1243 output_filenames: Arc::new(output_filenames.clone()),
1246 sync::assert_send_val(&gcx);
1248 tls::enter_global(gcx, f)
1251 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1252 let cname = self.crate_name(LOCAL_CRATE).as_str();
1253 self.sess.consider_optimizing(&cname, msg)
1256 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1257 self.get_lib_features(LOCAL_CRATE)
1260 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1261 self.get_lang_items(LOCAL_CRATE)
1264 /// Due to missing llvm support for lowering 128 bit math to software emulation
1265 /// (on some targets), the lowering can be done in MIR.
1267 /// This function only exists until said support is implemented.
1268 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1269 let items = self.lang_items();
1270 let def_id = Some(def_id);
1271 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1272 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1273 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1274 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1275 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1276 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1277 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1278 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1279 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1280 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1281 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1282 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1283 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1284 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1285 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1286 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1287 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1288 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1289 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1290 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1291 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1292 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1293 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1294 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1298 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1299 self.stability_index(LOCAL_CRATE)
1302 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1303 self.all_crate_nums(LOCAL_CRATE)
1306 pub fn features(self) -> Lrc<feature_gate::Features> {
1307 self.features_query(LOCAL_CRATE)
1310 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1312 self.hir.def_key(id)
1314 self.cstore.def_key(id)
1318 /// Convert a `DefId` into its fully expanded `DefPath` (every
1319 /// `DefId` is really just an interned def-path).
1321 /// Note that if `id` is not local to this crate, the result will
1322 /// be a non-local `DefPath`.
1323 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1325 self.hir.def_path(id)
1327 self.cstore.def_path(id)
1332 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1333 if def_id.is_local() {
1334 self.hir.definitions().def_path_hash(def_id.index)
1336 self.cstore.def_path_hash(def_id)
1340 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1341 // We are explicitly not going through queries here in order to get
1342 // crate name and disambiguator since this code is called from debug!()
1343 // statements within the query system and we'd run into endless
1344 // recursion otherwise.
1345 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1346 (self.crate_name.clone(),
1347 self.sess.local_crate_disambiguator())
1349 (self.cstore.crate_name_untracked(def_id.krate),
1350 self.cstore.crate_disambiguator_untracked(def_id.krate))
1355 // Don't print the whole crate disambiguator. That's just
1356 // annoying in debug output.
1357 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1358 self.def_path(def_id).to_string_no_crate())
1361 pub fn metadata_encoding_version(self) -> Vec<u8> {
1362 self.cstore.metadata_encoding_version().to_vec()
1365 // Note that this is *untracked* and should only be used within the query
1366 // system if the result is otherwise tracked through queries
1367 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1368 self.cstore.crate_data_as_rc_any(cnum)
1371 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1372 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1374 StableHashingContext::new(self.sess,
1376 self.hir.definitions(),
1380 // This method makes sure that we have a DepNode and a Fingerprint for
1381 // every upstream crate. It needs to be called once right after the tcx is
1383 // With full-fledged red/green, the method will probably become unnecessary
1384 // as this will be done on-demand.
1385 pub fn allocate_metadata_dep_nodes(self) {
1386 // We cannot use the query versions of crates() and crate_hash(), since
1387 // those would need the DepNodes that we are allocating here.
1388 for cnum in self.cstore.crates_untracked() {
1389 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1390 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1391 self.dep_graph.with_task(dep_node,
1394 |_, x| x // No transformation needed
1399 // This method exercises the `in_scope_traits_map` query for all possible
1400 // values so that we have their fingerprints available in the DepGraph.
1401 // This is only required as long as we still use the old dependency tracking
1402 // which needs to have the fingerprints of all input nodes beforehand.
1403 pub fn precompute_in_scope_traits_hashes(self) {
1404 for &def_index in self.trait_map.keys() {
1405 self.in_scope_traits_map(def_index);
1409 pub fn serialize_query_result_cache<E>(self,
1411 -> Result<(), E::Error>
1412 where E: ty::codec::TyEncoder
1414 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1417 /// This checks whether one is allowed to have pattern bindings
1418 /// that bind-by-move on a match arm that has a guard, e.g.:
1421 /// match foo { A(inner) if { /* something */ } => ..., ... }
1424 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1425 /// because that method has a narrower effect that can be toggled
1426 /// off via a separate `-Z` flag, at least for the short term.
1427 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1428 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1431 /// If true, we should use a naive AST walk to determine if match
1432 /// guard could perform bad mutations (or mutable-borrows).
1433 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1434 // If someone requests the feature, then be a little more
1435 // careful and ensure that MIR-borrowck is enabled (which can
1436 // happen via edition selection, via `feature(nll)`, or via an
1437 // appropriate `-Z` flag) before disabling the mutation check.
1438 if self.allow_bind_by_move_patterns_with_guards() {
1445 /// If true, we should use the AST-based borrowck (we may *also* use
1446 /// the MIR-based borrowck).
1447 pub fn use_ast_borrowck(self) -> bool {
1448 self.borrowck_mode().use_ast()
1451 /// If true, we should use the MIR-based borrowck (we may *also* use
1452 /// the AST-based borrowck).
1453 pub fn use_mir_borrowck(self) -> bool {
1454 self.borrowck_mode().use_mir()
1457 /// If true, we should use the MIR-based borrow check, but also
1458 /// fall back on the AST borrow check if the MIR-based one errors.
1459 pub fn migrate_borrowck(self) -> bool {
1460 self.borrowck_mode().migrate()
1463 /// If true, make MIR codegen for `match` emit a temp that holds a
1464 /// borrow of the input to the match expression.
1465 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1466 self.emit_read_for_match()
1469 /// If true, make MIR codegen for `match` emit FakeRead
1470 /// statements (which simulate the maximal effect of executing the
1471 /// patterns in a match arm).
1472 pub fn emit_read_for_match(&self) -> bool {
1473 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1476 /// If true, pattern variables for use in guards on match arms
1477 /// will be bound as references to the data, and occurrences of
1478 /// those variables in the guard expression will implicitly
1479 /// dereference those bindings. (See rust-lang/rust#27282.)
1480 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1481 self.borrowck_mode().use_mir()
1484 /// If true, we should enable two-phase borrows checks. This is
1485 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1486 /// or by opting into an edition after 2015.
1487 pub fn two_phase_borrows(self) -> bool {
1488 if self.features().nll || self.sess.opts.debugging_opts.two_phase_borrows {
1492 match self.sess.edition() {
1493 Edition::Edition2015 => false,
1494 Edition::Edition2018 => true,
1499 /// What mode(s) of borrowck should we run? AST? MIR? both?
1500 /// (Also considers the `#![feature(nll)]` setting.)
1501 pub fn borrowck_mode(&self) -> BorrowckMode {
1502 // Here are the main constraints we need to deal with:
1504 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1505 // synonymous with no `-Z borrowck=...` flag at all.
1506 // (This is arguably a historical accident.)
1508 // 2. `BorrowckMode::Migrate` is the limited migration to
1509 // NLL that we are deploying with the 2018 edition.
1511 // 3. We want to allow developers on the Nightly channel
1512 // to opt back into the "hard error" mode for NLL,
1513 // (which they can do via specifying `#![feature(nll)]`
1514 // explicitly in their crate).
1516 // So, this precedence list is how pnkfelix chose to work with
1517 // the above constraints:
1519 // * `#![feature(nll)]` *always* means use NLL with hard
1520 // errors. (To simplify the code here, it now even overrides
1521 // a user's attempt to specify `-Z borrowck=compare`, which
1522 // we arguably do not need anymore and should remove.)
1524 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1525 // if `borrowck=ast` was specified), then use the default
1526 // as required by the edition.
1528 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1530 if self.features().nll { return BorrowckMode::Mir; }
1532 match self.sess.opts.borrowck_mode {
1533 mode @ BorrowckMode::Mir |
1534 mode @ BorrowckMode::Compare |
1535 mode @ BorrowckMode::Migrate => mode,
1537 BorrowckMode::Ast => match self.sess.edition() {
1538 Edition::Edition2015 => BorrowckMode::Ast,
1539 Edition::Edition2018 => BorrowckMode::Migrate,
1541 // For now, future editions mean Migrate. (But it
1542 // would make a lot of sense for it to be changed to
1543 // `BorrowckMode::Mir`, depending on how we plan to
1544 // time the forcing of full migration to NLL.)
1545 _ => BorrowckMode::Migrate,
1550 /// Should we emit EndRegion MIR statements? These are consumed by
1551 /// MIR borrowck, but not when NLL is used. They are also consumed
1552 /// by the validation stuff.
1553 pub fn emit_end_regions(self) -> bool {
1554 self.sess.opts.debugging_opts.emit_end_regions ||
1555 self.sess.opts.debugging_opts.mir_emit_validate > 0 ||
1556 self.use_mir_borrowck()
1560 pub fn local_crate_exports_generics(self) -> bool {
1561 debug_assert!(self.sess.opts.share_generics());
1563 self.sess.crate_types.borrow().iter().any(|crate_type| {
1565 CrateType::Executable |
1566 CrateType::Staticlib |
1567 CrateType::ProcMacro |
1568 CrateType::Cdylib => false,
1570 CrateType::Dylib => true,
1575 // This method returns the DefId and the BoundRegion corresponding to the given region.
1576 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1577 let (suitable_region_binding_scope, bound_region) = match *region {
1578 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1579 ty::ReEarlyBound(ref ebr) => (
1580 self.parent_def_id(ebr.def_id).unwrap(),
1581 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1583 _ => return None, // not a free region
1586 let node_id = self.hir
1587 .as_local_node_id(suitable_region_binding_scope)
1589 let is_impl_item = match self.hir.find(node_id) {
1590 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1591 Some(Node::ImplItem(..)) => {
1592 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1597 return Some(FreeRegionInfo {
1598 def_id: suitable_region_binding_scope,
1599 boundregion: bound_region,
1600 is_impl_item: is_impl_item,
1604 pub fn return_type_impl_trait(
1606 scope_def_id: DefId,
1607 ) -> Option<Ty<'tcx>> {
1608 let ret_ty = self.type_of(scope_def_id);
1610 ty::FnDef(_, _) => {
1611 let sig = ret_ty.fn_sig(*self);
1612 let output = self.erase_late_bound_regions(&sig.output());
1613 if output.is_impl_trait() {
1623 // Here we check if the bound region is in Impl Item.
1624 pub fn is_bound_region_in_impl_item(
1626 suitable_region_binding_scope: DefId,
1628 let container_id = self.associated_item(suitable_region_binding_scope)
1631 if self.impl_trait_ref(container_id).is_some() {
1632 // For now, we do not try to target impls of traits. This is
1633 // because this message is going to suggest that the user
1634 // change the fn signature, but they may not be free to do so,
1635 // since the signature must match the trait.
1637 // FIXME(#42706) -- in some cases, we could do better here.
1644 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1645 pub fn encode_metadata(self)
1648 self.cstore.encode_metadata(self)
1652 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1653 /// Call the closure with a local `TyCtxt` using the given arena.
1654 pub fn enter_local<F, R>(
1656 arena: &'tcx SyncDroplessArena,
1660 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1662 let interners = CtxtInterners::new(arena);
1665 interners: &interners,
1667 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1668 let new_icx = ty::tls::ImplicitCtxt {
1670 query: icx.query.clone(),
1671 layout_depth: icx.layout_depth,
1674 ty::tls::enter_context(&new_icx, |new_icx| {
1681 /// A trait implemented for all X<'a> types which can be safely and
1682 /// efficiently converted to X<'tcx> as long as they are part of the
1683 /// provided TyCtxt<'tcx>.
1684 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1685 /// by looking them up in their respective interners.
1687 /// However, this is still not the best implementation as it does
1688 /// need to compare the components, even for interned values.
1689 /// It would be more efficient if TypedArena provided a way to
1690 /// determine whether the address is in the allocated range.
1692 /// None is returned if the value or one of the components is not part
1693 /// of the provided context.
1694 /// For Ty, None can be returned if either the type interner doesn't
1695 /// contain the TyKind key or if the address of the interned
1696 /// pointer differs. The latter case is possible if a primitive type,
1697 /// e.g. `()` or `u8`, was interned in a different context.
1698 pub trait Lift<'tcx>: fmt::Debug {
1699 type Lifted: fmt::Debug + 'tcx;
1700 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1703 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1704 type Lifted = Ty<'tcx>;
1705 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1706 if tcx.interners.arena.in_arena(*self as *const _) {
1707 return Some(unsafe { mem::transmute(*self) });
1709 // Also try in the global tcx if we're not that.
1710 if !tcx.is_global() {
1711 self.lift_to_tcx(tcx.global_tcx())
1718 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1719 type Lifted = Region<'tcx>;
1720 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1721 if tcx.interners.arena.in_arena(*self as *const _) {
1722 return Some(unsafe { mem::transmute(*self) });
1724 // Also try in the global tcx if we're not that.
1725 if !tcx.is_global() {
1726 self.lift_to_tcx(tcx.global_tcx())
1733 impl<'a, 'tcx> Lift<'tcx> for Goal<'a> {
1734 type Lifted = Goal<'tcx>;
1735 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Goal<'tcx>> {
1736 if tcx.interners.arena.in_arena(*self as *const _) {
1737 return Some(unsafe { mem::transmute(*self) });
1739 // Also try in the global tcx if we're not that.
1740 if !tcx.is_global() {
1741 self.lift_to_tcx(tcx.global_tcx())
1748 impl<'a, 'tcx> Lift<'tcx> for &'a List<Goal<'a>> {
1749 type Lifted = &'tcx List<Goal<'tcx>>;
1750 fn lift_to_tcx<'b, 'gcx>(
1752 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1753 ) -> Option<&'tcx List<Goal<'tcx>>> {
1754 if tcx.interners.arena.in_arena(*self as *const _) {
1755 return Some(unsafe { mem::transmute(*self) });
1757 // Also try in the global tcx if we're not that.
1758 if !tcx.is_global() {
1759 self.lift_to_tcx(tcx.global_tcx())
1766 impl<'a, 'tcx> Lift<'tcx> for &'a List<Clause<'a>> {
1767 type Lifted = &'tcx List<Clause<'tcx>>;
1768 fn lift_to_tcx<'b, 'gcx>(
1770 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1771 ) -> Option<&'tcx List<Clause<'tcx>>> {
1772 if tcx.interners.arena.in_arena(*self as *const _) {
1773 return Some(unsafe { mem::transmute(*self) });
1775 // Also try in the global tcx if we're not that.
1776 if !tcx.is_global() {
1777 self.lift_to_tcx(tcx.global_tcx())
1784 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1785 type Lifted = &'tcx Const<'tcx>;
1786 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1787 if tcx.interners.arena.in_arena(*self as *const _) {
1788 return Some(unsafe { mem::transmute(*self) });
1790 // Also try in the global tcx if we're not that.
1791 if !tcx.is_global() {
1792 self.lift_to_tcx(tcx.global_tcx())
1799 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1800 type Lifted = &'tcx Substs<'tcx>;
1801 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1802 if self.len() == 0 {
1803 return Some(List::empty());
1805 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1806 return Some(unsafe { mem::transmute(*self) });
1808 // Also try in the global tcx if we're not that.
1809 if !tcx.is_global() {
1810 self.lift_to_tcx(tcx.global_tcx())
1817 impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>> {
1818 type Lifted = &'tcx List<Ty<'tcx>>;
1819 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1820 -> Option<&'tcx List<Ty<'tcx>>> {
1821 if self.len() == 0 {
1822 return Some(List::empty());
1824 if tcx.interners.arena.in_arena(*self as *const _) {
1825 return Some(unsafe { mem::transmute(*self) });
1827 // Also try in the global tcx if we're not that.
1828 if !tcx.is_global() {
1829 self.lift_to_tcx(tcx.global_tcx())
1836 impl<'a, 'tcx> Lift<'tcx> for &'a List<ExistentialPredicate<'a>> {
1837 type Lifted = &'tcx List<ExistentialPredicate<'tcx>>;
1838 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1839 -> Option<&'tcx List<ExistentialPredicate<'tcx>>> {
1840 if self.is_empty() {
1841 return Some(List::empty());
1843 if tcx.interners.arena.in_arena(*self as *const _) {
1844 return Some(unsafe { mem::transmute(*self) });
1846 // Also try in the global tcx if we're not that.
1847 if !tcx.is_global() {
1848 self.lift_to_tcx(tcx.global_tcx())
1855 impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>> {
1856 type Lifted = &'tcx List<Predicate<'tcx>>;
1857 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1858 -> Option<&'tcx List<Predicate<'tcx>>> {
1859 if self.is_empty() {
1860 return Some(List::empty());
1862 if tcx.interners.arena.in_arena(*self as *const _) {
1863 return Some(unsafe { mem::transmute(*self) });
1865 // Also try in the global tcx if we're not that.
1866 if !tcx.is_global() {
1867 self.lift_to_tcx(tcx.global_tcx())
1874 impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo> {
1875 type Lifted = &'tcx List<CanonicalVarInfo>;
1876 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1877 if self.len() == 0 {
1878 return Some(List::empty());
1880 if tcx.interners.arena.in_arena(*self as *const _) {
1881 return Some(unsafe { mem::transmute(*self) });
1883 // Also try in the global tcx if we're not that.
1884 if !tcx.is_global() {
1885 self.lift_to_tcx(tcx.global_tcx())
1893 use super::{GlobalCtxt, TyCtxt};
1899 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1900 use rustc_data_structures::OnDrop;
1901 use rustc_data_structures::sync::{self, Lrc, Lock};
1902 use dep_graph::OpenTask;
1904 #[cfg(not(parallel_queries))]
1905 use std::cell::Cell;
1907 #[cfg(parallel_queries)]
1910 /// This is the implicit state of rustc. It contains the current
1911 /// TyCtxt and query. It is updated when creating a local interner or
1912 /// executing a new query. Whenever there's a TyCtxt value available
1913 /// you should also have access to an ImplicitCtxt through the functions
1916 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1917 /// The current TyCtxt. Initially created by `enter_global` and updated
1918 /// by `enter_local` with a new local interner
1919 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1921 /// The current query job, if any. This is updated by start_job in
1922 /// ty::query::plumbing when executing a query
1923 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1925 /// Used to prevent layout from recursing too deeply.
1926 pub layout_depth: usize,
1928 /// The current dep graph task. This is used to add dependencies to queries
1929 /// when executing them
1930 pub task: &'a OpenTask,
1933 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1934 /// to `value` during the call to `f`. It is restored to its previous value after.
1935 /// This is used to set the pointer to the new ImplicitCtxt.
1936 #[cfg(parallel_queries)]
1937 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1938 rayon_core::tlv::with(value, f)
1941 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1942 /// This is used to get the pointer to the current ImplicitCtxt.
1943 #[cfg(parallel_queries)]
1944 fn get_tlv() -> usize {
1945 rayon_core::tlv::get()
1948 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1949 #[cfg(not(parallel_queries))]
1950 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1952 /// Sets TLV to `value` during the call to `f`.
1953 /// It is restored to its previous value after.
1954 /// This is used to set the pointer to the new ImplicitCtxt.
1955 #[cfg(not(parallel_queries))]
1956 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1957 let old = get_tlv();
1958 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1959 TLV.with(|tlv| tlv.set(value));
1963 /// This is used to get the pointer to the current ImplicitCtxt.
1964 #[cfg(not(parallel_queries))]
1965 fn get_tlv() -> usize {
1966 TLV.with(|tlv| tlv.get())
1969 /// This is a callback from libsyntax as it cannot access the implicit state
1970 /// in librustc otherwise
1971 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1973 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1977 /// This is a callback from libsyntax as it cannot access the implicit state
1978 /// in librustc otherwise. It is used to when diagnostic messages are
1979 /// emitted and stores them in the current query, if there is one.
1980 fn track_diagnostic(diagnostic: &Diagnostic) {
1981 with_context_opt(|icx| {
1982 if let Some(icx) = icx {
1983 if let Some(ref query) = icx.query {
1984 query.diagnostics.lock().push(diagnostic.clone());
1990 /// Sets up the callbacks from libsyntax on the current thread
1991 pub fn with_thread_locals<F, R>(f: F) -> R
1992 where F: FnOnce() -> R
1994 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1995 let original_span_debug = span_dbg.get();
1996 span_dbg.set(span_debug);
1998 let _on_drop = OnDrop(move || {
1999 span_dbg.set(original_span_debug);
2002 TRACK_DIAGNOSTICS.with(|current| {
2003 let original = current.get();
2004 current.set(track_diagnostic);
2006 let _on_drop = OnDrop(move || {
2007 current.set(original);
2015 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
2016 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
2018 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2020 set_tlv(context as *const _ as usize, || {
2025 /// Enters GlobalCtxt by setting up libsyntax callbacks and
2026 /// creating a initial TyCtxt and ImplicitCtxt.
2027 /// This happens once per rustc session and TyCtxts only exists
2028 /// inside the `f` function.
2029 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
2030 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
2032 with_thread_locals(|| {
2033 // Update GCX_PTR to indicate there's a GlobalCtxt available
2034 GCX_PTR.with(|lock| {
2035 *lock.lock() = gcx as *const _ as usize;
2037 // Set GCX_PTR back to 0 when we exit
2038 let _on_drop = OnDrop(move || {
2039 GCX_PTR.with(|lock| *lock.lock() = 0);
2044 interners: &gcx.global_interners,
2046 let icx = ImplicitCtxt {
2050 task: &OpenTask::Ignore,
2052 enter_context(&icx, |_| {
2058 /// Stores a pointer to the GlobalCtxt if one is available.
2059 /// This is used to access the GlobalCtxt in the deadlock handler
2061 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2063 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2064 /// This is used in the deadlock handler.
2065 pub unsafe fn with_global<F, R>(f: F) -> R
2066 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2068 let gcx = GCX_PTR.with(|lock| *lock.lock());
2070 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2073 interners: &gcx.global_interners,
2075 let icx = ImplicitCtxt {
2079 task: &OpenTask::Ignore,
2081 enter_context(&icx, |_| f(tcx))
2084 /// Allows access to the current ImplicitCtxt in a closure if one is available
2085 pub fn with_context_opt<F, R>(f: F) -> R
2086 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2088 let context = get_tlv();
2092 // We could get a ImplicitCtxt pointer from another thread.
2093 // Ensure that ImplicitCtxt is Sync
2094 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2096 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2100 /// Allows access to the current ImplicitCtxt.
2101 /// Panics if there is no ImplicitCtxt available
2102 pub fn with_context<F, R>(f: F) -> R
2103 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2105 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2108 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2109 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2110 /// with the same 'gcx lifetime as the TyCtxt passed in.
2111 /// This will panic if you pass it a TyCtxt which has a different global interner from
2112 /// the current ImplicitCtxt's tcx field.
2113 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2114 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2116 with_context(|context| {
2118 let gcx = tcx.gcx as *const _ as usize;
2119 assert!(context.tcx.gcx as *const _ as usize == gcx);
2120 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2126 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2127 /// interner and local interner as the tcx argument passed in. This means the closure
2128 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2129 /// This will panic if you pass it a TyCtxt which has a different global interner or
2130 /// a different local interner from the current ImplicitCtxt's tcx field.
2131 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2132 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2134 with_context(|context| {
2136 let gcx = tcx.gcx as *const _ as usize;
2137 let interners = tcx.interners as *const _ as usize;
2138 assert!(context.tcx.gcx as *const _ as usize == gcx);
2139 assert!(context.tcx.interners as *const _ as usize == interners);
2140 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2146 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2147 /// Panics if there is no ImplicitCtxt available
2148 pub fn with<F, R>(f: F) -> R
2149 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2151 with_context(|context| f(context.tcx))
2154 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2155 /// The closure is passed None if there is no ImplicitCtxt available
2156 pub fn with_opt<F, R>(f: F) -> R
2157 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2159 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2163 macro_rules! sty_debug_print {
2164 ($ctxt: expr, $($variant: ident),*) => {{
2165 // curious inner module to allow variant names to be used as
2167 #[allow(non_snake_case)]
2169 use ty::{self, TyCtxt};
2170 use ty::context::Interned;
2172 #[derive(Copy, Clone)]
2175 region_infer: usize,
2180 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2181 let mut total = DebugStat {
2183 region_infer: 0, ty_infer: 0, both_infer: 0,
2185 $(let mut $variant = total;)*
2187 for &Interned(t) in tcx.interners.type_.borrow().iter() {
2188 let variant = match t.sty {
2189 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2190 ty::Float(..) | ty::Str | ty::Never => continue,
2191 ty::Error => /* unimportant */ continue,
2192 $(ty::$variant(..) => &mut $variant,)*
2194 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2195 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2199 if region { total.region_infer += 1; variant.region_infer += 1 }
2200 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2201 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2203 println!("Ty interner total ty region both");
2204 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2205 {ty:4.1}% {region:5.1}% {both:4.1}%",
2206 stringify!($variant),
2207 uses = $variant.total,
2208 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2209 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2210 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2211 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2213 println!(" total {uses:6} \
2214 {ty:4.1}% {region:5.1}% {both:4.1}%",
2216 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2217 region = total.region_infer as f64 * 100.0 / total.total as f64,
2218 both = total.both_infer as f64 * 100.0 / total.total as f64)
2226 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2227 pub fn print_debug_stats(self) {
2230 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr,
2231 Generator, GeneratorWitness, Dynamic, Closure, Tuple,
2232 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2234 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2235 println!("Region interner: #{}", self.interners.region.borrow().len());
2236 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2237 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2238 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2243 /// An entry in an interner.
2244 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2246 // NB: An Interned<Ty> compares and hashes as a sty.
2247 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2248 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2249 self.0.sty == other.0.sty
2253 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2255 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2256 fn hash<H: Hasher>(&self, s: &mut H) {
2261 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2262 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2267 // NB: An Interned<List<T>> compares and hashes as its elements.
2268 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2269 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2270 self.0[..] == other.0[..]
2274 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2276 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2277 fn hash<H: Hasher>(&self, s: &mut H) {
2282 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2283 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2288 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2289 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2294 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2295 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2300 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2301 fn borrow<'a>(&'a self) -> &'a RegionKind {
2306 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2307 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2312 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2313 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2314 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2319 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2320 for Interned<'tcx, List<Predicate<'tcx>>> {
2321 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2326 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2327 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2332 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2333 for Interned<'tcx, List<Clause<'tcx>>> {
2334 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2339 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2340 for Interned<'tcx, List<Goal<'tcx>>> {
2341 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2346 macro_rules! intern_method {
2347 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2350 $keep_in_local_tcx:expr) -> $ty:ty) => {
2351 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2352 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2353 let key = ($alloc_to_key)(&v);
2355 // HACK(eddyb) Depend on flags being accurate to
2356 // determine that all contents are in the global tcx.
2357 // See comments on Lift for why we can't use that.
2358 if ($keep_in_local_tcx)(&v) {
2359 let mut interner = self.interners.$name.borrow_mut();
2360 if let Some(&Interned(v)) = interner.get(key) {
2364 // Make sure we don't end up with inference
2365 // types/regions in the global tcx.
2366 if self.is_global() {
2367 bug!("Attempted to intern `{:?}` which contains \
2368 inference types/regions in the global type context",
2372 let i = $alloc_method(&self.interners.arena, v);
2373 interner.insert(Interned(i));
2376 let mut interner = self.global_interners.$name.borrow_mut();
2377 if let Some(&Interned(v)) = interner.get(key) {
2381 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2385 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2387 let i = unsafe { mem::transmute(i) };
2388 interner.insert(Interned(i));
2396 macro_rules! direct_interners {
2397 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2398 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2399 fn eq(&self, other: &Self) -> bool {
2404 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2406 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2407 fn hash<H: Hasher>(&self, s: &mut H) {
2415 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2417 $keep_in_local_tcx) -> $ty);)+
2421 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2422 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2425 direct_interners!('tcx,
2426 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2427 const_: mk_const(|c: &Const<'_>| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>,
2428 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>
2431 macro_rules! slice_interners {
2432 ($($field:ident: $method:ident($ty:ident)),+) => (
2433 $(intern_method!( 'tcx, $field: $method(
2435 |a, v| List::from_arena(a, v),
2437 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2442 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2443 predicates: _intern_predicates(Predicate),
2444 type_list: _intern_type_list(Ty),
2445 substs: _intern_substs(Kind),
2446 clauses: _intern_clauses(Clause),
2447 goal_list: _intern_goals(Goal)
2450 // This isn't a perfect fit: CanonicalVarInfo slices are always
2451 // allocated in the global arena, so this `intern_method!` macro is
2452 // overly general. But we just return false for the code that checks
2453 // whether they belong in the thread-local arena, so no harm done, and
2454 // seems better than open-coding the rest.
2457 canonical_var_infos: _intern_canonical_var_infos(
2458 &[CanonicalVarInfo],
2459 |a, v| List::from_arena(a, v),
2461 |_xs: &[CanonicalVarInfo]| -> bool { false }
2462 ) -> List<CanonicalVarInfo>
2465 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2466 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2467 /// that is, a `fn` type that is equivalent in every way for being
2469 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2470 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2471 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2472 unsafety: hir::Unsafety::Unsafe,
2477 /// Given a closure signature `sig`, returns an equivalent `fn`
2478 /// type with the same signature. Detuples and so forth -- so
2479 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2480 /// a `fn(u32, i32)`.
2481 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2482 let converted_sig = sig.map_bound(|s| {
2483 let params_iter = match s.inputs()[0].sty {
2484 ty::Tuple(params) => {
2485 params.into_iter().cloned()
2493 hir::Unsafety::Normal,
2498 self.mk_fn_ptr(converted_sig)
2501 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2502 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2505 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2507 ast::IntTy::Isize => self.types.isize,
2508 ast::IntTy::I8 => self.types.i8,
2509 ast::IntTy::I16 => self.types.i16,
2510 ast::IntTy::I32 => self.types.i32,
2511 ast::IntTy::I64 => self.types.i64,
2512 ast::IntTy::I128 => self.types.i128,
2516 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2518 ast::UintTy::Usize => self.types.usize,
2519 ast::UintTy::U8 => self.types.u8,
2520 ast::UintTy::U16 => self.types.u16,
2521 ast::UintTy::U32 => self.types.u32,
2522 ast::UintTy::U64 => self.types.u64,
2523 ast::UintTy::U128 => self.types.u128,
2527 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2529 ast::FloatTy::F32 => self.types.f32,
2530 ast::FloatTy::F64 => self.types.f64,
2534 pub fn mk_str(self) -> Ty<'tcx> {
2538 pub fn mk_static_str(self) -> Ty<'tcx> {
2539 self.mk_imm_ref(self.types.re_static, self.mk_str())
2542 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2543 // take a copy of substs so that we own the vectors inside
2544 self.mk_ty(Adt(def, substs))
2547 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2548 self.mk_ty(Foreign(def_id))
2551 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2552 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2553 let adt_def = self.adt_def(def_id);
2554 let substs = Substs::for_item(self, def_id, |param, substs| {
2556 GenericParamDefKind::Lifetime => bug!(),
2557 GenericParamDefKind::Type { has_default, .. } => {
2558 if param.index == 0 {
2561 assert!(has_default);
2562 self.type_of(param.def_id).subst(self, substs).into()
2567 self.mk_ty(Adt(adt_def, substs))
2570 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2571 self.mk_ty(RawPtr(tm))
2574 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2575 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2578 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2579 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2582 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2583 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2586 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2587 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2590 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2591 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2594 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2595 self.mk_imm_ptr(self.mk_unit())
2598 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2599 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2602 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2603 self.mk_ty(Slice(ty))
2606 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2607 self.mk_ty(Tuple(self.intern_type_list(ts)))
2610 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2611 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2614 pub fn mk_unit(self) -> Ty<'tcx> {
2615 self.intern_tup(&[])
2618 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2619 if self.features().never_type {
2622 self.intern_tup(&[])
2626 pub fn mk_bool(self) -> Ty<'tcx> {
2630 pub fn mk_fn_def(self, def_id: DefId,
2631 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2632 self.mk_ty(FnDef(def_id, substs))
2635 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2636 self.mk_ty(FnPtr(fty))
2641 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2642 reg: ty::Region<'tcx>
2644 self.mk_ty(Dynamic(obj, reg))
2647 pub fn mk_projection(self,
2649 substs: &'tcx Substs<'tcx>)
2651 self.mk_ty(Projection(ProjectionTy {
2657 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2659 self.mk_ty(Closure(closure_id, closure_substs))
2662 pub fn mk_generator(self,
2664 generator_substs: GeneratorSubsts<'tcx>,
2665 movability: hir::GeneratorMovability)
2667 self.mk_ty(Generator(id, generator_substs, movability))
2670 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2671 self.mk_ty(GeneratorWitness(types))
2674 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2675 self.mk_infer(TyVar(v))
2678 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2679 self.mk_infer(IntVar(v))
2682 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2683 self.mk_infer(FloatVar(v))
2686 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2687 self.mk_ty(Infer(it))
2690 pub fn mk_ty_param(self,
2692 name: InternedString) -> Ty<'tcx> {
2693 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2696 pub fn mk_self_type(self) -> Ty<'tcx> {
2697 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2700 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2702 GenericParamDefKind::Lifetime => {
2703 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2705 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2709 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2710 self.mk_ty(Opaque(def_id, substs))
2713 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2714 -> &'tcx List<ExistentialPredicate<'tcx>> {
2715 assert!(!eps.is_empty());
2716 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2717 self._intern_existential_predicates(eps)
2720 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2721 -> &'tcx List<Predicate<'tcx>> {
2722 // FIXME consider asking the input slice to be sorted to avoid
2723 // re-interning permutations, in which case that would be asserted
2725 if preds.len() == 0 {
2726 // The macro-generated method below asserts we don't intern an empty slice.
2729 self._intern_predicates(preds)
2733 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2737 self._intern_type_list(ts)
2741 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2745 self._intern_substs(ts)
2749 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2753 self.global_tcx()._intern_canonical_var_infos(ts)
2757 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2761 self._intern_clauses(ts)
2765 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2769 self._intern_goals(ts)
2773 pub fn mk_fn_sig<I>(self,
2777 unsafety: hir::Unsafety,
2779 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2781 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2783 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2784 inputs_and_output: self.intern_type_list(xs),
2785 variadic, unsafety, abi
2789 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2790 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2792 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2795 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2796 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2798 iter.intern_with(|xs| self.intern_predicates(xs))
2801 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2802 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2803 iter.intern_with(|xs| self.intern_type_list(xs))
2806 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2807 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2808 iter.intern_with(|xs| self.intern_substs(xs))
2811 pub fn mk_substs_trait(self,
2813 rest: &[Kind<'tcx>])
2814 -> &'tcx Substs<'tcx>
2816 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2819 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2820 iter.intern_with(|xs| self.intern_clauses(xs))
2823 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2824 iter.intern_with(|xs| self.intern_goals(xs))
2827 pub fn lint_hir<S: Into<MultiSpan>>(self,
2828 lint: &'static Lint,
2832 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2835 pub fn lint_node<S: Into<MultiSpan>>(self,
2836 lint: &'static Lint,
2840 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2843 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2844 lint: &'static Lint,
2849 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2854 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2855 lint: &'static Lint,
2860 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2865 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2866 -> (lint::Level, lint::LintSource)
2868 // Right now we insert a `with_ignore` node in the dep graph here to
2869 // ignore the fact that `lint_levels` below depends on the entire crate.
2870 // For now this'll prevent false positives of recompiling too much when
2871 // anything changes.
2873 // Once red/green incremental compilation lands we should be able to
2874 // remove this because while the crate changes often the lint level map
2875 // will change rarely.
2876 self.dep_graph.with_ignore(|| {
2877 let sets = self.lint_levels(LOCAL_CRATE);
2879 let hir_id = self.hir.definitions().node_to_hir_id(id);
2880 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2883 let next = self.hir.get_parent_node(id);
2885 bug!("lint traversal reached the root of the crate");
2892 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2893 lint: &'static Lint,
2897 -> DiagnosticBuilder<'tcx>
2899 let node_id = self.hir.hir_to_node_id(hir_id);
2900 let (level, src) = self.lint_level_at_node(lint, node_id);
2901 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2904 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2905 lint: &'static Lint,
2909 -> DiagnosticBuilder<'tcx>
2911 let (level, src) = self.lint_level_at_node(lint, id);
2912 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2915 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2916 -> DiagnosticBuilder<'tcx>
2918 let (level, src) = self.lint_level_at_node(lint, id);
2919 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2922 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2923 self.in_scope_traits_map(id.owner)
2924 .and_then(|map| map.get(&id.local_id).cloned())
2927 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2928 self.named_region_map(id.owner)
2929 .and_then(|map| map.get(&id.local_id).cloned())
2932 pub fn is_late_bound(self, id: HirId) -> bool {
2933 self.is_late_bound_map(id.owner)
2934 .map(|set| set.contains(&id.local_id))
2938 pub fn object_lifetime_defaults(self, id: HirId)
2939 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2941 self.object_lifetime_defaults_map(id.owner)
2942 .and_then(|map| map.get(&id.local_id).cloned())
2946 pub trait InternAs<T: ?Sized, R> {
2948 fn intern_with<F>(self, f: F) -> Self::Output
2949 where F: FnOnce(&T) -> R;
2952 impl<I, T, R, E> InternAs<[T], R> for I
2953 where E: InternIteratorElement<T, R>,
2954 I: Iterator<Item=E> {
2955 type Output = E::Output;
2956 fn intern_with<F>(self, f: F) -> Self::Output
2957 where F: FnOnce(&[T]) -> R {
2958 E::intern_with(self, f)
2962 pub trait InternIteratorElement<T, R>: Sized {
2964 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2967 impl<T, R> InternIteratorElement<T, R> for T {
2969 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2970 f(&iter.collect::<SmallVec<[_; 8]>>())
2974 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2978 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2979 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2983 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2984 type Output = Result<R, E>;
2985 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2986 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
2990 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2991 // FIXME(#44234) - almost all of these queries have no sub-queries and
2992 // therefore no actual inputs, they're just reading tables calculated in
2993 // resolve! Does this work? Unsure! That's what the issue is about
2994 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2995 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2996 providers.crate_name = |tcx, id| {
2997 assert_eq!(id, LOCAL_CRATE);
3000 providers.get_lib_features = |tcx, id| {
3001 assert_eq!(id, LOCAL_CRATE);
3002 Lrc::new(middle::lib_features::collect(tcx))
3004 providers.get_lang_items = |tcx, id| {
3005 assert_eq!(id, LOCAL_CRATE);
3006 Lrc::new(middle::lang_items::collect(tcx))
3008 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3009 providers.maybe_unused_trait_import = |tcx, id| {
3010 tcx.maybe_unused_trait_imports.contains(&id)
3012 providers.maybe_unused_extern_crates = |tcx, cnum| {
3013 assert_eq!(cnum, LOCAL_CRATE);
3014 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3017 providers.stability_index = |tcx, cnum| {
3018 assert_eq!(cnum, LOCAL_CRATE);
3019 Lrc::new(stability::Index::new(tcx))
3021 providers.lookup_stability = |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_stability(id)
3026 providers.lookup_deprecation_entry = |tcx, id| {
3027 assert_eq!(id.krate, LOCAL_CRATE);
3028 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3029 tcx.stability().local_deprecation_entry(id)
3031 providers.extern_mod_stmt_cnum = |tcx, id| {
3032 let id = tcx.hir.as_local_node_id(id).unwrap();
3033 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3035 providers.all_crate_nums = |tcx, cnum| {
3036 assert_eq!(cnum, LOCAL_CRATE);
3037 Lrc::new(tcx.cstore.crates_untracked())
3039 providers.postorder_cnums = |tcx, cnum| {
3040 assert_eq!(cnum, LOCAL_CRATE);
3041 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3043 providers.output_filenames = |tcx, cnum| {
3044 assert_eq!(cnum, LOCAL_CRATE);
3045 tcx.output_filenames.clone()
3047 providers.features_query = |tcx, cnum| {
3048 assert_eq!(cnum, LOCAL_CRATE);
3049 Lrc::new(tcx.sess.features_untracked().clone())
3051 providers.is_panic_runtime = |tcx, cnum| {
3052 assert_eq!(cnum, LOCAL_CRATE);
3053 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
3055 providers.is_compiler_builtins = |tcx, cnum| {
3056 assert_eq!(cnum, LOCAL_CRATE);
3057 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")