1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
#include <ccan/tal/tal.h>
#include <ccan/tal/tal.c>
#include <ccan/tap/tap.h>
static bool move;
#define ALIGN (sizeof(void *)*2)
static void *my_alloc(size_t len)
{
char *ret = malloc(len + ALIGN);
memcpy(ret, &len, sizeof(len));
return ret + ALIGN;
}
static void my_free(void *p)
{
if (p)
free((char *)p - ALIGN);
}
static void *my_realloc(void *old, size_t new_size)
{
char *ret;
/* Test what happens if we always move */
if (move) {
size_t old_size = *(size_t *)((char *)old - ALIGN);
ret = my_alloc(new_size);
memcpy(ret, old, old_size > new_size ? new_size : old_size);
my_free(old);
} else {
ret = realloc((char *)old - ALIGN, new_size + ALIGN);
memcpy(ret, &new_size, sizeof(new_size));
ret += ALIGN;
}
return ret;
}
int main(void)
{
char *p1, *p2;
unsigned int i;
tal_set_backend(my_alloc, my_realloc, my_free, NULL);
plan_tests(19 * 3);
for (i = 0; i < 3; i++) {
move = i;
p1 = tal(NULL, char);
ok1(p1);
ok1(tal_count(p1) == 0);
p2 = tal_arr(p1, char, 1);
ok1(p2);
ok1(tal_count(p2) == 1);
ok1(tal_resize(&p2, 2));
ok1(tal_count(p2) == 2);
ok1(tal_check(NULL, NULL));
tal_free(p2);
/* Resize twice. */
p2 = tal_arrz(p1, char, 7);
ok1(p2);
ok1(tal_count(p2) == 7);
ok1(tal_check(NULL, NULL));
tal_resize(&p2, 20);
ok1(p2);
ok1(tal_check(NULL, NULL));
ok1(tal_count(p2) == 20);
/* Tickles non-moving logic, as we do not update bounds. */
if (i == 2)
move = false;
tal_resize(&p2, 300);
ok1(p2);
ok1(tal_check(NULL, NULL));
ok1(tal_count(p2) == 300);
ok1(tal_resize(&p2, 0));
ok1(tal_count(p2) == 0);
ok1(tal_check(NULL, NULL));
tal_free(p2);
tal_free(p1);
}
tal_cleanup();
return exit_status();
}
|
