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

author	Kristian H?gsberg <krh@redhat.com>
	Sat Sep 29 23:30:35 2007 -0400 (2007-09-29)
changeset 42	aedfc8f95227
parent 39	5fe9c9286cd0
child 43	d37d57c99cac
permissions	-rw-r--r--