1 #include <ccan/tal/tal.h>
2 #include <ccan/tal/tal.c>
3 #include <ccan/tap/tap.h>
6 #define ALIGN (sizeof(void *)*2)
8 static void *my_alloc(size_t len)
10 char *ret = malloc(len + ALIGN);
11 memcpy(ret, &len, sizeof(len));
15 static void my_free(void *p)
18 free((char *)p - ALIGN);
21 static void *my_realloc(void *old, size_t new_size)
25 /* Test what happens if we always move */
27 size_t old_size = *(size_t *)((char *)old - ALIGN);
28 ret = my_alloc(new_size);
29 memcpy(ret, old, old_size > new_size ? new_size : old_size);
32 ret = realloc((char *)old - ALIGN, new_size + ALIGN);
33 memcpy(ret, &new_size, sizeof(new_size));
44 tal_set_backend(my_alloc, my_realloc, my_free, NULL);
48 for (i = 0; i < 3; i++) {
53 ok1(tal_count(p1) == 0);
55 p2 = tal_arr(p1, char, 1);
57 ok1(tal_count(p2) == 1);
58 ok1(tal_resize(&p2, 2));
59 ok1(tal_count(p2) == 2);
60 ok1(tal_check(NULL, NULL));
64 p2 = tal_arrz(p1, char, 7);
66 ok1(tal_count(p2) == 7);
67 ok1(tal_check(NULL, NULL));
70 ok1(tal_check(NULL, NULL));
71 ok1(tal_count(p2) == 20);
72 /* Tickles non-moving logic, as we do not update bounds. */
77 ok1(tal_check(NULL, NULL));
78 ok1(tal_count(p2) == 300);
79 ok1(tal_resize(&p2, 0));
80 ok1(tal_count(p2) == 0);
81 ok1(tal_check(NULL, NULL));