pub struct LegacyAnalyzedBytecode { /* private fields */ }
Expand description
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
All legacy bytecode is padded with 33 zero bytes at the end. This padding ensures the bytecode always ends with a valid STOP (0x00) opcode. The reason for 33 bytes padding (and not one byte) is handling the edge cases where a PUSH32 opcode appears at the end of the original bytecode without enough remaining bytes for its immediate data. Original bytecode length is stored in order to be able to copy 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§
Source§impl LegacyAnalyzedBytecode
impl LegacyAnalyzedBytecode
Sourcepub fn new(bytecode: Bytes, original_len: usize, jump_table: JumpTable) -> Self
pub fn new(bytecode: Bytes, original_len: usize, jump_table: JumpTable) -> Self
Creates new analyzed bytecode.
§Panics
- If
original_len
is greater thanbytecode.len()
- If jump table length is less than
original_len
. - If last bytecode byte is not
0x00
or if bytecode is empty.
Sourcepub fn bytecode(&self) -> &Bytes
pub fn bytecode(&self) -> &Bytes
Returns a reference to the bytecode.
The bytecode is padded with 32 zero bytes.
Sourcepub fn original_len(&self) -> usize
pub fn original_len(&self) -> usize
Returns original bytes length.
Sourcepub fn original_bytes(&self) -> Bytes
pub fn original_bytes(&self) -> Bytes
Returns original bytes without padding.
Sourcepub fn original_byte_slice(&self) -> &[u8] ⓘ
pub fn original_byte_slice(&self) -> &[u8] ⓘ
Returns original bytes without padding.
Sourcepub fn jump_table(&self) -> &JumpTable
pub fn jump_table(&self) -> &JumpTable
Returns JumpTable of analyzed bytes.
Trait Implementations§
Source§impl Clone for LegacyAnalyzedBytecode
impl Clone for LegacyAnalyzedBytecode
Source§fn clone(&self) -> LegacyAnalyzedBytecode
fn clone(&self) -> LegacyAnalyzedBytecode
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl Debug for LegacyAnalyzedBytecode
impl Debug for LegacyAnalyzedBytecode
Source§impl Default for LegacyAnalyzedBytecode
impl Default for LegacyAnalyzedBytecode
Source§impl<'de> Deserialize<'de> for LegacyAnalyzedBytecode
impl<'de> Deserialize<'de> for LegacyAnalyzedBytecode
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Source§impl Hash for LegacyAnalyzedBytecode
impl Hash for LegacyAnalyzedBytecode
Source§impl Ord for LegacyAnalyzedBytecode
impl Ord for LegacyAnalyzedBytecode
Source§fn cmp(&self, other: &LegacyAnalyzedBytecode) -> Ordering
fn cmp(&self, other: &LegacyAnalyzedBytecode) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl PartialEq for LegacyAnalyzedBytecode
impl PartialEq for LegacyAnalyzedBytecode
Source§impl PartialOrd for LegacyAnalyzedBytecode
impl PartialOrd for LegacyAnalyzedBytecode
Source§impl Serialize for LegacyAnalyzedBytecode
impl Serialize for LegacyAnalyzedBytecode
impl Eq for LegacyAnalyzedBytecode
impl StructuralPartialEq for LegacyAnalyzedBytecode
Auto Trait Implementations§
impl !Freeze for LegacyAnalyzedBytecode
impl RefUnwindSafe for LegacyAnalyzedBytecode
impl Send for LegacyAnalyzedBytecode
impl Sync for LegacyAnalyzedBytecode
impl Unpin for LegacyAnalyzedBytecode
impl UnwindSafe for LegacyAnalyzedBytecode
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,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<T> Conv for T
impl<T> Conv for T
§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
key
and return true
if they are equal.§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self
to use its Binary
implementation when Debug
-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self
to use its Display
implementation when
Debug
-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self
to use its LowerExp
implementation when
Debug
-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self
to use its LowerHex
implementation when
Debug
-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self
to use its Octal
implementation when Debug
-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self
to use its Pointer
implementation when
Debug
-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self
to use its UpperExp
implementation when
Debug
-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self
to use its UpperHex
implementation when
Debug
-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self
, then passes self.as_ref()
into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self
, then passes self.deref()
into the pipe function.§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target
of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap()
only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut()
only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref()
only in debug builds, and is erased in release
builds.