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 rustc_target::spec::abi;
76 use syntax::ast::{self, NodeId};
78 use syntax::source_map::MultiSpan;
79 use syntax::edition::Edition;
80 use syntax::feature_gate;
81 use syntax::symbol::{Symbol, keywords, InternedString};
86 pub struct AllArenas<'tcx> {
87 pub global: WorkerLocal<GlobalArenas<'tcx>>,
88 pub interner: SyncDroplessArena,
91 impl<'tcx> AllArenas<'tcx> {
92 pub fn new() -> Self {
94 global: WorkerLocal::new(|_| GlobalArenas::default()),
95 interner: SyncDroplessArena::default(),
102 pub struct GlobalArenas<'tcx> {
104 layout: TypedArena<LayoutDetails>,
107 generics: TypedArena<ty::Generics>,
108 trait_def: TypedArena<ty::TraitDef>,
109 adt_def: TypedArena<ty::AdtDef>,
110 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
111 mir: TypedArena<Mir<'tcx>>,
112 tables: TypedArena<ty::TypeckTables<'tcx>>,
114 const_allocs: TypedArena<interpret::Allocation>,
117 type InternedSet<'tcx, T> = Lock<FxHashMap<Interned<'tcx, T>, ()>>;
119 pub struct CtxtInterners<'tcx> {
120 /// The arena that types, regions, etc are allocated from
121 arena: &'tcx SyncDroplessArena,
123 /// Specifically use a speedy hash algorithm for these hash sets,
124 /// they're accessed quite often.
125 type_: InternedSet<'tcx, TyS<'tcx>>,
126 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
127 substs: InternedSet<'tcx, Substs<'tcx>>,
128 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
129 region: InternedSet<'tcx, RegionKind>,
130 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
131 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
132 const_: InternedSet<'tcx, Const<'tcx>>,
133 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
134 goal: InternedSet<'tcx, GoalKind<'tcx>>,
135 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
136 projs: InternedSet<'tcx, List<ProjectionKind<'tcx>>>,
139 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
140 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
143 type_: Default::default(),
144 type_list: Default::default(),
145 substs: Default::default(),
146 region: Default::default(),
147 existential_predicates: Default::default(),
148 canonical_var_infos: Default::default(),
149 predicates: Default::default(),
150 const_: Default::default(),
151 clauses: Default::default(),
152 goal: Default::default(),
153 goal_list: Default::default(),
154 projs: Default::default(),
161 local: &CtxtInterners<'tcx>,
162 global: &CtxtInterners<'gcx>,
165 let flags = super::flags::FlagComputation::for_sty(&st);
167 // HACK(eddyb) Depend on flags being accurate to
168 // determine that all contents are in the global tcx.
169 // See comments on Lift for why we can't use that.
170 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
171 local.type_.borrow_mut().intern(st, |st| {
172 let ty_struct = TyS {
175 outer_exclusive_binder: flags.outer_exclusive_binder,
178 // Make sure we don't end up with inference
179 // types/regions in the global interner
180 if local as *const _ as usize == global as *const _ as usize {
181 bug!("Attempted to intern `{:?}` which contains \
182 inference types/regions in the global type context",
186 Interned(local.arena.alloc(ty_struct))
189 global.type_.borrow_mut().intern(st, |st| {
190 let ty_struct = TyS {
193 outer_exclusive_binder: flags.outer_exclusive_binder,
196 // This is safe because all the types the ty_struct can point to
197 // already is in the global arena
198 let ty_struct: TyS<'gcx> = unsafe {
199 mem::transmute(ty_struct)
202 Interned(global.arena.alloc(ty_struct))
208 pub struct CommonTypes<'tcx> {
229 pub re_empty: Region<'tcx>,
230 pub re_static: Region<'tcx>,
231 pub re_erased: Region<'tcx>,
234 pub struct LocalTableInContext<'a, V: 'a> {
235 local_id_root: Option<DefId>,
236 data: &'a ItemLocalMap<V>
239 /// Validate that the given HirId (respectively its `local_id` part) can be
240 /// safely used as a key in the tables of a TypeckTable. For that to be
241 /// the case, the HirId must have the same `owner` as all the other IDs in
242 /// this table (signified by `local_id_root`). Otherwise the HirId
243 /// would be in a different frame of reference and using its `local_id`
244 /// would result in lookup errors, or worse, in silently wrong data being
246 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
249 if cfg!(debug_assertions) {
250 if let Some(local_id_root) = local_id_root {
251 if hir_id.owner != local_id_root.index {
252 ty::tls::with(|tcx| {
253 let node_id = tcx.hir.hir_to_node_id(hir_id);
255 bug!("node {} with HirId::owner {:?} cannot be placed in \
256 TypeckTables with local_id_root {:?}",
257 tcx.hir.node_to_string(node_id),
258 DefId::local(hir_id.owner),
263 // We use "Null Object" TypeckTables in some of the analysis passes.
264 // These are just expected to be empty and their `local_id_root` is
265 // `None`. Therefore we cannot verify whether a given `HirId` would
266 // be a valid key for the given table. Instead we make sure that
267 // nobody tries to write to such a Null Object table.
269 bug!("access to invalid TypeckTables")
275 impl<'a, V> LocalTableInContext<'a, V> {
276 pub fn contains_key(&self, id: hir::HirId) -> bool {
277 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
278 self.data.contains_key(&id.local_id)
281 pub fn get(&self, id: hir::HirId) -> Option<&V> {
282 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
283 self.data.get(&id.local_id)
286 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
291 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
294 fn index(&self, key: hir::HirId) -> &V {
295 self.get(key).expect("LocalTableInContext: key not found")
299 pub struct LocalTableInContextMut<'a, V: 'a> {
300 local_id_root: Option<DefId>,
301 data: &'a mut ItemLocalMap<V>
304 impl<'a, V> LocalTableInContextMut<'a, V> {
305 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
306 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
307 self.data.get_mut(&id.local_id)
310 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
311 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
312 self.data.entry(id.local_id)
315 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
316 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
317 self.data.insert(id.local_id, val)
320 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
321 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
322 self.data.remove(&id.local_id)
326 #[derive(RustcEncodable, RustcDecodable, Debug)]
327 pub struct TypeckTables<'tcx> {
328 /// The HirId::owner all ItemLocalIds in this table are relative to.
329 pub local_id_root: Option<DefId>,
331 /// Resolved definitions for `<T>::X` associated paths and
332 /// method calls, including those of overloaded operators.
333 type_dependent_defs: ItemLocalMap<Def>,
335 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
336 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
337 /// about the field you also need definition of the variant to which the field
338 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
339 field_indices: ItemLocalMap<usize>,
341 /// Stores the types for various nodes in the AST. Note that this table
342 /// is not guaranteed to be populated until after typeck. See
343 /// typeck::check::fn_ctxt for details.
344 node_types: ItemLocalMap<Ty<'tcx>>,
346 /// Stores the type parameters which were substituted to obtain the type
347 /// of this node. This only applies to nodes that refer to entities
348 /// parameterized by type parameters, such as generic fns, types, or
350 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
352 /// Stores the canonicalized types provided by the user. See also
353 /// `AscribeUserType` statement in MIR.
354 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
356 /// Stores the canonicalized types provided by the user. See also
357 /// `AscribeUserType` statement in MIR.
358 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
360 /// Stores the substitutions that the user explicitly gave (if any)
361 /// attached to `id`. These will not include any inferred
362 /// values. The canonical form is used to capture things like `_`
363 /// or other unspecified values.
367 /// If the user wrote `foo.collect::<Vec<_>>()`, then the
368 /// canonical substitutions would include only `for<X> { Vec<X>
370 user_substs: ItemLocalMap<CanonicalUserSubsts<'tcx>>,
372 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
374 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
375 pat_binding_modes: ItemLocalMap<BindingMode>,
377 /// Stores the types which were implicitly dereferenced in pattern binding modes
378 /// for later usage in HAIR lowering. For example,
381 /// match &&Some(5i32) {
386 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
389 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
390 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
393 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
395 /// Records the reasons that we picked the kind of each closure;
396 /// not all closures are present in the map.
397 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
399 /// For each fn, records the "liberated" types of its arguments
400 /// and return type. Liberated means that all bound regions
401 /// (including late-bound regions) are replaced with free
402 /// equivalents. This table is not used in codegen (since regions
403 /// are erased there) and hence is not serialized to metadata.
404 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
406 /// For each FRU expression, record the normalized types of the fields
407 /// of the struct - this is needed because it is non-trivial to
408 /// normalize while preserving regions. This table is used only in
409 /// MIR construction and hence is not serialized to metadata.
410 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
412 /// Maps a cast expression to its kind. This is keyed on the
413 /// *from* expression of the cast, not the cast itself.
414 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
416 /// Set of trait imports actually used in the method resolution.
417 /// This is used for warning unused imports. During type
418 /// checking, this `Lrc` should not be cloned: it must have a ref-count
419 /// of 1 so that we can insert things into the set mutably.
420 pub used_trait_imports: Lrc<DefIdSet>,
422 /// If any errors occurred while type-checking this body,
423 /// this field will be set to `true`.
424 pub tainted_by_errors: bool,
426 /// Stores the free-region relationships that were deduced from
427 /// its where clauses and parameter types. These are then
428 /// read-again by borrowck.
429 pub free_region_map: FreeRegionMap<'tcx>,
431 /// All the existential types that are restricted to concrete types
433 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
436 impl<'tcx> TypeckTables<'tcx> {
437 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
440 type_dependent_defs: Default::default(),
441 field_indices: Default::default(),
442 user_provided_tys: Default::default(),
443 user_provided_sigs: Default::default(),
444 node_types: Default::default(),
445 node_substs: Default::default(),
446 user_substs: Default::default(),
447 adjustments: Default::default(),
448 pat_binding_modes: Default::default(),
449 pat_adjustments: Default::default(),
450 upvar_capture_map: Default::default(),
451 closure_kind_origins: Default::default(),
452 liberated_fn_sigs: Default::default(),
453 fru_field_types: Default::default(),
454 cast_kinds: Default::default(),
455 used_trait_imports: Lrc::new(Default::default()),
456 tainted_by_errors: false,
457 free_region_map: Default::default(),
458 concrete_existential_types: Default::default(),
462 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
463 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
465 hir::QPath::Resolved(_, ref path) => path.def,
466 hir::QPath::TypeRelative(..) => {
467 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
468 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
473 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
474 LocalTableInContext {
475 local_id_root: self.local_id_root,
476 data: &self.type_dependent_defs
480 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
481 LocalTableInContextMut {
482 local_id_root: self.local_id_root,
483 data: &mut self.type_dependent_defs
487 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
488 LocalTableInContext {
489 local_id_root: self.local_id_root,
490 data: &self.field_indices
494 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
495 LocalTableInContextMut {
496 local_id_root: self.local_id_root,
497 data: &mut self.field_indices
501 pub fn user_provided_tys(&self) -> LocalTableInContext<'_, CanonicalTy<'tcx>> {
502 LocalTableInContext {
503 local_id_root: self.local_id_root,
504 data: &self.user_provided_tys
508 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalTy<'tcx>> {
509 LocalTableInContextMut {
510 local_id_root: self.local_id_root,
511 data: &mut self.user_provided_tys
515 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
516 LocalTableInContext {
517 local_id_root: self.local_id_root,
518 data: &self.node_types
522 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
523 LocalTableInContextMut {
524 local_id_root: self.local_id_root,
525 data: &mut self.node_types
529 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
530 self.node_id_to_type_opt(id).unwrap_or_else(||
531 bug!("node_id_to_type: no type for node `{}`",
533 let id = tcx.hir.hir_to_node_id(id);
534 tcx.hir.node_to_string(id)
539 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
540 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
541 self.node_types.get(&id.local_id).cloned()
544 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
545 LocalTableInContextMut {
546 local_id_root: self.local_id_root,
547 data: &mut self.node_substs
551 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
552 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
553 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
556 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
557 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
558 self.node_substs.get(&id.local_id).cloned()
561 pub fn user_substs_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalUserSubsts<'tcx>> {
562 LocalTableInContextMut {
563 local_id_root: self.local_id_root,
564 data: &mut self.user_substs
568 pub fn user_substs(&self, id: hir::HirId) -> Option<CanonicalUserSubsts<'tcx>> {
569 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
570 self.user_substs.get(&id.local_id).cloned()
573 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
574 // doesn't provide type parameter substitutions.
575 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
576 self.node_id_to_type(pat.hir_id)
579 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
580 self.node_id_to_type_opt(pat.hir_id)
583 // Returns the type of an expression as a monotype.
585 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
586 // some cases, we insert `Adjustment` annotations such as auto-deref or
587 // auto-ref. The type returned by this function does not consider such
588 // adjustments. See `expr_ty_adjusted()` instead.
590 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
591 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
592 // instead of "fn(ty) -> T with T = isize".
593 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
594 self.node_id_to_type(expr.hir_id)
597 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
598 self.node_id_to_type_opt(expr.hir_id)
601 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
602 LocalTableInContext {
603 local_id_root: self.local_id_root,
604 data: &self.adjustments
608 pub fn adjustments_mut(&mut self)
609 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
610 LocalTableInContextMut {
611 local_id_root: self.local_id_root,
612 data: &mut self.adjustments
616 pub fn expr_adjustments(&self, expr: &hir::Expr)
617 -> &[ty::adjustment::Adjustment<'tcx>] {
618 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
619 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
622 /// Returns the type of `expr`, considering any `Adjustment`
623 /// entry recorded for that expression.
624 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
625 self.expr_adjustments(expr)
627 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
630 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
631 self.expr_adjustments(expr)
633 .map(|adj| adj.target)
634 .or_else(|| self.expr_ty_opt(expr))
637 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
638 // Only paths and method calls/overloaded operators have
639 // entries in type_dependent_defs, ignore the former here.
640 if let hir::ExprKind::Path(_) = expr.node {
644 match self.type_dependent_defs().get(expr.hir_id) {
645 Some(&Def::Method(_)) => true,
650 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
651 LocalTableInContext {
652 local_id_root: self.local_id_root,
653 data: &self.pat_binding_modes
657 pub fn pat_binding_modes_mut(&mut self)
658 -> LocalTableInContextMut<'_, BindingMode> {
659 LocalTableInContextMut {
660 local_id_root: self.local_id_root,
661 data: &mut self.pat_binding_modes
665 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
666 LocalTableInContext {
667 local_id_root: self.local_id_root,
668 data: &self.pat_adjustments,
672 pub fn pat_adjustments_mut(&mut self)
673 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
674 LocalTableInContextMut {
675 local_id_root: self.local_id_root,
676 data: &mut self.pat_adjustments,
680 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
681 self.upvar_capture_map[&upvar_id]
684 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
685 LocalTableInContext {
686 local_id_root: self.local_id_root,
687 data: &self.closure_kind_origins
691 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
692 LocalTableInContextMut {
693 local_id_root: self.local_id_root,
694 data: &mut self.closure_kind_origins
698 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
699 LocalTableInContext {
700 local_id_root: self.local_id_root,
701 data: &self.liberated_fn_sigs
705 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
706 LocalTableInContextMut {
707 local_id_root: self.local_id_root,
708 data: &mut self.liberated_fn_sigs
712 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
713 LocalTableInContext {
714 local_id_root: self.local_id_root,
715 data: &self.fru_field_types
719 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
720 LocalTableInContextMut {
721 local_id_root: self.local_id_root,
722 data: &mut self.fru_field_types
726 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
727 LocalTableInContext {
728 local_id_root: self.local_id_root,
729 data: &self.cast_kinds
733 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
734 LocalTableInContextMut {
735 local_id_root: self.local_id_root,
736 data: &mut self.cast_kinds
741 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
742 fn hash_stable<W: StableHasherResult>(&self,
743 hcx: &mut StableHashingContext<'a>,
744 hasher: &mut StableHasher<W>) {
745 let ty::TypeckTables {
747 ref type_dependent_defs,
749 ref user_provided_tys,
750 ref user_provided_sigs,
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 user_provided_sigs.hash_stable(hcx, hasher);
775 node_types.hash_stable(hcx, hasher);
776 node_substs.hash_stable(hcx, hasher);
777 user_substs.hash_stable(hcx, hasher);
778 adjustments.hash_stable(hcx, hasher);
779 pat_binding_modes.hash_stable(hcx, hasher);
780 pat_adjustments.hash_stable(hcx, hasher);
781 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
788 local_id_root.expect("trying to hash invalid TypeckTables");
790 let var_owner_def_id = DefId {
791 krate: local_id_root.krate,
792 index: var_path.hir_id.owner,
794 let closure_def_id = DefId {
795 krate: local_id_root.krate,
796 index: closure_expr_id.to_def_id().index,
798 (hcx.def_path_hash(var_owner_def_id),
799 var_path.hir_id.local_id,
800 hcx.def_path_hash(closure_def_id))
803 closure_kind_origins.hash_stable(hcx, hasher);
804 liberated_fn_sigs.hash_stable(hcx, hasher);
805 fru_field_types.hash_stable(hcx, hasher);
806 cast_kinds.hash_stable(hcx, hasher);
807 used_trait_imports.hash_stable(hcx, hasher);
808 tainted_by_errors.hash_stable(hcx, hasher);
809 free_region_map.hash_stable(hcx, hasher);
810 concrete_existential_types.hash_stable(hcx, hasher);
815 impl<'tcx> CommonTypes<'tcx> {
816 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
817 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
818 let mk_region = |r| {
819 interners.region.borrow_mut().intern(r, |r| {
820 Interned(interners.arena.alloc(r))
825 unit: mk(Tuple(List::empty())),
830 isize: mk(Int(ast::IntTy::Isize)),
831 i8: mk(Int(ast::IntTy::I8)),
832 i16: mk(Int(ast::IntTy::I16)),
833 i32: mk(Int(ast::IntTy::I32)),
834 i64: mk(Int(ast::IntTy::I64)),
835 i128: mk(Int(ast::IntTy::I128)),
836 usize: mk(Uint(ast::UintTy::Usize)),
837 u8: mk(Uint(ast::UintTy::U8)),
838 u16: mk(Uint(ast::UintTy::U16)),
839 u32: mk(Uint(ast::UintTy::U32)),
840 u64: mk(Uint(ast::UintTy::U64)),
841 u128: mk(Uint(ast::UintTy::U128)),
842 f32: mk(Float(ast::FloatTy::F32)),
843 f64: mk(Float(ast::FloatTy::F64)),
845 re_empty: mk_region(RegionKind::ReEmpty),
846 re_static: mk_region(RegionKind::ReStatic),
847 re_erased: mk_region(RegionKind::ReErased),
852 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
855 pub struct FreeRegionInfo {
856 // def id corresponding to FreeRegion
858 // the bound region corresponding to FreeRegion
859 pub boundregion: ty::BoundRegion,
860 // checks if bound region is in Impl Item
861 pub is_impl_item: bool,
864 /// The central data structure of the compiler. It stores references
865 /// to the various **arenas** and also houses the results of the
866 /// various **compiler queries** that have been performed. See the
867 /// [rustc guide] for more details.
869 /// [rustc guide]: https://rust-lang.github.io/rustc-guide/ty.html
870 #[derive(Copy, Clone)]
871 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
872 gcx: &'a GlobalCtxt<'gcx>,
873 interners: &'a CtxtInterners<'tcx>
876 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
877 type Target = &'a GlobalCtxt<'gcx>;
879 fn deref(&self) -> &Self::Target {
884 pub struct GlobalCtxt<'tcx> {
885 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
886 global_interners: CtxtInterners<'tcx>,
888 cstore: &'tcx CrateStoreDyn,
890 pub sess: &'tcx Session,
892 pub dep_graph: DepGraph,
894 /// Common types, pre-interned for your convenience.
895 pub types: CommonTypes<'tcx>,
897 /// Map indicating what traits are in scope for places where this
898 /// is relevant; generated by resolve.
899 trait_map: FxHashMap<DefIndex,
900 Lrc<FxHashMap<ItemLocalId,
901 Lrc<StableVec<TraitCandidate>>>>>,
903 /// Export map produced by name resolution.
904 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
906 pub hir: hir_map::Map<'tcx>,
908 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
909 /// as well as all upstream crates. Only populated in incremental mode.
910 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
912 pub(crate) queries: query::Queries<'tcx>,
914 // Records the free variables referenced by every closure
915 // expression. Do not track deps for this, just recompute it from
916 // scratch every time.
917 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
919 maybe_unused_trait_imports: FxHashSet<DefId>,
920 maybe_unused_extern_crates: Vec<(DefId, Span)>,
921 /// Extern prelude entries. The value is `true` if the entry was introduced
922 /// via `extern crate` item and not `--extern` option or compiler built-in.
923 pub extern_prelude: FxHashMap<ast::Name, bool>,
925 // Internal cache for metadata decoding. No need to track deps on this.
926 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
928 /// Caches the results of trait selection. This cache is used
929 /// for things that do not have to do with the parameters in scope.
930 pub selection_cache: traits::SelectionCache<'tcx>,
932 /// Caches the results of trait evaluation. This cache is used
933 /// for things that do not have to do with the parameters in scope.
934 /// Merge this with `selection_cache`?
935 pub evaluation_cache: traits::EvaluationCache<'tcx>,
937 /// The definite name of the current crate after taking into account
938 /// attributes, commandline parameters, etc.
939 pub crate_name: Symbol,
941 /// Data layout specification for the current target.
942 pub data_layout: TargetDataLayout,
944 stability_interner: Lock<FxHashMap<&'tcx attr::Stability, ()>>,
946 /// Stores the value of constants (and deduplicates the actual memory)
947 allocation_interner: Lock<FxHashMap<&'tcx Allocation, ()>>,
949 pub alloc_map: Lock<interpret::AllocMap<'tcx, &'tcx Allocation>>,
951 layout_interner: Lock<FxHashMap<&'tcx LayoutDetails, ()>>,
953 /// A general purpose channel to throw data out the back towards LLVM worker
956 /// This is intended to only get used during the codegen phase of the compiler
957 /// when satisfying the query for a particular codegen unit. Internally in
958 /// the query it'll send data along this channel to get processed later.
959 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
961 output_filenames: Arc<OutputFilenames>,
964 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
965 /// Get the global TyCtxt.
967 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
970 interners: &self.gcx.global_interners,
974 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
975 self.global_arenas.generics.alloc(generics)
978 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
979 self.global_arenas.steal_mir.alloc(Steal::new(mir))
982 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
983 self.global_arenas.mir.alloc(mir)
986 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
987 self.global_arenas.tables.alloc(tables)
990 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
991 self.global_arenas.trait_def.alloc(def)
994 pub fn alloc_adt_def(self,
997 variants: IndexVec<VariantIdx, ty::VariantDef>,
999 -> &'gcx ty::AdtDef {
1000 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1001 self.global_arenas.adt_def.alloc(def)
1004 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1005 if bytes.is_empty() {
1008 self.global_interners.arena.alloc_slice(bytes)
1012 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1013 -> &'tcx [&'tcx ty::Const<'tcx>] {
1014 if values.is_empty() {
1017 self.interners.arena.alloc_slice(values)
1021 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1022 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1023 if values.is_empty() {
1026 self.interners.arena.alloc_slice(values)
1030 pub fn intern_const_alloc(
1033 ) -> &'gcx Allocation {
1034 self.allocation_interner.borrow_mut().intern(alloc, |alloc| {
1035 self.global_arenas.const_allocs.alloc(alloc)
1039 /// Allocates a byte or string literal for `mir::interpret`, read-only
1040 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1041 // create an allocation that just contains these bytes
1042 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes, ());
1043 let alloc = self.intern_const_alloc(alloc);
1044 self.alloc_map.lock().allocate(alloc)
1047 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1048 self.stability_interner.borrow_mut().intern(stab, |stab| {
1049 self.global_interners.arena.alloc(stab)
1053 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1054 self.layout_interner.borrow_mut().intern(layout, |layout| {
1055 self.global_arenas.layout.alloc(layout)
1059 /// Returns a range of the start/end indices specified with the
1060 /// `rustc_layout_scalar_valid_range` attribute.
1061 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1062 let attrs = self.get_attrs(def_id);
1064 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1066 None => return Bound::Unbounded,
1068 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1069 match meta.literal().expect("attribute takes lit").node {
1070 ast::LitKind::Int(a, _) => return Bound::Included(a),
1071 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1074 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1076 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1079 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1080 value.lift_to_tcx(self)
1083 /// Like lift, but only tries in the global tcx.
1084 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1085 value.lift_to_tcx(self.global_tcx())
1088 /// Returns true if self is the same as self.global_tcx().
1089 fn is_global(self) -> bool {
1090 let local = self.interners as *const _;
1091 let global = &self.global_interners as *const _;
1092 local as usize == global as usize
1095 /// Create a type context and call the closure with a `TyCtxt` reference
1096 /// to the context. The closure enforces that the type context and any interned
1097 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1098 /// reference to the context, to allow formatting values that need it.
1099 pub fn create_and_enter<F, R>(s: &'tcx Session,
1100 cstore: &'tcx CrateStoreDyn,
1101 local_providers: ty::query::Providers<'tcx>,
1102 extern_providers: ty::query::Providers<'tcx>,
1103 arenas: &'tcx AllArenas<'tcx>,
1104 resolutions: ty::Resolutions,
1105 hir: hir_map::Map<'tcx>,
1106 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1108 tx: mpsc::Sender<Box<dyn Any + Send>>,
1109 output_filenames: &OutputFilenames,
1111 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1113 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1116 let interners = CtxtInterners::new(&arenas.interner);
1117 let common_types = CommonTypes::new(&interners);
1118 let dep_graph = hir.dep_graph.clone();
1119 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1120 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1121 providers[LOCAL_CRATE] = local_providers;
1123 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1124 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1127 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1130 let def_path_tables = || {
1131 upstream_def_path_tables
1133 .map(|&(cnum, ref rc)| (cnum, &**rc))
1134 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1137 // Precompute the capacity of the hashmap so we don't have to
1138 // re-allocate when populating it.
1139 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1141 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1143 ::std::default::Default::default()
1146 for (cnum, def_path_table) in def_path_tables() {
1147 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1155 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1156 for (k, v) in resolutions.trait_map {
1157 let hir_id = hir.node_to_hir_id(k);
1158 let map = trait_map.entry(hir_id.owner).or_default();
1159 Lrc::get_mut(map).unwrap()
1160 .insert(hir_id.local_id,
1161 Lrc::new(StableVec::new(v)));
1164 let gcx = &GlobalCtxt {
1167 global_arenas: &arenas.global,
1168 global_interners: interners,
1170 types: common_types,
1172 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1175 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1176 (hir.local_def_id(k), Lrc::new(v))
1178 maybe_unused_trait_imports:
1179 resolutions.maybe_unused_trait_imports
1181 .map(|id| hir.local_def_id(id))
1183 maybe_unused_extern_crates:
1184 resolutions.maybe_unused_extern_crates
1186 .map(|(id, sp)| (hir.local_def_id(id), sp))
1188 extern_prelude: resolutions.extern_prelude,
1190 def_path_hash_to_def_id,
1191 queries: query::Queries::new(
1194 on_disk_query_result_cache,
1196 rcache: Default::default(),
1197 selection_cache: Default::default(),
1198 evaluation_cache: Default::default(),
1199 crate_name: Symbol::intern(crate_name),
1201 layout_interner: Default::default(),
1202 stability_interner: Default::default(),
1203 allocation_interner: Default::default(),
1204 alloc_map: Lock::new(interpret::AllocMap::new()),
1205 tx_to_llvm_workers: Lock::new(tx),
1206 output_filenames: Arc::new(output_filenames.clone()),
1209 sync::assert_send_val(&gcx);
1211 tls::enter_global(gcx, f)
1214 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1215 let cname = self.crate_name(LOCAL_CRATE).as_str();
1216 self.sess.consider_optimizing(&cname, msg)
1219 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1220 self.get_lib_features(LOCAL_CRATE)
1223 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1224 self.get_lang_items(LOCAL_CRATE)
1227 /// Due to missing llvm support for lowering 128 bit math to software emulation
1228 /// (on some targets), the lowering can be done in MIR.
1230 /// This function only exists until said support is implemented.
1231 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1232 let items = self.lang_items();
1233 let def_id = Some(def_id);
1234 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1235 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1236 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1237 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1238 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1239 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1240 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1241 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1242 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1243 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1244 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1245 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1246 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1247 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1248 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1249 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1250 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1251 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1252 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1253 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1254 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1255 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1256 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1257 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1261 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1262 self.stability_index(LOCAL_CRATE)
1265 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1266 self.all_crate_nums(LOCAL_CRATE)
1269 pub fn features(self) -> Lrc<feature_gate::Features> {
1270 self.features_query(LOCAL_CRATE)
1273 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1275 self.hir.def_key(id)
1277 self.cstore.def_key(id)
1281 /// Convert a `DefId` into its fully expanded `DefPath` (every
1282 /// `DefId` is really just an interned def-path).
1284 /// Note that if `id` is not local to this crate, the result will
1285 /// be a non-local `DefPath`.
1286 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1288 self.hir.def_path(id)
1290 self.cstore.def_path(id)
1295 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1296 if def_id.is_local() {
1297 self.hir.definitions().def_path_hash(def_id.index)
1299 self.cstore.def_path_hash(def_id)
1303 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1304 // We are explicitly not going through queries here in order to get
1305 // crate name and disambiguator since this code is called from debug!()
1306 // statements within the query system and we'd run into endless
1307 // recursion otherwise.
1308 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1309 (self.crate_name.clone(),
1310 self.sess.local_crate_disambiguator())
1312 (self.cstore.crate_name_untracked(def_id.krate),
1313 self.cstore.crate_disambiguator_untracked(def_id.krate))
1318 // Don't print the whole crate disambiguator. That's just
1319 // annoying in debug output.
1320 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1321 self.def_path(def_id).to_string_no_crate())
1324 pub fn metadata_encoding_version(self) -> Vec<u8> {
1325 self.cstore.metadata_encoding_version().to_vec()
1328 // Note that this is *untracked* and should only be used within the query
1329 // system if the result is otherwise tracked through queries
1330 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1331 self.cstore.crate_data_as_rc_any(cnum)
1334 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1335 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1337 StableHashingContext::new(self.sess,
1339 self.hir.definitions(),
1343 // This method makes sure that we have a DepNode and a Fingerprint for
1344 // every upstream crate. It needs to be called once right after the tcx is
1346 // With full-fledged red/green, the method will probably become unnecessary
1347 // as this will be done on-demand.
1348 pub fn allocate_metadata_dep_nodes(self) {
1349 // We cannot use the query versions of crates() and crate_hash(), since
1350 // those would need the DepNodes that we are allocating here.
1351 for cnum in self.cstore.crates_untracked() {
1352 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1353 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1354 self.dep_graph.with_task(dep_node,
1357 |_, x| x // No transformation needed
1362 // This method exercises the `in_scope_traits_map` query for all possible
1363 // values so that we have their fingerprints available in the DepGraph.
1364 // This is only required as long as we still use the old dependency tracking
1365 // which needs to have the fingerprints of all input nodes beforehand.
1366 pub fn precompute_in_scope_traits_hashes(self) {
1367 for &def_index in self.trait_map.keys() {
1368 self.in_scope_traits_map(def_index);
1372 pub fn serialize_query_result_cache<E>(self,
1374 -> Result<(), E::Error>
1375 where E: ty::codec::TyEncoder
1377 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1380 /// This checks whether one is allowed to have pattern bindings
1381 /// that bind-by-move on a match arm that has a guard, e.g.:
1384 /// match foo { A(inner) if { /* something */ } => ..., ... }
1387 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1388 /// because that method has a narrower effect that can be toggled
1389 /// off via a separate `-Z` flag, at least for the short term.
1390 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1391 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1394 /// If true, we should use a naive AST walk to determine if match
1395 /// guard could perform bad mutations (or mutable-borrows).
1396 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1397 // If someone requests the feature, then be a little more
1398 // careful and ensure that MIR-borrowck is enabled (which can
1399 // happen via edition selection, via `feature(nll)`, or via an
1400 // appropriate `-Z` flag) before disabling the mutation check.
1401 if self.allow_bind_by_move_patterns_with_guards() {
1408 /// If true, we should use the AST-based borrowck (we may *also* use
1409 /// the MIR-based borrowck).
1410 pub fn use_ast_borrowck(self) -> bool {
1411 self.borrowck_mode().use_ast()
1414 /// If true, we should use the MIR-based borrowck (we may *also* use
1415 /// the AST-based borrowck).
1416 pub fn use_mir_borrowck(self) -> bool {
1417 self.borrowck_mode().use_mir()
1420 /// If true, we should use the MIR-based borrow check, but also
1421 /// fall back on the AST borrow check if the MIR-based one errors.
1422 pub fn migrate_borrowck(self) -> bool {
1423 self.borrowck_mode().migrate()
1426 /// If true, make MIR codegen for `match` emit a temp that holds a
1427 /// borrow of the input to the match expression.
1428 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1429 self.emit_read_for_match()
1432 /// If true, make MIR codegen for `match` emit FakeRead
1433 /// statements (which simulate the maximal effect of executing the
1434 /// patterns in a match arm).
1435 pub fn emit_read_for_match(&self) -> bool {
1436 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1439 /// If true, pattern variables for use in guards on match arms
1440 /// will be bound as references to the data, and occurrences of
1441 /// those variables in the guard expression will implicitly
1442 /// dereference those bindings. (See rust-lang/rust#27282.)
1443 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1444 self.borrowck_mode().use_mir()
1447 /// If true, we should enable two-phase borrows checks. This is
1448 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1449 /// or by opting into an edition after 2015.
1450 pub fn two_phase_borrows(self) -> bool {
1451 self.sess.rust_2018() || self.features().nll ||
1452 self.sess.opts.debugging_opts.two_phase_borrows
1455 /// What mode(s) of borrowck should we run? AST? MIR? both?
1456 /// (Also considers the `#![feature(nll)]` setting.)
1457 pub fn borrowck_mode(&self) -> BorrowckMode {
1458 // Here are the main constraints we need to deal with:
1460 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1461 // synonymous with no `-Z borrowck=...` flag at all.
1462 // (This is arguably a historical accident.)
1464 // 2. `BorrowckMode::Migrate` is the limited migration to
1465 // NLL that we are deploying with the 2018 edition.
1467 // 3. We want to allow developers on the Nightly channel
1468 // to opt back into the "hard error" mode for NLL,
1469 // (which they can do via specifying `#![feature(nll)]`
1470 // explicitly in their crate).
1472 // So, this precedence list is how pnkfelix chose to work with
1473 // the above constraints:
1475 // * `#![feature(nll)]` *always* means use NLL with hard
1476 // errors. (To simplify the code here, it now even overrides
1477 // a user's attempt to specify `-Z borrowck=compare`, which
1478 // we arguably do not need anymore and should remove.)
1480 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1481 // if `borrowck=ast` was specified), then use the default
1482 // as required by the edition.
1484 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1486 if self.features().nll { return BorrowckMode::Mir; }
1488 match self.sess.opts.borrowck_mode {
1489 mode @ BorrowckMode::Mir |
1490 mode @ BorrowckMode::Compare |
1491 mode @ BorrowckMode::Migrate => mode,
1493 BorrowckMode::Ast => match self.sess.edition() {
1494 Edition::Edition2015 => BorrowckMode::Ast,
1495 Edition::Edition2018 => BorrowckMode::Migrate,
1497 // For now, future editions mean Migrate. (But it
1498 // would make a lot of sense for it to be changed to
1499 // `BorrowckMode::Mir`, depending on how we plan to
1500 // time the forcing of full migration to NLL.)
1501 _ => BorrowckMode::Migrate,
1507 pub fn local_crate_exports_generics(self) -> bool {
1508 debug_assert!(self.sess.opts.share_generics());
1510 self.sess.crate_types.borrow().iter().any(|crate_type| {
1512 CrateType::Executable |
1513 CrateType::Staticlib |
1514 CrateType::ProcMacro |
1515 CrateType::Cdylib => false,
1517 CrateType::Dylib => true,
1522 // This method returns the DefId and the BoundRegion corresponding to the given region.
1523 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1524 let (suitable_region_binding_scope, bound_region) = match *region {
1525 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1526 ty::ReEarlyBound(ref ebr) => (
1527 self.parent_def_id(ebr.def_id).unwrap(),
1528 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1530 _ => return None, // not a free region
1533 let node_id = self.hir
1534 .as_local_node_id(suitable_region_binding_scope)
1536 let is_impl_item = match self.hir.find(node_id) {
1537 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1538 Some(Node::ImplItem(..)) => {
1539 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1544 return Some(FreeRegionInfo {
1545 def_id: suitable_region_binding_scope,
1546 boundregion: bound_region,
1547 is_impl_item: is_impl_item,
1551 pub fn return_type_impl_trait(
1553 scope_def_id: DefId,
1554 ) -> Option<Ty<'tcx>> {
1555 // HACK: `type_of_def_id()` will fail on these (#55796), so return None
1556 let node_id = self.hir.as_local_node_id(scope_def_id).unwrap();
1557 match self.hir.get(node_id) {
1558 Node::Item(item) => {
1560 ItemKind::Fn(..) => { /* type_of_def_id() will work */ }
1566 _ => { /* type_of_def_id() will work or panic */ }
1569 let ret_ty = self.type_of(scope_def_id);
1571 ty::FnDef(_, _) => {
1572 let sig = ret_ty.fn_sig(*self);
1573 let output = self.erase_late_bound_regions(&sig.output());
1574 if output.is_impl_trait() {
1584 // Here we check if the bound region is in Impl Item.
1585 pub fn is_bound_region_in_impl_item(
1587 suitable_region_binding_scope: DefId,
1589 let container_id = self.associated_item(suitable_region_binding_scope)
1592 if self.impl_trait_ref(container_id).is_some() {
1593 // For now, we do not try to target impls of traits. This is
1594 // because this message is going to suggest that the user
1595 // change the fn signature, but they may not be free to do so,
1596 // since the signature must match the trait.
1598 // FIXME(#42706) -- in some cases, we could do better here.
1605 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1606 pub fn encode_metadata(self)
1609 self.cstore.encode_metadata(self)
1613 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1614 /// Call the closure with a local `TyCtxt` using the given arena.
1615 pub fn enter_local<F, R>(
1617 arena: &'tcx SyncDroplessArena,
1621 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1623 let interners = CtxtInterners::new(arena);
1626 interners: &interners,
1628 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1629 let new_icx = ty::tls::ImplicitCtxt {
1631 query: icx.query.clone(),
1632 layout_depth: icx.layout_depth,
1635 ty::tls::enter_context(&new_icx, |new_icx| {
1642 /// A trait implemented for all X<'a> types which can be safely and
1643 /// efficiently converted to X<'tcx> as long as they are part of the
1644 /// provided TyCtxt<'tcx>.
1645 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1646 /// by looking them up in their respective interners.
1648 /// However, this is still not the best implementation as it does
1649 /// need to compare the components, even for interned values.
1650 /// It would be more efficient if TypedArena provided a way to
1651 /// determine whether the address is in the allocated range.
1653 /// None is returned if the value or one of the components is not part
1654 /// of the provided context.
1655 /// For Ty, None can be returned if either the type interner doesn't
1656 /// contain the TyKind key or if the address of the interned
1657 /// pointer differs. The latter case is possible if a primitive type,
1658 /// e.g. `()` or `u8`, was interned in a different context.
1659 pub trait Lift<'tcx>: fmt::Debug {
1660 type Lifted: fmt::Debug + 'tcx;
1661 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1664 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1665 type Lifted = Ty<'tcx>;
1666 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1667 if tcx.interners.arena.in_arena(*self as *const _) {
1668 return Some(unsafe { mem::transmute(*self) });
1670 // Also try in the global tcx if we're not that.
1671 if !tcx.is_global() {
1672 self.lift_to_tcx(tcx.global_tcx())
1679 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1680 type Lifted = Region<'tcx>;
1681 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1682 if tcx.interners.arena.in_arena(*self as *const _) {
1683 return Some(unsafe { mem::transmute(*self) });
1685 // Also try in the global tcx if we're not that.
1686 if !tcx.is_global() {
1687 self.lift_to_tcx(tcx.global_tcx())
1694 impl<'a, 'tcx> Lift<'tcx> for Goal<'a> {
1695 type Lifted = Goal<'tcx>;
1696 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Goal<'tcx>> {
1697 if tcx.interners.arena.in_arena(*self as *const _) {
1698 return Some(unsafe { mem::transmute(*self) });
1700 // Also try in the global tcx if we're not that.
1701 if !tcx.is_global() {
1702 self.lift_to_tcx(tcx.global_tcx())
1709 impl<'a, 'tcx> Lift<'tcx> for &'a List<Goal<'a>> {
1710 type Lifted = &'tcx List<Goal<'tcx>>;
1711 fn lift_to_tcx<'b, 'gcx>(
1713 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1714 ) -> Option<&'tcx List<Goal<'tcx>>> {
1715 if tcx.interners.arena.in_arena(*self as *const _) {
1716 return Some(unsafe { mem::transmute(*self) });
1718 // Also try in the global tcx if we're not that.
1719 if !tcx.is_global() {
1720 self.lift_to_tcx(tcx.global_tcx())
1727 impl<'a, 'tcx> Lift<'tcx> for &'a List<Clause<'a>> {
1728 type Lifted = &'tcx List<Clause<'tcx>>;
1729 fn lift_to_tcx<'b, 'gcx>(
1731 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1732 ) -> Option<&'tcx List<Clause<'tcx>>> {
1733 if tcx.interners.arena.in_arena(*self as *const _) {
1734 return Some(unsafe { mem::transmute(*self) });
1736 // Also try in the global tcx if we're not that.
1737 if !tcx.is_global() {
1738 self.lift_to_tcx(tcx.global_tcx())
1745 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1746 type Lifted = &'tcx Const<'tcx>;
1747 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1748 if tcx.interners.arena.in_arena(*self as *const _) {
1749 return Some(unsafe { mem::transmute(*self) });
1751 // Also try in the global tcx if we're not that.
1752 if !tcx.is_global() {
1753 self.lift_to_tcx(tcx.global_tcx())
1760 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1761 type Lifted = &'tcx Substs<'tcx>;
1762 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1763 if self.len() == 0 {
1764 return Some(List::empty());
1766 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1767 return Some(unsafe { mem::transmute(*self) });
1769 // Also try in the global tcx if we're not that.
1770 if !tcx.is_global() {
1771 self.lift_to_tcx(tcx.global_tcx())
1778 impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>> {
1779 type Lifted = &'tcx List<Ty<'tcx>>;
1780 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1781 -> Option<&'tcx List<Ty<'tcx>>> {
1782 if self.len() == 0 {
1783 return Some(List::empty());
1785 if tcx.interners.arena.in_arena(*self as *const _) {
1786 return Some(unsafe { mem::transmute(*self) });
1788 // Also try in the global tcx if we're not that.
1789 if !tcx.is_global() {
1790 self.lift_to_tcx(tcx.global_tcx())
1797 impl<'a, 'tcx> Lift<'tcx> for &'a List<ExistentialPredicate<'a>> {
1798 type Lifted = &'tcx List<ExistentialPredicate<'tcx>>;
1799 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1800 -> Option<&'tcx List<ExistentialPredicate<'tcx>>> {
1801 if self.is_empty() {
1802 return Some(List::empty());
1804 if tcx.interners.arena.in_arena(*self as *const _) {
1805 return Some(unsafe { mem::transmute(*self) });
1807 // Also try in the global tcx if we're not that.
1808 if !tcx.is_global() {
1809 self.lift_to_tcx(tcx.global_tcx())
1816 impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>> {
1817 type Lifted = &'tcx List<Predicate<'tcx>>;
1818 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1819 -> Option<&'tcx List<Predicate<'tcx>>> {
1820 if self.is_empty() {
1821 return Some(List::empty());
1823 if tcx.interners.arena.in_arena(*self as *const _) {
1824 return Some(unsafe { mem::transmute(*self) });
1826 // Also try in the global tcx if we're not that.
1827 if !tcx.is_global() {
1828 self.lift_to_tcx(tcx.global_tcx())
1835 impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo> {
1836 type Lifted = &'tcx List<CanonicalVarInfo>;
1837 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1838 if self.len() == 0 {
1839 return Some(List::empty());
1841 if tcx.interners.arena.in_arena(*self as *const _) {
1842 return Some(unsafe { mem::transmute(*self) });
1844 // Also try in the global tcx if we're not that.
1845 if !tcx.is_global() {
1846 self.lift_to_tcx(tcx.global_tcx())
1853 impl<'a, 'tcx> Lift<'tcx> for &'a List<ProjectionKind<'a>> {
1854 type Lifted = &'tcx List<ProjectionKind<'tcx>>;
1855 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1856 if self.len() == 0 {
1857 return Some(List::empty());
1859 if tcx.interners.arena.in_arena(*self as *const _) {
1860 return Some(unsafe { mem::transmute(*self) });
1862 // Also try in the global tcx if we're not that.
1863 if !tcx.is_global() {
1864 self.lift_to_tcx(tcx.global_tcx())
1872 use super::{GlobalCtxt, TyCtxt};
1878 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1879 use rustc_data_structures::OnDrop;
1880 use rustc_data_structures::sync::{self, Lrc, Lock};
1881 use dep_graph::OpenTask;
1883 #[cfg(not(parallel_queries))]
1884 use std::cell::Cell;
1886 #[cfg(parallel_queries)]
1889 /// This is the implicit state of rustc. It contains the current
1890 /// TyCtxt and query. It is updated when creating a local interner or
1891 /// executing a new query. Whenever there's a TyCtxt value available
1892 /// you should also have access to an ImplicitCtxt through the functions
1895 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1896 /// The current TyCtxt. Initially created by `enter_global` and updated
1897 /// by `enter_local` with a new local interner
1898 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1900 /// The current query job, if any. This is updated by start_job in
1901 /// ty::query::plumbing when executing a query
1902 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1904 /// Used to prevent layout from recursing too deeply.
1905 pub layout_depth: usize,
1907 /// The current dep graph task. This is used to add dependencies to queries
1908 /// when executing them
1909 pub task: &'a OpenTask,
1912 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1913 /// to `value` during the call to `f`. It is restored to its previous value after.
1914 /// This is used to set the pointer to the new ImplicitCtxt.
1915 #[cfg(parallel_queries)]
1916 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1917 rayon_core::tlv::with(value, f)
1920 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1921 /// This is used to get the pointer to the current ImplicitCtxt.
1922 #[cfg(parallel_queries)]
1923 fn get_tlv() -> usize {
1924 rayon_core::tlv::get()
1927 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1928 #[cfg(not(parallel_queries))]
1929 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1931 /// Sets TLV to `value` during the call to `f`.
1932 /// It is restored to its previous value after.
1933 /// This is used to set the pointer to the new ImplicitCtxt.
1934 #[cfg(not(parallel_queries))]
1935 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1936 let old = get_tlv();
1937 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1938 TLV.with(|tlv| tlv.set(value));
1942 /// This is used to get the pointer to the current ImplicitCtxt.
1943 #[cfg(not(parallel_queries))]
1944 fn get_tlv() -> usize {
1945 TLV.with(|tlv| tlv.get())
1948 /// This is a callback from libsyntax as it cannot access the implicit state
1949 /// in librustc otherwise
1950 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1952 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
1956 /// This is a callback from libsyntax as it cannot access the implicit state
1957 /// in librustc otherwise. It is used to when diagnostic messages are
1958 /// emitted and stores them in the current query, if there is one.
1959 fn track_diagnostic(diagnostic: &Diagnostic) {
1960 with_context_opt(|icx| {
1961 if let Some(icx) = icx {
1962 if let Some(ref query) = icx.query {
1963 query.diagnostics.lock().push(diagnostic.clone());
1969 /// Sets up the callbacks from libsyntax on the current thread
1970 pub fn with_thread_locals<F, R>(f: F) -> R
1971 where F: FnOnce() -> R
1973 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1974 let original_span_debug = span_dbg.get();
1975 span_dbg.set(span_debug);
1977 let _on_drop = OnDrop(move || {
1978 span_dbg.set(original_span_debug);
1981 TRACK_DIAGNOSTICS.with(|current| {
1982 let original = current.get();
1983 current.set(track_diagnostic);
1985 let _on_drop = OnDrop(move || {
1986 current.set(original);
1994 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1995 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1997 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1999 set_tlv(context as *const _ as usize, || {
2004 /// Enters GlobalCtxt by setting up libsyntax callbacks and
2005 /// creating a initial TyCtxt and ImplicitCtxt.
2006 /// This happens once per rustc session and TyCtxts only exists
2007 /// inside the `f` function.
2008 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
2009 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
2011 with_thread_locals(|| {
2012 // Update GCX_PTR to indicate there's a GlobalCtxt available
2013 GCX_PTR.with(|lock| {
2014 *lock.lock() = gcx as *const _ as usize;
2016 // Set GCX_PTR back to 0 when we exit
2017 let _on_drop = OnDrop(move || {
2018 GCX_PTR.with(|lock| *lock.lock() = 0);
2023 interners: &gcx.global_interners,
2025 let icx = ImplicitCtxt {
2029 task: &OpenTask::Ignore,
2031 enter_context(&icx, |_| {
2037 /// Stores a pointer to the GlobalCtxt if one is available.
2038 /// This is used to access the GlobalCtxt in the deadlock handler
2040 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2042 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2043 /// This is used in the deadlock handler.
2044 pub unsafe fn with_global<F, R>(f: F) -> R
2045 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2047 let gcx = GCX_PTR.with(|lock| *lock.lock());
2049 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2052 interners: &gcx.global_interners,
2054 let icx = ImplicitCtxt {
2058 task: &OpenTask::Ignore,
2060 enter_context(&icx, |_| f(tcx))
2063 /// Allows access to the current ImplicitCtxt in a closure if one is available
2064 pub fn with_context_opt<F, R>(f: F) -> R
2065 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2067 let context = get_tlv();
2071 // We could get a ImplicitCtxt pointer from another thread.
2072 // Ensure that ImplicitCtxt is Sync
2073 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2075 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2079 /// Allows access to the current ImplicitCtxt.
2080 /// Panics if there is no ImplicitCtxt available
2081 pub fn with_context<F, R>(f: F) -> R
2082 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2084 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2087 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2088 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2089 /// with the same 'gcx lifetime as the TyCtxt passed in.
2090 /// This will panic if you pass it a TyCtxt which has a different global interner from
2091 /// the current ImplicitCtxt's tcx field.
2092 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2093 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2095 with_context(|context| {
2097 let gcx = tcx.gcx as *const _ as usize;
2098 assert!(context.tcx.gcx as *const _ as usize == gcx);
2099 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2105 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2106 /// interner and local interner as the tcx argument passed in. This means the closure
2107 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2108 /// This will panic if you pass it a TyCtxt which has a different global interner or
2109 /// a different local interner from the current ImplicitCtxt's tcx field.
2110 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2111 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2113 with_context(|context| {
2115 let gcx = tcx.gcx as *const _ as usize;
2116 let interners = tcx.interners as *const _ as usize;
2117 assert!(context.tcx.gcx as *const _ as usize == gcx);
2118 assert!(context.tcx.interners as *const _ as usize == interners);
2119 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2125 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2126 /// Panics if there is no ImplicitCtxt available
2127 pub fn with<F, R>(f: F) -> R
2128 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2130 with_context(|context| f(context.tcx))
2133 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2134 /// The closure is passed None if there is no ImplicitCtxt available
2135 pub fn with_opt<F, R>(f: F) -> R
2136 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2138 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2142 macro_rules! sty_debug_print {
2143 ($ctxt: expr, $($variant: ident),*) => {{
2144 // curious inner module to allow variant names to be used as
2146 #[allow(non_snake_case)]
2148 use ty::{self, TyCtxt};
2149 use ty::context::Interned;
2151 #[derive(Copy, Clone)]
2154 region_infer: usize,
2159 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2160 let mut total = DebugStat {
2162 region_infer: 0, ty_infer: 0, both_infer: 0,
2164 $(let mut $variant = total;)*
2166 for &Interned(t) in tcx.interners.type_.borrow().keys() {
2167 let variant = match t.sty {
2168 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2169 ty::Float(..) | ty::Str | ty::Never => continue,
2170 ty::Error => /* unimportant */ continue,
2171 $(ty::$variant(..) => &mut $variant,)*
2173 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2174 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2178 if region { total.region_infer += 1; variant.region_infer += 1 }
2179 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2180 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2182 println!("Ty interner total ty region both");
2183 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2184 {ty:4.1}% {region:5.1}% {both:4.1}%",
2185 stringify!($variant),
2186 uses = $variant.total,
2187 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2188 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2189 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2190 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2192 println!(" total {uses:6} \
2193 {ty:4.1}% {region:5.1}% {both:4.1}%",
2195 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2196 region = total.region_infer as f64 * 100.0 / total.total as f64,
2197 both = total.both_infer as f64 * 100.0 / total.total as f64)
2205 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2206 pub fn print_debug_stats(self) {
2209 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr, Placeholder,
2210 Generator, GeneratorWitness, Dynamic, Closure, Tuple, Bound,
2211 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2213 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2214 println!("Region interner: #{}", self.interners.region.borrow().len());
2215 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2216 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2217 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2222 /// An entry in an interner.
2223 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2225 impl<'tcx, T: 'tcx+?Sized> Clone for Interned<'tcx, T> {
2226 fn clone(&self) -> Self {
2230 impl<'tcx, T: 'tcx+?Sized> Copy for Interned<'tcx, T> {}
2232 // NB: An Interned<Ty> compares and hashes as a sty.
2233 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2234 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2235 self.0.sty == other.0.sty
2239 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2241 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2242 fn hash<H: Hasher>(&self, s: &mut H) {
2247 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2248 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2253 // NB: An Interned<List<T>> compares and hashes as its elements.
2254 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2255 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2256 self.0[..] == other.0[..]
2260 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2262 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2263 fn hash<H: Hasher>(&self, s: &mut H) {
2268 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2269 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2274 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2275 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2280 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2281 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2286 impl<'tcx: 'lcx, 'lcx> Borrow<[ProjectionKind<'lcx>]>
2287 for Interned<'tcx, List<ProjectionKind<'tcx>>> {
2288 fn borrow<'a>(&'a self) -> &'a [ProjectionKind<'lcx>] {
2293 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2294 fn borrow<'a>(&'a self) -> &'a RegionKind {
2299 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2300 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2305 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2306 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2307 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2312 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2313 for Interned<'tcx, List<Predicate<'tcx>>> {
2314 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2319 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2320 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2325 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2326 for Interned<'tcx, List<Clause<'tcx>>> {
2327 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2332 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2333 for Interned<'tcx, List<Goal<'tcx>>> {
2334 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2339 macro_rules! intern_method {
2340 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2343 $keep_in_local_tcx:expr) -> $ty:ty) => {
2344 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2345 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2346 let key = ($alloc_to_key)(&v);
2348 // HACK(eddyb) Depend on flags being accurate to
2349 // determine that all contents are in the global tcx.
2350 // See comments on Lift for why we can't use that.
2351 if ($keep_in_local_tcx)(&v) {
2352 self.interners.$name.borrow_mut().intern_ref(key, || {
2353 // Make sure we don't end up with inference
2354 // types/regions in the global tcx.
2355 if self.is_global() {
2356 bug!("Attempted to intern `{:?}` which contains \
2357 inference types/regions in the global type context",
2361 Interned($alloc_method(&self.interners.arena, v))
2364 self.global_interners.$name.borrow_mut().intern_ref(key, || {
2365 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2369 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2371 let i = unsafe { mem::transmute(i) };
2380 macro_rules! direct_interners {
2381 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2382 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2383 fn eq(&self, other: &Self) -> bool {
2388 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2390 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2391 fn hash<H: Hasher>(&self, s: &mut H) {
2399 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2401 $keep_in_local_tcx) -> $ty);)+
2405 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2406 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2409 direct_interners!('tcx,
2410 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2411 const_: mk_const(|c: &Const<'_>| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>,
2412 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>
2415 macro_rules! slice_interners {
2416 ($($field:ident: $method:ident($ty:ident)),+) => (
2417 $(intern_method!( 'tcx, $field: $method(
2419 |a, v| List::from_arena(a, v),
2421 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2426 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2427 predicates: _intern_predicates(Predicate),
2428 type_list: _intern_type_list(Ty),
2429 substs: _intern_substs(Kind),
2430 clauses: _intern_clauses(Clause),
2431 goal_list: _intern_goals(Goal),
2432 projs: _intern_projs(ProjectionKind)
2435 // This isn't a perfect fit: CanonicalVarInfo slices are always
2436 // allocated in the global arena, so this `intern_method!` macro is
2437 // overly general. But we just return false for the code that checks
2438 // whether they belong in the thread-local arena, so no harm done, and
2439 // seems better than open-coding the rest.
2442 canonical_var_infos: _intern_canonical_var_infos(
2443 &[CanonicalVarInfo],
2444 |a, v| List::from_arena(a, v),
2446 |_xs: &[CanonicalVarInfo]| -> bool { false }
2447 ) -> List<CanonicalVarInfo>
2450 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2451 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2452 /// that is, a `fn` type that is equivalent in every way for being
2454 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2455 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2456 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2457 unsafety: hir::Unsafety::Unsafe,
2462 /// Given a closure signature `sig`, returns an equivalent `fn`
2463 /// type with the same signature. Detuples and so forth -- so
2464 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2465 /// a `fn(u32, i32)`.
2466 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2467 let converted_sig = sig.map_bound(|s| {
2468 let params_iter = match s.inputs()[0].sty {
2469 ty::Tuple(params) => {
2470 params.into_iter().cloned()
2478 hir::Unsafety::Normal,
2483 self.mk_fn_ptr(converted_sig)
2487 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2488 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2491 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2493 ast::IntTy::Isize => self.types.isize,
2494 ast::IntTy::I8 => self.types.i8,
2495 ast::IntTy::I16 => self.types.i16,
2496 ast::IntTy::I32 => self.types.i32,
2497 ast::IntTy::I64 => self.types.i64,
2498 ast::IntTy::I128 => self.types.i128,
2502 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2504 ast::UintTy::Usize => self.types.usize,
2505 ast::UintTy::U8 => self.types.u8,
2506 ast::UintTy::U16 => self.types.u16,
2507 ast::UintTy::U32 => self.types.u32,
2508 ast::UintTy::U64 => self.types.u64,
2509 ast::UintTy::U128 => self.types.u128,
2513 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2515 ast::FloatTy::F32 => self.types.f32,
2516 ast::FloatTy::F64 => self.types.f64,
2521 pub fn mk_str(self) -> Ty<'tcx> {
2526 pub fn mk_static_str(self) -> Ty<'tcx> {
2527 self.mk_imm_ref(self.types.re_static, self.mk_str())
2531 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2532 // take a copy of substs so that we own the vectors inside
2533 self.mk_ty(Adt(def, substs))
2537 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2538 self.mk_ty(Foreign(def_id))
2541 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2542 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2543 let adt_def = self.adt_def(def_id);
2544 let substs = Substs::for_item(self, def_id, |param, substs| {
2546 GenericParamDefKind::Lifetime => bug!(),
2547 GenericParamDefKind::Type { has_default, .. } => {
2548 if param.index == 0 {
2551 assert!(has_default);
2552 self.type_of(param.def_id).subst(self, substs).into()
2557 self.mk_ty(Adt(adt_def, substs))
2561 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2562 self.mk_ty(RawPtr(tm))
2566 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2567 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2571 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2572 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2576 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2577 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2581 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2582 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2586 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2587 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2591 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2592 self.mk_imm_ptr(self.mk_unit())
2596 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2597 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2601 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2602 self.mk_ty(Slice(ty))
2606 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2607 self.mk_ty(Tuple(self.intern_type_list(ts)))
2610 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2611 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2615 pub fn mk_unit(self) -> Ty<'tcx> {
2620 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2621 if self.features().never_type {
2624 self.intern_tup(&[])
2629 pub fn mk_bool(self) -> Ty<'tcx> {
2634 pub fn mk_fn_def(self, def_id: DefId,
2635 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2636 self.mk_ty(FnDef(def_id, substs))
2640 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2641 self.mk_ty(FnPtr(fty))
2647 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2648 reg: ty::Region<'tcx>
2650 self.mk_ty(Dynamic(obj, reg))
2654 pub fn mk_projection(self,
2656 substs: &'tcx Substs<'tcx>)
2658 self.mk_ty(Projection(ProjectionTy {
2665 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2667 self.mk_ty(Closure(closure_id, closure_substs))
2671 pub fn mk_generator(self,
2673 generator_substs: GeneratorSubsts<'tcx>,
2674 movability: hir::GeneratorMovability)
2676 self.mk_ty(Generator(id, generator_substs, movability))
2680 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2681 self.mk_ty(GeneratorWitness(types))
2685 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2686 self.mk_infer(TyVar(v))
2690 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2691 self.mk_infer(IntVar(v))
2695 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2696 self.mk_infer(FloatVar(v))
2700 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2701 self.mk_ty(Infer(it))
2705 pub fn mk_ty_param(self,
2707 name: InternedString) -> Ty<'tcx> {
2708 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2712 pub fn mk_self_type(self) -> Ty<'tcx> {
2713 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2716 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2718 GenericParamDefKind::Lifetime => {
2719 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2721 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2726 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2727 self.mk_ty(Opaque(def_id, substs))
2730 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2731 -> &'tcx List<ExistentialPredicate<'tcx>> {
2732 assert!(!eps.is_empty());
2733 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2734 self._intern_existential_predicates(eps)
2737 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2738 -> &'tcx List<Predicate<'tcx>> {
2739 // FIXME consider asking the input slice to be sorted to avoid
2740 // re-interning permutations, in which case that would be asserted
2742 if preds.len() == 0 {
2743 // The macro-generated method below asserts we don't intern an empty slice.
2746 self._intern_predicates(preds)
2750 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2754 self._intern_type_list(ts)
2758 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2762 self._intern_substs(ts)
2766 pub fn intern_projs(self, ps: &[ProjectionKind<'tcx>]) -> &'tcx List<ProjectionKind<'tcx>> {
2770 self._intern_projs(ps)
2774 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2778 self.global_tcx()._intern_canonical_var_infos(ts)
2782 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2786 self._intern_clauses(ts)
2790 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2794 self._intern_goals(ts)
2798 pub fn mk_fn_sig<I>(self,
2802 unsafety: hir::Unsafety,
2804 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2806 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2808 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2809 inputs_and_output: self.intern_type_list(xs),
2810 variadic, unsafety, abi
2814 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2815 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2817 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2820 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2821 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2823 iter.intern_with(|xs| self.intern_predicates(xs))
2826 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2827 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2828 iter.intern_with(|xs| self.intern_type_list(xs))
2831 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2832 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2833 iter.intern_with(|xs| self.intern_substs(xs))
2836 pub fn mk_substs_trait(self,
2838 rest: &[Kind<'tcx>])
2839 -> &'tcx Substs<'tcx>
2841 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2844 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2845 iter.intern_with(|xs| self.intern_clauses(xs))
2848 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2849 iter.intern_with(|xs| self.intern_goals(xs))
2852 pub fn lint_hir<S: Into<MultiSpan>>(self,
2853 lint: &'static Lint,
2857 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2860 pub fn lint_node<S: Into<MultiSpan>>(self,
2861 lint: &'static Lint,
2865 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2868 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2869 lint: &'static Lint,
2874 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2879 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2880 lint: &'static Lint,
2885 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2890 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2891 -> (lint::Level, lint::LintSource)
2893 // Right now we insert a `with_ignore` node in the dep graph here to
2894 // ignore the fact that `lint_levels` below depends on the entire crate.
2895 // For now this'll prevent false positives of recompiling too much when
2896 // anything changes.
2898 // Once red/green incremental compilation lands we should be able to
2899 // remove this because while the crate changes often the lint level map
2900 // will change rarely.
2901 self.dep_graph.with_ignore(|| {
2902 let sets = self.lint_levels(LOCAL_CRATE);
2904 let hir_id = self.hir.definitions().node_to_hir_id(id);
2905 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2908 let next = self.hir.get_parent_node(id);
2910 bug!("lint traversal reached the root of the crate");
2917 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2918 lint: &'static Lint,
2922 -> DiagnosticBuilder<'tcx>
2924 let node_id = self.hir.hir_to_node_id(hir_id);
2925 let (level, src) = self.lint_level_at_node(lint, node_id);
2926 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2929 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2930 lint: &'static Lint,
2934 -> DiagnosticBuilder<'tcx>
2936 let (level, src) = self.lint_level_at_node(lint, id);
2937 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2940 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2941 -> DiagnosticBuilder<'tcx>
2943 let (level, src) = self.lint_level_at_node(lint, id);
2944 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2947 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2948 self.in_scope_traits_map(id.owner)
2949 .and_then(|map| map.get(&id.local_id).cloned())
2952 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2953 self.named_region_map(id.owner)
2954 .and_then(|map| map.get(&id.local_id).cloned())
2957 pub fn is_late_bound(self, id: HirId) -> bool {
2958 self.is_late_bound_map(id.owner)
2959 .map(|set| set.contains(&id.local_id))
2963 pub fn object_lifetime_defaults(self, id: HirId)
2964 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2966 self.object_lifetime_defaults_map(id.owner)
2967 .and_then(|map| map.get(&id.local_id).cloned())
2971 pub trait InternAs<T: ?Sized, R> {
2973 fn intern_with<F>(self, f: F) -> Self::Output
2974 where F: FnOnce(&T) -> R;
2977 impl<I, T, R, E> InternAs<[T], R> for I
2978 where E: InternIteratorElement<T, R>,
2979 I: Iterator<Item=E> {
2980 type Output = E::Output;
2981 fn intern_with<F>(self, f: F) -> Self::Output
2982 where F: FnOnce(&[T]) -> R {
2983 E::intern_with(self, f)
2987 pub trait InternIteratorElement<T, R>: Sized {
2989 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2992 impl<T, R> InternIteratorElement<T, R> for T {
2994 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2995 f(&iter.collect::<SmallVec<[_; 8]>>())
2999 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
3003 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3004 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
3008 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
3009 type Output = Result<R, E>;
3010 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3011 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
3015 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3016 // FIXME(#44234) - almost all of these queries have no sub-queries and
3017 // therefore no actual inputs, they're just reading tables calculated in
3018 // resolve! Does this work? Unsure! That's what the issue is about
3019 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
3020 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
3021 providers.crate_name = |tcx, id| {
3022 assert_eq!(id, LOCAL_CRATE);
3025 providers.get_lib_features = |tcx, id| {
3026 assert_eq!(id, LOCAL_CRATE);
3027 Lrc::new(middle::lib_features::collect(tcx))
3029 providers.get_lang_items = |tcx, id| {
3030 assert_eq!(id, LOCAL_CRATE);
3031 Lrc::new(middle::lang_items::collect(tcx))
3033 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3034 providers.maybe_unused_trait_import = |tcx, id| {
3035 tcx.maybe_unused_trait_imports.contains(&id)
3037 providers.maybe_unused_extern_crates = |tcx, cnum| {
3038 assert_eq!(cnum, LOCAL_CRATE);
3039 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3042 providers.stability_index = |tcx, cnum| {
3043 assert_eq!(cnum, LOCAL_CRATE);
3044 Lrc::new(stability::Index::new(tcx))
3046 providers.lookup_stability = |tcx, id| {
3047 assert_eq!(id.krate, LOCAL_CRATE);
3048 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3049 tcx.stability().local_stability(id)
3051 providers.lookup_deprecation_entry = |tcx, id| {
3052 assert_eq!(id.krate, LOCAL_CRATE);
3053 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3054 tcx.stability().local_deprecation_entry(id)
3056 providers.extern_mod_stmt_cnum = |tcx, id| {
3057 let id = tcx.hir.as_local_node_id(id).unwrap();
3058 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3060 providers.all_crate_nums = |tcx, cnum| {
3061 assert_eq!(cnum, LOCAL_CRATE);
3062 Lrc::new(tcx.cstore.crates_untracked())
3064 providers.postorder_cnums = |tcx, cnum| {
3065 assert_eq!(cnum, LOCAL_CRATE);
3066 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3068 providers.output_filenames = |tcx, cnum| {
3069 assert_eq!(cnum, LOCAL_CRATE);
3070 tcx.output_filenames.clone()
3072 providers.features_query = |tcx, cnum| {
3073 assert_eq!(cnum, LOCAL_CRATE);
3074 Lrc::new(tcx.sess.features_untracked().clone())
3076 providers.is_panic_runtime = |tcx, cnum| {
3077 assert_eq!(cnum, LOCAL_CRATE);
3078 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
3080 providers.is_compiler_builtins = |tcx, cnum| {
3081 assert_eq!(cnum, LOCAL_CRATE);
3082 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")