1 // Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! type context book-keeping
13 use dep_graph::DepGraph;
14 use dep_graph::{DepNode, DepConstructor};
15 use errors::DiagnosticBuilder;
17 use session::config::{BorrowckMode, OutputFilenames};
18 use session::config::CrateType;
20 use hir::{TraitCandidate, HirId, ItemLocalId, Node};
21 use hir::def::{Def, Export};
22 use hir::def_id::{CrateNum, DefId, DefIndex, LOCAL_CRATE};
23 use hir::map as hir_map;
24 use hir::map::DefPathHash;
25 use lint::{self, Lint};
26 use ich::{StableHashingContext, NodeIdHashingMode};
27 use infer::canonical::{CanonicalVarInfo, CanonicalVarInfos};
28 use infer::outlives::free_region_map::FreeRegionMap;
29 use middle::cstore::CrateStoreDyn;
30 use middle::cstore::EncodedMetadata;
31 use middle::lang_items;
32 use middle::resolve_lifetime::{self, ObjectLifetimeDefault};
33 use middle::stability;
34 use mir::{self, Mir, interpret, 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};
53 use ty::CanonicalPolyFnSig;
54 use util::nodemap::{DefIdMap, DefIdSet, ItemLocalMap};
55 use util::nodemap::{FxHashMap, FxHashSet};
56 use smallvec::SmallVec;
57 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
58 StableHasher, StableHasherResult,
60 use arena::{TypedArena, SyncDroplessArena};
61 use rustc_data_structures::indexed_vec::IndexVec;
62 use rustc_data_structures::sync::{self, Lrc, Lock, WorkerLocal};
64 use std::borrow::Borrow;
65 use std::cmp::Ordering;
66 use std::collections::hash_map::{self, Entry};
67 use std::hash::{Hash, Hasher};
70 use std::ops::{Deref, Bound};
74 use rustc_target::spec::abi;
75 use syntax::ast::{self, NodeId};
77 use syntax::source_map::MultiSpan;
78 use syntax::edition::Edition;
79 use syntax::feature_gate;
80 use syntax::symbol::{Symbol, keywords, InternedString};
85 pub struct AllArenas<'tcx> {
86 pub global: WorkerLocal<GlobalArenas<'tcx>>,
87 pub interner: SyncDroplessArena,
90 impl<'tcx> AllArenas<'tcx> {
91 pub fn new() -> Self {
93 global: WorkerLocal::new(|_| GlobalArenas::default()),
94 interner: SyncDroplessArena::default(),
101 pub struct GlobalArenas<'tcx> {
103 layout: TypedArena<LayoutDetails>,
106 generics: TypedArena<ty::Generics>,
107 trait_def: TypedArena<ty::TraitDef>,
108 adt_def: TypedArena<ty::AdtDef>,
109 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
110 mir: TypedArena<Mir<'tcx>>,
111 tables: TypedArena<ty::TypeckTables<'tcx>>,
113 const_allocs: TypedArena<interpret::Allocation>,
116 type InternedSet<'tcx, T> = Lock<FxHashSet<Interned<'tcx, T>>>;
118 pub struct CtxtInterners<'tcx> {
119 /// The arena that types, regions, etc are allocated from
120 arena: &'tcx SyncDroplessArena,
122 /// Specifically use a speedy hash algorithm for these hash sets,
123 /// they're accessed quite often.
124 type_: InternedSet<'tcx, TyS<'tcx>>,
125 type_list: InternedSet<'tcx, List<Ty<'tcx>>>,
126 substs: InternedSet<'tcx, Substs<'tcx>>,
127 canonical_var_infos: InternedSet<'tcx, List<CanonicalVarInfo>>,
128 region: InternedSet<'tcx, RegionKind>,
129 existential_predicates: InternedSet<'tcx, List<ExistentialPredicate<'tcx>>>,
130 predicates: InternedSet<'tcx, List<Predicate<'tcx>>>,
131 const_: InternedSet<'tcx, Const<'tcx>>,
132 clauses: InternedSet<'tcx, List<Clause<'tcx>>>,
133 goal: InternedSet<'tcx, GoalKind<'tcx>>,
134 goal_list: InternedSet<'tcx, List<Goal<'tcx>>>,
135 projs: InternedSet<'tcx, List<ProjectionKind<'tcx>>>,
138 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
139 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
142 type_: Default::default(),
143 type_list: Default::default(),
144 substs: Default::default(),
145 region: Default::default(),
146 existential_predicates: Default::default(),
147 canonical_var_infos: Default::default(),
148 predicates: Default::default(),
149 const_: Default::default(),
150 clauses: Default::default(),
151 goal: Default::default(),
152 goal_list: Default::default(),
153 projs: Default::default(),
159 local: &CtxtInterners<'tcx>,
160 global: &CtxtInterners<'gcx>,
163 let flags = super::flags::FlagComputation::for_sty(&st);
165 // HACK(eddyb) Depend on flags being accurate to
166 // determine that all contents are in the global tcx.
167 // See comments on Lift for why we can't use that.
168 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
169 let mut interner = local.type_.borrow_mut();
170 if let Some(&Interned(ty)) = interner.get(&st) {
174 let ty_struct = TyS {
177 outer_exclusive_binder: flags.outer_exclusive_binder,
180 // Make sure we don't end up with inference
181 // types/regions in the global interner
182 if local as *const _ as usize == global as *const _ as usize {
183 bug!("Attempted to intern `{:?}` which contains \
184 inference types/regions in the global type context",
188 // Don't be &mut TyS.
189 let ty: Ty<'tcx> = local.arena.alloc(ty_struct);
190 interner.insert(Interned(ty));
193 let mut interner = global.type_.borrow_mut();
194 if let Some(&Interned(ty)) = interner.get(&st) {
198 let ty_struct = TyS {
201 outer_exclusive_binder: flags.outer_exclusive_binder,
204 // This is safe because all the types the ty_struct can point to
205 // already is in the global arena
206 let ty_struct: TyS<'gcx> = unsafe {
207 mem::transmute(ty_struct)
210 // Don't be &mut TyS.
211 let ty: Ty<'gcx> = global.arena.alloc(ty_struct);
212 interner.insert(Interned(ty));
218 pub struct CommonTypes<'tcx> {
238 pub re_empty: Region<'tcx>,
239 pub re_static: Region<'tcx>,
240 pub re_erased: Region<'tcx>,
243 pub struct LocalTableInContext<'a, V: 'a> {
244 local_id_root: Option<DefId>,
245 data: &'a ItemLocalMap<V>
248 /// Validate that the given HirId (respectively its `local_id` part) can be
249 /// safely used as a key in the tables of a TypeckTable. For that to be
250 /// the case, the HirId must have the same `owner` as all the other IDs in
251 /// this table (signified by `local_id_root`). Otherwise the HirId
252 /// would be in a different frame of reference and using its `local_id`
253 /// would result in lookup errors, or worse, in silently wrong data being
255 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
258 if cfg!(debug_assertions) {
259 if let Some(local_id_root) = local_id_root {
260 if hir_id.owner != local_id_root.index {
261 ty::tls::with(|tcx| {
262 let node_id = tcx.hir.hir_to_node_id(hir_id);
264 bug!("node {} with HirId::owner {:?} cannot be placed in \
265 TypeckTables with local_id_root {:?}",
266 tcx.hir.node_to_string(node_id),
267 DefId::local(hir_id.owner),
272 // We use "Null Object" TypeckTables in some of the analysis passes.
273 // These are just expected to be empty and their `local_id_root` is
274 // `None`. Therefore we cannot verify whether a given `HirId` would
275 // be a valid key for the given table. Instead we make sure that
276 // nobody tries to write to such a Null Object table.
278 bug!("access to invalid TypeckTables")
284 impl<'a, V> LocalTableInContext<'a, V> {
285 pub fn contains_key(&self, id: hir::HirId) -> bool {
286 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
287 self.data.contains_key(&id.local_id)
290 pub fn get(&self, id: hir::HirId) -> Option<&V> {
291 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
292 self.data.get(&id.local_id)
295 pub fn iter(&self) -> hash_map::Iter<'_, hir::ItemLocalId, V> {
300 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
303 fn index(&self, key: hir::HirId) -> &V {
304 self.get(key).expect("LocalTableInContext: key not found")
308 pub struct LocalTableInContextMut<'a, V: 'a> {
309 local_id_root: Option<DefId>,
310 data: &'a mut ItemLocalMap<V>
313 impl<'a, V> LocalTableInContextMut<'a, V> {
314 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
315 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
316 self.data.get_mut(&id.local_id)
319 pub fn entry(&mut self, id: hir::HirId) -> Entry<'_, hir::ItemLocalId, V> {
320 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
321 self.data.entry(id.local_id)
324 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
325 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
326 self.data.insert(id.local_id, val)
329 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
330 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
331 self.data.remove(&id.local_id)
335 #[derive(RustcEncodable, RustcDecodable, Debug)]
336 pub struct TypeckTables<'tcx> {
337 /// The HirId::owner all ItemLocalIds in this table are relative to.
338 pub local_id_root: Option<DefId>,
340 /// Resolved definitions for `<T>::X` associated paths and
341 /// method calls, including those of overloaded operators.
342 type_dependent_defs: ItemLocalMap<Def>,
344 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
345 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
346 /// about the field you also need definition of the variant to which the field
347 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
348 field_indices: ItemLocalMap<usize>,
350 /// Stores the types for various nodes in the AST. Note that this table
351 /// is not guaranteed to be populated until after typeck. See
352 /// typeck::check::fn_ctxt for details.
353 node_types: ItemLocalMap<Ty<'tcx>>,
355 /// Stores the type parameters which were substituted to obtain the type
356 /// of this node. This only applies to nodes that refer to entities
357 /// parameterized by type parameters, such as generic fns, types, or
359 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
361 /// Stores the canonicalized types provided by the user. See also
362 /// `AscribeUserType` statement in MIR.
363 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
365 /// Stores the canonicalized types provided by the user. See also
366 /// `AscribeUserType` statement in MIR.
367 pub user_provided_sigs: DefIdMap<CanonicalPolyFnSig<'tcx>>,
369 /// Stores the substitutions that the user explicitly gave (if any)
370 /// attached to `id`. These will not include any inferred
371 /// values. The canonical form is used to capture things like `_`
372 /// or other unspecified values.
376 /// If the user wrote `foo.collect::<Vec<_>>()`, then the
377 /// canonical substitutions would include only `for<X> { Vec<X>
379 user_substs: ItemLocalMap<CanonicalUserSubsts<'tcx>>,
381 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
383 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
384 pat_binding_modes: ItemLocalMap<BindingMode>,
386 /// Stores the types which were implicitly dereferenced in pattern binding modes
387 /// for later usage in HAIR lowering. For example,
390 /// match &&Some(5i32) {
395 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
398 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
399 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
402 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
404 /// Records the reasons that we picked the kind of each closure;
405 /// not all closures are present in the map.
406 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
408 /// For each fn, records the "liberated" types of its arguments
409 /// and return type. Liberated means that all bound regions
410 /// (including late-bound regions) are replaced with free
411 /// equivalents. This table is not used in codegen (since regions
412 /// are erased there) and hence is not serialized to metadata.
413 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
415 /// For each FRU expression, record the normalized types of the fields
416 /// of the struct - this is needed because it is non-trivial to
417 /// normalize while preserving regions. This table is used only in
418 /// MIR construction and hence is not serialized to metadata.
419 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
421 /// Maps a cast expression to its kind. This is keyed on the
422 /// *from* expression of the cast, not the cast itself.
423 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
425 /// Set of trait imports actually used in the method resolution.
426 /// This is used for warning unused imports. During type
427 /// checking, this `Lrc` should not be cloned: it must have a ref-count
428 /// of 1 so that we can insert things into the set mutably.
429 pub used_trait_imports: Lrc<DefIdSet>,
431 /// If any errors occurred while type-checking this body,
432 /// this field will be set to `true`.
433 pub tainted_by_errors: bool,
435 /// Stores the free-region relationships that were deduced from
436 /// its where clauses and parameter types. These are then
437 /// read-again by borrowck.
438 pub free_region_map: FreeRegionMap<'tcx>,
440 /// All the existential types that are restricted to concrete types
442 pub concrete_existential_types: FxHashMap<DefId, Ty<'tcx>>,
445 impl<'tcx> TypeckTables<'tcx> {
446 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
449 type_dependent_defs: ItemLocalMap(),
450 field_indices: ItemLocalMap(),
451 user_provided_tys: ItemLocalMap(),
452 user_provided_sigs: Default::default(),
453 node_types: ItemLocalMap(),
454 node_substs: ItemLocalMap(),
455 user_substs: ItemLocalMap(),
456 adjustments: ItemLocalMap(),
457 pat_binding_modes: ItemLocalMap(),
458 pat_adjustments: ItemLocalMap(),
459 upvar_capture_map: Default::default(),
460 closure_kind_origins: ItemLocalMap(),
461 liberated_fn_sigs: ItemLocalMap(),
462 fru_field_types: ItemLocalMap(),
463 cast_kinds: ItemLocalMap(),
464 used_trait_imports: Lrc::new(DefIdSet()),
465 tainted_by_errors: false,
466 free_region_map: Default::default(),
467 concrete_existential_types: Default::default(),
471 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
472 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
474 hir::QPath::Resolved(_, ref path) => path.def,
475 hir::QPath::TypeRelative(..) => {
476 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
477 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
482 pub fn type_dependent_defs(&self) -> LocalTableInContext<'_, Def> {
483 LocalTableInContext {
484 local_id_root: self.local_id_root,
485 data: &self.type_dependent_defs
489 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<'_, Def> {
490 LocalTableInContextMut {
491 local_id_root: self.local_id_root,
492 data: &mut self.type_dependent_defs
496 pub fn field_indices(&self) -> LocalTableInContext<'_, usize> {
497 LocalTableInContext {
498 local_id_root: self.local_id_root,
499 data: &self.field_indices
503 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<'_, usize> {
504 LocalTableInContextMut {
505 local_id_root: self.local_id_root,
506 data: &mut self.field_indices
510 pub fn user_provided_tys(&self) -> LocalTableInContext<'_, CanonicalTy<'tcx>> {
511 LocalTableInContext {
512 local_id_root: self.local_id_root,
513 data: &self.user_provided_tys
517 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalTy<'tcx>> {
518 LocalTableInContextMut {
519 local_id_root: self.local_id_root,
520 data: &mut self.user_provided_tys
524 pub fn node_types(&self) -> LocalTableInContext<'_, Ty<'tcx>> {
525 LocalTableInContext {
526 local_id_root: self.local_id_root,
527 data: &self.node_types
531 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<'_, Ty<'tcx>> {
532 LocalTableInContextMut {
533 local_id_root: self.local_id_root,
534 data: &mut self.node_types
538 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
539 self.node_id_to_type_opt(id).unwrap_or_else(||
540 bug!("node_id_to_type: no type for node `{}`",
542 let id = tcx.hir.hir_to_node_id(id);
543 tcx.hir.node_to_string(id)
548 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
549 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
550 self.node_types.get(&id.local_id).cloned()
553 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<'_, &'tcx Substs<'tcx>> {
554 LocalTableInContextMut {
555 local_id_root: self.local_id_root,
556 data: &mut self.node_substs
560 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
561 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
562 self.node_substs.get(&id.local_id).cloned().unwrap_or_else(|| Substs::empty())
565 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
566 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
567 self.node_substs.get(&id.local_id).cloned()
570 pub fn user_substs_mut(&mut self) -> LocalTableInContextMut<'_, CanonicalUserSubsts<'tcx>> {
571 LocalTableInContextMut {
572 local_id_root: self.local_id_root,
573 data: &mut self.user_substs
577 pub fn user_substs(&self, id: hir::HirId) -> Option<CanonicalUserSubsts<'tcx>> {
578 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
579 self.user_substs.get(&id.local_id).cloned()
582 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
583 // doesn't provide type parameter substitutions.
584 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
585 self.node_id_to_type(pat.hir_id)
588 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
589 self.node_id_to_type_opt(pat.hir_id)
592 // Returns the type of an expression as a monotype.
594 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
595 // some cases, we insert `Adjustment` annotations such as auto-deref or
596 // auto-ref. The type returned by this function does not consider such
597 // adjustments. See `expr_ty_adjusted()` instead.
599 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
600 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
601 // instead of "fn(ty) -> T with T = isize".
602 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
603 self.node_id_to_type(expr.hir_id)
606 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
607 self.node_id_to_type_opt(expr.hir_id)
610 pub fn adjustments(&self) -> LocalTableInContext<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
611 LocalTableInContext {
612 local_id_root: self.local_id_root,
613 data: &self.adjustments
617 pub fn adjustments_mut(&mut self)
618 -> LocalTableInContextMut<'_, Vec<ty::adjustment::Adjustment<'tcx>>> {
619 LocalTableInContextMut {
620 local_id_root: self.local_id_root,
621 data: &mut self.adjustments
625 pub fn expr_adjustments(&self, expr: &hir::Expr)
626 -> &[ty::adjustment::Adjustment<'tcx>] {
627 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
628 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
631 /// Returns the type of `expr`, considering any `Adjustment`
632 /// entry recorded for that expression.
633 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
634 self.expr_adjustments(expr)
636 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
639 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
640 self.expr_adjustments(expr)
642 .map(|adj| adj.target)
643 .or_else(|| self.expr_ty_opt(expr))
646 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
647 // Only paths and method calls/overloaded operators have
648 // entries in type_dependent_defs, ignore the former here.
649 if let hir::ExprKind::Path(_) = expr.node {
653 match self.type_dependent_defs().get(expr.hir_id) {
654 Some(&Def::Method(_)) => true,
659 pub fn pat_binding_modes(&self) -> LocalTableInContext<'_, BindingMode> {
660 LocalTableInContext {
661 local_id_root: self.local_id_root,
662 data: &self.pat_binding_modes
666 pub fn pat_binding_modes_mut(&mut self)
667 -> LocalTableInContextMut<'_, BindingMode> {
668 LocalTableInContextMut {
669 local_id_root: self.local_id_root,
670 data: &mut self.pat_binding_modes
674 pub fn pat_adjustments(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
675 LocalTableInContext {
676 local_id_root: self.local_id_root,
677 data: &self.pat_adjustments,
681 pub fn pat_adjustments_mut(&mut self)
682 -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
683 LocalTableInContextMut {
684 local_id_root: self.local_id_root,
685 data: &mut self.pat_adjustments,
689 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
690 self.upvar_capture_map[&upvar_id]
693 pub fn closure_kind_origins(&self) -> LocalTableInContext<'_, (Span, ast::Name)> {
694 LocalTableInContext {
695 local_id_root: self.local_id_root,
696 data: &self.closure_kind_origins
700 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<'_, (Span, ast::Name)> {
701 LocalTableInContextMut {
702 local_id_root: self.local_id_root,
703 data: &mut self.closure_kind_origins
707 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<'_, ty::FnSig<'tcx>> {
708 LocalTableInContext {
709 local_id_root: self.local_id_root,
710 data: &self.liberated_fn_sigs
714 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<'_, ty::FnSig<'tcx>> {
715 LocalTableInContextMut {
716 local_id_root: self.local_id_root,
717 data: &mut self.liberated_fn_sigs
721 pub fn fru_field_types(&self) -> LocalTableInContext<'_, Vec<Ty<'tcx>>> {
722 LocalTableInContext {
723 local_id_root: self.local_id_root,
724 data: &self.fru_field_types
728 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<'_, Vec<Ty<'tcx>>> {
729 LocalTableInContextMut {
730 local_id_root: self.local_id_root,
731 data: &mut self.fru_field_types
735 pub fn cast_kinds(&self) -> LocalTableInContext<'_, ty::cast::CastKind> {
736 LocalTableInContext {
737 local_id_root: self.local_id_root,
738 data: &self.cast_kinds
742 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<'_, ty::cast::CastKind> {
743 LocalTableInContextMut {
744 local_id_root: self.local_id_root,
745 data: &mut self.cast_kinds
750 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
751 fn hash_stable<W: StableHasherResult>(&self,
752 hcx: &mut StableHashingContext<'a>,
753 hasher: &mut StableHasher<W>) {
754 let ty::TypeckTables {
756 ref type_dependent_defs,
758 ref user_provided_tys,
759 ref user_provided_sigs,
764 ref pat_binding_modes,
766 ref upvar_capture_map,
767 ref closure_kind_origins,
768 ref liberated_fn_sigs,
773 ref used_trait_imports,
776 ref concrete_existential_types,
779 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
780 type_dependent_defs.hash_stable(hcx, hasher);
781 field_indices.hash_stable(hcx, hasher);
782 user_provided_tys.hash_stable(hcx, hasher);
783 user_provided_sigs.hash_stable(hcx, hasher);
784 node_types.hash_stable(hcx, hasher);
785 node_substs.hash_stable(hcx, hasher);
786 user_substs.hash_stable(hcx, hasher);
787 adjustments.hash_stable(hcx, hasher);
788 pat_binding_modes.hash_stable(hcx, hasher);
789 pat_adjustments.hash_stable(hcx, hasher);
790 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
797 local_id_root.expect("trying to hash invalid TypeckTables");
799 let var_owner_def_id = DefId {
800 krate: local_id_root.krate,
803 let closure_def_id = DefId {
804 krate: local_id_root.krate,
805 index: closure_expr_id.to_def_id().index,
807 (hcx.def_path_hash(var_owner_def_id),
809 hcx.def_path_hash(closure_def_id))
812 closure_kind_origins.hash_stable(hcx, hasher);
813 liberated_fn_sigs.hash_stable(hcx, hasher);
814 fru_field_types.hash_stable(hcx, hasher);
815 cast_kinds.hash_stable(hcx, hasher);
816 used_trait_imports.hash_stable(hcx, hasher);
817 tainted_by_errors.hash_stable(hcx, hasher);
818 free_region_map.hash_stable(hcx, hasher);
819 concrete_existential_types.hash_stable(hcx, hasher);
824 impl<'tcx> CommonTypes<'tcx> {
825 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
826 // Ensure our type representation does not grow
827 #[cfg(target_pointer_width = "64")]
828 static_assert!(ASSERT_TY_KIND: ::std::mem::size_of::<ty::TyKind<'_>>() <= 24);
829 #[cfg(target_pointer_width = "64")]
830 static_assert!(ASSERT_TYS: ::std::mem::size_of::<ty::TyS<'_>>() <= 32);
832 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
833 let mk_region = |r| {
834 if let Some(r) = interners.region.borrow().get(&r) {
837 let r = interners.arena.alloc(r);
838 interners.region.borrow_mut().insert(Interned(r));
846 isize: mk(Int(ast::IntTy::Isize)),
847 i8: mk(Int(ast::IntTy::I8)),
848 i16: mk(Int(ast::IntTy::I16)),
849 i32: mk(Int(ast::IntTy::I32)),
850 i64: mk(Int(ast::IntTy::I64)),
851 i128: mk(Int(ast::IntTy::I128)),
852 usize: mk(Uint(ast::UintTy::Usize)),
853 u8: mk(Uint(ast::UintTy::U8)),
854 u16: mk(Uint(ast::UintTy::U16)),
855 u32: mk(Uint(ast::UintTy::U32)),
856 u64: mk(Uint(ast::UintTy::U64)),
857 u128: mk(Uint(ast::UintTy::U128)),
858 f32: mk(Float(ast::FloatTy::F32)),
859 f64: mk(Float(ast::FloatTy::F64)),
861 re_empty: mk_region(RegionKind::ReEmpty),
862 re_static: mk_region(RegionKind::ReStatic),
863 re_erased: mk_region(RegionKind::ReErased),
868 // This struct contains information regarding the `ReFree(FreeRegion)` corresponding to a lifetime
871 pub struct FreeRegionInfo {
872 // def id corresponding to FreeRegion
874 // the bound region corresponding to FreeRegion
875 pub boundregion: ty::BoundRegion,
876 // checks if bound region is in Impl Item
877 pub is_impl_item: bool,
880 /// The central data structure of the compiler. It stores references
881 /// to the various **arenas** and also houses the results of the
882 /// various **compiler queries** that have been performed. See the
883 /// [rustc guide] for more details.
885 /// [rustc guide]: https://rust-lang-nursery.github.io/rustc-guide/ty.html
886 #[derive(Copy, Clone)]
887 pub struct TyCtxt<'a, 'gcx: 'tcx, 'tcx: 'a> {
888 gcx: &'a GlobalCtxt<'gcx>,
889 interners: &'a CtxtInterners<'tcx>
892 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
893 type Target = &'a GlobalCtxt<'gcx>;
894 fn deref(&self) -> &Self::Target {
899 pub struct GlobalCtxt<'tcx> {
900 global_arenas: &'tcx WorkerLocal<GlobalArenas<'tcx>>,
901 global_interners: CtxtInterners<'tcx>,
903 cstore: &'tcx CrateStoreDyn,
905 pub sess: &'tcx Session,
907 pub dep_graph: DepGraph,
909 /// Common types, pre-interned for your convenience.
910 pub types: CommonTypes<'tcx>,
912 /// Map indicating what traits are in scope for places where this
913 /// is relevant; generated by resolve.
914 trait_map: FxHashMap<DefIndex,
915 Lrc<FxHashMap<ItemLocalId,
916 Lrc<StableVec<TraitCandidate>>>>>,
918 /// Export map produced by name resolution.
919 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
921 pub hir: hir_map::Map<'tcx>,
923 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
924 /// as well as all upstream crates. Only populated in incremental mode.
925 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
927 pub(crate) queries: query::Queries<'tcx>,
929 // Records the free variables referenced by every closure
930 // expression. Do not track deps for this, just recompute it from
931 // scratch every time.
932 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
934 maybe_unused_trait_imports: FxHashSet<DefId>,
935 maybe_unused_extern_crates: Vec<(DefId, Span)>,
936 /// Extern prelude entries. The value is `true` if the entry was introduced
937 /// via `extern crate` item and not `--extern` option or compiler built-in.
938 pub extern_prelude: FxHashMap<ast::Name, bool>,
940 // Internal cache for metadata decoding. No need to track deps on this.
941 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
943 /// Caches the results of trait selection. This cache is used
944 /// for things that do not have to do with the parameters in scope.
945 pub selection_cache: traits::SelectionCache<'tcx>,
947 /// Caches the results of trait evaluation. This cache is used
948 /// for things that do not have to do with the parameters in scope.
949 /// Merge this with `selection_cache`?
950 pub evaluation_cache: traits::EvaluationCache<'tcx>,
952 /// The definite name of the current crate after taking into account
953 /// attributes, commandline parameters, etc.
954 pub crate_name: Symbol,
956 /// Data layout specification for the current target.
957 pub data_layout: TargetDataLayout,
959 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
961 /// Stores the value of constants (and deduplicates the actual memory)
962 allocation_interner: Lock<FxHashSet<&'tcx Allocation>>,
964 pub alloc_map: Lock<interpret::AllocMap<'tcx, &'tcx Allocation>>,
966 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
968 /// A general purpose channel to throw data out the back towards LLVM worker
971 /// This is intended to only get used during the codegen phase of the compiler
972 /// when satisfying the query for a particular codegen unit. Internally in
973 /// the query it'll send data along this channel to get processed later.
974 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
976 output_filenames: Arc<OutputFilenames>,
979 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
980 /// Get the global TyCtxt.
982 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
985 interners: &self.gcx.global_interners,
989 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
990 self.global_arenas.generics.alloc(generics)
993 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
994 self.global_arenas.steal_mir.alloc(Steal::new(mir))
997 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
998 self.global_arenas.mir.alloc(mir)
1001 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
1002 self.global_arenas.tables.alloc(tables)
1005 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
1006 self.global_arenas.trait_def.alloc(def)
1009 pub fn alloc_adt_def(self,
1012 variants: Vec<ty::VariantDef>,
1014 -> &'gcx ty::AdtDef {
1015 let def = ty::AdtDef::new(self, did, kind, variants, repr);
1016 self.global_arenas.adt_def.alloc(def)
1019 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
1020 if bytes.is_empty() {
1023 self.global_interners.arena.alloc_slice(bytes)
1027 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
1028 -> &'tcx [&'tcx ty::Const<'tcx>] {
1029 if values.is_empty() {
1032 self.interners.arena.alloc_slice(values)
1036 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
1037 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
1038 if values.is_empty() {
1041 self.interners.arena.alloc_slice(values)
1045 pub fn intern_const_alloc(
1048 ) -> &'gcx Allocation {
1049 let allocs = &mut self.allocation_interner.borrow_mut();
1050 if let Some(alloc) = allocs.get(&alloc) {
1054 let interned = self.global_arenas.const_allocs.alloc(alloc);
1055 if let Some(prev) = allocs.replace(interned) { // insert into interner
1056 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1061 /// Allocates a byte or string literal for `mir::interpret`, read-only
1062 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1063 // create an allocation that just contains these bytes
1064 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1065 let alloc = self.intern_const_alloc(alloc);
1066 self.alloc_map.lock().allocate(alloc)
1069 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1070 let mut stability_interner = self.stability_interner.borrow_mut();
1071 if let Some(st) = stability_interner.get(&stab) {
1075 let interned = self.global_interners.arena.alloc(stab);
1076 if let Some(prev) = stability_interner.replace(interned) {
1077 bug!("Tried to overwrite interned Stability: {:?}", prev)
1082 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1083 let mut layout_interner = self.layout_interner.borrow_mut();
1084 if let Some(layout) = layout_interner.get(&layout) {
1088 let interned = self.global_arenas.layout.alloc(layout);
1089 if let Some(prev) = layout_interner.replace(interned) {
1090 bug!("Tried to overwrite interned Layout: {:?}", prev)
1095 /// Returns a range of the start/end indices specified with the
1096 /// `rustc_layout_scalar_valid_range` attribute.
1097 pub fn layout_scalar_valid_range(self, def_id: DefId) -> (Bound<u128>, Bound<u128>) {
1098 let attrs = self.get_attrs(def_id);
1100 let attr = match attrs.iter().find(|a| a.check_name(name)) {
1102 None => return Bound::Unbounded,
1104 for meta in attr.meta_item_list().expect("rustc_layout_scalar_valid_range takes args") {
1105 match meta.literal().expect("attribute takes lit").node {
1106 ast::LitKind::Int(a, _) => return Bound::Included(a),
1107 _ => span_bug!(attr.span, "rustc_layout_scalar_valid_range expects int arg"),
1110 span_bug!(attr.span, "no arguments to `rustc_layout_scalar_valid_range` attribute");
1112 (get("rustc_layout_scalar_valid_range_start"), get("rustc_layout_scalar_valid_range_end"))
1115 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1116 value.lift_to_tcx(self)
1119 /// Like lift, but only tries in the global tcx.
1120 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1121 value.lift_to_tcx(self.global_tcx())
1124 /// Returns true if self is the same as self.global_tcx().
1125 fn is_global(self) -> bool {
1126 let local = self.interners as *const _;
1127 let global = &self.global_interners as *const _;
1128 local as usize == global as usize
1131 /// Create a type context and call the closure with a `TyCtxt` reference
1132 /// to the context. The closure enforces that the type context and any interned
1133 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1134 /// reference to the context, to allow formatting values that need it.
1135 pub fn create_and_enter<F, R>(s: &'tcx Session,
1136 cstore: &'tcx CrateStoreDyn,
1137 local_providers: ty::query::Providers<'tcx>,
1138 extern_providers: ty::query::Providers<'tcx>,
1139 arenas: &'tcx AllArenas<'tcx>,
1140 resolutions: ty::Resolutions,
1141 hir: hir_map::Map<'tcx>,
1142 on_disk_query_result_cache: query::OnDiskCache<'tcx>,
1144 tx: mpsc::Sender<Box<dyn Any + Send>>,
1145 output_filenames: &OutputFilenames,
1147 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1149 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1152 let interners = CtxtInterners::new(&arenas.interner);
1153 let common_types = CommonTypes::new(&interners);
1154 let dep_graph = hir.dep_graph.clone();
1155 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1156 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1157 providers[LOCAL_CRATE] = local_providers;
1159 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1160 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1163 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1166 let def_path_tables = || {
1167 upstream_def_path_tables
1169 .map(|&(cnum, ref rc)| (cnum, &**rc))
1170 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1173 // Precompute the capacity of the hashmap so we don't have to
1174 // re-allocate when populating it.
1175 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1177 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1179 ::std::default::Default::default()
1182 for (cnum, def_path_table) in def_path_tables() {
1183 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1191 let mut trait_map: FxHashMap<_, Lrc<FxHashMap<_, _>>> = FxHashMap::default();
1192 for (k, v) in resolutions.trait_map {
1193 let hir_id = hir.node_to_hir_id(k);
1194 let map = trait_map.entry(hir_id.owner).or_default();
1195 Lrc::get_mut(map).unwrap()
1196 .insert(hir_id.local_id,
1197 Lrc::new(StableVec::new(v)));
1200 let gcx = &GlobalCtxt {
1203 global_arenas: &arenas.global,
1204 global_interners: interners,
1206 types: common_types,
1208 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1211 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1212 (hir.local_def_id(k), Lrc::new(v))
1214 maybe_unused_trait_imports:
1215 resolutions.maybe_unused_trait_imports
1217 .map(|id| hir.local_def_id(id))
1219 maybe_unused_extern_crates:
1220 resolutions.maybe_unused_extern_crates
1222 .map(|(id, sp)| (hir.local_def_id(id), sp))
1224 extern_prelude: resolutions.extern_prelude,
1226 def_path_hash_to_def_id,
1227 queries: query::Queries::new(
1230 on_disk_query_result_cache,
1232 rcache: Default::default(),
1233 selection_cache: Default::default(),
1234 evaluation_cache: Default::default(),
1235 crate_name: Symbol::intern(crate_name),
1237 layout_interner: Default::default(),
1238 stability_interner: Default::default(),
1239 allocation_interner: Default::default(),
1240 alloc_map: Lock::new(interpret::AllocMap::new()),
1241 tx_to_llvm_workers: Lock::new(tx),
1242 output_filenames: Arc::new(output_filenames.clone()),
1245 sync::assert_send_val(&gcx);
1247 tls::enter_global(gcx, f)
1250 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1251 let cname = self.crate_name(LOCAL_CRATE).as_str();
1252 self.sess.consider_optimizing(&cname, msg)
1255 pub fn lib_features(self) -> Lrc<middle::lib_features::LibFeatures> {
1256 self.get_lib_features(LOCAL_CRATE)
1259 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1260 self.get_lang_items(LOCAL_CRATE)
1263 /// Due to missing llvm support for lowering 128 bit math to software emulation
1264 /// (on some targets), the lowering can be done in MIR.
1266 /// This function only exists until said support is implemented.
1267 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1268 let items = self.lang_items();
1269 let def_id = Some(def_id);
1270 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1271 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1272 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1273 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1274 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1275 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1276 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1277 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1278 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1279 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1280 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1281 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1282 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1283 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1284 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1285 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1286 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1287 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1288 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1289 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1290 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1291 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1292 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1293 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1297 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1298 self.stability_index(LOCAL_CRATE)
1301 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1302 self.all_crate_nums(LOCAL_CRATE)
1305 pub fn features(self) -> Lrc<feature_gate::Features> {
1306 self.features_query(LOCAL_CRATE)
1309 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1311 self.hir.def_key(id)
1313 self.cstore.def_key(id)
1317 /// Convert a `DefId` into its fully expanded `DefPath` (every
1318 /// `DefId` is really just an interned def-path).
1320 /// Note that if `id` is not local to this crate, the result will
1321 /// be a non-local `DefPath`.
1322 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1324 self.hir.def_path(id)
1326 self.cstore.def_path(id)
1331 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1332 if def_id.is_local() {
1333 self.hir.definitions().def_path_hash(def_id.index)
1335 self.cstore.def_path_hash(def_id)
1339 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1340 // We are explicitly not going through queries here in order to get
1341 // crate name and disambiguator since this code is called from debug!()
1342 // statements within the query system and we'd run into endless
1343 // recursion otherwise.
1344 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1345 (self.crate_name.clone(),
1346 self.sess.local_crate_disambiguator())
1348 (self.cstore.crate_name_untracked(def_id.krate),
1349 self.cstore.crate_disambiguator_untracked(def_id.krate))
1354 // Don't print the whole crate disambiguator. That's just
1355 // annoying in debug output.
1356 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1357 self.def_path(def_id).to_string_no_crate())
1360 pub fn metadata_encoding_version(self) -> Vec<u8> {
1361 self.cstore.metadata_encoding_version().to_vec()
1364 // Note that this is *untracked* and should only be used within the query
1365 // system if the result is otherwise tracked through queries
1366 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1367 self.cstore.crate_data_as_rc_any(cnum)
1370 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1371 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1373 StableHashingContext::new(self.sess,
1375 self.hir.definitions(),
1379 // This method makes sure that we have a DepNode and a Fingerprint for
1380 // every upstream crate. It needs to be called once right after the tcx is
1382 // With full-fledged red/green, the method will probably become unnecessary
1383 // as this will be done on-demand.
1384 pub fn allocate_metadata_dep_nodes(self) {
1385 // We cannot use the query versions of crates() and crate_hash(), since
1386 // those would need the DepNodes that we are allocating here.
1387 for cnum in self.cstore.crates_untracked() {
1388 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1389 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1390 self.dep_graph.with_task(dep_node,
1393 |_, x| x // No transformation needed
1398 // This method exercises the `in_scope_traits_map` query for all possible
1399 // values so that we have their fingerprints available in the DepGraph.
1400 // This is only required as long as we still use the old dependency tracking
1401 // which needs to have the fingerprints of all input nodes beforehand.
1402 pub fn precompute_in_scope_traits_hashes(self) {
1403 for &def_index in self.trait_map.keys() {
1404 self.in_scope_traits_map(def_index);
1408 pub fn serialize_query_result_cache<E>(self,
1410 -> Result<(), E::Error>
1411 where E: ty::codec::TyEncoder
1413 self.queries.on_disk_cache.serialize(self.global_tcx(), encoder)
1416 /// This checks whether one is allowed to have pattern bindings
1417 /// that bind-by-move on a match arm that has a guard, e.g.:
1420 /// match foo { A(inner) if { /* something */ } => ..., ... }
1423 /// It is separate from check_for_mutation_in_guard_via_ast_walk,
1424 /// because that method has a narrower effect that can be toggled
1425 /// off via a separate `-Z` flag, at least for the short term.
1426 pub fn allow_bind_by_move_patterns_with_guards(self) -> bool {
1427 self.features().bind_by_move_pattern_guards && self.use_mir_borrowck()
1430 /// If true, we should use a naive AST walk to determine if match
1431 /// guard could perform bad mutations (or mutable-borrows).
1432 pub fn check_for_mutation_in_guard_via_ast_walk(self) -> bool {
1433 // If someone requests the feature, then be a little more
1434 // careful and ensure that MIR-borrowck is enabled (which can
1435 // happen via edition selection, via `feature(nll)`, or via an
1436 // appropriate `-Z` flag) before disabling the mutation check.
1437 if self.allow_bind_by_move_patterns_with_guards() {
1444 /// If true, we should use the AST-based borrowck (we may *also* use
1445 /// the MIR-based borrowck).
1446 pub fn use_ast_borrowck(self) -> bool {
1447 self.borrowck_mode().use_ast()
1450 /// If true, we should use the MIR-based borrowck (we may *also* use
1451 /// the AST-based borrowck).
1452 pub fn use_mir_borrowck(self) -> bool {
1453 self.borrowck_mode().use_mir()
1456 /// If true, we should use the MIR-based borrow check, but also
1457 /// fall back on the AST borrow check if the MIR-based one errors.
1458 pub fn migrate_borrowck(self) -> bool {
1459 self.borrowck_mode().migrate()
1462 /// If true, make MIR codegen for `match` emit a temp that holds a
1463 /// borrow of the input to the match expression.
1464 pub fn generate_borrow_of_any_match_input(&self) -> bool {
1465 self.emit_read_for_match()
1468 /// If true, make MIR codegen for `match` emit FakeRead
1469 /// statements (which simulate the maximal effect of executing the
1470 /// patterns in a match arm).
1471 pub fn emit_read_for_match(&self) -> bool {
1472 self.use_mir_borrowck() && !self.sess.opts.debugging_opts.nll_dont_emit_read_for_match
1475 /// If true, pattern variables for use in guards on match arms
1476 /// will be bound as references to the data, and occurrences of
1477 /// those variables in the guard expression will implicitly
1478 /// dereference those bindings. (See rust-lang/rust#27282.)
1479 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1480 self.borrowck_mode().use_mir()
1483 /// If true, we should enable two-phase borrows checks. This is
1484 /// done with either: `-Ztwo-phase-borrows`, `#![feature(nll)]`,
1485 /// or by opting into an edition after 2015.
1486 pub fn two_phase_borrows(self) -> bool {
1487 if self.features().nll || self.sess.opts.debugging_opts.two_phase_borrows {
1491 match self.sess.edition() {
1492 Edition::Edition2015 => false,
1493 Edition::Edition2018 => true,
1498 /// What mode(s) of borrowck should we run? AST? MIR? both?
1499 /// (Also considers the `#![feature(nll)]` setting.)
1500 pub fn borrowck_mode(&self) -> BorrowckMode {
1501 // Here are the main constraints we need to deal with:
1503 // 1. An opts.borrowck_mode of `BorrowckMode::Ast` is
1504 // synonymous with no `-Z borrowck=...` flag at all.
1505 // (This is arguably a historical accident.)
1507 // 2. `BorrowckMode::Migrate` is the limited migration to
1508 // NLL that we are deploying with the 2018 edition.
1510 // 3. We want to allow developers on the Nightly channel
1511 // to opt back into the "hard error" mode for NLL,
1512 // (which they can do via specifying `#![feature(nll)]`
1513 // explicitly in their crate).
1515 // So, this precedence list is how pnkfelix chose to work with
1516 // the above constraints:
1518 // * `#![feature(nll)]` *always* means use NLL with hard
1519 // errors. (To simplify the code here, it now even overrides
1520 // a user's attempt to specify `-Z borrowck=compare`, which
1521 // we arguably do not need anymore and should remove.)
1523 // * Otherwise, if no `-Z borrowck=...` flag was given (or
1524 // if `borrowck=ast` was specified), then use the default
1525 // as required by the edition.
1527 // * Otherwise, use the behavior requested via `-Z borrowck=...`
1529 if self.features().nll { return BorrowckMode::Mir; }
1531 match self.sess.opts.borrowck_mode {
1532 mode @ BorrowckMode::Mir |
1533 mode @ BorrowckMode::Compare |
1534 mode @ BorrowckMode::Migrate => mode,
1536 BorrowckMode::Ast => match self.sess.edition() {
1537 Edition::Edition2015 => BorrowckMode::Ast,
1538 Edition::Edition2018 => BorrowckMode::Migrate,
1540 // For now, future editions mean Migrate. (But it
1541 // would make a lot of sense for it to be changed to
1542 // `BorrowckMode::Mir`, depending on how we plan to
1543 // time the forcing of full migration to NLL.)
1544 _ => BorrowckMode::Migrate,
1549 /// Should we emit EndRegion MIR statements? These are consumed by
1550 /// MIR borrowck, but not when NLL is used. They are also consumed
1551 /// by the validation stuff.
1552 pub fn emit_end_regions(self) -> bool {
1553 self.sess.opts.debugging_opts.emit_end_regions ||
1554 self.sess.opts.debugging_opts.mir_emit_validate > 0 ||
1555 self.use_mir_borrowck()
1559 pub fn local_crate_exports_generics(self) -> bool {
1560 debug_assert!(self.sess.opts.share_generics());
1562 self.sess.crate_types.borrow().iter().any(|crate_type| {
1564 CrateType::Executable |
1565 CrateType::Staticlib |
1566 CrateType::ProcMacro |
1567 CrateType::Cdylib => false,
1569 CrateType::Dylib => true,
1574 // This method returns the DefId and the BoundRegion corresponding to the given region.
1575 pub fn is_suitable_region(&self, region: Region<'tcx>) -> Option<FreeRegionInfo> {
1576 let (suitable_region_binding_scope, bound_region) = match *region {
1577 ty::ReFree(ref free_region) => (free_region.scope, free_region.bound_region),
1578 ty::ReEarlyBound(ref ebr) => (
1579 self.parent_def_id(ebr.def_id).unwrap(),
1580 ty::BoundRegion::BrNamed(ebr.def_id, ebr.name),
1582 _ => return None, // not a free region
1585 let node_id = self.hir
1586 .as_local_node_id(suitable_region_binding_scope)
1588 let is_impl_item = match self.hir.find(node_id) {
1589 Some(Node::Item(..)) | Some(Node::TraitItem(..)) => false,
1590 Some(Node::ImplItem(..)) => {
1591 self.is_bound_region_in_impl_item(suitable_region_binding_scope)
1596 return Some(FreeRegionInfo {
1597 def_id: suitable_region_binding_scope,
1598 boundregion: bound_region,
1599 is_impl_item: is_impl_item,
1603 pub fn return_type_impl_trait(
1605 scope_def_id: DefId,
1606 ) -> Option<Ty<'tcx>> {
1607 let ret_ty = self.type_of(scope_def_id);
1609 ty::FnDef(_, _) => {
1610 let sig = ret_ty.fn_sig(*self);
1611 let output = self.erase_late_bound_regions(&sig.output());
1612 if output.is_impl_trait() {
1622 // Here we check if the bound region is in Impl Item.
1623 pub fn is_bound_region_in_impl_item(
1625 suitable_region_binding_scope: DefId,
1627 let container_id = self.associated_item(suitable_region_binding_scope)
1630 if self.impl_trait_ref(container_id).is_some() {
1631 // For now, we do not try to target impls of traits. This is
1632 // because this message is going to suggest that the user
1633 // change the fn signature, but they may not be free to do so,
1634 // since the signature must match the trait.
1636 // FIXME(#42706) -- in some cases, we could do better here.
1643 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1644 pub fn encode_metadata(self)
1647 self.cstore.encode_metadata(self)
1651 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1652 /// Call the closure with a local `TyCtxt` using the given arena.
1653 pub fn enter_local<F, R>(
1655 arena: &'tcx SyncDroplessArena,
1659 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1661 let interners = CtxtInterners::new(arena);
1664 interners: &interners,
1666 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1667 let new_icx = ty::tls::ImplicitCtxt {
1669 query: icx.query.clone(),
1670 layout_depth: icx.layout_depth,
1673 ty::tls::enter_context(&new_icx, |new_icx| {
1680 /// A trait implemented for all X<'a> types which can be safely and
1681 /// efficiently converted to X<'tcx> as long as they are part of the
1682 /// provided TyCtxt<'tcx>.
1683 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1684 /// by looking them up in their respective interners.
1686 /// However, this is still not the best implementation as it does
1687 /// need to compare the components, even for interned values.
1688 /// It would be more efficient if TypedArena provided a way to
1689 /// determine whether the address is in the allocated range.
1691 /// None is returned if the value or one of the components is not part
1692 /// of the provided context.
1693 /// For Ty, None can be returned if either the type interner doesn't
1694 /// contain the TyKind key or if the address of the interned
1695 /// pointer differs. The latter case is possible if a primitive type,
1696 /// e.g. `()` or `u8`, was interned in a different context.
1697 pub trait Lift<'tcx>: fmt::Debug {
1698 type Lifted: fmt::Debug + 'tcx;
1699 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1702 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1703 type Lifted = Ty<'tcx>;
1704 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1705 if tcx.interners.arena.in_arena(*self as *const _) {
1706 return Some(unsafe { mem::transmute(*self) });
1708 // Also try in the global tcx if we're not that.
1709 if !tcx.is_global() {
1710 self.lift_to_tcx(tcx.global_tcx())
1717 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1718 type Lifted = Region<'tcx>;
1719 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1720 if tcx.interners.arena.in_arena(*self as *const _) {
1721 return Some(unsafe { mem::transmute(*self) });
1723 // Also try in the global tcx if we're not that.
1724 if !tcx.is_global() {
1725 self.lift_to_tcx(tcx.global_tcx())
1732 impl<'a, 'tcx> Lift<'tcx> for Goal<'a> {
1733 type Lifted = Goal<'tcx>;
1734 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Goal<'tcx>> {
1735 if tcx.interners.arena.in_arena(*self as *const _) {
1736 return Some(unsafe { mem::transmute(*self) });
1738 // Also try in the global tcx if we're not that.
1739 if !tcx.is_global() {
1740 self.lift_to_tcx(tcx.global_tcx())
1747 impl<'a, 'tcx> Lift<'tcx> for &'a List<Goal<'a>> {
1748 type Lifted = &'tcx List<Goal<'tcx>>;
1749 fn lift_to_tcx<'b, 'gcx>(
1751 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1752 ) -> Option<&'tcx List<Goal<'tcx>>> {
1753 if tcx.interners.arena.in_arena(*self as *const _) {
1754 return Some(unsafe { mem::transmute(*self) });
1756 // Also try in the global tcx if we're not that.
1757 if !tcx.is_global() {
1758 self.lift_to_tcx(tcx.global_tcx())
1765 impl<'a, 'tcx> Lift<'tcx> for &'a List<Clause<'a>> {
1766 type Lifted = &'tcx List<Clause<'tcx>>;
1767 fn lift_to_tcx<'b, 'gcx>(
1769 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1770 ) -> Option<&'tcx List<Clause<'tcx>>> {
1771 if tcx.interners.arena.in_arena(*self as *const _) {
1772 return Some(unsafe { mem::transmute(*self) });
1774 // Also try in the global tcx if we're not that.
1775 if !tcx.is_global() {
1776 self.lift_to_tcx(tcx.global_tcx())
1783 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1784 type Lifted = &'tcx Const<'tcx>;
1785 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1786 if tcx.interners.arena.in_arena(*self as *const _) {
1787 return Some(unsafe { mem::transmute(*self) });
1789 // Also try in the global tcx if we're not that.
1790 if !tcx.is_global() {
1791 self.lift_to_tcx(tcx.global_tcx())
1798 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1799 type Lifted = &'tcx Substs<'tcx>;
1800 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1801 if self.len() == 0 {
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<Ty<'a>> {
1817 type Lifted = &'tcx List<Ty<'tcx>>;
1818 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1819 -> Option<&'tcx List<Ty<'tcx>>> {
1820 if self.len() == 0 {
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<ExistentialPredicate<'a>> {
1836 type Lifted = &'tcx List<ExistentialPredicate<'tcx>>;
1837 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1838 -> Option<&'tcx List<ExistentialPredicate<'tcx>>> {
1839 if self.is_empty() {
1840 return Some(List::empty());
1842 if tcx.interners.arena.in_arena(*self as *const _) {
1843 return Some(unsafe { mem::transmute(*self) });
1845 // Also try in the global tcx if we're not that.
1846 if !tcx.is_global() {
1847 self.lift_to_tcx(tcx.global_tcx())
1854 impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>> {
1855 type Lifted = &'tcx List<Predicate<'tcx>>;
1856 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1857 -> Option<&'tcx List<Predicate<'tcx>>> {
1858 if self.is_empty() {
1859 return Some(List::empty());
1861 if tcx.interners.arena.in_arena(*self as *const _) {
1862 return Some(unsafe { mem::transmute(*self) });
1864 // Also try in the global tcx if we're not that.
1865 if !tcx.is_global() {
1866 self.lift_to_tcx(tcx.global_tcx())
1873 impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo> {
1874 type Lifted = &'tcx List<CanonicalVarInfo>;
1875 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1876 if self.len() == 0 {
1877 return Some(List::empty());
1879 if tcx.interners.arena.in_arena(*self as *const _) {
1880 return Some(unsafe { mem::transmute(*self) });
1882 // Also try in the global tcx if we're not that.
1883 if !tcx.is_global() {
1884 self.lift_to_tcx(tcx.global_tcx())
1892 use super::{GlobalCtxt, TyCtxt};
1898 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1899 use rustc_data_structures::OnDrop;
1900 use rustc_data_structures::sync::{self, Lrc, Lock};
1901 use dep_graph::OpenTask;
1903 #[cfg(not(parallel_queries))]
1904 use std::cell::Cell;
1906 #[cfg(parallel_queries)]
1909 /// This is the implicit state of rustc. It contains the current
1910 /// TyCtxt and query. It is updated when creating a local interner or
1911 /// executing a new query. Whenever there's a TyCtxt value available
1912 /// you should also have access to an ImplicitCtxt through the functions
1915 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1916 /// The current TyCtxt. Initially created by `enter_global` and updated
1917 /// by `enter_local` with a new local interner
1918 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1920 /// The current query job, if any. This is updated by start_job in
1921 /// ty::query::plumbing when executing a query
1922 pub query: Option<Lrc<query::QueryJob<'gcx>>>,
1924 /// Used to prevent layout from recursing too deeply.
1925 pub layout_depth: usize,
1927 /// The current dep graph task. This is used to add dependencies to queries
1928 /// when executing them
1929 pub task: &'a OpenTask,
1932 /// Sets Rayon's thread local variable which is preserved for Rayon jobs
1933 /// to `value` during the call to `f`. It is restored to its previous value after.
1934 /// This is used to set the pointer to the new ImplicitCtxt.
1935 #[cfg(parallel_queries)]
1936 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1937 rayon_core::tlv::with(value, f)
1940 /// Gets Rayon's thread local variable which is preserved for Rayon jobs.
1941 /// This is used to get the pointer to the current ImplicitCtxt.
1942 #[cfg(parallel_queries)]
1943 fn get_tlv() -> usize {
1944 rayon_core::tlv::get()
1947 /// A thread local variable which stores a pointer to the current ImplicitCtxt
1948 #[cfg(not(parallel_queries))]
1949 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1951 /// Sets TLV to `value` during the call to `f`.
1952 /// It is restored to its previous value after.
1953 /// This is used to set the pointer to the new ImplicitCtxt.
1954 #[cfg(not(parallel_queries))]
1955 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1956 let old = get_tlv();
1957 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1958 TLV.with(|tlv| tlv.set(value));
1962 /// This is used to get the pointer to the current ImplicitCtxt.
1963 #[cfg(not(parallel_queries))]
1964 fn get_tlv() -> usize {
1965 TLV.with(|tlv| tlv.get())
1968 /// This is a callback from libsyntax as it cannot access the implicit state
1969 /// in librustc otherwise
1970 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter<'_>) -> fmt::Result {
1972 write!(f, "{}", tcx.sess.source_map().span_to_string(span))
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`
2015 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
2017 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2019 set_tlv(context as *const _ as usize, || {
2024 /// Enters GlobalCtxt by setting up libsyntax callbacks and
2025 /// creating a initial TyCtxt and ImplicitCtxt.
2026 /// This happens once per rustc session and TyCtxts only exists
2027 /// inside the `f` function.
2028 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
2029 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
2031 with_thread_locals(|| {
2032 // Update GCX_PTR to indicate there's a GlobalCtxt available
2033 GCX_PTR.with(|lock| {
2034 *lock.lock() = gcx as *const _ as usize;
2036 // Set GCX_PTR back to 0 when we exit
2037 let _on_drop = OnDrop(move || {
2038 GCX_PTR.with(|lock| *lock.lock() = 0);
2043 interners: &gcx.global_interners,
2045 let icx = ImplicitCtxt {
2049 task: &OpenTask::Ignore,
2051 enter_context(&icx, |_| {
2057 /// Stores a pointer to the GlobalCtxt if one is available.
2058 /// This is used to access the GlobalCtxt in the deadlock handler
2060 scoped_thread_local!(pub static GCX_PTR: Lock<usize>);
2062 /// Creates a TyCtxt and ImplicitCtxt based on the GCX_PTR thread local.
2063 /// This is used in the deadlock handler.
2064 pub unsafe fn with_global<F, R>(f: F) -> R
2065 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2067 let gcx = GCX_PTR.with(|lock| *lock.lock());
2069 let gcx = &*(gcx as *const GlobalCtxt<'_>);
2072 interners: &gcx.global_interners,
2074 let icx = ImplicitCtxt {
2078 task: &OpenTask::Ignore,
2080 enter_context(&icx, |_| f(tcx))
2083 /// Allows access to the current ImplicitCtxt in a closure if one is available
2084 pub fn with_context_opt<F, R>(f: F) -> R
2085 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
2087 let context = get_tlv();
2091 // We could get a ImplicitCtxt pointer from another thread.
2092 // Ensure that ImplicitCtxt is Sync
2093 sync::assert_sync::<ImplicitCtxt<'_, '_, '_>>();
2095 unsafe { f(Some(&*(context as *const ImplicitCtxt<'_, '_, '_>))) }
2099 /// Allows access to the current ImplicitCtxt.
2100 /// Panics if there is no ImplicitCtxt available
2101 pub fn with_context<F, R>(f: F) -> R
2102 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
2104 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
2107 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2108 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
2109 /// with the same 'gcx lifetime as the TyCtxt passed in.
2110 /// This will panic if you pass it a TyCtxt which has a different global interner from
2111 /// the current ImplicitCtxt's tcx field.
2112 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
2113 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
2115 with_context(|context| {
2117 let gcx = tcx.gcx as *const _ as usize;
2118 assert!(context.tcx.gcx as *const _ as usize == gcx);
2119 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2125 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
2126 /// interner and local interner as the tcx argument passed in. This means the closure
2127 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
2128 /// This will panic if you pass it a TyCtxt which has a different global interner or
2129 /// a different local interner from the current ImplicitCtxt's tcx field.
2130 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
2131 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
2133 with_context(|context| {
2135 let gcx = tcx.gcx as *const _ as usize;
2136 let interners = tcx.interners as *const _ as usize;
2137 assert!(context.tcx.gcx as *const _ as usize == gcx);
2138 assert!(context.tcx.interners as *const _ as usize == interners);
2139 let context: &ImplicitCtxt<'_, '_, '_> = mem::transmute(context);
2145 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2146 /// Panics if there is no ImplicitCtxt available
2147 pub fn with<F, R>(f: F) -> R
2148 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
2150 with_context(|context| f(context.tcx))
2153 /// Allows access to the TyCtxt in the current ImplicitCtxt.
2154 /// The closure is passed None if there is no ImplicitCtxt available
2155 pub fn with_opt<F, R>(f: F) -> R
2156 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
2158 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
2162 macro_rules! sty_debug_print {
2163 ($ctxt: expr, $($variant: ident),*) => {{
2164 // curious inner module to allow variant names to be used as
2166 #[allow(non_snake_case)]
2168 use ty::{self, TyCtxt};
2169 use ty::context::Interned;
2171 #[derive(Copy, Clone)]
2174 region_infer: usize,
2179 pub fn go(tcx: TyCtxt<'_, '_, '_>) {
2180 let mut total = DebugStat {
2182 region_infer: 0, ty_infer: 0, both_infer: 0,
2184 $(let mut $variant = total;)*
2186 for &Interned(t) in tcx.interners.type_.borrow().iter() {
2187 let variant = match t.sty {
2188 ty::Bool | ty::Char | ty::Int(..) | ty::Uint(..) |
2189 ty::Float(..) | ty::Str | ty::Never => continue,
2190 ty::Error => /* unimportant */ continue,
2191 $(ty::$variant(..) => &mut $variant,)*
2193 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
2194 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
2198 if region { total.region_infer += 1; variant.region_infer += 1 }
2199 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
2200 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
2202 println!("Ty interner total ty region both");
2203 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
2204 {ty:4.1}% {region:5.1}% {both:4.1}%",
2205 stringify!($variant),
2206 uses = $variant.total,
2207 usespc = $variant.total as f64 * 100.0 / total.total as f64,
2208 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
2209 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
2210 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
2212 println!(" total {uses:6} \
2213 {ty:4.1}% {region:5.1}% {both:4.1}%",
2215 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
2216 region = total.region_infer as f64 * 100.0 / total.total as f64,
2217 both = total.both_infer as f64 * 100.0 / total.total as f64)
2225 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
2226 pub fn print_debug_stats(self) {
2229 Adt, Array, Slice, RawPtr, Ref, FnDef, FnPtr,
2230 Generator, GeneratorWitness, Dynamic, Closure, Tuple,
2231 Param, Infer, UnnormalizedProjection, Projection, Opaque, Foreign);
2233 println!("Substs interner: #{}", self.interners.substs.borrow().len());
2234 println!("Region interner: #{}", self.interners.region.borrow().len());
2235 println!("Stability interner: #{}", self.stability_interner.borrow().len());
2236 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
2237 println!("Layout interner: #{}", self.layout_interner.borrow().len());
2242 /// An entry in an interner.
2243 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
2245 // NB: An Interned<Ty> compares and hashes as a sty.
2246 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
2247 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
2248 self.0.sty == other.0.sty
2252 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
2254 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
2255 fn hash<H: Hasher>(&self, s: &mut H) {
2260 impl<'tcx: 'lcx, 'lcx> Borrow<TyKind<'lcx>> for Interned<'tcx, TyS<'tcx>> {
2261 fn borrow<'a>(&'a self) -> &'a TyKind<'lcx> {
2266 // NB: An Interned<List<T>> compares and hashes as its elements.
2267 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, List<T>> {
2268 fn eq(&self, other: &Interned<'tcx, List<T>>) -> bool {
2269 self.0[..] == other.0[..]
2273 impl<'tcx, T: Eq> Eq for Interned<'tcx, List<T>> {}
2275 impl<'tcx, T: Hash> Hash for Interned<'tcx, List<T>> {
2276 fn hash<H: Hasher>(&self, s: &mut H) {
2281 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, List<Ty<'tcx>>> {
2282 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2287 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, List<CanonicalVarInfo>> {
2288 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2293 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2294 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2299 impl<'tcx: 'lcx, 'lcx> Borrow<[ProjectionKind<'lcx>]>
2300 for Interned<'tcx, List<ProjectionKind<'tcx>>> {
2301 fn borrow<'a>(&'a self) -> &'a [ProjectionKind<'lcx>] {
2306 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2307 fn borrow<'a>(&'a self) -> &'a RegionKind {
2312 impl<'tcx: 'lcx, 'lcx> Borrow<GoalKind<'lcx>> for Interned<'tcx, GoalKind<'tcx>> {
2313 fn borrow<'a>(&'a self) -> &'a GoalKind<'lcx> {
2318 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2319 for Interned<'tcx, List<ExistentialPredicate<'tcx>>> {
2320 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2325 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2326 for Interned<'tcx, List<Predicate<'tcx>>> {
2327 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2332 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2333 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2338 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2339 for Interned<'tcx, List<Clause<'tcx>>> {
2340 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2345 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2346 for Interned<'tcx, List<Goal<'tcx>>> {
2347 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2352 macro_rules! intern_method {
2353 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2356 $keep_in_local_tcx:expr) -> $ty:ty) => {
2357 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2358 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2359 let key = ($alloc_to_key)(&v);
2361 // HACK(eddyb) Depend on flags being accurate to
2362 // determine that all contents are in the global tcx.
2363 // See comments on Lift for why we can't use that.
2364 if ($keep_in_local_tcx)(&v) {
2365 let mut interner = self.interners.$name.borrow_mut();
2366 if let Some(&Interned(v)) = interner.get(key) {
2370 // Make sure we don't end up with inference
2371 // types/regions in the global tcx.
2372 if self.is_global() {
2373 bug!("Attempted to intern `{:?}` which contains \
2374 inference types/regions in the global type context",
2378 let i = $alloc_method(&self.interners.arena, v);
2379 interner.insert(Interned(i));
2382 let mut interner = self.global_interners.$name.borrow_mut();
2383 if let Some(&Interned(v)) = interner.get(key) {
2387 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2391 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2393 let i = unsafe { mem::transmute(i) };
2394 interner.insert(Interned(i));
2402 macro_rules! direct_interners {
2403 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2404 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2405 fn eq(&self, other: &Self) -> bool {
2410 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2412 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2413 fn hash<H: Hasher>(&self, s: &mut H) {
2421 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2423 $keep_in_local_tcx) -> $ty);)+
2427 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2428 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2431 direct_interners!('tcx,
2432 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2433 const_: mk_const(|c: &Const<'_>| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>,
2434 goal: mk_goal(|c: &GoalKind<'_>| keep_local(c)) -> GoalKind<'tcx>
2437 macro_rules! slice_interners {
2438 ($($field:ident: $method:ident($ty:ident)),+) => (
2439 $(intern_method!( 'tcx, $field: $method(
2441 |a, v| List::from_arena(a, v),
2443 |xs: &[$ty<'_>]| xs.iter().any(keep_local)) -> List<$ty<'tcx>>);)+
2448 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2449 predicates: _intern_predicates(Predicate),
2450 type_list: _intern_type_list(Ty),
2451 substs: _intern_substs(Kind),
2452 clauses: _intern_clauses(Clause),
2453 goal_list: _intern_goals(Goal),
2454 projs: _intern_projs(ProjectionKind)
2457 // This isn't a perfect fit: CanonicalVarInfo slices are always
2458 // allocated in the global arena, so this `intern_method!` macro is
2459 // overly general. But we just return false for the code that checks
2460 // whether they belong in the thread-local arena, so no harm done, and
2461 // seems better than open-coding the rest.
2464 canonical_var_infos: _intern_canonical_var_infos(
2465 &[CanonicalVarInfo],
2466 |a, v| List::from_arena(a, v),
2468 |_xs: &[CanonicalVarInfo]| -> bool { false }
2469 ) -> List<CanonicalVarInfo>
2472 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2473 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2474 /// that is, a `fn` type that is equivalent in every way for being
2476 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2477 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2478 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2479 unsafety: hir::Unsafety::Unsafe,
2484 /// Given a closure signature `sig`, returns an equivalent `fn`
2485 /// type with the same signature. Detuples and so forth -- so
2486 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2487 /// a `fn(u32, i32)`.
2488 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2489 let converted_sig = sig.map_bound(|s| {
2490 let params_iter = match s.inputs()[0].sty {
2491 ty::Tuple(params) => {
2492 params.into_iter().cloned()
2500 hir::Unsafety::Normal,
2505 self.mk_fn_ptr(converted_sig)
2508 pub fn mk_ty(&self, st: TyKind<'tcx>) -> Ty<'tcx> {
2509 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2512 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2514 ast::IntTy::Isize => self.types.isize,
2515 ast::IntTy::I8 => self.types.i8,
2516 ast::IntTy::I16 => self.types.i16,
2517 ast::IntTy::I32 => self.types.i32,
2518 ast::IntTy::I64 => self.types.i64,
2519 ast::IntTy::I128 => self.types.i128,
2523 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2525 ast::UintTy::Usize => self.types.usize,
2526 ast::UintTy::U8 => self.types.u8,
2527 ast::UintTy::U16 => self.types.u16,
2528 ast::UintTy::U32 => self.types.u32,
2529 ast::UintTy::U64 => self.types.u64,
2530 ast::UintTy::U128 => self.types.u128,
2534 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2536 ast::FloatTy::F32 => self.types.f32,
2537 ast::FloatTy::F64 => self.types.f64,
2541 pub fn mk_str(self) -> Ty<'tcx> {
2545 pub fn mk_static_str(self) -> Ty<'tcx> {
2546 self.mk_imm_ref(self.types.re_static, self.mk_str())
2549 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2550 // take a copy of substs so that we own the vectors inside
2551 self.mk_ty(Adt(def, substs))
2554 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2555 self.mk_ty(Foreign(def_id))
2558 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2559 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2560 let adt_def = self.adt_def(def_id);
2561 let substs = Substs::for_item(self, def_id, |param, substs| {
2563 GenericParamDefKind::Lifetime => bug!(),
2564 GenericParamDefKind::Type { has_default, .. } => {
2565 if param.index == 0 {
2568 assert!(has_default);
2569 self.type_of(param.def_id).subst(self, substs).into()
2574 self.mk_ty(Adt(adt_def, substs))
2577 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2578 self.mk_ty(RawPtr(tm))
2581 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2582 self.mk_ty(Ref(r, tm.ty, tm.mutbl))
2585 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2586 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2589 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2590 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2593 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2594 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2597 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2598 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2601 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2602 self.mk_imm_ptr(self.mk_unit())
2605 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2606 self.mk_ty(Array(ty, ty::Const::from_usize(self, n)))
2609 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2610 self.mk_ty(Slice(ty))
2613 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2614 self.mk_ty(Tuple(self.intern_type_list(ts)))
2617 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2618 iter.intern_with(|ts| self.mk_ty(Tuple(self.intern_type_list(ts))))
2621 pub fn mk_unit(self) -> Ty<'tcx> {
2622 self.intern_tup(&[])
2625 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2626 if self.features().never_type {
2629 self.intern_tup(&[])
2633 pub fn mk_bool(self) -> Ty<'tcx> {
2637 pub fn mk_fn_def(self, def_id: DefId,
2638 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2639 self.mk_ty(FnDef(def_id, substs))
2642 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2643 self.mk_ty(FnPtr(fty))
2648 obj: ty::Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
2649 reg: ty::Region<'tcx>
2651 self.mk_ty(Dynamic(obj, reg))
2654 pub fn mk_projection(self,
2656 substs: &'tcx Substs<'tcx>)
2658 self.mk_ty(Projection(ProjectionTy {
2664 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2666 self.mk_ty(Closure(closure_id, closure_substs))
2669 pub fn mk_generator(self,
2671 generator_substs: GeneratorSubsts<'tcx>,
2672 movability: hir::GeneratorMovability)
2674 self.mk_ty(Generator(id, generator_substs, movability))
2677 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx List<Ty<'tcx>>>) -> Ty<'tcx> {
2678 self.mk_ty(GeneratorWitness(types))
2681 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2682 self.mk_infer(TyVar(v))
2685 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2686 self.mk_infer(IntVar(v))
2689 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2690 self.mk_infer(FloatVar(v))
2693 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2694 self.mk_ty(Infer(it))
2697 pub fn mk_ty_param(self,
2699 name: InternedString) -> Ty<'tcx> {
2700 self.mk_ty(Param(ParamTy { idx: index, name: name }))
2703 pub fn mk_self_type(self) -> Ty<'tcx> {
2704 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2707 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2709 GenericParamDefKind::Lifetime => {
2710 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2712 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2716 pub fn mk_opaque(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2717 self.mk_ty(Opaque(def_id, substs))
2720 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2721 -> &'tcx List<ExistentialPredicate<'tcx>> {
2722 assert!(!eps.is_empty());
2723 assert!(eps.windows(2).all(|w| w[0].stable_cmp(self, &w[1]) != Ordering::Greater));
2724 self._intern_existential_predicates(eps)
2727 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2728 -> &'tcx List<Predicate<'tcx>> {
2729 // FIXME consider asking the input slice to be sorted to avoid
2730 // re-interning permutations, in which case that would be asserted
2732 if preds.len() == 0 {
2733 // The macro-generated method below asserts we don't intern an empty slice.
2736 self._intern_predicates(preds)
2740 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>> {
2744 self._intern_type_list(ts)
2748 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx List<Kind<'tcx>> {
2752 self._intern_substs(ts)
2756 pub fn intern_projs(self, ps: &[ProjectionKind<'tcx>]) -> &'tcx List<ProjectionKind<'tcx>> {
2760 self._intern_projs(ps)
2764 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2768 self.global_tcx()._intern_canonical_var_infos(ts)
2772 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2776 self._intern_clauses(ts)
2780 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2784 self._intern_goals(ts)
2788 pub fn mk_fn_sig<I>(self,
2792 unsafety: hir::Unsafety,
2794 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2796 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2798 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2799 inputs_and_output: self.intern_type_list(xs),
2800 variadic, unsafety, abi
2804 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2805 &'tcx List<ExistentialPredicate<'tcx>>>>(self, iter: I)
2807 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2810 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2811 &'tcx List<Predicate<'tcx>>>>(self, iter: I)
2813 iter.intern_with(|xs| self.intern_predicates(xs))
2816 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2817 &'tcx List<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2818 iter.intern_with(|xs| self.intern_type_list(xs))
2821 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2822 &'tcx List<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2823 iter.intern_with(|xs| self.intern_substs(xs))
2826 pub fn mk_substs_trait(self,
2828 rest: &[Kind<'tcx>])
2829 -> &'tcx Substs<'tcx>
2831 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2834 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2835 iter.intern_with(|xs| self.intern_clauses(xs))
2838 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2839 iter.intern_with(|xs| self.intern_goals(xs))
2842 pub fn lint_hir<S: Into<MultiSpan>>(self,
2843 lint: &'static Lint,
2847 self.struct_span_lint_hir(lint, hir_id, span.into(), msg).emit()
2850 pub fn lint_node<S: Into<MultiSpan>>(self,
2851 lint: &'static Lint,
2855 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2858 pub fn lint_hir_note<S: Into<MultiSpan>>(self,
2859 lint: &'static Lint,
2864 let mut err = self.struct_span_lint_hir(lint, hir_id, span.into(), msg);
2869 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2870 lint: &'static Lint,
2875 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2880 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2881 -> (lint::Level, lint::LintSource)
2883 // Right now we insert a `with_ignore` node in the dep graph here to
2884 // ignore the fact that `lint_levels` below depends on the entire crate.
2885 // For now this'll prevent false positives of recompiling too much when
2886 // anything changes.
2888 // Once red/green incremental compilation lands we should be able to
2889 // remove this because while the crate changes often the lint level map
2890 // will change rarely.
2891 self.dep_graph.with_ignore(|| {
2892 let sets = self.lint_levels(LOCAL_CRATE);
2894 let hir_id = self.hir.definitions().node_to_hir_id(id);
2895 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2898 let next = self.hir.get_parent_node(id);
2900 bug!("lint traversal reached the root of the crate");
2907 pub fn struct_span_lint_hir<S: Into<MultiSpan>>(self,
2908 lint: &'static Lint,
2912 -> DiagnosticBuilder<'tcx>
2914 let node_id = self.hir.hir_to_node_id(hir_id);
2915 let (level, src) = self.lint_level_at_node(lint, node_id);
2916 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2919 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2920 lint: &'static Lint,
2924 -> DiagnosticBuilder<'tcx>
2926 let (level, src) = self.lint_level_at_node(lint, id);
2927 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2930 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2931 -> DiagnosticBuilder<'tcx>
2933 let (level, src) = self.lint_level_at_node(lint, id);
2934 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2937 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2938 self.in_scope_traits_map(id.owner)
2939 .and_then(|map| map.get(&id.local_id).cloned())
2942 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2943 self.named_region_map(id.owner)
2944 .and_then(|map| map.get(&id.local_id).cloned())
2947 pub fn is_late_bound(self, id: HirId) -> bool {
2948 self.is_late_bound_map(id.owner)
2949 .map(|set| set.contains(&id.local_id))
2953 pub fn object_lifetime_defaults(self, id: HirId)
2954 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2956 self.object_lifetime_defaults_map(id.owner)
2957 .and_then(|map| map.get(&id.local_id).cloned())
2961 pub trait InternAs<T: ?Sized, R> {
2963 fn intern_with<F>(self, f: F) -> Self::Output
2964 where F: FnOnce(&T) -> R;
2967 impl<I, T, R, E> InternAs<[T], R> for I
2968 where E: InternIteratorElement<T, R>,
2969 I: Iterator<Item=E> {
2970 type Output = E::Output;
2971 fn intern_with<F>(self, f: F) -> Self::Output
2972 where F: FnOnce(&[T]) -> R {
2973 E::intern_with(self, f)
2977 pub trait InternIteratorElement<T, R>: Sized {
2979 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2982 impl<T, R> InternIteratorElement<T, R> for T {
2984 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2985 f(&iter.collect::<SmallVec<[_; 8]>>())
2989 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2993 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2994 f(&iter.cloned().collect::<SmallVec<[_; 8]>>())
2998 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2999 type Output = Result<R, E>;
3000 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
3001 Ok(f(&iter.collect::<Result<SmallVec<[_; 8]>, _>>()?))
3005 pub fn provide(providers: &mut ty::query::Providers<'_>) {
3006 // FIXME(#44234) - almost all of these queries have no sub-queries and
3007 // therefore no actual inputs, they're just reading tables calculated in
3008 // resolve! Does this work? Unsure! That's what the issue is about
3009 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
3010 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
3011 providers.crate_name = |tcx, id| {
3012 assert_eq!(id, LOCAL_CRATE);
3015 providers.get_lib_features = |tcx, id| {
3016 assert_eq!(id, LOCAL_CRATE);
3017 Lrc::new(middle::lib_features::collect(tcx))
3019 providers.get_lang_items = |tcx, id| {
3020 assert_eq!(id, LOCAL_CRATE);
3021 Lrc::new(middle::lang_items::collect(tcx))
3023 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
3024 providers.maybe_unused_trait_import = |tcx, id| {
3025 tcx.maybe_unused_trait_imports.contains(&id)
3027 providers.maybe_unused_extern_crates = |tcx, cnum| {
3028 assert_eq!(cnum, LOCAL_CRATE);
3029 Lrc::new(tcx.maybe_unused_extern_crates.clone())
3032 providers.stability_index = |tcx, cnum| {
3033 assert_eq!(cnum, LOCAL_CRATE);
3034 Lrc::new(stability::Index::new(tcx))
3036 providers.lookup_stability = |tcx, id| {
3037 assert_eq!(id.krate, LOCAL_CRATE);
3038 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3039 tcx.stability().local_stability(id)
3041 providers.lookup_deprecation_entry = |tcx, id| {
3042 assert_eq!(id.krate, LOCAL_CRATE);
3043 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
3044 tcx.stability().local_deprecation_entry(id)
3046 providers.extern_mod_stmt_cnum = |tcx, id| {
3047 let id = tcx.hir.as_local_node_id(id).unwrap();
3048 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
3050 providers.all_crate_nums = |tcx, cnum| {
3051 assert_eq!(cnum, LOCAL_CRATE);
3052 Lrc::new(tcx.cstore.crates_untracked())
3054 providers.postorder_cnums = |tcx, cnum| {
3055 assert_eq!(cnum, LOCAL_CRATE);
3056 Lrc::new(tcx.cstore.postorder_cnums_untracked())
3058 providers.output_filenames = |tcx, cnum| {
3059 assert_eq!(cnum, LOCAL_CRATE);
3060 tcx.output_filenames.clone()
3062 providers.features_query = |tcx, cnum| {
3063 assert_eq!(cnum, LOCAL_CRATE);
3064 Lrc::new(tcx.sess.features_untracked().clone())
3066 providers.is_panic_runtime = |tcx, cnum| {
3067 assert_eq!(cnum, LOCAL_CRATE);
3068 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
3070 providers.is_compiler_builtins = |tcx, cnum| {
3071 assert_eq!(cnum, LOCAL_CRATE);
3072 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")