Struct rustc_codegen_llvm::abi::FnAbi
source · pub(crate) struct FnAbi<'a, Ty> {
pub args: Box<[ArgAbi<'a, Ty>]>,
pub ret: ArgAbi<'a, Ty>,
pub c_variadic: bool,
pub fixed_count: u32,
pub conv: Conv,
pub can_unwind: bool,
}
Expand description
Metadata describing how the arguments to a native function should be passed in order to respect the native ABI.
The signature represented by this type may not match the MIR function signature.
Certain attributes, like #[track_caller]
can introduce additional arguments, which are present in FnAbi
, but not in FnSig
.
While this difference is rarely relevant, it should still be kept in mind.
I will do my best to describe this structure, but these comments are reverse-engineered and may be inaccurate. -NDM
Fields§
§args: Box<[ArgAbi<'a, Ty>]>
The type, layout, and information about how each argument is passed.
ret: ArgAbi<'a, Ty>
The layout, type, and the way a value is returned from this function.
c_variadic: bool
Marks this function as variadic (accepting a variable number of arguments).
fixed_count: u32
The count of non-variadic arguments.
Should only be different from args.len() when c_variadic is true. This can be used to know whether an argument is variadic or not.
conv: Conv
The calling convention of this function.
can_unwind: bool
Indicates if an unwind may happen across a call to this function.
Implementations§
source§impl<'a, Ty> FnAbi<'a, Ty>
impl<'a, Ty> FnAbi<'a, Ty>
pub fn adjust_for_foreign_abi<C>( &mut self, cx: &C, abi: Abi, ) -> Result<(), AdjustForForeignAbiError>
Trait Implementations§
source§impl<'tcx> ArenaAllocatable<'tcx> for FnAbi<'tcx, Ty<'tcx>>
impl<'tcx> ArenaAllocatable<'tcx> for FnAbi<'tcx, Ty<'tcx>>
fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut FnAbi<'tcx, Ty<'tcx>>
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = FnAbi<'tcx, Ty<'tcx>>>, ) -> &'a mut [FnAbi<'tcx, Ty<'tcx>>]
source§impl<'ll, 'tcx> FnAbiLlvmExt<'ll, 'tcx> for FnAbi<'tcx, Ty<'tcx>>
impl<'ll, 'tcx> FnAbiLlvmExt<'ll, 'tcx> for FnAbi<'tcx, Ty<'tcx>>
fn llvm_type(&self, cx: &CodegenCx<'ll, 'tcx>) -> &'ll Type
fn ptr_to_llvm_type(&self, cx: &CodegenCx<'ll, 'tcx>) -> &'ll Type
fn llvm_cconv(&self) -> CallConv
source§fn apply_attrs_llfn(
&self,
cx: &CodegenCx<'ll, 'tcx>,
llfn: &'ll Value,
instance: Option<Instance<'tcx>>,
)
fn apply_attrs_llfn( &self, cx: &CodegenCx<'ll, 'tcx>, llfn: &'ll Value, instance: Option<Instance<'tcx>>, )
source§fn apply_attrs_callsite(
&self,
bx: &mut Builder<'_, 'll, 'tcx>,
callsite: &'ll Value,
)
fn apply_attrs_callsite( &self, bx: &mut Builder<'_, 'll, 'tcx>, callsite: &'ll Value, )
source§impl<'a, Ty, __CTX> HashStable<__CTX> for FnAbi<'a, Ty>where
__CTX: HashStableContext,
Ty: HashStable<__CTX>,
impl<'a, Ty, __CTX> HashStable<__CTX> for FnAbi<'a, Ty>where
__CTX: HashStableContext,
Ty: HashStable<__CTX>,
fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )
impl<'a, Ty> Eq for FnAbi<'a, Ty>where
Ty: Eq,
impl<'a, Ty> StructuralPartialEq for FnAbi<'a, Ty>
Auto Trait Implementations§
impl<'a, Ty> Freeze for FnAbi<'a, Ty>where
Ty: Freeze,
impl<'a, Ty> RefUnwindSafe for FnAbi<'a, Ty>where
Ty: RefUnwindSafe,
impl<'a, Ty> Send for FnAbi<'a, Ty>where
Ty: Send,
impl<'a, Ty> Sync for FnAbi<'a, Ty>where
Ty: Sync,
impl<'a, Ty> Unpin for FnAbi<'a, Ty>where
Ty: Unpin,
impl<'a, Ty> UnwindSafe for FnAbi<'a, Ty>where
Ty: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s 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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.