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;
255 static inline void mark(uint8_t *tag, int offset) {
256 int byte = offset >> 5;
257 int bit = (offset >> 2) & 7;
258 tag[byte] |= (1 << bit);
261 static inline void clear(uint8_t *tag, int offset) {
262 int byte = offset >> 5;
263 int bit = (offset >> 2) & 7;
264 tag[byte] &= ~(1 << bit);
267 static inline int busy(uint8_t *tag, int offset) {
268 int byte = offset >> 5;
269 int bit = (offset >> 2) & 7;
270 return (tag[byte] >> bit) & 1;
273 static inline int min(int a, int b) { return a < b ? a : b; }
274 static inline int max(int a, int b) { return a > b ? a : b; }
276 static inline int limit(int offset) {
277 return min(AO_LISP_POOL, max(offset, 0));
280 static int total_marked;
283 note_cons(void *addr)
285 if (AO_LISP_IS_POOL(addr)) {
286 int offset = pool_offset(addr);
287 MDBG_MOVE("note cons %d\n", MDBG_OFFSET(addr));
288 ao_lisp_cons_noted = 1;
289 mark(ao_lisp_cons_note, offset);
293 static uint16_t chunk_low, chunk_high;
294 static uint16_t chunk_first, chunk_last;
295 static int chunk_busy;
298 note_chunk(uint16_t addr, uint16_t size)
302 if (addr < chunk_low || chunk_high <= addr)
305 /* Binary search for the location */
309 int m = (l + r) >> 1;
310 if (ao_lisp_chunk[m].old_addr < addr)
316 * The correct location is always in 'l', with r = l-1 being
317 * the entry before the right one
321 /* Off the right side */
322 if (l >= AO_LISP_NCHUNK)
325 /* Off the left side */
326 if (l == 0 && chunk_busy && addr > ao_lisp_chunk[0].old_addr)
330 /* Shuffle existing entries right */
331 int end = min(AO_LISP_NCHUNK, chunk_busy + 1);
333 memmove(&ao_lisp_chunk[l+1],
335 (end - (l+1)) * sizeof (struct ao_lisp_chunk));
338 ao_lisp_chunk[l].old_addr = addr;
339 ao_lisp_chunk[l].size = size;
341 /* Increment the number of elements up to the size of the array */
342 if (chunk_busy < AO_LISP_NCHUNK)
345 /* Set the top address if the array is full */
346 if (chunk_busy == AO_LISP_NCHUNK)
347 chunk_high = ao_lisp_chunk[AO_LISP_NCHUNK-1].old_addr +
348 ao_lisp_chunk[AO_LISP_NCHUNK-1].size;
354 memset(ao_lisp_chunk, '\0', sizeof (ao_lisp_chunk));
355 chunk_high = ao_lisp_top;
360 * Walk all referenced objects calling functions on each one
364 walk(int (*visit_addr)(const struct ao_lisp_type *type, void **addr),
365 int (*visit_poly)(ao_poly *p, uint8_t do_note_cons))
370 ao_lisp_record_reset();
371 memset(ao_lisp_busy, '\0', sizeof (ao_lisp_busy));
372 memset(ao_lisp_cons_note, '\0', sizeof (ao_lisp_cons_note));
373 ao_lisp_cons_noted = 0;
374 for (i = 0; i < (int) AO_LISP_ROOT; i++) {
375 if (ao_lisp_root[i].type) {
376 void **a = ao_lisp_root[i].addr, *v;
378 MDBG_MOVE("root ptr %d\n", MDBG_OFFSET(v));
379 visit_addr(ao_lisp_root[i].type, a);
382 ao_poly *a = (ao_poly *) ao_lisp_root[i].addr, p;
384 MDBG_MOVE("root poly %d\n", MDBG_OFFSET(ao_lisp_ref(p)));
389 while (ao_lisp_cons_noted) {
390 memcpy(ao_lisp_cons_last, ao_lisp_cons_note, sizeof (ao_lisp_cons_note));
391 memset(ao_lisp_cons_note, '\0', sizeof (ao_lisp_cons_note));
392 ao_lisp_cons_noted = 0;
393 for (i = 0; i < AO_LISP_POOL; i += 4) {
394 if (busy(ao_lisp_cons_last, i)) {
395 void *v = ao_lisp_pool + i;
396 MDBG_MOVE("root cons %d\n", MDBG_OFFSET(v));
397 visit_addr(&ao_lisp_cons_type, &v);
409 for (i = 0; i < ao_lisp_top; i += 4) {
410 if ((i & 0xff) == 0) {
414 else if ((i & 0x1f) == 0)
416 if (busy(ao_lisp_busy, i))
423 #define DUMP_BUSY() dump_busy()
428 static const struct ao_lisp_type const *ao_lisp_types[AO_LISP_NUM_TYPE] = {
429 [AO_LISP_CONS] = &ao_lisp_cons_type,
430 [AO_LISP_INT] = NULL,
431 [AO_LISP_STRING] = &ao_lisp_string_type,
432 [AO_LISP_OTHER] = (void *) 0x1,
433 [AO_LISP_ATOM] = &ao_lisp_atom_type,
434 [AO_LISP_BUILTIN] = &ao_lisp_builtin_type,
435 [AO_LISP_FRAME] = &ao_lisp_frame_type,
436 [AO_LISP_LAMBDA] = &ao_lisp_lambda_type,
440 ao_lisp_mark_ref(const struct ao_lisp_type *type, void **ref)
442 return ao_lisp_mark(type, *ref);
446 ao_lisp_poly_mark_ref(ao_poly *p, uint8_t do_note_cons)
448 return ao_lisp_poly_mark(*p, do_note_cons);
451 int ao_lisp_collects[2];
452 int ao_lisp_freed[2];
453 int ao_lisp_loops[2];
455 int ao_lisp_last_top;
458 ao_lisp_collect(uint8_t style)
467 struct ao_lisp_record *mark_record = NULL, *move_record = NULL;
469 MDBG_MOVE("collect %d\n", ao_lisp_collects);
473 /* The first time through, we're doing a full collect */
474 if (ao_lisp_last_top == 0)
475 style = AO_LISP_COLLECT_FULL;
477 /* Clear references to all caches */
478 for (i = 0; i < (int) AO_LISP_CACHE; i++)
479 *ao_lisp_cache[i] = NULL;
480 if (style == AO_LISP_COLLECT_FULL) {
483 chunk_low = top = ao_lisp_last_top;
487 MDBG_MOVE("move chunks from %d to %d\n", chunk_low, top);
488 /* Find the sizes of the first chunk of objects to move */
490 walk(ao_lisp_mark_ref, ao_lisp_poly_mark_ref);
492 marked = total_marked;
494 ao_lisp_record_free(mark_record);
495 mark_record = ao_lisp_record_save();
496 if (mark_record && move_record)
497 ao_lisp_record_compare("mark", move_record, mark_record);
499 if (moved && moved != marked)
505 /* Find the first moving object */
506 for (i = 0; i < AO_LISP_NCHUNK; i++) {
507 uint16_t size = ao_lisp_chunk[i].size;
512 if (ao_lisp_chunk[i].old_addr > top)
515 if (ao_lisp_chunk[i].old_addr != top)
520 MDBG_MOVE("chunk %d %d not moving\n",
521 ao_lisp_chunk[i].old_addr,
522 ao_lisp_chunk[i].size);
526 /* Copy all of the objects */
527 for (; i < AO_LISP_NCHUNK; i++) {
528 uint16_t size = ao_lisp_chunk[i].size;
533 MDBG_MOVE("chunk %d %d -> %d\n",
534 ao_lisp_chunk[i].old_addr,
537 ao_lisp_chunk[i].new_addr = top;
538 memmove(&ao_lisp_pool[top],
539 &ao_lisp_pool[ao_lisp_chunk[i].old_addr],
546 if (chunk_first < chunk_last) {
547 /* Relocate all references to the objects */
548 walk(ao_lisp_move, ao_lisp_poly_move);
551 ao_lisp_record_free(move_record);
552 move_record = ao_lisp_record_save();
553 if (mark_record && move_record)
554 ao_lisp_record_compare("move", mark_record, move_record);
556 moved = total_marked;
562 if (chunk_last != AO_LISP_NCHUNK)
565 chunk_low = chunk_high;
568 /* Compute amount of memory freed */
569 ret = ao_lisp_top - top;
572 ++ao_lisp_collects[style];
573 ao_lisp_freed[style] += ret;
574 ao_lisp_loops[style] += loops;
577 if (style == AO_LISP_COLLECT_FULL)
578 ao_lisp_last_top = top;
580 MDBG_DO(memset(ao_lisp_chunk, '\0', sizeof (ao_lisp_chunk));
581 walk(ao_lisp_mark_ref, ao_lisp_poly_mark_ref));
587 * Mark interfaces for objects
589 * Note a reference to memory and
590 * collect information about a few object sizes
595 ao_lisp_mark_memory(const struct ao_lisp_type *type, void *addr)
598 if (!AO_LISP_IS_POOL(addr))
601 offset = pool_offset(addr);
602 MDBG_MOVE("mark memory %d\n", MDBG_OFFSET(addr));
603 if (busy(ao_lisp_busy, offset)) {
604 MDBG_MOVE("already marked\n");
607 mark(ao_lisp_busy, offset);
608 note_chunk(offset, ao_lisp_size(type, addr));
613 ao_lisp_mark(const struct ao_lisp_type *type, void *addr)
616 MDBG_MOVE("mark %d\n", MDBG_OFFSET(addr));
618 ret = ao_lisp_mark_memory(type, addr);
620 MDBG_MOVE("mark recurse\n");
628 ao_lisp_poly_mark(ao_poly p, uint8_t do_note_cons)
636 type = ao_lisp_poly_base_type(p);
637 addr = ao_lisp_ref(p);
639 if (!AO_LISP_IS_POOL(addr))
642 if (type == AO_LISP_CONS && do_note_cons) {
643 note_cons(ao_lisp_ref(p));
646 const struct ao_lisp_type *lisp_type;
648 if (type == AO_LISP_OTHER) {
649 type = ao_lisp_other_type(ao_lisp_poly_other(p));
651 if (type <= AO_LISP_OTHER || AO_LISP_NUM_TYPE <= type)
656 lisp_type = ao_lisp_types[ao_lisp_poly_type(p)];
659 return ao_lisp_mark(lisp_type, ao_lisp_ref(p));
666 uint16_t offset = pool_offset(addr);
669 for (i = chunk_first; i < chunk_last; i++) {
670 if (ao_lisp_chunk[i].old_addr == offset) {
671 MDBG_MOVE("move %d -> %d\n",
672 ao_lisp_chunk[i].old_addr,
673 ao_lisp_chunk[i].new_addr);
674 return ao_lisp_pool + ao_lisp_chunk[i].new_addr;
681 ao_lisp_move_memory(const struct ao_lisp_type *type, void **ref)
686 if (!AO_LISP_IS_POOL(addr))
691 MDBG_MOVE("move memory %d\n", MDBG_OFFSET(addr));
692 addr = move_map(addr);
694 MDBG_MOVE("update ref %d %d -> %d\n",
695 AO_LISP_IS_POOL(ref) ? MDBG_OFFSET(ref) : -1,
696 MDBG_OFFSET(*ref), MDBG_OFFSET(addr));
699 offset = pool_offset(addr);
700 if (busy(ao_lisp_busy, offset)) {
701 MDBG_MOVE("already moved\n");
704 mark(ao_lisp_busy, offset);
705 MDBG_DO(ao_lisp_record(type, addr, ao_lisp_size(type, addr)));
710 ao_lisp_move(const struct ao_lisp_type *type, void **ref)
713 MDBG_MOVE("move object %d\n", MDBG_OFFSET(*ref));
715 ret = ao_lisp_move_memory(type, ref);
717 MDBG_MOVE("move recurse\n");
725 ao_lisp_poly_move(ao_poly *ref, uint8_t do_note_cons)
735 addr = ao_lisp_ref(p);
737 if (!AO_LISP_IS_POOL(addr))
740 type = ao_lisp_poly_base_type(p);
742 if (type == AO_LISP_CONS && do_note_cons) {
744 addr = move_map(addr);
747 const struct ao_lisp_type *lisp_type;
749 if (type == AO_LISP_OTHER) {
750 type = ao_lisp_other_type(move_map(ao_lisp_poly_other(p)));
752 if (type <= AO_LISP_OTHER || AO_LISP_NUM_TYPE <= type)
757 lisp_type = ao_lisp_types[type];
760 ret = ao_lisp_move(lisp_type, &addr);
763 /* Re-write the poly value */
764 if (addr != ao_lisp_ref(p)) {
765 ao_poly np = ao_lisp_poly(addr, p & AO_LISP_TYPE_MASK);
766 MDBG_MOVE("poly %d moved %d -> %d\n",
767 type, MDBG_OFFSET(ao_lisp_ref(p)), MDBG_OFFSET(ao_lisp_ref(np)));
775 ao_lisp_validate(void)
778 memset(ao_lisp_chunk, '\0', sizeof (ao_lisp_chunk));
779 walk(ao_lisp_mark_ref, ao_lisp_poly_mark_ref);
787 ao_lisp_alloc(int size)
791 MDBG_DO(++dbg_allocs);
792 MDBG_DO(if (dbg_validate) ao_lisp_validate());
793 size = ao_lisp_size_round(size);
794 if (ao_lisp_top + size > AO_LISP_POOL) {
795 if (!ao_lisp_collect(AO_LISP_COLLECT_INCREMENTAL) &&
796 !ao_lisp_collect(AO_LISP_COLLECT_FULL))
798 ao_lisp_error(AO_LISP_OOM, "out of memory");
802 addr = ao_lisp_pool + ao_lisp_top;
808 ao_lisp_cons_stash(int id, struct ao_lisp_cons *cons)
810 save_cons[id] = cons;
813 struct ao_lisp_cons *
814 ao_lisp_cons_fetch(int id)
816 struct ao_lisp_cons *cons = save_cons[id];
817 save_cons[id] = NULL;
822 ao_lisp_string_stash(int id, char *string)
824 save_string[id] = string;
828 ao_lisp_string_fetch(int id)
830 char *string = save_string[id];
831 save_string[id] = NULL;
835 ao_lisp_poly_stash(int id, ao_poly poly)
837 save_poly[id] = poly;
841 ao_lisp_poly_fetch(int id)
843 ao_poly poly = save_poly[id];
844 save_poly[id] = AO_LISP_NIL;