razor: razor.c@fca1ef50dd2c (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@60	743	#define RAZOR_ENTRY_LAST 0x80000000ul
krh@60	744	#define RAZOR_IMMEDIATE 0x80000000ul
krh@60	745	#define RAZOR_ENTRY_MASK 0x00fffffful
krh@56	746
krh@48	747	static void
krh@52	748	serialize_files(struct razor_set *set,
krh@52	749	struct import_directory d, struct array array)
krh@48	750	{
krh@52	751	struct import_directory p, end;
krh@56	752	struct razor_entry *e = NULL;
krh@60	753	unsigned long s, *r;
krh@48	754
krh@48	755	p = d->files.data;
krh@48	756	end = d->files.data + d->files.size;
krh@48	757	s = array->size / sizeof e + d->files.size / sizeof p;
krh@48	758	while (p < end) {
krh@48	759	e = array_add(array, sizeof *e);
krh@48	760	e->name = p->name;
krh@56	761	e->start = p->count > 0 ? s : 0;
krh@48	762	s += p->count;
krh@60	763
krh@60	764	if (p->packages.size / sizeof (unsigned long) == 1) {
krh@60	765	r = p->packages.data;
krh@60	766	e->packages = *r \| RAZOR_IMMEDIATE;
krh@60	767	} else {
krh@60	768	e->packages = add_to_property_pool(&set->package_pool,
krh@60	769	&p->packages);
krh@60	770	}
krh@52	771	array_release(&p->packages);
krh@48	772	p++;
krh@48	773	}
krh@56	774	if (e != NULL)
krh@56	775	e->name \|= RAZOR_ENTRY_LAST;
krh@48	776
krh@48	777	p = d->files.data;
krh@48	778	end = d->files.data + d->files.size;
krh@48	779	while (p < end) {
krh@52	780	serialize_files(set, p, array);
krh@48	781	p++;
krh@48	782	}
krh@48	783	}
krh@48	784
krh@48	785	static void
krh@48	786	build_file_tree(struct razor_importer *importer)
krh@48	787	{
krh@48	788	int count, i, length;
krh@52	789	struct import_entry *filenames;
krh@52	790	char f, end;
krh@52	791	unsigned long name, *r;
krh@48	792	char dirname[256];
krh@52	793	struct import_directory *d, root;
krh@48	794	struct razor_entry *e;
krh@48	795
krh@52	796	count = importer->files.size / sizeof (struct import_entry);
krh@48	797	qsort_with_data(importer->files.data,
krh@48	798	count,
krh@52	799	sizeof (struct import_entry),
krh@48	800	compare_filenames,
krh@48	801	NULL);
krh@48	802
krh@48	803	root.name = razor_importer_tokenize(importer, "");
krh@48	804	array_init(&root.files);
krh@52	805	array_init(&root.packages);
krh@48	806	root.last = NULL;
krh@48	807
krh@48	808	filenames = importer->files.data;
krh@48	809	for (i = 0; i < count; i++) {
krh@52	810	f = filenames[i].name;
krh@48	811	if (*f != '/')
krh@48	812	continue;
krh@57	813	f++;
krh@48	814
krh@48	815	d = &root;
krh@48	816	while (*f) {
krh@57	817	end = strchr(f, '/');
krh@48	818	if (end == NULL)
krh@48	819	end = f + strlen(f);
krh@57	820	length = end - f;
krh@57	821	memcpy(dirname, f, length);
krh@48	822	dirname[length] ='\0';
krh@48	823	name = razor_importer_tokenize(importer, dirname);
krh@48	824	if (d->last == NULL \|\| d->last->name != name) {
krh@48	825	d->last = array_add(&d->files, sizeof *d);
krh@48	826	d->last->name = name;
krh@48	827	d->last->last = NULL;
krh@48	828	array_init(&d->last->files);
krh@52	829	array_init(&d->last->packages);
krh@48	830	}
krh@48	831	d = d->last;
krh@57	832	f = end + 1;
krh@57	833	if (*end == '\0')
krh@57	834	break;
krh@48	835	}
krh@48	836
krh@52	837	r = array_add(&d->packages, sizeof *r);
krh@52	838	*r = filenames[i].package;
krh@52	839	free(filenames[i].name);
krh@48	840	}
krh@48	841
krh@48	842	count_entries(&root);
krh@56	843	array_init(&importer->set->files);
krh@48	844
krh@56	845	e = array_add(&importer->set->files, sizeof *e);
krh@56	846	e->name = root.name \| RAZOR_ENTRY_LAST;
krh@48	847	e->start = 1;
krh@56	848	e->packages = 0;
krh@48	849
krh@56	850	serialize_files(importer->set, &root, &importer->set->files);
krh@48	851
krh@48	852	array_release(&importer->files);
krh@48	853	}
krh@48	854
krh@56	855	static void
krh@60	856	build_package_file_lists(struct razor_set set, unsigned long rmap)
krh@54	857	{
krh@56	858	struct razor_package p, packages;
krh@56	859	struct array *pkgs;
krh@54	860	struct razor_entry e, end;
krh@56	861	unsigned long r, q;
krh@56	862	int i, count;
krh@54	863
krh@56	864	count = set->packages.size / sizeof *p;
krh@56	865	pkgs = zalloc(count * sizeof *pkgs);
krh@54	866
krh@56	867	e = set->files.data;
krh@56	868	end = set->files.data + set->files.size;
krh@54	869	while (e < end) {
krh@60	870	if (e->packages & RAZOR_IMMEDIATE) {
krh@60	871	e->packages = rmap[e->packages & RAZOR_ENTRY_MASK] \|
krh@60	872	RAZOR_IMMEDIATE;
krh@60	873	r = &e->packages;
krh@60	874	} else {
krh@60	875	r = (unsigned long *) set->package_pool.data + e->packages;
krh@60	876	}
krh@60	877
krh@56	878	while (~*r) {
krh@60	879	q = array_add(&pkgs[r & RAZOR_ENTRY_MASK], sizeof q);
krh@56	880	q = e - (struct razor_entry ) set->files.data;
krh@60	881	if (*r++ & RAZOR_IMMEDIATE)
krh@60	882	break;
krh@54	883	}
krh@54	884	e++;
krh@54	885	}
krh@54	886
krh@56	887	packages = set->packages.data;
krh@56	888	for (i = 0; i < count; i++) {
krh@56	889	packages[i].files =
krh@56	890	add_to_property_pool(&set->file_pool, &pkgs[i]);
krh@56	891	array_release(&pkgs[i]);
krh@48	892	}
krh@56	893	free(pkgs);
krh@52	894	}
krh@52	895
krh@27	896	struct razor_set *
krh@30	897	razor_importer_finish(struct razor_importer *importer)
krh@9	898	{
krh@30	899	struct razor_set *set;
krh@39	900	unsigned long map, rmap;
krh@39	901	int i, count;
krh@18	902
krh@39	903	map = uniqueify_properties(importer->set, &importer->set->requires);
krh@39	904	remap_links(&importer->set->requires_pool, map);
krh@39	905	free(map);
krh@39	906
krh@39	907	map = uniqueify_properties(importer->set, &importer->set->provides);
krh@39	908	remap_links(&importer->set->provides_pool, map);
krh@39	909	free(map);
krh@25	910
krh@30	911	count = importer->set->packages.size / sizeof(struct razor_package);
krh@30	912	map = qsort_with_data(importer->set->packages.data,
krh@25	913	count,
krh@25	914	sizeof(struct razor_package),
krh@25	915	compare_packages,
krh@30	916	importer->set);
krh@39	917
krh@39	918	rmap = malloc(count * sizeof *rmap);
krh@39	919	for (i = 0; i < count; i++)
krh@39	920	rmap[map[i]] = i;
krh@25	921	free(map);
krh@13	922
krh@48	923	build_file_tree(importer);
krh@52	924	remap_links(&importer->set->package_pool, rmap);
krh@60	925	build_package_file_lists(importer->set, rmap);
krh@52	926	free(rmap);
krh@48	927
krh@56	928
krh@30	929	set = importer->set;
krh@32	930	array_release(&importer->buckets);
krh@30	931	free(importer);
krh@30	932
krh@30	933	return set;
krh@9	934	}
krh@9	935
krh@0	936	void
krh@54	937	razor_set_list(struct razor_set set, const char pattern)
krh@3	938	{
krh@6	939	struct razor_package p, end;
krh@54	940	int with_version = 0;
krh@6	941	char *pool;
krh@3	942
krh@6	943	pool = set->string_pool.data;
krh@6	944	end = set->packages.data + set->packages.size;
krh@54	945	for (p = set->packages.data; p < end; p++) {
krh@54	946	if (pattern && fnmatch(pattern, &pool[p->name], 0) != 0)
krh@54	947	continue;
krh@54	948	if (with_version)
krh@59	949	printf("%s-%s\n", &pool[p->name], &pool[p->version]);
krh@54	950	else
krh@54	951	printf("%s\n", &pool[p->name]);
krh@54	952	}
krh@3	953	}
krh@3	954
krh@16	955	struct razor_set *bsearch_set;
krh@16	956
krh@16	957	static int
krh@16	958	compare_package_name(const void key, const void data)
krh@16	959	{
krh@16	960	const struct razor_package *p = data;
krh@16	961	char *pool;
krh@16	962
krh@16	963	pool = bsearch_set->string_pool.data;
krh@16	964
krh@16	965	return strcmp(key, &pool[p->name]);
krh@16	966	}
krh@16	967
krh@10	968	struct razor_package *
krh@10	969	razor_set_get_package(struct razor_set set, const char package)
krh@10	970	{
krh@16	971	bsearch_set = set;
krh@16	972	return bsearch(package, set->packages.data,
krh@16	973	set->packages.size / sizeof(struct razor_package),
krh@16	974	sizeof(struct razor_package), compare_package_name);
krh@10	975	}
krh@10	976
krh@18	977	static int
krh@18	978	compare_property_name(const void key, const void data)
krh@18	979	{
krh@18	980	const struct razor_property *p = data;
krh@18	981	char *pool;
krh@18	982
krh@18	983	pool = bsearch_set->string_pool.data;
krh@18	984
krh@18	985	return strcmp(key, &pool[p->name]);
krh@18	986	}
krh@18	987
krh@18	988	struct razor_property *
krh@18	989	razor_set_get_property(struct razor_set *set,
krh@18	990	struct array *properties,
krh@18	991	const char *property)
krh@18	992	{
krh@18	993	struct razor_property p, start;
krh@18	994
krh@18	995	bsearch_set = set;
krh@18	996	p = bsearch(property, properties->data,
krh@18	997	properties->size / sizeof(struct razor_property),
krh@18	998	sizeof(struct razor_property), compare_property_name);
krh@18	999
krh@18	1000	start = properties->data;
krh@18	1001	while (p > start && (p - 1)->name == p->name)
krh@18	1002	p--;
krh@18	1003
krh@18	1004	return p;
krh@18	1005	}
krh@18	1006
krh@10	1007	static void
krh@10	1008	razor_set_list_all_properties(struct razor_set set, struct array properties)
krh@8	1009	{
krh@8	1010	struct razor_property p, end;
krh@8	1011	char *pool;
krh@8	1012
krh@8	1013	pool = set->string_pool.data;
krh@10	1014	end = properties->data + properties->size;
krh@14	1015	for (p = properties->data; p < end; p++)
krh@59	1016	printf("%s-%s\n", &pool[p->name], &pool[p->version]);
krh@8	1017	}
krh@8	1018
krh@8	1019	void
krh@10	1020	razor_set_list_requires(struct razor_set set, const char name)
krh@7	1021	{
krh@10	1022	struct razor_property p, requires;
krh@10	1023	struct razor_package *package;
krh@10	1024	unsigned long *r;
krh@7	1025	char *pool;
krh@7	1026
krh@10	1027	if (name) {
krh@10	1028	package = razor_set_get_package(set, name);
krh@39	1029	r = (unsigned long *) set->requires_pool.data +
krh@10	1030	package->requires;
krh@10	1031	requires = set->requires.data;
krh@10	1032	pool = set->string_pool.data;
krh@18	1033	while (~*r) {
krh@10	1034	p = &requires[*r++];
krh@59	1035	printf("%s-%s\n", &pool[p->name], &pool[p->version]);
krh@10	1036	}
krh@10	1037	} else
krh@10	1038	razor_set_list_all_properties(set, &set->requires);
krh@10	1039	}
krh@10	1040
krh@10	1041	void
krh@10	1042	razor_set_list_provides(struct razor_set set, const char name)
krh@10	1043	{
krh@10	1044	struct razor_property p, provides;
krh@10	1045	struct razor_package *package;
krh@10	1046	unsigned long *r;
krh@10	1047	char *pool;
krh@10	1048
krh@10	1049	if (name) {
krh@10	1050	package = razor_set_get_package(set, name);
krh@39	1051	r = (unsigned long *) set->provides_pool.data +
krh@10	1052	package->provides;
krh@10	1053	provides = set->provides.data;
krh@10	1054	pool = set->string_pool.data;
krh@18	1055	while (~*r) {
krh@10	1056	p = &provides[*r++];
krh@59	1057	printf("%s-%s\n", &pool[p->name], &pool[p->version]);
krh@10	1058	}
krh@10	1059	} else
krh@10	1060	razor_set_list_all_properties(set, &set->provides);
krh@7	1061	}
krh@7	1062
krh@43	1063	static void
krh@18	1064	razor_set_list_property_packages(struct razor_set *set,
krh@18	1065	struct array *properties,
krh@20	1066	const char *name,
krh@20	1067	const char *version)
krh@18	1068	{
krh@18	1069	struct razor_property property, end;
krh@18	1070	struct razor_package p, packages;
krh@18	1071	unsigned long *r;
krh@18	1072	char *pool;
krh@18	1073
krh@18	1074	if (name == NULL)
krh@18	1075	return;
krh@18	1076
krh@18	1077	property = razor_set_get_property(set, properties, name);
krh@18	1078	packages = set->packages.data;
krh@18	1079	pool = set->string_pool.data;
krh@18	1080	end = properties->data + properties->size;
krh@18	1081	while (property < end && strcmp(name, &pool[property->name]) == 0) {
krh@35	1082	if (version && versioncmp(version, &pool[property->version]) != 0)
krh@20	1083	goto next;
krh@18	1084	r = (unsigned long *)
krh@39	1085	set->package_pool.data + property->packages;
krh@18	1086	while (~*r) {
krh@18	1087	p = &packages[*r++];
krh@59	1088	printf("%s-%s\n",
krh@18	1089	&pool[p->name], &pool[p->version]);
krh@18	1090	}
krh@20	1091	next:
krh@18	1092	property++;
krh@18	1093	}
krh@18	1094	}
krh@18	1095
krh@18	1096	void
krh@43	1097	razor_set_list_requires_packages(struct razor_set *set,
krh@43	1098	const char *name,
krh@43	1099	const char *version)
krh@43	1100	{
krh@43	1101	razor_set_list_property_packages(set, &set->requires, name, version);
krh@43	1102	}
krh@43	1103
krh@43	1104	void
krh@43	1105	razor_set_list_provides_packages(struct razor_set *set,
krh@43	1106	const char *name,
krh@43	1107	const char *version)
krh@43	1108	{
krh@43	1109	razor_set_list_property_packages(set, &set->provides, name, version);
krh@43	1110	}
krh@43	1111
krh@56	1112	static struct razor_entry *
krh@56	1113	find_entry(struct razor_set set, struct razor_entry dir, const char *pattern)
krh@56	1114	{
krh@56	1115	struct razor_entry *e;
krh@56	1116	const char n, pool = set->string_pool.data;
krh@56	1117	int len;
krh@56	1118
krh@56	1119	e = (struct razor_entry *) set->files.data + dir->start;
krh@56	1120	do {
krh@56	1121	n = pool + (e->name & RAZOR_ENTRY_MASK);
krh@56	1122	if (strcmp(pattern + 1, n) == 0)
krh@56	1123	return e;
krh@57	1124	len = strlen(n);
krh@56	1125	if (e->start != 0 && strncmp(pattern + 1, n, len) == 0 &&
krh@56	1126	pattern[len + 1] == '/') {
krh@56	1127	return find_entry(set, e, pattern + len + 1);
krh@56	1128	}
krh@56	1129	} while (((e++)->name & RAZOR_ENTRY_LAST) == 0);
krh@56	1130
krh@56	1131	return NULL;
krh@56	1132	}
krh@56	1133
krh@56	1134	static void
krh@56	1135	list_dir(struct razor_set set, struct razor_entry dir,
krh@56	1136	const char prefix, const char pattern)
krh@56	1137	{
krh@56	1138	struct razor_entry *e;
krh@56	1139	const char n, pool = set->string_pool.data;
krh@56	1140
krh@56	1141	e = (struct razor_entry *) set->files.data + dir->start;
krh@56	1142	do {
krh@56	1143	n = pool + (e->name & RAZOR_ENTRY_MASK);
krh@56	1144	if (pattern && pattern[0] && fnmatch(pattern, n, 0) != 0)
krh@56	1145	continue;
krh@56	1146	printf("%s/%s%s\n", prefix, n, e->start > 0 ? "/" : "");
krh@56	1147	} while (((e++)->name & RAZOR_ENTRY_LAST) == 0);
krh@56	1148	}
krh@56	1149
krh@56	1150	void
krh@56	1151	razor_set_list_files(struct razor_set set, const char pattern)
krh@56	1152	{
krh@56	1153	struct razor_entry *e;
krh@56	1154	char buffer[512], p, base;
krh@56	1155
krh@56	1156	if (pattern == NULL)
krh@56	1157	pattern = "/";
krh@56	1158
krh@56	1159	strcpy(buffer, pattern);
krh@56	1160	e = find_entry(set, set->files.data, buffer);
krh@56	1161	if (e && e->start > 0) {
krh@56	1162	base = NULL;
krh@56	1163	} else {
krh@56	1164	p = strrchr(buffer, '/');
krh@56	1165	if (p) {
krh@56	1166	*p = '\0';
krh@56	1167	base = p + 1;
krh@56	1168	} else {
krh@56	1169	base = NULL;
krh@56	1170	}
krh@56	1171	}
krh@56	1172	e = find_entry(set, set->files.data, buffer);
krh@56	1173	if (e->start != 0)
krh@56	1174	list_dir(set, e, buffer, base);
krh@56	1175	}
krh@56	1176
krh@56	1177	void
krh@56	1178	razor_set_list_file_packages(struct razor_set set, const char filename)
krh@56	1179	{
krh@56	1180	struct razor_entry *e;
krh@56	1181	struct razor_package packages, p;
krh@56	1182	const char *pool;
krh@56	1183	unsigned long *r;
krh@56	1184
krh@56	1185	e = find_entry(set, set->files.data, filename);
krh@56	1186	if (e == NULL)
krh@56	1187	return;
krh@56	1188
krh@60	1189	if (e->packages & RAZOR_IMMEDIATE)
krh@60	1190	r = &e->packages;
krh@60	1191	else
krh@60	1192	r = (unsigned long *) set->package_pool.data + e->packages;
krh@60	1193
krh@56	1194	packages = set->packages.data;
krh@56	1195	pool = set->string_pool.data;
krh@56	1196	while (~*r) {
krh@60	1197	p = &packages[*r & RAZOR_ENTRY_MASK];
krh@59	1198	printf("%s-%s\n", &pool[p->name], &pool[p->version]);
krh@60	1199	if (*r++ & RAZOR_IMMEDIATE)
krh@60	1200	break;
krh@56	1201	}
krh@56	1202	}
krh@56	1203
krh@56	1204	static unsigned long *
krh@56	1205	list_package_files(struct razor_set set, unsigned long r,
krh@56	1206	struct razor_entry *dir, unsigned long end,
krh@56	1207	char *prefix)
krh@56	1208	{
krh@56	1209	struct razor_entry e, f, *entries;
krh@56	1210	unsigned long next;
krh@56	1211	char *pool;
krh@56	1212	int len;
krh@56	1213
krh@56	1214	entries = (struct razor_entry *) set->files.data;
krh@56	1215	pool = set->string_pool.data;
krh@56	1216
krh@56	1217	e = entries + dir->start;
krh@56	1218	do {
krh@56	1219	if (entries + *r == e) {
krh@56	1220	printf("%s/%s\n", prefix,
krh@56	1221	pool + (e->name & RAZOR_ENTRY_MASK));
krh@56	1222	r++;
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	e = entries + dir->start;
krh@56	1229	do {
krh@56	1230	if (e->start == 0)
krh@56	1231	continue;
krh@56	1232
krh@56	1233	if (e->name & RAZOR_ENTRY_LAST)
krh@56	1234	next = end;
krh@56	1235	else {
krh@56	1236	f = e + 1;
krh@56	1237	while (f->start == 0 && !(f->name & RAZOR_ENTRY_LAST))
krh@56	1238	f++;
krh@56	1239	if (f->start == 0)
krh@56	1240	next = end;
krh@56	1241	else
krh@56	1242	next = f->start;
krh@56	1243	}
krh@56	1244
krh@56	1245	if (e->start <= r && r < next) {
krh@56	1246	len = strlen(prefix);
krh@56	1247	prefix[len] = '/';
krh@56	1248	strcpy(prefix + len + 1,
krh@56	1249	pool + (e->name & RAZOR_ENTRY_MASK));
krh@56	1250	r = list_package_files(set, r, e, next, prefix);
krh@56	1251	prefix[len] = '\0';
krh@56	1252	if (*r >= end)
krh@56	1253	break;
krh@56	1254	}
krh@56	1255	} while (((e++)->name & RAZOR_ENTRY_LAST) == 0);
krh@56	1256
krh@56	1257	return r;
krh@56	1258	}
krh@56	1259
krh@56	1260	void
krh@56	1261	razor_set_list_package_files(struct razor_set set, const char name)
krh@56	1262	{
krh@56	1263	struct razor_package *package;
krh@56	1264	unsigned long *r, end;
krh@56	1265	char buffer[512];
krh@56	1266
krh@56	1267	package = razor_set_get_package(set, name);
krh@56	1268
krh@56	1269	r = (unsigned long *) set->file_pool.data + package->files;
krh@56	1270	end = set->files.size / sizeof (struct razor_entry);
krh@56	1271	buffer[0] = '\0';
krh@56	1272	list_package_files(set, r, set->files.data, end, buffer);
krh@56	1273	}
krh@56	1274
krh@43	1275	static void
krh@21	1276	razor_set_validate(struct razor_set set, struct array unsatisfied)
krh@21	1277	{
krh@21	1278	struct razor_property r, p, rend, pend;
krh@21	1279	unsigned long *u;
krh@21	1280	char *pool;
krh@21	1281
krh@21	1282	p = set->provides.data;
krh@21	1283	rend = set->requires.data + set->requires.size;
krh@21	1284	pend = set->provides.data + set->provides.size;
krh@21	1285	pool = set->string_pool.data;
krh@21	1286
krh@35	1287	for (r = set->requires.data; r < rend; r++) {
krh@21	1288	while (p < pend && strcmp(&pool[r->name], &pool[p->name]) > 0)
krh@21	1289	p++;
krh@37	1290
krh@35	1291	/* If there is more than one version of a provides,
krh@35	1292	* seek to the end for the highest version. */
krh@35	1293	while (p + 1 < pend && p->name == (p + 1)->name)
krh@35	1294	p++;
krh@37	1295
krh@37	1296	/* FIXME: We need to track property flags (<, <=, =
krh@37	1297	* etc) to properly determine if a requires is
krh@37	1298	* satisfied. The current code doesn't track that the
krh@37	1299	* requires a = 1 isn't satisfied by a = 2 provides. */
krh@37	1300
krh@35	1301	if (p == pend \|\| strcmp(&pool[r->name], &pool[p->name]) != 0 \|\|
krh@35	1302	versioncmp(&pool[r->version], &pool[p->version]) > 0) {
krh@35	1303	/* FIXME: We ignore file requires for now. */
krh@35	1304	if (pool[r->name] == '/')
krh@35	1305	continue;
krh@21	1306	u = array_add(unsatisfied, sizeof *u);
krh@21	1307	u = r - (struct razor_property ) set->requires.data;
krh@21	1308	}
krh@21	1309	}
krh@21	1310	}
krh@21	1311
krh@21	1312	void
krh@21	1313	razor_set_list_unsatisfied(struct razor_set *set)
krh@21	1314	{
krh@21	1315	struct array unsatisfied;
krh@21	1316	struct razor_property requires, r;
krh@21	1317	unsigned long u, end;
krh@21	1318	char *pool;
krh@21	1319
krh@21	1320	array_init(&unsatisfied);
krh@21	1321	razor_set_validate(set, &unsatisfied);
krh@21	1322
krh@21	1323	end = unsatisfied.data + unsatisfied.size;
krh@21	1324	requires = set->requires.data;
krh@21	1325	pool = set->string_pool.data;
krh@21	1326
krh@21	1327	for (u = unsatisfied.data; u < end; u++) {
krh@21	1328	r = requires + *u;
krh@59	1329	printf("%s-%s not satisfied\n",
krh@21	1330	&pool[r->name], &pool[r->version]);
krh@21	1331	}
krh@21	1332
krh@21	1333	array_release(&unsatisfied);
krh@21	1334	}
krh@21	1335
krh@41	1336	#define UPSTREAM_SOURCE 0x80000000ul
krh@41	1337	#define INDEX_MASK 0x00fffffful
krh@41	1338
krh@41	1339	struct source {
krh@41	1340	struct razor_set *set;
krh@41	1341	unsigned long *requires_map;
krh@41	1342	unsigned long *provides_map;
krh@41	1343	};
krh@41	1344
krh@41	1345	static void
krh@41	1346	prepare_source(struct source source, struct razor_set set)
krh@41	1347	{
krh@41	1348	int count;
krh@41	1349	size_t size;
krh@41	1350
krh@41	1351	source->set = set;
krh@41	1352
krh@41	1353	count = set->requires.size / sizeof (struct razor_property);
krh@41	1354	size = count * sizeof *source->requires_map;
krh@41	1355	source->requires_map = zalloc(size);
krh@41	1356
krh@41	1357	count = set->provides.size / sizeof (struct razor_property);
krh@41	1358	size = count * sizeof *source->provides_map;
krh@41	1359	source->provides_map = zalloc(size);
krh@41	1360	}
krh@41	1361
krh@33	1362	static void
krh@33	1363	add_package(struct razor_importer *importer,
krh@41	1364	struct razor_package package, struct source source,
krh@41	1365	unsigned long flags)
krh@33	1366	{
krh@33	1367	char *pool;
krh@33	1368	unsigned long *r;
krh@41	1369	struct razor_package *p;
krh@33	1370
krh@41	1371	pool = source->set->string_pool.data;
krh@41	1372	p = array_add(&importer->set->packages, sizeof *p);
krh@41	1373	p->name = razor_importer_tokenize(importer, &pool[package->name]);
krh@41	1374	p->name \|= flags;
krh@41	1375	p->version = razor_importer_tokenize(importer,
krh@41	1376	&pool[package->version]);
krh@41	1377	p->requires = package->requires;
krh@41	1378	p->provides = package->provides;
krh@33	1379
krh@41	1380	r = (unsigned long *)
krh@41	1381	source->set->requires_pool.data + package->requires;
krh@41	1382	while (*r != ~0)
krh@41	1383	source->requires_map[*r++] = 1;
krh@41	1384
krh@41	1385	r = (unsigned long *)
krh@41	1386	source->set->provides_pool.data + package->provides;
krh@41	1387	while (*r != ~0)
krh@41	1388	source->provides_map[*r++] = 1;
krh@41	1389	}
krh@41	1390
krh@41	1391
krh@41	1392	/* Build the new package list sorted by merging the two package lists.
krh@41	1393	* Build new string pool as we go. (for now we just re-use that part of
krh@41	1394	* the importer). */
krh@41	1395	static void
krh@41	1396	merge_packages(struct razor_importer *importer,
krh@41	1397	struct source source1, struct source source2,
krh@41	1398	struct array *packages)
krh@41	1399	{
krh@41	1400	struct razor_package upstream_packages, p, s, send;
krh@41	1401	char spool, upool;
krh@41	1402	unsigned long u, uend;
krh@41	1403	int cmp;
krh@41	1404
krh@41	1405	upstream_packages = source2->set->packages.data;
krh@41	1406
krh@41	1407	u = packages->data;
krh@41	1408	uend = packages->data + packages->size;
krh@41	1409	upool = source2->set->string_pool.data;
krh@41	1410
krh@41	1411	s = source1->set->packages.data;
krh@41	1412	send = source1->set->packages.data + source1->set->packages.size;
krh@41	1413	spool = source1->set->string_pool.data;
krh@41	1414
krh@41	1415	while (s < send) {
krh@41	1416	p = upstream_packages + *u;
krh@41	1417
krh@41	1418	if (u < uend)
krh@41	1419	cmp = strcmp(&spool[s->name], &upool[p->name]);
krh@41	1420	if (u >= uend \|\| cmp < 0) {
krh@41	1421	add_package(importer, s, source1, 0);
krh@41	1422	s++;
krh@41	1423	} else if (cmp == 0) {
krh@41	1424	add_package(importer, p, source2, UPSTREAM_SOURCE);
krh@41	1425	s++;
krh@41	1426	u++;
krh@41	1427	} else {
krh@41	1428	add_package(importer, p, source2, UPSTREAM_SOURCE);
krh@41	1429	u++;
krh@41	1430	}
krh@41	1431	}
krh@41	1432	}
krh@41	1433
krh@41	1434	static unsigned long
krh@41	1435	add_property(struct razor_importer importer, struct array properties,
krh@41	1436	const char name, const char version)
krh@41	1437	{
krh@41	1438	struct razor_property *p;
krh@41	1439
krh@41	1440	p = array_add(properties, sizeof *p);
krh@41	1441	p->name = razor_importer_tokenize(importer, name);
krh@41	1442	p->version = razor_importer_tokenize(importer, version);
krh@41	1443
krh@41	1444	return p - (struct razor_property *) properties->data;
krh@41	1445	}
krh@41	1446
krh@41	1447	static void
krh@41	1448	merge_properties(struct array *properties,
krh@41	1449	struct razor_importer *importer,
krh@41	1450	struct razor_set *set1,
krh@41	1451	struct array *properties1,
krh@41	1452	unsigned long *map1,
krh@41	1453	struct razor_set *set2,
krh@41	1454	struct array *properties2,
krh@41	1455	unsigned long *map2)
krh@41	1456	{
krh@41	1457	struct razor_property p1, p2;
krh@41	1458	int i, j, cmp, count1, count2;
krh@41	1459	char pool1, pool2;
krh@41	1460
krh@41	1461	i = 0;
krh@41	1462	j = 0;
krh@41	1463	pool1 = set1->string_pool.data;
krh@41	1464	pool2 = set2->string_pool.data;
krh@41	1465
krh@41	1466	count1 = properties1->size / sizeof *p1;
krh@41	1467	count2 = properties2->size / sizeof *p2;
krh@41	1468	while (i < count1 \|\| j < count2) {
krh@41	1469	if (i < count1 && map1[i] == 0) {
krh@41	1470	i++;
krh@41	1471	continue;
krh@41	1472	}
krh@41	1473	if (j < count2 && map2[j] == 0) {
krh@41	1474	j++;
krh@41	1475	continue;
krh@41	1476	}
krh@41	1477	p1 = (struct razor_property *) properties1->data + i;
krh@41	1478	p2 = (struct razor_property *) properties2->data + j;
krh@41	1479	if (i < count1 && j < count2)
krh@41	1480	cmp = strcmp(&pool1[p1->name], &pool2[p2->name]);
krh@41	1481	else if (i < count1)
krh@41	1482	cmp = -1;
krh@41	1483	else
krh@41	1484	cmp = 1;
krh@41	1485	if (cmp == 0)
krh@41	1486	cmp = versioncmp(&pool1[p1->version],
krh@41	1487	&pool2[p2->version]);
krh@41	1488	if (cmp < 0) {
krh@41	1489	map1[i++] = add_property(importer,
krh@41	1490	properties,
krh@41	1491	&pool1[p1->name],
krh@41	1492	&pool1[p1->version]);
krh@41	1493	} else if (cmp > 0) {
krh@41	1494	map2[j++] = add_property(importer,
krh@41	1495	properties,
krh@41	1496	&pool2[p2->name],
krh@41	1497	&pool2[p2->version]);
krh@41	1498	} else {
krh@41	1499	map1[i++] = map2[j++] = add_property(importer,
krh@41	1500	properties,
krh@41	1501	&pool1[p1->name],
krh@41	1502	&pool1[p1->version]);
krh@41	1503	}
krh@41	1504	}
krh@41	1505	}
krh@41	1506
krh@41	1507	static unsigned long
krh@41	1508	emit_properties(struct array *source_pool, unsigned long index,
krh@41	1509	unsigned long map, struct array pool)
krh@41	1510	{
krh@41	1511	unsigned long r, p, q;
krh@41	1512
krh@41	1513	r = pool->size / sizeof *q;
krh@41	1514	p = (unsigned long *) source_pool->data + index;
krh@41	1515	while (*p != ~0) {
krh@41	1516	q = array_add(pool, sizeof *q);
krh@41	1517	q = map[p++];
krh@33	1518	}
krh@33	1519
krh@41	1520	q = array_add(pool, sizeof *q);
krh@41	1521	*q = ~0;
krh@41	1522
krh@41	1523	return r;
krh@41	1524	}
krh@41	1525
krh@41	1526	/* Rebuild property->packages maps. We can't just remap these, as a
krh@41	1527	* property may have lost or gained a number of packages. Allocate an
krh@41	1528	* array per property and loop through the packages and add them to
krh@41	1529	* the arrays for their properties. */
krh@41	1530	static void
krh@41	1531	rebuild_package_lists(struct razor_set *set)
krh@41	1532	{
krh@41	1533	int requires_count, provides_count;
krh@41	1534	struct array requires_pkgs, provides_pkgs, *a;
krh@41	1535	struct razor_package pkg, pkg_end;
krh@41	1536	struct razor_property prop, prop_end;
krh@41	1537	unsigned long r, q, rpool, ppool;
krh@41	1538
krh@41	1539	requires_count = set->requires.size / sizeof (struct razor_property);
krh@41	1540	provides_count = set->provides.size / sizeof (struct razor_property);
krh@41	1541	requires_pkgs = zalloc(requires_count * sizeof *requires_pkgs);
krh@41	1542	provides_pkgs = zalloc(provides_count * sizeof *provides_pkgs);
krh@41	1543	pkg_end = set->packages.data + set->packages.size;
krh@41	1544	rpool = set->requires_pool.data;
krh@41	1545	ppool = set->provides_pool.data;
krh@41	1546
krh@41	1547	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {
krh@41	1548	for (r = &rpool[pkg->requires]; *r != ~0; r++) {
krh@41	1549	q = array_add(&requires_pkgs[r], sizeof q);
krh@41	1550	q = pkg - (struct razor_package ) set->packages.data;
krh@41	1551	}
krh@41	1552	for (r = &ppool[pkg->provides]; *r != ~0; r++) {
krh@41	1553	q = array_add(&provides_pkgs[r], sizeof q);
krh@41	1554	q = pkg - (struct razor_package ) set->packages.data;
krh@41	1555	}
krh@33	1556	}
krh@33	1557
krh@41	1558	prop_end = set->requires.data + set->requires.size;
krh@41	1559	a = requires_pkgs;
krh@41	1560	for (prop = set->requires.data; prop < prop_end; prop++, a++) {
krh@41	1561	prop->packages = add_to_property_pool(&set->requires_pool, a);
krh@41	1562	array_release(a);
krh@41	1563	}
krh@41	1564	free(requires_pkgs);
krh@41	1565
krh@41	1566	prop_end = set->provides.data + set->provides.size;
krh@41	1567	a = provides_pkgs;
krh@41	1568	for (prop = set->provides.data; prop < prop_end; prop++, a++) {
krh@41	1569	prop->packages = add_to_property_pool(&set->provides_pool, a);
krh@41	1570	array_release(a);
krh@41	1571	}
krh@41	1572	free(provides_pkgs);
krh@33	1573	}
krh@33	1574
krh@33	1575	/* Add packages from 'upstream' to 'set'. The packages to add are
krh@33	1576	* specified by the 'packages' array, which is a sorted list of
krh@33	1577	* package indexes. Returns a newly allocated package set. Does not
krh@41	1578	* enforce validity of the resulting package set.
krh@41	1579	*
krh@41	1580	* This looks more complicated than it is. An easy way to merge two
krh@41	1581	* package sets would be to just use a razor_importer, but that
krh@41	1582	* requires resorting, and is thus O(n log n). We can do this in a
krh@41	1583	* linear sweep, but it gets a little more complicated.
krh@41	1584	*/
krh@33	1585	struct razor_set *
krh@33	1586	razor_set_add(struct razor_set set, struct razor_set upstream,
krh@33	1587	struct array *packages)
krh@33	1588	{
krh@41	1589	struct razor_set *result;
krh@33	1590	struct razor_importer *importer;
krh@41	1591	struct razor_package p, pend;
krh@41	1592	struct source source, upstream_source;
krh@33	1593
krh@33	1594	importer = razor_importer_new();
krh@33	1595
krh@41	1596	prepare_source(&upstream_source, upstream);
krh@41	1597	prepare_source(&source, set);
krh@41	1598
krh@41	1599	merge_packages(importer, &source, &upstream_source, packages);
krh@41	1600
krh@41	1601	/* As we built the package list, we filled out a bitvector of
krh@41	1602	* the properties that are referenced by the packages in the
krh@41	1603	* new set. Now we do a parallel loop through the properties
krh@41	1604	* and emit those marked in the bit vector to the new set. In
krh@41	1605	* the process, we update the bit vector to actually map from
krh@41	1606	* indices in the old property list to indices in the new
krh@41	1607	* property list for both sets. */
krh@41	1608
krh@41	1609	merge_properties(&importer->set->requires, importer,
krh@41	1610	set, &set->requires, source.requires_map,
krh@41	1611	upstream, &upstream->requires,
krh@41	1612	upstream_source.requires_map);
krh@41	1613	merge_properties(&importer->set->provides, importer,
krh@41	1614	set, &set->provides, source.provides_map,
krh@41	1615	upstream, &upstream->provides,
krh@41	1616	upstream_source.provides_map);
krh@41	1617
krh@41	1618	/* Now we loop through the packages again and emit the
krh@41	1619	* property lists, remapped to point to the new properties. */
krh@41	1620
krh@41	1621	pend = importer->set->packages.data + importer->set->packages.size;
krh@41	1622	for (p = importer->set->packages.data; p < pend; p++) {
krh@41	1623	struct source *src;
krh@41	1624
krh@41	1625	if (p->name & UPSTREAM_SOURCE)
krh@41	1626	src = &upstream_source;
krh@41	1627	else
krh@41	1628	src = &source;
krh@41	1629
krh@41	1630	p->requires = emit_properties(&src->set->requires_pool,
krh@41	1631	p->requires,
krh@41	1632	src->requires_map,
krh@41	1633	&importer->set->requires_pool);
krh@41	1634	p->provides = emit_properties(&src->set->provides_pool,
krh@41	1635	p->provides,
krh@41	1636	src->provides_map,
krh@41	1637	&importer->set->provides_pool);
krh@41	1638	p->name &= INDEX_MASK;
krh@33	1639	}
krh@33	1640
krh@41	1641	rebuild_package_lists(importer->set);
krh@41	1642
krh@41	1643	result = importer->set;
krh@41	1644	array_release(&importer->buckets);
krh@41	1645	free(importer);
krh@41	1646
krh@41	1647	return result;
krh@33	1648	}
krh@33	1649
krh@37	1650	void
krh@37	1651	razor_set_satisfy(struct razor_set set, struct array unsatisfied,
krh@37	1652	struct razor_set upstream, struct array list)
krh@37	1653	{
krh@37	1654	struct razor_property requires, r;
krh@37	1655	struct razor_property p, pend;
krh@39	1656	unsigned long u, end, pkg, package_pool;
krh@37	1657	char pool, upool;
krh@37	1658
krh@37	1659	end = unsatisfied->data + unsatisfied->size;
krh@37	1660	requires = set->requires.data;
krh@37	1661	pool = set->string_pool.data;
krh@37	1662
krh@37	1663	p = upstream->provides.data;
krh@37	1664	pend = upstream->provides.data + upstream->provides.size;
krh@37	1665	upool = upstream->string_pool.data;
krh@39	1666	package_pool = upstream->package_pool.data;
krh@37	1667
krh@37	1668	for (u = unsatisfied->data; u < end; u++) {
krh@37	1669	r = requires + *u;
krh@37	1670
krh@37	1671	while (p < pend && strcmp(&pool[r->name], &upool[p->name]) > 0)
krh@37	1672	p++;
krh@37	1673	/* If there is more than one version of a provides,
krh@37	1674	* seek to the end for the highest version. */
krh@37	1675	while (p + 1 < pend && p->name == (p + 1)->name)
krh@37	1676	p++;
krh@37	1677
krh@37	1678	if (p == pend \|\|
krh@37	1679	strcmp(&pool[r->name], &upool[p->name]) != 0 \|\|
krh@37	1680	versioncmp(&pool[r->version], &upool[p->version]) > 0) {
krh@37	1681	/* Do we need to track unsatisfiable requires
krh@37	1682	* as we go, or should we just do a
krh@37	1683	* razor_set_validate() at the end? */
krh@37	1684	} else {
krh@37	1685	pkg = array_add(list, sizeof *pkg);
krh@37	1686	/* We just pull in the first package that provides */
krh@39	1687	*pkg = package_pool[p->packages];
krh@37	1688	}
krh@37	1689	}
krh@37	1690	}
krh@37	1691
krh@38	1692	static void
krh@38	1693	find_packages(struct razor_set *set,
krh@38	1694	int count, const char *packages, struct array list)
krh@38	1695	{
krh@38	1696	struct razor_package *p;
krh@38	1697	unsigned long *r;
krh@38	1698	int i;
krh@38	1699
krh@38	1700	/* FIXME: Sort the packages. */
krh@38	1701	for (i = 0; i < count; i++) {
krh@38	1702	p = razor_set_get_package(set, packages[i]);
krh@38	1703	r = array_add(list, sizeof *r);
krh@38	1704	r = p - (struct razor_package ) set->packages.data;
krh@38	1705	}
krh@38	1706	}
krh@38	1707
krh@38	1708	static void
krh@38	1709	find_all_packages(struct razor_set *set,
krh@38	1710	struct razor_set upstream, struct array list)
krh@38	1711	{
krh@38	1712	struct razor_package p, u, pend, uend;
krh@38	1713	unsigned long *r;
krh@38	1714	char pool, upool;
krh@38	1715
krh@38	1716	pend = set->packages.data + set->packages.size;
krh@38	1717	pool = set->string_pool.data;
krh@38	1718	u = upstream->packages.data;
krh@38	1719	uend = upstream->packages.data + upstream->packages.size;
krh@38	1720	upool = upstream->string_pool.data;
krh@38	1721
krh@38	1722	for (p = set->packages.data; p < pend; p++) {
krh@38	1723	while (u < uend && strcmp(&pool[p->name], &upool[u->name]) > 0)
krh@38	1724	u++;
krh@38	1725	if (strcmp(&pool[p->name], &upool[u->name]) == 0) {
krh@38	1726	r = array_add(list, sizeof *r);
krh@38	1727	r = u - (struct razor_package ) upstream->packages.data;
krh@38	1728	}
krh@38	1729	}
krh@38	1730	}
krh@38	1731
krh@33	1732	struct razor_set *
krh@33	1733	razor_set_update(struct razor_set set, struct razor_set upstream,
krh@33	1734	int count, const char **packages)
krh@33	1735	{
krh@37	1736	struct razor_set *new;
krh@43	1737	struct razor_package *upackages;
krh@37	1738	struct array list, unsatisfied;
krh@37	1739	char *pool;
krh@38	1740	unsigned long u, end;
krh@38	1741	int total = 0;
krh@33	1742
krh@33	1743	array_init(&list);
krh@38	1744	if (count > 0)
krh@38	1745	find_packages(upstream, count, packages, &list);
krh@38	1746	else
krh@38	1747	find_all_packages(set, upstream, &list);
krh@33	1748
krh@37	1749	end = list.data + list.size;
krh@37	1750	upackages = upstream->packages.data;
krh@37	1751	pool = upstream->string_pool.data;
krh@38	1752	total += list.size / sizeof *u;
krh@37	1753
krh@37	1754	while (list.size > 0) {
krh@37	1755	new = razor_set_add(set, upstream, &list);
krh@37	1756	array_release(&list);
krh@37	1757	razor_set_destroy(set);
krh@37	1758	set = new;
krh@37	1759
krh@37	1760	array_init(&unsatisfied);
krh@37	1761	razor_set_validate(new, &unsatisfied);
krh@37	1762	array_init(&list);
krh@37	1763	razor_set_satisfy(new, &unsatisfied, upstream, &list);
krh@37	1764	array_release(&unsatisfied);
krh@37	1765
krh@37	1766	end = list.data + list.size;
krh@37	1767	upackages = upstream->packages.data;
krh@37	1768	pool = upstream->string_pool.data;
krh@38	1769	total += list.size / sizeof *u;
krh@37	1770	}
krh@37	1771
krh@37	1772	array_release(&list);
krh@37	1773
krh@37	1774	return set;
krh@33	1775	}
krh@33	1776
krh@44	1777	/* The diff order matters. We should sort the packages so that a
krh@44	1778	* REMOVE of a package comes before the INSTALL, and so that all
krh@44	1779	* requires for a package have been installed before the package.
krh@44	1780	**/
krh@44	1781
krh@44	1782	void
krh@44	1783	razor_set_diff(struct razor_set set, struct razor_set upstream,
krh@44	1784	razor_package_callback_t callback, void *data)
krh@44	1785	{
krh@44	1786	struct razor_package p, pend, u, uend;
krh@44	1787	char ppool, upool;
krh@44	1788	int res = 0;
krh@44	1789
krh@44	1790	p = set->packages.data;
krh@44	1791	pend = set->packages.data + set->packages.size;
krh@44	1792	ppool = set->string_pool.data;
krh@44	1793
krh@44	1794	u = upstream->packages.data;
krh@44	1795	uend = upstream->packages.data + upstream->packages.size;
krh@44	1796	upool = upstream->string_pool.data;
krh@44	1797
krh@44	1798	while (p < pend \|\| u < uend) {
krh@44	1799	if (p < pend && u < uend) {
krh@44	1800	res = strcmp(&ppool[p->name], &upool[u->name]);
krh@44	1801	if (res == 0)
krh@44	1802	res = versioncmp(&ppool[p->version],
krh@44	1803	&upool[u->version]);
krh@44	1804	}
krh@44	1805
krh@44	1806	if (u == uend \|\| res < 0) {
krh@44	1807	callback(&ppool[p->name], &ppool[p->version],
krh@44	1808	NULL, data);
krh@44	1809	p++;
krh@44	1810	continue;
krh@44	1811	} else if (p == pend \|\| res > 0) {
krh@44	1812	callback(&upool[u->name], NULL, &upool[u->version],
krh@44	1813	data);
krh@44	1814	u++;
krh@44	1815	continue;
krh@44	1816	} else {
krh@44	1817	p++;
krh@44	1818	u++;
krh@44	1819	}
krh@44	1820	}
krh@44	1821	}

author	Kristian H?gsberg <krh@redhat.com>
	Wed Oct 24 13:20:12 2007 -0400 (2007-10-24)
changeset 60	fca1ef50dd2c
parent 59	c525dec02ef4
child 61	b0e1638a9f96
permissions	-rw-r--r--