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,
88 ao_lisp_builtin_name(enum ao_lisp_builtin_id b) {
89 if (b < _builtin_last)
90 return ao_lisp_poly_atom(builtin_names[b])->name;
94 static const ao_poly ao_lisp_args_atoms[] = {
95 [AO_LISP_FUNC_LAMBDA] = _ao_lisp_atom_lambda,
96 [AO_LISP_FUNC_LEXPR] = _ao_lisp_atom_lexpr,
97 [AO_LISP_FUNC_NLAMBDA] = _ao_lisp_atom_nlambda,
98 [AO_LISP_FUNC_MACRO] = _ao_lisp_atom_macro,
102 ao_lisp_args_name(uint8_t args)
104 if (args < sizeof ao_lisp_args_atoms / sizeof ao_lisp_args_atoms[0])
105 return ao_lisp_poly_atom(ao_lisp_args_atoms[args])->name;
111 ao_lisp_builtin_print(ao_poly b)
113 struct ao_lisp_builtin *builtin = ao_lisp_poly_builtin(b);
114 printf("[builtin %s %s]",
115 ao_lisp_args_name(builtin->args),
116 ao_lisp_builtin_name(builtin->func));
120 ao_lisp_check_argc(ao_poly name, struct ao_lisp_cons *cons, int min, int max)
124 while (cons && argc <= max) {
126 cons = ao_lisp_poly_cons(cons->cdr);
128 if (argc < min || argc > max)
129 return ao_lisp_error(AO_LISP_INVALID, "%s: invalid arg count", ao_lisp_poly_atom(name)->name);
130 return _ao_lisp_atom_t;
134 ao_lisp_arg(struct ao_lisp_cons *cons, int argc)
141 cons = ao_lisp_poly_cons(cons->cdr);
147 ao_lisp_check_argt(ao_poly name, struct ao_lisp_cons *cons, int argc, int type, int nil_ok)
149 ao_poly car = ao_lisp_arg(cons, argc);
151 if ((!car && !nil_ok) || ao_lisp_poly_type(car) != type)
152 return ao_lisp_error(AO_LISP_INVALID, "%s: invalid type for arg %d", ao_lisp_poly_atom(name)->name, argc);
153 return _ao_lisp_atom_t;
157 ao_lisp_car(struct ao_lisp_cons *cons)
159 if (!ao_lisp_check_argc(_ao_lisp_atom_car, cons, 1, 1))
161 if (!ao_lisp_check_argt(_ao_lisp_atom_car, cons, 0, AO_LISP_CONS, 0))
163 return ao_lisp_poly_cons(cons->car)->car;
167 ao_lisp_cdr(struct ao_lisp_cons *cons)
169 if (!ao_lisp_check_argc(_ao_lisp_atom_cdr, cons, 1, 1))
171 if (!ao_lisp_check_argt(_ao_lisp_atom_cdr, cons, 0, AO_LISP_CONS, 0))
173 return ao_lisp_poly_cons(cons->car)->cdr;
177 ao_lisp_cons(struct ao_lisp_cons *cons)
180 if(!ao_lisp_check_argc(_ao_lisp_atom_cons, cons, 2, 2))
182 if (!ao_lisp_check_argt(_ao_lisp_atom_cons, cons, 1, AO_LISP_CONS, 1))
184 car = ao_lisp_arg(cons, 0);
185 cdr = ao_lisp_arg(cons, 1);
186 return ao_lisp_cons_poly(ao_lisp_cons_cons(car, ao_lisp_poly_cons(cdr)));
190 ao_lisp_last(struct ao_lisp_cons *cons)
193 if (!ao_lisp_check_argc(_ao_lisp_atom_last, cons, 1, 1))
195 if (!ao_lisp_check_argt(_ao_lisp_atom_last, cons, 0, AO_LISP_CONS, 1))
197 l = ao_lisp_arg(cons, 0);
199 struct ao_lisp_cons *list = ao_lisp_poly_cons(l);
208 ao_lisp_length(struct ao_lisp_cons *cons)
210 if (!ao_lisp_check_argc(_ao_lisp_atom_last, cons, 1, 1))
212 if (!ao_lisp_check_argt(_ao_lisp_atom_last, cons, 0, AO_LISP_CONS, 1))
214 return ao_lisp_int_poly(ao_lisp_cons_length(ao_lisp_poly_cons(ao_lisp_arg(cons, 0))));
218 ao_lisp_quote(struct ao_lisp_cons *cons)
220 if (!ao_lisp_check_argc(_ao_lisp_atom_quote, cons, 1, 1))
222 return ao_lisp_arg(cons, 0);
226 ao_lisp_set(struct ao_lisp_cons *cons)
228 if (!ao_lisp_check_argc(_ao_lisp_atom_set, cons, 2, 2))
230 if (!ao_lisp_check_argt(_ao_lisp_atom_set, cons, 0, AO_LISP_ATOM, 0))
233 return ao_lisp_atom_set(ao_lisp_arg(cons, 0), ao_lisp_arg(cons, 1));
237 ao_lisp_setq(struct ao_lisp_cons *cons)
239 struct ao_lisp_cons *expand = 0;
240 if (!ao_lisp_check_argc(_ao_lisp_atom_setq, cons, 2, 2))
242 expand = ao_lisp_cons_cons(_ao_lisp_atom_set,
243 ao_lisp_cons_cons(ao_lisp_cons_poly(ao_lisp_cons_cons(_ao_lisp_atom_quote,
244 ao_lisp_cons_cons(cons->car, NULL))),
245 ao_lisp_poly_cons(cons->cdr)));
246 return ao_lisp_cons_poly(expand);
250 ao_lisp_cond(struct ao_lisp_cons *cons)
252 ao_lisp_set_cond(cons);
257 ao_lisp_progn(struct ao_lisp_cons *cons)
259 ao_lisp_stack->state = eval_progn;
260 ao_lisp_stack->sexprs = ao_lisp_cons_poly(cons);
265 ao_lisp_while(struct ao_lisp_cons *cons)
267 ao_lisp_stack->state = eval_while;
268 ao_lisp_stack->sexprs = ao_lisp_cons_poly(cons);
273 ao_lisp_print(struct ao_lisp_cons *cons)
275 ao_poly val = AO_LISP_NIL;
278 ao_lisp_poly_print(val);
279 cons = ao_lisp_poly_cons(cons->cdr);
288 ao_lisp_patom(struct ao_lisp_cons *cons)
290 ao_poly val = AO_LISP_NIL;
293 ao_lisp_poly_patom(val);
294 cons = ao_lisp_poly_cons(cons->cdr);
300 ao_lisp_math(struct ao_lisp_cons *cons, enum ao_lisp_builtin_id op)
302 ao_poly ret = AO_LISP_NIL;
305 ao_poly car = cons->car;
306 uint8_t rt = ao_lisp_poly_type(ret);
307 uint8_t ct = ao_lisp_poly_type(car);
309 cons = ao_lisp_poly_cons(cons->cdr);
311 if (rt == AO_LISP_NIL)
314 else if (rt == AO_LISP_INT && ct == AO_LISP_INT) {
315 int r = ao_lisp_poly_int(ret);
316 int c = ao_lisp_poly_int(car);
330 return ao_lisp_error(AO_LISP_DIVIDE_BY_ZERO, "divide by zero");
335 return ao_lisp_error(AO_LISP_DIVIDE_BY_ZERO, "mod by zero");
341 ret = ao_lisp_int_poly(r);
344 else if (rt == AO_LISP_STRING && ct == AO_LISP_STRING && op == builtin_plus)
345 ret = ao_lisp_string_poly(ao_lisp_string_cat(ao_lisp_poly_string(ret),
346 ao_lisp_poly_string(car)));
348 return ao_lisp_error(AO_LISP_INVALID, "invalid args");
354 ao_lisp_plus(struct ao_lisp_cons *cons)
356 return ao_lisp_math(cons, builtin_plus);
360 ao_lisp_minus(struct ao_lisp_cons *cons)
362 return ao_lisp_math(cons, builtin_minus);
366 ao_lisp_times(struct ao_lisp_cons *cons)
368 return ao_lisp_math(cons, builtin_times);
372 ao_lisp_divide(struct ao_lisp_cons *cons)
374 return ao_lisp_math(cons, builtin_divide);
378 ao_lisp_mod(struct ao_lisp_cons *cons)
380 return ao_lisp_math(cons, builtin_mod);
384 ao_lisp_compare(struct ao_lisp_cons *cons, enum ao_lisp_builtin_id op)
389 return _ao_lisp_atom_t;
392 cons = ao_lisp_poly_cons(cons->cdr);
394 ao_poly right = cons->car;
396 if (op == builtin_equal) {
400 uint8_t lt = ao_lisp_poly_type(left);
401 uint8_t rt = ao_lisp_poly_type(right);
402 if (lt == AO_LISP_INT && rt == AO_LISP_INT) {
403 int l = ao_lisp_poly_int(left);
404 int r = ao_lisp_poly_int(right);
411 case builtin_greater:
415 case builtin_less_equal:
419 case builtin_greater_equal:
426 } else if (lt == AO_LISP_STRING && rt == AO_LISP_STRING) {
427 int c = strcmp(ao_lisp_poly_string(left),
428 ao_lisp_poly_string(right));
434 case builtin_greater:
438 case builtin_less_equal:
442 case builtin_greater_equal:
452 cons = ao_lisp_poly_cons(cons->cdr);
454 return _ao_lisp_atom_t;
458 ao_lisp_equal(struct ao_lisp_cons *cons)
460 return ao_lisp_compare(cons, builtin_equal);
464 ao_lisp_less(struct ao_lisp_cons *cons)
466 return ao_lisp_compare(cons, builtin_less);
470 ao_lisp_greater(struct ao_lisp_cons *cons)
472 return ao_lisp_compare(cons, builtin_greater);
476 ao_lisp_less_equal(struct ao_lisp_cons *cons)
478 return ao_lisp_compare(cons, builtin_less_equal);
482 ao_lisp_greater_equal(struct ao_lisp_cons *cons)
484 return ao_lisp_compare(cons, builtin_greater_equal);
488 ao_lisp_pack(struct ao_lisp_cons *cons)
490 if (!ao_lisp_check_argc(_ao_lisp_atom_pack, cons, 1, 1))
492 if (!ao_lisp_check_argt(_ao_lisp_atom_pack, cons, 0, AO_LISP_CONS, 1))
494 return ao_lisp_string_pack(ao_lisp_poly_cons(ao_lisp_arg(cons, 0)));
498 ao_lisp_unpack(struct ao_lisp_cons *cons)
500 if (!ao_lisp_check_argc(_ao_lisp_atom_unpack, cons, 1, 1))
502 if (!ao_lisp_check_argt(_ao_lisp_atom_unpack, cons, 0, AO_LISP_STRING, 0))
504 return ao_lisp_string_unpack(ao_lisp_poly_string(ao_lisp_arg(cons, 0)));
508 ao_lisp_flush(struct ao_lisp_cons *cons)
510 if (!ao_lisp_check_argc(_ao_lisp_atom_flush, cons, 0, 0))
513 return _ao_lisp_atom_t;
517 ao_lisp_led(struct ao_lisp_cons *cons)
520 if (!ao_lisp_check_argc(_ao_lisp_atom_led, cons, 1, 1))
522 if (!ao_lisp_check_argt(_ao_lisp_atom_led, cons, 0, AO_LISP_INT, 0))
524 led = ao_lisp_arg(cons, 0);
525 ao_lisp_os_led(ao_lisp_poly_int(led));
530 ao_lisp_delay(struct ao_lisp_cons *cons)
533 if (!ao_lisp_check_argc(_ao_lisp_atom_led, cons, 1, 1))
535 if (!ao_lisp_check_argt(_ao_lisp_atom_led, cons, 0, AO_LISP_INT, 0))
537 delay = ao_lisp_arg(cons, 0);
538 ao_lisp_os_delay(ao_lisp_poly_int(delay));
543 ao_lisp_do_eval(struct ao_lisp_cons *cons)
545 if (!ao_lisp_check_argc(_ao_lisp_atom_eval, cons, 1, 1))
547 ao_lisp_stack->state = eval_sexpr;
552 ao_lisp_do_read(struct ao_lisp_cons *cons)
554 if (!ao_lisp_check_argc(_ao_lisp_atom_read, cons, 0, 0))
556 return ao_lisp_read();
559 const ao_lisp_func_t ao_lisp_builtins[] = {
560 [builtin_eval] = ao_lisp_do_eval,
561 [builtin_read] = ao_lisp_do_read,
562 [builtin_lambda] = ao_lisp_lambda,
563 [builtin_lexpr] = ao_lisp_lexpr,
564 [builtin_nlambda] = ao_lisp_nlambda,
565 [builtin_macro] = ao_lisp_macro,
566 [builtin_car] = ao_lisp_car,
567 [builtin_cdr] = ao_lisp_cdr,
568 [builtin_cons] = ao_lisp_cons,
569 [builtin_last] = ao_lisp_last,
570 [builtin_length] = ao_lisp_length,
571 [builtin_quote] = ao_lisp_quote,
572 [builtin_set] = ao_lisp_set,
573 [builtin_setq] = ao_lisp_setq,
574 [builtin_cond] = ao_lisp_cond,
575 [builtin_progn] = ao_lisp_progn,
576 [builtin_while] = ao_lisp_while,
577 [builtin_print] = ao_lisp_print,
578 [builtin_patom] = ao_lisp_patom,
579 [builtin_plus] = ao_lisp_plus,
580 [builtin_minus] = ao_lisp_minus,
581 [builtin_times] = ao_lisp_times,
582 [builtin_divide] = ao_lisp_divide,
583 [builtin_mod] = ao_lisp_mod,
584 [builtin_equal] = ao_lisp_equal,
585 [builtin_less] = ao_lisp_less,
586 [builtin_greater] = ao_lisp_greater,
587 [builtin_less_equal] = ao_lisp_less_equal,
588 [builtin_greater_equal] = ao_lisp_greater_equal,
589 [builtin_pack] = ao_lisp_pack,
590 [builtin_unpack] = ao_lisp_unpack,
591 [builtin_flush] = ao_lisp_flush,
592 [builtin_led] = ao_lisp_led,
593 [builtin_delay] = ao_lisp_delay,