myriad-rs 0.2.0

VM runtime for Polka bytecode, computation core.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
use alloc::string::String;
use polka::{Chunk, Module, HANDLE_NONE};
use crate::memory::mask_bit;
use crate::{cont_slot, VirtualMachine};

#[derive(Clone, Copy)]
pub struct SnapshotHandle {
    pub slot: u32,
    pub generation: u32,
    pub count: usize,
}

impl SnapshotHandle {
    pub const EMPTY: Self = Self { slot: 0, generation: 0, count: 0 };
    pub fn is_empty(&self) -> bool { self.count == 0 }
}

impl VirtualMachine {
    pub(crate) fn current_fn_reg_count(&self, module: &Module) -> usize {
        match module.functions.get(self.current_func) {
            Some(Chunk::Bytecode(b)) => b.reg_count,
            _ => 0,
        }
    }

    pub(crate) fn snapshot_registers(
        &mut self,
        base: usize,
        reg_count: usize,
    ) -> Result<SnapshotHandle, String> {
        let snap = self.snapshot_registers_inner(base, reg_count)?;
        if !snap.is_empty() {
            self.region_record_alloc(snap.slot, snap.generation);
        }
        Ok(snap)
    }

    pub(crate) fn snapshot_registers_off_region(
        &mut self,
        base: usize,
        reg_count: usize,
    ) -> Result<SnapshotHandle, String> {
        self.snapshot_registers_inner(base, reg_count)
    }

    fn snapshot_registers_inner(
        &mut self,
        base: usize,
        reg_count: usize,
    ) -> Result<SnapshotHandle, String> {
        if reg_count == 0 { return Ok(SnapshotHandle::EMPTY); }
        let end = base + reg_count;
        if end > self.registers.len() {
            return Err(format!(
                "snapshot_registers: window [{}..{}] exceeds register array (len {})",
                base, end, self.registers.len()
            ));
        }
        self.mem_charge(reg_count.saturating_mul(8))?;
        let mut init_mask = vec![0u64; (reg_count + 63) / 64];
        for i in 0..reg_count {
            if self.reg_mask_bit(base + i) {
                init_mask[i / 64] |= 1u64 << (i % 64);
            }
        }
        let (slot, generation) = self.heap.try_alloc_with_mask(reg_count, &init_mask)?;
        for i in 0..reg_count {
            let v = self.registers[base + i];
            let is_handle = mask_bit(&init_mask, i);
            if is_handle && v != HANDLE_NONE {
                let s = ((v >> 24) & 0x00FF_FFFF) as u32;
                let g = (v & 0x00FF_FFFF) as u32;
                self.heap.rc_inc(s, g)?;
            }
            self.heap.st(slot, generation, i, v, is_handle)?;
        }
        Ok(SnapshotHandle { slot, generation, count: reg_count })
    }

    pub(crate) fn restore_registers(
        &mut self,
        base: usize,
        snapshot: SnapshotHandle,
    ) -> Result<(), String> {
        if snapshot.is_empty() { return Ok(()); }
        let needed = base + snapshot.count;
        if needed > self.registers.len() {
            self.registers.resize(needed, HANDLE_NONE);
            let mask_words_needed = (needed + 63) / 64;
            if mask_words_needed > self.register_mask.len() {
                self.register_mask.resize(mask_words_needed, 0);
            }
        }
        for i in 0..snapshot.count {
            let (new_val, new_is_handle) = self.heap.ld(snapshot.slot, snapshot.generation, i)?;
            let abs = base + i;
            let old_val = self.registers[abs];
            let old_is_handle = self.reg_mask_bit(abs);
            let stale = if old_is_handle && old_val != HANDLE_NONE {
                let s = ((old_val >> 24) & 0x00FF_FFFF) as u32;
                let g = (old_val & 0x00FF_FFFF) as u32;
                !self.heap.is_live(s, g)
            } else { false };
            if old_is_handle && !stale && old_val != HANDLE_NONE {
                let s = ((old_val >> 24) & 0x00FF_FFFF) as u32;
                let g = (old_val & 0x00FF_FFFF) as u32;
                self.heap.rc_dec(s, g)?;
            }
            if new_is_handle && new_val != HANDLE_NONE {
                let s = ((new_val >> 24) & 0x00FF_FFFF) as u32;
                let g = (new_val & 0x00FF_FFFF) as u32;
                self.heap.rc_inc(s, g)?;
            }
            self.registers[abs] = new_val;
            self.set_reg_mask_bit(abs, new_is_handle);
        }
        Ok(())
    }

    pub(crate) fn write_snapshot_into_cell(
        &mut self,
        cell_slot: u32,
        cell_gen: u32,
        snapshot: SnapshotHandle,
    ) -> Result<(), String> {
        if snapshot.is_empty() {
            self.heap.st(cell_slot, cell_gen, cont_slot::REGS_SNAPSHOT_SLOT, HANDLE_NONE, true)?;
            self.heap.st(cell_slot, cell_gen, cont_slot::REGS_COUNT, 0, false)?;
            return Ok(());
        }
        let handle = polka::Value::from_handle(snapshot.slot, snapshot.generation).raw();
        self.heap.st(cell_slot, cell_gen, cont_slot::REGS_SNAPSHOT_SLOT, handle, true)?;
        self.heap.st(cell_slot, cell_gen, cont_slot::REGS_COUNT, snapshot.count as u64, false)?;
        Ok(())
    }
}

#[cfg(test)]
mod snapshot_tests {
    use super::*;
    use alloc::{vec, vec::Vec};
    use crate::HandlerFrame;
    use polka::{BytecodeChunk, Chunk, Module};

    fn vm() -> VirtualMachine { VirtualMachine::new() }

    fn encode_handle(slot: u32, gen_: u32) -> u64 {
        ((slot as u64) << 24) | (gen_ as u64)
    }

    #[test]
    fn snapshot_handle_empty_is_empty() {
        assert!(SnapshotHandle::EMPTY.is_empty());
    }

    #[test]
    fn snapshot_handle_zero_count_is_empty() {
        let h = SnapshotHandle { slot: 5, generation: 1, count: 0 };
        assert!(h.is_empty());
    }

    #[test]
    fn snapshot_handle_with_count_is_not_empty() {
        let h = SnapshotHandle { slot: 0, generation: 0, count: 1 };
        assert!(!h.is_empty());
    }

    #[test]
    fn snapshot_zero_reg_count_returns_empty() {
        let mut v = vm();
        let snap = v.snapshot_registers(0, 0).expect("zero reg snapshot");
        assert!(snap.is_empty());
    }

    #[test]
    fn snapshot_window_out_of_range_errors() {
        let mut v = vm();
        let r = v.snapshot_registers(0, 100);
        assert!(r.is_err(), "out-of-range window must error");
        let msg = match r { Err(e) => e, _ => unreachable!() };
        assert!(msg.contains("exceeds register array"), "got: {}", msg);
    }

    #[test]
    fn snapshot_captures_int_values() {
        let mut v = vm();
        v.ensure_registers(4);
        v.registers[0] = 11;
        v.registers[1] = 22;
        v.registers[2] = 33;
        v.registers[3] = 44;
        let snap = v.snapshot_registers(0, 4).expect("snapshot");
        assert_eq!(snap.count, 4);
        let (a, _) = v.heap.ld(snap.slot, snap.generation, 0).unwrap();
        let (b, _) = v.heap.ld(snap.slot, snap.generation, 3).unwrap();
        assert_eq!(a, 11);
        assert_eq!(b, 44);
    }

    #[test]
    fn snapshot_captures_handle_and_rc_incs() {
        let mut v = vm();
        let (slot, gen_) = v.heap_alloc(1);
        let handle = encode_handle(slot, gen_);
        v.ensure_registers(1);
        v.registers[0] = handle;
        v.set_reg_mask_bit(0, true);

        let snap = v.snapshot_registers(0, 1).expect("snapshot");
        assert_eq!(snap.count, 1);
        let (raw, is_h) = v.heap.ld(snap.slot, snap.generation, 0).unwrap();
        assert_eq!(raw, handle);
        assert!(is_h);
        // alloc rc=1 + rc_inc from snapshot capture => rc must allow one more dec
        v.heap.rc_dec(slot, gen_).expect("first dec");
        assert!(v.heap.is_live(slot, gen_), "rc must still be > 0 after one dec");
        v.heap.rc_dec(slot, gen_).expect("second dec");
        assert!(!v.heap.is_live(slot, gen_), "cell freed after balancing dec");
    }

    #[test]
    fn snapshot_off_region_does_not_record() {
        let mut v = vm();
        v.region_push();
        v.ensure_registers(2);
        v.registers[0] = 1;
        v.registers[1] = 2;
        let snap = v.snapshot_registers_off_region(0, 2).expect("snapshot");
        let live_before = v.heap_live_count();
        v.region_pop().expect("region pop");
        // off-region snapshot must survive region pop
        assert!(v.heap.is_live(snap.slot, snap.generation));
        assert_eq!(v.heap_live_count(), live_before);
    }

    #[test]
    fn snapshot_in_active_region_freed_at_region_pop() {
        let mut v = vm();
        v.region_push();
        v.ensure_registers(2);
        v.registers[0] = 1;
        v.registers[1] = 2;
        let snap = v.snapshot_registers(0, 2).expect("snapshot");
        assert!(v.heap.is_live(snap.slot, snap.generation));
        v.region_pop().expect("region pop");
        assert!(!v.heap.is_live(snap.slot, snap.generation),
            "region-tracked snapshot must be force-freed at pop");
    }

    #[test]
    fn restore_empty_snapshot_is_no_op() {
        let mut v = vm();
        v.ensure_registers(2);
        v.registers[0] = 99;
        let live_before = v.heap_live_count();
        v.restore_registers(0, SnapshotHandle::EMPTY).expect("restore empty");
        assert_eq!(v.registers[0], 99, "empty restore must not touch registers");
        assert_eq!(v.heap_live_count(), live_before);
    }

    #[test]
    fn restore_extends_register_array_when_needed() {
        let mut v = vm();
        v.ensure_registers(1);
        v.registers[0] = 0;
        // Build a snapshot of count=4 by hand using snapshot_registers,
        // then restore at base=10 to force extension.
        v.ensure_registers(4);
        for i in 0..4 { v.registers[i] = (i * 10) as u64; }
        let snap = v.snapshot_registers(0, 4).expect("snapshot");
        v.restore_registers(10, snap).expect("restore");
        assert!(v.registers.len() >= 14);
        assert_eq!(v.registers[10], 0);
        assert_eq!(v.registers[13], 30);
    }

    #[test]
    fn restore_balances_rc_on_handles() {
        let mut v = vm();
        let (old_slot, old_gen) = v.heap_alloc(1);
        let (new_slot, new_gen) = v.heap_alloc(1);
        v.ensure_registers(1);

        // Snapshot containing the new handle.
        v.registers[0] = encode_handle(new_slot, new_gen);
        v.set_reg_mask_bit(0, true);
        let snap = v.snapshot_registers(0, 1).expect("snapshot");

        // Replace register with old handle (so restore must rc_dec old).
        v.heap.rc_dec(new_slot, new_gen).expect("dec captured rc_inc");
        v.registers[0] = encode_handle(old_slot, old_gen);
        v.set_reg_mask_bit(0, true);

        v.restore_registers(0, snap).expect("restore");

        // After restore: old cell rc_dec'd, new cell rc_inc'd.
        // old was rc=1 → freed. new was rc=1 → rc=2 (one from snap, one from restore).
        assert!(!v.heap.is_live(old_slot, old_gen), "old slot must be freed by rc_dec");
        assert!(v.heap.is_live(new_slot, new_gen));
        assert_eq!(v.registers[0], encode_handle(new_slot, new_gen));
        assert!(v.reg_mask_bit(0));
    }

    #[test]
    fn restore_skips_rc_dec_on_stale_old_value() {
        let mut v = vm();
        let (dead_slot, dead_gen) = v.heap_alloc(1);
        v.heap.force_free(dead_slot, dead_gen).expect("kill the cell");

        v.ensure_registers(1);
        // Snapshot a non-handle value (Int).
        v.registers[0] = 42;
        let snap = v.snapshot_registers(0, 1).expect("snapshot");

        // Put a stale handle into register: mask bit on, but cell is dead.
        v.registers[0] = encode_handle(dead_slot, dead_gen);
        v.set_reg_mask_bit(0, true);

        // Restore must not crash on stale rc_dec.
        v.restore_registers(0, snap).expect("restore handles stale gracefully");
        assert_eq!(v.registers[0], 42);
        assert!(!v.reg_mask_bit(0));
    }

    #[test]
    fn write_snapshot_into_cell_empty() {
        let mut v = vm();
        let (cell_slot, cell_gen) = v.heap_alloc(cont_slot::SIZE);
        v.write_snapshot_into_cell(cell_slot, cell_gen, SnapshotHandle::EMPTY)
            .expect("write empty");
        let (slot_raw, _) = v.heap.ld(cell_slot, cell_gen, cont_slot::REGS_SNAPSHOT_SLOT).unwrap();
        let (count_raw, _) = v.heap.ld(cell_slot, cell_gen, cont_slot::REGS_COUNT).unwrap();
        assert_eq!(slot_raw, HANDLE_NONE);
        assert_eq!(count_raw, 0);
    }

    #[test]
    fn write_snapshot_into_cell_non_empty() {
        let mut v = vm();
        let (cell_slot, cell_gen) = v.heap_alloc(cont_slot::SIZE);
        let snap = SnapshotHandle { slot: 7, generation: 3, count: 5 };
        v.write_snapshot_into_cell(cell_slot, cell_gen, snap).expect("write");
        let (slot_raw, is_h) = v.heap.ld(cell_slot, cell_gen, cont_slot::REGS_SNAPSHOT_SLOT).unwrap();
        let (count_raw, _) = v.heap.ld(cell_slot, cell_gen, cont_slot::REGS_COUNT).unwrap();
        assert_eq!(slot_raw, encode_handle(7, 3));
        assert!(is_h);
        assert_eq!(count_raw, 5);
    }

    #[test]
    fn current_fn_reg_count_for_bytecode() {
        let v = vm();
        let module = Module {
            functions: vec![Chunk::Bytecode(BytecodeChunk {
        lines: vec![],
        src_file: String::new(),
                code: Vec::new(),
                constants: Vec::new(),
                const_mask: Vec::new(),
                reg_count: 42,
                param_count: 0,
                string_constants: Vec::new(),
            })],
            entry: 0,
            flags: 0,

            exports: vec![],
        };
        assert_eq!(v.current_fn_reg_count(&module), 42);
    }

    #[test]
    fn current_fn_reg_count_out_of_range_returns_zero() {
        let mut v = vm();
        v.current_func = 999;
        let module = Module {
            functions: Vec::new(),
            entry: 0,
            flags: 0,

            exports: vec![],
        };
        assert_eq!(v.current_fn_reg_count(&module), 0);
    }

    #[test]
    fn snapshot_then_restore_round_trip_preserves_values() {
        let mut v = vm();
        v.ensure_registers(3);
        v.registers[0] = 1;
        v.registers[1] = 2;
        v.registers[2] = 3;
        let snap = v.snapshot_registers(0, 3).expect("snap");

        v.registers[0] = 100;
        v.registers[1] = 200;
        v.registers[2] = 300;

        v.restore_registers(0, snap).expect("restore");
        assert_eq!(v.registers[0], 1);
        assert_eq!(v.registers[1], 2);
        assert_eq!(v.registers[2], 3);
    }

    #[test]
    fn snapshot_with_handler_frame_cont_path() {
        // Smoke: handler frame holds (cell_slot, cell_gen); write_snapshot_into_cell
        // writes correctly under typical usage.
        let mut v = vm();
        let (cell_slot, cell_gen) = v.heap_alloc(cont_slot::SIZE);
        v.push_handler(HandlerFrame {
            effect_id: 1,
            dispatch_table_slot: None,
            dispatch_table_gen: 0,
            cell_slot,
            cell_gen,
            cells_allocated: vec![(cell_slot, cell_gen)],
            body_frame_index: None,
            pending_return_arm_fn: None,
            pending_return_arm_env: HANDLE_NONE,
            pending_return_arm_env_is_handle: false,
        });

        v.ensure_registers(2);
        v.registers[0] = 77;
        v.registers[1] = 88;
        let snap = v.snapshot_registers_off_region(0, 2).expect("off-region snap");
        v.write_snapshot_into_cell(cell_slot, cell_gen, snap).expect("write into cont");

        let (snap_raw, snap_is_h) = v.heap.ld(cell_slot, cell_gen, cont_slot::REGS_SNAPSHOT_SLOT).unwrap();
        let (count_raw, _) = v.heap.ld(cell_slot, cell_gen, cont_slot::REGS_COUNT).unwrap();
        assert_eq!(snap_raw, encode_handle(snap.slot, snap.generation));
        assert!(snap_is_h);
        assert_eq!(count_raw, 2);
    }
}