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

author	Kristian H?gsberg <krh@redhat.com>
	Thu Jan 03 09:32:31 2008 -0500 (2008-01-03)
changeset 91	6884cefd1b8c
parent 83	43ef0eb1b603
child 92	74f19848a71b
permissions	-rw-r--r--