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, OptLevel};
18 use session::config::CrateType::*;
20 use hir::{TraitCandidate, HirId, ItemLocalId};
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, LinkMeta};
30 use middle::cstore::EncodedMetadata;
31 use middle::lang_items;
32 use middle::resolve_lifetime::{self, ObjectLifetimeDefault};
33 use middle::stability;
34 use mir::{self, Mir, interpret};
35 use mir::interpret::Allocation;
36 use ty::subst::{Kind, Substs, Subst};
39 use traits::{Clause, Clauses, Goal, Goals};
40 use ty::{self, Ty, TypeAndMut};
41 use ty::{TyS, TypeVariants, Slice};
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};
46 use ty::TypeVariants::*;
47 use ty::GenericParamDefKind;
48 use ty::layout::{LayoutDetails, TargetDataLayout};
53 use util::nodemap::{DefIdSet, ItemLocalMap};
54 use util::nodemap::{FxHashMap, FxHashSet};
55 use rustc_data_structures::accumulate_vec::AccumulateVec;
56 use rustc_data_structures::stable_hasher::{HashStable, hash_stable_hashmap,
57 StableHasher, StableHasherResult,
59 use arena::{TypedArena, SyncDroplessArena};
60 use rustc_data_structures::indexed_vec::IndexVec;
61 use rustc_data_structures::sync::{Lrc, Lock};
63 use std::borrow::Borrow;
64 use std::cmp::Ordering;
65 use std::collections::hash_map::{self, Entry};
66 use std::hash::{Hash, Hasher};
72 use rustc_target::spec::abi;
73 use syntax::ast::{self, NodeId};
75 use syntax::codemap::MultiSpan;
76 use syntax::feature_gate;
77 use syntax::symbol::{Symbol, keywords, InternedString};
82 pub struct AllArenas<'tcx> {
83 pub global: GlobalArenas<'tcx>,
84 pub interner: SyncDroplessArena,
87 impl<'tcx> AllArenas<'tcx> {
88 pub fn new() -> Self {
90 global: GlobalArenas::new(),
91 interner: SyncDroplessArena::new(),
97 pub struct GlobalArenas<'tcx> {
99 layout: TypedArena<LayoutDetails>,
102 generics: TypedArena<ty::Generics>,
103 trait_def: TypedArena<ty::TraitDef>,
104 adt_def: TypedArena<ty::AdtDef>,
105 steal_mir: TypedArena<Steal<Mir<'tcx>>>,
106 mir: TypedArena<Mir<'tcx>>,
107 tables: TypedArena<ty::TypeckTables<'tcx>>,
109 const_allocs: TypedArena<interpret::Allocation>,
112 impl<'tcx> GlobalArenas<'tcx> {
113 pub fn new() -> GlobalArenas<'tcx> {
115 layout: TypedArena::new(),
116 generics: TypedArena::new(),
117 trait_def: TypedArena::new(),
118 adt_def: TypedArena::new(),
119 steal_mir: TypedArena::new(),
120 mir: TypedArena::new(),
121 tables: TypedArena::new(),
122 const_allocs: TypedArena::new(),
127 type InternedSet<'tcx, T> = Lock<FxHashSet<Interned<'tcx, T>>>;
129 pub struct CtxtInterners<'tcx> {
130 /// The arena that types, regions, etc are allocated from
131 arena: &'tcx SyncDroplessArena,
133 /// Specifically use a speedy hash algorithm for these hash sets,
134 /// they're accessed quite often.
135 type_: InternedSet<'tcx, TyS<'tcx>>,
136 type_list: InternedSet<'tcx, Slice<Ty<'tcx>>>,
137 substs: InternedSet<'tcx, Substs<'tcx>>,
138 canonical_var_infos: InternedSet<'tcx, Slice<CanonicalVarInfo>>,
139 region: InternedSet<'tcx, RegionKind>,
140 existential_predicates: InternedSet<'tcx, Slice<ExistentialPredicate<'tcx>>>,
141 predicates: InternedSet<'tcx, Slice<Predicate<'tcx>>>,
142 const_: InternedSet<'tcx, Const<'tcx>>,
143 clauses: InternedSet<'tcx, Slice<Clause<'tcx>>>,
144 goals: InternedSet<'tcx, Slice<Goal<'tcx>>>,
147 impl<'gcx: 'tcx, 'tcx> CtxtInterners<'tcx> {
148 fn new(arena: &'tcx SyncDroplessArena) -> CtxtInterners<'tcx> {
151 type_: Default::default(),
152 type_list: Default::default(),
153 substs: Default::default(),
154 region: Default::default(),
155 existential_predicates: Default::default(),
156 canonical_var_infos: Default::default(),
157 predicates: Default::default(),
158 const_: Default::default(),
159 clauses: Default::default(),
160 goals: Default::default(),
166 local: &CtxtInterners<'tcx>,
167 global: &CtxtInterners<'gcx>,
168 st: TypeVariants<'tcx>
170 let flags = super::flags::FlagComputation::for_sty(&st);
172 // HACK(eddyb) Depend on flags being accurate to
173 // determine that all contents are in the global tcx.
174 // See comments on Lift for why we can't use that.
175 if flags.flags.intersects(ty::TypeFlags::KEEP_IN_LOCAL_TCX) {
176 let mut interner = local.type_.borrow_mut();
177 if let Some(&Interned(ty)) = interner.get(&st) {
181 let ty_struct = TyS {
184 region_depth: flags.depth,
187 // Make sure we don't end up with inference
188 // types/regions in the global interner
189 if local as *const _ as usize == global as *const _ as usize {
190 bug!("Attempted to intern `{:?}` which contains \
191 inference types/regions in the global type context",
195 // Don't be &mut TyS.
196 let ty: Ty<'tcx> = local.arena.alloc(ty_struct);
197 interner.insert(Interned(ty));
200 let mut interner = global.type_.borrow_mut();
201 if let Some(&Interned(ty)) = interner.get(&st) {
205 let ty_struct = TyS {
208 region_depth: flags.depth,
211 // This is safe because all the types the ty_struct can point to
212 // already is in the global arena
213 let ty_struct: TyS<'gcx> = unsafe {
214 mem::transmute(ty_struct)
217 // Don't be &mut TyS.
218 let ty: Ty<'gcx> = global.arena.alloc(ty_struct);
219 interner.insert(Interned(ty));
225 pub struct CommonTypes<'tcx> {
245 pub re_empty: Region<'tcx>,
246 pub re_static: Region<'tcx>,
247 pub re_erased: Region<'tcx>,
250 pub struct LocalTableInContext<'a, V: 'a> {
251 local_id_root: Option<DefId>,
252 data: &'a ItemLocalMap<V>
255 /// Validate that the given HirId (respectively its `local_id` part) can be
256 /// safely used as a key in the tables of a TypeckTable. For that to be
257 /// the case, the HirId must have the same `owner` as all the other IDs in
258 /// this table (signified by `local_id_root`). Otherwise the HirId
259 /// would be in a different frame of reference and using its `local_id`
260 /// would result in lookup errors, or worse, in silently wrong data being
262 fn validate_hir_id_for_typeck_tables(local_id_root: Option<DefId>,
265 if cfg!(debug_assertions) {
266 if let Some(local_id_root) = local_id_root {
267 if hir_id.owner != local_id_root.index {
268 ty::tls::with(|tcx| {
269 let node_id = tcx.hir
271 .find_node_for_hir_id(hir_id);
273 bug!("node {} with HirId::owner {:?} cannot be placed in \
274 TypeckTables with local_id_root {:?}",
275 tcx.hir.node_to_string(node_id),
276 DefId::local(hir_id.owner),
281 // We use "Null Object" TypeckTables in some of the analysis passes.
282 // These are just expected to be empty and their `local_id_root` is
283 // `None`. Therefore we cannot verify whether a given `HirId` would
284 // be a valid key for the given table. Instead we make sure that
285 // nobody tries to write to such a Null Object table.
287 bug!("access to invalid TypeckTables")
293 impl<'a, V> LocalTableInContext<'a, V> {
294 pub fn contains_key(&self, id: hir::HirId) -> bool {
295 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
296 self.data.contains_key(&id.local_id)
299 pub fn get(&self, id: hir::HirId) -> Option<&V> {
300 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
301 self.data.get(&id.local_id)
304 pub fn iter(&self) -> hash_map::Iter<hir::ItemLocalId, V> {
309 impl<'a, V> ::std::ops::Index<hir::HirId> for LocalTableInContext<'a, V> {
312 fn index(&self, key: hir::HirId) -> &V {
313 self.get(key).expect("LocalTableInContext: key not found")
317 pub struct LocalTableInContextMut<'a, V: 'a> {
318 local_id_root: Option<DefId>,
319 data: &'a mut ItemLocalMap<V>
322 impl<'a, V> LocalTableInContextMut<'a, V> {
323 pub fn get_mut(&mut self, id: hir::HirId) -> Option<&mut V> {
324 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
325 self.data.get_mut(&id.local_id)
328 pub fn entry(&mut self, id: hir::HirId) -> Entry<hir::ItemLocalId, V> {
329 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
330 self.data.entry(id.local_id)
333 pub fn insert(&mut self, id: hir::HirId, val: V) -> Option<V> {
334 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
335 self.data.insert(id.local_id, val)
338 pub fn remove(&mut self, id: hir::HirId) -> Option<V> {
339 validate_hir_id_for_typeck_tables(self.local_id_root, id, true);
340 self.data.remove(&id.local_id)
344 #[derive(RustcEncodable, RustcDecodable, Debug)]
345 pub struct TypeckTables<'tcx> {
346 /// The HirId::owner all ItemLocalIds in this table are relative to.
347 pub local_id_root: Option<DefId>,
349 /// Resolved definitions for `<T>::X` associated paths and
350 /// method calls, including those of overloaded operators.
351 type_dependent_defs: ItemLocalMap<Def>,
353 /// Resolved field indices for field accesses in expressions (`S { field }`, `obj.field`)
354 /// or patterns (`S { field }`). The index is often useful by itself, but to learn more
355 /// about the field you also need definition of the variant to which the field
356 /// belongs, but it may not exist if it's a tuple field (`tuple.0`).
357 field_indices: ItemLocalMap<usize>,
359 /// Stores the canonicalized types provided by the user. See also `UserAssertTy` statement in
361 user_provided_tys: ItemLocalMap<CanonicalTy<'tcx>>,
363 /// Stores the types for various nodes in the AST. Note that this table
364 /// is not guaranteed to be populated until after typeck. See
365 /// typeck::check::fn_ctxt for details.
366 node_types: ItemLocalMap<Ty<'tcx>>,
368 /// Stores the type parameters which were substituted to obtain the type
369 /// of this node. This only applies to nodes that refer to entities
370 /// parameterized by type parameters, such as generic fns, types, or
372 node_substs: ItemLocalMap<&'tcx Substs<'tcx>>,
374 adjustments: ItemLocalMap<Vec<ty::adjustment::Adjustment<'tcx>>>,
376 /// Stores the actual binding mode for all instances of hir::BindingAnnotation.
377 pat_binding_modes: ItemLocalMap<BindingMode>,
379 /// Stores the types which were implicitly dereferenced in pattern binding modes
380 /// for later usage in HAIR lowering. For example,
383 /// match &&Some(5i32) {
388 /// leads to a `vec![&&Option<i32>, &Option<i32>]`. Empty vectors are not stored.
391 /// https://github.com/rust-lang/rfcs/blob/master/text/2005-match-ergonomics.md#definitions
392 pat_adjustments: ItemLocalMap<Vec<Ty<'tcx>>>,
395 pub upvar_capture_map: ty::UpvarCaptureMap<'tcx>,
397 /// Records the reasons that we picked the kind of each closure;
398 /// not all closures are present in the map.
399 closure_kind_origins: ItemLocalMap<(Span, ast::Name)>,
401 /// For each fn, records the "liberated" types of its arguments
402 /// and return type. Liberated means that all bound regions
403 /// (including late-bound regions) are replaced with free
404 /// equivalents. This table is not used in codegen (since regions
405 /// are erased there) and hence is not serialized to metadata.
406 liberated_fn_sigs: ItemLocalMap<ty::FnSig<'tcx>>,
408 /// For each FRU expression, record the normalized types of the fields
409 /// of the struct - this is needed because it is non-trivial to
410 /// normalize while preserving regions. This table is used only in
411 /// MIR construction and hence is not serialized to metadata.
412 fru_field_types: ItemLocalMap<Vec<Ty<'tcx>>>,
414 /// Maps a cast expression to its kind. This is keyed on the
415 /// *from* expression of the cast, not the cast itself.
416 cast_kinds: ItemLocalMap<ty::cast::CastKind>,
418 /// Set of trait imports actually used in the method resolution.
419 /// This is used for warning unused imports. During type
420 /// checking, this `Lrc` should not be cloned: it must have a ref-count
421 /// of 1 so that we can insert things into the set mutably.
422 pub used_trait_imports: Lrc<DefIdSet>,
424 /// If any errors occurred while type-checking this body,
425 /// this field will be set to `true`.
426 pub tainted_by_errors: bool,
428 /// Stores the free-region relationships that were deduced from
429 /// its where clauses and parameter types. These are then
430 /// read-again by borrowck.
431 pub free_region_map: FreeRegionMap<'tcx>,
434 impl<'tcx> TypeckTables<'tcx> {
435 pub fn empty(local_id_root: Option<DefId>) -> TypeckTables<'tcx> {
438 type_dependent_defs: ItemLocalMap(),
439 field_indices: ItemLocalMap(),
440 user_provided_tys: ItemLocalMap(),
441 node_types: ItemLocalMap(),
442 node_substs: ItemLocalMap(),
443 adjustments: ItemLocalMap(),
444 pat_binding_modes: ItemLocalMap(),
445 pat_adjustments: ItemLocalMap(),
446 upvar_capture_map: FxHashMap(),
447 closure_kind_origins: ItemLocalMap(),
448 liberated_fn_sigs: ItemLocalMap(),
449 fru_field_types: ItemLocalMap(),
450 cast_kinds: ItemLocalMap(),
451 used_trait_imports: Lrc::new(DefIdSet()),
452 tainted_by_errors: false,
453 free_region_map: FreeRegionMap::new(),
457 /// Returns the final resolution of a `QPath` in an `Expr` or `Pat` node.
458 pub fn qpath_def(&self, qpath: &hir::QPath, id: hir::HirId) -> Def {
460 hir::QPath::Resolved(_, ref path) => path.def,
461 hir::QPath::TypeRelative(..) => {
462 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
463 self.type_dependent_defs.get(&id.local_id).cloned().unwrap_or(Def::Err)
468 pub fn type_dependent_defs(&self) -> LocalTableInContext<Def> {
469 LocalTableInContext {
470 local_id_root: self.local_id_root,
471 data: &self.type_dependent_defs
475 pub fn type_dependent_defs_mut(&mut self) -> LocalTableInContextMut<Def> {
476 LocalTableInContextMut {
477 local_id_root: self.local_id_root,
478 data: &mut self.type_dependent_defs
482 pub fn field_indices(&self) -> LocalTableInContext<usize> {
483 LocalTableInContext {
484 local_id_root: self.local_id_root,
485 data: &self.field_indices
489 pub fn field_indices_mut(&mut self) -> LocalTableInContextMut<usize> {
490 LocalTableInContextMut {
491 local_id_root: self.local_id_root,
492 data: &mut self.field_indices
496 pub fn user_provided_tys(&self) -> LocalTableInContext<CanonicalTy<'tcx>> {
497 LocalTableInContext {
498 local_id_root: self.local_id_root,
499 data: &self.user_provided_tys
503 pub fn user_provided_tys_mut(&mut self) -> LocalTableInContextMut<CanonicalTy<'tcx>> {
504 LocalTableInContextMut {
505 local_id_root: self.local_id_root,
506 data: &mut self.user_provided_tys
510 pub fn node_types(&self) -> LocalTableInContext<Ty<'tcx>> {
511 LocalTableInContext {
512 local_id_root: self.local_id_root,
513 data: &self.node_types
517 pub fn node_types_mut(&mut self) -> LocalTableInContextMut<Ty<'tcx>> {
518 LocalTableInContextMut {
519 local_id_root: self.local_id_root,
520 data: &mut self.node_types
524 pub fn node_id_to_type(&self, id: hir::HirId) -> Ty<'tcx> {
525 match self.node_id_to_type_opt(id) {
528 bug!("node_id_to_type: no type for node `{}`",
530 let id = tcx.hir.definitions().find_node_for_hir_id(id);
531 tcx.hir.node_to_string(id)
537 pub fn node_id_to_type_opt(&self, id: hir::HirId) -> Option<Ty<'tcx>> {
538 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
539 self.node_types.get(&id.local_id).cloned()
542 pub fn node_substs_mut(&mut self) -> LocalTableInContextMut<&'tcx Substs<'tcx>> {
543 LocalTableInContextMut {
544 local_id_root: self.local_id_root,
545 data: &mut self.node_substs
549 pub fn node_substs(&self, id: hir::HirId) -> &'tcx Substs<'tcx> {
550 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
551 self.node_substs.get(&id.local_id).cloned().unwrap_or(Substs::empty())
554 pub fn node_substs_opt(&self, id: hir::HirId) -> Option<&'tcx Substs<'tcx>> {
555 validate_hir_id_for_typeck_tables(self.local_id_root, id, false);
556 self.node_substs.get(&id.local_id).cloned()
559 // Returns the type of a pattern as a monotype. Like @expr_ty, this function
560 // doesn't provide type parameter substitutions.
561 pub fn pat_ty(&self, pat: &hir::Pat) -> Ty<'tcx> {
562 self.node_id_to_type(pat.hir_id)
565 pub fn pat_ty_opt(&self, pat: &hir::Pat) -> Option<Ty<'tcx>> {
566 self.node_id_to_type_opt(pat.hir_id)
569 // Returns the type of an expression as a monotype.
571 // NB (1): This is the PRE-ADJUSTMENT TYPE for the expression. That is, in
572 // some cases, we insert `Adjustment` annotations such as auto-deref or
573 // auto-ref. The type returned by this function does not consider such
574 // adjustments. See `expr_ty_adjusted()` instead.
576 // NB (2): This type doesn't provide type parameter substitutions; e.g. if you
577 // ask for the type of "id" in "id(3)", it will return "fn(&isize) -> isize"
578 // instead of "fn(ty) -> T with T = isize".
579 pub fn expr_ty(&self, expr: &hir::Expr) -> Ty<'tcx> {
580 self.node_id_to_type(expr.hir_id)
583 pub fn expr_ty_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
584 self.node_id_to_type_opt(expr.hir_id)
587 pub fn adjustments(&self) -> LocalTableInContext<Vec<ty::adjustment::Adjustment<'tcx>>> {
588 LocalTableInContext {
589 local_id_root: self.local_id_root,
590 data: &self.adjustments
594 pub fn adjustments_mut(&mut self)
595 -> LocalTableInContextMut<Vec<ty::adjustment::Adjustment<'tcx>>> {
596 LocalTableInContextMut {
597 local_id_root: self.local_id_root,
598 data: &mut self.adjustments
602 pub fn expr_adjustments(&self, expr: &hir::Expr)
603 -> &[ty::adjustment::Adjustment<'tcx>] {
604 validate_hir_id_for_typeck_tables(self.local_id_root, expr.hir_id, false);
605 self.adjustments.get(&expr.hir_id.local_id).map_or(&[], |a| &a[..])
608 /// Returns the type of `expr`, considering any `Adjustment`
609 /// entry recorded for that expression.
610 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> Ty<'tcx> {
611 self.expr_adjustments(expr)
613 .map_or_else(|| self.expr_ty(expr), |adj| adj.target)
616 pub fn expr_ty_adjusted_opt(&self, expr: &hir::Expr) -> Option<Ty<'tcx>> {
617 self.expr_adjustments(expr)
619 .map(|adj| adj.target)
620 .or_else(|| self.expr_ty_opt(expr))
623 pub fn is_method_call(&self, expr: &hir::Expr) -> bool {
624 // Only paths and method calls/overloaded operators have
625 // entries in type_dependent_defs, ignore the former here.
626 if let hir::ExprPath(_) = expr.node {
630 match self.type_dependent_defs().get(expr.hir_id) {
631 Some(&Def::Method(_)) => true,
636 pub fn pat_binding_modes(&self) -> LocalTableInContext<BindingMode> {
637 LocalTableInContext {
638 local_id_root: self.local_id_root,
639 data: &self.pat_binding_modes
643 pub fn pat_binding_modes_mut(&mut self)
644 -> LocalTableInContextMut<BindingMode> {
645 LocalTableInContextMut {
646 local_id_root: self.local_id_root,
647 data: &mut self.pat_binding_modes
651 pub fn pat_adjustments(&self) -> LocalTableInContext<Vec<Ty<'tcx>>> {
652 LocalTableInContext {
653 local_id_root: self.local_id_root,
654 data: &self.pat_adjustments,
658 pub fn pat_adjustments_mut(&mut self)
659 -> LocalTableInContextMut<Vec<Ty<'tcx>>> {
660 LocalTableInContextMut {
661 local_id_root: self.local_id_root,
662 data: &mut self.pat_adjustments,
666 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> ty::UpvarCapture<'tcx> {
667 self.upvar_capture_map[&upvar_id]
670 pub fn closure_kind_origins(&self) -> LocalTableInContext<(Span, ast::Name)> {
671 LocalTableInContext {
672 local_id_root: self.local_id_root,
673 data: &self.closure_kind_origins
677 pub fn closure_kind_origins_mut(&mut self) -> LocalTableInContextMut<(Span, ast::Name)> {
678 LocalTableInContextMut {
679 local_id_root: self.local_id_root,
680 data: &mut self.closure_kind_origins
684 pub fn liberated_fn_sigs(&self) -> LocalTableInContext<ty::FnSig<'tcx>> {
685 LocalTableInContext {
686 local_id_root: self.local_id_root,
687 data: &self.liberated_fn_sigs
691 pub fn liberated_fn_sigs_mut(&mut self) -> LocalTableInContextMut<ty::FnSig<'tcx>> {
692 LocalTableInContextMut {
693 local_id_root: self.local_id_root,
694 data: &mut self.liberated_fn_sigs
698 pub fn fru_field_types(&self) -> LocalTableInContext<Vec<Ty<'tcx>>> {
699 LocalTableInContext {
700 local_id_root: self.local_id_root,
701 data: &self.fru_field_types
705 pub fn fru_field_types_mut(&mut self) -> LocalTableInContextMut<Vec<Ty<'tcx>>> {
706 LocalTableInContextMut {
707 local_id_root: self.local_id_root,
708 data: &mut self.fru_field_types
712 pub fn cast_kinds(&self) -> LocalTableInContext<ty::cast::CastKind> {
713 LocalTableInContext {
714 local_id_root: self.local_id_root,
715 data: &self.cast_kinds
719 pub fn cast_kinds_mut(&mut self) -> LocalTableInContextMut<ty::cast::CastKind> {
720 LocalTableInContextMut {
721 local_id_root: self.local_id_root,
722 data: &mut self.cast_kinds
727 impl<'a, 'gcx> HashStable<StableHashingContext<'a>> for TypeckTables<'gcx> {
728 fn hash_stable<W: StableHasherResult>(&self,
729 hcx: &mut StableHashingContext<'a>,
730 hasher: &mut StableHasher<W>) {
731 let ty::TypeckTables {
733 ref type_dependent_defs,
735 ref user_provided_tys,
739 ref pat_binding_modes,
741 ref upvar_capture_map,
742 ref closure_kind_origins,
743 ref liberated_fn_sigs,
748 ref used_trait_imports,
753 hcx.with_node_id_hashing_mode(NodeIdHashingMode::HashDefPath, |hcx| {
754 type_dependent_defs.hash_stable(hcx, hasher);
755 field_indices.hash_stable(hcx, hasher);
756 user_provided_tys.hash_stable(hcx, hasher);
757 node_types.hash_stable(hcx, hasher);
758 node_substs.hash_stable(hcx, hasher);
759 adjustments.hash_stable(hcx, hasher);
760 pat_binding_modes.hash_stable(hcx, hasher);
761 pat_adjustments.hash_stable(hcx, hasher);
762 hash_stable_hashmap(hcx, hasher, upvar_capture_map, |up_var_id, hcx| {
769 local_id_root.expect("trying to hash invalid TypeckTables");
771 let var_owner_def_id = DefId {
772 krate: local_id_root.krate,
775 let closure_def_id = DefId {
776 krate: local_id_root.krate,
777 index: closure_expr_id.to_def_id().index,
779 (hcx.def_path_hash(var_owner_def_id),
781 hcx.def_path_hash(closure_def_id))
784 closure_kind_origins.hash_stable(hcx, hasher);
785 liberated_fn_sigs.hash_stable(hcx, hasher);
786 fru_field_types.hash_stable(hcx, hasher);
787 cast_kinds.hash_stable(hcx, hasher);
788 used_trait_imports.hash_stable(hcx, hasher);
789 tainted_by_errors.hash_stable(hcx, hasher);
790 free_region_map.hash_stable(hcx, hasher);
795 impl<'tcx> CommonTypes<'tcx> {
796 fn new(interners: &CtxtInterners<'tcx>) -> CommonTypes<'tcx> {
797 let mk = |sty| CtxtInterners::intern_ty(interners, interners, sty);
798 let mk_region = |r| {
799 if let Some(r) = interners.region.borrow().get(&r) {
802 let r = interners.arena.alloc(r);
803 interners.region.borrow_mut().insert(Interned(r));
811 isize: mk(TyInt(ast::IntTy::Isize)),
812 i8: mk(TyInt(ast::IntTy::I8)),
813 i16: mk(TyInt(ast::IntTy::I16)),
814 i32: mk(TyInt(ast::IntTy::I32)),
815 i64: mk(TyInt(ast::IntTy::I64)),
816 i128: mk(TyInt(ast::IntTy::I128)),
817 usize: mk(TyUint(ast::UintTy::Usize)),
818 u8: mk(TyUint(ast::UintTy::U8)),
819 u16: mk(TyUint(ast::UintTy::U16)),
820 u32: mk(TyUint(ast::UintTy::U32)),
821 u64: mk(TyUint(ast::UintTy::U64)),
822 u128: mk(TyUint(ast::UintTy::U128)),
823 f32: mk(TyFloat(ast::FloatTy::F32)),
824 f64: mk(TyFloat(ast::FloatTy::F64)),
826 re_empty: mk_region(RegionKind::ReEmpty),
827 re_static: mk_region(RegionKind::ReStatic),
828 re_erased: mk_region(RegionKind::ReErased),
833 /// The central data structure of the compiler. It stores references
834 /// to the various **arenas** and also houses the results of the
835 /// various **compiler queries** that have been performed. See the
836 /// [rustc guide] for more details.
838 /// [rustc guide]: https://rust-lang-nursery.github.io/rustc-guide/ty.html
839 #[derive(Copy, Clone)]
840 pub struct TyCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
841 gcx: &'a GlobalCtxt<'gcx>,
842 interners: &'a CtxtInterners<'tcx>
845 impl<'a, 'gcx, 'tcx> Deref for TyCtxt<'a, 'gcx, 'tcx> {
846 type Target = &'a GlobalCtxt<'gcx>;
847 fn deref(&self) -> &Self::Target {
852 pub struct GlobalCtxt<'tcx> {
853 global_arenas: &'tcx GlobalArenas<'tcx>,
854 global_interners: CtxtInterners<'tcx>,
856 cstore: &'tcx CrateStoreDyn,
858 pub sess: &'tcx Session,
860 pub dep_graph: DepGraph,
862 /// This provides access to the incr. comp. on-disk cache for query results.
863 /// Do not access this directly. It is only meant to be used by
864 /// `DepGraph::try_mark_green()` and the query infrastructure in `ty::maps`.
865 pub(crate) on_disk_query_result_cache: maps::OnDiskCache<'tcx>,
867 /// Common types, pre-interned for your convenience.
868 pub types: CommonTypes<'tcx>,
870 /// Map indicating what traits are in scope for places where this
871 /// is relevant; generated by resolve.
872 trait_map: FxHashMap<DefIndex,
873 Lrc<FxHashMap<ItemLocalId,
874 Lrc<StableVec<TraitCandidate>>>>>,
876 /// Export map produced by name resolution.
877 export_map: FxHashMap<DefId, Lrc<Vec<Export>>>,
879 pub hir: hir_map::Map<'tcx>,
881 /// A map from DefPathHash -> DefId. Includes DefIds from the local crate
882 /// as well as all upstream crates. Only populated in incremental mode.
883 pub def_path_hash_to_def_id: Option<FxHashMap<DefPathHash, DefId>>,
885 pub maps: maps::Maps<'tcx>,
887 // Records the free variables refrenced by every closure
888 // expression. Do not track deps for this, just recompute it from
889 // scratch every time.
890 freevars: FxHashMap<DefId, Lrc<Vec<hir::Freevar>>>,
892 maybe_unused_trait_imports: FxHashSet<DefId>,
894 maybe_unused_extern_crates: Vec<(DefId, Span)>,
896 // Internal cache for metadata decoding. No need to track deps on this.
897 pub rcache: Lock<FxHashMap<ty::CReaderCacheKey, Ty<'tcx>>>,
899 /// Caches the results of trait selection. This cache is used
900 /// for things that do not have to do with the parameters in scope.
901 pub selection_cache: traits::SelectionCache<'tcx>,
903 /// Caches the results of trait evaluation. This cache is used
904 /// for things that do not have to do with the parameters in scope.
905 /// Merge this with `selection_cache`?
906 pub evaluation_cache: traits::EvaluationCache<'tcx>,
908 /// The definite name of the current crate after taking into account
909 /// attributes, commandline parameters, etc.
910 pub crate_name: Symbol,
912 /// Data layout specification for the current target.
913 pub data_layout: TargetDataLayout,
915 stability_interner: Lock<FxHashSet<&'tcx attr::Stability>>,
917 /// Stores the value of constants (and deduplicates the actual memory)
918 allocation_interner: Lock<FxHashSet<&'tcx Allocation>>,
920 pub alloc_map: Lock<interpret::AllocMap<'tcx, &'tcx Allocation>>,
922 layout_interner: Lock<FxHashSet<&'tcx LayoutDetails>>,
924 /// A general purpose channel to throw data out the back towards LLVM worker
927 /// This is intended to only get used during the codegen phase of the compiler
928 /// when satisfying the query for a particular codegen unit. Internally in
929 /// the query it'll send data along this channel to get processed later.
930 pub tx_to_llvm_workers: Lock<mpsc::Sender<Box<dyn Any + Send>>>,
932 output_filenames: Arc<OutputFilenames>,
935 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
936 /// Get the global TyCtxt.
938 pub fn global_tcx(self) -> TyCtxt<'a, 'gcx, 'gcx> {
941 interners: &self.gcx.global_interners,
945 pub fn alloc_generics(self, generics: ty::Generics) -> &'gcx ty::Generics {
946 self.global_arenas.generics.alloc(generics)
949 pub fn alloc_steal_mir(self, mir: Mir<'gcx>) -> &'gcx Steal<Mir<'gcx>> {
950 self.global_arenas.steal_mir.alloc(Steal::new(mir))
953 pub fn alloc_mir(self, mir: Mir<'gcx>) -> &'gcx Mir<'gcx> {
954 self.global_arenas.mir.alloc(mir)
957 pub fn alloc_tables(self, tables: ty::TypeckTables<'gcx>) -> &'gcx ty::TypeckTables<'gcx> {
958 self.global_arenas.tables.alloc(tables)
961 pub fn alloc_trait_def(self, def: ty::TraitDef) -> &'gcx ty::TraitDef {
962 self.global_arenas.trait_def.alloc(def)
965 pub fn alloc_adt_def(self,
968 variants: Vec<ty::VariantDef>,
970 -> &'gcx ty::AdtDef {
971 let def = ty::AdtDef::new(self, did, kind, variants, repr);
972 self.global_arenas.adt_def.alloc(def)
975 pub fn alloc_byte_array(self, bytes: &[u8]) -> &'gcx [u8] {
976 if bytes.is_empty() {
979 self.global_interners.arena.alloc_slice(bytes)
983 pub fn alloc_const_slice(self, values: &[&'tcx ty::Const<'tcx>])
984 -> &'tcx [&'tcx ty::Const<'tcx>] {
985 if values.is_empty() {
988 self.interners.arena.alloc_slice(values)
992 pub fn alloc_name_const_slice(self, values: &[(ast::Name, &'tcx ty::Const<'tcx>)])
993 -> &'tcx [(ast::Name, &'tcx ty::Const<'tcx>)] {
994 if values.is_empty() {
997 self.interners.arena.alloc_slice(values)
1001 pub fn intern_const_alloc(
1004 ) -> &'gcx Allocation {
1005 let allocs = &mut self.allocation_interner.borrow_mut();
1006 if let Some(alloc) = allocs.get(&alloc) {
1010 let interned = self.global_arenas.const_allocs.alloc(alloc);
1011 if let Some(prev) = allocs.replace(interned) {
1012 bug!("Tried to overwrite interned Allocation: {:#?}", prev)
1017 /// Allocates a byte or string literal for `mir::interpret`
1018 pub fn allocate_bytes(self, bytes: &[u8]) -> interpret::AllocId {
1019 // create an allocation that just contains these bytes
1020 let alloc = interpret::Allocation::from_byte_aligned_bytes(bytes);
1021 let alloc = self.intern_const_alloc(alloc);
1022 self.alloc_map.lock().allocate(alloc)
1025 pub fn intern_stability(self, stab: attr::Stability) -> &'gcx attr::Stability {
1026 let mut stability_interner = self.stability_interner.borrow_mut();
1027 if let Some(st) = stability_interner.get(&stab) {
1031 let interned = self.global_interners.arena.alloc(stab);
1032 if let Some(prev) = stability_interner.replace(interned) {
1033 bug!("Tried to overwrite interned Stability: {:?}", prev)
1038 pub fn intern_layout(self, layout: LayoutDetails) -> &'gcx LayoutDetails {
1039 let mut layout_interner = self.layout_interner.borrow_mut();
1040 if let Some(layout) = layout_interner.get(&layout) {
1044 let interned = self.global_arenas.layout.alloc(layout);
1045 if let Some(prev) = layout_interner.replace(interned) {
1046 bug!("Tried to overwrite interned Layout: {:?}", prev)
1051 pub fn lift<T: ?Sized + Lift<'tcx>>(self, value: &T) -> Option<T::Lifted> {
1052 value.lift_to_tcx(self)
1055 /// Like lift, but only tries in the global tcx.
1056 pub fn lift_to_global<T: ?Sized + Lift<'gcx>>(self, value: &T) -> Option<T::Lifted> {
1057 value.lift_to_tcx(self.global_tcx())
1060 /// Returns true if self is the same as self.global_tcx().
1061 fn is_global(self) -> bool {
1062 let local = self.interners as *const _;
1063 let global = &self.global_interners as *const _;
1064 local as usize == global as usize
1067 /// Create a type context and call the closure with a `TyCtxt` reference
1068 /// to the context. The closure enforces that the type context and any interned
1069 /// value (types, substs, etc.) can only be used while `ty::tls` has a valid
1070 /// reference to the context, to allow formatting values that need it.
1071 pub fn create_and_enter<F, R>(s: &'tcx Session,
1072 cstore: &'tcx CrateStoreDyn,
1073 local_providers: ty::maps::Providers<'tcx>,
1074 extern_providers: ty::maps::Providers<'tcx>,
1075 arenas: &'tcx AllArenas<'tcx>,
1076 resolutions: ty::Resolutions,
1077 hir: hir_map::Map<'tcx>,
1078 on_disk_query_result_cache: maps::OnDiskCache<'tcx>,
1080 tx: mpsc::Sender<Box<dyn Any + Send>>,
1081 output_filenames: &OutputFilenames,
1083 where F: for<'b> FnOnce(TyCtxt<'b, 'tcx, 'tcx>) -> R
1085 let data_layout = TargetDataLayout::parse(&s.target.target).unwrap_or_else(|err| {
1088 let interners = CtxtInterners::new(&arenas.interner);
1089 let common_types = CommonTypes::new(&interners);
1090 let dep_graph = hir.dep_graph.clone();
1091 let max_cnum = cstore.crates_untracked().iter().map(|c| c.as_usize()).max().unwrap_or(0);
1092 let mut providers = IndexVec::from_elem_n(extern_providers, max_cnum + 1);
1093 providers[LOCAL_CRATE] = local_providers;
1095 let def_path_hash_to_def_id = if s.opts.build_dep_graph() {
1096 let upstream_def_path_tables: Vec<(CrateNum, Lrc<_>)> = cstore
1099 .map(|&cnum| (cnum, cstore.def_path_table(cnum)))
1102 let def_path_tables = || {
1103 upstream_def_path_tables
1105 .map(|&(cnum, ref rc)| (cnum, &**rc))
1106 .chain(iter::once((LOCAL_CRATE, hir.definitions().def_path_table())))
1109 // Precompute the capacity of the hashmap so we don't have to
1110 // re-allocate when populating it.
1111 let capacity = def_path_tables().map(|(_, t)| t.size()).sum::<usize>();
1113 let mut map: FxHashMap<_, _> = FxHashMap::with_capacity_and_hasher(
1115 ::std::default::Default::default()
1118 for (cnum, def_path_table) in def_path_tables() {
1119 def_path_table.add_def_path_hashes_to(cnum, &mut map);
1127 let mut trait_map = FxHashMap();
1128 for (k, v) in resolutions.trait_map {
1129 let hir_id = hir.node_to_hir_id(k);
1130 let map = trait_map.entry(hir_id.owner)
1131 .or_insert_with(|| Lrc::new(FxHashMap()));
1132 Lrc::get_mut(map).unwrap()
1133 .insert(hir_id.local_id,
1134 Lrc::new(StableVec::new(v)));
1137 let gcx = &GlobalCtxt {
1140 global_arenas: &arenas.global,
1141 global_interners: interners,
1142 dep_graph: dep_graph.clone(),
1143 on_disk_query_result_cache,
1144 types: common_types,
1146 export_map: resolutions.export_map.into_iter().map(|(k, v)| {
1149 freevars: resolutions.freevars.into_iter().map(|(k, v)| {
1150 (hir.local_def_id(k), Lrc::new(v))
1152 maybe_unused_trait_imports:
1153 resolutions.maybe_unused_trait_imports
1155 .map(|id| hir.local_def_id(id))
1157 maybe_unused_extern_crates:
1158 resolutions.maybe_unused_extern_crates
1160 .map(|(id, sp)| (hir.local_def_id(id), sp))
1163 def_path_hash_to_def_id,
1164 maps: maps::Maps::new(providers),
1165 rcache: Lock::new(FxHashMap()),
1166 selection_cache: traits::SelectionCache::new(),
1167 evaluation_cache: traits::EvaluationCache::new(),
1168 crate_name: Symbol::intern(crate_name),
1170 layout_interner: Lock::new(FxHashSet()),
1171 stability_interner: Lock::new(FxHashSet()),
1172 allocation_interner: Lock::new(FxHashSet()),
1173 alloc_map: Lock::new(interpret::AllocMap::new()),
1174 tx_to_llvm_workers: Lock::new(tx),
1175 output_filenames: Arc::new(output_filenames.clone()),
1178 tls::enter_global(gcx, f)
1181 pub fn consider_optimizing<T: Fn() -> String>(&self, msg: T) -> bool {
1182 let cname = self.crate_name(LOCAL_CRATE).as_str();
1183 self.sess.consider_optimizing(&cname, msg)
1186 pub fn lang_items(self) -> Lrc<middle::lang_items::LanguageItems> {
1187 self.get_lang_items(LOCAL_CRATE)
1190 /// Due to missing llvm support for lowering 128 bit math to software emulation
1191 /// (on some targets), the lowering can be done in MIR.
1193 /// This function only exists until said support is implemented.
1194 pub fn is_binop_lang_item(&self, def_id: DefId) -> Option<(mir::BinOp, bool)> {
1195 let items = self.lang_items();
1196 let def_id = Some(def_id);
1197 if items.i128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1198 else if items.u128_add_fn() == def_id { Some((mir::BinOp::Add, false)) }
1199 else if items.i128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1200 else if items.u128_sub_fn() == def_id { Some((mir::BinOp::Sub, false)) }
1201 else if items.i128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1202 else if items.u128_mul_fn() == def_id { Some((mir::BinOp::Mul, false)) }
1203 else if items.i128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1204 else if items.u128_div_fn() == def_id { Some((mir::BinOp::Div, false)) }
1205 else if items.i128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1206 else if items.u128_rem_fn() == def_id { Some((mir::BinOp::Rem, false)) }
1207 else if items.i128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1208 else if items.u128_shl_fn() == def_id { Some((mir::BinOp::Shl, false)) }
1209 else if items.i128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1210 else if items.u128_shr_fn() == def_id { Some((mir::BinOp::Shr, false)) }
1211 else if items.i128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1212 else if items.u128_addo_fn() == def_id { Some((mir::BinOp::Add, true)) }
1213 else if items.i128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1214 else if items.u128_subo_fn() == def_id { Some((mir::BinOp::Sub, true)) }
1215 else if items.i128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1216 else if items.u128_mulo_fn() == def_id { Some((mir::BinOp::Mul, true)) }
1217 else if items.i128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1218 else if items.u128_shlo_fn() == def_id { Some((mir::BinOp::Shl, true)) }
1219 else if items.i128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1220 else if items.u128_shro_fn() == def_id { Some((mir::BinOp::Shr, true)) }
1224 pub fn stability(self) -> Lrc<stability::Index<'tcx>> {
1225 self.stability_index(LOCAL_CRATE)
1228 pub fn crates(self) -> Lrc<Vec<CrateNum>> {
1229 self.all_crate_nums(LOCAL_CRATE)
1232 pub fn features(self) -> Lrc<feature_gate::Features> {
1233 self.features_query(LOCAL_CRATE)
1236 pub fn def_key(self, id: DefId) -> hir_map::DefKey {
1238 self.hir.def_key(id)
1240 self.cstore.def_key(id)
1244 /// Convert a `DefId` into its fully expanded `DefPath` (every
1245 /// `DefId` is really just an interned def-path).
1247 /// Note that if `id` is not local to this crate, the result will
1248 /// be a non-local `DefPath`.
1249 pub fn def_path(self, id: DefId) -> hir_map::DefPath {
1251 self.hir.def_path(id)
1253 self.cstore.def_path(id)
1258 pub fn def_path_hash(self, def_id: DefId) -> hir_map::DefPathHash {
1259 if def_id.is_local() {
1260 self.hir.definitions().def_path_hash(def_id.index)
1262 self.cstore.def_path_hash(def_id)
1266 pub fn def_path_debug_str(self, def_id: DefId) -> String {
1267 // We are explicitly not going through queries here in order to get
1268 // crate name and disambiguator since this code is called from debug!()
1269 // statements within the query system and we'd run into endless
1270 // recursion otherwise.
1271 let (crate_name, crate_disambiguator) = if def_id.is_local() {
1272 (self.crate_name.clone(),
1273 self.sess.local_crate_disambiguator())
1275 (self.cstore.crate_name_untracked(def_id.krate),
1276 self.cstore.crate_disambiguator_untracked(def_id.krate))
1281 // Don't print the whole crate disambiguator. That's just
1282 // annoying in debug output.
1283 &(crate_disambiguator.to_fingerprint().to_hex())[..4],
1284 self.def_path(def_id).to_string_no_crate())
1287 pub fn metadata_encoding_version(self) -> Vec<u8> {
1288 self.cstore.metadata_encoding_version().to_vec()
1291 // Note that this is *untracked* and should only be used within the query
1292 // system if the result is otherwise tracked through queries
1293 pub fn crate_data_as_rc_any(self, cnum: CrateNum) -> Lrc<dyn Any> {
1294 self.cstore.crate_data_as_rc_any(cnum)
1297 pub fn create_stable_hashing_context(self) -> StableHashingContext<'a> {
1298 let krate = self.dep_graph.with_ignore(|| self.gcx.hir.krate());
1300 StableHashingContext::new(self.sess,
1302 self.hir.definitions(),
1306 // This method makes sure that we have a DepNode and a Fingerprint for
1307 // every upstream crate. It needs to be called once right after the tcx is
1309 // With full-fledged red/green, the method will probably become unnecessary
1310 // as this will be done on-demand.
1311 pub fn allocate_metadata_dep_nodes(self) {
1312 // We cannot use the query versions of crates() and crate_hash(), since
1313 // those would need the DepNodes that we are allocating here.
1314 for cnum in self.cstore.crates_untracked() {
1315 let dep_node = DepNode::new(self, DepConstructor::CrateMetadata(cnum));
1316 let crate_hash = self.cstore.crate_hash_untracked(cnum);
1317 self.dep_graph.with_task(dep_node,
1320 |_, x| x // No transformation needed
1325 // This method exercises the `in_scope_traits_map` query for all possible
1326 // values so that we have their fingerprints available in the DepGraph.
1327 // This is only required as long as we still use the old dependency tracking
1328 // which needs to have the fingerprints of all input nodes beforehand.
1329 pub fn precompute_in_scope_traits_hashes(self) {
1330 for &def_index in self.trait_map.keys() {
1331 self.in_scope_traits_map(def_index);
1335 pub fn serialize_query_result_cache<E>(self,
1337 -> Result<(), E::Error>
1338 where E: ty::codec::TyEncoder
1340 self.on_disk_query_result_cache.serialize(self.global_tcx(), encoder)
1343 /// If true, we should use the MIR-based borrowck (we may *also* use
1344 /// the AST-based borrowck).
1345 pub fn use_mir_borrowck(self) -> bool {
1346 self.borrowck_mode().use_mir()
1349 /// If true, pattern variables for use in guards on match arms
1350 /// will be bound as references to the data, and occurrences of
1351 /// those variables in the guard expression will implicitly
1352 /// dereference those bindings. (See rust-lang/rust#27282.)
1353 pub fn all_pat_vars_are_implicit_refs_within_guards(self) -> bool {
1354 self.borrowck_mode().use_mir()
1357 /// If true, we should enable two-phase borrows checks. This is
1358 /// done with either `-Ztwo-phase-borrows` or with
1359 /// `#![feature(nll)]`.
1360 pub fn two_phase_borrows(self) -> bool {
1361 self.features().nll || self.sess.opts.debugging_opts.two_phase_borrows
1364 /// What mode(s) of borrowck should we run? AST? MIR? both?
1365 /// (Also considers the `#![feature(nll)]` setting.)
1366 pub fn borrowck_mode(&self) -> BorrowckMode {
1367 match self.sess.opts.borrowck_mode {
1368 mode @ BorrowckMode::Mir |
1369 mode @ BorrowckMode::Compare => mode,
1371 mode @ BorrowckMode::Ast => {
1372 if self.features().nll {
1382 /// Should we emit EndRegion MIR statements? These are consumed by
1383 /// MIR borrowck, but not when NLL is used. They are also consumed
1384 /// by the validation stuff.
1385 pub fn emit_end_regions(self) -> bool {
1386 self.sess.opts.debugging_opts.emit_end_regions ||
1387 self.sess.opts.debugging_opts.mir_emit_validate > 0 ||
1388 self.use_mir_borrowck()
1392 pub fn share_generics(self) -> bool {
1393 match self.sess.opts.debugging_opts.share_generics {
1394 Some(setting) => setting,
1396 self.sess.opts.incremental.is_some() ||
1397 match self.sess.opts.optimize {
1401 OptLevel::SizeMin => true,
1403 OptLevel::Aggressive => false,
1410 pub fn local_crate_exports_generics(self) -> bool {
1411 debug_assert!(self.share_generics());
1413 self.sess.crate_types.borrow().iter().any(|crate_type| {
1415 CrateTypeExecutable |
1416 CrateTypeStaticlib |
1417 CrateTypeProcMacro |
1418 CrateTypeCdylib => false,
1420 CrateTypeDylib => true,
1426 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1427 pub fn encode_metadata(self, link_meta: &LinkMeta)
1430 self.cstore.encode_metadata(self, link_meta)
1434 impl<'gcx: 'tcx, 'tcx> GlobalCtxt<'gcx> {
1435 /// Call the closure with a local `TyCtxt` using the given arena.
1436 pub fn enter_local<F, R>(
1438 arena: &'tcx SyncDroplessArena,
1442 F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1444 let interners = CtxtInterners::new(arena);
1447 interners: &interners,
1449 ty::tls::with_related_context(tcx.global_tcx(), |icx| {
1450 let new_icx = ty::tls::ImplicitCtxt {
1452 query: icx.query.clone(),
1453 layout_depth: icx.layout_depth,
1456 ty::tls::enter_context(&new_icx, |new_icx| {
1463 /// A trait implemented for all X<'a> types which can be safely and
1464 /// efficiently converted to X<'tcx> as long as they are part of the
1465 /// provided TyCtxt<'tcx>.
1466 /// This can be done, for example, for Ty<'tcx> or &'tcx Substs<'tcx>
1467 /// by looking them up in their respective interners.
1469 /// However, this is still not the best implementation as it does
1470 /// need to compare the components, even for interned values.
1471 /// It would be more efficient if TypedArena provided a way to
1472 /// determine whether the address is in the allocated range.
1474 /// None is returned if the value or one of the components is not part
1475 /// of the provided context.
1476 /// For Ty, None can be returned if either the type interner doesn't
1477 /// contain the TypeVariants key or if the address of the interned
1478 /// pointer differs. The latter case is possible if a primitive type,
1479 /// e.g. `()` or `u8`, was interned in a different context.
1480 pub trait Lift<'tcx> {
1482 fn lift_to_tcx<'a, 'gcx>(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Option<Self::Lifted>;
1485 impl<'a, 'tcx> Lift<'tcx> for Ty<'a> {
1486 type Lifted = Ty<'tcx>;
1487 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Ty<'tcx>> {
1488 if tcx.interners.arena.in_arena(*self as *const _) {
1489 return Some(unsafe { mem::transmute(*self) });
1491 // Also try in the global tcx if we're not that.
1492 if !tcx.is_global() {
1493 self.lift_to_tcx(tcx.global_tcx())
1500 impl<'a, 'tcx> Lift<'tcx> for Region<'a> {
1501 type Lifted = Region<'tcx>;
1502 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Region<'tcx>> {
1503 if tcx.interners.arena.in_arena(*self as *const _) {
1504 return Some(unsafe { mem::transmute(*self) });
1506 // Also try in the global tcx if we're not that.
1507 if !tcx.is_global() {
1508 self.lift_to_tcx(tcx.global_tcx())
1515 impl<'a, 'tcx> Lift<'tcx> for &'a Goal<'a> {
1516 type Lifted = &'tcx Goal<'tcx>;
1517 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Goal<'tcx>> {
1518 if tcx.interners.arena.in_arena(*self as *const _) {
1519 return Some(unsafe { mem::transmute(*self) });
1521 // Also try in the global tcx if we're not that.
1522 if !tcx.is_global() {
1523 self.lift_to_tcx(tcx.global_tcx())
1530 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Goal<'a>> {
1531 type Lifted = &'tcx Slice<Goal<'tcx>>;
1532 fn lift_to_tcx<'b, 'gcx>(
1534 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1535 ) -> Option<&'tcx Slice<Goal<'tcx>>> {
1536 if tcx.interners.arena.in_arena(*self as *const _) {
1537 return Some(unsafe { mem::transmute(*self) });
1539 // Also try in the global tcx if we're not that.
1540 if !tcx.is_global() {
1541 self.lift_to_tcx(tcx.global_tcx())
1548 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Clause<'a>> {
1549 type Lifted = &'tcx Slice<Clause<'tcx>>;
1550 fn lift_to_tcx<'b, 'gcx>(
1552 tcx: TyCtxt<'b, 'gcx, 'tcx>,
1553 ) -> Option<&'tcx Slice<Clause<'tcx>>> {
1554 if tcx.interners.arena.in_arena(*self as *const _) {
1555 return Some(unsafe { mem::transmute(*self) });
1557 // Also try in the global tcx if we're not that.
1558 if !tcx.is_global() {
1559 self.lift_to_tcx(tcx.global_tcx())
1566 impl<'a, 'tcx> Lift<'tcx> for &'a Const<'a> {
1567 type Lifted = &'tcx Const<'tcx>;
1568 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Const<'tcx>> {
1569 if tcx.interners.arena.in_arena(*self as *const _) {
1570 return Some(unsafe { mem::transmute(*self) });
1572 // Also try in the global tcx if we're not that.
1573 if !tcx.is_global() {
1574 self.lift_to_tcx(tcx.global_tcx())
1581 impl<'a, 'tcx> Lift<'tcx> for &'a Substs<'a> {
1582 type Lifted = &'tcx Substs<'tcx>;
1583 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<&'tcx Substs<'tcx>> {
1584 if self.len() == 0 {
1585 return Some(Slice::empty());
1587 if tcx.interners.arena.in_arena(&self[..] as *const _) {
1588 return Some(unsafe { mem::transmute(*self) });
1590 // Also try in the global tcx if we're not that.
1591 if !tcx.is_global() {
1592 self.lift_to_tcx(tcx.global_tcx())
1599 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Ty<'a>> {
1600 type Lifted = &'tcx Slice<Ty<'tcx>>;
1601 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1602 -> Option<&'tcx Slice<Ty<'tcx>>> {
1603 if self.len() == 0 {
1604 return Some(Slice::empty());
1606 if tcx.interners.arena.in_arena(*self as *const _) {
1607 return Some(unsafe { mem::transmute(*self) });
1609 // Also try in the global tcx if we're not that.
1610 if !tcx.is_global() {
1611 self.lift_to_tcx(tcx.global_tcx())
1618 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<ExistentialPredicate<'a>> {
1619 type Lifted = &'tcx Slice<ExistentialPredicate<'tcx>>;
1620 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1621 -> Option<&'tcx Slice<ExistentialPredicate<'tcx>>> {
1622 if self.is_empty() {
1623 return Some(Slice::empty());
1625 if tcx.interners.arena.in_arena(*self as *const _) {
1626 return Some(unsafe { mem::transmute(*self) });
1628 // Also try in the global tcx if we're not that.
1629 if !tcx.is_global() {
1630 self.lift_to_tcx(tcx.global_tcx())
1637 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<Predicate<'a>> {
1638 type Lifted = &'tcx Slice<Predicate<'tcx>>;
1639 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>)
1640 -> Option<&'tcx Slice<Predicate<'tcx>>> {
1641 if self.is_empty() {
1642 return Some(Slice::empty());
1644 if tcx.interners.arena.in_arena(*self as *const _) {
1645 return Some(unsafe { mem::transmute(*self) });
1647 // Also try in the global tcx if we're not that.
1648 if !tcx.is_global() {
1649 self.lift_to_tcx(tcx.global_tcx())
1656 impl<'a, 'tcx> Lift<'tcx> for &'a Slice<CanonicalVarInfo> {
1657 type Lifted = &'tcx Slice<CanonicalVarInfo>;
1658 fn lift_to_tcx<'b, 'gcx>(&self, tcx: TyCtxt<'b, 'gcx, 'tcx>) -> Option<Self::Lifted> {
1659 if self.len() == 0 {
1660 return Some(Slice::empty());
1662 if tcx.interners.arena.in_arena(*self as *const _) {
1663 return Some(unsafe { mem::transmute(*self) });
1665 // Also try in the global tcx if we're not that.
1666 if !tcx.is_global() {
1667 self.lift_to_tcx(tcx.global_tcx())
1675 use super::{GlobalCtxt, TyCtxt};
1677 use std::cell::Cell;
1682 use errors::{Diagnostic, TRACK_DIAGNOSTICS};
1683 use rustc_data_structures::OnDrop;
1684 use rustc_data_structures::sync::Lrc;
1685 use dep_graph::OpenTask;
1687 /// This is the implicit state of rustc. It contains the current
1688 /// TyCtxt and query. It is updated when creating a local interner or
1689 /// executing a new query. Whenever there's a TyCtxt value available
1690 /// you should also have access to an ImplicitCtxt through the functions
1693 pub struct ImplicitCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1694 /// The current TyCtxt. Initially created by `enter_global` and updated
1695 /// by `enter_local` with a new local interner
1696 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
1698 /// The current query job, if any. This is updated by start_job in
1699 /// ty::maps::plumbing when executing a query
1700 pub query: Option<Lrc<maps::QueryJob<'gcx>>>,
1702 /// Used to prevent layout from recursing too deeply.
1703 pub layout_depth: usize,
1705 /// The current dep graph task. This is used to add dependencies to queries
1706 /// when executing them
1707 pub task: &'a OpenTask,
1710 // A thread local value which stores a pointer to the current ImplicitCtxt
1711 thread_local!(static TLV: Cell<usize> = Cell::new(0));
1713 fn set_tlv<F: FnOnce() -> R, R>(value: usize, f: F) -> R {
1714 let old = get_tlv();
1715 let _reset = OnDrop(move || TLV.with(|tlv| tlv.set(old)));
1716 TLV.with(|tlv| tlv.set(value));
1720 fn get_tlv() -> usize {
1721 TLV.with(|tlv| tlv.get())
1724 /// This is a callback from libsyntax as it cannot access the implicit state
1725 /// in librustc otherwise
1726 fn span_debug(span: syntax_pos::Span, f: &mut fmt::Formatter) -> fmt::Result {
1728 write!(f, "{}", tcx.sess.codemap().span_to_string(span))
1732 /// This is a callback from libsyntax as it cannot access the implicit state
1733 /// in librustc otherwise. It is used to when diagnostic messages are
1734 /// emitted and stores them in the current query, if there is one.
1735 fn track_diagnostic(diagnostic: &Diagnostic) {
1736 with_context_opt(|icx| {
1737 if let Some(icx) = icx {
1738 if let Some(ref query) = icx.query {
1739 query.diagnostics.lock().push(diagnostic.clone());
1745 /// Sets up the callbacks from libsyntax on the current thread
1746 pub fn with_thread_locals<F, R>(f: F) -> R
1747 where F: FnOnce() -> R
1749 syntax_pos::SPAN_DEBUG.with(|span_dbg| {
1750 let original_span_debug = span_dbg.get();
1751 span_dbg.set(span_debug);
1753 let _on_drop = OnDrop(move || {
1754 span_dbg.set(original_span_debug);
1757 TRACK_DIAGNOSTICS.with(|current| {
1758 let original = current.get();
1759 current.set(track_diagnostic);
1761 let _on_drop = OnDrop(move || {
1762 current.set(original);
1770 /// Sets `context` as the new current ImplicitCtxt for the duration of the function `f`
1771 pub fn enter_context<'a, 'gcx: 'tcx, 'tcx, F, R>(context: &ImplicitCtxt<'a, 'gcx, 'tcx>,
1773 where F: FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1775 set_tlv(context as *const _ as usize, || {
1780 /// Enters GlobalCtxt by setting up libsyntax callbacks and
1781 /// creating a initial TyCtxt and ImplicitCtxt.
1782 /// This happens once per rustc session and TyCtxts only exists
1783 /// inside the `f` function.
1784 pub fn enter_global<'gcx, F, R>(gcx: &GlobalCtxt<'gcx>, f: F) -> R
1785 where F: for<'a> FnOnce(TyCtxt<'a, 'gcx, 'gcx>) -> R
1787 with_thread_locals(|| {
1790 interners: &gcx.global_interners,
1792 let icx = ImplicitCtxt {
1796 task: &OpenTask::Ignore,
1798 enter_context(&icx, |_| {
1804 /// Allows access to the current ImplicitCtxt in a closure if one is available
1805 pub fn with_context_opt<F, R>(f: F) -> R
1806 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<&ImplicitCtxt<'a, 'gcx, 'tcx>>) -> R
1808 let context = get_tlv();
1812 unsafe { f(Some(&*(context as *const ImplicitCtxt))) }
1816 /// Allows access to the current ImplicitCtxt.
1817 /// Panics if there is no ImplicitCtxt available
1818 pub fn with_context<F, R>(f: F) -> R
1819 where F: for<'a, 'gcx, 'tcx> FnOnce(&ImplicitCtxt<'a, 'gcx, 'tcx>) -> R
1821 with_context_opt(|opt_context| f(opt_context.expect("no ImplicitCtxt stored in tls")))
1824 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
1825 /// interner as the tcx argument passed in. This means the closure is given an ImplicitCtxt
1826 /// with the same 'gcx lifetime as the TyCtxt passed in.
1827 /// This will panic if you pass it a TyCtxt which has a different global interner from
1828 /// the current ImplicitCtxt's tcx field.
1829 pub fn with_related_context<'a, 'gcx, 'tcx1, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx1>, f: F) -> R
1830 where F: for<'b, 'tcx2> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx2>) -> R
1832 with_context(|context| {
1834 let gcx = tcx.gcx as *const _ as usize;
1835 assert!(context.tcx.gcx as *const _ as usize == gcx);
1836 let context: &ImplicitCtxt = mem::transmute(context);
1842 /// Allows access to the current ImplicitCtxt whose tcx field has the same global
1843 /// interner and local interner as the tcx argument passed in. This means the closure
1844 /// is given an ImplicitCtxt with the same 'tcx and 'gcx lifetimes as the TyCtxt passed in.
1845 /// This will panic if you pass it a TyCtxt which has a different global interner or
1846 /// a different local interner from the current ImplicitCtxt's tcx field.
1847 pub fn with_fully_related_context<'a, 'gcx, 'tcx, F, R>(tcx: TyCtxt<'a, 'gcx, 'tcx>, f: F) -> R
1848 where F: for<'b> FnOnce(&ImplicitCtxt<'b, 'gcx, 'tcx>) -> R
1850 with_context(|context| {
1852 let gcx = tcx.gcx as *const _ as usize;
1853 let interners = tcx.interners as *const _ as usize;
1854 assert!(context.tcx.gcx as *const _ as usize == gcx);
1855 assert!(context.tcx.interners as *const _ as usize == interners);
1856 let context: &ImplicitCtxt = mem::transmute(context);
1862 /// Allows access to the TyCtxt in the current ImplicitCtxt.
1863 /// Panics if there is no ImplicitCtxt available
1864 pub fn with<F, R>(f: F) -> R
1865 where F: for<'a, 'gcx, 'tcx> FnOnce(TyCtxt<'a, 'gcx, 'tcx>) -> R
1867 with_context(|context| f(context.tcx))
1870 /// Allows access to the TyCtxt in the current ImplicitCtxt.
1871 /// The closure is passed None if there is no ImplicitCtxt available
1872 pub fn with_opt<F, R>(f: F) -> R
1873 where F: for<'a, 'gcx, 'tcx> FnOnce(Option<TyCtxt<'a, 'gcx, 'tcx>>) -> R
1875 with_context_opt(|opt_context| f(opt_context.map(|context| context.tcx)))
1879 macro_rules! sty_debug_print {
1880 ($ctxt: expr, $($variant: ident),*) => {{
1881 // curious inner module to allow variant names to be used as
1883 #[allow(non_snake_case)]
1885 use ty::{self, TyCtxt};
1886 use ty::context::Interned;
1888 #[derive(Copy, Clone)]
1891 region_infer: usize,
1896 pub fn go(tcx: TyCtxt) {
1897 let mut total = DebugStat {
1899 region_infer: 0, ty_infer: 0, both_infer: 0,
1901 $(let mut $variant = total;)*
1904 for &Interned(t) in tcx.interners.type_.borrow().iter() {
1905 let variant = match t.sty {
1906 ty::TyBool | ty::TyChar | ty::TyInt(..) | ty::TyUint(..) |
1907 ty::TyFloat(..) | ty::TyStr | ty::TyNever => continue,
1908 ty::TyError => /* unimportant */ continue,
1909 $(ty::$variant(..) => &mut $variant,)*
1911 let region = t.flags.intersects(ty::TypeFlags::HAS_RE_INFER);
1912 let ty = t.flags.intersects(ty::TypeFlags::HAS_TY_INFER);
1916 if region { total.region_infer += 1; variant.region_infer += 1 }
1917 if ty { total.ty_infer += 1; variant.ty_infer += 1 }
1918 if region && ty { total.both_infer += 1; variant.both_infer += 1 }
1920 println!("Ty interner total ty region both");
1921 $(println!(" {:18}: {uses:6} {usespc:4.1}%, \
1922 {ty:4.1}% {region:5.1}% {both:4.1}%",
1923 stringify!($variant),
1924 uses = $variant.total,
1925 usespc = $variant.total as f64 * 100.0 / total.total as f64,
1926 ty = $variant.ty_infer as f64 * 100.0 / total.total as f64,
1927 region = $variant.region_infer as f64 * 100.0 / total.total as f64,
1928 both = $variant.both_infer as f64 * 100.0 / total.total as f64);
1930 println!(" total {uses:6} \
1931 {ty:4.1}% {region:5.1}% {both:4.1}%",
1933 ty = total.ty_infer as f64 * 100.0 / total.total as f64,
1934 region = total.region_infer as f64 * 100.0 / total.total as f64,
1935 both = total.both_infer as f64 * 100.0 / total.total as f64)
1943 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
1944 pub fn print_debug_stats(self) {
1947 TyAdt, TyArray, TySlice, TyRawPtr, TyRef, TyFnDef, TyFnPtr,
1948 TyGenerator, TyGeneratorWitness, TyDynamic, TyClosure, TyTuple,
1949 TyParam, TyInfer, TyProjection, TyAnon, TyForeign);
1951 println!("Substs interner: #{}", self.interners.substs.borrow().len());
1952 println!("Region interner: #{}", self.interners.region.borrow().len());
1953 println!("Stability interner: #{}", self.stability_interner.borrow().len());
1954 println!("Allocation interner: #{}", self.allocation_interner.borrow().len());
1955 println!("Layout interner: #{}", self.layout_interner.borrow().len());
1960 /// An entry in an interner.
1961 struct Interned<'tcx, T: 'tcx+?Sized>(&'tcx T);
1963 // NB: An Interned<Ty> compares and hashes as a sty.
1964 impl<'tcx> PartialEq for Interned<'tcx, TyS<'tcx>> {
1965 fn eq(&self, other: &Interned<'tcx, TyS<'tcx>>) -> bool {
1966 self.0.sty == other.0.sty
1970 impl<'tcx> Eq for Interned<'tcx, TyS<'tcx>> {}
1972 impl<'tcx> Hash for Interned<'tcx, TyS<'tcx>> {
1973 fn hash<H: Hasher>(&self, s: &mut H) {
1978 impl<'tcx: 'lcx, 'lcx> Borrow<TypeVariants<'lcx>> for Interned<'tcx, TyS<'tcx>> {
1979 fn borrow<'a>(&'a self) -> &'a TypeVariants<'lcx> {
1984 // NB: An Interned<Slice<T>> compares and hashes as its elements.
1985 impl<'tcx, T: PartialEq> PartialEq for Interned<'tcx, Slice<T>> {
1986 fn eq(&self, other: &Interned<'tcx, Slice<T>>) -> bool {
1987 self.0[..] == other.0[..]
1991 impl<'tcx, T: Eq> Eq for Interned<'tcx, Slice<T>> {}
1993 impl<'tcx, T: Hash> Hash for Interned<'tcx, Slice<T>> {
1994 fn hash<H: Hasher>(&self, s: &mut H) {
1999 impl<'tcx: 'lcx, 'lcx> Borrow<[Ty<'lcx>]> for Interned<'tcx, Slice<Ty<'tcx>>> {
2000 fn borrow<'a>(&'a self) -> &'a [Ty<'lcx>] {
2005 impl<'tcx: 'lcx, 'lcx> Borrow<[CanonicalVarInfo]> for Interned<'tcx, Slice<CanonicalVarInfo>> {
2006 fn borrow<'a>(&'a self) -> &'a [CanonicalVarInfo] {
2011 impl<'tcx: 'lcx, 'lcx> Borrow<[Kind<'lcx>]> for Interned<'tcx, Substs<'tcx>> {
2012 fn borrow<'a>(&'a self) -> &'a [Kind<'lcx>] {
2017 impl<'tcx> Borrow<RegionKind> for Interned<'tcx, RegionKind> {
2018 fn borrow<'a>(&'a self) -> &'a RegionKind {
2023 impl<'tcx: 'lcx, 'lcx> Borrow<[ExistentialPredicate<'lcx>]>
2024 for Interned<'tcx, Slice<ExistentialPredicate<'tcx>>> {
2025 fn borrow<'a>(&'a self) -> &'a [ExistentialPredicate<'lcx>] {
2030 impl<'tcx: 'lcx, 'lcx> Borrow<[Predicate<'lcx>]>
2031 for Interned<'tcx, Slice<Predicate<'tcx>>> {
2032 fn borrow<'a>(&'a self) -> &'a [Predicate<'lcx>] {
2037 impl<'tcx: 'lcx, 'lcx> Borrow<Const<'lcx>> for Interned<'tcx, Const<'tcx>> {
2038 fn borrow<'a>(&'a self) -> &'a Const<'lcx> {
2043 impl<'tcx: 'lcx, 'lcx> Borrow<[Clause<'lcx>]>
2044 for Interned<'tcx, Slice<Clause<'tcx>>> {
2045 fn borrow<'a>(&'a self) -> &'a [Clause<'lcx>] {
2050 impl<'tcx: 'lcx, 'lcx> Borrow<[Goal<'lcx>]>
2051 for Interned<'tcx, Slice<Goal<'tcx>>> {
2052 fn borrow<'a>(&'a self) -> &'a [Goal<'lcx>] {
2057 macro_rules! intern_method {
2058 ($lt_tcx:tt, $name:ident: $method:ident($alloc:ty,
2061 $keep_in_local_tcx:expr) -> $ty:ty) => {
2062 impl<'a, 'gcx, $lt_tcx> TyCtxt<'a, 'gcx, $lt_tcx> {
2063 pub fn $method(self, v: $alloc) -> &$lt_tcx $ty {
2064 let key = ($alloc_to_key)(&v);
2066 // HACK(eddyb) Depend on flags being accurate to
2067 // determine that all contents are in the global tcx.
2068 // See comments on Lift for why we can't use that.
2069 if ($keep_in_local_tcx)(&v) {
2070 let mut interner = self.interners.$name.borrow_mut();
2071 if let Some(&Interned(v)) = interner.get(key) {
2075 // Make sure we don't end up with inference
2076 // types/regions in the global tcx.
2077 if self.is_global() {
2078 bug!("Attempted to intern `{:?}` which contains \
2079 inference types/regions in the global type context",
2083 let i = $alloc_method(&self.interners.arena, v);
2084 interner.insert(Interned(i));
2087 let mut interner = self.global_interners.$name.borrow_mut();
2088 if let Some(&Interned(v)) = interner.get(key) {
2092 // This transmutes $alloc<'tcx> to $alloc<'gcx>
2096 let i: &$lt_tcx $ty = $alloc_method(&self.global_interners.arena, v);
2098 let i = unsafe { mem::transmute(i) };
2099 interner.insert(Interned(i));
2107 macro_rules! direct_interners {
2108 ($lt_tcx:tt, $($name:ident: $method:ident($keep_in_local_tcx:expr) -> $ty:ty),+) => {
2109 $(impl<$lt_tcx> PartialEq for Interned<$lt_tcx, $ty> {
2110 fn eq(&self, other: &Self) -> bool {
2115 impl<$lt_tcx> Eq for Interned<$lt_tcx, $ty> {}
2117 impl<$lt_tcx> Hash for Interned<$lt_tcx, $ty> {
2118 fn hash<H: Hasher>(&self, s: &mut H) {
2126 |a: &$lt_tcx SyncDroplessArena, v| -> &$lt_tcx $ty { a.alloc(v) },
2128 $keep_in_local_tcx) -> $ty);)+
2132 pub fn keep_local<'tcx, T: ty::TypeFoldable<'tcx>>(x: &T) -> bool {
2133 x.has_type_flags(ty::TypeFlags::KEEP_IN_LOCAL_TCX)
2136 direct_interners!('tcx,
2137 region: mk_region(|r: &RegionKind| r.keep_in_local_tcx()) -> RegionKind,
2138 const_: mk_const(|c: &Const| keep_local(&c.ty) || keep_local(&c.val)) -> Const<'tcx>
2141 macro_rules! slice_interners {
2142 ($($field:ident: $method:ident($ty:ident)),+) => (
2143 $(intern_method!( 'tcx, $field: $method(
2145 |a, v| Slice::from_arena(a, v),
2147 |xs: &[$ty]| xs.iter().any(keep_local)) -> Slice<$ty<'tcx>>);)+
2152 existential_predicates: _intern_existential_predicates(ExistentialPredicate),
2153 predicates: _intern_predicates(Predicate),
2154 type_list: _intern_type_list(Ty),
2155 substs: _intern_substs(Kind),
2156 clauses: _intern_clauses(Clause),
2157 goals: _intern_goals(Goal)
2160 // This isn't a perfect fit: CanonicalVarInfo slices are always
2161 // allocated in the global arena, so this `intern_method!` macro is
2162 // overly general. But we just return false for the code that checks
2163 // whether they belong in the thread-local arena, so no harm done, and
2164 // seems better than open-coding the rest.
2167 canonical_var_infos: _intern_canonical_var_infos(
2168 &[CanonicalVarInfo],
2169 |a, v| Slice::from_arena(a, v),
2171 |_xs: &[CanonicalVarInfo]| -> bool { false }
2172 ) -> Slice<CanonicalVarInfo>
2175 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
2176 /// Given a `fn` type, returns an equivalent `unsafe fn` type;
2177 /// that is, a `fn` type that is equivalent in every way for being
2179 pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2180 assert_eq!(sig.unsafety(), hir::Unsafety::Normal);
2181 self.mk_fn_ptr(sig.map_bound(|sig| ty::FnSig {
2182 unsafety: hir::Unsafety::Unsafe,
2187 /// Given a closure signature `sig`, returns an equivalent `fn`
2188 /// type with the same signature. Detuples and so forth -- so
2189 /// e.g. if we have a sig with `Fn<(u32, i32)>` then you would get
2190 /// a `fn(u32, i32)`.
2191 pub fn coerce_closure_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx> {
2192 let converted_sig = sig.map_bound(|s| {
2193 let params_iter = match s.inputs()[0].sty {
2194 ty::TyTuple(params) => {
2195 params.into_iter().cloned()
2203 hir::Unsafety::Normal,
2208 self.mk_fn_ptr(converted_sig)
2211 pub fn mk_ty(&self, st: TypeVariants<'tcx>) -> Ty<'tcx> {
2212 CtxtInterners::intern_ty(&self.interners, &self.global_interners, st)
2215 pub fn mk_mach_int(self, tm: ast::IntTy) -> Ty<'tcx> {
2217 ast::IntTy::Isize => self.types.isize,
2218 ast::IntTy::I8 => self.types.i8,
2219 ast::IntTy::I16 => self.types.i16,
2220 ast::IntTy::I32 => self.types.i32,
2221 ast::IntTy::I64 => self.types.i64,
2222 ast::IntTy::I128 => self.types.i128,
2226 pub fn mk_mach_uint(self, tm: ast::UintTy) -> Ty<'tcx> {
2228 ast::UintTy::Usize => self.types.usize,
2229 ast::UintTy::U8 => self.types.u8,
2230 ast::UintTy::U16 => self.types.u16,
2231 ast::UintTy::U32 => self.types.u32,
2232 ast::UintTy::U64 => self.types.u64,
2233 ast::UintTy::U128 => self.types.u128,
2237 pub fn mk_mach_float(self, tm: ast::FloatTy) -> Ty<'tcx> {
2239 ast::FloatTy::F32 => self.types.f32,
2240 ast::FloatTy::F64 => self.types.f64,
2244 pub fn mk_str(self) -> Ty<'tcx> {
2248 pub fn mk_static_str(self) -> Ty<'tcx> {
2249 self.mk_imm_ref(self.types.re_static, self.mk_str())
2252 pub fn mk_adt(self, def: &'tcx AdtDef, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2253 // take a copy of substs so that we own the vectors inside
2254 self.mk_ty(TyAdt(def, substs))
2257 pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx> {
2258 self.mk_ty(TyForeign(def_id))
2261 pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2262 let def_id = self.require_lang_item(lang_items::OwnedBoxLangItem);
2263 let adt_def = self.adt_def(def_id);
2264 let substs = Substs::for_item(self, def_id, |param, substs| {
2266 GenericParamDefKind::Lifetime => bug!(),
2267 GenericParamDefKind::Type { has_default, .. } => {
2268 if param.index == 0 {
2271 assert!(has_default);
2272 self.type_of(param.def_id).subst(self, substs).into()
2277 self.mk_ty(TyAdt(adt_def, substs))
2280 pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2281 self.mk_ty(TyRawPtr(tm))
2284 pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx> {
2285 self.mk_ty(TyRef(r, tm.ty, tm.mutbl))
2288 pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2289 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2292 pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx> {
2293 self.mk_ref(r, TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2296 pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2297 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutMutable})
2300 pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2301 self.mk_ptr(TypeAndMut {ty: ty, mutbl: hir::MutImmutable})
2304 pub fn mk_nil_ptr(self) -> Ty<'tcx> {
2305 self.mk_imm_ptr(self.mk_nil())
2308 pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx> {
2309 self.mk_ty(TyArray(ty, ty::Const::from_usize(self, n)))
2312 pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx> {
2313 self.mk_ty(TySlice(ty))
2316 pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx> {
2317 self.mk_ty(TyTuple(self.intern_type_list(ts)))
2320 pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output {
2321 iter.intern_with(|ts| self.mk_ty(TyTuple(self.intern_type_list(ts))))
2324 pub fn mk_nil(self) -> Ty<'tcx> {
2325 self.intern_tup(&[])
2328 pub fn mk_diverging_default(self) -> Ty<'tcx> {
2329 if self.features().never_type {
2332 self.intern_tup(&[])
2336 pub fn mk_bool(self) -> Ty<'tcx> {
2340 pub fn mk_fn_def(self, def_id: DefId,
2341 substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2342 self.mk_ty(TyFnDef(def_id, substs))
2345 pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx> {
2346 self.mk_ty(TyFnPtr(fty))
2351 obj: ty::Binder<&'tcx Slice<ExistentialPredicate<'tcx>>>,
2352 reg: ty::Region<'tcx>
2354 self.mk_ty(TyDynamic(obj, reg))
2357 pub fn mk_projection(self,
2359 substs: &'tcx Substs<'tcx>)
2361 self.mk_ty(TyProjection(ProjectionTy {
2367 pub fn mk_closure(self, closure_id: DefId, closure_substs: ClosureSubsts<'tcx>)
2369 self.mk_ty(TyClosure(closure_id, closure_substs))
2372 pub fn mk_generator(self,
2374 generator_substs: GeneratorSubsts<'tcx>,
2375 movability: hir::GeneratorMovability)
2377 self.mk_ty(TyGenerator(id, generator_substs, movability))
2380 pub fn mk_generator_witness(self, types: ty::Binder<&'tcx Slice<Ty<'tcx>>>) -> Ty<'tcx> {
2381 self.mk_ty(TyGeneratorWitness(types))
2384 pub fn mk_var(self, v: TyVid) -> Ty<'tcx> {
2385 self.mk_infer(TyVar(v))
2388 pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx> {
2389 self.mk_infer(IntVar(v))
2392 pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx> {
2393 self.mk_infer(FloatVar(v))
2396 pub fn mk_infer(self, it: InferTy) -> Ty<'tcx> {
2397 self.mk_ty(TyInfer(it))
2400 pub fn mk_ty_param(self,
2402 name: InternedString) -> Ty<'tcx> {
2403 self.mk_ty(TyParam(ParamTy { idx: index, name: name }))
2406 pub fn mk_self_type(self) -> Ty<'tcx> {
2407 self.mk_ty_param(0, keywords::SelfType.name().as_interned_str())
2410 pub fn mk_param_from_def(self, param: &ty::GenericParamDef) -> Kind<'tcx> {
2412 GenericParamDefKind::Lifetime => {
2413 self.mk_region(ty::ReEarlyBound(param.to_early_bound_region_data())).into()
2415 GenericParamDefKind::Type {..} => self.mk_ty_param(param.index, param.name).into(),
2419 pub fn mk_anon(self, def_id: DefId, substs: &'tcx Substs<'tcx>) -> Ty<'tcx> {
2420 self.mk_ty(TyAnon(def_id, substs))
2423 pub fn intern_existential_predicates(self, eps: &[ExistentialPredicate<'tcx>])
2424 -> &'tcx Slice<ExistentialPredicate<'tcx>> {
2425 assert!(!eps.is_empty());
2426 assert!(eps.windows(2).all(|w| w[0].cmp(self, &w[1]) != Ordering::Greater));
2427 self._intern_existential_predicates(eps)
2430 pub fn intern_predicates(self, preds: &[Predicate<'tcx>])
2431 -> &'tcx Slice<Predicate<'tcx>> {
2432 // FIXME consider asking the input slice to be sorted to avoid
2433 // re-interning permutations, in which case that would be asserted
2435 if preds.len() == 0 {
2436 // The macro-generated method below asserts we don't intern an empty slice.
2439 self._intern_predicates(preds)
2443 pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx Slice<Ty<'tcx>> {
2447 self._intern_type_list(ts)
2451 pub fn intern_substs(self, ts: &[Kind<'tcx>]) -> &'tcx Slice<Kind<'tcx>> {
2455 self._intern_substs(ts)
2459 pub fn intern_canonical_var_infos(self, ts: &[CanonicalVarInfo]) -> CanonicalVarInfos<'gcx> {
2463 self.global_tcx()._intern_canonical_var_infos(ts)
2467 pub fn intern_clauses(self, ts: &[Clause<'tcx>]) -> Clauses<'tcx> {
2471 self._intern_clauses(ts)
2475 pub fn intern_goals(self, ts: &[Goal<'tcx>]) -> Goals<'tcx> {
2479 self._intern_goals(ts)
2483 pub fn mk_fn_sig<I>(self,
2487 unsafety: hir::Unsafety,
2489 -> <I::Item as InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>>::Output
2491 I::Item: InternIteratorElement<Ty<'tcx>, ty::FnSig<'tcx>>
2493 inputs.chain(iter::once(output)).intern_with(|xs| ty::FnSig {
2494 inputs_and_output: self.intern_type_list(xs),
2495 variadic, unsafety, abi
2499 pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>],
2500 &'tcx Slice<ExistentialPredicate<'tcx>>>>(self, iter: I)
2502 iter.intern_with(|xs| self.intern_existential_predicates(xs))
2505 pub fn mk_predicates<I: InternAs<[Predicate<'tcx>],
2506 &'tcx Slice<Predicate<'tcx>>>>(self, iter: I)
2508 iter.intern_with(|xs| self.intern_predicates(xs))
2511 pub fn mk_type_list<I: InternAs<[Ty<'tcx>],
2512 &'tcx Slice<Ty<'tcx>>>>(self, iter: I) -> I::Output {
2513 iter.intern_with(|xs| self.intern_type_list(xs))
2516 pub fn mk_substs<I: InternAs<[Kind<'tcx>],
2517 &'tcx Slice<Kind<'tcx>>>>(self, iter: I) -> I::Output {
2518 iter.intern_with(|xs| self.intern_substs(xs))
2521 pub fn mk_substs_trait(self,
2523 rest: &[Kind<'tcx>])
2524 -> &'tcx Substs<'tcx>
2526 self.mk_substs(iter::once(self_ty.into()).chain(rest.iter().cloned()))
2529 pub fn mk_clauses<I: InternAs<[Clause<'tcx>], Clauses<'tcx>>>(self, iter: I) -> I::Output {
2530 iter.intern_with(|xs| self.intern_clauses(xs))
2533 pub fn mk_goals<I: InternAs<[Goal<'tcx>], Goals<'tcx>>>(self, iter: I) -> I::Output {
2534 iter.intern_with(|xs| self.intern_goals(xs))
2537 pub fn mk_goal(self, goal: Goal<'tcx>) -> &'tcx Goal {
2538 &self.intern_goals(&[goal])[0]
2541 pub fn lint_node<S: Into<MultiSpan>>(self,
2542 lint: &'static Lint,
2546 self.struct_span_lint_node(lint, id, span.into(), msg).emit()
2549 pub fn lint_node_note<S: Into<MultiSpan>>(self,
2550 lint: &'static Lint,
2555 let mut err = self.struct_span_lint_node(lint, id, span.into(), msg);
2560 pub fn lint_level_at_node(self, lint: &'static Lint, mut id: NodeId)
2561 -> (lint::Level, lint::LintSource)
2563 // Right now we insert a `with_ignore` node in the dep graph here to
2564 // ignore the fact that `lint_levels` below depends on the entire crate.
2565 // For now this'll prevent false positives of recompiling too much when
2566 // anything changes.
2568 // Once red/green incremental compilation lands we should be able to
2569 // remove this because while the crate changes often the lint level map
2570 // will change rarely.
2571 self.dep_graph.with_ignore(|| {
2572 let sets = self.lint_levels(LOCAL_CRATE);
2574 let hir_id = self.hir.definitions().node_to_hir_id(id);
2575 if let Some(pair) = sets.level_and_source(lint, hir_id, self.sess) {
2578 let next = self.hir.get_parent_node(id);
2580 bug!("lint traversal reached the root of the crate");
2587 pub fn struct_span_lint_node<S: Into<MultiSpan>>(self,
2588 lint: &'static Lint,
2592 -> DiagnosticBuilder<'tcx>
2594 let (level, src) = self.lint_level_at_node(lint, id);
2595 lint::struct_lint_level(self.sess, lint, level, src, Some(span.into()), msg)
2598 pub fn struct_lint_node(self, lint: &'static Lint, id: NodeId, msg: &str)
2599 -> DiagnosticBuilder<'tcx>
2601 let (level, src) = self.lint_level_at_node(lint, id);
2602 lint::struct_lint_level(self.sess, lint, level, src, None, msg)
2605 pub fn in_scope_traits(self, id: HirId) -> Option<Lrc<StableVec<TraitCandidate>>> {
2606 self.in_scope_traits_map(id.owner)
2607 .and_then(|map| map.get(&id.local_id).cloned())
2610 pub fn named_region(self, id: HirId) -> Option<resolve_lifetime::Region> {
2611 self.named_region_map(id.owner)
2612 .and_then(|map| map.get(&id.local_id).cloned())
2615 pub fn is_late_bound(self, id: HirId) -> bool {
2616 self.is_late_bound_map(id.owner)
2617 .map(|set| set.contains(&id.local_id))
2621 pub fn object_lifetime_defaults(self, id: HirId)
2622 -> Option<Lrc<Vec<ObjectLifetimeDefault>>>
2624 self.object_lifetime_defaults_map(id.owner)
2625 .and_then(|map| map.get(&id.local_id).cloned())
2629 pub trait InternAs<T: ?Sized, R> {
2631 fn intern_with<F>(self, f: F) -> Self::Output
2632 where F: FnOnce(&T) -> R;
2635 impl<I, T, R, E> InternAs<[T], R> for I
2636 where E: InternIteratorElement<T, R>,
2637 I: Iterator<Item=E> {
2638 type Output = E::Output;
2639 fn intern_with<F>(self, f: F) -> Self::Output
2640 where F: FnOnce(&[T]) -> R {
2641 E::intern_with(self, f)
2645 pub trait InternIteratorElement<T, R>: Sized {
2647 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output;
2650 impl<T, R> InternIteratorElement<T, R> for T {
2652 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2653 f(&iter.collect::<AccumulateVec<[_; 8]>>())
2657 impl<'a, T, R> InternIteratorElement<T, R> for &'a T
2661 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2662 f(&iter.cloned().collect::<AccumulateVec<[_; 8]>>())
2666 impl<T, R, E> InternIteratorElement<T, R> for Result<T, E> {
2667 type Output = Result<R, E>;
2668 fn intern_with<I: Iterator<Item=Self>, F: FnOnce(&[T]) -> R>(iter: I, f: F) -> Self::Output {
2669 Ok(f(&iter.collect::<Result<AccumulateVec<[_; 8]>, _>>()?))
2673 pub fn provide(providers: &mut ty::maps::Providers) {
2674 // FIXME(#44234) - almost all of these queries have no sub-queries and
2675 // therefore no actual inputs, they're just reading tables calculated in
2676 // resolve! Does this work? Unsure! That's what the issue is about
2677 providers.in_scope_traits_map = |tcx, id| tcx.gcx.trait_map.get(&id).cloned();
2678 providers.module_exports = |tcx, id| tcx.gcx.export_map.get(&id).cloned();
2679 providers.crate_name = |tcx, id| {
2680 assert_eq!(id, LOCAL_CRATE);
2683 providers.get_lang_items = |tcx, id| {
2684 assert_eq!(id, LOCAL_CRATE);
2685 // FIXME(#42293) Right now we insert a `with_ignore` node in the dep
2686 // graph here to ignore the fact that `get_lang_items` below depends on
2687 // the entire crate. For now this'll prevent false positives of
2688 // recompiling too much when anything changes.
2690 // Once red/green incremental compilation lands we should be able to
2691 // remove this because while the crate changes often the lint level map
2692 // will change rarely.
2693 tcx.dep_graph.with_ignore(|| Lrc::new(middle::lang_items::collect(tcx)))
2695 providers.freevars = |tcx, id| tcx.gcx.freevars.get(&id).cloned();
2696 providers.maybe_unused_trait_import = |tcx, id| {
2697 tcx.maybe_unused_trait_imports.contains(&id)
2699 providers.maybe_unused_extern_crates = |tcx, cnum| {
2700 assert_eq!(cnum, LOCAL_CRATE);
2701 Lrc::new(tcx.maybe_unused_extern_crates.clone())
2704 providers.stability_index = |tcx, cnum| {
2705 assert_eq!(cnum, LOCAL_CRATE);
2706 Lrc::new(stability::Index::new(tcx))
2708 providers.lookup_stability = |tcx, id| {
2709 assert_eq!(id.krate, LOCAL_CRATE);
2710 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
2711 tcx.stability().local_stability(id)
2713 providers.lookup_deprecation_entry = |tcx, id| {
2714 assert_eq!(id.krate, LOCAL_CRATE);
2715 let id = tcx.hir.definitions().def_index_to_hir_id(id.index);
2716 tcx.stability().local_deprecation_entry(id)
2718 providers.extern_mod_stmt_cnum = |tcx, id| {
2719 let id = tcx.hir.as_local_node_id(id).unwrap();
2720 tcx.cstore.extern_mod_stmt_cnum_untracked(id)
2722 providers.all_crate_nums = |tcx, cnum| {
2723 assert_eq!(cnum, LOCAL_CRATE);
2724 Lrc::new(tcx.cstore.crates_untracked())
2726 providers.postorder_cnums = |tcx, cnum| {
2727 assert_eq!(cnum, LOCAL_CRATE);
2728 Lrc::new(tcx.cstore.postorder_cnums_untracked())
2730 providers.output_filenames = |tcx, cnum| {
2731 assert_eq!(cnum, LOCAL_CRATE);
2732 tcx.output_filenames.clone()
2734 providers.features_query = |tcx, cnum| {
2735 assert_eq!(cnum, LOCAL_CRATE);
2736 Lrc::new(tcx.sess.features_untracked().clone())
2738 providers.is_panic_runtime = |tcx, cnum| {
2739 assert_eq!(cnum, LOCAL_CRATE);
2740 attr::contains_name(tcx.hir.krate_attrs(), "panic_runtime")
2742 providers.is_compiler_builtins = |tcx, cnum| {
2743 assert_eq!(cnum, LOCAL_CRATE);
2744 attr::contains_name(tcx.hir.krate_attrs(), "compiler_builtins")