Struct LegacyAnalyzedBytecode 

pub struct LegacyAnalyzedBytecode { /* private fields */ }

Available on crate feature evm only.

Legacy analyzed bytecode represents the original bytecode format used in Ethereum.

Jump Table

A jump table maps valid jump destinations in the bytecode.

While other EVM implementations typically analyze bytecode and cache jump tables at runtime, Revm requires the jump table to be pre-computed and contained alongside the code, and present with the bytecode when executing.

Bytecode Padding

Legacy bytecode can be padded with up to 33 zero bytes at the end. This padding ensures that:

• the bytecode always ends with a valid STOP (0x00) opcode.
• there aren’t incomplete immediates, meaning we can skip bounds checks in PUSH* instructions.

The non-padded length is stored in order to be able to copy the original bytecode.

Gas safety

When bytecode is created through CREATE, CREATE2, or contract creation transactions, it undergoes analysis to generate its jump table. This analysis is O(n) on side of bytecode that is expensive, but the high gas cost required to store bytecode in the database is high enough to cover the expense of doing analysis and generate the jump table.

Implementations

impl LegacyAnalyzedBytecode

pub fn analyze(bytecode: Bytes) -> LegacyAnalyzedBytecode

Analyzes the bytecode.

See LegacyAnalyzedBytecode for more details.

pub fn new( bytecode: Bytes, original_len: usize, jump_table: JumpTable, ) -> LegacyAnalyzedBytecode

Creates new analyzed bytecode.

Prefer instantiating using analyze instead.

Panics

• If original_len is greater than bytecode.len()
• If jump table length is less than original_len.
• If bytecode is empty.

pub fn bytecode(&self) -> &Bytes

Returns a reference to the bytecode.

The bytecode is padded with 32 zero bytes.

pub fn original_len(&self) -> usize

Returns original bytes length.

pub fn original_bytes(&self) -> Bytes

Returns original bytes without padding.

pub fn original_byte_slice(&self) -> &[u8]

Returns original bytes without padding.

pub fn jump_table(&self) -> &JumpTable

Returns JumpTable of analyzed bytes.

Trait Implementations

impl Clone for LegacyAnalyzedBytecode

fn clone(&self) -> LegacyAnalyzedBytecode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LegacyAnalyzedBytecode

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Default for LegacyAnalyzedBytecode

fn default() -> LegacyAnalyzedBytecode

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for LegacyAnalyzedBytecode

fn deserialize<__D>( __deserializer: __D, ) -> Result<LegacyAnalyzedBytecode, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for LegacyAnalyzedBytecode

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for LegacyAnalyzedBytecode

fn cmp(&self, other: &LegacyAnalyzedBytecode) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for LegacyAnalyzedBytecode

fn eq(&self, other: &LegacyAnalyzedBytecode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for LegacyAnalyzedBytecode

fn partial_cmp(&self, other: &LegacyAnalyzedBytecode) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for LegacyAnalyzedBytecode

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for LegacyAnalyzedBytecode

impl StructuralPartialEq for LegacyAnalyzedBytecode

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 64 bytes