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 rustc_data_structures::interner::HashInterner;
57 use smallvec::SmallVec;
58 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
59 StableHasher, StableHasherResult,
61 use arena::{TypedArena, SyncDroplessArena};
62 use rustc_data_structures::indexed_vec::IndexVec;
63 use rustc_data_structures::sync::{self, Lrc, Lock, WorkerLocal};
65 use std::borrow::Borrow;
66 use std::cmp::Ordering;
67 use std::collections::hash_map::{self, Entry};
68 use std::hash::{Hash, Hasher};
71 use std::ops::{Deref, Bound};
75 use std::marker::PhantomData;
76 use rustc_target::spec::abi;
77 use syntax::ast::{self, NodeId};
79 use syntax::source_map::MultiSpan;
80 use syntax::edition::Edition;
81 use syntax::feature_gate;
82 use syntax::symbol::{Symbol, keywords, InternedString};
87 pub struct AllArenas<'tcx> {
88 pub global: WorkerLocal<GlobalArenas<'tcx>>,
89 pub interner: SyncDroplessArena,
90 global_ctxt: Option<GlobalCtxt<'tcx>>,
93 impl<'tcx> AllArenas<'tcx> {
94 pub fn new() -> Self {
96 global: WorkerLocal::new(|_| GlobalArenas::default()),
97 interner: SyncDroplessArena::default(),
105 pub struct GlobalArenas<'tcx> {
107 layout: TypedArena<LayoutDetails>,
110 generics: TypedArena<ty::Generics>,
111 trait_def: TypedArena<ty::TraitDef>,
112 adt_def: TypedArena<ty::AdtDef>,
113 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
114 mir: TypedArena<Mir<'tcx>>,
115 tables: TypedArena<ty::TypeckTables<'tcx>>,
117 const_allocs: TypedArena<interpret::Allocation>,
120 type InternedSet<'tcx, T> = Lock<FxHashMap<Interned<'tcx, T>, ()>>;
122 pub struct CtxtInterners<'tcx> {
123 /// The arena that types, regions, etc are allocated from
124 arena: &'tcx SyncDroplessArena,
126 /// Specifically use a speedy hash algorithm for these hash sets,
127 /// they're accessed quite often.
128 type_: InternedSet<'tcx, TyS<'tcx>>,
129 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
130 substs: InternedSet<'tcx, Substs<'tcx>>,
131 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
132 region: InternedSet<'tcx, RegionKind>,
133 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
134 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
135 const_: InternedSet<'tcx, Const<'tcx>>,
136 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
137 goal: InternedSet<'tcx, GoalKind<'tcx>>,
138 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
139 projs: InternedSet<'tcx, List<ProjectionKind<'tcx>>>,
142 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
143 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
146 type_: Default::default(),
147 type_list: Default::default(),
148 substs: Default::default(),
149 region: Default::default(),
150 existential_predicates: Default::default(),
151 canonical_var_infos: Default::default(),
152 predicates: Default::default(),
153 const_: Default::default(),
154 clauses: Default::default(),
155 goal: Default::default(),
156 goal_list: Default::default(),
157 projs: Default::default(),
164 local: &CtxtInterners<'tcx>,
165 global: &CtxtInterners<'gcx>,
168 let flags = super::flags::FlagComputation::for_sty(&st);
170 // HACK(eddyb) Depend on flags being accurate to
171 // determine that all contents are in the global tcx.
172 // See comments on Lift for why we can't use that.
173 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
174 local.type_.borrow_mut().intern(st, |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 Interned(local.arena.alloc(ty_struct))
192 global.type_.borrow_mut().intern(st, |st| {
193 let ty_struct = TyS {
196 outer_exclusive_binder: flags.outer_exclusive_binder,
199 // This is safe because all the types the ty_struct can point to
200 // already is in the global arena
201 let ty_struct: TyS<'gcx> = unsafe {
202 mem::transmute(ty_struct)
205 Interned(global.arena.alloc(ty_struct))
211 pub struct CommonTypes<'tcx> {
232 pub re_empty: Region<'tcx>,
233 pub re_static: Region<'tcx>,
234 pub re_erased: Region<'tcx>,
237 pub struct LocalTableInContext<'a, V: 'a> {
238 local_id_root: Option<DefId>,
239 data: &'a ItemLocalMap<V>
242 /// Validate that the given HirId (respectively its `local_id` part) can be
243 /// safely used as a key in the tables of a TypeckTable. For that to be
244 /// the case, the HirId must have the same `owner` as all the other IDs in
245 /// this table (signified by `local_id_root`). Otherwise the HirId
246 /// would be in a different frame of reference and using its `local_id`
247 /// would result in lookup errors, or worse, in silently wrong data being
249 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
252 if cfg!(debug_assertions) {
253 if let Some(local_id_root) = local_id_root {
254 if hir_id.owner != local_id_root.index {
255 ty::tls::with(|tcx| {
256 let node_id = tcx.hir().hir_to_node_id(hir_id);
258 bug!("node {} with HirId::owner {:?} cannot be placed in \
259 TypeckTables with local_id_root {:?}",
260 tcx.hir().node_to_string(node_id),
261 DefId::local(hir_id.owner),
266 // We use "Null Object" TypeckTables in some of the analysis passes.
267 // These are just expected to be empty and their `local_id_root` is
268 // `None`. Therefore we cannot verify whether a given `HirId` would
269 // be a valid key for the given table. Instead we make sure that
270 // nobody tries to write to such a Null Object table.
272 bug!("access to invalid TypeckTables")
278 impl<'a, V> LocalTableInContext<'a, V> {
279 pub fn contains_key(&self, id: hir::HirId) -> bool {
280 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
281 self.data.contains_key(&id.local_id)
284 pub fn get(&self, id: hir::HirId) -> Option<&V> {
285 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
286 self.data.get(&id.local_id)
289 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
294 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
297 fn index(&self, key: hir::HirId) -> &V {
298 self.get(key).expect("LocalTableInContext: key not found")
302 pub struct LocalTableInContextMut<'a, V: 'a> {
303 local_id_root: Option<DefId>,
304 data: &'a mut ItemLocalMap<V>
307 impl<'a, V> LocalTableInContextMut<'a, V> {
308 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
309 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
310 self.data.get_mut(&id.local_id)
313 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
314 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
315 self.data.entry(id.local_id)
318 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
319 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
320 self.data.insert(id.local_id, val)
323 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
324 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
325 self.data.remove(&id.local_id)
329 #[derive(RustcEncodable, RustcDecodable, Debug)]
330 pub struct TypeckTables<'tcx> {
331 /// The HirId::owner all ItemLocalIds in this table are relative to.
332 pub local_id_root: Option<DefId>,
334 /// Resolved definitions for `<T>::X` associated paths and
335 /// method calls, including those of overloaded operators.
336 type_dependent_defs: ItemLocalMap<Def>,
338 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
339 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
340 /// about the field you also need definition of the variant to which the field
341 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
342 field_indices: ItemLocalMap<usize>,
344 /// Stores the types for various nodes in the AST. Note that this table
345 /// is not guaranteed to be populated until after typeck. See
346 /// typeck::check::fn_ctxt for details.
347 node_types: ItemLocalMap<Ty<'tcx>>,
349 /// Stores the type parameters which were substituted to obtain the type
350 /// of this node. This only applies to nodes that refer to entities
351 /// parameterized by type parameters, such as generic fns, types, or
353 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
355 /// Stores the canonicalized types provided by the user. See also
356 /// `AscribeUserType` statement in MIR.
357 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
359 /// Stores the canonicalized types provided by the user. See also
360 /// `AscribeUserType` statement in MIR.
361 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
363 /// Stores the substitutions that the user explicitly gave (if any)
364 /// attached to `id`. These will not include any inferred
365 /// values. The canonical form is used to capture things like `_`
366 /// or other unspecified values.
370 /// If the user wrote `foo.collect::<Vec<_>>()`, then the
371 /// canonical substitutions would include only `for<X> { Vec<X>
373 user_substs: ItemLocalMap<CanonicalUserSubsts<'tcx>>,
375 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
377 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
378 pat_binding_modes: ItemLocalMap<BindingMode>,
380 /// Stores the types which were implicitly dereferenced in pattern binding modes
381 /// for later usage in HAIR lowering. For example,
384 /// match &&Some(5i32) {
389 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
392 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
393 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
396 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
398 /// Records the reasons that we picked the kind of each closure;
399 /// not all closures are present in the map.
400 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
402 /// For each fn, records the "liberated" types of its arguments
403 /// and return type. Liberated means that all bound regions
404 /// (including late-bound regions) are replaced with free
405 /// equivalents. This table is not used in codegen (since regions
406 /// are erased there) and hence is not serialized to metadata.
407 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
409 /// For each FRU expression, record the normalized types of the fields
410 /// of the struct - this is needed because it is non-trivial to
411 /// normalize while preserving regions. This table is used only in
412 /// MIR construction and hence is not serialized to metadata.
413 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
415 /// Maps a cast expression to its kind. This is keyed on the
416 /// *from* expression of the cast, not the cast itself.
417 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
419 /// Set of trait imports actually used in the method resolution.
420 /// This is used for warning unused imports. During type
421 /// checking, this `Lrc` should not be cloned: it must have a ref-count
422 /// of 1 so that we can insert things into the set mutably.
423 pub used_trait_imports: Lrc<DefIdSet>,
425 /// If any errors occurred while type-checking this body,
426 /// this field will be set to `true`.
427 pub tainted_by_errors: bool,
429 /// Stores the free-region relationships that were deduced from
430 /// its where clauses and parameter types. These are then
431 /// read-again by borrowck.
432 pub free_region_map: FreeRegionMap<'tcx>,
434 /// All the existential types that are restricted to concrete types
436 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
439 impl<'tcx> TypeckTables<'tcx> {
440 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
443 type_dependent_defs: Default::default(),
444 field_indices: Default::default(),
445 user_provided_tys: Default::default(),
446 user_provided_sigs: Default::default(),
447 node_types: Default::default(),
448 node_substs: Default::default(),
449 user_substs: Default::default(),
450 adjustments: Default::default(),
451 pat_binding_modes: Default::default(),
452 pat_adjustments: Default::default(),
453 upvar_capture_map: Default::default(),
454 closure_kind_origins: Default::default(),
455 liberated_fn_sigs: Default::default(),
456 fru_field_types: Default::default(),
457 cast_kinds: Default::default(),
458 used_trait_imports: Lrc::new(Default::default()),
459 tainted_by_errors: false,
460 free_region_map: Default::default(),
461 concrete_existential_types: Default::default(),
465 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
466 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
468 hir::QPath::Resolved(_, ref path) => path.def,
469 hir::QPath::TypeRelative(..) => {
470 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
471 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
476 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
477 LocalTableInContext {
478 local_id_root: self.local_id_root,
479 data: &self.type_dependent_defs
483 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
484 LocalTableInContextMut {
485 local_id_root: self.local_id_root,
486 data: &mut self.type_dependent_defs
490 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
491 LocalTableInContext {
492 local_id_root: self.local_id_root,
493 data: &self.field_indices
497 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
498 LocalTableInContextMut {
499 local_id_root: self.local_id_root,
500 data: &mut self.field_indices
504 pub fn user_provided_tys(&self) -> LocalTableInContext<'_, CanonicalTy<'tcx>> {
505 LocalTableInContext {
506 local_id_root: self.local_id_root,
507 data: &self.user_provided_tys
511 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalTy<'tcx>> {
512 LocalTableInContextMut {
513 local_id_root: self.local_id_root,
514 data: &mut self.user_provided_tys
518 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
519 LocalTableInContext {
520 local_id_root: self.local_id_root,
521 data: &self.node_types
525 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
526 LocalTableInContextMut {
527 local_id_root: self.local_id_root,
528 data: &mut self.node_types
532 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
533 self.node_id_to_type_opt(id).unwrap_or_else(||
534 bug!("node_id_to_type: no type for node `{}`",
536 let id = tcx.hir().hir_to_node_id(id);
537 tcx.hir().node_to_string(id)
542 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
543 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
544 self.node_types.get(&id.local_id).cloned()
547 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
548 LocalTableInContextMut {
549 local_id_root: self.local_id_root,
550 data: &mut self.node_substs
554 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
555 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
556 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
559 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
560 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
561 self.node_substs.get(&id.local_id).cloned()
564 pub fn user_substs_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalUserSubsts<'tcx>> {
565 LocalTableInContextMut {
566 local_id_root: self.local_id_root,
567 data: &mut self.user_substs
571 pub fn user_substs(&self, id: hir::HirId) -> Option<CanonicalUserSubsts<'tcx>> {
572 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
573 self.user_substs.get(&id.local_id).cloned()
576 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
577 // doesn't provide type parameter substitutions.
578 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
579 self.node_id_to_type(pat.hir_id)
582 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
583 self.node_id_to_type_opt(pat.hir_id)
586 // Returns the type of an expression as a monotype.
588 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
589 // some cases, we insert `Adjustment` annotations such as auto-deref or
590 // auto-ref. The type returned by this function does not consider such
591 // adjustments. See `expr_ty_adjusted()` instead.
593 // NB (2): This type doesn't provide type parameter substitutions; e.g., if you
594 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
595 // instead of "fn(ty) -> T with T = isize".
596 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
597 self.node_id_to_type(expr.hir_id)
600 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
601 self.node_id_to_type_opt(expr.hir_id)
604 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
605 LocalTableInContext {
606 local_id_root: self.local_id_root,
607 data: &self.adjustments
611 pub fn adjustments_mut(&mut self)
612 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
613 LocalTableInContextMut {
614 local_id_root: self.local_id_root,
615 data: &mut self.adjustments
619 pub fn expr_adjustments(&self, expr: &hir::Expr)
620 -> &[ty::adjustment::Adjustment<'tcx>] {
621 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
622 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
625 /// Returns the type of `expr`, considering any `Adjustment`
626 /// entry recorded for that expression.
627 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
628 self.expr_adjustments(expr)
630 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
633 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
634 self.expr_adjustments(expr)
636 .map(|adj| adj.target)
637 .or_else(|| self.expr_ty_opt(expr))
640 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
641 // Only paths and method calls/overloaded operators have
642 // entries in type_dependent_defs, ignore the former here.
643 if let hir::ExprKind::Path(_) = expr.node {
647 match self.type_dependent_defs().get(expr.hir_id) {
648 Some(&Def::Method(_)) => true,
653 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
654 LocalTableInContext {
655 local_id_root: self.local_id_root,
656 data: &self.pat_binding_modes
660 pub fn pat_binding_modes_mut(&mut self)
661 -> LocalTableInContextMut<'_, BindingMode> {
662 LocalTableInContextMut {
663 local_id_root: self.local_id_root,
664 data: &mut self.pat_binding_modes
668 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
669 LocalTableInContext {
670 local_id_root: self.local_id_root,
671 data: &self.pat_adjustments,
675 pub fn pat_adjustments_mut(&mut self)
676 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
677 LocalTableInContextMut {
678 local_id_root: self.local_id_root,
679 data: &mut self.pat_adjustments,
683 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
684 self.upvar_capture_map[&upvar_id]
687 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
688 LocalTableInContext {
689 local_id_root: self.local_id_root,
690 data: &self.closure_kind_origins
694 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
695 LocalTableInContextMut {
696 local_id_root: self.local_id_root,
697 data: &mut self.closure_kind_origins
701 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
702 LocalTableInContext {
703 local_id_root: self.local_id_root,
704 data: &self.liberated_fn_sigs
708 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
709 LocalTableInContextMut {
710 local_id_root: self.local_id_root,
711 data: &mut self.liberated_fn_sigs
715 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
716 LocalTableInContext {
717 local_id_root: self.local_id_root,
718 data: &self.fru_field_types
722 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
723 LocalTableInContextMut {
724 local_id_root: self.local_id_root,
725 data: &mut self.fru_field_types
729 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
730 LocalTableInContext {
731 local_id_root: self.local_id_root,
732 data: &self.cast_kinds
736 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
737 LocalTableInContextMut {
738 local_id_root: self.local_id_root,
739 data: &mut self.cast_kinds
744 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
745 fn hash_stable<W: StableHasherResult>(&self,
746 hcx: &mut StableHashingContext<'a>,
747 hasher: &mut StableHasher<W>) {
748 let ty::TypeckTables {
750 ref type_dependent_defs,
752 ref user_provided_tys,
753 ref user_provided_sigs,
758 ref pat_binding_modes,
760 ref upvar_capture_map,
761 ref closure_kind_origins,
762 ref liberated_fn_sigs,
767 ref used_trait_imports,
770 ref concrete_existential_types,
773 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
774 type_dependent_defs.hash_stable(hcx, hasher);
775 field_indices.hash_stable(hcx, hasher);
776 user_provided_tys.hash_stable(hcx, hasher);
777 user_provided_sigs.hash_stable(hcx, hasher);
778 node_types.hash_stable(hcx, hasher);
779 node_substs.hash_stable(hcx, hasher);
780 user_substs.hash_stable(hcx, hasher);
781 adjustments.hash_stable(hcx, hasher);
782 pat_binding_modes.hash_stable(hcx, hasher);
783 pat_adjustments.hash_stable(hcx, hasher);
784 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
791 local_id_root.expect("trying to hash invalid TypeckTables");
793 let var_owner_def_id = DefId {
794 krate: local_id_root.krate,
795 index: var_path.hir_id.owner,
797 let closure_def_id = DefId {
798 krate: local_id_root.krate,
799 index: closure_expr_id.to_def_id().index,
801 (hcx.def_path_hash(var_owner_def_id),
802 var_path.hir_id.local_id,
803 hcx.def_path_hash(closure_def_id))
806 closure_kind_origins.hash_stable(hcx, hasher);
807 liberated_fn_sigs.hash_stable(hcx, hasher);
808 fru_field_types.hash_stable(hcx, hasher);
809 cast_kinds.hash_stable(hcx, hasher);
810 used_trait_imports.hash_stable(hcx, hasher);
811 tainted_by_errors.hash_stable(hcx, hasher);
812 free_region_map.hash_stable(hcx, hasher);
813 concrete_existential_types.hash_stable(hcx, hasher);
818 impl<'tcx> CommonTypes<'tcx> {
819 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
820 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
821 let mk_region = |r| {
822 interners.region.borrow_mut().intern(r, |r| {
823 Interned(interners.arena.alloc(r))
828 unit: mk(Tuple(List::empty())),
833 isize: mk(Int(ast::IntTy::Isize)),
834 i8: mk(Int(ast::IntTy::I8)),
835 i16: mk(Int(ast::IntTy::I16)),
836 i32: mk(Int(ast::IntTy::I32)),
837 i64: mk(Int(ast::IntTy::I64)),
838 i128: mk(Int(ast::IntTy::I128)),
839 usize: mk(Uint(ast::UintTy::Usize)),
840 u8: mk(Uint(ast::UintTy::U8)),
841 u16: mk(Uint(ast::UintTy::U16)),
842 u32: mk(Uint(ast::UintTy::U32)),
843 u64: mk(Uint(ast::UintTy::U64)),
844 u128: mk(Uint(ast::UintTy::U128)),
845 f32: mk(Float(ast::FloatTy::F32)),
846 f64: mk(Float(ast::FloatTy::F64)),
848 re_empty: mk_region(RegionKind::ReEmpty),
849 re_static: mk_region(RegionKind::ReStatic),
850 re_erased: mk_region(RegionKind::ReErased),
855 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
858 pub struct FreeRegionInfo {
859 // def id corresponding to FreeRegion
861 // the bound region corresponding to FreeRegion
862 pub boundregion: ty::BoundRegion,
863 // checks if bound region is in Impl Item
864 pub is_impl_item: bool,
867 /// The central data structure of the compiler. It stores references
868 /// to the various **arenas** and also houses the results of the
869 /// various **compiler queries** that have been performed. See the
870 /// [rustc guide] for more details.
872 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
873 #[derive(Copy, Clone)]
874 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
875 gcx: &'gcx GlobalCtxt<'gcx>,
876 interners: &'tcx CtxtInterners<'tcx>,
877 dummy: PhantomData<&'a ()>,
880 impl<'gcx> Deref for TyCtxt<'_, 'gcx, '_> {
881 type Target = &'gcx GlobalCtxt<'gcx>;
883 fn deref(&self) -> &Self::Target {
888 pub struct GlobalCtxt<'tcx> {
889 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
890 global_interners: CtxtInterners<'tcx>,
892 cstore: &'tcx CrateStoreDyn,
894 pub sess: &'tcx Session,
896 pub dep_graph: DepGraph,
898 /// Common types, pre-interned for your convenience.
899 pub types: CommonTypes<'tcx>,
901 /// Map indicating what traits are in scope for places where this
902 /// is relevant; generated by resolve.
903 trait_map: FxHashMap<DefIndex,
904 Lrc<FxHashMap<ItemLocalId,
905 Lrc<StableVec<TraitCandidate>>>>>,
907 /// Export map produced by name resolution.
908 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
910 hir_map: hir_map::Map<'tcx>,
912 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
913 /// as well as all upstream crates. Only populated in incremental mode.
914 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
916 pub(crate) queries: query::Queries<'tcx>,
918 // Records the free variables referenced by every closure
919 // expression. Do not track deps for this, just recompute it from
920 // scratch every time.
921 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
923 maybe_unused_trait_imports: FxHashSet<DefId>,
924 maybe_unused_extern_crates: Vec<(DefId, Span)>,
925 /// Extern prelude entries. The value is `true` if the entry was introduced
926 /// via `extern crate` item and not `--extern` option or compiler built-in.
927 pub extern_prelude: FxHashMap<ast::Name, bool>,
929 // Internal cache for metadata decoding. No need to track deps on this.
930 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
932 /// Caches the results of trait selection. This cache is used
933 /// for things that do not have to do with the parameters in scope.
934 pub selection_cache: traits::SelectionCache<'tcx>,
936 /// Caches the results of trait evaluation. This cache is used
937 /// for things that do not have to do with the parameters in scope.
938 /// Merge this with `selection_cache`?
939 pub evaluation_cache: traits::EvaluationCache<'tcx>,
941 /// The definite name of the current crate after taking into account
942 /// attributes, commandline parameters, etc.
943 pub crate_name: Symbol,
945 /// Data layout specification for the current target.
946 pub data_layout: TargetDataLayout,
948 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
950 /// Stores the value of constants (and deduplicates the actual memory)
951 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
953 pub alloc_map: Lock<interpret::AllocMap<'tcx>>,
955 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
957 /// A general purpose channel to throw data out the back towards LLVM worker
960 /// This is intended to only get used during the codegen phase of the compiler
961 /// when satisfying the query for a particular codegen unit. Internally in
962 /// the query it'll send data along this channel to get processed later.
963 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
965 output_filenames: Arc<OutputFilenames>,
968 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
969 /// Get the global TyCtxt.
971 pub fn global_tcx(self) -> TyCtxt<'gcx, 'gcx, 'gcx> {
974 interners: &self.gcx.global_interners,
980 pub fn hir(self) -> &'a hir_map::Map<'gcx> {
984 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
985 self.global_arenas.generics.alloc(generics)
988 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
989 self.global_arenas.steal_mir.alloc(Steal::new(mir))
992 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
993 self.global_arenas.mir.alloc(mir)
996 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
997 self.global_arenas.tables.alloc(tables)
1000 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1001 self.global_arenas.trait_def.alloc(def)
1004 pub fn alloc_adt_def(self,
1007 variants: IndexVec<VariantIdx, ty::VariantDef>,
1009 -> &'gcx ty::AdtDef {
1010 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1011 self.global_arenas.adt_def.alloc(def)
1014 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1015 if bytes.is_empty() {
1018 self.global_interners.arena.alloc_slice(bytes)
1022 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1023 -> &'tcx [&'tcx ty::Const<'tcx>] {
1024 if values.is_empty() {
1027 self.interners.arena.alloc_slice(values)
1031 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1032 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1033 if values.is_empty() {
1036 self.interners.arena.alloc_slice(values)
1040 pub fn intern_const_alloc(
1043 ) -> &'gcx Allocation {
1044 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1045 self.global_arenas.const_allocs.alloc(alloc)
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 self.stability_interner.borrow_mut().intern(stab, |stab| {
1059 self.global_interners.arena.alloc(stab)
1063 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1064 self.layout_interner.borrow_mut().intern(layout, |layout| {
1065 self.global_arenas.layout.alloc(layout)
1069 /// Returns a range of the start/end indices specified with the
1070 /// `rustc_layout_scalar_valid_range` attribute.
1071 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1072 let attrs = self.get_attrs(def_id);
1074 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1076 None => return Bound::Unbounded,
1078 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1079 match meta.literal().expect("attribute takes lit").node {
1080 ast::LitKind::Int(a, _) => return Bound::Included(a),
1081 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1084 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1086 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1089 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1090 value.lift_to_tcx(self)
1093 /// Like lift, but only tries in the global tcx.
1094 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1095 value.lift_to_tcx(self.global_tcx())
1098 /// Returns true if self is the same as self.global_tcx().
1099 fn is_global(self) -> bool {
1100 let local = self.interners as *const _;
1101 let global = &self.global_interners as *const _;
1102 local as usize == global as usize
1105 /// Create a type context and call the closure with a `TyCtxt` reference
1106 /// to the context. The closure enforces that the type context and any interned
1107 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1108 /// reference to the context, to allow formatting values that need it.
1109 pub fn create_and_enter<F, R>(s: &'tcx Session,
1110 cstore: &'tcx CrateStoreDyn,
1111 local_providers: ty::query::Providers<'tcx>,
1112 extern_providers: ty::query::Providers<'tcx>,
1113 arenas: &'tcx mut AllArenas<'tcx>,
1114 resolutions: ty::Resolutions,
1115 hir: hir_map::Map<'tcx>,
1116 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1118 tx: mpsc::Sender<Box<dyn Any + Send>>,
1119 output_filenames: &OutputFilenames,
1121 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1123 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1126 let interners = CtxtInterners::new(&arenas.interner);
1127 let common_types = CommonTypes::new(&interners);
1128 let dep_graph = hir.dep_graph.clone();
1129 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1130 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1131 providers[LOCAL_CRATE] = local_providers;
1133 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1134 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1137 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1140 let def_path_tables = || {
1141 upstream_def_path_tables
1143 .map(|&(cnum, ref rc)| (cnum, &**rc))
1144 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1147 // Precompute the capacity of the hashmap so we don't have to
1148 // re-allocate when populating it.
1149 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1151 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1153 ::std::default::Default::default()
1156 for (cnum, def_path_table) in def_path_tables() {
1157 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1165 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1166 for (k, v) in resolutions.trait_map {
1167 let hir_id = hir.node_to_hir_id(k);
1168 let map = trait_map.entry(hir_id.owner).or_default();
1169 Lrc::get_mut(map).unwrap()
1170 .insert(hir_id.local_id,
1171 Lrc::new(StableVec::new(v)));
1174 arenas.global_ctxt = Some(GlobalCtxt {
1177 global_arenas: &arenas.global,
1178 global_interners: interners,
1180 types: common_types,
1182 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1185 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1186 (hir.local_def_id(k), Lrc::new(v))
1188 maybe_unused_trait_imports:
1189 resolutions.maybe_unused_trait_imports
1191 .map(|id| hir.local_def_id(id))
1193 maybe_unused_extern_crates:
1194 resolutions.maybe_unused_extern_crates
1196 .map(|(id, sp)| (hir.local_def_id(id), sp))
1198 extern_prelude: resolutions.extern_prelude,
1200 def_path_hash_to_def_id,
1201 queries: query::Queries::new(
1204 on_disk_query_result_cache,
1206 rcache: Default::default(),
1207 selection_cache: Default::default(),
1208 evaluation_cache: Default::default(),
1209 crate_name: Symbol::intern(crate_name),
1211 layout_interner: Default::default(),
1212 stability_interner: Default::default(),
1213 allocation_interner: Default::default(),
1214 alloc_map: Lock::new(interpret::AllocMap::new()),
1215 tx_to_llvm_workers: Lock::new(tx),
1216 output_filenames: Arc::new(output_filenames.clone()),
1219 let gcx = arenas.global_ctxt.as_ref().unwrap();
1221 sync::assert_send_val(&gcx);
1223 tls::enter_global(gcx, f)
1226 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1227 let cname = self.crate_name(LOCAL_CRATE).as_str();
1228 self.sess.consider_optimizing(&cname, msg)
1231 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1232 self.get_lib_features(LOCAL_CRATE)
1235 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1236 self.get_lang_items(LOCAL_CRATE)
1239 /// Due to missing llvm support for lowering 128 bit math to software emulation
1240 /// (on some targets), the lowering can be done in MIR.
1242 /// This function only exists until said support is implemented.
1243 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1244 let items = self.lang_items();
1245 let def_id = Some(def_id);
1246 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1247 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1248 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1249 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1250 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1251 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1252 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1253 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1254 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1255 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1256 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1257 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1258 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1259 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1260 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1261 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1262 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1263 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1264 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1265 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1266 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1267 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1268 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1269 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1273 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1274 self.stability_index(LOCAL_CRATE)
1277 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1278 self.all_crate_nums(LOCAL_CRATE)
1281 pub fn features(self) -> Lrc<feature_gate::Features> {
1282 self.features_query(LOCAL_CRATE)
1285 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1287 self.hir().def_key(id)
1289 self.cstore.def_key(id)
1293 /// Convert a `DefId` into its fully expanded `DefPath` (every
1294 /// `DefId` is really just an interned def-path).
1296 /// Note that if `id` is not local to this crate, the result will
1297 /// be a non-local `DefPath`.
1298 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1300 self.hir().def_path(id)
1302 self.cstore.def_path(id)
1307 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1308 if def_id.is_local() {
1309 self.hir().definitions().def_path_hash(def_id.index)
1311 self.cstore.def_path_hash(def_id)
1315 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1316 // We are explicitly not going through queries here in order to get
1317 // crate name and disambiguator since this code is called from debug!()
1318 // statements within the query system and we'd run into endless
1319 // recursion otherwise.
1320 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1321 (self.crate_name.clone(),
1322 self.sess.local_crate_disambiguator())
1324 (self.cstore.crate_name_untracked(def_id.krate),
1325 self.cstore.crate_disambiguator_untracked(def_id.krate))
1330 // Don't print the whole crate disambiguator. That's just
1331 // annoying in debug output.
1332 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1333 self.def_path(def_id).to_string_no_crate())
1336 pub fn metadata_encoding_version(self) -> Vec<u8> {
1337 self.cstore.metadata_encoding_version().to_vec()
1340 // Note that this is *untracked* and should only be used within the query
1341 // system if the result is otherwise tracked through queries
1342 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1343 self.cstore.crate_data_as_rc_any(cnum)
1347 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1348 let krate = self.gcx.hir_map.forest.untracked_krate();
1350 StableHashingContext::new(self.sess,
1352 self.hir().definitions(),
1356 // This method makes sure that we have a DepNode and a Fingerprint for
1357 // every upstream crate. It needs to be called once right after the tcx is
1359 // With full-fledged red/green, the method will probably become unnecessary
1360 // as this will be done on-demand.
1361 pub fn allocate_metadata_dep_nodes(self) {
1362 // We cannot use the query versions of crates() and crate_hash(), since
1363 // those would need the DepNodes that we are allocating here.
1364 for cnum in self.cstore.crates_untracked() {
1365 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1366 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1367 self.dep_graph.with_task(dep_node,
1370 |_, x| x // No transformation needed
1375 // This method exercises the `in_scope_traits_map` query for all possible
1376 // values so that we have their fingerprints available in the DepGraph.
1377 // This is only required as long as we still use the old dependency tracking
1378 // which needs to have the fingerprints of all input nodes beforehand.
1379 pub fn precompute_in_scope_traits_hashes(self) {
1380 for &def_index in self.trait_map.keys() {
1381 self.in_scope_traits_map(def_index);
1385 pub fn serialize_query_result_cache<E>(self,
1387 -> Result<(), E::Error>
1388 where E: ty::codec::TyEncoder
1390 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1393 /// This checks whether one is allowed to have pattern bindings
1394 /// that bind-by-move on a match arm that has a guard, e.g.:
1397 /// match foo { A(inner) if { /* something */ } => ..., ... }
1400 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1401 /// because that method has a narrower effect that can be toggled
1402 /// off via a separate `-Z` flag, at least for the short term.
1403 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1404 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1407 /// If true, we should use a naive AST walk to determine if match
1408 /// guard could perform bad mutations (or mutable-borrows).
1409 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1410 // If someone requests the feature, then be a little more
1411 // careful and ensure that MIR-borrowck is enabled (which can
1412 // happen via edition selection, via `feature(nll)`, or via an
1413 // appropriate `-Z` flag) before disabling the mutation check.
1414 if self.allow_bind_by_move_patterns_with_guards() {
1421 /// If true, we should use the AST-based borrowck (we may *also* use
1422 /// the MIR-based borrowck).
1423 pub fn use_ast_borrowck(self) -> bool {
1424 self.borrowck_mode().use_ast()
1427 /// If true, we should use the MIR-based borrowck (we may *also* use
1428 /// the AST-based borrowck).
1429 pub fn use_mir_borrowck(self) -> bool {
1430 self.borrowck_mode().use_mir()
1433 /// If true, we should use the MIR-based borrow check, but also
1434 /// fall back on the AST borrow check if the MIR-based one errors.
1435 pub fn migrate_borrowck(self) -> bool {
1436 self.borrowck_mode().migrate()
1439 /// If true, make MIR codegen for `match` emit a temp that holds a
1440 /// borrow of the input to the match expression.
1441 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1442 self.emit_read_for_match()
1445 /// If true, make MIR codegen for `match` emit FakeRead
1446 /// statements (which simulate the maximal effect of executing the
1447 /// patterns in a match arm).
1448 pub fn emit_read_for_match(&self) -> bool {
1449 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1452 /// If true, pattern variables for use in guards on match arms
1453 /// will be bound as references to the data, and occurrences of
1454 /// those variables in the guard expression will implicitly
1455 /// dereference those bindings. (See rust-lang/rust#27282.)
1456 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1457 self.borrowck_mode().use_mir()
1460 /// If true, we should enable two-phase borrows checks. This is
1461 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1462 /// or by opting into an edition after 2015.
1463 pub fn two_phase_borrows(self) -> bool {
1464 self.sess.rust_2018() || self.features().nll ||
1465 self.sess.opts.debugging_opts.two_phase_borrows
1468 /// What mode(s) of borrowck should we run? AST? MIR? both?
1469 /// (Also considers the `#![feature(nll)]` setting.)
1470 pub fn borrowck_mode(&self) -> BorrowckMode {
1471 // Here are the main constraints we need to deal with:
1473 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1474 // synonymous with no `-Z borrowck=...` flag at all.
1475 // (This is arguably a historical accident.)
1477 // 2. `BorrowckMode::Migrate` is the limited migration to
1478 // NLL that we are deploying with the 2018 edition.
1480 // 3. We want to allow developers on the Nightly channel
1481 // to opt back into the "hard error" mode for NLL,
1482 // (which they can do via specifying `#![feature(nll)]`
1483 // explicitly in their crate).
1485 // So, this precedence list is how pnkfelix chose to work with
1486 // the above constraints:
1488 // * `#![feature(nll)]` *always* means use NLL with hard
1489 // errors. (To simplify the code here, it now even overrides
1490 // a user's attempt to specify `-Z borrowck=compare`, which
1491 // we arguably do not need anymore and should remove.)
1493 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1494 // if `borrowck=ast` was specified), then use the default
1495 // as required by the edition.
1497 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1499 if self.features().nll { return BorrowckMode::Mir; }
1501 match self.sess.opts.borrowck_mode {
1502 mode @ BorrowckMode::Mir |
1503 mode @ BorrowckMode::Compare |
1504 mode @ BorrowckMode::Migrate => mode,
1506 BorrowckMode::Ast => match self.sess.edition() {
1507 Edition::Edition2015 => BorrowckMode::Ast,
1508 Edition::Edition2018 => BorrowckMode::Migrate,
1514 pub fn local_crate_exports_generics(self) -> bool {
1515 debug_assert!(self.sess.opts.share_generics());
1517 self.sess.crate_types.borrow().iter().any(|crate_type| {
1519 CrateType::Executable |
1520 CrateType::Staticlib |
1521 CrateType::ProcMacro |
1522 CrateType::Cdylib => false,
1524 CrateType::Dylib => true,
1529 // This method returns the DefId and the BoundRegion corresponding to the given region.
1530 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1531 let (suitable_region_binding_scope, bound_region) = match *region {
1532 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1533 ty::ReEarlyBound(ref ebr) => (
1534 self.parent_def_id(ebr.def_id).unwrap(),
1535 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1537 _ => return None, // not a free region
1540 let node_id = self.hir()
1541 .as_local_node_id(suitable_region_binding_scope)
1543 let is_impl_item = match self.hir().find(node_id) {
1544 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1545 Some(Node::ImplItem(..)) => {
1546 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1551 return Some(FreeRegionInfo {
1552 def_id: suitable_region_binding_scope,
1553 boundregion: bound_region,
1554 is_impl_item: is_impl_item,
1558 pub fn return_type_impl_trait(
1560 scope_def_id: DefId,
1561 ) -> Option<Ty<'tcx>> {
1562 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1563 let node_id = self.hir().as_local_node_id(scope_def_id).unwrap();
1564 match self.hir().get(node_id) {
1565 Node::Item(item) => {
1567 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1573 _ => { /* type_of_def_id() will work or panic */ }
1576 let ret_ty = self.type_of(scope_def_id);
1578 ty::FnDef(_, _) => {
1579 let sig = ret_ty.fn_sig(*self);
1580 let output = self.erase_late_bound_regions(&sig.output());
1581 if output.is_impl_trait() {
1591 // Here we check if the bound region is in Impl Item.
1592 pub fn is_bound_region_in_impl_item(
1594 suitable_region_binding_scope: DefId,
1596 let container_id = self.associated_item(suitable_region_binding_scope)
1599 if self.impl_trait_ref(container_id).is_some() {
1600 // For now, we do not try to target impls of traits. This is
1601 // because this message is going to suggest that the user
1602 // change the fn signature, but they may not be free to do so,
1603 // since the signature must match the trait.
1605 // FIXME(#42706) -- in some cases, we could do better here.
1612 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1613 pub fn encode_metadata(self)
1616 self.cstore.encode_metadata(self)
1620 impl<'gcx> GlobalCtxt<'gcx> {
1621 /// Call the closure with a local `TyCtxt` using the given arena.
1622 /// `interners` is a slot passed so we can create a CtxtInterners
1623 /// with the same lifetime as `arena`.
1624 pub fn enter_local<'tcx, F, R>(
1626 arena: &'tcx SyncDroplessArena,
1627 interners: &'tcx mut Option<CtxtInterners<'tcx>>,
1631 F: FnOnce(TyCtxt<'tcx, 'gcx, 'tcx>) -> R,
1634 *interners = Some(CtxtInterners::new(&arena));
1637 interners: interners.as_ref().unwrap(),
1640 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1641 let new_icx = ty::tls::ImplicitCtxt {
1643 query: icx.query.clone(),
1644 layout_depth: icx.layout_depth,
1647 ty::tls::enter_context(&new_icx, |_| {
1654 /// A trait implemented for all X<'a> types which can be safely and
1655 /// efficiently converted to X<'tcx> as long as they are part of the
1656 /// provided TyCtxt<'tcx>.
1657 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1658 /// by looking them up in their respective interners.
1660 /// However, this is still not the best implementation as it does
1661 /// need to compare the components, even for interned values.
1662 /// It would be more efficient if TypedArena provided a way to
1663 /// determine whether the address is in the allocated range.
1665 /// None is returned if the value or one of the components is not part
1666 /// of the provided context.
1667 /// For Ty, None can be returned if either the type interner doesn't
1668 /// contain the TyKind key or if the address of the interned
1669 /// pointer differs. The latter case is possible if a primitive type,
1670 /// e.g., `()` or `u8`, was interned in a different context.
1671 pub trait Lift<'tcx>: fmt::Debug {
1672 type Lifted: fmt::Debug + 'tcx;
1673 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1676 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1677 type Lifted = Ty<'tcx>;
1678 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1679 if tcx.interners.arena.in_arena(*self as *const _) {
1680 return Some(unsafe { mem::transmute(*self) });
1682 // Also try in the global tcx if we're not that.
1683 if !tcx.is_global() {
1684 self.lift_to_tcx(tcx.global_tcx())
1691 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1692 type Lifted = Region<'tcx>;
1693 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1694 if tcx.interners.arena.in_arena(*self as *const _) {
1695 return Some(unsafe { mem::transmute(*self) });
1697 // Also try in the global tcx if we're not that.
1698 if !tcx.is_global() {
1699 self.lift_to_tcx(tcx.global_tcx())
1706 impl<'a, 'tcx> Lift<'tcx> for Goal<'a> {
1707 type Lifted = Goal<'tcx>;
1708 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Goal<'tcx>> {
1709 if tcx.interners.arena.in_arena(*self as *const _) {
1710 return Some(unsafe { mem::transmute(*self) });
1712 // Also try in the global tcx if we're not that.
1713 if !tcx.is_global() {
1714 self.lift_to_tcx(tcx.global_tcx())
1721 impl<'a, 'tcx> Lift<'tcx> for &'a List<Goal<'a>> {
1722 type Lifted = &'tcx List<Goal<'tcx>>;
1723 fn lift_to_tcx<'b, 'gcx>(
1725 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1726 ) -> Option<&'tcx List<Goal<'tcx>>> {
1727 if tcx.interners.arena.in_arena(*self as *const _) {
1728 return Some(unsafe { mem::transmute(*self) });
1730 // Also try in the global tcx if we're not that.
1731 if !tcx.is_global() {
1732 self.lift_to_tcx(tcx.global_tcx())
1739 impl<'a, 'tcx> Lift<'tcx> for &'a List<Clause<'a>> {
1740 type Lifted = &'tcx List<Clause<'tcx>>;
1741 fn lift_to_tcx<'b, 'gcx>(
1743 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1744 ) -> Option<&'tcx List<Clause<'tcx>>> {
1745 if tcx.interners.arena.in_arena(*self as *const _) {
1746 return Some(unsafe { mem::transmute(*self) });
1748 // Also try in the global tcx if we're not that.
1749 if !tcx.is_global() {
1750 self.lift_to_tcx(tcx.global_tcx())
1757 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1758 type Lifted = &'tcx Const<'tcx>;
1759 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1760 if tcx.interners.arena.in_arena(*self as *const _) {
1761 return Some(unsafe { mem::transmute(*self) });
1763 // Also try in the global tcx if we're not that.
1764 if !tcx.is_global() {
1765 self.lift_to_tcx(tcx.global_tcx())
1772 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1773 type Lifted = &'tcx Substs<'tcx>;
1774 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1775 if self.len() == 0 {
1776 return Some(List::empty());
1778 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1779 return Some(unsafe { mem::transmute(*self) });
1781 // Also try in the global tcx if we're not that.
1782 if !tcx.is_global() {
1783 self.lift_to_tcx(tcx.global_tcx())
1790 impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>> {
1791 type Lifted = &'tcx List<Ty<'tcx>>;
1792 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1793 -> Option<&'tcx List<Ty<'tcx>>> {
1794 if self.len() == 0 {
1795 return Some(List::empty());
1797 if tcx.interners.arena.in_arena(*self as *const _) {
1798 return Some(unsafe { mem::transmute(*self) });
1800 // Also try in the global tcx if we're not that.
1801 if !tcx.is_global() {
1802 self.lift_to_tcx(tcx.global_tcx())
1809 impl<'a, 'tcx> Lift<'tcx> for &'a List<ExistentialPredicate<'a>> {
1810 type Lifted = &'tcx List<ExistentialPredicate<'tcx>>;
1811 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1812 -> Option<&'tcx List<ExistentialPredicate<'tcx>>> {
1813 if self.is_empty() {
1814 return Some(List::empty());
1816 if tcx.interners.arena.in_arena(*self as *const _) {
1817 return Some(unsafe { mem::transmute(*self) });
1819 // Also try in the global tcx if we're not that.
1820 if !tcx.is_global() {
1821 self.lift_to_tcx(tcx.global_tcx())
1828 impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>> {
1829 type Lifted = &'tcx List<Predicate<'tcx>>;
1830 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1831 -> Option<&'tcx List<Predicate<'tcx>>> {
1832 if self.is_empty() {
1833 return Some(List::empty());
1835 if tcx.interners.arena.in_arena(*self as *const _) {
1836 return Some(unsafe { mem::transmute(*self) });
1838 // Also try in the global tcx if we're not that.
1839 if !tcx.is_global() {
1840 self.lift_to_tcx(tcx.global_tcx())
1847 impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo> {
1848 type Lifted = &'tcx List<CanonicalVarInfo>;
1849 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1850 if self.len() == 0 {
1851 return Some(List::empty());
1853 if tcx.interners.arena.in_arena(*self as *const _) {
1854 return Some(unsafe { mem::transmute(*self) });
1856 // Also try in the global tcx if we're not that.
1857 if !tcx.is_global() {
1858 self.lift_to_tcx(tcx.global_tcx())
1865 impl<'a, 'tcx> Lift<'tcx> for &'a List<ProjectionKind<'a>> {
1866 type Lifted = &'tcx List<ProjectionKind<'tcx>>;
1867 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1868 if self.len() == 0 {
1869 return Some(List::empty());
1871 if tcx.interners.arena.in_arena(*self as *const _) {
1872 return Some(unsafe { mem::transmute(*self) });
1874 // Also try in the global tcx if we're not that.
1875 if !tcx.is_global() {
1876 self.lift_to_tcx(tcx.global_tcx())
1884 use super::{GlobalCtxt, TyCtxt};
1888 use std::marker::PhantomData;
1891 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1892 use rustc_data_structures::OnDrop;
1893 use rustc_data_structures::sync::{self, Lrc, Lock};
1894 use dep_graph::OpenTask;
1896 #[cfg(not(parallel_queries))]
1897 use std::cell::Cell;
1899 #[cfg(parallel_queries)]
1902 /// This is the implicit state of rustc. It contains the current
1903 /// TyCtxt and query. It is updated when creating a local interner or
1904 /// executing a new query. Whenever there's a TyCtxt value available
1905 /// you should also have access to an ImplicitCtxt through the functions
1908 pub struct ImplicitCtxt<'a, 'gcx: 'tcx, 'tcx> {
1909 /// The current TyCtxt. Initially created by `enter_global` and updated
1910 /// by `enter_local` with a new local interner
1911 pub tcx: TyCtxt<'tcx, 'gcx, 'tcx>,
1913 /// The current query job, if any. This is updated by start_job in
1914 /// ty::query::plumbing when executing a query
1915 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1917 /// Used to prevent layout from recursing too deeply.
1918 pub layout_depth: usize,
1920 /// The current dep graph task. This is used to add dependencies to queries
1921 /// when executing them
1922 pub task: &'a OpenTask,
1925 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1926 /// to `value` during the call to `f`. It is restored to its previous value after.
1927 /// This is used to set the pointer to the new ImplicitCtxt.
1928 #[cfg(parallel_queries)]
1930 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1931 rayon_core::tlv::with(value, f)
1934 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1935 /// This is used to get the pointer to the current ImplicitCtxt.
1936 #[cfg(parallel_queries)]
1938 fn get_tlv() -> usize {
1939 rayon_core::tlv::get()
1942 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1943 #[cfg(not(parallel_queries))]
1944 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1946 /// Sets TLV to `value` during the call to `f`.
1947 /// It is restored to its previous value after.
1948 /// This is used to set the pointer to the new ImplicitCtxt.
1949 #[cfg(not(parallel_queries))]
1951 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1952 let old = get_tlv();
1953 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1954 TLV.with(|tlv| tlv.set(value));
1958 /// This is used to get the pointer to the current ImplicitCtxt.
1959 #[cfg(not(parallel_queries))]
1960 fn get_tlv() -> usize {
1961 TLV.with(|tlv| tlv.get())
1964 /// This is a callback from libsyntax as it cannot access the implicit state
1965 /// in librustc otherwise
1966 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1968 if let Some(tcx) = tcx {
1969 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1971 syntax_pos::default_span_debug(span, f)
1976 /// This is a callback from libsyntax as it cannot access the implicit state
1977 /// in librustc otherwise. It is used to when diagnostic messages are
1978 /// emitted and stores them in the current query, if there is one.
1979 fn track_diagnostic(diagnostic: &Diagnostic) {
1980 with_context_opt(|icx| {
1981 if let Some(icx) = icx {
1982 if let Some(ref query) = icx.query {
1983 query.diagnostics.lock().push(diagnostic.clone());
1989 /// Sets up the callbacks from libsyntax on the current thread
1990 pub fn with_thread_locals<F, R>(f: F) -> R
1991 where F: FnOnce() -> R
1993 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1994 let original_span_debug = span_dbg.get();
1995 span_dbg.set(span_debug);
1997 let _on_drop = OnDrop(move || {
1998 span_dbg.set(original_span_debug);
2001 TRACK_DIAGNOSTICS.with(|current| {
2002 let original = current.get();
2003 current.set(track_diagnostic);
2005 let _on_drop = OnDrop(move || {
2006 current.set(original);
2014 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
2016 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
2018 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2020 set_tlv(context as *const _ as usize, || {
2025 /// Enters GlobalCtxt by setting up libsyntax callbacks and
2026 /// creating a initial TyCtxt and ImplicitCtxt.
2027 /// This happens once per rustc session and TyCtxts only exists
2028 /// inside the `f` function.
2029 pub fn enter_global<'gcx, F, R>(gcx: &'gcx GlobalCtxt<'gcx>, f: F) -> R
2030 where F: FnOnce(TyCtxt<'gcx, 'gcx, 'gcx>) -> R
2032 with_thread_locals(|| {
2033 // Update GCX_PTR to indicate there's a GlobalCtxt available
2034 GCX_PTR.with(|lock| {
2035 *lock.lock() = gcx as *const _ as usize;
2037 // Set GCX_PTR back to 0 when we exit
2038 let _on_drop = OnDrop(move || {
2039 GCX_PTR.with(|lock| *lock.lock() = 0);
2044 interners: &gcx.global_interners,
2047 let icx = ImplicitCtxt {
2051 task: &OpenTask::Ignore,
2053 enter_context(&icx, |_| {
2059 /// Stores a pointer to the GlobalCtxt if one is available.
2060 /// This is used to access the GlobalCtxt in the deadlock handler
2062 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2064 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2065 /// This is used in the deadlock handler.
2066 pub unsafe fn with_global<F, R>(f: F) -> R
2067 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2069 let gcx = GCX_PTR.with(|lock| *lock.lock());
2071 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2074 interners: &gcx.global_interners,
2077 let icx = ImplicitCtxt {
2081 task: &OpenTask::Ignore,
2083 enter_context(&icx, |_| f(tcx))
2086 /// Allows access to the current ImplicitCtxt in a closure if one is available
2088 pub fn with_context_opt<F, R>(f: F) -> R
2089 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2091 let context = get_tlv();
2095 // We could get a ImplicitCtxt pointer from another thread.
2096 // Ensure that ImplicitCtxt is Sync
2097 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2099 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2103 /// Allows access to the current ImplicitCtxt.
2104 /// Panics if there is no ImplicitCtxt available
2106 pub fn with_context<F, R>(f: F) -> R
2107 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2109 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2112 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2113 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2114 /// with the same 'gcx lifetime as the TyCtxt passed in.
2115 /// This will panic if you pass it a TyCtxt which has a different global interner from
2116 /// the current ImplicitCtxt's tcx field.
2118 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2119 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2121 with_context(|context| {
2123 let gcx = tcx.gcx as *const _ as usize;
2124 assert!(context.tcx.gcx as *const _ as usize == gcx);
2125 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2131 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2132 /// interner and local interner as the tcx argument passed in. This means the closure
2133 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2134 /// This will panic if you pass it a TyCtxt which has a different global interner or
2135 /// a different local interner from the current ImplicitCtxt's tcx field.
2137 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2138 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2140 with_context(|context| {
2142 let gcx = tcx.gcx as *const _ as usize;
2143 let interners = tcx.interners as *const _ as usize;
2144 assert!(context.tcx.gcx as *const _ as usize == gcx);
2145 assert!(context.tcx.interners as *const _ as usize == interners);
2146 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2152 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2153 /// Panics if there is no ImplicitCtxt available
2155 pub fn with<F, R>(f: F) -> R
2156 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2158 with_context(|context| f(context.tcx))
2161 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2162 /// The closure is passed None if there is no ImplicitCtxt available
2164 pub fn with_opt<F, R>(f: F) -> R
2165 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2167 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2171 macro_rules! sty_debug_print {
2172 ($ctxt: expr, $($variant: ident),*) => {{
2173 // curious inner module to allow variant names to be used as
2175 #[allow(non_snake_case)]
2177 use ty::{self, TyCtxt};
2178 use ty::context::Interned;
2180 #[derive(Copy, Clone)]
2183 region_infer: usize,
2188 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2189 let mut total = DebugStat {
2191 region_infer: 0, ty_infer: 0, both_infer: 0,
2193 $(let mut $variant = total;)*
2195 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2196 let variant = match t.sty {
2197 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2198 ty::Float(..) | ty::Str | ty::Never => continue,
2199 ty::Error => /* unimportant */ continue,
2200 $(ty::$variant(..) => &mut $variant,)*
2202 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2203 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2207 if region { total.region_infer += 1; variant.region_infer += 1 }
2208 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2209 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2211 println!("Ty interner total ty region both");
2212 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2213 {ty:4.1}% {region:5.1}% {both:4.1}%",
2214 stringify!($variant),
2215 uses = $variant.total,
2216 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2217 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2218 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2219 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2221 println!(" total {uses:6} \
2222 {ty:4.1}% {region:5.1}% {both:4.1}%",
2224 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2225 region = total.region_infer as f64 * 100.0 / total.total as f64,
2226 both = total.both_infer as f64 * 100.0 / total.total as f64)
2234 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2235 pub fn print_debug_stats(self) {
2238 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2239 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2240 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2242 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2243 println!("Region interner: #{}", self.interners.region.borrow().len());
2244 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2245 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2246 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2251 /// An entry in an interner.
2252 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2254 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2255 fn clone(&self) -> Self {
2259 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2261 // N.B., an `Interned<Ty>` compares and hashes as a sty.
2262 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2263 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2264 self.0.sty == other.0.sty
2268 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2270 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2271 fn hash<H: Hasher>(&self, s: &mut H) {
2276 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2277 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2282 // N.B., an `Interned<List<T>>` compares and hashes as its elements.
2283 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2284 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2285 self.0[..] == other.0[..]
2289 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2291 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2292 fn hash<H: Hasher>(&self, s: &mut H) {
2297 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2298 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2303 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2304 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2309 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2310 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2315 impl<'tcx: 'lcx, 'lcx> Borrow<[ProjectionKind<'lcx>]>
2316 for Interned<'tcx, List<ProjectionKind<'tcx>>> {
2317 fn borrow<'a>(&'a self) -> &'a [ProjectionKind<'lcx>] {
2322 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2323 fn borrow<'a>(&'a self) -> &'a RegionKind {
2328 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2329 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2334 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2335 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2336 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2341 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2342 for Interned<'tcx, List<Predicate<'tcx>>> {
2343 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2348 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2349 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2354 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2355 for Interned<'tcx, List<Clause<'tcx>>> {
2356 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2361 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2362 for Interned<'tcx, List<Goal<'tcx>>> {
2363 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2368 macro_rules! intern_method {
2369 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2372 $keep_in_local_tcx:expr) -> $ty:ty) => {
2373 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2374 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2375 let key = ($alloc_to_key)(&v);
2377 // HACK(eddyb) Depend on flags being accurate to
2378 // determine that all contents are in the global tcx.
2379 // See comments on Lift for why we can't use that.
2380 if ($keep_in_local_tcx)(&v) {
2381 self.interners.$name.borrow_mut().intern_ref(key, || {
2382 // Make sure we don't end up with inference
2383 // types/regions in the global tcx.
2384 if self.is_global() {
2385 bug!("Attempted to intern `{:?}` which contains \
2386 inference types/regions in the global type context",
2390 Interned($alloc_method(&self.interners.arena, v))
2393 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2394 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2398 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2400 let i = unsafe { mem::transmute(i) };
2409 macro_rules! direct_interners {
2410 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2411 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2412 fn eq(&self, other: &Self) -> bool {
2417 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2419 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2420 fn hash<H: Hasher>(&self, s: &mut H) {
2428 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2430 $keep_in_local_tcx) -> $ty);)+
2434 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2435 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2438 direct_interners!('tcx,
2439 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2440 const_: mk_const(|c: &Const<'_>| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>,
2441 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>
2444 macro_rules! slice_interners {
2445 ($($field:ident: $method:ident($ty:ident)),+) => (
2446 $(intern_method!( 'tcx, $field: $method(
2448 |a, v| List::from_arena(a, v),
2450 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2455 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2456 predicates: _intern_predicates(Predicate),
2457 type_list: _intern_type_list(Ty),
2458 substs: _intern_substs(Kind),
2459 clauses: _intern_clauses(Clause),
2460 goal_list: _intern_goals(Goal),
2461 projs: _intern_projs(ProjectionKind)
2464 // This isn't a perfect fit: CanonicalVarInfo slices are always
2465 // allocated in the global arena, so this `intern_method!` macro is
2466 // overly general. But we just return false for the code that checks
2467 // whether they belong in the thread-local arena, so no harm done, and
2468 // seems better than open-coding the rest.
2471 canonical_var_infos: _intern_canonical_var_infos(
2472 &[CanonicalVarInfo],
2473 |a, v| List::from_arena(a, v),
2475 |_xs: &[CanonicalVarInfo]| -> bool { false }
2476 ) -> List<CanonicalVarInfo>
2479 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2480 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2481 /// that is, a `fn` type that is equivalent in every way for being
2483 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2484 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2485 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2486 unsafety: hir::Unsafety::Unsafe,
2491 /// Given a closure signature `sig`, returns an equivalent `fn`
2492 /// type with the same signature. Detuples and so forth -- so
2493 /// e.g., if we have a sig with `Fn<(u32, i32)>` then you would get
2494 /// a `fn(u32, i32)`.
2495 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2496 let converted_sig = sig.map_bound(|s| {
2497 let params_iter = match s.inputs()[0].sty {
2498 ty::Tuple(params) => {
2499 params.into_iter().cloned()
2507 hir::Unsafety::Normal,
2512 self.mk_fn_ptr(converted_sig)
2516 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2517 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2520 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2522 ast::IntTy::Isize => self.types.isize,
2523 ast::IntTy::I8 => self.types.i8,
2524 ast::IntTy::I16 => self.types.i16,
2525 ast::IntTy::I32 => self.types.i32,
2526 ast::IntTy::I64 => self.types.i64,
2527 ast::IntTy::I128 => self.types.i128,
2531 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2533 ast::UintTy::Usize => self.types.usize,
2534 ast::UintTy::U8 => self.types.u8,
2535 ast::UintTy::U16 => self.types.u16,
2536 ast::UintTy::U32 => self.types.u32,
2537 ast::UintTy::U64 => self.types.u64,
2538 ast::UintTy::U128 => self.types.u128,
2542 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2544 ast::FloatTy::F32 => self.types.f32,
2545 ast::FloatTy::F64 => self.types.f64,
2550 pub fn mk_str(self) -> Ty<'tcx> {
2555 pub fn mk_static_str(self) -> Ty<'tcx> {
2556 self.mk_imm_ref(self.types.re_static, self.mk_str())
2560 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2561 // take a copy of substs so that we own the vectors inside
2562 self.mk_ty(Adt(def, substs))
2566 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2567 self.mk_ty(Foreign(def_id))
2570 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2571 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2572 let adt_def = self.adt_def(def_id);
2573 let substs = Substs::for_item(self, def_id, |param, substs| {
2575 GenericParamDefKind::Lifetime => bug!(),
2576 GenericParamDefKind::Type { has_default, .. } => {
2577 if param.index == 0 {
2580 assert!(has_default);
2581 self.type_of(param.def_id).subst(self, substs).into()
2586 self.mk_ty(Adt(adt_def, substs))
2590 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2591 self.mk_ty(RawPtr(tm))
2595 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2596 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2600 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2601 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2605 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2606 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2610 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2611 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2615 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2616 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2620 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2621 self.mk_imm_ptr(self.mk_unit())
2625 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2626 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2630 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2631 self.mk_ty(Slice(ty))
2635 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2636 self.mk_ty(Tuple(self.intern_type_list(ts)))
2639 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2640 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2644 pub fn mk_unit(self) -> Ty<'tcx> {
2649 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2650 if self.features().never_type {
2653 self.intern_tup(&[])
2658 pub fn mk_bool(self) -> Ty<'tcx> {
2663 pub fn mk_fn_def(self, def_id: DefId,
2664 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2665 self.mk_ty(FnDef(def_id, substs))
2669 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2670 self.mk_ty(FnPtr(fty))
2676 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2677 reg: ty::Region<'tcx>
2679 self.mk_ty(Dynamic(obj, reg))
2683 pub fn mk_projection(self,
2685 substs: &'tcx Substs<'tcx>)
2687 self.mk_ty(Projection(ProjectionTy {
2694 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2696 self.mk_ty(Closure(closure_id, closure_substs))
2700 pub fn mk_generator(self,
2702 generator_substs: GeneratorSubsts<'tcx>,
2703 movability: hir::GeneratorMovability)
2705 self.mk_ty(Generator(id, generator_substs, movability))
2709 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2710 self.mk_ty(GeneratorWitness(types))
2714 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2715 self.mk_infer(TyVar(v))
2719 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2720 self.mk_infer(IntVar(v))
2724 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2725 self.mk_infer(FloatVar(v))
2729 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2730 self.mk_ty(Infer(it))
2734 pub fn mk_ty_param(self,
2736 name: InternedString) -> Ty<'tcx> {
2737 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2741 pub fn mk_self_type(self) -> Ty<'tcx> {
2742 self.mk_ty_param(0, keywords::SelfUpper.name().as_interned_str())
2745 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2747 GenericParamDefKind::Lifetime => {
2748 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2750 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2755 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2756 self.mk_ty(Opaque(def_id, substs))
2759 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2760 -> &'tcx List<ExistentialPredicate<'tcx>> {
2761 assert!(!eps.is_empty());
2762 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2763 self._intern_existential_predicates(eps)
2766 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2767 -> &'tcx List<Predicate<'tcx>> {
2768 // FIXME consider asking the input slice to be sorted to avoid
2769 // re-interning permutations, in which case that would be asserted
2771 if preds.len() == 0 {
2772 // The macro-generated method below asserts we don't intern an empty slice.
2775 self._intern_predicates(preds)
2779 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2783 self._intern_type_list(ts)
2787 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2791 self._intern_substs(ts)
2795 pub fn intern_projs(self, ps: &[ProjectionKind<'tcx>]) -> &'tcx List<ProjectionKind<'tcx>> {
2799 self._intern_projs(ps)
2803 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2807 self.global_tcx()._intern_canonical_var_infos(ts)
2811 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2815 self._intern_clauses(ts)
2819 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2823 self._intern_goals(ts)
2827 pub fn mk_fn_sig<I>(self,
2831 unsafety: hir::Unsafety,
2833 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2835 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2837 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2838 inputs_and_output: self.intern_type_list(xs),
2839 variadic, unsafety, abi
2843 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2844 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2846 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2849 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2850 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2852 iter.intern_with(|xs| self.intern_predicates(xs))
2855 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2856 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2857 iter.intern_with(|xs| self.intern_type_list(xs))
2860 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2861 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2862 iter.intern_with(|xs| self.intern_substs(xs))
2865 pub fn mk_substs_trait(self,
2867 rest: &[Kind<'tcx>])
2868 -> &'tcx Substs<'tcx>
2870 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2873 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2874 iter.intern_with(|xs| self.intern_clauses(xs))
2877 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2878 iter.intern_with(|xs| self.intern_goals(xs))
2881 pub fn lint_hir<S: Into<MultiSpan>>(self,
2882 lint: &'static Lint,
2886 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2889 pub fn lint_node<S: Into<MultiSpan>>(self,
2890 lint: &'static Lint,
2894 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2897 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2898 lint: &'static Lint,
2903 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2908 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2909 lint: &'static Lint,
2914 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2919 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2920 -> (lint::Level, lint::LintSource)
2922 // Right now we insert a `with_ignore` node in the dep graph here to
2923 // ignore the fact that `lint_levels` below depends on the entire crate.
2924 // For now this'll prevent false positives of recompiling too much when
2925 // anything changes.
2927 // Once red/green incremental compilation lands we should be able to
2928 // remove this because while the crate changes often the lint level map
2929 // will change rarely.
2930 self.dep_graph.with_ignore(|| {
2931 let sets = self.lint_levels(LOCAL_CRATE);
2933 let hir_id = self.hir().definitions().node_to_hir_id(id);
2934 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2937 let next = self.hir().get_parent_node(id);
2939 bug!("lint traversal reached the root of the crate");
2946 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2947 lint: &'static Lint,
2951 -> DiagnosticBuilder<'tcx>
2953 let node_id = self.hir().hir_to_node_id(hir_id);
2954 let (level, src) = self.lint_level_at_node(lint, node_id);
2955 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2958 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2959 lint: &'static Lint,
2963 -> DiagnosticBuilder<'tcx>
2965 let (level, src) = self.lint_level_at_node(lint, id);
2966 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2969 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2970 -> DiagnosticBuilder<'tcx>
2972 let (level, src) = self.lint_level_at_node(lint, id);
2973 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2976 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2977 self.in_scope_traits_map(id.owner)
2978 .and_then(|map| map.get(&id.local_id).cloned())
2981 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2982 self.named_region_map(id.owner)
2983 .and_then(|map| map.get(&id.local_id).cloned())
2986 pub fn is_late_bound(self, id: HirId) -> bool {
2987 self.is_late_bound_map(id.owner)
2988 .map(|set| set.contains(&id.local_id))
2992 pub fn object_lifetime_defaults(self, id: HirId)
2993 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2995 self.object_lifetime_defaults_map(id.owner)
2996 .and_then(|map| map.get(&id.local_id).cloned())
3000 pub trait InternAs<T: ?Sized, R> {
3002 fn intern_with<F>(self, f: F) -> Self::Output
3003 where F: FnOnce(&T) -> R;
3006 impl<I, T, R, E> InternAs<[T], R> for I
3007 where E: InternIteratorElement<T, R>,
3008 I: Iterator<Item=E> {
3009 type Output = E::Output;
3010 fn intern_with<F>(self, f: F) -> Self::Output
3011 where F: FnOnce(&[T]) -> R {
3012 E::intern_with(self, f)
3016 pub trait InternIteratorElement<T, R>: Sized {
3018 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
3021 impl<T, R> InternIteratorElement<T, R> for T {
3023 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3024 f(&iter.collect::<SmallVec<[_; 8]>>())
3028 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
3032 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3033 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
3037 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
3038 type Output = Result<R, E>;
3039 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3040 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
3044 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3045 // FIXME(#44234): almost all of these queries have no sub-queries and
3046 // therefore no actual inputs, they're just reading tables calculated in
3047 // resolve! Does this work? Unsure! That's what the issue is about.
3048 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
3049 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
3050 providers.crate_name = |tcx, id| {
3051 assert_eq!(id, LOCAL_CRATE);
3054 providers.get_lib_features = |tcx, id| {
3055 assert_eq!(id, LOCAL_CRATE);
3056 Lrc::new(middle::lib_features::collect(tcx))
3058 providers.get_lang_items = |tcx, id| {
3059 assert_eq!(id, LOCAL_CRATE);
3060 Lrc::new(middle::lang_items::collect(tcx))
3062 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3063 providers.maybe_unused_trait_import = |tcx, id| {
3064 tcx.maybe_unused_trait_imports.contains(&id)
3066 providers.maybe_unused_extern_crates = |tcx, cnum| {
3067 assert_eq!(cnum, LOCAL_CRATE);
3068 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3071 providers.stability_index = |tcx, cnum| {
3072 assert_eq!(cnum, LOCAL_CRATE);
3073 Lrc::new(stability::Index::new(tcx))
3075 providers.lookup_stability = |tcx, id| {
3076 assert_eq!(id.krate, LOCAL_CRATE);
3077 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3078 tcx.stability().local_stability(id)
3080 providers.lookup_deprecation_entry = |tcx, id| {
3081 assert_eq!(id.krate, LOCAL_CRATE);
3082 let id = tcx.hir().definitions().def_index_to_hir_id(id.index);
3083 tcx.stability().local_deprecation_entry(id)
3085 providers.extern_mod_stmt_cnum = |tcx, id| {
3086 let id = tcx.hir().as_local_node_id(id).unwrap();
3087 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3089 providers.all_crate_nums = |tcx, cnum| {
3090 assert_eq!(cnum, LOCAL_CRATE);
3091 Lrc::new(tcx.cstore.crates_untracked())
3093 providers.postorder_cnums = |tcx, cnum| {
3094 assert_eq!(cnum, LOCAL_CRATE);
3095 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3097 providers.output_filenames = |tcx, cnum| {
3098 assert_eq!(cnum, LOCAL_CRATE);
3099 tcx.output_filenames.clone()
3101 providers.features_query = |tcx, cnum| {
3102 assert_eq!(cnum, LOCAL_CRATE);
3103 Lrc::new(tcx.sess.features_untracked().clone())
3105 providers.is_panic_runtime = |tcx, cnum| {
3106 assert_eq!(cnum, LOCAL_CRATE);
3107 attr::contains_name(tcx.hir().krate_attrs(), "panic_runtime")
3109 providers.is_compiler_builtins = |tcx, cnum| {
3110 assert_eq!(cnum, LOCAL_CRATE);
3111 attr::contains_name(tcx.hir().krate_attrs(), "compiler_builtins")