razor: razor.c@b21a4953ff91 (annotated)

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

author	Kristian H?gsberg <krh@redhat.com>
	Wed Oct 24 00:02:44 2007 -0400 (2007-10-24)
changeset 55	b21a4953ff91
parent 52	8cb4c45dc86f
child 56	9c00581c71be
permissions	-rw-r--r--