|
krh@15
|
1 |
#define _GNU_SOURCE
|
|
krh@15
|
2 |
|
|
krh@0
|
3 |
#include <stdlib.h>
|
|
krh@0
|
4 |
#include <stdio.h>
|
|
krh@0
|
5 |
#include <string.h>
|
|
krh@0
|
6 |
#include <sys/types.h>
|
|
krh@0
|
7 |
#include <sys/stat.h>
|
|
krh@0
|
8 |
#include <sys/mman.h>
|
|
krh@0
|
9 |
#include <unistd.h>
|
|
krh@0
|
10 |
#include <fcntl.h>
|
|
krh@15
|
11 |
#include <errno.h>
|
|
krh@0
|
12 |
|
|
krh@0
|
13 |
#include <expat.h>
|
|
krh@0
|
14 |
#include "sha1.h"
|
|
krh@0
|
15 |
|
|
krh@6
|
16 |
struct array {
|
|
krh@6
|
17 |
void *data;
|
|
krh@6
|
18 |
int size, alloc;
|
|
krh@6
|
19 |
};
|
|
krh@6
|
20 |
|
|
krh@13
|
21 |
static void
|
|
krh@13
|
22 |
array_init(struct array *array)
|
|
krh@13
|
23 |
{
|
|
krh@13
|
24 |
memset(array, 0, sizeof *array);
|
|
krh@13
|
25 |
}
|
|
krh@13
|
26 |
|
|
krh@13
|
27 |
static void
|
|
krh@13
|
28 |
array_release(struct array *array)
|
|
krh@13
|
29 |
{
|
|
krh@13
|
30 |
free(array->data);
|
|
krh@13
|
31 |
}
|
|
krh@13
|
32 |
|
|
krh@6
|
33 |
static void *
|
|
krh@6
|
34 |
array_add(struct array *array, int size)
|
|
krh@6
|
35 |
{
|
|
krh@6
|
36 |
int alloc;
|
|
krh@6
|
37 |
void *data, *p;
|
|
krh@6
|
38 |
|
|
krh@6
|
39 |
if (array->alloc > 0)
|
|
krh@6
|
40 |
alloc = array->alloc;
|
|
krh@6
|
41 |
else
|
|
krh@10
|
42 |
alloc = 16;
|
|
krh@6
|
43 |
|
|
krh@6
|
44 |
while (alloc < array->size + size)
|
|
krh@6
|
45 |
alloc *= 2;
|
|
krh@6
|
46 |
|
|
krh@6
|
47 |
if (array->alloc < alloc) {
|
|
krh@6
|
48 |
data = realloc(array->data, alloc);
|
|
krh@6
|
49 |
if (data == NULL)
|
|
krh@6
|
50 |
return 0;
|
|
krh@6
|
51 |
array->data = data;
|
|
krh@6
|
52 |
array->alloc = alloc;
|
|
krh@6
|
53 |
}
|
|
krh@6
|
54 |
|
|
krh@6
|
55 |
p = array->data + array->size;
|
|
krh@6
|
56 |
array->size += size;
|
|
krh@6
|
57 |
|
|
krh@6
|
58 |
return p;
|
|
krh@6
|
59 |
}
|
|
krh@6
|
60 |
|
|
krh@0
|
61 |
static int
|
|
krh@0
|
62 |
write_to_fd(int fd, void *p, size_t size)
|
|
krh@0
|
63 |
{
|
|
krh@0
|
64 |
int rest, len;
|
|
krh@0
|
65 |
|
|
krh@0
|
66 |
rest = size;
|
|
krh@0
|
67 |
while (rest > 0) {
|
|
krh@0
|
68 |
len = write(fd, p, rest);
|
|
krh@0
|
69 |
if (len < 0)
|
|
krh@0
|
70 |
return -1;
|
|
krh@0
|
71 |
rest -= len;
|
|
krh@0
|
72 |
}
|
|
krh@0
|
73 |
|
|
krh@0
|
74 |
return 0;
|
|
krh@0
|
75 |
}
|
|
krh@0
|
76 |
|
|
krh@0
|
77 |
static int
|
|
krh@0
|
78 |
write_to_file(const char *filename, void *p, size_t size)
|
|
krh@0
|
79 |
{
|
|
krh@0
|
80 |
int fd, err;
|
|
krh@0
|
81 |
|
|
krh@0
|
82 |
fd = open(filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);
|
|
krh@0
|
83 |
if (fd < 0)
|
|
krh@0
|
84 |
return -1;
|
|
krh@0
|
85 |
err = write_to_fd(fd, p, size);
|
|
krh@0
|
86 |
close(fd);
|
|
krh@0
|
87 |
|
|
krh@0
|
88 |
return err;
|
|
krh@0
|
89 |
}
|
|
krh@0
|
90 |
|
|
krh@0
|
91 |
static void *
|
|
krh@0
|
92 |
zalloc(size_t size)
|
|
krh@0
|
93 |
{
|
|
krh@0
|
94 |
void *p;
|
|
krh@0
|
95 |
|
|
krh@0
|
96 |
p = malloc(size);
|
|
krh@0
|
97 |
memset(p, 0, size);
|
|
krh@0
|
98 |
|
|
krh@0
|
99 |
return p;
|
|
krh@0
|
100 |
}
|
|
krh@0
|
101 |
|
|
krh@4
|
102 |
struct razor_set_header {
|
|
krh@4
|
103 |
unsigned int magic;
|
|
krh@4
|
104 |
unsigned int version;
|
|
krh@14
|
105 |
struct { unsigned int type, offset, size; } sections[0];
|
|
krh@4
|
106 |
};
|
|
krh@4
|
107 |
|
|
krh@4
|
108 |
#define RAZOR_MAGIC 0x7a7a7a7a
|
|
krh@4
|
109 |
#define RAZOR_VERSION 1
|
|
krh@8
|
110 |
|
|
krh@4
|
111 |
#define RAZOR_BUCKETS 1
|
|
krh@4
|
112 |
#define RAZOR_STRINGS 2
|
|
krh@4
|
113 |
#define RAZOR_PACKAGES 3
|
|
krh@8
|
114 |
#define RAZOR_REQUIRES 4
|
|
krh@8
|
115 |
#define RAZOR_PROVIDES 5
|
|
krh@10
|
116 |
#define RAZOR_PROPERTIES 6
|
|
krh@4
|
117 |
|
|
krh@4
|
118 |
struct razor_package {
|
|
krh@4
|
119 |
unsigned long name;
|
|
krh@4
|
120 |
unsigned long version;
|
|
krh@10
|
121 |
unsigned long requires;
|
|
krh@10
|
122 |
unsigned long provides;
|
|
krh@4
|
123 |
};
|
|
krh@4
|
124 |
|
|
krh@8
|
125 |
struct razor_property {
|
|
krh@7
|
126 |
unsigned long name;
|
|
krh@7
|
127 |
unsigned long version;
|
|
krh@9
|
128 |
unsigned long packages;
|
|
krh@7
|
129 |
};
|
|
krh@7
|
130 |
|
|
krh@4
|
131 |
struct razor_set {
|
|
krh@6
|
132 |
struct array buckets;
|
|
krh@6
|
133 |
struct array string_pool;
|
|
krh@10
|
134 |
struct array property_pool;
|
|
krh@7
|
135 |
struct array packages;
|
|
krh@8
|
136 |
struct array requires;
|
|
krh@7
|
137 |
struct array provides;
|
|
krh@4
|
138 |
struct razor_set_header *header;
|
|
krh@4
|
139 |
};
|
|
krh@4
|
140 |
|
|
krh@4
|
141 |
struct razor_set *
|
|
krh@4
|
142 |
razor_set_create(void)
|
|
krh@0
|
143 |
{
|
|
krh@18
|
144 |
return zalloc(sizeof(struct razor_set));
|
|
krh@0
|
145 |
}
|
|
krh@0
|
146 |
|
|
krh@4
|
147 |
struct razor_set *
|
|
krh@4
|
148 |
razor_set_open(const char *filename)
|
|
krh@0
|
149 |
{
|
|
krh@4
|
150 |
struct razor_set *set;
|
|
krh@0
|
151 |
struct stat stat;
|
|
krh@0
|
152 |
unsigned int size, offset;
|
|
krh@0
|
153 |
int fd, i;
|
|
krh@0
|
154 |
|
|
krh@4
|
155 |
set = zalloc(sizeof *set);
|
|
krh@0
|
156 |
fd = open(filename, O_RDONLY);
|
|
krh@0
|
157 |
if (fstat(fd, &stat) < 0)
|
|
krh@0
|
158 |
return NULL;
|
|
krh@4
|
159 |
set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
|
|
krh@4
|
160 |
if (set->header == MAP_FAILED) {
|
|
krh@4
|
161 |
free(set);
|
|
krh@0
|
162 |
return NULL;
|
|
krh@0
|
163 |
}
|
|
krh@0
|
164 |
|
|
krh@4
|
165 |
for (i = 0; i < set->header->sections[i].type; i++) {
|
|
krh@4
|
166 |
offset = set->header->sections[i].offset;
|
|
krh@14
|
167 |
size = set->header->sections[i].size;
|
|
krh@0
|
168 |
|
|
krh@4
|
169 |
switch (set->header->sections[i].type) {
|
|
krh@4
|
170 |
case RAZOR_STRINGS:
|
|
krh@6
|
171 |
set->string_pool.data = (void *) set->header + offset;
|
|
krh@6
|
172 |
set->string_pool.size = size;
|
|
krh@6
|
173 |
set->string_pool.alloc = size;
|
|
krh@0
|
174 |
break;
|
|
krh@4
|
175 |
case RAZOR_PACKAGES:
|
|
krh@6
|
176 |
set->packages.data = (void *) set->header + offset;
|
|
krh@6
|
177 |
set->packages.size = size;
|
|
krh@6
|
178 |
set->packages.size = size;
|
|
krh@3
|
179 |
break;
|
|
krh@8
|
180 |
case RAZOR_REQUIRES:
|
|
krh@8
|
181 |
set->requires.data = (void *) set->header + offset;
|
|
krh@8
|
182 |
set->requires.size = size;
|
|
krh@8
|
183 |
set->requires.size = size;
|
|
krh@8
|
184 |
break;
|
|
krh@7
|
185 |
case RAZOR_PROVIDES:
|
|
krh@7
|
186 |
set->provides.data = (void *) set->header + offset;
|
|
krh@7
|
187 |
set->provides.size = size;
|
|
krh@7
|
188 |
set->provides.size = size;
|
|
krh@7
|
189 |
break;
|
|
krh@10
|
190 |
case RAZOR_PROPERTIES:
|
|
krh@10
|
191 |
set->property_pool.data = (void *) set->header + offset;
|
|
krh@10
|
192 |
set->property_pool.size = size;
|
|
krh@10
|
193 |
set->property_pool.size = size;
|
|
krh@10
|
194 |
break;
|
|
krh@0
|
195 |
}
|
|
krh@0
|
196 |
}
|
|
krh@0
|
197 |
close(fd);
|
|
krh@0
|
198 |
|
|
krh@4
|
199 |
return set;
|
|
krh@0
|
200 |
}
|
|
krh@0
|
201 |
|
|
krh@0
|
202 |
void
|
|
krh@4
|
203 |
razor_set_destroy(struct razor_set *set)
|
|
krh@0
|
204 |
{
|
|
krh@0
|
205 |
unsigned int size;
|
|
krh@0
|
206 |
int i;
|
|
krh@0
|
207 |
|
|
krh@4
|
208 |
if (set->header) {
|
|
krh@4
|
209 |
for (i = 0; set->header->sections[i].type; i++)
|
|
krh@0
|
210 |
;
|
|
krh@4
|
211 |
size = set->header->sections[i].type;
|
|
krh@4
|
212 |
munmap(set->header, size);
|
|
krh@17
|
213 |
free(set->buckets.data);
|
|
krh@0
|
214 |
} else {
|
|
krh@6
|
215 |
free(set->buckets.data);
|
|
krh@6
|
216 |
free(set->string_pool.data);
|
|
krh@6
|
217 |
free(set->packages.data);
|
|
krh@9
|
218 |
free(set->requires.data);
|
|
krh@9
|
219 |
free(set->provides.data);
|
|
krh@10
|
220 |
free(set->property_pool.data);
|
|
krh@0
|
221 |
}
|
|
krh@0
|
222 |
|
|
krh@4
|
223 |
free(set);
|
|
krh@0
|
224 |
}
|
|
krh@0
|
225 |
|
|
krh@0
|
226 |
static int
|
|
krh@4
|
227 |
razor_set_write(struct razor_set *set, const char *filename)
|
|
krh@0
|
228 |
{
|
|
krh@0
|
229 |
char data[4096];
|
|
krh@4
|
230 |
struct razor_set_header *header = (struct razor_set_header *) data;
|
|
krh@17
|
231 |
unsigned long offset;
|
|
krh@17
|
232 |
int i, fd;
|
|
krh@17
|
233 |
struct { int type; struct array *array; } sections[] = {
|
|
krh@17
|
234 |
{ RAZOR_STRINGS, &set->string_pool },
|
|
krh@17
|
235 |
{ RAZOR_PACKAGES, &set->packages },
|
|
krh@17
|
236 |
{ RAZOR_REQUIRES, &set->requires },
|
|
krh@17
|
237 |
{ RAZOR_PROVIDES, &set->provides },
|
|
krh@17
|
238 |
{ RAZOR_PROPERTIES, &set->property_pool },
|
|
krh@17
|
239 |
{ 0 }
|
|
krh@17
|
240 |
};
|
|
krh@0
|
241 |
|
|
krh@0
|
242 |
memset(data, 0, sizeof data);
|
|
krh@4
|
243 |
header->magic = RAZOR_MAGIC;
|
|
krh@4
|
244 |
header->version = RAZOR_VERSION;
|
|
krh@17
|
245 |
offset = sizeof data;
|
|
krh@0
|
246 |
|
|
krh@17
|
247 |
for (i = 0; sections[i].type != 0; i++) {
|
|
krh@17
|
248 |
header->sections[i].type = sections[i].type;
|
|
krh@17
|
249 |
header->sections[i].offset = offset;
|
|
krh@17
|
250 |
header->sections[i].size = sections[i].array->size;
|
|
krh@17
|
251 |
offset += (sections[i].array->size + 4095) & ~4095;
|
|
krh@17
|
252 |
}
|
|
krh@0
|
253 |
|
|
krh@17
|
254 |
header->sections[i].type = 0;
|
|
krh@17
|
255 |
header->sections[i].offset = 0;
|
|
krh@17
|
256 |
header->sections[i].size = 0;
|
|
krh@10
|
257 |
|
|
krh@0
|
258 |
fd = open(filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);
|
|
krh@0
|
259 |
if (fd < 0)
|
|
krh@0
|
260 |
return -1;
|
|
krh@0
|
261 |
|
|
krh@0
|
262 |
write_to_fd(fd, data, sizeof data);
|
|
krh@17
|
263 |
for (i = 0; sections[i].type != 0; i++)
|
|
krh@17
|
264 |
write_to_fd(fd, sections[i].array->data,
|
|
krh@17
|
265 |
(sections[i].array->size + 4095) & ~4095);
|
|
krh@17
|
266 |
|
|
krh@17
|
267 |
close(fd);
|
|
krh@0
|
268 |
|
|
krh@0
|
269 |
return 0;
|
|
krh@0
|
270 |
}
|
|
krh@0
|
271 |
|
|
krh@0
|
272 |
static unsigned int
|
|
krh@0
|
273 |
hash_string(const char *key)
|
|
krh@0
|
274 |
{
|
|
krh@0
|
275 |
const char *p;
|
|
krh@0
|
276 |
unsigned int hash = 0;
|
|
krh@0
|
277 |
|
|
krh@0
|
278 |
for (p = key; *p; p++)
|
|
krh@9
|
279 |
hash = (hash * 617) ^ *p;
|
|
krh@0
|
280 |
|
|
krh@0
|
281 |
return hash;
|
|
krh@0
|
282 |
}
|
|
krh@0
|
283 |
|
|
krh@0
|
284 |
unsigned long
|
|
krh@4
|
285 |
razor_set_lookup(struct razor_set *set, const char *key)
|
|
krh@0
|
286 |
{
|
|
krh@6
|
287 |
unsigned int mask, start, i;
|
|
krh@6
|
288 |
unsigned long *b;
|
|
krh@6
|
289 |
char *pool;
|
|
krh@0
|
290 |
|
|
krh@6
|
291 |
pool = set->string_pool.data;
|
|
krh@6
|
292 |
mask = set->buckets.alloc - 1;
|
|
krh@6
|
293 |
start = hash_string(key) * sizeof(unsigned long);
|
|
krh@0
|
294 |
|
|
krh@6
|
295 |
for (i = 0; i < set->buckets.alloc; i += sizeof *b) {
|
|
krh@6
|
296 |
b = set->buckets.data + ((start + i) & mask);
|
|
krh@6
|
297 |
|
|
krh@6
|
298 |
if (*b == 0)
|
|
krh@0
|
299 |
return 0;
|
|
krh@0
|
300 |
|
|
krh@6
|
301 |
if (strcmp(key, &pool[*b]) == 0)
|
|
krh@6
|
302 |
return *b;
|
|
krh@6
|
303 |
}
|
|
krh@0
|
304 |
|
|
krh@0
|
305 |
return 0;
|
|
krh@0
|
306 |
}
|
|
krh@0
|
307 |
|
|
krh@0
|
308 |
static unsigned long
|
|
krh@4
|
309 |
add_to_string_pool(struct razor_set *set, const char *key)
|
|
krh@0
|
310 |
{
|
|
krh@6
|
311 |
int len;
|
|
krh@6
|
312 |
char *p;
|
|
krh@0
|
313 |
|
|
krh@0
|
314 |
len = strlen(key) + 1;
|
|
krh@6
|
315 |
p = array_add(&set->string_pool, len);
|
|
krh@6
|
316 |
memcpy(p, key, len);
|
|
krh@0
|
317 |
|
|
krh@6
|
318 |
return p - (char *) set->string_pool.data;
|
|
krh@0
|
319 |
}
|
|
krh@0
|
320 |
|
|
krh@10
|
321 |
static unsigned long
|
|
krh@10
|
322 |
add_to_property_pool(struct razor_set *set, struct array *properties)
|
|
krh@10
|
323 |
{
|
|
krh@10
|
324 |
unsigned long *p;
|
|
krh@10
|
325 |
|
|
krh@10
|
326 |
p = array_add(properties, sizeof *p);
|
|
krh@18
|
327 |
*p = ~0ul;
|
|
krh@10
|
328 |
p = array_add(&set->property_pool, properties->size);
|
|
krh@10
|
329 |
memcpy(p, properties->data, properties->size);
|
|
krh@10
|
330 |
|
|
krh@10
|
331 |
return p - (unsigned long *) set->property_pool.data;
|
|
krh@10
|
332 |
}
|
|
krh@10
|
333 |
|
|
krh@0
|
334 |
static void
|
|
krh@4
|
335 |
do_insert(struct razor_set *set, unsigned long value)
|
|
krh@0
|
336 |
{
|
|
krh@6
|
337 |
unsigned int mask, start, i;
|
|
krh@6
|
338 |
unsigned long *b;
|
|
krh@0
|
339 |
const char *key;
|
|
krh@0
|
340 |
|
|
krh@6
|
341 |
key = (char *) set->string_pool.data + value;
|
|
krh@6
|
342 |
mask = set->buckets.alloc - 1;
|
|
krh@6
|
343 |
start = hash_string(key) * sizeof(unsigned long);
|
|
krh@6
|
344 |
|
|
krh@6
|
345 |
for (i = 0; i < set->buckets.alloc; i += sizeof *b) {
|
|
krh@6
|
346 |
b = set->buckets.data + ((start + i) & mask);
|
|
krh@6
|
347 |
if (*b == 0) {
|
|
krh@6
|
348 |
*b = value;
|
|
krh@0
|
349 |
break;
|
|
krh@0
|
350 |
}
|
|
krh@6
|
351 |
}
|
|
krh@0
|
352 |
}
|
|
krh@0
|
353 |
|
|
krh@0
|
354 |
unsigned long
|
|
krh@4
|
355 |
razor_set_insert(struct razor_set *set, const char *key)
|
|
krh@0
|
356 |
{
|
|
krh@6
|
357 |
unsigned long value, *buckets, *b, *end;
|
|
krh@6
|
358 |
int alloc;
|
|
krh@0
|
359 |
|
|
krh@6
|
360 |
alloc = set->buckets.alloc;
|
|
krh@6
|
361 |
array_add(&set->buckets, 4 * sizeof *buckets);
|
|
krh@6
|
362 |
if (alloc != set->buckets.alloc) {
|
|
krh@6
|
363 |
end = set->buckets.data + alloc;
|
|
krh@6
|
364 |
memset(end, 0, set->buckets.alloc - alloc);
|
|
krh@6
|
365 |
for (b = set->buckets.data; b < end; b++) {
|
|
krh@6
|
366 |
value = *b;
|
|
krh@6
|
367 |
if (value != 0) {
|
|
krh@6
|
368 |
*b = 0;
|
|
krh@4
|
369 |
do_insert(set, value);
|
|
krh@6
|
370 |
}
|
|
krh@0
|
371 |
}
|
|
krh@0
|
372 |
}
|
|
krh@0
|
373 |
|
|
krh@4
|
374 |
value = add_to_string_pool(set, key);
|
|
krh@4
|
375 |
do_insert (set, value);
|
|
krh@0
|
376 |
|
|
krh@0
|
377 |
return value;
|
|
krh@0
|
378 |
}
|
|
krh@0
|
379 |
|
|
krh@0
|
380 |
unsigned long
|
|
krh@4
|
381 |
razor_set_tokenize(struct razor_set *set, const char *string)
|
|
krh@0
|
382 |
{
|
|
krh@0
|
383 |
unsigned long token;
|
|
krh@0
|
384 |
|
|
krh@13
|
385 |
if (string == NULL)
|
|
krh@18
|
386 |
return razor_set_tokenize(set, "");
|
|
krh@13
|
387 |
|
|
krh@4
|
388 |
token = razor_set_lookup(set, string);
|
|
krh@0
|
389 |
if (token != 0)
|
|
krh@0
|
390 |
return token;
|
|
krh@0
|
391 |
|
|
krh@4
|
392 |
return razor_set_insert(set, string);
|
|
krh@0
|
393 |
}
|
|
krh@0
|
394 |
|
|
krh@13
|
395 |
struct import_property_context {
|
|
krh@10
|
396 |
struct array all;
|
|
krh@10
|
397 |
struct array package;
|
|
krh@10
|
398 |
};
|
|
krh@10
|
399 |
|
|
krh@9
|
400 |
struct import_context {
|
|
krh@4
|
401 |
struct razor_set *set;
|
|
krh@13
|
402 |
struct import_property_context requires;
|
|
krh@13
|
403 |
struct import_property_context provides;
|
|
krh@18
|
404 |
struct array packages;
|
|
krh@18
|
405 |
struct import_package *package;
|
|
krh@10
|
406 |
unsigned long *requires_map;
|
|
krh@10
|
407 |
unsigned long *provides_map;
|
|
krh@10
|
408 |
};
|
|
krh@10
|
409 |
|
|
krh@18
|
410 |
struct import_package {
|
|
krh@18
|
411 |
unsigned long name;
|
|
krh@18
|
412 |
unsigned long version;
|
|
krh@18
|
413 |
unsigned long requires;
|
|
krh@18
|
414 |
unsigned long provides;
|
|
krh@18
|
415 |
unsigned long index;
|
|
krh@18
|
416 |
};
|
|
krh@18
|
417 |
|
|
krh@10
|
418 |
struct import_property {
|
|
krh@10
|
419 |
unsigned long name;
|
|
krh@10
|
420 |
unsigned long version;
|
|
krh@10
|
421 |
unsigned long package;
|
|
krh@10
|
422 |
unsigned long index;
|
|
krh@10
|
423 |
unsigned long unique_index;
|
|
krh@0
|
424 |
};
|
|
krh@0
|
425 |
|
|
krh@0
|
426 |
static void
|
|
krh@13
|
427 |
import_context_add_package(struct import_context *ctx,
|
|
krh@13
|
428 |
const char *name, const char *version)
|
|
krh@13
|
429 |
{
|
|
krh@18
|
430 |
struct import_package *p;
|
|
krh@13
|
431 |
|
|
krh@18
|
432 |
p = array_add(&ctx->packages, sizeof *p);
|
|
krh@13
|
433 |
p->name = razor_set_tokenize(ctx->set, name);
|
|
krh@13
|
434 |
p->version = razor_set_tokenize(ctx->set, version);
|
|
krh@18
|
435 |
p->index = p - (struct import_package *) ctx->packages.data;
|
|
krh@13
|
436 |
|
|
krh@18
|
437 |
ctx->package = p;
|
|
krh@13
|
438 |
array_init(&ctx->requires.package);
|
|
krh@13
|
439 |
array_init(&ctx->provides.package);
|
|
krh@13
|
440 |
}
|
|
krh@13
|
441 |
|
|
krh@13
|
442 |
void
|
|
krh@13
|
443 |
import_context_finish_package(struct import_context *ctx)
|
|
krh@13
|
444 |
{
|
|
krh@18
|
445 |
struct import_package *p;
|
|
krh@13
|
446 |
|
|
krh@18
|
447 |
p = ctx->package;
|
|
krh@13
|
448 |
p->requires = add_to_property_pool(ctx->set, &ctx->requires.package);
|
|
krh@13
|
449 |
p->provides = add_to_property_pool(ctx->set, &ctx->provides.package);
|
|
krh@13
|
450 |
|
|
krh@13
|
451 |
array_release(&ctx->requires.package);
|
|
krh@13
|
452 |
array_release(&ctx->provides.package);
|
|
krh@13
|
453 |
}
|
|
krh@13
|
454 |
|
|
krh@13
|
455 |
static void
|
|
krh@13
|
456 |
import_context_add_property(struct import_context *ctx,
|
|
krh@13
|
457 |
struct import_property_context *pctx,
|
|
krh@13
|
458 |
const char *name, const char *version)
|
|
krh@13
|
459 |
{
|
|
krh@13
|
460 |
struct import_property *p;
|
|
krh@13
|
461 |
unsigned long *r;
|
|
krh@13
|
462 |
|
|
krh@13
|
463 |
p = array_add(&pctx->all, sizeof *p);
|
|
krh@13
|
464 |
p->name = razor_set_tokenize(ctx->set, name);
|
|
krh@13
|
465 |
p->version = razor_set_tokenize(ctx->set, version);
|
|
krh@18
|
466 |
p->package = ctx->package->index;
|
|
krh@13
|
467 |
p->index = p - (struct import_property *) pctx->all.data;
|
|
krh@13
|
468 |
|
|
krh@13
|
469 |
r = array_add(&pctx->package, sizeof *r);
|
|
krh@13
|
470 |
*r = p->index;
|
|
krh@13
|
471 |
}
|
|
krh@13
|
472 |
|
|
krh@13
|
473 |
static void
|
|
krh@9
|
474 |
parse_package(struct import_context *ctx, const char **atts, void *data)
|
|
krh@3
|
475 |
{
|
|
krh@13
|
476 |
const char *name = NULL, *version = NULL;
|
|
krh@3
|
477 |
int i;
|
|
krh@3
|
478 |
|
|
krh@3
|
479 |
for (i = 0; atts[i]; i += 2) {
|
|
krh@3
|
480 |
if (strcmp(atts[i], "name") == 0)
|
|
krh@13
|
481 |
name = atts[i + 1];
|
|
krh@3
|
482 |
else if (strcmp(atts[i], "version") == 0)
|
|
krh@13
|
483 |
version = atts[i + 1];
|
|
krh@3
|
484 |
}
|
|
krh@3
|
485 |
|
|
krh@13
|
486 |
if (name == NULL || version == NULL) {
|
|
krh@3
|
487 |
fprintf(stderr, "invalid package tag, "
|
|
krh@3
|
488 |
"missing name or version attributes\n");
|
|
krh@3
|
489 |
return;
|
|
krh@3
|
490 |
}
|
|
krh@3
|
491 |
|
|
krh@13
|
492 |
import_context_add_package(ctx, name, version);
|
|
krh@3
|
493 |
}
|
|
krh@3
|
494 |
|
|
krh@3
|
495 |
static void
|
|
krh@9
|
496 |
parse_property(struct import_context *ctx, const char **atts, void *data)
|
|
krh@8
|
497 |
{
|
|
krh@13
|
498 |
const char *name = NULL, *version = NULL;
|
|
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@13
|
503 |
name = atts[i + 1];
|
|
krh@9
|
504 |
if (strcmp(atts[i], "version") == 0)
|
|
krh@13
|
505 |
version = atts[i + 1];
|
|
krh@8
|
506 |
}
|
|
krh@8
|
507 |
|
|
krh@13
|
508 |
if (name == NULL) {
|
|
krh@9
|
509 |
fprintf(stderr, "invalid tag, missing name attribute\n");
|
|
krh@8
|
510 |
return;
|
|
krh@8
|
511 |
}
|
|
krh@8
|
512 |
|
|
krh@13
|
513 |
import_context_add_property(ctx, data, name, version);
|
|
krh@7
|
514 |
}
|
|
krh@7
|
515 |
|
|
krh@7
|
516 |
static void
|
|
krh@0
|
517 |
start_element(void *data, const char *name, const char **atts)
|
|
krh@0
|
518 |
{
|
|
krh@9
|
519 |
struct import_context *ctx = data;
|
|
krh@0
|
520 |
|
|
krh@3
|
521 |
if (strcmp(name, "package") == 0)
|
|
krh@9
|
522 |
parse_package(ctx, atts, NULL);
|
|
krh@8
|
523 |
else if (strcmp(name, "requires") == 0)
|
|
krh@9
|
524 |
parse_property(ctx, atts, &ctx->requires);
|
|
krh@7
|
525 |
else if (strcmp(name, "provides") == 0)
|
|
krh@9
|
526 |
parse_property(ctx, atts, &ctx->provides);
|
|
krh@0
|
527 |
}
|
|
krh@0
|
528 |
|
|
krh@0
|
529 |
static void
|
|
krh@0
|
530 |
end_element (void *data, const char *name)
|
|
krh@0
|
531 |
{
|
|
krh@9
|
532 |
struct import_context *ctx = data;
|
|
krh@4
|
533 |
|
|
krh@13
|
534 |
if (strcmp(name, "package") == 0)
|
|
krh@13
|
535 |
import_context_finish_package(ctx);
|
|
krh@0
|
536 |
}
|
|
krh@0
|
537 |
|
|
krh@0
|
538 |
static char *
|
|
krh@0
|
539 |
sha1_to_hex(const unsigned char *sha1)
|
|
krh@0
|
540 |
{
|
|
krh@0
|
541 |
static int bufno;
|
|
krh@0
|
542 |
static char hexbuffer[4][50];
|
|
krh@0
|
543 |
static const char hex[] = "0123456789abcdef";
|
|
krh@0
|
544 |
char *buffer = hexbuffer[3 & ++bufno], *buf = buffer;
|
|
krh@0
|
545 |
int i;
|
|
krh@0
|
546 |
|
|
krh@0
|
547 |
for (i = 0; i < 20; i++) {
|
|
krh@0
|
548 |
unsigned int val = *sha1++;
|
|
krh@0
|
549 |
*buf++ = hex[val >> 4];
|
|
krh@0
|
550 |
*buf++ = hex[val & 0xf];
|
|
krh@0
|
551 |
}
|
|
krh@0
|
552 |
*buf = '\0';
|
|
krh@0
|
553 |
|
|
krh@0
|
554 |
return buffer;
|
|
krh@0
|
555 |
}
|
|
krh@0
|
556 |
|
|
krh@9
|
557 |
static void
|
|
krh@13
|
558 |
razor_prepare_import(struct import_context *ctx)
|
|
krh@9
|
559 |
{
|
|
krh@9
|
560 |
memset(ctx, 0, sizeof *ctx);
|
|
krh@13
|
561 |
ctx->set = razor_set_create();
|
|
krh@9
|
562 |
}
|
|
krh@9
|
563 |
|
|
krh@0
|
564 |
static int
|
|
krh@13
|
565 |
razor_import(struct import_context *ctx, const char *filename)
|
|
krh@0
|
566 |
{
|
|
krh@0
|
567 |
SHA_CTX sha1;
|
|
krh@0
|
568 |
XML_Parser parser;
|
|
krh@0
|
569 |
int fd;
|
|
krh@0
|
570 |
void *p;
|
|
krh@0
|
571 |
struct stat stat;
|
|
krh@0
|
572 |
char buf[128];
|
|
krh@0
|
573 |
unsigned char hash[20];
|
|
krh@0
|
574 |
|
|
krh@0
|
575 |
fd = open(filename, O_RDONLY);
|
|
krh@0
|
576 |
if (fstat(fd, &stat) < 0)
|
|
krh@0
|
577 |
return -1;
|
|
krh@0
|
578 |
p = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
|
|
krh@0
|
579 |
if (p == MAP_FAILED)
|
|
krh@0
|
580 |
return -1;
|
|
krh@0
|
581 |
|
|
krh@0
|
582 |
parser = XML_ParserCreate(NULL);
|
|
krh@9
|
583 |
XML_SetUserData(parser, ctx);
|
|
krh@0
|
584 |
XML_SetElementHandler(parser, start_element, end_element);
|
|
krh@0
|
585 |
if (XML_Parse(parser, p, stat.st_size, 1) == XML_STATUS_ERROR) {
|
|
krh@0
|
586 |
fprintf(stderr,
|
|
krh@0
|
587 |
"%s at line %d, %s\n",
|
|
krh@0
|
588 |
XML_ErrorString(XML_GetErrorCode(parser)),
|
|
krh@0
|
589 |
XML_GetCurrentLineNumber(parser),
|
|
krh@0
|
590 |
filename);
|
|
krh@0
|
591 |
return 1;
|
|
krh@0
|
592 |
}
|
|
krh@0
|
593 |
|
|
krh@0
|
594 |
XML_ParserFree(parser);
|
|
krh@0
|
595 |
|
|
krh@0
|
596 |
SHA1_Init(&sha1);
|
|
krh@0
|
597 |
SHA1_Update(&sha1, p, stat.st_size);
|
|
krh@0
|
598 |
SHA1_Final(hash, &sha1);
|
|
krh@0
|
599 |
|
|
krh@0
|
600 |
close(fd);
|
|
krh@0
|
601 |
|
|
krh@0
|
602 |
snprintf(buf, sizeof buf, "set/%s", sha1_to_hex(hash));
|
|
krh@0
|
603 |
if (write_to_file(buf, p, stat.st_size) < 0)
|
|
krh@0
|
604 |
return -1;
|
|
krh@0
|
605 |
munmap(p, stat.st_size);
|
|
krh@0
|
606 |
|
|
krh@0
|
607 |
return 0;
|
|
krh@0
|
608 |
}
|
|
krh@0
|
609 |
|
|
krh@9
|
610 |
static struct razor_set *qsort_set;
|
|
krh@9
|
611 |
|
|
krh@9
|
612 |
static int
|
|
krh@9
|
613 |
compare_packages(const void *p1, const void *p2)
|
|
krh@9
|
614 |
{
|
|
krh@18
|
615 |
const struct import_package *pkg1 = p1, *pkg2 = p2;
|
|
krh@9
|
616 |
char *pool = qsort_set->string_pool.data;
|
|
krh@9
|
617 |
|
|
krh@9
|
618 |
return strcmp(&pool[pkg1->name], &pool[pkg2->name]);
|
|
krh@9
|
619 |
}
|
|
krh@9
|
620 |
|
|
krh@9
|
621 |
static int
|
|
krh@9
|
622 |
compare_properties(const void *p1, const void *p2)
|
|
krh@9
|
623 |
{
|
|
krh@10
|
624 |
const struct import_property *prop1 = p1, *prop2 = p2;
|
|
krh@9
|
625 |
char *pool = qsort_set->string_pool.data;
|
|
krh@12
|
626 |
int result;
|
|
krh@9
|
627 |
|
|
krh@12
|
628 |
result = strcmp(&pool[prop1->name], &pool[prop2->name]);
|
|
krh@12
|
629 |
if (result == 0)
|
|
krh@12
|
630 |
return strcmp(&pool[prop1->version], &pool[prop2->version]);
|
|
krh@12
|
631 |
else
|
|
krh@12
|
632 |
return result;
|
|
krh@9
|
633 |
}
|
|
krh@9
|
634 |
|
|
krh@10
|
635 |
static unsigned long *
|
|
krh@18
|
636 |
uniqueify_properties(struct razor_set *set,
|
|
krh@18
|
637 |
struct array *in, struct array *out)
|
|
krh@9
|
638 |
{
|
|
krh@10
|
639 |
struct import_property *ip, *end;
|
|
krh@18
|
640 |
struct razor_property *rp, *rp_end;
|
|
krh@18
|
641 |
struct array *pkgs, *p;
|
|
krh@18
|
642 |
unsigned long *map, *r;
|
|
krh@18
|
643 |
int i, count, unique;
|
|
krh@9
|
644 |
|
|
krh@10
|
645 |
count = in->size / sizeof(struct import_property);
|
|
krh@10
|
646 |
qsort(in->data, count,
|
|
krh@10
|
647 |
sizeof(struct import_property), compare_properties);
|
|
krh@9
|
648 |
|
|
krh@10
|
649 |
rp = NULL;
|
|
krh@9
|
650 |
end = in->data + in->size;
|
|
krh@10
|
651 |
for (ip = in->data; ip < end; ip++) {
|
|
krh@10
|
652 |
if (rp == NULL ||
|
|
krh@10
|
653 |
ip->name != rp->name || ip->version != rp->version) {
|
|
krh@10
|
654 |
rp = array_add(out, sizeof *rp);
|
|
krh@10
|
655 |
rp->name = ip->name;
|
|
krh@10
|
656 |
rp->version = ip->version;
|
|
krh@10
|
657 |
}
|
|
krh@10
|
658 |
ip->unique_index = rp - (struct razor_property *) out->data;
|
|
krh@10
|
659 |
}
|
|
krh@9
|
660 |
|
|
krh@10
|
661 |
map = malloc(count * sizeof (unsigned long));
|
|
krh@10
|
662 |
ip = in->data;
|
|
krh@10
|
663 |
for (i = 0; i < count; i++)
|
|
krh@10
|
664 |
map[ip[i].index] = ip[i].unique_index;
|
|
krh@10
|
665 |
|
|
krh@18
|
666 |
unique = out->size / sizeof(*rp);
|
|
krh@18
|
667 |
pkgs = zalloc(unique * sizeof *pkgs);
|
|
krh@18
|
668 |
for (ip = in->data; ip < end; ip++) {
|
|
krh@18
|
669 |
r = array_add(&pkgs[ip->unique_index], sizeof *r);
|
|
krh@18
|
670 |
*r = ip->package;
|
|
krh@18
|
671 |
}
|
|
krh@18
|
672 |
|
|
krh@18
|
673 |
rp_end = out->data + out->size;
|
|
krh@18
|
674 |
for (rp = out->data, p = pkgs; rp < rp_end; rp++, p++)
|
|
krh@18
|
675 |
rp->packages = add_to_property_pool(set, p);
|
|
krh@18
|
676 |
|
|
krh@18
|
677 |
free(pkgs);
|
|
krh@18
|
678 |
|
|
krh@10
|
679 |
return map;
|
|
krh@10
|
680 |
}
|
|
krh@10
|
681 |
|
|
krh@10
|
682 |
static void
|
|
krh@18
|
683 |
remap_package_links(struct import_context *ctx)
|
|
krh@10
|
684 |
{
|
|
krh@18
|
685 |
struct import_package *p, *end;
|
|
krh@10
|
686 |
unsigned long *pool, *r;
|
|
krh@10
|
687 |
|
|
krh@10
|
688 |
pool = ctx->set->property_pool.data;
|
|
krh@18
|
689 |
end = ctx->packages.data + ctx->packages.size;
|
|
krh@18
|
690 |
for (p = ctx->packages.data; p < end; p++) {
|
|
krh@18
|
691 |
for (r = &pool[p->requires]; ~*r; r++)
|
|
krh@10
|
692 |
*r = ctx->requires_map[*r];
|
|
krh@18
|
693 |
for (r = &pool[p->provides]; ~*r; r++)
|
|
krh@10
|
694 |
*r = ctx->provides_map[*r];
|
|
krh@9
|
695 |
}
|
|
krh@18
|
696 |
}
|
|
krh@10
|
697 |
|
|
krh@18
|
698 |
static void
|
|
krh@18
|
699 |
remap_property_links(struct import_context *ctx)
|
|
krh@18
|
700 |
{
|
|
krh@18
|
701 |
struct razor_property *p, *end;
|
|
krh@18
|
702 |
struct import_package *ip;
|
|
krh@18
|
703 |
unsigned long *map, *pool, *r;
|
|
krh@18
|
704 |
int i, count;
|
|
krh@18
|
705 |
|
|
krh@18
|
706 |
pool = ctx->set->property_pool.data;
|
|
krh@18
|
707 |
count = ctx->packages.size / sizeof(struct import_package);
|
|
krh@18
|
708 |
map = malloc(count * sizeof *map);
|
|
krh@18
|
709 |
ip = ctx->packages.data;
|
|
krh@18
|
710 |
for (i = 0; i < count; i++)
|
|
krh@18
|
711 |
map[ip[i].index] = i;
|
|
krh@18
|
712 |
|
|
krh@18
|
713 |
/* FIXME: This will break if we implement package list sharing
|
|
krh@18
|
714 |
* for all properties, since we'll remap those lists more than
|
|
krh@18
|
715 |
* once. We should just have a separate pool for property
|
|
krh@18
|
716 |
* lists and a separate pool for package lists and remap it as
|
|
krh@18
|
717 |
* a flat pool. Right now, as property lists and package
|
|
krh@18
|
718 |
* lists are mixed, we can't do that. */
|
|
krh@18
|
719 |
|
|
krh@18
|
720 |
end = ctx->set->requires.data + ctx->set->requires.size;
|
|
krh@18
|
721 |
for (p = ctx->set->requires.data; p < end; p++)
|
|
krh@18
|
722 |
for (r = &pool[p->packages]; ~*r; r++)
|
|
krh@18
|
723 |
*r = map[*r];
|
|
krh@18
|
724 |
|
|
krh@18
|
725 |
end = ctx->set->provides.data + ctx->set->provides.size;
|
|
krh@18
|
726 |
for (p = ctx->set->provides.data; p < end; p++)
|
|
krh@18
|
727 |
for (r = &pool[p->packages]; ~*r; r++)
|
|
krh@18
|
728 |
*r = map[*r];
|
|
krh@18
|
729 |
|
|
krh@18
|
730 |
free(map);
|
|
krh@9
|
731 |
}
|
|
krh@9
|
732 |
|
|
krh@13
|
733 |
static struct razor_set *
|
|
krh@13
|
734 |
razor_finish_import(struct import_context *ctx)
|
|
krh@9
|
735 |
{
|
|
krh@18
|
736 |
struct import_package *ip;
|
|
krh@18
|
737 |
struct razor_package *rp;
|
|
krh@18
|
738 |
int i, count;
|
|
krh@18
|
739 |
|
|
krh@9
|
740 |
qsort_set = ctx->set;
|
|
krh@9
|
741 |
|
|
krh@10
|
742 |
ctx->requires_map =
|
|
krh@18
|
743 |
uniqueify_properties(ctx->set,
|
|
krh@18
|
744 |
&ctx->requires.all,
|
|
krh@18
|
745 |
&ctx->set->requires);
|
|
krh@10
|
746 |
ctx->provides_map =
|
|
krh@18
|
747 |
uniqueify_properties(ctx->set,
|
|
krh@18
|
748 |
&ctx->provides.all,
|
|
krh@18
|
749 |
&ctx->set->provides);
|
|
krh@9
|
750 |
|
|
krh@18
|
751 |
remap_package_links(ctx);
|
|
krh@18
|
752 |
|
|
krh@18
|
753 |
count = ctx->packages.size / sizeof(struct import_package);
|
|
krh@18
|
754 |
qsort(ctx->packages.data, count,
|
|
krh@18
|
755 |
sizeof(struct import_package), compare_packages);
|
|
krh@18
|
756 |
|
|
krh@18
|
757 |
ip = ctx->packages.data;
|
|
krh@18
|
758 |
for (i = 0; i < count; i++, ip++, rp++) {
|
|
krh@18
|
759 |
rp = array_add(&ctx->set->packages, sizeof *rp);
|
|
krh@18
|
760 |
rp->name = ip->name;
|
|
krh@18
|
761 |
rp->version = ip->version;
|
|
krh@18
|
762 |
rp->requires = ip->requires;
|
|
krh@18
|
763 |
rp->provides = ip->provides;
|
|
krh@18
|
764 |
}
|
|
krh@18
|
765 |
|
|
krh@18
|
766 |
remap_property_links(ctx);
|
|
krh@10
|
767 |
|
|
krh@10
|
768 |
free(ctx->requires.all.data);
|
|
krh@10
|
769 |
free(ctx->provides.all.data);
|
|
krh@10
|
770 |
free(ctx->requires_map);
|
|
krh@10
|
771 |
free(ctx->provides_map);
|
|
krh@13
|
772 |
|
|
krh@9
|
773 |
fprintf(stderr, "parsed %d requires, %d unique\n",
|
|
krh@10
|
774 |
ctx->requires.all.size / sizeof(struct import_property),
|
|
krh@9
|
775 |
ctx->set->requires.size / sizeof(struct razor_property));
|
|
krh@9
|
776 |
fprintf(stderr, "parsed %d provides, %d unique\n",
|
|
krh@10
|
777 |
ctx->provides.all.size / sizeof(struct import_property),
|
|
krh@9
|
778 |
ctx->set->provides.size / sizeof(struct razor_property));
|
|
krh@13
|
779 |
|
|
krh@13
|
780 |
return ctx->set;
|
|
krh@9
|
781 |
}
|
|
krh@9
|
782 |
|
|
krh@15
|
783 |
/* Import a yum filelist as a razor package set. */
|
|
krh@15
|
784 |
|
|
krh@15
|
785 |
enum {
|
|
krh@15
|
786 |
YUM_STATE_BEGIN,
|
|
krh@15
|
787 |
YUM_STATE_PACKAGE_NAME
|
|
krh@15
|
788 |
};
|
|
krh@15
|
789 |
|
|
krh@15
|
790 |
struct yum_context {
|
|
krh@15
|
791 |
struct import_context ctx;
|
|
krh@15
|
792 |
struct import_property_context *current_property_context;
|
|
krh@15
|
793 |
char *name;
|
|
krh@15
|
794 |
int state;
|
|
krh@15
|
795 |
};
|
|
krh@15
|
796 |
|
|
krh@15
|
797 |
static void
|
|
krh@15
|
798 |
yum_start_element(void *data, const char *name, const char **atts)
|
|
krh@15
|
799 |
{
|
|
krh@15
|
800 |
struct yum_context *ctx = data;
|
|
krh@15
|
801 |
const char *n, *version;
|
|
krh@15
|
802 |
int i;
|
|
krh@15
|
803 |
|
|
krh@15
|
804 |
if (strcmp(name, "name") == 0) {
|
|
krh@15
|
805 |
ctx->state = YUM_STATE_PACKAGE_NAME;
|
|
krh@15
|
806 |
} else if (strcmp(name, "version") == 0) {
|
|
krh@15
|
807 |
for (i = 0; atts[i]; i += 2) {
|
|
krh@15
|
808 |
if (strcmp(atts[i], "ver") == 0)
|
|
krh@15
|
809 |
version = atts[i + 1];
|
|
krh@15
|
810 |
}
|
|
krh@15
|
811 |
import_context_add_package(&ctx->ctx, ctx->name, version);
|
|
krh@15
|
812 |
} else if (strcmp(name, "rpm:requires") == 0) {
|
|
krh@15
|
813 |
ctx->current_property_context = &ctx->ctx.requires;
|
|
krh@15
|
814 |
} else if (strcmp(name, "rpm:provides") == 0) {
|
|
krh@15
|
815 |
ctx->current_property_context = &ctx->ctx.provides;
|
|
krh@15
|
816 |
} else if (strcmp(name, "rpm:entry") == 0 &&
|
|
krh@15
|
817 |
ctx->current_property_context != NULL) {
|
|
krh@15
|
818 |
n = NULL;
|
|
krh@15
|
819 |
version = NULL;
|
|
krh@15
|
820 |
for (i = 0; atts[i]; i += 2) {
|
|
krh@15
|
821 |
if (strcmp(atts[i], "name") == 0)
|
|
krh@15
|
822 |
n = atts[i + 1];
|
|
krh@15
|
823 |
else if (strcmp(atts[i], "ver") == 0)
|
|
krh@15
|
824 |
version = atts[i + 1];
|
|
krh@15
|
825 |
}
|
|
krh@15
|
826 |
|
|
krh@15
|
827 |
if (n == NULL) {
|
|
krh@15
|
828 |
fprintf(stderr, "invalid rpm:entry, "
|
|
krh@15
|
829 |
"missing name or version attributes\n");
|
|
krh@15
|
830 |
return;
|
|
krh@15
|
831 |
}
|
|
krh@15
|
832 |
|
|
krh@15
|
833 |
import_context_add_property(&ctx->ctx,
|
|
krh@15
|
834 |
ctx->current_property_context,
|
|
krh@15
|
835 |
n, version);
|
|
krh@15
|
836 |
}
|
|
krh@15
|
837 |
}
|
|
krh@15
|
838 |
|
|
krh@15
|
839 |
static void
|
|
krh@15
|
840 |
yum_end_element (void *data, const char *name)
|
|
krh@15
|
841 |
{
|
|
krh@15
|
842 |
struct yum_context *ctx = data;
|
|
krh@15
|
843 |
|
|
krh@15
|
844 |
if (strcmp(name, "package") == 0) {
|
|
krh@15
|
845 |
free(ctx->name);
|
|
krh@15
|
846 |
import_context_finish_package(&ctx->ctx);
|
|
krh@15
|
847 |
} else if (strcmp(name, "name") == 0) {
|
|
krh@15
|
848 |
ctx->state = 0;
|
|
krh@15
|
849 |
} else if (strcmp(name, "rpm:requires") == 0) {
|
|
krh@15
|
850 |
ctx->current_property_context = NULL;
|
|
krh@15
|
851 |
} else if (strcmp(name, "rpm:provides") == 0) {
|
|
krh@15
|
852 |
ctx->current_property_context = NULL;
|
|
krh@15
|
853 |
}
|
|
krh@15
|
854 |
}
|
|
krh@15
|
855 |
|
|
krh@15
|
856 |
static void
|
|
krh@15
|
857 |
yum_character_data (void *data, const XML_Char *s, int len)
|
|
krh@15
|
858 |
{
|
|
krh@15
|
859 |
struct yum_context *ctx = data;
|
|
krh@15
|
860 |
|
|
krh@15
|
861 |
if (ctx->state == YUM_STATE_PACKAGE_NAME)
|
|
krh@15
|
862 |
ctx->name = strndup(s, len);
|
|
krh@15
|
863 |
}
|
|
krh@15
|
864 |
|
|
krh@15
|
865 |
static struct razor_set *
|
|
krh@15
|
866 |
razor_set_create_from_yum_filelist(int fd)
|
|
krh@15
|
867 |
{
|
|
krh@15
|
868 |
struct yum_context ctx;
|
|
krh@15
|
869 |
XML_Parser parser;
|
|
krh@15
|
870 |
char buf[4096];
|
|
krh@15
|
871 |
int len;
|
|
krh@15
|
872 |
|
|
krh@15
|
873 |
razor_prepare_import(&ctx.ctx);
|
|
krh@15
|
874 |
|
|
krh@15
|
875 |
parser = XML_ParserCreate(NULL);
|
|
krh@15
|
876 |
XML_SetUserData(parser, &ctx);
|
|
krh@15
|
877 |
XML_SetElementHandler(parser, yum_start_element, yum_end_element);
|
|
krh@15
|
878 |
XML_SetCharacterDataHandler(parser, yum_character_data);
|
|
krh@15
|
879 |
|
|
krh@15
|
880 |
while (1) {
|
|
krh@15
|
881 |
len = read(fd, buf, sizeof buf);
|
|
krh@15
|
882 |
if (len < 0) {
|
|
krh@15
|
883 |
fprintf(stderr,
|
|
krh@15
|
884 |
"couldn't read input: %s\n", strerror(errno));
|
|
krh@15
|
885 |
return NULL;
|
|
krh@15
|
886 |
} else if (len == 0)
|
|
krh@15
|
887 |
break;
|
|
krh@15
|
888 |
|
|
krh@15
|
889 |
if (XML_Parse(parser, buf, len, 0) == XML_STATUS_ERROR) {
|
|
krh@15
|
890 |
fprintf(stderr,
|
|
krh@15
|
891 |
"%s at line %d\n",
|
|
krh@15
|
892 |
XML_ErrorString(XML_GetErrorCode(parser)),
|
|
krh@15
|
893 |
XML_GetCurrentLineNumber(parser));
|
|
krh@15
|
894 |
return NULL;
|
|
krh@15
|
895 |
}
|
|
krh@15
|
896 |
}
|
|
krh@15
|
897 |
|
|
krh@15
|
898 |
XML_ParserFree(parser);
|
|
krh@15
|
899 |
|
|
krh@15
|
900 |
return razor_finish_import(&ctx.ctx);
|
|
krh@15
|
901 |
}
|
|
krh@15
|
902 |
|
|
krh@0
|
903 |
void
|
|
krh@4
|
904 |
razor_set_list(struct razor_set *set)
|
|
krh@3
|
905 |
{
|
|
krh@6
|
906 |
struct razor_package *p, *end;
|
|
krh@6
|
907 |
char *pool;
|
|
krh@3
|
908 |
|
|
krh@6
|
909 |
pool = set->string_pool.data;
|
|
krh@6
|
910 |
end = set->packages.data + set->packages.size;
|
|
krh@14
|
911 |
for (p = set->packages.data; p < end; p++)
|
|
krh@6
|
912 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@3
|
913 |
}
|
|
krh@3
|
914 |
|
|
krh@16
|
915 |
struct razor_set *bsearch_set;
|
|
krh@16
|
916 |
|
|
krh@16
|
917 |
static int
|
|
krh@16
|
918 |
compare_package_name(const void *key, const void *data)
|
|
krh@16
|
919 |
{
|
|
krh@16
|
920 |
const struct razor_package *p = data;
|
|
krh@16
|
921 |
char *pool;
|
|
krh@16
|
922 |
|
|
krh@16
|
923 |
pool = bsearch_set->string_pool.data;
|
|
krh@16
|
924 |
|
|
krh@16
|
925 |
return strcmp(key, &pool[p->name]);
|
|
krh@16
|
926 |
}
|
|
krh@16
|
927 |
|
|
krh@10
|
928 |
struct razor_package *
|
|
krh@10
|
929 |
razor_set_get_package(struct razor_set *set, const char *package)
|
|
krh@10
|
930 |
{
|
|
krh@16
|
931 |
bsearch_set = set;
|
|
krh@16
|
932 |
return bsearch(package, set->packages.data,
|
|
krh@16
|
933 |
set->packages.size / sizeof(struct razor_package),
|
|
krh@16
|
934 |
sizeof(struct razor_package), compare_package_name);
|
|
krh@10
|
935 |
}
|
|
krh@10
|
936 |
|
|
krh@18
|
937 |
static int
|
|
krh@18
|
938 |
compare_property_name(const void *key, const void *data)
|
|
krh@18
|
939 |
{
|
|
krh@18
|
940 |
const struct razor_property *p = data;
|
|
krh@18
|
941 |
char *pool;
|
|
krh@18
|
942 |
|
|
krh@18
|
943 |
pool = bsearch_set->string_pool.data;
|
|
krh@18
|
944 |
|
|
krh@18
|
945 |
return strcmp(key, &pool[p->name]);
|
|
krh@18
|
946 |
}
|
|
krh@18
|
947 |
|
|
krh@18
|
948 |
struct razor_property *
|
|
krh@18
|
949 |
razor_set_get_property(struct razor_set *set,
|
|
krh@18
|
950 |
struct array *properties,
|
|
krh@18
|
951 |
const char *property)
|
|
krh@18
|
952 |
{
|
|
krh@18
|
953 |
struct razor_property *p, *start;
|
|
krh@18
|
954 |
|
|
krh@18
|
955 |
bsearch_set = set;
|
|
krh@18
|
956 |
p = bsearch(property, properties->data,
|
|
krh@18
|
957 |
properties->size / sizeof(struct razor_property),
|
|
krh@18
|
958 |
sizeof(struct razor_property), compare_property_name);
|
|
krh@18
|
959 |
|
|
krh@18
|
960 |
start = properties->data;
|
|
krh@18
|
961 |
while (p > start && (p - 1)->name == p->name)
|
|
krh@18
|
962 |
p--;
|
|
krh@18
|
963 |
|
|
krh@18
|
964 |
return p;
|
|
krh@18
|
965 |
}
|
|
krh@18
|
966 |
|
|
krh@10
|
967 |
static void
|
|
krh@10
|
968 |
razor_set_list_all_properties(struct razor_set *set, struct array *properties)
|
|
krh@8
|
969 |
{
|
|
krh@8
|
970 |
struct razor_property *p, *end;
|
|
krh@8
|
971 |
char *pool;
|
|
krh@8
|
972 |
|
|
krh@8
|
973 |
pool = set->string_pool.data;
|
|
krh@10
|
974 |
end = properties->data + properties->size;
|
|
krh@14
|
975 |
for (p = properties->data; p < end; p++)
|
|
krh@8
|
976 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@8
|
977 |
}
|
|
krh@8
|
978 |
|
|
krh@8
|
979 |
void
|
|
krh@10
|
980 |
razor_set_list_requires(struct razor_set *set, const char *name)
|
|
krh@7
|
981 |
{
|
|
krh@10
|
982 |
struct razor_property *p, *requires;
|
|
krh@10
|
983 |
struct razor_package *package;
|
|
krh@10
|
984 |
unsigned long *r;
|
|
krh@7
|
985 |
char *pool;
|
|
krh@7
|
986 |
|
|
krh@10
|
987 |
if (name) {
|
|
krh@10
|
988 |
package = razor_set_get_package(set, name);
|
|
krh@10
|
989 |
r = (unsigned long *) set->property_pool.data +
|
|
krh@10
|
990 |
package->requires;
|
|
krh@10
|
991 |
requires = set->requires.data;
|
|
krh@10
|
992 |
pool = set->string_pool.data;
|
|
krh@18
|
993 |
while (~*r) {
|
|
krh@10
|
994 |
p = &requires[*r++];
|
|
krh@10
|
995 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@10
|
996 |
}
|
|
krh@10
|
997 |
} else
|
|
krh@10
|
998 |
razor_set_list_all_properties(set, &set->requires);
|
|
krh@10
|
999 |
}
|
|
krh@10
|
1000 |
|
|
krh@10
|
1001 |
void
|
|
krh@10
|
1002 |
razor_set_list_provides(struct razor_set *set, const char *name)
|
|
krh@10
|
1003 |
{
|
|
krh@10
|
1004 |
struct razor_property *p, *provides;
|
|
krh@10
|
1005 |
struct razor_package *package;
|
|
krh@10
|
1006 |
unsigned long *r;
|
|
krh@10
|
1007 |
char *pool;
|
|
krh@10
|
1008 |
|
|
krh@10
|
1009 |
if (name) {
|
|
krh@10
|
1010 |
package = razor_set_get_package(set, name);
|
|
krh@10
|
1011 |
r = (unsigned long *) set->property_pool.data +
|
|
krh@10
|
1012 |
package->provides;
|
|
krh@10
|
1013 |
provides = set->provides.data;
|
|
krh@10
|
1014 |
pool = set->string_pool.data;
|
|
krh@18
|
1015 |
while (~*r) {
|
|
krh@10
|
1016 |
p = &provides[*r++];
|
|
krh@10
|
1017 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@10
|
1018 |
}
|
|
krh@10
|
1019 |
} else
|
|
krh@10
|
1020 |
razor_set_list_all_properties(set, &set->provides);
|
|
krh@7
|
1021 |
}
|
|
krh@7
|
1022 |
|
|
krh@7
|
1023 |
void
|
|
krh@18
|
1024 |
razor_set_list_property_packages(struct razor_set *set,
|
|
krh@18
|
1025 |
struct array *properties,
|
|
krh@18
|
1026 |
const char *name)
|
|
krh@18
|
1027 |
{
|
|
krh@18
|
1028 |
struct razor_property *property, *end;
|
|
krh@18
|
1029 |
struct razor_package *p, *packages;
|
|
krh@18
|
1030 |
unsigned long *r;
|
|
krh@18
|
1031 |
char *pool;
|
|
krh@18
|
1032 |
|
|
krh@18
|
1033 |
if (name == NULL)
|
|
krh@18
|
1034 |
return;
|
|
krh@18
|
1035 |
|
|
krh@18
|
1036 |
property = razor_set_get_property(set, properties, name);
|
|
krh@18
|
1037 |
packages = set->packages.data;
|
|
krh@18
|
1038 |
pool = set->string_pool.data;
|
|
krh@18
|
1039 |
end = properties->data + properties->size;
|
|
krh@18
|
1040 |
while (property < end && strcmp(name, &pool[property->name]) == 0) {
|
|
krh@18
|
1041 |
r = (unsigned long *)
|
|
krh@18
|
1042 |
set->property_pool.data + property->packages;
|
|
krh@18
|
1043 |
while (~*r) {
|
|
krh@18
|
1044 |
p = &packages[*r++];
|
|
krh@18
|
1045 |
printf("%s %s\n",
|
|
krh@18
|
1046 |
&pool[p->name], &pool[p->version]);
|
|
krh@18
|
1047 |
}
|
|
krh@18
|
1048 |
property++;
|
|
krh@18
|
1049 |
}
|
|
krh@18
|
1050 |
}
|
|
krh@18
|
1051 |
|
|
krh@18
|
1052 |
void
|
|
krh@4
|
1053 |
razor_set_info(struct razor_set *set)
|
|
krh@3
|
1054 |
{
|
|
krh@3
|
1055 |
unsigned int offset, size;
|
|
krh@3
|
1056 |
int i;
|
|
krh@3
|
1057 |
|
|
krh@4
|
1058 |
for (i = 0; i < set->header->sections[i].type; i++) {
|
|
krh@4
|
1059 |
offset = set->header->sections[i].offset;
|
|
krh@18
|
1060 |
size = set->header->sections[i].size;
|
|
krh@3
|
1061 |
|
|
krh@4
|
1062 |
switch (set->header->sections[i].type) {
|
|
krh@4
|
1063 |
case RAZOR_STRINGS:
|
|
krh@3
|
1064 |
printf("string pool:\t\t%dkb\n", size / 1024);
|
|
krh@3
|
1065 |
break;
|
|
krh@4
|
1066 |
case RAZOR_PACKAGES:
|
|
krh@3
|
1067 |
printf("package section:\t%dkb\n", size / 1024);
|
|
krh@3
|
1068 |
break;
|
|
krh@8
|
1069 |
case RAZOR_REQUIRES:
|
|
krh@8
|
1070 |
printf("requires section:\t%dkb\n", size / 1024);
|
|
krh@8
|
1071 |
break;
|
|
krh@7
|
1072 |
case RAZOR_PROVIDES:
|
|
krh@7
|
1073 |
printf("provides section:\t%dkb\n", size / 1024);
|
|
krh@7
|
1074 |
break;
|
|
krh@18
|
1075 |
case RAZOR_PROPERTIES:
|
|
krh@18
|
1076 |
printf("properties section:\t%dkb\n", size / 1024);
|
|
krh@18
|
1077 |
break;
|
|
krh@3
|
1078 |
}
|
|
krh@3
|
1079 |
}
|
|
krh@0
|
1080 |
}
|
|
krh@0
|
1081 |
|
|
krh@0
|
1082 |
static int
|
|
krh@0
|
1083 |
usage(void)
|
|
krh@0
|
1084 |
{
|
|
krh@7
|
1085 |
printf("usage: razor [ import FILES | lookup <key> | "
|
|
krh@15
|
1086 |
"list | list-requires | list-provides | eat-yum | info ]\n");
|
|
krh@0
|
1087 |
exit(1);
|
|
krh@0
|
1088 |
}
|
|
krh@0
|
1089 |
|
|
krh@15
|
1090 |
static const char *repo_filename = "system.repo";
|
|
krh@15
|
1091 |
static const char rawhide_repo_filename[] = "rawhide.repo";
|
|
krh@0
|
1092 |
|
|
krh@0
|
1093 |
int
|
|
krh@0
|
1094 |
main(int argc, char *argv[])
|
|
krh@0
|
1095 |
{
|
|
krh@0
|
1096 |
int i;
|
|
krh@4
|
1097 |
struct razor_set *set;
|
|
krh@0
|
1098 |
struct stat statbuf;
|
|
krh@9
|
1099 |
struct import_context ctx;
|
|
krh@15
|
1100 |
char *repo;
|
|
krh@15
|
1101 |
|
|
krh@15
|
1102 |
repo = getenv("RAZOR_REPO");
|
|
krh@15
|
1103 |
if (repo != NULL)
|
|
krh@15
|
1104 |
repo_filename = repo;
|
|
krh@0
|
1105 |
|
|
krh@3
|
1106 |
if (argc < 2) {
|
|
krh@0
|
1107 |
usage();
|
|
krh@0
|
1108 |
} else if (strcmp(argv[1], "import") == 0) {
|
|
krh@0
|
1109 |
if (stat("set", &statbuf) && mkdir("set", 0777)) {
|
|
krh@0
|
1110 |
fprintf(stderr, "could not create directory 'set'\n");
|
|
krh@0
|
1111 |
exit(-1);
|
|
krh@0
|
1112 |
}
|
|
krh@0
|
1113 |
|
|
krh@13
|
1114 |
razor_prepare_import(&ctx);
|
|
krh@9
|
1115 |
|
|
krh@0
|
1116 |
for (i = 2; i < argc; i++) {
|
|
krh@13
|
1117 |
if (razor_import(&ctx, argv[i]) < 0) {
|
|
krh@0
|
1118 |
fprintf(stderr, "failed to import %s\n",
|
|
krh@0
|
1119 |
argv[i]);
|
|
krh@0
|
1120 |
exit(-1);
|
|
krh@0
|
1121 |
}
|
|
krh@0
|
1122 |
}
|
|
krh@0
|
1123 |
|
|
krh@13
|
1124 |
set = razor_finish_import(&ctx);
|
|
krh@6
|
1125 |
|
|
krh@6
|
1126 |
printf("bucket allocation: %d\n", set->buckets.alloc);
|
|
krh@6
|
1127 |
printf("pool size: %d\n", set->string_pool.size);
|
|
krh@6
|
1128 |
printf("pool allocation: %d\n", set->string_pool.alloc);
|
|
krh@7
|
1129 |
printf("packages: %d\n",
|
|
krh@7
|
1130 |
set->packages.size / sizeof(struct razor_package));
|
|
krh@8
|
1131 |
printf("requires: %d\n",
|
|
krh@8
|
1132 |
set->requires.size / sizeof(struct razor_property));
|
|
krh@7
|
1133 |
printf("provides: %d\n",
|
|
krh@8
|
1134 |
set->provides.size / sizeof(struct razor_property));
|
|
krh@0
|
1135 |
|
|
krh@4
|
1136 |
razor_set_write(set, repo_filename);
|
|
krh@0
|
1137 |
|
|
krh@4
|
1138 |
razor_set_destroy(set);
|
|
krh@0
|
1139 |
} else if (strcmp(argv[1], "lookup") == 0) {
|
|
krh@4
|
1140 |
set = razor_set_open(repo_filename);
|
|
krh@0
|
1141 |
printf("%s is %lu\n", argv[2],
|
|
krh@4
|
1142 |
razor_set_lookup(set, argv[2]));
|
|
krh@4
|
1143 |
razor_set_destroy(set);
|
|
krh@3
|
1144 |
} else if (strcmp(argv[1], "list") == 0) {
|
|
krh@4
|
1145 |
set = razor_set_open(repo_filename);
|
|
krh@4
|
1146 |
razor_set_list(set);
|
|
krh@4
|
1147 |
razor_set_destroy(set);
|
|
krh@8
|
1148 |
} else if (strcmp(argv[1], "list-requires") == 0) {
|
|
krh@8
|
1149 |
set = razor_set_open(repo_filename);
|
|
krh@10
|
1150 |
razor_set_list_requires(set, argv[2]);
|
|
krh@8
|
1151 |
razor_set_destroy(set);
|
|
krh@7
|
1152 |
} else if (strcmp(argv[1], "list-provides") == 0) {
|
|
krh@7
|
1153 |
set = razor_set_open(repo_filename);
|
|
krh@10
|
1154 |
razor_set_list_provides(set, argv[2]);
|
|
krh@7
|
1155 |
razor_set_destroy(set);
|
|
krh@18
|
1156 |
} else if (strcmp(argv[1], "what-requires") == 0) {
|
|
krh@18
|
1157 |
set = razor_set_open(repo_filename);
|
|
krh@18
|
1158 |
razor_set_list_property_packages(set, &set->requires, argv[2]);
|
|
krh@18
|
1159 |
razor_set_destroy(set);
|
|
krh@18
|
1160 |
} else if (strcmp(argv[1], "what-provides") == 0) {
|
|
krh@18
|
1161 |
set = razor_set_open(repo_filename);
|
|
krh@18
|
1162 |
razor_set_list_property_packages(set, &set->provides, argv[2]);
|
|
krh@18
|
1163 |
razor_set_destroy(set);
|
|
krh@3
|
1164 |
} else if (strcmp(argv[1], "info") == 0) {
|
|
krh@4
|
1165 |
set = razor_set_open(repo_filename);
|
|
krh@4
|
1166 |
razor_set_info(set);
|
|
krh@4
|
1167 |
razor_set_destroy(set);
|
|
krh@15
|
1168 |
} else if (strcmp(argv[1], "eat-yum") == 0) {
|
|
krh@15
|
1169 |
set = razor_set_create_from_yum_filelist(STDIN_FILENO);
|
|
krh@15
|
1170 |
if (set == NULL)
|
|
krh@15
|
1171 |
return 1;
|
|
krh@15
|
1172 |
razor_set_write(set, rawhide_repo_filename);
|
|
krh@15
|
1173 |
razor_set_destroy(set);
|
|
krh@18
|
1174 |
printf("wrote %s\n", rawhide_repo_filename);
|
|
krh@0
|
1175 |
} else {
|
|
krh@0
|
1176 |
usage();
|
|
krh@0
|
1177 |
}
|
|
krh@0
|
1178 |
|
|
krh@0
|
1179 |
return 0;
|
|
krh@0
|
1180 |
}
|