|
krh@15
|
1 |
#define _GNU_SOURCE
|
|
krh@15
|
2 |
|
|
krh@0
|
3 |
#include <stdlib.h>
|
|
krh@19
|
4 |
#include <stddef.h>
|
|
krh@0
|
5 |
#include <stdio.h>
|
|
krh@0
|
6 |
#include <string.h>
|
|
krh@0
|
7 |
#include <sys/types.h>
|
|
krh@0
|
8 |
#include <sys/stat.h>
|
|
krh@0
|
9 |
#include <sys/mman.h>
|
|
krh@0
|
10 |
#include <unistd.h>
|
|
krh@0
|
11 |
#include <fcntl.h>
|
|
krh@15
|
12 |
#include <errno.h>
|
|
krh@0
|
13 |
|
|
krh@27
|
14 |
#include "razor.h"
|
|
krh@6
|
15 |
|
|
krh@13
|
16 |
static void
|
|
krh@13
|
17 |
array_init(struct array *array)
|
|
krh@13
|
18 |
{
|
|
krh@13
|
19 |
memset(array, 0, sizeof *array);
|
|
krh@13
|
20 |
}
|
|
krh@13
|
21 |
|
|
krh@13
|
22 |
static void
|
|
krh@13
|
23 |
array_release(struct array *array)
|
|
krh@13
|
24 |
{
|
|
krh@13
|
25 |
free(array->data);
|
|
krh@13
|
26 |
}
|
|
krh@13
|
27 |
|
|
krh@6
|
28 |
static void *
|
|
krh@6
|
29 |
array_add(struct array *array, int size)
|
|
krh@6
|
30 |
{
|
|
krh@6
|
31 |
int alloc;
|
|
krh@6
|
32 |
void *data, *p;
|
|
krh@6
|
33 |
|
|
krh@6
|
34 |
if (array->alloc > 0)
|
|
krh@6
|
35 |
alloc = array->alloc;
|
|
krh@6
|
36 |
else
|
|
krh@10
|
37 |
alloc = 16;
|
|
krh@6
|
38 |
|
|
krh@6
|
39 |
while (alloc < array->size + size)
|
|
krh@6
|
40 |
alloc *= 2;
|
|
krh@6
|
41 |
|
|
krh@6
|
42 |
if (array->alloc < alloc) {
|
|
krh@6
|
43 |
data = realloc(array->data, alloc);
|
|
krh@6
|
44 |
if (data == NULL)
|
|
krh@6
|
45 |
return 0;
|
|
krh@6
|
46 |
array->data = data;
|
|
krh@6
|
47 |
array->alloc = alloc;
|
|
krh@6
|
48 |
}
|
|
krh@6
|
49 |
|
|
krh@6
|
50 |
p = array->data + array->size;
|
|
krh@6
|
51 |
array->size += size;
|
|
krh@6
|
52 |
|
|
krh@6
|
53 |
return p;
|
|
krh@6
|
54 |
}
|
|
krh@6
|
55 |
|
|
krh@0
|
56 |
static int
|
|
krh@0
|
57 |
write_to_fd(int fd, void *p, size_t size)
|
|
krh@0
|
58 |
{
|
|
krh@0
|
59 |
int rest, len;
|
|
krh@0
|
60 |
|
|
krh@0
|
61 |
rest = size;
|
|
krh@0
|
62 |
while (rest > 0) {
|
|
krh@0
|
63 |
len = write(fd, p, rest);
|
|
krh@0
|
64 |
if (len < 0)
|
|
krh@0
|
65 |
return -1;
|
|
krh@0
|
66 |
rest -= len;
|
|
krh@0
|
67 |
}
|
|
krh@0
|
68 |
|
|
krh@0
|
69 |
return 0;
|
|
krh@0
|
70 |
}
|
|
krh@0
|
71 |
|
|
krh@0
|
72 |
static void *
|
|
krh@0
|
73 |
zalloc(size_t size)
|
|
krh@0
|
74 |
{
|
|
krh@0
|
75 |
void *p;
|
|
krh@0
|
76 |
|
|
krh@0
|
77 |
p = malloc(size);
|
|
krh@0
|
78 |
memset(p, 0, size);
|
|
krh@0
|
79 |
|
|
krh@0
|
80 |
return p;
|
|
krh@0
|
81 |
}
|
|
krh@0
|
82 |
|
|
krh@19
|
83 |
struct razor_set_section razor_sections[] = {
|
|
krh@19
|
84 |
{ RAZOR_PACKAGES, offsetof(struct razor_set, packages) },
|
|
krh@19
|
85 |
{ RAZOR_REQUIRES, offsetof(struct razor_set, requires) },
|
|
krh@19
|
86 |
{ RAZOR_PROVIDES, offsetof(struct razor_set, provides) },
|
|
krh@19
|
87 |
{ RAZOR_STRING_POOL, offsetof(struct razor_set, string_pool) },
|
|
krh@19
|
88 |
{ RAZOR_PROPERTY_POOL, offsetof(struct razor_set, property_pool) },
|
|
krh@19
|
89 |
};
|
|
krh@19
|
90 |
|
|
krh@4
|
91 |
struct razor_set *
|
|
krh@4
|
92 |
razor_set_create(void)
|
|
krh@0
|
93 |
{
|
|
krh@18
|
94 |
return zalloc(sizeof(struct razor_set));
|
|
krh@0
|
95 |
}
|
|
krh@0
|
96 |
|
|
krh@4
|
97 |
struct razor_set *
|
|
krh@4
|
98 |
razor_set_open(const char *filename)
|
|
krh@0
|
99 |
{
|
|
krh@4
|
100 |
struct razor_set *set;
|
|
krh@19
|
101 |
struct razor_set_section *s;
|
|
krh@0
|
102 |
struct stat stat;
|
|
krh@19
|
103 |
struct array *array;
|
|
krh@19
|
104 |
int fd;
|
|
krh@0
|
105 |
|
|
krh@4
|
106 |
set = zalloc(sizeof *set);
|
|
krh@0
|
107 |
fd = open(filename, O_RDONLY);
|
|
krh@0
|
108 |
if (fstat(fd, &stat) < 0)
|
|
krh@0
|
109 |
return NULL;
|
|
krh@4
|
110 |
set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
|
|
krh@4
|
111 |
if (set->header == MAP_FAILED) {
|
|
krh@4
|
112 |
free(set);
|
|
krh@0
|
113 |
return NULL;
|
|
krh@0
|
114 |
}
|
|
krh@0
|
115 |
|
|
krh@19
|
116 |
for (s = set->header->sections; ~s->type; s++) {
|
|
krh@19
|
117 |
if (s->type >= ARRAY_SIZE(razor_sections))
|
|
krh@19
|
118 |
continue;
|
|
krh@19
|
119 |
if (s->type != razor_sections[s->type].type)
|
|
krh@19
|
120 |
continue;
|
|
krh@19
|
121 |
array = (void *) set + razor_sections[s->type].offset;
|
|
krh@19
|
122 |
array->data = (void *) set->header + s->offset;
|
|
krh@19
|
123 |
array->size = s->size;
|
|
krh@19
|
124 |
array->alloc = s->size;
|
|
krh@0
|
125 |
}
|
|
krh@0
|
126 |
close(fd);
|
|
krh@0
|
127 |
|
|
krh@4
|
128 |
return set;
|
|
krh@0
|
129 |
}
|
|
krh@0
|
130 |
|
|
krh@0
|
131 |
void
|
|
krh@4
|
132 |
razor_set_destroy(struct razor_set *set)
|
|
krh@0
|
133 |
{
|
|
krh@0
|
134 |
unsigned int size;
|
|
krh@19
|
135 |
struct array *a;
|
|
krh@0
|
136 |
int i;
|
|
krh@0
|
137 |
|
|
krh@4
|
138 |
if (set->header) {
|
|
krh@4
|
139 |
for (i = 0; set->header->sections[i].type; i++)
|
|
krh@0
|
140 |
;
|
|
krh@4
|
141 |
size = set->header->sections[i].type;
|
|
krh@4
|
142 |
munmap(set->header, size);
|
|
krh@17
|
143 |
free(set->buckets.data);
|
|
krh@0
|
144 |
} else {
|
|
krh@19
|
145 |
for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
|
|
krh@19
|
146 |
a = (void *) set + razor_sections[i].offset;
|
|
krh@19
|
147 |
free(a->data);
|
|
krh@19
|
148 |
}
|
|
krh@6
|
149 |
free(set->buckets.data);
|
|
krh@0
|
150 |
}
|
|
krh@0
|
151 |
|
|
krh@4
|
152 |
free(set);
|
|
krh@0
|
153 |
}
|
|
krh@0
|
154 |
|
|
krh@0
|
155 |
static int
|
|
krh@4
|
156 |
razor_set_write(struct razor_set *set, const char *filename)
|
|
krh@0
|
157 |
{
|
|
krh@0
|
158 |
char data[4096];
|
|
krh@4
|
159 |
struct razor_set_header *header = (struct razor_set_header *) data;
|
|
krh@19
|
160 |
struct array *a;
|
|
krh@17
|
161 |
unsigned long offset;
|
|
krh@17
|
162 |
int i, fd;
|
|
krh@0
|
163 |
|
|
krh@0
|
164 |
memset(data, 0, sizeof data);
|
|
krh@4
|
165 |
header->magic = RAZOR_MAGIC;
|
|
krh@4
|
166 |
header->version = RAZOR_VERSION;
|
|
krh@17
|
167 |
offset = sizeof data;
|
|
krh@0
|
168 |
|
|
krh@19
|
169 |
for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
|
|
krh@19
|
170 |
if (razor_sections[i].type != i)
|
|
krh@19
|
171 |
continue;
|
|
krh@19
|
172 |
a = (void *) set + razor_sections[i].offset;
|
|
krh@19
|
173 |
header->sections[i].type = i;
|
|
krh@17
|
174 |
header->sections[i].offset = offset;
|
|
krh@19
|
175 |
header->sections[i].size = a->size;
|
|
krh@19
|
176 |
offset += (a->size + 4095) & ~4095;
|
|
krh@17
|
177 |
}
|
|
krh@0
|
178 |
|
|
krh@19
|
179 |
header->sections[i].type = ~0;
|
|
krh@17
|
180 |
header->sections[i].offset = 0;
|
|
krh@17
|
181 |
header->sections[i].size = 0;
|
|
krh@10
|
182 |
|
|
krh@0
|
183 |
fd = open(filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);
|
|
krh@0
|
184 |
if (fd < 0)
|
|
krh@0
|
185 |
return -1;
|
|
krh@0
|
186 |
|
|
krh@0
|
187 |
write_to_fd(fd, data, sizeof data);
|
|
krh@19
|
188 |
for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
|
|
krh@19
|
189 |
if (razor_sections[i].type != i)
|
|
krh@19
|
190 |
continue;
|
|
krh@19
|
191 |
a = (void *) set + razor_sections[i].offset;
|
|
krh@19
|
192 |
write_to_fd(fd, a->data, (a->size + 4095) & ~4095);
|
|
krh@19
|
193 |
}
|
|
krh@17
|
194 |
|
|
krh@17
|
195 |
close(fd);
|
|
krh@0
|
196 |
|
|
krh@0
|
197 |
return 0;
|
|
krh@0
|
198 |
}
|
|
krh@0
|
199 |
|
|
krh@0
|
200 |
static unsigned int
|
|
krh@0
|
201 |
hash_string(const char *key)
|
|
krh@0
|
202 |
{
|
|
krh@0
|
203 |
const char *p;
|
|
krh@0
|
204 |
unsigned int hash = 0;
|
|
krh@0
|
205 |
|
|
krh@0
|
206 |
for (p = key; *p; p++)
|
|
krh@9
|
207 |
hash = (hash * 617) ^ *p;
|
|
krh@0
|
208 |
|
|
krh@0
|
209 |
return hash;
|
|
krh@0
|
210 |
}
|
|
krh@0
|
211 |
|
|
krh@0
|
212 |
unsigned long
|
|
krh@4
|
213 |
razor_set_lookup(struct razor_set *set, const char *key)
|
|
krh@0
|
214 |
{
|
|
krh@6
|
215 |
unsigned int mask, start, i;
|
|
krh@6
|
216 |
unsigned long *b;
|
|
krh@6
|
217 |
char *pool;
|
|
krh@0
|
218 |
|
|
krh@6
|
219 |
pool = set->string_pool.data;
|
|
krh@6
|
220 |
mask = set->buckets.alloc - 1;
|
|
krh@6
|
221 |
start = hash_string(key) * sizeof(unsigned long);
|
|
krh@0
|
222 |
|
|
krh@6
|
223 |
for (i = 0; i < set->buckets.alloc; i += sizeof *b) {
|
|
krh@6
|
224 |
b = set->buckets.data + ((start + i) & mask);
|
|
krh@6
|
225 |
|
|
krh@6
|
226 |
if (*b == 0)
|
|
krh@0
|
227 |
return 0;
|
|
krh@0
|
228 |
|
|
krh@6
|
229 |
if (strcmp(key, &pool[*b]) == 0)
|
|
krh@6
|
230 |
return *b;
|
|
krh@6
|
231 |
}
|
|
krh@0
|
232 |
|
|
krh@0
|
233 |
return 0;
|
|
krh@0
|
234 |
}
|
|
krh@0
|
235 |
|
|
krh@0
|
236 |
static unsigned long
|
|
krh@4
|
237 |
add_to_string_pool(struct razor_set *set, const char *key)
|
|
krh@0
|
238 |
{
|
|
krh@6
|
239 |
int len;
|
|
krh@6
|
240 |
char *p;
|
|
krh@0
|
241 |
|
|
krh@0
|
242 |
len = strlen(key) + 1;
|
|
krh@6
|
243 |
p = array_add(&set->string_pool, len);
|
|
krh@6
|
244 |
memcpy(p, key, len);
|
|
krh@0
|
245 |
|
|
krh@6
|
246 |
return p - (char *) set->string_pool.data;
|
|
krh@0
|
247 |
}
|
|
krh@0
|
248 |
|
|
krh@10
|
249 |
static unsigned long
|
|
krh@10
|
250 |
add_to_property_pool(struct razor_set *set, struct array *properties)
|
|
krh@10
|
251 |
{
|
|
krh@10
|
252 |
unsigned long *p;
|
|
krh@10
|
253 |
|
|
krh@10
|
254 |
p = array_add(properties, sizeof *p);
|
|
krh@18
|
255 |
*p = ~0ul;
|
|
krh@10
|
256 |
p = array_add(&set->property_pool, properties->size);
|
|
krh@10
|
257 |
memcpy(p, properties->data, properties->size);
|
|
krh@10
|
258 |
|
|
krh@10
|
259 |
return p - (unsigned long *) set->property_pool.data;
|
|
krh@10
|
260 |
}
|
|
krh@10
|
261 |
|
|
krh@0
|
262 |
static void
|
|
krh@4
|
263 |
do_insert(struct razor_set *set, unsigned long value)
|
|
krh@0
|
264 |
{
|
|
krh@6
|
265 |
unsigned int mask, start, i;
|
|
krh@6
|
266 |
unsigned long *b;
|
|
krh@0
|
267 |
const char *key;
|
|
krh@0
|
268 |
|
|
krh@6
|
269 |
key = (char *) set->string_pool.data + value;
|
|
krh@6
|
270 |
mask = set->buckets.alloc - 1;
|
|
krh@6
|
271 |
start = hash_string(key) * sizeof(unsigned long);
|
|
krh@6
|
272 |
|
|
krh@6
|
273 |
for (i = 0; i < set->buckets.alloc; i += sizeof *b) {
|
|
krh@6
|
274 |
b = set->buckets.data + ((start + i) & mask);
|
|
krh@6
|
275 |
if (*b == 0) {
|
|
krh@6
|
276 |
*b = value;
|
|
krh@0
|
277 |
break;
|
|
krh@0
|
278 |
}
|
|
krh@6
|
279 |
}
|
|
krh@0
|
280 |
}
|
|
krh@0
|
281 |
|
|
krh@0
|
282 |
unsigned long
|
|
krh@4
|
283 |
razor_set_insert(struct razor_set *set, const char *key)
|
|
krh@0
|
284 |
{
|
|
krh@6
|
285 |
unsigned long value, *buckets, *b, *end;
|
|
krh@6
|
286 |
int alloc;
|
|
krh@0
|
287 |
|
|
krh@6
|
288 |
alloc = set->buckets.alloc;
|
|
krh@6
|
289 |
array_add(&set->buckets, 4 * sizeof *buckets);
|
|
krh@6
|
290 |
if (alloc != set->buckets.alloc) {
|
|
krh@6
|
291 |
end = set->buckets.data + alloc;
|
|
krh@6
|
292 |
memset(end, 0, set->buckets.alloc - alloc);
|
|
krh@6
|
293 |
for (b = set->buckets.data; b < end; b++) {
|
|
krh@6
|
294 |
value = *b;
|
|
krh@6
|
295 |
if (value != 0) {
|
|
krh@6
|
296 |
*b = 0;
|
|
krh@4
|
297 |
do_insert(set, value);
|
|
krh@6
|
298 |
}
|
|
krh@0
|
299 |
}
|
|
krh@0
|
300 |
}
|
|
krh@0
|
301 |
|
|
krh@4
|
302 |
value = add_to_string_pool(set, key);
|
|
krh@4
|
303 |
do_insert (set, value);
|
|
krh@0
|
304 |
|
|
krh@0
|
305 |
return value;
|
|
krh@0
|
306 |
}
|
|
krh@0
|
307 |
|
|
krh@0
|
308 |
unsigned long
|
|
krh@4
|
309 |
razor_set_tokenize(struct razor_set *set, const char *string)
|
|
krh@0
|
310 |
{
|
|
krh@0
|
311 |
unsigned long token;
|
|
krh@0
|
312 |
|
|
krh@13
|
313 |
if (string == NULL)
|
|
krh@18
|
314 |
return razor_set_tokenize(set, "");
|
|
krh@13
|
315 |
|
|
krh@4
|
316 |
token = razor_set_lookup(set, string);
|
|
krh@0
|
317 |
if (token != 0)
|
|
krh@0
|
318 |
return token;
|
|
krh@0
|
319 |
|
|
krh@4
|
320 |
return razor_set_insert(set, string);
|
|
krh@0
|
321 |
}
|
|
krh@0
|
322 |
|
|
krh@27
|
323 |
void
|
|
krh@13
|
324 |
import_context_add_package(struct import_context *ctx,
|
|
krh@13
|
325 |
const char *name, const char *version)
|
|
krh@13
|
326 |
{
|
|
krh@25
|
327 |
struct razor_package *p;
|
|
krh@13
|
328 |
|
|
krh@25
|
329 |
p = array_add(&ctx->set->packages, sizeof *p);
|
|
krh@13
|
330 |
p->name = razor_set_tokenize(ctx->set, name);
|
|
krh@13
|
331 |
p->version = razor_set_tokenize(ctx->set, version);
|
|
krh@13
|
332 |
|
|
krh@18
|
333 |
ctx->package = p;
|
|
krh@13
|
334 |
array_init(&ctx->requires.package);
|
|
krh@13
|
335 |
array_init(&ctx->provides.package);
|
|
krh@13
|
336 |
}
|
|
krh@13
|
337 |
|
|
krh@13
|
338 |
void
|
|
krh@13
|
339 |
import_context_finish_package(struct import_context *ctx)
|
|
krh@13
|
340 |
{
|
|
krh@25
|
341 |
struct razor_package *p;
|
|
krh@13
|
342 |
|
|
krh@18
|
343 |
p = ctx->package;
|
|
krh@13
|
344 |
p->requires = add_to_property_pool(ctx->set, &ctx->requires.package);
|
|
krh@13
|
345 |
p->provides = add_to_property_pool(ctx->set, &ctx->provides.package);
|
|
krh@13
|
346 |
|
|
krh@13
|
347 |
array_release(&ctx->requires.package);
|
|
krh@13
|
348 |
array_release(&ctx->provides.package);
|
|
krh@13
|
349 |
}
|
|
krh@13
|
350 |
|
|
krh@27
|
351 |
void
|
|
krh@13
|
352 |
import_context_add_property(struct import_context *ctx,
|
|
krh@13
|
353 |
struct import_property_context *pctx,
|
|
krh@13
|
354 |
const char *name, const char *version)
|
|
krh@13
|
355 |
{
|
|
krh@25
|
356 |
struct razor_property *p;
|
|
krh@13
|
357 |
unsigned long *r;
|
|
krh@13
|
358 |
|
|
krh@25
|
359 |
p = array_add(pctx->all, sizeof *p);
|
|
krh@13
|
360 |
p->name = razor_set_tokenize(ctx->set, name);
|
|
krh@13
|
361 |
p->version = razor_set_tokenize(ctx->set, version);
|
|
krh@25
|
362 |
p->packages = ctx->package -
|
|
krh@25
|
363 |
(struct razor_package *) ctx->set->packages.data;
|
|
krh@13
|
364 |
|
|
krh@13
|
365 |
r = array_add(&pctx->package, sizeof *r);
|
|
krh@25
|
366 |
*r = p - (struct razor_property *) pctx->all->data;
|
|
krh@13
|
367 |
}
|
|
krh@13
|
368 |
|
|
krh@27
|
369 |
void
|
|
krh@13
|
370 |
razor_prepare_import(struct import_context *ctx)
|
|
krh@9
|
371 |
{
|
|
krh@9
|
372 |
memset(ctx, 0, sizeof *ctx);
|
|
krh@13
|
373 |
ctx->set = razor_set_create();
|
|
krh@25
|
374 |
ctx->requires.all = &ctx->set->requires;
|
|
krh@25
|
375 |
ctx->provides.all = &ctx->set->provides;
|
|
krh@9
|
376 |
}
|
|
krh@9
|
377 |
|
|
krh@22
|
378 |
typedef int (*compare_with_data_func_t)(const void *p1,
|
|
krh@22
|
379 |
const void *p,
|
|
krh@22
|
380 |
void *data);
|
|
krh@22
|
381 |
|
|
krh@25
|
382 |
struct qsort_context {
|
|
krh@25
|
383 |
size_t size;
|
|
krh@25
|
384 |
compare_with_data_func_t compare;
|
|
krh@25
|
385 |
void *data;
|
|
krh@25
|
386 |
};
|
|
krh@25
|
387 |
|
|
krh@22
|
388 |
static void
|
|
krh@22
|
389 |
qsort_swap(void *p1, void *p2, size_t size)
|
|
krh@22
|
390 |
{
|
|
krh@22
|
391 |
char buffer[size];
|
|
krh@22
|
392 |
|
|
krh@22
|
393 |
memcpy(buffer, p1, size);
|
|
krh@22
|
394 |
memcpy(p1, p2, size);
|
|
krh@22
|
395 |
memcpy(p2, buffer, size);
|
|
krh@22
|
396 |
}
|
|
krh@22
|
397 |
|
|
krh@25
|
398 |
static void
|
|
krh@25
|
399 |
__qsort_with_data(void *base, size_t nelem, unsigned long *map,
|
|
krh@25
|
400 |
struct qsort_context *ctx)
|
|
krh@22
|
401 |
{
|
|
krh@22
|
402 |
void *p, *start, *end, *pivot;
|
|
krh@25
|
403 |
unsigned long *mp, *mstart, *mend, tmp;
|
|
krh@22
|
404 |
int left, right, result;
|
|
krh@25
|
405 |
size_t size = ctx->size;
|
|
krh@22
|
406 |
|
|
krh@22
|
407 |
p = base;
|
|
krh@22
|
408 |
start = base;
|
|
krh@22
|
409 |
end = base + nelem * size;
|
|
krh@25
|
410 |
mp = map;
|
|
krh@25
|
411 |
mstart = map;
|
|
krh@25
|
412 |
mend = map + nelem;
|
|
krh@22
|
413 |
pivot = base + (random() % nelem) * size;
|
|
krh@25
|
414 |
|
|
krh@22
|
415 |
while (p < end) {
|
|
krh@25
|
416 |
result = ctx->compare(p, pivot, ctx->data);
|
|
krh@22
|
417 |
if (result < 0) {
|
|
krh@22
|
418 |
qsort_swap(p, start, size);
|
|
krh@25
|
419 |
tmp = *mp;
|
|
krh@25
|
420 |
*mp = *mstart;
|
|
krh@25
|
421 |
*mstart = tmp;
|
|
krh@22
|
422 |
if (start == pivot)
|
|
krh@22
|
423 |
pivot = p;
|
|
krh@22
|
424 |
start += size;
|
|
krh@25
|
425 |
mstart++;
|
|
krh@22
|
426 |
p += size;
|
|
krh@29
|
427 |
mp++;
|
|
krh@22
|
428 |
} else if (result == 0) {
|
|
krh@22
|
429 |
p += size;
|
|
krh@25
|
430 |
mp++;
|
|
krh@22
|
431 |
} else {
|
|
krh@22
|
432 |
end -= size;
|
|
krh@25
|
433 |
mend--;
|
|
krh@22
|
434 |
qsort_swap(p, end, size);
|
|
krh@25
|
435 |
tmp = *mp;
|
|
krh@29
|
436 |
*mp = *mend;
|
|
krh@29
|
437 |
*mend = tmp;
|
|
krh@22
|
438 |
if (end == pivot)
|
|
krh@22
|
439 |
pivot = p;
|
|
krh@22
|
440 |
}
|
|
krh@22
|
441 |
}
|
|
krh@22
|
442 |
|
|
krh@22
|
443 |
left = (start - base) / size;
|
|
krh@22
|
444 |
right = (base + nelem * size - end) / size;
|
|
krh@22
|
445 |
if (left > 1)
|
|
krh@25
|
446 |
__qsort_with_data(base, left, map, ctx);
|
|
krh@22
|
447 |
if (right > 1)
|
|
krh@25
|
448 |
__qsort_with_data(end, right, mend, ctx);
|
|
krh@25
|
449 |
}
|
|
krh@25
|
450 |
|
|
krh@25
|
451 |
unsigned long *
|
|
krh@25
|
452 |
qsort_with_data(void *base, size_t nelem, size_t size,
|
|
krh@25
|
453 |
compare_with_data_func_t compare, void *data)
|
|
krh@25
|
454 |
{
|
|
krh@25
|
455 |
struct qsort_context ctx;
|
|
krh@25
|
456 |
unsigned long *map;
|
|
krh@25
|
457 |
int i;
|
|
krh@25
|
458 |
|
|
krh@25
|
459 |
ctx.size = size;
|
|
krh@25
|
460 |
ctx.compare = compare;
|
|
krh@25
|
461 |
ctx.data = data;
|
|
krh@25
|
462 |
|
|
krh@25
|
463 |
map = malloc(nelem * sizeof (unsigned long));
|
|
krh@25
|
464 |
for (i = 0; i < nelem; i++)
|
|
krh@25
|
465 |
map[i] = i;
|
|
krh@25
|
466 |
|
|
krh@25
|
467 |
__qsort_with_data(base, nelem, map, &ctx);
|
|
krh@25
|
468 |
|
|
krh@25
|
469 |
return map;
|
|
krh@22
|
470 |
}
|
|
krh@9
|
471 |
|
|
krh@9
|
472 |
static int
|
|
krh@22
|
473 |
compare_packages(const void *p1, const void *p2, void *data)
|
|
krh@9
|
474 |
{
|
|
krh@25
|
475 |
const struct razor_package *pkg1 = p1, *pkg2 = p2;
|
|
krh@22
|
476 |
struct razor_set *set = data;
|
|
krh@22
|
477 |
char *pool = set->string_pool.data;
|
|
krh@9
|
478 |
|
|
krh@23
|
479 |
if (pkg1->name == pkg2->name)
|
|
krh@23
|
480 |
return 0;
|
|
krh@23
|
481 |
else
|
|
krh@23
|
482 |
return strcmp(&pool[pkg1->name], &pool[pkg2->name]);
|
|
krh@9
|
483 |
}
|
|
krh@9
|
484 |
|
|
krh@9
|
485 |
static int
|
|
krh@22
|
486 |
compare_properties(const void *p1, const void *p2, void *data)
|
|
krh@9
|
487 |
{
|
|
krh@25
|
488 |
const struct razor_property *prop1 = p1, *prop2 = p2;
|
|
krh@22
|
489 |
struct razor_set *set = data;
|
|
krh@22
|
490 |
char *pool = set->string_pool.data;
|
|
krh@9
|
491 |
|
|
krh@23
|
492 |
if (prop1->name == prop2->name)
|
|
krh@12
|
493 |
return strcmp(&pool[prop1->version], &pool[prop2->version]);
|
|
krh@12
|
494 |
else
|
|
krh@23
|
495 |
return strcmp(&pool[prop1->name], &pool[prop2->name]);
|
|
krh@9
|
496 |
}
|
|
krh@9
|
497 |
|
|
krh@10
|
498 |
static unsigned long *
|
|
krh@25
|
499 |
uniqueify_properties(struct razor_set *set, struct array *properties)
|
|
krh@9
|
500 |
{
|
|
krh@25
|
501 |
struct razor_property *rp, *up, *rp_end;
|
|
krh@18
|
502 |
struct array *pkgs, *p;
|
|
krh@25
|
503 |
unsigned long *map, *rmap, *r;
|
|
krh@18
|
504 |
int i, count, unique;
|
|
krh@9
|
505 |
|
|
krh@25
|
506 |
count = properties->size / sizeof(struct razor_property);
|
|
krh@25
|
507 |
map = qsort_with_data(properties->data,
|
|
krh@25
|
508 |
count,
|
|
krh@25
|
509 |
sizeof(struct razor_property),
|
|
krh@25
|
510 |
compare_properties,
|
|
krh@25
|
511 |
set);
|
|
krh@9
|
512 |
|
|
krh@25
|
513 |
rp_end = properties->data + properties->size;
|
|
krh@25
|
514 |
rmap = malloc(count * sizeof *map);
|
|
krh@25
|
515 |
pkgs = zalloc(count * sizeof *pkgs);
|
|
krh@25
|
516 |
for (rp = properties->data, up = rp, i = 0; rp < rp_end; rp++, i++) {
|
|
krh@25
|
517 |
if (rp->name != up->name || rp->version != up->version) {
|
|
krh@25
|
518 |
up++;
|
|
krh@25
|
519 |
up->name = rp->name;
|
|
krh@25
|
520 |
up->version = rp->version;
|
|
krh@10
|
521 |
}
|
|
krh@25
|
522 |
|
|
krh@25
|
523 |
unique = up - (struct razor_property *) properties->data;
|
|
krh@25
|
524 |
rmap[map[i]] = unique;
|
|
krh@25
|
525 |
r = array_add(&pkgs[unique], sizeof *r);
|
|
krh@25
|
526 |
*r = rp->packages;
|
|
krh@10
|
527 |
}
|
|
krh@25
|
528 |
free(map);
|
|
krh@9
|
529 |
|
|
krh@25
|
530 |
up++;
|
|
krh@25
|
531 |
properties->size = (void *) up - properties->data;
|
|
krh@25
|
532 |
rp_end = up;
|
|
krh@25
|
533 |
for (rp = properties->data, p = pkgs; rp < rp_end; rp++, p++) {
|
|
krh@25
|
534 |
rp->packages = add_to_property_pool(set, p);
|
|
krh@25
|
535 |
array_release(p);
|
|
krh@18
|
536 |
}
|
|
krh@18
|
537 |
|
|
krh@18
|
538 |
free(pkgs);
|
|
krh@18
|
539 |
|
|
krh@25
|
540 |
return rmap;
|
|
krh@10
|
541 |
}
|
|
krh@10
|
542 |
|
|
krh@10
|
543 |
static void
|
|
krh@18
|
544 |
remap_package_links(struct import_context *ctx)
|
|
krh@10
|
545 |
{
|
|
krh@25
|
546 |
struct razor_package *p, *end;
|
|
krh@10
|
547 |
unsigned long *pool, *r;
|
|
krh@10
|
548 |
|
|
krh@10
|
549 |
pool = ctx->set->property_pool.data;
|
|
krh@25
|
550 |
end = ctx->set->packages.data + ctx->set->packages.size;
|
|
krh@25
|
551 |
for (p = ctx->set->packages.data; p < end; p++) {
|
|
krh@18
|
552 |
for (r = &pool[p->requires]; ~*r; r++)
|
|
krh@10
|
553 |
*r = ctx->requires_map[*r];
|
|
krh@18
|
554 |
for (r = &pool[p->provides]; ~*r; r++)
|
|
krh@10
|
555 |
*r = ctx->provides_map[*r];
|
|
krh@9
|
556 |
}
|
|
krh@18
|
557 |
}
|
|
krh@10
|
558 |
|
|
krh@18
|
559 |
static void
|
|
krh@25
|
560 |
remap_property_links(struct import_context *ctx, unsigned long *map)
|
|
krh@18
|
561 |
{
|
|
krh@18
|
562 |
struct razor_property *p, *end;
|
|
krh@25
|
563 |
struct razor_package *rp;
|
|
krh@25
|
564 |
unsigned long *pool, *r, *rmap;
|
|
krh@18
|
565 |
int i, count;
|
|
krh@18
|
566 |
|
|
krh@18
|
567 |
pool = ctx->set->property_pool.data;
|
|
krh@25
|
568 |
count = ctx->set->packages.size / sizeof(struct razor_package);
|
|
krh@25
|
569 |
rmap = malloc(count * sizeof *map);
|
|
krh@25
|
570 |
rp = ctx->set->packages.data;
|
|
krh@18
|
571 |
for (i = 0; i < count; i++)
|
|
krh@25
|
572 |
rmap[map[i]] = i;
|
|
krh@18
|
573 |
|
|
krh@18
|
574 |
/* FIXME: This will break if we implement package list sharing
|
|
krh@18
|
575 |
* for all properties, since we'll remap those lists more than
|
|
krh@18
|
576 |
* once. We should just have a separate pool for property
|
|
krh@18
|
577 |
* lists and a separate pool for package lists and remap it as
|
|
krh@18
|
578 |
* a flat pool. Right now, as property lists and package
|
|
krh@18
|
579 |
* lists are mixed, we can't do that. */
|
|
krh@18
|
580 |
|
|
krh@18
|
581 |
end = ctx->set->requires.data + ctx->set->requires.size;
|
|
krh@18
|
582 |
for (p = ctx->set->requires.data; p < end; p++)
|
|
krh@18
|
583 |
for (r = &pool[p->packages]; ~*r; r++)
|
|
krh@25
|
584 |
*r = rmap[*r];
|
|
krh@18
|
585 |
|
|
krh@18
|
586 |
end = ctx->set->provides.data + ctx->set->provides.size;
|
|
krh@18
|
587 |
for (p = ctx->set->provides.data; p < end; p++)
|
|
krh@18
|
588 |
for (r = &pool[p->packages]; ~*r; r++)
|
|
krh@25
|
589 |
*r = rmap[*r];
|
|
krh@18
|
590 |
|
|
krh@25
|
591 |
free(rmap);
|
|
krh@9
|
592 |
}
|
|
krh@9
|
593 |
|
|
krh@27
|
594 |
struct razor_set *
|
|
krh@13
|
595 |
razor_finish_import(struct import_context *ctx)
|
|
krh@9
|
596 |
{
|
|
krh@25
|
597 |
unsigned long *map;
|
|
krh@25
|
598 |
int count;
|
|
krh@18
|
599 |
|
|
krh@25
|
600 |
ctx->requires_map = uniqueify_properties(ctx->set, ctx->requires.all);
|
|
krh@25
|
601 |
ctx->provides_map = uniqueify_properties(ctx->set, ctx->provides.all);
|
|
krh@18
|
602 |
remap_package_links(ctx);
|
|
krh@10
|
603 |
free(ctx->requires_map);
|
|
krh@10
|
604 |
free(ctx->provides_map);
|
|
krh@25
|
605 |
|
|
krh@25
|
606 |
count = ctx->set->packages.size / sizeof(struct razor_package);
|
|
krh@25
|
607 |
map = qsort_with_data(ctx->set->packages.data,
|
|
krh@25
|
608 |
count,
|
|
krh@25
|
609 |
sizeof(struct razor_package),
|
|
krh@25
|
610 |
compare_packages,
|
|
krh@25
|
611 |
ctx->set);
|
|
krh@25
|
612 |
remap_property_links(ctx, map);
|
|
krh@25
|
613 |
free(map);
|
|
krh@13
|
614 |
|
|
krh@13
|
615 |
return ctx->set;
|
|
krh@9
|
616 |
}
|
|
krh@9
|
617 |
|
|
krh@0
|
618 |
void
|
|
krh@4
|
619 |
razor_set_list(struct razor_set *set)
|
|
krh@3
|
620 |
{
|
|
krh@6
|
621 |
struct razor_package *p, *end;
|
|
krh@6
|
622 |
char *pool;
|
|
krh@3
|
623 |
|
|
krh@6
|
624 |
pool = set->string_pool.data;
|
|
krh@6
|
625 |
end = set->packages.data + set->packages.size;
|
|
krh@14
|
626 |
for (p = set->packages.data; p < end; p++)
|
|
krh@6
|
627 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@3
|
628 |
}
|
|
krh@3
|
629 |
|
|
krh@16
|
630 |
struct razor_set *bsearch_set;
|
|
krh@16
|
631 |
|
|
krh@16
|
632 |
static int
|
|
krh@16
|
633 |
compare_package_name(const void *key, const void *data)
|
|
krh@16
|
634 |
{
|
|
krh@16
|
635 |
const struct razor_package *p = data;
|
|
krh@16
|
636 |
char *pool;
|
|
krh@16
|
637 |
|
|
krh@16
|
638 |
pool = bsearch_set->string_pool.data;
|
|
krh@16
|
639 |
|
|
krh@16
|
640 |
return strcmp(key, &pool[p->name]);
|
|
krh@16
|
641 |
}
|
|
krh@16
|
642 |
|
|
krh@10
|
643 |
struct razor_package *
|
|
krh@10
|
644 |
razor_set_get_package(struct razor_set *set, const char *package)
|
|
krh@10
|
645 |
{
|
|
krh@16
|
646 |
bsearch_set = set;
|
|
krh@16
|
647 |
return bsearch(package, set->packages.data,
|
|
krh@16
|
648 |
set->packages.size / sizeof(struct razor_package),
|
|
krh@16
|
649 |
sizeof(struct razor_package), compare_package_name);
|
|
krh@10
|
650 |
}
|
|
krh@10
|
651 |
|
|
krh@18
|
652 |
static int
|
|
krh@18
|
653 |
compare_property_name(const void *key, const void *data)
|
|
krh@18
|
654 |
{
|
|
krh@18
|
655 |
const struct razor_property *p = data;
|
|
krh@18
|
656 |
char *pool;
|
|
krh@18
|
657 |
|
|
krh@18
|
658 |
pool = bsearch_set->string_pool.data;
|
|
krh@18
|
659 |
|
|
krh@18
|
660 |
return strcmp(key, &pool[p->name]);
|
|
krh@18
|
661 |
}
|
|
krh@18
|
662 |
|
|
krh@18
|
663 |
struct razor_property *
|
|
krh@18
|
664 |
razor_set_get_property(struct razor_set *set,
|
|
krh@18
|
665 |
struct array *properties,
|
|
krh@18
|
666 |
const char *property)
|
|
krh@18
|
667 |
{
|
|
krh@18
|
668 |
struct razor_property *p, *start;
|
|
krh@18
|
669 |
|
|
krh@18
|
670 |
bsearch_set = set;
|
|
krh@18
|
671 |
p = bsearch(property, properties->data,
|
|
krh@18
|
672 |
properties->size / sizeof(struct razor_property),
|
|
krh@18
|
673 |
sizeof(struct razor_property), compare_property_name);
|
|
krh@18
|
674 |
|
|
krh@18
|
675 |
start = properties->data;
|
|
krh@18
|
676 |
while (p > start && (p - 1)->name == p->name)
|
|
krh@18
|
677 |
p--;
|
|
krh@18
|
678 |
|
|
krh@18
|
679 |
return p;
|
|
krh@18
|
680 |
}
|
|
krh@18
|
681 |
|
|
krh@10
|
682 |
static void
|
|
krh@10
|
683 |
razor_set_list_all_properties(struct razor_set *set, struct array *properties)
|
|
krh@8
|
684 |
{
|
|
krh@8
|
685 |
struct razor_property *p, *end;
|
|
krh@8
|
686 |
char *pool;
|
|
krh@8
|
687 |
|
|
krh@8
|
688 |
pool = set->string_pool.data;
|
|
krh@10
|
689 |
end = properties->data + properties->size;
|
|
krh@14
|
690 |
for (p = properties->data; p < end; p++)
|
|
krh@8
|
691 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@8
|
692 |
}
|
|
krh@8
|
693 |
|
|
krh@8
|
694 |
void
|
|
krh@10
|
695 |
razor_set_list_requires(struct razor_set *set, const char *name)
|
|
krh@7
|
696 |
{
|
|
krh@10
|
697 |
struct razor_property *p, *requires;
|
|
krh@10
|
698 |
struct razor_package *package;
|
|
krh@10
|
699 |
unsigned long *r;
|
|
krh@7
|
700 |
char *pool;
|
|
krh@7
|
701 |
|
|
krh@10
|
702 |
if (name) {
|
|
krh@10
|
703 |
package = razor_set_get_package(set, name);
|
|
krh@10
|
704 |
r = (unsigned long *) set->property_pool.data +
|
|
krh@10
|
705 |
package->requires;
|
|
krh@10
|
706 |
requires = set->requires.data;
|
|
krh@10
|
707 |
pool = set->string_pool.data;
|
|
krh@18
|
708 |
while (~*r) {
|
|
krh@10
|
709 |
p = &requires[*r++];
|
|
krh@10
|
710 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@10
|
711 |
}
|
|
krh@10
|
712 |
} else
|
|
krh@10
|
713 |
razor_set_list_all_properties(set, &set->requires);
|
|
krh@10
|
714 |
}
|
|
krh@10
|
715 |
|
|
krh@10
|
716 |
void
|
|
krh@10
|
717 |
razor_set_list_provides(struct razor_set *set, const char *name)
|
|
krh@10
|
718 |
{
|
|
krh@10
|
719 |
struct razor_property *p, *provides;
|
|
krh@10
|
720 |
struct razor_package *package;
|
|
krh@10
|
721 |
unsigned long *r;
|
|
krh@10
|
722 |
char *pool;
|
|
krh@10
|
723 |
|
|
krh@10
|
724 |
if (name) {
|
|
krh@10
|
725 |
package = razor_set_get_package(set, name);
|
|
krh@10
|
726 |
r = (unsigned long *) set->property_pool.data +
|
|
krh@10
|
727 |
package->provides;
|
|
krh@10
|
728 |
provides = set->provides.data;
|
|
krh@10
|
729 |
pool = set->string_pool.data;
|
|
krh@18
|
730 |
while (~*r) {
|
|
krh@10
|
731 |
p = &provides[*r++];
|
|
krh@10
|
732 |
printf("%s %s\n", &pool[p->name], &pool[p->version]);
|
|
krh@10
|
733 |
}
|
|
krh@10
|
734 |
} else
|
|
krh@10
|
735 |
razor_set_list_all_properties(set, &set->provides);
|
|
krh@7
|
736 |
}
|
|
krh@7
|
737 |
|
|
krh@7
|
738 |
void
|
|
krh@18
|
739 |
razor_set_list_property_packages(struct razor_set *set,
|
|
krh@18
|
740 |
struct array *properties,
|
|
krh@20
|
741 |
const char *name,
|
|
krh@20
|
742 |
const char *version)
|
|
krh@18
|
743 |
{
|
|
krh@18
|
744 |
struct razor_property *property, *end;
|
|
krh@18
|
745 |
struct razor_package *p, *packages;
|
|
krh@18
|
746 |
unsigned long *r;
|
|
krh@18
|
747 |
char *pool;
|
|
krh@18
|
748 |
|
|
krh@18
|
749 |
if (name == NULL)
|
|
krh@18
|
750 |
return;
|
|
krh@18
|
751 |
|
|
krh@18
|
752 |
property = razor_set_get_property(set, properties, name);
|
|
krh@18
|
753 |
packages = set->packages.data;
|
|
krh@18
|
754 |
pool = set->string_pool.data;
|
|
krh@18
|
755 |
end = properties->data + properties->size;
|
|
krh@18
|
756 |
while (property < end && strcmp(name, &pool[property->name]) == 0) {
|
|
krh@20
|
757 |
if (version && strcmp(version, &pool[property->version]) != 0)
|
|
krh@20
|
758 |
goto next;
|
|
krh@18
|
759 |
r = (unsigned long *)
|
|
krh@18
|
760 |
set->property_pool.data + property->packages;
|
|
krh@18
|
761 |
while (~*r) {
|
|
krh@18
|
762 |
p = &packages[*r++];
|
|
krh@18
|
763 |
printf("%s %s\n",
|
|
krh@18
|
764 |
&pool[p->name], &pool[p->version]);
|
|
krh@18
|
765 |
}
|
|
krh@20
|
766 |
next:
|
|
krh@18
|
767 |
property++;
|
|
krh@18
|
768 |
}
|
|
krh@18
|
769 |
}
|
|
krh@18
|
770 |
|
|
krh@18
|
771 |
void
|
|
krh@21
|
772 |
razor_set_validate(struct razor_set *set, struct array *unsatisfied)
|
|
krh@21
|
773 |
{
|
|
krh@21
|
774 |
struct razor_property *r, *p, *rend, *pend;
|
|
krh@21
|
775 |
unsigned long *u;
|
|
krh@21
|
776 |
char *pool;
|
|
krh@21
|
777 |
|
|
krh@21
|
778 |
r = set->requires.data;
|
|
krh@21
|
779 |
p = set->provides.data;
|
|
krh@21
|
780 |
rend = set->requires.data + set->requires.size;
|
|
krh@21
|
781 |
pend = set->provides.data + set->provides.size;
|
|
krh@21
|
782 |
pool = set->string_pool.data;
|
|
krh@21
|
783 |
|
|
krh@21
|
784 |
while (r < rend) {
|
|
krh@21
|
785 |
while (p < pend && strcmp(&pool[r->name], &pool[p->name]) > 0)
|
|
krh@21
|
786 |
p++;
|
|
krh@21
|
787 |
if (p == pend || strcmp(&pool[r->name], &pool[p->name]) != 0) {
|
|
krh@21
|
788 |
u = array_add(unsatisfied, sizeof *u);
|
|
krh@21
|
789 |
*u = r - (struct razor_property *) set->requires.data;
|
|
krh@21
|
790 |
}
|
|
krh@21
|
791 |
r++;
|
|
krh@21
|
792 |
}
|
|
krh@21
|
793 |
}
|
|
krh@21
|
794 |
|
|
krh@21
|
795 |
void
|
|
krh@21
|
796 |
razor_set_list_unsatisfied(struct razor_set *set)
|
|
krh@21
|
797 |
{
|
|
krh@21
|
798 |
struct array unsatisfied;
|
|
krh@21
|
799 |
struct razor_property *requires, *r;
|
|
krh@21
|
800 |
unsigned long *u, *end;
|
|
krh@21
|
801 |
char *pool;
|
|
krh@21
|
802 |
|
|
krh@21
|
803 |
array_init(&unsatisfied);
|
|
krh@21
|
804 |
razor_set_validate(set, &unsatisfied);
|
|
krh@21
|
805 |
|
|
krh@21
|
806 |
end = unsatisfied.data + unsatisfied.size;
|
|
krh@21
|
807 |
requires = set->requires.data;
|
|
krh@21
|
808 |
pool = set->string_pool.data;
|
|
krh@21
|
809 |
|
|
krh@21
|
810 |
for (u = unsatisfied.data; u < end; u++) {
|
|
krh@21
|
811 |
r = requires + *u;
|
|
krh@21
|
812 |
printf("%s %s not satisfied\n",
|
|
krh@21
|
813 |
&pool[r->name], &pool[r->version]);
|
|
krh@21
|
814 |
}
|
|
krh@21
|
815 |
|
|
krh@21
|
816 |
array_release(&unsatisfied);
|
|
krh@21
|
817 |
}
|
|
krh@21
|
818 |
|
|
krh@21
|
819 |
void
|
|
krh@4
|
820 |
razor_set_info(struct razor_set *set)
|
|
krh@3
|
821 |
{
|
|
krh@3
|
822 |
unsigned int offset, size;
|
|
krh@3
|
823 |
int i;
|
|
krh@3
|
824 |
|
|
krh@4
|
825 |
for (i = 0; i < set->header->sections[i].type; i++) {
|
|
krh@4
|
826 |
offset = set->header->sections[i].offset;
|
|
krh@18
|
827 |
size = set->header->sections[i].size;
|
|
krh@3
|
828 |
|
|
krh@4
|
829 |
switch (set->header->sections[i].type) {
|
|
krh@4
|
830 |
case RAZOR_PACKAGES:
|
|
krh@3
|
831 |
printf("package section:\t%dkb\n", size / 1024);
|
|
krh@3
|
832 |
break;
|
|
krh@8
|
833 |
case RAZOR_REQUIRES:
|
|
krh@8
|
834 |
printf("requires section:\t%dkb\n", size / 1024);
|
|
krh@8
|
835 |
break;
|
|
krh@7
|
836 |
case RAZOR_PROVIDES:
|
|
krh@7
|
837 |
printf("provides section:\t%dkb\n", size / 1024);
|
|
krh@7
|
838 |
break;
|
|
krh@19
|
839 |
case RAZOR_STRING_POOL:
|
|
krh@19
|
840 |
printf("string pool:\t\t%dkb\n", size / 1024);
|
|
krh@19
|
841 |
break;
|
|
krh@19
|
842 |
case RAZOR_PROPERTY_POOL:
|
|
krh@18
|
843 |
printf("properties section:\t%dkb\n", size / 1024);
|
|
krh@18
|
844 |
break;
|
|
krh@3
|
845 |
}
|
|
krh@3
|
846 |
}
|
|
krh@0
|
847 |
}
|
|
krh@0
|
848 |
|
|
krh@0
|
849 |
static int
|
|
krh@0
|
850 |
usage(void)
|
|
krh@0
|
851 |
{
|
|
krh@7
|
852 |
printf("usage: razor [ import FILES | lookup <key> | "
|
|
krh@15
|
853 |
"list | list-requires | list-provides | eat-yum | info ]\n");
|
|
krh@0
|
854 |
exit(1);
|
|
krh@0
|
855 |
}
|
|
krh@0
|
856 |
|
|
krh@15
|
857 |
static const char *repo_filename = "system.repo";
|
|
krh@15
|
858 |
static const char rawhide_repo_filename[] = "rawhide.repo";
|
|
krh@0
|
859 |
|
|
krh@0
|
860 |
int
|
|
krh@27
|
861 |
main(int argc, const char *argv[])
|
|
krh@0
|
862 |
{
|
|
krh@4
|
863 |
struct razor_set *set;
|
|
krh@0
|
864 |
struct stat statbuf;
|
|
krh@15
|
865 |
char *repo;
|
|
krh@15
|
866 |
|
|
krh@15
|
867 |
repo = getenv("RAZOR_REPO");
|
|
krh@15
|
868 |
if (repo != NULL)
|
|
krh@15
|
869 |
repo_filename = repo;
|
|
krh@0
|
870 |
|
|
krh@3
|
871 |
if (argc < 2) {
|
|
krh@0
|
872 |
usage();
|
|
krh@0
|
873 |
} else if (strcmp(argv[1], "import") == 0) {
|
|
krh@0
|
874 |
if (stat("set", &statbuf) && mkdir("set", 0777)) {
|
|
krh@0
|
875 |
fprintf(stderr, "could not create directory 'set'\n");
|
|
krh@0
|
876 |
exit(-1);
|
|
krh@0
|
877 |
}
|
|
krh@0
|
878 |
|
|
krh@27
|
879 |
set = razor_import_rzr_files(argc - 2, argv + 2);
|
|
krh@6
|
880 |
|
|
krh@6
|
881 |
printf("bucket allocation: %d\n", set->buckets.alloc);
|
|
krh@6
|
882 |
printf("pool size: %d\n", set->string_pool.size);
|
|
krh@6
|
883 |
printf("pool allocation: %d\n", set->string_pool.alloc);
|
|
krh@7
|
884 |
printf("packages: %d\n",
|
|
krh@7
|
885 |
set->packages.size / sizeof(struct razor_package));
|
|
krh@8
|
886 |
printf("requires: %d\n",
|
|
krh@8
|
887 |
set->requires.size / sizeof(struct razor_property));
|
|
krh@7
|
888 |
printf("provides: %d\n",
|
|
krh@8
|
889 |
set->provides.size / sizeof(struct razor_property));
|
|
krh@0
|
890 |
|
|
krh@4
|
891 |
razor_set_write(set, repo_filename);
|
|
krh@0
|
892 |
|
|
krh@4
|
893 |
razor_set_destroy(set);
|
|
krh@0
|
894 |
} else if (strcmp(argv[1], "lookup") == 0) {
|
|
krh@4
|
895 |
set = razor_set_open(repo_filename);
|
|
krh@0
|
896 |
printf("%s is %lu\n", argv[2],
|
|
krh@4
|
897 |
razor_set_lookup(set, argv[2]));
|
|
krh@4
|
898 |
razor_set_destroy(set);
|
|
krh@3
|
899 |
} else if (strcmp(argv[1], "list") == 0) {
|
|
krh@4
|
900 |
set = razor_set_open(repo_filename);
|
|
krh@4
|
901 |
razor_set_list(set);
|
|
krh@4
|
902 |
razor_set_destroy(set);
|
|
krh@8
|
903 |
} else if (strcmp(argv[1], "list-requires") == 0) {
|
|
krh@8
|
904 |
set = razor_set_open(repo_filename);
|
|
krh@10
|
905 |
razor_set_list_requires(set, argv[2]);
|
|
krh@8
|
906 |
razor_set_destroy(set);
|
|
krh@7
|
907 |
} else if (strcmp(argv[1], "list-provides") == 0) {
|
|
krh@7
|
908 |
set = razor_set_open(repo_filename);
|
|
krh@10
|
909 |
razor_set_list_provides(set, argv[2]);
|
|
krh@7
|
910 |
razor_set_destroy(set);
|
|
krh@18
|
911 |
} else if (strcmp(argv[1], "what-requires") == 0) {
|
|
krh@18
|
912 |
set = razor_set_open(repo_filename);
|
|
krh@20
|
913 |
razor_set_list_property_packages(set, &set->requires,
|
|
krh@20
|
914 |
argv[2], argv[3]);
|
|
krh@18
|
915 |
razor_set_destroy(set);
|
|
krh@18
|
916 |
} else if (strcmp(argv[1], "what-provides") == 0) {
|
|
krh@18
|
917 |
set = razor_set_open(repo_filename);
|
|
krh@20
|
918 |
razor_set_list_property_packages(set, &set->provides,
|
|
krh@20
|
919 |
argv[2], argv[3]);
|
|
krh@18
|
920 |
razor_set_destroy(set);
|
|
krh@3
|
921 |
} else if (strcmp(argv[1], "info") == 0) {
|
|
krh@4
|
922 |
set = razor_set_open(repo_filename);
|
|
krh@4
|
923 |
razor_set_info(set);
|
|
krh@4
|
924 |
razor_set_destroy(set);
|
|
krh@15
|
925 |
} else if (strcmp(argv[1], "eat-yum") == 0) {
|
|
krh@15
|
926 |
set = razor_set_create_from_yum_filelist(STDIN_FILENO);
|
|
krh@15
|
927 |
if (set == NULL)
|
|
krh@15
|
928 |
return 1;
|
|
krh@15
|
929 |
razor_set_write(set, rawhide_repo_filename);
|
|
krh@15
|
930 |
razor_set_destroy(set);
|
|
krh@18
|
931 |
printf("wrote %s\n", rawhide_repo_filename);
|
|
krh@28
|
932 |
} else if (strcmp(argv[1], "import-rpmdb") == 0) {
|
|
krh@28
|
933 |
set = razor_set_create_from_rpmdb();
|
|
krh@28
|
934 |
if (set == NULL)
|
|
krh@28
|
935 |
return 1;
|
|
krh@28
|
936 |
razor_set_write(set, repo_filename);
|
|
krh@28
|
937 |
razor_set_destroy(set);
|
|
krh@28
|
938 |
printf("wrote %s\n", repo_filename);
|
|
krh@21
|
939 |
} else if (strcmp(argv[1], "validate") == 0) {
|
|
krh@21
|
940 |
set = razor_set_open(repo_filename);
|
|
krh@21
|
941 |
if (set == NULL)
|
|
krh@21
|
942 |
return 1;
|
|
krh@21
|
943 |
razor_set_list_unsatisfied(set);
|
|
krh@21
|
944 |
razor_set_destroy(set);
|
|
krh@0
|
945 |
} else {
|
|
krh@0
|
946 |
usage();
|
|
krh@0
|
947 |
}
|
|
krh@0
|
948 |
|
|
krh@0
|
949 |
return 0;
|
|
krh@0
|
950 |
}
|