Struct Fn 

pub struct Fn<'a> { /* private fields */ }

Emit instructions for one bytecode function.

Implementations

impl<'a> Fn<'a>

pub fn local(&mut self) -> Reg

Allocate a fresh local register.

pub fn reg(&mut self, index: u8) -> Reg

Bind to an explicit register index without growing the declared frame.

pub fn reserve(&mut self, count: u8)

Ensure the register file is at least count slots wide.

pub fn window(&mut self, count: u8) -> RegWindow

Allocate count contiguous locals; useful before Self::native_n.

pub fn load_i32(&mut self, n: i32) -> Reg

Load a small immediate into a new local.

Examples found in repository

examples/throughput.rs (line 14)

fn trivial_chunk() -> byteflow::Chunk {
    let mut program = Program::new("throughput");
    program.function("worker", 0, |f| {
        let one = f.load_i32(1);
        f.return_(one);
    });
    program.build()
}

examples/jit_loop.rs (line 15)

fn loop_chunk(iterations: i32) -> byteflow::Chunk {
    let mut program = Program::new("jit-loop");
    program.function("main", 0, |f| {
        let limit = f.load_int(i64::from(iterations));
        let counter = f.load_i32(0);
        f.while_lt(counter, limit, |f| f.add_imm(counter, 1));
        f.return_(counter);
    });
    program.build()
}

pub fn load_int(&mut self, n: i64) -> Reg

Load a constant-pool integer into a new local.

Examples found in repository

examples/jit_loop.rs (line 14)

fn loop_chunk(iterations: i32) -> byteflow::Chunk {
    let mut program = Program::new("jit-loop");
    program.function("main", 0, |f| {
        let limit = f.load_int(i64::from(iterations));
        let counter = f.load_i32(0);
        f.while_lt(counter, limit, |f| f.add_imm(counter, 1));
        f.return_(counter);
    });
    program.build()
}

pub fn set(&mut self, reg: Reg, imm: i32)

Store an immediate into an existing register.

pub fn mov(&mut self, dst: Reg, src: Reg)

dst = src

pub fn add(&mut self, lhs: Reg, rhs: Reg) -> Reg

dst = lhs + rhs into a new local.

pub fn add_imm(&mut self, dst: Reg, imm: i32)

dst += imm in place.

Examples found in repository

examples/jit_loop.rs (line 16)

fn loop_chunk(iterations: i32) -> byteflow::Chunk {
    let mut program = Program::new("jit-loop");
    program.function("main", 0, |f| {
        let limit = f.load_int(i64::from(iterations));
        let counter = f.load_i32(0);
        f.while_lt(counter, limit, |f| f.add_imm(counter, 1));
        f.return_(counter);
    });
    program.build()
}

pub fn sub(&mut self, lhs: Reg, rhs: Reg) -> Reg

pub fn mul(&mut self, lhs: Reg, rhs: Reg) -> Reg

pub fn div(&mut self, lhs: Reg, rhs: Reg) -> Reg

pub fn modulo(&mut self, lhs: Reg, rhs: Reg) -> Reg

pub fn neg(&mut self, src: Reg) -> Reg

pub fn eq(&mut self, lhs: Reg, rhs: Reg) -> Reg

pub fn eq_imm(&mut self, lhs: Reg, imm: i32) -> Reg

pub fn lt(&mut self, lhs: Reg, rhs: Reg) -> Reg

pub fn le(&mut self, lhs: Reg, rhs: Reg) -> Reg

pub fn while_lt<F>(&mut self, counter: Reg, limit: Reg, body: F)

where F: FnOnce(&mut Fn<'_>),

While counter < limit (interpreter Branch skips on falsy).

Examples found in repository

examples/jit_loop.rs (line 16)

fn loop_chunk(iterations: i32) -> byteflow::Chunk {
    let mut program = Program::new("jit-loop");
    program.function("main", 0, |f| {
        let limit = f.load_int(i64::from(iterations));
        let counter = f.load_i32(0);
        f.while_lt(counter, limit, |f| f.add_imm(counter, 1));
        f.return_(counter);
    });
    program.build()
}

pub fn label(&mut self) -> Label

pub fn bind(&mut self, label: Label)

pub fn jump(&mut self, label: Label)

pub fn branch_if_falsy(&mut self, cond: Reg, target: Label)

Branch when cond is falsy (0).

pub fn return_(&mut self, value: Reg)

Examples found in repository

examples/throughput.rs (line 15)

fn trivial_chunk() -> byteflow::Chunk {
    let mut program = Program::new("throughput");
    program.function("worker", 0, |f| {
        let one = f.load_i32(1);
        f.return_(one);
    });
    program.build()
}

examples/jit_loop.rs (line 17)

fn loop_chunk(iterations: i32) -> byteflow::Chunk {
    let mut program = Program::new("jit-loop");
    program.function("main", 0, |f| {
        let limit = f.load_int(i64::from(iterations));
        let counter = f.load_i32(0);
        f.while_lt(counter, limit, |f| f.add_imm(counter, 1));
        f.return_(counter);
    });
    program.build()
}

pub fn call(&mut self, function: FuncId, argc: u8) -> Reg

pub fn halt(&mut self)

pub fn yield_(&mut self)

pub fn sleep(&mut self, millis: Reg)

pub fn exit(&mut self, reg: Reg)

pub fn self_cap(&mut self) -> Reg

Self Cap (SEND / ASK target for this flow).

Despite the opcode name (SelfPid), the value is a crate::Value::Cap, not a Pid. In BEAM terms this is closer to a reply address grant than to self() — use Self::hop_sender on a delivered hop for authenticated origin identity.

pub fn self_address(&mut self) -> Reg

Alias for Self::self_cap — preferred name when coming from BEAM.

pub fn spawn(&mut self, function: FuncId, argc: u8) -> Reg

pub fn spawn_at(&mut self, dst: Reg, function: FuncId, argc: u8)

Spawn into an explicit destination register (e.g. reg(255)).

pub fn send(&mut self, target_cap: Reg, msg: Reg)

pub fn receive(&mut self) -> Reg

pub fn receive_timeout(&mut self, millis: Reg) -> Reg

pub fn receive_match(&mut self, tag: Reg) -> Reg

pub fn receive_match_imm(&mut self, tag: u16) -> Reg

pub fn ask(&mut self, target_cap: Reg, msg: Reg) -> Reg

RPC hop: deliver msg to target_cap, wait for correlated reply.

If the target exits first, dest is a crate::TAG_SYS_EXIT hop (not a hang).

pub fn ask_timeout(&mut self, target_cap: Reg, msg: Reg, millis: Reg) -> Reg

Like Self::ask, but writes Unit into the dest if millis elapses.

pub fn monitor(&mut self, target_cap: Reg) -> Reg

One-way watch: when the flow addressed by target_cap exits, this flow receives a crate::TAG_SYS_DOWN hop. Returns a monitor ref (Int).

pub fn demonitor(&mut self, monitor: Reg)

pub fn link(&mut self, target_cap: Reg) -> Reg

Bidirectional link: abnormal exit of either side kills the peer.

pub fn unlink(&mut self, link: Reg)

pub fn trap(&mut self, code: i32)

pub fn native1_from(&mut self, src: Reg, native: u32) -> Reg

Copy src, call a one-arg native, return the result in a new local.

The source register is preserved (CallNative clobbers its argument slot).

pub fn native1_on(&mut self, src: Reg, native: u32)

Side-effect native on a copy of src (e.g. print).

pub fn native_n(&mut self, base: Reg, native: u32, argc: u8)

CallNative with argc args already at base..base+argc.

pub fn call_native(&mut self, base: Reg, native: u32, argc: u8)

Call a native with argc args already in base..base+argc.

pub fn call_native0(&mut self, native: u32) -> Reg

Call a zero-arg native; returns the result register.

pub fn hop(&mut self, request_id: Reg, tag: i32, payload: Reg) -> Reg

Build an outgoing Atomic Hop (request_id, tag, payload).

The scheduler overwrites sender and mints reply_cap on Self::send / Self::ask — do not forge a sender (see crate::docs::security).

pub fn hop_sender(&mut self, msg: Reg) -> Reg

Extract authenticated origin from a delivered hop (Value::Pid).

pub fn hop_request_id(&mut self, msg: Reg) -> Reg

pub fn hop_tag(&mut self, msg: Reg) -> Reg

pub fn hop_payload(&mut self, msg: Reg) -> Reg

pub fn hop_reply_cap(&mut self, msg: Reg) -> Reg

Reply address grant minted for the original sender (Value::Cap).

pub fn reply_to(&mut self, req: Reg, tag: i32, payload: Reg) -> Reg

Build a reply hop echoing request_id from req.

pub fn send_reply(&mut self, req: Reg, tag: i32, payload: Reg)

Reply to req via its reply_cap (typical server pattern).

pub fn make_msg( &mut self, native_index: u32, sender: Reg, request_id: Reg, tag: i32, payload: Reg, ) -> Reg

Build a Value::Message via make_msg at native_index.

Prefer Self::hop for outgoing messages. This low-level helper keeps the explicit sender slot for security regressions and legacy bytecode. Index 2 in crate::std_native_map. Args are packed into a contiguous four-register window; returns the message register.