|
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@10
|
27 |
alloc = 16;
|
|
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@8
|
95 |
|
|
krh@4
|
96 |
#define RAZOR_BUCKETS 1
|
|
krh@4
|
97 |
#define RAZOR_STRINGS 2
|
|
krh@4
|
98 |
#define RAZOR_PACKAGES 3
|
|
krh@8
|
99 |
#define RAZOR_REQUIRES 4
|
|
krh@8
|
100 |
#define RAZOR_PROVIDES 5
|
|
krh@10
|
101 |
#define RAZOR_PROPERTIES 6
|
|
krh@4
|
102 |
|
|
krh@4
|
103 |
struct razor_package {
|
|
krh@4
|
104 |
unsigned long name;
|
|
krh@4
|
105 |
unsigned long version;
|
|
krh@10
|
106 |
unsigned long requires;
|
|
krh@10
|
107 |
unsigned long provides;
|
|
krh@4
|
108 |
};
|
|
krh@4
|
109 |
|
|
krh@8
|
110 |
struct razor_property {
|
|
krh@7
|
111 |
unsigned long name;
|
|
krh@7
|
112 |
unsigned long version;
|
|
krh@9
|
113 |
unsigned long packages;
|
|
krh@7
|
114 |
};
|
|
krh@7
|
115 |
|
|
krh@4
|
116 |
struct razor_set {
|
|
krh@6
|
117 |
struct array buckets;
|
|
krh@6
|
118 |
struct array string_pool;
|
|
krh@10
|
119 |
struct array property_pool;
|
|
krh@7
|
120 |
struct array packages;
|
|
krh@8
|
121 |
struct array requires;
|
|
krh@7
|
122 |
struct array provides;
|
|
krh@4
|
123 |
struct razor_set_header *header;
|
|
krh@4
|
124 |
};
|
|
krh@4
|
125 |
|
|
krh@4
|
126 |
struct razor_set *
|
|
krh@4
|
127 |
razor_set_create(void)
|
|
krh@0
|
128 |
{
|
|
krh@4
|
129 |
struct razor_set *set;
|
|
krh@6
|
130 |
char *p;
|
|
krh@0
|
131 |
|
|
krh@6
|
132 |
set = zalloc(sizeof(struct razor_set));
|
|
krh@6
|
133 |
p = array_add(&set->string_pool, 1);
|
|
krh@6
|
134 |
*p = '\0';
|
|
krh@3
|
135 |
|
|
krh@4
|
136 |
return set;
|
|
krh@0
|
137 |
}
|
|
krh@0
|
138 |
|
|
krh@4
|
139 |
struct razor_set *
|
|
krh@4
|
140 |
razor_set_open(const char *filename)
|
|
krh@0
|
141 |
{
|
|
krh@4
|
142 |
struct razor_set *set;
|
|
krh@0
|
143 |
struct stat stat;
|
|
krh@0
|
144 |
unsigned int size, offset;
|
|
krh@0
|
145 |
int fd, i;
|
|
krh@0
|
146 |
|
|
krh@4
|
147 |
set = zalloc(sizeof *set);
|
|
krh@0
|
148 |
fd = open(filename, O_RDONLY);
|
|
krh@0
|
149 |
if (fstat(fd, &stat) < 0)
|
|
krh@0
|
150 |
return NULL;
|
|
krh@4
|
151 |
set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
|
|
krh@4
|
152 |
if (set->header == MAP_FAILED) {
|
|
krh@4
|
153 |
free(set);
|
|
krh@0
|
154 |
return NULL;
|
|
krh@0
|
155 |
}
|
|
krh@0
|
156 |
|
|
krh@4
|
157 |
for (i = 0; i < set->header->sections[i].type; i++) {
|
|
krh@4
|
158 |
offset = set->header->sections[i].offset;
|
|
krh@4
|
159 |
size = set->header->sections[i + 1].offset - offset;
|
|
krh@0
|
160 |
|
|
krh@4
|
161 |
switch (set->header->sections[i].type) {
|
|
krh@4
|
162 |
case RAZOR_BUCKETS:
|
|
krh@6
|
163 |
set->buckets.data = (void *) set->header + offset;
|
|
krh@6
|
164 |
set->buckets.size = size;
|
|
krh@6
|
165 |
set->buckets.alloc = size;
|
|
krh@0
|
166 |
break;
|
|
krh@4
|
167 |
case RAZOR_STRINGS:
|
|
krh@6
|
168 |
set->string_pool.data = (void *) set->header + offset;
|
|
krh@6
|
169 |
set->string_pool.size = size;
|
|
krh@6
|
170 |
set->string_pool.alloc = size;
|
|
krh@0
|
171 |
break;
|
|
krh@4
|
172 |
case RAZOR_PACKAGES:
|
|
krh@6
|
173 |
set->packages.data = (void *) set->header + offset;
|
|
krh@6
|
174 |
set->packages.size = size;
|
|
krh@6
|
175 |
set->packages.size = size;
|
|
krh@3
|
176 |
break;
|
|
krh@8
|
177 |
case RAZOR_REQUIRES:
|
|
krh@8
|
178 |
set->requires.data = (void *) set->header + offset;
|
|
krh@8
|
179 |
set->requires.size = size;
|
|
krh@8
|
180 |
set->requires.size = size;
|
|
krh@8
|
181 |
break;
|
|
krh@7
|
182 |
case RAZOR_PROVIDES:
|
|
krh@7
|
183 |
set->provides.data = (void *) set->header + offset;
|
|
krh@7
|
184 |
set->provides.size = size;
|
|
krh@7
|
185 |
set->provides.size = size;
|
|
krh@7
|
186 |
break;
|
|
krh@10
|
187 |
case RAZOR_PROPERTIES:
|
|
krh@10
|
188 |
set->property_pool.data = (void *) set->header + offset;
|
|
krh@10
|
189 |
set->property_pool.size = size;
|
|
krh@10
|
190 |
set->property_pool.size = size;
|
|
krh@10
|
191 |
break;
|
|
krh@0
|
192 |
}
|
|
krh@0
|
193 |
}
|
|
krh@0
|
194 |
close(fd);
|
|
krh@0
|
195 |
|
|
krh@4
|
196 |
return set;
|
|
krh@0
|
197 |
}
|
|
krh@0
|
198 |
|
|
krh@0
|
199 |
void
|
|
krh@4
|
200 |
razor_set_destroy(struct razor_set *set)
|
|
krh@0
|
201 |
{
|
|
krh@0
|
202 |
unsigned int size;
|
|
krh@0
|
203 |
int i;
|
|
krh@0
|
204 |
|
|
krh@4
|
205 |
if (set->header) {
|
|
krh@4
|
206 |
for (i = 0; set->header->sections[i].type; i++)
|
|
krh@0
|
207 |
;
|
|
krh@4
|
208 |
size = set->header->sections[i].type;
|
|
krh@4
|
209 |
munmap(set->header, size);
|
|
krh@0
|
210 |
} else {
|
|
krh@6
|
211 |
free(set->buckets.data);
|
|
krh@6
|
212 |
free(set->string_pool.data);
|
|
krh@6
|
213 |
free(set->packages.data);
|
|
krh@9
|
214 |
free(set->requires.data);
|
|
krh@9
|
215 |
free(set->provides.data);
|
|
krh@10
|
216 |
free(set->property_pool.data);
|
|
krh@0
|
217 |
}
|
|
krh@0
|
218 |
|
|
krh@4
|
219 |
free(set);
|
|
krh@0
|
220 |
}
|
|
krh@0
|
221 |
|
|
krh@0
|
222 |
static int
|
|
krh@4
|
223 |
razor_set_write(struct razor_set *set, const char *filename)
|
|
krh@0
|
224 |
{
|
|
krh@0
|
225 |
char data[4096];
|
|
krh@4
|
226 |
struct razor_set_header *header = (struct razor_set_header *) data;
|
|
krh@8
|
227 |
int fd, pool_size, packages_size, requires_size, provides_size;
|
|
krh@10
|
228 |
int properties_size;
|
|
krh@3
|
229 |
|
|
krh@3
|
230 |
/* Align these to pages sizes */
|
|
krh@6
|
231 |
pool_size = (set->string_pool.size + 4095) & ~4095;
|
|
krh@6
|
232 |
packages_size = (set->packages.size + 4095) & ~4095;
|
|
krh@8
|
233 |
requires_size = (set->requires.size + 4095) & ~4095;
|
|
krh@7
|
234 |
provides_size = (set->provides.size + 4095) & ~4095;
|
|
krh@10
|
235 |
properties_size = (set->property_pool.size + 4095) & ~4095;
|
|
krh@0
|
236 |
|
|
krh@0
|
237 |
memset(data, 0, sizeof data);
|
|
krh@4
|
238 |
header->magic = RAZOR_MAGIC;
|
|
krh@4
|
239 |
header->version = RAZOR_VERSION;
|
|
krh@0
|
240 |
|
|
krh@4
|
241 |
header->sections[0].type = RAZOR_BUCKETS;
|
|
krh@0
|
242 |
header->sections[0].offset = sizeof data;
|
|
krh@0
|
243 |
|
|
krh@4
|
244 |
header->sections[1].type = RAZOR_STRINGS;
|
|
krh@6
|
245 |
header->sections[1].offset =
|
|
krh@6
|
246 |
header->sections[0].offset + set->buckets.alloc;
|
|
krh@0
|
247 |
|
|
krh@4
|
248 |
header->sections[2].type = RAZOR_PACKAGES;
|
|
krh@6
|
249 |
header->sections[2].offset =
|
|
krh@6
|
250 |
header->sections[1].offset + pool_size;
|
|
krh@3
|
251 |
|
|
krh@8
|
252 |
header->sections[3].type = RAZOR_REQUIRES;
|
|
krh@6
|
253 |
header->sections[3].offset =
|
|
krh@6
|
254 |
header->sections[2].offset + packages_size;
|
|
krh@0
|
255 |
|
|
krh@8
|
256 |
header->sections[4].type = RAZOR_PROVIDES;
|
|
krh@7
|
257 |
header->sections[4].offset =
|
|
krh@8
|
258 |
header->sections[3].offset + requires_size;
|
|
krh@8
|
259 |
|
|
krh@10
|
260 |
header->sections[5].type = RAZOR_PROPERTIES;
|
|
krh@8
|
261 |
header->sections[5].offset =
|
|
krh@8
|
262 |
header->sections[4].offset + provides_size;
|
|
krh@7
|
263 |
|
|
krh@10
|
264 |
header->sections[6].type = 0;
|
|
krh@10
|
265 |
header->sections[6].offset =
|
|
krh@10
|
266 |
header->sections[5].offset + properties_size;
|
|
krh@10
|
267 |
|
|
krh@0
|
268 |
fd = open(filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);
|
|
krh@0
|
269 |
if (fd < 0)
|
|
krh@0
|
270 |
return -1;
|
|
krh@0
|
271 |
|
|
krh@0
|
272 |
write_to_fd(fd, data, sizeof data);
|
|
krh@6
|
273 |
write_to_fd(fd, set->buckets.data, set->buckets.alloc);
|
|
krh@6
|
274 |
write_to_fd(fd, set->string_pool.data, pool_size);
|
|
krh@6
|
275 |
write_to_fd(fd, set->packages.data, packages_size);
|
|
krh@8
|
276 |
write_to_fd(fd, set->requires.data, requires_size);
|
|
krh@7
|
277 |
write_to_fd(fd, set->provides.data, provides_size);
|
|
krh@10
|
278 |
write_to_fd(fd, set->property_pool.data, properties_size);
|
|
krh@0
|
279 |
|
|
krh@0
|
280 |
return 0;
|
|
krh@0
|
281 |
}
|
|
krh@0
|
282 |
|
|
krh@0
|
283 |
static unsigned int
|
|
krh@0
|
284 |
hash_string(const char *key)
|
|
krh@0
|
285 |
{
|
|
krh@0
|
286 |
const char *p;
|
|
krh@0
|
287 |
unsigned int hash = 0;
|
|
krh@0
|
288 |
|
|
krh@0
|
289 |
for (p = key; *p; p++)
|
|
krh@9
|
290 |
hash = (hash * 617) ^ *p;
|
|
krh@0
|
291 |
|
|
krh@0
|
292 |
return hash;
|
|
krh@0
|
293 |
}
|
|
krh@0
|
294 |
|
|
krh@0
|
295 |
unsigned long
|
|
krh@4
|
296 |
razor_set_lookup(struct razor_set *set, const char *key)
|
|
krh@0
|
297 |
{
|
|
krh@6
|
298 |
unsigned int mask, start, i;
|
|
krh@6
|
299 |
unsigned long *b;
|
|
krh@6
|
300 |
char *pool;
|
|
krh@0
|
301 |
|
|
krh@6
|
302 |
pool = set->string_pool.data;
|
|
krh@6
|
303 |
mask = set->buckets.alloc - 1;
|
|
krh@6
|
304 |
start = hash_string(key) * sizeof(unsigned long);
|
|
krh@0
|
305 |
|
|
krh@6
|
306 |
for (i = 0; i < set->buckets.alloc; i += sizeof *b) {
|
|
krh@6
|
307 |
b = set->buckets.data + ((start + i) & mask);
|
|
krh@6
|
308 |
|
|
krh@6
|
309 |
if (*b == 0)
|
|
krh@0
|
310 |
return 0;
|
|
krh@0
|
311 |
|
|
krh@6
|
312 |
if (strcmp(key, &pool[*b]) == 0)
|
|
krh@6
|
313 |
return *b;
|
|
krh@6
|
314 |
}
|
|
krh@0
|
315 |
|
|
krh@0
|
316 |
return 0;
|
|
krh@0
|
317 |
}
|
|
krh@0
|
318 |
|
|
krh@0
|
319 |
static unsigned long
|
|
krh@4
|
320 |
add_to_string_pool(struct razor_set *set, const char *key)
|
|
krh@0
|
321 |
{
|
|
krh@6
|
322 |
int len;
|
|
krh@6
|
323 |
char *p;
|
|
krh@0
|
324 |
|
|
krh@0
|
325 |
len = strlen(key) + 1;
|
|
krh@6
|
326 |
p = array_add(&set->string_pool, len);
|
|
krh@6
|
327 |
memcpy(p, key, len);
|
|
krh@0
|
328 |
|
|
krh@6
|
329 |
return p - (char *) set->string_pool.data;
|
|
krh@0
|
330 |
}
|
|
krh@0
|
331 |
|
|
krh@10
|
332 |
static unsigned long
|
|
krh@10
|
333 |
add_to_property_pool(struct razor_set *set, struct array *properties)
|
|
krh@10
|
334 |
{
|
|
krh@10
|
335 |
unsigned long *p;
|
|
krh@10
|
336 |
|
|
krh@10
|
337 |
p = array_add(properties, sizeof *p);
|
|
krh@10
|
338 |
*p = 0;
|
|
krh@10
|
339 |
p = array_add(&set->property_pool, properties->size);
|
|
krh@10
|
340 |
memcpy(p, properties->data, properties->size);
|
|
krh@10
|
341 |
|
|
krh@10
|
342 |
return p - (unsigned long *) set->property_pool.data;
|
|
krh@10
|
343 |
}
|
|
krh@10
|
344 |
|
|
krh@0
|
345 |
static void
|
|
krh@4
|
346 |
do_insert(struct razor_set *set, unsigned long value)
|
|
krh@0
|
347 |
{
|
|
krh@6
|
348 |
unsigned int mask, start, i;
|
|
krh@6
|
349 |
unsigned long *b;
|
|
krh@0
|
350 |
const char *key;
|
|
krh@0
|
351 |
|
|
krh@6
|
352 |
key = (char *) set->string_pool.data + value;
|
|
krh@6
|
353 |
mask = set->buckets.alloc - 1;
|
|
krh@6
|
354 |
start = hash_string(key) * sizeof(unsigned long);
|
|
krh@6
|
355 |
|
|
krh@6
|
356 |
for (i = 0; i < set->buckets.alloc; i += sizeof *b) {
|
|
krh@6
|
357 |
b = set->buckets.data + ((start + i) & mask);
|
|
krh@6
|
358 |
if (*b == 0) {
|
|
krh@6
|
359 |
*b = value;
|
|
krh@0
|
360 |
break;
|
|
krh@0
|
361 |
}
|
|
krh@6
|
362 |
}
|
|
krh@0
|
363 |
}
|
|
krh@0
|
364 |
|
|
krh@0
|
365 |
unsigned long
|
|
krh@4
|
366 |
razor_set_insert(struct razor_set *set, const char *key)
|
|
krh@0
|
367 |
{
|
|
krh@6
|
368 |
unsigned long value, *buckets, *b, *end;
|
|
krh@6
|
369 |
int alloc;
|
|
krh@0
|
370 |
|
|
krh@6
|
371 |
alloc = set->buckets.alloc;
|
|
krh@6
|
372 |
array_add(&set->buckets, 4 * sizeof *buckets);
|
|
krh@6
|
373 |
if (alloc != set->buckets.alloc) {
|
|
krh@6
|
374 |
end = set->buckets.data + alloc;
|
|
krh@6
|
375 |
memset(end, 0, set->buckets.alloc - alloc);
|
|
krh@6
|
376 |
for (b = set->buckets.data; b < end; b++) {
|
|
krh@6
|
377 |
value = *b;
|
|
krh@6
|
378 |
if (value != 0) {
|
|
krh@6
|
379 |
*b = 0;
|
|
krh@4
|
380 |
do_insert(set, value);
|
|
krh@6
|
381 |
}
|
|
krh@0
|
382 |
}
|
|
krh@0
|
383 |
}
|
|
krh@0
|
384 |
|
|
krh@4
|
385 |
value = add_to_string_pool(set, key);
|
|
krh@4
|
386 |
do_insert (set, value);
|
|
krh@0
|
387 |
|
|
krh@0
|
388 |
return value;
|
|
krh@0
|
389 |
}
|
|
krh@0
|
390 |
|
|
krh@3
|
391 |
static unsigned long
|
|
krh@4
|
392 |
razor_set_add_package(struct razor_set *set,
|
|
krh@3
|
393 |
unsigned long name, unsigned long version)
|
|
krh@3
|
394 |
{
|
|
krh@6
|
395 |
struct razor_package *p;
|
|
krh@3
|
396 |
|
|
krh@6
|
397 |
p = array_add(&set->packages, sizeof *p);
|
|
krh@3
|
398 |
|
|
krh@6
|
399 |
p->name = name;
|
|
krh@6
|
400 |
p->version = version;
|
|
krh@3
|
401 |
|
|
krh@6
|
402 |
return p - (struct razor_package *) set->packages.data;
|
|
krh@0
|
403 |
}
|
|
krh@0
|
404 |
|
|
krh@7
|
405 |
static unsigned long
|
|
krh@8
|
406 |
razor_set_add_requires(struct razor_set *set,
|
|
krh@8
|
407 |
unsigned long name, unsigned long version)
|
|
krh@8
|
408 |
{
|
|
krh@8
|
409 |
struct razor_property *p;
|
|
krh@8
|
410 |
|
|
krh@8
|
411 |
p = array_add(&set->requires, sizeof *p);
|
|
krh@8
|
412 |
|
|
krh@8
|
413 |
p->name = name;
|
|
krh@8
|
414 |
p->version = version;
|
|
krh@8
|
415 |
|
|
krh@8
|
416 |
return p - (struct razor_property *) set->requires.data;
|
|
krh@8
|
417 |
}
|
|
krh@8
|
418 |
|
|
krh@8
|
419 |
static unsigned long
|
|
krh@7
|
420 |
razor_set_add_provides(struct razor_set *set,
|
|
krh@7
|
421 |
unsigned long name, unsigned long version)
|
|
krh@7
|
422 |
{
|
|
krh@8
|
423 |
struct razor_property *p;
|
|
krh@7
|
424 |
|
|
krh@7
|
425 |
p = array_add(&set->provides, sizeof *p);
|
|
krh@7
|
426 |
|
|
krh@7
|
427 |
p->name = name;
|
|
krh@7
|
428 |
p->version = version;
|
|
krh@7
|
429 |
|
|
krh@8
|
430 |
return p - (struct razor_property *) set->provides.data;
|
|
krh@7
|
431 |
}
|
|
krh@7
|
432 |
|
|
krh@0
|
433 |
unsigned long
|
|
krh@4
|
434 |
razor_set_tokenize(struct razor_set *set, const char *string)
|
|
krh@0
|
435 |
{
|
|
krh@0
|
436 |
unsigned long token;
|
|
krh@0
|
437 |
|
|
krh@4
|
438 |
token = razor_set_lookup(set, string);
|
|
krh@0
|
439 |
if (token != 0)
|
|
krh@0
|
440 |
return token;
|
|
krh@0
|
441 |
|
|
krh@4
|
442 |
return razor_set_insert(set, string);
|
|
krh@0
|
443 |
}
|
|
krh@0
|
444 |
|
|
krh@10
|
445 |
struct property_context {
|
|
krh@10
|
446 |
struct array all;
|
|
krh@10
|
447 |
struct array package;
|
|
krh@10
|
448 |
};
|
|
krh@10
|
449 |
|
|
krh@9
|
450 |
struct import_context {
|
|
krh@4
|
451 |
struct razor_set *set;
|
|
krh@10
|
452 |
struct property_context requires;
|
|
krh@10
|
453 |
struct property_context provides;
|
|
krh@9
|
454 |
unsigned long package;
|
|
krh@10
|
455 |
unsigned long *requires_map;
|
|
krh@10
|
456 |
unsigned long *provides_map;
|
|
krh@10
|
457 |
};
|
|
krh@10
|
458 |
|
|
krh@10
|
459 |
struct import_property {
|
|
krh@10
|
460 |
unsigned long name;
|
|
krh@10
|
461 |
unsigned long version;
|
|
krh@10
|
462 |
unsigned long package;
|
|
krh@10
|
463 |
unsigned long index;
|
|
krh@10
|
464 |
unsigned long unique_index;
|
|
krh@0
|
465 |
};
|
|
krh@0
|
466 |
|
|
krh@0
|
467 |
static void
|
|
krh@9
|
468 |
parse_package(struct import_context *ctx, const char **atts, void *data)
|
|
krh@3
|
469 |
{
|
|
krh@7
|
470 |
unsigned long name = 0, version = 0;
|
|
krh@3
|
471 |
int i;
|
|
krh@3
|
472 |
|
|
krh@3
|
473 |
for (i = 0; atts[i]; i += 2) {
|
|
krh@3
|
474 |
if (strcmp(atts[i], "name") == 0)
|
|
krh@4
|
475 |
name = razor_set_tokenize(ctx->set, atts[i + 1]);
|
|
krh@3
|
476 |
else if (strcmp(atts[i], "version") == 0)
|
|
krh@4
|
477 |
version = razor_set_tokenize(ctx->set, atts[i + 1]);
|
|
krh@3
|
478 |
}
|
|
krh@3
|
479 |
|
|
krh@3
|
480 |
if (name == 0 || version == 0) {
|
|
krh@3
|
481 |
fprintf(stderr, "invalid package tag, "
|
|
krh@3
|
482 |
"missing name or version attributes\n");
|
|
krh@3
|
483 |
return;
|
|
krh@3
|
484 |
}
|
|
krh@3
|
485 |
|
|
krh@9
|
486 |
ctx->package = razor_set_add_package(ctx->set, name, version);
|
|
krh@10
|
487 |
memset(&ctx->requires.package, 0, sizeof ctx->requires.package);
|
|
krh@10
|
488 |
memset(&ctx->provides.package, 0, sizeof ctx->provides.package);
|
|
krh@4
|
489 |
|
|
krh@4
|
490 |
return;
|
|
krh@3
|
491 |
}
|
|
krh@3
|
492 |
|
|
krh@3
|
493 |
static void
|
|
krh@9
|
494 |
parse_property(struct import_context *ctx, const char **atts, void *data)
|
|
krh@8
|
495 |
{
|
|
krh@10
|
496 |
unsigned long name = 0, version = 0, *r;
|
|
krh@10
|
497 |
struct import_property *p;
|
|
krh@10
|
498 |
struct property_context *pctx = data;
|
|
krh@8
|
499 |
int i;
|
|
krh@8
|
500 |
|
|
krh@8
|
501 |
for (i = 0; atts[i]; i += 2) {
|
|
krh@8
|
502 |
if (strcmp(atts[i], "name") == 0)
|
|
krh@8
|
503 |
name = razor_set_tokenize(ctx->set, atts[i + 1]);
|
|
krh@9
|
504 |
if (strcmp(atts[i], "version") == 0)
|
|
krh@9
|
505 |
version = razor_set_tokenize(ctx->set, atts[i + 1]);
|
|
krh@8
|
506 |
}
|
|
krh@8
|
507 |
|
|
krh@8
|
508 |
if (name == 0) {
|
|
krh@9
|
509 |
fprintf(stderr, "invalid tag, missing name attribute\n");
|
|
krh@8
|
510 |
return;
|
|
krh@8
|
511 |
}
|
|
krh@8
|
512 |
|
|
krh@10
|
513 |
p = array_add(&pctx->all, sizeof *p);
|
|
krh@9
|
514 |
p->name = name;
|
|
krh@9
|
515 |
p->version = version;
|
|
krh@10
|
516 |
p->package = ctx->package;
|
|
krh@10
|
517 |
p->index = p - (struct import_property *) pctx->all.data;
|
|
krh@10
|
518 |
|
|
krh@10
|
519 |
r = array_add(&pctx->package, sizeof *r);
|
|
krh@10
|
520 |
*r = p->index;
|
|
krh@7
|
521 |
}
|
|
krh@7
|
522 |
|
|
krh@7
|
523 |
static void
|
|
krh@0
|
524 |
start_element(void *data, const char *name, const char **atts)
|
|
krh@0
|
525 |
{
|
|
krh@9
|
526 |
struct import_context *ctx = data;
|
|
krh@0
|
527 |
|
|
krh@3
|
528 |
if (strcmp(name, "package") == 0)
|
|
krh@9
|
529 |
parse_package(ctx, atts, NULL);
|
|
krh@8
|
530 |
else if (strcmp(name, "requires") == 0)
|
|
krh@9
|
531 |
parse_property(ctx, atts, &ctx->requires);
|
|
krh@7
|
532 |
else if (strcmp(name, "provides") == 0)
|
|
krh@9
|
533 |
parse_property(ctx, atts, &ctx->provides);
|
|
krh@0
|
534 |
}
|
|
krh@0
|
535 |
|
|
krh@0
|
536 |
static void
|
|
krh@0
|
537 |
end_element (void *data, const char *name)
|
|
krh@0
|
538 |
{
|
|
krh@9
|
539 |
struct import_context *ctx = data;
|
|
krh@10
|
540 |
struct razor_package *package;
|
|
krh@4
|
541 |
|
|
krh@10
|
542 |
if (strcmp(name, "package") == 0) {
|
|
krh@10
|
543 |
package = (struct razor_package *) ctx->set->packages.data +
|
|
krh@10
|
544 |
ctx->package;
|
|
krh@10
|
545 |
package->requires =
|
|
krh@10
|
546 |
add_to_property_pool(ctx->set, &ctx->requires.package);
|
|
krh@10
|
547 |
package->provides =
|
|
krh@10
|
548 |
add_to_property_pool(ctx->set, &ctx->provides.package);
|
|
krh@10
|
549 |
free(ctx->requires.package.data);
|
|
krh@10
|
550 |
free(ctx->provides.package.data);
|
|
krh@9
|
551 |
ctx->package = 0;
|
|
krh@10
|
552 |
}
|
|
krh@0
|
553 |
}
|
|
krh@0
|
554 |
|
|
krh@0
|
555 |
static char *
|
|
krh@0
|
556 |
sha1_to_hex(const unsigned char *sha1)
|
|
krh@0
|
557 |
{
|
|
krh@0
|
558 |
static int bufno;
|
|
krh@0
|
559 |
static char hexbuffer[4][50];
|
|
krh@0
|
560 |
static const char hex[] = "0123456789abcdef";
|
|
krh@0
|
561 |
char *buffer = hexbuffer[3 & ++bufno], *buf = buffer;
|
|
krh@0
|
562 |
int i;
|
|
krh@0
|
563 |
|
|
krh@0
|
564 |
for (i = 0; i < 20; i++) {
|
|
krh@0
|
565 |
unsigned int val = *sha1++;
|
|
krh@0
|
566 |
*buf++ = hex[val >> 4];
|
|
krh@0
|
567 |
*buf++ = hex[val & 0xf];
|
|
krh@0
|
568 |
}
|
|
krh@0
|
569 |
*buf = '\0';
|
|
krh@0
|
570 |
|
|
krh@0
|
571 |
return buffer;
|
|
krh@0
|
572 |
}
|
|
krh@0
|
573 |
|
|
krh@9
|
574 |
static void
|
|
krh@9
|
575 |
razor_set_prepare_import(struct razor_set *set, struct import_context *ctx)
|
|
krh@9
|
576 |
{
|
|
krh@9
|
577 |
memset(ctx, 0, sizeof *ctx);
|
|
krh@9
|
578 |
ctx->set = set;
|
|
krh@9
|
579 |
}
|
|
krh@9
|
580 |
|
|
krh@0
|
581 |
static int
|
|
krh@9
|
582 |
razor_set_import(struct import_context *ctx, const char *filename)
|
|
krh@0
|
583 |
{
|
|
krh@0
|
584 |
SHA_CTX sha1;
|
|
krh@0
|
585 |
XML_Parser parser;
|
|
krh@0
|
586 |
int fd;
|
|
krh@0
|
587 |
void *p;
|
|
krh@0
|
588 |
struct stat stat;
|
|
krh@0
|
589 |
char buf[128];
|
|
krh@0
|
590 |
unsigned char hash[20];
|
|
krh@0
|
591 |
|
|
krh@0
|
592 |
fd = open(filename, O_RDONLY);
|
|
krh@0
|
593 |
if (fstat(fd, &stat) < 0)
|
|
krh@0
|
594 |
return -1;
|
|
krh@0
|
595 |
p = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
|
|
krh@0
|
596 |
if (p == MAP_FAILED)
|
|
krh@0
|
597 |
return -1;
|
|
krh@0
|
598 |
|
|
krh@0
|
599 |
parser = XML_ParserCreate(NULL);
|
|
krh@9
|
600 |
XML_SetUserData(parser, ctx);
|
|
krh@0
|
601 |
XML_SetElementHandler(parser, start_element, end_element);
|
|
krh@0
|
602 |
if (XML_Parse(parser, p, stat.st_size, 1) == XML_STATUS_ERROR) {
|
|
krh@0
|
603 |
fprintf(stderr,
|
|
krh@0
|
604 |
"%s at line %d, %s\n",
|
|
krh@0
|
605 |
XML_ErrorString(XML_GetErrorCode(parser)),
|
|
krh@0
|
606 |
XML_GetCurrentLineNumber(parser),
|
|
krh@0
|
607 |
filename);
|
|
krh@0
|
608 |
return 1;
|
|
krh@0
|
609 |
}
|
|
krh@0
|
610 |
|
|
krh@0
|
611 |
XML_ParserFree(parser);
|
|
krh@0
|
612 |
|
|
krh@0
|
613 |
SHA1_Init(&sha1);
|
|
krh@0
|
614 |
SHA1_Update(&sha1, p, stat.st_size);
|
|
krh@0
|
615 |
SHA1_Final(hash, &sha1);
|
|
krh@0
|
616 |
|
|
krh@0
|
617 |
close(fd);
|
|
krh@0
|
618 |
|
|
krh@0
|
619 |
snprintf(buf, sizeof buf, "set/%s", sha1_to_hex(hash));
|
|
krh@0
|
620 |
if (write_to_file(buf, p, stat.st_size) < 0)
|
|
krh@0
|
621 |
return -1;
|
|
krh@0
|
622 |
munmap(p, stat.st_size);
|
|
krh@0
|
623 |
|
|
krh@0
|
624 |
return 0;
|
|
krh@0
|
625 |
}
|
|
krh@0
|
626 |
|
|
krh@9
|
627 |
static struct razor_set *qsort_set;
|
|
krh@9
|
628 |
|
|
krh@9
|
629 |
static int
|
|
krh@9
|
630 |
compare_packages(const void *p1, const void *p2)
|
|
krh@9
|
631 |
{
|
|
krh@9
|
632 |
const struct razor_package *pkg1 = p1, *pkg2 = p2;
|
|
krh@9
|
633 |
char *pool = qsort_set->string_pool.data;
|
|
krh@9
|
634 |
|
|
krh@9
|
635 |
return strcmp(&pool[pkg1->name], &pool[pkg2->name]);
|
|
krh@9
|
636 |
}
|
|
krh@9
|
637 |
|
|
krh@9
|
638 |
static int
|
|
krh@9
|
639 |
compare_properties(const void *p1, const void *p2)
|
|
krh@9
|
640 |
{
|
|
krh@10
|
641 |
const struct import_property *prop1 = p1, *prop2 = p2;
|
|
krh@9
|
642 |
char *pool = qsort_set->string_pool.data;
|
|
krh@9
|
643 |
|
|
krh@9
|
644 |
return strcmp(&pool[prop1->name], &pool[prop2->name]);
|
|
krh@9
|
645 |
}
|
|
krh@9
|
646 |
|
|
krh@10
|
647 |
static unsigned long *
|
|
krh@9
|
648 |
uniqueify_properties(struct array *in, struct array *out)
|
|
krh@9
|
649 |
{
|
|
krh@10
|
650 |
struct import_property *ip, *end;
|
|
krh@10
|
651 |
struct razor_property *rp;
|
|
krh@10
|
652 |
unsigned long *map;
|
|
krh@10
|
653 |
int i, count;
|
|
krh@9
|
654 |
|
|
krh@10
|
655 |
count = in->size / sizeof(struct import_property);
|
|
krh@10
|
656 |
qsort(in->data, count,
|
|
krh@10
|
657 |
sizeof(struct import_property), compare_properties);
|
|
krh@9
|
658 |
|
|
krh@10
|
659 |
rp = NULL;
|
|
krh@9
|
660 |
end = in->data + in->size;
|
|
krh@10
|
661 |
for (ip = in->data; ip < end; ip++) {
|
|
krh@10
|
662 |
if (rp == NULL ||
|
|
krh@10
|
663 |
ip->name != rp->name || ip->version != rp->version) {
|
|
krh@10
|
664 |
rp = array_add(out, sizeof *rp);
|
|
krh@10
|
665 |
rp->name = ip->name;
|
|
krh@10
|
666 |
rp->version = ip->version;
|
|
krh@10
|
667 |
}
|
|
krh@10
|
668 |
ip->unique_index = rp - (struct razor_property *) out->data;
|
|
krh@10
|
669 |
}
|
|
krh@9
|
670 |
|
|
krh@10
|
671 |
map = malloc(count * sizeof (unsigned long));
|
|
krh@10
|
672 |
ip = in->data;
|
|
krh@10
|
673 |
for (i = 0; i < count; i++)
|
|
krh@10
|
674 |
map[ip[i].index] = ip[i].unique_index;
|
|
krh@10
|
675 |
|
|
krh@10
|
676 |
return map;
|
|
krh@10
|
677 |
}
|
|
krh@10
|
678 |
|
|
krh@10
|
679 |
static void
|
|
krh@10
|
680 |
sort_packages(struct import_context *ctx)
|
|
krh@10
|
681 |
{
|
|
krh@10
|
682 |
struct razor_package *p, *end;
|
|
krh@10
|
683 |
unsigned long *pool, *r;
|
|
krh@10
|
684 |
|
|
krh@10
|
685 |
pool = ctx->set->property_pool.data;
|
|
krh@10
|
686 |
end = ctx->set->packages.data + ctx->set->packages.size;
|
|
krh@10
|
687 |
for (p = ctx->set->packages.data; p < end; p++) {
|
|
krh@10
|
688 |
for (r = &pool[p->requires]; *r; r++)
|
|
krh@10
|
689 |
*r = ctx->requires_map[*r];
|
|
krh@10
|
690 |
for (r = &pool[p->provides]; *r; r++)
|
|
krh@10
|
691 |
*r = ctx->provides_map[*r];
|
|
krh@9
|
692 |
}
|
|
krh@10
|
693 |
|
|
krh@10
|
694 |
qsort(ctx->set->packages.data,
|
|
krh@10
|
695 |
ctx->set->packages.size / sizeof(struct razor_package),
|
|
krh@10
|
696 |
sizeof(struct razor_package), compare_packages);
|
|
krh@9
|
697 |
}
|
|
krh@9
|
698 |
|
|
krh@9
|
699 |
static void
|
|
krh@9
|
700 |
razor_set_finish_import(struct import_context *ctx)
|
|
krh@9
|
701 |
{
|
|
krh@9
|
702 |
qsort_set = ctx->set;
|
|
krh@9
|
703 |
|
|
krh@10
|
704 |
ctx->requires_map =
|
|
krh@10
|
705 |
uniqueify_properties(&ctx->requires.all, &ctx->set->requires);
|
|
krh@10
|
706 |
ctx->provides_map =
|
|
krh@10
|
707 |
uniqueify_properties(&ctx->provides.all, &ctx->set->provides);
|
|
krh@9
|
708 |
|
|
krh@10
|
709 |
sort_packages(ctx);
|
|
krh@10
|
710 |
|
|
krh@10
|
711 |
free(ctx->requires.all.data);
|
|
krh@10
|
712 |
free(ctx->provides.all.data);
|
|
krh@10
|
713 |
free(ctx->requires_map);
|
|
krh@10
|
714 |
free(ctx->provides_map);
|
|
krh@9
|
715 |
|
|
krh@9
|
716 |
fprintf(stderr, "parsed %d requires, %d unique\n",
|
|
krh@10
|
717 |
ctx->requires.all.size / sizeof(struct import_property),
|
|
krh@9
|
718 |
ctx->set->requires.size / sizeof(struct razor_property));
|
|
krh@9
|
719 |
fprintf(stderr, "parsed %d provides, %d unique\n",
|
|
krh@10
|
720 |
ctx->provides.all.size / sizeof(struct import_property),
|
|
krh@9
|
721 |
ctx->set->provides.size / sizeof(struct razor_property));
|
|
krh@9
|
722 |
}
|
|
krh@9
|
723 |
|
|
krh@9
|
724 |
|
|
krh@0
|
725 |
void
|
|
krh@4
|
726 |
razor_set_list(struct razor_set *set)
|
|
krh@3
|
727 |
{
|
|
krh@6
|
728 |
struct razor_package *p, *end;
|
|
krh@6
|
729 |
char *pool;
|
|
krh@3
|
730 |
|
|
krh@6
|
731 |
pool = set->string_pool.data;
|
|
krh@6
|
732 |
end = set->packages.data + set->packages.size;
|
|
krh@6
|
733 |
for (p = set->packages.data; p < end && p->name; p++)
|
|
krh@6
|
734 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@3
|
735 |
}
|
|
krh@3
|
736 |
|
|
krh@10
|
737 |
struct razor_package *
|
|
krh@10
|
738 |
razor_set_get_package(struct razor_set *set, const char *package)
|
|
krh@10
|
739 |
{
|
|
krh@10
|
740 |
unsigned long name;
|
|
krh@10
|
741 |
struct razor_package *p, *end;
|
|
krh@10
|
742 |
|
|
krh@10
|
743 |
name = razor_set_lookup(set, package);
|
|
krh@10
|
744 |
end = set->packages.data + set->packages.size;
|
|
krh@10
|
745 |
for (p = set->packages.data; p < end && p->name; p++)
|
|
krh@10
|
746 |
if (p->name == name)
|
|
krh@10
|
747 |
return p;
|
|
krh@10
|
748 |
|
|
krh@10
|
749 |
return NULL;
|
|
krh@10
|
750 |
}
|
|
krh@10
|
751 |
|
|
krh@10
|
752 |
static void
|
|
krh@10
|
753 |
razor_set_list_all_properties(struct razor_set *set, struct array *properties)
|
|
krh@8
|
754 |
{
|
|
krh@8
|
755 |
struct razor_property *p, *end;
|
|
krh@8
|
756 |
char *pool;
|
|
krh@8
|
757 |
|
|
krh@8
|
758 |
pool = set->string_pool.data;
|
|
krh@10
|
759 |
end = properties->data + properties->size;
|
|
krh@10
|
760 |
for (p = properties->data; p < end && p->name; p++)
|
|
krh@8
|
761 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@8
|
762 |
}
|
|
krh@8
|
763 |
|
|
krh@8
|
764 |
void
|
|
krh@10
|
765 |
razor_set_list_requires(struct razor_set *set, const char *name)
|
|
krh@7
|
766 |
{
|
|
krh@10
|
767 |
struct razor_property *p, *requires;
|
|
krh@10
|
768 |
struct razor_package *package;
|
|
krh@10
|
769 |
unsigned long *r;
|
|
krh@7
|
770 |
char *pool;
|
|
krh@7
|
771 |
|
|
krh@10
|
772 |
if (name) {
|
|
krh@10
|
773 |
package = razor_set_get_package(set, name);
|
|
krh@10
|
774 |
r = (unsigned long *) set->property_pool.data +
|
|
krh@10
|
775 |
package->requires;
|
|
krh@10
|
776 |
requires = set->requires.data;
|
|
krh@10
|
777 |
pool = set->string_pool.data;
|
|
krh@10
|
778 |
while (*r) {
|
|
krh@10
|
779 |
p = &requires[*r++];
|
|
krh@10
|
780 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@10
|
781 |
}
|
|
krh@10
|
782 |
} else
|
|
krh@10
|
783 |
razor_set_list_all_properties(set, &set->requires);
|
|
krh@10
|
784 |
}
|
|
krh@10
|
785 |
|
|
krh@10
|
786 |
void
|
|
krh@10
|
787 |
razor_set_list_provides(struct razor_set *set, const char *name)
|
|
krh@10
|
788 |
{
|
|
krh@10
|
789 |
struct razor_property *p, *provides;
|
|
krh@10
|
790 |
struct razor_package *package;
|
|
krh@10
|
791 |
unsigned long *r;
|
|
krh@10
|
792 |
char *pool;
|
|
krh@10
|
793 |
|
|
krh@10
|
794 |
if (name) {
|
|
krh@10
|
795 |
package = razor_set_get_package(set, name);
|
|
krh@10
|
796 |
r = (unsigned long *) set->property_pool.data +
|
|
krh@10
|
797 |
package->provides;
|
|
krh@10
|
798 |
provides = set->provides.data;
|
|
krh@10
|
799 |
pool = set->string_pool.data;
|
|
krh@10
|
800 |
while (*r) {
|
|
krh@10
|
801 |
p = &provides[*r++];
|
|
krh@10
|
802 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@10
|
803 |
}
|
|
krh@10
|
804 |
} else
|
|
krh@10
|
805 |
razor_set_list_all_properties(set, &set->provides);
|
|
krh@7
|
806 |
}
|
|
krh@7
|
807 |
|
|
krh@7
|
808 |
void
|
|
krh@4
|
809 |
razor_set_info(struct razor_set *set)
|
|
krh@3
|
810 |
{
|
|
krh@3
|
811 |
unsigned int offset, size;
|
|
krh@3
|
812 |
int i;
|
|
krh@3
|
813 |
|
|
krh@4
|
814 |
for (i = 0; i < set->header->sections[i].type; i++) {
|
|
krh@4
|
815 |
offset = set->header->sections[i].offset;
|
|
krh@4
|
816 |
size = set->header->sections[i + 1].offset - offset;
|
|
krh@3
|
817 |
|
|
krh@4
|
818 |
switch (set->header->sections[i].type) {
|
|
krh@4
|
819 |
case RAZOR_BUCKETS:
|
|
krh@3
|
820 |
printf("bucket section:\t\t%dkb\n", size / 1024);
|
|
krh@3
|
821 |
break;
|
|
krh@4
|
822 |
case RAZOR_STRINGS:
|
|
krh@3
|
823 |
printf("string pool:\t\t%dkb\n", size / 1024);
|
|
krh@3
|
824 |
break;
|
|
krh@4
|
825 |
case RAZOR_PACKAGES:
|
|
krh@3
|
826 |
printf("package section:\t%dkb\n", size / 1024);
|
|
krh@3
|
827 |
break;
|
|
krh@8
|
828 |
case RAZOR_REQUIRES:
|
|
krh@8
|
829 |
printf("requires section:\t%dkb\n", size / 1024);
|
|
krh@8
|
830 |
break;
|
|
krh@7
|
831 |
case RAZOR_PROVIDES:
|
|
krh@7
|
832 |
printf("provides section:\t%dkb\n", size / 1024);
|
|
krh@7
|
833 |
break;
|
|
krh@3
|
834 |
}
|
|
krh@3
|
835 |
}
|
|
krh@0
|
836 |
}
|
|
krh@0
|
837 |
|
|
krh@0
|
838 |
static int
|
|
krh@0
|
839 |
usage(void)
|
|
krh@0
|
840 |
{
|
|
krh@7
|
841 |
printf("usage: razor [ import FILES | lookup <key> | "
|
|
krh@8
|
842 |
"list | list-requires | list-provides | info ]\n");
|
|
krh@0
|
843 |
exit(1);
|
|
krh@0
|
844 |
}
|
|
krh@0
|
845 |
|
|
krh@0
|
846 |
static const char repo_filename[] = "system.repo";
|
|
krh@0
|
847 |
|
|
krh@0
|
848 |
int
|
|
krh@0
|
849 |
main(int argc, char *argv[])
|
|
krh@0
|
850 |
{
|
|
krh@0
|
851 |
int i;
|
|
krh@4
|
852 |
struct razor_set *set;
|
|
krh@0
|
853 |
struct stat statbuf;
|
|
krh@9
|
854 |
struct import_context ctx;
|
|
krh@0
|
855 |
|
|
krh@3
|
856 |
if (argc < 2) {
|
|
krh@0
|
857 |
usage();
|
|
krh@0
|
858 |
} else if (strcmp(argv[1], "import") == 0) {
|
|
krh@0
|
859 |
if (stat("set", &statbuf) && mkdir("set", 0777)) {
|
|
krh@0
|
860 |
fprintf(stderr, "could not create directory 'set'\n");
|
|
krh@0
|
861 |
exit(-1);
|
|
krh@0
|
862 |
}
|
|
krh@0
|
863 |
|
|
krh@4
|
864 |
set = razor_set_create();
|
|
krh@0
|
865 |
|
|
krh@9
|
866 |
razor_set_prepare_import(set, &ctx);
|
|
krh@9
|
867 |
|
|
krh@0
|
868 |
for (i = 2; i < argc; i++) {
|
|
krh@9
|
869 |
if (razor_set_import(&ctx, argv[i]) < 0) {
|
|
krh@0
|
870 |
fprintf(stderr, "failed to import %s\n",
|
|
krh@0
|
871 |
argv[i]);
|
|
krh@0
|
872 |
exit(-1);
|
|
krh@0
|
873 |
}
|
|
krh@0
|
874 |
}
|
|
krh@0
|
875 |
|
|
krh@9
|
876 |
razor_set_finish_import(&ctx);
|
|
krh@3
|
877 |
|
|
krh@6
|
878 |
/* FIXME: We add a sentinel package here, but we
|
|
krh@6
|
879 |
* should probably just have a size field in the
|
|
krh@6
|
880 |
* header section. */
|
|
krh@6
|
881 |
razor_set_add_package(set, 0, 0);
|
|
krh@8
|
882 |
razor_set_add_requires(set, 0, 0);
|
|
krh@7
|
883 |
razor_set_add_provides(set, 0, 0);
|
|
krh@6
|
884 |
|
|
krh@6
|
885 |
printf("bucket allocation: %d\n", set->buckets.alloc);
|
|
krh@6
|
886 |
printf("pool size: %d\n", set->string_pool.size);
|
|
krh@6
|
887 |
printf("pool allocation: %d\n", set->string_pool.alloc);
|
|
krh@7
|
888 |
printf("packages: %d\n",
|
|
krh@7
|
889 |
set->packages.size / sizeof(struct razor_package));
|
|
krh@8
|
890 |
printf("requires: %d\n",
|
|
krh@8
|
891 |
set->requires.size / sizeof(struct razor_property));
|
|
krh@7
|
892 |
printf("provides: %d\n",
|
|
krh@8
|
893 |
set->provides.size / sizeof(struct razor_property));
|
|
krh@0
|
894 |
|
|
krh@4
|
895 |
razor_set_write(set, repo_filename);
|
|
krh@0
|
896 |
|
|
krh@4
|
897 |
razor_set_destroy(set);
|
|
krh@0
|
898 |
} else if (strcmp(argv[1], "lookup") == 0) {
|
|
krh@4
|
899 |
set = razor_set_open(repo_filename);
|
|
krh@0
|
900 |
printf("%s is %lu\n", argv[2],
|
|
krh@4
|
901 |
razor_set_lookup(set, argv[2]));
|
|
krh@4
|
902 |
razor_set_destroy(set);
|
|
krh@3
|
903 |
} else if (strcmp(argv[1], "list") == 0) {
|
|
krh@4
|
904 |
set = razor_set_open(repo_filename);
|
|
krh@4
|
905 |
razor_set_list(set);
|
|
krh@4
|
906 |
razor_set_destroy(set);
|
|
krh@8
|
907 |
} else if (strcmp(argv[1], "list-requires") == 0) {
|
|
krh@8
|
908 |
set = razor_set_open(repo_filename);
|
|
krh@10
|
909 |
razor_set_list_requires(set, argv[2]);
|
|
krh@8
|
910 |
razor_set_destroy(set);
|
|
krh@7
|
911 |
} else if (strcmp(argv[1], "list-provides") == 0) {
|
|
krh@7
|
912 |
set = razor_set_open(repo_filename);
|
|
krh@10
|
913 |
razor_set_list_provides(set, argv[2]);
|
|
krh@7
|
914 |
razor_set_destroy(set);
|
|
krh@3
|
915 |
} else if (strcmp(argv[1], "info") == 0) {
|
|
krh@4
|
916 |
set = razor_set_open(repo_filename);
|
|
krh@4
|
917 |
razor_set_info(set);
|
|
krh@4
|
918 |
razor_set_destroy(set);
|
|
krh@0
|
919 |
} else {
|
|
krh@0
|
920 |
usage();
|
|
krh@0
|
921 |
}
|
|
krh@0
|
922 |
|
|
krh@0
|
923 |
return 0;
|
|
krh@0
|
924 |
}
|