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

author	Kristian H?gsberg <krh@redhat.com>
	Tue Nov 13 01:08:08 2007 -0500 (2007-11-13)
changeset 81	7bc11dfb4bbd
parent 78	89c06e68824a
child 83	43ef0eb1b603
permissions	-rw-r--r--