blob: 73e5c29d206fcf5a5cf23e7b6f8d4836a3d06fc4 (
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
|
/* CC0 (Public domain) - see LICENSE file for details */
#include <ccan/take/take.h>
#include <ccan/likely/likely.h>
#include <stdlib.h>
#include <string.h>
static const void **takenarr;
static size_t max_taken, num_taken;
static size_t allocfail;
static void (*allocfailfn)(const void *p);
void *take_(const void *p)
{
if (unlikely(num_taken == max_taken)) {
const void **new;
new = realloc(takenarr, sizeof(*takenarr) * (max_taken+1));
if (unlikely(!new)) {
if (allocfailfn) {
allocfail++;
allocfailfn(p);
return NULL;
}
/* Otherwise we leak p. */
return (void *)p;
}
takenarr = new;
max_taken++;
}
takenarr[num_taken++] = p;
return (void *)p;
}
static size_t find_taken(const void *p)
{
size_t i;
for (i = 0; i < num_taken; i++) {
if (takenarr[i] == p)
return i+1;
}
return 0;
}
bool taken(const void *p)
{
size_t i;
if (!p && unlikely(allocfail)) {
allocfail--;
return true;
}
i = find_taken(p);
if (!i)
return false;
memmove(&takenarr[i-1], &takenarr[i],
(--num_taken - (i - 1))*sizeof(takenarr[0]));
return true;
}
bool is_taken(const void *p)
{
if (!p && unlikely(allocfail))
return true;
return find_taken(p) > 0;
}
bool taken_any(void)
{
return num_taken != 0;
}
void take_cleanup(void)
{
max_taken = num_taken = 0;
free(takenarr);
takenarr = NULL;
}
void take_allocfail(void (*fn)(const void *p))
{
allocfailfn = fn;
}
|
