2 * Copyright © 2016 Keith Packard <keithp@keithp.com>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation, either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
18 builtin_size(void *addr)
21 return sizeof (struct ao_lisp_builtin);
25 builtin_mark(void *addr)
31 builtin_move(void *addr)
36 const struct ao_lisp_type ao_lisp_builtin_type = {
42 #ifdef AO_LISP_MAKE_CONST
43 char *ao_lisp_builtin_name(enum ao_lisp_builtin_id b) {
47 char *ao_lisp_args_name(uint8_t args) {
52 static const ao_poly builtin_names[] = {
53 [builtin_eval] = _ao_lisp_atom_eval,
54 [builtin_read] = _ao_lisp_atom_read,
55 [builtin_lambda] = _ao_lisp_atom_lambda,
56 [builtin_lexpr] = _ao_lisp_atom_lexpr,
57 [builtin_nlambda] = _ao_lisp_atom_nlambda,
58 [builtin_macro] = _ao_lisp_atom_macro,
59 [builtin_car] = _ao_lisp_atom_car,
60 [builtin_cdr] = _ao_lisp_atom_cdr,
61 [builtin_cons] = _ao_lisp_atom_cons,
62 [builtin_last] = _ao_lisp_atom_last,
63 [builtin_length] = _ao_lisp_atom_length,
64 [builtin_quote] = _ao_lisp_atom_quote,
65 [builtin_set] = _ao_lisp_atom_set,
66 [builtin_setq] = _ao_lisp_atom_setq,
67 [builtin_cond] = _ao_lisp_atom_cond,
68 [builtin_progn] = _ao_lisp_atom_progn,
69 [builtin_while] = _ao_lisp_atom_while,
70 [builtin_print] = _ao_lisp_atom_print,
71 [builtin_patom] = _ao_lisp_atom_patom,
72 [builtin_plus] = _ao_lisp_atom_2b,
73 [builtin_minus] = _ao_lisp_atom_2d,
74 [builtin_times] = _ao_lisp_atom_2a,
75 [builtin_divide] = _ao_lisp_atom_2f,
76 [builtin_mod] = _ao_lisp_atom_25,
77 [builtin_equal] = _ao_lisp_atom_3d,
78 [builtin_less] = _ao_lisp_atom_3c,
79 [builtin_greater] = _ao_lisp_atom_3e,
80 [builtin_less_equal] = _ao_lisp_atom_3c3d,
81 [builtin_greater_equal] = _ao_lisp_atom_3e3d,
82 [builtin_pack] = _ao_lisp_atom_pack,
83 [builtin_unpack] = _ao_lisp_atom_unpack,
84 [builtin_flush] = _ao_lisp_atom_flush,
85 [builtin_delay] = _ao_lisp_atom_delay,
86 [builtin_led] = _ao_lisp_atom_led,
87 [builtin_save] = _ao_lisp_atom_save,
88 [builtin_restore] = _ao_lisp_atom_restore,
89 [builtin_call_cc] = _ao_lisp_atom_call2fcc,
94 ao_lisp_builtin_name(enum ao_lisp_builtin_id b) {
95 if (b < _builtin_last)
96 return ao_lisp_poly_atom(builtin_names[b])->name;
100 static const ao_poly ao_lisp_args_atoms[] = {
101 [AO_LISP_FUNC_LAMBDA] = _ao_lisp_atom_lambda,
102 [AO_LISP_FUNC_LEXPR] = _ao_lisp_atom_lexpr,
103 [AO_LISP_FUNC_NLAMBDA] = _ao_lisp_atom_nlambda,
104 [AO_LISP_FUNC_MACRO] = _ao_lisp_atom_macro,
108 ao_lisp_args_name(uint8_t args)
110 args &= AO_LISP_FUNC_MASK;
111 if (args < sizeof ao_lisp_args_atoms / sizeof ao_lisp_args_atoms[0])
112 return ao_lisp_poly_atom(ao_lisp_args_atoms[args])->name;
118 ao_lisp_builtin_print(ao_poly b)
120 struct ao_lisp_builtin *builtin = ao_lisp_poly_builtin(b);
121 printf("%s", ao_lisp_builtin_name(builtin->func));
125 ao_lisp_check_argc(ao_poly name, struct ao_lisp_cons *cons, int min, int max)
129 while (cons && argc <= max) {
131 cons = ao_lisp_poly_cons(cons->cdr);
133 if (argc < min || argc > max)
134 return ao_lisp_error(AO_LISP_INVALID, "%s: invalid arg count", ao_lisp_poly_atom(name)->name);
135 return _ao_lisp_atom_t;
139 ao_lisp_arg(struct ao_lisp_cons *cons, int argc)
146 cons = ao_lisp_poly_cons(cons->cdr);
152 ao_lisp_check_argt(ao_poly name, struct ao_lisp_cons *cons, int argc, int type, int nil_ok)
154 ao_poly car = ao_lisp_arg(cons, argc);
156 if ((!car && !nil_ok) || ao_lisp_poly_type(car) != type)
157 return ao_lisp_error(AO_LISP_INVALID, "%s: invalid type for arg %d", ao_lisp_poly_atom(name)->name, argc);
158 return _ao_lisp_atom_t;
162 ao_lisp_car(struct ao_lisp_cons *cons)
164 if (!ao_lisp_check_argc(_ao_lisp_atom_car, cons, 1, 1))
166 if (!ao_lisp_check_argt(_ao_lisp_atom_car, cons, 0, AO_LISP_CONS, 0))
168 return ao_lisp_poly_cons(cons->car)->car;
172 ao_lisp_cdr(struct ao_lisp_cons *cons)
174 if (!ao_lisp_check_argc(_ao_lisp_atom_cdr, cons, 1, 1))
176 if (!ao_lisp_check_argt(_ao_lisp_atom_cdr, cons, 0, AO_LISP_CONS, 0))
178 return ao_lisp_poly_cons(cons->car)->cdr;
182 ao_lisp_cons(struct ao_lisp_cons *cons)
185 if(!ao_lisp_check_argc(_ao_lisp_atom_cons, cons, 2, 2))
187 if (!ao_lisp_check_argt(_ao_lisp_atom_cons, cons, 1, AO_LISP_CONS, 1))
189 car = ao_lisp_arg(cons, 0);
190 cdr = ao_lisp_arg(cons, 1);
191 return ao_lisp_cons_poly(ao_lisp_cons_cons(car, ao_lisp_poly_cons(cdr)));
195 ao_lisp_last(struct ao_lisp_cons *cons)
198 if (!ao_lisp_check_argc(_ao_lisp_atom_last, cons, 1, 1))
200 if (!ao_lisp_check_argt(_ao_lisp_atom_last, cons, 0, AO_LISP_CONS, 1))
202 l = ao_lisp_arg(cons, 0);
204 struct ao_lisp_cons *list = ao_lisp_poly_cons(l);
213 ao_lisp_length(struct ao_lisp_cons *cons)
215 if (!ao_lisp_check_argc(_ao_lisp_atom_length, cons, 1, 1))
217 if (!ao_lisp_check_argt(_ao_lisp_atom_length, cons, 0, AO_LISP_CONS, 1))
219 return ao_lisp_int_poly(ao_lisp_cons_length(ao_lisp_poly_cons(ao_lisp_arg(cons, 0))));
223 ao_lisp_quote(struct ao_lisp_cons *cons)
225 if (!ao_lisp_check_argc(_ao_lisp_atom_quote, cons, 1, 1))
227 return ao_lisp_arg(cons, 0);
231 ao_lisp_set(struct ao_lisp_cons *cons)
233 if (!ao_lisp_check_argc(_ao_lisp_atom_set, cons, 2, 2))
235 if (!ao_lisp_check_argt(_ao_lisp_atom_set, cons, 0, AO_LISP_ATOM, 0))
238 return ao_lisp_atom_set(ao_lisp_arg(cons, 0), ao_lisp_arg(cons, 1));
242 ao_lisp_setq(struct ao_lisp_cons *cons)
244 struct ao_lisp_cons *expand = 0;
245 if (!ao_lisp_check_argc(_ao_lisp_atom_setq, cons, 2, 2))
247 expand = ao_lisp_cons_cons(_ao_lisp_atom_set,
248 ao_lisp_cons_cons(ao_lisp_cons_poly(ao_lisp_cons_cons(_ao_lisp_atom_quote,
249 ao_lisp_cons_cons(cons->car, NULL))),
250 ao_lisp_poly_cons(cons->cdr)));
251 return ao_lisp_cons_poly(expand);
255 ao_lisp_cond(struct ao_lisp_cons *cons)
257 ao_lisp_set_cond(cons);
262 ao_lisp_progn(struct ao_lisp_cons *cons)
264 ao_lisp_stack->state = eval_progn;
265 ao_lisp_stack->sexprs = ao_lisp_cons_poly(cons);
270 ao_lisp_while(struct ao_lisp_cons *cons)
272 ao_lisp_stack->state = eval_while;
273 ao_lisp_stack->sexprs = ao_lisp_cons_poly(cons);
278 ao_lisp_print(struct ao_lisp_cons *cons)
280 ao_poly val = AO_LISP_NIL;
283 ao_lisp_poly_print(val);
284 cons = ao_lisp_poly_cons(cons->cdr);
293 ao_lisp_patom(struct ao_lisp_cons *cons)
295 ao_poly val = AO_LISP_NIL;
298 ao_lisp_poly_patom(val);
299 cons = ao_lisp_poly_cons(cons->cdr);
305 ao_lisp_math(struct ao_lisp_cons *cons, enum ao_lisp_builtin_id op)
307 ao_poly ret = AO_LISP_NIL;
310 ao_poly car = cons->car;
311 uint8_t rt = ao_lisp_poly_type(ret);
312 uint8_t ct = ao_lisp_poly_type(car);
314 cons = ao_lisp_poly_cons(cons->cdr);
316 if (rt == AO_LISP_NIL)
319 else if (rt == AO_LISP_INT && ct == AO_LISP_INT) {
320 int r = ao_lisp_poly_int(ret);
321 int c = ao_lisp_poly_int(car);
335 return ao_lisp_error(AO_LISP_DIVIDE_BY_ZERO, "divide by zero");
340 return ao_lisp_error(AO_LISP_DIVIDE_BY_ZERO, "mod by zero");
346 ret = ao_lisp_int_poly(r);
349 else if (rt == AO_LISP_STRING && ct == AO_LISP_STRING && op == builtin_plus)
350 ret = ao_lisp_string_poly(ao_lisp_string_cat(ao_lisp_poly_string(ret),
351 ao_lisp_poly_string(car)));
353 return ao_lisp_error(AO_LISP_INVALID, "invalid args");
359 ao_lisp_plus(struct ao_lisp_cons *cons)
361 return ao_lisp_math(cons, builtin_plus);
365 ao_lisp_minus(struct ao_lisp_cons *cons)
367 return ao_lisp_math(cons, builtin_minus);
371 ao_lisp_times(struct ao_lisp_cons *cons)
373 return ao_lisp_math(cons, builtin_times);
377 ao_lisp_divide(struct ao_lisp_cons *cons)
379 return ao_lisp_math(cons, builtin_divide);
383 ao_lisp_mod(struct ao_lisp_cons *cons)
385 return ao_lisp_math(cons, builtin_mod);
389 ao_lisp_compare(struct ao_lisp_cons *cons, enum ao_lisp_builtin_id op)
394 return _ao_lisp_atom_t;
397 cons = ao_lisp_poly_cons(cons->cdr);
399 ao_poly right = cons->car;
401 if (op == builtin_equal) {
405 uint8_t lt = ao_lisp_poly_type(left);
406 uint8_t rt = ao_lisp_poly_type(right);
407 if (lt == AO_LISP_INT && rt == AO_LISP_INT) {
408 int l = ao_lisp_poly_int(left);
409 int r = ao_lisp_poly_int(right);
416 case builtin_greater:
420 case builtin_less_equal:
424 case builtin_greater_equal:
431 } else if (lt == AO_LISP_STRING && rt == AO_LISP_STRING) {
432 int c = strcmp(ao_lisp_poly_string(left),
433 ao_lisp_poly_string(right));
439 case builtin_greater:
443 case builtin_less_equal:
447 case builtin_greater_equal:
457 cons = ao_lisp_poly_cons(cons->cdr);
459 return _ao_lisp_atom_t;
463 ao_lisp_equal(struct ao_lisp_cons *cons)
465 return ao_lisp_compare(cons, builtin_equal);
469 ao_lisp_less(struct ao_lisp_cons *cons)
471 return ao_lisp_compare(cons, builtin_less);
475 ao_lisp_greater(struct ao_lisp_cons *cons)
477 return ao_lisp_compare(cons, builtin_greater);
481 ao_lisp_less_equal(struct ao_lisp_cons *cons)
483 return ao_lisp_compare(cons, builtin_less_equal);
487 ao_lisp_greater_equal(struct ao_lisp_cons *cons)
489 return ao_lisp_compare(cons, builtin_greater_equal);
493 ao_lisp_pack(struct ao_lisp_cons *cons)
495 if (!ao_lisp_check_argc(_ao_lisp_atom_pack, cons, 1, 1))
497 if (!ao_lisp_check_argt(_ao_lisp_atom_pack, cons, 0, AO_LISP_CONS, 1))
499 return ao_lisp_string_pack(ao_lisp_poly_cons(ao_lisp_arg(cons, 0)));
503 ao_lisp_unpack(struct ao_lisp_cons *cons)
505 if (!ao_lisp_check_argc(_ao_lisp_atom_unpack, cons, 1, 1))
507 if (!ao_lisp_check_argt(_ao_lisp_atom_unpack, cons, 0, AO_LISP_STRING, 0))
509 return ao_lisp_string_unpack(ao_lisp_poly_string(ao_lisp_arg(cons, 0)));
513 ao_lisp_flush(struct ao_lisp_cons *cons)
515 if (!ao_lisp_check_argc(_ao_lisp_atom_flush, cons, 0, 0))
518 return _ao_lisp_atom_t;
522 ao_lisp_led(struct ao_lisp_cons *cons)
525 if (!ao_lisp_check_argc(_ao_lisp_atom_led, cons, 1, 1))
527 if (!ao_lisp_check_argt(_ao_lisp_atom_led, cons, 0, AO_LISP_INT, 0))
529 led = ao_lisp_arg(cons, 0);
530 ao_lisp_os_led(ao_lisp_poly_int(led));
535 ao_lisp_delay(struct ao_lisp_cons *cons)
538 if (!ao_lisp_check_argc(_ao_lisp_atom_led, cons, 1, 1))
540 if (!ao_lisp_check_argt(_ao_lisp_atom_led, cons, 0, AO_LISP_INT, 0))
542 delay = ao_lisp_arg(cons, 0);
543 ao_lisp_os_delay(ao_lisp_poly_int(delay));
548 ao_lisp_do_eval(struct ao_lisp_cons *cons)
550 if (!ao_lisp_check_argc(_ao_lisp_atom_eval, cons, 1, 1))
552 ao_lisp_stack->state = eval_sexpr;
557 ao_lisp_do_read(struct ao_lisp_cons *cons)
559 if (!ao_lisp_check_argc(_ao_lisp_atom_read, cons, 0, 0))
561 return ao_lisp_read();
564 const ao_lisp_func_t ao_lisp_builtins[] = {
565 [builtin_eval] = ao_lisp_do_eval,
566 [builtin_read] = ao_lisp_do_read,
567 [builtin_lambda] = ao_lisp_lambda,
568 [builtin_lexpr] = ao_lisp_lexpr,
569 [builtin_nlambda] = ao_lisp_nlambda,
570 [builtin_macro] = ao_lisp_macro,
571 [builtin_car] = ao_lisp_car,
572 [builtin_cdr] = ao_lisp_cdr,
573 [builtin_cons] = ao_lisp_cons,
574 [builtin_last] = ao_lisp_last,
575 [builtin_length] = ao_lisp_length,
576 [builtin_quote] = ao_lisp_quote,
577 [builtin_set] = ao_lisp_set,
578 [builtin_setq] = ao_lisp_setq,
579 [builtin_cond] = ao_lisp_cond,
580 [builtin_progn] = ao_lisp_progn,
581 [builtin_while] = ao_lisp_while,
582 [builtin_print] = ao_lisp_print,
583 [builtin_patom] = ao_lisp_patom,
584 [builtin_plus] = ao_lisp_plus,
585 [builtin_minus] = ao_lisp_minus,
586 [builtin_times] = ao_lisp_times,
587 [builtin_divide] = ao_lisp_divide,
588 [builtin_mod] = ao_lisp_mod,
589 [builtin_equal] = ao_lisp_equal,
590 [builtin_less] = ao_lisp_less,
591 [builtin_greater] = ao_lisp_greater,
592 [builtin_less_equal] = ao_lisp_less_equal,
593 [builtin_greater_equal] = ao_lisp_greater_equal,
594 [builtin_pack] = ao_lisp_pack,
595 [builtin_unpack] = ao_lisp_unpack,
596 [builtin_flush] = ao_lisp_flush,
597 [builtin_led] = ao_lisp_led,
598 [builtin_delay] = ao_lisp_delay,
599 [builtin_save] = ao_lisp_save,
600 [builtin_restore] = ao_lisp_restore,
601 [builtin_call_cc] = ao_lisp_call_cc,