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,
93 ao_lisp_builtin_name(enum ao_lisp_builtin_id b) {
94 if (b < _builtin_last)
95 return ao_lisp_poly_atom(builtin_names[b])->name;
99 static const ao_poly ao_lisp_args_atoms[] = {
100 [AO_LISP_FUNC_LAMBDA] = _ao_lisp_atom_lambda,
101 [AO_LISP_FUNC_LEXPR] = _ao_lisp_atom_lexpr,
102 [AO_LISP_FUNC_NLAMBDA] = _ao_lisp_atom_nlambda,
103 [AO_LISP_FUNC_MACRO] = _ao_lisp_atom_macro,
107 ao_lisp_args_name(uint8_t args)
109 args &= AO_LISP_FUNC_MASK;
110 if (args < sizeof ao_lisp_args_atoms / sizeof ao_lisp_args_atoms[0])
111 return ao_lisp_poly_atom(ao_lisp_args_atoms[args])->name;
117 ao_lisp_builtin_print(ao_poly b)
119 struct ao_lisp_builtin *builtin = ao_lisp_poly_builtin(b);
120 printf("[builtin %s %s]",
121 ao_lisp_args_name(builtin->args),
122 ao_lisp_builtin_name(builtin->func));
126 ao_lisp_check_argc(ao_poly name, struct ao_lisp_cons *cons, int min, int max)
130 while (cons && argc <= max) {
132 cons = ao_lisp_poly_cons(cons->cdr);
134 if (argc < min || argc > max)
135 return ao_lisp_error(AO_LISP_INVALID, "%s: invalid arg count", ao_lisp_poly_atom(name)->name);
136 return _ao_lisp_atom_t;
140 ao_lisp_arg(struct ao_lisp_cons *cons, int argc)
147 cons = ao_lisp_poly_cons(cons->cdr);
153 ao_lisp_check_argt(ao_poly name, struct ao_lisp_cons *cons, int argc, int type, int nil_ok)
155 ao_poly car = ao_lisp_arg(cons, argc);
157 if ((!car && !nil_ok) || ao_lisp_poly_type(car) != type)
158 return ao_lisp_error(AO_LISP_INVALID, "%s: invalid type for arg %d", ao_lisp_poly_atom(name)->name, argc);
159 return _ao_lisp_atom_t;
163 ao_lisp_car(struct ao_lisp_cons *cons)
165 if (!ao_lisp_check_argc(_ao_lisp_atom_car, cons, 1, 1))
167 if (!ao_lisp_check_argt(_ao_lisp_atom_car, cons, 0, AO_LISP_CONS, 0))
169 return ao_lisp_poly_cons(cons->car)->car;
173 ao_lisp_cdr(struct ao_lisp_cons *cons)
175 if (!ao_lisp_check_argc(_ao_lisp_atom_cdr, cons, 1, 1))
177 if (!ao_lisp_check_argt(_ao_lisp_atom_cdr, cons, 0, AO_LISP_CONS, 0))
179 return ao_lisp_poly_cons(cons->car)->cdr;
183 ao_lisp_cons(struct ao_lisp_cons *cons)
186 if(!ao_lisp_check_argc(_ao_lisp_atom_cons, cons, 2, 2))
188 if (!ao_lisp_check_argt(_ao_lisp_atom_cons, cons, 1, AO_LISP_CONS, 1))
190 car = ao_lisp_arg(cons, 0);
191 cdr = ao_lisp_arg(cons, 1);
192 return ao_lisp_cons_poly(ao_lisp_cons_cons(car, ao_lisp_poly_cons(cdr)));
196 ao_lisp_last(struct ao_lisp_cons *cons)
199 if (!ao_lisp_check_argc(_ao_lisp_atom_last, cons, 1, 1))
201 if (!ao_lisp_check_argt(_ao_lisp_atom_last, cons, 0, AO_LISP_CONS, 1))
203 l = ao_lisp_arg(cons, 0);
205 struct ao_lisp_cons *list = ao_lisp_poly_cons(l);
214 ao_lisp_length(struct ao_lisp_cons *cons)
216 if (!ao_lisp_check_argc(_ao_lisp_atom_length, cons, 1, 1))
218 if (!ao_lisp_check_argt(_ao_lisp_atom_length, cons, 0, AO_LISP_CONS, 1))
220 return ao_lisp_int_poly(ao_lisp_cons_length(ao_lisp_poly_cons(ao_lisp_arg(cons, 0))));
224 ao_lisp_quote(struct ao_lisp_cons *cons)
226 if (!ao_lisp_check_argc(_ao_lisp_atom_quote, cons, 1, 1))
228 return ao_lisp_arg(cons, 0);
232 ao_lisp_set(struct ao_lisp_cons *cons)
234 if (!ao_lisp_check_argc(_ao_lisp_atom_set, cons, 2, 2))
236 if (!ao_lisp_check_argt(_ao_lisp_atom_set, cons, 0, AO_LISP_ATOM, 0))
239 return ao_lisp_atom_set(ao_lisp_arg(cons, 0), ao_lisp_arg(cons, 1));
243 ao_lisp_setq(struct ao_lisp_cons *cons)
245 struct ao_lisp_cons *expand = 0;
246 if (!ao_lisp_check_argc(_ao_lisp_atom_setq, cons, 2, 2))
248 expand = ao_lisp_cons_cons(_ao_lisp_atom_set,
249 ao_lisp_cons_cons(ao_lisp_cons_poly(ao_lisp_cons_cons(_ao_lisp_atom_quote,
250 ao_lisp_cons_cons(cons->car, NULL))),
251 ao_lisp_poly_cons(cons->cdr)));
252 return ao_lisp_cons_poly(expand);
256 ao_lisp_cond(struct ao_lisp_cons *cons)
258 ao_lisp_set_cond(cons);
263 ao_lisp_progn(struct ao_lisp_cons *cons)
265 ao_lisp_stack->state = eval_progn;
266 ao_lisp_stack->sexprs = ao_lisp_cons_poly(cons);
271 ao_lisp_while(struct ao_lisp_cons *cons)
273 ao_lisp_stack->state = eval_while;
274 ao_lisp_stack->sexprs = ao_lisp_cons_poly(cons);
279 ao_lisp_print(struct ao_lisp_cons *cons)
281 ao_poly val = AO_LISP_NIL;
284 ao_lisp_poly_print(val);
285 cons = ao_lisp_poly_cons(cons->cdr);
294 ao_lisp_patom(struct ao_lisp_cons *cons)
296 ao_poly val = AO_LISP_NIL;
299 ao_lisp_poly_patom(val);
300 cons = ao_lisp_poly_cons(cons->cdr);
306 ao_lisp_math(struct ao_lisp_cons *cons, enum ao_lisp_builtin_id op)
308 ao_poly ret = AO_LISP_NIL;
311 ao_poly car = cons->car;
312 uint8_t rt = ao_lisp_poly_type(ret);
313 uint8_t ct = ao_lisp_poly_type(car);
315 cons = ao_lisp_poly_cons(cons->cdr);
317 if (rt == AO_LISP_NIL)
320 else if (rt == AO_LISP_INT && ct == AO_LISP_INT) {
321 int r = ao_lisp_poly_int(ret);
322 int c = ao_lisp_poly_int(car);
336 return ao_lisp_error(AO_LISP_DIVIDE_BY_ZERO, "divide by zero");
341 return ao_lisp_error(AO_LISP_DIVIDE_BY_ZERO, "mod by zero");
347 ret = ao_lisp_int_poly(r);
350 else if (rt == AO_LISP_STRING && ct == AO_LISP_STRING && op == builtin_plus)
351 ret = ao_lisp_string_poly(ao_lisp_string_cat(ao_lisp_poly_string(ret),
352 ao_lisp_poly_string(car)));
354 return ao_lisp_error(AO_LISP_INVALID, "invalid args");
360 ao_lisp_plus(struct ao_lisp_cons *cons)
362 return ao_lisp_math(cons, builtin_plus);
366 ao_lisp_minus(struct ao_lisp_cons *cons)
368 return ao_lisp_math(cons, builtin_minus);
372 ao_lisp_times(struct ao_lisp_cons *cons)
374 return ao_lisp_math(cons, builtin_times);
378 ao_lisp_divide(struct ao_lisp_cons *cons)
380 return ao_lisp_math(cons, builtin_divide);
384 ao_lisp_mod(struct ao_lisp_cons *cons)
386 return ao_lisp_math(cons, builtin_mod);
390 ao_lisp_compare(struct ao_lisp_cons *cons, enum ao_lisp_builtin_id op)
395 return _ao_lisp_atom_t;
398 cons = ao_lisp_poly_cons(cons->cdr);
400 ao_poly right = cons->car;
402 if (op == builtin_equal) {
406 uint8_t lt = ao_lisp_poly_type(left);
407 uint8_t rt = ao_lisp_poly_type(right);
408 if (lt == AO_LISP_INT && rt == AO_LISP_INT) {
409 int l = ao_lisp_poly_int(left);
410 int r = ao_lisp_poly_int(right);
417 case builtin_greater:
421 case builtin_less_equal:
425 case builtin_greater_equal:
432 } else if (lt == AO_LISP_STRING && rt == AO_LISP_STRING) {
433 int c = strcmp(ao_lisp_poly_string(left),
434 ao_lisp_poly_string(right));
440 case builtin_greater:
444 case builtin_less_equal:
448 case builtin_greater_equal:
458 cons = ao_lisp_poly_cons(cons->cdr);
460 return _ao_lisp_atom_t;
464 ao_lisp_equal(struct ao_lisp_cons *cons)
466 return ao_lisp_compare(cons, builtin_equal);
470 ao_lisp_less(struct ao_lisp_cons *cons)
472 return ao_lisp_compare(cons, builtin_less);
476 ao_lisp_greater(struct ao_lisp_cons *cons)
478 return ao_lisp_compare(cons, builtin_greater);
482 ao_lisp_less_equal(struct ao_lisp_cons *cons)
484 return ao_lisp_compare(cons, builtin_less_equal);
488 ao_lisp_greater_equal(struct ao_lisp_cons *cons)
490 return ao_lisp_compare(cons, builtin_greater_equal);
494 ao_lisp_pack(struct ao_lisp_cons *cons)
496 if (!ao_lisp_check_argc(_ao_lisp_atom_pack, cons, 1, 1))
498 if (!ao_lisp_check_argt(_ao_lisp_atom_pack, cons, 0, AO_LISP_CONS, 1))
500 return ao_lisp_string_pack(ao_lisp_poly_cons(ao_lisp_arg(cons, 0)));
504 ao_lisp_unpack(struct ao_lisp_cons *cons)
506 if (!ao_lisp_check_argc(_ao_lisp_atom_unpack, cons, 1, 1))
508 if (!ao_lisp_check_argt(_ao_lisp_atom_unpack, cons, 0, AO_LISP_STRING, 0))
510 return ao_lisp_string_unpack(ao_lisp_poly_string(ao_lisp_arg(cons, 0)));
514 ao_lisp_flush(struct ao_lisp_cons *cons)
516 if (!ao_lisp_check_argc(_ao_lisp_atom_flush, cons, 0, 0))
519 return _ao_lisp_atom_t;
523 ao_lisp_led(struct ao_lisp_cons *cons)
526 if (!ao_lisp_check_argc(_ao_lisp_atom_led, cons, 1, 1))
528 if (!ao_lisp_check_argt(_ao_lisp_atom_led, cons, 0, AO_LISP_INT, 0))
530 led = ao_lisp_arg(cons, 0);
531 ao_lisp_os_led(ao_lisp_poly_int(led));
536 ao_lisp_delay(struct ao_lisp_cons *cons)
539 if (!ao_lisp_check_argc(_ao_lisp_atom_led, cons, 1, 1))
541 if (!ao_lisp_check_argt(_ao_lisp_atom_led, cons, 0, AO_LISP_INT, 0))
543 delay = ao_lisp_arg(cons, 0);
544 ao_lisp_os_delay(ao_lisp_poly_int(delay));
549 ao_lisp_do_eval(struct ao_lisp_cons *cons)
551 if (!ao_lisp_check_argc(_ao_lisp_atom_eval, cons, 1, 1))
553 ao_lisp_stack->state = eval_sexpr;
558 ao_lisp_do_read(struct ao_lisp_cons *cons)
560 if (!ao_lisp_check_argc(_ao_lisp_atom_read, cons, 0, 0))
562 return ao_lisp_read();
565 const ao_lisp_func_t ao_lisp_builtins[] = {
566 [builtin_eval] = ao_lisp_do_eval,
567 [builtin_read] = ao_lisp_do_read,
568 [builtin_lambda] = ao_lisp_lambda,
569 [builtin_lexpr] = ao_lisp_lexpr,
570 [builtin_nlambda] = ao_lisp_nlambda,
571 [builtin_macro] = ao_lisp_macro,
572 [builtin_car] = ao_lisp_car,
573 [builtin_cdr] = ao_lisp_cdr,
574 [builtin_cons] = ao_lisp_cons,
575 [builtin_last] = ao_lisp_last,
576 [builtin_length] = ao_lisp_length,
577 [builtin_quote] = ao_lisp_quote,
578 [builtin_set] = ao_lisp_set,
579 [builtin_setq] = ao_lisp_setq,
580 [builtin_cond] = ao_lisp_cond,
581 [builtin_progn] = ao_lisp_progn,
582 [builtin_while] = ao_lisp_while,
583 [builtin_print] = ao_lisp_print,
584 [builtin_patom] = ao_lisp_patom,
585 [builtin_plus] = ao_lisp_plus,
586 [builtin_minus] = ao_lisp_minus,
587 [builtin_times] = ao_lisp_times,
588 [builtin_divide] = ao_lisp_divide,
589 [builtin_mod] = ao_lisp_mod,
590 [builtin_equal] = ao_lisp_equal,
591 [builtin_less] = ao_lisp_less,
592 [builtin_greater] = ao_lisp_greater,
593 [builtin_less_equal] = ao_lisp_less_equal,
594 [builtin_greater_equal] = ao_lisp_greater_equal,
595 [builtin_pack] = ao_lisp_pack,
596 [builtin_unpack] = ao_lisp_unpack,
597 [builtin_flush] = ao_lisp_flush,
598 [builtin_led] = ao_lisp_led,
599 [builtin_delay] = ao_lisp_delay,
600 [builtin_save] = ao_lisp_save,
601 [builtin_restore] = ao_lisp_restore,