|
krh@0
|
1 |
#include <stdlib.h>
|
|
krh@0
|
2 |
#include <stdio.h>
|
|
krh@0
|
3 |
#include <string.h>
|
|
krh@0
|
4 |
#include <sys/types.h>
|
|
krh@0
|
5 |
#include <sys/stat.h>
|
|
krh@0
|
6 |
#include <sys/mman.h>
|
|
krh@0
|
7 |
#include <unistd.h>
|
|
krh@0
|
8 |
#include <fcntl.h>
|
|
krh@0
|
9 |
|
|
krh@0
|
10 |
#include <expat.h>
|
|
krh@0
|
11 |
#include "sha1.h"
|
|
krh@0
|
12 |
|
|
krh@6
|
13 |
struct array {
|
|
krh@6
|
14 |
void *data;
|
|
krh@6
|
15 |
int size, alloc;
|
|
krh@6
|
16 |
};
|
|
krh@6
|
17 |
|
|
krh@6
|
18 |
static void *
|
|
krh@6
|
19 |
array_add(struct array *array, int size)
|
|
krh@6
|
20 |
{
|
|
krh@6
|
21 |
int alloc;
|
|
krh@6
|
22 |
void *data, *p;
|
|
krh@6
|
23 |
|
|
krh@6
|
24 |
if (array->alloc > 0)
|
|
krh@6
|
25 |
alloc = array->alloc;
|
|
krh@6
|
26 |
else
|
|
krh@6
|
27 |
alloc = 1024;
|
|
krh@6
|
28 |
|
|
krh@6
|
29 |
while (alloc < array->size + size)
|
|
krh@6
|
30 |
alloc *= 2;
|
|
krh@6
|
31 |
|
|
krh@6
|
32 |
if (array->alloc < alloc) {
|
|
krh@6
|
33 |
data = realloc(array->data, alloc);
|
|
krh@6
|
34 |
if (data == NULL)
|
|
krh@6
|
35 |
return 0;
|
|
krh@6
|
36 |
array->data = data;
|
|
krh@6
|
37 |
array->alloc = alloc;
|
|
krh@6
|
38 |
}
|
|
krh@6
|
39 |
|
|
krh@6
|
40 |
p = array->data + array->size;
|
|
krh@6
|
41 |
array->size += size;
|
|
krh@6
|
42 |
|
|
krh@6
|
43 |
return p;
|
|
krh@6
|
44 |
}
|
|
krh@6
|
45 |
|
|
krh@0
|
46 |
static int
|
|
krh@0
|
47 |
write_to_fd(int fd, void *p, size_t size)
|
|
krh@0
|
48 |
{
|
|
krh@0
|
49 |
int rest, len;
|
|
krh@0
|
50 |
|
|
krh@0
|
51 |
rest = size;
|
|
krh@0
|
52 |
while (rest > 0) {
|
|
krh@0
|
53 |
len = write(fd, p, rest);
|
|
krh@0
|
54 |
if (len < 0)
|
|
krh@0
|
55 |
return -1;
|
|
krh@0
|
56 |
rest -= len;
|
|
krh@0
|
57 |
}
|
|
krh@0
|
58 |
|
|
krh@0
|
59 |
return 0;
|
|
krh@0
|
60 |
}
|
|
krh@0
|
61 |
|
|
krh@0
|
62 |
static int
|
|
krh@0
|
63 |
write_to_file(const char *filename, void *p, size_t size)
|
|
krh@0
|
64 |
{
|
|
krh@0
|
65 |
int fd, err;
|
|
krh@0
|
66 |
|
|
krh@0
|
67 |
fd = open(filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);
|
|
krh@0
|
68 |
if (fd < 0)
|
|
krh@0
|
69 |
return -1;
|
|
krh@0
|
70 |
err = write_to_fd(fd, p, size);
|
|
krh@0
|
71 |
close(fd);
|
|
krh@0
|
72 |
|
|
krh@0
|
73 |
return err;
|
|
krh@0
|
74 |
}
|
|
krh@0
|
75 |
|
|
krh@0
|
76 |
static void *
|
|
krh@0
|
77 |
zalloc(size_t size)
|
|
krh@0
|
78 |
{
|
|
krh@0
|
79 |
void *p;
|
|
krh@0
|
80 |
|
|
krh@0
|
81 |
p = malloc(size);
|
|
krh@0
|
82 |
memset(p, 0, size);
|
|
krh@0
|
83 |
|
|
krh@0
|
84 |
return p;
|
|
krh@0
|
85 |
}
|
|
krh@0
|
86 |
|
|
krh@4
|
87 |
struct razor_set_header {
|
|
krh@4
|
88 |
unsigned int magic;
|
|
krh@4
|
89 |
unsigned int version;
|
|
krh@4
|
90 |
struct { unsigned int type, offset; } sections[0];
|
|
krh@4
|
91 |
};
|
|
krh@4
|
92 |
|
|
krh@4
|
93 |
#define RAZOR_MAGIC 0x7a7a7a7a
|
|
krh@4
|
94 |
#define RAZOR_VERSION 1
|
|
krh@4
|
95 |
#define RAZOR_BUCKETS 1
|
|
krh@4
|
96 |
#define RAZOR_STRINGS 2
|
|
krh@4
|
97 |
#define RAZOR_PACKAGES 3
|
|
krh@7
|
98 |
#define RAZOR_PROVIDES 4
|
|
krh@4
|
99 |
|
|
krh@4
|
100 |
struct razor_package {
|
|
krh@4
|
101 |
unsigned long name;
|
|
krh@4
|
102 |
unsigned long version;
|
|
krh@4
|
103 |
};
|
|
krh@4
|
104 |
|
|
krh@7
|
105 |
struct razor_provides {
|
|
krh@7
|
106 |
unsigned long name;
|
|
krh@7
|
107 |
unsigned long version;
|
|
krh@7
|
108 |
};
|
|
krh@7
|
109 |
|
|
krh@4
|
110 |
struct razor_set {
|
|
krh@6
|
111 |
struct array buckets;
|
|
krh@6
|
112 |
struct array string_pool;
|
|
krh@7
|
113 |
struct array packages;
|
|
krh@7
|
114 |
struct array provides;
|
|
krh@4
|
115 |
struct razor_set_header *header;
|
|
krh@4
|
116 |
};
|
|
krh@4
|
117 |
|
|
krh@4
|
118 |
struct razor_set *
|
|
krh@4
|
119 |
razor_set_create(void)
|
|
krh@0
|
120 |
{
|
|
krh@4
|
121 |
struct razor_set *set;
|
|
krh@6
|
122 |
char *p;
|
|
krh@0
|
123 |
|
|
krh@6
|
124 |
set = zalloc(sizeof(struct razor_set));
|
|
krh@6
|
125 |
p = array_add(&set->string_pool, 1);
|
|
krh@6
|
126 |
*p = '\0';
|
|
krh@3
|
127 |
|
|
krh@4
|
128 |
return set;
|
|
krh@0
|
129 |
}
|
|
krh@0
|
130 |
|
|
krh@4
|
131 |
struct razor_set *
|
|
krh@4
|
132 |
razor_set_open(const char *filename)
|
|
krh@0
|
133 |
{
|
|
krh@4
|
134 |
struct razor_set *set;
|
|
krh@0
|
135 |
struct stat stat;
|
|
krh@0
|
136 |
unsigned int size, offset;
|
|
krh@0
|
137 |
int fd, i;
|
|
krh@0
|
138 |
|
|
krh@4
|
139 |
set = zalloc(sizeof *set);
|
|
krh@0
|
140 |
fd = open(filename, O_RDONLY);
|
|
krh@0
|
141 |
if (fstat(fd, &stat) < 0)
|
|
krh@0
|
142 |
return NULL;
|
|
krh@4
|
143 |
set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
|
|
krh@4
|
144 |
if (set->header == MAP_FAILED) {
|
|
krh@4
|
145 |
free(set);
|
|
krh@0
|
146 |
return NULL;
|
|
krh@0
|
147 |
}
|
|
krh@0
|
148 |
|
|
krh@4
|
149 |
for (i = 0; i < set->header->sections[i].type; i++) {
|
|
krh@4
|
150 |
offset = set->header->sections[i].offset;
|
|
krh@4
|
151 |
size = set->header->sections[i + 1].offset - offset;
|
|
krh@0
|
152 |
|
|
krh@4
|
153 |
switch (set->header->sections[i].type) {
|
|
krh@4
|
154 |
case RAZOR_BUCKETS:
|
|
krh@6
|
155 |
set->buckets.data = (void *) set->header + offset;
|
|
krh@6
|
156 |
set->buckets.size = size;
|
|
krh@6
|
157 |
set->buckets.alloc = size;
|
|
krh@0
|
158 |
break;
|
|
krh@4
|
159 |
case RAZOR_STRINGS:
|
|
krh@6
|
160 |
set->string_pool.data = (void *) set->header + offset;
|
|
krh@6
|
161 |
set->string_pool.size = size;
|
|
krh@6
|
162 |
set->string_pool.alloc = size;
|
|
krh@0
|
163 |
break;
|
|
krh@4
|
164 |
case RAZOR_PACKAGES:
|
|
krh@6
|
165 |
set->packages.data = (void *) set->header + offset;
|
|
krh@6
|
166 |
set->packages.size = size;
|
|
krh@6
|
167 |
set->packages.size = size;
|
|
krh@3
|
168 |
break;
|
|
krh@7
|
169 |
case RAZOR_PROVIDES:
|
|
krh@7
|
170 |
set->provides.data = (void *) set->header + offset;
|
|
krh@7
|
171 |
set->provides.size = size;
|
|
krh@7
|
172 |
set->provides.size = size;
|
|
krh@7
|
173 |
break;
|
|
krh@0
|
174 |
}
|
|
krh@0
|
175 |
}
|
|
krh@0
|
176 |
close(fd);
|
|
krh@0
|
177 |
|
|
krh@4
|
178 |
return set;
|
|
krh@0
|
179 |
}
|
|
krh@0
|
180 |
|
|
krh@0
|
181 |
void
|
|
krh@4
|
182 |
razor_set_destroy(struct razor_set *set)
|
|
krh@0
|
183 |
{
|
|
krh@0
|
184 |
unsigned int size;
|
|
krh@0
|
185 |
int i;
|
|
krh@0
|
186 |
|
|
krh@4
|
187 |
if (set->header) {
|
|
krh@4
|
188 |
for (i = 0; set->header->sections[i].type; i++)
|
|
krh@0
|
189 |
;
|
|
krh@4
|
190 |
size = set->header->sections[i].type;
|
|
krh@4
|
191 |
munmap(set->header, size);
|
|
krh@0
|
192 |
} else {
|
|
krh@6
|
193 |
free(set->buckets.data);
|
|
krh@6
|
194 |
free(set->string_pool.data);
|
|
krh@6
|
195 |
free(set->packages.data);
|
|
krh@0
|
196 |
}
|
|
krh@0
|
197 |
|
|
krh@4
|
198 |
free(set);
|
|
krh@0
|
199 |
}
|
|
krh@0
|
200 |
|
|
krh@0
|
201 |
static int
|
|
krh@4
|
202 |
razor_set_write(struct razor_set *set, const char *filename)
|
|
krh@0
|
203 |
{
|
|
krh@0
|
204 |
char data[4096];
|
|
krh@4
|
205 |
struct razor_set_header *header = (struct razor_set_header *) data;
|
|
krh@7
|
206 |
int fd, pool_size, packages_size, provides_size;
|
|
krh@3
|
207 |
|
|
krh@3
|
208 |
/* Align these to pages sizes */
|
|
krh@6
|
209 |
pool_size = (set->string_pool.size + 4095) & ~4095;
|
|
krh@6
|
210 |
packages_size = (set->packages.size + 4095) & ~4095;
|
|
krh@7
|
211 |
provides_size = (set->provides.size + 4095) & ~4095;
|
|
krh@0
|
212 |
|
|
krh@0
|
213 |
memset(data, 0, sizeof data);
|
|
krh@4
|
214 |
header->magic = RAZOR_MAGIC;
|
|
krh@4
|
215 |
header->version = RAZOR_VERSION;
|
|
krh@0
|
216 |
|
|
krh@4
|
217 |
header->sections[0].type = RAZOR_BUCKETS;
|
|
krh@0
|
218 |
header->sections[0].offset = sizeof data;
|
|
krh@0
|
219 |
|
|
krh@4
|
220 |
header->sections[1].type = RAZOR_STRINGS;
|
|
krh@6
|
221 |
header->sections[1].offset =
|
|
krh@6
|
222 |
header->sections[0].offset + set->buckets.alloc;
|
|
krh@0
|
223 |
|
|
krh@4
|
224 |
header->sections[2].type = RAZOR_PACKAGES;
|
|
krh@6
|
225 |
header->sections[2].offset =
|
|
krh@6
|
226 |
header->sections[1].offset + pool_size;
|
|
krh@3
|
227 |
|
|
krh@7
|
228 |
header->sections[3].type = RAZOR_PROVIDES;
|
|
krh@6
|
229 |
header->sections[3].offset =
|
|
krh@6
|
230 |
header->sections[2].offset + packages_size;
|
|
krh@0
|
231 |
|
|
krh@7
|
232 |
header->sections[4].type = 0;
|
|
krh@7
|
233 |
header->sections[4].offset =
|
|
krh@7
|
234 |
header->sections[3].offset + provides_size;
|
|
krh@7
|
235 |
|
|
krh@0
|
236 |
fd = open(filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);
|
|
krh@0
|
237 |
if (fd < 0)
|
|
krh@0
|
238 |
return -1;
|
|
krh@0
|
239 |
|
|
krh@0
|
240 |
write_to_fd(fd, data, sizeof data);
|
|
krh@6
|
241 |
write_to_fd(fd, set->buckets.data, set->buckets.alloc);
|
|
krh@6
|
242 |
write_to_fd(fd, set->string_pool.data, pool_size);
|
|
krh@6
|
243 |
write_to_fd(fd, set->packages.data, packages_size);
|
|
krh@7
|
244 |
write_to_fd(fd, set->provides.data, provides_size);
|
|
krh@0
|
245 |
|
|
krh@0
|
246 |
return 0;
|
|
krh@0
|
247 |
}
|
|
krh@0
|
248 |
|
|
krh@0
|
249 |
static unsigned int
|
|
krh@0
|
250 |
hash_string(const char *key)
|
|
krh@0
|
251 |
{
|
|
krh@0
|
252 |
const char *p;
|
|
krh@0
|
253 |
unsigned int hash = 0;
|
|
krh@0
|
254 |
|
|
krh@0
|
255 |
for (p = key; *p; p++)
|
|
krh@0
|
256 |
hash = (hash << 2) ^ *p;
|
|
krh@0
|
257 |
|
|
krh@0
|
258 |
return hash;
|
|
krh@0
|
259 |
}
|
|
krh@0
|
260 |
|
|
krh@0
|
261 |
unsigned long
|
|
krh@4
|
262 |
razor_set_lookup(struct razor_set *set, const char *key)
|
|
krh@0
|
263 |
{
|
|
krh@6
|
264 |
unsigned int mask, start, i;
|
|
krh@6
|
265 |
unsigned long *b;
|
|
krh@6
|
266 |
char *pool;
|
|
krh@0
|
267 |
|
|
krh@6
|
268 |
pool = set->string_pool.data;
|
|
krh@6
|
269 |
mask = set->buckets.alloc - 1;
|
|
krh@6
|
270 |
start = hash_string(key) * sizeof(unsigned long);
|
|
krh@0
|
271 |
|
|
krh@6
|
272 |
for (i = 0; i < set->buckets.alloc; i += sizeof *b) {
|
|
krh@6
|
273 |
b = set->buckets.data + ((start + i) & mask);
|
|
krh@6
|
274 |
|
|
krh@6
|
275 |
if (*b == 0)
|
|
krh@0
|
276 |
return 0;
|
|
krh@0
|
277 |
|
|
krh@6
|
278 |
if (strcmp(key, &pool[*b]) == 0)
|
|
krh@6
|
279 |
return *b;
|
|
krh@6
|
280 |
}
|
|
krh@0
|
281 |
|
|
krh@0
|
282 |
return 0;
|
|
krh@0
|
283 |
}
|
|
krh@0
|
284 |
|
|
krh@0
|
285 |
static unsigned long
|
|
krh@4
|
286 |
add_to_string_pool(struct razor_set *set, const char *key)
|
|
krh@0
|
287 |
{
|
|
krh@6
|
288 |
int len;
|
|
krh@6
|
289 |
char *p;
|
|
krh@0
|
290 |
|
|
krh@0
|
291 |
len = strlen(key) + 1;
|
|
krh@6
|
292 |
p = array_add(&set->string_pool, len);
|
|
krh@6
|
293 |
memcpy(p, key, len);
|
|
krh@0
|
294 |
|
|
krh@6
|
295 |
return p - (char *) set->string_pool.data;
|
|
krh@0
|
296 |
}
|
|
krh@0
|
297 |
|
|
krh@0
|
298 |
static void
|
|
krh@4
|
299 |
do_insert(struct razor_set *set, unsigned long value)
|
|
krh@0
|
300 |
{
|
|
krh@6
|
301 |
unsigned int mask, start, i;
|
|
krh@6
|
302 |
unsigned long *b;
|
|
krh@0
|
303 |
const char *key;
|
|
krh@0
|
304 |
|
|
krh@6
|
305 |
key = (char *) set->string_pool.data + value;
|
|
krh@6
|
306 |
mask = set->buckets.alloc - 1;
|
|
krh@6
|
307 |
start = hash_string(key) * sizeof(unsigned long);
|
|
krh@6
|
308 |
|
|
krh@6
|
309 |
for (i = 0; i < set->buckets.alloc; i += sizeof *b) {
|
|
krh@6
|
310 |
b = set->buckets.data + ((start + i) & mask);
|
|
krh@6
|
311 |
if (*b == 0) {
|
|
krh@6
|
312 |
*b = value;
|
|
krh@0
|
313 |
break;
|
|
krh@0
|
314 |
}
|
|
krh@6
|
315 |
}
|
|
krh@0
|
316 |
}
|
|
krh@0
|
317 |
|
|
krh@0
|
318 |
unsigned long
|
|
krh@4
|
319 |
razor_set_insert(struct razor_set *set, const char *key)
|
|
krh@0
|
320 |
{
|
|
krh@6
|
321 |
unsigned long value, *buckets, *b, *end;
|
|
krh@6
|
322 |
int alloc;
|
|
krh@0
|
323 |
|
|
krh@6
|
324 |
alloc = set->buckets.alloc;
|
|
krh@6
|
325 |
array_add(&set->buckets, 4 * sizeof *buckets);
|
|
krh@6
|
326 |
if (alloc != set->buckets.alloc) {
|
|
krh@6
|
327 |
end = set->buckets.data + alloc;
|
|
krh@6
|
328 |
memset(end, 0, set->buckets.alloc - alloc);
|
|
krh@6
|
329 |
for (b = set->buckets.data; b < end; b++) {
|
|
krh@6
|
330 |
value = *b;
|
|
krh@6
|
331 |
if (value != 0) {
|
|
krh@6
|
332 |
*b = 0;
|
|
krh@4
|
333 |
do_insert(set, value);
|
|
krh@6
|
334 |
}
|
|
krh@0
|
335 |
}
|
|
krh@0
|
336 |
}
|
|
krh@0
|
337 |
|
|
krh@4
|
338 |
value = add_to_string_pool(set, key);
|
|
krh@4
|
339 |
do_insert (set, value);
|
|
krh@0
|
340 |
|
|
krh@0
|
341 |
return value;
|
|
krh@0
|
342 |
}
|
|
krh@0
|
343 |
|
|
krh@3
|
344 |
static unsigned long
|
|
krh@4
|
345 |
razor_set_add_package(struct razor_set *set,
|
|
krh@3
|
346 |
unsigned long name, unsigned long version)
|
|
krh@3
|
347 |
{
|
|
krh@6
|
348 |
struct razor_package *p;
|
|
krh@3
|
349 |
|
|
krh@6
|
350 |
p = array_add(&set->packages, sizeof *p);
|
|
krh@3
|
351 |
|
|
krh@6
|
352 |
p->name = name;
|
|
krh@6
|
353 |
p->version = version;
|
|
krh@3
|
354 |
|
|
krh@6
|
355 |
return p - (struct razor_package *) set->packages.data;
|
|
krh@0
|
356 |
}
|
|
krh@0
|
357 |
|
|
krh@7
|
358 |
static unsigned long
|
|
krh@7
|
359 |
razor_set_add_provides(struct razor_set *set,
|
|
krh@7
|
360 |
unsigned long name, unsigned long version)
|
|
krh@7
|
361 |
{
|
|
krh@7
|
362 |
struct razor_provides *p;
|
|
krh@7
|
363 |
|
|
krh@7
|
364 |
p = array_add(&set->provides, sizeof *p);
|
|
krh@7
|
365 |
|
|
krh@7
|
366 |
p->name = name;
|
|
krh@7
|
367 |
p->version = version;
|
|
krh@7
|
368 |
|
|
krh@7
|
369 |
return p - (struct razor_provides *) set->packages.data;
|
|
krh@7
|
370 |
}
|
|
krh@7
|
371 |
|
|
krh@0
|
372 |
unsigned long
|
|
krh@4
|
373 |
razor_set_tokenize(struct razor_set *set, const char *string)
|
|
krh@0
|
374 |
{
|
|
krh@0
|
375 |
unsigned long token;
|
|
krh@0
|
376 |
|
|
krh@4
|
377 |
token = razor_set_lookup(set, string);
|
|
krh@0
|
378 |
if (token != 0)
|
|
krh@0
|
379 |
return token;
|
|
krh@0
|
380 |
|
|
krh@4
|
381 |
return razor_set_insert(set, string);
|
|
krh@0
|
382 |
}
|
|
krh@0
|
383 |
|
|
krh@4
|
384 |
static struct razor_set *qsort_set;
|
|
krh@3
|
385 |
|
|
krh@3
|
386 |
static int
|
|
krh@3
|
387 |
compare_packages(const void *p1, const void *p2)
|
|
krh@3
|
388 |
{
|
|
krh@4
|
389 |
const struct razor_package *pkg1 = p1, *pkg2 = p2;
|
|
krh@6
|
390 |
char *pool = qsort_set->string_pool.data;
|
|
krh@3
|
391 |
|
|
krh@6
|
392 |
return strcmp(&pool[pkg1->name], &pool[pkg2->name]);
|
|
krh@3
|
393 |
}
|
|
krh@3
|
394 |
|
|
krh@7
|
395 |
static int
|
|
krh@7
|
396 |
compare_provides(const void *p1, const void *p2)
|
|
krh@7
|
397 |
{
|
|
krh@7
|
398 |
const struct razor_provides *prv1 = p1, *prv2 = p2;
|
|
krh@7
|
399 |
char *pool = qsort_set->string_pool.data;
|
|
krh@7
|
400 |
|
|
krh@7
|
401 |
return strcmp(&pool[prv1->name], &pool[prv2->name]);
|
|
krh@7
|
402 |
}
|
|
krh@7
|
403 |
|
|
krh@3
|
404 |
static void
|
|
krh@4
|
405 |
razor_set_sort(struct razor_set *set)
|
|
krh@3
|
406 |
{
|
|
krh@4
|
407 |
qsort_set = set;
|
|
krh@6
|
408 |
qsort(set->packages.data,
|
|
krh@6
|
409 |
set->packages.size / sizeof(struct razor_package),
|
|
krh@6
|
410 |
sizeof(struct razor_package), compare_packages);
|
|
krh@7
|
411 |
qsort(set->provides.data,
|
|
krh@7
|
412 |
set->provides.size / sizeof(struct razor_provides),
|
|
krh@7
|
413 |
sizeof(struct razor_provides), compare_provides);
|
|
krh@3
|
414 |
}
|
|
krh@3
|
415 |
|
|
krh@0
|
416 |
struct parsing_context {
|
|
krh@4
|
417 |
struct razor_set *set;
|
|
krh@4
|
418 |
int pkg_id;
|
|
krh@0
|
419 |
};
|
|
krh@0
|
420 |
|
|
krh@0
|
421 |
static void
|
|
krh@3
|
422 |
parse_package(struct parsing_context *ctx, const char **atts)
|
|
krh@3
|
423 |
{
|
|
krh@7
|
424 |
unsigned long name = 0, version = 0;
|
|
krh@3
|
425 |
int i;
|
|
krh@3
|
426 |
|
|
krh@3
|
427 |
for (i = 0; atts[i]; i += 2) {
|
|
krh@3
|
428 |
if (strcmp(atts[i], "name") == 0)
|
|
krh@4
|
429 |
name = razor_set_tokenize(ctx->set, atts[i + 1]);
|
|
krh@3
|
430 |
else if (strcmp(atts[i], "version") == 0)
|
|
krh@4
|
431 |
version = razor_set_tokenize(ctx->set, atts[i + 1]);
|
|
krh@3
|
432 |
}
|
|
krh@3
|
433 |
|
|
krh@3
|
434 |
if (name == 0 || version == 0) {
|
|
krh@3
|
435 |
fprintf(stderr, "invalid package tag, "
|
|
krh@3
|
436 |
"missing name or version attributes\n");
|
|
krh@3
|
437 |
return;
|
|
krh@3
|
438 |
}
|
|
krh@3
|
439 |
|
|
krh@4
|
440 |
ctx->pkg_id = razor_set_add_package(ctx->set, name, version);
|
|
krh@4
|
441 |
|
|
krh@4
|
442 |
return;
|
|
krh@3
|
443 |
}
|
|
krh@3
|
444 |
|
|
krh@3
|
445 |
static void
|
|
krh@7
|
446 |
parse_provides(struct parsing_context *ctx, const char **atts)
|
|
krh@7
|
447 |
{
|
|
krh@7
|
448 |
unsigned long name = 0, version = 0;
|
|
krh@7
|
449 |
int i;
|
|
krh@7
|
450 |
|
|
krh@7
|
451 |
for (i = 0; atts[i]; i += 2) {
|
|
krh@7
|
452 |
if (strcmp(atts[i], "name") == 0)
|
|
krh@7
|
453 |
name = razor_set_tokenize(ctx->set, atts[i + 1]);
|
|
krh@7
|
454 |
}
|
|
krh@7
|
455 |
|
|
krh@7
|
456 |
if (name == 0) {
|
|
krh@7
|
457 |
fprintf(stderr, "invalid provides tag, "
|
|
krh@7
|
458 |
"missing name attribute\n");
|
|
krh@7
|
459 |
return;
|
|
krh@7
|
460 |
}
|
|
krh@7
|
461 |
|
|
krh@7
|
462 |
ctx->pkg_id = razor_set_add_provides(ctx->set, name, version);
|
|
krh@7
|
463 |
}
|
|
krh@7
|
464 |
|
|
krh@7
|
465 |
static void
|
|
krh@0
|
466 |
start_element(void *data, const char *name, const char **atts)
|
|
krh@0
|
467 |
{
|
|
krh@0
|
468 |
struct parsing_context *ctx = data;
|
|
krh@0
|
469 |
int i;
|
|
krh@0
|
470 |
|
|
krh@3
|
471 |
if (strcmp(name, "package") == 0)
|
|
krh@3
|
472 |
parse_package(ctx, atts);
|
|
krh@7
|
473 |
else if (strcmp(name, "provides") == 0)
|
|
krh@7
|
474 |
parse_provides(ctx, atts);
|
|
krh@3
|
475 |
|
|
krh@0
|
476 |
for (i = 0; atts[i]; i += 2)
|
|
krh@4
|
477 |
razor_set_tokenize(ctx->set, atts[i + 1]);
|
|
krh@0
|
478 |
}
|
|
krh@0
|
479 |
|
|
krh@0
|
480 |
static void
|
|
krh@0
|
481 |
end_element (void *data, const char *name)
|
|
krh@0
|
482 |
{
|
|
krh@4
|
483 |
struct parsing_context *ctx = data;
|
|
krh@4
|
484 |
|
|
krh@4
|
485 |
if (strcmp(name, "package") == 0)
|
|
krh@4
|
486 |
ctx->pkg_id = 0;
|
|
krh@0
|
487 |
}
|
|
krh@0
|
488 |
|
|
krh@0
|
489 |
static char *
|
|
krh@0
|
490 |
sha1_to_hex(const unsigned char *sha1)
|
|
krh@0
|
491 |
{
|
|
krh@0
|
492 |
static int bufno;
|
|
krh@0
|
493 |
static char hexbuffer[4][50];
|
|
krh@0
|
494 |
static const char hex[] = "0123456789abcdef";
|
|
krh@0
|
495 |
char *buffer = hexbuffer[3 & ++bufno], *buf = buffer;
|
|
krh@0
|
496 |
int i;
|
|
krh@0
|
497 |
|
|
krh@0
|
498 |
for (i = 0; i < 20; i++) {
|
|
krh@0
|
499 |
unsigned int val = *sha1++;
|
|
krh@0
|
500 |
*buf++ = hex[val >> 4];
|
|
krh@0
|
501 |
*buf++ = hex[val & 0xf];
|
|
krh@0
|
502 |
}
|
|
krh@0
|
503 |
*buf = '\0';
|
|
krh@0
|
504 |
|
|
krh@0
|
505 |
return buffer;
|
|
krh@0
|
506 |
}
|
|
krh@0
|
507 |
|
|
krh@0
|
508 |
static int
|
|
krh@4
|
509 |
razor_set_import(struct razor_set *set, const char *filename)
|
|
krh@0
|
510 |
{
|
|
krh@0
|
511 |
SHA_CTX sha1;
|
|
krh@0
|
512 |
XML_Parser parser;
|
|
krh@4
|
513 |
struct parsing_context ctx;
|
|
krh@0
|
514 |
int fd;
|
|
krh@0
|
515 |
void *p;
|
|
krh@0
|
516 |
struct stat stat;
|
|
krh@0
|
517 |
char buf[128];
|
|
krh@0
|
518 |
unsigned char hash[20];
|
|
krh@0
|
519 |
|
|
krh@0
|
520 |
fd = open(filename, O_RDONLY);
|
|
krh@0
|
521 |
if (fstat(fd, &stat) < 0)
|
|
krh@0
|
522 |
return -1;
|
|
krh@0
|
523 |
p = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
|
|
krh@0
|
524 |
if (p == MAP_FAILED)
|
|
krh@0
|
525 |
return -1;
|
|
krh@0
|
526 |
|
|
krh@0
|
527 |
parser = XML_ParserCreate(NULL);
|
|
krh@4
|
528 |
ctx.set = set;
|
|
krh@4
|
529 |
XML_SetUserData(parser, &ctx);
|
|
krh@0
|
530 |
XML_SetElementHandler(parser, start_element, end_element);
|
|
krh@0
|
531 |
if (XML_Parse(parser, p, stat.st_size, 1) == XML_STATUS_ERROR) {
|
|
krh@0
|
532 |
fprintf(stderr,
|
|
krh@0
|
533 |
"%s at line %d, %s\n",
|
|
krh@0
|
534 |
XML_ErrorString(XML_GetErrorCode(parser)),
|
|
krh@0
|
535 |
XML_GetCurrentLineNumber(parser),
|
|
krh@0
|
536 |
filename);
|
|
krh@0
|
537 |
return 1;
|
|
krh@0
|
538 |
}
|
|
krh@0
|
539 |
|
|
krh@0
|
540 |
XML_ParserFree(parser);
|
|
krh@0
|
541 |
|
|
krh@0
|
542 |
SHA1_Init(&sha1);
|
|
krh@0
|
543 |
SHA1_Update(&sha1, p, stat.st_size);
|
|
krh@0
|
544 |
SHA1_Final(hash, &sha1);
|
|
krh@0
|
545 |
|
|
krh@0
|
546 |
close(fd);
|
|
krh@0
|
547 |
|
|
krh@0
|
548 |
snprintf(buf, sizeof buf, "set/%s", sha1_to_hex(hash));
|
|
krh@0
|
549 |
if (write_to_file(buf, p, stat.st_size) < 0)
|
|
krh@0
|
550 |
return -1;
|
|
krh@0
|
551 |
munmap(p, stat.st_size);
|
|
krh@0
|
552 |
|
|
krh@0
|
553 |
return 0;
|
|
krh@0
|
554 |
}
|
|
krh@0
|
555 |
|
|
krh@0
|
556 |
void
|
|
krh@4
|
557 |
razor_set_list(struct razor_set *set)
|
|
krh@3
|
558 |
{
|
|
krh@6
|
559 |
struct razor_package *p, *end;
|
|
krh@6
|
560 |
char *pool;
|
|
krh@3
|
561 |
|
|
krh@6
|
562 |
pool = set->string_pool.data;
|
|
krh@6
|
563 |
end = set->packages.data + set->packages.size;
|
|
krh@6
|
564 |
for (p = set->packages.data; p < end && p->name; p++)
|
|
krh@6
|
565 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@3
|
566 |
}
|
|
krh@3
|
567 |
|
|
krh@3
|
568 |
void
|
|
krh@7
|
569 |
razor_set_list_provides(struct razor_set *set)
|
|
krh@7
|
570 |
{
|
|
krh@7
|
571 |
struct razor_provides *p, *end;
|
|
krh@7
|
572 |
char *pool;
|
|
krh@7
|
573 |
|
|
krh@7
|
574 |
pool = set->string_pool.data;
|
|
krh@7
|
575 |
end = set->provides.data + set->provides.size;
|
|
krh@7
|
576 |
for (p = set->provides.data; p < end && p->name; p++)
|
|
krh@7
|
577 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@7
|
578 |
}
|
|
krh@7
|
579 |
|
|
krh@7
|
580 |
void
|
|
krh@4
|
581 |
razor_set_info(struct razor_set *set)
|
|
krh@3
|
582 |
{
|
|
krh@3
|
583 |
unsigned int offset, size;
|
|
krh@3
|
584 |
int i;
|
|
krh@3
|
585 |
|
|
krh@4
|
586 |
for (i = 0; i < set->header->sections[i].type; i++) {
|
|
krh@4
|
587 |
offset = set->header->sections[i].offset;
|
|
krh@4
|
588 |
size = set->header->sections[i + 1].offset - offset;
|
|
krh@3
|
589 |
|
|
krh@4
|
590 |
switch (set->header->sections[i].type) {
|
|
krh@4
|
591 |
case RAZOR_BUCKETS:
|
|
krh@3
|
592 |
printf("bucket section:\t\t%dkb\n", size / 1024);
|
|
krh@3
|
593 |
break;
|
|
krh@4
|
594 |
case RAZOR_STRINGS:
|
|
krh@3
|
595 |
printf("string pool:\t\t%dkb\n", size / 1024);
|
|
krh@3
|
596 |
break;
|
|
krh@4
|
597 |
case RAZOR_PACKAGES:
|
|
krh@3
|
598 |
printf("package section:\t%dkb\n", size / 1024);
|
|
krh@3
|
599 |
break;
|
|
krh@7
|
600 |
case RAZOR_PROVIDES:
|
|
krh@7
|
601 |
printf("provides section:\t%dkb\n", size / 1024);
|
|
krh@7
|
602 |
break;
|
|
krh@3
|
603 |
}
|
|
krh@3
|
604 |
}
|
|
krh@0
|
605 |
}
|
|
krh@0
|
606 |
|
|
krh@0
|
607 |
static int
|
|
krh@0
|
608 |
usage(void)
|
|
krh@0
|
609 |
{
|
|
krh@7
|
610 |
printf("usage: razor [ import FILES | lookup <key> | "
|
|
krh@7
|
611 |
"list | list-provides | info ]\n");
|
|
krh@0
|
612 |
exit(1);
|
|
krh@0
|
613 |
}
|
|
krh@0
|
614 |
|
|
krh@0
|
615 |
static const char repo_filename[] = "system.repo";
|
|
krh@0
|
616 |
|
|
krh@0
|
617 |
int
|
|
krh@0
|
618 |
main(int argc, char *argv[])
|
|
krh@0
|
619 |
{
|
|
krh@0
|
620 |
int i;
|
|
krh@4
|
621 |
struct razor_set *set;
|
|
krh@0
|
622 |
struct stat statbuf;
|
|
krh@0
|
623 |
|
|
krh@3
|
624 |
if (argc < 2) {
|
|
krh@0
|
625 |
usage();
|
|
krh@0
|
626 |
} else if (strcmp(argv[1], "import") == 0) {
|
|
krh@0
|
627 |
if (stat("set", &statbuf) && mkdir("set", 0777)) {
|
|
krh@0
|
628 |
fprintf(stderr, "could not create directory 'set'\n");
|
|
krh@0
|
629 |
exit(-1);
|
|
krh@0
|
630 |
}
|
|
krh@0
|
631 |
|
|
krh@4
|
632 |
set = razor_set_create();
|
|
krh@0
|
633 |
|
|
krh@0
|
634 |
for (i = 2; i < argc; i++) {
|
|
krh@4
|
635 |
if (razor_set_import(set, argv[i]) < 0) {
|
|
krh@0
|
636 |
fprintf(stderr, "failed to import %s\n",
|
|
krh@0
|
637 |
argv[i]);
|
|
krh@0
|
638 |
exit(-1);
|
|
krh@0
|
639 |
}
|
|
krh@0
|
640 |
}
|
|
krh@0
|
641 |
|
|
krh@4
|
642 |
razor_set_sort(set);
|
|
krh@3
|
643 |
|
|
krh@6
|
644 |
/* FIXME: We add a sentinel package here, but we
|
|
krh@6
|
645 |
* should probably just have a size field in the
|
|
krh@6
|
646 |
* header section. */
|
|
krh@6
|
647 |
razor_set_add_package(set, 0, 0);
|
|
krh@7
|
648 |
razor_set_add_provides(set, 0, 0);
|
|
krh@6
|
649 |
|
|
krh@6
|
650 |
printf("bucket allocation: %d\n", set->buckets.alloc);
|
|
krh@6
|
651 |
printf("pool size: %d\n", set->string_pool.size);
|
|
krh@6
|
652 |
printf("pool allocation: %d\n", set->string_pool.alloc);
|
|
krh@7
|
653 |
printf("packages: %d\n",
|
|
krh@7
|
654 |
set->packages.size / sizeof(struct razor_package));
|
|
krh@7
|
655 |
printf("provides: %d\n",
|
|
krh@7
|
656 |
set->provides.size / sizeof(struct razor_provides));
|
|
krh@0
|
657 |
|
|
krh@4
|
658 |
razor_set_write(set, repo_filename);
|
|
krh@0
|
659 |
|
|
krh@4
|
660 |
razor_set_destroy(set);
|
|
krh@0
|
661 |
} else if (strcmp(argv[1], "lookup") == 0) {
|
|
krh@4
|
662 |
set = razor_set_open(repo_filename);
|
|
krh@0
|
663 |
printf("%s is %lu\n", argv[2],
|
|
krh@4
|
664 |
razor_set_lookup(set, argv[2]));
|
|
krh@4
|
665 |
razor_set_destroy(set);
|
|
krh@3
|
666 |
} else if (strcmp(argv[1], "list") == 0) {
|
|
krh@4
|
667 |
set = razor_set_open(repo_filename);
|
|
krh@4
|
668 |
razor_set_list(set);
|
|
krh@4
|
669 |
razor_set_destroy(set);
|
|
krh@7
|
670 |
} else if (strcmp(argv[1], "list-provides") == 0) {
|
|
krh@7
|
671 |
set = razor_set_open(repo_filename);
|
|
krh@7
|
672 |
razor_set_list_provides(set);
|
|
krh@7
|
673 |
razor_set_destroy(set);
|
|
krh@3
|
674 |
} else if (strcmp(argv[1], "info") == 0) {
|
|
krh@4
|
675 |
set = razor_set_open(repo_filename);
|
|
krh@4
|
676 |
razor_set_info(set);
|
|
krh@4
|
677 |
razor_set_destroy(set);
|
|
krh@0
|
678 |
} else {
|
|
krh@0
|
679 |
usage();
|
|
krh@0
|
680 |
}
|
|
krh@0
|
681 |
|
|
krh@0
|
682 |
return 0;
|
|
krh@0
|
683 |
}
|