razor: razor.c@4ec6e2a55c34 (annotated)

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

author	Dan Winship <danw@gnome.org>
	Fri Feb 08 11:19:36 2008 -0500 (2008-02-08)
changeset 116	4ec6e2a55c34
parent 115	26edeea5c95a
child 117	1c213cbf9da9
permissions	-rw-r--r--