int main() {
char *a = my_firstfit_malloc(100);
char *b1 = my_firstfit_malloc(100);
char *b2 = my_firstfit_malloc(100);
char *c = my_firstfit_malloc(300);
char *d = my_firstfit_malloc(400);
char *e = my_firstfit_malloc(500);
printf("a: %p\n", a);
printf("b1: %p\n", b1);
printf("b2: %p\n", b2);
printf("c: %p\n", c);
printf("d: %p\n", d);
printf("e: %p\n", e);
my_free(b1);
my_free(b2);
my_free(d);
printf("freeing b1, b2, d\n");
char *f = my_firstfit_malloc(300);
char *g = my_firstfit_malloc(150);
if (f < e) {
printf("correct allocation into freed space\n");
}
if (g < f) {
printf("correct coalesce & first fit\n");
}
printf("f: %p\n", f);
printf("g: %p\n", g);
my_free(a);
my_free(c);
my_free(e);
my_free(f);
my_free(g);
return 0;
}
int main()
{
void *v = my_firstfit_malloc(100);
printTree();
int *w = (int *) my_firstfit_malloc(sizeof(int));
*w = 3;
printTree();
my_free(v);
printTree();
int *z = (int *) my_firstfit_malloc(sizeof(int));
*z = 6;
printTree();
printf("\n");
my_free(z);
printTree();
}
