Struct rustc_codegen_llvm::abi::FnAbi
source · pub 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.
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 LLVM types of each argument.
ret: ArgAbi<'a, Ty>
LLVM return type.
c_variadic: bool
§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
§can_unwind: bool
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
fn apply_attrs_llfn(&self, cx: &CodegenCx<'ll, 'tcx>, llfn: &'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)
source§impl<'a, Ty> PartialEq for FnAbi<'a, Ty>where
Ty: PartialEq,
impl<'a, Ty> PartialEq for FnAbi<'a, Ty>where
Ty: PartialEq,
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> DynSend for FnAbi<'a, Ty>where
Ty: DynSend,
impl<'a, Ty> DynSync for FnAbi<'a, Ty>where
Ty: DynSync,
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§
§impl<T> AnyEq for T
impl<T> AnyEq for T
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
Mutably borrows from an owned value. Read more
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
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).
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
This method tries to recover the query key from the given
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
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<T> Filterable for T
impl<T> Filterable for T
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<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
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> 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.