razor: razor.c@3e42af5305ac (annotated)

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

author	Kristian H?gsberg <krh@redhat.com>
	Thu Oct 25 13:21:26 2007 -0400 (2007-10-25)
changeset 62	3e42af5305ac
parent 60	fca1ef50dd2c
child 64	8e37a9f8fd70
permissions	-rw-r--r--