razor: razor.c@f23a93d41f32 (annotated)

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@35	13	#include <ctype.h>
krh@54	14	#include <fnmatch.h>
krh@0	15
krh@27	16	#include "razor.h"
krh@6	17
krh@30	18	struct array {
krh@30	19	void *data;
krh@30	20	int size, alloc;
krh@30	21	};
krh@30	22
krh@30	23	struct razor_set_section {
krh@30	24	unsigned int type;
krh@30	25	unsigned int offset;
krh@30	26	unsigned int size;
krh@30	27	};
krh@30	28
krh@30	29	struct razor_set_header {
krh@30	30	unsigned int magic;
krh@30	31	unsigned int version;
krh@30	32	struct razor_set_section sections[0];
krh@30	33	};
krh@30	34
krh@30	35	#define RAZOR_MAGIC 0x7a7a7a7a
krh@30	36	#define RAZOR_VERSION 1
krh@30	37
krh@61	38	#define RAZOR_ENTRY_LAST 0x80000000ul
krh@61	39	#define RAZOR_IMMEDIATE 0x80000000ul
krh@61	40	#define RAZOR_ENTRY_MASK 0x00fffffful
krh@61	41
krh@66	42	#define RAZOR_STRING_POOL 0
krh@66	43	#define RAZOR_PACKAGES 1
krh@66	44	#define RAZOR_PROPERTIES 2
krh@66	45	#define RAZOR_FILES 3
krh@66	46	#define RAZOR_PACKAGE_POOL 4
krh@66	47	#define RAZOR_PROPERTY_POOL 5
krh@66	48	#define RAZOR_FILE_POOL 6
krh@30	49
krh@30	50	struct razor_package {
krh@30	51	unsigned long name;
krh@30	52	unsigned long version;
krh@66	53	unsigned long properties;
krh@56	54	unsigned long files;
krh@30	55	};
krh@30	56
krh@30	57	struct razor_property {
krh@30	58	unsigned long name;
krh@30	59	unsigned long version;
krh@30	60	unsigned long packages;
krh@30	61	};
krh@30	62
krh@48	63	struct razor_entry {
krh@48	64	unsigned long name;
krh@48	65	unsigned long start;
krh@52	66	unsigned long packages;
krh@48	67	};
krh@48	68
krh@30	69	struct razor_set {
krh@30	70	struct array string_pool;
krh@30	71	struct array packages;
krh@66	72	struct array properties;
krh@56	73	struct array files;
krh@56	74	struct array package_pool;
krh@66	75	struct array property_pool;
krh@56	76	struct array file_pool;
krh@30	77	struct razor_set_header *header;
krh@30	78	};
krh@30	79
krh@52	80	struct import_entry {
krh@52	81	unsigned long package;
krh@52	82	char *name;
krh@52	83	};
krh@52	84
krh@52	85	struct import_directory {
krh@52	86	unsigned long name, count;
krh@52	87	struct array files;
krh@52	88	struct array packages;
krh@52	89	struct import_directory *last;
krh@52	90	};
krh@52	91
krh@30	92	struct razor_importer {
krh@30	93	struct razor_set *set;
krh@32	94	struct array buckets;
krh@30	95	struct razor_package *package;
krh@66	96	struct array properties;
krh@48	97	struct array files;
krh@30	98	};
krh@30	99
krh@13	100	static void
krh@13	101	array_init(struct array *array)
krh@13	102	{
krh@13	103	memset(array, 0, sizeof *array);
krh@13	104	}
krh@13	105
krh@13	106	static void
krh@13	107	array_release(struct array *array)
krh@13	108	{
krh@13	109	free(array->data);
krh@13	110	}
krh@13	111
krh@6	112	static void *
krh@6	113	array_add(struct array *array, int size)
krh@6	114	{
krh@6	115	int alloc;
krh@6	116	void data, p;
krh@6	117
krh@6	118	if (array->alloc > 0)
krh@6	119	alloc = array->alloc;
krh@6	120	else
krh@10	121	alloc = 16;
krh@6	122
krh@6	123	while (alloc < array->size + size)
krh@6	124	alloc *= 2;
krh@6	125
krh@6	126	if (array->alloc < alloc) {
krh@6	127	data = realloc(array->data, alloc);
krh@6	128	if (data == NULL)
krh@6	129	return 0;
krh@6	130	array->data = data;
krh@6	131	array->alloc = alloc;
krh@6	132	}
krh@6	133
krh@6	134	p = array->data + array->size;
krh@6	135	array->size += size;
krh@6	136
krh@6	137	return p;
krh@6	138	}
krh@6	139
krh@0	140	static int
krh@0	141	write_to_fd(int fd, void *p, size_t size)
krh@0	142	{
krh@0	143	int rest, len;
krh@0	144
krh@0	145	rest = size;
krh@0	146	while (rest > 0) {
krh@0	147	len = write(fd, p, rest);
krh@0	148	if (len < 0)
krh@0	149	return -1;
krh@0	150	rest -= len;
krh@0	151	}
krh@0	152
krh@0	153	return 0;
krh@0	154	}
krh@0	155
krh@0	156	static void *
krh@0	157	zalloc(size_t size)
krh@0	158	{
krh@0	159	void *p;
krh@0	160
krh@0	161	p = malloc(size);
krh@0	162	memset(p, 0, size);
krh@0	163
krh@0	164	return p;
krh@0	165	}
krh@0	166
krh@19	167	struct razor_set_section razor_sections[] = {
krh@56	168	{ RAZOR_STRING_POOL, offsetof(struct razor_set, string_pool) },
krh@19	169	{ RAZOR_PACKAGES, offsetof(struct razor_set, packages) },
krh@66	170	{ RAZOR_PROPERTIES, offsetof(struct razor_set, properties) },
krh@56	171	{ RAZOR_FILES, offsetof(struct razor_set, files) },
krh@39	172	{ RAZOR_PACKAGE_POOL, offsetof(struct razor_set, package_pool) },
krh@66	173	{ RAZOR_PROPERTY_POOL, offsetof(struct razor_set, property_pool) },
krh@56	174	{ RAZOR_FILE_POOL, offsetof(struct razor_set, file_pool) },
krh@19	175	};
krh@19	176
krh@4	177	struct razor_set *
krh@4	178	razor_set_create(void)
krh@0	179	{
krh@18	180	return zalloc(sizeof(struct razor_set));
krh@0	181	}
krh@0	182
krh@4	183	struct razor_set *
krh@4	184	razor_set_open(const char *filename)
krh@0	185	{
krh@4	186	struct razor_set *set;
krh@19	187	struct razor_set_section *s;
krh@0	188	struct stat stat;
krh@19	189	struct array *array;
krh@19	190	int fd;
krh@0	191
krh@4	192	set = zalloc(sizeof *set);
krh@0	193	fd = open(filename, O_RDONLY);
krh@0	194	if (fstat(fd, &stat) < 0)
krh@0	195	return NULL;
krh@4	196	set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
krh@4	197	if (set->header == MAP_FAILED) {
krh@4	198	free(set);
krh@0	199	return NULL;
krh@0	200	}
krh@0	201
krh@19	202	for (s = set->header->sections; ~s->type; s++) {
krh@19	203	if (s->type >= ARRAY_SIZE(razor_sections))
krh@19	204	continue;
krh@19	205	if (s->type != razor_sections[s->type].type)
krh@19	206	continue;
krh@19	207	array = (void *) set + razor_sections[s->type].offset;
krh@19	208	array->data = (void *) set->header + s->offset;
krh@19	209	array->size = s->size;
krh@19	210	array->alloc = s->size;
krh@0	211	}
krh@0	212	close(fd);
krh@0	213
krh@4	214	return set;
krh@0	215	}
krh@0	216
krh@0	217	void
krh@4	218	razor_set_destroy(struct razor_set *set)
krh@0	219	{
krh@0	220	unsigned int size;
krh@19	221	struct array *a;
krh@0	222	int i;
krh@0	223
krh@4	224	if (set->header) {
krh@4	225	for (i = 0; set->header->sections[i].type; i++)
krh@0	226	;
krh@4	227	size = set->header->sections[i].type;
krh@4	228	munmap(set->header, size);
krh@0	229	} else {
krh@19	230	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19	231	a = (void *) set + razor_sections[i].offset;
krh@19	232	free(a->data);
krh@19	233	}
krh@0	234	}
krh@0	235
krh@4	236	free(set);
krh@0	237	}
krh@0	238
krh@43	239	int
krh@4	240	razor_set_write(struct razor_set set, const char filename)
krh@0	241	{
krh@0	242	char data[4096];
krh@4	243	struct razor_set_header header = (struct razor_set_header ) data;
krh@19	244	struct array *a;
krh@17	245	unsigned long offset;
krh@17	246	int i, fd;
krh@0	247
krh@0	248	memset(data, 0, sizeof data);
krh@4	249	header->magic = RAZOR_MAGIC;
krh@4	250	header->version = RAZOR_VERSION;
krh@17	251	offset = sizeof data;
krh@0	252
krh@19	253	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19	254	if (razor_sections[i].type != i)
krh@19	255	continue;
krh@19	256	a = (void *) set + razor_sections[i].offset;
krh@19	257	header->sections[i].type = i;
krh@17	258	header->sections[i].offset = offset;
krh@19	259	header->sections[i].size = a->size;
krh@19	260	offset += (a->size + 4095) & ~4095;
krh@17	261	}
krh@0	262
krh@19	263	header->sections[i].type = ~0;
krh@17	264	header->sections[i].offset = 0;
krh@17	265	header->sections[i].size = 0;
krh@10	266
krh@0	267	fd = open(filename, O_CREAT \| O_WRONLY \| O_TRUNC, 0666);
krh@0	268	if (fd < 0)
krh@0	269	return -1;
krh@0	270
krh@0	271	write_to_fd(fd, data, sizeof data);
krh@19	272	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19	273	if (razor_sections[i].type != i)
krh@19	274	continue;
krh@19	275	a = (void *) set + razor_sections[i].offset;
krh@19	276	write_to_fd(fd, a->data, (a->size + 4095) & ~4095);
krh@19	277	}
krh@17	278
krh@17	279	close(fd);
krh@0	280
krh@0	281	return 0;
krh@0	282	}
krh@0	283
krh@0	284	static unsigned int
krh@0	285	hash_string(const char *key)
krh@0	286	{
krh@0	287	const char *p;
krh@0	288	unsigned int hash = 0;
krh@0	289
krh@0	290	for (p = key; *p; p++)
krh@9	291	hash = (hash * 617) ^ *p;
krh@0	292
krh@0	293	return hash;
krh@0	294	}
krh@0	295
krh@32	296	static unsigned long
krh@32	297	razor_importer_lookup(struct razor_importer importer, const char key)
krh@0	298	{
krh@6	299	unsigned int mask, start, i;
krh@6	300	unsigned long *b;
krh@6	301	char *pool;
krh@0	302
krh@32	303	pool = importer->set->string_pool.data;
krh@32	304	mask = importer->buckets.alloc - 1;
krh@6	305	start = hash_string(key) * sizeof(unsigned long);
krh@0	306
krh@32	307	for (i = 0; i < importer->buckets.alloc; i += sizeof *b) {
krh@32	308	b = importer->buckets.data + ((start + i) & mask);
krh@6	309
krh@6	310	if (*b == 0)
krh@0	311	return 0;
krh@0	312
krh@6	313	if (strcmp(key, &pool[*b]) == 0)
krh@6	314	return *b;
krh@6	315	}
krh@0	316
krh@0	317	return 0;
krh@0	318	}
krh@0	319
krh@0	320	static unsigned long
krh@4	321	add_to_string_pool(struct razor_set set, const char key)
krh@0	322	{
krh@6	323	int len;
krh@6	324	char *p;
krh@0	325
krh@0	326	len = strlen(key) + 1;
krh@6	327	p = array_add(&set->string_pool, len);
krh@6	328	memcpy(p, key, len);
krh@0	329
krh@6	330	return p - (char *) set->string_pool.data;
krh@0	331	}
krh@0	332
krh@10	333	static unsigned long
krh@39	334	add_to_property_pool(struct array pool, struct array properties)
krh@10	335	{
krh@10	336	unsigned long *p;
krh@10	337
krh@39	338	p = array_add(pool, properties->size);
krh@10	339	memcpy(p, properties->data, properties->size);
krh@64	340	p[properties->size / sizeof *p - 1] \|= RAZOR_IMMEDIATE;
krh@10	341
krh@39	342	return p - (unsigned long *) pool->data;
krh@10	343	}
krh@10	344
krh@0	345	static void
krh@32	346	do_insert(struct razor_importer *importer, 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@32	352	key = (char *) importer->set->string_pool.data + value;
krh@32	353	mask = importer->buckets.alloc - 1;
krh@6	354	start = hash_string(key) * sizeof(unsigned long);
krh@6	355
krh@32	356	for (i = 0; i < importer->buckets.alloc; i += sizeof *b) {
krh@32	357	b = importer->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@32	365	static unsigned long
krh@32	366	razor_importer_insert(struct razor_importer importer, const char key)
krh@0	367	{
krh@6	368	unsigned long value, buckets, b, *end;
krh@6	369	int alloc;
krh@0	370
krh@32	371	alloc = importer->buckets.alloc;
krh@32	372	array_add(&importer->buckets, 4 * sizeof *buckets);
krh@32	373	if (alloc != importer->buckets.alloc) {
krh@32	374	end = importer->buckets.data + alloc;
krh@32	375	memset(end, 0, importer->buckets.alloc - alloc);
krh@32	376	for (b = importer->buckets.data; b < end; b++) {
krh@6	377	value = *b;
krh@6	378	if (value != 0) {
krh@6	379	*b = 0;
krh@32	380	do_insert(importer, value);
krh@6	381	}
krh@0	382	}
krh@0	383	}
krh@0	384
krh@32	385	value = add_to_string_pool(importer->set, key);
krh@32	386	do_insert (importer, value);
krh@0	387
krh@0	388	return value;
krh@0	389	}
krh@0	390
krh@30	391	static unsigned long
krh@32	392	razor_importer_tokenize(struct razor_importer importer, const char string)
krh@0	393	{
krh@0	394	unsigned long token;
krh@0	395
krh@13	396	if (string == NULL)
krh@32	397	return razor_importer_tokenize(importer, "");
krh@13	398
krh@32	399	token = razor_importer_lookup(importer, string);
krh@0	400	if (token != 0)
krh@0	401	return token;
krh@0	402
krh@32	403	return razor_importer_insert(importer, string);
krh@0	404	}
krh@0	405
krh@27	406	void
krh@30	407	razor_importer_begin_package(struct razor_importer *importer,
krh@30	408	const char name, const char version)
krh@13	409	{
krh@25	410	struct razor_package *p;
krh@13	411
krh@30	412	p = array_add(&importer->set->packages, sizeof *p);
krh@32	413	p->name = razor_importer_tokenize(importer, name);
krh@32	414	p->version = razor_importer_tokenize(importer, version);
krh@13	415
krh@30	416	importer->package = p;
krh@66	417	array_init(&importer->properties);
krh@13	418	}
krh@13	419
krh@13	420	void
krh@30	421	razor_importer_finish_package(struct razor_importer *importer)
krh@13	422	{
krh@25	423	struct razor_package *p;
krh@13	424
krh@30	425	p = importer->package;
krh@66	426	p->properties = add_to_property_pool(&importer->set->property_pool,
krh@66	427	&importer->properties);
krh@13	428
krh@66	429	array_release(&importer->properties);
krh@13	430	}
krh@13	431
krh@66	432	void
krh@30	433	razor_importer_add_property(struct razor_importer *importer,
krh@66	434	const char name, const char version,
krh@66	435	enum razor_property_type type)
krh@13	436	{
krh@25	437	struct razor_property *p;
krh@13	438	unsigned long *r;
krh@13	439
krh@66	440	p = array_add(&importer->set->properties, sizeof *p);
krh@66	441	p->name = razor_importer_tokenize(importer, name) \| (type << 30);
krh@32	442	p->version = razor_importer_tokenize(importer, version);
krh@30	443	p->packages = importer->package -
krh@30	444	(struct razor_package *) importer->set->packages.data;
krh@13	445
krh@66	446	r = array_add(&importer->properties, sizeof *r);
krh@66	447	r = p - (struct razor_property ) importer->set->properties.data;
krh@30	448	}
krh@30	449
krh@46	450	void
krh@46	451	razor_importer_add_file(struct razor_importer importer, const char name)
krh@46	452	{
krh@52	453	struct import_entry *e;
krh@48	454
krh@52	455	e = array_add(&importer->files, sizeof *e);
krh@52	456
krh@52	457	e->package = importer->package -
krh@52	458	(struct razor_package *) importer->set->packages.data;
krh@52	459	e->name = strdup(name);
krh@46	460	}
krh@46	461
krh@30	462	struct razor_importer *
krh@30	463	razor_importer_new(void)
krh@30	464	{
krh@30	465	struct razor_importer *importer;
krh@30	466
krh@30	467	importer = zalloc(sizeof *importer);
krh@30	468	importer->set = razor_set_create();
krh@30	469
krh@30	470	return importer;
krh@9	471	}
krh@9	472
krh@22	473	typedef int (compare_with_data_func_t)(const void p1,
krh@22	474	const void *p,
krh@22	475	void *data);
krh@22	476
krh@25	477	struct qsort_context {
krh@25	478	size_t size;
krh@25	479	compare_with_data_func_t compare;
krh@25	480	void *data;
krh@25	481	};
krh@25	482
krh@22	483	static void
krh@22	484	qsort_swap(void p1, void p2, size_t size)
krh@22	485	{
krh@22	486	char buffer[size];
krh@22	487
krh@22	488	memcpy(buffer, p1, size);
krh@22	489	memcpy(p1, p2, size);
krh@22	490	memcpy(p2, buffer, size);
krh@22	491	}
krh@22	492
krh@25	493	static void
krh@25	494	__qsort_with_data(void base, size_t nelem, unsigned long map,
krh@25	495	struct qsort_context *ctx)
krh@22	496	{
krh@22	497	void p, start, end, pivot;
krh@25	498	unsigned long mp, mstart, *mend, tmp;
krh@22	499	int left, right, result;
krh@25	500	size_t size = ctx->size;
krh@22	501
krh@22	502	p = base;
krh@22	503	start = base;
krh@22	504	end = base + nelem * size;
krh@25	505	mp = map;
krh@25	506	mstart = map;
krh@25	507	mend = map + nelem;
krh@22	508	pivot = base + (random() % nelem) * size;
krh@25	509
krh@22	510	while (p < end) {
krh@25	511	result = ctx->compare(p, pivot, ctx->data);
krh@22	512	if (result < 0) {
krh@22	513	qsort_swap(p, start, size);
krh@25	514	tmp = *mp;
krh@25	515	mp = mstart;
krh@25	516	*mstart = tmp;
krh@22	517	if (start == pivot)
krh@22	518	pivot = p;
krh@22	519	start += size;
krh@25	520	mstart++;
krh@22	521	p += size;
krh@29	522	mp++;
krh@22	523	} else if (result == 0) {
krh@22	524	p += size;
krh@25	525	mp++;
krh@22	526	} else {
krh@22	527	end -= size;
krh@25	528	mend--;
krh@22	529	qsort_swap(p, end, size);
krh@25	530	tmp = *mp;
krh@29	531	mp = mend;
krh@29	532	*mend = tmp;
krh@22	533	if (end == pivot)
krh@22	534	pivot = p;
krh@22	535	}
krh@22	536	}
krh@22	537
krh@22	538	left = (start - base) / size;
krh@22	539	right = (base + nelem * size - end) / size;
krh@22	540	if (left > 1)
krh@25	541	__qsort_with_data(base, left, map, ctx);
krh@22	542	if (right > 1)
krh@25	543	__qsort_with_data(end, right, mend, ctx);
krh@25	544	}
krh@25	545
krh@25	546	unsigned long *
krh@25	547	qsort_with_data(void *base, size_t nelem, size_t size,
krh@25	548	compare_with_data_func_t compare, void *data)
krh@25	549	{
krh@25	550	struct qsort_context ctx;
krh@25	551	unsigned long *map;
krh@25	552	int i;
krh@25	553
krh@25	554	ctx.size = size;
krh@25	555	ctx.compare = compare;
krh@25	556	ctx.data = data;
krh@25	557
krh@25	558	map = malloc(nelem * sizeof (unsigned long));
krh@25	559	for (i = 0; i < nelem; i++)
krh@25	560	map[i] = i;
krh@25	561
krh@25	562	__qsort_with_data(base, nelem, map, &ctx);
krh@25	563
krh@25	564	return map;
krh@22	565	}
krh@9	566
krh@9	567	static int
krh@35	568	versioncmp(const char s1, const char s2)
krh@35	569	{
krh@35	570	const char p1, p2;
krh@35	571	long n1, n2;
krh@35	572	int res;
krh@35	573
krh@35	574	n1 = strtol(s1, (char **) &p1, 0);
krh@35	575	n2 = strtol(s2, (char **) &p2, 0);
krh@35	576
krh@35	577	/* Epoch; if one but not the other has an epoch set, default
krh@35	578	* the epoch-less version to 0. */
krh@35	579	res = (p1 == ':') - (p2 == ':');
krh@35	580	if (res < 0) {
krh@35	581	n1 = 0;
krh@35	582	p1 = s1;
krh@35	583	p2++;
krh@35	584	} else if (res > 0) {
krh@35	585	p1++;
krh@35	586	n2 = 0;
krh@35	587	p2 = s2;
krh@35	588	}
krh@35	589
krh@35	590	if (n1 != n2)
krh@35	591	return n1 - n2;
krh@35	592	while (p1 && p2) {
krh@35	593	if (p1 != p2)
krh@35	594	return p1 - p2;
krh@35	595	p1++;
krh@35	596	p2++;
krh@35	597	if (isdigit(p1) && isdigit(p2))
krh@35	598	return versioncmp(p1, p2);
krh@35	599	}
krh@35	600
krh@35	601	return p1 - p2;
krh@35	602	}
krh@35	603
krh@35	604
krh@35	605	static int
krh@22	606	compare_packages(const void p1, const void p2, void *data)
krh@9	607	{
krh@25	608	const struct razor_package pkg1 = p1, pkg2 = p2;
krh@22	609	struct razor_set *set = data;
krh@22	610	char *pool = set->string_pool.data;
krh@9	611
krh@23	612	if (pkg1->name == pkg2->name)
krh@35	613	return versioncmp(&pool[pkg1->version], &pool[pkg2->version]);
krh@23	614	else
krh@23	615	return strcmp(&pool[pkg1->name], &pool[pkg2->name]);
krh@9	616	}
krh@9	617
krh@9	618	static int
krh@22	619	compare_properties(const void p1, const void p2, void *data)
krh@9	620	{
krh@25	621	const struct razor_property prop1 = p1, prop2 = p2;
krh@22	622	struct razor_set *set = data;
krh@22	623	char *pool = set->string_pool.data;
krh@9	624
krh@23	625	if (prop1->name == prop2->name)
krh@66	626	return versioncmp(&pool[prop1->version],
krh@66	627	&pool[prop2->version]);
krh@66	628	else if ((prop1->name & RAZOR_ENTRY_MASK) == (prop2->name & RAZOR_ENTRY_MASK))
krh@66	629	return (prop1->name >> 30) - (prop2->name >> 30);
krh@12	630	else
krh@66	631	return strcmp(&pool[prop1->name & RAZOR_ENTRY_MASK],
krh@66	632	&pool[prop2->name & RAZOR_ENTRY_MASK]);
krh@9	633	}
krh@9	634
krh@10	635	static unsigned long *
krh@66	636	uniqueify_properties(struct razor_set *set)
krh@9	637	{
krh@25	638	struct razor_property rp, up, *rp_end;
krh@18	639	struct array pkgs, p;
krh@25	640	unsigned long map, rmap, *r;
krh@18	641	int i, count, unique;
krh@9	642
krh@66	643	count = set->properties.size / sizeof(struct razor_property);
krh@66	644	map = qsort_with_data(set->properties.data,
krh@25	645	count,
krh@25	646	sizeof(struct razor_property),
krh@25	647	compare_properties,
krh@25	648	set);
krh@9	649
krh@66	650	rp_end = set->properties.data + set->properties.size;
krh@25	651	rmap = malloc(count * sizeof *map);
krh@25	652	pkgs = zalloc(count * sizeof *pkgs);
krh@66	653	for (rp = set->properties.data, up = rp, i = 0; rp < rp_end; rp++, i++) {
krh@25	654	if (rp->name != up->name \|\| rp->version != up->version) {
krh@25	655	up++;
krh@25	656	up->name = rp->name;
krh@25	657	up->version = rp->version;
krh@10	658	}
krh@25	659
krh@66	660	unique = up - (struct razor_property *) set->properties.data;
krh@25	661	rmap[map[i]] = unique;
krh@25	662	r = array_add(&pkgs[unique], sizeof *r);
krh@25	663	*r = rp->packages;
krh@10	664	}
krh@25	665	free(map);
krh@9	666
krh@25	667	up++;
krh@66	668	set->properties.size = (void *) up - set->properties.data;
krh@25	669	rp_end = up;
krh@66	670	for (rp = set->properties.data, p = pkgs; rp < rp_end; rp++, p++) {
krh@61	671	if (p->size / sizeof *r == 1) {
krh@61	672	r = p->data;
krh@61	673	rp->packages = *r \| RAZOR_IMMEDIATE;
krh@61	674	} else {
krh@61	675	rp->packages =
krh@61	676	add_to_property_pool(&set->package_pool, p);
krh@61	677	}
krh@25	678	array_release(p);
krh@18	679	}
krh@18	680
krh@18	681	free(pkgs);
krh@18	682
krh@25	683	return rmap;
krh@10	684	}
krh@10	685
krh@10	686	static void
krh@39	687	remap_links(struct array links, unsigned long map)
krh@10	688	{
krh@39	689	unsigned long p, end;
krh@10	690
krh@39	691	end = links->data + links->size;
krh@39	692	for (p = links->data; p < end; p++)
krh@64	693	p = map[p & RAZOR_ENTRY_MASK] \| (*p & ~RAZOR_ENTRY_MASK);
krh@9	694	}
krh@9	695
krh@48	696	static int
krh@48	697	compare_filenames(const void p1, const void p2, void *data)
krh@48	698	{
krh@52	699	const struct import_entry *e1 = p1;
krh@52	700	const struct import_entry *e2 = p2;
krh@48	701
krh@52	702	return strcmp(e1->name, e2->name);
krh@48	703	}
krh@48	704
krh@48	705	static void
krh@52	706	count_entries(struct import_directory *d)
krh@48	707	{
krh@52	708	struct import_directory p, end;
krh@48	709
krh@48	710	p = d->files.data;
krh@48	711	end = d->files.data + d->files.size;
krh@48	712	d->count = 0;
krh@48	713	while (p < end) {
krh@48	714	count_entries(p);
krh@48	715	d->count += p->count + 1;
krh@48	716	p++;
krh@48	717	}
krh@48	718	}
krh@48	719
krh@48	720	static void
krh@52	721	serialize_files(struct razor_set *set,
krh@52	722	struct import_directory d, struct array array)
krh@48	723	{
krh@52	724	struct import_directory p, end;
krh@56	725	struct razor_entry *e = NULL;
krh@60	726	unsigned long s, *r;
krh@48	727
krh@48	728	p = d->files.data;
krh@48	729	end = d->files.data + d->files.size;
krh@48	730	s = array->size / sizeof e + d->files.size / sizeof p;
krh@48	731	while (p < end) {
krh@48	732	e = array_add(array, sizeof *e);
krh@48	733	e->name = p->name;
krh@56	734	e->start = p->count > 0 ? s : 0;
krh@48	735	s += p->count;
krh@60	736
krh@64	737	if (p->packages.size == 0) {
krh@64	738	/* FIXME: We need to make sure this is handled
krh@64	739	* correctly as the empty list. */
krh@64	740	e->packages = 0 \| RAZOR_IMMEDIATE;
krh@64	741	} else if (p->packages.size / sizeof *r == 1) {
krh@60	742	r = p->packages.data;
krh@60	743	e->packages = *r \| RAZOR_IMMEDIATE;
krh@60	744	} else {
krh@60	745	e->packages = add_to_property_pool(&set->package_pool,
krh@60	746	&p->packages);
krh@60	747	}
krh@52	748	array_release(&p->packages);
krh@48	749	p++;
krh@48	750	}
krh@56	751	if (e != NULL)
krh@56	752	e->name \|= RAZOR_ENTRY_LAST;
krh@48	753
krh@48	754	p = d->files.data;
krh@48	755	end = d->files.data + d->files.size;
krh@48	756	while (p < end) {
krh@52	757	serialize_files(set, p, array);
krh@48	758	p++;
krh@48	759	}
krh@48	760	}
krh@48	761
krh@48	762	static void
krh@61	763	remap_property_package_links(struct array properties, unsigned long rmap)
krh@61	764	{
krh@61	765	struct razor_property p, end;
krh@61	766
krh@61	767	end = properties->data + properties->size;
krh@61	768	for (p = properties->data; p < end; p++)
krh@61	769	if (p->packages & RAZOR_IMMEDIATE)
krh@61	770	p->packages = rmap[p->packages & RAZOR_ENTRY_MASK] \|
krh@61	771	RAZOR_IMMEDIATE;
krh@61	772	}
krh@61	773
krh@61	774	static void
krh@48	775	build_file_tree(struct razor_importer *importer)
krh@48	776	{
krh@48	777	int count, i, length;
krh@52	778	struct import_entry *filenames;
krh@52	779	char f, end;
krh@52	780	unsigned long name, *r;
krh@48	781	char dirname[256];
krh@52	782	struct import_directory *d, root;
krh@48	783	struct razor_entry *e;
krh@48	784
krh@52	785	count = importer->files.size / sizeof (struct import_entry);
krh@48	786	qsort_with_data(importer->files.data,
krh@48	787	count,
krh@52	788	sizeof (struct import_entry),
krh@48	789	compare_filenames,
krh@48	790	NULL);
krh@48	791
krh@48	792	root.name = razor_importer_tokenize(importer, "");
krh@48	793	array_init(&root.files);
krh@52	794	array_init(&root.packages);
krh@48	795	root.last = NULL;
krh@48	796
krh@48	797	filenames = importer->files.data;
krh@48	798	for (i = 0; i < count; i++) {
krh@52	799	f = filenames[i].name;
krh@48	800	if (*f != '/')
krh@48	801	continue;
krh@57	802	f++;
krh@48	803
krh@48	804	d = &root;
krh@48	805	while (*f) {
krh@57	806	end = strchr(f, '/');
krh@48	807	if (end == NULL)
krh@48	808	end = f + strlen(f);
krh@57	809	length = end - f;
krh@57	810	memcpy(dirname, f, length);
krh@48	811	dirname[length] ='\0';
krh@48	812	name = razor_importer_tokenize(importer, dirname);
krh@48	813	if (d->last == NULL \|\| d->last->name != name) {
krh@48	814	d->last = array_add(&d->files, sizeof *d);
krh@48	815	d->last->name = name;
krh@48	816	d->last->last = NULL;
krh@48	817	array_init(&d->last->files);
krh@52	818	array_init(&d->last->packages);
krh@48	819	}
krh@48	820	d = d->last;
krh@57	821	f = end + 1;
krh@57	822	if (*end == '\0')
krh@57	823	break;
krh@48	824	}
krh@48	825
krh@52	826	r = array_add(&d->packages, sizeof *r);
krh@52	827	*r = filenames[i].package;
krh@52	828	free(filenames[i].name);
krh@48	829	}
krh@48	830
krh@48	831	count_entries(&root);
krh@56	832	array_init(&importer->set->files);
krh@48	833
krh@56	834	e = array_add(&importer->set->files, sizeof *e);
krh@56	835	e->name = root.name \| RAZOR_ENTRY_LAST;
krh@48	836	e->start = 1;
krh@56	837	e->packages = 0;
krh@48	838
krh@56	839	serialize_files(importer->set, &root, &importer->set->files);
krh@48	840
krh@48	841	array_release(&importer->files);
krh@48	842	}
krh@48	843
krh@56	844	static void
krh@60	845	build_package_file_lists(struct razor_set set, unsigned long rmap)
krh@54	846	{
krh@56	847	struct razor_package p, packages;
krh@56	848	struct array *pkgs;
krh@54	849	struct razor_entry e, end;
krh@56	850	unsigned long r, q;
krh@56	851	int i, count;
krh@54	852
krh@56	853	count = set->packages.size / sizeof *p;
krh@56	854	pkgs = zalloc(count * sizeof *pkgs);
krh@54	855
krh@56	856	e = set->files.data;
krh@56	857	end = set->files.data + set->files.size;
krh@54	858	while (e < end) {
krh@60	859	if (e->packages & RAZOR_IMMEDIATE) {
krh@60	860	e->packages = rmap[e->packages & RAZOR_ENTRY_MASK] \|
krh@60	861	RAZOR_IMMEDIATE;
krh@60	862	r = &e->packages;
krh@60	863	} else {
krh@60	864	r = (unsigned long *) set->package_pool.data + e->packages;
krh@60	865	}
krh@60	866
krh@64	867	while (1) {
krh@60	868	q = array_add(&pkgs[r & RAZOR_ENTRY_MASK], sizeof q);
krh@56	869	q = e - (struct razor_entry ) set->files.data;
krh@60	870	if (*r++ & RAZOR_IMMEDIATE)
krh@60	871	break;
krh@54	872	}
krh@54	873	e++;
krh@54	874	}
krh@54	875
krh@56	876	packages = set->packages.data;
krh@56	877	for (i = 0; i < count; i++) {
krh@56	878	packages[i].files =
krh@56	879	add_to_property_pool(&set->file_pool, &pkgs[i]);
krh@56	880	array_release(&pkgs[i]);
krh@48	881	}
krh@56	882	free(pkgs);
krh@52	883	}
krh@52	884
krh@27	885	struct razor_set *
krh@30	886	razor_importer_finish(struct razor_importer *importer)
krh@9	887	{
krh@30	888	struct razor_set *set;
krh@39	889	unsigned long map, rmap;
krh@39	890	int i, count;
krh@18	891
krh@66	892	map = uniqueify_properties(importer->set);
krh@66	893	remap_links(&importer->set->property_pool, map);
krh@39	894	free(map);
krh@25	895
krh@30	896	count = importer->set->packages.size / sizeof(struct razor_package);
krh@30	897	map = qsort_with_data(importer->set->packages.data,
krh@25	898	count,
krh@25	899	sizeof(struct razor_package),
krh@25	900	compare_packages,
krh@30	901	importer->set);
krh@39	902
krh@39	903	rmap = malloc(count * sizeof *rmap);
krh@39	904	for (i = 0; i < count; i++)
krh@39	905	rmap[map[i]] = i;
krh@25	906	free(map);
krh@13	907
krh@48	908	build_file_tree(importer);
krh@52	909	remap_links(&importer->set->package_pool, rmap);
krh@60	910	build_package_file_lists(importer->set, rmap);
krh@66	911	remap_property_package_links(&importer->set->properties, rmap);
krh@52	912	free(rmap);
krh@48	913
krh@30	914	set = importer->set;
krh@32	915	array_release(&importer->buckets);
krh@30	916	free(importer);
krh@30	917
krh@30	918	return set;
krh@9	919	}
krh@9	920
krh@0	921	void
krh@54	922	razor_set_list(struct razor_set set, const char pattern)
krh@3	923	{
krh@6	924	struct razor_package p, end;
krh@54	925	int with_version = 0;
krh@6	926	char *pool;
krh@3	927
krh@6	928	pool = set->string_pool.data;
krh@6	929	end = set->packages.data + set->packages.size;
krh@54	930	for (p = set->packages.data; p < end; p++) {
krh@54	931	if (pattern && fnmatch(pattern, &pool[p->name], 0) != 0)
krh@54	932	continue;
krh@54	933	if (with_version)
krh@59	934	printf("%s-%s\n", &pool[p->name], &pool[p->version]);
krh@54	935	else
krh@54	936	printf("%s\n", &pool[p->name]);
krh@54	937	}
krh@3	938	}
krh@3	939
krh@16	940	struct razor_set *bsearch_set;
krh@16	941
krh@16	942	static int
krh@16	943	compare_package_name(const void key, const void data)
krh@16	944	{
krh@16	945	const struct razor_package *p = data;
krh@16	946	char *pool;
krh@16	947
krh@16	948	pool = bsearch_set->string_pool.data;
krh@16	949
krh@16	950	return strcmp(key, &pool[p->name]);
krh@16	951	}
krh@16	952
krh@10	953	struct razor_package *
krh@10	954	razor_set_get_package(struct razor_set set, const char package)
krh@10	955	{
krh@16	956	bsearch_set = set;
krh@16	957	return bsearch(package, set->packages.data,
krh@16	958	set->packages.size / sizeof(struct razor_package),
krh@16	959	sizeof(struct razor_package), compare_package_name);
krh@10	960	}
krh@10	961
krh@18	962	static int
krh@18	963	compare_property_name(const void key, const void data)
krh@18	964	{
krh@18	965	const struct razor_property *p = data;
krh@18	966	char *pool;
krh@18	967
krh@18	968	pool = bsearch_set->string_pool.data;
krh@18	969
krh@66	970	return strcmp(key, &pool[p->name & RAZOR_ENTRY_MASK]);
krh@18	971	}
krh@18	972
krh@18	973	struct razor_property *
krh@66	974	razor_set_get_property(struct razor_set set, const char property)
krh@18	975	{
krh@18	976	struct razor_property p, start;
krh@18	977
krh@18	978	bsearch_set = set;
krh@66	979	p = bsearch(property, set->properties.data,
krh@66	980	set->properties.size / sizeof(struct razor_property),
krh@18	981	sizeof(struct razor_property), compare_property_name);
krh@18	982
krh@66	983	start = set->properties.data;
krh@66	984	while (p > start &&
krh@66	985	((p - 1)->name & RAZOR_ENTRY_MASK) ==
krh@66	986	(p->name & RAZOR_ENTRY_MASK))
krh@18	987	p--;
krh@18	988
krh@18	989	return p;
krh@18	990	}
krh@18	991
krh@66	992	void
krh@66	993	razor_set_list_properties(struct razor_set set, const char name,
krh@66	994	enum razor_property_type type)
krh@8	995	{
krh@66	996	struct razor_property p, properties, *end;
krh@10	997	struct razor_package *package;
krh@10	998	unsigned long *r;
krh@7	999	char *pool;
krh@7	1000
krh@66	1001	pool = set->string_pool.data;
krh@66	1002
krh@10	1003	if (name) {
krh@10	1004	package = razor_set_get_package(set, name);
krh@66	1005	r = (unsigned long *) set->property_pool.data +
krh@66	1006	package->properties;
krh@66	1007	properties = set->properties.data;
krh@64	1008	while (1) {
krh@66	1009	p = &properties[*r & RAZOR_ENTRY_MASK];
krh@66	1010	if ((p->name >> 30) != type)
krh@66	1011	goto next;
krh@66	1012	if (pool[p->version] == '\0')
krh@66	1013	printf("%s\n",
krh@66	1014	&pool[p->name & RAZOR_ENTRY_MASK]);
krh@66	1015	else
krh@66	1016	printf("%s-%s\n",
krh@66	1017	&pool[p->name & RAZOR_ENTRY_MASK],
krh@66	1018	&pool[p->version]);
krh@66	1019	next:
krh@64	1020	if (*r++ & RAZOR_IMMEDIATE)
krh@64	1021	break;
krh@10	1022	}
krh@66	1023	} else {
krh@66	1024	end = set->properties.data + set->properties.size;
krh@66	1025	for (p = set->properties.data; p < end; p++) {
krh@66	1026	if ((p->name >> 30) != type)
krh@66	1027	continue;
krh@66	1028	if (pool[p->version] == '\0')
krh@66	1029	printf("%s\n",
krh@66	1030	&pool[p->name & RAZOR_ENTRY_MASK]);
krh@66	1031	else
krh@66	1032	printf("%s-%s\n",
krh@66	1033	&pool[p->name & RAZOR_ENTRY_MASK],
krh@66	1034	&pool[p->version]);
krh@66	1035	}
krh@66	1036	}
krh@10	1037	}
krh@10	1038
krh@10	1039	void
krh@18	1040	razor_set_list_property_packages(struct razor_set *set,
krh@20	1041	const char *name,
krh@66	1042	const char *version,
krh@66	1043	enum razor_property_type type)
krh@18	1044	{
krh@18	1045	struct razor_property property, end;
krh@18	1046	struct razor_package p, packages;
krh@18	1047	unsigned long *r;
krh@18	1048	char *pool;
krh@18	1049
krh@18	1050	if (name == NULL)
krh@18	1051	return;
krh@18	1052
krh@66	1053	property = razor_set_get_property(set, name);
krh@18	1054	packages = set->packages.data;
krh@18	1055	pool = set->string_pool.data;
krh@66	1056	end = set->properties.data + set->properties.size;
krh@66	1057	while (property < end &&
krh@66	1058	strcmp(name, &pool[property->name & RAZOR_ENTRY_MASK]) == 0) {
krh@66	1059	if (version &&
krh@66	1060	versioncmp(version, &pool[property->version]) != 0)
krh@66	1061	goto next;
krh@66	1062	if (type != (property->name >> 30))
krh@20	1063	goto next;
krh@61	1064
krh@61	1065	if (property->packages & RAZOR_IMMEDIATE)
krh@61	1066	r = &property->packages;
krh@61	1067	else
krh@61	1068	r = (unsigned long *)
krh@61	1069	set->package_pool.data + property->packages;
krh@64	1070	while (1) {
krh@61	1071	p = &packages[*r & RAZOR_ENTRY_MASK];
krh@66	1072	printf("%s-%s\n",
krh@66	1073	&pool[p->name & RAZOR_ENTRY_MASK],
krh@66	1074	&pool[p->version]);
krh@61	1075	if (*r++ & RAZOR_IMMEDIATE)
krh@61	1076	break;
krh@18	1077	}
krh@20	1078	next:
krh@18	1079	property++;
krh@18	1080	}
krh@18	1081	}
krh@18	1082
krh@56	1083	static struct razor_entry *
krh@56	1084	find_entry(struct razor_set set, struct razor_entry dir, const char *pattern)
krh@56	1085	{
krh@56	1086	struct razor_entry *e;
krh@56	1087	const char n, pool = set->string_pool.data;
krh@56	1088	int len;
krh@56	1089
krh@56	1090	e = (struct razor_entry *) set->files.data + dir->start;
krh@56	1091	do {
krh@56	1092	n = pool + (e->name & RAZOR_ENTRY_MASK);
krh@56	1093	if (strcmp(pattern + 1, n) == 0)
krh@56	1094	return e;
krh@57	1095	len = strlen(n);
krh@56	1096	if (e->start != 0 && strncmp(pattern + 1, n, len) == 0 &&
krh@56	1097	pattern[len + 1] == '/') {
krh@56	1098	return find_entry(set, e, pattern + len + 1);
krh@56	1099	}
krh@56	1100	} while (((e++)->name & RAZOR_ENTRY_LAST) == 0);
krh@56	1101
krh@56	1102	return NULL;
krh@56	1103	}
krh@56	1104
krh@56	1105	static void
krh@56	1106	list_dir(struct razor_set set, struct razor_entry dir,
krh@56	1107	const char prefix, const char pattern)
krh@56	1108	{
krh@56	1109	struct razor_entry *e;
krh@56	1110	const char n, pool = set->string_pool.data;
krh@56	1111
krh@56	1112	e = (struct razor_entry *) set->files.data + dir->start;
krh@56	1113	do {
krh@56	1114	n = pool + (e->name & RAZOR_ENTRY_MASK);
krh@56	1115	if (pattern && pattern[0] && fnmatch(pattern, n, 0) != 0)
krh@56	1116	continue;
krh@56	1117	printf("%s/%s%s\n", prefix, n, e->start > 0 ? "/" : "");
krh@56	1118	} while (((e++)->name & RAZOR_ENTRY_LAST) == 0);
krh@56	1119	}
krh@56	1120
krh@56	1121	void
krh@56	1122	razor_set_list_files(struct razor_set set, const char pattern)
krh@56	1123	{
krh@56	1124	struct razor_entry *e;
krh@56	1125	char buffer[512], p, base;
krh@56	1126
krh@56	1127	if (pattern == NULL)
krh@56	1128	pattern = "/";
krh@56	1129
krh@56	1130	strcpy(buffer, pattern);
krh@56	1131	e = find_entry(set, set->files.data, buffer);
krh@56	1132	if (e && e->start > 0) {
krh@56	1133	base = NULL;
krh@56	1134	} else {
krh@56	1135	p = strrchr(buffer, '/');
krh@56	1136	if (p) {
krh@56	1137	*p = '\0';
krh@56	1138	base = p + 1;
krh@56	1139	} else {
krh@56	1140	base = NULL;
krh@56	1141	}
krh@56	1142	}
krh@56	1143	e = find_entry(set, set->files.data, buffer);
krh@56	1144	if (e->start != 0)
krh@56	1145	list_dir(set, e, buffer, base);
krh@56	1146	}
krh@56	1147
krh@56	1148	void
krh@56	1149	razor_set_list_file_packages(struct razor_set set, const char filename)
krh@56	1150	{
krh@56	1151	struct razor_entry *e;
krh@56	1152	struct razor_package packages, p;
krh@56	1153	const char *pool;
krh@56	1154	unsigned long *r;
krh@56	1155
krh@56	1156	e = find_entry(set, set->files.data, filename);
krh@56	1157	if (e == NULL)
krh@56	1158	return;
krh@56	1159
krh@60	1160	if (e->packages & RAZOR_IMMEDIATE)
krh@60	1161	r = &e->packages;
krh@60	1162	else
krh@60	1163	r = (unsigned long *) set->package_pool.data + e->packages;
krh@60	1164
krh@56	1165	packages = set->packages.data;
krh@56	1166	pool = set->string_pool.data;
krh@64	1167	while (1) {
krh@60	1168	p = &packages[*r & RAZOR_ENTRY_MASK];
krh@59	1169	printf("%s-%s\n", &pool[p->name], &pool[p->version]);
krh@60	1170	if (*r++ & RAZOR_IMMEDIATE)
krh@60	1171	break;
krh@56	1172	}
krh@56	1173	}
krh@56	1174
krh@56	1175	static unsigned long *
krh@56	1176	list_package_files(struct razor_set set, unsigned long r,
krh@56	1177	struct razor_entry *dir, unsigned long end,
krh@56	1178	char *prefix)
krh@56	1179	{
krh@56	1180	struct razor_entry e, f, *entries;
krh@56	1181	unsigned long next;
krh@56	1182	char *pool;
krh@56	1183	int len;
krh@56	1184
krh@56	1185	entries = (struct razor_entry *) set->files.data;
krh@56	1186	pool = set->string_pool.data;
krh@56	1187
krh@56	1188	e = entries + dir->start;
krh@56	1189	do {
krh@56	1190	if (entries + *r == e) {
krh@56	1191	printf("%s/%s\n", prefix,
krh@56	1192	pool + (e->name & RAZOR_ENTRY_MASK));
krh@56	1193	r++;
krh@56	1194	if (*r >= end)
krh@56	1195	break;
krh@56	1196	}
krh@56	1197	} while (((e++)->name & RAZOR_ENTRY_LAST) == 0);
krh@56	1198
krh@56	1199	e = entries + dir->start;
krh@56	1200	do {
krh@56	1201	if (e->start == 0)
krh@56	1202	continue;
krh@56	1203
krh@56	1204	if (e->name & RAZOR_ENTRY_LAST)
krh@56	1205	next = end;
krh@56	1206	else {
krh@56	1207	f = e + 1;
krh@56	1208	while (f->start == 0 && !(f->name & RAZOR_ENTRY_LAST))
krh@56	1209	f++;
krh@56	1210	if (f->start == 0)
krh@56	1211	next = end;
krh@56	1212	else
krh@56	1213	next = f->start;
krh@56	1214	}
krh@56	1215
krh@56	1216	if (e->start <= r && r < next) {
krh@56	1217	len = strlen(prefix);
krh@56	1218	prefix[len] = '/';
krh@56	1219	strcpy(prefix + len + 1,
krh@56	1220	pool + (e->name & RAZOR_ENTRY_MASK));
krh@56	1221	r = list_package_files(set, r, e, next, prefix);
krh@56	1222	prefix[len] = '\0';
krh@56	1223	if (*r >= end)
krh@56	1224	break;
krh@56	1225	}
krh@56	1226	} while (((e++)->name & RAZOR_ENTRY_LAST) == 0);
krh@56	1227
krh@56	1228	return r;
krh@56	1229	}
krh@56	1230
krh@56	1231	void
krh@56	1232	razor_set_list_package_files(struct razor_set set, const char name)
krh@56	1233	{
krh@56	1234	struct razor_package *package;
krh@56	1235	unsigned long *r, end;
krh@56	1236	char buffer[512];
krh@56	1237
krh@56	1238	package = razor_set_get_package(set, name);
krh@56	1239
krh@56	1240	r = (unsigned long *) set->file_pool.data + package->files;
krh@56	1241	end = set->files.size / sizeof (struct razor_entry);
krh@56	1242	buffer[0] = '\0';
krh@56	1243	list_package_files(set, r, set->files.data, end, buffer);
krh@56	1244	}
krh@56	1245
krh@43	1246	static void
krh@21	1247	razor_set_validate(struct razor_set set, struct array unsatisfied)
krh@21	1248	{
krh@66	1249	struct razor_property r, p, *end;
krh@21	1250	unsigned long *u;
krh@21	1251	char *pool;
krh@21	1252
krh@66	1253	end = set->properties.data + set->properties.size;
krh@21	1254	pool = set->string_pool.data;
krh@21	1255
krh@66	1256	for (r = set->properties.data, p = r; r < end; r++) {
krh@66	1257	if (r->name >> 30 != RAZOR_PROPERTY_REQUIRES)
krh@66	1258	continue;
krh@66	1259
krh@66	1260	if ((r->name & RAZOR_ENTRY_MASK) != (p->name & RAZOR_ENTRY_MASK)) {
krh@66	1261	p = r;
krh@66	1262	while (p < end && p->name == r->name)
krh@66	1263	p++;
krh@66	1264	}
krh@37	1265
krh@35	1266	/* If there is more than one version of a provides,
krh@35	1267	* seek to the end for the highest version. */
krh@66	1268	/* FIXME: This doesn't work if we have a series of
krh@66	1269	* requires a = 1, provides a = 1, requires a = 2,
krh@66	1270	* provides a = 2, as the kernel and kernel-devel
krh@66	1271	* does.*/
krh@66	1272	while (p + 1 < end && p->name == (p + 1)->name)
krh@35	1273	p++;
krh@37	1274
krh@37	1275	/* FIXME: We need to track property flags (<, <=, =
krh@37	1276	* etc) to properly determine if a requires is
krh@37	1277	* satisfied. The current code doesn't track that the
krh@37	1278	* requires a = 1 isn't satisfied by a = 2 provides. */
krh@37	1279
krh@66	1280	if (p == end \|\|
krh@66	1281	(p->name >> 30) != RAZOR_PROPERTY_PROVIDES \|\|
krh@66	1282	(r->name & RAZOR_ENTRY_MASK) != (p->name & RAZOR_ENTRY_MASK) \|\|
krh@35	1283	versioncmp(&pool[r->version], &pool[p->version]) > 0) {
krh@35	1284	/* FIXME: We ignore file requires for now. */
krh@66	1285	if (pool[r->name & RAZOR_ENTRY_MASK] == '/')
krh@35	1286	continue;
krh@21	1287	u = array_add(unsatisfied, sizeof *u);
krh@66	1288	u = r - (struct razor_property ) set->properties.data;
krh@21	1289	}
krh@21	1290	}
krh@21	1291	}
krh@21	1292
krh@21	1293	void
krh@21	1294	razor_set_list_unsatisfied(struct razor_set *set)
krh@21	1295	{
krh@21	1296	struct array unsatisfied;
krh@66	1297	struct razor_property properties, r;
krh@21	1298	unsigned long u, end;
krh@21	1299	char *pool;
krh@21	1300
krh@21	1301	array_init(&unsatisfied);
krh@21	1302	razor_set_validate(set, &unsatisfied);
krh@21	1303
krh@21	1304	end = unsatisfied.data + unsatisfied.size;
krh@66	1305	properties = set->properties.data;
krh@21	1306	pool = set->string_pool.data;
krh@21	1307
krh@21	1308	for (u = unsatisfied.data; u < end; u++) {
krh@66	1309	r = properties + *u;
krh@66	1310	if (pool[r->version] == '\0')
krh@66	1311	printf("%ss not satisfied\n",
krh@66	1312	&pool[r->name & RAZOR_ENTRY_MASK]);
krh@66	1313	else
krh@66	1314	printf("%s-%s not satisfied\n",
krh@66	1315	&pool[r->name & RAZOR_ENTRY_MASK],
krh@66	1316	&pool[r->version]);
krh@21	1317	}
krh@21	1318
krh@21	1319	array_release(&unsatisfied);
krh@21	1320	}
krh@21	1321
krh@41	1322	#define UPSTREAM_SOURCE 0x80000000ul
krh@41	1323	#define INDEX_MASK 0x00fffffful
krh@41	1324
krh@41	1325	struct source {
krh@41	1326	struct razor_set *set;
krh@66	1327	unsigned long *property_map;
krh@41	1328	};
krh@41	1329
krh@41	1330	static void
krh@41	1331	prepare_source(struct source source, struct razor_set set)
krh@41	1332	{
krh@41	1333	int count;
krh@41	1334	size_t size;
krh@41	1335
krh@41	1336	source->set = set;
krh@41	1337
krh@66	1338	count = set->properties.size / sizeof (struct razor_property);
krh@66	1339	size = count * sizeof *source->property_map;
krh@66	1340	source->property_map = zalloc(size);
krh@41	1341	}
krh@41	1342
krh@33	1343	static void
krh@33	1344	add_package(struct razor_importer *importer,
krh@41	1345	struct razor_package package, struct source source,
krh@41	1346	unsigned long flags)
krh@33	1347	{
krh@33	1348	char *pool;
krh@33	1349	unsigned long *r;
krh@41	1350	struct razor_package *p;
krh@33	1351
krh@41	1352	pool = source->set->string_pool.data;
krh@41	1353	p = array_add(&importer->set->packages, sizeof *p);
krh@41	1354	p->name = razor_importer_tokenize(importer, &pool[package->name]);
krh@41	1355	p->name \|= flags;
krh@41	1356	p->version = razor_importer_tokenize(importer,
krh@41	1357	&pool[package->version]);
krh@66	1358	p->properties = package->properties;
krh@33	1359
krh@66	1360	if (package->properties & RAZOR_IMMEDIATE)
krh@66	1361	r = &package->properties;
krh@64	1362	else
krh@64	1363	r = (unsigned long *)
krh@66	1364	source->set->property_pool.data + package->properties;
krh@64	1365	while (1) {
krh@66	1366	source->property_map[*r & RAZOR_ENTRY_MASK] = 1;
krh@64	1367	if (*r++ & RAZOR_IMMEDIATE)
krh@64	1368	break;
krh@64	1369	}
krh@41	1370	}
krh@41	1371
krh@41	1372
krh@41	1373	/* Build the new package list sorted by merging the two package lists.
krh@41	1374	* Build new string pool as we go. (for now we just re-use that part of
krh@41	1375	* the importer). */
krh@41	1376	static void
krh@41	1377	merge_packages(struct razor_importer *importer,
krh@41	1378	struct source source1, struct source source2,
krh@41	1379	struct array *packages)
krh@41	1380	{
krh@41	1381	struct razor_package upstream_packages, p, s, send;
krh@41	1382	char spool, upool;
krh@41	1383	unsigned long u, uend;
krh@41	1384	int cmp;
krh@41	1385
krh@41	1386	upstream_packages = source2->set->packages.data;
krh@41	1387
krh@41	1388	u = packages->data;
krh@41	1389	uend = packages->data + packages->size;
krh@41	1390	upool = source2->set->string_pool.data;
krh@41	1391
krh@41	1392	s = source1->set->packages.data;
krh@41	1393	send = source1->set->packages.data + source1->set->packages.size;
krh@41	1394	spool = source1->set->string_pool.data;
krh@41	1395
krh@41	1396	while (s < send) {
krh@41	1397	p = upstream_packages + *u;
krh@41	1398
krh@41	1399	if (u < uend)
krh@41	1400	cmp = strcmp(&spool[s->name], &upool[p->name]);
krh@41	1401	if (u >= uend \|\| cmp < 0) {
krh@41	1402	add_package(importer, s, source1, 0);
krh@41	1403	s++;
krh@41	1404	} else if (cmp == 0) {
krh@41	1405	add_package(importer, p, source2, UPSTREAM_SOURCE);
krh@41	1406	s++;
krh@41	1407	u++;
krh@41	1408	} else {
krh@41	1409	add_package(importer, p, source2, UPSTREAM_SOURCE);
krh@41	1410	u++;
krh@41	1411	}
krh@41	1412	}
krh@41	1413	}
krh@41	1414
krh@41	1415	static unsigned long
krh@66	1416	add_property(struct razor_importer *importer,
krh@69	1417	const char name, const char version, int type)
krh@41	1418	{
krh@41	1419	struct razor_property *p;
krh@41	1420
krh@66	1421	p = array_add(&importer->set->properties, sizeof *p);
krh@69	1422	p->name = razor_importer_tokenize(importer, name) \| (type << 30);
krh@41	1423	p->version = razor_importer_tokenize(importer, version);
krh@41	1424
krh@66	1425	return p - (struct razor_property *) importer->set->properties.data;
krh@41	1426	}
krh@41	1427
krh@41	1428	static void
krh@66	1429	merge_properties(struct razor_importer *importer,
krh@41	1430	struct razor_set *set1,
krh@41	1431	unsigned long *map1,
krh@41	1432	struct razor_set *set2,
krh@41	1433	unsigned long *map2)
krh@41	1434	{
krh@41	1435	struct razor_property p1, p2;
krh@41	1436	int i, j, cmp, count1, count2;
krh@41	1437	char pool1, pool2;
krh@41	1438
krh@41	1439	i = 0;
krh@41	1440	j = 0;
krh@41	1441	pool1 = set1->string_pool.data;
krh@41	1442	pool2 = set2->string_pool.data;
krh@41	1443
krh@66	1444	count1 = set1->properties.size / sizeof *p1;
krh@66	1445	count2 = set2->properties.size / sizeof *p2;
krh@41	1446	while (i < count1 \|\| j < count2) {
krh@41	1447	if (i < count1 && map1[i] == 0) {
krh@41	1448	i++;
krh@41	1449	continue;
krh@41	1450	}
krh@41	1451	if (j < count2 && map2[j] == 0) {
krh@41	1452	j++;
krh@41	1453	continue;
krh@41	1454	}
krh@66	1455	p1 = (struct razor_property *) set1->properties.data + i;
krh@66	1456	p2 = (struct razor_property *) set2->properties.data + j;
krh@41	1457	if (i < count1 && j < count2)
krh@66	1458	cmp = strcmp(&pool1[p1->name & RAZOR_ENTRY_MASK],
krh@66	1459	&pool2[p2->name & RAZOR_ENTRY_MASK]);
krh@41	1460	else if (i < count1)
krh@41	1461	cmp = -1;
krh@41	1462	else
krh@41	1463	cmp = 1;
krh@41	1464	if (cmp == 0)
krh@41	1465	cmp = versioncmp(&pool1[p1->version],
krh@41	1466	&pool2[p2->version]);
krh@41	1467	if (cmp < 0) {
krh@41	1468	map1[i++] = add_property(importer,
krh@66	1469	&pool1[p1->name & RAZOR_ENTRY_MASK],
krh@69	1470	&pool1[p1->version],
krh@69	1471	(p1->name >> 30));
krh@41	1472	} else if (cmp > 0) {
krh@41	1473	map2[j++] = add_property(importer,
krh@66	1474	&pool2[p2->name & RAZOR_ENTRY_MASK],
krh@69	1475	&pool2[p2->version],
krh@69	1476	(p2->name >> 30));
krh@41	1477	} else {
krh@41	1478	map1[i++] = map2[j++] = add_property(importer,
krh@66	1479	&pool1[p1->name & RAZOR_ENTRY_MASK],
krh@69	1480	&pool1[p1->version],
krh@69	1481	(p1->name >> 30));
krh@41	1482	}
krh@41	1483	}
krh@41	1484	}
krh@41	1485
krh@41	1486	static unsigned long
krh@41	1487	emit_properties(struct array *source_pool, unsigned long index,
krh@41	1488	unsigned long map, struct array pool)
krh@41	1489	{
krh@41	1490	unsigned long r, p, q;
krh@41	1491
krh@41	1492	r = pool->size / sizeof *q;
krh@41	1493	p = (unsigned long *) source_pool->data + index;
krh@64	1494	while (1) {
krh@41	1495	q = array_add(pool, sizeof *q);
krh@64	1496	q = map[p & RAZOR_ENTRY_MASK] \| (*p & ~RAZOR_ENTRY_MASK);
krh@64	1497	if (*p++ & RAZOR_ENTRY_LAST)
krh@64	1498	break;
krh@33	1499	}
krh@33	1500
krh@41	1501	return r;
krh@41	1502	}
krh@41	1503
krh@41	1504	/* Rebuild property->packages maps. We can't just remap these, as a
krh@41	1505	* property may have lost or gained a number of packages. Allocate an
krh@41	1506	* array per property and loop through the packages and add them to
krh@41	1507	* the arrays for their properties. */
krh@41	1508	static void
krh@41	1509	rebuild_package_lists(struct razor_set *set)
krh@41	1510	{
krh@66	1511	struct array pkgs, a;
krh@41	1512	struct razor_package pkg, pkg_end;
krh@41	1513	struct razor_property prop, prop_end;
krh@66	1514	unsigned long r, q, *pool;
krh@66	1515	int count;
krh@41	1516
krh@66	1517	count = set->properties.size / sizeof (struct razor_property);
krh@66	1518	pkgs = zalloc(count * sizeof *pkgs);
krh@41	1519	pkg_end = set->packages.data + set->packages.size;
krh@66	1520	pool = set->property_pool.data;
krh@41	1521
krh@41	1522	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {
krh@66	1523	for (r = &pool[pkg->properties]; ; r++) {
krh@66	1524	q = array_add(&pkgs[r & RAZOR_ENTRY_MASK], sizeof q);
krh@41	1525	q = pkg - (struct razor_package ) set->packages.data;
krh@64	1526	if (*r & RAZOR_IMMEDIATE)
krh@64	1527	break;
krh@41	1528	}
krh@33	1529	}
krh@33	1530
krh@66	1531	prop_end = set->properties.data + set->properties.size;
krh@66	1532	a = pkgs;
krh@66	1533	for (prop = set->properties.data; prop < prop_end; prop++, a++) {
krh@61	1534	if (a->size / sizeof *r == 1) {
krh@61	1535	r = a->data;
krh@61	1536	prop->packages = *r \| RAZOR_IMMEDIATE;
krh@61	1537	} else {
krh@61	1538	prop->packages =
krh@66	1539	add_to_property_pool(&set->property_pool, a);
krh@61	1540	}
krh@41	1541	array_release(a);
krh@41	1542	}
krh@66	1543	free(pkgs);
krh@33	1544	}
krh@33	1545
krh@33	1546	/* Add packages from 'upstream' to 'set'. The packages to add are
krh@33	1547	* specified by the 'packages' array, which is a sorted list of
krh@33	1548	* package indexes. Returns a newly allocated package set. Does not
krh@41	1549	* enforce validity of the resulting package set.
krh@41	1550	*
krh@41	1551	* This looks more complicated than it is. An easy way to merge two
krh@41	1552	* package sets would be to just use a razor_importer, but that
krh@41	1553	* requires resorting, and is thus O(n log n). We can do this in a
krh@41	1554	* linear sweep, but it gets a little more complicated.
krh@41	1555	*/
krh@33	1556	struct razor_set *
krh@33	1557	razor_set_add(struct razor_set set, struct razor_set upstream,
krh@33	1558	struct array *packages)
krh@33	1559	{
krh@41	1560	struct razor_set *result;
krh@33	1561	struct razor_importer *importer;
krh@41	1562	struct razor_package p, pend;
krh@41	1563	struct source source, upstream_source;
krh@33	1564
krh@33	1565	importer = razor_importer_new();
krh@33	1566
krh@41	1567	prepare_source(&upstream_source, upstream);
krh@41	1568	prepare_source(&source, set);
krh@41	1569
krh@41	1570	merge_packages(importer, &source, &upstream_source, packages);
krh@41	1571
krh@41	1572	/* As we built the package list, we filled out a bitvector of
krh@41	1573	* the properties that are referenced by the packages in the
krh@41	1574	* new set. Now we do a parallel loop through the properties
krh@41	1575	* and emit those marked in the bit vector to the new set. In
krh@41	1576	* the process, we update the bit vector to actually map from
krh@41	1577	* indices in the old property list to indices in the new
krh@41	1578	* property list for both sets. */
krh@41	1579
krh@66	1580	merge_properties(importer,
krh@66	1581	set, source.property_map,
krh@66	1582	upstream, upstream_source.property_map);
krh@41	1583
krh@41	1584	/* Now we loop through the packages again and emit the
krh@41	1585	* property lists, remapped to point to the new properties. */
krh@41	1586
krh@41	1587	pend = importer->set->packages.data + importer->set->packages.size;
krh@41	1588	for (p = importer->set->packages.data; p < pend; p++) {
krh@41	1589	struct source *src;
krh@41	1590
krh@41	1591	if (p->name & UPSTREAM_SOURCE)
krh@41	1592	src = &upstream_source;
krh@41	1593	else
krh@41	1594	src = &source;
krh@41	1595
krh@66	1596	p->properties = emit_properties(&src->set->property_pool,
krh@66	1597	p->properties,
krh@66	1598	src->property_map,
krh@66	1599	&importer->set->property_pool);
krh@41	1600	p->name &= INDEX_MASK;
krh@33	1601	}
krh@33	1602
krh@41	1603	rebuild_package_lists(importer->set);
krh@41	1604
krh@41	1605	result = importer->set;
krh@41	1606	array_release(&importer->buckets);
krh@41	1607	free(importer);
krh@41	1608
krh@41	1609	return result;
krh@33	1610	}
krh@33	1611
krh@37	1612	void
krh@37	1613	razor_set_satisfy(struct razor_set set, struct array unsatisfied,
krh@37	1614	struct razor_set upstream, struct array list)
krh@37	1615	{
krh@37	1616	struct razor_property requires, r;
krh@37	1617	struct razor_property p, pend;
krh@39	1618	unsigned long u, end, pkg, package_pool;
krh@37	1619	char pool, upool;
krh@37	1620
krh@37	1621	end = unsatisfied->data + unsatisfied->size;
krh@66	1622	requires = set->properties.data;
krh@37	1623	pool = set->string_pool.data;
krh@37	1624
krh@66	1625	p = upstream->properties.data;
krh@66	1626	pend = upstream->properties.data + upstream->properties.size;
krh@37	1627	upool = upstream->string_pool.data;
krh@39	1628	package_pool = upstream->package_pool.data;
krh@37	1629
krh@37	1630	for (u = unsatisfied->data; u < end; u++) {
krh@37	1631	r = requires + *u;
krh@37	1632
krh@66	1633	while (p < pend &&
krh@66	1634	strcmp(&pool[r->name & RAZOR_ENTRY_MASK],
krh@66	1635	&upool[p->name & RAZOR_ENTRY_MASK]) > 0 &&
krh@66	1636	(p->name >> 30) != RAZOR_PROPERTY_PROVIDES)
krh@37	1637	p++;
krh@37	1638	/* If there is more than one version of a provides,
krh@37	1639	* seek to the end for the highest version. */
krh@37	1640	while (p + 1 < pend && p->name == (p + 1)->name)
krh@37	1641	p++;
krh@37	1642
krh@37	1643	if (p == pend \|\|
krh@66	1644	strcmp(&pool[r->name & RAZOR_ENTRY_MASK],
krh@66	1645	&upool[p->name & RAZOR_ENTRY_MASK]) != 0 \|\|
krh@37	1646	versioncmp(&pool[r->version], &upool[p->version]) > 0) {
krh@37	1647	/* Do we need to track unsatisfiable requires
krh@37	1648	* as we go, or should we just do a
krh@37	1649	* razor_set_validate() at the end? */
krh@37	1650	} else {
krh@37	1651	pkg = array_add(list, sizeof *pkg);
krh@37	1652	/* We just pull in the first package that provides */
krh@61	1653	if (p->packages & RAZOR_IMMEDIATE)
krh@61	1654	*pkg = p->packages & RAZOR_ENTRY_MASK;
krh@61	1655	else
krh@61	1656	*pkg = package_pool[p->packages];
krh@37	1657	}
krh@37	1658	}
krh@37	1659	}
krh@37	1660
krh@38	1661	static void
krh@38	1662	find_packages(struct razor_set *set,
krh@38	1663	int count, const char *packages, struct array list)
krh@38	1664	{
krh@38	1665	struct razor_package *p;
krh@38	1666	unsigned long *r;
krh@38	1667	int i;
krh@38	1668
krh@38	1669	/* FIXME: Sort the packages. */
krh@38	1670	for (i = 0; i < count; i++) {
krh@38	1671	p = razor_set_get_package(set, packages[i]);
krh@38	1672	r = array_add(list, sizeof *r);
krh@38	1673	r = p - (struct razor_package ) set->packages.data;
krh@38	1674	}
krh@38	1675	}
krh@38	1676
krh@38	1677	static void
krh@38	1678	find_all_packages(struct razor_set *set,
krh@38	1679	struct razor_set upstream, struct array list)
krh@38	1680	{
krh@38	1681	struct razor_package p, u, pend, uend;
krh@38	1682	unsigned long *r;
krh@38	1683	char pool, upool;
krh@38	1684
krh@38	1685	pend = set->packages.data + set->packages.size;
krh@38	1686	pool = set->string_pool.data;
krh@38	1687	u = upstream->packages.data;
krh@38	1688	uend = upstream->packages.data + upstream->packages.size;
krh@38	1689	upool = upstream->string_pool.data;
krh@38	1690
krh@38	1691	for (p = set->packages.data; p < pend; p++) {
krh@38	1692	while (u < uend && strcmp(&pool[p->name], &upool[u->name]) > 0)
krh@38	1693	u++;
krh@38	1694	if (strcmp(&pool[p->name], &upool[u->name]) == 0) {
krh@38	1695	r = array_add(list, sizeof *r);
krh@38	1696	r = u - (struct razor_package ) upstream->packages.data;
krh@38	1697	}
krh@38	1698	}
krh@38	1699	}
krh@38	1700
krh@33	1701	struct razor_set *
krh@33	1702	razor_set_update(struct razor_set set, struct razor_set upstream,
krh@33	1703	int count, const char **packages)
krh@33	1704	{
krh@37	1705	struct razor_set *new;
krh@43	1706	struct razor_package *upackages;
krh@37	1707	struct array list, unsatisfied;
krh@37	1708	char *pool;
krh@38	1709	unsigned long u, end;
krh@38	1710	int total = 0;
krh@33	1711
krh@33	1712	array_init(&list);
krh@38	1713	if (count > 0)
krh@38	1714	find_packages(upstream, count, packages, &list);
krh@38	1715	else
krh@38	1716	find_all_packages(set, upstream, &list);
krh@33	1717
krh@37	1718	end = list.data + list.size;
krh@37	1719	upackages = upstream->packages.data;
krh@37	1720	pool = upstream->string_pool.data;
krh@38	1721	total += list.size / sizeof *u;
krh@37	1722
krh@37	1723	while (list.size > 0) {
krh@37	1724	new = razor_set_add(set, upstream, &list);
krh@37	1725	array_release(&list);
krh@37	1726	razor_set_destroy(set);
krh@37	1727	set = new;
krh@37	1728
krh@37	1729	array_init(&unsatisfied);
krh@37	1730	razor_set_validate(new, &unsatisfied);
krh@37	1731	array_init(&list);
krh@37	1732	razor_set_satisfy(new, &unsatisfied, upstream, &list);
krh@37	1733	array_release(&unsatisfied);
krh@37	1734
krh@37	1735	end = list.data + list.size;
krh@37	1736	upackages = upstream->packages.data;
krh@37	1737	pool = upstream->string_pool.data;
krh@38	1738	total += list.size / sizeof *u;
krh@37	1739	}
krh@37	1740
krh@37	1741	array_release(&list);
krh@37	1742
krh@37	1743	return set;
krh@33	1744	}
krh@33	1745
krh@44	1746	/* The diff order matters. We should sort the packages so that a
krh@44	1747	* REMOVE of a package comes before the INSTALL, and so that all
krh@44	1748	* requires for a package have been installed before the package.
krh@44	1749	**/
krh@44	1750
krh@44	1751	void
krh@44	1752	razor_set_diff(struct razor_set set, struct razor_set upstream,
krh@44	1753	razor_package_callback_t callback, void *data)
krh@44	1754	{
krh@44	1755	struct razor_package p, pend, u, uend;
krh@44	1756	char ppool, upool;
krh@44	1757	int res = 0;
krh@44	1758
krh@44	1759	p = set->packages.data;
krh@44	1760	pend = set->packages.data + set->packages.size;
krh@44	1761	ppool = set->string_pool.data;
krh@44	1762
krh@44	1763	u = upstream->packages.data;
krh@44	1764	uend = upstream->packages.data + upstream->packages.size;
krh@44	1765	upool = upstream->string_pool.data;
krh@44	1766
krh@44	1767	while (p < pend \|\| u < uend) {
krh@44	1768	if (p < pend && u < uend) {
krh@44	1769	res = strcmp(&ppool[p->name], &upool[u->name]);
krh@44	1770	if (res == 0)
krh@44	1771	res = versioncmp(&ppool[p->version],
krh@44	1772	&upool[u->version]);
krh@44	1773	}
krh@44	1774
krh@44	1775	if (u == uend \|\| res < 0) {
krh@44	1776	callback(&ppool[p->name], &ppool[p->version],
krh@44	1777	NULL, data);
krh@44	1778	p++;
krh@44	1779	continue;
krh@44	1780	} else if (p == pend \|\| res > 0) {
krh@44	1781	callback(&upool[u->name], NULL, &upool[u->version],
krh@44	1782	data);
krh@44	1783	u++;
krh@44	1784	continue;
krh@44	1785	} else {
krh@44	1786	p++;
krh@44	1787	u++;
krh@44	1788	}
krh@44	1789	}
krh@44	1790	}

author	Kristian H?gsberg <krh@redhat.com>
	Wed Nov 07 00:33:56 2007 -0500 (2007-11-07)
changeset 74	f23a93d41f32
parent 66	bb4ca4a47f66
child 75	93278d8ec39c
permissions	-rw-r--r--