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

author	Dan Winship <danw@gnome.org>
	Mon Feb 11 11:57:47 2008 -0500 (2008-02-11)
changeset 120	b937596c33d7
parent 119	66998d6a1765
child 121	f991e2623c41
permissions	-rw-r--r--