1 #include "alloc/alloc.h"
3 #include "alloc/alloc.c"
7 #define POOL_SIZE (1 << POOL_ORD)
9 #define sort(p, num, cmp) \
10 qsort((p), (num), sizeof(*p), (int(*)(const void *, const void *))cmp)
12 static int addr_cmp(void **a, void **b)
17 static bool unique(void *p[], unsigned int num)
21 for (i = 1; i < num; i++)
27 static bool free_every_second_one(void *mem, unsigned int num, void *p[])
31 /* Free every second one. */
32 for (i = 0; i < num; i += 2) {
33 alloc_free(mem, POOL_SIZE, p[i]);
34 if (!alloc_check(mem, POOL_SIZE))
37 for (i = 1; i < num; i += 2) {
38 alloc_free(mem, POOL_SIZE, p[i]);
39 if (!alloc_check(mem, POOL_SIZE))
46 int main(int argc, char *argv[])
49 unsigned int i, num, max_size;
54 /* FIXME: Needs to be page aligned for now. */
55 posix_memalign(&mem, getpagesize(), POOL_SIZE);
57 /* Small pool, all allocs fail, even 0-length. */
59 ok1(alloc_check(mem, 0));
60 ok1(alloc_get(mem, 0, 1, 1) == NULL);
61 ok1(alloc_get(mem, 0, 128, 1) == NULL);
62 ok1(alloc_get(mem, 0, 0, 1) == NULL);
64 /* Free of NULL should work. */
65 alloc_free(mem, 0, NULL);
67 alloc_init(mem, POOL_SIZE);
68 ok1(alloc_check(mem, POOL_SIZE));
69 /* Find largest allocation which works. */
70 for (max_size = POOL_SIZE * 2; max_size; max_size--) {
71 p[0] = alloc_get(mem, POOL_SIZE, max_size, 1);
75 ok1(max_size < POOL_SIZE);
77 ok1(alloc_check(mem, POOL_SIZE));
79 /* Free it, should be able to reallocate it. */
80 alloc_free(mem, POOL_SIZE, p[0]);
81 ok1(alloc_check(mem, POOL_SIZE));
83 p[0] = alloc_get(mem, POOL_SIZE, max_size, 1);
85 ok1(alloc_check(mem, POOL_SIZE));
86 alloc_free(mem, POOL_SIZE, p[0]);
87 ok1(alloc_check(mem, POOL_SIZE));
89 /* Allocate a whole heap. */
90 for (i = 0; i < POOL_SIZE; i++) {
91 p[i] = alloc_get(mem, POOL_SIZE, 1, 1);
97 /* Can't allocate this many. */
98 ok1(num != POOL_SIZE);
99 ok1(alloc_check(mem, POOL_SIZE));
102 sort(p, num, addr_cmp);
104 /* Uniqueness check */
107 ok1(free_every_second_one(mem, num, p));
108 ok1(alloc_check(mem, POOL_SIZE));
110 /* Should be able to reallocate max size. */
111 p[0] = alloc_get(mem, POOL_SIZE, max_size, 1);
113 ok1(alloc_check(mem, POOL_SIZE));
115 /* Re-initializing should be the same as freeing everything */
116 alloc_init(mem, POOL_SIZE);
117 ok1(alloc_check(mem, POOL_SIZE));
118 p[0] = alloc_get(mem, POOL_SIZE, max_size, 1);
120 ok1(alloc_check(mem, POOL_SIZE));
121 alloc_free(mem, POOL_SIZE, p[0]);
122 ok1(alloc_check(mem, POOL_SIZE));
124 /* Alignment constraints should be met, as long as powers of two */
125 for (i = 0; i < POOL_ORD-1; i++) {
126 p[i] = alloc_get(mem, POOL_SIZE, i, 1 << i);
128 ok1(((unsigned long)p[i] % (1 << i)) == 0);
129 ok1(alloc_check(mem, POOL_SIZE));
132 for (i = 0; i < POOL_ORD-1; i++) {
133 alloc_free(mem, POOL_SIZE, p[i]);
134 ok1(alloc_check(mem, POOL_SIZE));
137 /* Alignment constraints for a single-byte allocation. */
138 for (i = 0; i < POOL_ORD; i++) {
139 p[0] = alloc_get(mem, POOL_SIZE, 1, 1 << i);
141 ok1(alloc_check(mem, POOL_SIZE));
142 alloc_free(mem, POOL_SIZE, p[0]);
143 ok1(alloc_check(mem, POOL_SIZE));
146 /* Alignment check for a 0-byte allocation. Corner case. */
147 p[0] = alloc_get(mem, POOL_SIZE, 0, 1 << (POOL_ORD - 1));
148 ok1(alloc_check(mem, POOL_SIZE));
149 alloc_free(mem, POOL_SIZE, p[0]);
150 ok1(alloc_check(mem, POOL_SIZE));
152 return exit_status();