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")]
833 static ASSERT_TY_KIND: () =
834 [()][!(::std::mem::size_of::<ty::TyKind<'_>>() <= 24) as usize];
835 #[cfg(target_pointer_width = "64")]
837 static ASSERT_TYS: () = [()][!(::std::mem::size_of::<ty::TyS<'_>>() <= 32) as usize];
839 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
840 let mk_region = |r| {
841 if let Some(r) = interners.region.borrow().get(&r) {
844 let r = interners.arena.alloc(r);
845 interners.region.borrow_mut().insert(Interned(r));
853 isize: mk(Int(ast::IntTy::Isize)),
854 i8: mk(Int(ast::IntTy::I8)),
855 i16: mk(Int(ast::IntTy::I16)),
856 i32: mk(Int(ast::IntTy::I32)),
857 i64: mk(Int(ast::IntTy::I64)),
858 i128: mk(Int(ast::IntTy::I128)),
859 usize: mk(Uint(ast::UintTy::Usize)),
860 u8: mk(Uint(ast::UintTy::U8)),
861 u16: mk(Uint(ast::UintTy::U16)),
862 u32: mk(Uint(ast::UintTy::U32)),
863 u64: mk(Uint(ast::UintTy::U64)),
864 u128: mk(Uint(ast::UintTy::U128)),
865 f32: mk(Float(ast::FloatTy::F32)),
866 f64: mk(Float(ast::FloatTy::F64)),
868 re_empty: mk_region(RegionKind::ReEmpty),
869 re_static: mk_region(RegionKind::ReStatic),
870 re_erased: mk_region(RegionKind::ReErased),
875 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
878 pub struct FreeRegionInfo {
879 // def id corresponding to FreeRegion
881 // the bound region corresponding to FreeRegion
882 pub boundregion: ty::BoundRegion,
883 // checks if bound region is in Impl Item
884 pub is_impl_item: bool,
887 /// The central data structure of the compiler. It stores references
888 /// to the various **arenas** and also houses the results of the
889 /// various **compiler queries** that have been performed. See the
890 /// [rustc guide] for more details.
892 /// [rustc guide]: https://rust-lang-nursery.github.io/rustc-guide/ty.html
893 #[derive(Copy, Clone)]
894 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
895 gcx: &'a GlobalCtxt<'gcx>,
896 interners: &'a CtxtInterners<'tcx>
899 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
900 type Target = &'a GlobalCtxt<'gcx>;
901 fn deref(&self) -> &Self::Target {
906 pub struct GlobalCtxt<'tcx> {
907 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
908 global_interners: CtxtInterners<'tcx>,
910 cstore: &'tcx CrateStoreDyn,
912 pub sess: &'tcx Session,
914 pub dep_graph: DepGraph,
916 /// Common types, pre-interned for your convenience.
917 pub types: CommonTypes<'tcx>,
919 /// Map indicating what traits are in scope for places where this
920 /// is relevant; generated by resolve.
921 trait_map: FxHashMap<DefIndex,
922 Lrc<FxHashMap<ItemLocalId,
923 Lrc<StableVec<TraitCandidate>>>>>,
925 /// Export map produced by name resolution.
926 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
928 pub hir: hir_map::Map<'tcx>,
930 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
931 /// as well as all upstream crates. Only populated in incremental mode.
932 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
934 pub(crate) queries: query::Queries<'tcx>,
936 // Records the free variables referenced by every closure
937 // expression. Do not track deps for this, just recompute it from
938 // scratch every time.
939 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
941 maybe_unused_trait_imports: FxHashSet<DefId>,
943 maybe_unused_extern_crates: Vec<(DefId, Span)>,
945 // Internal cache for metadata decoding. No need to track deps on this.
946 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
948 /// Caches the results of trait selection. This cache is used
949 /// for things that do not have to do with the parameters in scope.
950 pub selection_cache: traits::SelectionCache<'tcx>,
952 /// Caches the results of trait evaluation. This cache is used
953 /// for things that do not have to do with the parameters in scope.
954 /// Merge this with `selection_cache`?
955 pub evaluation_cache: traits::EvaluationCache<'tcx>,
957 /// The definite name of the current crate after taking into account
958 /// attributes, commandline parameters, etc.
959 pub crate_name: Symbol,
961 /// Data layout specification for the current target.
962 pub data_layout: TargetDataLayout,
964 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
966 /// Stores the value of constants (and deduplicates the actual memory)
967 allocation_interner: Lock<FxHashSet<&'tcx Allocation>>,
969 pub alloc_map: Lock<interpret::AllocMap<'tcx, &'tcx Allocation>>,
971 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
973 /// A general purpose channel to throw data out the back towards LLVM worker
976 /// This is intended to only get used during the codegen phase of the compiler
977 /// when satisfying the query for a particular codegen unit. Internally in
978 /// the query it'll send data along this channel to get processed later.
979 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
981 output_filenames: Arc<OutputFilenames>,
984 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
985 /// Get the global TyCtxt.
987 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
990 interners: &self.gcx.global_interners,
994 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
995 self.global_arenas.generics.alloc(generics)
998 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
999 self.global_arenas.steal_mir.alloc(Steal::new(mir))
1002 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
1003 self.global_arenas.mir.alloc(mir)
1006 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1007 self.global_arenas.tables.alloc(tables)
1010 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1011 self.global_arenas.trait_def.alloc(def)
1014 pub fn alloc_adt_def(self,
1017 variants: Vec<ty::VariantDef>,
1019 -> &'gcx ty::AdtDef {
1020 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1021 self.global_arenas.adt_def.alloc(def)
1024 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1025 if bytes.is_empty() {
1028 self.global_interners.arena.alloc_slice(bytes)
1032 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1033 -> &'tcx [&'tcx ty::Const<'tcx>] {
1034 if values.is_empty() {
1037 self.interners.arena.alloc_slice(values)
1041 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1042 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1043 if values.is_empty() {
1046 self.interners.arena.alloc_slice(values)
1050 pub fn intern_const_alloc(
1053 ) -> &'gcx Allocation {
1054 let allocs = &mut self.allocation_interner.borrow_mut();
1055 if let Some(alloc) = allocs.get(&alloc) {
1059 let interned = self.global_arenas.const_allocs.alloc(alloc);
1060 if let Some(prev) = allocs.replace(interned) { // insert into interner
1061 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1066 /// Allocates a byte or string literal for `mir::interpret`, read-only
1067 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1068 // create an allocation that just contains these bytes
1069 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1070 let alloc = self.intern_const_alloc(alloc);
1071 self.alloc_map.lock().allocate(alloc)
1074 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1075 let mut stability_interner = self.stability_interner.borrow_mut();
1076 if let Some(st) = stability_interner.get(&stab) {
1080 let interned = self.global_interners.arena.alloc(stab);
1081 if let Some(prev) = stability_interner.replace(interned) {
1082 bug!("Tried to overwrite interned Stability: {:?}", prev)
1087 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1088 let mut layout_interner = self.layout_interner.borrow_mut();
1089 if let Some(layout) = layout_interner.get(&layout) {
1093 let interned = self.global_arenas.layout.alloc(layout);
1094 if let Some(prev) = layout_interner.replace(interned) {
1095 bug!("Tried to overwrite interned Layout: {:?}", prev)
1100 /// Returns a range of the start/end indices specified with the
1101 /// `rustc_layout_scalar_valid_range` attribute.
1102 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1103 let attrs = self.get_attrs(def_id);
1105 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1107 None => return Bound::Unbounded,
1109 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1110 match meta.literal().expect("attribute takes lit").node {
1111 ast::LitKind::Int(a, _) => return Bound::Included(a),
1112 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1115 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1117 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1120 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1121 value.lift_to_tcx(self)
1124 /// Like lift, but only tries in the global tcx.
1125 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1126 value.lift_to_tcx(self.global_tcx())
1129 /// Returns true if self is the same as self.global_tcx().
1130 fn is_global(self) -> bool {
1131 let local = self.interners as *const _;
1132 let global = &self.global_interners as *const _;
1133 local as usize == global as usize
1136 /// Create a type context and call the closure with a `TyCtxt` reference
1137 /// to the context. The closure enforces that the type context and any interned
1138 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1139 /// reference to the context, to allow formatting values that need it.
1140 pub fn create_and_enter<F, R>(s: &'tcx Session,
1141 cstore: &'tcx CrateStoreDyn,
1142 local_providers: ty::query::Providers<'tcx>,
1143 extern_providers: ty::query::Providers<'tcx>,
1144 arenas: &'tcx AllArenas<'tcx>,
1145 resolutions: ty::Resolutions,
1146 hir: hir_map::Map<'tcx>,
1147 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1149 tx: mpsc::Sender<Box<dyn Any + Send>>,
1150 output_filenames: &OutputFilenames,
1152 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1154 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1157 let interners = CtxtInterners::new(&arenas.interner);
1158 let common_types = CommonTypes::new(&interners);
1159 let dep_graph = hir.dep_graph.clone();
1160 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1161 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1162 providers[LOCAL_CRATE] = local_providers;
1164 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1165 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1168 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1171 let def_path_tables = || {
1172 upstream_def_path_tables
1174 .map(|&(cnum, ref rc)| (cnum, &**rc))
1175 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1178 // Precompute the capacity of the hashmap so we don't have to
1179 // re-allocate when populating it.
1180 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1182 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1184 ::std::default::Default::default()
1187 for (cnum, def_path_table) in def_path_tables() {
1188 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1196 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap();
1197 for (k, v) in resolutions.trait_map {
1198 let hir_id = hir.node_to_hir_id(k);
1199 let map = trait_map.entry(hir_id.owner).or_default();
1200 Lrc::get_mut(map).unwrap()
1201 .insert(hir_id.local_id,
1202 Lrc::new(StableVec::new(v)));
1205 let gcx = &GlobalCtxt {
1208 global_arenas: &arenas.global,
1209 global_interners: interners,
1210 dep_graph: dep_graph.clone(),
1211 types: common_types,
1213 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1216 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1217 (hir.local_def_id(k), Lrc::new(v))
1219 maybe_unused_trait_imports:
1220 resolutions.maybe_unused_trait_imports
1222 .map(|id| hir.local_def_id(id))
1224 maybe_unused_extern_crates:
1225 resolutions.maybe_unused_extern_crates
1227 .map(|(id, sp)| (hir.local_def_id(id), sp))
1230 def_path_hash_to_def_id,
1231 queries: query::Queries::new(
1234 on_disk_query_result_cache,
1236 rcache: Lock::new(FxHashMap()),
1237 selection_cache: traits::SelectionCache::new(),
1238 evaluation_cache: traits::EvaluationCache::new(),
1239 crate_name: Symbol::intern(crate_name),
1241 layout_interner: Lock::new(FxHashSet()),
1242 stability_interner: Lock::new(FxHashSet()),
1243 allocation_interner: Lock::new(FxHashSet()),
1244 alloc_map: Lock::new(interpret::AllocMap::new()),
1245 tx_to_llvm_workers: Lock::new(tx),
1246 output_filenames: Arc::new(output_filenames.clone()),
1249 sync::assert_send_val(&gcx);
1251 tls::enter_global(gcx, f)
1254 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1255 let cname = self.crate_name(LOCAL_CRATE).as_str();
1256 self.sess.consider_optimizing(&cname, msg)
1259 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1260 self.get_lib_features(LOCAL_CRATE)
1263 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1264 self.get_lang_items(LOCAL_CRATE)
1267 /// Due to missing llvm support for lowering 128 bit math to software emulation
1268 /// (on some targets), the lowering can be done in MIR.
1270 /// This function only exists until said support is implemented.
1271 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1272 let items = self.lang_items();
1273 let def_id = Some(def_id);
1274 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1275 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1276 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1277 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1278 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1279 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1280 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1281 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1282 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1283 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1284 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1285 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1286 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1287 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1288 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1289 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1290 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1291 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1292 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1293 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1294 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1295 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1296 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1297 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1301 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1302 self.stability_index(LOCAL_CRATE)
1305 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1306 self.all_crate_nums(LOCAL_CRATE)
1309 pub fn features(self) -> Lrc<feature_gate::Features> {
1310 self.features_query(LOCAL_CRATE)
1313 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1315 self.hir.def_key(id)
1317 self.cstore.def_key(id)
1321 /// Convert a `DefId` into its fully expanded `DefPath` (every
1322 /// `DefId` is really just an interned def-path).
1324 /// Note that if `id` is not local to this crate, the result will
1325 /// be a non-local `DefPath`.
1326 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1328 self.hir.def_path(id)
1330 self.cstore.def_path(id)
1335 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1336 if def_id.is_local() {
1337 self.hir.definitions().def_path_hash(def_id.index)
1339 self.cstore.def_path_hash(def_id)
1343 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1344 // We are explicitly not going through queries here in order to get
1345 // crate name and disambiguator since this code is called from debug!()
1346 // statements within the query system and we'd run into endless
1347 // recursion otherwise.
1348 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1349 (self.crate_name.clone(),
1350 self.sess.local_crate_disambiguator())
1352 (self.cstore.crate_name_untracked(def_id.krate),
1353 self.cstore.crate_disambiguator_untracked(def_id.krate))
1358 // Don't print the whole crate disambiguator. That's just
1359 // annoying in debug output.
1360 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1361 self.def_path(def_id).to_string_no_crate())
1364 pub fn metadata_encoding_version(self) -> Vec<u8> {
1365 self.cstore.metadata_encoding_version().to_vec()
1368 // Note that this is *untracked* and should only be used within the query
1369 // system if the result is otherwise tracked through queries
1370 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1371 self.cstore.crate_data_as_rc_any(cnum)
1374 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1375 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1377 StableHashingContext::new(self.sess,
1379 self.hir.definitions(),
1383 // This method makes sure that we have a DepNode and a Fingerprint for
1384 // every upstream crate. It needs to be called once right after the tcx is
1386 // With full-fledged red/green, the method will probably become unnecessary
1387 // as this will be done on-demand.
1388 pub fn allocate_metadata_dep_nodes(self) {
1389 // We cannot use the query versions of crates() and crate_hash(), since
1390 // those would need the DepNodes that we are allocating here.
1391 for cnum in self.cstore.crates_untracked() {
1392 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1393 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1394 self.dep_graph.with_task(dep_node,
1397 |_, x| x // No transformation needed
1402 // This method exercises the `in_scope_traits_map` query for all possible
1403 // values so that we have their fingerprints available in the DepGraph.
1404 // This is only required as long as we still use the old dependency tracking
1405 // which needs to have the fingerprints of all input nodes beforehand.
1406 pub fn precompute_in_scope_traits_hashes(self) {
1407 for &def_index in self.trait_map.keys() {
1408 self.in_scope_traits_map(def_index);
1412 pub fn serialize_query_result_cache<E>(self,
1414 -> Result<(), E::Error>
1415 where E: ty::codec::TyEncoder
1417 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1420 /// This checks whether one is allowed to have pattern bindings
1421 /// that bind-by-move on a match arm that has a guard, e.g.:
1424 /// match foo { A(inner) if { /* something */ } => ..., ... }
1427 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1428 /// because that method has a narrower effect that can be toggled
1429 /// off via a separate `-Z` flag, at least for the short term.
1430 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1431 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1434 /// If true, we should use a naive AST walk to determine if match
1435 /// guard could perform bad mutations (or mutable-borrows).
1436 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1437 // If someone requests the feature, then be a little more
1438 // careful and ensure that MIR-borrowck is enabled (which can
1439 // happen via edition selection, via `feature(nll)`, or via an
1440 // appropriate `-Z` flag) before disabling the mutation check.
1441 if self.allow_bind_by_move_patterns_with_guards() {
1448 /// If true, we should use the AST-based borrowck (we may *also* use
1449 /// the MIR-based borrowck).
1450 pub fn use_ast_borrowck(self) -> bool {
1451 self.borrowck_mode().use_ast()
1454 /// If true, we should use the MIR-based borrowck (we may *also* use
1455 /// the AST-based borrowck).
1456 pub fn use_mir_borrowck(self) -> bool {
1457 self.borrowck_mode().use_mir()
1460 /// If true, we should use the MIR-based borrow check, but also
1461 /// fall back on the AST borrow check if the MIR-based one errors.
1462 pub fn migrate_borrowck(self) -> bool {
1463 self.borrowck_mode().migrate()
1466 /// If true, make MIR codegen for `match` emit a temp that holds a
1467 /// borrow of the input to the match expression.
1468 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1469 self.emit_read_for_match()
1472 /// If true, make MIR codegen for `match` emit FakeRead
1473 /// statements (which simulate the maximal effect of executing the
1474 /// patterns in a match arm).
1475 pub fn emit_read_for_match(&self) -> bool {
1476 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1479 /// If true, pattern variables for use in guards on match arms
1480 /// will be bound as references to the data, and occurrences of
1481 /// those variables in the guard expression will implicitly
1482 /// dereference those bindings. (See rust-lang/rust#27282.)
1483 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1484 self.borrowck_mode().use_mir()
1487 /// If true, we should enable two-phase borrows checks. This is
1488 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1489 /// or by opting into an edition after 2015.
1490 pub fn two_phase_borrows(self) -> bool {
1491 if self.features().nll || self.sess.opts.debugging_opts.two_phase_borrows {
1495 match self.sess.edition() {
1496 Edition::Edition2015 => false,
1497 Edition::Edition2018 => true,
1502 /// What mode(s) of borrowck should we run? AST? MIR? both?
1503 /// (Also considers the `#![feature(nll)]` setting.)
1504 pub fn borrowck_mode(&self) -> BorrowckMode {
1505 // Here are the main constraints we need to deal with:
1507 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1508 // synonymous with no `-Z borrowck=...` flag at all.
1509 // (This is arguably a historical accident.)
1511 // 2. `BorrowckMode::Migrate` is the limited migration to
1512 // NLL that we are deploying with the 2018 edition.
1514 // 3. We want to allow developers on the Nightly channel
1515 // to opt back into the "hard error" mode for NLL,
1516 // (which they can do via specifying `#![feature(nll)]`
1517 // explicitly in their crate).
1519 // So, this precedence list is how pnkfelix chose to work with
1520 // the above constraints:
1522 // * `#![feature(nll)]` *always* means use NLL with hard
1523 // errors. (To simplify the code here, it now even overrides
1524 // a user's attempt to specify `-Z borrowck=compare`, which
1525 // we arguably do not need anymore and should remove.)
1527 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1528 // if `borrowck=ast` was specified), then use the default
1529 // as required by the edition.
1531 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1533 if self.features().nll { return BorrowckMode::Mir; }
1535 match self.sess.opts.borrowck_mode {
1536 mode @ BorrowckMode::Mir |
1537 mode @ BorrowckMode::Compare |
1538 mode @ BorrowckMode::Migrate => mode,
1540 BorrowckMode::Ast => match self.sess.edition() {
1541 Edition::Edition2015 => BorrowckMode::Ast,
1542 Edition::Edition2018 => BorrowckMode::Migrate,
1544 // For now, future editions mean Migrate. (But it
1545 // would make a lot of sense for it to be changed to
1546 // `BorrowckMode::Mir`, depending on how we plan to
1547 // time the forcing of full migration to NLL.)
1548 _ => BorrowckMode::Migrate,
1553 /// Should we emit EndRegion MIR statements? These are consumed by
1554 /// MIR borrowck, but not when NLL is used. They are also consumed
1555 /// by the validation stuff.
1556 pub fn emit_end_regions(self) -> bool {
1557 self.sess.opts.debugging_opts.emit_end_regions ||
1558 self.sess.opts.debugging_opts.mir_emit_validate > 0 ||
1559 self.use_mir_borrowck()
1563 pub fn local_crate_exports_generics(self) -> bool {
1564 debug_assert!(self.sess.opts.share_generics());
1566 self.sess.crate_types.borrow().iter().any(|crate_type| {
1568 CrateType::Executable |
1569 CrateType::Staticlib |
1570 CrateType::ProcMacro |
1571 CrateType::Cdylib => false,
1573 CrateType::Dylib => true,
1578 // This method returns the DefId and the BoundRegion corresponding to the given region.
1579 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1580 let (suitable_region_binding_scope, bound_region) = match *region {
1581 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1582 ty::ReEarlyBound(ref ebr) => (
1583 self.parent_def_id(ebr.def_id).unwrap(),
1584 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1586 _ => return None, // not a free region
1589 let node_id = self.hir
1590 .as_local_node_id(suitable_region_binding_scope)
1592 let is_impl_item = match self.hir.find(node_id) {
1593 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1594 Some(Node::ImplItem(..)) => {
1595 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1600 return Some(FreeRegionInfo {
1601 def_id: suitable_region_binding_scope,
1602 boundregion: bound_region,
1603 is_impl_item: is_impl_item,
1607 pub fn return_type_impl_trait(
1609 scope_def_id: DefId,
1610 ) -> Option<Ty<'tcx>> {
1611 let ret_ty = self.type_of(scope_def_id);
1613 ty::FnDef(_, _) => {
1614 let sig = ret_ty.fn_sig(*self);
1615 let output = self.erase_late_bound_regions(&sig.output());
1616 if output.is_impl_trait() {
1626 // Here we check if the bound region is in Impl Item.
1627 pub fn is_bound_region_in_impl_item(
1629 suitable_region_binding_scope: DefId,
1631 let container_id = self.associated_item(suitable_region_binding_scope)
1634 if self.impl_trait_ref(container_id).is_some() {
1635 // For now, we do not try to target impls of traits. This is
1636 // because this message is going to suggest that the user
1637 // change the fn signature, but they may not be free to do so,
1638 // since the signature must match the trait.
1640 // FIXME(#42706) -- in some cases, we could do better here.
1647 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1648 pub fn encode_metadata(self)
1651 self.cstore.encode_metadata(self)
1655 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1656 /// Call the closure with a local `TyCtxt` using the given arena.
1657 pub fn enter_local<F, R>(
1659 arena: &'tcx SyncDroplessArena,
1663 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1665 let interners = CtxtInterners::new(arena);
1668 interners: &interners,
1670 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1671 let new_icx = ty::tls::ImplicitCtxt {
1673 query: icx.query.clone(),
1674 layout_depth: icx.layout_depth,
1677 ty::tls::enter_context(&new_icx, |new_icx| {
1684 /// A trait implemented for all X<'a> types which can be safely and
1685 /// efficiently converted to X<'tcx> as long as they are part of the
1686 /// provided TyCtxt<'tcx>.
1687 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1688 /// by looking them up in their respective interners.
1690 /// However, this is still not the best implementation as it does
1691 /// need to compare the components, even for interned values.
1692 /// It would be more efficient if TypedArena provided a way to
1693 /// determine whether the address is in the allocated range.
1695 /// None is returned if the value or one of the components is not part
1696 /// of the provided context.
1697 /// For Ty, None can be returned if either the type interner doesn't
1698 /// contain the TyKind key or if the address of the interned
1699 /// pointer differs. The latter case is possible if a primitive type,
1700 /// e.g. `()` or `u8`, was interned in a different context.
1701 pub trait Lift<'tcx>: fmt::Debug {
1702 type Lifted: fmt::Debug + 'tcx;
1703 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1706 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1707 type Lifted = Ty<'tcx>;
1708 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1709 if tcx.interners.arena.in_arena(*self as *const _) {
1710 return Some(unsafe { mem::transmute(*self) });
1712 // Also try in the global tcx if we're not that.
1713 if !tcx.is_global() {
1714 self.lift_to_tcx(tcx.global_tcx())
1721 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1722 type Lifted = Region<'tcx>;
1723 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1724 if tcx.interners.arena.in_arena(*self as *const _) {
1725 return Some(unsafe { mem::transmute(*self) });
1727 // Also try in the global tcx if we're not that.
1728 if !tcx.is_global() {
1729 self.lift_to_tcx(tcx.global_tcx())
1736 impl<'a, 'tcx> Lift<'tcx> for Goal<'a> {
1737 type Lifted = Goal<'tcx>;
1738 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Goal<'tcx>> {
1739 if tcx.interners.arena.in_arena(*self as *const _) {
1740 return Some(unsafe { mem::transmute(*self) });
1742 // Also try in the global tcx if we're not that.
1743 if !tcx.is_global() {
1744 self.lift_to_tcx(tcx.global_tcx())
1751 impl<'a, 'tcx> Lift<'tcx> for &'a List<Goal<'a>> {
1752 type Lifted = &'tcx List<Goal<'tcx>>;
1753 fn lift_to_tcx<'b, 'gcx>(
1755 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1756 ) -> Option<&'tcx List<Goal<'tcx>>> {
1757 if tcx.interners.arena.in_arena(*self as *const _) {
1758 return Some(unsafe { mem::transmute(*self) });
1760 // Also try in the global tcx if we're not that.
1761 if !tcx.is_global() {
1762 self.lift_to_tcx(tcx.global_tcx())
1769 impl<'a, 'tcx> Lift<'tcx> for &'a List<Clause<'a>> {
1770 type Lifted = &'tcx List<Clause<'tcx>>;
1771 fn lift_to_tcx<'b, 'gcx>(
1773 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1774 ) -> Option<&'tcx List<Clause<'tcx>>> {
1775 if tcx.interners.arena.in_arena(*self as *const _) {
1776 return Some(unsafe { mem::transmute(*self) });
1778 // Also try in the global tcx if we're not that.
1779 if !tcx.is_global() {
1780 self.lift_to_tcx(tcx.global_tcx())
1787 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1788 type Lifted = &'tcx Const<'tcx>;
1789 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1790 if tcx.interners.arena.in_arena(*self as *const _) {
1791 return Some(unsafe { mem::transmute(*self) });
1793 // Also try in the global tcx if we're not that.
1794 if !tcx.is_global() {
1795 self.lift_to_tcx(tcx.global_tcx())
1802 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1803 type Lifted = &'tcx Substs<'tcx>;
1804 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1805 if self.len() == 0 {
1806 return Some(List::empty());
1808 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1809 return Some(unsafe { mem::transmute(*self) });
1811 // Also try in the global tcx if we're not that.
1812 if !tcx.is_global() {
1813 self.lift_to_tcx(tcx.global_tcx())
1820 impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>> {
1821 type Lifted = &'tcx List<Ty<'tcx>>;
1822 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1823 -> Option<&'tcx List<Ty<'tcx>>> {
1824 if self.len() == 0 {
1825 return Some(List::empty());
1827 if tcx.interners.arena.in_arena(*self as *const _) {
1828 return Some(unsafe { mem::transmute(*self) });
1830 // Also try in the global tcx if we're not that.
1831 if !tcx.is_global() {
1832 self.lift_to_tcx(tcx.global_tcx())
1839 impl<'a, 'tcx> Lift<'tcx> for &'a List<ExistentialPredicate<'a>> {
1840 type Lifted = &'tcx List<ExistentialPredicate<'tcx>>;
1841 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1842 -> Option<&'tcx List<ExistentialPredicate<'tcx>>> {
1843 if self.is_empty() {
1844 return Some(List::empty());
1846 if tcx.interners.arena.in_arena(*self as *const _) {
1847 return Some(unsafe { mem::transmute(*self) });
1849 // Also try in the global tcx if we're not that.
1850 if !tcx.is_global() {
1851 self.lift_to_tcx(tcx.global_tcx())
1858 impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>> {
1859 type Lifted = &'tcx List<Predicate<'tcx>>;
1860 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1861 -> Option<&'tcx List<Predicate<'tcx>>> {
1862 if self.is_empty() {
1863 return Some(List::empty());
1865 if tcx.interners.arena.in_arena(*self as *const _) {
1866 return Some(unsafe { mem::transmute(*self) });
1868 // Also try in the global tcx if we're not that.
1869 if !tcx.is_global() {
1870 self.lift_to_tcx(tcx.global_tcx())
1877 impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo> {
1878 type Lifted = &'tcx List<CanonicalVarInfo>;
1879 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1880 if self.len() == 0 {
1881 return Some(List::empty());
1883 if tcx.interners.arena.in_arena(*self as *const _) {
1884 return Some(unsafe { mem::transmute(*self) });
1886 // Also try in the global tcx if we're not that.
1887 if !tcx.is_global() {
1888 self.lift_to_tcx(tcx.global_tcx())
1896 use super::{GlobalCtxt, TyCtxt};
1902 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1903 use rustc_data_structures::OnDrop;
1904 use rustc_data_structures::sync::{self, Lrc, Lock};
1905 use dep_graph::OpenTask;
1907 #[cfg(not(parallel_queries))]
1908 use std::cell::Cell;
1910 #[cfg(parallel_queries)]
1913 /// This is the implicit state of rustc. It contains the current
1914 /// TyCtxt and query. It is updated when creating a local interner or
1915 /// executing a new query. Whenever there's a TyCtxt value available
1916 /// you should also have access to an ImplicitCtxt through the functions
1919 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1920 /// The current TyCtxt. Initially created by `enter_global` and updated
1921 /// by `enter_local` with a new local interner
1922 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1924 /// The current query job, if any. This is updated by start_job in
1925 /// ty::query::plumbing when executing a query
1926 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1928 /// Used to prevent layout from recursing too deeply.
1929 pub layout_depth: usize,
1931 /// The current dep graph task. This is used to add dependencies to queries
1932 /// when executing them
1933 pub task: &'a OpenTask,
1936 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1937 /// to `value` during the call to `f`. It is restored to its previous value after.
1938 /// This is used to set the pointer to the new ImplicitCtxt.
1939 #[cfg(parallel_queries)]
1940 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1941 rayon_core::tlv::with(value, f)
1944 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1945 /// This is used to get the pointer to the current ImplicitCtxt.
1946 #[cfg(parallel_queries)]
1947 fn get_tlv() -> usize {
1948 rayon_core::tlv::get()
1951 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1952 #[cfg(not(parallel_queries))]
1953 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1955 /// Sets TLV to `value` during the call to `f`.
1956 /// It is restored to its previous value after.
1957 /// This is used to set the pointer to the new ImplicitCtxt.
1958 #[cfg(not(parallel_queries))]
1959 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1960 let old = get_tlv();
1961 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1962 TLV.with(|tlv| tlv.set(value));
1966 /// This is used to get the pointer to the current ImplicitCtxt.
1967 #[cfg(not(parallel_queries))]
1968 fn get_tlv() -> usize {
1969 TLV.with(|tlv| tlv.get())
1972 /// This is a callback from libsyntax as it cannot access the implicit state
1973 /// in librustc otherwise
1974 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1976 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1980 /// This is a callback from libsyntax as it cannot access the implicit state
1981 /// in librustc otherwise. It is used to when diagnostic messages are
1982 /// emitted and stores them in the current query, if there is one.
1983 fn track_diagnostic(diagnostic: &Diagnostic) {
1984 with_context_opt(|icx| {
1985 if let Some(icx) = icx {
1986 if let Some(ref query) = icx.query {
1987 query.diagnostics.lock().push(diagnostic.clone());
1993 /// Sets up the callbacks from libsyntax on the current thread
1994 pub fn with_thread_locals<F, R>(f: F) -> R
1995 where F: FnOnce() -> R
1997 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1998 let original_span_debug = span_dbg.get();
1999 span_dbg.set(span_debug);
2001 let _on_drop = OnDrop(move || {
2002 span_dbg.set(original_span_debug);
2005 TRACK_DIAGNOSTICS.with(|current| {
2006 let original = current.get();
2007 current.set(track_diagnostic);
2009 let _on_drop = OnDrop(move || {
2010 current.set(original);
2018 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
2019 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
2021 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2023 set_tlv(context as *const _ as usize, || {
2028 /// Enters GlobalCtxt by setting up libsyntax callbacks and
2029 /// creating a initial TyCtxt and ImplicitCtxt.
2030 /// This happens once per rustc session and TyCtxts only exists
2031 /// inside the `f` function.
2032 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
2033 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
2035 with_thread_locals(|| {
2036 // Update GCX_PTR to indicate there's a GlobalCtxt available
2037 GCX_PTR.with(|lock| {
2038 *lock.lock() = gcx as *const _ as usize;
2040 // Set GCX_PTR back to 0 when we exit
2041 let _on_drop = OnDrop(move || {
2042 GCX_PTR.with(|lock| *lock.lock() = 0);
2047 interners: &gcx.global_interners,
2049 let icx = ImplicitCtxt {
2053 task: &OpenTask::Ignore,
2055 enter_context(&icx, |_| {
2061 /// Stores a pointer to the GlobalCtxt if one is available.
2062 /// This is used to access the GlobalCtxt in the deadlock handler
2064 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2066 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2067 /// This is used in the deadlock handler.
2068 pub unsafe fn with_global<F, R>(f: F) -> R
2069 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2071 let gcx = GCX_PTR.with(|lock| *lock.lock());
2073 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2076 interners: &gcx.global_interners,
2078 let icx = ImplicitCtxt {
2082 task: &OpenTask::Ignore,
2084 enter_context(&icx, |_| f(tcx))
2087 /// Allows access to the current ImplicitCtxt in a closure if one is available
2088 pub fn with_context_opt<F, R>(f: F) -> R
2089 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2091 let context = get_tlv();
2095 // We could get a ImplicitCtxt pointer from another thread.
2096 // Ensure that ImplicitCtxt is Sync
2097 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2099 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2103 /// Allows access to the current ImplicitCtxt.
2104 /// Panics if there is no ImplicitCtxt available
2105 pub fn with_context<F, R>(f: F) -> R
2106 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2108 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2111 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2112 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2113 /// with the same 'gcx lifetime as the TyCtxt passed in.
2114 /// This will panic if you pass it a TyCtxt which has a different global interner from
2115 /// the current ImplicitCtxt's tcx field.
2116 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2117 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2119 with_context(|context| {
2121 let gcx = tcx.gcx as *const _ as usize;
2122 assert!(context.tcx.gcx as *const _ as usize == gcx);
2123 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2129 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2130 /// interner and local interner as the tcx argument passed in. This means the closure
2131 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2132 /// This will panic if you pass it a TyCtxt which has a different global interner or
2133 /// a different local interner from the current ImplicitCtxt's tcx field.
2134 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2135 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2137 with_context(|context| {
2139 let gcx = tcx.gcx as *const _ as usize;
2140 let interners = tcx.interners as *const _ as usize;
2141 assert!(context.tcx.gcx as *const _ as usize == gcx);
2142 assert!(context.tcx.interners as *const _ as usize == interners);
2143 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2149 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2150 /// Panics if there is no ImplicitCtxt available
2151 pub fn with<F, R>(f: F) -> R
2152 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2154 with_context(|context| f(context.tcx))
2157 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2158 /// The closure is passed None if there is no ImplicitCtxt available
2159 pub fn with_opt<F, R>(f: F) -> R
2160 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2162 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2166 macro_rules! sty_debug_print {
2167 ($ctxt: expr, $($variant: ident),*) => {{
2168 // curious inner module to allow variant names to be used as
2170 #[allow(non_snake_case)]
2172 use ty::{self, TyCtxt};
2173 use ty::context::Interned;
2175 #[derive(Copy, Clone)]
2178 region_infer: usize,
2183 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2184 let mut total = DebugStat {
2186 region_infer: 0, ty_infer: 0, both_infer: 0,
2188 $(let mut $variant = total;)*
2190 for &Interned(t) in tcx.interners.type_.borrow().iter() {
2191 let variant = match t.sty {
2192 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2193 ty::Float(..) | ty::Str | ty::Never => continue,
2194 ty::Error => /* unimportant */ continue,
2195 $(ty::$variant(..) => &mut $variant,)*
2197 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2198 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2202 if region { total.region_infer += 1; variant.region_infer += 1 }
2203 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2204 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2206 println!("Ty interner total ty region both");
2207 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2208 {ty:4.1}% {region:5.1}% {both:4.1}%",
2209 stringify!($variant),
2210 uses = $variant.total,
2211 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2212 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2213 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2214 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2216 println!(" total {uses:6} \
2217 {ty:4.1}% {region:5.1}% {both:4.1}%",
2219 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2220 region = total.region_infer as f64 * 100.0 / total.total as f64,
2221 both = total.both_infer as f64 * 100.0 / total.total as f64)
2229 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2230 pub fn print_debug_stats(self) {
2233 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr,
2234 Generator, GeneratorWitness, Dynamic, Closure, Tuple,
2235 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2237 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2238 println!("Region interner: #{}", self.interners.region.borrow().len());
2239 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2240 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2241 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2246 /// An entry in an interner.
2247 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2249 // NB: An Interned<Ty> compares and hashes as a sty.
2250 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2251 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2252 self.0.sty == other.0.sty
2256 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2258 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2259 fn hash<H: Hasher>(&self, s: &mut H) {
2264 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2265 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2270 // NB: An Interned<List<T>> compares and hashes as its elements.
2271 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2272 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2273 self.0[..] == other.0[..]
2277 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2279 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2280 fn hash<H: Hasher>(&self, s: &mut H) {
2285 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2286 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2291 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2292 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2297 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2298 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2303 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2304 fn borrow<'a>(&'a self) -> &'a RegionKind {
2309 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2310 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2315 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2316 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2317 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2322 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2323 for Interned<'tcx, List<Predicate<'tcx>>> {
2324 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2329 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2330 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2335 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2336 for Interned<'tcx, List<Clause<'tcx>>> {
2337 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2342 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2343 for Interned<'tcx, List<Goal<'tcx>>> {
2344 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2349 macro_rules! intern_method {
2350 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2353 $keep_in_local_tcx:expr) -> $ty:ty) => {
2354 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2355 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2356 let key = ($alloc_to_key)(&v);
2358 // HACK(eddyb) Depend on flags being accurate to
2359 // determine that all contents are in the global tcx.
2360 // See comments on Lift for why we can't use that.
2361 if ($keep_in_local_tcx)(&v) {
2362 let mut interner = self.interners.$name.borrow_mut();
2363 if let Some(&Interned(v)) = interner.get(key) {
2367 // Make sure we don't end up with inference
2368 // types/regions in the global tcx.
2369 if self.is_global() {
2370 bug!("Attempted to intern `{:?}` which contains \
2371 inference types/regions in the global type context",
2375 let i = $alloc_method(&self.interners.arena, v);
2376 interner.insert(Interned(i));
2379 let mut interner = self.global_interners.$name.borrow_mut();
2380 if let Some(&Interned(v)) = interner.get(key) {
2384 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2388 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2390 let i = unsafe { mem::transmute(i) };
2391 interner.insert(Interned(i));
2399 macro_rules! direct_interners {
2400 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2401 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2402 fn eq(&self, other: &Self) -> bool {
2407 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2409 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2410 fn hash<H: Hasher>(&self, s: &mut H) {
2418 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2420 $keep_in_local_tcx) -> $ty);)+
2424 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2425 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2428 direct_interners!('tcx,
2429 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2430 const_: mk_const(|c: &Const<'_>| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>,
2431 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>
2434 macro_rules! slice_interners {
2435 ($($field:ident: $method:ident($ty:ident)),+) => (
2436 $(intern_method!( 'tcx, $field: $method(
2438 |a, v| List::from_arena(a, v),
2440 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2445 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2446 predicates: _intern_predicates(Predicate),
2447 type_list: _intern_type_list(Ty),
2448 substs: _intern_substs(Kind),
2449 clauses: _intern_clauses(Clause),
2450 goal_list: _intern_goals(Goal)
2453 // This isn't a perfect fit: CanonicalVarInfo slices are always
2454 // allocated in the global arena, so this `intern_method!` macro is
2455 // overly general. But we just return false for the code that checks
2456 // whether they belong in the thread-local arena, so no harm done, and
2457 // seems better than open-coding the rest.
2460 canonical_var_infos: _intern_canonical_var_infos(
2461 &[CanonicalVarInfo],
2462 |a, v| List::from_arena(a, v),
2464 |_xs: &[CanonicalVarInfo]| -> bool { false }
2465 ) -> List<CanonicalVarInfo>
2468 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2469 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2470 /// that is, a `fn` type that is equivalent in every way for being
2472 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2473 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2474 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2475 unsafety: hir::Unsafety::Unsafe,
2480 /// Given a closure signature `sig`, returns an equivalent `fn`
2481 /// type with the same signature. Detuples and so forth -- so
2482 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2483 /// a `fn(u32, i32)`.
2484 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2485 let converted_sig = sig.map_bound(|s| {
2486 let params_iter = match s.inputs()[0].sty {
2487 ty::Tuple(params) => {
2488 params.into_iter().cloned()
2496 hir::Unsafety::Normal,
2501 self.mk_fn_ptr(converted_sig)
2504 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2505 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2508 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2510 ast::IntTy::Isize => self.types.isize,
2511 ast::IntTy::I8 => self.types.i8,
2512 ast::IntTy::I16 => self.types.i16,
2513 ast::IntTy::I32 => self.types.i32,
2514 ast::IntTy::I64 => self.types.i64,
2515 ast::IntTy::I128 => self.types.i128,
2519 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2521 ast::UintTy::Usize => self.types.usize,
2522 ast::UintTy::U8 => self.types.u8,
2523 ast::UintTy::U16 => self.types.u16,
2524 ast::UintTy::U32 => self.types.u32,
2525 ast::UintTy::U64 => self.types.u64,
2526 ast::UintTy::U128 => self.types.u128,
2530 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2532 ast::FloatTy::F32 => self.types.f32,
2533 ast::FloatTy::F64 => self.types.f64,
2537 pub fn mk_str(self) -> Ty<'tcx> {
2541 pub fn mk_static_str(self) -> Ty<'tcx> {
2542 self.mk_imm_ref(self.types.re_static, self.mk_str())
2545 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2546 // take a copy of substs so that we own the vectors inside
2547 self.mk_ty(Adt(def, substs))
2550 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2551 self.mk_ty(Foreign(def_id))
2554 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2555 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2556 let adt_def = self.adt_def(def_id);
2557 let substs = Substs::for_item(self, def_id, |param, substs| {
2559 GenericParamDefKind::Lifetime => bug!(),
2560 GenericParamDefKind::Type { has_default, .. } => {
2561 if param.index == 0 {
2564 assert!(has_default);
2565 self.type_of(param.def_id).subst(self, substs).into()
2570 self.mk_ty(Adt(adt_def, substs))
2573 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2574 self.mk_ty(RawPtr(tm))
2577 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2578 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2581 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2582 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2585 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2586 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2589 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2590 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2593 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2594 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2597 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2598 self.mk_imm_ptr(self.mk_unit())
2601 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2602 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2605 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2606 self.mk_ty(Slice(ty))
2609 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2610 self.mk_ty(Tuple(self.intern_type_list(ts)))
2613 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2614 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2617 pub fn mk_unit(self) -> Ty<'tcx> {
2618 self.intern_tup(&[])
2621 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2622 if self.features().never_type {
2625 self.intern_tup(&[])
2629 pub fn mk_bool(self) -> Ty<'tcx> {
2633 pub fn mk_fn_def(self, def_id: DefId,
2634 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2635 self.mk_ty(FnDef(def_id, substs))
2638 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2639 self.mk_ty(FnPtr(fty))
2644 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2645 reg: ty::Region<'tcx>
2647 self.mk_ty(Dynamic(obj, reg))
2650 pub fn mk_projection(self,
2652 substs: &'tcx Substs<'tcx>)
2654 self.mk_ty(Projection(ProjectionTy {
2660 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2662 self.mk_ty(Closure(closure_id, closure_substs))
2665 pub fn mk_generator(self,
2667 generator_substs: GeneratorSubsts<'tcx>,
2668 movability: hir::GeneratorMovability)
2670 self.mk_ty(Generator(id, generator_substs, movability))
2673 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2674 self.mk_ty(GeneratorWitness(types))
2677 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2678 self.mk_infer(TyVar(v))
2681 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2682 self.mk_infer(IntVar(v))
2685 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2686 self.mk_infer(FloatVar(v))
2689 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2690 self.mk_ty(Infer(it))
2693 pub fn mk_ty_param(self,
2695 name: InternedString) -> Ty<'tcx> {
2696 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2699 pub fn mk_self_type(self) -> Ty<'tcx> {
2700 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2703 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2705 GenericParamDefKind::Lifetime => {
2706 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2708 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2712 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2713 self.mk_ty(Opaque(def_id, substs))
2716 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2717 -> &'tcx List<ExistentialPredicate<'tcx>> {
2718 assert!(!eps.is_empty());
2719 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2720 self._intern_existential_predicates(eps)
2723 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2724 -> &'tcx List<Predicate<'tcx>> {
2725 // FIXME consider asking the input slice to be sorted to avoid
2726 // re-interning permutations, in which case that would be asserted
2728 if preds.len() == 0 {
2729 // The macro-generated method below asserts we don't intern an empty slice.
2732 self._intern_predicates(preds)
2736 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2740 self._intern_type_list(ts)
2744 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2748 self._intern_substs(ts)
2752 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2756 self.global_tcx()._intern_canonical_var_infos(ts)
2760 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2764 self._intern_clauses(ts)
2768 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2772 self._intern_goals(ts)
2776 pub fn mk_fn_sig<I>(self,
2780 unsafety: hir::Unsafety,
2782 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2784 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2786 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2787 inputs_and_output: self.intern_type_list(xs),
2788 variadic, unsafety, abi
2792 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2793 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2795 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2798 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2799 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2801 iter.intern_with(|xs| self.intern_predicates(xs))
2804 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2805 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2806 iter.intern_with(|xs| self.intern_type_list(xs))
2809 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2810 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2811 iter.intern_with(|xs| self.intern_substs(xs))
2814 pub fn mk_substs_trait(self,
2816 rest: &[Kind<'tcx>])
2817 -> &'tcx Substs<'tcx>
2819 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2822 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2823 iter.intern_with(|xs| self.intern_clauses(xs))
2826 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2827 iter.intern_with(|xs| self.intern_goals(xs))
2830 pub fn lint_hir<S: Into<MultiSpan>>(self,
2831 lint: &'static Lint,
2835 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2838 pub fn lint_node<S: Into<MultiSpan>>(self,
2839 lint: &'static Lint,
2843 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2846 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2847 lint: &'static Lint,
2852 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2857 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2858 lint: &'static Lint,
2863 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2868 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2869 -> (lint::Level, lint::LintSource)
2871 // Right now we insert a `with_ignore` node in the dep graph here to
2872 // ignore the fact that `lint_levels` below depends on the entire crate.
2873 // For now this'll prevent false positives of recompiling too much when
2874 // anything changes.
2876 // Once red/green incremental compilation lands we should be able to
2877 // remove this because while the crate changes often the lint level map
2878 // will change rarely.
2879 self.dep_graph.with_ignore(|| {
2880 let sets = self.lint_levels(LOCAL_CRATE);
2882 let hir_id = self.hir.definitions().node_to_hir_id(id);
2883 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2886 let next = self.hir.get_parent_node(id);
2888 bug!("lint traversal reached the root of the crate");
2895 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2896 lint: &'static Lint,
2900 -> DiagnosticBuilder<'tcx>
2902 let node_id = self.hir.hir_to_node_id(hir_id);
2903 let (level, src) = self.lint_level_at_node(lint, node_id);
2904 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2907 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2908 lint: &'static Lint,
2912 -> DiagnosticBuilder<'tcx>
2914 let (level, src) = self.lint_level_at_node(lint, id);
2915 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2918 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2919 -> DiagnosticBuilder<'tcx>
2921 let (level, src) = self.lint_level_at_node(lint, id);
2922 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2925 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2926 self.in_scope_traits_map(id.owner)
2927 .and_then(|map| map.get(&id.local_id).cloned())
2930 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2931 self.named_region_map(id.owner)
2932 .and_then(|map| map.get(&id.local_id).cloned())
2935 pub fn is_late_bound(self, id: HirId) -> bool {
2936 self.is_late_bound_map(id.owner)
2937 .map(|set| set.contains(&id.local_id))
2941 pub fn object_lifetime_defaults(self, id: HirId)
2942 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2944 self.object_lifetime_defaults_map(id.owner)
2945 .and_then(|map| map.get(&id.local_id).cloned())
2949 pub trait InternAs<T: ?Sized, R> {
2951 fn intern_with<F>(self, f: F) -> Self::Output
2952 where F: FnOnce(&T) -> R;
2955 impl<I, T, R, E> InternAs<[T], R> for I
2956 where E: InternIteratorElement<T, R>,
2957 I: Iterator<Item=E> {
2958 type Output = E::Output;
2959 fn intern_with<F>(self, f: F) -> Self::Output
2960 where F: FnOnce(&[T]) -> R {
2961 E::intern_with(self, f)
2965 pub trait InternIteratorElement<T, R>: Sized {
2967 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2970 impl<T, R> InternIteratorElement<T, R> for T {
2972 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2973 f(&iter.collect::<SmallVec<[_; 8]>>())
2977 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2981 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2982 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2986 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2987 type Output = Result<R, E>;
2988 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2989 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
2993 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2994 // FIXME(#44234) - almost all of these queries have no sub-queries and
2995 // therefore no actual inputs, they're just reading tables calculated in
2996 // resolve! Does this work? Unsure! That's what the issue is about
2997 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2998 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2999 providers.crate_name = |tcx, id| {
3000 assert_eq!(id, LOCAL_CRATE);
3003 providers.get_lib_features = |tcx, id| {
3004 assert_eq!(id, LOCAL_CRATE);
3005 Lrc::new(middle::lib_features::collect(tcx))
3007 providers.get_lang_items = |tcx, id| {
3008 assert_eq!(id, LOCAL_CRATE);
3009 Lrc::new(middle::lang_items::collect(tcx))
3011 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3012 providers.maybe_unused_trait_import = |tcx, id| {
3013 tcx.maybe_unused_trait_imports.contains(&id)
3015 providers.maybe_unused_extern_crates = |tcx, cnum| {
3016 assert_eq!(cnum, LOCAL_CRATE);
3017 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3020 providers.stability_index = |tcx, cnum| {
3021 assert_eq!(cnum, LOCAL_CRATE);
3022 Lrc::new(stability::Index::new(tcx))
3024 providers.lookup_stability = |tcx, id| {
3025 assert_eq!(id.krate, LOCAL_CRATE);
3026 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3027 tcx.stability().local_stability(id)
3029 providers.lookup_deprecation_entry = |tcx, id| {
3030 assert_eq!(id.krate, LOCAL_CRATE);
3031 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3032 tcx.stability().local_deprecation_entry(id)
3034 providers.extern_mod_stmt_cnum = |tcx, id| {
3035 let id = tcx.hir.as_local_node_id(id).unwrap();
3036 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3038 providers.all_crate_nums = |tcx, cnum| {
3039 assert_eq!(cnum, LOCAL_CRATE);
3040 Lrc::new(tcx.cstore.crates_untracked())
3042 providers.postorder_cnums = |tcx, cnum| {
3043 assert_eq!(cnum, LOCAL_CRATE);
3044 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3046 providers.output_filenames = |tcx, cnum| {
3047 assert_eq!(cnum, LOCAL_CRATE);
3048 tcx.output_filenames.clone()
3050 providers.features_query = |tcx, cnum| {
3051 assert_eq!(cnum, LOCAL_CRATE);
3052 Lrc::new(tcx.sess.features_untracked().clone())
3054 providers.is_panic_runtime = |tcx, cnum| {
3055 assert_eq!(cnum, LOCAL_CRATE);
3056 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
3058 providers.is_compiler_builtins = |tcx, cnum| {
3059 assert_eq!(cnum, LOCAL_CRATE);
3060 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")