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

author	Kristian H?gsberg <krh@redhat.com>
	Wed Oct 24 00:50:29 2007 -0400 (2007-10-24)
changeset 58	3403937e0913
parent 56	9c00581c71be
child 59	c525dec02ef4
permissions	-rw-r--r--