Struct rustc_middle::ty::context::TyCtxt

pub struct TyCtxt<'tcx> {
    gcx: &'tcx GlobalCtxt<'tcx>,
}

The central data structure of the compiler. It stores references to the various arenas and also houses the results of the various compiler queries that have been performed. See the rustc dev guide for more details.

Fields

gcx: &'tcx GlobalCtxt<'tcx>

Implementations

impl<'tcx> TyCtxt<'tcx>

pub fn hir(self) -> Map<'tcx>

pub fn parent_module(self, id: HirId) -> LocalDefId

impl<'tcx> TyCtxt<'tcx>

pub fn require_lang_item(self, lang_item: LangItem, span: Option<Span>) -> DefId

Returns the DefId for a given LangItem. If not found, fatally aborts compilation.

pub fn fn_trait_kind_from_lang_item(self, id: DefId) -> Option<ClosureKind>

pub fn is_weak_lang_item(self, item_def_id: DefId) -> bool

impl<'tcx> TyCtxt<'tcx>

pub fn eval_stability(
    self,
    def_id: DefId,
    id: Option<HirId>,
    span: Span
) -> EvalResult

Evaluates the stability of an item.

Returns EvalResult::Allow if the item is stable, or unstable but the corresponding #![feature] has been provided. Returns EvalResult::Deny which describes the offending unstable feature otherwise.

If id is Some(_), this function will also check if the item at def_id has been deprecated. If the item is indeed deprecated, we will emit a deprecation lint attached to id.

pub fn check_stability(self, def_id: DefId, id: Option<HirId>, span: Span)

Checks if an item is stable or error out.

If the item defined by def_id is unstable and the corresponding #![feature] does not exist, emits an error.

This function will also check if the item is deprecated. If so, and id is not None, a deprecated lint attached to id will be emitted.

pub fn check_optional_stability(
    self,
    def_id: DefId,
    id: Option<HirId>,
    span: Span,
    unmarked: impl FnOnce(Span, DefId)
)

Like check_stability, except that we permit items to have custom behaviour for missing stability attributes (not necessarily just emit a bug!). This is necessary for default generic parameters, which only have stability attributes if they were added after the type on which they're defined.

pub fn lookup_deprecation(self, id: DefId) -> Option<Deprecation>

impl<'tcx> TyCtxt<'tcx>

pub fn const_eval_poly(self, def_id: DefId) -> EvalToConstValueResult<'tcx>

Evaluates a constant without providing any substitutions. This is useful to evaluate consts that can't take any generic arguments like statics, const items or enum discriminants. If a generic parameter is used within the constant ErrorHandled::ToGeneric will be returned.

pub fn const_eval_resolve(
    self,
    param_env: ParamEnv<'tcx>,
    def: WithOptConstParam<DefId>,
    substs: SubstsRef<'tcx>,
    promoted: Option<Promoted>,
    span: Option<Span>
) -> EvalToConstValueResult<'tcx>

Resolves and evaluates a constant.

The constant can be located on a trait like <A as B>::C, in which case the given substitutions and environment are used to resolve the constant. Alternatively if the constant has generic parameters in scope the substitutions are used to evaluate the value of the constant. For example in fn foo<T>() { let _ = [0; bar::<T>()]; } the repeat count constant bar::<T>() requires a substitution for T, if the substitution for T is still too generic for the constant to be evaluated then Err(ErrorHandled::TooGeneric) is returned.

pub fn const_eval_instance(
    self,
    param_env: ParamEnv<'tcx>,
    instance: Instance<'tcx>,
    span: Option<Span>
) -> EvalToConstValueResult<'tcx>

pub fn const_eval_global_id(
    self,
    param_env: ParamEnv<'tcx>,
    cid: GlobalId<'tcx>,
    span: Option<Span>
) -> EvalToConstValueResult<'tcx>

Evaluate a constant.

pub fn eval_static_initializer(
    self,
    def_id: DefId
) -> Result<&'tcx Allocation, ErrorHandled>

Evaluate a static's initializer, returning the allocation of the initializer's memory.

pub(in mir::interpret::queries) fn eval_to_allocation(
    self,
    gid: GlobalId<'tcx>,
    param_env: ParamEnv<'tcx>
) -> Result<&'tcx Allocation, ErrorHandled>

Evaluate anything constant-like, returning the allocation of the final memory.

impl<'tcx> TyCtxt<'tcx>

pub fn reserve_alloc_id(self) -> AllocId

Obtains a new allocation ID that can be referenced but does not yet have an allocation backing it.

Make sure to call set_alloc_id_memory or set_alloc_id_same_memory before returning such an AllocId from a query.

pub(in mir::interpret) fn reserve_and_set_dedup(
    self,
    alloc: GlobalAlloc<'tcx>
) -> AllocId

Reserves a new ID if this allocation has not been dedup-reserved before. Should only be used for function pointers and statics, we don't want to dedup IDs for "real" memory!

pub fn create_static_alloc(self, static_id: DefId) -> AllocId

Generates an AllocId for a static or return a cached one in case this function has been called on the same static before.

pub fn create_fn_alloc(self, instance: Instance<'tcx>) -> AllocId

Generates an AllocId for a function. Depending on the function type, this might get deduplicated or assigned a new ID each time.

pub fn create_memory_alloc(self, mem: &'tcx Allocation) -> AllocId

Interns the Allocation and return a new AllocId, even if there's already an identical Allocation with a different AllocId. Statics with identical content will still point to the same Allocation, i.e., their data will be deduplicated through Allocation interning -- but they are different places in memory and as such need different IDs.

pub fn get_global_alloc(self, id: AllocId) -> Option<GlobalAlloc<'tcx>>

Returns None in case the AllocId is dangling. An InterpretCx can still have a local Allocation for that AllocId, but having such an AllocId in a constant is illegal and will likely ICE. This function exists to allow const eval to detect the difference between evaluation- local dangling pointers and allocations in constants/statics.

pub fn global_alloc(self, id: AllocId) -> GlobalAlloc<'tcx>

Panics in case the AllocId is dangling. Since that is impossible for AllocIds in constants (as all constants must pass interning and validation that check for dangling ids), this function is frequently used throughout rustc, but should not be used within the miri engine.

pub fn set_alloc_id_memory(self, id: AllocId, mem: &'tcx Allocation)

Freezes an AllocId created with reserve by pointing it at an Allocation. Trying to call this function twice, even with the same Allocation will ICE the compiler.

pub(in mir::interpret) fn set_alloc_id_same_memory(
    self,
    id: AllocId,
    mem: &'tcx Allocation
)

Freezes an AllocId created with reserve by pointing it at an Allocation. May be called twice for the same (AllocId, Allocation) pair.

impl<'tcx> TyCtxt<'tcx>

Shims which make dealing with WithOptConstParam easier.

For more information on why this is needed, consider looking at the docs for WithOptConstParam itself.

pub fn mir_const_qualif_opt_const_arg(
    self,
    def: WithOptConstParam<LocalDefId>
) -> ConstQualifs

pub fn promoted_mir_opt_const_arg(
    self,
    def: WithOptConstParam<DefId>
) -> &'tcx IndexVec<Promoted, Body<'tcx>>

pub fn optimized_mir_opt_const_arg(
    self,
    def: WithOptConstParam<DefId>
) -> &'tcx Body<'tcx>

pub fn mir_abstract_const_opt_const_arg(
    self,
    def: WithOptConstParam<DefId>
) -> Result<Option<&'tcx [Node<'tcx>]>, ErrorReported>

impl<'tcx> TyCtxt<'tcx>

pub fn erase_regions<T>(self, value: T) -> T where
    T: TypeFoldable<'tcx>, 

Returns an equivalent value with all free regions removed (note that late-bound regions remain, because they are important for subtyping, but they are anonymized and normalized as well)..

impl<'tcx> TyCtxt<'tcx>

pub fn note_and_explain_type_err(
    self,
    db: &mut DiagnosticBuilder<'_>,
    err: &TypeError<'tcx>,
    cause: &ObligationCause<'tcx>,
    sp: Span,
    body_owner_def_id: DefId
)

pub(in ty::error) fn suggest_constraint(
    self,
    db: &mut DiagnosticBuilder<'_>,
    msg: &str,
    body_owner_def_id: DefId,
    proj_ty: &ProjectionTy<'tcx>,
    ty: Ty<'tcx>
) -> bool

pub(in ty::error) fn expected_projection(
    self,
    db: &mut DiagnosticBuilder<'_>,
    proj_ty: &ProjectionTy<'tcx>,
    values: &ExpectedFound<Ty<'tcx>>,
    body_owner_def_id: DefId,
    cause_code: &ObligationCauseCode<'_>
)

An associated type was expected and a different type was found.

We perform a few different checks to see what we can suggest:

• In the current item, look for associated functions that return the expected type and suggest calling them. (Not a structured suggestion.)
• If any of the item's generic bounds can be constrained, we suggest constraining the associated type to the found type.
• If the associated type has a default type and was expected inside of a trait, we mention that this is disallowed.
• If all other things fail, and the error is not because of a mismatch between the trait and the impl, we provide a generic help to constrain the assoc type or call an assoc fn that returns the type.

pub(in ty::error) fn point_at_methods_that_satisfy_associated_type(
    self,
    db: &mut DiagnosticBuilder<'_>,
    assoc_container_id: DefId,
    current_method_ident: Option<Symbol>,
    proj_ty_item_def_id: DefId,
    expected: Ty<'tcx>
) -> bool

pub(in ty::error) fn point_at_associated_type(
    self,
    db: &mut DiagnosticBuilder<'_>,
    body_owner_def_id: DefId,
    found: Ty<'tcx>
) -> bool

pub(in ty::error) fn constrain_generic_bound_associated_type_structured_suggestion(
    self,
    db: &mut DiagnosticBuilder<'_>,
    trait_ref: &TraitRef<'tcx>,
    bounds: GenericBounds<'_>,
    assoc: &AssocItem,
    ty: Ty<'tcx>,
    msg: &str
) -> bool

Given a slice of hir::GenericBounds, if any of them corresponds to the trait_ref requirement, provide a strucuted suggestion to constrain it to a given type ty.

pub(in ty::error) fn constrain_associated_type_structured_suggestion(
    self,
    db: &mut DiagnosticBuilder<'_>,
    span: Span,
    assoc: &AssocItem,
    ty: Ty<'tcx>,
    msg: &str
) -> bool

Given a span corresponding to a bound, provide a structured suggestion to set an associated type to a given type ty.

impl<'tcx> TyCtxt<'tcx>

pub fn fold_regions<T>(
    self,
    value: T,
    skipped_regions: &mut bool,
    f: impl FnMut(Region<'tcx>, DebruijnIndex) -> Region<'tcx>
) -> T where
    T: TypeFoldable<'tcx>, 

Folds the escaping and free regions in value using f, and sets skipped_regions to true if any late-bound region was found and skipped.

pub fn for_each_free_region(
    self,
    value: &impl TypeFoldable<'tcx>,
    callback: impl FnMut(Region<'tcx>)
)

Invoke callback on every region appearing free in value.

pub fn all_free_regions_meet(
    self,
    value: &impl TypeFoldable<'tcx>,
    callback: impl FnMut(Region<'tcx>) -> bool
) -> bool

Returns true if callback returns true for every region appearing free in value.

pub fn any_free_region_meets(
    self,
    value: &impl TypeFoldable<'tcx>,
    callback: impl FnMut(Region<'tcx>) -> bool
) -> bool

Returns true if callback returns true for some region appearing free in value.

impl<'tcx> TyCtxt<'tcx>

pub fn replace_late_bound_regions<T, F>(
    self,
    value: Binder<T>,
    fld_r: F
) -> (T, BTreeMap<BoundRegion, Region<'tcx>>) where
    F: FnMut(BoundRegion) -> Region<'tcx>,
    T: TypeFoldable<'tcx>, 

Replaces all regions bound by the given Binder with the results returned by the closure; the closure is expected to return a free region (relative to this binder), and hence the binder is removed in the return type. The closure is invoked once for each unique BoundRegion; multiple references to the same BoundRegion will reuse the previous result. A map is returned at the end with each bound region and the free region that replaced it.

This method only replaces late bound regions and the result may still contain escaping bound types.

pub fn replace_escaping_bound_vars<T, F, G, H>(
    self,
    value: T,
    fld_r: F,
    fld_t: G,
    fld_c: H
) -> (T, BTreeMap<BoundRegion, Region<'tcx>>) where
    F: FnMut(BoundRegion) -> Region<'tcx>,
    G: FnMut(BoundTy) -> Ty<'tcx>,
    H: FnMut(BoundVar, Ty<'tcx>) -> &'tcx Const<'tcx>,
    T: TypeFoldable<'tcx>, 

Replaces all escaping bound vars. The fld_r closure replaces escaping bound regions; the fld_t closure replaces escaping bound types and the fld_c closure replaces escaping bound consts.

pub fn replace_bound_vars<T, F, G, H>(
    self,
    value: Binder<T>,
    fld_r: F,
    fld_t: G,
    fld_c: H
) -> (T, BTreeMap<BoundRegion, Region<'tcx>>) where
    F: FnMut(BoundRegion) -> Region<'tcx>,
    G: FnMut(BoundTy) -> Ty<'tcx>,
    H: FnMut(BoundVar, Ty<'tcx>) -> &'tcx Const<'tcx>,
    T: TypeFoldable<'tcx>, 

Replaces all types or regions bound by the given Binder. The fld_r closure replaces bound regions while the fld_t closure replaces bound types.

pub fn liberate_late_bound_regions<T>(
    self,
    all_outlive_scope: DefId,
    value: Binder<T>
) -> T where
    T: TypeFoldable<'tcx>, 

Replaces any late-bound regions bound in value with free variants attached to all_outlive_scope.

pub fn collect_constrained_late_bound_regions<T>(
    self,
    value: &Binder<T>
) -> FxHashSet<BoundRegion> where
    T: TypeFoldable<'tcx>, 

Returns a set of all late-bound regions that are constrained by value, meaning that if we instantiate those LBR with variables and equate value with something else, those variables will also be equated.

pub fn collect_referenced_late_bound_regions<T>(
    self,
    value: &Binder<T>
) -> FxHashSet<BoundRegion> where
    T: TypeFoldable<'tcx>, 

Returns a set of all late-bound regions that appear in value anywhere.

pub(in ty::fold) fn collect_late_bound_regions<T>(
    self,
    value: &Binder<T>,
    just_constraint: bool
) -> FxHashSet<BoundRegion> where
    T: TypeFoldable<'tcx>, 

pub fn erase_late_bound_regions<T>(self, value: Binder<T>) -> T where
    T: TypeFoldable<'tcx>, 

Replaces any late-bound regions bound in value with 'erased. Useful in codegen but also method lookup and a few other places where precise region relationships are not required.

pub fn anonymize_late_bound_regions<T>(self, sig: Binder<T>) -> Binder<T> where
    T: TypeFoldable<'tcx>, 

Rewrite any late-bound regions so that they are anonymous. Region numbers are assigned starting at 0 and increasing monotonically in the order traversed by the fold operation.

The chief purpose of this function is to canonicalize regions so that two FnSigs or TraitRefs which are equivalent up to region naming will become structurally identical. For example, for<'a, 'b> fn(&'a isize, &'b isize) and for<'a, 'b> fn(&'b isize, &'a isize) will become identical after anonymization.

impl<'tcx> TyCtxt<'tcx>

pub fn is_ty_uninhabited_from(
    self,
    module: DefId,
    ty: Ty<'tcx>,
    param_env: ParamEnv<'tcx>
) -> bool

Checks whether a type is visibly uninhabited from a particular module.

Example

enum Void {}
mod a {
    pub mod b {
        pub struct SecretlyUninhabited {
            _priv: !,
        }
    }
}

mod c {
    pub struct AlsoSecretlyUninhabited {
        _priv: Void,
    }
    mod d {
    }
}

struct Foo {
    x: a::b::SecretlyUninhabited,
    y: c::AlsoSecretlyUninhabited,
}

In this code, the type Foo will only be visibly uninhabited inside the modules b, c and d. This effects pattern-matching on Foo or types that contain Foo.

Example

let foo_result: Result<T, Foo> = ... ;
let Ok(t) = foo_result;

This code should only compile in modules where the uninhabitedness of Foo is visible.

impl<'tcx> TyCtxt<'tcx>

pub fn layout_of(
    self,
    param_env_and_ty: ParamEnvAnd<'tcx, Ty<'tcx>>
) -> Result<TyAndLayout<'tcx>, LayoutError<'tcx>>

Computes the layout of a type. Note that this implicitly executes in "reveal all" mode.

impl<'tcx> TyCtxt<'tcx>

pub fn normalize_erasing_regions<T>(
    self,
    param_env: ParamEnv<'tcx>,
    value: T
) -> T where
    T: TypeFoldable<'tcx>, 

Erase the regions in value and then fully normalize all the types found within. The result will also have regions erased.

This is appropriate to use only after type-check: it assumes that normalization will succeed, for example.

pub fn normalize_erasing_late_bound_regions<T>(
    self,
    param_env: ParamEnv<'tcx>,
    value: Binder<T>
) -> T where
    T: TypeFoldable<'tcx>, 

If you have a Binder<T>, you can do this to strip out the late-bound regions and then normalize the result, yielding up a T (with regions erased). This is appropriate when the binder is being instantiated at the call site.

N.B., currently, higher-ranked type bounds inhibit normalization. Therefore, each time we erase them in codegen, we need to normalize the contents.

pub fn subst_and_normalize_erasing_regions<T>(
    self,
    param_substs: SubstsRef<'tcx>,
    param_env: ParamEnv<'tcx>,
    value: T
) -> T where
    T: TypeFoldable<'tcx>, 

Monomorphizes a type from the AST by first applying the in-scope substitutions and then normalizing any associated types.

impl<'tcx> TyCtxt<'tcx>

pub fn push_outlives_components(
    self,
    ty0: Ty<'tcx>,
    out: &mut SmallVec<[Component<'tcx>; 4]>
)

Push onto out all the things that must outlive 'a for the condition ty0: 'a to hold. Note that ty0 must be a fully resolved type.

impl<'t> TyCtxt<'t>

pub fn def_path_str(self, def_id: DefId) -> String

Returns a string identifying this DefId. This string is suitable for user output.

pub fn def_path_str_with_substs(
    self,
    def_id: DefId,
    substs: &'t [GenericArg<'t>]
) -> String

impl<'tcx> TyCtxt<'tcx>

pub(in ty::query) fn report_cycle(
    self,
    CycleError { usage: usage, cycle: stack }: CycleError<Query<'tcx>>
) -> DiagnosticBuilder<'tcx>

pub fn try_print_query_stack(handler: &Handler, num_frames: Option<usize>)

impl<'tcx> TyCtxt<'tcx>

pub fn ensure(self) -> TyCtxtEnsure<'tcx>

Returns a transparent wrapper for TyCtxt, which ensures queries are executed instead of just returning their results.

pub fn at(self, span: Span) -> TyCtxtAt<'tcx>

Returns a transparent wrapper for TyCtxt which uses span as the location of queries performed through it.

#[must_use]pub fn trigger_delay_span_bug(
    self,
    key: impl IntoQueryParam<DefId>
) -> <trigger_delay_span_bug<'tcx> as QueryConfig>::Stored

#[must_use]pub fn hir_crate(
    self,
    key: CrateNum
) -> <hir_crate<'tcx> as QueryConfig>::Stored

Represents crate as a whole (as distinct from the top-level crate module). If you call hir_crate (e.g., indirectly by calling tcx.hir().krate()), we will have to assume that any change means that you need to be recompiled. This is because the hir_crate query gives you access to all other items. To avoid this fate, do not call tcx.hir().krate(); instead, prefer wrappers like tcx.visit_all_items_in_krate().

#[must_use]pub fn index_hir(
    self,
    key: CrateNum
) -> <index_hir<'tcx> as QueryConfig>::Stored

The indexed HIR. This can be conveniently accessed by tcx.hir(). Avoid calling this query directly.

#[must_use]pub fn hir_module_items(
    self,
    key: LocalDefId
) -> <hir_module_items<'tcx> as QueryConfig>::Stored

The items in a module.

This can be conveniently accessed by tcx.hir().visit_item_likes_in_module. Avoid calling this query directly.

#[must_use]pub fn hir_owner(
    self,
    key: LocalDefId
) -> <hir_owner<'tcx> as QueryConfig>::Stored

Gives access to the HIR node for the HIR owner key.

This can be conveniently accessed by methods on tcx.hir(). Avoid calling this query directly.

#[must_use]pub fn hir_owner_nodes(
    self,
    key: LocalDefId
) -> <hir_owner_nodes<'tcx> as QueryConfig>::Stored

Gives access to the HIR nodes and bodies inside the HIR owner key.

This can be conveniently accessed by methods on tcx.hir(). Avoid calling this query directly.

#[must_use]pub fn opt_const_param_of(
    self,
    key: LocalDefId
) -> <opt_const_param_of<'tcx> as QueryConfig>::Stored

Computes the DefId of the corresponding const parameter in case the key is a const argument and returns None otherwise.

let a = foo::<7>();
//            ^ Calling `opt_const_param_of` for this argument,

fn foo<const N: usize>()
//           ^ returns this `DefId`.

fn bar() {
// ^ While calling `opt_const_param_of` for other bodies returns `None`.
}

#[must_use]pub fn type_of(
    self,
    key: impl IntoQueryParam<DefId>
) -> <type_of<'tcx> as QueryConfig>::Stored

Records the type of every item.

#[must_use]pub fn analysis(self, key: CrateNum) -> <analysis<'tcx> as QueryConfig>::Stored

#[must_use]pub fn generics_of(
    self,
    key: impl IntoQueryParam<DefId>
) -> <generics_of<'tcx> as QueryConfig>::Stored

Maps from the DefId of an item (trait/struct/enum/fn) to its associated generics.

#[must_use]pub fn predicates_of(
    self,
    key: impl IntoQueryParam<DefId>
) -> <predicates_of<'tcx> as QueryConfig>::Stored

Maps from the DefId 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.)

#[must_use]pub fn explicit_item_bounds(
    self,
    key: impl IntoQueryParam<DefId>
) -> <explicit_item_bounds<'tcx> as QueryConfig>::Stored

Returns the list of bounds that can be used for SelectionCandidate::ProjectionCandidate(_) and ProjectionTyCandidate::TraitDef. Specifically this is the bounds written on the trait's type definition, or those after the impl keyword

type X: Bound + 'lt
//      ^^^^^^^^^^^
impl Debug + Display
//   ^^^^^^^^^^^^^^^

key is the DefId of the associated type or opaque type.

Bounds from the parent (e.g. with nested impl trait) are not included.

#[must_use]pub fn item_bounds(
    self,
    key: impl IntoQueryParam<DefId>
) -> <item_bounds<'tcx> as QueryConfig>::Stored

Elaborated version of the predicates from explicit_item_bounds.

For example:

trait MyTrait {
    type MyAType: Eq + ?Sized;
}

explicit_item_bounds returns [<Self as MyTrait>::MyAType: Eq], and item_bounds returns

[
    <Self as Trait>::MyAType: Eq,
    <Self as Trait>::MyAType: PartialEq<<Self as Trait>::MyAType>
]

Bounds from the parent (e.g. with nested impl trait) are not included.

#[must_use]pub fn projection_ty_from_predicates(
    self,
    key: (DefId, DefId)
) -> <projection_ty_from_predicates<'tcx> as QueryConfig>::Stored

#[must_use]pub fn native_libraries(
    self,
    key: CrateNum
) -> <native_libraries<'tcx> as QueryConfig>::Stored

#[must_use]pub fn lint_levels(
    self,
    key: CrateNum
) -> <lint_levels<'tcx> as QueryConfig>::Stored

#[must_use]pub fn parent_module_from_def_id(
    self,
    key: LocalDefId
) -> <parent_module_from_def_id<'tcx> as QueryConfig>::Stored

#[must_use]pub fn expn_that_defined(
    self,
    key: impl IntoQueryParam<DefId>
) -> <expn_that_defined<'tcx> as QueryConfig>::Stored

Internal helper query. Use tcx.expansion_that_defined instead

#[must_use]pub fn is_panic_runtime(
    self,
    key: CrateNum
) -> <is_panic_runtime<'tcx> as QueryConfig>::Stored

#[must_use]pub fn mir_keys(self, key: CrateNum) -> <mir_keys<'tcx> as QueryConfig>::Stored

Set of all the DefIds in this crate that have MIR associated with them. This includes all the body owners, but also things like struct constructors.

#[must_use]pub fn mir_const_qualif(
    self,
    key: impl IntoQueryParam<DefId>
) -> <mir_const_qualif<'tcx> as QueryConfig>::Stored

Maps DefId's that have an associated mir::Body to the result of the MIR const-checking pass. This is the set of qualifs in the final value of a const.

#[must_use]pub fn mir_const_qualif_const_arg(
    self,
    key: (LocalDefId, DefId)
) -> <mir_const_qualif_const_arg<'tcx> as QueryConfig>::Stored

#[must_use]pub fn mir_built(
    self,
    key: WithOptConstParam<LocalDefId>
) -> <mir_built<'tcx> as QueryConfig>::Stored

Fetch the MIR for a given DefId right after it's built - this includes unreachable code.

#[must_use]pub fn mir_const(
    self,
    key: WithOptConstParam<LocalDefId>
) -> <mir_const<'tcx> as QueryConfig>::Stored

Fetch the MIR for a given DefId up till the point where it is ready for const qualification.

See the README for the mir module for details.

#[must_use]pub fn mir_abstract_const(
    self,
    key: impl IntoQueryParam<DefId>
) -> <mir_abstract_const<'tcx> as QueryConfig>::Stored

Try to build an abstract representation of the given constant.

#[must_use]pub fn mir_abstract_const_of_const_arg(
    self,
    key: (LocalDefId, DefId)
) -> <mir_abstract_const_of_const_arg<'tcx> as QueryConfig>::Stored

Try to build an abstract representation of the given constant.

#[must_use]pub fn try_unify_abstract_consts(
    self,
    key: ((WithOptConstParam<DefId>, SubstsRef<'tcx>), (WithOptConstParam<DefId>, SubstsRef<'tcx>))
) -> <try_unify_abstract_consts<'tcx> as QueryConfig>::Stored

#[must_use]pub fn mir_drops_elaborated_and_const_checked(
    self,
    key: WithOptConstParam<LocalDefId>
) -> <mir_drops_elaborated_and_const_checked<'tcx> as QueryConfig>::Stored

#[must_use]pub fn mir_promoted(
    self,
    key: WithOptConstParam<LocalDefId>
) -> <mir_promoted<'tcx> as QueryConfig>::Stored

#[must_use]pub fn optimized_mir(
    self,
    key: impl IntoQueryParam<DefId>
) -> <optimized_mir<'tcx> as QueryConfig>::Stored

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.

#[must_use]pub fn optimized_mir_of_const_arg(
    self,
    key: (LocalDefId, DefId)
) -> <optimized_mir_of_const_arg<'tcx> as QueryConfig>::Stored

#[must_use]pub fn coverageinfo(
    self,
    key: impl IntoQueryParam<DefId>
) -> <coverageinfo<'tcx> as QueryConfig>::Stored

Returns coverage summary info for a function, after executing the InstrumentCoverage MIR pass (assuming the -Zinstrument-coverage option is enabled).

#[must_use]pub fn promoted_mir(
    self,
    key: impl IntoQueryParam<DefId>
) -> <promoted_mir<'tcx> as QueryConfig>::Stored

The DefId is the DefId of the containing MIR body. Promoteds do not have their own DefId. This function returns all promoteds in the specified body. The body references promoteds by the DefId and the mir::Promoted index. This is necessary, because after inlining a body may refer to promoteds from other bodies. In that case you still need to use the DefId of the original body.

#[must_use]pub fn promoted_mir_of_const_arg(
    self,
    key: (LocalDefId, DefId)
) -> <promoted_mir_of_const_arg<'tcx> as QueryConfig>::Stored

#[must_use]pub fn erase_regions_ty(
    self,
    key: Ty<'tcx>
) -> <erase_regions_ty<'tcx> as QueryConfig>::Stored

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.

#[must_use]pub fn wasm_import_module_map(
    self,
    key: CrateNum
) -> <wasm_import_module_map<'tcx> as QueryConfig>::Stored

#[must_use]pub fn predicates_defined_on(
    self,
    key: impl IntoQueryParam<DefId>
) -> <predicates_defined_on<'tcx> as QueryConfig>::Stored

Maps from the DefId 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.

#[must_use]pub fn trait_explicit_predicates_and_bounds(
    self,
    key: LocalDefId
) -> <trait_explicit_predicates_and_bounds<'tcx> as QueryConfig>::Stored

Returns everything that looks like a predicate written explicitly by the user on a trait item.

Traits are unusual, because predicates on associated types are converted into bounds on that type for backwards compatibility:

trait X where Self::U: Copy { type U; }

becomes

trait X { type U: Copy; }

explicit_predicates_of and explicit_item_bounds will then take the appropriate subsets of the predicates here.

#[must_use]pub fn explicit_predicates_of(
    self,
    key: impl IntoQueryParam<DefId>
) -> <explicit_predicates_of<'tcx> as QueryConfig>::Stored

Returns the predicates written explicitly by the user.

#[must_use]pub fn inferred_outlives_of(
    self,
    key: impl IntoQueryParam<DefId>
) -> <inferred_outlives_of<'tcx> as QueryConfig>::Stored

Returns the inferred outlives predicates (e.g., for struct Foo<'a, T> { x: &'a T }, this would return T: 'a).

#[must_use]pub fn super_predicates_of(
    self,
    key: impl IntoQueryParam<DefId>
) -> <super_predicates_of<'tcx> as QueryConfig>::Stored

Maps from the DefId 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).

#[must_use]pub fn super_predicates_that_define_assoc_type(
    self,
    key: (DefId, Option<Ident>)
) -> <super_predicates_that_define_assoc_type<'tcx> as QueryConfig>::Stored

The Option<Ident> is the name of an associated type. If it is None, then this query returns the full set of predicates. If Some<Ident>, then the query returns only the subset of super-predicates that reference traits that define the given associated type. This is used to avoid cycles in resolving types like T::Item.

#[must_use]pub fn type_param_predicates(
    self,
    key: (DefId, LocalDefId, Ident)
) -> <type_param_predicates<'tcx> as QueryConfig>::Stored

To avoid cycles within the predicates of a single item we compute per-type-parameter predicates for resolving T::AssocTy.

#[must_use]pub fn trait_def(
    self,
    key: impl IntoQueryParam<DefId>
) -> <trait_def<'tcx> as QueryConfig>::Stored

#[must_use]pub fn adt_def(
    self,
    key: impl IntoQueryParam<DefId>
) -> <adt_def<'tcx> as QueryConfig>::Stored

#[must_use]pub fn adt_destructor(
    self,
    key: impl IntoQueryParam<DefId>
) -> <adt_destructor<'tcx> as QueryConfig>::Stored

#[must_use]pub fn adt_sized_constraint(
    self,
    key: impl IntoQueryParam<DefId>
) -> <adt_sized_constraint<'tcx> as QueryConfig>::Stored

#[must_use]pub fn adt_dtorck_constraint(
    self,
    key: impl IntoQueryParam<DefId>
) -> <adt_dtorck_constraint<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_const_fn_raw(
    self,
    key: impl IntoQueryParam<DefId>
) -> <is_const_fn_raw<'tcx> as QueryConfig>::Stored

Returns true if this is a const fn, use the is_const_fn to know whether your crate actually sees it as const fn (e.g., the const-fn-ness might be unstable and you might not have the feature gate active).

Do not call this function manually. It is only meant to cache the base data for the is_const_fn function.

#[must_use]pub fn is_const_impl_raw(
    self,
    key: impl IntoQueryParam<DefId>
) -> <is_const_impl_raw<'tcx> as QueryConfig>::Stored

Returns true if this is a const impl. Do not call this function manually.

This query caches the base data for the is_const_impl helper function, which also takes into account stability attributes (e.g., #[rustc_const_unstable]).

#[must_use]pub fn asyncness(
    self,
    key: impl IntoQueryParam<DefId>
) -> <asyncness<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_promotable_const_fn(
    self,
    key: impl IntoQueryParam<DefId>
) -> <is_promotable_const_fn<'tcx> as QueryConfig>::Stored

Returns true if calls to the function may be promoted.

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).

#[must_use]pub fn is_foreign_item(
    self,
    key: impl IntoQueryParam<DefId>
) -> <is_foreign_item<'tcx> as QueryConfig>::Stored

Returns true if this is a foreign item (i.e., linked via extern { ... }).

#[must_use]pub fn static_mutability(
    self,
    key: impl IntoQueryParam<DefId>
) -> <static_mutability<'tcx> as QueryConfig>::Stored

Returns Some(mutability) if the node pointed to by def_id is a static item.

#[must_use]pub fn generator_kind(
    self,
    key: impl IntoQueryParam<DefId>
) -> <generator_kind<'tcx> as QueryConfig>::Stored

Returns Some(generator_kind) if the node pointed to by def_id is a generator.

#[must_use]pub fn crate_variances(
    self,
    key: CrateNum
) -> <crate_variances<'tcx> as QueryConfig>::Stored

Gets a map with the variance of every item; use item_variance instead.

#[must_use]pub fn variances_of(
    self,
    key: impl IntoQueryParam<DefId>
) -> <variances_of<'tcx> as QueryConfig>::Stored

Maps from the DefId of a type or region parameter to its (inferred) variance.

#[must_use]pub fn inferred_outlives_crate(
    self,
    key: CrateNum
) -> <inferred_outlives_crate<'tcx> as QueryConfig>::Stored

Maps from thee DefId of a type to its (inferred) outlives.

#[must_use]pub fn associated_item_def_ids(
    self,
    key: impl IntoQueryParam<DefId>
) -> <associated_item_def_ids<'tcx> as QueryConfig>::Stored

Maps from an impl/trait DefId to a list of the DefId`s of its items.

#[must_use]pub fn associated_item(
    self,
    key: impl IntoQueryParam<DefId>
) -> <associated_item<'tcx> as QueryConfig>::Stored

Maps from a trait item to the trait item "descriptor".

#[must_use]pub fn associated_items(
    self,
    key: impl IntoQueryParam<DefId>
) -> <associated_items<'tcx> as QueryConfig>::Stored

Collects the associated items defined on a trait or impl.

#[must_use]pub fn impl_trait_ref(
    self,
    key: impl IntoQueryParam<DefId>
) -> <impl_trait_ref<'tcx> as QueryConfig>::Stored

#[must_use]pub fn impl_polarity(
    self,
    key: impl IntoQueryParam<DefId>
) -> <impl_polarity<'tcx> as QueryConfig>::Stored

#[must_use]pub fn issue33140_self_ty(
    self,
    key: impl IntoQueryParam<DefId>
) -> <issue33140_self_ty<'tcx> as QueryConfig>::Stored

#[must_use]pub fn inherent_impls(
    self,
    key: impl IntoQueryParam<DefId>
) -> <inherent_impls<'tcx> as QueryConfig>::Stored

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.

#[must_use]pub fn unsafety_check_result(
    self,
    key: LocalDefId
) -> <unsafety_check_result<'tcx> as QueryConfig>::Stored

The result of unsafety-checking this LocalDefId.

#[must_use]pub fn unsafety_check_result_for_const_arg(
    self,
    key: (LocalDefId, DefId)
) -> <unsafety_check_result_for_const_arg<'tcx> as QueryConfig>::Stored

#[must_use]pub fn unsafe_derive_on_repr_packed(
    self,
    key: LocalDefId
) -> <unsafe_derive_on_repr_packed<'tcx> as QueryConfig>::Stored

HACK: when evaluated, this reports a "unsafe derive on repr(packed)" error.

Unsafety checking is executed for each method separately, but we only want to emit this error once per derive. As there are some impls with multiple methods, we use a query for deduplication.

#[must_use]pub fn fn_sig(
    self,
    key: impl IntoQueryParam<DefId>
) -> <fn_sig<'tcx> as QueryConfig>::Stored

The signature of functions.

#[must_use]pub fn lint_mod(
    self,
    key: LocalDefId
) -> <lint_mod<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_mod_attrs(
    self,
    key: LocalDefId
) -> <check_mod_attrs<'tcx> as QueryConfig>::Stored

Checks the attributes in the module.

#[must_use]pub fn check_mod_unstable_api_usage(
    self,
    key: LocalDefId
) -> <check_mod_unstable_api_usage<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_mod_const_bodies(
    self,
    key: LocalDefId
) -> <check_mod_const_bodies<'tcx> as QueryConfig>::Stored

Checks the const bodies in the module for illegal operations (e.g. if or loop).

#[must_use]pub fn check_mod_loops(
    self,
    key: LocalDefId
) -> <check_mod_loops<'tcx> as QueryConfig>::Stored

Checks the loops in the module.

#[must_use]pub fn check_mod_naked_functions(
    self,
    key: LocalDefId
) -> <check_mod_naked_functions<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_mod_item_types(
    self,
    key: LocalDefId
) -> <check_mod_item_types<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_mod_privacy(
    self,
    key: LocalDefId
) -> <check_mod_privacy<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_mod_intrinsics(
    self,
    key: LocalDefId
) -> <check_mod_intrinsics<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_mod_liveness(
    self,
    key: LocalDefId
) -> <check_mod_liveness<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_mod_impl_wf(
    self,
    key: LocalDefId
) -> <check_mod_impl_wf<'tcx> as QueryConfig>::Stored

#[must_use]pub fn collect_mod_item_types(
    self,
    key: LocalDefId
) -> <collect_mod_item_types<'tcx> as QueryConfig>::Stored

#[must_use]pub fn coerce_unsized_info(
    self,
    key: impl IntoQueryParam<DefId>
) -> <coerce_unsized_info<'tcx> as QueryConfig>::Stored

Caches CoerceUnsized kinds for impls on custom types.

#[must_use]pub fn typeck_item_bodies(
    self,
    key: CrateNum
) -> <typeck_item_bodies<'tcx> as QueryConfig>::Stored

#[must_use]pub fn typeck(self, key: LocalDefId) -> <typeck<'tcx> as QueryConfig>::Stored

#[must_use]pub fn typeck_const_arg(
    self,
    key: (LocalDefId, DefId)
) -> <typeck_const_arg<'tcx> as QueryConfig>::Stored

#[must_use]pub fn diagnostic_only_typeck(
    self,
    key: LocalDefId
) -> <diagnostic_only_typeck<'tcx> as QueryConfig>::Stored

#[must_use]pub fn used_trait_imports(
    self,
    key: LocalDefId
) -> <used_trait_imports<'tcx> as QueryConfig>::Stored

#[must_use]pub fn has_typeck_results(
    self,
    key: impl IntoQueryParam<DefId>
) -> <has_typeck_results<'tcx> as QueryConfig>::Stored

#[must_use]pub fn coherent_trait(
    self,
    key: impl IntoQueryParam<DefId>
) -> <coherent_trait<'tcx> as QueryConfig>::Stored

#[must_use]pub fn mir_borrowck(
    self,
    key: LocalDefId
) -> <mir_borrowck<'tcx> as QueryConfig>::Stored

Borrow-checks the function body. If this is a closure, returns additional requirements that the closure's creator must verify.

#[must_use]pub fn mir_borrowck_const_arg(
    self,
    key: (LocalDefId, DefId)
) -> <mir_borrowck_const_arg<'tcx> as QueryConfig>::Stored

#[must_use]pub fn crate_inherent_impls(
    self,
    key: CrateNum
) -> <crate_inherent_impls<'tcx> as QueryConfig>::Stored

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.)

#[must_use]pub fn crate_inherent_impls_overlap_check(
    self,
    key: CrateNum
) -> <crate_inherent_impls_overlap_check<'tcx> as QueryConfig>::Stored

Checks all types in the crate for overlap in their inherent impls. Reports errors. Not meant to be used directly outside of coherence. (Defined only for LOCAL_CRATE.)

#[must_use]pub fn eval_to_allocation_raw(
    self,
    key: ParamEnvAnd<'tcx, GlobalId<'tcx>>
) -> <eval_to_allocation_raw<'tcx> as QueryConfig>::Stored

Evaluates a constant and returns the computed allocation.

Do not use this directly, use the tcx.eval_static_initializer wrapper.

#[must_use]pub fn eval_to_const_value_raw(
    self,
    key: ParamEnvAnd<'tcx, GlobalId<'tcx>>
) -> <eval_to_const_value_raw<'tcx> as QueryConfig>::Stored

Evaluates const items or anonymous constants (such as enum variant explicit discriminants or array lengths) into a representation suitable for the type system and const generics.

Do not use this directly, use one of the following wrappers: tcx.const_eval_poly, tcx.const_eval_resolve, tcx.const_eval_instance, or tcx.const_eval_global_id.

#[must_use]pub fn destructure_const(
    self,
    key: ParamEnvAnd<'tcx, &'tcx Const<'tcx>>
) -> <destructure_const<'tcx> as QueryConfig>::Stored

Destructure a constant ADT or array into its variant index and its field values.

#[must_use]pub fn deref_const(
    self,
    key: ParamEnvAnd<'tcx, &'tcx Const<'tcx>>
) -> <deref_const<'tcx> as QueryConfig>::Stored

Dereference a constant reference or raw pointer and turn the result into a constant again.

#[must_use]pub fn const_caller_location(
    self,
    key: (Symbol, u32, u32)
) -> <const_caller_location<'tcx> as QueryConfig>::Stored

#[must_use]pub fn lit_to_const(
    self,
    key: LitToConstInput<'tcx>
) -> <lit_to_const<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_match(
    self,
    key: impl IntoQueryParam<DefId>
) -> <check_match<'tcx> as QueryConfig>::Stored

#[must_use]pub fn privacy_access_levels(
    self,
    key: CrateNum
) -> <privacy_access_levels<'tcx> as QueryConfig>::Stored

Performs part of the privacy check and computes "access levels".

#[must_use]pub fn check_private_in_public(
    self,
    key: CrateNum
) -> <check_private_in_public<'tcx> as QueryConfig>::Stored

#[must_use]pub fn reachable_set(
    self,
    key: CrateNum
) -> <reachable_set<'tcx> as QueryConfig>::Stored

#[must_use]pub fn region_scope_tree(
    self,
    key: impl IntoQueryParam<DefId>
) -> <region_scope_tree<'tcx> as QueryConfig>::Stored

Per-body region::ScopeTree. The DefId should be the owner DefId for the body; in the case of closures, this will be redirected to the enclosing function.

#[must_use]pub fn mir_shims(
    self,
    key: InstanceDef<'tcx>
) -> <mir_shims<'tcx> as QueryConfig>::Stored

#[must_use]pub fn symbol_name(
    self,
    key: Instance<'tcx>
) -> <symbol_name<'tcx> as QueryConfig>::Stored

The symbol_name query provides the symbol name for calling a given instance from the local crate. In particular, it will also look up the correct symbol name of instances from upstream crates.

#[must_use]pub fn def_kind(
    self,
    key: impl IntoQueryParam<DefId>
) -> <def_kind<'tcx> as QueryConfig>::Stored

#[must_use]pub fn def_span(
    self,
    key: impl IntoQueryParam<DefId>
) -> <def_span<'tcx> as QueryConfig>::Stored

#[must_use]pub fn lookup_stability(
    self,
    key: impl IntoQueryParam<DefId>
) -> <lookup_stability<'tcx> as QueryConfig>::Stored

#[must_use]pub fn lookup_const_stability(
    self,
    key: impl IntoQueryParam<DefId>
) -> <lookup_const_stability<'tcx> as QueryConfig>::Stored

#[must_use]pub fn lookup_deprecation_entry(
    self,
    key: impl IntoQueryParam<DefId>
) -> <lookup_deprecation_entry<'tcx> as QueryConfig>::Stored

#[must_use]pub fn item_attrs(
    self,
    key: impl IntoQueryParam<DefId>
) -> <item_attrs<'tcx> as QueryConfig>::Stored

#[must_use]pub fn codegen_fn_attrs(
    self,
    key: impl IntoQueryParam<DefId>
) -> <codegen_fn_attrs<'tcx> as QueryConfig>::Stored

#[must_use]pub fn fn_arg_names(
    self,
    key: impl IntoQueryParam<DefId>
) -> <fn_arg_names<'tcx> as QueryConfig>::Stored

#[must_use]pub fn rendered_const(
    self,
    key: impl IntoQueryParam<DefId>
) -> <rendered_const<'tcx> as QueryConfig>::Stored

Gets the rendered value of the specified constant or associated constant. Used by rustdoc.

#[must_use]pub fn impl_parent(
    self,
    key: impl IntoQueryParam<DefId>
) -> <impl_parent<'tcx> as QueryConfig>::Stored

#[must_use]pub fn trait_of_item(
    self,
    key: impl IntoQueryParam<DefId>
) -> <trait_of_item<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_mir_available(
    self,
    key: impl IntoQueryParam<DefId>
) -> <is_mir_available<'tcx> as QueryConfig>::Stored

#[must_use]pub fn vtable_methods(
    self,
    key: PolyTraitRef<'tcx>
) -> <vtable_methods<'tcx> as QueryConfig>::Stored

#[must_use]pub fn codegen_fulfill_obligation(
    self,
    key: (ParamEnv<'tcx>, PolyTraitRef<'tcx>)
) -> <codegen_fulfill_obligation<'tcx> as QueryConfig>::Stored

#[must_use]pub fn all_local_trait_impls(
    self,
    key: CrateNum
) -> <all_local_trait_impls<'tcx> as QueryConfig>::Stored

#[must_use]pub fn trait_impls_of(
    self,
    key: impl IntoQueryParam<DefId>
) -> <trait_impls_of<'tcx> as QueryConfig>::Stored

#[must_use]pub fn specialization_graph_of(
    self,
    key: impl IntoQueryParam<DefId>
) -> <specialization_graph_of<'tcx> as QueryConfig>::Stored

#[must_use]pub fn object_safety_violations(
    self,
    key: impl IntoQueryParam<DefId>
) -> <object_safety_violations<'tcx> as QueryConfig>::Stored

#[must_use]pub fn param_env(
    self,
    key: impl IntoQueryParam<DefId>
) -> <param_env<'tcx> as QueryConfig>::Stored

Gets the ParameterEnvironment for a given item; this environment will be in "user-facing" mode, meaning that it is suitable 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

#[must_use]pub fn param_env_reveal_all_normalized(
    self,
    key: impl IntoQueryParam<DefId>
) -> <param_env_reveal_all_normalized<'tcx> as QueryConfig>::Stored

Like param_env, but returns the ParamEnv in Reveal::Allmode. Prefer this overtcx.param_env(def_id).with_reveal_all_normalized(tcx)`, as this method is more efficient.

#[must_use]pub fn is_copy_raw(
    self,
    key: ParamEnvAnd<'tcx, Ty<'tcx>>
) -> <is_copy_raw<'tcx> as QueryConfig>::Stored

Trait selection queries. These are best used by invoking ty.is_copy_modulo_regions(), ty.is_copy(), etc, since that will prune the environment where possible.

#[must_use]pub fn is_sized_raw(
    self,
    key: ParamEnvAnd<'tcx, Ty<'tcx>>
) -> <is_sized_raw<'tcx> as QueryConfig>::Stored

Query backing TyS::is_sized.

#[must_use]pub fn is_freeze_raw(
    self,
    key: ParamEnvAnd<'tcx, Ty<'tcx>>
) -> <is_freeze_raw<'tcx> as QueryConfig>::Stored

Query backing TyS::is_freeze.

#[must_use]pub fn needs_drop_raw(
    self,
    key: ParamEnvAnd<'tcx, Ty<'tcx>>
) -> <needs_drop_raw<'tcx> as QueryConfig>::Stored

Query backing TyS::needs_drop.

#[must_use]pub fn has_structural_eq_impls(
    self,
    key: Ty<'tcx>
) -> <has_structural_eq_impls<'tcx> as QueryConfig>::Stored

Query backing TyS::is_structural_eq_shallow.

This is only correct for ADTs. Call is_structural_eq_shallow to handle all types correctly.

#[must_use]pub fn adt_drop_tys(
    self,
    key: impl IntoQueryParam<DefId>
) -> <adt_drop_tys<'tcx> as QueryConfig>::Stored

A list of types where the ADT requires drop if and only if any of those types require drop. If the ADT is known to always need drop then Err(AlwaysRequiresDrop) is returned.

#[must_use]pub fn layout_raw(
    self,
    key: ParamEnvAnd<'tcx, Ty<'tcx>>
) -> <layout_raw<'tcx> as QueryConfig>::Stored

#[must_use]pub fn dylib_dependency_formats(
    self,
    key: CrateNum
) -> <dylib_dependency_formats<'tcx> as QueryConfig>::Stored

#[must_use]pub fn dependency_formats(
    self,
    key: CrateNum
) -> <dependency_formats<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_compiler_builtins(
    self,
    key: CrateNum
) -> <is_compiler_builtins<'tcx> as QueryConfig>::Stored

#[must_use]pub fn has_global_allocator(
    self,
    key: CrateNum
) -> <has_global_allocator<'tcx> as QueryConfig>::Stored

#[must_use]pub fn has_panic_handler(
    self,
    key: CrateNum
) -> <has_panic_handler<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_profiler_runtime(
    self,
    key: CrateNum
) -> <is_profiler_runtime<'tcx> as QueryConfig>::Stored

#[must_use]pub fn panic_strategy(
    self,
    key: CrateNum
) -> <panic_strategy<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_no_builtins(
    self,
    key: CrateNum
) -> <is_no_builtins<'tcx> as QueryConfig>::Stored

#[must_use]pub fn symbol_mangling_version(
    self,
    key: CrateNum
) -> <symbol_mangling_version<'tcx> as QueryConfig>::Stored

#[must_use]pub fn extern_crate(
    self,
    key: impl IntoQueryParam<DefId>
) -> <extern_crate<'tcx> as QueryConfig>::Stored

#[must_use]pub fn specializes(
    self,
    key: (DefId, DefId)
) -> <specializes<'tcx> as QueryConfig>::Stored

#[must_use]pub fn in_scope_traits_map(
    self,
    key: LocalDefId
) -> <in_scope_traits_map<'tcx> as QueryConfig>::Stored

#[must_use]pub fn module_exports(
    self,
    key: LocalDefId
) -> <module_exports<'tcx> as QueryConfig>::Stored

#[must_use]pub fn impl_defaultness(
    self,
    key: impl IntoQueryParam<DefId>
) -> <impl_defaultness<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_item_well_formed(
    self,
    key: LocalDefId
) -> <check_item_well_formed<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_trait_item_well_formed(
    self,
    key: LocalDefId
) -> <check_trait_item_well_formed<'tcx> as QueryConfig>::Stored

#[must_use]pub fn check_impl_item_well_formed(
    self,
    key: LocalDefId
) -> <check_impl_item_well_formed<'tcx> as QueryConfig>::Stored

#[must_use]pub fn reachable_non_generics(
    self,
    key: CrateNum
) -> <reachable_non_generics<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_reachable_non_generic(
    self,
    key: impl IntoQueryParam<DefId>
) -> <is_reachable_non_generic<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_unreachable_local_definition(
    self,
    key: impl IntoQueryParam<DefId>
) -> <is_unreachable_local_definition<'tcx> as QueryConfig>::Stored

#[must_use]pub fn upstream_monomorphizations(
    self,
    key: CrateNum
) -> <upstream_monomorphizations<'tcx> as QueryConfig>::Stored

The entire set of monomorphizations the local crate can safely link to because they are exported from upstream crates. Do not depend on this directly, as its value changes anytime a monomorphization gets added or removed in any upstream crate. Instead use the narrower upstream_monomorphizations_for, upstream_drop_glue_for, or, even better, Instance::upstream_monomorphization().

#[must_use]pub fn upstream_monomorphizations_for(
    self,
    key: impl IntoQueryParam<DefId>
) -> <upstream_monomorphizations_for<'tcx> as QueryConfig>::Stored

Returns the set of upstream monomorphizations available for the generic function identified by the given def_id. The query makes sure to make a stable selection if the same monomorphization is available in multiple upstream crates.

You likely want to call Instance::upstream_monomorphization() instead of invoking this query directly.

#[must_use]pub fn upstream_drop_glue_for(
    self,
    key: SubstsRef<'tcx>
) -> <upstream_drop_glue_for<'tcx> as QueryConfig>::Stored

Returns the upstream crate that exports drop-glue for the given type (substs is expected to be a single-item list containing the type one wants drop-glue for).

This is a subset of upstream_monomorphizations_for in order to increase dep-tracking granularity. Otherwise adding or removing any type with drop-glue in any upstream crate would invalidate all functions calling drop-glue of an upstream type.

You likely want to call Instance::upstream_monomorphization() instead of invoking this query directly.

NOTE: This query could easily be extended to also support other common functions that have are large set of monomorphizations (like Clone::clone for example).

#[must_use]pub fn foreign_modules(
    self,
    key: CrateNum
) -> <foreign_modules<'tcx> as QueryConfig>::Stored

#[must_use]pub fn entry_fn(self, key: CrateNum) -> <entry_fn<'tcx> as QueryConfig>::Stored

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).

#[must_use]pub fn plugin_registrar_fn(
    self,
    key: CrateNum
) -> <plugin_registrar_fn<'tcx> as QueryConfig>::Stored

#[must_use]pub fn proc_macro_decls_static(
    self,
    key: CrateNum
) -> <proc_macro_decls_static<'tcx> as QueryConfig>::Stored

#[must_use]pub fn crate_disambiguator(
    self,
    key: CrateNum
) -> <crate_disambiguator<'tcx> as QueryConfig>::Stored

#[must_use]pub fn crate_hash(
    self,
    key: CrateNum
) -> <crate_hash<'tcx> as QueryConfig>::Stored

#[must_use]pub fn crate_host_hash(
    self,
    key: CrateNum
) -> <crate_host_hash<'tcx> as QueryConfig>::Stored

#[must_use]pub fn original_crate_name(
    self,
    key: CrateNum
) -> <original_crate_name<'tcx> as QueryConfig>::Stored

#[must_use]pub fn extra_filename(
    self,
    key: CrateNum
) -> <extra_filename<'tcx> as QueryConfig>::Stored

#[must_use]pub fn crate_extern_paths(
    self,
    key: CrateNum
) -> <crate_extern_paths<'tcx> as QueryConfig>::Stored

#[must_use]pub fn implementations_of_trait(
    self,
    key: (CrateNum, DefId)
) -> <implementations_of_trait<'tcx> as QueryConfig>::Stored

#[must_use]pub fn all_trait_implementations(
    self,
    key: CrateNum
) -> <all_trait_implementations<'tcx> as QueryConfig>::Stored

#[must_use]pub fn dllimport_foreign_items(
    self,
    key: CrateNum
) -> <dllimport_foreign_items<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_dllimport_foreign_item(
    self,
    key: impl IntoQueryParam<DefId>
) -> <is_dllimport_foreign_item<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_statically_included_foreign_item(
    self,
    key: impl IntoQueryParam<DefId>
) -> <is_statically_included_foreign_item<'tcx> as QueryConfig>::Stored

#[must_use]pub fn native_library_kind(
    self,
    key: impl IntoQueryParam<DefId>
) -> <native_library_kind<'tcx> as QueryConfig>::Stored

#[must_use]pub fn link_args(
    self,
    key: CrateNum
) -> <link_args<'tcx> as QueryConfig>::Stored

#[must_use]pub fn resolve_lifetimes(
    self,
    key: CrateNum
) -> <resolve_lifetimes<'tcx> as QueryConfig>::Stored

Lifetime resolution. See middle::resolve_lifetimes.

#[must_use]pub fn named_region_map(
    self,
    key: LocalDefId
) -> <named_region_map<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_late_bound_map(
    self,
    key: LocalDefId
) -> <is_late_bound_map<'tcx> as QueryConfig>::Stored

#[must_use]pub fn object_lifetime_defaults_map(
    self,
    key: LocalDefId
) -> <object_lifetime_defaults_map<'tcx> as QueryConfig>::Stored

#[must_use]pub fn visibility(
    self,
    key: impl IntoQueryParam<DefId>
) -> <visibility<'tcx> as QueryConfig>::Stored

#[must_use]pub fn dep_kind(self, key: CrateNum) -> <dep_kind<'tcx> as QueryConfig>::Stored

#[must_use]pub fn crate_name(
    self,
    key: CrateNum
) -> <crate_name<'tcx> as QueryConfig>::Stored

#[must_use]pub fn item_children(
    self,
    key: impl IntoQueryParam<DefId>
) -> <item_children<'tcx> as QueryConfig>::Stored

#[must_use]pub fn extern_mod_stmt_cnum(
    self,
    key: LocalDefId
) -> <extern_mod_stmt_cnum<'tcx> as QueryConfig>::Stored

#[must_use]pub fn get_lib_features(
    self,
    key: CrateNum
) -> <get_lib_features<'tcx> as QueryConfig>::Stored

#[must_use]pub fn defined_lib_features(
    self,
    key: CrateNum
) -> <defined_lib_features<'tcx> as QueryConfig>::Stored

#[must_use]pub fn get_lang_items(
    self,
    key: CrateNum
) -> <get_lang_items<'tcx> as QueryConfig>::Stored

Returns the lang items defined in another crate by loading it from metadata.

#[must_use]pub fn all_diagnostic_items(
    self,
    key: CrateNum
) -> <all_diagnostic_items<'tcx> as QueryConfig>::Stored

Returns all diagnostic items defined in all crates.

#[must_use]pub fn defined_lang_items(
    self,
    key: CrateNum
) -> <defined_lang_items<'tcx> as QueryConfig>::Stored

Returns the lang items defined in another crate by loading it from metadata.

#[must_use]pub fn diagnostic_items(
    self,
    key: CrateNum
) -> <diagnostic_items<'tcx> as QueryConfig>::Stored

Returns the diagnostic items defined in a crate.

#[must_use]pub fn missing_lang_items(
    self,
    key: CrateNum
) -> <missing_lang_items<'tcx> as QueryConfig>::Stored

#[must_use]pub fn visible_parent_map(
    self,
    key: CrateNum
) -> <visible_parent_map<'tcx> as QueryConfig>::Stored

#[must_use]pub fn trimmed_def_paths(
    self,
    key: CrateNum
) -> <trimmed_def_paths<'tcx> as QueryConfig>::Stored

#[must_use]pub fn missing_extern_crate_item(
    self,
    key: CrateNum
) -> <missing_extern_crate_item<'tcx> as QueryConfig>::Stored

#[must_use]pub fn used_crate_source(
    self,
    key: CrateNum
) -> <used_crate_source<'tcx> as QueryConfig>::Stored

#[must_use]pub fn postorder_cnums(
    self,
    key: CrateNum
) -> <postorder_cnums<'tcx> as QueryConfig>::Stored

#[must_use]pub fn upvars_mentioned(
    self,
    key: impl IntoQueryParam<DefId>
) -> <upvars_mentioned<'tcx> as QueryConfig>::Stored

#[must_use]pub fn maybe_unused_trait_import(
    self,
    key: LocalDefId
) -> <maybe_unused_trait_import<'tcx> as QueryConfig>::Stored

#[must_use]pub fn maybe_unused_extern_crates(
    self,
    key: CrateNum
) -> <maybe_unused_extern_crates<'tcx> as QueryConfig>::Stored

#[must_use]pub fn names_imported_by_glob_use(
    self,
    key: LocalDefId
) -> <names_imported_by_glob_use<'tcx> as QueryConfig>::Stored

#[must_use]pub fn stability_index(
    self,
    key: CrateNum
) -> <stability_index<'tcx> as QueryConfig>::Stored

#[must_use]pub fn all_crate_nums(
    self,
    key: CrateNum
) -> <all_crate_nums<'tcx> as QueryConfig>::Stored

#[must_use]pub fn all_traits(
    self,
    key: CrateNum
) -> <all_traits<'tcx> as QueryConfig>::Stored

A vector of every trait accessible in the whole crate (i.e., including those from subcrates). This is used only for error reporting.

#[must_use]pub fn exported_symbols(
    self,
    key: CrateNum
) -> <exported_symbols<'tcx> as QueryConfig>::Stored

The list of symbols exported from the given crate.

• All names contained in exported_symbols(cnum) are guaranteed to correspond to a publicly visible symbol in cnum machine code.
• The exported_symbols sets of different crates do not intersect.

#[must_use]pub fn collect_and_partition_mono_items(
    self,
    key: CrateNum
) -> <collect_and_partition_mono_items<'tcx> as QueryConfig>::Stored

#[must_use]pub fn is_codegened_item(
    self,
    key: impl IntoQueryParam<DefId>
) -> <is_codegened_item<'tcx> as QueryConfig>::Stored

#[must_use]pub fn codegen_unit(
    self,
    key: Symbol
) -> <codegen_unit<'tcx> as QueryConfig>::Stored

#[must_use]pub fn unused_generic_params(
    self,
    key: impl IntoQueryParam<DefId>
) -> <unused_generic_params<'tcx> as QueryConfig>::Stored

#[must_use]pub fn backend_optimization_level(
    self,
    key: CrateNum
) -> <backend_optimization_level<'tcx> as QueryConfig>::Stored

#[must_use]pub fn output_filenames(
    self,
    key: CrateNum
) -> <output_filenames<'tcx> as QueryConfig>::Stored

#[must_use]pub fn normalize_projection_ty(
    self,
    key: CanonicalProjectionGoal<'tcx>
) -> <normalize_projection_ty<'tcx> as QueryConfig>::Stored

Do not call this query directly: invoke normalize instead.

#[must_use]pub fn normalize_generic_arg_after_erasing_regions(
    self,
    key: ParamEnvAnd<'tcx, GenericArg<'tcx>>
) -> <normalize_generic_arg_after_erasing_regions<'tcx> as QueryConfig>::Stored

Do not call this query directly: invoke normalize_erasing_regions instead.

#[must_use]pub fn implied_outlives_bounds(
    self,
    key: CanonicalTyGoal<'tcx>
) -> <implied_outlives_bounds<'tcx> as QueryConfig>::Stored

#[must_use]pub fn dropck_outlives(
    self,
    key: CanonicalTyGoal<'tcx>
) -> <dropck_outlives<'tcx> as QueryConfig>::Stored

Do not call this query directly: invoke infcx.at().dropck_outlives() instead.

#[must_use]pub fn evaluate_obligation(
    self,
    key: CanonicalPredicateGoal<'tcx>
) -> <evaluate_obligation<'tcx> as QueryConfig>::Stored

Do not call this query directly: invoke infcx.predicate_may_hold() or infcx.predicate_must_hold() instead.

#[must_use]pub fn evaluate_goal(
    self,
    key: CanonicalChalkEnvironmentAndGoal<'tcx>
) -> <evaluate_goal<'tcx> as QueryConfig>::Stored

#[must_use]pub fn type_implements_trait(
    self,
    key: (DefId, Ty<'tcx>, SubstsRef<'tcx>, ParamEnv<'tcx>)
) -> <type_implements_trait<'tcx> as QueryConfig>::Stored

#[must_use]pub fn type_op_ascribe_user_type(
    self,
    key: CanonicalTypeOpAscribeUserTypeGoal<'tcx>
) -> <type_op_ascribe_user_type<'tcx> as QueryConfig>::Stored

Do not call this query directly: part of the Eq type-op

#[must_use]pub fn type_op_eq(
    self,
    key: CanonicalTypeOpEqGoal<'tcx>
) -> <type_op_eq<'tcx> as QueryConfig>::Stored

Do not call this query directly: part of the Eq type-op

#[must_use]pub fn type_op_subtype(
    self,
    key: CanonicalTypeOpSubtypeGoal<'tcx>
) -> <type_op_subtype<'tcx> as QueryConfig>::Stored

Do not call this query directly: part of the Subtype type-op

#[must_use]pub fn type_op_prove_predicate(
    self,
    key: CanonicalTypeOpProvePredicateGoal<'tcx>
) -> <type_op_prove_predicate<'tcx> as QueryConfig>::Stored

Do not call this query directly: part of the ProvePredicate type-op

#[must_use]pub fn type_op_normalize_ty(
    self,
    key: CanonicalTypeOpNormalizeGoal<'tcx, Ty<'tcx>>
) -> <type_op_normalize_ty<'tcx> as QueryConfig>::Stored

Do not call this query directly: part of the Normalize type-op

#[must_use]pub fn type_op_normalize_predicate(
    self,
    key: CanonicalTypeOpNormalizeGoal<'tcx, Predicate<'tcx>>
) -> <type_op_normalize_predicate<'tcx> as QueryConfig>::Stored

Do not call this query directly: part of the Normalize type-op

#[must_use]pub fn type_op_normalize_poly_fn_sig(
    self,
    key: CanonicalTypeOpNormalizeGoal<'tcx, PolyFnSig<'tcx>>
) -> <type_op_normalize_poly_fn_sig<'tcx> as QueryConfig>::Stored

Do not call this query directly: part of the Normalize type-op

#[must_use]pub fn type_op_normalize_fn_sig(
    self,
    key: CanonicalTypeOpNormalizeGoal<'tcx, FnSig<'tcx>>
) -> <type_op_normalize_fn_sig<'tcx> as QueryConfig>::Stored

Do not call this query directly: part of the Normalize type-op

#[must_use]pub fn subst_and_check_impossible_predicates(
    self,
    key: (DefId, SubstsRef<'tcx>)
) -> <subst_and_check_impossible_predicates<'tcx> as QueryConfig>::Stored

#[must_use]pub fn method_autoderef_steps(
    self,
    key: CanonicalTyGoal<'tcx>
) -> <method_autoderef_steps<'tcx> as QueryConfig>::Stored

#[must_use]pub fn supported_target_features(
    self,
    key: CrateNum
) -> <supported_target_features<'tcx> as QueryConfig>::Stored

#[must_use]pub fn instance_def_size_estimate(
    self,
    key: InstanceDef<'tcx>
) -> <instance_def_size_estimate<'tcx> as QueryConfig>::Stored

Get an estimate of the size of an InstanceDef based on its MIR for CGU partitioning.

#[must_use]pub fn features_query(
    self,
    key: CrateNum
) -> <features_query<'tcx> as QueryConfig>::Stored

#[must_use]pub fn resolve_instance(
    self,
    key: ParamEnvAnd<'tcx, (DefId, SubstsRef<'tcx>)>
) -> <resolve_instance<'tcx> as QueryConfig>::Stored

Attempt to resolve the given DefId to an Instance, for the given generics args (SubstsRef), returning one of:

• Ok(Some(instance)) on success
• Ok(None) when the SubstsRef are still too generic, and therefore don't allow finding the final Instance
• Err(ErrorReported) when the Instance resolution process couldn't complete due to errors elsewhere - this is distinct from Ok(None) to avoid misleading diagnostics when an error has already been/will be emitted, for the original cause

#[must_use]pub fn resolve_instance_of_const_arg(
    self,
    key: ParamEnvAnd<'tcx, (LocalDefId, DefId, SubstsRef<'tcx>)>
) -> <resolve_instance_of_const_arg<'tcx> as QueryConfig>::Stored

#[must_use]pub fn normalize_opaque_types(
    self,
    key: &'tcx List<Predicate<'tcx>>
) -> <normalize_opaque_types<'tcx> as QueryConfig>::Stored

pub fn alloc_self_profile_query_strings(self)

All self-profiling events generated by the query engine use virtual StringIds for their event_id. This method makes all those virtual StringIds point to actual strings.

If we are recording only summary data, the ids will point to just the query names. If we are recording query keys too, we allocate the corresponding strings here.

impl<'tcx> TyCtxt<'tcx>

pub fn for_each_impl<F: FnMut(DefId)>(self, def_id: DefId, f: F)

pub fn for_each_relevant_impl<F: FnMut(DefId)>(
    self,
    def_id: DefId,
    self_ty: Ty<'tcx>,
    f: F
)

Iterate over every impl that could possibly match the self type self_ty.

pub fn find_map_relevant_impl<T, F: FnMut(DefId) -> Option<T>>(
    self,
    def_id: DefId,
    self_ty: Ty<'tcx>,
    f: F
) -> Option<T>

Applies function to every impl that could possibly match the self type self_ty and returns the first non-none value.

pub fn all_impls(self, def_id: DefId) -> impl Iterator<Item = DefId> + 'tcx

Returns an iterator containing all impls

impl<'tcx> TyCtxt<'tcx>

pub fn type_id_hash(self, ty: Ty<'tcx>) -> u64

Creates a hash of the type Ty which will be the same no matter what crate context it's calculated within. This is used by the type_id intrinsic.

pub fn has_error_field(self, ty: Ty<'tcx>) -> bool

pub fn struct_tail_without_normalization(self, ty: Ty<'tcx>) -> Ty<'tcx>

Attempts to returns the deeply last field of nested structures, but does not apply any normalization in its search. Returns the same type if input ty is not a structure at all.

pub fn struct_tail_erasing_lifetimes(
    self,
    ty: Ty<'tcx>,
    param_env: ParamEnv<'tcx>
) -> Ty<'tcx>

Returns the deeply last field of nested structures, or the same type if not a structure at all. Corresponds to the only possible unsized field, and its type can be used to determine unsizing strategy.

Should only be called if ty has no inference variables and does not need its lifetimes preserved (e.g. as part of codegen); otherwise normalization attempt may cause compiler bugs.

pub fn struct_tail_with_normalize(
    self,
    ty: Ty<'tcx>,
    normalize: impl Fn(Ty<'tcx>) -> Ty<'tcx>
) -> Ty<'tcx>

Returns the deeply last field of nested structures, or the same type if not a structure at all. Corresponds to the only possible unsized field, and its type can be used to determine unsizing strategy.

This is parameterized over the normalization strategy (i.e. how to handle <T as Trait>::Assoc and impl Trait); pass the identity function to indicate no normalization should take place.

See also struct_tail_erasing_lifetimes, which is suitable for use during codegen.

pub fn struct_lockstep_tails_erasing_lifetimes(
    self,
    source: Ty<'tcx>,
    target: Ty<'tcx>,
    param_env: ParamEnv<'tcx>
) -> (Ty<'tcx>, Ty<'tcx>)

Same as applying struct_tail on source and target, but only keeps going as long as the two types are instances of the same structure definitions. For (Foo<Foo<T>>, Foo<dyn Trait>), the result will be (Foo<T>, Trait), whereas struct_tail produces T, and Trait, respectively.

Should only be called if the types have no inference variables and do not need their lifetimes preserved (e.g., as part of codegen); otherwise, normalization attempt may cause compiler bugs.

pub fn struct_lockstep_tails_with_normalize(
    self,
    source: Ty<'tcx>,
    target: Ty<'tcx>,
    normalize: impl Fn(Ty<'tcx>) -> Ty<'tcx>
) -> (Ty<'tcx>, Ty<'tcx>)

Same as applying struct_tail on source and target, but only keeps going as long as the two types are instances of the same structure definitions. For (Foo<Foo<T>>, Foo<dyn Trait>), the result will be (Foo<T>, Trait), whereas struct_tail produces T, and Trait, respectively.

See also struct_lockstep_tails_erasing_lifetimes, which is suitable for use during codegen.

pub fn calculate_dtor(
    self,
    adt_did: DefId,
    validate: impl Fn(Self, DefId) -> Result<(), ErrorReported>
) -> Option<Destructor>

Calculate the destructor of a given type.

pub fn destructor_constraints(self, def: &'tcx AdtDef) -> Vec<GenericArg<'tcx>>

Returns the set of types that are required to be alive in order to run the destructor of def (see RFCs 769 and 1238).

Note that this returns only the constraints for the destructor of def itself. For the destructors of the contents, you need adt_dtorck_constraint.

pub fn is_closure(self, def_id: DefId) -> bool

Returns true if def_id refers to a closure (e.g., |x| x * 2). Note that closures have a DefId, but the closure expression also has a HirId that is located within the context where the closure appears (and, sadly, a corresponding NodeId, since those are not yet phased out). The parent of the closure's DefId will also be the context where it appears.

pub fn is_trait(self, def_id: DefId) -> bool

Returns true if def_id refers to a trait (i.e., trait Foo { ... }).

pub fn is_trait_alias(self, def_id: DefId) -> bool

Returns true if def_id refers to a trait alias (i.e., trait Foo = ...;), and false otherwise.

pub fn is_constructor(self, def_id: DefId) -> bool

Returns true if this DefId refers to the implicit constructor for a tuple struct like struct Foo(u32), and false otherwise.

pub fn closure_base_def_id(self, def_id: DefId) -> DefId

Given the def-ID of a fn or closure, returns the def-ID of the innermost fn item that the closure is contained within. This is a significant DefId because, when we do type-checking, we type-check this fn item and all of its (transitive) closures together. Therefore, when we fetch the typeck the closure, for example, we really wind up fetching the typeck the enclosing fn item.

pub fn closure_env_ty(
    self,
    closure_def_id: DefId,
    closure_substs: SubstsRef<'tcx>
) -> Option<Binder<Ty<'tcx>>>

Given the DefId and substs a closure, creates the type of self argument that the closure expects. For example, for a Fn closure, this would return a reference type &T where T = closure_ty.

Returns None if this closure's kind has not yet been inferred. This should only be possible during type checking.

Note that the return value is a late-bound region and hence wrapped in a binder.

pub fn is_static(self, def_id: DefId) -> bool

Returns true if the node pointed to by def_id is a static item.

pub fn is_thread_local_static(self, def_id: DefId) -> bool

Returns true if this is a static item with the #[thread_local] attribute.

pub fn is_mutable_static(self, def_id: DefId) -> bool

Returns true if the node pointed to by def_id is a mutable static item.

pub fn static_ptr_ty(self, def_id: DefId) -> Ty<'tcx>

Get the type of the pointer to the static that we use in MIR.

pub fn try_expand_impl_trait_type(
    self,
    def_id: DefId,
    substs: SubstsRef<'tcx>
) -> Result<Ty<'tcx>, Ty<'tcx>>

Expands the given impl trait type, stopping if the type is recursive.

impl<'tcx> TyCtxt<'tcx>

pub fn typeck_opt_const_arg(
    self,
    def: WithOptConstParam<LocalDefId>
) -> &'tcx TypeckResults<'tcx>

pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal<Body<'tcx>>

pub fn alloc_steal_promoted(
    self,
    promoted: IndexVec<Promoted, Body<'tcx>>
) -> &'tcx Steal<IndexVec<Promoted, Body<'tcx>>>

pub fn alloc_adt_def(
    self,
    did: DefId,
    kind: AdtKind,
    variants: IndexVec<VariantIdx, VariantDef>,
    repr: ReprOptions
) -> &'tcx AdtDef

pub fn intern_const_alloc(self, alloc: Allocation) -> &'tcx Allocation

pub fn allocate_bytes(self, bytes: &[u8]) -> AllocId

Allocates a read-only byte or string literal for mir::interpret.

pub fn intern_stability(self, stab: Stability) -> &'tcx Stability

pub fn intern_const_stability(
    self,
    stab: ConstStability
) -> &'tcx ConstStability

pub fn intern_layout(self, layout: Layout) -> &'tcx Layout

pub fn layout_scalar_valid_range(
    self,
    def_id: DefId
) -> (Bound<u128>, Bound<u128>)

Returns a range of the start/end indices specified with the rustc_layout_scalar_valid_range attribute.

pub fn lift<T: Lift<'tcx>>(self, value: T) -> Option<T::Lifted>

pub fn create_global_ctxt(
    s: &'tcx Session,
    lint_store: Lrc<dyn Any + Send + Sync>,
    local_providers: Providers,
    extern_providers: Providers,
    arena: &'tcx WorkerLocal<Arena<'tcx>>,
    resolutions: ResolverOutputs,
    krate: &'tcx Crate<'tcx>,
    definitions: &'tcx Definitions,
    dep_graph: DepGraph,
    on_disk_query_result_cache: Option<OnDiskCache<'tcx>>,
    crate_name: &str,
    output_filenames: &OutputFilenames
) -> GlobalCtxt<'tcx>

Creates a type context and call the closure with a TyCtxt reference to the context. The closure enforces that the type context and any interned value (types, substs, etc.) can only be used while ty::tls has a valid reference to the context, to allow formatting values that need it.

pub fn ty_error(self) -> Ty<'tcx>

Constructs a TyKind::Error type and registers a delay_span_bug to ensure it gets used.

pub fn ty_error_with_message<S: Into<MultiSpan>>(
    self,
    span: S,
    msg: &str
) -> Ty<'tcx>

Constructs a TyKind::Error type and registers a delay_span_bug with the given msg to ensure it gets used.

pub fn const_error(self, ty: Ty<'tcx>) -> &'tcx Const<'tcx>

Like err but for constants.

pub fn consider_optimizing<T: Fn() -> String>(self, msg: T) -> bool

pub fn lib_features(self) -> &'tcx LibFeatures

pub fn lang_items(self) -> &'tcx LanguageItems

Obtain all lang items of this crate and all dependencies (recursively)

pub fn get_diagnostic_item(self, name: Symbol) -> Option<DefId>

Obtain the given diagnostic item's DefId. Use is_diagnostic_item if you just want to compare against another DefId, since is_diagnostic_item is cheaper.

pub fn is_diagnostic_item(self, name: Symbol, did: DefId) -> bool

Check whether the diagnostic item with the given name has the given DefId.

pub fn stability(self) -> &'tcx Index<'tcx>

pub fn crates(self) -> &'tcx [CrateNum]

pub fn allocator_kind(self) -> Option<AllocatorKind>

pub fn features(self) -> &'tcx Features

pub fn def_key(self, id: DefId) -> DefKey

pub fn def_path(self, id: DefId) -> DefPath

Converts a DefId into its fully expanded DefPath (every DefId is really just an interned DefPath).

Note that if id is not local to this crate, the result will be a non-local DefPath.

pub fn is_private_dep(self, cnum: CrateNum) -> bool

Returns whether or not the crate with CrateNum 'cnum' is marked as a private dependency

pub fn def_path_hash(self, def_id: DefId) -> DefPathHash

pub fn def_path_debug_str(self, def_id: DefId) -> String

pub fn metadata_encoding_version(self) -> Vec<u8>

pub fn encode_metadata(self) -> EncodedMetadata

pub fn cstore_as_any(self) -> &'tcx dyn Any

pub fn create_stable_hashing_context(self) -> StableHashingContext<'tcx>

pub fn create_no_span_stable_hashing_context(self) -> StableHashingContext<'tcx>

pub fn allocate_metadata_dep_nodes(self)

pub fn serialize_query_result_cache<E>(
    self,
    encoder: &mut E
) -> Result<(), E::Error> where
    E: OpaqueEncoder, 

pub fn migrate_borrowck(self) -> bool

If true, we should use the MIR-based borrowck, but also fall back on the AST borrowck if the MIR-based one errors.

pub fn borrowck_mode(self) -> BorrowckMode

What mode(s) of borrowck should we run? AST? MIR? both? (Also considers the #![feature(nll)] setting.)

pub fn lazy_normalization(self) -> bool

If true, we should use lazy normalization for constants, otherwise we still evaluate them eagerly.

pub fn local_crate_exports_generics(self) -> bool

pub fn is_suitable_region(self, region: Region<'tcx>) -> Option<FreeRegionInfo>

pub fn return_type_impl_or_dyn_traits(
    self,
    scope_def_id: LocalDefId
) -> Vec<&'tcx Ty<'tcx>>

Given a DefId for an fn, return all the dyn and impl traits in its return type.

pub fn return_type_impl_trait(
    self,
    scope_def_id: LocalDefId
) -> Option<(Ty<'tcx>, Span)>

pub fn is_bound_region_in_impl_item(
    self,
    suitable_region_binding_scope: LocalDefId
) -> bool

pub fn has_strict_asm_symbol_naming(self) -> bool

Determines whether identifiers in the assembly have strict naming rules. Currently, only NVPTX* targets need it.

pub fn caller_location_ty(self) -> Ty<'tcx>

Returns &'static core::panic::Location<'static>.

pub fn article_and_description(
    self,
    def_id: DefId
) -> (&'static str, &'static str)

Returns a displayable description and article for the given def_id (e.g. ("a", "struct")).

impl<'tcx> TyCtxt<'tcx>

pub fn debug_stats(self) -> impl Debug + 'tcx

impl<'tcx> TyCtxt<'tcx>

pub fn mk_region(self, v: RegionKind) -> &'tcx RegionKind

impl<'tcx> TyCtxt<'tcx>

pub fn mk_const(self, v: Const<'tcx>) -> &'tcx Const<'tcx>

impl<'tcx> TyCtxt<'tcx>

pub fn _intern_type_list(self, v: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>>

pub fn _intern_substs(
    self,
    v: &[GenericArg<'tcx>]
) -> &'tcx List<GenericArg<'tcx>>

pub fn _intern_canonical_var_infos(
    self,
    v: &[CanonicalVarInfo<'tcx>]
) -> &'tcx List<CanonicalVarInfo<'tcx>>

pub fn _intern_existential_predicates(
    self,
    v: &[ExistentialPredicate<'tcx>]
) -> &'tcx List<ExistentialPredicate<'tcx>>

pub fn _intern_predicates(
    self,
    v: &[Predicate<'tcx>]
) -> &'tcx List<Predicate<'tcx>>

pub fn _intern_projs(self, v: &[ProjectionKind]) -> &'tcx List<ProjectionKind>

pub fn _intern_place_elems(
    self,
    v: &[PlaceElem<'tcx>]
) -> &'tcx List<PlaceElem<'tcx>>

impl<'tcx> TyCtxt<'tcx>

pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx>

Given a fn type, returns an equivalent unsafe fn type; that is, a fn type that is equivalent in every way for being unsafe.

pub fn trait_may_define_assoc_type(
    self,
    trait_def_id: DefId,
    assoc_name: Ident
) -> bool

Given the def_id of a Trait trait_def_id and the name of an associated item assoc_name returns true if the trait_def_id defines an associated item of name assoc_name.

pub(in ty::context) fn super_traits_of(
    self,
    trait_def_id: DefId
) -> impl Iterator<Item = DefId> + 'tcx

Computes the def-ids of the transitive super-traits of trait_def_id. This (intentionally) does not compute the full elaborated super-predicates but just the set of def-ids. It is used to identify which traits may define a given associated type to help avoid cycle errors. Returns a DefId iterator.

pub fn signature_unclosure(
    self,
    sig: PolyFnSig<'tcx>,
    unsafety: Unsafety
) -> PolyFnSig<'tcx>

Given a closure signature, returns an equivalent fn signature. Detuples and so forth -- so e.g., if we have a sig with Fn<(u32, i32)> then you would get a fn(u32, i32). unsafety determines the unsafety of the fn signature. If you pass hir::Unsafety::Unsafe in the previous example, then you would get an unsafe fn (u32, i32). It cannot convert a closure that requires unsafe.

pub fn reuse_or_mk_region(
    self,
    r: Region<'tcx>,
    kind: RegionKind
) -> Region<'tcx>

Same a self.mk_region(kind), but avoids accessing the interners if *r == kind.

pub fn mk_ty(self, st: TyKind<'tcx>) -> Ty<'tcx>

pub fn mk_predicate(self, kind: PredicateKind<'tcx>) -> Predicate<'tcx>

pub fn reuse_or_mk_predicate(
    self,
    pred: Predicate<'tcx>,
    kind: PredicateKind<'tcx>
) -> Predicate<'tcx>

pub fn mk_mach_int(self, tm: IntTy) -> Ty<'tcx>

pub fn mk_mach_uint(self, tm: UintTy) -> Ty<'tcx>

pub fn mk_mach_float(self, tm: FloatTy) -> Ty<'tcx>

pub fn mk_static_str(self) -> Ty<'tcx>

pub fn mk_adt(self, def: &'tcx AdtDef, substs: SubstsRef<'tcx>) -> Ty<'tcx>

pub fn mk_foreign(self, def_id: DefId) -> Ty<'tcx>

pub(in ty::context) fn mk_generic_adt(
    self,
    wrapper_def_id: DefId,
    ty_param: Ty<'tcx>
) -> Ty<'tcx>

pub fn mk_box(self, ty: Ty<'tcx>) -> Ty<'tcx>

pub fn mk_lang_item(self, ty: Ty<'tcx>, item: LangItem) -> Option<Ty<'tcx>>

pub fn mk_diagnostic_item(self, ty: Ty<'tcx>, name: Symbol) -> Option<Ty<'tcx>>

pub fn mk_maybe_uninit(self, ty: Ty<'tcx>) -> Ty<'tcx>

pub fn mk_ptr(self, tm: TypeAndMut<'tcx>) -> Ty<'tcx>

pub fn mk_ref(self, r: Region<'tcx>, tm: TypeAndMut<'tcx>) -> Ty<'tcx>

pub fn mk_mut_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx>

pub fn mk_imm_ref(self, r: Region<'tcx>, ty: Ty<'tcx>) -> Ty<'tcx>

pub fn mk_mut_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx>

pub fn mk_imm_ptr(self, ty: Ty<'tcx>) -> Ty<'tcx>

pub fn mk_nil_ptr(self) -> Ty<'tcx>

pub fn mk_array(self, ty: Ty<'tcx>, n: u64) -> Ty<'tcx>

pub fn mk_slice(self, ty: Ty<'tcx>) -> Ty<'tcx>

pub fn intern_tup(self, ts: &[Ty<'tcx>]) -> Ty<'tcx>

pub fn mk_tup<I: InternAs<[Ty<'tcx>], Ty<'tcx>>>(self, iter: I) -> I::Output

pub fn mk_unit(self) -> Ty<'tcx>

pub fn mk_diverging_default(self) -> Ty<'tcx>

pub fn mk_fn_def(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx>

pub fn mk_fn_ptr(self, fty: PolyFnSig<'tcx>) -> Ty<'tcx>

pub fn mk_dynamic(
    self,
    obj: Binder<&'tcx List<ExistentialPredicate<'tcx>>>,
    reg: Region<'tcx>
) -> Ty<'tcx>

pub fn mk_projection(
    self,
    item_def_id: DefId,
    substs: SubstsRef<'tcx>
) -> Ty<'tcx>

pub fn mk_closure(
    self,
    closure_id: DefId,
    closure_substs: SubstsRef<'tcx>
) -> Ty<'tcx>

pub fn mk_generator(
    self,
    id: DefId,
    generator_substs: SubstsRef<'tcx>,
    movability: Movability
) -> Ty<'tcx>

pub fn mk_generator_witness(
    self,
    types: Binder<&'tcx List<Ty<'tcx>>>
) -> Ty<'tcx>

pub fn mk_ty_var(self, v: TyVid) -> Ty<'tcx>

pub fn mk_const_var(self, v: ConstVid<'tcx>, ty: Ty<'tcx>) -> &'tcx Const<'tcx>

pub fn mk_int_var(self, v: IntVid) -> Ty<'tcx>

pub fn mk_float_var(self, v: FloatVid) -> Ty<'tcx>

pub fn mk_ty_infer(self, it: InferTy) -> Ty<'tcx>

pub fn mk_const_infer(
    self,
    ic: InferConst<'tcx>,
    ty: Ty<'tcx>
) -> &'tcx Const<'tcx>

pub fn mk_ty_param(self, index: u32, name: Symbol) -> Ty<'tcx>

pub fn mk_const_param(
    self,
    index: u32,
    name: Symbol,
    ty: Ty<'tcx>
) -> &'tcx Const<'tcx>

pub fn mk_param_from_def(self, param: &GenericParamDef) -> GenericArg<'tcx>

pub fn mk_opaque(self, def_id: DefId, substs: SubstsRef<'tcx>) -> Ty<'tcx>

pub fn mk_place_field(
    self,
    place: Place<'tcx>,
    f: Field,
    ty: Ty<'tcx>
) -> Place<'tcx>

pub fn mk_place_deref(self, place: Place<'tcx>) -> Place<'tcx>

pub fn mk_place_downcast(
    self,
    place: Place<'tcx>,
    adt_def: &'tcx AdtDef,
    variant_index: VariantIdx
) -> Place<'tcx>

pub fn mk_place_downcast_unnamed(
    self,
    place: Place<'tcx>,
    variant_index: VariantIdx
) -> Place<'tcx>

pub fn mk_place_index(self, place: Place<'tcx>, index: Local) -> Place<'tcx>

pub fn mk_place_elem(
    self,
    place: Place<'tcx>,
    elem: PlaceElem<'tcx>
) -> Place<'tcx>

This method copies Place's projection, add an element and reintern it. Should not be used to build a full Place it's just a convenient way to grab a projection and modify it in flight.

pub fn intern_existential_predicates(
    self,
    eps: &[ExistentialPredicate<'tcx>]
) -> &'tcx List<ExistentialPredicate<'tcx>>

pub fn intern_predicates(
    self,
    preds: &[Predicate<'tcx>]
) -> &'tcx List<Predicate<'tcx>>

pub fn intern_type_list(self, ts: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>>

pub fn intern_substs(
    self,
    ts: &[GenericArg<'tcx>]
) -> &'tcx List<GenericArg<'tcx>>

pub fn intern_projs(self, ps: &[ProjectionKind]) -> &'tcx List<ProjectionKind>

pub fn intern_place_elems(
    self,
    ts: &[PlaceElem<'tcx>]
) -> &'tcx List<PlaceElem<'tcx>>

pub fn intern_canonical_var_infos(
    self,
    ts: &[CanonicalVarInfo<'tcx>]
) -> CanonicalVarInfos<'tcx>

pub fn mk_fn_sig<I>(
    self,
    inputs: I,
    output: I::Item,
    c_variadic: bool,
    unsafety: Unsafety,
    abi: Abi
) -> <I::Item as InternIteratorElement<Ty<'tcx>, FnSig<'tcx>>>::Output where
    I: Iterator<Item: InternIteratorElement<Ty<'tcx>, FnSig<'tcx>>>, 

pub fn mk_existential_predicates<I: InternAs<[ExistentialPredicate<'tcx>], &'tcx List<ExistentialPredicate<'tcx>>>>(
    self,
    iter: I
) -> I::Output

pub fn mk_predicates<I: InternAs<[Predicate<'tcx>], &'tcx List<Predicate<'tcx>>>>(
    self,
    iter: I
) -> I::Output

pub fn mk_type_list<I: InternAs<[Ty<'tcx>], &'tcx List<Ty<'tcx>>>>(
    self,
    iter: I
) -> I::Output

pub fn mk_substs<I: InternAs<[GenericArg<'tcx>], &'tcx List<GenericArg<'tcx>>>>(
    self,
    iter: I
) -> I::Output

pub fn mk_place_elems<I: InternAs<[PlaceElem<'tcx>], &'tcx List<PlaceElem<'tcx>>>>(
    self,
    iter: I
) -> I::Output

pub fn mk_substs_trait(
    self,
    self_ty: Ty<'tcx>,
    rest: &[GenericArg<'tcx>]
) -> SubstsRef<'tcx>

pub fn maybe_lint_level_root_bounded(self, id: HirId, bound: HirId) -> HirId

Walks upwards from id to find a node which might change lint levels with attributes. It stops at bound and just returns it if reached.

pub fn lint_level_at_node(
    self,
    lint: &'static Lint,
    id: HirId
) -> (Level, LintSource)

pub fn struct_span_lint_hir(
    self,
    lint: &'static Lint,
    hir_id: HirId,
    span: impl Into<MultiSpan>,
    decorate: impl for<'a> FnOnce(LintDiagnosticBuilder<'a>)
)

pub fn struct_lint_node(
    self,
    lint: &'static Lint,
    id: HirId,
    decorate: impl for<'a> FnOnce(LintDiagnosticBuilder<'a>)
)

pub fn in_scope_traits(
    self,
    id: HirId
) -> Option<&'tcx StableVec<TraitCandidate>>

pub fn named_region(self, id: HirId) -> Option<Region>

pub fn is_late_bound(self, id: HirId) -> bool

pub fn object_lifetime_defaults(
    self,
    id: HirId
) -> Option<&'tcx [ObjectLifetimeDefault]>

impl<'tcx> TyCtxt<'tcx>

pub fn typeck_body(self, body: BodyId) -> &'tcx TypeckResults<'tcx>

pub fn body_owners(
    self
) -> impl Iterator<Item = LocalDefId> + Captures<'tcx> + 'tcx

Returns an iterator of the DefIds for all body-owners in this crate. If you would prefer to iterate over the bodies themselves, you can do self.hir().krate().body_ids.iter().

pub fn par_body_owners<F: Fn(LocalDefId) + Sync + Send>(self, f: F)

pub fn provided_trait_methods(
    self,
    id: DefId
) -> impl 'tcx + Iterator<Item = &'tcx AssocItem>

pub(in ty) fn item_name_from_hir(
    self,
    def_id: DefId
) -> Option<Ident>

pub(in ty) fn item_name_from_def_id(
    self,
    def_id: DefId
) -> Option<Symbol>

pub fn item_name(self, id: DefId) -> Symbol

Look up the name of an item across crates. This does not look at HIR.

When possible, this function should be used for cross-crate lookups over opt_item_name to avoid invalidating the incremental cache. If you need to handle items without a name, or HIR items that will not be serialized cross-crate, or if you need the span of the item, use opt_item_name instead.

pub fn opt_item_name(self, def_id: DefId) -> Option<Ident>

Look up the name and span of an item or Node.

See item_name for more information.

pub fn opt_associated_item(self, def_id: DefId) -> Option<&'tcx AssocItem>

pub fn field_index(
    self,
    hir_id: HirId,
    typeck_results: &TypeckResults<'_>
) -> usize

pub fn find_field_index(
    self,
    ident: Ident,
    variant: &VariantDef
) -> Option<usize>

pub fn impls_are_allowed_to_overlap(
    self,
    def_id1: DefId,
    def_id2: DefId
) -> Option<ImplOverlapKind>

Returns true if the impls are the same polarity and the trait either has no items or is annotated #[marker] and prevents item overrides.

pub fn expect_variant_res(self, res: Res) -> &'tcx VariantDef

Returns ty::VariantDef if res refers to a struct, or variant or their constructors, panics otherwise.

pub fn instance_mir(self, instance: InstanceDef<'tcx>) -> &'tcx Body<'tcx>

Returns the possibly-auto-generated MIR of a (DefId, Subst) pair.

pub fn get_attrs(self, did: DefId) -> Attributes<'tcx>

Gets the attributes of a definition.

pub fn has_attr(self, did: DefId, attr: Symbol) -> bool

Determines whether an item is annotated with an attribute.

pub fn trait_is_auto(self, trait_def_id: DefId) -> bool

Returns true if this is an auto trait.

pub fn generator_layout(self, def_id: DefId) -> &'tcx GeneratorLayout<'tcx>

pub fn trait_id_of_impl(self, def_id: DefId) -> Option<DefId>

Given the DefId of an impl, returns the DefId of the trait it implements. If it implements no trait, returns None.

pub fn impl_of_method(self, def_id: DefId) -> Option<DefId>

If the given defid describes a method belonging to an impl, returns the DefId of the impl that the method belongs to; otherwise, returns None.

pub fn span_of_impl(self, impl_did: DefId) -> Result<Span, Symbol>

Looks up the span of impl_did if the impl is local; otherwise returns Err with the name of the crate containing the impl.

pub fn hygienic_eq(
    self,
    use_name: Ident,
    def_name: Ident,
    def_parent_def_id: DefId
) -> bool

Hygienically compares a use-site name (use_name) for a field or an associated item with its supposed definition name (def_name). The method also needs DefId of the supposed definition's parent/scope to perform comparison.

pub fn expansion_that_defined(self, scope: DefId) -> ExpnId

pub fn adjust_ident(self, ident: Ident, scope: DefId) -> Ident

pub fn adjust_ident_and_get_scope(
    self,
    ident: Ident,
    scope: DefId,
    block: HirId
) -> (Ident, DefId)

pub fn is_object_safe(self, key: DefId) -> bool

Trait Implementations

impl<'tcx> Clone for TyCtxt<'tcx>

pub fn clone(&self) -> TyCtxt<'tcx>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'tcx> Copy for TyCtxt<'tcx>

impl<'tcx> DefIdTree for TyCtxt<'tcx>

pub fn parent(self, id: DefId) -> Option<DefId>

pub fn is_descendant_of(self, descendant: DefId, ancestor: DefId) -> bool

impl<'tcx> DepContext for TyCtxt<'tcx>

type DepKind = DepKind

type StableHashingContext = StableHashingContext<'tcx>

pub fn create_stable_hashing_context(&self) -> Self::StableHashingContext

Create a hashing context for hashing new results.

pub fn debug_dep_tasks(&self) -> bool

pub fn debug_dep_node(&self) -> bool

pub fn try_force_from_dep_node(&self, dep_node: &DepNode) -> bool

Try to force a dep node to execute and see if it's green.

pub fn has_errors_or_delayed_span_bugs(&self) -> bool

Return whether the current session is tainted by errors.

pub fn diagnostic(&self) -> &Handler

Return the diagnostic handler.

pub fn try_load_from_on_disk_cache(&self, dep_node: &DepNode)

Load data from the on-disk cache.

pub fn load_diagnostics(
    &self,
    prev_dep_node_index: SerializedDepNodeIndex
) -> Vec<Diagnostic>

Load diagnostics associated to the node in the previous session.

pub fn store_diagnostics(
    &self,
    dep_node_index: DepNodeIndex,
    diagnostics: ThinVec<Diagnostic>
)

Register diagnostics for the given node, for use in next session.

pub fn store_diagnostics_for_anon_node(
    &self,
    dep_node_index: DepNodeIndex,
    diagnostics: ThinVec<Diagnostic>
)

Register diagnostics for the given node, for use in next session.

pub fn profiler(&self) -> &SelfProfilerRef

Access the profiler.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for DefId

pub fn can_reconstruct_query_key() -> bool

pub fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don't need to if the corresponding DepNode is anonymous).

pub fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

pub fn recover(tcx: TyCtxt<'tcx>, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if can_reconstruct_query_key() is true. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for LocalDefId

pub fn can_reconstruct_query_key() -> bool

pub fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don't need to if the corresponding DepNode is anonymous).

pub fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

pub fn recover(tcx: TyCtxt<'tcx>, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if can_reconstruct_query_key() is true. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for CrateNum

pub fn can_reconstruct_query_key() -> bool

pub fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don't need to if the corresponding DepNode is anonymous).

pub fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

pub fn recover(tcx: TyCtxt<'tcx>, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if can_reconstruct_query_key() is true. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for (DefId, DefId)

pub fn can_reconstruct_query_key() -> bool

pub fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don't need to if the corresponding DepNode is anonymous).

pub fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

pub fn recover(
    tcx: Ctxt,
    dep_node: &DepNode<<Ctxt as DepContext>::DepKind>
) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if can_reconstruct_query_key() is true. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for HirId

pub fn can_reconstruct_query_key() -> bool

pub fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don't need to if the corresponding DepNode is anonymous).

pub fn to_debug_str(&self, Ctxt) -> String

pub fn recover(
    tcx: Ctxt,
    dep_node: &DepNode<<Ctxt as DepContext>::DepKind>
) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if can_reconstruct_query_key() is true. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> Deref for TyCtxt<'tcx>

type Target = &'tcx GlobalCtxt<'tcx>

The resulting type after dereferencing.

pub fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'tcx> HasDataLayout for TyCtxt<'tcx>

pub fn data_layout(&self) -> &TargetDataLayout

impl<'tcx> HasTyCtxt<'tcx> for TyCtxt<'tcx>

pub fn tcx(&self) -> TyCtxt<'tcx>

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for trigger_delay_span_bug<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, ()>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for hir_crate<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, &'tcx Crate<'tcx>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for predicates_of<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, GenericPredicates<'tcx>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for privacy_access_levels<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, &'tcx AccessLevels>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for check_private_in_public<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, ()>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for reachable_set<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <ArenaCacheSelector<'tcx> as CacheSelector<CrateNum, FxHashSet<LocalDefId>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for region_scope_tree<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, &'tcx ScopeTree>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for mir_shims<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <ArenaCacheSelector<'tcx> as CacheSelector<InstanceDef<'tcx>, Body<'tcx>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for symbol_name<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<Instance<'tcx> as Key>::CacheSelector as CacheSelector<Instance<'tcx>, SymbolName<'tcx>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for def_kind<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, DefKind>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for def_span<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, Span>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for lookup_stability<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, Option<&'tcx Stability>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for lookup_const_stability<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, Option<&'tcx ConstStability>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for explicit_item_bounds<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, &'tcx [(Predicate<'tcx>, Span)]>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for lookup_deprecation_entry<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, Option<DeprecationEntry>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for item_attrs<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, &'tcx [Attribute]>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for codegen_fn_attrs<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <ArenaCacheSelector<'tcx> as CacheSelector<DefId, CodegenFnAttrs>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for fn_arg_names<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, &'tcx [Ident]>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for rendered_const<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, String>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for impl_parent<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, Option<DefId>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for trait_of_item<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, Option<DefId>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for is_mir_available<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, bool>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for vtable_methods<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<PolyTraitRef<'tcx> as Key>::CacheSelector as CacheSelector<PolyTraitRef<'tcx>, &'tcx [Option<(DefId, SubstsRef<'tcx>)>]>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for codegen_fulfill_obligation<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<(ParamEnv<'tcx>, PolyTraitRef<'tcx>) as Key>::CacheSelector as CacheSelector<(ParamEnv<'tcx>, PolyTraitRef<'tcx>), Result<ImplSource<'tcx, ()>, ErrorReported>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for item_bounds<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, &'tcx List<Predicate<'tcx>>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for all_local_trait_impls<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, &'tcx BTreeMap<DefId, Vec<HirId>>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for trait_impls_of<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <ArenaCacheSelector<'tcx> as CacheSelector<DefId, TraitImpls>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for specialization_graph_of<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <ArenaCacheSelector<'tcx> as CacheSelector<DefId, Graph>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for object_safety_violations<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, &'tcx [ObjectSafetyViolation]>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for param_env<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, ParamEnv<'tcx>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for param_env_reveal_all_normalized<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, ParamEnv<'tcx>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for is_copy_raw<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<ParamEnvAnd<'tcx, Ty<'tcx>> as Key>::CacheSelector as CacheSelector<ParamEnvAnd<'tcx, Ty<'tcx>>, bool>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for is_sized_raw<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<ParamEnvAnd<'tcx, Ty<'tcx>> as Key>::CacheSelector as CacheSelector<ParamEnvAnd<'tcx, Ty<'tcx>>, bool>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for is_freeze_raw<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<ParamEnvAnd<'tcx, Ty<'tcx>> as Key>::CacheSelector as CacheSelector<ParamEnvAnd<'tcx, Ty<'tcx>>, bool>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for needs_drop_raw<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<ParamEnvAnd<'tcx, Ty<'tcx>> as Key>::CacheSelector as CacheSelector<ParamEnvAnd<'tcx, Ty<'tcx>>, bool>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for projection_ty_from_predicates<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<(DefId, DefId) as Key>::CacheSelector as CacheSelector<(DefId, DefId), Option<ProjectionTy<'tcx>>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for has_structural_eq_impls<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<Ty<'tcx> as Key>::CacheSelector as CacheSelector<Ty<'tcx>, bool>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for adt_drop_tys<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<DefId as Key>::CacheSelector as CacheSelector<DefId, Result<&'tcx List<Ty<'tcx>>, AlwaysRequiresDrop>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for layout_raw<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<ParamEnvAnd<'tcx, Ty<'tcx>> as Key>::CacheSelector as CacheSelector<ParamEnvAnd<'tcx, Ty<'tcx>>, Result<&'tcx Layout, LayoutError<'tcx>>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for dylib_dependency_formats<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, &'tcx [(CrateNum, LinkagePreference)]>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for dependency_formats<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, Lrc<Dependencies>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for is_compiler_builtins<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, bool>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for has_global_allocator<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, bool>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for has_panic_handler<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, bool>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for is_profiler_runtime<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, bool>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for panic_strategy<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, PanicStrategy>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a QueryState<DepKind, <TyCtxt<'tcx> as QueryContext>::Query, Self::Cache>

pub fn compute(tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value

pub fn hash_result(
    _hcx: &mut StableHashingContext<'_>,
    _result: &Self::Value
) -> Option<Fingerprint>

pub fn handle_cycle_error(
    tcx: TyCtxt<'tcx>,
    error: CycleError<Query<'tcx>>
) -> Self::Value

pub fn to_dep_node(
    tcx: CTX,
    key: &Self::Key
) -> DepNode<<CTX as DepContext>::DepKind> where
    Self::Key: DepNodeParams<CTX>, 

impl<'tcx> QueryAccessors<TyCtxt<'tcx>> for native_libraries<'tcx>

pub const ANON: bool

pub const EVAL_ALWAYS: bool

pub const DEP_KIND: DepKind

type Cache = <<CrateNum as Key>::CacheSelector as CacheSelector<CrateNum, Lrc<Vec<NativeLib>>>>::Cache

pub fn query_state<'a>(
    tcx: TyCtxt<'tcx>
) -> &'a