* value and re-evaluate it
*/
prev = ao_lisp_poly_stack(ao_lisp_stack->prev);
- ao_lisp_stack->state = eval_sexpr;
ao_lisp_stack->sexprs = prev->sexprs;
DBGI(".. start macro\n");
DBGI(".. frame "); DBG_POLY(ao_lisp_frame_poly(ao_lisp_frame_current)); DBG("\n");
break;
case AO_LISP_LAMBDA:
- ao_lisp_stack->state = eval_sexpr;
DBGI(".. frame "); DBG_POLY(ao_lisp_frame_poly(ao_lisp_frame_current)); DBG("\n");
- ao_lisp_v = ao_lisp_lambda_eval();
- DBGI(".. sexpr "); DBG_POLY(ao_lisp_v); DBG("\n");
+ ao_lisp_stack->state = eval_progn;
+ v = ao_lisp_lambda_eval();
+ ao_lisp_stack->sexprs = v;
+ DBGI(".. sexprs "); DBG_POLY(ao_lisp_stack->sexprs); DBG("\n");
DBGI(".. frame "); DBG_POLY(ao_lisp_frame_poly(ao_lisp_frame_current)); DBG("\n");
break;
}
ao_lisp_stack->state = eval_cond_test;
if (!ao_lisp_stack_push())
return 0;
- ao_lisp_stack->state = eval_sexpr;
}
return 1;
}
DBGI(".. saved frame "); DBG_POLY(ao_lisp_stack->frame); DBG("\n");
if (ao_lisp_v) {
struct ao_lisp_cons *car = ao_lisp_poly_cons(ao_lisp_poly_cons(ao_lisp_stack->sexprs)->car);
- struct ao_lisp_cons *c = ao_lisp_poly_cons(car->cdr);
+ ao_poly c = car->cdr;
if (c) {
- ao_lisp_stack->state = eval_sexpr;
- ao_lisp_v = c->car;
+ ao_lisp_stack->state = eval_progn;
+ ao_lisp_stack->sexprs = c;
} else
ao_lisp_stack->state = eval_val;
} else {
} else {
ao_lisp_v = ao_lisp_poly_cons(ao_lisp_stack->sexprs)->car;
ao_lisp_stack->sexprs = ao_lisp_poly_cons(ao_lisp_stack->sexprs)->cdr;
+
+ /* If there are more sexprs to do, then come back here, otherwise
+ * return the value of the last one by just landing in eval_sexpr
+ */
if (ao_lisp_stack->sexprs) {
ao_lisp_stack->state = eval_progn;
if (!ao_lisp_stack_push())
ao_lisp_stack->state = eval_while_test;
if (!ao_lisp_stack_push())
return 0;
- ao_lisp_stack->state = eval_sexpr;
}
return 1;
}
if (ao_lisp_v) {
ao_lisp_v = ao_lisp_poly_cons(ao_lisp_stack->sexprs)->cdr;
- if (ao_lisp_v)
- ao_lisp_v = ao_lisp_poly_cons(ao_lisp_v)->car;
ao_lisp_stack->state = eval_while;
if (!ao_lisp_stack_push())
return 0;
+ ao_lisp_stack->state = eval_progn;
+ ao_lisp_stack->sexprs = ao_lisp_v;
}
else
ao_lisp_stack->state = eval_val;
{
DBGI("macro: "); DBG_POLY(ao_lisp_v); DBG(" sexprs "); DBG_POLY(ao_lisp_stack->sexprs); DBG("\n");
+ if (ao_lisp_v == AO_LISP_NIL)
+ ao_lisp_abort();
if (ao_lisp_poly_type(ao_lisp_v) == AO_LISP_CONS) {
*ao_lisp_poly_cons(ao_lisp_stack->sexprs) = *ao_lisp_poly_cons(ao_lisp_v);
ao_lisp_v = ao_lisp_stack->sexprs;
if (!lambda)
return AO_LISP_NIL;
- if (!ao_lisp_check_argc(_ao_lisp_atom_lambda, code, 2, 2))
- return AO_LISP_NIL;
+ if (!code->cdr)
+ return ao_lisp_error(AO_LISP_INVALID, "missing parameters to lambda");
+
if (!ao_lisp_check_argt(_ao_lisp_atom_lambda, code, 0, AO_LISP_CONS, 1))
return AO_LISP_NIL;
f = 0;
int args_wanted;
int args_provided;
int f;
- struct ao_lisp_cons *vals
+ struct ao_lisp_cons *vals;
DBGI("lambda "); DBG_POLY(ao_lisp_lambda_poly(lambda)); DBG("\n");
args = ao_lisp_poly_cons(ao_lisp_arg(code, 0));
vals = ao_lisp_poly_cons(cons->cdr);
+ next_frame->prev = lambda->frame;
+ ao_lisp_frame_current = next_frame;
+ ao_lisp_stack->frame = ao_lisp_frame_poly(ao_lisp_frame_current);
+
switch (lambda->args) {
case AO_LISP_FUNC_LAMBDA:
for (f = 0; f < args_wanted; f++) {
vals = ao_lisp_poly_cons(vals->cdr);
}
ao_lisp_cons_free(cons);
+ cons = NULL;
break;
case AO_LISP_FUNC_LEXPR:
case AO_LISP_FUNC_NLAMBDA:
args = ao_lisp_poly_cons(args->cdr);
vals = ao_lisp_poly_cons(vals->cdr);
}
- DBGI("bind "); DBG_POLY(args->car); DBG(" = "); DBG_POLY(); DBG("\n");
+ DBGI("bind "); DBG_POLY(args->car); DBG(" = "); DBG_POLY(ao_lisp_cons_poly(vals)); DBG("\n");
next_frame->vals[f].atom = args->car;
next_frame->vals[f].val = ao_lisp_cons_poly(vals);
break;
+ default:
+ break;
}
- next_frame->prev = lambda->frame;
DBGI("eval frame: "); DBG_POLY(ao_lisp_frame_poly(next_frame)); DBG("\n");
- ao_lisp_frame_current = next_frame;
- ao_lisp_stack->frame = ao_lisp_frame_poly(ao_lisp_frame_current);
DBG_STACK();
- return ao_lisp_arg(code, 1);
+ DBGI("eval code: "); DBG_POLY(code->cdr); DBG("\n");
+ return code->cdr;
}