90 lines
2.3 KiB
C
90 lines
2.3 KiB
C
#include "freelist.h"
|
|
#include <assert.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
typedef struct {
|
|
int x, y, z;
|
|
} Vec3;
|
|
|
|
Vec3 vec3_new(int a, int b, int c) {
|
|
return (Vec3){a, b, c};
|
|
}
|
|
|
|
// Print function
|
|
void printvec(const Vec3 *v) {
|
|
printf("Vec3: (%d, %d, %d)\n", v->x, v->y, v->z);
|
|
}
|
|
|
|
#define BUFFER_SIZE (4096)
|
|
|
|
int main() {
|
|
FreeList fl;
|
|
const char *mem = malloc(BUFFER_SIZE);
|
|
|
|
fl_init(&fl, (uintptr_t)mem, (uintptr_t)mem + BUFFER_SIZE, sizeof(Vec3));
|
|
const size_t cap = fl_capacity(&fl);
|
|
|
|
printf("Item size: %lu\n", sizeof(Vec3));
|
|
printf("Buffer size: %d\n", BUFFER_SIZE);
|
|
printf("Space utilization internal: %.2f%%\n", 100.0 * fl_utilization(&fl, sizeof(Vec3)));
|
|
printf("Space utilization external: %.2f%%\n", 100.0 * ((float)fl.size * cap) / BUFFER_SIZE);
|
|
|
|
assert(fl_available(&fl) == cap);
|
|
|
|
Vec3 *a = fl_alloc(&fl);
|
|
Vec3 *b = fl_alloc(&fl);
|
|
Vec3 *c = fl_alloc(&fl);
|
|
|
|
memset(a, 0x23, sizeof(Vec3));
|
|
memset(b, 0x24, sizeof(Vec3));
|
|
memset(c, 0x25, sizeof(Vec3));
|
|
|
|
*a = vec3_new(12, 13, 435);
|
|
*b = vec3_new(192, 199, 435);
|
|
*c = vec3_new(432, 11, 435);
|
|
|
|
printvec(a);
|
|
printvec(b);
|
|
printvec(c);
|
|
|
|
assert(fl_check(&fl) == cap - 3);
|
|
assert(fl_capacity(&fl) == fl_available(&fl) + 3);
|
|
|
|
printf("Available: %zu of %zu\n", fl_available(&fl), fl_capacity(&fl));
|
|
|
|
assert(fl_free(&fl, a) == EXIT_SUCCESS);
|
|
assert(fl_free(&fl, b) == EXIT_SUCCESS);
|
|
assert(fl_free(&fl, c) == EXIT_SUCCESS);
|
|
|
|
printf("Available: %zu of %zu\n", fl_available(&fl), fl_capacity(&fl));
|
|
|
|
assert(fl_check(&fl) == fl_capacity(&fl) - fl_allocated(&fl));
|
|
assert(fl_allocated(&fl) == 0);
|
|
|
|
/* All memory is free here */
|
|
|
|
uintptr_t *ptr_buf = malloc(sizeof(uintptr_t) * fl_capacity(&fl));
|
|
|
|
/* Fill it up */
|
|
for (int i = 0; i < fl_capacity(&fl); i++) {
|
|
ptr_buf[i] = (uintptr_t)fl_alloc(&fl);
|
|
}
|
|
|
|
assert(0 == fl_available(&fl));
|
|
assert(fl_allocated(&fl) == fl_capacity(&fl));
|
|
assert(fl_check(&fl) == 0);
|
|
|
|
/* Return it all */
|
|
for (int i = 0; i < fl_capacity(&fl); i++) {
|
|
fl_free(&fl, (void *)ptr_buf[i]);
|
|
}
|
|
|
|
assert(cap == fl_available(&fl));
|
|
assert(fl_allocated(&fl) == 0);
|
|
assert(fl_check(&fl) == cap);
|
|
|
|
printf("All tests passed!\n");
|
|
return 0;
|
|
}
|