pub struct Code {
pub hash: H256,
/* private fields */
}Fields§
§hash: H256Implementations§
Source§impl Code
impl Code
pub fn from_bytecode_unchecked(code: Bytes, hash: H256) -> Self
Sourcepub fn from_bytecode(code: Bytes, crypto: &dyn Crypto) -> Self
pub fn from_bytecode(code: Bytes, crypto: &dyn Crypto) -> Self
code is the logical, unpadded bytecode; BYTECODE_PADDING STOP bytes are
appended internally by from_parts_unchecked.
Sourcepub fn from_parts_unchecked(
hash: H256,
code: &[u8],
jumpdests: Arc<[u8]>,
) -> Self
pub fn from_parts_unchecked( hash: H256, code: &[u8], jumpdests: Arc<[u8]>, ) -> Self
Builds a Code from precomputed parts. The caller must guarantee hash
and jumpdests correspond to code; neither is recomputed or validated.
code is the logical, unpadded bytecode: this function appends
BYTECODE_PADDING STOP bytes and records the original length in
bytecode_len. Never pass a pre-padded buffer, or the logical length and
every JUMPDEST/PUSH offset derived from it would be wrong.
Sourcepub fn from_initcode_buffer(buffer: InitcodeBuffer) -> Self
pub fn from_initcode_buffer(buffer: InitcodeBuffer) -> Self
Builds initcode from the initcode buffer was set to, in the
buffer’s allocations: the padding is appended in place and the buffer becomes the
bytecode, and the jump-destination bitmap reuses the buffer’s when that is the right
size. Code::into_initcode_buffer hands them back for the next initcode. The hash is
the same placeholder any initcode gets.
Unlike other code, initcode keeps the bitmap it was built in, so it can be handed back with the bytecode: even when it marks nothing, instead of the shared empty one, and even when it is longer than the code needs, zeroed past its end.
Sourcepub fn into_initcode_buffer(self) -> InitcodeBuffer
pub fn into_initcode_buffer(self) -> InitcodeBuffer
Hands back the allocations of initcode built by Code::from_initcode_buffer, each
only when nothing else references it. The bytecode buffer comes back empty, so handing
back any other Code’s is harmless too: no stale bytecode can be built from again.
Sourcepub fn compute_jumpdests(code: &[u8]) -> Arc<[u8]> ⓘ
pub fn compute_jumpdests(code: &[u8]) -> Arc<[u8]> ⓘ
Builds the Code::jumpdests bitmap: the bit of every JUMPDEST that is not a
PUSH immediate.
On aarch64, and on x86_64 with SSSE3, this runs without a data-dependent branch
(see by_block), because a scan that branches on each opcode stalls on every
misprediction, and random bytecode mispredicts on most bytes. execution-specs#3631
builds such initcode on purpose. Other targets are mostly the zkVM guests, which
have no branch predictor and would only pay for the extra instructions, so they
keep the plain scan (jumpdests_by_opcode).
Sourcepub fn is_valid_jumpdest(&self, offset: usize) -> bool
pub fn is_valid_jumpdest(&self, offset: usize) -> bool
Whether offset is a valid jump destination, i.e. it holds a JUMPDEST that is
not part of a PUSH immediate. Offsets past the bytecode are not valid.
Sourcepub fn jumpdests(&self) -> &[u8] ⓘ
pub fn jumpdests(&self) -> &[u8] ⓘ
The raw Code::jumpdests bitmap, for persisting it alongside the bytecode.
pub fn code(&self) -> &[u8] ⓘ
pub fn code_bytes(&self) -> Bytes
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
Sourcepub fn dispatch_buf(&self) -> &[u8] ⓘ
pub fn dispatch_buf(&self) -> &[u8] ⓘ
Returns the padded bytecode buffer (real code + BYTECODE_PADDING trailing
STOPs) used by the opcode dispatch loop to read opcodes without bounds checks.
Use Code::code for the real, unpadded bytecode.
Sourcepub fn size(&self) -> usize
pub fn size(&self) -> usize
Estimates the size of the Code struct in bytes (including stack size and heap allocation).
Note: an estimate. It ignores allocator overhead and the Arc/Bytes control
blocks, so it slightly under-counts, and a shared allocation is attributed in
full to every entry holding it.
§Returns
usize - Estimated size in bytes
Trait Implementations§
Source§impl<'de> Deserialize<'de> for Code
impl<'de> Deserialize<'de> for Code
Source§fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>
fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>
impl Eq for Code
impl StructuralPartialEq for Code
Auto Trait Implementations§
impl !Freeze for Code
impl RefUnwindSafe for Code
impl Send for Code
impl Sync for Code
impl Unpin for Code
impl UnsafeUnpin for Code
impl UnwindSafe for Code
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
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,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
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<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out indicating that a T is niched.