2019-01-20 05:44:02 +01:00
|
|
|
use crate::dep_graph::{self, DepConstructor, DepNode};
|
2019-02-08 00:56:05 +09:00
|
|
|
use errors::DiagnosticBuilder;
|
2019-02-05 11:20:45 -06:00
|
|
|
use crate::hir::def_id::{CrateNum, DefId, DefIndex};
|
|
|
|
use crate::hir::def::{Def, Export};
|
|
|
|
use crate::hir::{self, TraitCandidate, ItemLocalId, CodegenFnAttrs};
|
2018-08-03 12:22:22 -06:00
|
|
|
use rustc_data_structures::svh::Svh;
|
2019-02-05 11:20:45 -06:00
|
|
|
use crate::infer::canonical::{self, Canonical};
|
|
|
|
use crate::lint;
|
|
|
|
use crate::middle::borrowck::BorrowCheckResult;
|
|
|
|
use crate::middle::cstore::{ExternCrate, LinkagePreference, NativeLibrary, ForeignModule};
|
|
|
|
use crate::middle::cstore::{NativeLibraryKind, DepKind, CrateSource};
|
|
|
|
use crate::middle::privacy::AccessLevels;
|
|
|
|
use crate::middle::reachable::ReachableSet;
|
|
|
|
use crate::middle::region;
|
|
|
|
use crate::middle::resolve_lifetime::{ResolveLifetimes, Region, ObjectLifetimeDefault};
|
|
|
|
use crate::middle::stability::{self, DeprecationEntry};
|
|
|
|
use crate::middle::lib_features::LibFeatures;
|
|
|
|
use crate::middle::lang_items::{LanguageItems, LangItem};
|
|
|
|
use crate::middle::exported_symbols::{SymbolExportLevel, ExportedSymbol};
|
|
|
|
use crate::mir::interpret::{ConstEvalRawResult, ConstEvalResult};
|
|
|
|
use crate::mir::mono::CodegenUnit;
|
|
|
|
use crate::mir;
|
|
|
|
use crate::mir::interpret::GlobalId;
|
|
|
|
use crate::session::{CompileResult, CrateDisambiguator};
|
|
|
|
use crate::session::config::{EntryFnType, OutputFilenames, OptLevel};
|
|
|
|
use crate::traits::{self, Vtable};
|
|
|
|
use crate::traits::query::{
|
2018-10-23 20:31:57 -04:00
|
|
|
CanonicalPredicateGoal, CanonicalProjectionGoal,
|
2018-11-22 20:35:24 +01:00
|
|
|
CanonicalTyGoal, CanonicalTypeOpAscribeUserTypeGoal,
|
2018-12-18 21:27:22 +01:00
|
|
|
CanonicalTypeOpEqGoal, CanonicalTypeOpSubtypeGoal, CanonicalTypeOpProvePredicateGoal,
|
2018-10-23 20:31:57 -04:00
|
|
|
CanonicalTypeOpNormalizeGoal, NoSolution,
|
|
|
|
};
|
2019-02-05 11:20:45 -06:00
|
|
|
use crate::traits::query::method_autoderef::MethodAutoderefStepsResult;
|
|
|
|
use crate::traits::query::dropck_outlives::{DtorckConstraint, DropckOutlivesResult};
|
|
|
|
use crate::traits::query::normalize::NormalizationResult;
|
|
|
|
use crate::traits::query::outlives_bounds::OutlivesBound;
|
|
|
|
use crate::traits::specialization_graph;
|
|
|
|
use crate::traits::Clauses;
|
|
|
|
use crate::ty::{self, CrateInherentImpls, ParamEnvAnd, Ty, TyCtxt};
|
|
|
|
use crate::ty::steal::Steal;
|
|
|
|
use crate::ty::subst::Substs;
|
|
|
|
use crate::util::nodemap::{DefIdSet, DefIdMap, ItemLocalSet};
|
|
|
|
use crate::util::common::{ErrorReported};
|
|
|
|
use crate::util::profiling::ProfileCategory::*;
|
|
|
|
use crate::session::Session;
|
2016-10-28 13:55:49 +03:00
|
|
|
|
Merge indexed_set.rs into bitvec.rs, and rename it bit_set.rs.
Currently we have two files implementing bitsets (and 2D bit matrices).
This commit combines them into one, taking the best features from each.
This involves renaming a lot of things. The high level changes are as
follows.
- bitvec.rs --> bit_set.rs
- indexed_set.rs --> (removed)
- BitArray + IdxSet --> BitSet (merged, see below)
- BitVector --> GrowableBitSet
- {,Sparse,Hybrid}IdxSet --> {,Sparse,Hybrid}BitSet
- BitMatrix --> BitMatrix
- SparseBitMatrix --> SparseBitMatrix
The changes within the bitset types themselves are as follows.
```
OLD OLD NEW
BitArray<C> IdxSet<T> BitSet<T>
-------- ------ ------
grow - grow
new - (remove)
new_empty new_empty new_empty
new_filled new_filled new_filled
- to_hybrid to_hybrid
clear clear clear
set_up_to set_up_to set_up_to
clear_above - clear_above
count - count
contains(T) contains(&T) contains(T)
contains_all - superset
is_empty - is_empty
insert(T) add(&T) insert(T)
insert_all - insert_all()
remove(T) remove(&T) remove(T)
words words words
words_mut words_mut words_mut
- overwrite overwrite
merge union union
- subtract subtract
- intersect intersect
iter iter iter
```
In general, when choosing names I went with:
- names that are more obvious (e.g. `BitSet` over `IdxSet`).
- names that are more like the Rust libraries (e.g. `T` over `C`,
`insert` over `add`);
- names that are more set-like (e.g. `union` over `merge`, `superset`
over `contains_all`, `domain_size` over `num_bits`).
Also, using `T` for index arguments seems more sensible than `&T` --
even though the latter is standard in Rust collection types -- because
indices are always copyable. It also results in fewer `&` and `*`
sigils in practice.
2018-09-14 15:07:25 +10:00
|
|
|
use rustc_data_structures::bit_set::BitSet;
|
2016-09-29 02:30:53 +03:00
|
|
|
use rustc_data_structures::indexed_vec::IndexVec;
|
2017-09-08 13:51:57 -07:00
|
|
|
use rustc_data_structures::fx::{FxHashMap, FxHashSet};
|
2017-09-14 17:40:37 +02:00
|
|
|
use rustc_data_structures::stable_hasher::StableVec;
|
Merge indexed_set.rs into bitvec.rs, and rename it bit_set.rs.
Currently we have two files implementing bitsets (and 2D bit matrices).
This commit combines them into one, taking the best features from each.
This involves renaming a lot of things. The high level changes are as
follows.
- bitvec.rs --> bit_set.rs
- indexed_set.rs --> (removed)
- BitArray + IdxSet --> BitSet (merged, see below)
- BitVector --> GrowableBitSet
- {,Sparse,Hybrid}IdxSet --> {,Sparse,Hybrid}BitSet
- BitMatrix --> BitMatrix
- SparseBitMatrix --> SparseBitMatrix
The changes within the bitset types themselves are as follows.
```
OLD OLD NEW
BitArray<C> IdxSet<T> BitSet<T>
-------- ------ ------
grow - grow
new - (remove)
new_empty new_empty new_empty
new_filled new_filled new_filled
- to_hybrid to_hybrid
clear clear clear
set_up_to set_up_to set_up_to
clear_above - clear_above
count - count
contains(T) contains(&T) contains(T)
contains_all - superset
is_empty - is_empty
insert(T) add(&T) insert(T)
insert_all - insert_all()
remove(T) remove(&T) remove(T)
words words words
words_mut words_mut words_mut
- overwrite overwrite
merge union union
- subtract subtract
- intersect intersect
iter iter iter
```
In general, when choosing names I went with:
- names that are more obvious (e.g. `BitSet` over `IdxSet`).
- names that are more like the Rust libraries (e.g. `T` over `C`,
`insert` over `add`);
- names that are more set-like (e.g. `union` over `merge`, `superset`
over `contains_all`, `domain_size` over `num_bits`).
Also, using `T` for index arguments seems more sensible than `&T` --
even though the latter is standard in Rust collection types -- because
indices are always copyable. It also results in fewer `&` and `*`
sigils in practice.
2018-09-14 15:07:25 +10:00
|
|
|
use rustc_data_structures::sync::Lrc;
|
2019-01-20 05:44:02 +01:00
|
|
|
use rustc_data_structures::fingerprint::Fingerprint;
|
Merge indexed_set.rs into bitvec.rs, and rename it bit_set.rs.
Currently we have two files implementing bitsets (and 2D bit matrices).
This commit combines them into one, taking the best features from each.
This involves renaming a lot of things. The high level changes are as
follows.
- bitvec.rs --> bit_set.rs
- indexed_set.rs --> (removed)
- BitArray + IdxSet --> BitSet (merged, see below)
- BitVector --> GrowableBitSet
- {,Sparse,Hybrid}IdxSet --> {,Sparse,Hybrid}BitSet
- BitMatrix --> BitMatrix
- SparseBitMatrix --> SparseBitMatrix
The changes within the bitset types themselves are as follows.
```
OLD OLD NEW
BitArray<C> IdxSet<T> BitSet<T>
-------- ------ ------
grow - grow
new - (remove)
new_empty new_empty new_empty
new_filled new_filled new_filled
- to_hybrid to_hybrid
clear clear clear
set_up_to set_up_to set_up_to
clear_above - clear_above
count - count
contains(T) contains(&T) contains(T)
contains_all - superset
is_empty - is_empty
insert(T) add(&T) insert(T)
insert_all - insert_all()
remove(T) remove(&T) remove(T)
words words words
words_mut words_mut words_mut
- overwrite overwrite
merge union union
- subtract subtract
- intersect intersect
iter iter iter
```
In general, when choosing names I went with:
- names that are more obvious (e.g. `BitSet` over `IdxSet`).
- names that are more like the Rust libraries (e.g. `T` over `C`,
`insert` over `add`);
- names that are more set-like (e.g. `union` over `merge`, `superset`
over `contains_all`, `domain_size` over `num_bits`).
Also, using `T` for index arguments seems more sensible than `&T` --
even though the latter is standard in Rust collection types -- because
indices are always copyable. It also results in fewer `&` and `*`
sigils in practice.
2018-09-14 15:07:25 +10:00
|
|
|
use rustc_target::spec::PanicStrategy;
|
2017-09-07 16:11:58 +02:00
|
|
|
|
2018-10-01 15:31:27 +02:00
|
|
|
use std::borrow::Cow;
|
2017-04-24 18:06:39 +03:00
|
|
|
use std::ops::Deref;
|
2017-09-12 09:32:37 -07:00
|
|
|
use std::sync::Arc;
|
2018-12-24 06:18:39 +01:00
|
|
|
use std::intrinsics::type_name;
|
2017-02-14 11:32:00 +02:00
|
|
|
use syntax_pos::{Span, DUMMY_SP};
|
2017-09-13 20:26:39 -07:00
|
|
|
use syntax_pos::symbol::InternedString;
|
2017-05-02 06:53:34 -05:00
|
|
|
use syntax::attr;
|
2017-05-03 08:40:32 -05:00
|
|
|
use syntax::ast;
|
2018-02-14 16:11:02 +01:00
|
|
|
use syntax::feature_gate;
|
2017-04-24 19:35:47 +03:00
|
|
|
use syntax::symbol::Symbol;
|
2015-12-22 16:39:33 -05:00
|
|
|
|
2017-09-18 05:40:13 -04:00
|
|
|
#[macro_use]
|
|
|
|
mod plumbing;
|
|
|
|
use self::plumbing::*;
|
2018-04-06 12:56:59 +02:00
|
|
|
pub use self::plumbing::{force_from_dep_node, CycleError};
|
2017-09-12 11:04:46 -07:00
|
|
|
|
2018-03-15 10:03:36 +01:00
|
|
|
mod job;
|
2018-03-24 06:19:20 +01:00
|
|
|
pub use self::job::{QueryJob, QueryInfo};
|
2019-01-28 15:51:47 +01:00
|
|
|
#[cfg(parallel_compiler)]
|
2018-04-06 12:56:59 +02:00
|
|
|
pub use self::job::handle_deadlock;
|
2018-03-15 10:03:36 +01:00
|
|
|
|
2017-09-18 05:40:13 -04:00
|
|
|
mod keys;
|
2018-06-13 16:44:43 +03:00
|
|
|
use self::keys::Key;
|
2017-09-13 20:26:39 -07:00
|
|
|
|
2017-09-18 05:40:13 -04:00
|
|
|
mod values;
|
|
|
|
use self::values::Value;
|
2017-09-13 20:26:39 -07:00
|
|
|
|
2017-09-18 05:40:13 -04:00
|
|
|
mod config;
|
|
|
|
pub use self::config::QueryConfig;
|
2018-06-13 16:44:43 +03:00
|
|
|
use self::config::{QueryAccessors, QueryDescription};
|
2017-04-28 09:40:48 -04:00
|
|
|
|
2017-10-19 14:32:39 +02:00
|
|
|
mod on_disk_cache;
|
|
|
|
pub use self::on_disk_cache::OnDiskCache;
|
|
|
|
|
2018-06-13 16:44:43 +03:00
|
|
|
// Each of these quries corresponds to a function pointer field in the
|
|
|
|
// `Providers` struct for requesting a value of that type, and a method
|
|
|
|
// on `tcx: TyCtxt` (and `tcx.at(span)`) for doing that request in a way
|
|
|
|
// which memoizes and does dep-graph tracking, wrapping around the actual
|
|
|
|
// `Providers` that the driver creates (using several `rustc_*` crates).
|
2018-01-31 16:08:14 +01:00
|
|
|
//
|
2018-06-13 16:44:43 +03:00
|
|
|
// The result type of each query must implement `Clone`, and additionally
|
|
|
|
// `ty::query::values::Value`, which produces an appropriate placeholder
|
|
|
|
// (error) value if the query resulted in a query cycle.
|
|
|
|
// Queries marked with `fatal_cycle` do not need the latter implementation,
|
2018-01-31 16:08:14 +01:00
|
|
|
// as they will raise an fatal error on query cycles instead.
|
2018-06-13 16:44:43 +03:00
|
|
|
define_queries! { <'tcx>
|
2018-05-19 13:50:58 -04:00
|
|
|
Other {
|
|
|
|
/// Records the type of every item.
|
|
|
|
[] fn type_of: TypeOfItem(DefId) -> Ty<'tcx>,
|
|
|
|
|
|
|
|
/// Maps from the def-id of an item (trait/struct/enum/fn) to its
|
|
|
|
/// associated generics.
|
|
|
|
[] fn generics_of: GenericsOfItem(DefId) -> &'tcx ty::Generics,
|
|
|
|
|
|
|
|
/// Maps from the def-id of an item (trait/struct/enum/fn) to the
|
|
|
|
/// predicates (where clauses) that must be proven true in order
|
|
|
|
/// to reference it. This is almost always the "predicates query"
|
|
|
|
/// that you want.
|
|
|
|
///
|
|
|
|
/// `predicates_of` builds on `predicates_defined_on` -- in fact,
|
|
|
|
/// it is almost always the same as that query, except for the
|
|
|
|
/// case of traits. For traits, `predicates_of` contains
|
|
|
|
/// an additional `Self: Trait<...>` predicate that users don't
|
|
|
|
/// actually write. This reflects the fact that to invoke the
|
|
|
|
/// trait (e.g., via `Default::default`) you must supply types
|
|
|
|
/// that actually implement the trait. (However, this extra
|
|
|
|
/// predicate gets in the way of some checks, which are intended
|
|
|
|
/// to operate over only the actual where-clauses written by the
|
|
|
|
/// user.)
|
2018-11-08 17:14:13 +11:00
|
|
|
[] fn predicates_of: PredicatesOfItem(DefId) -> Lrc<ty::GenericPredicates<'tcx>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
/// Maps from the def-id of an item (trait/struct/enum/fn) to the
|
|
|
|
/// predicates (where clauses) directly defined on it. This is
|
|
|
|
/// equal to the `explicit_predicates_of` predicates plus the
|
|
|
|
/// `inferred_outlives_of` predicates.
|
2018-11-08 17:14:13 +11:00
|
|
|
[] fn predicates_defined_on: PredicatesDefinedOnItem(DefId)
|
|
|
|
-> Lrc<ty::GenericPredicates<'tcx>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
/// Returns the predicates written explicit by the user.
|
|
|
|
[] fn explicit_predicates_of: ExplicitPredicatesOfItem(DefId)
|
2018-11-08 17:14:13 +11:00
|
|
|
-> Lrc<ty::GenericPredicates<'tcx>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
/// Returns the inferred outlives predicates (e.g., for `struct
|
|
|
|
/// Foo<'a, T> { x: &'a T }`, this would return `T: 'a`).
|
|
|
|
[] fn inferred_outlives_of: InferredOutlivesOf(DefId) -> Lrc<Vec<ty::Predicate<'tcx>>>,
|
|
|
|
|
|
|
|
/// Maps from the def-id of a trait to the list of
|
|
|
|
/// super-predicates. This is a subset of the full list of
|
|
|
|
/// predicates. We store these in a separate map because we must
|
|
|
|
/// evaluate them even during type conversion, often before the
|
|
|
|
/// full predicates are available (note that supertraits have
|
|
|
|
/// additional acyclicity requirements).
|
2018-11-08 17:14:13 +11:00
|
|
|
[] fn super_predicates_of: SuperPredicatesOfItem(DefId) -> Lrc<ty::GenericPredicates<'tcx>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
/// To avoid cycles within the predicates of a single item we compute
|
|
|
|
/// per-type-parameter predicates for resolving `T::AssocTy`.
|
|
|
|
[] fn type_param_predicates: type_param_predicates((DefId, DefId))
|
2018-11-08 17:14:13 +11:00
|
|
|
-> Lrc<ty::GenericPredicates<'tcx>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
[] fn trait_def: TraitDefOfItem(DefId) -> &'tcx ty::TraitDef,
|
|
|
|
[] fn adt_def: AdtDefOfItem(DefId) -> &'tcx ty::AdtDef,
|
|
|
|
[] fn adt_destructor: AdtDestructor(DefId) -> Option<ty::Destructor>,
|
|
|
|
[] fn adt_sized_constraint: SizedConstraint(DefId) -> &'tcx [Ty<'tcx>],
|
|
|
|
[] fn adt_dtorck_constraint: DtorckConstraint(
|
|
|
|
DefId
|
|
|
|
) -> Result<DtorckConstraint<'tcx>, NoSolution>,
|
|
|
|
|
2018-08-31 13:50:14 +02:00
|
|
|
/// True if this is a const fn, use the `is_const_fn` to know whether your crate actually
|
2018-11-27 02:59:49 +00:00
|
|
|
/// sees it as const fn (e.g., the const-fn-ness might be unstable and you might not have
|
2018-08-31 13:50:14 +02:00
|
|
|
/// the feature gate active)
|
|
|
|
///
|
2018-11-27 02:59:49 +00:00
|
|
|
/// **Do not call this function manually.** It is only meant to cache the base data for the
|
|
|
|
/// `is_const_fn` function.
|
2018-08-31 13:50:14 +02:00
|
|
|
[] fn is_const_fn_raw: IsConstFn(DefId) -> bool,
|
|
|
|
|
|
|
|
|
|
|
|
/// Returns true if calls to the function may be promoted
|
|
|
|
///
|
2018-11-27 02:59:49 +00:00
|
|
|
/// This is either because the function is e.g., a tuple-struct or tuple-variant
|
|
|
|
/// constructor, or because it has the `#[rustc_promotable]` attribute. The attribute should
|
|
|
|
/// be removed in the future in favour of some form of check which figures out whether the
|
|
|
|
/// function does not inspect the bits of any of its arguments (so is essentially just a
|
|
|
|
/// constructor function).
|
2018-08-31 13:50:14 +02:00
|
|
|
[] fn is_promotable_const_fn: IsPromotableConstFn(DefId) -> bool,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
/// True if this is a foreign item (i.e., linked via `extern { ... }`).
|
|
|
|
[] fn is_foreign_item: IsForeignItem(DefId) -> bool,
|
|
|
|
|
|
|
|
/// Get a map with the variance of every item; use `item_variance`
|
|
|
|
/// instead.
|
|
|
|
[] fn crate_variances: crate_variances(CrateNum) -> Lrc<ty::CrateVariancesMap>,
|
|
|
|
|
|
|
|
/// Maps from def-id of a type or region parameter to its
|
|
|
|
/// (inferred) variance.
|
|
|
|
[] fn variances_of: ItemVariances(DefId) -> Lrc<Vec<ty::Variance>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
/// Maps from def-id of a type to its (inferred) outlives.
|
|
|
|
[] fn inferred_outlives_crate: InferredOutlivesCrate(CrateNum)
|
|
|
|
-> Lrc<ty::CratePredicatesMap<'tcx>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
/// Maps from an impl/trait def-id to a list of the def-ids of its items
|
|
|
|
[] fn associated_item_def_ids: AssociatedItemDefIds(DefId) -> Lrc<Vec<DefId>>,
|
|
|
|
|
|
|
|
/// Maps from a trait item to the trait item "descriptor"
|
|
|
|
[] fn associated_item: AssociatedItems(DefId) -> ty::AssociatedItem,
|
|
|
|
|
|
|
|
[] fn impl_trait_ref: ImplTraitRef(DefId) -> Option<ty::TraitRef<'tcx>>,
|
|
|
|
[] fn impl_polarity: ImplPolarity(DefId) -> hir::ImplPolarity,
|
2019-01-03 23:46:46 +02:00
|
|
|
|
|
|
|
[] fn issue33140_self_ty: Issue33140SelfTy(DefId) -> Option<ty::Ty<'tcx>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
/// Maps a DefId of a type to a list of its inherent impls.
|
|
|
|
/// Contains implementations of methods that are inherent to a type.
|
|
|
|
/// Methods in these implementations don't need to be exported.
|
|
|
|
[] fn inherent_impls: InherentImpls(DefId) -> Lrc<Vec<DefId>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Codegen {
|
|
|
|
/// Set of all the def-ids in this crate that have MIR associated with
|
|
|
|
/// them. This includes all the body owners, but also things like struct
|
|
|
|
/// constructors.
|
|
|
|
[] fn mir_keys: mir_keys(CrateNum) -> Lrc<DefIdSet>,
|
|
|
|
|
|
|
|
/// Maps DefId's that have an associated Mir to the result
|
|
|
|
/// of the MIR qualify_consts pass. The actual meaning of
|
|
|
|
/// the value isn't known except to the pass itself.
|
Merge indexed_set.rs into bitvec.rs, and rename it bit_set.rs.
Currently we have two files implementing bitsets (and 2D bit matrices).
This commit combines them into one, taking the best features from each.
This involves renaming a lot of things. The high level changes are as
follows.
- bitvec.rs --> bit_set.rs
- indexed_set.rs --> (removed)
- BitArray + IdxSet --> BitSet (merged, see below)
- BitVector --> GrowableBitSet
- {,Sparse,Hybrid}IdxSet --> {,Sparse,Hybrid}BitSet
- BitMatrix --> BitMatrix
- SparseBitMatrix --> SparseBitMatrix
The changes within the bitset types themselves are as follows.
```
OLD OLD NEW
BitArray<C> IdxSet<T> BitSet<T>
-------- ------ ------
grow - grow
new - (remove)
new_empty new_empty new_empty
new_filled new_filled new_filled
- to_hybrid to_hybrid
clear clear clear
set_up_to set_up_to set_up_to
clear_above - clear_above
count - count
contains(T) contains(&T) contains(T)
contains_all - superset
is_empty - is_empty
insert(T) add(&T) insert(T)
insert_all - insert_all()
remove(T) remove(&T) remove(T)
words words words
words_mut words_mut words_mut
- overwrite overwrite
merge union union
- subtract subtract
- intersect intersect
iter iter iter
```
In general, when choosing names I went with:
- names that are more obvious (e.g. `BitSet` over `IdxSet`).
- names that are more like the Rust libraries (e.g. `T` over `C`,
`insert` over `add`);
- names that are more set-like (e.g. `union` over `merge`, `superset`
over `contains_all`, `domain_size` over `num_bits`).
Also, using `T` for index arguments seems more sensible than `&T` --
even though the latter is standard in Rust collection types -- because
indices are always copyable. It also results in fewer `&` and `*`
sigils in practice.
2018-09-14 15:07:25 +10:00
|
|
|
[] fn mir_const_qualif: MirConstQualif(DefId) -> (u8, Lrc<BitSet<mir::Local>>),
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
/// Fetch the MIR for a given def-id right after it's built - this includes
|
|
|
|
/// unreachable code.
|
2019-01-22 08:59:17 +01:00
|
|
|
[] fn mir_built: MirBuilt(DefId) -> &'tcx Steal<mir::Mir<'tcx>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
/// Fetch the MIR for a given def-id up till the point where it is
|
|
|
|
/// ready for const evaluation.
|
|
|
|
///
|
|
|
|
/// See the README for the `mir` module for details.
|
2019-01-20 05:44:02 +01:00
|
|
|
[no_hash] fn mir_const: MirConst(DefId) -> &'tcx Steal<mir::Mir<'tcx>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
2019-01-20 05:44:02 +01:00
|
|
|
[no_hash] fn mir_validated: MirValidated(DefId) -> &'tcx Steal<mir::Mir<'tcx>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
/// MIR after our optimization passes have run. This is MIR that is ready
|
|
|
|
/// for codegen. This is also the only query that can fetch non-local MIR, at present.
|
2019-01-22 15:24:00 +01:00
|
|
|
[] fn optimized_mir: MirOptimized(DefId) -> &'tcx mir::Mir<'tcx>,
|
2018-05-19 13:50:58 -04:00
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
/// The result of unsafety-checking this def-id.
|
|
|
|
[] fn unsafety_check_result: UnsafetyCheckResult(DefId) -> mir::UnsafetyCheckResult,
|
|
|
|
|
|
|
|
/// HACK: when evaluated, this reports a "unsafe derive on repr(packed)" error
|
|
|
|
[] fn unsafe_derive_on_repr_packed: UnsafeDeriveOnReprPacked(DefId) -> (),
|
|
|
|
|
|
|
|
/// The signature of functions and closures.
|
|
|
|
[] fn fn_sig: FnSignature(DefId) -> ty::PolyFnSig<'tcx>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
2018-06-06 22:13:52 +02:00
|
|
|
/// Checks the attributes in the module
|
|
|
|
[] fn check_mod_attrs: CheckModAttrs(DefId) -> (),
|
|
|
|
|
|
|
|
[] fn check_mod_unstable_api_usage: CheckModUnstableApiUsage(DefId) -> (),
|
|
|
|
|
|
|
|
/// Checks the loops in the module
|
|
|
|
[] fn check_mod_loops: CheckModLoops(DefId) -> (),
|
|
|
|
|
|
|
|
[] fn check_mod_item_types: CheckModItemTypes(DefId) -> (),
|
|
|
|
|
2018-06-08 19:14:03 +02:00
|
|
|
[] fn check_mod_privacy: CheckModPrivacy(DefId) -> (),
|
|
|
|
|
|
|
|
[] fn check_mod_intrinsics: CheckModIntrinsics(DefId) -> (),
|
|
|
|
|
|
|
|
[] fn check_mod_liveness: CheckModLiveness(DefId) -> (),
|
|
|
|
|
2019-01-26 12:18:32 +01:00
|
|
|
[] fn check_mod_impl_wf: CheckModImplWf(DefId) -> (),
|
|
|
|
|
2018-06-06 22:13:52 +02:00
|
|
|
[] fn collect_mod_item_types: CollectModItemTypes(DefId) -> (),
|
|
|
|
|
2018-05-19 13:50:58 -04:00
|
|
|
/// Caches CoerceUnsized kinds for impls on custom types.
|
|
|
|
[] fn coerce_unsized_info: CoerceUnsizedInfo(DefId)
|
|
|
|
-> ty::adjustment::CoerceUnsizedInfo,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
[] fn typeck_item_bodies: typeck_item_bodies_dep_node(CrateNum) -> CompileResult,
|
|
|
|
|
2019-01-21 03:39:25 +01:00
|
|
|
[] fn typeck_tables_of: TypeckTables(DefId) -> &'tcx ty::TypeckTables<'tcx>,
|
2018-05-19 13:50:58 -04:00
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn used_trait_imports: UsedTraitImports(DefId) -> Lrc<DefIdSet>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
[] fn has_typeck_tables: HasTypeckTables(DefId) -> bool,
|
|
|
|
|
|
|
|
[] fn coherent_trait: CoherenceCheckTrait(DefId) -> (),
|
|
|
|
},
|
|
|
|
|
|
|
|
BorrowChecking {
|
|
|
|
[] fn borrowck: BorrowCheck(DefId) -> Lrc<BorrowCheckResult>,
|
|
|
|
|
|
|
|
/// Borrow checks the function body. If this is a closure, returns
|
|
|
|
/// additional requirements that the closure's creator must verify.
|
|
|
|
[] fn mir_borrowck: MirBorrowCheck(DefId) -> mir::BorrowCheckResult<'tcx>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
/// Gets a complete map from all types to their inherent impls.
|
|
|
|
/// Not meant to be used directly outside of coherence.
|
|
|
|
/// (Defined only for LOCAL_CRATE)
|
2018-11-11 16:25:00 -08:00
|
|
|
[] fn crate_inherent_impls: crate_inherent_impls_dep_node(CrateNum)
|
|
|
|
-> Lrc<CrateInherentImpls>,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
/// Checks all types in the krate for overlap in their inherent impls. Reports errors.
|
|
|
|
/// Not meant to be used directly outside of coherence.
|
|
|
|
/// (Defined only for LOCAL_CRATE)
|
|
|
|
[] fn crate_inherent_impls_overlap_check: inherent_impls_overlap_check_dep_node(CrateNum)
|
|
|
|
-> (),
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
2018-08-26 15:19:34 +02:00
|
|
|
/// Evaluate a constant without running sanity checks
|
|
|
|
///
|
|
|
|
/// DO NOT USE THIS outside const eval. Const eval uses this to break query cycles during
|
|
|
|
/// validation. Please add a comment to every use site explaining why using `const_eval`
|
|
|
|
/// isn't sufficient
|
|
|
|
[] fn const_eval_raw: const_eval_raw_dep_node(ty::ParamEnvAnd<'tcx, GlobalId<'tcx>>)
|
2018-11-06 14:17:40 +01:00
|
|
|
-> ConstEvalRawResult<'tcx>,
|
2018-08-26 15:19:34 +02:00
|
|
|
|
2018-05-19 13:50:58 -04:00
|
|
|
/// Results of evaluating const items or constants embedded in
|
|
|
|
/// other items (such as enum variant explicit discriminants).
|
|
|
|
[] fn const_eval: const_eval_dep_node(ty::ParamEnvAnd<'tcx, GlobalId<'tcx>>)
|
|
|
|
-> ConstEvalResult<'tcx>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
[] fn check_match: CheckMatch(DefId)
|
|
|
|
-> Result<(), ErrorReported>,
|
|
|
|
|
|
|
|
/// Performs the privacy check and computes "access levels".
|
|
|
|
[] fn privacy_access_levels: PrivacyAccessLevels(CrateNum) -> Lrc<AccessLevels>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn reachable_set: reachability_dep_node(CrateNum) -> ReachableSet,
|
|
|
|
|
|
|
|
/// Per-body `region::ScopeTree`. The `DefId` should be the owner-def-id for the body;
|
|
|
|
/// in the case of closures, this will be redirected to the enclosing function.
|
|
|
|
[] fn region_scope_tree: RegionScopeTree(DefId) -> Lrc<region::ScopeTree>,
|
|
|
|
|
|
|
|
[] fn mir_shims: mir_shim_dep_node(ty::InstanceDef<'tcx>) -> &'tcx mir::Mir<'tcx>,
|
|
|
|
|
|
|
|
[] fn def_symbol_name: SymbolName(DefId) -> ty::SymbolName,
|
|
|
|
[] fn symbol_name: symbol_name_dep_node(ty::Instance<'tcx>) -> ty::SymbolName,
|
|
|
|
|
|
|
|
[] fn describe_def: DescribeDef(DefId) -> Option<Def>,
|
|
|
|
[] fn def_span: DefSpan(DefId) -> Span,
|
|
|
|
[] fn lookup_stability: LookupStability(DefId) -> Option<&'tcx attr::Stability>,
|
|
|
|
[] fn lookup_deprecation_entry: LookupDeprecationEntry(DefId) -> Option<DeprecationEntry>,
|
|
|
|
[] fn item_attrs: ItemAttrs(DefId) -> Lrc<[ast::Attribute]>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Codegen {
|
|
|
|
[] fn codegen_fn_attrs: codegen_fn_attrs(DefId) -> CodegenFnAttrs,
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn fn_arg_names: FnArgNames(DefId) -> Vec<ast::Name>,
|
|
|
|
/// Gets the rendered value of the specified constant or associated constant.
|
|
|
|
/// Used by rustdoc.
|
|
|
|
[] fn rendered_const: RenderedConst(DefId) -> String,
|
|
|
|
[] fn impl_parent: ImplParent(DefId) -> Option<DefId>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
[] fn trait_of_item: TraitOfItem(DefId) -> Option<DefId>,
|
|
|
|
[] fn const_is_rvalue_promotable_to_static: ConstIsRvaluePromotableToStatic(DefId) -> bool,
|
|
|
|
[] fn rvalue_promotable_map: RvaluePromotableMap(DefId) -> Lrc<ItemLocalSet>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Codegen {
|
|
|
|
[] fn is_mir_available: IsMirAvailable(DefId) -> bool,
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn vtable_methods: vtable_methods_node(ty::PolyTraitRef<'tcx>)
|
|
|
|
-> Lrc<Vec<Option<(DefId, &'tcx Substs<'tcx>)>>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Codegen {
|
|
|
|
[] fn codegen_fulfill_obligation: fulfill_obligation_dep_node(
|
|
|
|
(ty::ParamEnv<'tcx>, ty::PolyTraitRef<'tcx>)) -> Vtable<'tcx, ()>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
[] fn trait_impls_of: TraitImpls(DefId) -> Lrc<ty::trait_def::TraitImpls>,
|
|
|
|
[] fn specialization_graph_of: SpecializationGraph(DefId)
|
|
|
|
-> Lrc<specialization_graph::Graph>,
|
|
|
|
[] fn is_object_safe: ObjectSafety(DefId) -> bool,
|
|
|
|
|
2018-10-12 16:59:55 +02:00
|
|
|
/// Get the ParameterEnvironment for a given item; this environment
|
|
|
|
/// will be in "user-facing" mode, meaning that it is suitabe for
|
|
|
|
/// type-checking etc, and it does not normalize specializable
|
|
|
|
/// associated types. This is almost always what you want,
|
|
|
|
/// unless you are doing MIR optimizations, in which case you
|
|
|
|
/// might want to use `reveal_all()` method to change modes.
|
2018-05-19 13:50:58 -04:00
|
|
|
[] fn param_env: ParamEnv(DefId) -> ty::ParamEnv<'tcx>,
|
|
|
|
|
2018-11-20 11:59:06 -05:00
|
|
|
/// Trait selection queries. These are best used by invoking `ty.is_copy_modulo_regions()`,
|
2018-10-12 16:59:55 +02:00
|
|
|
/// `ty.is_copy()`, etc, since that will prune the environment where possible.
|
2018-05-19 13:50:58 -04:00
|
|
|
[] fn is_copy_raw: is_copy_dep_node(ty::ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool,
|
|
|
|
[] fn is_sized_raw: is_sized_dep_node(ty::ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool,
|
|
|
|
[] fn is_freeze_raw: is_freeze_dep_node(ty::ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool,
|
|
|
|
[] fn needs_drop_raw: needs_drop_dep_node(ty::ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool,
|
|
|
|
[] fn layout_raw: layout_dep_node(ty::ParamEnvAnd<'tcx, Ty<'tcx>>)
|
|
|
|
-> Result<&'tcx ty::layout::LayoutDetails,
|
|
|
|
ty::layout::LayoutError<'tcx>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn dylib_dependency_formats: DylibDepFormats(CrateNum)
|
|
|
|
-> Lrc<Vec<(CrateNum, LinkagePreference)>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Codegen {
|
|
|
|
[fatal_cycle] fn is_panic_runtime: IsPanicRuntime(CrateNum) -> bool,
|
|
|
|
[fatal_cycle] fn is_compiler_builtins: IsCompilerBuiltins(CrateNum) -> bool,
|
|
|
|
[fatal_cycle] fn has_global_allocator: HasGlobalAllocator(CrateNum) -> bool,
|
2018-09-06 21:24:33 +02:00
|
|
|
[fatal_cycle] fn has_panic_handler: HasPanicHandler(CrateNum) -> bool,
|
2018-05-19 13:50:58 -04:00
|
|
|
[fatal_cycle] fn is_sanitizer_runtime: IsSanitizerRuntime(CrateNum) -> bool,
|
|
|
|
[fatal_cycle] fn is_profiler_runtime: IsProfilerRuntime(CrateNum) -> bool,
|
|
|
|
[fatal_cycle] fn panic_strategy: GetPanicStrategy(CrateNum) -> PanicStrategy,
|
|
|
|
[fatal_cycle] fn is_no_builtins: IsNoBuiltins(CrateNum) -> bool,
|
|
|
|
|
|
|
|
[] fn extern_crate: ExternCrate(DefId) -> Lrc<Option<ExternCrate>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
[] fn specializes: specializes_node((DefId, DefId)) -> bool,
|
|
|
|
[] fn in_scope_traits_map: InScopeTraits(DefIndex)
|
|
|
|
-> Option<Lrc<FxHashMap<ItemLocalId, Lrc<StableVec<TraitCandidate>>>>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn module_exports: ModuleExports(DefId) -> Option<Lrc<Vec<Export>>>,
|
|
|
|
[] fn lint_levels: lint_levels_node(CrateNum) -> Lrc<lint::LintLevelMap>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
[] fn impl_defaultness: ImplDefaultness(DefId) -> hir::Defaultness,
|
|
|
|
|
|
|
|
[] fn check_item_well_formed: CheckItemWellFormed(DefId) -> (),
|
|
|
|
[] fn check_trait_item_well_formed: CheckTraitItemWellFormed(DefId) -> (),
|
|
|
|
[] fn check_impl_item_well_formed: CheckImplItemWellFormed(DefId) -> (),
|
|
|
|
},
|
|
|
|
|
|
|
|
Linking {
|
|
|
|
// The DefIds of all non-generic functions and statics in the given crate
|
|
|
|
// that can be reached from outside the crate.
|
|
|
|
//
|
|
|
|
// We expect this items to be available for being linked to.
|
|
|
|
//
|
|
|
|
// This query can also be called for LOCAL_CRATE. In this case it will
|
|
|
|
// compute which items will be reachable to other crates, taking into account
|
|
|
|
// the kind of crate that is currently compiled. Crates with only a
|
|
|
|
// C interface have fewer reachable things.
|
|
|
|
//
|
|
|
|
// Does not include external symbols that don't have a corresponding DefId,
|
|
|
|
// like the compiler-generated `main` function and so on.
|
|
|
|
[] fn reachable_non_generics: ReachableNonGenerics(CrateNum)
|
|
|
|
-> Lrc<DefIdMap<SymbolExportLevel>>,
|
|
|
|
[] fn is_reachable_non_generic: IsReachableNonGeneric(DefId) -> bool,
|
|
|
|
[] fn is_unreachable_local_definition: IsUnreachableLocalDefinition(DefId) -> bool,
|
|
|
|
},
|
|
|
|
|
|
|
|
Codegen {
|
|
|
|
[] fn upstream_monomorphizations: UpstreamMonomorphizations(CrateNum)
|
|
|
|
-> Lrc<DefIdMap<Lrc<FxHashMap<&'tcx Substs<'tcx>, CrateNum>>>>,
|
|
|
|
[] fn upstream_monomorphizations_for: UpstreamMonomorphizationsFor(DefId)
|
|
|
|
-> Option<Lrc<FxHashMap<&'tcx Substs<'tcx>, CrateNum>>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn native_libraries: NativeLibraries(CrateNum) -> Lrc<Vec<NativeLibrary>>,
|
|
|
|
|
|
|
|
[] fn foreign_modules: ForeignModules(CrateNum) -> Lrc<Vec<ForeignModule>>,
|
|
|
|
|
2019-01-15 17:44:41 +01:00
|
|
|
/// Identifies the entry-point (e.g. the `main` function) for a given
|
|
|
|
/// crate, returning `None` if there is no entry point (such as for library crates).
|
2019-01-13 13:06:26 +01:00
|
|
|
[] fn entry_fn: EntryFn(CrateNum) -> Option<(DefId, EntryFnType)>,
|
2018-05-19 13:50:58 -04:00
|
|
|
[] fn plugin_registrar_fn: PluginRegistrarFn(CrateNum) -> Option<DefId>,
|
2018-03-16 01:09:22 +02:00
|
|
|
[] fn proc_macro_decls_static: ProcMacroDeclsStatic(CrateNum) -> Option<DefId>,
|
2018-05-19 13:50:58 -04:00
|
|
|
[] fn crate_disambiguator: CrateDisambiguator(CrateNum) -> CrateDisambiguator,
|
|
|
|
[] fn crate_hash: CrateHash(CrateNum) -> Svh,
|
|
|
|
[] fn original_crate_name: OriginalCrateName(CrateNum) -> Symbol,
|
|
|
|
[] fn extra_filename: ExtraFileName(CrateNum) -> String,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
[] fn implementations_of_trait: implementations_of_trait_node((CrateNum, DefId))
|
|
|
|
-> Lrc<Vec<DefId>>,
|
|
|
|
[] fn all_trait_implementations: AllTraitImplementations(CrateNum)
|
|
|
|
-> Lrc<Vec<DefId>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn dllimport_foreign_items: DllimportForeignItems(CrateNum)
|
|
|
|
-> Lrc<FxHashSet<DefId>>,
|
|
|
|
[] fn is_dllimport_foreign_item: IsDllimportForeignItem(DefId) -> bool,
|
|
|
|
[] fn is_statically_included_foreign_item: IsStaticallyIncludedForeignItem(DefId) -> bool,
|
|
|
|
[] fn native_library_kind: NativeLibraryKind(DefId)
|
|
|
|
-> Option<NativeLibraryKind>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Linking {
|
|
|
|
[] fn link_args: link_args_node(CrateNum) -> Lrc<Vec<String>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
BorrowChecking {
|
|
|
|
// Lifetime resolution. See `middle::resolve_lifetimes`.
|
|
|
|
[] fn resolve_lifetimes: ResolveLifetimes(CrateNum) -> Lrc<ResolveLifetimes>,
|
|
|
|
[] fn named_region_map: NamedRegion(DefIndex) ->
|
|
|
|
Option<Lrc<FxHashMap<ItemLocalId, Region>>>,
|
|
|
|
[] fn is_late_bound_map: IsLateBound(DefIndex) ->
|
|
|
|
Option<Lrc<FxHashSet<ItemLocalId>>>,
|
|
|
|
[] fn object_lifetime_defaults_map: ObjectLifetimeDefaults(DefIndex)
|
|
|
|
-> Option<Lrc<FxHashMap<ItemLocalId, Lrc<Vec<ObjectLifetimeDefault>>>>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
[] fn visibility: Visibility(DefId) -> ty::Visibility,
|
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn dep_kind: DepKind(CrateNum) -> DepKind,
|
|
|
|
[] fn crate_name: CrateName(CrateNum) -> Symbol,
|
|
|
|
[] fn item_children: ItemChildren(DefId) -> Lrc<Vec<Export>>,
|
|
|
|
[] fn extern_mod_stmt_cnum: ExternModStmtCnum(DefId) -> Option<CrateNum>,
|
|
|
|
|
2018-07-23 01:20:33 +01:00
|
|
|
[] fn get_lib_features: get_lib_features_node(CrateNum) -> Lrc<LibFeatures>,
|
|
|
|
[] fn defined_lib_features: DefinedLibFeatures(CrateNum)
|
|
|
|
-> Lrc<Vec<(Symbol, Option<Symbol>)>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
[] fn get_lang_items: get_lang_items_node(CrateNum) -> Lrc<LanguageItems>,
|
|
|
|
[] fn defined_lang_items: DefinedLangItems(CrateNum) -> Lrc<Vec<(DefId, usize)>>,
|
|
|
|
[] fn missing_lang_items: MissingLangItems(CrateNum) -> Lrc<Vec<LangItem>>,
|
|
|
|
[] fn visible_parent_map: visible_parent_map_node(CrateNum)
|
|
|
|
-> Lrc<DefIdMap<DefId>>,
|
|
|
|
[] fn missing_extern_crate_item: MissingExternCrateItem(CrateNum) -> bool,
|
|
|
|
[] fn used_crate_source: UsedCrateSource(CrateNum) -> Lrc<CrateSource>,
|
|
|
|
[] fn postorder_cnums: postorder_cnums_node(CrateNum) -> Lrc<Vec<CrateNum>>,
|
|
|
|
|
|
|
|
[] fn freevars: Freevars(DefId) -> Option<Lrc<Vec<hir::Freevar>>>,
|
|
|
|
[] fn maybe_unused_trait_import: MaybeUnusedTraitImport(DefId) -> bool,
|
|
|
|
[] fn maybe_unused_extern_crates: maybe_unused_extern_crates_node(CrateNum)
|
|
|
|
-> Lrc<Vec<(DefId, Span)>>,
|
2019-01-07 11:46:44 +01:00
|
|
|
[] fn names_imported_by_glob_use: NamesImportedByGlobUse(DefId)
|
|
|
|
-> Lrc<FxHashSet<ast::Name>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
|
|
|
|
[] fn stability_index: stability_index_node(CrateNum) -> Lrc<stability::Index<'tcx>>,
|
|
|
|
[] fn all_crate_nums: all_crate_nums_node(CrateNum) -> Lrc<Vec<CrateNum>>,
|
|
|
|
|
|
|
|
/// A vector of every trait accessible in the whole crate
|
2018-11-27 02:59:49 +00:00
|
|
|
/// (i.e., including those from subcrates). This is used only for
|
2018-05-19 13:50:58 -04:00
|
|
|
/// error reporting.
|
|
|
|
[] fn all_traits: all_traits_node(CrateNum) -> Lrc<Vec<DefId>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Linking {
|
|
|
|
[] fn exported_symbols: ExportedSymbols(CrateNum)
|
|
|
|
-> Arc<Vec<(ExportedSymbol<'tcx>, SymbolExportLevel)>>,
|
|
|
|
},
|
|
|
|
|
|
|
|
Codegen {
|
|
|
|
[] fn collect_and_partition_mono_items:
|
|
|
|
collect_and_partition_mono_items_node(CrateNum)
|
|
|
|
-> (Arc<DefIdSet>, Arc<Vec<Arc<CodegenUnit<'tcx>>>>),
|
|
|
|
[] fn is_codegened_item: IsCodegenedItem(DefId) -> bool,
|
|
|
|
[] fn codegen_unit: CodegenUnit(InternedString) -> Arc<CodegenUnit<'tcx>>,
|
2018-10-27 15:29:06 +03:00
|
|
|
[] fn backend_optimization_level: BackendOptimizationLevel(CrateNum) -> OptLevel,
|
2018-05-19 13:50:58 -04:00
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn output_filenames: output_filenames_node(CrateNum)
|
|
|
|
-> Arc<OutputFilenames>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
// Erases regions from `ty` to yield a new type.
|
|
|
|
// Normally you would just use `tcx.erase_regions(&value)`,
|
|
|
|
// however, which uses this query as a kind of cache.
|
|
|
|
[] fn erase_regions_ty: erase_regions_ty(Ty<'tcx>) -> Ty<'tcx>,
|
|
|
|
|
|
|
|
/// Do not call this query directly: invoke `normalize` instead.
|
|
|
|
[] fn normalize_projection_ty: NormalizeProjectionTy(
|
|
|
|
CanonicalProjectionGoal<'tcx>
|
|
|
|
) -> Result<
|
2018-09-24 15:27:47 -04:00
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, NormalizationResult<'tcx>>>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
|
|
|
/// Do not call this query directly: invoke `normalize_erasing_regions` instead.
|
|
|
|
[] fn normalize_ty_after_erasing_regions: NormalizeTyAfterErasingRegions(
|
|
|
|
ParamEnvAnd<'tcx, Ty<'tcx>>
|
|
|
|
) -> Ty<'tcx>,
|
|
|
|
|
2018-07-04 13:07:45 -05:00
|
|
|
[] fn implied_outlives_bounds: ImpliedOutlivesBounds(
|
|
|
|
CanonicalTyGoal<'tcx>
|
|
|
|
) -> Result<
|
2018-09-24 15:27:47 -04:00
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>>,
|
2018-07-04 13:07:45 -05:00
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
2018-05-19 13:50:58 -04:00
|
|
|
/// Do not call this query directly: invoke `infcx.at().dropck_outlives()` instead.
|
|
|
|
[] fn dropck_outlives: DropckOutlives(
|
|
|
|
CanonicalTyGoal<'tcx>
|
|
|
|
) -> Result<
|
2018-09-24 15:27:47 -04:00
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
|
|
|
/// Do not call this query directly: invoke `infcx.predicate_may_hold()` or
|
|
|
|
/// `infcx.predicate_must_hold()` instead.
|
|
|
|
[] fn evaluate_obligation: EvaluateObligation(
|
|
|
|
CanonicalPredicateGoal<'tcx>
|
|
|
|
) -> Result<traits::EvaluationResult, traits::OverflowError>,
|
|
|
|
|
2018-11-24 20:18:16 +01:00
|
|
|
[] fn evaluate_goal: EvaluateGoal(
|
|
|
|
traits::ChalkCanonicalGoal<'tcx>
|
|
|
|
) -> Result<
|
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, ()>>>,
|
|
|
|
NoSolution
|
|
|
|
>,
|
|
|
|
|
2018-10-23 20:31:57 -04:00
|
|
|
/// Do not call this query directly: part of the `Eq` type-op
|
|
|
|
[] fn type_op_ascribe_user_type: TypeOpAscribeUserType(
|
|
|
|
CanonicalTypeOpAscribeUserTypeGoal<'tcx>
|
|
|
|
) -> Result<
|
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, ()>>>,
|
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
2018-05-19 13:50:58 -04:00
|
|
|
/// Do not call this query directly: part of the `Eq` type-op
|
|
|
|
[] fn type_op_eq: TypeOpEq(
|
|
|
|
CanonicalTypeOpEqGoal<'tcx>
|
|
|
|
) -> Result<
|
2018-09-24 15:27:47 -04:00
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, ()>>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
|
|
|
/// Do not call this query directly: part of the `Subtype` type-op
|
|
|
|
[] fn type_op_subtype: TypeOpSubtype(
|
|
|
|
CanonicalTypeOpSubtypeGoal<'tcx>
|
|
|
|
) -> Result<
|
2018-09-24 15:27:47 -04:00
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, ()>>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
|
|
|
/// Do not call this query directly: part of the `ProvePredicate` type-op
|
|
|
|
[] fn type_op_prove_predicate: TypeOpProvePredicate(
|
|
|
|
CanonicalTypeOpProvePredicateGoal<'tcx>
|
|
|
|
) -> Result<
|
2018-09-24 15:27:47 -04:00
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, ()>>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
|
|
|
/// Do not call this query directly: part of the `Normalize` type-op
|
|
|
|
[] fn type_op_normalize_ty: TypeOpNormalizeTy(
|
|
|
|
CanonicalTypeOpNormalizeGoal<'tcx, Ty<'tcx>>
|
|
|
|
) -> Result<
|
2018-09-24 15:27:47 -04:00
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, Ty<'tcx>>>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
|
|
|
/// Do not call this query directly: part of the `Normalize` type-op
|
|
|
|
[] fn type_op_normalize_predicate: TypeOpNormalizePredicate(
|
|
|
|
CanonicalTypeOpNormalizeGoal<'tcx, ty::Predicate<'tcx>>
|
|
|
|
) -> Result<
|
2018-09-24 15:27:47 -04:00
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, ty::Predicate<'tcx>>>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
|
|
|
/// Do not call this query directly: part of the `Normalize` type-op
|
|
|
|
[] fn type_op_normalize_poly_fn_sig: TypeOpNormalizePolyFnSig(
|
|
|
|
CanonicalTypeOpNormalizeGoal<'tcx, ty::PolyFnSig<'tcx>>
|
|
|
|
) -> Result<
|
2018-09-24 15:27:47 -04:00
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, ty::PolyFnSig<'tcx>>>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
|
|
|
/// Do not call this query directly: part of the `Normalize` type-op
|
|
|
|
[] fn type_op_normalize_fn_sig: TypeOpNormalizeFnSig(
|
|
|
|
CanonicalTypeOpNormalizeGoal<'tcx, ty::FnSig<'tcx>>
|
|
|
|
) -> Result<
|
2018-09-24 15:27:47 -04:00
|
|
|
Lrc<Canonical<'tcx, canonical::QueryResponse<'tcx, ty::FnSig<'tcx>>>>,
|
2018-05-19 13:50:58 -04:00
|
|
|
NoSolution,
|
|
|
|
>,
|
|
|
|
|
|
|
|
[] fn substitute_normalize_and_test_predicates:
|
|
|
|
substitute_normalize_and_test_predicates_node((DefId, &'tcx Substs<'tcx>)) -> bool,
|
2018-12-02 00:29:06 +02:00
|
|
|
|
|
|
|
[] fn method_autoderef_steps: MethodAutoderefSteps(
|
|
|
|
CanonicalTyGoal<'tcx>
|
|
|
|
) -> MethodAutoderefStepsResult<'tcx>,
|
2018-05-19 13:50:58 -04:00
|
|
|
},
|
|
|
|
|
|
|
|
Other {
|
|
|
|
[] fn target_features_whitelist:
|
|
|
|
target_features_whitelist_node(CrateNum) -> Lrc<FxHashMap<String, Option<String>>>,
|
|
|
|
|
|
|
|
// Get an estimate of the size of an InstanceDef based on its MIR for CGU partitioning.
|
|
|
|
[] fn instance_def_size_estimate: instance_def_size_estimate_dep_node(ty::InstanceDef<'tcx>)
|
|
|
|
-> usize,
|
|
|
|
|
|
|
|
[] fn features_query: features_node(CrateNum) -> Lrc<feature_gate::Features>,
|
|
|
|
},
|
|
|
|
|
|
|
|
TypeChecking {
|
|
|
|
[] fn program_clauses_for: ProgramClausesFor(DefId) -> Clauses<'tcx>,
|
|
|
|
|
|
|
|
[] fn program_clauses_for_env: ProgramClausesForEnv(
|
2018-10-10 17:14:33 +02:00
|
|
|
traits::Environment<'tcx>
|
2018-05-19 13:50:58 -04:00
|
|
|
) -> Clauses<'tcx>,
|
2018-10-11 17:57:45 +02:00
|
|
|
|
|
|
|
// Get the chalk-style environment of the given item.
|
2018-11-23 21:03:27 +01:00
|
|
|
[] fn environment: Environment(DefId) -> traits::Environment<'tcx>,
|
2018-05-19 13:50:58 -04:00
|
|
|
},
|
|
|
|
|
|
|
|
Linking {
|
|
|
|
[] fn wasm_import_module_map: WasmImportModuleMap(CrateNum)
|
|
|
|
-> Lrc<FxHashMap<DefId, String>>,
|
|
|
|
},
|
2017-02-07 11:47:35 +02:00
|
|
|
}
|
2017-02-19 14:46:29 +02:00
|
|
|
|
2018-06-13 16:44:43 +03:00
|
|
|
// `try_get_query` can't be public because it uses the private query
|
|
|
|
// implementation traits, so we provide access to it selectively.
|
|
|
|
impl<'a, 'tcx, 'lcx> TyCtxt<'a, 'tcx, 'lcx> {
|
|
|
|
pub fn try_adt_sized_constraint(
|
|
|
|
self,
|
|
|
|
span: Span,
|
|
|
|
key: DefId,
|
2018-12-04 16:26:34 +01:00
|
|
|
) -> Result<&'tcx [Ty<'tcx>], Box<DiagnosticBuilder<'a>>> {
|
2018-08-29 22:02:42 -07:00
|
|
|
self.try_get_query::<queries::adt_sized_constraint<'_>>(span, key)
|
2018-06-13 16:44:43 +03:00
|
|
|
}
|
|
|
|
pub fn try_needs_drop_raw(
|
|
|
|
self,
|
|
|
|
span: Span,
|
|
|
|
key: ty::ParamEnvAnd<'tcx, Ty<'tcx>>,
|
2018-12-04 16:26:34 +01:00
|
|
|
) -> Result<bool, Box<DiagnosticBuilder<'a>>> {
|
2018-08-29 22:02:42 -07:00
|
|
|
self.try_get_query::<queries::needs_drop_raw<'_>>(span, key)
|
2018-06-13 16:44:43 +03:00
|
|
|
}
|
|
|
|
pub fn try_optimized_mir(
|
|
|
|
self,
|
|
|
|
span: Span,
|
|
|
|
key: DefId,
|
2018-12-04 16:26:34 +01:00
|
|
|
) -> Result<&'tcx mir::Mir<'tcx>, Box<DiagnosticBuilder<'a>>> {
|
2018-08-29 22:02:42 -07:00
|
|
|
self.try_get_query::<queries::optimized_mir<'_>>(span, key)
|
2018-06-13 16:44:43 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-09-18 05:40:13 -04:00
|
|
|
//////////////////////////////////////////////////////////////////////
|
|
|
|
// These functions are little shims used to find the dep-node for a
|
|
|
|
// given query when there is not a *direct* mapping:
|
|
|
|
|
2018-02-14 16:11:02 +01:00
|
|
|
|
|
|
|
fn features_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::Features
|
|
|
|
}
|
|
|
|
|
2018-05-08 16:10:16 +03:00
|
|
|
fn codegen_fn_attrs<'tcx>(id: DefId) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::CodegenFnAttrs { 0: id }
|
2018-01-15 20:08:09 -05:00
|
|
|
}
|
|
|
|
|
2017-10-17 11:24:46 -04:00
|
|
|
fn erase_regions_ty<'tcx>(ty: Ty<'tcx>) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::EraseRegionsTy { ty }
|
|
|
|
}
|
|
|
|
|
2017-06-30 14:53:35 -07:00
|
|
|
fn type_param_predicates<'tcx>((item_id, param_id): (DefId, DefId)) -> DepConstructor<'tcx> {
|
2017-06-02 17:36:30 +02:00
|
|
|
DepConstructor::TypeParamPredicates {
|
|
|
|
item_id,
|
|
|
|
param_id
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-09-28 23:13:43 -04:00
|
|
|
fn fulfill_obligation_dep_node<'tcx>((param_env, trait_ref):
|
|
|
|
(ty::ParamEnv<'tcx>, ty::PolyTraitRef<'tcx>)) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::FulfillObligation {
|
|
|
|
param_env,
|
|
|
|
trait_ref
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-06-30 14:53:35 -07:00
|
|
|
fn crate_inherent_impls_dep_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
2017-06-02 17:36:30 +02:00
|
|
|
DepConstructor::Coherence
|
2017-02-19 14:46:29 +02:00
|
|
|
}
|
2017-02-08 18:31:03 +01:00
|
|
|
|
2017-08-01 16:34:20 +02:00
|
|
|
fn inherent_impls_overlap_check_dep_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::CoherenceInherentImplOverlapCheck
|
|
|
|
}
|
|
|
|
|
2017-06-30 14:53:35 -07:00
|
|
|
fn reachability_dep_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
2017-06-02 17:36:30 +02:00
|
|
|
DepConstructor::Reachability
|
2017-03-27 15:55:56 -07:00
|
|
|
}
|
|
|
|
|
2017-06-30 14:53:35 -07:00
|
|
|
fn mir_shim_dep_node<'tcx>(instance_def: ty::InstanceDef<'tcx>) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::MirShim {
|
|
|
|
instance_def
|
|
|
|
}
|
2017-02-08 18:31:03 +01:00
|
|
|
}
|
2017-03-14 22:46:36 -07:00
|
|
|
|
2017-06-30 14:53:35 -07:00
|
|
|
fn symbol_name_dep_node<'tcx>(instance: ty::Instance<'tcx>) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::InstanceSymbolName { instance }
|
2017-04-24 19:35:47 +03:00
|
|
|
}
|
|
|
|
|
2017-06-30 14:53:35 -07:00
|
|
|
fn typeck_item_bodies_dep_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
2017-06-02 17:36:30 +02:00
|
|
|
DepConstructor::TypeckBodiesKrate
|
2017-03-14 22:46:36 -07:00
|
|
|
}
|
2017-04-18 23:38:15 +03:00
|
|
|
|
2018-01-02 23:22:09 +00:00
|
|
|
fn const_eval_dep_node<'tcx>(param_env: ty::ParamEnvAnd<'tcx, GlobalId<'tcx>>)
|
2017-07-04 14:23:07 +02:00
|
|
|
-> DepConstructor<'tcx> {
|
2017-09-27 18:30:26 +02:00
|
|
|
DepConstructor::ConstEval { param_env }
|
2017-04-28 00:50:27 -07:00
|
|
|
}
|
2018-08-26 15:19:34 +02:00
|
|
|
fn const_eval_raw_dep_node<'tcx>(param_env: ty::ParamEnvAnd<'tcx, GlobalId<'tcx>>)
|
|
|
|
-> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::ConstEvalRaw { param_env }
|
|
|
|
}
|
2017-04-25 15:56:02 -04:00
|
|
|
|
2017-06-30 14:53:35 -07:00
|
|
|
fn mir_keys<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
2017-06-02 17:36:30 +02:00
|
|
|
DepConstructor::MirKeys
|
2017-04-25 15:56:02 -04:00
|
|
|
}
|
2017-04-24 11:15:12 -04:00
|
|
|
|
2017-06-30 14:53:35 -07:00
|
|
|
fn crate_variances<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
2017-06-02 17:36:30 +02:00
|
|
|
DepConstructor::CrateVariances
|
2017-04-24 11:15:12 -04:00
|
|
|
}
|
2017-05-11 16:01:19 +02:00
|
|
|
|
2017-09-27 18:30:26 +02:00
|
|
|
fn is_copy_dep_node<'tcx>(param_env: ty::ParamEnvAnd<'tcx, Ty<'tcx>>) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::IsCopy { param_env }
|
2017-05-10 10:28:06 -04:00
|
|
|
}
|
|
|
|
|
2017-09-27 18:30:26 +02:00
|
|
|
fn is_sized_dep_node<'tcx>(param_env: ty::ParamEnvAnd<'tcx, Ty<'tcx>>) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::IsSized { param_env }
|
2017-05-10 10:28:06 -04:00
|
|
|
}
|
|
|
|
|
2017-09-27 18:30:26 +02:00
|
|
|
fn is_freeze_dep_node<'tcx>(param_env: ty::ParamEnvAnd<'tcx, Ty<'tcx>>) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::IsFreeze { param_env }
|
2017-05-10 10:28:06 -04:00
|
|
|
}
|
2017-05-12 11:44:31 -04:00
|
|
|
|
2017-09-27 18:30:26 +02:00
|
|
|
fn needs_drop_dep_node<'tcx>(param_env: ty::ParamEnvAnd<'tcx, Ty<'tcx>>) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::NeedsDrop { param_env }
|
2017-05-12 11:44:31 -04:00
|
|
|
}
|
2017-05-19 17:27:25 -04:00
|
|
|
|
2017-09-27 18:30:26 +02:00
|
|
|
fn layout_dep_node<'tcx>(param_env: ty::ParamEnvAnd<'tcx, Ty<'tcx>>) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::Layout { param_env }
|
2017-05-19 17:27:25 -04:00
|
|
|
}
|
2017-07-26 21:51:09 -07:00
|
|
|
|
2017-08-28 15:55:32 -07:00
|
|
|
fn lint_levels_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
2017-07-26 21:51:09 -07:00
|
|
|
DepConstructor::LintLevels
|
|
|
|
}
|
2017-08-29 09:25:25 -07:00
|
|
|
|
|
|
|
fn specializes_node<'tcx>((a, b): (DefId, DefId)) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::Specializes { impl1: a, impl2: b }
|
|
|
|
}
|
2017-08-30 11:40:02 -07:00
|
|
|
|
|
|
|
fn implementations_of_trait_node<'tcx>((krate, trait_id): (CrateNum, DefId))
|
|
|
|
-> DepConstructor<'tcx>
|
|
|
|
{
|
|
|
|
DepConstructor::ImplementationsOfTrait { krate, trait_id }
|
|
|
|
}
|
2017-08-30 14:48:57 -07:00
|
|
|
|
|
|
|
fn link_args_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::LinkArgs
|
|
|
|
}
|
2017-08-31 08:57:41 -07:00
|
|
|
|
2018-07-23 01:20:33 +01:00
|
|
|
fn get_lib_features_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::GetLibFeatures
|
|
|
|
}
|
|
|
|
|
2017-08-31 08:57:41 -07:00
|
|
|
fn get_lang_items_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::GetLangItems
|
|
|
|
}
|
2017-08-31 11:30:22 -07:00
|
|
|
|
|
|
|
fn visible_parent_map_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::VisibleParentMap
|
|
|
|
}
|
2017-08-31 12:08:29 -07:00
|
|
|
|
|
|
|
fn postorder_cnums_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::PostorderCnums
|
|
|
|
}
|
2017-08-31 13:19:33 -07:00
|
|
|
|
|
|
|
fn maybe_unused_extern_crates_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::MaybeUnusedExternCrates
|
|
|
|
}
|
2017-08-31 15:08:34 -07:00
|
|
|
|
|
|
|
fn stability_index_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::StabilityIndex
|
|
|
|
}
|
2017-09-07 08:13:41 -07:00
|
|
|
|
|
|
|
fn all_crate_nums_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::AllCrateNums
|
|
|
|
}
|
2017-09-12 09:32:37 -07:00
|
|
|
|
2018-04-01 08:15:25 +02:00
|
|
|
fn all_traits_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::AllTraits
|
|
|
|
}
|
|
|
|
|
2018-05-08 16:10:16 +03:00
|
|
|
fn collect_and_partition_mono_items_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::CollectAndPartitionMonoItems
|
2017-09-12 11:04:46 -07:00
|
|
|
}
|
2017-09-13 20:26:39 -07:00
|
|
|
|
|
|
|
fn output_filenames_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::OutputFilenames
|
|
|
|
}
|
2017-10-07 16:55:09 -05:00
|
|
|
|
|
|
|
fn vtable_methods_node<'tcx>(trait_ref: ty::PolyTraitRef<'tcx>) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::VtableMethods{ trait_ref }
|
|
|
|
}
|
2018-02-25 10:58:54 -05:00
|
|
|
|
2017-12-27 12:32:44 -05:00
|
|
|
fn substitute_normalize_and_test_predicates_node<'tcx>(key: (DefId, &'tcx Substs<'tcx>))
|
|
|
|
-> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::SubstituteNormalizeAndTestPredicates { key }
|
|
|
|
}
|
2018-01-05 13:26:26 -08:00
|
|
|
|
|
|
|
fn target_features_whitelist_node<'tcx>(_: CrateNum) -> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::TargetFeaturesWhitelist
|
|
|
|
}
|
2018-01-19 00:32:58 +00:00
|
|
|
|
|
|
|
fn instance_def_size_estimate_dep_node<'tcx>(instance_def: ty::InstanceDef<'tcx>)
|
|
|
|
-> DepConstructor<'tcx> {
|
|
|
|
DepConstructor::InstanceDefSizeEstimate {
|
|
|
|
instance_def
|
|
|
|
}
|
|
|
|
}
|