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, ItemKind, 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, ProjectionKind};
35 use mir::interpret::Allocation;
36 use ty::subst::{CanonicalUserSubsts, 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, VariantIdx};
53 use ty::CanonicalPolyFnSig;
54 use util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap};
55 use util::nodemap::{FxHashMap, FxHashSet};
56 use smallvec::SmallVec;
57 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
58 StableHasher, StableHasherResult,
60 use arena::{TypedArena, SyncDroplessArena};
61 use rustc_data_structures::indexed_vec::IndexVec;
62 use rustc_data_structures::sync::{self, Lrc, Lock, WorkerLocal};
64 use std::borrow::Borrow;
65 use std::cmp::Ordering;
66 use std::collections::hash_map::{self, Entry};
67 use std::hash::{Hash, Hasher};
70 use std::ops::{Deref, Bound};
74 use rustc_target::spec::abi;
75 use syntax::ast::{self, NodeId};
77 use syntax::source_map::MultiSpan;
78 use syntax::edition::Edition;
79 use syntax::feature_gate;
80 use syntax::symbol::{Symbol, keywords, InternedString};
85 pub struct AllArenas<'tcx> {
86 pub global: WorkerLocal<GlobalArenas<'tcx>>,
87 pub interner: SyncDroplessArena,
90 impl<'tcx> AllArenas<'tcx> {
91 pub fn new() -> Self {
93 global: WorkerLocal::new(|_| GlobalArenas::default()),
94 interner: SyncDroplessArena::default(),
101 pub struct GlobalArenas<'tcx> {
103 layout: TypedArena<LayoutDetails>,
106 generics: TypedArena<ty::Generics>,
107 trait_def: TypedArena<ty::TraitDef>,
108 adt_def: TypedArena<ty::AdtDef>,
109 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
110 mir: TypedArena<Mir<'tcx>>,
111 tables: TypedArena<ty::TypeckTables<'tcx>>,
113 const_allocs: TypedArena<interpret::Allocation>,
116 type InternedSet<'tcx, T> = Lock<FxHashSet<Interned<'tcx, T>>>;
118 pub struct CtxtInterners<'tcx> {
119 /// The arena that types, regions, etc are allocated from
120 arena: &'tcx SyncDroplessArena,
122 /// Specifically use a speedy hash algorithm for these hash sets,
123 /// they're accessed quite often.
124 type_: InternedSet<'tcx, TyS<'tcx>>,
125 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
126 substs: InternedSet<'tcx, Substs<'tcx>>,
127 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
128 region: InternedSet<'tcx, RegionKind>,
129 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
130 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
131 const_: InternedSet<'tcx, Const<'tcx>>,
132 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
133 goal: InternedSet<'tcx, GoalKind<'tcx>>,
134 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
135 projs: InternedSet<'tcx, List<ProjectionKind<'tcx>>>,
138 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
139 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
142 type_: Default::default(),
143 type_list: Default::default(),
144 substs: Default::default(),
145 region: Default::default(),
146 existential_predicates: Default::default(),
147 canonical_var_infos: Default::default(),
148 predicates: Default::default(),
149 const_: Default::default(),
150 clauses: Default::default(),
151 goal: Default::default(),
152 goal_list: Default::default(),
153 projs: Default::default(),
160 local: &CtxtInterners<'tcx>,
161 global: &CtxtInterners<'gcx>,
164 let flags = super::flags::FlagComputation::for_sty(&st);
166 // HACK(eddyb) Depend on flags being accurate to
167 // determine that all contents are in the global tcx.
168 // See comments on Lift for why we can't use that.
169 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
170 let mut interner = local.type_.borrow_mut();
171 if let Some(&Interned(ty)) = interner.get(&st) {
175 let ty_struct = TyS {
178 outer_exclusive_binder: flags.outer_exclusive_binder,
181 // Make sure we don't end up with inference
182 // types/regions in the global interner
183 if local as *const _ as usize == global as *const _ as usize {
184 bug!("Attempted to intern `{:?}` which contains \
185 inference types/regions in the global type context",
189 // Don't be &mut TyS.
190 let ty: Ty<'tcx> = local.arena.alloc(ty_struct);
191 interner.insert(Interned(ty));
194 let mut interner = global.type_.borrow_mut();
195 if let Some(&Interned(ty)) = interner.get(&st) {
199 let ty_struct = TyS {
202 outer_exclusive_binder: flags.outer_exclusive_binder,
205 // This is safe because all the types the ty_struct can point to
206 // already is in the global arena
207 let ty_struct: TyS<'gcx> = unsafe {
208 mem::transmute(ty_struct)
211 // Don't be &mut TyS.
212 let ty: Ty<'gcx> = global.arena.alloc(ty_struct);
213 interner.insert(Interned(ty));
219 pub struct CommonTypes<'tcx> {
240 pub re_empty: Region<'tcx>,
241 pub re_static: Region<'tcx>,
242 pub re_erased: Region<'tcx>,
245 pub struct LocalTableInContext<'a, V: 'a> {
246 local_id_root: Option<DefId>,
247 data: &'a ItemLocalMap<V>
250 /// Validate that the given HirId (respectively its `local_id` part) can be
251 /// safely used as a key in the tables of a TypeckTable. For that to be
252 /// the case, the HirId must have the same `owner` as all the other IDs in
253 /// this table (signified by `local_id_root`). Otherwise the HirId
254 /// would be in a different frame of reference and using its `local_id`
255 /// would result in lookup errors, or worse, in silently wrong data being
257 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
260 if cfg!(debug_assertions) {
261 if let Some(local_id_root) = local_id_root {
262 if hir_id.owner != local_id_root.index {
263 ty::tls::with(|tcx| {
264 let node_id = tcx.hir.hir_to_node_id(hir_id);
266 bug!("node {} with HirId::owner {:?} cannot be placed in \
267 TypeckTables with local_id_root {:?}",
268 tcx.hir.node_to_string(node_id),
269 DefId::local(hir_id.owner),
274 // We use "Null Object" TypeckTables in some of the analysis passes.
275 // These are just expected to be empty and their `local_id_root` is
276 // `None`. Therefore we cannot verify whether a given `HirId` would
277 // be a valid key for the given table. Instead we make sure that
278 // nobody tries to write to such a Null Object table.
280 bug!("access to invalid TypeckTables")
286 impl<'a, V> LocalTableInContext<'a, V> {
287 pub fn contains_key(&self, id: hir::HirId) -> bool {
288 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
289 self.data.contains_key(&id.local_id)
292 pub fn get(&self, id: hir::HirId) -> Option<&V> {
293 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
294 self.data.get(&id.local_id)
297 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
302 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
305 fn index(&self, key: hir::HirId) -> &V {
306 self.get(key).expect("LocalTableInContext: key not found")
310 pub struct LocalTableInContextMut<'a, V: 'a> {
311 local_id_root: Option<DefId>,
312 data: &'a mut ItemLocalMap<V>
315 impl<'a, V> LocalTableInContextMut<'a, V> {
316 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
317 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
318 self.data.get_mut(&id.local_id)
321 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
322 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
323 self.data.entry(id.local_id)
326 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
327 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
328 self.data.insert(id.local_id, val)
331 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
332 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
333 self.data.remove(&id.local_id)
337 #[derive(RustcEncodable, RustcDecodable, Debug)]
338 pub struct TypeckTables<'tcx> {
339 /// The HirId::owner all ItemLocalIds in this table are relative to.
340 pub local_id_root: Option<DefId>,
342 /// Resolved definitions for `<T>::X` associated paths and
343 /// method calls, including those of overloaded operators.
344 type_dependent_defs: ItemLocalMap<Def>,
346 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
347 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
348 /// about the field you also need definition of the variant to which the field
349 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
350 field_indices: ItemLocalMap<usize>,
352 /// Stores the types for various nodes in the AST. Note that this table
353 /// is not guaranteed to be populated until after typeck. See
354 /// typeck::check::fn_ctxt for details.
355 node_types: ItemLocalMap<Ty<'tcx>>,
357 /// Stores the type parameters which were substituted to obtain the type
358 /// of this node. This only applies to nodes that refer to entities
359 /// parameterized by type parameters, such as generic fns, types, or
361 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
363 /// Stores the canonicalized types provided by the user. See also
364 /// `AscribeUserType` statement in MIR.
365 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
367 /// Stores the canonicalized types provided by the user. See also
368 /// `AscribeUserType` statement in MIR.
369 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
371 /// Stores the substitutions that the user explicitly gave (if any)
372 /// attached to `id`. These will not include any inferred
373 /// values. The canonical form is used to capture things like `_`
374 /// or other unspecified values.
378 /// If the user wrote `foo.collect::<Vec<_>>()`, then the
379 /// canonical substitutions would include only `for<X> { Vec<X>
381 user_substs: ItemLocalMap<CanonicalUserSubsts<'tcx>>,
383 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
385 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
386 pat_binding_modes: ItemLocalMap<BindingMode>,
388 /// Stores the types which were implicitly dereferenced in pattern binding modes
389 /// for later usage in HAIR lowering. For example,
392 /// match &&Some(5i32) {
397 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
400 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
401 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
404 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
406 /// Records the reasons that we picked the kind of each closure;
407 /// not all closures are present in the map.
408 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
410 /// For each fn, records the "liberated" types of its arguments
411 /// and return type. Liberated means that all bound regions
412 /// (including late-bound regions) are replaced with free
413 /// equivalents. This table is not used in codegen (since regions
414 /// are erased there) and hence is not serialized to metadata.
415 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
417 /// For each FRU expression, record the normalized types of the fields
418 /// of the struct - this is needed because it is non-trivial to
419 /// normalize while preserving regions. This table is used only in
420 /// MIR construction and hence is not serialized to metadata.
421 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
423 /// Maps a cast expression to its kind. This is keyed on the
424 /// *from* expression of the cast, not the cast itself.
425 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
427 /// Set of trait imports actually used in the method resolution.
428 /// This is used for warning unused imports. During type
429 /// checking, this `Lrc` should not be cloned: it must have a ref-count
430 /// of 1 so that we can insert things into the set mutably.
431 pub used_trait_imports: Lrc<DefIdSet>,
433 /// If any errors occurred while type-checking this body,
434 /// this field will be set to `true`.
435 pub tainted_by_errors: bool,
437 /// Stores the free-region relationships that were deduced from
438 /// its where clauses and parameter types. These are then
439 /// read-again by borrowck.
440 pub free_region_map: FreeRegionMap<'tcx>,
442 /// All the existential types that are restricted to concrete types
444 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
447 impl<'tcx> TypeckTables<'tcx> {
448 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
451 type_dependent_defs: Default::default(),
452 field_indices: Default::default(),
453 user_provided_tys: Default::default(),
454 user_provided_sigs: Default::default(),
455 node_types: Default::default(),
456 node_substs: Default::default(),
457 user_substs: Default::default(),
458 adjustments: Default::default(),
459 pat_binding_modes: Default::default(),
460 pat_adjustments: Default::default(),
461 upvar_capture_map: Default::default(),
462 closure_kind_origins: Default::default(),
463 liberated_fn_sigs: Default::default(),
464 fru_field_types: Default::default(),
465 cast_kinds: Default::default(),
466 used_trait_imports: Lrc::new(Default::default()),
467 tainted_by_errors: false,
468 free_region_map: Default::default(),
469 concrete_existential_types: Default::default(),
473 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
474 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
476 hir::QPath::Resolved(_, ref path) => path.def,
477 hir::QPath::TypeRelative(..) => {
478 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
479 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
484 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
485 LocalTableInContext {
486 local_id_root: self.local_id_root,
487 data: &self.type_dependent_defs
491 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
492 LocalTableInContextMut {
493 local_id_root: self.local_id_root,
494 data: &mut self.type_dependent_defs
498 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
499 LocalTableInContext {
500 local_id_root: self.local_id_root,
501 data: &self.field_indices
505 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
506 LocalTableInContextMut {
507 local_id_root: self.local_id_root,
508 data: &mut self.field_indices
512 pub fn user_provided_tys(&self) -> LocalTableInContext<'_, CanonicalTy<'tcx>> {
513 LocalTableInContext {
514 local_id_root: self.local_id_root,
515 data: &self.user_provided_tys
519 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalTy<'tcx>> {
520 LocalTableInContextMut {
521 local_id_root: self.local_id_root,
522 data: &mut self.user_provided_tys
526 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
527 LocalTableInContext {
528 local_id_root: self.local_id_root,
529 data: &self.node_types
533 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
534 LocalTableInContextMut {
535 local_id_root: self.local_id_root,
536 data: &mut self.node_types
540 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
541 self.node_id_to_type_opt(id).unwrap_or_else(||
542 bug!("node_id_to_type: no type for node `{}`",
544 let id = tcx.hir.hir_to_node_id(id);
545 tcx.hir.node_to_string(id)
550 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
551 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
552 self.node_types.get(&id.local_id).cloned()
555 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
556 LocalTableInContextMut {
557 local_id_root: self.local_id_root,
558 data: &mut self.node_substs
562 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
563 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
564 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
567 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
568 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
569 self.node_substs.get(&id.local_id).cloned()
572 pub fn user_substs_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalUserSubsts<'tcx>> {
573 LocalTableInContextMut {
574 local_id_root: self.local_id_root,
575 data: &mut self.user_substs
579 pub fn user_substs(&self, id: hir::HirId) -> Option<CanonicalUserSubsts<'tcx>> {
580 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
581 self.user_substs.get(&id.local_id).cloned()
584 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
585 // doesn't provide type parameter substitutions.
586 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
587 self.node_id_to_type(pat.hir_id)
590 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
591 self.node_id_to_type_opt(pat.hir_id)
594 // Returns the type of an expression as a monotype.
596 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
597 // some cases, we insert `Adjustment` annotations such as auto-deref or
598 // auto-ref. The type returned by this function does not consider such
599 // adjustments. See `expr_ty_adjusted()` instead.
601 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
602 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
603 // instead of "fn(ty) -> T with T = isize".
604 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
605 self.node_id_to_type(expr.hir_id)
608 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
609 self.node_id_to_type_opt(expr.hir_id)
612 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
613 LocalTableInContext {
614 local_id_root: self.local_id_root,
615 data: &self.adjustments
619 pub fn adjustments_mut(&mut self)
620 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
621 LocalTableInContextMut {
622 local_id_root: self.local_id_root,
623 data: &mut self.adjustments
627 pub fn expr_adjustments(&self, expr: &hir::Expr)
628 -> &[ty::adjustment::Adjustment<'tcx>] {
629 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
630 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
633 /// Returns the type of `expr`, considering any `Adjustment`
634 /// entry recorded for that expression.
635 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
636 self.expr_adjustments(expr)
638 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
641 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
642 self.expr_adjustments(expr)
644 .map(|adj| adj.target)
645 .or_else(|| self.expr_ty_opt(expr))
648 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
649 // Only paths and method calls/overloaded operators have
650 // entries in type_dependent_defs, ignore the former here.
651 if let hir::ExprKind::Path(_) = expr.node {
655 match self.type_dependent_defs().get(expr.hir_id) {
656 Some(&Def::Method(_)) => true,
661 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
662 LocalTableInContext {
663 local_id_root: self.local_id_root,
664 data: &self.pat_binding_modes
668 pub fn pat_binding_modes_mut(&mut self)
669 -> LocalTableInContextMut<'_, BindingMode> {
670 LocalTableInContextMut {
671 local_id_root: self.local_id_root,
672 data: &mut self.pat_binding_modes
676 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
677 LocalTableInContext {
678 local_id_root: self.local_id_root,
679 data: &self.pat_adjustments,
683 pub fn pat_adjustments_mut(&mut self)
684 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
685 LocalTableInContextMut {
686 local_id_root: self.local_id_root,
687 data: &mut self.pat_adjustments,
691 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
692 self.upvar_capture_map[&upvar_id]
695 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
696 LocalTableInContext {
697 local_id_root: self.local_id_root,
698 data: &self.closure_kind_origins
702 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
703 LocalTableInContextMut {
704 local_id_root: self.local_id_root,
705 data: &mut self.closure_kind_origins
709 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
710 LocalTableInContext {
711 local_id_root: self.local_id_root,
712 data: &self.liberated_fn_sigs
716 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
717 LocalTableInContextMut {
718 local_id_root: self.local_id_root,
719 data: &mut self.liberated_fn_sigs
723 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
724 LocalTableInContext {
725 local_id_root: self.local_id_root,
726 data: &self.fru_field_types
730 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
731 LocalTableInContextMut {
732 local_id_root: self.local_id_root,
733 data: &mut self.fru_field_types
737 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
738 LocalTableInContext {
739 local_id_root: self.local_id_root,
740 data: &self.cast_kinds
744 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
745 LocalTableInContextMut {
746 local_id_root: self.local_id_root,
747 data: &mut self.cast_kinds
752 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
753 fn hash_stable<W: StableHasherResult>(&self,
754 hcx: &mut StableHashingContext<'a>,
755 hasher: &mut StableHasher<W>) {
756 let ty::TypeckTables {
758 ref type_dependent_defs,
760 ref user_provided_tys,
761 ref user_provided_sigs,
766 ref pat_binding_modes,
768 ref upvar_capture_map,
769 ref closure_kind_origins,
770 ref liberated_fn_sigs,
775 ref used_trait_imports,
778 ref concrete_existential_types,
781 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
782 type_dependent_defs.hash_stable(hcx, hasher);
783 field_indices.hash_stable(hcx, hasher);
784 user_provided_tys.hash_stable(hcx, hasher);
785 user_provided_sigs.hash_stable(hcx, hasher);
786 node_types.hash_stable(hcx, hasher);
787 node_substs.hash_stable(hcx, hasher);
788 user_substs.hash_stable(hcx, hasher);
789 adjustments.hash_stable(hcx, hasher);
790 pat_binding_modes.hash_stable(hcx, hasher);
791 pat_adjustments.hash_stable(hcx, hasher);
792 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
799 local_id_root.expect("trying to hash invalid TypeckTables");
801 let var_owner_def_id = DefId {
802 krate: local_id_root.krate,
803 index: var_path.hir_id.owner,
805 let closure_def_id = DefId {
806 krate: local_id_root.krate,
807 index: closure_expr_id.to_def_id().index,
809 (hcx.def_path_hash(var_owner_def_id),
810 var_path.hir_id.local_id,
811 hcx.def_path_hash(closure_def_id))
814 closure_kind_origins.hash_stable(hcx, hasher);
815 liberated_fn_sigs.hash_stable(hcx, hasher);
816 fru_field_types.hash_stable(hcx, hasher);
817 cast_kinds.hash_stable(hcx, hasher);
818 used_trait_imports.hash_stable(hcx, hasher);
819 tainted_by_errors.hash_stable(hcx, hasher);
820 free_region_map.hash_stable(hcx, hasher);
821 concrete_existential_types.hash_stable(hcx, hasher);
826 impl<'tcx> CommonTypes<'tcx> {
827 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
828 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
829 let mk_region = |r| {
830 if let Some(r) = interners.region.borrow().get(&r) {
833 let r = interners.arena.alloc(r);
834 interners.region.borrow_mut().insert(Interned(r));
839 unit: mk(Tuple(List::empty())),
844 isize: mk(Int(ast::IntTy::Isize)),
845 i8: mk(Int(ast::IntTy::I8)),
846 i16: mk(Int(ast::IntTy::I16)),
847 i32: mk(Int(ast::IntTy::I32)),
848 i64: mk(Int(ast::IntTy::I64)),
849 i128: mk(Int(ast::IntTy::I128)),
850 usize: mk(Uint(ast::UintTy::Usize)),
851 u8: mk(Uint(ast::UintTy::U8)),
852 u16: mk(Uint(ast::UintTy::U16)),
853 u32: mk(Uint(ast::UintTy::U32)),
854 u64: mk(Uint(ast::UintTy::U64)),
855 u128: mk(Uint(ast::UintTy::U128)),
856 f32: mk(Float(ast::FloatTy::F32)),
857 f64: mk(Float(ast::FloatTy::F64)),
859 re_empty: mk_region(RegionKind::ReEmpty),
860 re_static: mk_region(RegionKind::ReStatic),
861 re_erased: mk_region(RegionKind::ReErased),
866 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
869 pub struct FreeRegionInfo {
870 // def id corresponding to FreeRegion
872 // the bound region corresponding to FreeRegion
873 pub boundregion: ty::BoundRegion,
874 // checks if bound region is in Impl Item
875 pub is_impl_item: bool,
878 /// The central data structure of the compiler. It stores references
879 /// to the various **arenas** and also houses the results of the
880 /// various **compiler queries** that have been performed. See the
881 /// [rustc guide] for more details.
883 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
884 #[derive(Copy, Clone)]
885 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
886 gcx: &'a GlobalCtxt<'gcx>,
887 interners: &'a CtxtInterners<'tcx>
890 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
891 type Target = &'a GlobalCtxt<'gcx>;
893 fn deref(&self) -> &Self::Target {
898 pub struct GlobalCtxt<'tcx> {
899 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
900 global_interners: CtxtInterners<'tcx>,
902 cstore: &'tcx CrateStoreDyn,
904 pub sess: &'tcx Session,
906 pub dep_graph: DepGraph,
908 /// Common types, pre-interned for your convenience.
909 pub types: CommonTypes<'tcx>,
911 /// Map indicating what traits are in scope for places where this
912 /// is relevant; generated by resolve.
913 trait_map: FxHashMap<DefIndex,
914 Lrc<FxHashMap<ItemLocalId,
915 Lrc<StableVec<TraitCandidate>>>>>,
917 /// Export map produced by name resolution.
918 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
920 pub hir: hir_map::Map<'tcx>,
922 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
923 /// as well as all upstream crates. Only populated in incremental mode.
924 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
926 pub(crate) queries: query::Queries<'tcx>,
928 // Records the free variables referenced by every closure
929 // expression. Do not track deps for this, just recompute it from
930 // scratch every time.
931 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
933 maybe_unused_trait_imports: FxHashSet<DefId>,
934 maybe_unused_extern_crates: Vec<(DefId, Span)>,
935 /// Extern prelude entries. The value is `true` if the entry was introduced
936 /// via `extern crate` item and not `--extern` option or compiler built-in.
937 pub extern_prelude: FxHashMap<ast::Name, bool>,
939 // Internal cache for metadata decoding. No need to track deps on this.
940 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
942 /// Caches the results of trait selection. This cache is used
943 /// for things that do not have to do with the parameters in scope.
944 pub selection_cache: traits::SelectionCache<'tcx>,
946 /// Caches the results of trait evaluation. This cache is used
947 /// for things that do not have to do with the parameters in scope.
948 /// Merge this with `selection_cache`?
949 pub evaluation_cache: traits::EvaluationCache<'tcx>,
951 /// The definite name of the current crate after taking into account
952 /// attributes, commandline parameters, etc.
953 pub crate_name: Symbol,
955 /// Data layout specification for the current target.
956 pub data_layout: TargetDataLayout,
958 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
960 /// Stores the value of constants (and deduplicates the actual memory)
961 allocation_interner: Lock<FxHashSet<&'tcx Allocation>>,
963 pub alloc_map: Lock<interpret::AllocMap<'tcx, &'tcx Allocation>>,
965 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
967 /// A general purpose channel to throw data out the back towards LLVM worker
970 /// This is intended to only get used during the codegen phase of the compiler
971 /// when satisfying the query for a particular codegen unit. Internally in
972 /// the query it'll send data along this channel to get processed later.
973 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
975 output_filenames: Arc<OutputFilenames>,
978 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
979 /// Get the global TyCtxt.
981 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
984 interners: &self.gcx.global_interners,
988 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
989 self.global_arenas.generics.alloc(generics)
992 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
993 self.global_arenas.steal_mir.alloc(Steal::new(mir))
996 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
997 self.global_arenas.mir.alloc(mir)
1000 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1001 self.global_arenas.tables.alloc(tables)
1004 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1005 self.global_arenas.trait_def.alloc(def)
1008 pub fn alloc_adt_def(self,
1011 variants: IndexVec<VariantIdx, ty::VariantDef>,
1013 -> &'gcx ty::AdtDef {
1014 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1015 self.global_arenas.adt_def.alloc(def)
1018 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1019 if bytes.is_empty() {
1022 self.global_interners.arena.alloc_slice(bytes)
1026 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1027 -> &'tcx [&'tcx ty::Const<'tcx>] {
1028 if values.is_empty() {
1031 self.interners.arena.alloc_slice(values)
1035 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1036 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1037 if values.is_empty() {
1040 self.interners.arena.alloc_slice(values)
1044 pub fn intern_const_alloc(
1047 ) -> &'gcx Allocation {
1048 let allocs = &mut self.allocation_interner.borrow_mut();
1049 if let Some(alloc) = allocs.get(&alloc) {
1053 let interned = self.global_arenas.const_allocs.alloc(alloc);
1054 if let Some(prev) = allocs.replace(interned) { // insert into interner
1055 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1060 /// Allocates a byte or string literal for `mir::interpret`, read-only
1061 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1062 // create an allocation that just contains these bytes
1063 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes, ());
1064 let alloc = self.intern_const_alloc(alloc);
1065 self.alloc_map.lock().allocate(alloc)
1068 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1069 let mut stability_interner = self.stability_interner.borrow_mut();
1070 if let Some(st) = stability_interner.get(&stab) {
1074 let interned = self.global_interners.arena.alloc(stab);
1075 if let Some(prev) = stability_interner.replace(interned) {
1076 bug!("Tried to overwrite interned Stability: {:?}", prev)
1081 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1082 let mut layout_interner = self.layout_interner.borrow_mut();
1083 if let Some(layout) = layout_interner.get(&layout) {
1087 let interned = self.global_arenas.layout.alloc(layout);
1088 if let Some(prev) = layout_interner.replace(interned) {
1089 bug!("Tried to overwrite interned Layout: {:?}", prev)
1094 /// Returns a range of the start/end indices specified with the
1095 /// `rustc_layout_scalar_valid_range` attribute.
1096 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1097 let attrs = self.get_attrs(def_id);
1099 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1101 None => return Bound::Unbounded,
1103 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1104 match meta.literal().expect("attribute takes lit").node {
1105 ast::LitKind::Int(a, _) => return Bound::Included(a),
1106 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1109 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1111 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1114 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1115 value.lift_to_tcx(self)
1118 /// Like lift, but only tries in the global tcx.
1119 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1120 value.lift_to_tcx(self.global_tcx())
1123 /// Returns true if self is the same as self.global_tcx().
1124 fn is_global(self) -> bool {
1125 let local = self.interners as *const _;
1126 let global = &self.global_interners as *const _;
1127 local as usize == global as usize
1130 /// Create a type context and call the closure with a `TyCtxt` reference
1131 /// to the context. The closure enforces that the type context and any interned
1132 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1133 /// reference to the context, to allow formatting values that need it.
1134 pub fn create_and_enter<F, R>(s: &'tcx Session,
1135 cstore: &'tcx CrateStoreDyn,
1136 local_providers: ty::query::Providers<'tcx>,
1137 extern_providers: ty::query::Providers<'tcx>,
1138 arenas: &'tcx AllArenas<'tcx>,
1139 resolutions: ty::Resolutions,
1140 hir: hir_map::Map<'tcx>,
1141 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1143 tx: mpsc::Sender<Box<dyn Any + Send>>,
1144 output_filenames: &OutputFilenames,
1146 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1148 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1151 let interners = CtxtInterners::new(&arenas.interner);
1152 let common_types = CommonTypes::new(&interners);
1153 let dep_graph = hir.dep_graph.clone();
1154 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1155 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1156 providers[LOCAL_CRATE] = local_providers;
1158 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1159 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1162 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1165 let def_path_tables = || {
1166 upstream_def_path_tables
1168 .map(|&(cnum, ref rc)| (cnum, &**rc))
1169 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1172 // Precompute the capacity of the hashmap so we don't have to
1173 // re-allocate when populating it.
1174 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1176 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1178 ::std::default::Default::default()
1181 for (cnum, def_path_table) in def_path_tables() {
1182 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1190 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1191 for (k, v) in resolutions.trait_map {
1192 let hir_id = hir.node_to_hir_id(k);
1193 let map = trait_map.entry(hir_id.owner).or_default();
1194 Lrc::get_mut(map).unwrap()
1195 .insert(hir_id.local_id,
1196 Lrc::new(StableVec::new(v)));
1199 let gcx = &GlobalCtxt {
1202 global_arenas: &arenas.global,
1203 global_interners: interners,
1205 types: common_types,
1207 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1210 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1211 (hir.local_def_id(k), Lrc::new(v))
1213 maybe_unused_trait_imports:
1214 resolutions.maybe_unused_trait_imports
1216 .map(|id| hir.local_def_id(id))
1218 maybe_unused_extern_crates:
1219 resolutions.maybe_unused_extern_crates
1221 .map(|(id, sp)| (hir.local_def_id(id), sp))
1223 extern_prelude: resolutions.extern_prelude,
1225 def_path_hash_to_def_id,
1226 queries: query::Queries::new(
1229 on_disk_query_result_cache,
1231 rcache: Default::default(),
1232 selection_cache: Default::default(),
1233 evaluation_cache: Default::default(),
1234 crate_name: Symbol::intern(crate_name),
1236 layout_interner: Default::default(),
1237 stability_interner: Default::default(),
1238 allocation_interner: Default::default(),
1239 alloc_map: Lock::new(interpret::AllocMap::new()),
1240 tx_to_llvm_workers: Lock::new(tx),
1241 output_filenames: Arc::new(output_filenames.clone()),
1244 sync::assert_send_val(&gcx);
1246 tls::enter_global(gcx, f)
1249 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1250 let cname = self.crate_name(LOCAL_CRATE).as_str();
1251 self.sess.consider_optimizing(&cname, msg)
1254 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1255 self.get_lib_features(LOCAL_CRATE)
1258 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1259 self.get_lang_items(LOCAL_CRATE)
1262 /// Due to missing llvm support for lowering 128 bit math to software emulation
1263 /// (on some targets), the lowering can be done in MIR.
1265 /// This function only exists until said support is implemented.
1266 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1267 let items = self.lang_items();
1268 let def_id = Some(def_id);
1269 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1270 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1271 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1272 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1273 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1274 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1275 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1276 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1277 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1278 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1279 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1280 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1281 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1282 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1283 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1284 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1285 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1286 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1287 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1288 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1289 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1290 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1291 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1292 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1296 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1297 self.stability_index(LOCAL_CRATE)
1300 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1301 self.all_crate_nums(LOCAL_CRATE)
1304 pub fn features(self) -> Lrc<feature_gate::Features> {
1305 self.features_query(LOCAL_CRATE)
1308 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1310 self.hir.def_key(id)
1312 self.cstore.def_key(id)
1316 /// Convert a `DefId` into its fully expanded `DefPath` (every
1317 /// `DefId` is really just an interned def-path).
1319 /// Note that if `id` is not local to this crate, the result will
1320 /// be a non-local `DefPath`.
1321 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1323 self.hir.def_path(id)
1325 self.cstore.def_path(id)
1330 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1331 if def_id.is_local() {
1332 self.hir.definitions().def_path_hash(def_id.index)
1334 self.cstore.def_path_hash(def_id)
1338 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1339 // We are explicitly not going through queries here in order to get
1340 // crate name and disambiguator since this code is called from debug!()
1341 // statements within the query system and we'd run into endless
1342 // recursion otherwise.
1343 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1344 (self.crate_name.clone(),
1345 self.sess.local_crate_disambiguator())
1347 (self.cstore.crate_name_untracked(def_id.krate),
1348 self.cstore.crate_disambiguator_untracked(def_id.krate))
1353 // Don't print the whole crate disambiguator. That's just
1354 // annoying in debug output.
1355 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1356 self.def_path(def_id).to_string_no_crate())
1359 pub fn metadata_encoding_version(self) -> Vec<u8> {
1360 self.cstore.metadata_encoding_version().to_vec()
1363 // Note that this is *untracked* and should only be used within the query
1364 // system if the result is otherwise tracked through queries
1365 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1366 self.cstore.crate_data_as_rc_any(cnum)
1369 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1370 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1372 StableHashingContext::new(self.sess,
1374 self.hir.definitions(),
1378 // This method makes sure that we have a DepNode and a Fingerprint for
1379 // every upstream crate. It needs to be called once right after the tcx is
1381 // With full-fledged red/green, the method will probably become unnecessary
1382 // as this will be done on-demand.
1383 pub fn allocate_metadata_dep_nodes(self) {
1384 // We cannot use the query versions of crates() and crate_hash(), since
1385 // those would need the DepNodes that we are allocating here.
1386 for cnum in self.cstore.crates_untracked() {
1387 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1388 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1389 self.dep_graph.with_task(dep_node,
1392 |_, x| x // No transformation needed
1397 // This method exercises the `in_scope_traits_map` query for all possible
1398 // values so that we have their fingerprints available in the DepGraph.
1399 // This is only required as long as we still use the old dependency tracking
1400 // which needs to have the fingerprints of all input nodes beforehand.
1401 pub fn precompute_in_scope_traits_hashes(self) {
1402 for &def_index in self.trait_map.keys() {
1403 self.in_scope_traits_map(def_index);
1407 pub fn serialize_query_result_cache<E>(self,
1409 -> Result<(), E::Error>
1410 where E: ty::codec::TyEncoder
1412 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1415 /// This checks whether one is allowed to have pattern bindings
1416 /// that bind-by-move on a match arm that has a guard, e.g.:
1419 /// match foo { A(inner) if { /* something */ } => ..., ... }
1422 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1423 /// because that method has a narrower effect that can be toggled
1424 /// off via a separate `-Z` flag, at least for the short term.
1425 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1426 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1429 /// If true, we should use a naive AST walk to determine if match
1430 /// guard could perform bad mutations (or mutable-borrows).
1431 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1432 // If someone requests the feature, then be a little more
1433 // careful and ensure that MIR-borrowck is enabled (which can
1434 // happen via edition selection, via `feature(nll)`, or via an
1435 // appropriate `-Z` flag) before disabling the mutation check.
1436 if self.allow_bind_by_move_patterns_with_guards() {
1443 /// If true, we should use the AST-based borrowck (we may *also* use
1444 /// the MIR-based borrowck).
1445 pub fn use_ast_borrowck(self) -> bool {
1446 self.borrowck_mode().use_ast()
1449 /// If true, we should use the MIR-based borrowck (we may *also* use
1450 /// the AST-based borrowck).
1451 pub fn use_mir_borrowck(self) -> bool {
1452 self.borrowck_mode().use_mir()
1455 /// If true, we should use the MIR-based borrow check, but also
1456 /// fall back on the AST borrow check if the MIR-based one errors.
1457 pub fn migrate_borrowck(self) -> bool {
1458 self.borrowck_mode().migrate()
1461 /// If true, make MIR codegen for `match` emit a temp that holds a
1462 /// borrow of the input to the match expression.
1463 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1464 self.emit_read_for_match()
1467 /// If true, make MIR codegen for `match` emit FakeRead
1468 /// statements (which simulate the maximal effect of executing the
1469 /// patterns in a match arm).
1470 pub fn emit_read_for_match(&self) -> bool {
1471 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1474 /// If true, pattern variables for use in guards on match arms
1475 /// will be bound as references to the data, and occurrences of
1476 /// those variables in the guard expression will implicitly
1477 /// dereference those bindings. (See rust-lang/rust#27282.)
1478 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1479 self.borrowck_mode().use_mir()
1482 /// If true, we should enable two-phase borrows checks. This is
1483 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1484 /// or by opting into an edition after 2015.
1485 pub fn two_phase_borrows(self) -> bool {
1486 self.sess.rust_2018() || self.features().nll ||
1487 self.sess.opts.debugging_opts.two_phase_borrows
1490 /// What mode(s) of borrowck should we run? AST? MIR? both?
1491 /// (Also considers the `#![feature(nll)]` setting.)
1492 pub fn borrowck_mode(&self) -> BorrowckMode {
1493 // Here are the main constraints we need to deal with:
1495 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1496 // synonymous with no `-Z borrowck=...` flag at all.
1497 // (This is arguably a historical accident.)
1499 // 2. `BorrowckMode::Migrate` is the limited migration to
1500 // NLL that we are deploying with the 2018 edition.
1502 // 3. We want to allow developers on the Nightly channel
1503 // to opt back into the "hard error" mode for NLL,
1504 // (which they can do via specifying `#![feature(nll)]`
1505 // explicitly in their crate).
1507 // So, this precedence list is how pnkfelix chose to work with
1508 // the above constraints:
1510 // * `#![feature(nll)]` *always* means use NLL with hard
1511 // errors. (To simplify the code here, it now even overrides
1512 // a user's attempt to specify `-Z borrowck=compare`, which
1513 // we arguably do not need anymore and should remove.)
1515 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1516 // if `borrowck=ast` was specified), then use the default
1517 // as required by the edition.
1519 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1521 if self.features().nll { return BorrowckMode::Mir; }
1523 match self.sess.opts.borrowck_mode {
1524 mode @ BorrowckMode::Mir |
1525 mode @ BorrowckMode::Compare |
1526 mode @ BorrowckMode::Migrate => mode,
1528 BorrowckMode::Ast => match self.sess.edition() {
1529 Edition::Edition2015 => BorrowckMode::Ast,
1530 Edition::Edition2018 => BorrowckMode::Migrate,
1532 // For now, future editions mean Migrate. (But it
1533 // would make a lot of sense for it to be changed to
1534 // `BorrowckMode::Mir`, depending on how we plan to
1535 // time the forcing of full migration to NLL.)
1536 _ => BorrowckMode::Migrate,
1542 pub fn local_crate_exports_generics(self) -> bool {
1543 debug_assert!(self.sess.opts.share_generics());
1545 self.sess.crate_types.borrow().iter().any(|crate_type| {
1547 CrateType::Executable |
1548 CrateType::Staticlib |
1549 CrateType::ProcMacro |
1550 CrateType::Cdylib => false,
1552 CrateType::Dylib => true,
1557 // This method returns the DefId and the BoundRegion corresponding to the given region.
1558 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1559 let (suitable_region_binding_scope, bound_region) = match *region {
1560 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1561 ty::ReEarlyBound(ref ebr) => (
1562 self.parent_def_id(ebr.def_id).unwrap(),
1563 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1565 _ => return None, // not a free region
1568 let node_id = self.hir
1569 .as_local_node_id(suitable_region_binding_scope)
1571 let is_impl_item = match self.hir.find(node_id) {
1572 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1573 Some(Node::ImplItem(..)) => {
1574 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1579 return Some(FreeRegionInfo {
1580 def_id: suitable_region_binding_scope,
1581 boundregion: bound_region,
1582 is_impl_item: is_impl_item,
1586 pub fn return_type_impl_trait(
1588 scope_def_id: DefId,
1589 ) -> Option<Ty<'tcx>> {
1590 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1591 let node_id = self.hir.as_local_node_id(scope_def_id).unwrap();
1592 match self.hir.get(node_id) {
1593 Node::Item(item) => {
1595 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1601 _ => { /* type_of_def_id() will work or panic */ }
1604 let ret_ty = self.type_of(scope_def_id);
1606 ty::FnDef(_, _) => {
1607 let sig = ret_ty.fn_sig(*self);
1608 let output = self.erase_late_bound_regions(&sig.output());
1609 if output.is_impl_trait() {
1619 // Here we check if the bound region is in Impl Item.
1620 pub fn is_bound_region_in_impl_item(
1622 suitable_region_binding_scope: DefId,
1624 let container_id = self.associated_item(suitable_region_binding_scope)
1627 if self.impl_trait_ref(container_id).is_some() {
1628 // For now, we do not try to target impls of traits. This is
1629 // because this message is going to suggest that the user
1630 // change the fn signature, but they may not be free to do so,
1631 // since the signature must match the trait.
1633 // FIXME(#42706) -- in some cases, we could do better here.
1640 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1641 pub fn encode_metadata(self)
1644 self.cstore.encode_metadata(self)
1648 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1649 /// Call the closure with a local `TyCtxt` using the given arena.
1650 pub fn enter_local<F, R>(
1652 arena: &'tcx SyncDroplessArena,
1656 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1658 let interners = CtxtInterners::new(arena);
1661 interners: &interners,
1663 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1664 let new_icx = ty::tls::ImplicitCtxt {
1666 query: icx.query.clone(),
1667 layout_depth: icx.layout_depth,
1670 ty::tls::enter_context(&new_icx, |new_icx| {
1677 /// A trait implemented for all X<'a> types which can be safely and
1678 /// efficiently converted to X<'tcx> as long as they are part of the
1679 /// provided TyCtxt<'tcx>.
1680 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1681 /// by looking them up in their respective interners.
1683 /// However, this is still not the best implementation as it does
1684 /// need to compare the components, even for interned values.
1685 /// It would be more efficient if TypedArena provided a way to
1686 /// determine whether the address is in the allocated range.
1688 /// None is returned if the value or one of the components is not part
1689 /// of the provided context.
1690 /// For Ty, None can be returned if either the type interner doesn't
1691 /// contain the TyKind key or if the address of the interned
1692 /// pointer differs. The latter case is possible if a primitive type,
1693 /// e.g. `()` or `u8`, was interned in a different context.
1694 pub trait Lift<'tcx>: fmt::Debug {
1695 type Lifted: fmt::Debug + 'tcx;
1696 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1699 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1700 type Lifted = Ty<'tcx>;
1701 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1702 if tcx.interners.arena.in_arena(*self as *const _) {
1703 return Some(unsafe { mem::transmute(*self) });
1705 // Also try in the global tcx if we're not that.
1706 if !tcx.is_global() {
1707 self.lift_to_tcx(tcx.global_tcx())
1714 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1715 type Lifted = Region<'tcx>;
1716 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1717 if tcx.interners.arena.in_arena(*self as *const _) {
1718 return Some(unsafe { mem::transmute(*self) });
1720 // Also try in the global tcx if we're not that.
1721 if !tcx.is_global() {
1722 self.lift_to_tcx(tcx.global_tcx())
1729 impl<'a, 'tcx> Lift<'tcx> for Goal<'a> {
1730 type Lifted = Goal<'tcx>;
1731 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Goal<'tcx>> {
1732 if tcx.interners.arena.in_arena(*self as *const _) {
1733 return Some(unsafe { mem::transmute(*self) });
1735 // Also try in the global tcx if we're not that.
1736 if !tcx.is_global() {
1737 self.lift_to_tcx(tcx.global_tcx())
1744 impl<'a, 'tcx> Lift<'tcx> for &'a List<Goal<'a>> {
1745 type Lifted = &'tcx List<Goal<'tcx>>;
1746 fn lift_to_tcx<'b, 'gcx>(
1748 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1749 ) -> Option<&'tcx List<Goal<'tcx>>> {
1750 if tcx.interners.arena.in_arena(*self as *const _) {
1751 return Some(unsafe { mem::transmute(*self) });
1753 // Also try in the global tcx if we're not that.
1754 if !tcx.is_global() {
1755 self.lift_to_tcx(tcx.global_tcx())
1762 impl<'a, 'tcx> Lift<'tcx> for &'a List<Clause<'a>> {
1763 type Lifted = &'tcx List<Clause<'tcx>>;
1764 fn lift_to_tcx<'b, 'gcx>(
1766 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1767 ) -> Option<&'tcx List<Clause<'tcx>>> {
1768 if tcx.interners.arena.in_arena(*self as *const _) {
1769 return Some(unsafe { mem::transmute(*self) });
1771 // Also try in the global tcx if we're not that.
1772 if !tcx.is_global() {
1773 self.lift_to_tcx(tcx.global_tcx())
1780 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1781 type Lifted = &'tcx Const<'tcx>;
1782 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1783 if tcx.interners.arena.in_arena(*self as *const _) {
1784 return Some(unsafe { mem::transmute(*self) });
1786 // Also try in the global tcx if we're not that.
1787 if !tcx.is_global() {
1788 self.lift_to_tcx(tcx.global_tcx())
1795 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1796 type Lifted = &'tcx Substs<'tcx>;
1797 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1798 if self.len() == 0 {
1799 return Some(List::empty());
1801 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1802 return Some(unsafe { mem::transmute(*self) });
1804 // Also try in the global tcx if we're not that.
1805 if !tcx.is_global() {
1806 self.lift_to_tcx(tcx.global_tcx())
1813 impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>> {
1814 type Lifted = &'tcx List<Ty<'tcx>>;
1815 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1816 -> Option<&'tcx List<Ty<'tcx>>> {
1817 if self.len() == 0 {
1818 return Some(List::empty());
1820 if tcx.interners.arena.in_arena(*self as *const _) {
1821 return Some(unsafe { mem::transmute(*self) });
1823 // Also try in the global tcx if we're not that.
1824 if !tcx.is_global() {
1825 self.lift_to_tcx(tcx.global_tcx())
1832 impl<'a, 'tcx> Lift<'tcx> for &'a List<ExistentialPredicate<'a>> {
1833 type Lifted = &'tcx List<ExistentialPredicate<'tcx>>;
1834 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1835 -> Option<&'tcx List<ExistentialPredicate<'tcx>>> {
1836 if self.is_empty() {
1837 return Some(List::empty());
1839 if tcx.interners.arena.in_arena(*self as *const _) {
1840 return Some(unsafe { mem::transmute(*self) });
1842 // Also try in the global tcx if we're not that.
1843 if !tcx.is_global() {
1844 self.lift_to_tcx(tcx.global_tcx())
1851 impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>> {
1852 type Lifted = &'tcx List<Predicate<'tcx>>;
1853 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1854 -> Option<&'tcx List<Predicate<'tcx>>> {
1855 if self.is_empty() {
1856 return Some(List::empty());
1858 if tcx.interners.arena.in_arena(*self as *const _) {
1859 return Some(unsafe { mem::transmute(*self) });
1861 // Also try in the global tcx if we're not that.
1862 if !tcx.is_global() {
1863 self.lift_to_tcx(tcx.global_tcx())
1870 impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo> {
1871 type Lifted = &'tcx List<CanonicalVarInfo>;
1872 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1873 if self.len() == 0 {
1874 return Some(List::empty());
1876 if tcx.interners.arena.in_arena(*self as *const _) {
1877 return Some(unsafe { mem::transmute(*self) });
1879 // Also try in the global tcx if we're not that.
1880 if !tcx.is_global() {
1881 self.lift_to_tcx(tcx.global_tcx())
1888 impl<'a, 'tcx> Lift<'tcx> for &'a List<ProjectionKind<'a>> {
1889 type Lifted = &'tcx List<ProjectionKind<'tcx>>;
1890 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1891 if self.len() == 0 {
1892 return Some(List::empty());
1894 if tcx.interners.arena.in_arena(*self as *const _) {
1895 return Some(unsafe { mem::transmute(*self) });
1897 // Also try in the global tcx if we're not that.
1898 if !tcx.is_global() {
1899 self.lift_to_tcx(tcx.global_tcx())
1907 use super::{GlobalCtxt, TyCtxt};
1913 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1914 use rustc_data_structures::OnDrop;
1915 use rustc_data_structures::sync::{self, Lrc, Lock};
1916 use dep_graph::OpenTask;
1918 #[cfg(not(parallel_queries))]
1919 use std::cell::Cell;
1921 #[cfg(parallel_queries)]
1924 /// This is the implicit state of rustc. It contains the current
1925 /// TyCtxt and query. It is updated when creating a local interner or
1926 /// executing a new query. Whenever there's a TyCtxt value available
1927 /// you should also have access to an ImplicitCtxt through the functions
1930 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1931 /// The current TyCtxt. Initially created by `enter_global` and updated
1932 /// by `enter_local` with a new local interner
1933 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1935 /// The current query job, if any. This is updated by start_job in
1936 /// ty::query::plumbing when executing a query
1937 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1939 /// Used to prevent layout from recursing too deeply.
1940 pub layout_depth: usize,
1942 /// The current dep graph task. This is used to add dependencies to queries
1943 /// when executing them
1944 pub task: &'a OpenTask,
1947 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1948 /// to `value` during the call to `f`. It is restored to its previous value after.
1949 /// This is used to set the pointer to the new ImplicitCtxt.
1950 #[cfg(parallel_queries)]
1951 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1952 rayon_core::tlv::with(value, f)
1955 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1956 /// This is used to get the pointer to the current ImplicitCtxt.
1957 #[cfg(parallel_queries)]
1958 fn get_tlv() -> usize {
1959 rayon_core::tlv::get()
1962 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1963 #[cfg(not(parallel_queries))]
1964 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1966 /// Sets TLV to `value` during the call to `f`.
1967 /// It is restored to its previous value after.
1968 /// This is used to set the pointer to the new ImplicitCtxt.
1969 #[cfg(not(parallel_queries))]
1970 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1971 let old = get_tlv();
1972 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1973 TLV.with(|tlv| tlv.set(value));
1977 /// This is used to get the pointer to the current ImplicitCtxt.
1978 #[cfg(not(parallel_queries))]
1979 fn get_tlv() -> usize {
1980 TLV.with(|tlv| tlv.get())
1983 /// This is a callback from libsyntax as it cannot access the implicit state
1984 /// in librustc otherwise
1985 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1987 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1991 /// This is a callback from libsyntax as it cannot access the implicit state
1992 /// in librustc otherwise. It is used to when diagnostic messages are
1993 /// emitted and stores them in the current query, if there is one.
1994 fn track_diagnostic(diagnostic: &Diagnostic) {
1995 with_context_opt(|icx| {
1996 if let Some(icx) = icx {
1997 if let Some(ref query) = icx.query {
1998 query.diagnostics.lock().push(diagnostic.clone());
2004 /// Sets up the callbacks from libsyntax on the current thread
2005 pub fn with_thread_locals<F, R>(f: F) -> R
2006 where F: FnOnce() -> R
2008 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
2009 let original_span_debug = span_dbg.get();
2010 span_dbg.set(span_debug);
2012 let _on_drop = OnDrop(move || {
2013 span_dbg.set(original_span_debug);
2016 TRACK_DIAGNOSTICS.with(|current| {
2017 let original = current.get();
2018 current.set(track_diagnostic);
2020 let _on_drop = OnDrop(move || {
2021 current.set(original);
2029 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
2030 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
2032 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2034 set_tlv(context as *const _ as usize, || {
2039 /// Enters GlobalCtxt by setting up libsyntax callbacks and
2040 /// creating a initial TyCtxt and ImplicitCtxt.
2041 /// This happens once per rustc session and TyCtxts only exists
2042 /// inside the `f` function.
2043 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
2044 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
2046 with_thread_locals(|| {
2047 // Update GCX_PTR to indicate there's a GlobalCtxt available
2048 GCX_PTR.with(|lock| {
2049 *lock.lock() = gcx as *const _ as usize;
2051 // Set GCX_PTR back to 0 when we exit
2052 let _on_drop = OnDrop(move || {
2053 GCX_PTR.with(|lock| *lock.lock() = 0);
2058 interners: &gcx.global_interners,
2060 let icx = ImplicitCtxt {
2064 task: &OpenTask::Ignore,
2066 enter_context(&icx, |_| {
2072 /// Stores a pointer to the GlobalCtxt if one is available.
2073 /// This is used to access the GlobalCtxt in the deadlock handler
2075 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2077 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2078 /// This is used in the deadlock handler.
2079 pub unsafe fn with_global<F, R>(f: F) -> R
2080 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2082 let gcx = GCX_PTR.with(|lock| *lock.lock());
2084 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2087 interners: &gcx.global_interners,
2089 let icx = ImplicitCtxt {
2093 task: &OpenTask::Ignore,
2095 enter_context(&icx, |_| f(tcx))
2098 /// Allows access to the current ImplicitCtxt in a closure if one is available
2099 pub fn with_context_opt<F, R>(f: F) -> R
2100 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2102 let context = get_tlv();
2106 // We could get a ImplicitCtxt pointer from another thread.
2107 // Ensure that ImplicitCtxt is Sync
2108 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2110 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2114 /// Allows access to the current ImplicitCtxt.
2115 /// Panics if there is no ImplicitCtxt available
2116 pub fn with_context<F, R>(f: F) -> R
2117 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2119 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2122 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2123 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2124 /// with the same 'gcx lifetime as the TyCtxt passed in.
2125 /// This will panic if you pass it a TyCtxt which has a different global interner from
2126 /// the current ImplicitCtxt's tcx field.
2127 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2128 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2130 with_context(|context| {
2132 let gcx = tcx.gcx as *const _ as usize;
2133 assert!(context.tcx.gcx as *const _ as usize == gcx);
2134 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2140 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2141 /// interner and local interner as the tcx argument passed in. This means the closure
2142 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2143 /// This will panic if you pass it a TyCtxt which has a different global interner or
2144 /// a different local interner from the current ImplicitCtxt's tcx field.
2145 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2146 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2148 with_context(|context| {
2150 let gcx = tcx.gcx as *const _ as usize;
2151 let interners = tcx.interners as *const _ as usize;
2152 assert!(context.tcx.gcx as *const _ as usize == gcx);
2153 assert!(context.tcx.interners as *const _ as usize == interners);
2154 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2160 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2161 /// Panics if there is no ImplicitCtxt available
2162 pub fn with<F, R>(f: F) -> R
2163 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2165 with_context(|context| f(context.tcx))
2168 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2169 /// The closure is passed None if there is no ImplicitCtxt available
2170 pub fn with_opt<F, R>(f: F) -> R
2171 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2173 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2177 macro_rules! sty_debug_print {
2178 ($ctxt: expr, $($variant: ident),*) => {{
2179 // curious inner module to allow variant names to be used as
2181 #[allow(non_snake_case)]
2183 use ty::{self, TyCtxt};
2184 use ty::context::Interned;
2186 #[derive(Copy, Clone)]
2189 region_infer: usize,
2194 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2195 let mut total = DebugStat {
2197 region_infer: 0, ty_infer: 0, both_infer: 0,
2199 $(let mut $variant = total;)*
2201 for &Interned(t) in tcx.interners.type_.borrow().iter() {
2202 let variant = match t.sty {
2203 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2204 ty::Float(..) | ty::Str | ty::Never => continue,
2205 ty::Error => /* unimportant */ continue,
2206 $(ty::$variant(..) => &mut $variant,)*
2208 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2209 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2213 if region { total.region_infer += 1; variant.region_infer += 1 }
2214 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2215 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2217 println!("Ty interner total ty region both");
2218 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2219 {ty:4.1}% {region:5.1}% {both:4.1}%",
2220 stringify!($variant),
2221 uses = $variant.total,
2222 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2223 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2224 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2225 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2227 println!(" total {uses:6} \
2228 {ty:4.1}% {region:5.1}% {both:4.1}%",
2230 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2231 region = total.region_infer as f64 * 100.0 / total.total as f64,
2232 both = total.both_infer as f64 * 100.0 / total.total as f64)
2240 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2241 pub fn print_debug_stats(self) {
2244 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2245 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2246 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2248 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2249 println!("Region interner: #{}", self.interners.region.borrow().len());
2250 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2251 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2252 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2257 /// An entry in an interner.
2258 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2260 // NB: An Interned<Ty> compares and hashes as a sty.
2261 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2262 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2263 self.0.sty == other.0.sty
2267 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2269 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2270 fn hash<H: Hasher>(&self, s: &mut H) {
2275 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2276 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2281 // NB: An Interned<List<T>> compares and hashes as its elements.
2282 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2283 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2284 self.0[..] == other.0[..]
2288 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2290 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2291 fn hash<H: Hasher>(&self, s: &mut H) {
2296 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2297 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2302 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2303 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2308 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2309 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2314 impl<'tcx: 'lcx, 'lcx> Borrow<[ProjectionKind<'lcx>]>
2315 for Interned<'tcx, List<ProjectionKind<'tcx>>> {
2316 fn borrow<'a>(&'a self) -> &'a [ProjectionKind<'lcx>] {
2321 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2322 fn borrow<'a>(&'a self) -> &'a RegionKind {
2327 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2328 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2333 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2334 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2335 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2340 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2341 for Interned<'tcx, List<Predicate<'tcx>>> {
2342 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2347 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2348 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2353 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2354 for Interned<'tcx, List<Clause<'tcx>>> {
2355 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2360 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2361 for Interned<'tcx, List<Goal<'tcx>>> {
2362 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2367 macro_rules! intern_method {
2368 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2371 $keep_in_local_tcx:expr) -> $ty:ty) => {
2372 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2373 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2374 let key = ($alloc_to_key)(&v);
2376 // HACK(eddyb) Depend on flags being accurate to
2377 // determine that all contents are in the global tcx.
2378 // See comments on Lift for why we can't use that.
2379 if ($keep_in_local_tcx)(&v) {
2380 let mut interner = self.interners.$name.borrow_mut();
2381 if let Some(&Interned(v)) = interner.get(key) {
2385 // Make sure we don't end up with inference
2386 // types/regions in the global tcx.
2387 if self.is_global() {
2388 bug!("Attempted to intern `{:?}` which contains \
2389 inference types/regions in the global type context",
2393 let i = $alloc_method(&self.interners.arena, v);
2394 interner.insert(Interned(i));
2397 let mut interner = self.global_interners.$name.borrow_mut();
2398 if let Some(&Interned(v)) = interner.get(key) {
2402 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2406 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2408 let i = unsafe { mem::transmute(i) };
2409 interner.insert(Interned(i));
2417 macro_rules! direct_interners {
2418 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2419 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2420 fn eq(&self, other: &Self) -> bool {
2425 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2427 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2428 fn hash<H: Hasher>(&self, s: &mut H) {
2436 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2438 $keep_in_local_tcx) -> $ty);)+
2442 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2443 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2446 direct_interners!('tcx,
2447 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2448 const_: mk_const(|c: &Const<'_>| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>,
2449 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>
2452 macro_rules! slice_interners {
2453 ($($field:ident: $method:ident($ty:ident)),+) => (
2454 $(intern_method!( 'tcx, $field: $method(
2456 |a, v| List::from_arena(a, v),
2458 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2463 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2464 predicates: _intern_predicates(Predicate),
2465 type_list: _intern_type_list(Ty),
2466 substs: _intern_substs(Kind),
2467 clauses: _intern_clauses(Clause),
2468 goal_list: _intern_goals(Goal),
2469 projs: _intern_projs(ProjectionKind)
2472 // This isn't a perfect fit: CanonicalVarInfo slices are always
2473 // allocated in the global arena, so this `intern_method!` macro is
2474 // overly general. But we just return false for the code that checks
2475 // whether they belong in the thread-local arena, so no harm done, and
2476 // seems better than open-coding the rest.
2479 canonical_var_infos: _intern_canonical_var_infos(
2480 &[CanonicalVarInfo],
2481 |a, v| List::from_arena(a, v),
2483 |_xs: &[CanonicalVarInfo]| -> bool { false }
2484 ) -> List<CanonicalVarInfo>
2487 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2488 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2489 /// that is, a `fn` type that is equivalent in every way for being
2491 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2492 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2493 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2494 unsafety: hir::Unsafety::Unsafe,
2499 /// Given a closure signature `sig`, returns an equivalent `fn`
2500 /// type with the same signature. Detuples and so forth -- so
2501 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2502 /// a `fn(u32, i32)`.
2503 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2504 let converted_sig = sig.map_bound(|s| {
2505 let params_iter = match s.inputs()[0].sty {
2506 ty::Tuple(params) => {
2507 params.into_iter().cloned()
2515 hir::Unsafety::Normal,
2520 self.mk_fn_ptr(converted_sig)
2524 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2525 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2528 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2530 ast::IntTy::Isize => self.types.isize,
2531 ast::IntTy::I8 => self.types.i8,
2532 ast::IntTy::I16 => self.types.i16,
2533 ast::IntTy::I32 => self.types.i32,
2534 ast::IntTy::I64 => self.types.i64,
2535 ast::IntTy::I128 => self.types.i128,
2539 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2541 ast::UintTy::Usize => self.types.usize,
2542 ast::UintTy::U8 => self.types.u8,
2543 ast::UintTy::U16 => self.types.u16,
2544 ast::UintTy::U32 => self.types.u32,
2545 ast::UintTy::U64 => self.types.u64,
2546 ast::UintTy::U128 => self.types.u128,
2550 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2552 ast::FloatTy::F32 => self.types.f32,
2553 ast::FloatTy::F64 => self.types.f64,
2558 pub fn mk_str(self) -> Ty<'tcx> {
2563 pub fn mk_static_str(self) -> Ty<'tcx> {
2564 self.mk_imm_ref(self.types.re_static, self.mk_str())
2568 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2569 // take a copy of substs so that we own the vectors inside
2570 self.mk_ty(Adt(def, substs))
2574 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2575 self.mk_ty(Foreign(def_id))
2578 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2579 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2580 let adt_def = self.adt_def(def_id);
2581 let substs = Substs::for_item(self, def_id, |param, substs| {
2583 GenericParamDefKind::Lifetime => bug!(),
2584 GenericParamDefKind::Type { has_default, .. } => {
2585 if param.index == 0 {
2588 assert!(has_default);
2589 self.type_of(param.def_id).subst(self, substs).into()
2594 self.mk_ty(Adt(adt_def, substs))
2598 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2599 self.mk_ty(RawPtr(tm))
2603 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2604 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2608 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2609 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2613 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2614 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2618 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2619 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2623 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2624 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2628 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2629 self.mk_imm_ptr(self.mk_unit())
2633 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2634 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2638 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2639 self.mk_ty(Slice(ty))
2643 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2644 self.mk_ty(Tuple(self.intern_type_list(ts)))
2647 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2648 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2652 pub fn mk_unit(self) -> Ty<'tcx> {
2657 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2658 if self.features().never_type {
2661 self.intern_tup(&[])
2666 pub fn mk_bool(self) -> Ty<'tcx> {
2671 pub fn mk_fn_def(self, def_id: DefId,
2672 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2673 self.mk_ty(FnDef(def_id, substs))
2677 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2678 self.mk_ty(FnPtr(fty))
2684 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2685 reg: ty::Region<'tcx>
2687 self.mk_ty(Dynamic(obj, reg))
2691 pub fn mk_projection(self,
2693 substs: &'tcx Substs<'tcx>)
2695 self.mk_ty(Projection(ProjectionTy {
2702 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2704 self.mk_ty(Closure(closure_id, closure_substs))
2708 pub fn mk_generator(self,
2710 generator_substs: GeneratorSubsts<'tcx>,
2711 movability: hir::GeneratorMovability)
2713 self.mk_ty(Generator(id, generator_substs, movability))
2717 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2718 self.mk_ty(GeneratorWitness(types))
2722 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2723 self.mk_infer(TyVar(v))
2727 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2728 self.mk_infer(IntVar(v))
2732 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2733 self.mk_infer(FloatVar(v))
2737 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2738 self.mk_ty(Infer(it))
2742 pub fn mk_ty_param(self,
2744 name: InternedString) -> Ty<'tcx> {
2745 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2749 pub fn mk_self_type(self) -> Ty<'tcx> {
2750 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2753 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2755 GenericParamDefKind::Lifetime => {
2756 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2758 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2763 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2764 self.mk_ty(Opaque(def_id, substs))
2767 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2768 -> &'tcx List<ExistentialPredicate<'tcx>> {
2769 assert!(!eps.is_empty());
2770 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2771 self._intern_existential_predicates(eps)
2774 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2775 -> &'tcx List<Predicate<'tcx>> {
2776 // FIXME consider asking the input slice to be sorted to avoid
2777 // re-interning permutations, in which case that would be asserted
2779 if preds.len() == 0 {
2780 // The macro-generated method below asserts we don't intern an empty slice.
2783 self._intern_predicates(preds)
2787 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2791 self._intern_type_list(ts)
2795 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2799 self._intern_substs(ts)
2803 pub fn intern_projs(self, ps: &[ProjectionKind<'tcx>]) -> &'tcx List<ProjectionKind<'tcx>> {
2807 self._intern_projs(ps)
2811 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2815 self.global_tcx()._intern_canonical_var_infos(ts)
2819 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2823 self._intern_clauses(ts)
2827 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2831 self._intern_goals(ts)
2835 pub fn mk_fn_sig<I>(self,
2839 unsafety: hir::Unsafety,
2841 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2843 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2845 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2846 inputs_and_output: self.intern_type_list(xs),
2847 variadic, unsafety, abi
2851 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2852 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2854 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2857 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2858 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2860 iter.intern_with(|xs| self.intern_predicates(xs))
2863 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2864 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2865 iter.intern_with(|xs| self.intern_type_list(xs))
2868 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2869 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2870 iter.intern_with(|xs| self.intern_substs(xs))
2873 pub fn mk_substs_trait(self,
2875 rest: &[Kind<'tcx>])
2876 -> &'tcx Substs<'tcx>
2878 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2881 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2882 iter.intern_with(|xs| self.intern_clauses(xs))
2885 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2886 iter.intern_with(|xs| self.intern_goals(xs))
2889 pub fn lint_hir<S: Into<MultiSpan>>(self,
2890 lint: &'static Lint,
2894 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2897 pub fn lint_node<S: Into<MultiSpan>>(self,
2898 lint: &'static Lint,
2902 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2905 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2906 lint: &'static Lint,
2911 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2916 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2917 lint: &'static Lint,
2922 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2927 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2928 -> (lint::Level, lint::LintSource)
2930 // Right now we insert a `with_ignore` node in the dep graph here to
2931 // ignore the fact that `lint_levels` below depends on the entire crate.
2932 // For now this'll prevent false positives of recompiling too much when
2933 // anything changes.
2935 // Once red/green incremental compilation lands we should be able to
2936 // remove this because while the crate changes often the lint level map
2937 // will change rarely.
2938 self.dep_graph.with_ignore(|| {
2939 let sets = self.lint_levels(LOCAL_CRATE);
2941 let hir_id = self.hir.definitions().node_to_hir_id(id);
2942 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2945 let next = self.hir.get_parent_node(id);
2947 bug!("lint traversal reached the root of the crate");
2954 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2955 lint: &'static Lint,
2959 -> DiagnosticBuilder<'tcx>
2961 let node_id = self.hir.hir_to_node_id(hir_id);
2962 let (level, src) = self.lint_level_at_node(lint, node_id);
2963 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2966 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2967 lint: &'static Lint,
2971 -> DiagnosticBuilder<'tcx>
2973 let (level, src) = self.lint_level_at_node(lint, id);
2974 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2977 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2978 -> DiagnosticBuilder<'tcx>
2980 let (level, src) = self.lint_level_at_node(lint, id);
2981 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2984 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2985 self.in_scope_traits_map(id.owner)
2986 .and_then(|map| map.get(&id.local_id).cloned())
2989 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2990 self.named_region_map(id.owner)
2991 .and_then(|map| map.get(&id.local_id).cloned())
2994 pub fn is_late_bound(self, id: HirId) -> bool {
2995 self.is_late_bound_map(id.owner)
2996 .map(|set| set.contains(&id.local_id))
3000 pub fn object_lifetime_defaults(self, id: HirId)
3001 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
3003 self.object_lifetime_defaults_map(id.owner)
3004 .and_then(|map| map.get(&id.local_id).cloned())
3008 pub trait InternAs<T: ?Sized, R> {
3010 fn intern_with<F>(self, f: F) -> Self::Output
3011 where F: FnOnce(&T) -> R;
3014 impl<I, T, R, E> InternAs<[T], R> for I
3015 where E: InternIteratorElement<T, R>,
3016 I: Iterator<Item=E> {
3017 type Output = E::Output;
3018 fn intern_with<F>(self, f: F) -> Self::Output
3019 where F: FnOnce(&[T]) -> R {
3020 E::intern_with(self, f)
3024 pub trait InternIteratorElement<T, R>: Sized {
3026 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
3029 impl<T, R> InternIteratorElement<T, R> for T {
3031 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3032 f(&iter.collect::<SmallVec<[_; 8]>>())
3036 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
3040 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3041 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
3045 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
3046 type Output = Result<R, E>;
3047 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3048 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
3052 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3053 // FIXME(#44234) - almost all of these queries have no sub-queries and
3054 // therefore no actual inputs, they're just reading tables calculated in
3055 // resolve! Does this work? Unsure! That's what the issue is about
3056 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
3057 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
3058 providers.crate_name = |tcx, id| {
3059 assert_eq!(id, LOCAL_CRATE);
3062 providers.get_lib_features = |tcx, id| {
3063 assert_eq!(id, LOCAL_CRATE);
3064 Lrc::new(middle::lib_features::collect(tcx))
3066 providers.get_lang_items = |tcx, id| {
3067 assert_eq!(id, LOCAL_CRATE);
3068 Lrc::new(middle::lang_items::collect(tcx))
3070 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3071 providers.maybe_unused_trait_import = |tcx, id| {
3072 tcx.maybe_unused_trait_imports.contains(&id)
3074 providers.maybe_unused_extern_crates = |tcx, cnum| {
3075 assert_eq!(cnum, LOCAL_CRATE);
3076 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3079 providers.stability_index = |tcx, cnum| {
3080 assert_eq!(cnum, LOCAL_CRATE);
3081 Lrc::new(stability::Index::new(tcx))
3083 providers.lookup_stability = |tcx, id| {
3084 assert_eq!(id.krate, LOCAL_CRATE);
3085 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3086 tcx.stability().local_stability(id)
3088 providers.lookup_deprecation_entry = |tcx, id| {
3089 assert_eq!(id.krate, LOCAL_CRATE);
3090 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3091 tcx.stability().local_deprecation_entry(id)
3093 providers.extern_mod_stmt_cnum = |tcx, id| {
3094 let id = tcx.hir.as_local_node_id(id).unwrap();
3095 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3097 providers.all_crate_nums = |tcx, cnum| {
3098 assert_eq!(cnum, LOCAL_CRATE);
3099 Lrc::new(tcx.cstore.crates_untracked())
3101 providers.postorder_cnums = |tcx, cnum| {
3102 assert_eq!(cnum, LOCAL_CRATE);
3103 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3105 providers.output_filenames = |tcx, cnum| {
3106 assert_eq!(cnum, LOCAL_CRATE);
3107 tcx.output_filenames.clone()
3109 providers.features_query = |tcx, cnum| {
3110 assert_eq!(cnum, LOCAL_CRATE);
3111 Lrc::new(tcx.sess.features_untracked().clone())
3113 providers.is_panic_runtime = |tcx, cnum| {
3114 assert_eq!(cnum, LOCAL_CRATE);
3115 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
3117 providers.is_compiler_builtins = |tcx, cnum| {
3118 assert_eq!(cnum, LOCAL_CRATE);
3119 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")