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 frame_vals_num_size(int num)
20 return sizeof (struct ao_lisp_frame_vals) + num * sizeof (struct ao_lisp_val);
24 frame_vals_size(void *addr)
26 struct ao_lisp_frame_vals *vals = addr;
27 return frame_vals_num_size(vals->size);
31 frame_vals_mark(void *addr)
33 struct ao_lisp_frame_vals *vals = addr;
36 for (f = 0; f < vals->size; f++) {
37 struct ao_lisp_val *v = &vals->vals[f];
39 ao_lisp_poly_mark(v->val, 0);
40 MDBG_MOVE("frame mark atom %s %d val %d at %d ",
41 ao_lisp_poly_atom(v->atom)->name,
42 MDBG_OFFSET(ao_lisp_ref(v->atom)),
43 MDBG_OFFSET(ao_lisp_ref(v->val)), f);
44 MDBG_DO(ao_lisp_poly_write(v->val));
45 MDBG_DO(printf("\n"));
50 frame_vals_move(void *addr)
52 struct ao_lisp_frame_vals *vals = addr;
55 for (f = 0; f < vals->size; f++) {
56 struct ao_lisp_val *v = &vals->vals[f];
58 ao_lisp_poly_move(&v->atom, 0);
59 ao_lisp_poly_move(&v->val, 0);
60 MDBG_MOVE("frame move atom %s %d val %d at %d\n",
61 ao_lisp_poly_atom(v->atom)->name,
62 MDBG_OFFSET(ao_lisp_ref(v->atom)),
63 MDBG_OFFSET(ao_lisp_ref(v->val)), f);
67 const struct ao_lisp_type ao_lisp_frame_vals_type = {
68 .mark = frame_vals_mark,
69 .size = frame_vals_size,
70 .move = frame_vals_move,
75 frame_size(void *addr)
78 return sizeof (struct ao_lisp_frame);
82 frame_mark(void *addr)
84 struct ao_lisp_frame *frame = addr;
87 MDBG_MOVE("frame mark %d\n", MDBG_OFFSET(frame));
88 if (!AO_LISP_IS_POOL(frame))
90 ao_lisp_poly_mark(frame->vals, 0);
91 frame = ao_lisp_poly_frame(frame->prev);
92 MDBG_MOVE("frame next %d\n", MDBG_OFFSET(frame));
95 if (ao_lisp_mark_memory(&ao_lisp_frame_type, frame))
101 frame_move(void *addr)
103 struct ao_lisp_frame *frame = addr;
106 struct ao_lisp_frame *prev;
109 MDBG_MOVE("frame move %d\n", MDBG_OFFSET(frame));
110 if (!AO_LISP_IS_POOL(frame))
112 ao_lisp_poly_move(&frame->vals, 0);
113 prev = ao_lisp_poly_frame(frame->prev);
116 ret = ao_lisp_move_memory(&ao_lisp_frame_type, (void **) &prev);
117 if (prev != ao_lisp_poly_frame(frame->prev)) {
118 MDBG_MOVE("frame prev moved from %d to %d\n",
119 MDBG_OFFSET(ao_lisp_poly_frame(frame->prev)),
121 frame->prev = ao_lisp_frame_poly(prev);
129 const struct ao_lisp_type ao_lisp_frame_type = {
137 ao_lisp_frame_write(ao_poly p)
139 struct ao_lisp_frame *frame = ao_lisp_poly_frame(p);
140 struct ao_lisp_frame_vals *vals = ao_lisp_poly_frame_vals(frame->vals);
145 if (frame->type & AO_LISP_FRAME_PRINT)
146 printf("recurse...");
148 frame->type |= AO_LISP_FRAME_PRINT;
149 for (f = 0; f < frame->num; f++) {
152 ao_lisp_poly_write(vals->vals[f].atom);
154 ao_lisp_poly_write(vals->vals[f].val);
157 ao_lisp_poly_write(frame->prev);
158 frame->type &= ~AO_LISP_FRAME_PRINT;
165 ao_lisp_frame_find(struct ao_lisp_frame *frame, int top, ao_poly atom)
167 struct ao_lisp_frame_vals *vals = ao_lisp_poly_frame_vals(frame->vals);
172 int m = (l + r) >> 1;
173 if (vals->vals[m].atom < atom)
182 ao_lisp_frame_ref(struct ao_lisp_frame *frame, ao_poly atom)
184 struct ao_lisp_frame_vals *vals = ao_lisp_poly_frame_vals(frame->vals);
185 int l = ao_lisp_frame_find(frame, frame->num, atom);
190 if (vals->vals[l].atom != atom)
192 return &vals->vals[l].val;
195 struct ao_lisp_frame *ao_lisp_frame_free_list[AO_LISP_FRAME_FREE];
197 static struct ao_lisp_frame_vals *
198 ao_lisp_frame_vals_new(int num)
200 struct ao_lisp_frame_vals *vals;
202 vals = ao_lisp_alloc(frame_vals_num_size(num));
205 vals->type = AO_LISP_FRAME_VALS;
207 memset(vals->vals, '\0', num * sizeof (struct ao_lisp_val));
211 struct ao_lisp_frame *
212 ao_lisp_frame_new(int num)
214 struct ao_lisp_frame *frame;
215 struct ao_lisp_frame_vals *vals;
217 if (num < AO_LISP_FRAME_FREE && (frame = ao_lisp_frame_free_list[num])) {
218 ao_lisp_frame_free_list[num] = ao_lisp_poly_frame(frame->prev);
219 vals = ao_lisp_poly_frame_vals(frame->vals);
221 frame = ao_lisp_alloc(sizeof (struct ao_lisp_frame));
224 frame->type = AO_LISP_FRAME;
226 frame->prev = AO_LISP_NIL;
227 frame->vals = AO_LISP_NIL;
228 ao_lisp_poly_stash(0, ao_lisp_frame_poly(frame));
229 vals = ao_lisp_frame_vals_new(num);
230 frame = ao_lisp_poly_frame(ao_lisp_poly_fetch(0));
231 frame->vals = ao_lisp_frame_vals_poly(vals);
234 frame->prev = AO_LISP_NIL;
239 ao_lisp_frame_mark(struct ao_lisp_frame *frame)
243 frame->type |= AO_LISP_FRAME_MARK;
244 return ao_lisp_frame_poly(frame);
248 ao_lisp_frame_free(struct ao_lisp_frame *frame)
250 if (frame && !ao_lisp_frame_marked(frame)) {
251 int num = frame->num;
252 if (num < AO_LISP_FRAME_FREE) {
253 struct ao_lisp_frame_vals *vals;
255 vals = ao_lisp_poly_frame_vals(frame->vals);
256 memset(vals->vals, '\0', vals->size * sizeof (struct ao_lisp_val));
257 frame->prev = ao_lisp_frame_poly(ao_lisp_frame_free_list[num]);
258 ao_lisp_frame_free_list[num] = frame;
263 static struct ao_lisp_frame *
264 ao_lisp_frame_realloc(struct ao_lisp_frame *frame, int new_num)
266 struct ao_lisp_frame_vals *vals;
267 struct ao_lisp_frame_vals *new_vals;
270 if (new_num == frame->num)
272 ao_lisp_frame_stash(0, frame);
273 new_vals = ao_lisp_frame_vals_new(new_num);
276 frame = ao_lisp_frame_fetch(0);
277 vals = ao_lisp_poly_frame_vals(frame->vals);
279 if (copy > frame->num)
281 memcpy(new_vals->vals, vals->vals, copy * sizeof (struct ao_lisp_val));
282 frame->vals = ao_lisp_frame_vals_poly(new_vals);
283 frame->num = new_num;
288 ao_lisp_frame_bind(struct ao_lisp_frame *frame, int num, ao_poly atom, ao_poly val)
290 struct ao_lisp_frame_vals *vals = ao_lisp_poly_frame_vals(frame->vals);
291 int l = ao_lisp_frame_find(frame, num, atom);
293 memmove(&vals->vals[l+1],
295 (num - l) * sizeof (struct ao_lisp_val));
296 vals->vals[l].atom = atom;
297 vals->vals[l].val = val;
301 ao_lisp_frame_add(struct ao_lisp_frame *frame, ao_poly atom, ao_poly val)
303 ao_poly *ref = frame ? ao_lisp_frame_ref(frame, atom) : NULL;
307 ao_lisp_poly_stash(0, atom);
308 ao_lisp_poly_stash(1, val);
310 frame = ao_lisp_frame_realloc(frame, f + 1);
313 atom = ao_lisp_poly_fetch(0);
314 val = ao_lisp_poly_fetch(1);
315 ao_lisp_frame_bind(frame, frame->num - 1, atom, val);
321 struct ao_lisp_frame *ao_lisp_frame_global;
322 struct ao_lisp_frame *ao_lisp_frame_current;
325 ao_lisp_frame_init(void)
327 if (!ao_lisp_frame_global)
328 ao_lisp_frame_global = ao_lisp_frame_new(0);