@@ -17,7 +17,6 @@ VAL copy(VM* vm, VAL x) {
18 allocCon(cl, vm, CTAG(x), ar, 1);
18 allocCon(cl, vm, CTAG(x), ar, 1);
19 for(i = 0; i < ar; ++i) {
19 for(i = 0; i < ar; ++i) {
20− // *argptr = copy(vm, *((VAL*)(x->info.c.args)+i)); // recursive version
21 cl->info.c.args[i] = x->info.c.args[i];
20 cl->info.c.args[i] = x->info.c.args[i];
@@ -90,9 +89,7 @@ void cheney(VM *vm) {
91 ar = ARITY(heap_item);
90 ar = ARITY(heap_item);
92 for(i = 0; i < ar; ++i) {
91 for(i = 0; i < ar; ++i) {
93− // printf("Copying %d %p\n", heap_item->info.c.tag, *argptr);
94 VAL newptr = copy(vm, heap_item->info.c.args[i]);
92 VAL newptr = copy(vm, heap_item->info.c.args[i]);
95− // printf("Got %p\t\t%p %p\n", newptr, scan, vm->heap_next);
96 heap_item->info.c.args[i] = newptr;
93 heap_item->info.c.args[i] = newptr;
@@ -111,7 +108,6 @@ void cheney(VM *vm) {
111void idris_gc(VM* vm) {
108void idris_gc(VM* vm) {
112 HEAP_CHECK(vm)
109 HEAP_CHECK(vm)
113 STATS_ENTER_GC(vm->stats, vm->heap.size)
110 STATS_ENTER_GC(vm->stats, vm->heap.size)
114− // printf("Collecting\n");
116 if (vm->heap.old != NULL)
112 if (vm->heap.old != NULL)
117 free(vm->heap.old);
113 free(vm->heap.old);