razor: razor.c@93278d8ec39c (annotated)

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

author	Kristian H?gsberg <krh@redhat.com>
	Thu Nov 08 17:14:19 2007 -0500 (2007-11-08)
changeset 75	93278d8ec39c
parent 69	35ca1ba469ec
child 78	89c06e68824a
permissions	-rw-r--r--