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

author	Kristian H?gsberg <krh@redhat.com>
	Mon Oct 22 22:53:55 2007 -0400 (2007-10-22)
changeset 52	8cb4c45dc86f
parent 49	c66fd9a1eabe
child 54	9e3907688d78
permissions	-rw-r--r--