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.
15 #define AO_LISP_CONST_BITS
20 #ifdef AO_LISP_MAKE_CONST
23 * When building the constant table, it is the
24 * pool for allocations.
28 uint8_t ao_lisp_const[AO_LISP_POOL_CONST] __attribute__((aligned(4)));
29 #define ao_lisp_pool ao_lisp_const
31 #define AO_LISP_POOL AO_LISP_POOL_CONST
35 uint8_t ao_lisp_pool[AO_LISP_POOL + AO_LISP_POOL_EXTRA] __attribute__((aligned(4)));
41 int dbg_mem = DBG_MEM_START;
44 struct ao_lisp_record {
45 struct ao_lisp_record *next;
46 const struct ao_lisp_type *type;
51 static struct ao_lisp_record *record_head, **record_tail;
54 ao_lisp_record_free(struct ao_lisp_record *record)
57 struct ao_lisp_record *next = record->next;
64 ao_lisp_record_reset(void)
66 ao_lisp_record_free(record_head);
68 record_tail = &record_head;
72 ao_lisp_record(const struct ao_lisp_type *type,
76 struct ao_lisp_record *r = malloc(sizeof (struct ao_lisp_record));
83 record_tail = &r->next;
86 static struct ao_lisp_record *
87 ao_lisp_record_save(void)
89 struct ao_lisp_record *r = record_head;
92 record_tail = &record_head;
97 ao_lisp_record_compare(char *where,
98 struct ao_lisp_record *a,
99 struct ao_lisp_record *b)
102 if (a->type != b->type || a->size != b->size) {
103 printf("%s record difers %d %s %d -> %d %s %d\n",
105 MDBG_OFFSET(a->addr),
108 MDBG_OFFSET(b->addr),
117 printf("%s record differs %d %s %d -> NULL\n",
119 MDBG_OFFSET(a->addr),
125 printf("%s record differs NULL -> %d %s %d\n",
127 MDBG_OFFSET(b->addr),
135 #define ao_lisp_record_reset()
138 uint8_t ao_lisp_exception;
140 struct ao_lisp_root {
141 const struct ao_lisp_type *type;
145 static struct ao_lisp_cons *save_cons[2];
146 static char *save_string[2];
147 static ao_poly save_poly[3];
149 static const struct ao_lisp_root ao_lisp_root[] = {
151 .type = &ao_lisp_cons_type,
152 .addr = (void **) &save_cons[0],
155 .type = &ao_lisp_cons_type,
156 .addr = (void **) &save_cons[1],
159 .type = &ao_lisp_string_type,
160 .addr = (void **) &save_string[0],
163 .type = &ao_lisp_string_type,
164 .addr = (void **) &save_string[1],
168 .addr = (void **) &save_poly[0]
172 .addr = (void **) &save_poly[1]
176 .addr = (void **) &save_poly[2]
179 .type = &ao_lisp_atom_type,
180 .addr = (void **) &ao_lisp_atoms
183 .type = &ao_lisp_frame_type,
184 .addr = (void **) &ao_lisp_frame_global,
187 .type = &ao_lisp_frame_type,
188 .addr = (void **) &ao_lisp_frame_current,
191 .type = &ao_lisp_stack_type,
192 .addr = (void **) &ao_lisp_stack,
196 .addr = (void **) &ao_lisp_v,
199 .type = &ao_lisp_cons_type,
200 .addr = (void **) &ao_lisp_read_cons,
203 .type = &ao_lisp_cons_type,
204 .addr = (void **) &ao_lisp_read_cons_tail,
207 .type = &ao_lisp_cons_type,
208 .addr = (void **) &ao_lisp_read_stack,
212 #define AO_LISP_ROOT (sizeof (ao_lisp_root) / sizeof (ao_lisp_root[0]))
214 static const void ** const ao_lisp_cache[] = {
215 (const void **) &ao_lisp_cons_free_list,
216 (const void **) &ao_lisp_stack_free_list,
217 (const void **) &ao_lisp_frame_free_list[0],
218 (const void **) &ao_lisp_frame_free_list[1],
219 (const void **) &ao_lisp_frame_free_list[2],
220 (const void **) &ao_lisp_frame_free_list[3],
223 #if AO_LISP_FRAME_FREE != 4
224 #error Unexpected AO_LISP_FRAME_FREE value
227 #define AO_LISP_CACHE (sizeof (ao_lisp_cache) / sizeof (ao_lisp_cache[0]))
229 #define AO_LISP_BUSY_SIZE ((AO_LISP_POOL + 31) / 32)
231 static uint8_t ao_lisp_busy[AO_LISP_BUSY_SIZE];
232 static uint8_t ao_lisp_cons_note[AO_LISP_BUSY_SIZE];
233 static uint8_t ao_lisp_cons_last[AO_LISP_BUSY_SIZE];
234 static uint8_t ao_lisp_cons_noted;
236 uint16_t ao_lisp_top;
238 struct ao_lisp_chunk {
246 #define AO_LISP_NCHUNK 64
248 static struct ao_lisp_chunk ao_lisp_chunk[AO_LISP_NCHUNK];
250 /* Offset of an address within the pool. */
251 static inline uint16_t pool_offset(void *addr) {
253 if (!AO_LISP_IS_POOL(addr))
256 return ((uint8_t *) addr) - ao_lisp_pool;
259 static inline void mark(uint8_t *tag, int offset) {
260 int byte = offset >> 5;
261 int bit = (offset >> 2) & 7;
262 tag[byte] |= (1 << bit);
265 static inline void clear(uint8_t *tag, int offset) {
266 int byte = offset >> 5;
267 int bit = (offset >> 2) & 7;
268 tag[byte] &= ~(1 << bit);
271 static inline int busy(uint8_t *tag, int offset) {
272 int byte = offset >> 5;
273 int bit = (offset >> 2) & 7;
274 return (tag[byte] >> bit) & 1;
277 static inline int min(int a, int b) { return a < b ? a : b; }
278 static inline int max(int a, int b) { return a > b ? a : b; }
280 static inline int limit(int offset) {
281 return min(AO_LISP_POOL, max(offset, 0));
284 static int total_marked;
287 note_cons(void *addr)
289 if (AO_LISP_IS_POOL(addr)) {
290 int offset = pool_offset(addr);
291 MDBG_MOVE("note cons %d\n", MDBG_OFFSET(addr));
292 ao_lisp_cons_noted = 1;
293 mark(ao_lisp_cons_note, offset);
297 static uint16_t chunk_low, chunk_high;
298 static uint16_t chunk_first, chunk_last;
299 static int chunk_busy;
302 note_chunk(uint16_t addr, uint16_t size)
306 if (addr < chunk_low || chunk_high <= addr)
309 /* Binary search for the location */
313 int m = (l + r) >> 1;
314 if (ao_lisp_chunk[m].old_addr < addr)
320 * The correct location is always in 'l', with r = l-1 being
321 * the entry before the right one
325 /* Off the right side */
326 if (l >= AO_LISP_NCHUNK)
329 /* Off the left side */
330 if (l == 0 && chunk_busy && addr > ao_lisp_chunk[0].old_addr)
334 /* Shuffle existing entries right */
335 int end = min(AO_LISP_NCHUNK, chunk_busy + 1);
337 memmove(&ao_lisp_chunk[l+1],
339 (end - (l+1)) * sizeof (struct ao_lisp_chunk));
342 ao_lisp_chunk[l].old_addr = addr;
343 ao_lisp_chunk[l].size = size;
345 /* Increment the number of elements up to the size of the array */
346 if (chunk_busy < AO_LISP_NCHUNK)
349 /* Set the top address if the array is full */
350 if (chunk_busy == AO_LISP_NCHUNK)
351 chunk_high = ao_lisp_chunk[AO_LISP_NCHUNK-1].old_addr +
352 ao_lisp_chunk[AO_LISP_NCHUNK-1].size;
358 memset(ao_lisp_chunk, '\0', sizeof (ao_lisp_chunk));
359 chunk_high = ao_lisp_top;
364 * Walk all referenced objects calling functions on each one
368 walk(int (*visit_addr)(const struct ao_lisp_type *type, void **addr),
369 int (*visit_poly)(ao_poly *p, uint8_t do_note_cons))
374 ao_lisp_record_reset();
375 memset(ao_lisp_busy, '\0', sizeof (ao_lisp_busy));
376 memset(ao_lisp_cons_note, '\0', sizeof (ao_lisp_cons_note));
377 ao_lisp_cons_noted = 0;
378 for (i = 0; i < (int) AO_LISP_ROOT; i++) {
379 if (ao_lisp_root[i].type) {
380 void **a = ao_lisp_root[i].addr, *v;
382 MDBG_MOVE("root ptr %d\n", MDBG_OFFSET(v));
383 visit_addr(ao_lisp_root[i].type, a);
386 ao_poly *a = (ao_poly *) ao_lisp_root[i].addr, p;
388 MDBG_MOVE("root poly %d\n", MDBG_OFFSET(ao_lisp_ref(p)));
393 while (ao_lisp_cons_noted) {
394 memcpy(ao_lisp_cons_last, ao_lisp_cons_note, sizeof (ao_lisp_cons_note));
395 memset(ao_lisp_cons_note, '\0', sizeof (ao_lisp_cons_note));
396 ao_lisp_cons_noted = 0;
397 for (i = 0; i < AO_LISP_POOL; i += 4) {
398 if (busy(ao_lisp_cons_last, i)) {
399 void *v = ao_lisp_pool + i;
400 MDBG_MOVE("root cons %d\n", MDBG_OFFSET(v));
401 visit_addr(&ao_lisp_cons_type, &v);
413 for (i = 0; i < ao_lisp_top; i += 4) {
414 if ((i & 0xff) == 0) {
418 else if ((i & 0x1f) == 0)
420 if (busy(ao_lisp_busy, i))
427 #define DUMP_BUSY() dump_busy()
432 static const struct ao_lisp_type const *ao_lisp_types[AO_LISP_NUM_TYPE] = {
433 [AO_LISP_CONS] = &ao_lisp_cons_type,
434 [AO_LISP_INT] = NULL,
435 [AO_LISP_STRING] = &ao_lisp_string_type,
436 [AO_LISP_OTHER] = (void *) 0x1,
437 [AO_LISP_ATOM] = &ao_lisp_atom_type,
438 [AO_LISP_BUILTIN] = &ao_lisp_builtin_type,
439 [AO_LISP_FRAME] = &ao_lisp_frame_type,
440 [AO_LISP_LAMBDA] = &ao_lisp_lambda_type,
441 [AO_LISP_STACK] = &ao_lisp_stack_type,
445 ao_lisp_mark_ref(const struct ao_lisp_type *type, void **ref)
447 return ao_lisp_mark(type, *ref);
451 ao_lisp_poly_mark_ref(ao_poly *p, uint8_t do_note_cons)
453 return ao_lisp_poly_mark(*p, do_note_cons);
456 int ao_lisp_collects[2];
457 int ao_lisp_freed[2];
458 int ao_lisp_loops[2];
460 int ao_lisp_last_top;
463 ao_lisp_collect(uint8_t style)
472 struct ao_lisp_record *mark_record = NULL, *move_record = NULL;
474 MDBG_MOVE("collect %d\n", ao_lisp_collects);
478 /* The first time through, we're doing a full collect */
479 if (ao_lisp_last_top == 0)
480 style = AO_LISP_COLLECT_FULL;
482 /* Clear references to all caches */
483 for (i = 0; i < (int) AO_LISP_CACHE; i++)
484 *ao_lisp_cache[i] = NULL;
485 if (style == AO_LISP_COLLECT_FULL) {
488 chunk_low = top = ao_lisp_last_top;
492 MDBG_MOVE("move chunks from %d to %d\n", chunk_low, top);
493 /* Find the sizes of the first chunk of objects to move */
495 walk(ao_lisp_mark_ref, ao_lisp_poly_mark_ref);
497 marked = total_marked;
499 ao_lisp_record_free(mark_record);
500 mark_record = ao_lisp_record_save();
501 if (mark_record && move_record)
502 ao_lisp_record_compare("mark", move_record, mark_record);
504 if (moved && moved != marked)
510 /* Find the first moving object */
511 for (i = 0; i < AO_LISP_NCHUNK; i++) {
512 uint16_t size = ao_lisp_chunk[i].size;
517 if (ao_lisp_chunk[i].old_addr > top)
520 if (ao_lisp_chunk[i].old_addr != top)
525 MDBG_MOVE("chunk %d %d not moving\n",
526 ao_lisp_chunk[i].old_addr,
527 ao_lisp_chunk[i].size);
531 /* Copy all of the objects */
532 for (; i < AO_LISP_NCHUNK; i++) {
533 uint16_t size = ao_lisp_chunk[i].size;
538 MDBG_MOVE("chunk %d %d -> %d\n",
539 ao_lisp_chunk[i].old_addr,
542 ao_lisp_chunk[i].new_addr = top;
543 memmove(&ao_lisp_pool[top],
544 &ao_lisp_pool[ao_lisp_chunk[i].old_addr],
551 if (chunk_first < chunk_last) {
552 /* Relocate all references to the objects */
553 walk(ao_lisp_move, ao_lisp_poly_move);
556 ao_lisp_record_free(move_record);
557 move_record = ao_lisp_record_save();
558 if (mark_record && move_record)
559 ao_lisp_record_compare("move", mark_record, move_record);
561 moved = total_marked;
567 if (chunk_last != AO_LISP_NCHUNK)
570 chunk_low = chunk_high;
573 /* Compute amount of memory freed */
574 ret = ao_lisp_top - top;
577 ++ao_lisp_collects[style];
578 ao_lisp_freed[style] += ret;
579 ao_lisp_loops[style] += loops;
582 if (style == AO_LISP_COLLECT_FULL)
583 ao_lisp_last_top = top;
585 MDBG_DO(memset(ao_lisp_chunk, '\0', sizeof (ao_lisp_chunk));
586 walk(ao_lisp_mark_ref, ao_lisp_poly_mark_ref));
592 * Mark interfaces for objects
594 * Note a reference to memory and
595 * collect information about a few object sizes
600 ao_lisp_mark_memory(const struct ao_lisp_type *type, void *addr)
603 if (!AO_LISP_IS_POOL(addr))
606 offset = pool_offset(addr);
607 MDBG_MOVE("mark memory %d\n", MDBG_OFFSET(addr));
608 if (busy(ao_lisp_busy, offset)) {
609 MDBG_MOVE("already marked\n");
612 mark(ao_lisp_busy, offset);
613 note_chunk(offset, ao_lisp_size(type, addr));
618 ao_lisp_mark(const struct ao_lisp_type *type, void *addr)
621 MDBG_MOVE("mark %d\n", MDBG_OFFSET(addr));
623 ret = ao_lisp_mark_memory(type, addr);
625 MDBG_MOVE("mark recurse\n");
633 ao_lisp_poly_mark(ao_poly p, uint8_t do_note_cons)
641 type = ao_lisp_poly_base_type(p);
642 addr = ao_lisp_ref(p);
644 if (!AO_LISP_IS_POOL(addr))
647 if (type == AO_LISP_CONS && do_note_cons) {
648 note_cons(ao_lisp_ref(p));
651 const struct ao_lisp_type *lisp_type;
653 if (type == AO_LISP_OTHER) {
654 type = ao_lisp_other_type(ao_lisp_poly_other(p));
656 if (type <= AO_LISP_OTHER || AO_LISP_NUM_TYPE <= type)
661 lisp_type = ao_lisp_types[ao_lisp_poly_type(p)];
664 return ao_lisp_mark(lisp_type, ao_lisp_ref(p));
671 uint16_t offset = pool_offset(addr);
674 for (i = chunk_first; i < chunk_last; i++) {
675 if (ao_lisp_chunk[i].old_addr == offset) {
676 MDBG_MOVE("move %d -> %d\n",
677 ao_lisp_chunk[i].old_addr,
678 ao_lisp_chunk[i].new_addr);
679 return ao_lisp_pool + ao_lisp_chunk[i].new_addr;
686 ao_lisp_move_memory(const struct ao_lisp_type *type, void **ref)
691 if (!AO_LISP_IS_POOL(addr))
696 MDBG_MOVE("move memory %d\n", MDBG_OFFSET(addr));
697 addr = move_map(addr);
699 MDBG_MOVE("update ref %d %d -> %d\n",
700 AO_LISP_IS_POOL(ref) ? MDBG_OFFSET(ref) : -1,
701 MDBG_OFFSET(*ref), MDBG_OFFSET(addr));
704 offset = pool_offset(addr);
705 if (busy(ao_lisp_busy, offset)) {
706 MDBG_MOVE("already moved\n");
709 mark(ao_lisp_busy, offset);
710 MDBG_DO(ao_lisp_record(type, addr, ao_lisp_size(type, addr)));
715 ao_lisp_move(const struct ao_lisp_type *type, void **ref)
718 MDBG_MOVE("move object %d\n", MDBG_OFFSET(*ref));
720 ret = ao_lisp_move_memory(type, ref);
722 MDBG_MOVE("move recurse\n");
730 ao_lisp_poly_move(ao_poly *ref, uint8_t do_note_cons)
740 addr = ao_lisp_ref(p);
742 if (!AO_LISP_IS_POOL(addr))
745 type = ao_lisp_poly_base_type(p);
747 if (type == AO_LISP_CONS && do_note_cons) {
749 addr = move_map(addr);
752 const struct ao_lisp_type *lisp_type;
754 if (type == AO_LISP_OTHER) {
755 type = ao_lisp_other_type(move_map(ao_lisp_poly_other(p)));
757 if (type <= AO_LISP_OTHER || AO_LISP_NUM_TYPE <= type)
762 lisp_type = ao_lisp_types[type];
765 ret = ao_lisp_move(lisp_type, &addr);
768 /* Re-write the poly value */
769 if (addr != ao_lisp_ref(p)) {
770 ao_poly np = ao_lisp_poly(addr, p & AO_LISP_TYPE_MASK);
771 MDBG_MOVE("poly %d moved %d -> %d\n",
772 type, MDBG_OFFSET(ao_lisp_ref(p)), MDBG_OFFSET(ao_lisp_ref(np)));
780 ao_lisp_validate(void)
783 memset(ao_lisp_chunk, '\0', sizeof (ao_lisp_chunk));
784 walk(ao_lisp_mark_ref, ao_lisp_poly_mark_ref);
792 ao_lisp_alloc(int size)
796 MDBG_DO(++dbg_allocs);
797 MDBG_DO(if (dbg_validate) ao_lisp_validate());
798 size = ao_lisp_size_round(size);
799 if (ao_lisp_top + size > AO_LISP_POOL) {
800 if (!ao_lisp_collect(AO_LISP_COLLECT_INCREMENTAL) &&
801 !ao_lisp_collect(AO_LISP_COLLECT_FULL))
803 ao_lisp_error(AO_LISP_OOM, "out of memory");
807 addr = ao_lisp_pool + ao_lisp_top;
813 ao_lisp_cons_stash(int id, struct ao_lisp_cons *cons)
815 save_cons[id] = cons;
818 struct ao_lisp_cons *
819 ao_lisp_cons_fetch(int id)
821 struct ao_lisp_cons *cons = save_cons[id];
822 save_cons[id] = NULL;
827 ao_lisp_poly_stash(int id, ao_poly poly)
829 save_poly[id] = poly;
833 ao_lisp_poly_fetch(int id)
835 ao_poly poly = save_poly[id];
836 save_poly[id] = AO_LISP_NIL;
841 ao_lisp_string_stash(int id, char *string)
843 save_string[id] = string;
847 ao_lisp_string_fetch(int id)
849 char *string = save_string[id];
850 save_string[id] = NULL;