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) {
46 char *ao_lisp_args_name(uint8_t args) {
50 static const ao_poly builtin_names[] = {
51 [builtin_eval] = _ao_lisp_atom_eval,
52 [builtin_read] = _ao_lisp_atom_read,
53 [builtin_lambda] = _ao_lisp_atom_lambda,
54 [builtin_lexpr] = _ao_lisp_atom_lexpr,
55 [builtin_nlambda] = _ao_lisp_atom_nlambda,
56 [builtin_macro] = _ao_lisp_atom_macro,
57 [builtin_car] = _ao_lisp_atom_car,
58 [builtin_cdr] = _ao_lisp_atom_cdr,
59 [builtin_cons] = _ao_lisp_atom_cons,
60 [builtin_last] = _ao_lisp_atom_last,
61 [builtin_length] = _ao_lisp_atom_length,
62 [builtin_quote] = _ao_lisp_atom_quote,
63 [builtin_set] = _ao_lisp_atom_set,
64 [builtin_setq] = _ao_lisp_atom_setq,
65 [builtin_cond] = _ao_lisp_atom_cond,
66 [builtin_progn] = _ao_lisp_atom_progn,
67 [builtin_while] = _ao_lisp_atom_while,
68 [builtin_print] = _ao_lisp_atom_print,
69 [builtin_patom] = _ao_lisp_atom_patom,
70 [builtin_plus] = _ao_lisp_atom_2b,
71 [builtin_minus] = _ao_lisp_atom_2d,
72 [builtin_times] = _ao_lisp_atom_2a,
73 [builtin_divide] = _ao_lisp_atom_2f,
74 [builtin_mod] = _ao_lisp_atom_25,
75 [builtin_equal] = _ao_lisp_atom_3d,
76 [builtin_less] = _ao_lisp_atom_3c,
77 [builtin_greater] = _ao_lisp_atom_3e,
78 [builtin_less_equal] = _ao_lisp_atom_3c3d,
79 [builtin_greater_equal] = _ao_lisp_atom_3e3d,
80 [builtin_pack] = _ao_lisp_atom_pack,
81 [builtin_unpack] = _ao_lisp_atom_unpack,
82 [builtin_flush] = _ao_lisp_atom_flush,
83 [builtin_delay] = _ao_lisp_atom_delay,
84 [builtin_led] = _ao_lisp_atom_led,
85 [builtin_save] = _ao_lisp_atom_save,
86 [builtin_restore] = _ao_lisp_atom_restore,
91 ao_lisp_builtin_name(enum ao_lisp_builtin_id b) {
92 if (b < _builtin_last)
93 return ao_lisp_poly_atom(builtin_names[b])->name;
97 static const ao_poly ao_lisp_args_atoms[] = {
98 [AO_LISP_FUNC_LAMBDA] = _ao_lisp_atom_lambda,
99 [AO_LISP_FUNC_LEXPR] = _ao_lisp_atom_lexpr,
100 [AO_LISP_FUNC_NLAMBDA] = _ao_lisp_atom_nlambda,
101 [AO_LISP_FUNC_MACRO] = _ao_lisp_atom_macro,
105 ao_lisp_args_name(uint8_t args)
107 if (args < sizeof ao_lisp_args_atoms / sizeof ao_lisp_args_atoms[0])
108 return ao_lisp_poly_atom(ao_lisp_args_atoms[args])->name;
114 ao_lisp_builtin_print(ao_poly b)
116 struct ao_lisp_builtin *builtin = ao_lisp_poly_builtin(b);
117 printf("[builtin %s %s]",
118 ao_lisp_args_name(builtin->args),
119 ao_lisp_builtin_name(builtin->func));
123 ao_lisp_check_argc(ao_poly name, struct ao_lisp_cons *cons, int min, int max)
127 while (cons && argc <= max) {
129 cons = ao_lisp_poly_cons(cons->cdr);
131 if (argc < min || argc > max)
132 return ao_lisp_error(AO_LISP_INVALID, "%s: invalid arg count", ao_lisp_poly_atom(name)->name);
133 return _ao_lisp_atom_t;
137 ao_lisp_arg(struct ao_lisp_cons *cons, int argc)
144 cons = ao_lisp_poly_cons(cons->cdr);
150 ao_lisp_check_argt(ao_poly name, struct ao_lisp_cons *cons, int argc, int type, int nil_ok)
152 ao_poly car = ao_lisp_arg(cons, argc);
154 if ((!car && !nil_ok) || ao_lisp_poly_type(car) != type)
155 return ao_lisp_error(AO_LISP_INVALID, "%s: invalid type for arg %d", ao_lisp_poly_atom(name)->name, argc);
156 return _ao_lisp_atom_t;
160 ao_lisp_car(struct ao_lisp_cons *cons)
162 if (!ao_lisp_check_argc(_ao_lisp_atom_car, cons, 1, 1))
164 if (!ao_lisp_check_argt(_ao_lisp_atom_car, cons, 0, AO_LISP_CONS, 0))
166 return ao_lisp_poly_cons(cons->car)->car;
170 ao_lisp_cdr(struct ao_lisp_cons *cons)
172 if (!ao_lisp_check_argc(_ao_lisp_atom_cdr, cons, 1, 1))
174 if (!ao_lisp_check_argt(_ao_lisp_atom_cdr, cons, 0, AO_LISP_CONS, 0))
176 return ao_lisp_poly_cons(cons->car)->cdr;
180 ao_lisp_cons(struct ao_lisp_cons *cons)
183 if(!ao_lisp_check_argc(_ao_lisp_atom_cons, cons, 2, 2))
185 if (!ao_lisp_check_argt(_ao_lisp_atom_cons, cons, 1, AO_LISP_CONS, 1))
187 car = ao_lisp_arg(cons, 0);
188 cdr = ao_lisp_arg(cons, 1);
189 return ao_lisp_cons_poly(ao_lisp_cons_cons(car, ao_lisp_poly_cons(cdr)));
193 ao_lisp_last(struct ao_lisp_cons *cons)
196 if (!ao_lisp_check_argc(_ao_lisp_atom_last, cons, 1, 1))
198 if (!ao_lisp_check_argt(_ao_lisp_atom_last, cons, 0, AO_LISP_CONS, 1))
200 l = ao_lisp_arg(cons, 0);
202 struct ao_lisp_cons *list = ao_lisp_poly_cons(l);
211 ao_lisp_length(struct ao_lisp_cons *cons)
213 if (!ao_lisp_check_argc(_ao_lisp_atom_last, cons, 1, 1))
215 if (!ao_lisp_check_argt(_ao_lisp_atom_last, cons, 0, AO_LISP_CONS, 1))
217 return ao_lisp_int_poly(ao_lisp_cons_length(ao_lisp_poly_cons(ao_lisp_arg(cons, 0))));
221 ao_lisp_quote(struct ao_lisp_cons *cons)
223 if (!ao_lisp_check_argc(_ao_lisp_atom_quote, cons, 1, 1))
225 return ao_lisp_arg(cons, 0);
229 ao_lisp_set(struct ao_lisp_cons *cons)
231 if (!ao_lisp_check_argc(_ao_lisp_atom_set, cons, 2, 2))
233 if (!ao_lisp_check_argt(_ao_lisp_atom_set, cons, 0, AO_LISP_ATOM, 0))
236 return ao_lisp_atom_set(ao_lisp_arg(cons, 0), ao_lisp_arg(cons, 1));
240 ao_lisp_setq(struct ao_lisp_cons *cons)
242 struct ao_lisp_cons *expand = 0;
243 if (!ao_lisp_check_argc(_ao_lisp_atom_setq, cons, 2, 2))
245 expand = ao_lisp_cons_cons(_ao_lisp_atom_set,
246 ao_lisp_cons_cons(ao_lisp_cons_poly(ao_lisp_cons_cons(_ao_lisp_atom_quote,
247 ao_lisp_cons_cons(cons->car, NULL))),
248 ao_lisp_poly_cons(cons->cdr)));
249 return ao_lisp_cons_poly(expand);
253 ao_lisp_cond(struct ao_lisp_cons *cons)
255 ao_lisp_set_cond(cons);
260 ao_lisp_progn(struct ao_lisp_cons *cons)
262 ao_lisp_stack->state = eval_progn;
263 ao_lisp_stack->sexprs = ao_lisp_cons_poly(cons);
268 ao_lisp_while(struct ao_lisp_cons *cons)
270 ao_lisp_stack->state = eval_while;
271 ao_lisp_stack->sexprs = ao_lisp_cons_poly(cons);
276 ao_lisp_print(struct ao_lisp_cons *cons)
278 ao_poly val = AO_LISP_NIL;
281 ao_lisp_poly_print(val);
282 cons = ao_lisp_poly_cons(cons->cdr);
291 ao_lisp_patom(struct ao_lisp_cons *cons)
293 ao_poly val = AO_LISP_NIL;
296 ao_lisp_poly_patom(val);
297 cons = ao_lisp_poly_cons(cons->cdr);
303 ao_lisp_math(struct ao_lisp_cons *cons, enum ao_lisp_builtin_id op)
305 ao_poly ret = AO_LISP_NIL;
308 ao_poly car = cons->car;
309 uint8_t rt = ao_lisp_poly_type(ret);
310 uint8_t ct = ao_lisp_poly_type(car);
312 cons = ao_lisp_poly_cons(cons->cdr);
314 if (rt == AO_LISP_NIL)
317 else if (rt == AO_LISP_INT && ct == AO_LISP_INT) {
318 int r = ao_lisp_poly_int(ret);
319 int c = ao_lisp_poly_int(car);
333 return ao_lisp_error(AO_LISP_DIVIDE_BY_ZERO, "divide by zero");
338 return ao_lisp_error(AO_LISP_DIVIDE_BY_ZERO, "mod by zero");
344 ret = ao_lisp_int_poly(r);
347 else if (rt == AO_LISP_STRING && ct == AO_LISP_STRING && op == builtin_plus)
348 ret = ao_lisp_string_poly(ao_lisp_string_cat(ao_lisp_poly_string(ret),
349 ao_lisp_poly_string(car)));
351 return ao_lisp_error(AO_LISP_INVALID, "invalid args");
357 ao_lisp_plus(struct ao_lisp_cons *cons)
359 return ao_lisp_math(cons, builtin_plus);
363 ao_lisp_minus(struct ao_lisp_cons *cons)
365 return ao_lisp_math(cons, builtin_minus);
369 ao_lisp_times(struct ao_lisp_cons *cons)
371 return ao_lisp_math(cons, builtin_times);
375 ao_lisp_divide(struct ao_lisp_cons *cons)
377 return ao_lisp_math(cons, builtin_divide);
381 ao_lisp_mod(struct ao_lisp_cons *cons)
383 return ao_lisp_math(cons, builtin_mod);
387 ao_lisp_compare(struct ao_lisp_cons *cons, enum ao_lisp_builtin_id op)
392 return _ao_lisp_atom_t;
395 cons = ao_lisp_poly_cons(cons->cdr);
397 ao_poly right = cons->car;
399 if (op == builtin_equal) {
403 uint8_t lt = ao_lisp_poly_type(left);
404 uint8_t rt = ao_lisp_poly_type(right);
405 if (lt == AO_LISP_INT && rt == AO_LISP_INT) {
406 int l = ao_lisp_poly_int(left);
407 int r = ao_lisp_poly_int(right);
414 case builtin_greater:
418 case builtin_less_equal:
422 case builtin_greater_equal:
429 } else if (lt == AO_LISP_STRING && rt == AO_LISP_STRING) {
430 int c = strcmp(ao_lisp_poly_string(left),
431 ao_lisp_poly_string(right));
437 case builtin_greater:
441 case builtin_less_equal:
445 case builtin_greater_equal:
455 cons = ao_lisp_poly_cons(cons->cdr);
457 return _ao_lisp_atom_t;
461 ao_lisp_equal(struct ao_lisp_cons *cons)
463 return ao_lisp_compare(cons, builtin_equal);
467 ao_lisp_less(struct ao_lisp_cons *cons)
469 return ao_lisp_compare(cons, builtin_less);
473 ao_lisp_greater(struct ao_lisp_cons *cons)
475 return ao_lisp_compare(cons, builtin_greater);
479 ao_lisp_less_equal(struct ao_lisp_cons *cons)
481 return ao_lisp_compare(cons, builtin_less_equal);
485 ao_lisp_greater_equal(struct ao_lisp_cons *cons)
487 return ao_lisp_compare(cons, builtin_greater_equal);
491 ao_lisp_pack(struct ao_lisp_cons *cons)
493 if (!ao_lisp_check_argc(_ao_lisp_atom_pack, cons, 1, 1))
495 if (!ao_lisp_check_argt(_ao_lisp_atom_pack, cons, 0, AO_LISP_CONS, 1))
497 return ao_lisp_string_pack(ao_lisp_poly_cons(ao_lisp_arg(cons, 0)));
501 ao_lisp_unpack(struct ao_lisp_cons *cons)
503 if (!ao_lisp_check_argc(_ao_lisp_atom_unpack, cons, 1, 1))
505 if (!ao_lisp_check_argt(_ao_lisp_atom_unpack, cons, 0, AO_LISP_STRING, 0))
507 return ao_lisp_string_unpack(ao_lisp_poly_string(ao_lisp_arg(cons, 0)));
511 ao_lisp_flush(struct ao_lisp_cons *cons)
513 if (!ao_lisp_check_argc(_ao_lisp_atom_flush, cons, 0, 0))
516 return _ao_lisp_atom_t;
520 ao_lisp_led(struct ao_lisp_cons *cons)
523 if (!ao_lisp_check_argc(_ao_lisp_atom_led, cons, 1, 1))
525 if (!ao_lisp_check_argt(_ao_lisp_atom_led, cons, 0, AO_LISP_INT, 0))
527 led = ao_lisp_arg(cons, 0);
528 ao_lisp_os_led(ao_lisp_poly_int(led));
533 ao_lisp_delay(struct ao_lisp_cons *cons)
536 if (!ao_lisp_check_argc(_ao_lisp_atom_led, cons, 1, 1))
538 if (!ao_lisp_check_argt(_ao_lisp_atom_led, cons, 0, AO_LISP_INT, 0))
540 delay = ao_lisp_arg(cons, 0);
541 ao_lisp_os_delay(ao_lisp_poly_int(delay));
546 ao_lisp_do_eval(struct ao_lisp_cons *cons)
548 if (!ao_lisp_check_argc(_ao_lisp_atom_eval, cons, 1, 1))
550 ao_lisp_stack->state = eval_sexpr;
555 ao_lisp_do_read(struct ao_lisp_cons *cons)
557 if (!ao_lisp_check_argc(_ao_lisp_atom_read, cons, 0, 0))
559 return ao_lisp_read();
562 const ao_lisp_func_t ao_lisp_builtins[] = {
563 [builtin_eval] = ao_lisp_do_eval,
564 [builtin_read] = ao_lisp_do_read,
565 [builtin_lambda] = ao_lisp_lambda,
566 [builtin_lexpr] = ao_lisp_lexpr,
567 [builtin_nlambda] = ao_lisp_nlambda,
568 [builtin_macro] = ao_lisp_macro,
569 [builtin_car] = ao_lisp_car,
570 [builtin_cdr] = ao_lisp_cdr,
571 [builtin_cons] = ao_lisp_cons,
572 [builtin_last] = ao_lisp_last,
573 [builtin_length] = ao_lisp_length,
574 [builtin_quote] = ao_lisp_quote,
575 [builtin_set] = ao_lisp_set,
576 [builtin_setq] = ao_lisp_setq,
577 [builtin_cond] = ao_lisp_cond,
578 [builtin_progn] = ao_lisp_progn,
579 [builtin_while] = ao_lisp_while,
580 [builtin_print] = ao_lisp_print,
581 [builtin_patom] = ao_lisp_patom,
582 [builtin_plus] = ao_lisp_plus,
583 [builtin_minus] = ao_lisp_minus,
584 [builtin_times] = ao_lisp_times,
585 [builtin_divide] = ao_lisp_divide,
586 [builtin_mod] = ao_lisp_mod,
587 [builtin_equal] = ao_lisp_equal,
588 [builtin_less] = ao_lisp_less,
589 [builtin_greater] = ao_lisp_greater,
590 [builtin_less_equal] = ao_lisp_less_equal,
591 [builtin_greater_equal] = ao_lisp_greater_equal,
592 [builtin_pack] = ao_lisp_pack,
593 [builtin_unpack] = ao_lisp_unpack,
594 [builtin_flush] = ao_lisp_flush,
595 [builtin_led] = ao_lisp_led,
596 [builtin_delay] = ao_lisp_delay,
597 [builtin_save] = ao_lisp_save,
598 [builtin_restore] = ao_lisp_restore,