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::{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};
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::default()),
93 interner: SyncDroplessArena::default(),
100 pub struct GlobalArenas<'tcx> {
102 layout: TypedArena<LayoutDetails>,
105 generics: TypedArena<ty::Generics>,
106 trait_def: TypedArena<ty::TraitDef>,
107 adt_def: TypedArena<ty::AdtDef>,
108 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
109 mir: TypedArena<Mir<'tcx>>,
110 tables: TypedArena<ty::TypeckTables<'tcx>>,
112 const_allocs: TypedArena<interpret::Allocation>,
115 type InternedSet<'tcx, T> = Lock<FxHashSet<Interned<'tcx, T>>>;
117 pub struct CtxtInterners<'tcx> {
118 /// The arena that types, regions, etc are allocated from
119 arena: &'tcx SyncDroplessArena,
121 /// Specifically use a speedy hash algorithm for these hash sets,
122 /// they're accessed quite often.
123 type_: InternedSet<'tcx, TyS<'tcx>>,
124 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
125 substs: InternedSet<'tcx, Substs<'tcx>>,
126 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
127 region: InternedSet<'tcx, RegionKind>,
128 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
129 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
130 const_: InternedSet<'tcx, Const<'tcx>>,
131 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
132 goal: InternedSet<'tcx, GoalKind<'tcx>>,
133 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
136 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
137 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
140 type_: Default::default(),
141 type_list: Default::default(),
142 substs: Default::default(),
143 region: Default::default(),
144 existential_predicates: Default::default(),
145 canonical_var_infos: Default::default(),
146 predicates: Default::default(),
147 const_: Default::default(),
148 clauses: Default::default(),
149 goal: Default::default(),
150 goal_list: Default::default(),
156 local: &CtxtInterners<'tcx>,
157 global: &CtxtInterners<'gcx>,
160 let flags = super::flags::FlagComputation::for_sty(&st);
162 // HACK(eddyb) Depend on flags being accurate to
163 // determine that all contents are in the global tcx.
164 // See comments on Lift for why we can't use that.
165 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
166 let mut interner = local.type_.borrow_mut();
167 if let Some(&Interned(ty)) = interner.get(&st) {
171 let ty_struct = TyS {
174 outer_exclusive_binder: flags.outer_exclusive_binder,
177 // Make sure we don't end up with inference
178 // types/regions in the global interner
179 if local as *const _ as usize == global as *const _ as usize {
180 bug!("Attempted to intern `{:?}` which contains \
181 inference types/regions in the global type context",
185 // Don't be &mut TyS.
186 let ty: Ty<'tcx> = local.arena.alloc(ty_struct);
187 interner.insert(Interned(ty));
190 let mut interner = global.type_.borrow_mut();
191 if let Some(&Interned(ty)) = interner.get(&st) {
195 let ty_struct = TyS {
198 outer_exclusive_binder: flags.outer_exclusive_binder,
201 // This is safe because all the types the ty_struct can point to
202 // already is in the global arena
203 let ty_struct: TyS<'gcx> = unsafe {
204 mem::transmute(ty_struct)
207 // Don't be &mut TyS.
208 let ty: Ty<'gcx> = global.arena.alloc(ty_struct);
209 interner.insert(Interned(ty));
215 pub struct CommonTypes<'tcx> {
235 pub re_empty: Region<'tcx>,
236 pub re_static: Region<'tcx>,
237 pub re_erased: Region<'tcx>,
240 pub struct LocalTableInContext<'a, V: 'a> {
241 local_id_root: Option<DefId>,
242 data: &'a ItemLocalMap<V>
245 /// Validate that the given HirId (respectively its `local_id` part) can be
246 /// safely used as a key in the tables of a TypeckTable. For that to be
247 /// the case, the HirId must have the same `owner` as all the other IDs in
248 /// this table (signified by `local_id_root`). Otherwise the HirId
249 /// would be in a different frame of reference and using its `local_id`
250 /// would result in lookup errors, or worse, in silently wrong data being
252 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
255 if cfg!(debug_assertions) {
256 if let Some(local_id_root) = local_id_root {
257 if hir_id.owner != local_id_root.index {
258 ty::tls::with(|tcx| {
259 let node_id = tcx.hir.hir_to_node_id(hir_id);
261 bug!("node {} with HirId::owner {:?} cannot be placed in \
262 TypeckTables with local_id_root {:?}",
263 tcx.hir.node_to_string(node_id),
264 DefId::local(hir_id.owner),
269 // We use "Null Object" TypeckTables in some of the analysis passes.
270 // These are just expected to be empty and their `local_id_root` is
271 // `None`. Therefore we cannot verify whether a given `HirId` would
272 // be a valid key for the given table. Instead we make sure that
273 // nobody tries to write to such a Null Object table.
275 bug!("access to invalid TypeckTables")
281 impl<'a, V> LocalTableInContext<'a, V> {
282 pub fn contains_key(&self, id: hir::HirId) -> bool {
283 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
284 self.data.contains_key(&id.local_id)
287 pub fn get(&self, id: hir::HirId) -> Option<&V> {
288 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
289 self.data.get(&id.local_id)
292 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
297 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
300 fn index(&self, key: hir::HirId) -> &V {
301 self.get(key).expect("LocalTableInContext: key not found")
305 pub struct LocalTableInContextMut<'a, V: 'a> {
306 local_id_root: Option<DefId>,
307 data: &'a mut ItemLocalMap<V>
310 impl<'a, V> LocalTableInContextMut<'a, V> {
311 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
312 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
313 self.data.get_mut(&id.local_id)
316 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
317 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
318 self.data.entry(id.local_id)
321 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
322 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
323 self.data.insert(id.local_id, val)
326 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
327 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
328 self.data.remove(&id.local_id)
332 #[derive(RustcEncodable, RustcDecodable, Debug)]
333 pub struct TypeckTables<'tcx> {
334 /// The HirId::owner all ItemLocalIds in this table are relative to.
335 pub local_id_root: Option<DefId>,
337 /// Resolved definitions for `<T>::X` associated paths and
338 /// method calls, including those of overloaded operators.
339 type_dependent_defs: ItemLocalMap<Def>,
341 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
342 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
343 /// about the field you also need definition of the variant to which the field
344 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
345 field_indices: ItemLocalMap<usize>,
347 /// Stores the canonicalized types provided by the user. See also
348 /// `AscribeUserType` statement in MIR.
349 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
351 /// Stores the types for various nodes in the AST. Note that this table
352 /// is not guaranteed to be populated until after typeck. See
353 /// typeck::check::fn_ctxt for details.
354 node_types: ItemLocalMap<Ty<'tcx>>,
356 /// Stores the type parameters which were substituted to obtain the type
357 /// of this node. This only applies to nodes that refer to entities
358 /// parameterized by type parameters, such as generic fns, types, or
360 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
362 /// Stores the substitutions that the user explicitly gave (if any)
363 /// attached to `id`. These will not include any inferred
364 /// values. The canonical form is used to capture things like `_`
365 /// or other unspecified values.
369 /// If the user wrote `foo.collect::<Vec<_>>()`, then the
370 /// canonical substitutions would include only `for<X> { Vec<X>
372 user_substs: ItemLocalMap<CanonicalUserSubsts<'tcx>>,
374 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
376 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
377 pat_binding_modes: ItemLocalMap<BindingMode>,
379 /// Stores the types which were implicitly dereferenced in pattern binding modes
380 /// for later usage in HAIR lowering. For example,
383 /// match &&Some(5i32) {
388 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
391 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
392 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
395 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
397 /// Records the reasons that we picked the kind of each closure;
398 /// not all closures are present in the map.
399 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
401 /// For each fn, records the "liberated" types of its arguments
402 /// and return type. Liberated means that all bound regions
403 /// (including late-bound regions) are replaced with free
404 /// equivalents. This table is not used in codegen (since regions
405 /// are erased there) and hence is not serialized to metadata.
406 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
408 /// For each FRU expression, record the normalized types of the fields
409 /// of the struct - this is needed because it is non-trivial to
410 /// normalize while preserving regions. This table is used only in
411 /// MIR construction and hence is not serialized to metadata.
412 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
414 /// Maps a cast expression to its kind. This is keyed on the
415 /// *from* expression of the cast, not the cast itself.
416 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
418 /// Set of trait imports actually used in the method resolution.
419 /// This is used for warning unused imports. During type
420 /// checking, this `Lrc` should not be cloned: it must have a ref-count
421 /// of 1 so that we can insert things into the set mutably.
422 pub used_trait_imports: Lrc<DefIdSet>,
424 /// If any errors occurred while type-checking this body,
425 /// this field will be set to `true`.
426 pub tainted_by_errors: bool,
428 /// Stores the free-region relationships that were deduced from
429 /// its where clauses and parameter types. These are then
430 /// read-again by borrowck.
431 pub free_region_map: FreeRegionMap<'tcx>,
433 /// All the existential types that are restricted to concrete types
435 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
438 impl<'tcx> TypeckTables<'tcx> {
439 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
442 type_dependent_defs: ItemLocalMap(),
443 field_indices: ItemLocalMap(),
444 user_provided_tys: ItemLocalMap(),
445 node_types: ItemLocalMap(),
446 node_substs: ItemLocalMap(),
447 user_substs: ItemLocalMap(),
448 adjustments: ItemLocalMap(),
449 pat_binding_modes: ItemLocalMap(),
450 pat_adjustments: ItemLocalMap(),
451 upvar_capture_map: Default::default(),
452 closure_kind_origins: ItemLocalMap(),
453 liberated_fn_sigs: ItemLocalMap(),
454 fru_field_types: ItemLocalMap(),
455 cast_kinds: ItemLocalMap(),
456 used_trait_imports: Lrc::new(DefIdSet()),
457 tainted_by_errors: false,
458 free_region_map: Default::default(),
459 concrete_existential_types: Default::default(),
463 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
464 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
466 hir::QPath::Resolved(_, ref path) => path.def,
467 hir::QPath::TypeRelative(..) => {
468 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
469 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
474 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
475 LocalTableInContext {
476 local_id_root: self.local_id_root,
477 data: &self.type_dependent_defs
481 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
482 LocalTableInContextMut {
483 local_id_root: self.local_id_root,
484 data: &mut self.type_dependent_defs
488 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
489 LocalTableInContext {
490 local_id_root: self.local_id_root,
491 data: &self.field_indices
495 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
496 LocalTableInContextMut {
497 local_id_root: self.local_id_root,
498 data: &mut self.field_indices
502 pub fn user_provided_tys(&self) -> LocalTableInContext<'_, CanonicalTy<'tcx>> {
503 LocalTableInContext {
504 local_id_root: self.local_id_root,
505 data: &self.user_provided_tys
509 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalTy<'tcx>> {
510 LocalTableInContextMut {
511 local_id_root: self.local_id_root,
512 data: &mut self.user_provided_tys
516 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
517 LocalTableInContext {
518 local_id_root: self.local_id_root,
519 data: &self.node_types
523 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
524 LocalTableInContextMut {
525 local_id_root: self.local_id_root,
526 data: &mut self.node_types
530 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
531 self.node_id_to_type_opt(id).unwrap_or_else(||
532 bug!("node_id_to_type: no type for node `{}`",
534 let id = tcx.hir.hir_to_node_id(id);
535 tcx.hir.node_to_string(id)
540 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
541 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
542 self.node_types.get(&id.local_id).cloned()
545 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
546 LocalTableInContextMut {
547 local_id_root: self.local_id_root,
548 data: &mut self.node_substs
552 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
553 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
554 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
557 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
558 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
559 self.node_substs.get(&id.local_id).cloned()
562 pub fn user_substs_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalUserSubsts<'tcx>> {
563 LocalTableInContextMut {
564 local_id_root: self.local_id_root,
565 data: &mut self.user_substs
569 pub fn user_substs(&self, id: hir::HirId) -> Option<CanonicalUserSubsts<'tcx>> {
570 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
571 self.user_substs.get(&id.local_id).cloned()
574 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
575 // doesn't provide type parameter substitutions.
576 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
577 self.node_id_to_type(pat.hir_id)
580 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
581 self.node_id_to_type_opt(pat.hir_id)
584 // Returns the type of an expression as a monotype.
586 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
587 // some cases, we insert `Adjustment` annotations such as auto-deref or
588 // auto-ref. The type returned by this function does not consider such
589 // adjustments. See `expr_ty_adjusted()` instead.
591 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
592 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
593 // instead of "fn(ty) -> T with T = isize".
594 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
595 self.node_id_to_type(expr.hir_id)
598 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
599 self.node_id_to_type_opt(expr.hir_id)
602 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
603 LocalTableInContext {
604 local_id_root: self.local_id_root,
605 data: &self.adjustments
609 pub fn adjustments_mut(&mut self)
610 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
611 LocalTableInContextMut {
612 local_id_root: self.local_id_root,
613 data: &mut self.adjustments
617 pub fn expr_adjustments(&self, expr: &hir::Expr)
618 -> &[ty::adjustment::Adjustment<'tcx>] {
619 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
620 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
623 /// Returns the type of `expr`, considering any `Adjustment`
624 /// entry recorded for that expression.
625 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
626 self.expr_adjustments(expr)
628 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
631 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
632 self.expr_adjustments(expr)
634 .map(|adj| adj.target)
635 .or_else(|| self.expr_ty_opt(expr))
638 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
639 // Only paths and method calls/overloaded operators have
640 // entries in type_dependent_defs, ignore the former here.
641 if let hir::ExprKind::Path(_) = expr.node {
645 match self.type_dependent_defs().get(expr.hir_id) {
646 Some(&Def::Method(_)) => true,
651 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
652 LocalTableInContext {
653 local_id_root: self.local_id_root,
654 data: &self.pat_binding_modes
658 pub fn pat_binding_modes_mut(&mut self)
659 -> LocalTableInContextMut<'_, BindingMode> {
660 LocalTableInContextMut {
661 local_id_root: self.local_id_root,
662 data: &mut self.pat_binding_modes
666 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
667 LocalTableInContext {
668 local_id_root: self.local_id_root,
669 data: &self.pat_adjustments,
673 pub fn pat_adjustments_mut(&mut self)
674 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
675 LocalTableInContextMut {
676 local_id_root: self.local_id_root,
677 data: &mut self.pat_adjustments,
681 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
682 self.upvar_capture_map[&upvar_id]
685 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
686 LocalTableInContext {
687 local_id_root: self.local_id_root,
688 data: &self.closure_kind_origins
692 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
693 LocalTableInContextMut {
694 local_id_root: self.local_id_root,
695 data: &mut self.closure_kind_origins
699 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
700 LocalTableInContext {
701 local_id_root: self.local_id_root,
702 data: &self.liberated_fn_sigs
706 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
707 LocalTableInContextMut {
708 local_id_root: self.local_id_root,
709 data: &mut self.liberated_fn_sigs
713 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
714 LocalTableInContext {
715 local_id_root: self.local_id_root,
716 data: &self.fru_field_types
720 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
721 LocalTableInContextMut {
722 local_id_root: self.local_id_root,
723 data: &mut self.fru_field_types
727 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
728 LocalTableInContext {
729 local_id_root: self.local_id_root,
730 data: &self.cast_kinds
734 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
735 LocalTableInContextMut {
736 local_id_root: self.local_id_root,
737 data: &mut self.cast_kinds
742 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
743 fn hash_stable<W: StableHasherResult>(&self,
744 hcx: &mut StableHashingContext<'a>,
745 hasher: &mut StableHasher<W>) {
746 let ty::TypeckTables {
748 ref type_dependent_defs,
750 ref user_provided_tys,
755 ref pat_binding_modes,
757 ref upvar_capture_map,
758 ref closure_kind_origins,
759 ref liberated_fn_sigs,
764 ref used_trait_imports,
767 ref concrete_existential_types,
770 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
771 type_dependent_defs.hash_stable(hcx, hasher);
772 field_indices.hash_stable(hcx, hasher);
773 user_provided_tys.hash_stable(hcx, hasher);
774 node_types.hash_stable(hcx, hasher);
775 node_substs.hash_stable(hcx, hasher);
776 user_substs.hash_stable(hcx, hasher);
777 adjustments.hash_stable(hcx, hasher);
778 pat_binding_modes.hash_stable(hcx, hasher);
779 pat_adjustments.hash_stable(hcx, hasher);
780 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
787 local_id_root.expect("trying to hash invalid TypeckTables");
789 let var_owner_def_id = DefId {
790 krate: local_id_root.krate,
793 let closure_def_id = DefId {
794 krate: local_id_root.krate,
795 index: closure_expr_id.to_def_id().index,
797 (hcx.def_path_hash(var_owner_def_id),
799 hcx.def_path_hash(closure_def_id))
802 closure_kind_origins.hash_stable(hcx, hasher);
803 liberated_fn_sigs.hash_stable(hcx, hasher);
804 fru_field_types.hash_stable(hcx, hasher);
805 cast_kinds.hash_stable(hcx, hasher);
806 used_trait_imports.hash_stable(hcx, hasher);
807 tainted_by_errors.hash_stable(hcx, hasher);
808 free_region_map.hash_stable(hcx, hasher);
809 concrete_existential_types.hash_stable(hcx, hasher);
814 impl<'tcx> CommonTypes<'tcx> {
815 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
816 // Ensure our type representation does not grow
817 #[cfg(target_pointer_width = "64")]
818 static_assert!(ASSERT_TY_KIND: ::std::mem::size_of::<ty::TyKind<'_>>() <= 24);
819 #[cfg(target_pointer_width = "64")]
820 static_assert!(ASSERT_TYS: ::std::mem::size_of::<ty::TyS<'_>>() <= 32);
822 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
823 let mk_region = |r| {
824 if let Some(r) = interners.region.borrow().get(&r) {
827 let r = interners.arena.alloc(r);
828 interners.region.borrow_mut().insert(Interned(r));
836 isize: mk(Int(ast::IntTy::Isize)),
837 i8: mk(Int(ast::IntTy::I8)),
838 i16: mk(Int(ast::IntTy::I16)),
839 i32: mk(Int(ast::IntTy::I32)),
840 i64: mk(Int(ast::IntTy::I64)),
841 i128: mk(Int(ast::IntTy::I128)),
842 usize: mk(Uint(ast::UintTy::Usize)),
843 u8: mk(Uint(ast::UintTy::U8)),
844 u16: mk(Uint(ast::UintTy::U16)),
845 u32: mk(Uint(ast::UintTy::U32)),
846 u64: mk(Uint(ast::UintTy::U64)),
847 u128: mk(Uint(ast::UintTy::U128)),
848 f32: mk(Float(ast::FloatTy::F32)),
849 f64: mk(Float(ast::FloatTy::F64)),
851 re_empty: mk_region(RegionKind::ReEmpty),
852 re_static: mk_region(RegionKind::ReStatic),
853 re_erased: mk_region(RegionKind::ReErased),
858 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
861 pub struct FreeRegionInfo {
862 // def id corresponding to FreeRegion
864 // the bound region corresponding to FreeRegion
865 pub boundregion: ty::BoundRegion,
866 // checks if bound region is in Impl Item
867 pub is_impl_item: bool,
870 /// The central data structure of the compiler. It stores references
871 /// to the various **arenas** and also houses the results of the
872 /// various **compiler queries** that have been performed. See the
873 /// [rustc guide] for more details.
875 /// [rustc guide]: https://rust-lang-nursery.github.io/rustc-guide/ty.html
876 #[derive(Copy, Clone)]
877 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
878 gcx: &'a GlobalCtxt<'gcx>,
879 interners: &'a CtxtInterners<'tcx>
882 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
883 type Target = &'a GlobalCtxt<'gcx>;
884 fn deref(&self) -> &Self::Target {
889 pub struct GlobalCtxt<'tcx> {
890 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
891 global_interners: CtxtInterners<'tcx>,
893 cstore: &'tcx CrateStoreDyn,
895 pub sess: &'tcx Session,
897 pub dep_graph: DepGraph,
899 /// Common types, pre-interned for your convenience.
900 pub types: CommonTypes<'tcx>,
902 /// Map indicating what traits are in scope for places where this
903 /// is relevant; generated by resolve.
904 trait_map: FxHashMap<DefIndex,
905 Lrc<FxHashMap<ItemLocalId,
906 Lrc<StableVec<TraitCandidate>>>>>,
908 /// Export map produced by name resolution.
909 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
911 pub hir: hir_map::Map<'tcx>,
913 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
914 /// as well as all upstream crates. Only populated in incremental mode.
915 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
917 pub(crate) queries: query::Queries<'tcx>,
919 // Records the free variables referenced by every closure
920 // expression. Do not track deps for this, just recompute it from
921 // scratch every time.
922 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
924 maybe_unused_trait_imports: FxHashSet<DefId>,
925 maybe_unused_extern_crates: Vec<(DefId, Span)>,
926 pub extern_prelude: FxHashSet<ast::Name>,
928 // Internal cache for metadata decoding. No need to track deps on this.
929 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
931 /// Caches the results of trait selection. This cache is used
932 /// for things that do not have to do with the parameters in scope.
933 pub selection_cache: traits::SelectionCache<'tcx>,
935 /// Caches the results of trait evaluation. This cache is used
936 /// for things that do not have to do with the parameters in scope.
937 /// Merge this with `selection_cache`?
938 pub evaluation_cache: traits::EvaluationCache<'tcx>,
940 /// The definite name of the current crate after taking into account
941 /// attributes, commandline parameters, etc.
942 pub crate_name: Symbol,
944 /// Data layout specification for the current target.
945 pub data_layout: TargetDataLayout,
947 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
949 /// Stores the value of constants (and deduplicates the actual memory)
950 allocation_interner: Lock<FxHashSet<&'tcx Allocation>>,
952 pub alloc_map: Lock<interpret::AllocMap<'tcx, &'tcx Allocation>>,
954 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
956 /// A general purpose channel to throw data out the back towards LLVM worker
959 /// This is intended to only get used during the codegen phase of the compiler
960 /// when satisfying the query for a particular codegen unit. Internally in
961 /// the query it'll send data along this channel to get processed later.
962 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
964 output_filenames: Arc<OutputFilenames>,
967 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
968 /// Get the global TyCtxt.
970 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
973 interners: &self.gcx.global_interners,
977 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
978 self.global_arenas.generics.alloc(generics)
981 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
982 self.global_arenas.steal_mir.alloc(Steal::new(mir))
985 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
986 self.global_arenas.mir.alloc(mir)
989 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
990 self.global_arenas.tables.alloc(tables)
993 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
994 self.global_arenas.trait_def.alloc(def)
997 pub fn alloc_adt_def(self,
1000 variants: Vec<ty::VariantDef>,
1002 -> &'gcx ty::AdtDef {
1003 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1004 self.global_arenas.adt_def.alloc(def)
1007 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1008 if bytes.is_empty() {
1011 self.global_interners.arena.alloc_slice(bytes)
1015 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1016 -> &'tcx [&'tcx ty::Const<'tcx>] {
1017 if values.is_empty() {
1020 self.interners.arena.alloc_slice(values)
1024 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1025 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1026 if values.is_empty() {
1029 self.interners.arena.alloc_slice(values)
1033 pub fn intern_const_alloc(
1036 ) -> &'gcx Allocation {
1037 let allocs = &mut self.allocation_interner.borrow_mut();
1038 if let Some(alloc) = allocs.get(&alloc) {
1042 let interned = self.global_arenas.const_allocs.alloc(alloc);
1043 if let Some(prev) = allocs.replace(interned) { // insert into interner
1044 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1049 /// Allocates a byte or string literal for `mir::interpret`, read-only
1050 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1051 // create an allocation that just contains these bytes
1052 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1053 let alloc = self.intern_const_alloc(alloc);
1054 self.alloc_map.lock().allocate(alloc)
1057 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1058 let mut stability_interner = self.stability_interner.borrow_mut();
1059 if let Some(st) = stability_interner.get(&stab) {
1063 let interned = self.global_interners.arena.alloc(stab);
1064 if let Some(prev) = stability_interner.replace(interned) {
1065 bug!("Tried to overwrite interned Stability: {:?}", prev)
1070 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1071 let mut layout_interner = self.layout_interner.borrow_mut();
1072 if let Some(layout) = layout_interner.get(&layout) {
1076 let interned = self.global_arenas.layout.alloc(layout);
1077 if let Some(prev) = layout_interner.replace(interned) {
1078 bug!("Tried to overwrite interned Layout: {:?}", prev)
1083 /// Returns a range of the start/end indices specified with the
1084 /// `rustc_layout_scalar_valid_range` attribute.
1085 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1086 let attrs = self.get_attrs(def_id);
1088 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1090 None => return Bound::Unbounded,
1092 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1093 match meta.literal().expect("attribute takes lit").node {
1094 ast::LitKind::Int(a, _) => return Bound::Included(a),
1095 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1098 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1100 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1103 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1104 value.lift_to_tcx(self)
1107 /// Like lift, but only tries in the global tcx.
1108 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1109 value.lift_to_tcx(self.global_tcx())
1112 /// Returns true if self is the same as self.global_tcx().
1113 fn is_global(self) -> bool {
1114 let local = self.interners as *const _;
1115 let global = &self.global_interners as *const _;
1116 local as usize == global as usize
1119 /// Create a type context and call the closure with a `TyCtxt` reference
1120 /// to the context. The closure enforces that the type context and any interned
1121 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1122 /// reference to the context, to allow formatting values that need it.
1123 pub fn create_and_enter<F, R>(s: &'tcx Session,
1124 cstore: &'tcx CrateStoreDyn,
1125 local_providers: ty::query::Providers<'tcx>,
1126 extern_providers: ty::query::Providers<'tcx>,
1127 arenas: &'tcx AllArenas<'tcx>,
1128 resolutions: ty::Resolutions,
1129 hir: hir_map::Map<'tcx>,
1130 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1132 tx: mpsc::Sender<Box<dyn Any + Send>>,
1133 output_filenames: &OutputFilenames,
1135 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1137 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1140 let interners = CtxtInterners::new(&arenas.interner);
1141 let common_types = CommonTypes::new(&interners);
1142 let dep_graph = hir.dep_graph.clone();
1143 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1144 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1145 providers[LOCAL_CRATE] = local_providers;
1147 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1148 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1151 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1154 let def_path_tables = || {
1155 upstream_def_path_tables
1157 .map(|&(cnum, ref rc)| (cnum, &**rc))
1158 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1161 // Precompute the capacity of the hashmap so we don't have to
1162 // re-allocate when populating it.
1163 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1165 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1167 ::std::default::Default::default()
1170 for (cnum, def_path_table) in def_path_tables() {
1171 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1179 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1180 for (k, v) in resolutions.trait_map {
1181 let hir_id = hir.node_to_hir_id(k);
1182 let map = trait_map.entry(hir_id.owner).or_default();
1183 Lrc::get_mut(map).unwrap()
1184 .insert(hir_id.local_id,
1185 Lrc::new(StableVec::new(v)));
1188 let gcx = &GlobalCtxt {
1191 global_arenas: &arenas.global,
1192 global_interners: interners,
1193 dep_graph: dep_graph.clone(),
1194 types: common_types,
1196 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1199 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1200 (hir.local_def_id(k), Lrc::new(v))
1202 maybe_unused_trait_imports:
1203 resolutions.maybe_unused_trait_imports
1205 .map(|id| hir.local_def_id(id))
1207 maybe_unused_extern_crates:
1208 resolutions.maybe_unused_extern_crates
1210 .map(|(id, sp)| (hir.local_def_id(id), sp))
1212 extern_prelude: resolutions.extern_prelude,
1214 def_path_hash_to_def_id,
1215 queries: query::Queries::new(
1218 on_disk_query_result_cache,
1220 rcache: Default::default(),
1221 selection_cache: Default::default(),
1222 evaluation_cache: Default::default(),
1223 crate_name: Symbol::intern(crate_name),
1225 layout_interner: Default::default(),
1226 stability_interner: Default::default(),
1227 allocation_interner: Default::default(),
1228 alloc_map: Lock::new(interpret::AllocMap::new()),
1229 tx_to_llvm_workers: Lock::new(tx),
1230 output_filenames: Arc::new(output_filenames.clone()),
1233 sync::assert_send_val(&gcx);
1235 tls::enter_global(gcx, f)
1238 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1239 let cname = self.crate_name(LOCAL_CRATE).as_str();
1240 self.sess.consider_optimizing(&cname, msg)
1243 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1244 self.get_lib_features(LOCAL_CRATE)
1247 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1248 self.get_lang_items(LOCAL_CRATE)
1251 /// Due to missing llvm support for lowering 128 bit math to software emulation
1252 /// (on some targets), the lowering can be done in MIR.
1254 /// This function only exists until said support is implemented.
1255 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1256 let items = self.lang_items();
1257 let def_id = Some(def_id);
1258 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1259 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1260 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1261 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1262 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1263 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1264 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1265 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1266 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1267 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1268 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1269 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1270 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1271 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1272 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1273 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1274 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1275 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1276 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1277 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1278 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1279 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1280 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1281 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1285 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1286 self.stability_index(LOCAL_CRATE)
1289 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1290 self.all_crate_nums(LOCAL_CRATE)
1293 pub fn features(self) -> Lrc<feature_gate::Features> {
1294 self.features_query(LOCAL_CRATE)
1297 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1299 self.hir.def_key(id)
1301 self.cstore.def_key(id)
1305 /// Convert a `DefId` into its fully expanded `DefPath` (every
1306 /// `DefId` is really just an interned def-path).
1308 /// Note that if `id` is not local to this crate, the result will
1309 /// be a non-local `DefPath`.
1310 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1312 self.hir.def_path(id)
1314 self.cstore.def_path(id)
1319 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1320 if def_id.is_local() {
1321 self.hir.definitions().def_path_hash(def_id.index)
1323 self.cstore.def_path_hash(def_id)
1327 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1328 // We are explicitly not going through queries here in order to get
1329 // crate name and disambiguator since this code is called from debug!()
1330 // statements within the query system and we'd run into endless
1331 // recursion otherwise.
1332 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1333 (self.crate_name.clone(),
1334 self.sess.local_crate_disambiguator())
1336 (self.cstore.crate_name_untracked(def_id.krate),
1337 self.cstore.crate_disambiguator_untracked(def_id.krate))
1342 // Don't print the whole crate disambiguator. That's just
1343 // annoying in debug output.
1344 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1345 self.def_path(def_id).to_string_no_crate())
1348 pub fn metadata_encoding_version(self) -> Vec<u8> {
1349 self.cstore.metadata_encoding_version().to_vec()
1352 // Note that this is *untracked* and should only be used within the query
1353 // system if the result is otherwise tracked through queries
1354 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1355 self.cstore.crate_data_as_rc_any(cnum)
1358 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1359 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1361 StableHashingContext::new(self.sess,
1363 self.hir.definitions(),
1367 // This method makes sure that we have a DepNode and a Fingerprint for
1368 // every upstream crate. It needs to be called once right after the tcx is
1370 // With full-fledged red/green, the method will probably become unnecessary
1371 // as this will be done on-demand.
1372 pub fn allocate_metadata_dep_nodes(self) {
1373 // We cannot use the query versions of crates() and crate_hash(), since
1374 // those would need the DepNodes that we are allocating here.
1375 for cnum in self.cstore.crates_untracked() {
1376 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1377 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1378 self.dep_graph.with_task(dep_node,
1381 |_, x| x // No transformation needed
1386 // This method exercises the `in_scope_traits_map` query for all possible
1387 // values so that we have their fingerprints available in the DepGraph.
1388 // This is only required as long as we still use the old dependency tracking
1389 // which needs to have the fingerprints of all input nodes beforehand.
1390 pub fn precompute_in_scope_traits_hashes(self) {
1391 for &def_index in self.trait_map.keys() {
1392 self.in_scope_traits_map(def_index);
1396 pub fn serialize_query_result_cache<E>(self,
1398 -> Result<(), E::Error>
1399 where E: ty::codec::TyEncoder
1401 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1404 /// This checks whether one is allowed to have pattern bindings
1405 /// that bind-by-move on a match arm that has a guard, e.g.:
1408 /// match foo { A(inner) if { /* something */ } => ..., ... }
1411 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1412 /// because that method has a narrower effect that can be toggled
1413 /// off via a separate `-Z` flag, at least for the short term.
1414 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1415 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1418 /// If true, we should use a naive AST walk to determine if match
1419 /// guard could perform bad mutations (or mutable-borrows).
1420 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1421 // If someone requests the feature, then be a little more
1422 // careful and ensure that MIR-borrowck is enabled (which can
1423 // happen via edition selection, via `feature(nll)`, or via an
1424 // appropriate `-Z` flag) before disabling the mutation check.
1425 if self.allow_bind_by_move_patterns_with_guards() {
1432 /// If true, we should use the AST-based borrowck (we may *also* use
1433 /// the MIR-based borrowck).
1434 pub fn use_ast_borrowck(self) -> bool {
1435 self.borrowck_mode().use_ast()
1438 /// If true, we should use the MIR-based borrowck (we may *also* use
1439 /// the AST-based borrowck).
1440 pub fn use_mir_borrowck(self) -> bool {
1441 self.borrowck_mode().use_mir()
1444 /// If true, we should use the MIR-based borrow check, but also
1445 /// fall back on the AST borrow check if the MIR-based one errors.
1446 pub fn migrate_borrowck(self) -> bool {
1447 self.borrowck_mode().migrate()
1450 /// If true, make MIR codegen for `match` emit a temp that holds a
1451 /// borrow of the input to the match expression.
1452 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1453 self.emit_read_for_match()
1456 /// If true, make MIR codegen for `match` emit FakeRead
1457 /// statements (which simulate the maximal effect of executing the
1458 /// patterns in a match arm).
1459 pub fn emit_read_for_match(&self) -> bool {
1460 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1463 /// If true, pattern variables for use in guards on match arms
1464 /// will be bound as references to the data, and occurrences of
1465 /// those variables in the guard expression will implicitly
1466 /// dereference those bindings. (See rust-lang/rust#27282.)
1467 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1468 self.borrowck_mode().use_mir()
1471 /// If true, we should enable two-phase borrows checks. This is
1472 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1473 /// or by opting into an edition after 2015.
1474 pub fn two_phase_borrows(self) -> bool {
1475 if self.features().nll || self.sess.opts.debugging_opts.two_phase_borrows {
1479 match self.sess.edition() {
1480 Edition::Edition2015 => false,
1481 Edition::Edition2018 => true,
1486 /// What mode(s) of borrowck should we run? AST? MIR? both?
1487 /// (Also considers the `#![feature(nll)]` setting.)
1488 pub fn borrowck_mode(&self) -> BorrowckMode {
1489 // Here are the main constraints we need to deal with:
1491 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1492 // synonymous with no `-Z borrowck=...` flag at all.
1493 // (This is arguably a historical accident.)
1495 // 2. `BorrowckMode::Migrate` is the limited migration to
1496 // NLL that we are deploying with the 2018 edition.
1498 // 3. We want to allow developers on the Nightly channel
1499 // to opt back into the "hard error" mode for NLL,
1500 // (which they can do via specifying `#![feature(nll)]`
1501 // explicitly in their crate).
1503 // So, this precedence list is how pnkfelix chose to work with
1504 // the above constraints:
1506 // * `#![feature(nll)]` *always* means use NLL with hard
1507 // errors. (To simplify the code here, it now even overrides
1508 // a user's attempt to specify `-Z borrowck=compare`, which
1509 // we arguably do not need anymore and should remove.)
1511 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1512 // if `borrowck=ast` was specified), then use the default
1513 // as required by the edition.
1515 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1517 if self.features().nll { return BorrowckMode::Mir; }
1519 match self.sess.opts.borrowck_mode {
1520 mode @ BorrowckMode::Mir |
1521 mode @ BorrowckMode::Compare |
1522 mode @ BorrowckMode::Migrate => mode,
1524 BorrowckMode::Ast => match self.sess.edition() {
1525 Edition::Edition2015 => BorrowckMode::Ast,
1526 Edition::Edition2018 => BorrowckMode::Migrate,
1528 // For now, future editions mean Migrate. (But it
1529 // would make a lot of sense for it to be changed to
1530 // `BorrowckMode::Mir`, depending on how we plan to
1531 // time the forcing of full migration to NLL.)
1532 _ => BorrowckMode::Migrate,
1537 /// Should we emit EndRegion MIR statements? These are consumed by
1538 /// MIR borrowck, but not when NLL is used. They are also consumed
1539 /// by the validation stuff.
1540 pub fn emit_end_regions(self) -> bool {
1541 self.sess.opts.debugging_opts.emit_end_regions ||
1542 self.sess.opts.debugging_opts.mir_emit_validate > 0 ||
1543 self.use_mir_borrowck()
1547 pub fn local_crate_exports_generics(self) -> bool {
1548 debug_assert!(self.sess.opts.share_generics());
1550 self.sess.crate_types.borrow().iter().any(|crate_type| {
1552 CrateType::Executable |
1553 CrateType::Staticlib |
1554 CrateType::ProcMacro |
1555 CrateType::Cdylib => false,
1557 CrateType::Dylib => true,
1562 // This method returns the DefId and the BoundRegion corresponding to the given region.
1563 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1564 let (suitable_region_binding_scope, bound_region) = match *region {
1565 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1566 ty::ReEarlyBound(ref ebr) => (
1567 self.parent_def_id(ebr.def_id).unwrap(),
1568 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1570 _ => return None, // not a free region
1573 let node_id = self.hir
1574 .as_local_node_id(suitable_region_binding_scope)
1576 let is_impl_item = match self.hir.find(node_id) {
1577 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1578 Some(Node::ImplItem(..)) => {
1579 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1584 return Some(FreeRegionInfo {
1585 def_id: suitable_region_binding_scope,
1586 boundregion: bound_region,
1587 is_impl_item: is_impl_item,
1591 pub fn return_type_impl_trait(
1593 scope_def_id: DefId,
1594 ) -> Option<Ty<'tcx>> {
1595 let ret_ty = self.type_of(scope_def_id);
1597 ty::FnDef(_, _) => {
1598 let sig = ret_ty.fn_sig(*self);
1599 let output = self.erase_late_bound_regions(&sig.output());
1600 if output.is_impl_trait() {
1610 // Here we check if the bound region is in Impl Item.
1611 pub fn is_bound_region_in_impl_item(
1613 suitable_region_binding_scope: DefId,
1615 let container_id = self.associated_item(suitable_region_binding_scope)
1618 if self.impl_trait_ref(container_id).is_some() {
1619 // For now, we do not try to target impls of traits. This is
1620 // because this message is going to suggest that the user
1621 // change the fn signature, but they may not be free to do so,
1622 // since the signature must match the trait.
1624 // FIXME(#42706) -- in some cases, we could do better here.
1631 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1632 pub fn encode_metadata(self)
1635 self.cstore.encode_metadata(self)
1639 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1640 /// Call the closure with a local `TyCtxt` using the given arena.
1641 pub fn enter_local<F, R>(
1643 arena: &'tcx SyncDroplessArena,
1647 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1649 let interners = CtxtInterners::new(arena);
1652 interners: &interners,
1654 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1655 let new_icx = ty::tls::ImplicitCtxt {
1657 query: icx.query.clone(),
1658 layout_depth: icx.layout_depth,
1661 ty::tls::enter_context(&new_icx, |new_icx| {
1668 /// A trait implemented for all X<'a> types which can be safely and
1669 /// efficiently converted to X<'tcx> as long as they are part of the
1670 /// provided TyCtxt<'tcx>.
1671 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1672 /// by looking them up in their respective interners.
1674 /// However, this is still not the best implementation as it does
1675 /// need to compare the components, even for interned values.
1676 /// It would be more efficient if TypedArena provided a way to
1677 /// determine whether the address is in the allocated range.
1679 /// None is returned if the value or one of the components is not part
1680 /// of the provided context.
1681 /// For Ty, None can be returned if either the type interner doesn't
1682 /// contain the TyKind key or if the address of the interned
1683 /// pointer differs. The latter case is possible if a primitive type,
1684 /// e.g. `()` or `u8`, was interned in a different context.
1685 pub trait Lift<'tcx>: fmt::Debug {
1686 type Lifted: fmt::Debug + 'tcx;
1687 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1690 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1691 type Lifted = Ty<'tcx>;
1692 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1693 if tcx.interners.arena.in_arena(*self as *const _) {
1694 return Some(unsafe { mem::transmute(*self) });
1696 // Also try in the global tcx if we're not that.
1697 if !tcx.is_global() {
1698 self.lift_to_tcx(tcx.global_tcx())
1705 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1706 type Lifted = Region<'tcx>;
1707 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1708 if tcx.interners.arena.in_arena(*self as *const _) {
1709 return Some(unsafe { mem::transmute(*self) });
1711 // Also try in the global tcx if we're not that.
1712 if !tcx.is_global() {
1713 self.lift_to_tcx(tcx.global_tcx())
1720 impl<'a, 'tcx> Lift<'tcx> for Goal<'a> {
1721 type Lifted = Goal<'tcx>;
1722 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Goal<'tcx>> {
1723 if tcx.interners.arena.in_arena(*self as *const _) {
1724 return Some(unsafe { mem::transmute(*self) });
1726 // Also try in the global tcx if we're not that.
1727 if !tcx.is_global() {
1728 self.lift_to_tcx(tcx.global_tcx())
1735 impl<'a, 'tcx> Lift<'tcx> for &'a List<Goal<'a>> {
1736 type Lifted = &'tcx List<Goal<'tcx>>;
1737 fn lift_to_tcx<'b, 'gcx>(
1739 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1740 ) -> Option<&'tcx List<Goal<'tcx>>> {
1741 if tcx.interners.arena.in_arena(*self as *const _) {
1742 return Some(unsafe { mem::transmute(*self) });
1744 // Also try in the global tcx if we're not that.
1745 if !tcx.is_global() {
1746 self.lift_to_tcx(tcx.global_tcx())
1753 impl<'a, 'tcx> Lift<'tcx> for &'a List<Clause<'a>> {
1754 type Lifted = &'tcx List<Clause<'tcx>>;
1755 fn lift_to_tcx<'b, 'gcx>(
1757 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1758 ) -> Option<&'tcx List<Clause<'tcx>>> {
1759 if tcx.interners.arena.in_arena(*self as *const _) {
1760 return Some(unsafe { mem::transmute(*self) });
1762 // Also try in the global tcx if we're not that.
1763 if !tcx.is_global() {
1764 self.lift_to_tcx(tcx.global_tcx())
1771 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1772 type Lifted = &'tcx Const<'tcx>;
1773 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1774 if tcx.interners.arena.in_arena(*self as *const _) {
1775 return Some(unsafe { mem::transmute(*self) });
1777 // Also try in the global tcx if we're not that.
1778 if !tcx.is_global() {
1779 self.lift_to_tcx(tcx.global_tcx())
1786 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1787 type Lifted = &'tcx Substs<'tcx>;
1788 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1789 if self.len() == 0 {
1790 return Some(List::empty());
1792 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1793 return Some(unsafe { mem::transmute(*self) });
1795 // Also try in the global tcx if we're not that.
1796 if !tcx.is_global() {
1797 self.lift_to_tcx(tcx.global_tcx())
1804 impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>> {
1805 type Lifted = &'tcx List<Ty<'tcx>>;
1806 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1807 -> Option<&'tcx List<Ty<'tcx>>> {
1808 if self.len() == 0 {
1809 return Some(List::empty());
1811 if tcx.interners.arena.in_arena(*self as *const _) {
1812 return Some(unsafe { mem::transmute(*self) });
1814 // Also try in the global tcx if we're not that.
1815 if !tcx.is_global() {
1816 self.lift_to_tcx(tcx.global_tcx())
1823 impl<'a, 'tcx> Lift<'tcx> for &'a List<ExistentialPredicate<'a>> {
1824 type Lifted = &'tcx List<ExistentialPredicate<'tcx>>;
1825 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1826 -> Option<&'tcx List<ExistentialPredicate<'tcx>>> {
1827 if self.is_empty() {
1828 return Some(List::empty());
1830 if tcx.interners.arena.in_arena(*self as *const _) {
1831 return Some(unsafe { mem::transmute(*self) });
1833 // Also try in the global tcx if we're not that.
1834 if !tcx.is_global() {
1835 self.lift_to_tcx(tcx.global_tcx())
1842 impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>> {
1843 type Lifted = &'tcx List<Predicate<'tcx>>;
1844 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1845 -> Option<&'tcx List<Predicate<'tcx>>> {
1846 if self.is_empty() {
1847 return Some(List::empty());
1849 if tcx.interners.arena.in_arena(*self as *const _) {
1850 return Some(unsafe { mem::transmute(*self) });
1852 // Also try in the global tcx if we're not that.
1853 if !tcx.is_global() {
1854 self.lift_to_tcx(tcx.global_tcx())
1861 impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo> {
1862 type Lifted = &'tcx List<CanonicalVarInfo>;
1863 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1864 if self.len() == 0 {
1865 return Some(List::empty());
1867 if tcx.interners.arena.in_arena(*self as *const _) {
1868 return Some(unsafe { mem::transmute(*self) });
1870 // Also try in the global tcx if we're not that.
1871 if !tcx.is_global() {
1872 self.lift_to_tcx(tcx.global_tcx())
1880 use super::{GlobalCtxt, TyCtxt};
1886 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1887 use rustc_data_structures::OnDrop;
1888 use rustc_data_structures::sync::{self, Lrc, Lock};
1889 use dep_graph::OpenTask;
1891 #[cfg(not(parallel_queries))]
1892 use std::cell::Cell;
1894 #[cfg(parallel_queries)]
1897 /// This is the implicit state of rustc. It contains the current
1898 /// TyCtxt and query. It is updated when creating a local interner or
1899 /// executing a new query. Whenever there's a TyCtxt value available
1900 /// you should also have access to an ImplicitCtxt through the functions
1903 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1904 /// The current TyCtxt. Initially created by `enter_global` and updated
1905 /// by `enter_local` with a new local interner
1906 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1908 /// The current query job, if any. This is updated by start_job in
1909 /// ty::query::plumbing when executing a query
1910 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1912 /// Used to prevent layout from recursing too deeply.
1913 pub layout_depth: usize,
1915 /// The current dep graph task. This is used to add dependencies to queries
1916 /// when executing them
1917 pub task: &'a OpenTask,
1920 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1921 /// to `value` during the call to `f`. It is restored to its previous value after.
1922 /// This is used to set the pointer to the new ImplicitCtxt.
1923 #[cfg(parallel_queries)]
1924 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1925 rayon_core::tlv::with(value, f)
1928 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1929 /// This is used to get the pointer to the current ImplicitCtxt.
1930 #[cfg(parallel_queries)]
1931 fn get_tlv() -> usize {
1932 rayon_core::tlv::get()
1935 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1936 #[cfg(not(parallel_queries))]
1937 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1939 /// Sets TLV to `value` during the call to `f`.
1940 /// It is restored to its previous value after.
1941 /// This is used to set the pointer to the new ImplicitCtxt.
1942 #[cfg(not(parallel_queries))]
1943 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1944 let old = get_tlv();
1945 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1946 TLV.with(|tlv| tlv.set(value));
1950 /// This is used to get the pointer to the current ImplicitCtxt.
1951 #[cfg(not(parallel_queries))]
1952 fn get_tlv() -> usize {
1953 TLV.with(|tlv| tlv.get())
1956 /// This is a callback from libsyntax as it cannot access the implicit state
1957 /// in librustc otherwise
1958 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1960 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1964 /// This is a callback from libsyntax as it cannot access the implicit state
1965 /// in librustc otherwise. It is used to when diagnostic messages are
1966 /// emitted and stores them in the current query, if there is one.
1967 fn track_diagnostic(diagnostic: &Diagnostic) {
1968 with_context_opt(|icx| {
1969 if let Some(icx) = icx {
1970 if let Some(ref query) = icx.query {
1971 query.diagnostics.lock().push(diagnostic.clone());
1977 /// Sets up the callbacks from libsyntax on the current thread
1978 pub fn with_thread_locals<F, R>(f: F) -> R
1979 where F: FnOnce() -> R
1981 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1982 let original_span_debug = span_dbg.get();
1983 span_dbg.set(span_debug);
1985 let _on_drop = OnDrop(move || {
1986 span_dbg.set(original_span_debug);
1989 TRACK_DIAGNOSTICS.with(|current| {
1990 let original = current.get();
1991 current.set(track_diagnostic);
1993 let _on_drop = OnDrop(move || {
1994 current.set(original);
2002 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
2003 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
2005 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2007 set_tlv(context as *const _ as usize, || {
2012 /// Enters GlobalCtxt by setting up libsyntax callbacks and
2013 /// creating a initial TyCtxt and ImplicitCtxt.
2014 /// This happens once per rustc session and TyCtxts only exists
2015 /// inside the `f` function.
2016 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
2017 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
2019 with_thread_locals(|| {
2020 // Update GCX_PTR to indicate there's a GlobalCtxt available
2021 GCX_PTR.with(|lock| {
2022 *lock.lock() = gcx as *const _ as usize;
2024 // Set GCX_PTR back to 0 when we exit
2025 let _on_drop = OnDrop(move || {
2026 GCX_PTR.with(|lock| *lock.lock() = 0);
2031 interners: &gcx.global_interners,
2033 let icx = ImplicitCtxt {
2037 task: &OpenTask::Ignore,
2039 enter_context(&icx, |_| {
2045 /// Stores a pointer to the GlobalCtxt if one is available.
2046 /// This is used to access the GlobalCtxt in the deadlock handler
2048 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2050 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2051 /// This is used in the deadlock handler.
2052 pub unsafe fn with_global<F, R>(f: F) -> R
2053 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2055 let gcx = GCX_PTR.with(|lock| *lock.lock());
2057 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2060 interners: &gcx.global_interners,
2062 let icx = ImplicitCtxt {
2066 task: &OpenTask::Ignore,
2068 enter_context(&icx, |_| f(tcx))
2071 /// Allows access to the current ImplicitCtxt in a closure if one is available
2072 pub fn with_context_opt<F, R>(f: F) -> R
2073 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2075 let context = get_tlv();
2079 // We could get a ImplicitCtxt pointer from another thread.
2080 // Ensure that ImplicitCtxt is Sync
2081 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2083 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2087 /// Allows access to the current ImplicitCtxt.
2088 /// Panics if there is no ImplicitCtxt available
2089 pub fn with_context<F, R>(f: F) -> R
2090 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2092 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2095 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2096 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2097 /// with the same 'gcx lifetime as the TyCtxt passed in.
2098 /// This will panic if you pass it a TyCtxt which has a different global interner from
2099 /// the current ImplicitCtxt's tcx field.
2100 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2101 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2103 with_context(|context| {
2105 let gcx = tcx.gcx as *const _ as usize;
2106 assert!(context.tcx.gcx as *const _ as usize == gcx);
2107 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2113 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2114 /// interner and local interner as the tcx argument passed in. This means the closure
2115 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2116 /// This will panic if you pass it a TyCtxt which has a different global interner or
2117 /// a different local interner from the current ImplicitCtxt's tcx field.
2118 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2119 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2121 with_context(|context| {
2123 let gcx = tcx.gcx as *const _ as usize;
2124 let interners = tcx.interners as *const _ as usize;
2125 assert!(context.tcx.gcx as *const _ as usize == gcx);
2126 assert!(context.tcx.interners as *const _ as usize == interners);
2127 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2133 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2134 /// Panics if there is no ImplicitCtxt available
2135 pub fn with<F, R>(f: F) -> R
2136 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2138 with_context(|context| f(context.tcx))
2141 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2142 /// The closure is passed None if there is no ImplicitCtxt available
2143 pub fn with_opt<F, R>(f: F) -> R
2144 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2146 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2150 macro_rules! sty_debug_print {
2151 ($ctxt: expr, $($variant: ident),*) => {{
2152 // curious inner module to allow variant names to be used as
2154 #[allow(non_snake_case)]
2156 use ty::{self, TyCtxt};
2157 use ty::context::Interned;
2159 #[derive(Copy, Clone)]
2162 region_infer: usize,
2167 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2168 let mut total = DebugStat {
2170 region_infer: 0, ty_infer: 0, both_infer: 0,
2172 $(let mut $variant = total;)*
2174 for &Interned(t) in tcx.interners.type_.borrow().iter() {
2175 let variant = match t.sty {
2176 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2177 ty::Float(..) | ty::Str | ty::Never => continue,
2178 ty::Error => /* unimportant */ continue,
2179 $(ty::$variant(..) => &mut $variant,)*
2181 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2182 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2186 if region { total.region_infer += 1; variant.region_infer += 1 }
2187 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2188 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2190 println!("Ty interner total ty region both");
2191 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2192 {ty:4.1}% {region:5.1}% {both:4.1}%",
2193 stringify!($variant),
2194 uses = $variant.total,
2195 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2196 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2197 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2198 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2200 println!(" total {uses:6} \
2201 {ty:4.1}% {region:5.1}% {both:4.1}%",
2203 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2204 region = total.region_infer as f64 * 100.0 / total.total as f64,
2205 both = total.both_infer as f64 * 100.0 / total.total as f64)
2213 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2214 pub fn print_debug_stats(self) {
2217 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr,
2218 Generator, GeneratorWitness, Dynamic, Closure, Tuple,
2219 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2221 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2222 println!("Region interner: #{}", self.interners.region.borrow().len());
2223 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2224 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2225 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2230 /// An entry in an interner.
2231 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2233 // NB: An Interned<Ty> compares and hashes as a sty.
2234 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2235 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2236 self.0.sty == other.0.sty
2240 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2242 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2243 fn hash<H: Hasher>(&self, s: &mut H) {
2248 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2249 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2254 // NB: An Interned<List<T>> compares and hashes as its elements.
2255 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2256 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2257 self.0[..] == other.0[..]
2261 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2263 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2264 fn hash<H: Hasher>(&self, s: &mut H) {
2269 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2270 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2275 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2276 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2281 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2282 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2287 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2288 fn borrow<'a>(&'a self) -> &'a RegionKind {
2293 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2294 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2299 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2300 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2301 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2306 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2307 for Interned<'tcx, List<Predicate<'tcx>>> {
2308 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2313 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2314 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2319 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2320 for Interned<'tcx, List<Clause<'tcx>>> {
2321 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2326 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2327 for Interned<'tcx, List<Goal<'tcx>>> {
2328 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2333 macro_rules! intern_method {
2334 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2337 $keep_in_local_tcx:expr) -> $ty:ty) => {
2338 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2339 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2340 let key = ($alloc_to_key)(&v);
2342 // HACK(eddyb) Depend on flags being accurate to
2343 // determine that all contents are in the global tcx.
2344 // See comments on Lift for why we can't use that.
2345 if ($keep_in_local_tcx)(&v) {
2346 let mut interner = self.interners.$name.borrow_mut();
2347 if let Some(&Interned(v)) = interner.get(key) {
2351 // Make sure we don't end up with inference
2352 // types/regions in the global tcx.
2353 if self.is_global() {
2354 bug!("Attempted to intern `{:?}` which contains \
2355 inference types/regions in the global type context",
2359 let i = $alloc_method(&self.interners.arena, v);
2360 interner.insert(Interned(i));
2363 let mut interner = self.global_interners.$name.borrow_mut();
2364 if let Some(&Interned(v)) = interner.get(key) {
2368 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2372 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2374 let i = unsafe { mem::transmute(i) };
2375 interner.insert(Interned(i));
2383 macro_rules! direct_interners {
2384 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2385 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2386 fn eq(&self, other: &Self) -> bool {
2391 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2393 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2394 fn hash<H: Hasher>(&self, s: &mut H) {
2402 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2404 $keep_in_local_tcx) -> $ty);)+
2408 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2409 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2412 direct_interners!('tcx,
2413 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2414 const_: mk_const(|c: &Const<'_>| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>,
2415 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>
2418 macro_rules! slice_interners {
2419 ($($field:ident: $method:ident($ty:ident)),+) => (
2420 $(intern_method!( 'tcx, $field: $method(
2422 |a, v| List::from_arena(a, v),
2424 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2429 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2430 predicates: _intern_predicates(Predicate),
2431 type_list: _intern_type_list(Ty),
2432 substs: _intern_substs(Kind),
2433 clauses: _intern_clauses(Clause),
2434 goal_list: _intern_goals(Goal)
2437 // This isn't a perfect fit: CanonicalVarInfo slices are always
2438 // allocated in the global arena, so this `intern_method!` macro is
2439 // overly general. But we just return false for the code that checks
2440 // whether they belong in the thread-local arena, so no harm done, and
2441 // seems better than open-coding the rest.
2444 canonical_var_infos: _intern_canonical_var_infos(
2445 &[CanonicalVarInfo],
2446 |a, v| List::from_arena(a, v),
2448 |_xs: &[CanonicalVarInfo]| -> bool { false }
2449 ) -> List<CanonicalVarInfo>
2452 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2453 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2454 /// that is, a `fn` type that is equivalent in every way for being
2456 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2457 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2458 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2459 unsafety: hir::Unsafety::Unsafe,
2464 /// Given a closure signature `sig`, returns an equivalent `fn`
2465 /// type with the same signature. Detuples and so forth -- so
2466 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2467 /// a `fn(u32, i32)`.
2468 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2469 let converted_sig = sig.map_bound(|s| {
2470 let params_iter = match s.inputs()[0].sty {
2471 ty::Tuple(params) => {
2472 params.into_iter().cloned()
2480 hir::Unsafety::Normal,
2485 self.mk_fn_ptr(converted_sig)
2488 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2489 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2492 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2494 ast::IntTy::Isize => self.types.isize,
2495 ast::IntTy::I8 => self.types.i8,
2496 ast::IntTy::I16 => self.types.i16,
2497 ast::IntTy::I32 => self.types.i32,
2498 ast::IntTy::I64 => self.types.i64,
2499 ast::IntTy::I128 => self.types.i128,
2503 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2505 ast::UintTy::Usize => self.types.usize,
2506 ast::UintTy::U8 => self.types.u8,
2507 ast::UintTy::U16 => self.types.u16,
2508 ast::UintTy::U32 => self.types.u32,
2509 ast::UintTy::U64 => self.types.u64,
2510 ast::UintTy::U128 => self.types.u128,
2514 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2516 ast::FloatTy::F32 => self.types.f32,
2517 ast::FloatTy::F64 => self.types.f64,
2521 pub fn mk_str(self) -> Ty<'tcx> {
2525 pub fn mk_static_str(self) -> Ty<'tcx> {
2526 self.mk_imm_ref(self.types.re_static, self.mk_str())
2529 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2530 // take a copy of substs so that we own the vectors inside
2531 self.mk_ty(Adt(def, substs))
2534 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2535 self.mk_ty(Foreign(def_id))
2538 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2539 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2540 let adt_def = self.adt_def(def_id);
2541 let substs = Substs::for_item(self, def_id, |param, substs| {
2543 GenericParamDefKind::Lifetime => bug!(),
2544 GenericParamDefKind::Type { has_default, .. } => {
2545 if param.index == 0 {
2548 assert!(has_default);
2549 self.type_of(param.def_id).subst(self, substs).into()
2554 self.mk_ty(Adt(adt_def, substs))
2557 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2558 self.mk_ty(RawPtr(tm))
2561 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2562 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2565 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2566 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2569 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2570 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2573 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2574 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2577 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2578 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2581 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2582 self.mk_imm_ptr(self.mk_unit())
2585 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2586 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2589 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2590 self.mk_ty(Slice(ty))
2593 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2594 self.mk_ty(Tuple(self.intern_type_list(ts)))
2597 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2598 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2601 pub fn mk_unit(self) -> Ty<'tcx> {
2602 self.intern_tup(&[])
2605 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2606 if self.features().never_type {
2609 self.intern_tup(&[])
2613 pub fn mk_bool(self) -> Ty<'tcx> {
2617 pub fn mk_fn_def(self, def_id: DefId,
2618 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2619 self.mk_ty(FnDef(def_id, substs))
2622 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2623 self.mk_ty(FnPtr(fty))
2628 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2629 reg: ty::Region<'tcx>
2631 self.mk_ty(Dynamic(obj, reg))
2634 pub fn mk_projection(self,
2636 substs: &'tcx Substs<'tcx>)
2638 self.mk_ty(Projection(ProjectionTy {
2644 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2646 self.mk_ty(Closure(closure_id, closure_substs))
2649 pub fn mk_generator(self,
2651 generator_substs: GeneratorSubsts<'tcx>,
2652 movability: hir::GeneratorMovability)
2654 self.mk_ty(Generator(id, generator_substs, movability))
2657 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2658 self.mk_ty(GeneratorWitness(types))
2661 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2662 self.mk_infer(TyVar(v))
2665 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2666 self.mk_infer(IntVar(v))
2669 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2670 self.mk_infer(FloatVar(v))
2673 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2674 self.mk_ty(Infer(it))
2677 pub fn mk_ty_param(self,
2679 name: InternedString) -> Ty<'tcx> {
2680 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2683 pub fn mk_self_type(self) -> Ty<'tcx> {
2684 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2687 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2689 GenericParamDefKind::Lifetime => {
2690 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2692 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2696 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2697 self.mk_ty(Opaque(def_id, substs))
2700 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2701 -> &'tcx List<ExistentialPredicate<'tcx>> {
2702 assert!(!eps.is_empty());
2703 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2704 self._intern_existential_predicates(eps)
2707 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2708 -> &'tcx List<Predicate<'tcx>> {
2709 // FIXME consider asking the input slice to be sorted to avoid
2710 // re-interning permutations, in which case that would be asserted
2712 if preds.len() == 0 {
2713 // The macro-generated method below asserts we don't intern an empty slice.
2716 self._intern_predicates(preds)
2720 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2724 self._intern_type_list(ts)
2728 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2732 self._intern_substs(ts)
2736 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2740 self.global_tcx()._intern_canonical_var_infos(ts)
2744 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2748 self._intern_clauses(ts)
2752 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2756 self._intern_goals(ts)
2760 pub fn mk_fn_sig<I>(self,
2764 unsafety: hir::Unsafety,
2766 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2768 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2770 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2771 inputs_and_output: self.intern_type_list(xs),
2772 variadic, unsafety, abi
2776 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2777 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2779 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2782 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2783 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2785 iter.intern_with(|xs| self.intern_predicates(xs))
2788 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2789 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2790 iter.intern_with(|xs| self.intern_type_list(xs))
2793 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2794 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2795 iter.intern_with(|xs| self.intern_substs(xs))
2798 pub fn mk_substs_trait(self,
2800 rest: &[Kind<'tcx>])
2801 -> &'tcx Substs<'tcx>
2803 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2806 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2807 iter.intern_with(|xs| self.intern_clauses(xs))
2810 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2811 iter.intern_with(|xs| self.intern_goals(xs))
2814 pub fn lint_hir<S: Into<MultiSpan>>(self,
2815 lint: &'static Lint,
2819 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2822 pub fn lint_node<S: Into<MultiSpan>>(self,
2823 lint: &'static Lint,
2827 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2830 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2831 lint: &'static Lint,
2836 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2841 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2842 lint: &'static Lint,
2847 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2852 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2853 -> (lint::Level, lint::LintSource)
2855 // Right now we insert a `with_ignore` node in the dep graph here to
2856 // ignore the fact that `lint_levels` below depends on the entire crate.
2857 // For now this'll prevent false positives of recompiling too much when
2858 // anything changes.
2860 // Once red/green incremental compilation lands we should be able to
2861 // remove this because while the crate changes often the lint level map
2862 // will change rarely.
2863 self.dep_graph.with_ignore(|| {
2864 let sets = self.lint_levels(LOCAL_CRATE);
2866 let hir_id = self.hir.definitions().node_to_hir_id(id);
2867 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2870 let next = self.hir.get_parent_node(id);
2872 bug!("lint traversal reached the root of the crate");
2879 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2880 lint: &'static Lint,
2884 -> DiagnosticBuilder<'tcx>
2886 let node_id = self.hir.hir_to_node_id(hir_id);
2887 let (level, src) = self.lint_level_at_node(lint, node_id);
2888 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2891 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2892 lint: &'static Lint,
2896 -> DiagnosticBuilder<'tcx>
2898 let (level, src) = self.lint_level_at_node(lint, id);
2899 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2902 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2903 -> DiagnosticBuilder<'tcx>
2905 let (level, src) = self.lint_level_at_node(lint, id);
2906 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2909 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2910 self.in_scope_traits_map(id.owner)
2911 .and_then(|map| map.get(&id.local_id).cloned())
2914 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2915 self.named_region_map(id.owner)
2916 .and_then(|map| map.get(&id.local_id).cloned())
2919 pub fn is_late_bound(self, id: HirId) -> bool {
2920 self.is_late_bound_map(id.owner)
2921 .map(|set| set.contains(&id.local_id))
2925 pub fn object_lifetime_defaults(self, id: HirId)
2926 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2928 self.object_lifetime_defaults_map(id.owner)
2929 .and_then(|map| map.get(&id.local_id).cloned())
2933 pub trait InternAs<T: ?Sized, R> {
2935 fn intern_with<F>(self, f: F) -> Self::Output
2936 where F: FnOnce(&T) -> R;
2939 impl<I, T, R, E> InternAs<[T], R> for I
2940 where E: InternIteratorElement<T, R>,
2941 I: Iterator<Item=E> {
2942 type Output = E::Output;
2943 fn intern_with<F>(self, f: F) -> Self::Output
2944 where F: FnOnce(&[T]) -> R {
2945 E::intern_with(self, f)
2949 pub trait InternIteratorElement<T, R>: Sized {
2951 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2954 impl<T, R> InternIteratorElement<T, R> for T {
2956 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2957 f(&iter.collect::<SmallVec<[_; 8]>>())
2961 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2965 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2966 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2970 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2971 type Output = Result<R, E>;
2972 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2973 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
2977 pub fn provide(providers: &mut ty::query::Providers<'_>) {
2978 // FIXME(#44234) - almost all of these queries have no sub-queries and
2979 // therefore no actual inputs, they're just reading tables calculated in
2980 // resolve! Does this work? Unsure! That's what the issue is about
2981 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2982 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2983 providers.crate_name = |tcx, id| {
2984 assert_eq!(id, LOCAL_CRATE);
2987 providers.get_lib_features = |tcx, id| {
2988 assert_eq!(id, LOCAL_CRATE);
2989 Lrc::new(middle::lib_features::collect(tcx))
2991 providers.get_lang_items = |tcx, id| {
2992 assert_eq!(id, LOCAL_CRATE);
2993 Lrc::new(middle::lang_items::collect(tcx))
2995 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
2996 providers.maybe_unused_trait_import = |tcx, id| {
2997 tcx.maybe_unused_trait_imports.contains(&id)
2999 providers.maybe_unused_extern_crates = |tcx, cnum| {
3000 assert_eq!(cnum, LOCAL_CRATE);
3001 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3004 providers.stability_index = |tcx, cnum| {
3005 assert_eq!(cnum, LOCAL_CRATE);
3006 Lrc::new(stability::Index::new(tcx))
3008 providers.lookup_stability = |tcx, id| {
3009 assert_eq!(id.krate, LOCAL_CRATE);
3010 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3011 tcx.stability().local_stability(id)
3013 providers.lookup_deprecation_entry = |tcx, id| {
3014 assert_eq!(id.krate, LOCAL_CRATE);
3015 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3016 tcx.stability().local_deprecation_entry(id)
3018 providers.extern_mod_stmt_cnum = |tcx, id| {
3019 let id = tcx.hir.as_local_node_id(id).unwrap();
3020 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3022 providers.all_crate_nums = |tcx, cnum| {
3023 assert_eq!(cnum, LOCAL_CRATE);
3024 Lrc::new(tcx.cstore.crates_untracked())
3026 providers.postorder_cnums = |tcx, cnum| {
3027 assert_eq!(cnum, LOCAL_CRATE);
3028 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3030 providers.output_filenames = |tcx, cnum| {
3031 assert_eq!(cnum, LOCAL_CRATE);
3032 tcx.output_filenames.clone()
3034 providers.features_query = |tcx, cnum| {
3035 assert_eq!(cnum, LOCAL_CRATE);
3036 Lrc::new(tcx.sess.features_untracked().clone())
3038 providers.is_panic_runtime = |tcx, cnum| {
3039 assert_eq!(cnum, LOCAL_CRATE);
3040 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
3042 providers.is_compiler_builtins = |tcx, cnum| {
3043 assert_eq!(cnum, LOCAL_CRATE);
3044 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")