blob: 0c8ca2a1d6ae5207e76fabb249f2737327c5595b (
plain)
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
#include <stdlib.h>
#include <stdbool.h>
static bool fail_realloc;
static void *my_realloc(void *p, size_t len)
{
if (fail_realloc)
return NULL;
return realloc(p, len);
}
#define realloc my_realloc
#include <ccan/take/take.h>
#include <ccan/take/take.c>
#include <ccan/tap/tap.h>
static int my_allocfail_called;
static void my_allocfail(const void *p)
{
my_allocfail_called++;
}
static void recurse(const char *takeme, int count)
{
if (count < 1000)
recurse(take(strdup(takeme)), count+1);
if (taken(takeme))
free((char *)takeme);
}
int main(void)
{
const char *p = "hi";
plan_tests(43);
/* We can take NULL. */
ok1(take(NULL) == NULL);
ok1(is_taken(NULL));
ok1(taken_any());
ok1(taken(NULL)); /* Undoes take() */
ok1(!is_taken(NULL));
ok1(!taken(NULL));
/* We can take NULL twice! */
ok1(take(NULL) == NULL);
ok1(take(NULL) == NULL);
ok1(is_taken(NULL));
ok1(taken_any());
ok1(taken(NULL)); /* Undoes take() */
ok1(is_taken(NULL));
ok1(taken_any());
ok1(taken(NULL)); /* Undoes take() */
ok1(!is_taken(NULL));
ok1(!taken(NULL));
ok1(!taken_any());
/* We can take a real pointer. */
ok1(take(p) == p);
ok1(is_taken(p));
ok1(taken_any());
ok1(taken(p)); /* Undoes take() */
ok1(!is_taken(p));
ok1(!taken(p));
ok1(!taken_any());
/* Force a failure. */
ok1(!my_allocfail_called);
ok1(take(p) == p);
ok1(take(p+1) == p+1);
fail_realloc = true;
/* Without a handler, must pass through and leak. */
ok1(take(p+2) == p+2);
ok1(!taken(p+2));
/* Now, with a handler. */
take_allocfail(my_allocfail);
ok1(take(p+2) == NULL);
ok1(my_allocfail_called == 1);
ok1(taken_any());
ok1(taken(p));
ok1(taken(p+1));
ok1(is_taken(NULL));
ok1(taken(NULL));
ok1(!taken(NULL));
ok1(!taken_any());
/* Test some deep nesting. */
fail_realloc = false;
recurse("hello", 0);
ok1(max_taken == 1000);
ok1(!taken_any());
take_cleanup();
ok1(num_taken == 0);
ok1(max_taken == 0);
ok1(takenarr == NULL);
return exit_status();
}
|
