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.
17 static void cons_mark(void *addr)
19 struct ao_lisp_cons *cons = addr;
22 ao_poly cdr = cons->cdr;
24 ao_lisp_poly_mark(cons->car, 1);
27 if (ao_lisp_poly_type(cdr) != AO_LISP_CONS) {
28 ao_lisp_poly_mark(cdr, 1);
31 cons = ao_lisp_poly_cons(cdr);
32 if (ao_lisp_mark_memory(&ao_lisp_cons_type, cons))
37 static int cons_size(void *addr)
40 return sizeof (struct ao_lisp_cons);
43 static void cons_move(void *addr)
45 struct ao_lisp_cons *cons = addr;
52 struct ao_lisp_cons *c;
55 MDBG_MOVE("cons_move start %d (%d, %d)\n",
56 MDBG_OFFSET(cons), MDBG_OFFSET(ao_lisp_ref(cons->car)), MDBG_OFFSET(ao_lisp_ref(cons->cdr)));
57 (void) ao_lisp_poly_move(&cons->car, 1);
61 if (ao_lisp_poly_type(cdr) != AO_LISP_CONS) {
62 (void) ao_lisp_poly_move(&cons->cdr, 1);
65 c = ao_lisp_poly_cons(cdr);
66 ret = ao_lisp_move_memory(&ao_lisp_cons_type, (void **) &c);
67 if (c != ao_lisp_poly_cons(cons->cdr))
68 cons->cdr = ao_lisp_cons_poly(c);
69 MDBG_MOVE("cons_move end %d (%d, %d)\n",
70 MDBG_OFFSET(cons), MDBG_OFFSET(ao_lisp_ref(cons->car)), MDBG_OFFSET(ao_lisp_ref(cons->cdr)));
77 const struct ao_lisp_type ao_lisp_cons_type = {
84 struct ao_lisp_cons *ao_lisp_cons_free_list;
87 ao_lisp_cons_cons(ao_poly car, ao_poly cdr)
89 struct ao_lisp_cons *cons;
91 if (ao_lisp_cons_free_list) {
92 cons = ao_lisp_cons_free_list;
93 ao_lisp_cons_free_list = ao_lisp_poly_cons(cons->cdr);
95 ao_lisp_poly_stash(0, car);
96 ao_lisp_poly_stash(1, cdr);
97 cons = ao_lisp_alloc(sizeof (struct ao_lisp_cons));
98 car = ao_lisp_poly_fetch(0);
99 cdr = ao_lisp_poly_fetch(1);
108 struct ao_lisp_cons *
109 ao_lisp_cons_cdr(struct ao_lisp_cons *cons)
111 ao_poly cdr = cons->cdr;
112 if (cdr == AO_LISP_NIL)
114 if (ao_lisp_poly_type(cdr) != AO_LISP_CONS) {
115 (void) ao_lisp_error(AO_LISP_INVALID, "improper list");
118 return ao_lisp_poly_cons(cdr);
122 ao_lisp__cons(ao_poly car, ao_poly cdr)
124 return ao_lisp_cons_poly(ao_lisp_cons_cons(car, cdr));
128 ao_lisp_cons_free(struct ao_lisp_cons *cons)
131 ao_poly cdr = cons->cdr;
132 cons->cdr = ao_lisp_cons_poly(ao_lisp_cons_free_list);
133 ao_lisp_cons_free_list = cons;
134 cons = ao_lisp_poly_cons(cdr);
139 ao_lisp_cons_write(ao_poly c)
141 struct ao_lisp_cons *cons = ao_lisp_poly_cons(c);
147 ao_lisp_poly_write(cons->car);
149 if (ao_lisp_poly_type(c) == AO_LISP_CONS) {
150 cons = ao_lisp_poly_cons(c);
154 ao_lisp_poly_write(c);
162 ao_lisp_cons_display(ao_poly c)
164 struct ao_lisp_cons *cons = ao_lisp_poly_cons(c);
167 ao_lisp_poly_display(cons->car);
168 cons = ao_lisp_poly_cons(cons->cdr);
173 ao_lisp_cons_length(struct ao_lisp_cons *cons)
178 cons = ao_lisp_poly_cons(cons->cdr);