rudus/src/vm.rs

1062 lines
42 KiB
Rust
Raw Normal View History

use crate::base::BaseFn;
use crate::chunk::Chunk;
use crate::op::Op;
use crate::parser::Ast;
use crate::spans::Spanned;
2025-06-19 22:26:44 +00:00
use crate::value::{LFn, Value};
2025-06-26 20:11:35 +00:00
use crate::world::Grasp;
2024-12-23 00:07:42 +00:00
use imbl::{HashMap, Vector};
use num_traits::FromPrimitive;
2024-12-23 00:07:42 +00:00
use std::cell::RefCell;
2025-06-26 20:11:35 +00:00
use std::collections::VecDeque;
2025-05-30 15:44:32 +00:00
use std::fmt;
2024-12-18 04:45:39 +00:00
use std::mem::swap;
2024-12-23 00:07:42 +00:00
use std::rc::Rc;
2025-06-26 20:11:35 +00:00
const MAX_REDUCTIONS: usize = 100;
#[derive(Debug, Clone, PartialEq)]
2025-05-30 15:44:32 +00:00
pub enum Panic {
Str(&'static str),
String(String),
}
impl fmt::Display for Panic {
fn fmt(self: &Panic, f: &mut fmt::Formatter) -> fmt::Result {
match self {
Panic::Str(msg) => write!(f, "{msg}"),
Panic::String(msg) => write!(f, "{msg}"),
}
}
}
#[derive(Debug, Clone, PartialEq)]
pub struct Trace {
pub callee: Spanned<Ast>,
pub caller: Spanned<Ast>,
pub function: Value,
pub arguments: Value,
pub input: &'static str,
pub src: &'static str,
}
2025-06-26 05:28:33 +00:00
#[derive(Debug, Clone, PartialEq)]
2025-06-02 17:34:23 +00:00
pub struct CallFrame {
pub function: Value,
pub arity: u8,
pub stack_base: usize,
pub ip: usize,
}
impl CallFrame {
pub fn chunk(&self) -> &Chunk {
let Value::Fn(ref function) = self.function else {
unreachable!()
};
2025-06-18 18:12:10 +00:00
function.chunk(self.arity)
2025-06-02 17:34:23 +00:00
}
}
impl fmt::Display for CallFrame {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
let Value::Fn(ref function) = self.function else {
unreachable!()
};
2025-06-04 21:53:38 +00:00
write!(
f,
"CallFrame: {}/{} @ {}",
function.name(),
self.arity,
self.ip
)
2025-06-02 17:34:23 +00:00
}
}
2025-06-18 18:12:10 +00:00
fn combine_bytes(high: u8, low: u8) -> usize {
let out = ((high as u16) << 8) + low as u16;
out as usize
}
2025-06-26 05:28:33 +00:00
#[derive(Debug, Clone, PartialEq)]
pub struct Creature {
pub stack: Vec<Value>,
2025-06-02 17:34:23 +00:00
pub call_stack: Vec<CallFrame>,
pub frame: CallFrame,
pub ip: usize,
pub return_register: [Value; 8],
2024-12-23 00:07:42 +00:00
pub matches: bool,
2024-12-27 05:22:01 +00:00
pub match_depth: u8,
pub result: Option<Result<Value, Panic>>,
debug: bool,
last_code: usize,
2025-06-26 05:28:33 +00:00
pub id: &'static str,
2025-06-26 20:11:35 +00:00
pub world: Grasp,
pub mbx: VecDeque<Value>,
pub reductions: usize,
}
2025-06-26 05:28:33 +00:00
impl Creature {
pub fn new(chunk: Chunk, debug: bool) -> Creature {
2025-06-04 21:53:38 +00:00
let lfn = LFn::Defined {
2025-06-02 17:34:23 +00:00
name: "user script",
doc: None,
2025-06-19 22:26:44 +00:00
chunks: vec![chunk],
arities: vec![0],
splat: 0,
2025-06-04 21:53:38 +00:00
closed: RefCell::new(vec![]),
2025-06-02 17:34:23 +00:00
};
2025-06-04 21:53:38 +00:00
let base_fn = Value::Fn(Rc::new(lfn));
2025-06-02 17:34:23 +00:00
let base_frame = CallFrame {
function: base_fn.clone(),
2025-06-03 19:48:13 +00:00
stack_base: 0,
2025-06-02 17:34:23 +00:00
ip: 0,
arity: 0,
};
2025-06-26 05:28:33 +00:00
Creature {
stack: vec![],
2025-06-02 17:34:23 +00:00
call_stack: Vec::with_capacity(64),
frame: base_frame,
ip: 0,
return_register: [const { Value::Nothing }; 8],
2024-12-23 00:07:42 +00:00
matches: false,
2024-12-27 05:22:01 +00:00
match_depth: 0,
result: None,
debug,
last_code: 0,
2025-06-26 05:28:33 +00:00
id: "",
2025-06-26 20:11:35 +00:00
world: None,
mbx: VecDeque::new(),
reductions: 0,
}
}
2025-06-26 20:11:35 +00:00
pub fn reduce(&mut self) {
self.reductions += 1;
}
pub fn receive(&mut self, value: Value) {
self.mbx.push_back(value);
}
2025-06-02 17:34:23 +00:00
pub fn chunk(&self) -> &Chunk {
self.frame.chunk()
}
pub fn push(&mut self, value: Value) {
self.stack.push(value);
}
pub fn pop(&mut self) -> Value {
2024-12-18 06:28:23 +00:00
self.stack.pop().unwrap()
}
pub fn peek(&self) -> &Value {
self.stack.last().unwrap()
}
pub fn print_stack(&self) {
let mut inner = vec![];
for (i, value) in self.stack.iter().enumerate() {
if i == self.frame.stack_base {
inner.push(format!("->{}<-", value.show()))
} else {
inner.push(value.show())
}
}
let inner = inner.join("|");
2025-05-26 13:16:47 +00:00
let register = self
.return_register
.iter()
.map(|val| val.to_string())
.collect::<Vec<_>>()
.join(",");
println!("{:04}: [{inner}] ({register})", self.last_code);
2024-12-18 06:28:23 +00:00
}
fn print_debug(&self) {
self.print_stack();
let mut ip = self.last_code;
2025-06-02 17:34:23 +00:00
self.chunk().dissasemble_instr(&mut ip);
}
pub fn run(&mut self) -> &Result<Value, Panic> {
while self.result.is_none() {
self.interpret();
}
self.result.as_ref().unwrap()
}
pub fn call_stack(&mut self) -> String {
let mut stack = format!(" calling {}", self.frame.function.show());
for frame in self.call_stack.iter().rev() {
let mut name = frame.function.show();
name = if name == "fn user script" {
"user script".to_string()
} else {
name
};
stack = format!("{stack}\n from {name}");
}
stack
}
pub fn panic(&mut self, msg: &'static str) {
let msg = format!("{msg}\nPanic traceback:\n{}", self.call_stack());
self.result = Some(Err(Panic::String(msg)));
2025-05-30 15:44:32 +00:00
}
pub fn panic_with(&mut self, msg: String) {
let msg = format!("{msg}\nPanic traceback:\n{}", self.call_stack());
2025-05-30 15:44:32 +00:00
self.result = Some(Err(Panic::String(msg)));
}
fn get_value_at(&mut self, idx: u8) -> Value {
let idx = idx as usize;
let idx = idx + self.frame.stack_base;
self.stack[idx].clone()
}
fn get_scrutinee(&mut self) -> Value {
let idx = self.stack.len() - self.match_depth as usize - 1;
self.stack[idx].clone()
}
fn read(&mut self) -> u8 {
let code = self.chunk().bytecode[self.ip];
self.ip += 1;
code
}
fn read2(&mut self) -> usize {
let high = self.read();
let low = self.read();
combine_bytes(high, low)
}
fn at_end(&mut self) -> bool {
self.ip >= self.chunk().bytecode.len()
}
pub fn interpret(&mut self) {
2025-06-03 19:48:13 +00:00
loop {
if self.at_end() {
2025-06-03 19:48:13 +00:00
self.result = Some(Ok(self.stack.pop().unwrap()));
return;
}
2025-06-26 20:11:35 +00:00
if self.reductions >= MAX_REDUCTIONS {
return;
}
let code = self.read();
if self.debug {
self.last_code = self.ip - 1;
2025-06-03 19:48:13 +00:00
self.print_debug();
}
let op = Op::from_u8(code).unwrap();
2025-06-03 19:48:13 +00:00
use Op::*;
match op {
Noop => (),
Nil => self.push(Value::Nil),
Nothing => self.push(Value::Nothing),
True => self.push(Value::True),
False => self.push(Value::False),
Msg => {
let _ = self.read();
2025-06-03 19:48:13 +00:00
}
Constant => {
let const_idx = self.read2();
2025-06-20 19:56:13 +00:00
let value = self.chunk().constants[const_idx].clone();
2025-06-03 19:48:13 +00:00
self.push(value);
}
Jump => {
let jump_len = self.read2();
self.ip += jump_len;
2025-06-03 19:48:13 +00:00
}
JumpBack => {
let jump_len = self.read2();
self.ip -= jump_len + 3;
2025-06-03 19:48:13 +00:00
}
JumpIfFalse => {
let jump_len = self.read2();
2025-06-03 19:48:13 +00:00
let cond = self.pop();
match cond {
Value::Nil | Value::False => self.ip += jump_len,
_ => (),
2025-05-28 20:37:25 +00:00
}
2025-06-03 19:48:13 +00:00
}
JumpIfTrue => {
let jump_len = self.read2();
2025-06-03 19:48:13 +00:00
let cond = self.pop();
match cond {
Value::Nil | Value::False => (),
_ => self.ip += jump_len,
2025-05-28 20:37:25 +00:00
}
}
2025-06-03 19:48:13 +00:00
JumpIfZero => {
let jump_len = self.read2();
2025-06-03 19:48:13 +00:00
let cond = self.pop();
match cond {
Value::Number(x) if x <= 0.0 => self.ip += jump_len,
Value::Number(..) => (),
2025-06-03 19:48:13 +00:00
_ => return self.panic("repeat requires a number"),
}
2025-06-03 19:48:13 +00:00
}
Pop => {
self.pop();
}
PopN => {
let n = self.read() as usize;
2025-06-03 19:48:13 +00:00
self.stack.truncate(self.stack.len() - n);
}
PushBinding => {
let idx = self.read();
let value = self.get_value_at(idx);
self.push(value);
2025-06-03 19:48:13 +00:00
}
PushGlobal => {
let key = self.pop();
let Value::Keyword(name) = key else {
unreachable!("internal Ludus error: expected key for global resolution")
};
let value = self.chunk().env.get(name).unwrap();
self.push(value.clone());
}
2025-06-03 19:48:13 +00:00
Store => {
self.return_register[0] = self.pop();
}
StoreN => {
let n = self.read() as usize;
for i in (0..n).rev() {
self.return_register[i] = self.pop();
}
2025-06-03 19:48:13 +00:00
}
Stash => {
self.return_register[0] = self.peek().clone();
}
Load => {
let mut value = Value::Nothing;
swap(&mut self.return_register[0], &mut value);
self.push(value);
}
LoadN => {
let n = self.read() as usize;
for i in 0..n {
2025-06-03 19:48:13 +00:00
let mut value = Value::Nothing;
swap(&mut self.return_register[i], &mut value);
self.push(value);
}
}
2025-06-03 19:48:13 +00:00
ResetMatch => {
self.matches = false;
self.match_depth = 0;
2025-05-26 13:16:47 +00:00
}
UnconditionalMatch => {
2024-12-23 00:07:42 +00:00
self.matches = true;
}
2025-06-03 19:48:13 +00:00
MatchType => {
let as_type = self.pop();
let Value::Keyword(as_type) = as_type else {
unreachable!()
};
let value = self.get_scrutinee();
let val_type = value.type_of();
2025-06-03 19:48:13 +00:00
self.matches = val_type == as_type;
2024-12-23 00:07:42 +00:00
}
2025-06-03 19:48:13 +00:00
MatchNil => {
let value = self.get_scrutinee();
self.matches = value == Value::Nil;
2025-06-03 19:48:13 +00:00
}
MatchTrue => {
let value = self.get_scrutinee();
self.matches = value == Value::True;
2025-06-03 19:48:13 +00:00
}
MatchFalse => {
let value = self.get_scrutinee();
self.matches = value == Value::False;
2025-06-03 19:48:13 +00:00
}
PanicIfNoMatch => {
if !self.matches {
return self.panic("no match");
}
}
MatchConstant => {
let const_idx = self.read2();
let scrutinee = self.get_scrutinee();
// let idx = self.stack.len() - self.match_depth as usize - 1;
self.matches = scrutinee == self.chunk().constants[const_idx];
2025-06-03 19:48:13 +00:00
}
MatchString => {
let pattern_idx = self.read();
let scrutinee = self.get_scrutinee();
self.matches = match scrutinee {
Value::String(str) => self.chunk().string_patterns[pattern_idx as usize]
.re
.is_match(str.as_str()),
Value::Interned(str) => self.chunk().string_patterns[pattern_idx as usize]
.re
.is_match(str),
_ => false,
};
}
PushStringMatches => {
let pattern_idx = self.read();
let pattern_len = self.chunk().string_patterns[pattern_idx as usize]
.words
.len();
// let scrutinee_idx = self.stack.len() - self.match_depth as usize - 1;
let scrutinee = self.get_scrutinee();
let scrutinee = match scrutinee {
Value::String(str) => str.as_ref().clone(),
Value::Interned(str) => str.to_string(),
_ => unreachable!(),
};
let captures = self.chunk().string_patterns[pattern_idx as usize]
.re
.captures(scrutinee.as_str())
.unwrap();
for cap in 0..pattern_len {
self.push(Value::String(Rc::new(captures[cap + 1].to_string())))
}
self.match_depth += pattern_len as u8;
}
2025-06-03 19:48:13 +00:00
MatchTuple => {
// let idx = self.stack.len() - self.match_depth as usize - 1;
let tuple_len = self.read() as usize;
let scrutinee = self.get_scrutinee();
2025-06-03 19:48:13 +00:00
match scrutinee {
Value::Tuple(members) => self.matches = members.len() == tuple_len,
2025-06-03 19:48:13 +00:00
_ => self.matches = false,
};
}
2025-06-19 16:37:29 +00:00
MatchSplattedTuple => {
let patt_len = self.read() as usize;
let scrutinee = self.get_scrutinee();
2025-06-19 16:37:29 +00:00
match scrutinee {
Value::Tuple(members) => self.matches = members.len() >= patt_len,
2025-06-19 16:37:29 +00:00
_ => self.matches = false,
}
}
2025-06-03 19:48:13 +00:00
PushTuple => {
let tuple_len = self.read() as usize;
let tuple_members = self.stack.split_off(self.stack.len() - tuple_len);
2025-06-03 19:48:13 +00:00
let tuple = Value::Tuple(Rc::new(tuple_members));
self.push(tuple);
}
LoadTuple => {
// let idx = self.stack.len() - self.match_depth as usize - 1;
// let tuple = self.stack[idx].clone();
let tuple = self.get_scrutinee();
2025-06-03 19:48:13 +00:00
match tuple {
Value::Tuple(members) => {
for member in members.iter() {
self.push(member.clone());
}
}
2025-06-03 19:48:13 +00:00
_ => return self.panic("internal error: expected tuple"),
};
}
2025-06-19 16:37:29 +00:00
LoadSplattedTuple => {
let load_len = self.read() as usize;
let tuple = self.get_scrutinee();
2025-06-19 16:37:29 +00:00
let Value::Tuple(members) = tuple else {
return self.panic("internal error: expected tuple");
};
for i in 0..load_len - 1 {
self.push(members[i].clone());
}
let mut splatted = Vector::new();
for i in load_len - 1..members.len() {
splatted.push_back(members[i].clone());
}
self.push(Value::List(Box::new(splatted)));
}
2025-06-03 19:48:13 +00:00
PushList => {
2025-06-05 17:05:07 +00:00
self.push(Value::List(Box::new(Vector::new())));
}
AppendList => {
let value = self.pop();
let list = self.pop();
let Value::List(mut list) = list else {
return self.panic("only lists may be splatted into lists");
};
list.push_back(value);
self.push(Value::List(list));
}
ConcatList => {
let splatted = self.pop();
let target = self.pop();
let Value::List(mut target) = target else {
unreachable!()
};
let Value::List(splatted) = splatted else {
return self.panic("only lists may be splatted into lists");
};
target.append(*splatted);
self.push(Value::List(target));
2025-06-03 19:48:13 +00:00
}
MatchList => {
// let idx = self.stack.len() - self.match_depth as usize - 1;
let list_len = self.read() as usize;
let scrutinee = self.get_scrutinee();
2025-06-03 19:48:13 +00:00
match scrutinee {
Value::List(members) => self.matches = members.len() == list_len,
2025-06-03 19:48:13 +00:00
_ => self.matches = false,
};
}
2025-06-19 15:54:26 +00:00
MatchSplattedList => {
// let idx = self.stack.len() - self.match_depth as usize - 1;
let patt_len = self.read() as usize;
let scrutinee = self.get_scrutinee();
2025-06-19 16:18:09 +00:00
match scrutinee {
Value::List(members) => self.matches = members.len() >= patt_len,
2025-06-19 16:18:09 +00:00
_ => self.matches = false,
}
2025-06-19 15:54:26 +00:00
}
2025-06-03 19:48:13 +00:00
LoadList => {
// let idx = self.stack.len() - self.match_depth as usize - 1;
let list = self.get_scrutinee();
2025-06-19 16:06:47 +00:00
match list {
2025-06-03 19:48:13 +00:00
Value::List(members) => {
for member in members.iter() {
self.push(member.clone());
}
}
2025-06-19 16:06:47 +00:00
_ => return self.panic("internal error: expected list"),
2025-06-03 19:48:13 +00:00
};
}
2025-06-19 16:06:47 +00:00
LoadSplattedList => {
let loaded_len = self.read() as usize;
let list = self.get_scrutinee();
2025-06-19 16:06:47 +00:00
let Value::List(members) = list else {
return self.panic("internal error: expected list");
};
for i in 0..loaded_len - 1 {
self.push(members[i].clone());
}
let splatted = Value::List(Box::new(members.skip(loaded_len - 1)));
self.push(splatted);
}
2025-06-03 19:48:13 +00:00
PushDict => {
2025-06-05 17:24:32 +00:00
self.push(Value::Dict(Box::new(HashMap::new())));
}
AppendDict => {
let value = self.pop();
let Value::Keyword(key) = self.pop() else {
unreachable!()
};
let Value::Dict(mut dict) = self.pop() else {
unreachable!()
};
dict.insert(key, value);
self.push(Value::Dict(dict));
}
ConcatDict => {
let Value::Dict(splatted) = self.pop() else {
return self.panic("only dicts may be splatted into dicts");
};
let Value::Dict(target) = self.pop() else {
unreachable!()
};
let union = splatted.union(*target);
self.push(Value::Dict(Box::new(union)));
2025-06-03 19:48:13 +00:00
}
LoadDictValue => {
let dict_idx = self.read();
let dict = match self.get_value_at(dict_idx) {
Value::Dict(dict) => dict,
value => {
println!(
"internal Ludus error in function {}",
self.frame.function.as_fn().name()
);
unreachable!("expected dict, got {value}")
}
2025-06-03 19:48:13 +00:00
};
let Value::Keyword(key) = self.pop() else {
unreachable!("expected keyword, got something else")
2024-12-23 00:07:42 +00:00
};
2025-06-03 19:48:13 +00:00
let value = dict.get(&key).unwrap_or(&Value::Nil);
self.push(value.clone());
2024-12-23 00:07:42 +00:00
}
2025-06-03 19:48:13 +00:00
MatchDict => {
// let idx = self.stack.len() - self.match_depth as usize - 1;
let dict_len = self.read();
let scrutinee = self.get_scrutinee();
2025-06-03 19:48:13 +00:00
match scrutinee {
Value::Dict(members) => self.matches = members.len() == dict_len as usize,
_ => self.matches = false,
};
2024-12-23 00:33:59 +00:00
}
2025-06-19 19:56:23 +00:00
MatchSplattedDict => {
// let idx = self.stack.len() - self.match_depth as usize - 1;
let patt_len = self.read() as usize;
let scrutinee = self.get_scrutinee();
2025-06-19 19:56:23 +00:00
match scrutinee {
Value::Dict(members) => self.matches = members.len() >= patt_len,
2025-06-19 19:56:23 +00:00
_ => self.matches = false,
}
}
DropDictEntry => {
let Value::Keyword(key_to_drop) = self.pop() else {
unreachable!()
};
let Value::Dict(mut dict) = self.pop() else {
unreachable!()
};
dict.remove(key_to_drop);
self.push(Value::Dict(dict));
}
2025-06-03 19:48:13 +00:00
PushBox => {
let val = self.pop();
self.push(Value::Box(Rc::new(RefCell::new(val))));
}
GetKey => {
let key = self.pop();
let Value::Keyword(idx) = key else {
unreachable!()
};
let dict = self.pop();
let value = match dict {
Value::Dict(d) => d.as_ref().get(&idx).unwrap_or(&Value::Nil).clone(),
_ => Value::Nil,
};
self.push(value);
}
JumpIfNoMatch => {
let jump_len = self.read2();
2025-06-18 18:12:10 +00:00
// let jump_len = self.chunk().bytecode[self.ip + 1] as usize;
2025-06-03 19:48:13 +00:00
if !self.matches {
self.ip += jump_len
2025-06-03 19:48:13 +00:00
}
}
JumpIfMatch => {
let jump_len = self.read2();
2025-06-03 19:48:13 +00:00
if self.matches {
self.ip += jump_len;
2025-06-03 19:48:13 +00:00
}
}
TypeOf => {
let val = self.pop();
let type_of = Value::Keyword(val.type_of());
2025-06-03 19:48:13 +00:00
self.push(type_of);
}
ToInt => {
2025-06-03 19:48:13 +00:00
let val = self.pop();
if let Value::Number(x) = val {
self.push(Value::Number(x as usize as f64));
} else {
return self.panic("repeat requires a number");
}
}
Decrement => {
let val = self.pop();
if let Value::Number(x) = val {
self.push(Value::Number(x - 1.0));
} else {
return self.panic("you may only decrement a number");
}
}
Duplicate => {
self.push(self.peek().clone());
}
MatchDepth => {
self.match_depth = self.read();
}
2025-06-03 19:48:13 +00:00
PanicNoWhen | PanicNoMatch => {
return self.panic("no match");
}
Eq => {
let first = self.pop();
let second = self.pop();
if first == second {
self.push(Value::True)
} else {
self.push(Value::False)
}
}
2025-06-03 19:48:13 +00:00
Add => {
let first = self.pop();
let second = self.pop();
if let (Value::Number(x), Value::Number(y)) = (first, second) {
self.push(Value::Number(x + y))
} else {
return self.panic("`add` requires two numbers");
}
}
2025-06-03 19:48:13 +00:00
Sub => {
let first = self.pop();
let second = self.pop();
if let (Value::Number(x), Value::Number(y)) = (first, second) {
self.push(Value::Number(y - x))
} else {
return self.panic("`sub` requires two numbers");
}
}
2025-06-03 19:48:13 +00:00
Mult => {
let first = self.pop();
let second = self.pop();
if let (Value::Number(x), Value::Number(y)) = (first, second) {
self.push(Value::Number(x * y))
} else {
return self.panic("`mult` requires two numbers");
}
}
2025-06-03 19:48:13 +00:00
Div => {
let first = self.pop();
let second = self.pop();
if let (Value::Number(x), Value::Number(y)) = (first, second) {
if x == 0.0 {
return self.panic("division by 0");
}
self.push(Value::Number(y / x))
} else {
return self.panic("`div` requires two numbers");
}
2025-06-03 19:48:13 +00:00
}
Unbox => {
let the_box = self.pop();
let inner = if let Value::Box(b) = the_box {
b.borrow().clone()
} else {
return self.panic("`unbox` requires a box");
};
self.push(inner);
}
BoxStore => {
let new_value = self.pop();
let the_box = self.pop();
if let Value::Box(b) = the_box {
b.replace(new_value.clone());
} else {
return self.panic("`store` requires a box");
}
2025-06-03 19:48:13 +00:00
self.push(new_value);
}
Assert => {
let value = self.stack.last().unwrap();
if let Value::Nil | Value::False = value {
return self.panic("asserted falsy value");
}
2025-06-03 19:48:13 +00:00
}
Get => {
let key = self.pop();
let dict = self.pop();
let value = match (key, dict) {
(Value::Keyword(k), Value::Dict(d)) => {
d.as_ref().get(&k).unwrap_or(&Value::Nil).clone()
}
(Value::Keyword(_), _) => Value::Nil,
_ => return self.panic("keys must be keywords"),
};
self.push(value);
}
At => {
let idx = self.pop();
let ordered = self.pop();
let value = match (ordered, idx) {
(Value::List(l), Value::Number(i)) => {
l.get(i as usize).unwrap_or(&Value::Nil).clone()
}
(Value::Tuple(t), Value::Number(i)) => {
t.get(i as usize).unwrap_or(&Value::Nil).clone()
}
(_, Value::Number(_)) => Value::Nil,
_ => return self.panic("indexes must be numbers"),
};
self.push(value);
}
Not => {
let value = self.pop();
let negated = match value {
Value::Nil | Value::False => Value::True,
_ => Value::False,
};
self.push(negated);
}
Panic => {
let msg = self.pop().show();
2025-06-03 19:48:13 +00:00
return self.panic_with(msg);
}
EmptyString => {
self.push(Value::String(Rc::new("".to_string())));
}
//TODO: don't use the schlemiel's algo here
ConcatStrings => {
let second = self.pop();
let first = self.pop();
let combined = match (first, second) {
(Value::String(first), Value::String(second)) => {
let mut new = first.as_ref().clone();
new.push_str(second.as_str());
Value::String(Rc::new(new))
}
_ => unreachable!(),
};
self.push(combined);
}
Stringify => {
let to_stringify = self.pop();
let the_string = to_stringify.stringify();
2025-06-03 19:48:13 +00:00
let stringified = Value::String(Rc::new(the_string));
self.push(stringified);
}
Partial => {
let arity = self.read();
let the_fn = self.pop();
let Value::Fn(ref inner) = the_fn else {
return self.panic("only functions may be partially applied");
};
let args = self.stack.split_off(self.stack.len() - arity as usize);
let partial = crate::value::Partial {
args,
name: inner.name(),
function: the_fn,
};
self.push(Value::Partial(Rc::new(partial)));
}
TailCall => {
let arity = self.read();
let called = self.pop();
if self.debug {
println!(
"=== tail call into {called}/{arity} from {} ===",
self.frame.function.as_fn().name()
);
}
match called {
Value::Fn(_) => {
if !called.as_fn().accepts(arity) {
return self.panic_with(format!(
"wrong number of arguments to {} passing {arity} args",
called.show()
));
}
// first put the arguments in the register
for i in 0..arity as usize {
self.return_register[arity as usize - i - 1] = self.pop();
}
2025-06-23 21:33:45 +00:00
// self.print_stack();
// then pop everything back to the current stack frame
self.stack.truncate(self.frame.stack_base);
// then push the arguments back on the stack
let mut i = 0;
while i < 8 && self.return_register[i] != Value::Nothing {
let mut value = Value::Nothing;
swap(&mut self.return_register[i], &mut value);
self.push(value);
i += 1;
}
let splat_arity = called.as_fn().splat_arity();
if splat_arity > 0 && arity >= splat_arity {
let splatted_args = self.stack.split_off(
self.stack.len() - (arity - splat_arity) as usize - 1,
);
let gathered_args = Vector::from(splatted_args);
self.push(Value::List(Box::new(gathered_args)));
}
let arity = if splat_arity > 0 {
splat_arity.min(arity)
} else {
arity
};
let mut frame = CallFrame {
function: called,
arity,
stack_base: self.stack.len() - arity as usize,
ip: 0,
};
swap(&mut self.frame, &mut frame);
frame.ip = self.ip;
self.ip = 0;
}
Value::BaseFn(base_fn) => {
let value = match (arity, base_fn) {
(0, BaseFn::Nullary(_, f)) => f(),
(1, BaseFn::Unary(_, f)) => f(&self.pop()),
(2, BaseFn::Binary(_, f)) => {
let y = &self.pop();
let x = &self.pop();
f(x, y)
}
(3, BaseFn::Ternary(_, f)) => {
let z = &self.pop();
let y = &self.pop();
let x = &self.pop();
f(x, y, z)
}
_ => return self.panic("internal ludus error"),
};
2025-06-23 04:27:50 +00:00
// // algo:
// // clear the stack
// self.stack.truncate(self.frame.stack_base);
// // then pop back out to the enclosing stack frame
// self.frame = self.call_stack.pop().unwrap();
// self.ip = self.frame.ip;
// // finally, throw the value on the stack
self.push(value);
2025-06-23 21:33:45 +00:00
// println!(
// "=== returning to {} ===",
// self.frame.function.as_fn().name()
// );
}
Value::Partial(partial) => {
let last_arg = self.pop();
let args = &partial.args;
for arg in args {
if *arg == Value::Nothing {
self.push(last_arg.clone());
} else {
self.push(arg.clone());
}
}
let the_fn = partial.function.clone();
let mut frame = CallFrame {
function: the_fn,
arity: args.len() as u8,
stack_base: self.stack.len() - args.len(),
ip: 0,
};
swap(&mut self.frame, &mut frame);
frame.ip = self.ip;
self.call_stack.push(frame);
self.ip = 0;
}
_ => {
return self.panic_with(format!("{} is not a function", called.show()))
}
}
}
Call => {
let arity = self.read();
2025-06-03 19:48:13 +00:00
let called = self.pop();
2025-06-03 19:48:13 +00:00
if self.debug {
println!("=== calling into {called}/{arity} ===");
}
match called {
Value::Fn(_) => {
if !called.as_fn().accepts(arity) {
return self.panic_with(format!(
"wrong number of arguments to {} passing {arity} args",
called.show()
));
}
let splat_arity = called.as_fn().splat_arity();
2025-06-19 22:26:44 +00:00
if splat_arity > 0 && arity >= splat_arity {
let splatted_args = self.stack.split_off(
self.stack.len() - (arity - splat_arity) as usize - 1,
);
let gathered_args = Vector::from(splatted_args);
self.push(Value::List(Box::new(gathered_args)));
}
let arity = if splat_arity > 0 {
splat_arity.min(arity)
} else {
arity
};
let mut frame = CallFrame {
function: called,
arity,
stack_base: self.stack.len() - arity as usize,
ip: 0,
};
2025-06-03 19:48:13 +00:00
swap(&mut self.frame, &mut frame);
frame.ip = self.ip;
2025-06-03 19:48:13 +00:00
self.call_stack.push(frame);
self.ip = 0;
}
Value::BaseFn(base_fn) => {
let value = match (arity, base_fn) {
(0, BaseFn::Nullary(_, f)) => f(),
(1, BaseFn::Unary(_, f)) => f(&self.pop()),
(2, BaseFn::Binary(_, f)) => {
2025-06-20 16:49:31 +00:00
let y = &self.pop();
let x = &self.pop();
f(x, y)
}
(3, BaseFn::Ternary(_, f)) => {
2025-06-20 16:49:31 +00:00
let z = &self.pop();
let y = &self.pop();
let x = &self.pop();
f(x, y, z)
}
_ => return self.panic("internal ludus error"),
};
self.push(value);
}
Value::Partial(partial) => {
let last_arg = self.pop();
let args = &partial.args;
for arg in args {
if *arg == Value::Nothing {
self.push(last_arg.clone());
} else {
self.push(arg.clone());
}
}
let the_fn = partial.function.clone();
let mut frame = CallFrame {
function: the_fn,
arity: args.len() as u8,
stack_base: self.stack.len() - args.len(),
ip: 0,
};
swap(&mut self.frame, &mut frame);
frame.ip = self.ip;
self.call_stack.push(frame);
self.ip = 0;
}
_ => {
return self.panic_with(format!("{} is not a function", called.show()))
}
2025-05-30 15:44:32 +00:00
}
2025-06-03 19:48:13 +00:00
}
Return => {
if self.debug {
println!("== returning from {} ==", self.frame.function.show())
2025-06-03 19:48:13 +00:00
}
self.frame = self.call_stack.pop().unwrap();
self.ip = self.frame.ip;
let mut value = Value::Nothing;
swap(&mut self.return_register[0], &mut value);
self.push(value);
}
2025-06-03 23:26:01 +00:00
Print => {
println!("{}", self.pop().show());
self.push(Value::Keyword("ok"));
}
2025-06-04 21:53:38 +00:00
SetUpvalue => {
let value = self.pop();
let Value::Fn(lfn) = self.peek() else {
panic!("expected function closing over value, got {}", self.peek());
};
lfn.close(value);
2025-06-04 21:53:38 +00:00
}
GetUpvalue => {
let idx = self.read();
2025-06-04 21:53:38 +00:00
if let Value::Fn(ref inner) = self.frame.function {
self.push(inner.as_ref().upvalue(idx));
} else {
unreachable!();
}
}
2025-05-30 15:44:32 +00:00
}
}
}
}