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,
90 [builtin_collect] = _ao_lisp_atom_collect,
92 [builtin_symbolp] = _ao_lisp_atom_symbolp,
93 [builtin_listp] = _ao_lisp_atom_listp,
94 [builtin_stringp] = _ao_lisp_atom_stringp,
95 [builtin_numberp] = _ao_lisp_atom_numberp,
100 ao_lisp_builtin_name(enum ao_lisp_builtin_id b) {
101 if (b < _builtin_last)
102 return ao_lisp_poly_atom(builtin_names[b])->name;
106 static const ao_poly ao_lisp_args_atoms[] = {
107 [AO_LISP_FUNC_LAMBDA] = _ao_lisp_atom_lambda,
108 [AO_LISP_FUNC_LEXPR] = _ao_lisp_atom_lexpr,
109 [AO_LISP_FUNC_NLAMBDA] = _ao_lisp_atom_nlambda,
110 [AO_LISP_FUNC_MACRO] = _ao_lisp_atom_macro,
114 ao_lisp_args_name(uint8_t args)
116 args &= AO_LISP_FUNC_MASK;
117 if (args < sizeof ao_lisp_args_atoms / sizeof ao_lisp_args_atoms[0])
118 return ao_lisp_poly_atom(ao_lisp_args_atoms[args])->name;
124 ao_lisp_builtin_print(ao_poly b)
126 struct ao_lisp_builtin *builtin = ao_lisp_poly_builtin(b);
127 printf("%s", ao_lisp_builtin_name(builtin->func));
131 ao_lisp_check_argc(ao_poly name, struct ao_lisp_cons *cons, int min, int max)
135 while (cons && argc <= max) {
137 cons = ao_lisp_poly_cons(cons->cdr);
139 if (argc < min || argc > max)
140 return ao_lisp_error(AO_LISP_INVALID, "%s: invalid arg count", ao_lisp_poly_atom(name)->name);
141 return _ao_lisp_atom_t;
145 ao_lisp_arg(struct ao_lisp_cons *cons, int argc)
152 cons = ao_lisp_poly_cons(cons->cdr);
158 ao_lisp_check_argt(ao_poly name, struct ao_lisp_cons *cons, int argc, int type, int nil_ok)
160 ao_poly car = ao_lisp_arg(cons, argc);
162 if ((!car && !nil_ok) || ao_lisp_poly_type(car) != type)
163 return ao_lisp_error(AO_LISP_INVALID, "%s: invalid type for arg %d", ao_lisp_poly_atom(name)->name, argc);
164 return _ao_lisp_atom_t;
168 ao_lisp_car(struct ao_lisp_cons *cons)
170 if (!ao_lisp_check_argc(_ao_lisp_atom_car, cons, 1, 1))
172 if (!ao_lisp_check_argt(_ao_lisp_atom_car, cons, 0, AO_LISP_CONS, 0))
174 return ao_lisp_poly_cons(cons->car)->car;
178 ao_lisp_cdr(struct ao_lisp_cons *cons)
180 if (!ao_lisp_check_argc(_ao_lisp_atom_cdr, cons, 1, 1))
182 if (!ao_lisp_check_argt(_ao_lisp_atom_cdr, cons, 0, AO_LISP_CONS, 0))
184 return ao_lisp_poly_cons(cons->car)->cdr;
188 ao_lisp_cons(struct ao_lisp_cons *cons)
191 if(!ao_lisp_check_argc(_ao_lisp_atom_cons, cons, 2, 2))
193 car = ao_lisp_arg(cons, 0);
194 cdr = ao_lisp_arg(cons, 1);
195 return ao_lisp__cons(car, cdr);
199 ao_lisp_last(struct ao_lisp_cons *cons)
202 if (!ao_lisp_check_argc(_ao_lisp_atom_last, cons, 1, 1))
204 if (!ao_lisp_check_argt(_ao_lisp_atom_last, cons, 0, AO_LISP_CONS, 1))
206 l = ao_lisp_arg(cons, 0);
208 struct ao_lisp_cons *list = ao_lisp_poly_cons(l);
217 ao_lisp_length(struct ao_lisp_cons *cons)
219 if (!ao_lisp_check_argc(_ao_lisp_atom_length, cons, 1, 1))
221 if (!ao_lisp_check_argt(_ao_lisp_atom_length, cons, 0, AO_LISP_CONS, 1))
223 return ao_lisp_int_poly(ao_lisp_cons_length(ao_lisp_poly_cons(ao_lisp_arg(cons, 0))));
227 ao_lisp_quote(struct ao_lisp_cons *cons)
229 if (!ao_lisp_check_argc(_ao_lisp_atom_quote, cons, 1, 1))
231 return ao_lisp_arg(cons, 0);
235 ao_lisp_set(struct ao_lisp_cons *cons)
237 if (!ao_lisp_check_argc(_ao_lisp_atom_set, cons, 2, 2))
239 if (!ao_lisp_check_argt(_ao_lisp_atom_set, cons, 0, AO_LISP_ATOM, 0))
242 return ao_lisp_atom_set(ao_lisp_arg(cons, 0), ao_lisp_arg(cons, 1));
246 ao_lisp_setq(struct ao_lisp_cons *cons)
248 if (!ao_lisp_check_argc(_ao_lisp_atom_setq, cons, 2, 2))
250 return ao_lisp__cons(_ao_lisp_atom_set,
251 ao_lisp__cons(ao_lisp__cons(_ao_lisp_atom_quote,
252 ao_lisp__cons(cons->car, AO_LISP_NIL)),
257 ao_lisp_cond(struct ao_lisp_cons *cons)
259 ao_lisp_set_cond(cons);
264 ao_lisp_progn(struct ao_lisp_cons *cons)
266 ao_lisp_stack->state = eval_progn;
267 ao_lisp_stack->sexprs = ao_lisp_cons_poly(cons);
272 ao_lisp_while(struct ao_lisp_cons *cons)
274 ao_lisp_stack->state = eval_while;
275 ao_lisp_stack->sexprs = ao_lisp_cons_poly(cons);
280 ao_lisp_print(struct ao_lisp_cons *cons)
282 ao_poly val = AO_LISP_NIL;
285 ao_lisp_poly_print(val);
286 cons = ao_lisp_poly_cons(cons->cdr);
295 ao_lisp_patom(struct ao_lisp_cons *cons)
297 ao_poly val = AO_LISP_NIL;
300 ao_lisp_poly_patom(val);
301 cons = ao_lisp_poly_cons(cons->cdr);
307 ao_lisp_math(struct ao_lisp_cons *cons, enum ao_lisp_builtin_id op)
309 ao_poly ret = AO_LISP_NIL;
312 ao_poly car = cons->car;
313 uint8_t rt = ao_lisp_poly_type(ret);
314 uint8_t ct = ao_lisp_poly_type(car);
316 cons = ao_lisp_poly_cons(cons->cdr);
318 if (rt == AO_LISP_NIL)
321 else if (rt == AO_LISP_INT && ct == AO_LISP_INT) {
322 int r = ao_lisp_poly_int(ret);
323 int c = ao_lisp_poly_int(car);
337 return ao_lisp_error(AO_LISP_DIVIDE_BY_ZERO, "divide by zero");
342 return ao_lisp_error(AO_LISP_DIVIDE_BY_ZERO, "mod by zero");
348 ret = ao_lisp_int_poly(r);
351 else if (rt == AO_LISP_STRING && ct == AO_LISP_STRING && op == builtin_plus)
352 ret = ao_lisp_string_poly(ao_lisp_string_cat(ao_lisp_poly_string(ret),
353 ao_lisp_poly_string(car)));
355 return ao_lisp_error(AO_LISP_INVALID, "invalid args");
361 ao_lisp_plus(struct ao_lisp_cons *cons)
363 return ao_lisp_math(cons, builtin_plus);
367 ao_lisp_minus(struct ao_lisp_cons *cons)
369 return ao_lisp_math(cons, builtin_minus);
373 ao_lisp_times(struct ao_lisp_cons *cons)
375 return ao_lisp_math(cons, builtin_times);
379 ao_lisp_divide(struct ao_lisp_cons *cons)
381 return ao_lisp_math(cons, builtin_divide);
385 ao_lisp_mod(struct ao_lisp_cons *cons)
387 return ao_lisp_math(cons, builtin_mod);
391 ao_lisp_compare(struct ao_lisp_cons *cons, enum ao_lisp_builtin_id op)
396 return _ao_lisp_atom_t;
399 cons = ao_lisp_poly_cons(cons->cdr);
401 ao_poly right = cons->car;
403 if (op == builtin_equal) {
407 uint8_t lt = ao_lisp_poly_type(left);
408 uint8_t rt = ao_lisp_poly_type(right);
409 if (lt == AO_LISP_INT && rt == AO_LISP_INT) {
410 int l = ao_lisp_poly_int(left);
411 int r = ao_lisp_poly_int(right);
418 case builtin_greater:
422 case builtin_less_equal:
426 case builtin_greater_equal:
433 } else if (lt == AO_LISP_STRING && rt == AO_LISP_STRING) {
434 int c = strcmp(ao_lisp_poly_string(left),
435 ao_lisp_poly_string(right));
441 case builtin_greater:
445 case builtin_less_equal:
449 case builtin_greater_equal:
459 cons = ao_lisp_poly_cons(cons->cdr);
461 return _ao_lisp_atom_t;
465 ao_lisp_equal(struct ao_lisp_cons *cons)
467 return ao_lisp_compare(cons, builtin_equal);
471 ao_lisp_less(struct ao_lisp_cons *cons)
473 return ao_lisp_compare(cons, builtin_less);
477 ao_lisp_greater(struct ao_lisp_cons *cons)
479 return ao_lisp_compare(cons, builtin_greater);
483 ao_lisp_less_equal(struct ao_lisp_cons *cons)
485 return ao_lisp_compare(cons, builtin_less_equal);
489 ao_lisp_greater_equal(struct ao_lisp_cons *cons)
491 return ao_lisp_compare(cons, builtin_greater_equal);
495 ao_lisp_pack(struct ao_lisp_cons *cons)
497 if (!ao_lisp_check_argc(_ao_lisp_atom_pack, cons, 1, 1))
499 if (!ao_lisp_check_argt(_ao_lisp_atom_pack, cons, 0, AO_LISP_CONS, 1))
501 return ao_lisp_string_pack(ao_lisp_poly_cons(ao_lisp_arg(cons, 0)));
505 ao_lisp_unpack(struct ao_lisp_cons *cons)
507 if (!ao_lisp_check_argc(_ao_lisp_atom_unpack, cons, 1, 1))
509 if (!ao_lisp_check_argt(_ao_lisp_atom_unpack, cons, 0, AO_LISP_STRING, 0))
511 return ao_lisp_string_unpack(ao_lisp_poly_string(ao_lisp_arg(cons, 0)));
515 ao_lisp_flush(struct ao_lisp_cons *cons)
517 if (!ao_lisp_check_argc(_ao_lisp_atom_flush, cons, 0, 0))
520 return _ao_lisp_atom_t;
524 ao_lisp_led(struct ao_lisp_cons *cons)
527 if (!ao_lisp_check_argc(_ao_lisp_atom_led, cons, 1, 1))
529 if (!ao_lisp_check_argt(_ao_lisp_atom_led, cons, 0, AO_LISP_INT, 0))
531 led = ao_lisp_arg(cons, 0);
532 ao_lisp_os_led(ao_lisp_poly_int(led));
537 ao_lisp_delay(struct ao_lisp_cons *cons)
540 if (!ao_lisp_check_argc(_ao_lisp_atom_led, cons, 1, 1))
542 if (!ao_lisp_check_argt(_ao_lisp_atom_led, cons, 0, AO_LISP_INT, 0))
544 delay = ao_lisp_arg(cons, 0);
545 ao_lisp_os_delay(ao_lisp_poly_int(delay));
550 ao_lisp_do_eval(struct ao_lisp_cons *cons)
552 if (!ao_lisp_check_argc(_ao_lisp_atom_eval, cons, 1, 1))
554 ao_lisp_stack->state = eval_sexpr;
559 ao_lisp_do_read(struct ao_lisp_cons *cons)
561 if (!ao_lisp_check_argc(_ao_lisp_atom_read, cons, 0, 0))
563 return ao_lisp_read();
567 ao_lisp_do_collect(struct ao_lisp_cons *cons)
571 free = ao_lisp_collect(AO_LISP_COLLECT_FULL);
572 return ao_lisp_int_poly(free);
575 const ao_lisp_func_t ao_lisp_builtins[] = {
576 [builtin_eval] = ao_lisp_do_eval,
577 [builtin_read] = ao_lisp_do_read,
578 [builtin_lambda] = ao_lisp_lambda,
579 [builtin_lexpr] = ao_lisp_lexpr,
580 [builtin_nlambda] = ao_lisp_nlambda,
581 [builtin_macro] = ao_lisp_macro,
582 [builtin_car] = ao_lisp_car,
583 [builtin_cdr] = ao_lisp_cdr,
584 [builtin_cons] = ao_lisp_cons,
585 [builtin_last] = ao_lisp_last,
586 [builtin_length] = ao_lisp_length,
587 [builtin_quote] = ao_lisp_quote,
588 [builtin_set] = ao_lisp_set,
589 [builtin_setq] = ao_lisp_setq,
590 [builtin_cond] = ao_lisp_cond,
591 [builtin_progn] = ao_lisp_progn,
592 [builtin_while] = ao_lisp_while,
593 [builtin_print] = ao_lisp_print,
594 [builtin_patom] = ao_lisp_patom,
595 [builtin_plus] = ao_lisp_plus,
596 [builtin_minus] = ao_lisp_minus,
597 [builtin_times] = ao_lisp_times,
598 [builtin_divide] = ao_lisp_divide,
599 [builtin_mod] = ao_lisp_mod,
600 [builtin_equal] = ao_lisp_equal,
601 [builtin_less] = ao_lisp_less,
602 [builtin_greater] = ao_lisp_greater,
603 [builtin_less_equal] = ao_lisp_less_equal,
604 [builtin_greater_equal] = ao_lisp_greater_equal,
605 [builtin_pack] = ao_lisp_pack,
606 [builtin_unpack] = ao_lisp_unpack,
607 [builtin_flush] = ao_lisp_flush,
608 [builtin_led] = ao_lisp_led,
609 [builtin_delay] = ao_lisp_delay,
610 [builtin_save] = ao_lisp_save,
611 [builtin_restore] = ao_lisp_restore,
612 [builtin_call_cc] = ao_lisp_call_cc,
613 [builtin_collect] = ao_lisp_do_collect,