/
data.c
159 lines (145 loc) · 3.79 KB
/
data.c
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
/*
* Copyright 2018 Thomas de Grivel <thoxdg@gmail.com> +33614550127
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <assert.h>
#include <stdlib.h>
#include <strings.h>
#include "data.h"
s_data_type g_data_alloc_type = {
sizeof(s_data_alloc) * 8,
DATA_TYPE_BITS
};
s_data_alloc g_data_alloc;
s_data_type g_data_type_type = {
sizeof(u_data_type) * 8,
DATA_TYPE_BITS
};
s_data_alloc *g_data_type_alloc = 0;
int libdata_init ()
{
data_alloc_init(&g_data_alloc, &g_data_alloc_type,
DATA_ALLOC_MAX, 0, (f_data_clean*) data_alloc_clean);
return 0;
}
void data_alloc_init (s_data_alloc *da, s_data_type *t,
unsigned int max, f_data_init *init,
f_data_clean *clean)
{
assert(da);
assert(t);
da->t = t;
da->max = max;
da->mem = calloc(max, (t->bits + 7) / 8);
da->n = 0;
da->free = calloc(max, sizeof(unsigned int));
da->free_n = 0;
da->init = init;
da->clean = clean;
}
void data_alloc_clean (s_data_alloc *da)
{
assert(da);
bzero(da->mem, da->max * ((da->t->bits + 7) / 8));
bzero(da->free, da->max * sizeof(unsigned int));
free(da->mem);
free(da->free);
}
static inline
void * data_new_at (s_data_alloc *da, unsigned int i)
{
unsigned int octets = (da->t->bits + 7) / 8;
unsigned int offset = i * octets;
void *m = da->mem + offset;
bzero(m, octets);
if (da->init)
da->init(m);
return m;
}
void * data_new (s_data_alloc *da)
{
assert(da);
if (da->free_n) {
unsigned int i = da->free[--da->free_n];
da->free[da->free_n] = 0;
return data_new_at(da, i);
}
if (da->n < da->max) {
unsigned int i = da->n++;
return data_new_at(da, i);
}
return 0;
}
int data_new_i (s_data_alloc *da)
{
assert(da);
if (da->free_n) {
unsigned int i = da->free[--da->free_n];
da->free[da->free_n] = 0;
data_new_at(da, i);
return i;
}
if (da->n < da->max) {
unsigned int i = da->n++;
data_new_at(da, i);
return i;
}
return -1;
}
void data_delete (s_data_alloc *da, void *data)
{
unsigned int octets;
unsigned int i;
assert(da);
assert(da->t);
octets = ((da->t->bits + 7) / 8);
assert(da->mem <= data);
assert(data < da->mem + da->max * octets);
if (da->clean)
da->clean(data);
bzero(data, octets);
i = (data - da->mem) / octets;
da->free[da->free_n++] = i;
}
s_data_alloc * data_alloc_new (s_data_type *t, unsigned int max,
f_data_init *init, f_data_clean *clean)
{
s_data_alloc *da = data_new(&g_data_alloc);
assert(da);
data_alloc_init(da, t, max, init, clean);
return da;
}
void data_alloc_delete (s_data_alloc *da)
{
assert(da);
data_delete(&g_data_alloc, da);
}
u_data_type * data_type_new (unsigned int bits, unsigned int type)
{
u_data_type *t;
if (!g_data_type_alloc)
g_data_type_alloc = data_alloc_new(&g_data_type_type, DATA_TYPE_MAX,
0, 0);
assert(g_data_type_alloc);
t = data_new(g_data_type_alloc);
assert(t);
t->t.bits = bits;
t->t.type = type;
return t;
}
void data_type_delete (s_data_type *t)
{
assert(g_data_type_alloc);
data_delete(g_data_type_alloc, t);
}