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

author	Kristian H?gsberg <krh@redhat.com>
	Thu Jan 10 23:30:51 2008 -0500 (2008-01-10)
changeset 99	7e5f2050db0e
parent 98	ec850cbd6935
child 100	27aada326858
permissions	-rw-r--r--