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
|
/*
* This file is part of LibParserUtils.
* Licensed under the MIT License,
* http://www.opensource.org/licenses/mit-license.php
* Copyright 2008 John-Mark Bell <jmb@netsurf-browser.org>
*/
#include <inttypes.h>
#include <string.h>
#include <parserutils/utils/vector.h>
/**
* Vector object
*/
struct parserutils_vector
{
size_t item_size; /**< Size of an item in the vector */
size_t chunk_size; /**< Size of a vector chunk */
size_t items_allocated; /**< Number of slots allocated */
int32_t current_item; /**< Index of current item */
void *items; /**< Items in vector */
parserutils_alloc alloc; /**< Memory (de)allocation function */
void *pw; /**< Client-specific data */
};
/**
* Create a vector
*
* \param item_size Length, in bytes, of an item in the vector
* \param chunk_size Number of vector slots in a chunk
* \param alloc Memory (de)allocation function
* \param pw Pointer to client-specific private data
* \return Pointer to vector instance, or NULL on memory exhaustion
*/
parserutils_vector *parserutils_vector_create(size_t item_size,
size_t chunk_size, parserutils_alloc alloc, void *pw)
{
parserutils_vector *vector;
if (item_size == 0 || chunk_size == 0 || alloc == NULL)
return NULL;
vector = alloc(NULL, sizeof(parserutils_vector), pw);
if (vector == NULL)
return NULL;
vector->items = alloc(NULL, item_size * chunk_size, pw);
if (vector->items == NULL) {
alloc(vector, 0, pw);
return NULL;
}
vector->item_size = item_size;
vector->chunk_size = chunk_size;
vector->items_allocated = chunk_size;
vector->current_item = -1;
vector->alloc = alloc;
vector->pw = pw;
return vector;
}
/**
* Destroy a vector instance
*
* \param vector The vector to destroy
*/
void parserutils_vector_destroy(parserutils_vector *vector)
{
if (vector == NULL)
return;
vector->alloc(vector->items, 0, vector->pw);
vector->alloc(vector, 0, vector->pw);
}
/**
* Append an item to the vector
*
* \param vector The vector to append to
* \param item The item to append
* \return PARSERUTILS_OK on success, appropriate error otherwise
*/
parserutils_error parserutils_vector_append(parserutils_vector *vector,
void *item)
{
int32_t slot;
if (vector == NULL || item == NULL)
return PARSERUTILS_BADPARM;
/* Ensure we'll get a valid slot */
if (vector->current_item < -1 || vector->current_item == INT32_MAX)
return PARSERUTILS_INVALID;
slot = vector->current_item + 1;
if ((size_t) slot >= vector->items_allocated) {
void *temp = vector->alloc(vector->items,
(vector->items_allocated + vector->chunk_size) *
vector->item_size, vector->pw);
if (temp == NULL)
return PARSERUTILS_NOMEM;
vector->items = temp;
vector->items_allocated += vector->chunk_size;
}
memcpy((uint8_t *) vector->items + (slot * vector->item_size),
item, vector->item_size);
vector->current_item = slot;
return PARSERUTILS_OK;
}
/**
* Clear a vector
*
* \param vector The vector to clear
* \return PARSERUTILS_OK on success, appropriate error otherwise.
*/
parserutils_error parserutils_vector_clear(parserutils_vector *vector)
{
if (vector == NULL)
return PARSERUTILS_BADPARM;
if (vector->current_item < 0)
return PARSERUTILS_INVALID;
vector->current_item = -1;
return PARSERUTILS_OK;
}
/**
* Remove the last item from a vector
*
* \param vector The vector to remove from
* \return PARSERUTILS_OK on success, appropriate error otherwise
*/
parserutils_error parserutils_vector_remove_last(parserutils_vector *vector)
{
if (vector == NULL)
return PARSERUTILS_BADPARM;
if (vector->current_item < 0)
return PARSERUTILS_INVALID;
vector->current_item--;
return PARSERUTILS_OK;
}
/**
* Iterate over a vector
*
* \param vector The vector to iterate over
* \param ctx Pointer to an integer for the iterator to use as context.
* \return Pointer to current item, or NULL if no more
*/
void *parserutils_vector_iterate(parserutils_vector *vector, int32_t *ctx)
{
void *item;
if (vector == NULL || ctx == NULL || vector->current_item < 0)
return NULL;
if ((*ctx) > vector->current_item)
return NULL;
item = (uint8_t *) vector->items + ((*ctx) * vector->item_size);
(*ctx)++;
return item;
}
#ifndef NDEBUG
#include <stdio.h>
extern void parserutils_vector_dump(parserutils_vector *vector,
const char *prefix, void (*printer)(void *item));
void parserutils_vector_dump(parserutils_vector *vector, const char *prefix,
void (*printer)(void *item))
{
if (vector == NULL || printer == NULL)
return;
for (int32_t i = 0; i <= vector->current_item; i++) {
printf("%s %d: ", prefix != NULL ? prefix : "", i);
printer((uint8_t *) vector->items + (i * vector->item_size));
printf("\n");
}
}
#endif
|
