summaryrefslogtreecommitdiff
path: root/src/runtime/eval.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/runtime/eval.c')
-rw-r--r--src/runtime/eval.c107
1 files changed, 107 insertions, 0 deletions
diff --git a/src/runtime/eval.c b/src/runtime/eval.c
new file mode 100644
index 0000000..f5eba97
--- /dev/null
+++ b/src/runtime/eval.c
@@ -0,0 +1,107 @@
+#include <lcq/pit/runtime/eval.h>
+
+pit_value pit_eval(pit_runtime *rt, pit_value top) {
+ i64 expr_stack_reset = rt->expr_stack->next;
+ i64 result_stack_reset = rt->result_stack->next;
+ i64 program_reset = rt->program->next;
+ // pit_vec_reset(pit_annotated_ref)(rt->backtrace);
+ if (pit_vec_push(pit_value)(rt->expr_stack, top) < 0)
+ pit_error(rt, "evaluation stack overflow");
+ /* first, convert the expression tree into "polish notation" in program */
+ while (rt->expr_stack->next > expr_stack_reset) {
+ pit_value cur = PIT_NIL;
+ if (rt->error != PIT_NIL) goto end;
+ if (pit_vec_pop(pit_value)(rt->expr_stack, &cur) < 0)
+ pit_error(rt, "evaluation stack underflow");
+ if (pit_value_is_cons(rt, cur)) { /* compound expressions: function/macro application special forms */
+ pit_value fsym = pit_value_cons_car(rt, cur);
+ bool is_symbol = pit_value_is_symbol(rt, fsym);
+ pit_annotated_ref *ann = pit_annotation_get(rt, pit_value_as_ref(rt, cur));
+ if (is_symbol && pit_symtab_is_symbol_special_form(rt, fsym)) { /* special forms */
+ pit_value f = pit_symtab_fget(rt, fsym);
+ pit_value args = pit_value_cons_cdr(rt, cur);
+ /* special forms are nativefuncs that directly manipulate the stacks
+ basically macros, but we don't need to evaluate the return value */
+ pit_value_apply(rt, f, args);
+ } else if (is_symbol && pit_symtab_is_symbol_macro(rt, fsym)) { /* macros */
+ pit_value f = pit_symtab_fget(rt, fsym);
+ pit_value args = pit_value_cons_cdr(rt, cur);
+ pit_value res = pit_value_apply(rt, f, args);
+ if (pit_vec_push(pit_value)(rt->expr_stack, res) < 0)
+ pit_error(rt, "evaluation stack overflow");
+ } else { /* normal functions */
+ pit_value args = pit_value_cons_cdr(rt, cur);
+ i64 argcount = 0;
+ while (args != PIT_NIL) {
+ if (pit_vec_push(pit_value)(rt->expr_stack, pit_value_cons_car(rt, args)) < 0)
+ pit_error(rt, "evaluation stack overflow");
+ args = pit_value_cons_cdr(rt, args);
+ argcount += 1;
+ }
+ if (!is_symbol) {
+ if (pit_vec_push(pit_value)(rt->expr_stack, fsym) < 0)
+ pit_error(rt, "evaluation stack overflow");
+ }
+ pit_runtime_eval_program_push_apply(rt, rt->program, argcount, ann);
+ if (is_symbol) {
+ pit_value f = pit_symtab_fget(rt, fsym);
+ pit_runtime_eval_program_push_literal(rt, rt->program, f);
+ }
+ }
+ } else if (pit_value_is_symbol(rt, cur)) { /* unquoted symbols: variable lookup */
+ pit_symtab_entry *ent = pit_symtab_lookup(rt, cur);
+ if (ent->is_keyword) {
+ pit_runtime_eval_program_push_literal(rt, rt->program, cur);
+ } else {
+ pit_runtime_eval_program_push_literal(rt, rt->program, pit_symtab_get(rt, cur));
+ }
+ } else { /* other expressions evaluate to themselves! */
+ pit_runtime_eval_program_push_literal(rt, rt->program, cur);
+ }
+ }
+ /* then, execute the polish notation program from right to left
+ this has the nice consequence of putting the arguments in the right order */
+ for (i64 idx = rt->program->next - 1; idx >= program_reset; --idx) {
+ pit_runtime_eval_ins *ent = pit_vec_get(pit_runtime_eval_ins)(rt->program, idx);
+ if (ent == NULL) pit_error(rt, "evaluation program invalid");
+ if (rt->error != PIT_NIL) goto end;
+ switch (ent->sort) {
+ case PIT_RUNTIME_EVAL_INS_LITERAL:
+ if (pit_vec_push(pit_value)(rt->result_stack, ent->in.literal) < 0)
+ pit_error(rt, "evaluation result stack overflow");
+ break;
+ case PIT_RUNTIME_EVAL_INS_APPLY: {
+ pit_value f = PIT_NIL;
+ pit_value args = PIT_NIL;
+ if (pit_vec_pop(pit_value)(rt->result_stack, &f) < 0)
+ pit_error(rt, "evaluation result stack underflow");
+ for (i64 i = 0; i < ent->in.apply.arity; ++i) {
+ pit_value a = PIT_NIL;
+ if (pit_vec_pop(pit_value)(rt->result_stack, &a) < 0)
+ pit_error(rt, "evaluation result stack underflow");
+ args = pit_value_cons(rt, a, args);
+ }
+ if (ent->in.apply.annotation != NULL) {
+ rt->source_line = ent->in.apply.annotation->annotation.line;
+ rt->source_column = ent->in.apply.annotation->annotation.column;
+ pit_vec_push(pit_annotated_ref)(rt->backtrace, *ent->in.apply.annotation);
+ }
+ if (pit_vec_push(pit_value)(rt->result_stack, pit_value_apply(rt, f, args)) < 0)
+ pit_error(rt, "evaluation result stack underflow");
+ break;
+ }
+ default:
+ pit_error(rt, "unknown program entry");
+ goto end;
+ }
+ }
+end: {
+ pit_value ret = PIT_NIL;
+ if (pit_vec_pop(pit_value)(rt->result_stack, &ret) < 0)
+ pit_error(rt, "evaluation result stack underflow");
+ rt->expr_stack->next = expr_stack_reset;
+ rt->result_stack->next = result_stack_reset;
+ rt->program->next = program_reset;
+ return ret;
+ }
+}