pub struct UpdateBatch {
pub account_updates: Vec<TrieNode>,
pub storage_updates: Vec<(H256, Vec<TrieNode>)>,
pub blocks: Vec<Block>,
pub receipts: Vec<(H256, Vec<Receipt>)>,
pub code_updates: Vec<(H256, Code)>,
pub commit_depth: Option<usize>,
pub wait_for_flush: bool,
}Expand description
Batch of updates to apply to the store atomically.
Used during block execution to collect all state changes before committing them to the database in a single transaction.
Fields§
§account_updates: Vec<TrieNode>New nodes to add to the state trie.
storage_updates: Vec<(H256, Vec<TrieNode>)>Storage trie updates per account (keyed by hashed address).
blocks: Vec<Block>Blocks to store.
receipts: Vec<(H256, Vec<Receipt>)>Receipts to store, grouped by block hash.
code_updates: Vec<(H256, Code)>Contract code updates (code hash -> bytecode).
commit_depth: Option<usize>Commit gate for this batch’s trie layers (independent of wait_for_flush).
None: live path (newPayload). The persist worker commits by the canonicalhead - DB_COMMIT_THRESHOLDsafe-commit root.Some(depth): single-canonical-chain execution (batch import, full sync, startup state regeneration). The persist worker commits every layer deeper thandepth(see [Trie::get_commitable_by_depth]), which bounds resident trie layers to ~depth.
wait_for_flush: boolWhen the persist worker acks (independent of commit_depth).
false: ack after staging, so the caller’s next-block execution overlaps this block’s disk flush. Used by the live path and the per-block re-execution paths (regen / full-sync fallback / import tail) — their memory is already bounded bycommit_depth’s depth gate and the persist channel capacity, so waiting per block would only serialize CPU and I/O for no benefit.true: ack after flush, bounding in-flight work to ~1 message. Used by the bespoke batch path, where a single message carries ~1024 blocks (~1 GB of trie diff) and two in flight would be a real memory cost.
Auto Trait Implementations§
impl Freeze for UpdateBatch
impl RefUnwindSafe for UpdateBatch
impl Send for UpdateBatch
impl Sync for UpdateBatch
impl Unpin for UpdateBatch
impl UnsafeUnpin for UpdateBatch
impl UnwindSafe for UpdateBatch
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
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> 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> ⓘ
Converts
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> ⓘ
Converts
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>
Returns the layout of the type.
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
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.