Struct rustc_middle::ty::context::TyCtxt

source ·
pub struct TyCtxt<'tcx> {
    gcx: &'tcx GlobalCtxt<'tcx>,
}
Expand description

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.

An implementation detail: TyCtxt is a wrapper type for GlobalCtxt, which is the struct that actually holds all the data. TyCtxt derefs to GlobalCtxt, and in practice TyCtxt is passed around everywhere, and all operations are done via TyCtxt. A TyCtxt is obtained for a GlobalCtxt by calling enter with a closure f. That function creates both the TyCtxt, and an ImplicitCtxt around it that is put into TLS. Within f:

  • The ImplicitCtxt is available implicitly via TLS.
  • The TyCtxt is available explicitly via the tcx parameter, and also implicitly within the ImplicitCtxt. Explicit access is preferred when possible.

Fields§

§gcx: &'tcx GlobalCtxt<'tcx>

Implementations§

source§

impl<'tcx> TyCtxt<'tcx>

source

fn expect_hir_owner_nodes(self, def_id: LocalDefId) -> &'tcx OwnerNodes<'tcx>

source

pub fn hir_owner_nodes(self, owner_id: OwnerId) -> &'tcx OwnerNodes<'tcx>

source

fn opt_hir_owner_node(self, def_id: LocalDefId) -> Option<OwnerNode<'tcx>>

source

pub fn expect_hir_owner_node(self, def_id: LocalDefId) -> OwnerNode<'tcx>

source

pub fn hir_owner_node(self, owner_id: OwnerId) -> OwnerNode<'tcx>

source

pub fn hir_node(self, id: HirId) -> Node<'tcx>

Retrieves the hir::Node corresponding to id.

source

pub fn hir_node_by_def_id(self, id: LocalDefId) -> Node<'tcx>

Retrieves the hir::Node corresponding to id.

source

pub fn parent_hir_id(self, hir_id: HirId) -> HirId

Returns HirId of the parent HIR node of node with this hir_id. Returns the same hir_id if and only if hir_id == CRATE_HIR_ID.

If calling repeatedly and iterating over parents, prefer Map::parent_iter.

source

pub fn parent_hir_node(self, hir_id: HirId) -> Node<'tcx>

Returns parent HIR node of node with this hir_id. Returns HIR node of the same hir_id if and only if hir_id == CRATE_HIR_ID.

source§

impl<'tcx> TyCtxt<'tcx>

source

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

source

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

source

pub fn parent_module_from_def_id(self, id: LocalDefId) -> LocalModDefId

source

pub fn impl_subject(self, def_id: DefId) -> EarlyBinder<'tcx, ImplSubject<'tcx>>

source

pub fn is_foreign_item(self, def_id: impl Into<DefId>) -> bool

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

source

pub fn hash_owner_nodes( self, node: OwnerNode<'_>, bodies: &SortedMap<ItemLocalId, &Body<'_>>, attrs: &SortedMap<ItemLocalId, &[Attribute]>, ) -> (Option<Fingerprint>, Option<Fingerprint>)

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn try_destructure_mir_constant_for_user_output( self, val: ConstValue<'tcx>, ty: Ty<'tcx>, ) -> Option<DestructuredConstant<'tcx>>

Tries to destructure an mir::Const ADT or array into its variant index and its field values. This should only be used for pretty printing.

source

pub fn const_caller_location( self, file: Symbol, line: u32, col: u32, ) -> ConstValue<'tcx>

Getting a &core::panic::Location referring to a span.

source

pub fn is_eligible_for_coverage(self, key: LocalDefId) -> bool

Returns true if this def is a function-like thing that is eligible for coverage instrumentation under -Cinstrument-coverage.

(Eligible functions might nevertheless be skipped for other reasons.)

source

pub fn build_mir(self, key: LocalDefId) -> Body<'tcx>

Create the MIR for a given DefId - this includes unreachable code. You do not want to call this yourself, instead use the cached version via mir_built

source

pub fn import_source_files(self, key: CrateNum)

Imports all SourceFiles from the given crate into the current session. This normally happens automatically when we decode a Span from that crate’s metadata - however, the incr comp cache needs to trigger this manually when decoding a foreign Span

source

pub fn expn_hash_to_expn_id( self, cnum: CrateNum, index_guess: u32, hash: ExpnHash, ) -> ExpnId

source

pub fn def_path_hash_to_def_id_extern( self, hash: DefPathHash, stable_crate_id: StableCrateId, ) -> DefId

Converts a DefPathHash to its corresponding DefId in the current compilation session, if it still exists. This is used during incremental compilation to turn a deserialized DefPathHash into its current DefId. Will fetch a DefId from a DefPathHash for a foreign crate.

source

pub fn thir_tree(self, key: LocalDefId) -> String

Create a THIR tree for debugging.

source

pub fn thir_flat(self, key: LocalDefId) -> String

Create a list-like THIR representation for debugging.

source

pub fn should_codegen_locally(self, instance: Instance<'tcx>) -> bool

Returns true if we should codegen an instance in the local crate, or returns false if we can just link to the upstream crate and therefore don’t need a mono item.

source§

impl TyCtxt<'_>

source

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

Fetch and return the user-visible lint level for the given lint at the given HirId.

source§

impl<'tcx> TyCtxt<'tcx>

source

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.

source

pub fn is_lang_item(self, def_id: DefId, lang_item: LangItem) -> bool

source

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

source

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

Given a DefId of one of the Fn, FnMut or FnOnce traits, returns a corresponding ty::ClosureKind. For any other DefId return None.

source

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

Given a DefId of one of the AsyncFn, AsyncFnMut or AsyncFnOnce traits, returns a corresponding ty::ClosureKind. For any other DefId return None.

source

pub fn fn_trait_kind_to_def_id(self, kind: ClosureKind) -> Option<DefId>

Given a ty::ClosureKind, get the DefId of its corresponding Fn-family trait, if it is defined.

source

pub fn is_fn_trait(self, id: DefId) -> bool

Returns true if id is a DefId of Fn, FnMut or FnOnce traits.

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn eval_stability( self, def_id: DefId, id: Option<HirId>, span: Span, method_span: Option<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.

source

pub fn eval_stability_allow_unstable( self, def_id: DefId, id: Option<HirId>, span: Span, method_span: Option<Span>, allow_unstable: AllowUnstable, ) -> 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.

Pass AllowUnstable::Yes to allow_unstable to force an unstable item to be allowed. Deprecation warnings will be emitted normally.

source

pub fn eval_default_body_stability( self, def_id: DefId, span: Span, ) -> EvalResult

Evaluates the default-impl stability of an item.

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

source

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

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.

Returns true if item is allowed aka, stable or unstable under an enabled feature.

source

pub fn check_stability_allow_unstable( self, def_id: DefId, id: Option<HirId>, span: Span, method_span: Option<Span>, allow_unstable: AllowUnstable, ) -> bool

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.

Pass AllowUnstable::Yes to allow_unstable to force an unstable item to be allowed. Deprecation warnings will be emitted normally.

Returns true if item is allowed aka, stable or unstable under an enabled feature.

source

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

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.

Returns true if item is allowed aka, stable or unstable under an enabled feature.

source

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

source§

impl<'tcx> TyCtxt<'tcx>

Const-related utilities

source

pub fn span_as_caller_location(self, span: Span) -> ConstValue<'tcx>

source§

impl<'tcx> TyCtxt<'tcx>

source

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

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

source

pub fn const_eval_poly_to_alloc( self, def_id: DefId, ) -> EvalToAllocationRawResult<'tcx>

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

source

pub fn const_eval_resolve( self, param_env: ParamEnv<'tcx>, ct: UnevaluatedConst<'tcx>, span: 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 generic parameters and environment are used to resolve the constant. Alternatively if the constant has generic parameters in scope the generic parameters 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 instantiation for T, if the instantiation for T is still too generic for the constant to be evaluated then Err(ErrorHandled::TooGeneric) is returned.

source

pub fn const_eval_resolve_for_typeck( self, param_env: ParamEnv<'tcx>, ct: UnevaluatedConst<'tcx>, span: Span, ) -> EvalToValTreeResult<'tcx>

source

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

source

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

Evaluate a constant to a ConstValue.

source

pub fn const_eval_global_id_for_typeck( self, param_env: ParamEnv<'tcx>, cid: GlobalId<'tcx>, span: Span, ) -> EvalToValTreeResult<'tcx>

Evaluate a constant to a type-level constant.

source§

impl<'tcx> TyCtxt<'tcx>

source

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.

source

fn reserve_and_set_dedup(self, alloc: GlobalAlloc<'tcx>) -> AllocId

Reserves a new ID if this allocation has not been dedup-reserved before. Should not be used for mutable memory.

source

pub fn reserve_and_set_memory_dedup(self, mem: ConstAllocation<'tcx>) -> AllocId

Generates an AllocId for a memory allocation. If the exact same memory has been allocated before, this will return the same AllocId.

source

pub fn reserve_and_set_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.

source

fn reserve_and_set_fn_alloc_internal( self, instance: Instance<'tcx>, unique: bool, ) -> AllocId

Generates an AllocId for a function. The caller must already have decided whether this function obtains a unique AllocId or gets de-duplicated via the cache.

source

pub fn reserve_and_set_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.

source

pub fn reserve_and_set_vtable_alloc( self, ty: Ty<'tcx>, poly_trait_ref: Option<PolyExistentialTraitRef<'tcx>>, ) -> AllocId

Generates an AllocId for a (symbolic, not-reified) vtable. Will get deduplicated.

source

pub fn reserve_and_set_memory_alloc(self, mem: ConstAllocation<'tcx>) -> 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.

source

pub fn try_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.

source

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

source

pub fn set_alloc_id_memory(self, id: AllocId, mem: ConstAllocation<'tcx>)

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.

source

pub fn set_nested_alloc_id_static(self, id: AllocId, def_id: LocalDefId)

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

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn expand_abstract_consts<T: TypeFoldable<TyCtxt<'tcx>>>(self, ac: T) -> T

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn ty_string_with_limit(self, ty: Ty<'tcx>, length_limit: usize) -> String

source

pub fn short_ty_string(self, ty: Ty<'tcx>, path: &mut Option<PathBuf>) -> String

source§

impl<'tcx> TyCtxt<'tcx>

source

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

Folds the escaping and free regions in value using f.

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn instantiate_bound_regions<T, F>( self, value: Binder<'tcx, T>, fld_r: F, ) -> (T, FxIndexMap<BoundRegion, Region<'tcx>>)
where F: FnMut(BoundRegion) -> Region<'tcx>, T: TypeFoldable<TyCtxt<'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 BoundRegionKind; multiple references to the same BoundRegionKind will reuse the previous result. A map is returned at the end with each bound region and the free region that replaced it.

§Panics

This method only replaces late bound regions. Any types or constants bound by value will cause an ICE.

source

pub fn instantiate_bound_regions_uncached<T, F>( self, value: Binder<'tcx, T>, replace_regions: F, ) -> T
where F: FnMut(BoundRegion) -> Region<'tcx>, T: TypeFoldable<TyCtxt<'tcx>>,

source

pub fn replace_escaping_bound_vars_uncached<T: TypeFoldable<TyCtxt<'tcx>>>( self, value: T, delegate: impl BoundVarReplacerDelegate<'tcx>, ) -> T

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.

source

pub fn replace_bound_vars_uncached<T: TypeFoldable<TyCtxt<'tcx>>>( self, value: Binder<'tcx, T>, delegate: impl BoundVarReplacerDelegate<'tcx>, ) -> T

Replaces all types or regions bound by the given Binder. The fld_r closure replaces bound regions, the fld_t closure replaces bound types, and fld_c replaces bound constants.

source

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

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

source

pub fn shift_bound_var_indices<T>(self, bound_vars: usize, value: T) -> T
where T: TypeFoldable<TyCtxt<'tcx>>,

source

pub fn instantiate_bound_regions_with_erased<T>( self, value: Binder<'tcx, T>, ) -> T
where T: TypeFoldable<TyCtxt<'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.

source

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

Anonymize all bound variables in value, this is mostly used to improve caching.

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn offset_of_subfield<I>( self, param_env: ParamEnv<'tcx>, layout: TyAndLayout<'tcx>, indices: I, ) -> Size
where I: Iterator<Item = (VariantIdx, FieldIdx)>,

source§

impl<'tcx> TyCtxt<'tcx>

source

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

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

This should only be used outside of type inference. For example, it assumes that normalization will succeed.

source

pub fn try_normalize_erasing_regions<T>( self, param_env: ParamEnv<'tcx>, value: T, ) -> Result<T, NormalizationError<'tcx>>
where T: TypeFoldable<TyCtxt<'tcx>>,

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

Contrary to normalize_erasing_regions this function does not assume that normalization succeeds.

source

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

If you have a Binder<'tcx, 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.

source

pub fn instantiate_and_normalize_erasing_regions<T>( self, param_args: GenericArgsRef<'tcx>, param_env: ParamEnv<'tcx>, value: EarlyBinder<'tcx, T>, ) -> T
where T: TypeFoldable<TyCtxt<'tcx>>,

Monomorphizes a type from the AST by first applying the in-scope instantiations and then normalizing any associated types. Panics if normalization fails. In case normalization might fail use try_instantiate_and_normalize_erasing_regions instead.

source

pub fn try_instantiate_and_normalize_erasing_regions<T>( self, param_args: GenericArgsRef<'tcx>, param_env: ParamEnv<'tcx>, value: EarlyBinder<'tcx, T>, ) -> Result<T, NormalizationError<'tcx>>
where T: TypeFoldable<TyCtxt<'tcx>>,

Monomorphizes a type from the AST by first applying the in-scope instantiations and then trying to normalize any associated types. Contrary to instantiate_and_normalize_erasing_regions this does not assume that normalization succeeds.

source§

impl<'t> TyCtxt<'t>

source

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

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

source

pub fn def_path_str_with_args( self, def_id: impl IntoQueryParam<DefId>, args: &'t [GenericArg<'t>], ) -> String

source

pub fn value_path_str_with_args( self, def_id: impl IntoQueryParam<DefId>, args: &'t [GenericArg<'t>], ) -> String

source§

impl<'tcx> TyCtxt<'tcx>

source

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

trait_def_id MUST BE the DefId of a trait.

source

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

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

trait_def_id MUST BE the DefId of a trait.

source

pub fn non_blanket_impls_for_ty( self, trait_def_id: DefId, self_ty: Ty<'tcx>, ) -> impl Iterator<Item = DefId> + 'tcx

trait_def_id MUST BE the DefId of a trait.

source

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

Returns an iterator containing all impls for trait_def_id.

trait_def_id MUST BE the DefId of a trait.

source§

impl<'tcx> TyCtxt<'tcx>

source

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

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.

source

pub fn res_generics_def_id(self, res: Res) -> Option<DefId>

source

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.

source

pub fn struct_tail_for_codegen( 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.

source

pub fn struct_tail_with_normalize( self, ty: Ty<'tcx>, normalize: impl FnMut(Ty<'tcx>) -> Ty<'tcx>, f: impl FnMut(), ) -> 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_for_codegen, which is suitable for use during codegen.

source

pub fn struct_lockstep_tails_for_codegen( 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>, dyn 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.

source

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_for_codegen, which is suitable for use during codegen.

source

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

Calculate the destructor of a given type.

source

pub fn calculate_async_dtor( self, adt_did: DefId, validate: impl Fn(Self, DefId) -> Result<(), ErrorGuaranteed>, ) -> Option<AsyncDestructor>

Calculate the async destructor of a given type.

source

pub fn async_drop_glue_morphology(self, did: DefId) -> AsyncDropGlueMorphology

Returns async drop glue morphology for a definition. To get async drop glue morphology for a type see Ty::async_drop_glue_morphology.

source

pub fn destructor_constraints(self, def: AdtDef<'tcx>) -> 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.

source

pub fn uses_unique_generic_params( self, args: &[GenericArg<'tcx>], ignore_regions: CheckRegions, ) -> Result<(), NotUniqueParam<'tcx>>

Checks whether each generic argument is simply a unique generic parameter.

source

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

Returns true if def_id refers to a closure, coroutine, or coroutine-closure (i.e. an async closure). These are all represented by hir::Closure, and all have the same DefKind.

Note that closures have a DefId, but the closure expression also has a

source

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

Returns true if def_id refers to a definition that does not have its own type-checking context, i.e. closure, coroutine or inline const.

source

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

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

source

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.

source

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.

source

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

Given the DefId, returns the DefId of the innermost item that has its own type-checking context or “inference environment”.

For example, a closure has its own DefId, but it is type-checked with the containing item. Similarly, an inline const block has its own DefId but it is type-checked together with the containing item.

Therefore, when we fetch the typeck the closure, for example, we really wind up fetching the typeck the enclosing fn item.

source

pub fn closure_env_ty( self, closure_ty: Ty<'tcx>, closure_kind: ClosureKind, env_region: Region<'tcx>, ) -> Ty<'tcx>

Given the DefId and args 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.

source

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

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

source

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

source

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

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

source

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.

source

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

Returns true if the item pointed to by def_id is a thread local which needs a thread local shim generated.

source

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

Returns the type a reference to the thread local takes in MIR.

source

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.

source

pub fn coroutine_hidden_types( self, def_id: DefId, ) -> impl Iterator<Item = EarlyBinder<'tcx, Ty<'tcx>>>

Return the set of types that should be taken into account when checking trait bounds on a coroutine’s internal state.

source

pub fn bound_coroutine_hidden_types( self, def_id: DefId, ) -> impl Iterator<Item = EarlyBinder<'tcx, Binder<'tcx, Ty<'tcx>>>>

Return the set of types that should be taken into account when checking trait bounds on a coroutine’s internal state. This properly replaces ReErased with new existential bound lifetimes.

source

pub fn try_expand_impl_trait_type( self, def_id: DefId, args: GenericArgsRef<'tcx>, inspect_coroutine_fields: InspectCoroutineFields, ) -> Result<Ty<'tcx>, Ty<'tcx>>

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

source

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

Query and get an English description for the item’s kind.

source

pub fn def_kind_descr(self, def_kind: DefKind, def_id: DefId) -> &'static str

Get an English description for the item’s kind.

source

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

Gets an English article for the TyCtxt::def_descr.

source

pub fn def_kind_descr_article( self, def_kind: DefKind, def_id: DefId, ) -> &'static str

Gets an English article for the TyCtxt::def_kind_descr.

source

pub fn is_user_visible_dep(self, key: CrateNum) -> bool

Return true if the supplied CrateNum is “user-visible,” meaning either a public dependency, or a direct private dependency. This is used to decide whether the crate can be shown in impl suggestions.

source

pub fn has_host_param(self, def_id: impl IntoQueryParam<DefId>) -> bool

Whether the item has a host effect param. This is different from TyCtxt::is_const, because the item must also be “maybe const”, and the crate where the item is defined must also have the effects feature enabled.

source

pub fn expected_host_effect_param_for_body( self, def_id: impl Into<DefId>, ) -> Const<'tcx>

source

pub fn with_opt_host_effect_param( self, caller_def_id: LocalDefId, callee_def_id: DefId, args: impl IntoIterator<Item: Into<GenericArg<'tcx>>>, ) -> GenericArgsRef<'tcx>

Constructs generic args for an item, optionally appending a const effect param type

source

pub fn expand_weak_alias_tys<T: TypeFoldable<TyCtxt<'tcx>>>(self, value: T) -> T

Expand any weak alias types contained within the given value.

This should be used over other normalization routines in situations where it’s important not to normalize other alias types and where the predicates on the corresponding type alias shouldn’t be taken into consideration.

Whenever possible prefer not to use this function! Instead, use standard normalization routines or if feasible don’t normalize at all.

This function comes in handy if you want to mimic the behavior of eager type alias expansion in a localized manner.

This delays a bug on overflow! Therefore you need to be certain that the contained types get fully normalized at a later stage. Note that even on overflow all well-behaved weak alias types get expanded correctly, so the result is still useful.
source

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

Peel off all [weak alias types] in this type until there are none left.

This only expands weak alias types in “head” / outermost positions. It can be used over expand_weak_alias_tys as an optimization in situations where one only really cares about the kind of the final aliased type but not the types the other constituent types alias.

This delays a bug on overflow! Therefore you need to be certain that the type gets fully normalized at a later stage.
source§

impl<'tcx> TyCtxt<'tcx>

source

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

Invoke callback on every region appearing free in value.

source

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

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

source

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

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

source

pub fn collect_constrained_late_bound_regions<T>( self, value: Binder<'tcx, T>, ) -> FxHashSet<BoundRegionKind>
where T: TypeFoldable<TyCtxt<'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.

source

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

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

source

fn collect_late_bound_regions<T>( self, value: Binder<'tcx, T>, just_constrained: bool, ) -> FxHashSet<BoundRegionKind>
where T: TypeFoldable<TyCtxt<'tcx>>,

source§

impl<'tcx> TyCtxt<'tcx>

source

pub const COMMON_VTABLE_ENTRIES: &'tcx [VtblEntry<'tcx>] = _

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn closure_kind_origin( self, def_id: LocalDefId, ) -> Option<&'tcx (Span, HirPlace<'tcx>)>

source

pub fn closure_user_provided_sig( self, def_id: LocalDefId, ) -> CanonicalPolyFnSig<'tcx>

source

pub fn closure_captures( self, def_id: LocalDefId, ) -> &'tcx [&'tcx CapturedPlace<'tcx>]

source§

impl<'tcx> TyCtxt<'tcx>

Some workarounds to use cases that cannot use create_def. Do not add new ways to create TyCtxtFeed without consulting with T-compiler and making an analysis about why your addition does not cause incremental compilation issues.

source

pub fn feed_unit_query(self) -> TyCtxtFeed<'tcx, ()>

Can only be fed before queries are run, and is thus exempt from any incremental issues. Do not use except for the initial query feeding.

source

pub fn create_local_crate_def_id( self, span: Span, ) -> TyCtxtFeed<'tcx, LocalDefId>

Only used in the resolver to register the CRATE_DEF_ID DefId and feed some queries for it. It will panic if used twice.

source

pub fn feed_anon_const_type( self, key: LocalDefId, value: EarlyBinder<'tcx, Ty<'tcx>>, )

In order to break cycles involving AnonConst, we need to set the expected type by side effect. However, we do not want this as a general capability, so this interface restricts to the only allowed case.

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn has_typeck_results(self, def_id: LocalDefId) -> bool

source

pub fn body_codegen_attrs(self, def_id: DefId) -> &'tcx CodegenFnAttrs

Expects a body and returns its codegen attributes.

Unlike codegen_fn_attrs, this returns CodegenFnAttrs::EMPTY for constants.

source

pub fn alloc_steal_thir(self, thir: Thir<'tcx>) -> &'tcx Steal<Thir<'tcx>>

source

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

source

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

source

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

source

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

Allocates a read-only byte or string literal for mir::interpret. Returns the same AllocId if called again with the same bytes.

source

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.

source

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

source

pub fn create_global_ctxt( s: &'tcx Session, crate_types: Vec<CrateType>, stable_crate_id: StableCrateId, arena: &'tcx WorkerLocal<Arena<'tcx>>, hir_arena: &'tcx WorkerLocal<Arena<'tcx>>, untracked: Untracked, dep_graph: DepGraph, query_kinds: &'tcx [DepKindStruct<'tcx>], query_system: QuerySystem<'tcx>, hooks: Providers, current_gcx: CurrentGcx, ) -> GlobalCtxt<'tcx>

Creates a type context. To use the context call fn enter which provides a TyCtxt.

By only providing the TyCtxt inside of the closure we enforce that the type context and any interned alue (types, args, etc.) can only be used while ty::tls has a valid reference to the context, to allow formatting values that need it.

source

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

source

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

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

source

pub fn ty_ordering_enum(self, span: Option<Span>) -> Ty<'tcx>

Gets a Ty representing the LangItem::OrderingEnum

source

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.

source

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

Obtain the diagnostic item’s name

source

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

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

source

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

source

pub fn coroutine_movability(self, def_id: DefId) -> Movability

Returns the movability of the coroutine of def_id, or panics if given a def_id that is not a coroutine.

source

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

Returns true if the node pointed to by def_id is a coroutine for an async construct.

source

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

Returns true if the node pointed to by def_id is a general coroutine that implements Coroutine. This means it is neither an async or gen construct.

source

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

Returns true if the node pointed to by def_id is a coroutine for a gen construct.

source

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

Returns true if the node pointed to by def_id is a coroutine for a async gen construct.

source

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

source

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

source

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

source

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.

source

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

source

pub fn crate_types(self) -> &'tcx [CrateType]

source

pub fn metadata_kind(self) -> MetadataKind

source

pub fn needs_metadata(self) -> bool

source

pub fn needs_crate_hash(self) -> bool

source

pub fn stable_crate_id(self, crate_num: CrateNum) -> StableCrateId

source

pub fn stable_crate_id_to_crate_num( self, stable_crate_id: StableCrateId, ) -> CrateNum

Maps a StableCrateId to the corresponding CrateNum. This method assumes that the crate in question has already been loaded by the CrateStore.

source

pub fn def_path_hash_to_def_id(self, hash: DefPathHash) -> Option<DefId>

Converts a DefPathHash to its corresponding DefId in the current compilation session, if it still exists. This is used during incremental compilation to turn a deserialized DefPathHash into its current DefId.

source

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

source

pub fn dcx(self) -> DiagCtxtHandle<'tcx>

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn create_def( self, parent: LocalDefId, name: Symbol, def_kind: DefKind, ) -> TyCtxtFeed<'tcx, LocalDefId>

tcx-dependent operations performed for every created definition.

source

pub fn create_crate_num( self, stable_crate_id: StableCrateId, ) -> Result<TyCtxtFeed<'tcx, CrateNum>, CrateNum>

source

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

source

pub fn def_path_table(self) -> &'tcx DefPathTable

source

pub fn def_path_hash_to_def_index_map(self) -> &'tcx DefPathHashMap

source

pub fn cstore_untracked(self) -> FreezeReadGuard<'tcx, CrateStoreDyn>

Note that this is untracked and should only be used within the query system if the result is otherwise tracked through queries

source

pub fn untracked(self) -> &'tcx Untracked

Give out access to the untracked data without any sanity checks.

source

pub fn definitions_untracked(self) -> FreezeReadGuard<'tcx, Definitions>

Note that this is untracked and should only be used within the query system if the result is otherwise tracked through queries

source

pub fn source_span_untracked(self, def_id: LocalDefId) -> Span

Note that this is untracked and should only be used within the query system if the result is otherwise tracked through queries

source

pub fn with_stable_hashing_context<R>( self, f: impl FnOnce(StableHashingContext<'_>) -> R, ) -> R

source

pub fn serialize_query_result_cache( self, encoder: FileEncoder, ) -> FileEncodeResult

source

pub fn local_crate_exports_generics(self) -> bool

source

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

Returns the DefId and the BoundRegionKind corresponding to the given region.

source

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.

source

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

Given a DefId for an fn, return all the dyn and impl traits in its return type, and the associated alias span when type alias is used, along with a span for lifetime suggestion (if there are existing generics).

source

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

Checks if the bound region is in Impl Item.

source

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.

source

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

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

source

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

source

pub fn type_length_limit(self) -> Limit

source

pub fn recursion_limit(self) -> Limit

source

pub fn move_size_limit(self) -> Limit

source

pub fn all_traits(self) -> impl Iterator<Item = DefId> + 'tcx

source

pub fn local_visibility(self, def_id: LocalDefId) -> Visibility

source

pub fn opaque_type_origin(self, def_id: LocalDefId) -> OpaqueTyOrigin

Returns the origin of the opaque type def_id.

source§

impl<'tcx> TyCtxt<'tcx>

source

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

source§

impl<'tcx> TyCtxt<'tcx>

source

pub(crate) fn intern_region(self, v: RegionKind<'tcx>) -> Region<'tcx>

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn mk_pat(self, v: PatternKind<'tcx>) -> Pattern<'tcx>

source§

impl<'tcx> TyCtxt<'tcx>

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn mk_layout(self, v: LayoutS<FieldIdx, VariantIdx>) -> Layout<'tcx>

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn mk_adt_def_from_data(self, v: AdtDefData) -> AdtDef<'tcx>

source§

impl<'tcx> TyCtxt<'tcx>

source§

impl<'tcx> TyCtxt<'tcx>

source§

impl<'tcx> TyCtxt<'tcx>

source

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

source

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

source

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

source

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

source

fn intern_poly_existential_predicates( self, v: &[PolyExistentialPredicate<'tcx>], ) -> &'tcx List<PolyExistentialPredicate<'tcx>>

source

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

source

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

source

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

source

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

source

fn intern_local_def_ids(self, v: &[LocalDefId]) -> &'tcx List<LocalDefId>

source

fn intern_captures( self, v: &[&'tcx CapturedPlace<'tcx>], ) -> &'tcx List<&'tcx CapturedPlace<'tcx>>

source

pub fn mk_offset_of( self, v: &[(VariantIdx, FieldIdx)], ) -> &'tcx List<(VariantIdx, FieldIdx)>

source§

impl<'tcx> TyCtxt<'tcx>

source

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.

source

pub fn trait_may_define_assoc_item( 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.

source

pub fn ty_is_opaque_future(self, ty: Ty<'_>) -> bool

Given a ty, return whether it’s an impl Future<...>.

source

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

Computes the def-ids of the transitive supertraits 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, and to make size estimates for vtable layout computation.

source

pub fn signature_unclosure( self, sig: PolyFnSig<'tcx>, safety: Safety, ) -> 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::Safety::Unsafe in the previous example, then you would get an unsafe fn (u32, i32). It cannot convert a closure that requires unsafe.

source

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

source

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

source

pub fn check_args_compatible( self, def_id: DefId, args: &'tcx [GenericArg<'tcx>], ) -> bool

source

fn check_args_compatible_inner( self, def_id: DefId, args: &'tcx [GenericArg<'tcx>], nested: bool, ) -> bool

source

pub fn debug_assert_args_compatible( self, def_id: DefId, args: &'tcx [GenericArg<'tcx>], )

With cfg(debug_assertions), assert that args are compatible with their generics, and print out the args if not.

source

pub(crate) fn check_and_mk_args( self, def_id: DefId, args: impl IntoIterator<Item: Into<GenericArg<'tcx>>>, ) -> GenericArgsRef<'tcx>

source

pub fn mk_ct_from_kind(self, kind: ConstKind<'tcx>) -> Const<'tcx>

source

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

source

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

source

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

source

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

source

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

source

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

source

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

source

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.

source

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

source

pub fn mk_clauses(self, clauses: &[Clause<'tcx>]) -> Clauses<'tcx>

source

pub fn mk_local_def_ids(self, clauses: &[LocalDefId]) -> &'tcx List<LocalDefId>

source

pub fn mk_local_def_ids_from_iter<I, T>(self, iter: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<LocalDefId, &'tcx List<LocalDefId>>,

source

pub fn mk_captures_from_iter<I, T>(self, iter: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<&'tcx CapturedPlace<'tcx>, &'tcx List<&'tcx CapturedPlace<'tcx>>>,

source

pub fn mk_const_list_from_iter<I, T>(self, iter: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<Const<'tcx>, &'tcx List<Const<'tcx>>>,

source

pub fn mk_fn_sig<I, T>( self, inputs: I, output: I::Item, c_variadic: bool, safety: Safety, abi: Abi, ) -> T::Output
where I: IntoIterator<Item = T>, T: CollectAndApply<Ty<'tcx>, FnSig<'tcx>>,

source

pub fn mk_poly_existential_predicates_from_iter<I, T>( self, iter: I, ) -> T::Output

source

pub fn mk_clauses_from_iter<I, T>(self, iter: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<Clause<'tcx>, Clauses<'tcx>>,

source

pub fn mk_type_list_from_iter<I, T>(self, iter: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<Ty<'tcx>, &'tcx List<Ty<'tcx>>>,

source

pub fn mk_args_from_iter<I, T>(self, iter: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<GenericArg<'tcx>, GenericArgsRef<'tcx>>,

source

pub fn mk_canonical_var_infos_from_iter<I, T>(self, iter: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<CanonicalVarInfo<'tcx>, &'tcx List<CanonicalVarInfo<'tcx>>>,

source

pub fn mk_place_elems_from_iter<I, T>(self, iter: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<PlaceElem<'tcx>, &'tcx List<PlaceElem<'tcx>>>,

source

pub fn mk_fields_from_iter<I, T>(self, iter: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<FieldIdx, &'tcx List<FieldIdx>>,

source

pub fn mk_offset_of_from_iter<I, T>(self, iter: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<(VariantIdx, FieldIdx), &'tcx List<(VariantIdx, FieldIdx)>>,

source

pub fn mk_args_trait( self, self_ty: Ty<'tcx>, rest: impl IntoIterator<Item = GenericArg<'tcx>>, ) -> GenericArgsRef<'tcx>

source

pub fn mk_bound_variable_kinds_from_iter<I, T>(self, iter: I) -> T::Output

source

pub fn emit_node_span_lint( self, lint: &'static Lint, hir_id: HirId, span: impl Into<MultiSpan>, decorator: impl for<'a> LintDiagnostic<'a, ()>, )

Emit a lint at span from a lint struct (some type that implements LintDiagnostic, typically generated by #[derive(LintDiagnostic)]).

source

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

Emit a lint at the appropriate level for a hir node, with an associated span.

source

pub fn crate_level_attribute_injection_span(self, hir_id: HirId) -> Option<Span>

Find the crate root and the appropriate span where use and outer attributes can be inserted at.

source

pub fn disabled_nightly_features<E: EmissionGuarantee>( self, diag: &mut Diag<'_, E>, hir_id: Option<HirId>, features: impl IntoIterator<Item = (String, Symbol)>, )

source

pub fn emit_node_lint( self, lint: &'static Lint, id: HirId, decorator: impl for<'a> LintDiagnostic<'a, ()>, )

Emit a lint from a lint struct (some type that implements LintDiagnostic, typically generated by #[derive(LintDiagnostic)]).

source

pub fn node_lint( self, lint: &'static Lint, id: HirId, decorate: impl for<'a, 'b> FnOnce(&'b mut Diag<'a, ()>), )

Emit a lint at the appropriate level for a hir node.

source

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

source

pub fn named_bound_var(self, id: HirId) -> Option<ResolvedArg>

source

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

source

pub fn late_bound_vars(self, id: HirId) -> &'tcx List<BoundVariableKind>

source

pub fn map_opaque_lifetime_to_parent_lifetime( self, opaque_lifetime_param_def_id: LocalDefId, ) -> Region<'tcx>

Given the def-id of an early-bound lifetime on an opaque corresponding to a duplicated captured lifetime, map it back to the early- or late-bound lifetime of the function from which it originally as captured. If it is a late-bound lifetime, this will represent the liberated (ReLateParam) lifetime of the signature.

source

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

Whether the def_id counts as const fn in the current crate, considering all active feature gates

source

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

Whether the trait impl is marked const. This does not consider stability or feature gates.

source

pub fn intrinsic( self, def_id: impl IntoQueryParam<DefId> + Copy, ) -> Option<IntrinsicDef>

source

pub fn next_trait_solver_globally(self) -> bool

source

pub fn next_trait_solver_in_coherence(self) -> bool

source

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

source

pub fn module_children_local(self, def_id: LocalDefId) -> &'tcx [ModChild]

Named module children from all kinds of items, including imports. In addition to regular items this list also includes struct and variant constructors, and items inside extern {} blocks because all of them introduce names into parent module.

Module here is understood in name resolution sense - it can be a mod item, or a crate root, or an enum, or a trait.

This is not a query, making it a query causes perf regressions (probably due to hashing spans in ModChildren).

source

pub fn resolver_for_lowering( self, ) -> &'tcx Steal<(ResolverAstLowering, Lrc<Crate>)>

source

pub fn impl_trait_ref( self, def_id: impl IntoQueryParam<DefId>, ) -> Option<EarlyBinder<'tcx, TraitRef<'tcx>>>

Given an impl_id, return the trait it implements. Return None if this is an inherent impl.

source

pub fn impl_polarity(self, def_id: impl IntoQueryParam<DefId>) -> ImplPolarity

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn erase_regions<T>(self, value: T) -> T
where T: TypeFoldable<TyCtxt<'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)..

source§

impl TyCtxt<'_>

source

pub fn is_intrinsic(self, def_id: DefId, name: Symbol) -> bool

source§

impl TyCtxt<'_>

source

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

source

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

source

pub fn opt_local_parent(self, id: LocalDefId) -> Option<LocalDefId>

source

pub fn local_parent(self, id: impl Into<LocalDefId>) -> LocalDefId

source

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

source§

impl<'tcx> TyCtxt<'tcx>

source

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

source

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

source

pub fn repr_options_of_def(self, did: LocalDefId) -> ReprOptions

source

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

Look up the name of a definition across crates. This does not look at HIR.

source

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

Look up the name of a definition across crates. This does not look at HIR.

This method will ICE if the corresponding item does not have a name. In these cases, use opt_item_name instead.

source

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

Look up the name and span of a definition.

See item_name for more information.

source

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

source

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

If the def_id is an associated type that was desugared from a return-position impl Trait from a trait, then provide the source info about where that RPITIT came from.

source

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

Whether the def_id is an associated type that was desugared from a #[const_trait] or impl_const.

source

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

source

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.

source

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.

source

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

Returns the possibly-auto-generated MIR of a ty::InstanceKind.

source

pub fn get_attrs_unchecked(self, did: DefId) -> &'tcx [Attribute]

source

pub fn get_attrs( self, did: impl Into<DefId>, attr: Symbol, ) -> impl Iterator<Item = &'tcx Attribute>

Gets all attributes with the given name.

source

pub fn get_attrs_by_path<'attr>( self, did: DefId, attr: &'attr [Symbol], ) -> impl Iterator<Item = &'tcx Attribute> + 'attr
where 'tcx: 'attr,

source

pub fn get_attr( self, did: impl Into<DefId>, attr: Symbol, ) -> Option<&'tcx Attribute>

source

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

Determines whether an item is annotated with an attribute.

source

pub fn has_attrs_with_path( self, did: impl Into<DefId>, attrs: &[Symbol], ) -> bool

Determines whether an item is annotated with a multi-segement attribute

source

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

Returns true if this is an auto trait.

source

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

Returns true if this is coinductive, either because it is an auto trait or because it has the #[rustc_coinductive] attribute.

source

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

Returns true if this is a trait alias.

source

pub fn coroutine_layout( self, def_id: DefId, coroutine_kind_ty: Ty<'tcx>, ) -> Option<&'tcx CoroutineLayout<'tcx>>

Returns layout of a coroutine. Layout might be unavailable if the coroutine is tainted by errors.

Takes coroutine_kind which can be acquired from the CoroutineArgs::kind_ty, e.g. args.as_coroutine().kind_ty().

source

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.

source

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

If the given DefId describes an item belonging to a trait, returns the DefId of the trait that the trait item belongs to; otherwise, returns None.

source

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.

source

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

Check if the given DefId is #\[automatically_derived\], and whether it was produced by expanding a builtin derive macro.

source

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

Check if the given DefId is #\[automatically_derived\].

source

pub fn span_of_impl(self, impl_def_id: 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.

source

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.

source

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

source

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

source

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

source

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

source

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

source

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

source§

impl<'tcx> TyCtxt<'tcx>

source

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

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

source

pub fn ensure_with_value(self) -> TyCtxtEnsureWithValue<'tcx>

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

This version verifies that the computed result exists in the cache before returning.

source

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.

source

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

source§

impl<'tcx> TyCtxt<'tcx>

source

pub fn trigger_delayed_bug(self, key: impl IntoQueryParam<DefId>)

This exists purely for testing the interactions between delayed bugs and incremental.

source

pub fn registered_tools(self, key: ()) -> &'tcx RegisteredTools

Collects the list of all tools registered using #![register_tool].

source

pub fn early_lint_checks(self, key: ())

[query description - consider adding a doc-comment!] perform lints prior to macro expansion

source

pub fn resolutions(self, key: ()) -> &'tcx ResolverGlobalCtxt

[query description - consider adding a doc-comment!] getting the resolver outputs

source

pub fn resolver_for_lowering_raw( self, key: (), ) -> (&'tcx Steal<(ResolverAstLowering, Lrc<Crate>)>, &'tcx ResolverGlobalCtxt)

[query description - consider adding a doc-comment!] getting the resolver for lowering

source

pub fn source_span(self, key: impl IntoQueryParam<LocalDefId>) -> Span

Return the span for a definition. Contrary to def_span below, this query returns the full absolute span of the definition. This span is meant for dep-tracking rather than diagnostics. It should not be used outside of rustc_middle::hir::source_map.

source

pub fn hir_crate(self, key: ()) -> &'tcx Crate<'tcx>

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

source

pub fn hir_crate_items(self, key: ()) -> &'tcx ModuleItems

All items in the crate.

source

pub fn hir_module_items(self, key: LocalModDefId) -> &'tcx ModuleItems

The items in a module.

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

source

pub fn local_def_id_to_hir_id( self, key: impl IntoQueryParam<LocalDefId>, ) -> HirId

Returns HIR ID for the given LocalDefId.

source

pub fn hir_owner_parent(self, key: OwnerId) -> HirId

Gives access to the HIR node’s parent for the HIR owner key.

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

source

pub fn opt_hir_owner_nodes( self, key: impl IntoQueryParam<LocalDefId>, ) -> Option<&'tcx OwnerNodes<'tcx>>

Gives access to the HIR nodes and bodies inside key if it’s a HIR owner.

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

source

pub fn hir_attrs(self, key: OwnerId) -> &'tcx AttributeMap<'tcx>

Gives access to the HIR attributes inside the HIR owner key.

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

source

pub fn const_param_default( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Const<'tcx>>

Given the def_id of a const-generic parameter, computes the associated default const parameter. e.g. fn example<const N: usize=3> called on N would return 3.

source

pub fn type_of( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Ty<'tcx>>

Returns the Ty of the given DefId. If the DefId points to an alias, it will “skip” this alias to return the aliased type.

source

pub fn type_of_opaque( self, key: impl IntoQueryParam<DefId>, ) -> Result<EarlyBinder<'tcx, Ty<'tcx>>, CyclePlaceholder>

Specialized instance of type_of that detects cycles that are due to revealing opaque because of an auto trait bound. Unless CyclePlaceholder needs to be handled separately, call type_of instead.

source

pub fn type_alias_is_lazy(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] computing whether {path} is a lazy type alias

source

pub fn collect_return_position_impl_trait_in_trait_tys( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx DefIdMap<EarlyBinder<'tcx, Ty<'tcx>>>, ErrorGuaranteed>

[query description - consider adding a doc-comment!] comparing an impl and trait method signature, inferring any hidden impl Trait types in the process

source

pub fn is_type_alias_impl_trait(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] determine whether the opaque is a type-alias impl trait

source

pub fn unsizing_params_for_adt( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx BitSet<u32>

[query description - consider adding a doc-comment!] determining what parameters of tcx.def_path_str(key) can participate in unsizing

source

pub fn analysis(self, key: ()) -> Result<(), ErrorGuaranteed>

The root query triggering all analysis passes like typeck or borrowck.

source

pub fn check_expectations(self, key: Option<Symbol>)

This query checks the fulfillment of collected lint expectations. All lint emitting queries have to be done before this is executed to ensure that all expectations can be fulfilled.

This is an extra query to enable other drivers (like rustdoc) to only execute a small subset of the analysis query, while allowing lints to be expected. In rustc, this query will be executed as part of the analysis query and doesn’t have to be called a second time.

Tools can additionally pass in a tool filter. That will restrict the expectations to only trigger for lints starting with the listed tool name. This is useful for cases were not all linting code from rustc was called. With the default None all registered lints will also be checked for expectation fulfillment.

source

pub fn generics_of(self, key: impl IntoQueryParam<DefId>) -> &'tcx Generics

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

source

pub fn predicates_of( self, key: impl IntoQueryParam<DefId>, ) -> GenericPredicates<'tcx>

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

source

pub fn opaque_types_defined_by( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx List<LocalDefId>

[query description - consider adding a doc-comment!] computing the opaque types defined by tcx.def_path_str(key.to_def_id())

source

pub fn explicit_item_bounds( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, &'tcx [(Clause<'tcx>, Span)]>

Returns the list of bounds that are required to be satsified by a implementation or definition. For associated types, these must be satisfied for an implementation to be well-formed, and for opaque types, these are required to be satisfied by the hidden-type of the opaque.

Syntactially, these are the bounds written on the trait’s type definition, or those after the impl keyword for an opaque:

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.

source

pub fn explicit_item_super_predicates( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, &'tcx [(Clause<'tcx>, Span)]>

The set of item bounds (see TyCtxt::explicit_item_bounds) that share the Self type of the item. These are a subset of the bounds that may explicitly be used for things like closure signature deduction.

source

pub fn item_bounds( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Clauses<'tcx>>

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.

source

pub fn item_super_predicates( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Clauses<'tcx>>

[query description - consider adding a doc-comment!] elaborating item assumptions for tcx.def_path_str(key)

source

pub fn item_non_self_assumptions( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Clauses<'tcx>>

[query description - consider adding a doc-comment!] elaborating item assumptions for tcx.def_path_str(key)

source

pub fn impl_super_outlives( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Clauses<'tcx>>

[query description - consider adding a doc-comment!] elaborating supertrait outlives for trait of tcx.def_path_str(key)

source

pub fn native_libraries(self, key: CrateNum) -> &'tcx Vec<NativeLib>

Look up all native libraries this crate depends on. These are assembled from the following places:

  • extern blocks (depending on their link attributes)
  • the libs (-l) option
source

pub fn shallow_lint_levels_on(self, key: OwnerId) -> &'tcx ShallowLintLevelMap

[query description - consider adding a doc-comment!] looking up lint levels for tcx.def_path_str(key)

source

pub fn lint_expectations( self, key: (), ) -> &'tcx Vec<(LintExpectationId, LintExpectation)>

[query description - consider adding a doc-comment!] computing #[expect]ed lints in this crate

source

pub fn expn_that_defined(self, key: impl IntoQueryParam<DefId>) -> ExpnId

[query description - consider adding a doc-comment!] getting the expansion that defined tcx.def_path_str(key)

source

pub fn is_panic_runtime(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if the crate is_panic_runtime

source

pub fn representability( self, key: impl IntoQueryParam<LocalDefId>, ) -> Representability

Checks whether a type is representable or infinitely sized

source

pub fn representability_adt_ty(self, key: Ty<'tcx>) -> Representability

An implementation detail for the representability query

source

pub fn params_in_repr( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx BitSet<u32>

Set of param indexes for type params that are in the type’s representation

source

pub fn thir_body( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(&'tcx Steal<Thir<'tcx>>, ExprId), ErrorGuaranteed>

Fetch the THIR for a given body. If typeck for that body failed, returns an empty Thir.

source

pub fn mir_keys(self, key: ()) -> &'tcx FxIndexSet<LocalDefId>

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.

source

pub fn mir_const_qualif(self, key: impl IntoQueryParam<DefId>) -> ConstQualifs

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.

source

pub fn mir_built( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx Steal<Body<'tcx>>

Build the MIR for a given DefId and prepare it for const qualification.

See the rustc dev guide for more info.

source

pub fn thir_abstract_const( self, key: impl IntoQueryParam<DefId>, ) -> Result<Option<EarlyBinder<'tcx, Const<'tcx>>>, ErrorGuaranteed>

Try to build an abstract representation of the given constant.

source

pub fn mir_drops_elaborated_and_const_checked( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx Steal<Body<'tcx>>

[query description - consider adding a doc-comment!] elaborating drops for tcx.def_path_str(key)

source

pub fn mir_for_ctfe(self, key: impl IntoQueryParam<DefId>) -> &'tcx Body<'tcx>

[query description - consider adding a doc-comment!] caching mir of tcx.def_path_str(key) for CTFE

source

pub fn mir_promoted( self, key: impl IntoQueryParam<LocalDefId>, ) -> (&'tcx Steal<Body<'tcx>>, &'tcx Steal<IndexVec<Promoted, Body<'tcx>>>)

[query description - consider adding a doc-comment!] promoting constants in MIR for tcx.def_path_str(key)

source

pub fn closure_typeinfo( self, key: impl IntoQueryParam<LocalDefId>, ) -> ClosureTypeInfo<'tcx>

[query description - consider adding a doc-comment!] finding symbols for captures of closure tcx.def_path_str(key)

source

pub fn closure_saved_names_of_captured_variables( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx IndexVec<FieldIdx, Symbol>

Returns names of captured upvars for closures and coroutines.

Here are some examples:

  • name__field1__field2 when the upvar is captured by value.
  • _ref__name__field when the upvar is captured by reference.

For coroutines this only contains upvars that are shared by all states.

source

pub fn mir_coroutine_witnesses( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx Option<CoroutineLayout<'tcx>>

[query description - consider adding a doc-comment!] coroutine witness types for tcx.def_path_str(key)

source

pub fn check_coroutine_obligations( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] verify auto trait bounds for coroutine interior type tcx.def_path_str(key)

source

pub fn optimized_mir(self, key: impl IntoQueryParam<DefId>) -> &'tcx Body<'tcx>

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.

source

pub fn coverage_attr_on(self, key: impl IntoQueryParam<LocalDefId>) -> bool

Checks for the nearest #[coverage(off)] or #[coverage(on)] on this def and any enclosing defs, up to the crate root.

Returns false if #[coverage(off)] was found, or true if either #[coverage(on)] or no coverage attribute was found.

source

pub fn coverage_ids_info(self, key: InstanceKind<'tcx>) -> &'tcx CoverageIdsInfo

Summarizes coverage IDs inserted by the InstrumentCoverage MIR pass (for compiler option -Cinstrument-coverage), after MIR optimizations have had a chance to potentially remove some of them.

source

pub fn promoted_mir( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx IndexVec<Promoted, Body<'tcx>>

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.

source

pub fn erase_regions_ty(self, key: Ty<'tcx>) -> Ty<'tcx>

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.

source

pub fn wasm_import_module_map(self, key: CrateNum) -> &'tcx DefIdMap<String>

[query description - consider adding a doc-comment!] getting wasm import module map

source

pub fn predicates_defined_on( self, key: impl IntoQueryParam<DefId>, ) -> GenericPredicates<'tcx>

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.

source

pub fn trait_explicit_predicates_and_bounds( self, key: impl IntoQueryParam<LocalDefId>, ) -> GenericPredicates<'tcx>

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.

source

pub fn explicit_predicates_of( self, key: impl IntoQueryParam<DefId>, ) -> GenericPredicates<'tcx>

Returns the predicates written explicitly by the user.

You should probably use predicates_of unless you’re looking for predicates with explicit spans for diagnostics purposes.

source

pub fn inferred_outlives_of( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [(Clause<'tcx>, Span)]

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

source

pub fn explicit_super_predicates_of( self, key: impl IntoQueryParam<DefId>, ) -> GenericPredicates<'tcx>

Maps from the DefId of a trait to the list of super-predicates of the trait, before elaboration (so it doesn’t contain transitive 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 super-predicates must not be cyclic).

source

pub fn explicit_implied_predicates_of( self, key: impl IntoQueryParam<DefId>, ) -> GenericPredicates<'tcx>

The predicates of the trait that are implied during elaboration. This is a superset of the super-predicates of the trait, but a subset of the predicates of the trait. For regular traits, this includes all super-predicates and their associated type bounds. For trait aliases, currently, this includes all of the predicates of the trait alias.

source

pub fn explicit_supertraits_containing_assoc_item( self, key: (DefId, Ident), ) -> GenericPredicates<'tcx>

The Ident is the name of an associated type.The query returns only the subset of supertraits that define the given associated type. This is used to avoid cycles in resolving type-dependent associated item paths like T::Item.

source

pub fn type_param_predicates( self, key: (LocalDefId, LocalDefId, Ident), ) -> GenericPredicates<'tcx>

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

source

pub fn trait_def(self, key: impl IntoQueryParam<DefId>) -> &'tcx TraitDef

[query description - consider adding a doc-comment!] computing trait definition for tcx.def_path_str(key)

source

pub fn adt_def(self, key: impl IntoQueryParam<DefId>) -> AdtDef<'tcx>

[query description - consider adding a doc-comment!] computing ADT definition for tcx.def_path_str(key)

source

pub fn adt_destructor( self, key: impl IntoQueryParam<DefId>, ) -> Option<Destructor>

[query description - consider adding a doc-comment!] computing Drop impl for tcx.def_path_str(key)

source

pub fn adt_async_destructor( self, key: impl IntoQueryParam<DefId>, ) -> Option<AsyncDestructor>

[query description - consider adding a doc-comment!] computing AsyncDrop impl for tcx.def_path_str(key)

source

pub fn adt_sized_constraint( self, key: impl IntoQueryParam<DefId>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>

[query description - consider adding a doc-comment!] computing the Sized constraint for tcx.def_path_str(key)

source

pub fn adt_dtorck_constraint( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx DropckConstraint<'tcx>, NoSolution>

[query description - consider adding a doc-comment!] computing drop-check constraints for tcx.def_path_str(key)

source

pub fn constness(self, key: impl IntoQueryParam<DefId>) -> Constness

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. Consider using is_const_fn or is_const_fn_raw instead.

source

pub fn asyncness(self, key: impl IntoQueryParam<DefId>) -> Asyncness

[query description - consider adding a doc-comment!] checking if the function is async: tcx.def_path_str(key)

source

pub fn is_promotable_const_fn(self, key: impl IntoQueryParam<DefId>) -> bool

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

source

pub fn coroutine_kind( self, key: impl IntoQueryParam<DefId>, ) -> Option<CoroutineKind>

Returns Some(coroutine_kind) if the node pointed to by def_id is a coroutine.

source

pub fn coroutine_for_closure(self, key: impl IntoQueryParam<DefId>) -> DefId

[query description - consider adding a doc-comment!] Given a coroutine-closure def id, return the def id of the coroutine returned by it

source

pub fn crate_variances(self, key: ()) -> &'tcx CrateVariancesMap<'tcx>

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

source

pub fn variances_of(self, key: impl IntoQueryParam<DefId>) -> &'tcx [Variance]

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

source

pub fn inferred_outlives_crate(self, key: ()) -> &'tcx CratePredicatesMap<'tcx>

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

source

pub fn associated_item_def_ids( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [DefId]

Maps from an impl/trait or struct/variant DefId to a list of the DefIds of its associated items or fields.

source

pub fn associated_item(self, key: impl IntoQueryParam<DefId>) -> AssocItem

Maps from a trait/impl item to the trait/impl item “descriptor”.

source

pub fn associated_items( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx AssocItems

Collects the associated items defined on a trait or impl.

source

pub fn impl_item_implementor_ids( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx DefIdMap<DefId>

Maps from associated items on a trait to the corresponding associated item on the impl specified by impl_id.

For example, with the following code

struct Type {}
                        // DefId
trait Trait {           // trait_id
    fn f();             // trait_f
    fn g() {}           // trait_g
}

impl Trait for Type {   // impl_id
    fn f() {}           // impl_f
    fn g() {}           // impl_g
}

The map returned for tcx.impl_item_implementor_ids(impl_id) would be { trait_f: impl_f, trait_g: impl_g }

source

pub fn associated_types_for_impl_traits_in_associated_fn( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [DefId]

Given fn_def_id of a trait or of an impl that implements a given trait: if fn_def_id is the def id of a function defined inside a trait, then it creates and returns the associated items that correspond to each impl trait in return position for that trait. if fn_def_id is the def id of a function defined inside an impl that implements a trait, then it creates and returns the associated items that correspond to each impl trait in return position of the implemented trait.

source

pub fn associated_type_for_effects( self, key: impl IntoQueryParam<DefId>, ) -> Option<DefId>

[query description - consider adding a doc-comment!] creating associated items for effects in tcx.def_path_str(def_id)

source

pub fn associated_type_for_impl_trait_in_trait( self, key: impl IntoQueryParam<LocalDefId>, ) -> LocalDefId

Given an impl trait in trait opaque_ty_def_id, create and return the corresponding associated item.

source

pub fn impl_trait_header( self, key: impl IntoQueryParam<DefId>, ) -> Option<ImplTraitHeader<'tcx>>

Given an impl_id, return the trait it implements along with some header information. Return None if this is an inherent impl.

source

pub fn self_ty_of_trait_impl_enabling_order_dep_trait_object_hack( self, key: impl IntoQueryParam<DefId>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>

[query description - consider adding a doc-comment!] computing self type wrt issue #33140 tcx.def_path_str(key)

source

pub fn inherent_impls( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx [DefId], ErrorGuaranteed>

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.

source

pub fn incoherent_impls( self, key: SimplifiedType, ) -> Result<&'tcx [DefId], ErrorGuaranteed>

[query description - consider adding a doc-comment!] collecting all inherent impls for {:?}

source

pub fn check_unsafety(self, key: impl IntoQueryParam<LocalDefId>)

Unsafety-check this LocalDefId.

source

pub fn assumed_wf_types( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx [(Ty<'tcx>, Span)]

Returns the types assumed to be well formed while “inside” of the given item.

Note that we’ve liberated the late bound regions of function signatures, so this can not be used to check whether these types are well formed.

source

pub fn assumed_wf_types_for_rpitit( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [(Ty<'tcx>, Span)]

We need to store the assumed_wf_types for an RPITIT so that impls of foreign traits with return-position impl trait in traits can inherit the right wf types.

source

pub fn fn_sig( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, PolyFnSig<'tcx>>

Computes the signature of the function.

source

pub fn lint_mod(self, key: LocalModDefId)

Performs lint checking for the module.

source

pub fn check_unused_traits(self, key: ())

[query description - consider adding a doc-comment!] checking unused trait imports in crate

source

pub fn check_mod_attrs(self, key: LocalModDefId)

Checks the attributes in the module.

source

pub fn check_mod_unstable_api_usage(self, key: LocalModDefId)

Checks for uses of unstable APIs in the module.

source

pub fn check_mod_const_bodies(self, key: LocalModDefId)

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

source

pub fn check_mod_loops(self, key: LocalModDefId)

Checks the loops in the module.

source

pub fn check_mod_naked_functions(self, key: LocalModDefId)

[query description - consider adding a doc-comment!] checking naked functions in describe_as_module(key, tcx)

source

pub fn check_mod_privacy(self, key: LocalModDefId)

[query description - consider adding a doc-comment!] checking privacy in describe_as_module(key.to_local_def_id(), tcx)

source

pub fn check_liveness(self, key: impl IntoQueryParam<LocalDefId>)

[query description - consider adding a doc-comment!] checking liveness of variables in tcx.def_path_str(key)

source

pub fn live_symbols_and_ignored_derived_traits( self, key: (), ) -> &'tcx (LocalDefIdSet, LocalDefIdMap<Vec<(DefId, DefId)>>)

Return the live symbols in the crate for dead code check.

The second return value maps from ADTs to ignored derived traits (e.g. Debug and Clone) and their respective impl (i.e., part of the derive macro)

source

pub fn check_mod_deathness(self, key: LocalModDefId)

[query description - consider adding a doc-comment!] checking deathness of variables in describe_as_module(key, tcx)

source

pub fn check_mod_type_wf( self, key: LocalModDefId, ) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] checking that types are well-formed in describe_as_module(key, tcx)

source

pub fn coerce_unsized_info( self, key: impl IntoQueryParam<DefId>, ) -> Result<CoerceUnsizedInfo, ErrorGuaranteed>

Caches CoerceUnsized kinds for impls on custom types.

source

pub fn typeck( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx TypeckResults<'tcx>

[query description - consider adding a doc-comment!] type-checking tcx.def_path_str(key)

source

pub fn diagnostic_only_typeck( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx TypeckResults<'tcx>

[query description - consider adding a doc-comment!] type-checking tcx.def_path_str(key)

source

pub fn used_trait_imports( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx UnordSet<LocalDefId>

[query description - consider adding a doc-comment!] finding used_trait_imports tcx.def_path_str(key)

source

pub fn coherent_trait( self, key: impl IntoQueryParam<DefId>, ) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] coherence checking all impls of trait tcx.def_path_str(def_id)

source

pub fn mir_borrowck( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx BorrowCheckResult<'tcx>

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

source

pub fn crate_inherent_impls( self, key: (), ) -> Result<&'tcx CrateInherentImpls, ErrorGuaranteed>

Gets a complete map from all types to their inherent impls. Not meant to be used directly outside of coherence.

source

pub fn crate_inherent_impls_overlap_check( self, key: (), ) -> Result<(), ErrorGuaranteed>

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

source

pub fn orphan_check_impl( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(), ErrorGuaranteed>

Checks whether all impls in the crate pass the overlap check, returning which impls fail it. If all impls are correct, the returned slice is empty.

source

pub fn mir_callgraph_reachable(self, key: (Instance<'tcx>, LocalDefId)) -> bool

Check whether the function has any recursion that could cause the inliner to trigger a cycle. Returns the call stack causing the cycle. The call stack does not contain the current function, just all intermediate functions.

source

pub fn mir_inliner_callees( self, key: InstanceKind<'tcx>, ) -> &'tcx [(DefId, GenericArgsRef<'tcx>)]

Obtain all the calls into other local functions

source

pub fn tag_for_variant(self, key: (Ty<'tcx>, VariantIdx)) -> Option<ScalarInt>

Computes the tag (if any) for a given type and variant.

source

pub fn eval_to_allocation_raw( self, key: ParamEnvAnd<'tcx, GlobalId<'tcx>>, ) -> EvalToAllocationRawResult<'tcx>

Evaluates a constant and returns the computed allocation.

Do not use this directly, use the eval_to_const_value or eval_to_valtree instead.

source

pub fn eval_static_initializer( self, key: impl IntoQueryParam<DefId>, ) -> EvalStaticInitializerRawResult<'tcx>

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

source

pub fn eval_to_const_value_raw( self, key: ParamEnvAnd<'tcx, GlobalId<'tcx>>, ) -> EvalToConstValueResult<'tcx>

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.

source

pub fn eval_to_valtree( self, key: ParamEnvAnd<'tcx, GlobalId<'tcx>>, ) -> EvalToValTreeResult<'tcx>

Evaluate a constant and convert it to a type level constant or return None if that is not possible.

source

pub fn valtree_to_const_val( self, key: (Ty<'tcx>, ValTree<'tcx>), ) -> ConstValue<'tcx>

Converts a type level constant value into ConstValue

source

pub fn destructure_const(self, key: Const<'tcx>) -> DestructuredConst<'tcx>

Destructures array, ADT or tuple constants into the constants of their fields.

source

pub fn lit_to_const( self, key: LitToConstInput<'tcx>, ) -> Result<Const<'tcx>, LitToConstError>

[query description - consider adding a doc-comment!] converting literal to const

source

pub fn check_match( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] match-checking tcx.def_path_str(key)

source

pub fn effective_visibilities(self, key: ()) -> &'tcx EffectiveVisibilities

Performs part of the privacy check and computes effective visibilities.

source

pub fn check_private_in_public(self, key: ())

[query description - consider adding a doc-comment!] checking for private elements in public interfaces

source

pub fn reachable_set(self, key: ()) -> &'tcx LocalDefIdSet

[query description - consider adding a doc-comment!] reachability

source

pub fn region_scope_tree( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx ScopeTree

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.

source

pub fn mir_shims(self, key: InstanceKind<'tcx>) -> &'tcx Body<'tcx>

Generates a MIR body for the shim.

source

pub fn symbol_name(self, key: Instance<'tcx>) -> SymbolName<'tcx>

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.

source

pub fn def_kind(self, key: impl IntoQueryParam<DefId>) -> DefKind

[query description - consider adding a doc-comment!] looking up definition kind of tcx.def_path_str(def_id)

source

pub fn def_span(self, key: impl IntoQueryParam<DefId>) -> Span

Gets the span for the definition.

source

pub fn def_ident_span(self, key: impl IntoQueryParam<DefId>) -> Option<Span>

Gets the span for the identifier of the definition.

source

pub fn lookup_stability( self, key: impl IntoQueryParam<DefId>, ) -> Option<Stability>

[query description - consider adding a doc-comment!] looking up stability of tcx.def_path_str(def_id)

source

pub fn lookup_const_stability( self, key: impl IntoQueryParam<DefId>, ) -> Option<ConstStability>

[query description - consider adding a doc-comment!] looking up const stability of tcx.def_path_str(def_id)

source

pub fn lookup_default_body_stability( self, key: impl IntoQueryParam<DefId>, ) -> Option<DefaultBodyStability>

[query description - consider adding a doc-comment!] looking up default body stability of tcx.def_path_str(def_id)

source

pub fn should_inherit_track_caller( self, key: impl IntoQueryParam<DefId>, ) -> bool

[query description - consider adding a doc-comment!] computing should_inherit_track_caller of tcx.def_path_str(def_id)

source

pub fn lookup_deprecation_entry( self, key: impl IntoQueryParam<DefId>, ) -> Option<DeprecationEntry>

[query description - consider adding a doc-comment!] checking whether tcx.def_path_str(def_id) is deprecated

source

pub fn is_doc_hidden(self, key: impl IntoQueryParam<DefId>) -> bool

Determines whether an item is annotated with doc(hidden).

source

pub fn is_doc_notable_trait(self, key: impl IntoQueryParam<DefId>) -> bool

Determines whether an item is annotated with doc(notable_trait).

source

pub fn item_attrs(self, key: impl IntoQueryParam<DefId>) -> &'tcx [Attribute]

Returns the attributes on the item at def_id.

Do not use this directly, use tcx.get_attrs instead.

source

pub fn codegen_fn_attrs( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx CodegenFnAttrs

[query description - consider adding a doc-comment!] computing codegen attributes of tcx.def_path_str(def_id)

source

pub fn asm_target_features( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx FxIndexSet<Symbol>

[query description - consider adding a doc-comment!] computing target features for inline asm of tcx.def_path_str(def_id)

source

pub fn fn_arg_names(self, key: impl IntoQueryParam<DefId>) -> &'tcx [Ident]

[query description - consider adding a doc-comment!] looking up function parameter names for tcx.def_path_str(def_id)

source

pub fn rendered_const(self, key: impl IntoQueryParam<DefId>) -> &'tcx String

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

source

pub fn rendered_precise_capturing_args( self, key: impl IntoQueryParam<DefId>, ) -> Option<&'tcx [Symbol]>

Gets the rendered precise capturing args for an opaque for use in rustdoc.

source

pub fn impl_parent(self, key: impl IntoQueryParam<DefId>) -> Option<DefId>

[query description - consider adding a doc-comment!] computing specialization parent impl of tcx.def_path_str(def_id)

source

pub fn is_ctfe_mir_available(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] checking if item has CTFE MIR available: tcx.def_path_str(key)

source

pub fn is_mir_available(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] checking if item has MIR available: tcx.def_path_str(key)

source

pub fn own_existential_vtable_entries( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [DefId]

[query description - consider adding a doc-comment!] finding all existential vtable entries for trait tcx.def_path_str(key)

source

pub fn vtable_entries(self, key: PolyTraitRef<'tcx>) -> &'tcx [VtblEntry<'tcx>]

[query description - consider adding a doc-comment!] finding all vtable entries for trait tcx.def_path_str(key.def_id())

source

pub fn first_method_vtable_slot(self, key: TraitRef<'tcx>) -> usize

[query description - consider adding a doc-comment!] finding the slot within the vtable of key.self_ty() for the implementation of key.print_only_trait_name()

source

pub fn supertrait_vtable_slot(self, key: (Ty<'tcx>, Ty<'tcx>)) -> Option<usize>

[query description - consider adding a doc-comment!] finding the slot within vtable for trait object key.1 vtable ptr during trait upcasting coercion from key.0 vtable

source

pub fn vtable_allocation( self, key: (Ty<'tcx>, Option<PolyExistentialTraitRef<'tcx>>), ) -> AllocId

[query description - consider adding a doc-comment!] vtable const allocation for < key.0 as key.1.map(| trait_ref | format! ("{trait_ref}")).unwrap_or("_".to_owned()) >

source

pub fn codegen_select_candidate( self, key: (ParamEnv<'tcx>, TraitRef<'tcx>), ) -> Result<&'tcx ImplSource<'tcx, ()>, CodegenObligationError>

[query description - consider adding a doc-comment!] computing candidate for key.1

source

pub fn all_local_trait_impls( self, key: (), ) -> &'tcx FxIndexMap<DefId, Vec<LocalDefId>>

Return all impl blocks in the current crate.

source

pub fn trait_impls_of(self, key: impl IntoQueryParam<DefId>) -> &'tcx TraitImpls

Given a trait trait_id, return all known impl blocks.

source

pub fn specialization_graph_of( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx Graph, ErrorGuaranteed>

[query description - consider adding a doc-comment!] building specialization graph of trait tcx.def_path_str(trait_id)

source

pub fn object_safety_violations( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [ObjectSafetyViolation]

[query description - consider adding a doc-comment!] determining object safety of trait tcx.def_path_str(trait_id)

source

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

[query description - consider adding a doc-comment!] checking if trait tcx.def_path_str(trait_id) is object safe

source

pub fn param_env(self, key: impl IntoQueryParam<DefId>) -> ParamEnv<'tcx>

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 might want to use reveal_all() method to change modes.

source

pub fn param_env_reveal_all_normalized( self, key: impl IntoQueryParam<DefId>, ) -> ParamEnv<'tcx>

Like param_env, but returns the ParamEnv in Reveal::All mode. Prefer this over tcx.param_env(def_id).with_reveal_all_normalized(tcx), as this method is more efficient.

source

pub fn is_copy_raw(self, key: ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool

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.

source

pub fn is_sized_raw(self, key: ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool

Query backing Ty::is_sized.

source

pub fn is_freeze_raw(self, key: ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool

Query backing Ty::is_freeze.

source

pub fn is_unpin_raw(self, key: ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool

Query backing Ty::is_unpin.

source

pub fn needs_drop_raw(self, key: ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool

Query backing Ty::needs_drop.

source

pub fn needs_async_drop_raw(self, key: ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool

Query backing Ty::needs_async_drop.

source

pub fn has_significant_drop_raw(self, key: ParamEnvAnd<'tcx, Ty<'tcx>>) -> bool

Query backing Ty::has_significant_drop_raw.

source

pub fn has_structural_eq_impl(self, key: Ty<'tcx>) -> bool

Query backing Ty::is_structural_eq_shallow.

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

source

pub fn adt_drop_tys( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx List<Ty<'tcx>>, AlwaysRequiresDrop>

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.

source

pub fn adt_significant_drop_tys( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx List<Ty<'tcx>>, AlwaysRequiresDrop>

A list of types where the ADT requires drop if and only if any of those types has significant drop. A type marked with the attribute rustc_insignificant_dtor is considered to not be significant. A drop is significant if it is implemented by the user or does anything that will have any observable behavior (other than freeing up memory). If the ADT is known to have a significant destructor then Err(AlwaysRequiresDrop) is returned.

source

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

Computes the layout of a type. Note that this implicitly executes in “reveal all” mode, and will normalize the input type.

source

pub fn fn_abi_of_fn_ptr( self, key: ParamEnvAnd<'tcx, (PolyFnSig<'tcx>, &'tcx List<Ty<'tcx>>)>, ) -> Result<&'tcx FnAbi<'tcx, Ty<'tcx>>, &'tcx FnAbiError<'tcx>>

Compute a FnAbi suitable for indirect calls, i.e. to fn pointers.

NB: this doesn’t handle virtual calls - those should use fn_abi_of_instance instead, where the instance is an InstanceKind::Virtual.

source

pub fn fn_abi_of_instance( self, key: ParamEnvAnd<'tcx, (Instance<'tcx>, &'tcx List<Ty<'tcx>>)>, ) -> Result<&'tcx FnAbi<'tcx, Ty<'tcx>>, &'tcx FnAbiError<'tcx>>

Compute a FnAbi suitable for declaring/defining an fn instance, and for direct calls to an fn.

NB: that includes virtual calls, which are represented by “direct calls” to an InstanceKind::Virtual instance (of <dyn Trait as Trait>::fn).

source

pub fn dylib_dependency_formats( self, key: CrateNum, ) -> &'tcx [(CrateNum, LinkagePreference)]

[query description - consider adding a doc-comment!] getting dylib dependency formats of crate

source

pub fn dependency_formats(self, key: ()) -> &'tcx Lrc<Dependencies>

[query description - consider adding a doc-comment!] getting the linkage format of all dependencies

source

pub fn is_compiler_builtins(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if the crate is_compiler_builtins

source

pub fn has_global_allocator(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if the crate has_global_allocator

source

pub fn has_alloc_error_handler(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if the crate has_alloc_error_handler

source

pub fn has_panic_handler(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if the crate has_panic_handler

source

pub fn is_profiler_runtime(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if a crate is #![profiler_runtime]

source

pub fn has_ffi_unwind_calls(self, key: impl IntoQueryParam<LocalDefId>) -> bool

[query description - consider adding a doc-comment!] checking if tcx.def_path_str(key) contains FFI-unwind calls

source

pub fn required_panic_strategy(self, key: CrateNum) -> Option<PanicStrategy>

[query description - consider adding a doc-comment!] getting a crate’s required panic strategy

source

pub fn panic_in_drop_strategy(self, key: CrateNum) -> PanicStrategy

[query description - consider adding a doc-comment!] getting a crate’s configured panic-in-drop strategy

source

pub fn is_no_builtins(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] getting whether a crate has #![no_builtins]

source

pub fn symbol_mangling_version(self, key: CrateNum) -> SymbolManglingVersion

[query description - consider adding a doc-comment!] getting a crate’s symbol mangling version

source

pub fn extern_crate( self, key: impl IntoQueryParam<DefId>, ) -> Option<&'tcx ExternCrate>

[query description - consider adding a doc-comment!] getting crate’s ExternCrateData

source

pub fn specialization_enabled_in(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking whether the crate enabled specialization/min_specialization

source

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

[query description - consider adding a doc-comment!] computing whether impls specialize one another

source

pub fn in_scope_traits_map( self, key: OwnerId, ) -> Option<&'tcx ItemLocalMap<Box<[TraitCandidate]>>>

[query description - consider adding a doc-comment!] getting traits in scope at a block

source

pub fn defaultness(self, key: impl IntoQueryParam<DefId>) -> Defaultness

Returns whether the impl or associated function has the default keyword.

source

pub fn check_well_formed(self, key: OwnerId) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] checking that tcx.def_path_str(key) is well-formed

source

pub fn reachable_non_generics( self, key: CrateNum, ) -> &'tcx DefIdMap<SymbolExportInfo>

[query description - consider adding a doc-comment!] looking up the exported symbols of a crate

source

pub fn is_reachable_non_generic(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] checking whether tcx.def_path_str(def_id) is an exported symbol

source

pub fn is_unreachable_local_definition( self, key: impl IntoQueryParam<LocalDefId>, ) -> bool

[query description - consider adding a doc-comment!] checking whether tcx.def_path_str(def_id) is reachable from outside the crate

source

pub fn upstream_monomorphizations( self, key: (), ) -> &'tcx DefIdMap<UnordMap<GenericArgsRef<'tcx>, CrateNum>>

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, upstream_async_drop_glue_for, or, even better, Instance::upstream_monomorphization().

source

pub fn upstream_monomorphizations_for( self, key: impl IntoQueryParam<DefId>, ) -> Option<&'tcx UnordMap<GenericArgsRef<'tcx>, CrateNum>>

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.

source

pub fn upstream_drop_glue_for( self, key: GenericArgsRef<'tcx>, ) -> Option<CrateNum>

Returns the upstream crate that exports drop-glue for the given type (args 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).

source

pub fn upstream_async_drop_glue_for( self, key: GenericArgsRef<'tcx>, ) -> Option<CrateNum>

Returns the upstream crate that exports async-drop-glue for the given type (args is expected to be a single-item list containing the type one wants async-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 async-drop-glue in any upstream crate would invalidate all functions calling async-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).

source

pub fn foreign_modules( self, key: CrateNum, ) -> &'tcx FxIndexMap<DefId, ForeignModule>

Returns a list of all extern blocks of a crate.

source

pub fn clashing_extern_declarations(self, key: ())

Lint against extern fn declarations having incompatible types.

source

pub fn entry_fn(self, key: ()) -> Option<(DefId, EntryFnType)>

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

source

pub fn proc_macro_decls_static(self, key: ()) -> Option<LocalDefId>

Finds the rustc_proc_macro_decls item of a crate.

source

pub fn crate_hash(self, key: CrateNum) -> Svh

[query description - consider adding a doc-comment!] looking up the hash a crate

source

pub fn crate_host_hash(self, key: CrateNum) -> Option<Svh>

Gets the hash for the host proc macro. Used to support -Z dual-proc-macro.

source

pub fn extra_filename(self, key: CrateNum) -> &'tcx String

Gets the extra data to put in each output filename for a crate. For example, compiling the foo crate with extra-filename=-a creates a libfoo-b.rlib file.

source

pub fn crate_extern_paths(self, key: CrateNum) -> &'tcx Vec<PathBuf>

Gets the paths where the crate came from in the file system.

source

pub fn implementations_of_trait( self, key: (CrateNum, DefId), ) -> &'tcx [(DefId, Option<SimplifiedType>)]

Given a crate and a trait, look up all impls of that trait in the crate. Return (impl_id, self_ty).

source

pub fn crate_incoherent_impls( self, key: (CrateNum, SimplifiedType), ) -> Result<&'tcx [DefId], ErrorGuaranteed>

Collects all incoherent impls for the given crate and type.

Do not call this directly, but instead use the incoherent_impls query. This query is only used to get the data necessary for that query.

source

pub fn native_library( self, key: impl IntoQueryParam<DefId>, ) -> Option<&'tcx NativeLib>

Get the corresponding native library from the native_libraries query

source

pub fn inherit_sig_for_delegation_item( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx [Ty<'tcx>]

[query description - consider adding a doc-comment!] inheriting delegation signature

source

pub fn resolve_bound_vars(self, key: OwnerId) -> &'tcx ResolveBoundVars

Does lifetime resolution on items. Importantly, we can’t resolve lifetimes directly on things like trait methods, because of trait params. See rustc_resolve::late::lifetimes for details.

source

pub fn named_variable_map( self, key: OwnerId, ) -> Option<&'tcx FxIndexMap<ItemLocalId, ResolvedArg>>

[query description - consider adding a doc-comment!] looking up a named region

source

pub fn is_late_bound_map( self, key: OwnerId, ) -> Option<&'tcx FxIndexSet<ItemLocalId>>

[query description - consider adding a doc-comment!] testing if a region is late bound

source

pub fn object_lifetime_default( self, key: impl IntoQueryParam<DefId>, ) -> ObjectLifetimeDefault

For a given item’s generic parameter, gets the default lifetimes to be used for each parameter if a trait object were to be passed for that parameter. For example, for T in struct Foo<'a, T>, this would be 'static. For T in struct Foo<'a, T: 'a>, this would instead be 'a. This query will panic if passed something that is not a type parameter.

source

pub fn late_bound_vars_map( self, key: OwnerId, ) -> Option<&'tcx FxIndexMap<ItemLocalId, Vec<BoundVariableKind>>>

[query description - consider adding a doc-comment!] looking up late bound vars

source

pub fn visibility(self, key: impl IntoQueryParam<DefId>) -> Visibility<DefId>

Computes the visibility of the provided def_id.

If the item from the def_id doesn’t have a visibility, it will panic. For example a generic type parameter will panic if you call this method on it:

use std::fmt::Debug;

pub trait Foo<T: Debug> {}

In here, if you call visibility on T, it’ll panic.

source

pub fn inhabited_predicate_adt( self, key: impl IntoQueryParam<DefId>, ) -> InhabitedPredicate<'tcx>

[query description - consider adding a doc-comment!] computing the uninhabited predicate of {:?}

source

pub fn inhabited_predicate_type(self, key: Ty<'tcx>) -> InhabitedPredicate<'tcx>

Do not call this query directly: invoke Ty::inhabited_predicate instead.

source

pub fn dep_kind(self, key: CrateNum) -> CrateDepKind

[query description - consider adding a doc-comment!] fetching what a dependency looks like

source

pub fn crate_name(self, key: CrateNum) -> Symbol

Gets the name of the crate.

source

pub fn module_children( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [ModChild]

[query description - consider adding a doc-comment!] collecting child items of module tcx.def_path_str(def_id)

source

pub fn extern_mod_stmt_cnum( self, key: impl IntoQueryParam<LocalDefId>, ) -> Option<CrateNum>

[query description - consider adding a doc-comment!] computing crate imported by tcx.def_path_str(def_id)

source

pub fn lib_features(self, key: CrateNum) -> &'tcx LibFeatures

[query description - consider adding a doc-comment!] calculating the lib features defined in a crate

source

pub fn stability_implications( self, key: CrateNum, ) -> &'tcx UnordMap<Symbol, Symbol>

[query description - consider adding a doc-comment!] calculating the implications between #[unstable] features defined in a crate

source

pub fn intrinsic_raw( self, key: impl IntoQueryParam<DefId>, ) -> Option<IntrinsicDef>

Whether the function is an intrinsic

source

pub fn get_lang_items(self, key: ()) -> &'tcx LanguageItems

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

source

pub fn all_diagnostic_items(self, key: ()) -> &'tcx DiagnosticItems

Returns all diagnostic items defined in all crates.

source

pub fn defined_lang_items(self, key: CrateNum) -> &'tcx [(DefId, LangItem)]

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

source

pub fn diagnostic_items(self, key: CrateNum) -> &'tcx DiagnosticItems

Returns the diagnostic items defined in a crate.

source

pub fn missing_lang_items(self, key: CrateNum) -> &'tcx [LangItem]

[query description - consider adding a doc-comment!] calculating the missing lang items in a crate

source

pub fn visible_parent_map(self, key: ()) -> &'tcx DefIdMap<DefId>

The visible parent map is a map from every item to a visible parent. It prefers the shortest visible path to an item. Used for diagnostics, for example path trimming. The parents are modules, enums or traits.

source

pub fn trimmed_def_paths(self, key: ()) -> &'tcx DefIdMap<Symbol>

Collects the “trimmed”, shortest accessible paths to all items for diagnostics. See the provider docs for more info.

source

pub fn missing_extern_crate_item(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] seeing if we’re missing an extern crate item for this crate

source

pub fn used_crate_source(self, key: CrateNum) -> &'tcx Lrc<CrateSource>

[query description - consider adding a doc-comment!] looking at the source for a crate

source

pub fn debugger_visualizers( self, key: CrateNum, ) -> &'tcx Vec<DebuggerVisualizerFile>

Returns the debugger visualizers defined for this crate. NOTE: This query has to be marked eval_always because it reads data directly from disk that is not tracked anywhere else. I.e. it represents a genuine input to the query system.

source

pub fn postorder_cnums(self, key: ()) -> &'tcx [CrateNum]

[query description - consider adding a doc-comment!] generating a postorder list of CrateNums

source

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

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

source

pub fn allocator_kind(self, key: ()) -> Option<AllocatorKind>

[query description - consider adding a doc-comment!] getting the allocator kind for the current crate

source

pub fn alloc_error_handler_kind(self, key: ()) -> Option<AllocatorKind>

[query description - consider adding a doc-comment!] alloc error handler kind for the current crate

source

pub fn upvars_mentioned( self, key: impl IntoQueryParam<DefId>, ) -> Option<&'tcx FxIndexMap<HirId, Upvar>>

[query description - consider adding a doc-comment!] collecting upvars mentioned in tcx.def_path_str(def_id)

source

pub fn maybe_unused_trait_imports(self, key: ()) -> &'tcx FxIndexSet<LocalDefId>

[query description - consider adding a doc-comment!] fetching potentially unused trait imports

source

pub fn names_imported_by_glob_use( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx UnordSet<Symbol>

[query description - consider adding a doc-comment!] finding names imported by glob use for tcx.def_path_str(def_id)

source

pub fn stability_index(self, key: ()) -> &'tcx Index

[query description - consider adding a doc-comment!] calculating the stability index for the local crate

source

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

[query description - consider adding a doc-comment!] fetching all foreign CrateNum instances

source

pub fn used_crates(self, key: ()) -> &'tcx [CrateNum]

[query description - consider adding a doc-comment!] fetching CrateNums for all crates loaded non-speculatively

source

pub fn traits(self, key: CrateNum) -> &'tcx [DefId]

A list of all traits in a crate, used by rustdoc and error reporting.

source

pub fn trait_impls_in_crate(self, key: CrateNum) -> &'tcx [DefId]

[query description - consider adding a doc-comment!] fetching all trait impls in a crate

source

pub fn exported_symbols( self, key: CrateNum, ) -> &'tcx [(ExportedSymbol<'tcx>, SymbolExportInfo)]

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

pub fn collect_and_partition_mono_items( self, key: (), ) -> (&'tcx DefIdSet, &'tcx [CodegenUnit<'tcx>])

[query description - consider adding a doc-comment!] collect_and_partition_mono_items

source

pub fn is_codegened_item(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] determining whether tcx.def_path_str(def_id) needs codegen

source

pub fn codegen_unit(self, key: Symbol) -> &'tcx CodegenUnit<'tcx>

[query description - consider adding a doc-comment!] getting codegen unit {sym}

source

pub fn unused_generic_params( self, key: InstanceKind<'tcx>, ) -> UnusedGenericParams

[query description - consider adding a doc-comment!] determining which generic parameters are unused by tcx.def_path_str(key.def_id())

source

pub fn backend_optimization_level(self, key: ()) -> OptLevel

[query description - consider adding a doc-comment!] optimization level used by backend

source

pub fn output_filenames(self, key: ()) -> &'tcx Arc<OutputFilenames>

Return the filenames where output artefacts shall be stored.

This query returns an &Arc because codegen backends need the value even after the TyCtxt has been destroyed.

source

pub fn normalize_canonicalized_projection_ty( self, key: CanonicalAliasGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, NormalizationResult<'tcx>>>, NoSolution>

Do not call this query directly: Invoke normalize instead.

source

pub fn normalize_canonicalized_weak_ty( self, key: CanonicalAliasGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, NormalizationResult<'tcx>>>, NoSolution>

Do not call this query directly: Invoke normalize instead.

source

pub fn normalize_canonicalized_inherent_projection_ty( self, key: CanonicalAliasGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, NormalizationResult<'tcx>>>, NoSolution>

Do not call this query directly: Invoke normalize instead.

source

pub fn try_normalize_generic_arg_after_erasing_regions( self, key: ParamEnvAnd<'tcx, GenericArg<'tcx>>, ) -> Result<GenericArg<'tcx>, NoSolution>

Do not call this query directly: invoke try_normalize_erasing_regions instead.

source

pub fn implied_outlives_bounds_compat( self, key: CanonicalTyGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>, NoSolution>

[query description - consider adding a doc-comment!] computing implied outlives bounds for goal.value.value

source

pub fn implied_outlives_bounds( self, key: CanonicalTyGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>, NoSolution>

[query description - consider adding a doc-comment!] computing implied outlives bounds v2 for goal.value.value

source

pub fn dropck_outlives( self, key: CanonicalTyGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>, NoSolution>

Do not call this query directly: invoke DropckOutlives::new(dropped_ty)).fully_perform(typeck.infcx) instead.

source

pub fn evaluate_obligation( self, key: CanonicalPredicateGoal<'tcx>, ) -> Result<EvaluationResult, OverflowError>

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

source

pub fn type_op_ascribe_user_type( self, key: CanonicalTypeOpAscribeUserTypeGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, ()>>, NoSolution>

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

source

pub fn type_op_eq( self, key: CanonicalTypeOpEqGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, ()>>, NoSolution>

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

source

pub fn type_op_subtype( self, key: CanonicalTypeOpSubtypeGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, ()>>, NoSolution>

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

source

pub fn type_op_prove_predicate( self, key: CanonicalTypeOpProvePredicateGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, ()>>, NoSolution>

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

source

pub fn type_op_normalize_ty( self, key: CanonicalTypeOpNormalizeGoal<'tcx, Ty<'tcx>>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, Ty<'tcx>>>, NoSolution>

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

source

pub fn type_op_normalize_clause( self, key: CanonicalTypeOpNormalizeGoal<'tcx, Clause<'tcx>>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, Clause<'tcx>>>, NoSolution>

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

source

pub fn type_op_normalize_poly_fn_sig( self, key: CanonicalTypeOpNormalizeGoal<'tcx, PolyFnSig<'tcx>>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, PolyFnSig<'tcx>>>, NoSolution>

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

source

pub fn type_op_normalize_fn_sig( self, key: CanonicalTypeOpNormalizeGoal<'tcx, FnSig<'tcx>>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, FnSig<'tcx>>>, NoSolution>

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

source

pub fn instantiate_and_check_impossible_predicates( self, key: (DefId, GenericArgsRef<'tcx>), ) -> bool

[query description - consider adding a doc-comment!] checking impossible instantiated predicates: tcx.def_path_str(key.0)

source

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

[query description - consider adding a doc-comment!] checking if tcx.def_path_str(key.1) is impossible to reference within tcx.def_path_str(key.0)

source

pub fn method_autoderef_steps( self, key: CanonicalTyGoal<'tcx>, ) -> MethodAutoderefStepsResult<'tcx>

[query description - consider adding a doc-comment!] computing autoderef types for goal.value.value

source

pub fn supported_target_features( self, key: CrateNum, ) -> &'tcx UnordMap<String, Option<Symbol>>

[query description - consider adding a doc-comment!] looking up supported target features

source

pub fn implied_target_features(self, key: Symbol) -> &'tcx Vec<Symbol>

[query description - consider adding a doc-comment!] looking up implied target features

source

pub fn features_query(self, key: ()) -> &'tcx Features

[query description - consider adding a doc-comment!] looking up enabled feature gates

source

pub fn crate_for_resolver(self, key: ()) -> &'tcx Steal<(Crate, AttrVec)>

[query description - consider adding a doc-comment!] the ast before macro expansion and name resolution

source

pub fn resolve_instance_raw( self, key: ParamEnvAnd<'tcx, (DefId, GenericArgsRef<'tcx>)>, ) -> Result<Option<Instance<'tcx>>, ErrorGuaranteed>

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

  • Ok(Some(instance)) on success
  • Ok(None) when the GenericArgsRef are still too generic, and therefore don’t allow finding the final Instance
  • Err(ErrorGuaranteed) 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.
source

pub fn reveal_opaque_types_in_bounds(self, key: Clauses<'tcx>) -> Clauses<'tcx>

[query description - consider adding a doc-comment!] revealing opaque types in {:?}

source

pub fn limits(self, key: ()) -> Limits

[query description - consider adding a doc-comment!] looking up limits

source

pub fn diagnostic_hir_wf_check( self, key: (Predicate<'tcx>, WellFormedLoc), ) -> &'tcx Option<ObligationCause<'tcx>>

Performs an HIR-based well-formed check on the item with the given HirId. If we get an Unimplemented error that matches the provided Predicate, return the cause of the newly created obligation.

This is only used by error-reporting code to get a better cause (in particular, a better span) for an existing error. Therefore, it is best-effort, and may never handle all of the cases that the normal ty::Ty-based wfcheck does. This is fine, because the ty::Ty-based wfcheck is always run.

source

pub fn global_backend_features(self, key: ()) -> &'tcx Vec<String>

The list of backend features computed from CLI flags (-Ctarget-cpu, -Ctarget-feature, --target and similar).

source

pub fn check_validity_requirement( self, key: (ValidityRequirement, ParamEnvAnd<'tcx, Ty<'tcx>>), ) -> Result<bool, &'tcx LayoutError<'tcx>>

[query description - consider adding a doc-comment!] checking validity requirement for key.1.value : key.0

source

pub fn compare_impl_const( self, key: (LocalDefId, DefId), ) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] checking assoc const tcx.def_path_str(key.0) has the same type as trait item

source

pub fn deduced_param_attrs( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [DeducedParamAttrs]

[query description - consider adding a doc-comment!] deducing parameter attributes for tcx.def_path_str(def_id)

[query description - consider adding a doc-comment!] resolutions for documentation links for a module

[query description - consider adding a doc-comment!] traits in scope for documentation links for a module

source

pub fn stripped_cfg_items(self, key: CrateNum) -> &'tcx [StrippedCfgItem]

Get all item paths that were stripped by a #[cfg] in a particular crate. Should not be called for the local crate before the resolver outputs are created, as it is only fed there.

source

pub fn generics_require_sized_self( self, key: impl IntoQueryParam<DefId>, ) -> bool

[query description - consider adding a doc-comment!] check whether the item has a where Self: Sized bound

source

pub fn cross_crate_inlinable(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] whether the item should be made inlinable across crates

Methods from Deref<Target = &'tcx GlobalCtxt<'tcx>>§

source

pub fn enter<F, R>(&'tcx self, f: F) -> R
where F: FnOnce(TyCtxt<'tcx>) -> R,

Installs self in a TyCtxt and ImplicitCtxt for the duration of f.

source

pub fn finish(&self) -> FileEncodeResult

Trait Implementations§

source§

impl<'tcx> Abi<TyCtxt<'tcx>> for Abi

source§

fn rust() -> Self

source§

fn is_rust(self) -> bool

Whether this ABI is extern "Rust".
source§

impl<'tcx> AdtDef<TyCtxt<'tcx>> for AdtDef<'tcx>

source§

fn def_id(self) -> DefId

source§

fn is_struct(self) -> bool

source§

fn struct_tail_ty( self, interner: TyCtxt<'tcx>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>

Returns the type of the struct tail. Read more
source§

fn is_phantom_data(self) -> bool

source§

fn all_field_tys( self, tcx: TyCtxt<'tcx>, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Ty<'tcx>>>

source§

fn sized_constraint( self, tcx: TyCtxt<'tcx>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>

source§

fn is_fundamental(self) -> bool

source§

impl<'tcx> BoundExistentialPredicates<TyCtxt<'tcx>> for &'tcx List<PolyExistentialPredicate<'tcx>>

source§

impl<'tcx> BoundVarLike<TyCtxt<'tcx>> for BoundRegion

source§

impl<'tcx> BoundVarLike<TyCtxt<'tcx>> for BoundTy

source§

impl<'tcx> Clause<TyCtxt<'tcx>> for Clause<'tcx>

source§

fn instantiate_supertrait( self, tcx: TyCtxt<'tcx>, trait_ref: PolyTraitRef<'tcx>, ) -> Self

Performs a instantiation suitable for going from a poly-trait-ref to supertraits that must hold if that poly-trait-ref holds. This is slightly different from a normal instantiation in terms of what happens with bound regions.
source§

fn as_trait_clause(self) -> Option<Binder<I, TraitPredicate<I>>>

source§

fn as_projection_clause(self) -> Option<Binder<I, ProjectionPredicate<I>>>

source§

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

source§

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

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<'tcx> Const<TyCtxt<'tcx>> for Const<'tcx>

source§

fn try_to_target_usize(self, interner: TyCtxt<'tcx>) -> Option<u64>

source§

fn new_infer(tcx: TyCtxt<'tcx>, infer: InferConst) -> Self

source§

fn new_var(tcx: TyCtxt<'tcx>, vid: ConstVid) -> Self

source§

fn new_bound( interner: TyCtxt<'tcx>, debruijn: DebruijnIndex, var: BoundVar, ) -> Self

source§

fn new_anon_bound( tcx: TyCtxt<'tcx>, debruijn: DebruijnIndex, var: BoundVar, ) -> Self

source§

fn new_unevaluated(interner: TyCtxt<'tcx>, uv: UnevaluatedConst<'tcx>) -> Self

source§

fn new_expr(interner: TyCtxt<'tcx>, expr: Expr<'tcx>) -> Self

source§

fn new_error(interner: TyCtxt<'tcx>, guar: ErrorGuaranteed) -> Self

source§

fn new_error_with_message(interner: I, msg: impl ToString) -> Self

source§

fn is_ct_var(self) -> bool

source§

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

source§

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

§

type Deps = DepsType

source§

fn with_stable_hashing_context<R>( self, f: impl FnOnce(StableHashingContext<'_>) -> R, ) -> R

Create a hashing context for hashing new results.
source§

fn dep_graph(&self) -> &DepGraph

Access the DepGraph.
source§

fn profiler(&self) -> &SelfProfilerRef

Access the profiler.
source§

fn sess(&self) -> &Session

Access the compiler session.
source§

fn dep_kind_info(&self, dk: DepKind) -> &DepKindStruct<'tcx>

source§

fn fingerprint_style(self, kind: DepKind) -> FingerprintStyle

source§

fn is_eval_always(self, kind: DepKind) -> bool

Return whether this kind always require evaluation.
source§

fn try_force_from_dep_node( self, dep_node: DepNode, frame: Option<&MarkFrame<'_>>, ) -> bool

Try to force a dep node to execute and see if it’s green. Read more
source§

fn try_load_from_on_disk_cache(self, dep_node: DepNode)

Load data from the on-disk cache.
source§

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

source§

fn fingerprint_style() -> FingerprintStyle

source§

fn to_fingerprint(&self, _: 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).
source§

fn recover(_: TyCtxt<'tcx>, _: &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 fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

fn to_debug_str(&self, _: Tcx) -> String

source§

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

source§

fn fingerprint_style() -> FingerprintStyle

source§

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

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

source§

fn recover(tcx: 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 fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

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

source§

fn fingerprint_style() -> FingerprintStyle

source§

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

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

source§

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 fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

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

source§

fn fingerprint_style() -> FingerprintStyle

source§

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

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

source§

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 fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

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

source§

fn fingerprint_style() -> FingerprintStyle

source§

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

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

source§

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 fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

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

source§

fn fingerprint_style() -> FingerprintStyle

source§

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

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

source§

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 fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

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

source§

fn fingerprint_style() -> FingerprintStyle

source§

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

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

source§

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 fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

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

source§

fn fingerprint_style() -> FingerprintStyle

source§

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

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

source§

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 fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

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

source§

fn fingerprint_style() -> FingerprintStyle

source§

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

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

source§

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 fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

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

§

type Target = &'tcx GlobalCtxt<'tcx>

The resulting type after dereferencing.
source§

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

Dereferences the value.
source§

impl<'tcx> Elaboratable<TyCtxt<'tcx>> for (Clause<'tcx>, Span)

source§

fn predicate(&self) -> Predicate<'tcx>

source§

fn child(&self, clause: Clause<'tcx>) -> Self

source§

fn child_with_derived_cause( &self, clause: Clause<'tcx>, _span: Span, _parent_trait_pred: PolyTraitPredicate<'tcx>, _index: usize, ) -> Self

source§

impl<'tcx> Elaboratable<TyCtxt<'tcx>> for (Predicate<'tcx>, Span)

source§

fn predicate(&self) -> Predicate<'tcx>

source§

fn child(&self, clause: Clause<'tcx>) -> Self

source§

fn child_with_derived_cause( &self, clause: Clause<'tcx>, _span: Span, _parent_trait_pred: PolyTraitPredicate<'tcx>, _index: usize, ) -> Self

source§

impl<'tcx> Elaboratable<TyCtxt<'tcx>> for Clause<'tcx>

source§

fn predicate(&self) -> Predicate<'tcx>

source§

fn child(&self, clause: Clause<'tcx>) -> Self

source§

fn child_with_derived_cause( &self, clause: Clause<'tcx>, _span: Span, _parent_trait_pred: PolyTraitPredicate<'tcx>, _index: usize, ) -> Self

source§

impl<'tcx> Elaboratable<TyCtxt<'tcx>> for Predicate<'tcx>

source§

fn predicate(&self) -> Predicate<'tcx>

source§

fn child(&self, clause: Clause<'tcx>) -> Self

source§

fn child_with_derived_cause( &self, clause: Clause<'tcx>, _span: Span, _parent_trait_pred: PolyTraitPredicate<'tcx>, _index: usize, ) -> Self

source§

impl<'tcx> ExprConst<TyCtxt<'tcx>> for Expr<'tcx>

source§

fn args(self) -> GenericArgsRef<'tcx>

source§

impl<'tcx> FallibleTypeFolder<TyCtxt<'tcx>> for MakeSuggestableFolder<'tcx>

§

type Error = ()

source§

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

source§

fn try_fold_ty(&mut self, t: Ty<'tcx>) -> Result<Ty<'tcx>, Self::Error>

source§

fn try_fold_const(&mut self, c: Const<'tcx>) -> Result<Const<'tcx>, ()>

source§

fn try_fold_binder<T>( &mut self, t: Binder<I, T>, ) -> Result<Binder<I, T>, Self::Error>
where T: TypeFoldable<I>,

source§

fn try_fold_region( &mut self, r: <I as Interner>::Region, ) -> Result<<I as Interner>::Region, Self::Error>

source§

fn try_fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> Result<<I as Interner>::Predicate, Self::Error>

source§

impl<'tcx> FallibleTypeFolder<TyCtxt<'tcx>> for TryNormalizeAfterErasingRegionsFolder<'tcx>

§

type Error = NormalizationError<'tcx>

source§

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

source§

fn try_fold_ty(&mut self, ty: Ty<'tcx>) -> Result<Ty<'tcx>, Self::Error>

source§

fn try_fold_const(&mut self, c: Const<'tcx>) -> Result<Const<'tcx>, Self::Error>

source§

fn try_fold_binder<T>( &mut self, t: Binder<I, T>, ) -> Result<Binder<I, T>, Self::Error>
where T: TypeFoldable<I>,

source§

fn try_fold_region( &mut self, r: <I as Interner>::Region, ) -> Result<<I as Interner>::Region, Self::Error>

source§

fn try_fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> Result<<I as Interner>::Predicate, Self::Error>

source§

impl<'tcx> Features<TyCtxt<'tcx>> for &'tcx Features

source§

impl<'tcx> GenericArg<TyCtxt<'tcx>> for GenericArg<'tcx>

source§

fn as_type(&self) -> Option<<I as Interner>::Ty>

source§

fn expect_ty(&self) -> <I as Interner>::Ty

source§

fn as_const(&self) -> Option<<I as Interner>::Const>

source§

fn expect_const(&self) -> <I as Interner>::Const

source§

fn as_region(&self) -> Option<<I as Interner>::Region>

source§

fn expect_region(&self) -> <I as Interner>::Region

source§

fn is_non_region_infer(self) -> bool

source§

impl<'tcx> GenericArgs<TyCtxt<'tcx>> for GenericArgsRef<'tcx>

source§

fn rebase_onto( self, tcx: TyCtxt<'tcx>, source_ancestor: DefId, target_args: GenericArgsRef<'tcx>, ) -> GenericArgsRef<'tcx>

source§

fn type_at(self, i: usize) -> Ty<'tcx>

source§

fn region_at(self, i: usize) -> Region<'tcx>

source§

fn const_at(self, i: usize) -> Const<'tcx>

source§

fn identity_for_item(tcx: TyCtxt<'tcx>, def_id: DefId) -> GenericArgsRef<'tcx>

source§

fn extend_with_error( tcx: TyCtxt<'tcx>, def_id: DefId, original_args: &[GenericArg<'tcx>], ) -> GenericArgsRef<'tcx>

source§

fn split_closure_args(self) -> ClosureArgsParts<TyCtxt<'tcx>>

source§

fn split_coroutine_closure_args(self) -> CoroutineClosureArgsParts<TyCtxt<'tcx>>

source§

fn split_coroutine_args(self) -> CoroutineArgsParts<TyCtxt<'tcx>>

source§

fn as_closure(self) -> ClosureArgs<I>

source§

fn as_coroutine_closure(self) -> CoroutineClosureArgs<I>

source§

fn as_coroutine(self) -> CoroutineArgs<I>

source§

impl<'tcx> GenericsOf<TyCtxt<'tcx>> for &'tcx Generics

source§

fn count(&self) -> usize

source§

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

source§

impl<'tcx> HasTargetSpec for TyCtxt<'tcx>

source§

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

source§

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

source§

impl<'tcx> HasWasmCAbiOpt for TyCtxt<'tcx>

source§

impl<'tcx> Interner for TyCtxt<'tcx>

§

type DefId = DefId

§

type LocalDefId = LocalDefId

§

type Span = Span

§

type GenericArgs = &'tcx RawList<(), GenericArg<'tcx>>

§

type GenericArgsSlice = &'tcx [GenericArg<'tcx>]

§

type GenericArg = GenericArg<'tcx>

§

type Term = Term<'tcx>

§

type BoundVarKinds = &'tcx RawList<(), BoundVariableKind>

§

type BoundVarKind = BoundVariableKind

§

type PredefinedOpaques = PredefinedOpaques<'tcx>

source§

fn mk_predefined_opaques_in_body( self, data: PredefinedOpaquesData<Self>, ) -> Self::PredefinedOpaques

§

type DefiningOpaqueTypes = &'tcx RawList<(), LocalDefId>

§

type CanonicalGoalEvaluationStepRef = &'tcx CanonicalGoalEvaluationStep<TyCtxt<'tcx>>

§

type CanonicalVars = &'tcx RawList<(), CanonicalVarInfo<TyCtxt<'tcx>>>

source§

fn mk_canonical_var_infos( self, infos: &[CanonicalVarInfo<Self>], ) -> Self::CanonicalVars

§

type ExternalConstraints = ExternalConstraints<'tcx>

source§

fn mk_external_constraints( self, data: ExternalConstraintsData<Self>, ) -> ExternalConstraints<'tcx>

§

type DepNodeIndex = DepNodeIndex

source§

fn with_cached_task<T>(self, task: impl FnOnce() -> T) -> (T, DepNodeIndex)

§

type Ty = Ty<'tcx>

§

type Tys = &'tcx RawList<(), Ty<'tcx>>

§

type FnInputTys = &'tcx [Ty<'tcx>]

§

type ParamTy = ParamTy

§

type BoundTy = BoundTy

§

type PlaceholderTy = Placeholder<BoundTy>

§

type ErrorGuaranteed = ErrorGuaranteed

§

type BoundExistentialPredicates = &'tcx RawList<(), Binder<TyCtxt<'tcx>, ExistentialPredicate<TyCtxt<'tcx>>>>

§

type AllocId = AllocId

§

type Pat = Pattern<'tcx>

§

type Safety = Safety

§

type Abi = Abi

§

type Const = Const<'tcx>

§

type PlaceholderConst = Placeholder<BoundVar>

§

type ParamConst = ParamConst

§

type BoundConst = BoundVar

§

type ValueConst = ValTree<'tcx>

§

type ExprConst = Expr<'tcx>

§

type Region = Region<'tcx>

§

type EarlyParamRegion = EarlyParamRegion

§

type LateParamRegion = LateParamRegion

§

type BoundRegion = BoundRegion

§

type PlaceholderRegion = Placeholder<BoundRegion>

§

type ParamEnv = ParamEnv<'tcx>

§

type Predicate = Predicate<'tcx>

§

type Clause = Clause<'tcx>

§

type Clauses = &'tcx RawList<TypeInfo, Clause<'tcx>>

§

type Tracked<T: Debug + Clone> = WithDepNode<T>

source§

fn mk_tracked<T: Debug + Clone>( self, data: T, dep_node: DepNodeIndex, ) -> Self::Tracked<T>

source§

fn get_tracked<T: Debug + Clone>(self, tracked: &Self::Tracked<T>) -> T

source§

fn with_global_cache<R>( self, mode: SolverMode, f: impl FnOnce(&mut GlobalCache<Self>) -> R, ) -> R

source§

fn expand_abstract_consts<T: TypeFoldable<TyCtxt<'tcx>>>(self, t: T) -> T

§

type GenericsOf = &'tcx Generics

source§

fn generics_of(self, def_id: DefId) -> &'tcx Generics

§

type VariancesOf = &'tcx [Variance]

source§

fn variances_of(self, def_id: DefId) -> Self::VariancesOf

source§

fn type_of(self, def_id: DefId) -> EarlyBinder<'tcx, Ty<'tcx>>

§

type AdtDef = AdtDef<'tcx>

source§

fn adt_def(self, adt_def_id: DefId) -> Self::AdtDef

source§

fn alias_ty_kind(self, alias: AliasTy<'tcx>) -> AliasTyKind

source§

fn alias_term_kind(self, alias: AliasTerm<'tcx>) -> AliasTermKind

source§

fn trait_ref_and_own_args_for_alias( self, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> (TraitRef<'tcx>, &'tcx [GenericArg<'tcx>])

source§

fn mk_args(self, args: &[Self::GenericArg]) -> GenericArgsRef<'tcx>

source§

fn mk_args_from_iter<I, T>(self, args: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<Self::GenericArg, GenericArgsRef<'tcx>>,

source§

fn check_args_compatible( self, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> bool

source§

fn debug_assert_args_compatible(self, def_id: DefId, args: GenericArgsRef<'tcx>)

source§

fn intern_canonical_goal_evaluation_step( self, step: CanonicalGoalEvaluationStep<TyCtxt<'tcx>>, ) -> &'tcx CanonicalGoalEvaluationStep<TyCtxt<'tcx>>

source§

fn mk_type_list_from_iter<I, T>(self, args: I) -> T::Output
where I: Iterator<Item = T>, T: CollectAndApply<Ty<'tcx>, &'tcx List<Ty<'tcx>>>,

source§

fn parent(self, def_id: DefId) -> DefId

source§

fn recursion_limit(self) -> usize

§

type Features = &'tcx Features

source§

fn features(self) -> Self::Features

source§

fn bound_coroutine_hidden_types( self, def_id: DefId, ) -> impl IntoIterator<Item = EarlyBinder<'tcx, Binder<'tcx, Ty<'tcx>>>>

source§

fn fn_sig(self, def_id: DefId) -> EarlyBinder<'tcx, PolyFnSig<'tcx>>

source§

fn coroutine_movability(self, def_id: DefId) -> Movability

source§

fn coroutine_for_closure(self, def_id: DefId) -> DefId

source§

fn generics_require_sized_self(self, def_id: DefId) -> bool

source§

fn item_bounds( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Clause<'tcx>>>

source§

fn predicates_of( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Clause<'tcx>>>

source§

fn own_predicates_of( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Clause<'tcx>>>

source§

fn explicit_super_predicates_of( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = (Clause<'tcx>, Span)>>

source§

fn explicit_implied_predicates_of( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = (Clause<'tcx>, Span)>>

source§

fn has_target_features(self, def_id: DefId) -> bool

source§

fn require_lang_item(self, lang_item: TraitSolverLangItem) -> DefId

source§

fn is_lang_item(self, def_id: DefId, lang_item: TraitSolverLangItem) -> bool

source§

fn as_lang_item(self, def_id: DefId) -> Option<TraitSolverLangItem>

source§

fn associated_type_def_ids( self, def_id: DefId, ) -> impl IntoIterator<Item = DefId>

source§

fn for_each_relevant_impl( self, trait_def_id: DefId, self_ty: Ty<'tcx>, f: impl FnMut(DefId), )

source§

fn has_item_definition(self, def_id: DefId) -> bool

source§

fn impl_is_default(self, impl_def_id: DefId) -> bool

source§

fn impl_trait_ref(self, impl_def_id: DefId) -> EarlyBinder<'tcx, TraitRef<'tcx>>

source§

fn impl_polarity(self, impl_def_id: DefId) -> ImplPolarity

source§

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

source§

fn trait_is_alias(self, trait_def_id: DefId) -> bool

source§

fn trait_is_object_safe(self, trait_def_id: DefId) -> bool

source§

fn trait_is_fundamental(self, def_id: DefId) -> bool

source§

fn trait_may_be_implemented_via_object(self, trait_def_id: DefId) -> bool

source§

fn delay_bug(self, msg: impl ToString) -> ErrorGuaranteed

source§

fn is_general_coroutine(self, coroutine_def_id: DefId) -> bool

source§

fn coroutine_is_async(self, coroutine_def_id: DefId) -> bool

source§

fn coroutine_is_gen(self, coroutine_def_id: DefId) -> bool

source§

fn coroutine_is_async_gen(self, coroutine_def_id: DefId) -> bool

source§

fn layout_is_pointer_like(self, param_env: ParamEnv<'tcx>, ty: Ty<'tcx>) -> bool

§

type UnsizingParams = &'tcx BitSet<u32>

source§

fn unsizing_params_for_adt(self, adt_def_id: DefId) -> Self::UnsizingParams

source§

fn find_const_ty_from_env( self, param_env: ParamEnv<'tcx>, placeholder: Self::PlaceholderConst, ) -> Ty<'tcx>

source§

fn anonymize_bound_vars<T: TypeFoldable<TyCtxt<'tcx>>>( self, binder: Binder<'tcx, T>, ) -> Binder<'tcx, T>

source§

impl<T> IrPrint<T> for TyCtxt<'_>
where T: Copy + for<'a, 'tcx> Lift<TyCtxt<'tcx>, Lifted: Print<'tcx, FmtPrinter<'a, 'tcx>>>,

source§

fn print(t: &T, fmt: &mut Formatter<'_>) -> Result

source§

fn print_debug(t: &T, fmt: &mut Formatter<'_>) -> Result

source§

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for Const<'tcx>

§

type Lifted = Const<'__lifted>

source§

fn lift_to_interner(self, __tcx: TyCtxt<'__lifted>) -> Option<Const<'__lifted>>

source§

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for ConstValue<'tcx>

§

type Lifted = ConstValue<'__lifted>

source§

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<ConstValue<'__lifted>>

source§

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for Instance<'tcx>

§

type Lifted = Instance<'__lifted>

source§

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<Instance<'__lifted>>

source§

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for InstanceKind<'tcx>

§

type Lifted = InstanceKind<'__lifted>

source§

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<InstanceKind<'__lifted>>

source§

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for PrintClosureAsImpl<'tcx>

§

type Lifted = PrintClosureAsImpl<'__lifted>

source§

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<PrintClosureAsImpl<'__lifted>>

source§

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for TraitPredPrintModifiersAndPath<'tcx>

source§

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for TraitRefPrintOnlyTraitName<'tcx>

§

type Lifted = TraitRefPrintOnlyTraitName<'__lifted>

source§

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<TraitRefPrintOnlyTraitName<'__lifted>>

source§

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for TraitRefPrintOnlyTraitPath<'tcx>

§

type Lifted = TraitRefPrintOnlyTraitPath<'__lifted>

source§

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<TraitRefPrintOnlyTraitPath<'__lifted>>

source§

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for TraitRefPrintSugared<'tcx>

§

type Lifted = TraitRefPrintSugared<'__lifted>

source§

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<TraitRefPrintSugared<'__lifted>>

source§

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for UnevaluatedConst<'tcx>

§

type Lifted = UnevaluatedConst<'__lifted>

source§

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<UnevaluatedConst<'__lifted>>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for &'a [ValTree<'a>]

§

type Lifted = &'tcx [ValTree<'tcx>]

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for &'a List<PolyExistentialPredicate<'a>>

§

type Lifted = &'tcx RawList<(), Binder<TyCtxt<'tcx>, ExistentialPredicate<TyCtxt<'tcx>>>>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for &'a List<BoundVariableKind>

§

type Lifted = &'tcx RawList<(), BoundVariableKind>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for &'a List<GenericArg<'a>>

§

type Lifted = &'tcx RawList<(), GenericArg<'tcx>>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for &'a List<Ty<'a>>

§

type Lifted = &'tcx RawList<(), Ty<'tcx>>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for ()

§

type Lifted = ()

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for Abi

§

type Lifted = Abi

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for AllocId

§

type Lifted = AllocId

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Clause<'a>

§

type Lifted = Clause<'tcx>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for ClosureKind

§

type Lifted = ClosureKind

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Const<'a>

§

type Lifted = Const<'tcx>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for ConstAllocation<'a>

§

type Lifted = ConstAllocation<'tcx>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for CtfeProvenance

source§

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

§

type Lifted = DefId

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for GenericArg<'a>

§

type Lifted = GenericArg<'tcx>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for ImplPolarity

§

type Lifted = ImplPolarity

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for IsConstable

§

type Lifted = IsConstable

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Layout<'a>

§

type Lifted = Layout<'tcx>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'tcx, T: Lift<TyCtxt<'tcx>>> Lift<TyCtxt<'tcx>> for Option<T>

§

type Lifted = Option<<T as Lift<TyCtxt<'tcx>>>::Lifted>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for ParamConst

§

type Lifted = ParamConst

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for ParamTy

§

type Lifted = ParamTy

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Pattern<'a>

§

type Lifted = Pattern<'tcx>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Predicate<'a>

§

type Lifted = Predicate<'tcx>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for PredicatePolarity

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for Promoted

§

type Lifted = Promoted

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Region<'a>

§

type Lifted = Region<'tcx>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for ReifyReason

§

type Lifted = ReifyReason

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for Safety

§

type Lifted = Safety

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for Scalar

§

type Lifted = Scalar

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for Size

§

type Lifted = Size

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Term<'a>

§

type Lifted = Term<'tcx>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Ty<'a>

§

type Lifted = Ty<'tcx>

source§

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for bool

§

type Lifted = bool

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for u64

§

type Lifted = u64

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'tcx> Lift<TyCtxt<'tcx>> for usize

§

type Lifted = usize

source§

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

source§

impl<'tcx> ParamEnv<TyCtxt<'tcx>> for ParamEnv<'tcx>

source§

fn reveal(self) -> Reveal

source§

fn caller_bounds(self) -> impl IntoIterator<Item = Clause<'tcx>>

source§

impl<'tcx> PpAnn for TyCtxt<'tcx>

source§

fn nested(&self, state: &mut State<'_>, nested: Nested)

source§

fn pre(&self, _state: &mut State<'_>, _node: AnnNode<'_>)

source§

fn post(&self, _state: &mut State<'_>, _node: AnnNode<'_>)

source§

impl<'tcx> Predicate<TyCtxt<'tcx>> for Predicate<'tcx>

source§

fn as_clause(self) -> Option<Clause<'tcx>>

source§

fn is_coinductive(self, interner: TyCtxt<'tcx>) -> bool

source§

fn allow_normalization(self) -> bool

source§

impl<'tcx> Region<TyCtxt<'tcx>> for Region<'tcx>

source§

fn new_bound( interner: TyCtxt<'tcx>, debruijn: DebruijnIndex, var: BoundRegion, ) -> Self

source§

fn new_anon_bound( tcx: TyCtxt<'tcx>, debruijn: DebruijnIndex, var: BoundVar, ) -> Self

source§

fn new_static(tcx: TyCtxt<'tcx>) -> Self

source§

fn is_bound(self) -> bool

source§

impl<'tcx> Relate<TyCtxt<'tcx>> for &'tcx List<PolyExistentialPredicate<'tcx>>

source§

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: Self, b: Self, ) -> RelateResult<'tcx, Self>

source§

impl<'tcx> Relate<TyCtxt<'tcx>> for GenericArgsRef<'tcx>

source§

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: GenericArgsRef<'tcx>, b: GenericArgsRef<'tcx>, ) -> RelateResult<'tcx, GenericArgsRef<'tcx>>

source§

impl<'tcx> Relate<TyCtxt<'tcx>> for Abi

source§

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( _relation: &mut R, a: Abi, b: Abi, ) -> RelateResult<'tcx, Abi>

source§

impl<'tcx> Relate<TyCtxt<'tcx>> for Const<'tcx>

source§

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: Const<'tcx>, b: Const<'tcx>, ) -> RelateResult<'tcx, Const<'tcx>>

source§

impl<'tcx> Relate<TyCtxt<'tcx>> for Expr<'tcx>

source§

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, ae: Expr<'tcx>, be: