int main ()
{
object obj;
GC_init();
obj = NEW();
RELEASE(obj);
GC_collect(0);
ASSERTDEAD(obj);
ASSERTFINAL(obj);
obj = NEW();
GC_collect(0);
ASSERTLIVE(obj);
ASSERTNOFINAL(obj);
GC_terminate(0);
ASSERTNOFINAL(obj);
GC_init();
obj = NEW();
GC_terminate(1);
ASSERTFINAL(obj);
return 0;
}
/**
* Testing entry point
*/
int main(int argc, char *argv[])
{
header_t h, i, j, k;
header_t *list, *it, *ptr, *b1, *b2, *b3, *b4, **region;
void *l, **root, *p;
size_t s;
char *charp;
int *intp, i1;
short *shortp;
/*//Basic info
printf("%d\n", sizeof(h));
printf("%d\n", sizeof(header_t));
printf("%d\n", sizeof(size_t));
printf("%d\n", sizeof(header_t*));
printf("\n");
//Testing list
list = NULL;
h.size = 101;
i.size = 102;
j.size = 103;
k.size = 104;
add_to_list(&list, &h);
add_to_list(&list, &i);
add_to_list(&list, &j);
add_to_list(&list, &k);
for(it = list; it != NULL; it = next_block(it))
printf("%d\n", it->size);
printf("\n");
remove_from_list(&list, &i, &j);
for(it = list; it != NULL; it = next_block(it))
printf("%d\n", it->size);
printf("\n");
//Testing First fit
ptr = first_fit(&list, 200);
printf("%x\n", ptr);
ptr = first_fit(&list, 102 - sizeof(header_t));
printf("%x\n", ptr);
printf("%d\n", ptr->size);
for(it = list; it != NULL; it = next_block(it))
printf("%d\n", it->size);
printf("\n");
//Testing aling_by_size and aling_pointer
printf("%d\n", aling_by_size(3, 4));
printf("%d\n", aling_pointer((void*)3, 4));
s = aling_by_size((ptr_int)&h, ALLOC_ALIGN);
l = aling_pointer(&h, ALLOC_ALIGN);
printf("%x\n", s);
printf("%x\n", l);
printf("%x\n", &h);
//Testing morecore
b1 = morecore(1);
b2 = morecore(MIN_ALLOC_SIZE);
b3 = morecore(MIN_ALLOC_SIZE + 5);
b4 = morecore(4 * MIN_ALLOC_SIZE);
printf("%x: size %d, next: %x\n", b1, b1->size, b1->next);
printf("%x: size %d, next: %x\n", b2, b2->size, b2->next);
printf("%x: size %d, next: %x\n", b3, b3->size, b3->next);
printf("%x: size %d, next: %x\n", b4, b4->size, b4->next);
printf("\n");
//Tag test
tag(b1);
tag(b3);
printf("%x: size %d, next: %x\n", b1, b1->size, b1->next);
printf("%x: size %d, next: %x\n", b2, b2->size, b2->next);
printf("%x: size %d, next: %x\n", b3, b3->size, b3->next);
printf("%x: size %d, next: %x\n", b4, b4->size, b4->next);
printf("\n");
printf("%d\n", is_tagged(b1));
printf("%d\n", is_tagged(b2));
printf("%d\n", is_tagged(b3));
printf("%d\n", is_tagged(b4));
printf("\n");
printf("%d\n", next_block(b1));
printf("%d\n", next_block(b2));
printf("%d\n", next_block(b3));
printf("%d\n", next_block(b4));
//GC_malloc test
charp = (char*)GC_malloc(6 * sizeof(char));
charp[0] = 'H';
charp[1] = 'e';
charp[2] = 'l';
charp[3] = 'l';
charp[4] = 'o';
charp[5] = '\0';
printf("%s\n", charp);
intp = (int*)GC_malloc(1030 * sizeof(int));
for(i1 = 0; i1 < 1030; i1++)
printf("%d", intp[i1]);
printf("\n");
shortp = (short*)GC_malloc(sizeof(short));
*shortp = 4;
printf("%x: %d\n", shortp, *shortp);
printf("\n");
for(it = usedptr; it != NULL; it = next_block(it))
printf("%d\n", it->size);
printf("\n");
for(it = freeptr; it != NULL; it = next_block(it))
printf("%d\n", it->size);
printf("\n");
//Mark from region test
region = (header_t**)malloc(100 * sizeof(header_t*));
region[0] = GC_malloc(5000);
region[1] = GC_malloc(6000);
region[2] = GC_malloc(7000);
for(it = usedptr; it != NULL; it = next_block(it))
printf("%x: %d, %x\n", it, it->size, it->next);
printf("\n");
for(it = freeptr; it != NULL; it = next_block(it))
printf("%x: %d, %x\n", it, it->size, it->next);
printf("\n");
mark_from_region((void*)region, (void*)region + 100 * sizeof(header_t*));
for(it = usedptr; it != NULL; it = next_block(it))
printf("%x: %d, %x\n", it, it->size, it->next);
printf("\n");
for(it = freeptr; it != NULL; it = next_block(it))
printf("%x: %d, %x\n", it, it->size, it->next);
printf("\n");
//Mark from heap test
root = (void**)GC_malloc(1000*sizeof(void*));
root[0] = GC_malloc(5000);
root[3] = GC_malloc(6000);
root[7] = GC_malloc(7000);
mark_from_heap();
for(it = usedptr; it != NULL; it = next_block(it))
printf("%x: %d, %x\n", it, it->size, it->next);
printf("\n");
//Stack bottom, stack top test
stack_bottom = get_stack_bottom();
REFRESH_STACK_TOP
for(p = stack_bottom; p < stack_top; p += sizeof(void*))
printf("%p: %p\n", p, *(ptr_int*)p);
//GC init test
GC_init();
printf("%p\n%p\n%p\n", stack_bottom, usedptr, freeptr);
*/
//GC Collect test
GC_init();
root = (void**)GC_malloc(1000*sizeof(void*)); //8000 bytes
root[0] = GC_malloc(5000);
root[3] = GC_malloc(6000);
root[7] = GC_malloc(7000);
root[7] = NULL;
p = GC_malloc(9000);
p = NULL;
bss_ptr_1 = GC_malloc(10000);
bss_ptr_2 = GC_malloc(11000);
bss_ptr_2 = NULL;
//The blocks of size 7016, 9016 and 11016 should be freed by GC_collect
printf("Used list:\n");
for(it = usedptr; it != NULL; it = next_block(it))
printf("%x: %d, %x\n", it, it->size, it->next);
printf("\n");
printf("Free list:\n");
for(it = freeptr; it != NULL; it = next_block(it))
printf("%x: %d, %x\n", it, it->size, it->next);
printf("\n");
printf("GC_collect\n");
GC_collect();
printf("Used list:\n");
for(it = usedptr; it != NULL; it = next_block(it))
printf("%x: %d, %x\n", it, it->size, it->next);
printf("\n");
printf("Free list:\n");
for(it = freeptr; it != NULL; it = next_block(it))
printf("%x: %d, %x\n", it, it->size, it->next);
printf("\n");
return 0;
}
