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[2];
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]
175 .type = &ao_lisp_atom_type,
176 .addr = (void **) &ao_lisp_atoms
179 .type = &ao_lisp_frame_type,
180 .addr = (void **) &ao_lisp_frame_global,
183 .type = &ao_lisp_frame_type,
184 .addr = (void **) &ao_lisp_frame_current,
187 .type = &ao_lisp_stack_type,
188 .addr = (void **) &ao_lisp_stack,
192 .addr = (void **) &ao_lisp_v,
195 .type = &ao_lisp_cons_type,
196 .addr = (void **) &ao_lisp_read_cons,
199 .type = &ao_lisp_cons_type,
200 .addr = (void **) &ao_lisp_read_cons_tail,
203 .type = &ao_lisp_cons_type,
204 .addr = (void **) &ao_lisp_read_stack,
208 #define AO_LISP_ROOT (sizeof (ao_lisp_root) / sizeof (ao_lisp_root[0]))
210 static const void ** const ao_lisp_cache[] = {
211 (const void **) &ao_lisp_cons_free_list,
212 (const void **) &ao_lisp_stack_free_list,
213 (const void **) &ao_lisp_frame_free_list[0],
214 (const void **) &ao_lisp_frame_free_list[1],
215 (const void **) &ao_lisp_frame_free_list[2],
216 (const void **) &ao_lisp_frame_free_list[3],
219 #if AO_LISP_FRAME_FREE != 4
220 #error Unexpected AO_LISP_FRAME_FREE value
223 #define AO_LISP_CACHE (sizeof (ao_lisp_cache) / sizeof (ao_lisp_cache[0]))
225 #define AO_LISP_BUSY_SIZE ((AO_LISP_POOL + 31) / 32)
227 static uint8_t ao_lisp_busy[AO_LISP_BUSY_SIZE];
228 static uint8_t ao_lisp_cons_note[AO_LISP_BUSY_SIZE];
229 static uint8_t ao_lisp_cons_last[AO_LISP_BUSY_SIZE];
230 static uint8_t ao_lisp_cons_noted;
232 uint16_t ao_lisp_top;
234 struct ao_lisp_chunk {
242 #define AO_LISP_NCHUNK 64
244 static struct ao_lisp_chunk ao_lisp_chunk[AO_LISP_NCHUNK];
246 /* Offset of an address within the pool. */
247 static inline uint16_t pool_offset(void *addr) {
249 if (!AO_LISP_IS_POOL(addr))
252 return ((uint8_t *) addr) - ao_lisp_pool;
256 * Convert back and forth between 'poly's used
257 * as short addresses in the pool and addresses.
258 * These are used in the chunk code.
260 static inline ao_poly pool_poly(void *addr) {
262 if (!AO_LISP_IS_POOL(addr))
265 return ((uint8_t *) addr) - AO_LISP_POOL_BASE;
268 static inline void *pool_ref(ao_poly p) {
269 return AO_LISP_POOL_BASE + p;
272 static inline void mark(uint8_t *tag, int offset) {
273 int byte = offset >> 5;
274 int bit = (offset >> 2) & 7;
275 tag[byte] |= (1 << bit);
278 static inline void clear(uint8_t *tag, int offset) {
279 int byte = offset >> 5;
280 int bit = (offset >> 2) & 7;
281 tag[byte] &= ~(1 << bit);
284 static inline int busy(uint8_t *tag, int offset) {
285 int byte = offset >> 5;
286 int bit = (offset >> 2) & 7;
287 return (tag[byte] >> bit) & 1;
290 static inline int min(int a, int b) { return a < b ? a : b; }
291 static inline int max(int a, int b) { return a > b ? a : b; }
293 static inline int limit(int offset) {
294 return min(AO_LISP_POOL, max(offset, 0));
297 static int total_marked;
300 note_cons(void *addr)
302 if (AO_LISP_IS_POOL(addr)) {
303 int offset = pool_offset(addr);
304 MDBG_MOVE("note cons %d\n", MDBG_OFFSET(addr));
305 ao_lisp_cons_noted = 1;
306 mark(ao_lisp_cons_note, offset);
310 static uint16_t chunk_low, chunk_high;
311 static uint16_t chunk_first, chunk_last;
312 static int chunk_busy;
315 note_chunk(uint16_t addr, uint16_t size)
319 if (addr < chunk_low || chunk_high <= addr)
322 /* Binary search for the location */
326 int m = (l + r) >> 1;
327 if (ao_lisp_chunk[m].old_addr < addr)
333 * The correct location is always in 'l', with r = l-1 being
334 * the entry before the right one
338 /* Off the right side */
339 if (l >= AO_LISP_NCHUNK)
342 /* Off the left side */
343 if (l == 0 && chunk_busy && addr > ao_lisp_chunk[0].old_addr)
347 /* Shuffle existing entries right */
348 int end = min(AO_LISP_NCHUNK, chunk_busy + 1);
350 memmove(&ao_lisp_chunk[l+1],
352 (end - (l+1)) * sizeof (struct ao_lisp_chunk));
355 ao_lisp_chunk[l].old_addr = addr;
356 ao_lisp_chunk[l].size = size;
358 /* Increment the number of elements up to the size of the array */
359 if (chunk_busy < AO_LISP_NCHUNK)
362 /* Set the top address if the array is full */
363 if (chunk_busy == AO_LISP_NCHUNK)
364 chunk_high = ao_lisp_chunk[AO_LISP_NCHUNK-1].old_addr +
365 ao_lisp_chunk[AO_LISP_NCHUNK-1].size;
371 memset(ao_lisp_chunk, '\0', sizeof (ao_lisp_chunk));
372 chunk_high = ao_lisp_top;
377 * Walk all referenced objects calling functions on each one
381 walk(int (*visit_addr)(const struct ao_lisp_type *type, void **addr),
382 int (*visit_poly)(ao_poly *p, uint8_t do_note_cons))
387 ao_lisp_record_reset();
388 memset(ao_lisp_busy, '\0', sizeof (ao_lisp_busy));
389 memset(ao_lisp_cons_note, '\0', sizeof (ao_lisp_cons_note));
390 ao_lisp_cons_noted = 0;
391 for (i = 0; i < (int) AO_LISP_ROOT; i++) {
392 if (ao_lisp_root[i].type) {
393 void **a = ao_lisp_root[i].addr, *v;
395 MDBG_MOVE("root ptr %d\n", MDBG_OFFSET(v));
396 visit_addr(ao_lisp_root[i].type, a);
399 ao_poly *a = (ao_poly *) ao_lisp_root[i].addr, p;
401 MDBG_MOVE("root poly %d\n", MDBG_OFFSET(ao_lisp_ref(p)));
406 while (ao_lisp_cons_noted) {
407 memcpy(ao_lisp_cons_last, ao_lisp_cons_note, sizeof (ao_lisp_cons_note));
408 memset(ao_lisp_cons_note, '\0', sizeof (ao_lisp_cons_note));
409 ao_lisp_cons_noted = 0;
410 for (i = 0; i < AO_LISP_POOL; i += 4) {
411 if (busy(ao_lisp_cons_last, i)) {
412 void *v = ao_lisp_pool + i;
413 MDBG_MOVE("root cons %d\n", MDBG_OFFSET(v));
414 visit_addr(&ao_lisp_cons_type, &v);
426 for (i = 0; i < ao_lisp_top; i += 4) {
427 if ((i & 0xff) == 0) {
431 else if ((i & 0x1f) == 0)
433 if (busy(ao_lisp_busy, i))
440 #define DUMP_BUSY() dump_busy()
445 static const struct ao_lisp_type const *ao_lisp_types[AO_LISP_NUM_TYPE] = {
446 [AO_LISP_CONS] = &ao_lisp_cons_type,
447 [AO_LISP_INT] = NULL,
448 [AO_LISP_STRING] = &ao_lisp_string_type,
449 [AO_LISP_OTHER] = (void *) 0x1,
450 [AO_LISP_ATOM] = &ao_lisp_atom_type,
451 [AO_LISP_BUILTIN] = &ao_lisp_builtin_type,
452 [AO_LISP_FRAME] = &ao_lisp_frame_type,
453 [AO_LISP_LAMBDA] = &ao_lisp_lambda_type,
457 ao_lisp_mark_ref(const struct ao_lisp_type *type, void **ref)
459 return ao_lisp_mark(type, *ref);
463 ao_lisp_poly_mark_ref(ao_poly *p, uint8_t do_note_cons)
465 return ao_lisp_poly_mark(*p, do_note_cons);
468 int ao_lisp_collects[2];
469 int ao_lisp_freed[2];
470 int ao_lisp_loops[2];
472 int ao_lisp_last_top;
475 ao_lisp_collect(uint8_t style)
484 struct ao_lisp_record *mark_record = NULL, *move_record = NULL;
486 MDBG_MOVE("collect %d\n", ao_lisp_collects);
490 /* The first time through, we're doing a full collect */
491 if (ao_lisp_last_top == 0)
492 style = AO_LISP_COLLECT_FULL;
494 /* Clear references to all caches */
495 for (i = 0; i < (int) AO_LISP_CACHE; i++)
496 *ao_lisp_cache[i] = NULL;
497 if (style == AO_LISP_COLLECT_FULL) {
500 chunk_low = top = ao_lisp_last_top;
504 MDBG_MOVE("move chunks from %d to %d\n", chunk_low, top);
505 /* Find the sizes of the first chunk of objects to move */
507 walk(ao_lisp_mark_ref, ao_lisp_poly_mark_ref);
509 marked = total_marked;
511 ao_lisp_record_free(mark_record);
512 mark_record = ao_lisp_record_save();
513 if (mark_record && move_record)
514 ao_lisp_record_compare("mark", move_record, mark_record);
516 if (moved && moved != marked)
522 /* Find the first moving object */
523 for (i = 0; i < AO_LISP_NCHUNK; i++) {
524 uint16_t size = ao_lisp_chunk[i].size;
529 if (ao_lisp_chunk[i].old_addr > top)
532 if (ao_lisp_chunk[i].old_addr != top)
537 MDBG_MOVE("chunk %d %d not moving\n",
538 ao_lisp_chunk[i].old_addr,
539 ao_lisp_chunk[i].size);
543 /* Copy all of the objects */
544 for (; i < AO_LISP_NCHUNK; i++) {
545 uint16_t size = ao_lisp_chunk[i].size;
550 MDBG_MOVE("chunk %d %d -> %d\n",
551 ao_lisp_chunk[i].old_addr,
554 ao_lisp_chunk[i].new_addr = top;
555 memmove(&ao_lisp_pool[top],
556 &ao_lisp_pool[ao_lisp_chunk[i].old_addr],
563 if (chunk_first < chunk_last) {
564 /* Relocate all references to the objects */
565 walk(ao_lisp_move, ao_lisp_poly_move);
568 ao_lisp_record_free(move_record);
569 move_record = ao_lisp_record_save();
570 if (mark_record && move_record)
571 ao_lisp_record_compare("move", mark_record, move_record);
573 moved = total_marked;
579 if (chunk_last != AO_LISP_NCHUNK)
582 chunk_low = chunk_high;
585 /* Compute amount of memory freed */
586 ret = ao_lisp_top - top;
589 ++ao_lisp_collects[style];
590 ao_lisp_freed[style] += ret;
591 ao_lisp_loops[style] += loops;
594 if (style == AO_LISP_COLLECT_FULL)
595 ao_lisp_last_top = top;
597 MDBG_DO(memset(ao_lisp_chunk, '\0', sizeof (ao_lisp_chunk));
598 walk(ao_lisp_mark_ref, ao_lisp_poly_mark_ref));
604 * Mark interfaces for objects
606 * Note a reference to memory and
607 * collect information about a few object sizes
612 ao_lisp_mark_memory(const struct ao_lisp_type *type, void *addr)
615 if (!AO_LISP_IS_POOL(addr))
618 offset = pool_offset(addr);
619 MDBG_MOVE("mark memory %d\n", MDBG_OFFSET(addr));
620 if (busy(ao_lisp_busy, offset)) {
621 MDBG_MOVE("already marked\n");
624 mark(ao_lisp_busy, offset);
625 note_chunk(offset, ao_lisp_size(type, addr));
630 ao_lisp_mark(const struct ao_lisp_type *type, void *addr)
633 MDBG_MOVE("mark %d\n", MDBG_OFFSET(addr));
635 ret = ao_lisp_mark_memory(type, addr);
637 MDBG_MOVE("mark recurse\n");
645 ao_lisp_poly_mark(ao_poly p, uint8_t do_note_cons)
653 type = ao_lisp_poly_base_type(p);
654 addr = ao_lisp_ref(p);
656 if (!AO_LISP_IS_POOL(addr))
659 if (type == AO_LISP_CONS && do_note_cons) {
660 note_cons(ao_lisp_ref(p));
663 const struct ao_lisp_type *lisp_type;
665 if (type == AO_LISP_OTHER) {
666 type = ao_lisp_other_type(ao_lisp_poly_other(p));
668 if (type <= AO_LISP_OTHER || AO_LISP_NUM_TYPE <= type)
673 lisp_type = ao_lisp_types[ao_lisp_poly_type(p)];
676 return ao_lisp_mark(lisp_type, ao_lisp_ref(p));
683 uint16_t offset = pool_offset(addr);
686 for (i = chunk_first; i < chunk_last; i++) {
687 if (ao_lisp_chunk[i].old_addr == offset) {
688 MDBG_MOVE("move %d -> %d\n",
689 ao_lisp_chunk[i].old_addr,
690 ao_lisp_chunk[i].new_addr);
691 return ao_lisp_pool + ao_lisp_chunk[i].new_addr;
698 ao_lisp_move_memory(const struct ao_lisp_type *type, void **ref)
703 if (!AO_LISP_IS_POOL(addr))
708 MDBG_MOVE("move memory %d\n", MDBG_OFFSET(addr));
709 addr = move_map(addr);
711 MDBG_MOVE("update ref %d %d -> %d\n",
712 AO_LISP_IS_POOL(ref) ? MDBG_OFFSET(ref) : -1,
713 MDBG_OFFSET(*ref), MDBG_OFFSET(addr));
716 offset = pool_offset(addr);
717 if (busy(ao_lisp_busy, offset)) {
718 MDBG_MOVE("already moved\n");
721 mark(ao_lisp_busy, offset);
722 MDBG_DO(ao_lisp_record(type, addr, ao_lisp_size(type, addr)));
727 ao_lisp_move(const struct ao_lisp_type *type, void **ref)
730 MDBG_MOVE("move object %d\n", MDBG_OFFSET(*ref));
732 ret = ao_lisp_move_memory(type, ref);
734 MDBG_MOVE("move recurse\n");
742 ao_lisp_poly_move(ao_poly *ref, uint8_t do_note_cons)
752 addr = ao_lisp_ref(p);
754 if (!AO_LISP_IS_POOL(addr))
757 type = ao_lisp_poly_base_type(p);
759 if (type == AO_LISP_CONS && do_note_cons) {
761 addr = move_map(addr);
764 const struct ao_lisp_type *lisp_type;
766 if (type == AO_LISP_OTHER) {
767 type = ao_lisp_other_type(move_map(ao_lisp_poly_other(p)));
769 if (type <= AO_LISP_OTHER || AO_LISP_NUM_TYPE <= type)
774 lisp_type = ao_lisp_types[type];
777 ret = ao_lisp_move(lisp_type, &addr);
780 /* Re-write the poly value */
781 if (addr != ao_lisp_ref(p)) {
782 ao_poly np = ao_lisp_poly(addr, p & AO_LISP_TYPE_MASK);
783 MDBG_MOVE("poly %d moved %d -> %d\n",
784 type, MDBG_OFFSET(ao_lisp_ref(p)), MDBG_OFFSET(ao_lisp_ref(np)));
792 ao_lisp_validate(void)
795 memset(ao_lisp_chunk, '\0', sizeof (ao_lisp_chunk));
796 walk(ao_lisp_mark_ref, ao_lisp_poly_mark_ref);
804 ao_lisp_alloc(int size)
808 MDBG_DO(++dbg_allocs);
809 MDBG_DO(if (dbg_validate) ao_lisp_validate());
810 size = ao_lisp_size_round(size);
811 if (ao_lisp_top + size > AO_LISP_POOL) {
812 if (!ao_lisp_collect(AO_LISP_COLLECT_INCREMENTAL) &&
813 !ao_lisp_collect(AO_LISP_COLLECT_FULL))
815 ao_lisp_error(AO_LISP_OOM, "out of memory");
819 addr = ao_lisp_pool + ao_lisp_top;
825 ao_lisp_cons_stash(int id, struct ao_lisp_cons *cons)
827 save_cons[id] = cons;
830 struct ao_lisp_cons *
831 ao_lisp_cons_fetch(int id)
833 struct ao_lisp_cons *cons = save_cons[id];
834 save_cons[id] = NULL;
839 ao_lisp_string_stash(int id, char *string)
841 save_string[id] = string;
845 ao_lisp_string_fetch(int id)
847 char *string = save_string[id];
848 save_string[id] = NULL;
852 ao_lisp_poly_stash(int id, ao_poly poly)
854 save_poly[id] = poly;
858 ao_lisp_poly_fetch(int id)
860 ao_poly poly = save_poly[id];
861 save_poly[id] = AO_LISP_NIL;