Struct PvmProgram 

pub struct PvmProgram {
    pub code: Vec<u8>,
    pub bitmask: Vec<u8>,
    pub jump_table: Vec<u32>,
    pub mem_cycles: u8,
}

PVM program for execution.

• code is the raw byte-encoded PVM bytecode (JAM Gray Paper Appendix A.5).
• bitmask is the unpacked form (one byte per code position); bitmask[i] == 1 iff a PVM instruction starts at code[i]. Packed bitmasks (1 bit per byte) live only in the serialized blob format upstream; by the time the program reaches this layer the upstream parser has unpacked them.
• jump_table[i] is the target byte offset within code for a branch / jump whose immediate decodes to i.
• mem_cycles is the L/S latency tier (see compute_mem_cycles).

Fields

code: Vec<u8>

bitmask: Vec<u8>

jump_table: Vec<u32>

mem_cycles: u8

Implementations

impl PvmProgram

pub fn new( code: Vec<u8>, bitmask: Vec<u8>, jump_table: Vec<u32>, mem_cycles: u8, ) -> Result<Self, ProgramError>

Construct with validation: bitmask.len() must equal code.len().

pub fn is_insn_start(&self, pc: u32) -> bool

true iff a PVM instruction starts at byte offset pc in code. False if pc is out of range.

pub fn code_len(&self) -> usize

Number of bytecode bytes.

Trait Implementations

impl Clone for PvmProgram

fn clone(&self) -> PvmProgram

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PvmProgram

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

Formats the value using the given formatter.

impl PartialEq for PvmProgram

fn eq(&self, other: &PvmProgram) -> 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 Eq for PvmProgram

impl StructuralPartialEq for PvmProgram