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_SCHEME_CONST_BITS
17 #include "ao_scheme.h"
21 #ifdef AO_SCHEME_MAKE_CONST
24 * When building the constant table, it is the
25 * pool for allocations.
29 uint8_t ao_scheme_const[AO_SCHEME_POOL_CONST] __attribute__((aligned(4)));
30 #define ao_scheme_pool ao_scheme_const
32 #define AO_SCHEME_POOL AO_SCHEME_POOL_CONST
36 uint8_t ao_scheme_pool[AO_SCHEME_POOL + AO_SCHEME_POOL_EXTRA] __attribute__((aligned(4)));
41 #define DBG_MEM_STATS DBG_MEM
44 #define DBG_MEM_STACK 0
46 char *mem_collect_stack;
47 int64_t mem_collect_max_depth;
50 ao_scheme_check_stack(void)
55 depth = mem_collect_stack - &x;
56 if (depth > mem_collect_max_depth)
57 mem_collect_max_depth = depth;
61 _ao_scheme_reset_stack(char *x)
63 mem_collect_stack = x;
64 // mem_collect_max_depth = 0;
66 #define ao_scheme_declare_stack char x;
67 #define ao_scheme_reset_stack() _ao_scheme_reset_stack(&x)
69 #define ao_scheme_check_stack()
70 #define ao_scheme_declare_stack
71 #define ao_scheme_reset_stack()
75 #define DBG_MEM_RECORD 1
80 int dbg_mem = DBG_MEM_START;
85 struct ao_scheme_record {
86 struct ao_scheme_record *next;
87 const struct ao_scheme_type *type;
92 static struct ao_scheme_record *record_head, **record_tail;
95 ao_scheme_record_free(struct ao_scheme_record *record)
98 struct ao_scheme_record *next = record->next;
105 ao_scheme_record_reset(void)
107 ao_scheme_record_free(record_head);
109 record_tail = &record_head;
113 ao_scheme_record(const struct ao_scheme_type *type,
117 struct ao_scheme_record *r = malloc(sizeof (struct ao_scheme_record));
124 record_tail = &r->next;
127 static struct ao_scheme_record *
128 ao_scheme_record_save(void)
130 struct ao_scheme_record *r = record_head;
133 record_tail = &record_head;
138 ao_scheme_record_compare(const char *where,
139 struct ao_scheme_record *a,
140 struct ao_scheme_record *b)
143 if (a->type != b->type || a->size != b->size) {
144 printf("%s record difers %d %s %d -> %d %s %d\n",
146 MDBG_OFFSET(a->addr),
149 MDBG_OFFSET(b->addr),
158 printf("%s record differs %d %s %d -> NULL\n",
160 MDBG_OFFSET(a->addr),
166 printf("%s record differs NULL -> %d %s %d\n",
168 MDBG_OFFSET(b->addr),
176 #define ao_scheme_record_reset()
177 #define ao_scheme_record(t,a,s)
180 uint8_t ao_scheme_exception;
182 struct ao_scheme_root {
183 const struct ao_scheme_type *type;
187 static struct ao_scheme_cons *save_cons[2];
188 static struct ao_scheme_string *save_string[2];
189 static struct ao_scheme_frame *save_frame[1];
190 static ao_poly save_poly[3];
192 static const struct ao_scheme_root ao_scheme_root[] = {
194 .type = &ao_scheme_cons_type,
195 .addr = (void **) &save_cons[0],
198 .type = &ao_scheme_cons_type,
199 .addr = (void **) &save_cons[1],
202 .type = &ao_scheme_string_type,
203 .addr = (void **) &save_string[0],
206 .type = &ao_scheme_string_type,
207 .addr = (void **) &save_string[1],
210 .type = &ao_scheme_frame_type,
211 .addr = (void **) &save_frame[0],
215 .addr = (void **) (void *) &save_poly[0]
219 .addr = (void **) (void *) &save_poly[1]
223 .addr = (void **) (void *) &save_poly[2]
226 .type = &ao_scheme_atom_type,
227 .addr = (void **) &ao_scheme_atoms
230 .type = &ao_scheme_frame_type,
231 .addr = (void **) &ao_scheme_frame_global,
234 .type = &ao_scheme_frame_type,
235 .addr = (void **) &ao_scheme_frame_current,
238 .type = &ao_scheme_stack_type,
239 .addr = (void **) &ao_scheme_stack,
243 .addr = (void **) (void *) &ao_scheme_v,
246 .type = &ao_scheme_cons_type,
247 .addr = (void **) &ao_scheme_read_cons,
250 .type = &ao_scheme_cons_type,
251 .addr = (void **) &ao_scheme_read_cons_tail,
254 .type = &ao_scheme_cons_type,
255 .addr = (void **) &ao_scheme_read_stack,
257 #ifdef AO_SCHEME_MAKE_CONST
259 .type = &ao_scheme_bool_type,
260 .addr = (void **) &ao_scheme_false,
263 .type = &ao_scheme_bool_type,
264 .addr = (void **) &ao_scheme_true,
269 #define AO_SCHEME_ROOT (sizeof (ao_scheme_root) / sizeof (ao_scheme_root[0]))
271 static const void ** const ao_scheme_cache[] = {
272 (const void **) &ao_scheme_cons_free_list,
273 (const void **) &ao_scheme_stack_free_list,
274 (const void **) &ao_scheme_frame_free_list[0],
275 (const void **) &ao_scheme_frame_free_list[1],
276 (const void **) &ao_scheme_frame_free_list[2],
277 (const void **) &ao_scheme_frame_free_list[3],
278 (const void **) &ao_scheme_frame_free_list[4],
279 (const void **) &ao_scheme_frame_free_list[5],
282 #if AO_SCHEME_FRAME_FREE != 6
283 #error Unexpected AO_SCHEME_FRAME_FREE value
286 #define AO_SCHEME_CACHE (sizeof (ao_scheme_cache) / sizeof (ao_scheme_cache[0]))
288 #define AO_SCHEME_BUSY_SIZE ((AO_SCHEME_POOL + 31) / 32)
290 static int ao_scheme_printing, ao_scheme_print_cleared;
292 static int ao_scheme_collecting;
294 static uint8_t ao_scheme_busy[AO_SCHEME_BUSY_SIZE];
295 static uint8_t ao_scheme_cons_note[AO_SCHEME_BUSY_SIZE];
296 static uint8_t ao_scheme_cons_last[AO_SCHEME_BUSY_SIZE];
297 static uint8_t ao_scheme_cons_noted;
299 uint16_t ao_scheme_top;
301 struct ao_scheme_chunk {
309 #define AO_SCHEME_NCHUNK 64
311 static struct ao_scheme_chunk ao_scheme_chunk[AO_SCHEME_NCHUNK];
313 /* Offset of an address within the pool. */
314 static inline uint16_t pool_offset(void *addr) {
316 if (!ao_scheme_is_pool_addr(addr))
319 return ((uint8_t *) addr) - ao_scheme_pool;
322 static inline void mark(uint8_t *tag, int offset) {
323 int byte = offset >> 5;
324 int bit = (offset >> 2) & 7;
325 ao_scheme_check_stack();
326 tag[byte] |= (1 << bit);
329 static inline void clear(uint8_t *tag, int offset) {
330 int byte = offset >> 5;
331 int bit = (offset >> 2) & 7;
332 tag[byte] &= ~(1 << bit);
335 static inline int busy(uint8_t *tag, int offset) {
336 int byte = offset >> 5;
337 int bit = (offset >> 2) & 7;
338 return (tag[byte] >> bit) & 1;
341 static inline int min(int a, int b) { return a < b ? a : b; }
342 static inline int max(int a, int b) { return a > b ? a : b; }
344 static inline int limit(int offset) {
345 return min(AO_SCHEME_POOL, max(offset, 0));
349 note_cons(uint16_t offset)
351 MDBG_MOVE("note cons %d\n", offset);
352 ao_scheme_cons_noted = 1;
353 mark(ao_scheme_cons_note, offset);
356 static uint16_t chunk_low, chunk_high;
357 static uint16_t chunk_first, chunk_last;
360 find_chunk(uint16_t offset)
363 /* Binary search for the location */
367 int m = (l + r) >> 1;
368 if (ao_scheme_chunk[m].old_offset < offset)
377 note_chunk(uint16_t offset, uint16_t size)
382 if (offset < chunk_low || chunk_high <= offset)
385 l = find_chunk(offset);
388 * The correct location is always in 'l', with r = l-1 being
389 * the entry before the right one
393 /* Off the right side */
394 if (l >= AO_SCHEME_NCHUNK)
397 /* Off the left side */
398 if (l == 0 && chunk_last && offset > ao_scheme_chunk[0].old_offset)
401 if (l < chunk_last && ao_scheme_chunk[l].old_offset == offset)
405 /* Shuffle existing entries right */
406 end = min(AO_SCHEME_NCHUNK, chunk_last + 1);
408 memmove(&ao_scheme_chunk[l+1],
410 (end - (l+1)) * sizeof (struct ao_scheme_chunk));
413 ao_scheme_chunk[l].old_offset = offset;
414 ao_scheme_chunk[l].size = size;
416 /* Increment the number of elements up to the size of the array */
417 if (chunk_last < AO_SCHEME_NCHUNK)
420 /* Set the top address if the array is full */
421 if (chunk_last == AO_SCHEME_NCHUNK)
422 chunk_high = ao_scheme_chunk[AO_SCHEME_NCHUNK-1].old_offset +
423 ao_scheme_chunk[AO_SCHEME_NCHUNK-1].size;
429 chunk_high = ao_scheme_top;
435 * Walk all referenced objects calling functions on each one
439 walk(int (*visit_addr)(const struct ao_scheme_type *type, void **addr),
440 int (*visit_poly)(ao_poly *p, uint8_t do_note_cons))
444 ao_scheme_record_reset();
445 memset(ao_scheme_busy, '\0', sizeof (ao_scheme_busy));
446 memset(ao_scheme_cons_note, '\0', sizeof (ao_scheme_cons_note));
447 ao_scheme_cons_noted = 0;
448 for (i = 0; i < (int) AO_SCHEME_ROOT; i++) {
449 if (ao_scheme_root[i].type) {
450 void **a = ao_scheme_root[i].addr, *v;
452 MDBG_MOVE("root ptr %d\n", MDBG_OFFSET(v));
453 visit_addr(ao_scheme_root[i].type, a);
456 ao_poly *a = (ao_poly *) ao_scheme_root[i].addr, p;
458 MDBG_MOVE("root poly %d\n", MDBG_OFFSET(ao_scheme_ref(p)));
463 while (ao_scheme_cons_noted) {
464 memcpy(ao_scheme_cons_last, ao_scheme_cons_note, sizeof (ao_scheme_cons_note));
465 memset(ao_scheme_cons_note, '\0', sizeof (ao_scheme_cons_note));
466 ao_scheme_cons_noted = 0;
467 for (i = 0; i < AO_SCHEME_POOL; i += 4) {
468 if (busy(ao_scheme_cons_last, i)) {
469 void *v = ao_scheme_pool + i;
470 MDBG_MOVE("root cons %d\n", MDBG_OFFSET(v));
471 visit_addr(&ao_scheme_cons_type, &v);
483 for (i = 0; i < ao_scheme_top; i += 4) {
484 if ((i & 0xff) == 0) {
487 else if ((i & 0x1f) == 0)
489 if (busy(ao_scheme_busy, i))
496 #define DUMP_BUSY() dump_busy()
501 static const struct ao_scheme_type * const ao_scheme_types[AO_SCHEME_NUM_TYPE] = {
502 [AO_SCHEME_CONS] = &ao_scheme_cons_type,
503 [AO_SCHEME_INT] = NULL,
504 #ifdef AO_SCHEME_FEATURE_BIGINT
505 [AO_SCHEME_BIGINT] = &ao_scheme_bigint_type,
507 [AO_SCHEME_OTHER] = (void *) 0x1,
508 [AO_SCHEME_ATOM] = &ao_scheme_atom_type,
509 [AO_SCHEME_BUILTIN] = &ao_scheme_builtin_type,
510 [AO_SCHEME_FRAME] = &ao_scheme_frame_type,
511 [AO_SCHEME_FRAME_VALS] = &ao_scheme_frame_vals_type,
512 [AO_SCHEME_LAMBDA] = &ao_scheme_lambda_type,
513 [AO_SCHEME_STACK] = &ao_scheme_stack_type,
514 [AO_SCHEME_BOOL] = &ao_scheme_bool_type,
515 [AO_SCHEME_STRING] = &ao_scheme_string_type,
516 #ifdef AO_SCHEME_FEATURE_FLOAT
517 [AO_SCHEME_FLOAT] = &ao_scheme_float_type,
519 #ifdef AO_SCHEME_FEATURE_VECTOR
520 [AO_SCHEME_VECTOR] = &ao_scheme_vector_type,
525 ao_scheme_mark(const struct ao_scheme_type *type, void *addr);
528 ao_scheme_move(const struct ao_scheme_type *type, void **ref);
531 ao_scheme_mark_ref(const struct ao_scheme_type *type, void **ref)
533 return ao_scheme_mark(type, *ref);
537 ao_scheme_poly_mark_ref(ao_poly *p, uint8_t do_note_cons)
539 return ao_scheme_poly_mark(*p, do_note_cons);
543 uint64_t ao_scheme_collects[2];
544 uint64_t ao_scheme_freed[2];
545 uint64_t ao_scheme_loops[2];
548 int ao_scheme_last_top;
549 int ao_scheme_collect_counts;
552 ao_scheme_collect(uint8_t style)
554 ao_scheme_declare_stack
561 struct ao_scheme_record *mark_record = NULL, *move_record = NULL;
563 MDBG_MOVE("collect %lu\n", ao_scheme_collects[style]);
565 MDBG_DO(ao_scheme_frame_write(ao_scheme_frame_poly(ao_scheme_frame_global)));
566 MDBG_DO(++ao_scheme_collecting);
568 ao_scheme_reset_stack();
570 /* The first time through, we're doing a full collect */
571 if (ao_scheme_last_top == 0)
572 style = AO_SCHEME_COLLECT_FULL;
574 /* One in a while, just do a full collect */
576 if (ao_scheme_collect_counts >= 128)
577 style = AO_SCHEME_COLLECT_FULL;
579 if (style == AO_SCHEME_COLLECT_FULL)
580 ao_scheme_collect_counts = 0;
582 /* Clear references to all caches */
583 for (i = 0; i < (int) AO_SCHEME_CACHE; i++)
584 *ao_scheme_cache[i] = NULL;
585 if (style == AO_SCHEME_COLLECT_FULL) {
588 chunk_low = top = ao_scheme_last_top;
591 MDBG_MOVE("move chunks from %d to %d\n", chunk_low, top);
592 /* Find the sizes of the first chunk of objects to move */
594 walk(ao_scheme_mark_ref, ao_scheme_poly_mark_ref);
597 ao_scheme_record_free(mark_record);
598 mark_record = ao_scheme_record_save();
599 if (mark_record && move_record)
600 ao_scheme_record_compare("mark", move_record, mark_record);
605 /* Find the first moving object */
606 for (i = 0; i < chunk_last; i++) {
607 uint16_t size = ao_scheme_chunk[i].size;
613 if (ao_scheme_chunk[i].old_offset > top)
616 MDBG_MOVE("chunk %d %d not moving\n",
617 ao_scheme_chunk[i].old_offset,
618 ao_scheme_chunk[i].size);
620 if (ao_scheme_chunk[i].old_offset != top)
626 /* Short-circuit the rest of the loop when all of the
627 * found objects aren't moving. This isn't strictly
628 * necessary as the rest of the loop is structured to
629 * work in this case, but GCC 7.2.0 with optimization
630 * greater than 2 generates incorrect code for this...
632 if (i == AO_SCHEME_NCHUNK) {
633 chunk_low = chunk_high;
641 * Limit amount of chunk array used in mapping moves
642 * to the active region
645 chunk_low = ao_scheme_chunk[i].old_offset;
647 /* Copy all of the objects */
648 for (; i < chunk_last; i++) {
649 uint16_t size = ao_scheme_chunk[i].size;
656 MDBG_MOVE("chunk %d %d -> %d\n",
657 ao_scheme_chunk[i].old_offset,
660 ao_scheme_chunk[i].new_offset = top;
662 memmove(&ao_scheme_pool[top],
663 &ao_scheme_pool[ao_scheme_chunk[i].old_offset],
669 if (chunk_first < chunk_last) {
670 /* Relocate all references to the objects */
671 walk(ao_scheme_move, ao_scheme_poly_move);
674 ao_scheme_record_free(move_record);
675 move_record = ao_scheme_record_save();
676 if (mark_record && move_record)
677 ao_scheme_record_compare("move", mark_record, move_record);
684 /* If we ran into the end of the heap, then
685 * there's no need to keep walking
687 if (chunk_last != AO_SCHEME_NCHUNK)
690 /* Next loop starts right above this loop */
691 chunk_low = chunk_high;
696 ++ao_scheme_collects[style];
697 ao_scheme_freed[style] += ao_scheme_top - top;
698 ao_scheme_loops[style] += loops;
702 if (style == AO_SCHEME_COLLECT_FULL)
703 ao_scheme_last_top = top;
705 MDBG_DO(memset(ao_scheme_chunk, '\0', sizeof (ao_scheme_chunk));
706 walk(ao_scheme_mark_ref, ao_scheme_poly_mark_ref));
709 fprintf(stderr, "max collect stack depth %lu\n", mem_collect_max_depth);
711 MDBG_DO(--ao_scheme_collecting);
712 return AO_SCHEME_POOL - ao_scheme_top;
717 ao_scheme_cons_check(struct ao_scheme_cons *cons)
724 walk(ao_scheme_mark_ref, ao_scheme_poly_mark_ref);
726 if (!ao_scheme_is_pool_addr(cons))
728 offset = pool_offset(cons);
729 if (busy(ao_scheme_busy, offset)) {
730 ao_scheme_printf("cons at %p offset %d poly %d is busy\n\t%v\n", cons, offset, ao_scheme_cons_poly(cons), ao_scheme_cons_poly(cons));
734 if (!ao_scheme_is_pair(cdr))
736 cons = ao_scheme_poly_cons(cdr);
742 * Mark interfaces for objects
747 * Note a reference to memory and collect information about a few
748 * object sizes at a time
752 ao_scheme_mark_memory(const struct ao_scheme_type *type, void *addr)
755 if (!ao_scheme_is_pool_addr(addr))
758 offset = pool_offset(addr);
759 MDBG_MOVE("mark memory %d\n", MDBG_OFFSET(addr));
760 if (busy(ao_scheme_busy, offset)) {
761 MDBG_MOVE("already marked\n");
764 mark(ao_scheme_busy, offset);
765 note_chunk(offset, ao_scheme_size(type, addr));
770 * Mark an object and all that it refereces
773 ao_scheme_mark(const struct ao_scheme_type *type, void *addr)
776 MDBG_MOVE("mark %d\n", MDBG_OFFSET(addr));
778 ret = ao_scheme_mark_memory(type, addr);
780 MDBG_MOVE("mark recurse\n");
788 * Mark an object, unless it is a cons cell and
789 * do_note_cons is set. In that case, just
790 * set a bit in the cons note array; those
791 * will be marked in a separate pass to avoid
792 * deep recursion in the collector
795 ao_scheme_poly_mark(ao_poly p, uint8_t do_note_cons)
801 type = ao_scheme_poly_base_type(p);
803 if (type == AO_SCHEME_INT)
806 addr = ao_scheme_ref(p);
807 if (!ao_scheme_is_pool_addr(addr))
810 if (type == AO_SCHEME_CONS && do_note_cons) {
811 note_cons(pool_offset(addr));
814 const struct ao_scheme_type *lisp_type;
816 if (type == AO_SCHEME_OTHER)
817 type = ao_scheme_other_type(addr);
819 lisp_type = ao_scheme_types[type];
825 MDBG_MOVE("mark %d\n", MDBG_OFFSET(addr));
827 ret = ao_scheme_mark_memory(lisp_type, addr);
829 MDBG_MOVE("mark recurse\n");
830 lisp_type->mark(addr);
838 * Find the current location of an object
839 * based on the original location. For unmoved
840 * objects, this is simple. For moved objects,
845 move_map(uint16_t offset)
849 if (offset < chunk_low || chunk_high <= offset)
852 l = find_chunk(offset);
855 if (ao_scheme_chunk[l].old_offset != offset)
858 return ao_scheme_chunk[l].new_offset;
862 ao_scheme_move_memory(const struct ao_scheme_type *type, void **ref)
865 uint16_t offset, orig_offset;
867 if (!ao_scheme_is_pool_addr(addr))
872 MDBG_MOVE("move memory %d\n", MDBG_OFFSET(addr));
873 orig_offset = pool_offset(addr);
874 offset = move_map(orig_offset);
875 if (offset != orig_offset) {
876 MDBG_MOVE("update ref %d %d -> %d\n",
877 ao_scheme_is_pool_addr(ref) ? MDBG_OFFSET(ref) : -1,
878 orig_offset, offset);
879 *ref = ao_scheme_pool + offset;
881 if (busy(ao_scheme_busy, offset)) {
882 MDBG_MOVE("already moved\n");
885 mark(ao_scheme_busy, offset);
886 ao_scheme_record(type, addr, ao_scheme_size(type, addr));
891 ao_scheme_move(const struct ao_scheme_type *type, void **ref)
894 MDBG_MOVE("move object %d\n", MDBG_OFFSET(*ref));
896 ret = ao_scheme_move_memory(type, ref);
898 MDBG_MOVE("move recurse\n");
906 ao_scheme_poly_move(ao_poly *ref, uint8_t do_note_cons)
911 uint16_t offset, orig_offset;
913 if (ao_scheme_poly_base_type(p) == AO_SCHEME_INT)
916 addr = ao_scheme_ref(p);
917 if (!ao_scheme_is_pool_addr(addr))
920 orig_offset = pool_offset(addr);
921 offset = move_map(orig_offset);
923 if (ao_scheme_poly_base_type(p) == AO_SCHEME_CONS && do_note_cons) {
924 note_cons(orig_offset);
927 uint8_t type = ao_scheme_poly_base_type(p);
928 const struct ao_scheme_type *lisp_type;
930 if (type == AO_SCHEME_OTHER)
931 type = ao_scheme_other_type(ao_scheme_pool + offset);
933 lisp_type = ao_scheme_types[type];
938 /* inline ao_scheme_move to save stack space */
939 MDBG_MOVE("move object %d\n", MDBG_OFFSET(addr));
941 ret = ao_scheme_move_memory(lisp_type, &addr);
943 MDBG_MOVE("move recurse\n");
944 lisp_type->move(addr);
949 /* Re-write the poly value */
950 if (offset != orig_offset) {
951 ao_poly np = ao_scheme_poly(ao_scheme_pool + offset, ao_scheme_poly_base_type(p));
952 MDBG_MOVE("poly %d moved %d -> %d\n",
953 ao_scheme_poly_type(np), orig_offset, offset);
961 ao_scheme_validate(void)
964 memset(ao_scheme_chunk, '\0', sizeof (ao_scheme_chunk));
965 walk(ao_scheme_mark_ref, ao_scheme_poly_mark_ref);
973 ao_scheme_alloc(int size)
977 MDBG_DO(++dbg_allocs);
978 MDBG_DO(if (dbg_validate) ao_scheme_validate());
979 size = ao_scheme_size_round(size);
980 if (AO_SCHEME_POOL - ao_scheme_top < size &&
981 ao_scheme_collect(AO_SCHEME_COLLECT_INCREMENTAL) < size &&
982 ao_scheme_collect(AO_SCHEME_COLLECT_FULL) < size)
984 ao_scheme_error(AO_SCHEME_OOM, "out of memory");
987 addr = ao_scheme_pool + ao_scheme_top;
988 ao_scheme_top += size;
989 MDBG_MOVE("alloc %d size %d\n", MDBG_OFFSET(addr), size);
994 ao_scheme_cons_stash(int id, struct ao_scheme_cons *cons)
996 assert(save_cons[id] == 0);
997 save_cons[id] = cons;
1000 struct ao_scheme_cons *
1001 ao_scheme_cons_fetch(int id)
1003 struct ao_scheme_cons *cons = save_cons[id];
1004 save_cons[id] = NULL;
1009 ao_scheme_poly_stash(int id, ao_poly poly)
1011 assert(save_poly[id] == AO_SCHEME_NIL);
1012 save_poly[id] = poly;
1016 ao_scheme_poly_fetch(int id)
1018 ao_poly poly = save_poly[id];
1019 save_poly[id] = AO_SCHEME_NIL;
1024 ao_scheme_string_stash(int id, struct ao_scheme_string *string)
1026 assert(save_string[id] == NULL);
1027 save_string[id] = string;
1030 struct ao_scheme_string *
1031 ao_scheme_string_fetch(int id)
1033 struct ao_scheme_string *string = save_string[id];
1034 save_string[id] = NULL;
1039 ao_scheme_frame_stash(int id, struct ao_scheme_frame *frame)
1041 assert(save_frame[id] == NULL);
1042 save_frame[id] = frame;
1045 struct ao_scheme_frame *
1046 ao_scheme_frame_fetch(int id)
1048 struct ao_scheme_frame *frame = save_frame[id];
1049 save_frame[id] = NULL;
1054 ao_scheme_print_mark_addr(void *addr)
1059 if (ao_scheme_collecting)
1063 if (!ao_scheme_is_pool_addr(addr))
1066 if (!ao_scheme_print_cleared) {
1067 ao_scheme_print_cleared = 1;
1068 memset(ao_scheme_busy, '\0', sizeof (ao_scheme_busy));
1070 offset = pool_offset(addr);
1071 if (busy(ao_scheme_busy, offset))
1073 mark(ao_scheme_busy, offset);
1078 ao_scheme_print_clear_addr(void *addr)
1083 if (ao_scheme_collecting)
1087 if (!ao_scheme_is_pool_addr(addr))
1090 if (!ao_scheme_print_cleared)
1092 offset = pool_offset(addr);
1093 clear(ao_scheme_busy, offset);
1096 /* Notes that printing has started */
1098 ao_scheme_print_start(void)
1100 ao_scheme_printing++;
1103 /* Notes that printing has ended. Returns 1 if printing is still going on */
1105 ao_scheme_print_stop(void)
1107 ao_scheme_printing--;
1108 if (ao_scheme_printing != 0)
1110 ao_scheme_print_cleared = 0;