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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
/*
* Copyright (c) 2006, 2008 Alexey Vatchenko <av@bsdua.org>
*
* Permission to use, copy, modify, and/or 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 <sys/types.h>
#include <errno.h>
#include <limits.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include "contrib/vpool/vpool.h"
static void vpool_shift(struct vpool *pool);
static int vpool_new_size(struct vpool *pool, size_t datsize,
size_t *size);
static int vpool_resize(struct vpool *pool, size_t datsize);
static void
vpool_shift(struct vpool *pool)
{
if (pool->v_buf != pool->v_basebuf) {
memmove(pool->v_basebuf, pool->v_buf, pool->v_off);
pool->v_buf = pool->v_basebuf;
}
}
static int
vpool_new_size(struct vpool *pool, size_t datsize, size_t *size)
{
size_t need;
size_t rem;
if (datsize <= pool->v_size - pool->v_off) {
*size = pool->v_size;
return (0);
}
/* Check limit of new requested size */
if (pool->v_limit - pool->v_off < datsize) {
return (EFBIG);
}
need = pool->v_off + datsize;
/* Check limit of new size aligned to block size */
rem = need % pool->v_blksize;
if (rem != 0) {
if (pool->v_limit - pool->v_off >=
datsize + (pool->v_blksize - rem)) {
need += pool->v_blksize - rem;
} else {
need = pool->v_limit;
}
}
*size = need;
return (0);
}
static int
vpool_resize(struct vpool *pool, size_t datsize)
{
void *ret;
size_t size;
int error;
error = vpool_new_size(pool, datsize, &size);
if (error != 0) {
return (error);
}
if (size > pool->v_size) {
ret = malloc(size);
if (ret == NULL) {
return (ENOMEM);
}
memcpy(ret, pool->v_buf, pool->v_off);
free(pool->v_basebuf);
pool->v_basebuf = pool->v_buf = ret;
pool->v_size = size;
} else if ((pool->v_size - pool->v_off) -
(pool->v_buf - pool->v_basebuf) < datsize) {
vpool_shift(pool);
}
return (0);
}
void
vpool_init(struct vpool *pool, size_t blksize, size_t limit)
{
pool->v_basebuf = pool->v_buf = NULL;
pool->v_off = pool->v_size = 0;
pool->v_blksize = (blksize == 0) ? 4096 : blksize; /* XXX */
pool->v_limit = (limit == 0) ? SIZE_MAX : limit;
pool->v_lasterr = 0;
}
void
vpool_final(struct vpool *pool)
{
free(pool->v_basebuf);
}
void
vpool_reset(struct vpool *pool)
{
free(pool->v_basebuf);
pool->v_basebuf = pool->v_buf = NULL;
pool->v_off = pool->v_size = 0;
pool->v_lasterr = 0;
}
void
vpool_wipe(struct vpool *pool)
{
pool->v_off = 0;
pool->v_lasterr = 0;
}
void *
vpool_insert(struct vpool *pool, size_t where, void *data, size_t datsize)
{
void *ret;
int error;
error = vpool_resize(pool, datsize);
if (error != 0) {
pool->v_lasterr = error;
return (NULL);
}
/*
* If ``where'' is greater than or equal to offset then
* we are appending data to the end of the buffer.
*/
if (where > pool->v_off) {
where = pool->v_off;
}
ret = (uint8_t *)pool->v_buf + where;
if (pool->v_off - where > 0) {
memmove(ret + datsize, ret, pool->v_off - where);
}
memcpy(ret, data, datsize);
pool->v_off += datsize;
pool->v_lasterr = 0;
return (ret);
}
void *
vpool_expand(struct vpool *pool, size_t where, size_t size)
{
void *ret;
int error;
error = vpool_resize(pool, size);
if (error != 0) {
pool->v_lasterr = error;
return (NULL);
}
/*
* If ``where'' is greater than or equal to offset then
* we are appending data to the end of the buffer.
*/
if (where > pool->v_off) {
where = pool->v_off;
}
ret = (uint8_t *)pool->v_buf + where;
if (pool->v_off - where > 0) {
memmove(ret + size, ret, pool->v_off - where);
}
pool->v_off += size;
pool->v_lasterr = 0;
return (ret);
}
int
vpool_truncate(struct vpool *pool,
size_t where, size_t size, enum vpool_trunc how)
{
/* Check if caller wants to remove more data than we have */
if (where >= pool->v_off ||
size > pool->v_off || pool->v_off - size < where) {
pool->v_lasterr = ERANGE;
return (pool->v_lasterr);
}
if (how == VPOOL_EXCLUDE) {
if (where == 0) {
/*
* Optimization.
* Don't move data, just adjust pointer.
*/
pool->v_buf = (uint8_t *)pool->v_buf + size;
} else {
memmove((uint8_t *)pool->v_buf + where,
(uint8_t *)pool->v_buf + where + size,
pool->v_off - size - where);
}
pool->v_off -= size;
} else {
pool->v_buf = (uint8_t *)pool->v_buf + where;
pool->v_off = size;
}
pool->v_lasterr = 0;
return (0);
}
void
vpool_export(struct vpool *pool, void **buf, size_t *size)
{
vpool_shift(pool);
*buf = pool->v_buf;
*size = pool->v_off;
pool->v_basebuf = pool->v_buf = NULL;
pool->v_off = pool->v_size = 0;
pool->v_lasterr = 0;
}
|
