razor: razor.c@00f19df51272 (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;
danw@159	99	struct array file_requires;
krh@30	100	};
krh@30	101
krh@0	102	static void *
krh@0	103	zalloc(size_t size)
krh@0	104	{
krh@0	105	void *p;
krh@0	106
krh@0	107	p = malloc(size);
krh@0	108	memset(p, 0, size);
krh@0	109
krh@0	110	return p;
krh@0	111	}
krh@0	112
krh@19	113	struct razor_set_section razor_sections[] = {
krh@56	114	{ RAZOR_STRING_POOL, offsetof(struct razor_set, string_pool) },
krh@19	115	{ RAZOR_PACKAGES, offsetof(struct razor_set, packages) },
krh@66	116	{ RAZOR_PROPERTIES, offsetof(struct razor_set, properties) },
krh@56	117	{ RAZOR_FILES, offsetof(struct razor_set, files) },
krh@39	118	{ RAZOR_PACKAGE_POOL, offsetof(struct razor_set, package_pool) },
krh@66	119	{ RAZOR_PROPERTY_POOL, offsetof(struct razor_set, property_pool) },
krh@56	120	{ RAZOR_FILE_POOL, offsetof(struct razor_set, file_pool) },
krh@19	121	};
krh@19	122
krh@4	123	struct razor_set *
krh@4	124	razor_set_create(void)
krh@0	125	{
krh@150	126	struct razor_set *set;
krh@150	127	struct razor_entry *e;
krh@150	128
krh@150	129	set = zalloc(sizeof *set);
krh@150	130
krh@150	131	array_init(&set->files);
krh@150	132	e = array_add(&set->files, sizeof *e);
krh@150	133	e->name = 0;
krh@150	134	e->flags = RAZOR_ENTRY_LAST;
krh@150	135	e->start = 0;
krh@150	136	list_set_empty(&e->packages);
krh@150	137
krh@150	138	return set;
krh@0	139	}
krh@0	140
krh@4	141	struct razor_set *
krh@4	142	razor_set_open(const char *filename)
krh@0	143	{
krh@4	144	struct razor_set *set;
krh@19	145	struct razor_set_section *s;
krh@0	146	struct stat stat;
krh@19	147	struct array *array;
krh@19	148	int fd;
krh@0	149
krh@4	150	set = zalloc(sizeof *set);
krh@0	151	fd = open(filename, O_RDONLY);
krh@0	152	if (fstat(fd, &stat) < 0)
krh@0	153	return NULL;
krh@4	154	set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
krh@4	155	if (set->header == MAP_FAILED) {
krh@4	156	free(set);
krh@0	157	return NULL;
krh@0	158	}
krh@0	159
krh@19	160	for (s = set->header->sections; ~s->type; s++) {
krh@19	161	if (s->type >= ARRAY_SIZE(razor_sections))
krh@19	162	continue;
krh@19	163	if (s->type != razor_sections[s->type].type)
krh@19	164	continue;
krh@19	165	array = (void *) set + razor_sections[s->type].offset;
krh@19	166	array->data = (void *) set->header + s->offset;
krh@19	167	array->size = s->size;
krh@19	168	array->alloc = s->size;
krh@0	169	}
krh@0	170	close(fd);
krh@0	171
krh@4	172	return set;
krh@0	173	}
krh@0	174
krh@0	175	void
krh@4	176	razor_set_destroy(struct razor_set *set)
krh@0	177	{
krh@0	178	unsigned int size;
krh@19	179	struct array *a;
krh@0	180	int i;
krh@0	181
krh@4	182	if (set->header) {
krh@4	183	for (i = 0; set->header->sections[i].type; i++)
krh@0	184	;
krh@4	185	size = set->header->sections[i].type;
krh@4	186	munmap(set->header, size);
krh@0	187	} else {
krh@19	188	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19	189	a = (void *) set + razor_sections[i].offset;
krh@19	190	free(a->data);
krh@19	191	}
krh@0	192	}
krh@0	193
krh@4	194	free(set);
krh@0	195	}
krh@0	196
krh@43	197	int
krh@4	198	razor_set_write(struct razor_set set, const char filename)
krh@0	199	{
krh@0	200	char data[4096];
krh@4	201	struct razor_set_header header = (struct razor_set_header ) data;
krh@19	202	struct array *a;
danw@108	203	uint32_t offset;
krh@17	204	int i, fd;
krh@0	205
krh@0	206	memset(data, 0, sizeof data);
krh@4	207	header->magic = RAZOR_MAGIC;
krh@4	208	header->version = RAZOR_VERSION;
krh@17	209	offset = sizeof data;
krh@0	210
krh@19	211	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19	212	if (razor_sections[i].type != i)
krh@19	213	continue;
krh@19	214	a = (void *) set + razor_sections[i].offset;
krh@19	215	header->sections[i].type = i;
krh@17	216	header->sections[i].offset = offset;
krh@19	217	header->sections[i].size = a->size;
krh@91	218	offset += ALIGN(a->size, 4096);
krh@17	219	}
krh@0	220
krh@19	221	header->sections[i].type = ~0;
krh@17	222	header->sections[i].offset = 0;
krh@17	223	header->sections[i].size = 0;
krh@10	224
krh@0	225	fd = open(filename, O_CREAT \| O_WRONLY \| O_TRUNC, 0666);
krh@0	226	if (fd < 0)
krh@0	227	return -1;
krh@0	228
krh@91	229	razor_write(fd, data, sizeof data);
danw@113	230	memset(data, 0, sizeof data);
krh@19	231	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19	232	if (razor_sections[i].type != i)
krh@19	233	continue;
krh@19	234	a = (void *) set + razor_sections[i].offset;
danw@113	235	razor_write(fd, a->data, a->size);
danw@113	236	razor_write(fd, data, ALIGN(a->size, 4096) - a->size);
krh@19	237	}
krh@17	238
krh@17	239	close(fd);
krh@0	240
krh@0	241	return 0;
krh@0	242	}
krh@0	243
krh@27	244	void
danw@143	245	razor_build_evr(char evr_buf, int size, const char epoch,
danw@143	246	const char version, const char release)
danw@143	247	{
danw@143	248	int len;
danw@143	249
danw@143	250	if (!version \|\| !*version) {
danw@143	251	*evr_buf = '\0';
danw@143	252	return;
danw@143	253	}
danw@143	254
danw@143	255	if (epoch && *epoch && strcmp(epoch, "0") != 0) {
danw@143	256	len = snprintf(evr_buf, size, "%s:", epoch);
danw@143	257	evr_buf += len;
danw@143	258	size -= len;
danw@143	259	}
danw@143	260	len = snprintf(evr_buf, size, "%s", version);
danw@143	261	evr_buf += len;
danw@143	262	size -= len;
danw@143	263	if (release && *release)
danw@143	264	snprintf(evr_buf, size, "-%s", release);
danw@143	265	}
danw@143	266
danw@143	267	void
krh@30	268	razor_importer_begin_package(struct razor_importer *importer,
krh@30	269	const char name, const char version)
krh@13	270	{
krh@25	271	struct razor_package *p;
krh@13	272
krh@30	273	p = array_add(&importer->set->packages, sizeof *p);
krh@95	274	p->name = hashtable_tokenize(&importer->table, name);
danw@120	275	p->flags = 0;
krh@95	276	p->version = hashtable_tokenize(&importer->table, version);
krh@13	277
krh@30	278	importer->package = p;
krh@66	279	array_init(&importer->properties);
krh@13	280	}
krh@13	281
krh@13	282	void
krh@30	283	razor_importer_finish_package(struct razor_importer *importer)
krh@13	284	{
danw@117	285	list_set_array(&importer->package->properties,
danw@117	286	&importer->set->property_pool,
danw@124	287	&importer->properties,
danw@124	288	1);
krh@13	289
krh@66	290	array_release(&importer->properties);
krh@13	291	}
krh@13	292
krh@66	293	void
krh@30	294	razor_importer_add_property(struct razor_importer *importer,
danw@109	295	const char *name,
danw@109	296	enum razor_version_relation relation,
danw@109	297	const char *version,
krh@66	298	enum razor_property_type type)
krh@13	299	{
krh@25	300	struct razor_property *p;
danw@108	301	uint32_t *r;
krh@13	302
krh@66	303	p = array_add(&importer->set->properties, sizeof *p);
danw@119	304	p->name = hashtable_tokenize(&importer->table, name);
danw@119	305	p->flags = 0;
danw@119	306	p->type = type;
danw@109	307	p->relation = relation;
krh@95	308	p->version = hashtable_tokenize(&importer->table, version);
danw@117	309	list_set_ptr(&p->packages, importer->package -
danw@117	310	(struct razor_package *) importer->set->packages.data);
krh@13	311
krh@66	312	r = array_add(&importer->properties, sizeof *r);
krh@66	313	r = p - (struct razor_property ) importer->set->properties.data;
danw@159	314
danw@159	315	if (type == RAZOR_PROPERTY_REQUIRES && *name == '/') {
danw@159	316	r = array_add(&importer->file_requires, sizeof *r);
danw@159	317	*r = p->name;
danw@159	318	}
krh@30	319	}
krh@30	320
krh@46	321	void
krh@46	322	razor_importer_add_file(struct razor_importer importer, const char name)
krh@46	323	{
krh@52	324	struct import_entry *e;
krh@48	325
krh@52	326	e = array_add(&importer->files, sizeof *e);
krh@52	327
krh@52	328	e->package = importer->package -
krh@52	329	(struct razor_package *) importer->set->packages.data;
krh@52	330	e->name = strdup(name);
krh@46	331	}
krh@46	332
krh@30	333	struct razor_importer *
krh@30	334	razor_importer_new(void)
krh@30	335	{
krh@30	336	struct razor_importer *importer;
krh@30	337
krh@30	338	importer = zalloc(sizeof *importer);
krh@30	339	importer->set = razor_set_create();
krh@78	340	hashtable_init(&importer->table, &importer->set->string_pool);
krh@30	341
krh@30	342	return importer;
krh@9	343	}
krh@9	344
krh@75	345	/* Destroy an importer without creating the set. */
krh@75	346	void
krh@75	347	razor_importer_destroy(struct razor_importer *importer)
krh@75	348	{
krh@75	349	/* FIXME: write this */
krh@75	350	}
krh@75	351
krh@75	352
krh@22	353	typedef int (compare_with_data_func_t)(const void p1,
krh@22	354	const void *p,
krh@22	355	void *data);
krh@22	356
krh@25	357	struct qsort_context {
krh@25	358	size_t size;
krh@25	359	compare_with_data_func_t compare;
krh@25	360	void *data;
krh@25	361	};
krh@25	362
krh@22	363	static void
krh@22	364	qsort_swap(void p1, void p2, size_t size)
krh@22	365	{
krh@22	366	char buffer[size];
krh@22	367
krh@22	368	memcpy(buffer, p1, size);
krh@22	369	memcpy(p1, p2, size);
krh@22	370	memcpy(p2, buffer, size);
krh@22	371	}
krh@22	372
krh@25	373	static void
danw@108	374	__qsort_with_data(void base, size_t nelem, uint32_t map,
krh@25	375	struct qsort_context *ctx)
krh@22	376	{
krh@22	377	void p, start, end, pivot;
danw@108	378	uint32_t mp, mstart, *mend, tmp;
krh@22	379	int left, right, result;
krh@25	380	size_t size = ctx->size;
krh@22	381
krh@22	382	p = base;
krh@22	383	start = base;
krh@22	384	end = base + nelem * size;
krh@25	385	mp = map;
krh@25	386	mstart = map;
krh@25	387	mend = map + nelem;
krh@22	388	pivot = base + (random() % nelem) * size;
krh@25	389
krh@22	390	while (p < end) {
krh@25	391	result = ctx->compare(p, pivot, ctx->data);
krh@22	392	if (result < 0) {
krh@22	393	qsort_swap(p, start, size);
krh@25	394	tmp = *mp;
krh@25	395	mp = mstart;
krh@25	396	*mstart = tmp;
krh@22	397	if (start == pivot)
krh@22	398	pivot = p;
krh@22	399	start += size;
krh@25	400	mstart++;
krh@22	401	p += size;
krh@29	402	mp++;
krh@22	403	} else if (result == 0) {
krh@22	404	p += size;
krh@25	405	mp++;
krh@22	406	} else {
krh@22	407	end -= size;
krh@25	408	mend--;
krh@22	409	qsort_swap(p, end, size);
krh@25	410	tmp = *mp;
krh@29	411	mp = mend;
krh@29	412	*mend = tmp;
krh@22	413	if (end == pivot)
krh@22	414	pivot = p;
krh@22	415	}
krh@22	416	}
krh@22	417
krh@22	418	left = (start - base) / size;
krh@22	419	right = (base + nelem * size - end) / size;
krh@22	420	if (left > 1)
krh@25	421	__qsort_with_data(base, left, map, ctx);
krh@22	422	if (right > 1)
krh@25	423	__qsort_with_data(end, right, mend, ctx);
krh@25	424	}
krh@25	425
danw@137	426	static uint32_t *
krh@25	427	qsort_with_data(void *base, size_t nelem, size_t size,
krh@25	428	compare_with_data_func_t compare, void *data)
krh@25	429	{
krh@25	430	struct qsort_context ctx;
danw@108	431	uint32_t *map;
krh@25	432	int i;
krh@25	433
krh@75	434	if (nelem == 0)
krh@75	435	return NULL;
krh@75	436
krh@25	437	ctx.size = size;
krh@25	438	ctx.compare = compare;
krh@25	439	ctx.data = data;
krh@25	440
danw@108	441	map = malloc(nelem * sizeof (uint32_t));
krh@25	442	for (i = 0; i < nelem; i++)
krh@25	443	map[i] = i;
krh@25	444
krh@25	445	__qsort_with_data(base, nelem, map, &ctx);
krh@25	446
krh@25	447	return map;
krh@22	448	}
krh@9	449
krh@9	450	static int
krh@35	451	versioncmp(const char s1, const char s2)
krh@35	452	{
krh@35	453	const char p1, p2;
krh@35	454	long n1, n2;
krh@35	455	int res;
krh@35	456
danw@153	457	n1 = strtol(s1, (char **) &p1, 10);
danw@153	458	n2 = strtol(s2, (char **) &p2, 10);
krh@35	459
krh@35	460	/* Epoch; if one but not the other has an epoch set, default
krh@35	461	* the epoch-less version to 0. */
krh@35	462	res = (p1 == ':') - (p2 == ':');
krh@35	463	if (res < 0) {
krh@35	464	n1 = 0;
krh@35	465	p1 = s1;
krh@35	466	p2++;
krh@35	467	} else if (res > 0) {
krh@35	468	p1++;
krh@35	469	n2 = 0;
krh@35	470	p2 = s2;
krh@35	471	}
krh@35	472
krh@35	473	if (n1 != n2)
krh@35	474	return n1 - n2;
krh@35	475	while (p1 && p2) {
krh@35	476	if (p1 != p2)
krh@35	477	return p1 - p2;
krh@35	478	p1++;
krh@35	479	p2++;
krh@35	480	if (isdigit(p1) && isdigit(p2))
krh@35	481	return versioncmp(p1, p2);
krh@35	482	}
krh@35	483
krh@35	484	return p1 - p2;
krh@35	485	}
krh@35	486
krh@35	487	static int
krh@22	488	compare_packages(const void p1, const void p2, void *data)
krh@9	489	{
krh@25	490	const struct razor_package pkg1 = p1, pkg2 = p2;
krh@22	491	struct razor_set *set = data;
krh@22	492	char *pool = set->string_pool.data;
krh@9	493
danw@120	494	/* FIXME: what if the flags are different? */
krh@23	495	if (pkg1->name == pkg2->name)
krh@35	496	return versioncmp(&pool[pkg1->version], &pool[pkg2->version]);
krh@23	497	else
krh@23	498	return strcmp(&pool[pkg1->name], &pool[pkg2->name]);
krh@9	499	}
krh@9	500
krh@9	501	static int
krh@22	502	compare_properties(const void p1, const void p2, void *data)
krh@9	503	{
krh@25	504	const struct razor_property prop1 = p1, prop2 = p2;
krh@22	505	struct razor_set *set = data;
krh@22	506	char *pool = set->string_pool.data;
krh@9	507
danw@119	508	if (prop1->name != prop2->name)
danw@119	509	return strcmp(&pool[prop1->name], &pool[prop2->name]);
danw@119	510	else if (prop1->type != prop2->type)
danw@119	511	return prop1->type - prop2->type;
danw@119	512	else if (prop1->relation != prop2->relation)
danw@119	513	return prop1->relation - prop2->relation;
krh@12	514	else
danw@119	515	return versioncmp(&pool[prop1->version], &pool[prop2->version]);
krh@9	516	}
krh@9	517
danw@108	518	static uint32_t *
krh@66	519	uniqueify_properties(struct razor_set *set)
krh@9	520	{
krh@25	521	struct razor_property rp, up, *rp_end;
krh@18	522	struct array pkgs, p;
danw@117	523	struct list_head *r;
danw@117	524	uint32_t map, rmap;
krh@18	525	int i, count, unique;
krh@9	526
krh@66	527	count = set->properties.size / sizeof(struct razor_property);
krh@66	528	map = qsort_with_data(set->properties.data,
krh@25	529	count,
krh@25	530	sizeof(struct razor_property),
krh@25	531	compare_properties,
krh@25	532	set);
krh@9	533
krh@66	534	rp_end = set->properties.data + set->properties.size;
krh@25	535	rmap = malloc(count * sizeof *map);
krh@25	536	pkgs = zalloc(count * sizeof *pkgs);
krh@66	537	for (rp = set->properties.data, up = rp, i = 0; rp < rp_end; rp++, i++) {
danw@119	538	if (rp->name != up->name \|\| rp->type != up->type \|\|
danw@119	539	rp->relation != up->relation \|\| rp->version != up->version) {
krh@25	540	up++;
krh@25	541	up->name = rp->name;
danw@119	542	up->flags = 0;
danw@119	543	up->type = rp->type;
danw@109	544	up->relation = rp->relation;
krh@25	545	up->version = rp->version;
krh@10	546	}
krh@25	547
krh@66	548	unique = up - (struct razor_property *) set->properties.data;
krh@25	549	rmap[map[i]] = unique;
krh@25	550	r = array_add(&pkgs[unique], sizeof *r);
krh@25	551	*r = rp->packages;
krh@10	552	}
krh@25	553	free(map);
krh@9	554
danw@124	555	if (up != rp)
danw@124	556	up++;
krh@66	557	set->properties.size = (void *) up - set->properties.data;
krh@25	558	rp_end = up;
krh@66	559	for (rp = set->properties.data, p = pkgs; rp < rp_end; rp++, p++) {
danw@124	560	list_set_array(&rp->packages, &set->package_pool, p, 0);
krh@25	561	array_release(p);
krh@18	562	}
krh@18	563
krh@18	564	free(pkgs);
krh@18	565
krh@25	566	return rmap;
krh@10	567	}
krh@10	568
krh@48	569	static int
krh@48	570	compare_filenames(const void p1, const void p2, void *data)
krh@48	571	{
krh@52	572	const struct import_entry *e1 = p1;
krh@52	573	const struct import_entry *e2 = p2;
danw@126	574	const char *n1 = e1->name;
danw@126	575	const char *n2 = e2->name;
krh@48	576
danw@126	577	/* Need to make sure that the contents of a directory
danw@126	578	* are sorted immediately after it. So "foo/bar" has to
danw@126	579	* sort before "foo.conf"
danw@126	580	*
danw@126	581	* FIXME: this is about 60% slower than strcmp
danw@126	582	*/
danw@126	583	while (n1 && n2) {
danw@126	584	if (n1 < n2)
danw@126	585	return *n2 == '/' ? 1 : -1;
danw@126	586	else if (n1 > n2)
danw@126	587	return *n1 == '/' ? -1 : 1;
danw@126	588	n1++;
danw@126	589	n2++;
danw@126	590	}
danw@126	591	if (*n1)
danw@126	592	return 1;
danw@126	593	else if (*n2)
danw@126	594	return -1;
danw@126	595	else
danw@126	596	return 0;
krh@48	597	}
krh@48	598
krh@48	599	static void
krh@52	600	count_entries(struct import_directory *d)
krh@48	601	{
krh@52	602	struct import_directory p, end;
krh@48	603
krh@48	604	p = d->files.data;
krh@48	605	end = d->files.data + d->files.size;
krh@48	606	d->count = 0;
krh@48	607	while (p < end) {
krh@48	608	count_entries(p);
krh@48	609	d->count += p->count + 1;
krh@48	610	p++;
krh@48	611	}
krh@48	612	}
krh@48	613
krh@48	614	static void
krh@52	615	serialize_files(struct razor_set *set,
krh@52	616	struct import_directory d, struct array array)
krh@48	617	{
krh@52	618	struct import_directory p, end;
krh@56	619	struct razor_entry *e = NULL;
danw@114	620	uint32_t s;
krh@48	621
krh@48	622	p = d->files.data;
krh@48	623	end = d->files.data + d->files.size;
krh@48	624	s = array->size / sizeof e + d->files.size / sizeof p;
krh@48	625	while (p < end) {
krh@48	626	e = array_add(array, sizeof *e);
krh@48	627	e->name = p->name;
danw@120	628	e->flags = 0;
krh@56	629	e->start = p->count > 0 ? s : 0;
krh@48	630	s += p->count;
krh@60	631
danw@124	632	list_set_array(&e->packages, &set->package_pool, &p->packages, 0);
krh@52	633	array_release(&p->packages);
krh@48	634	p++;
krh@48	635	}
krh@56	636	if (e != NULL)
danw@120	637	e->flags \|= RAZOR_ENTRY_LAST;
krh@48	638
krh@48	639	p = d->files.data;
krh@48	640	end = d->files.data + d->files.size;
krh@48	641	while (p < end) {
krh@52	642	serialize_files(set, p, array);
krh@48	643	p++;
krh@48	644	}
krh@48	645	}
krh@48	646
krh@48	647	static void
danw@108	648	remap_property_package_links(struct array properties, uint32_t rmap)
krh@61	649	{
krh@61	650	struct razor_property p, end;
krh@61	651
krh@61	652	end = properties->data + properties->size;
krh@61	653	for (p = properties->data; p < end; p++)
danw@117	654	list_remap_head(&p->packages, rmap);
krh@61	655	}
krh@61	656
krh@61	657	static void
krh@48	658	build_file_tree(struct razor_importer *importer)
krh@48	659	{
krh@48	660	int count, i, length;
krh@52	661	struct import_entry *filenames;
krh@52	662	char f, end;
danw@108	663	uint32_t name, *r;
krh@48	664	char dirname[256];
krh@52	665	struct import_directory *d, root;
krh@48	666	struct razor_entry *e;
krh@48	667
krh@52	668	count = importer->files.size / sizeof (struct import_entry);
krh@48	669	qsort_with_data(importer->files.data,
krh@48	670	count,
krh@52	671	sizeof (struct import_entry),
krh@48	672	compare_filenames,
krh@48	673	NULL);
krh@48	674
krh@95	675	root.name = hashtable_tokenize(&importer->table, "");
krh@48	676	array_init(&root.files);
krh@52	677	array_init(&root.packages);
krh@48	678	root.last = NULL;
krh@48	679
krh@48	680	filenames = importer->files.data;
krh@48	681	for (i = 0; i < count; i++) {
krh@52	682	f = filenames[i].name;
krh@48	683	if (*f != '/')
krh@48	684	continue;
krh@57	685	f++;
krh@48	686
krh@48	687	d = &root;
krh@48	688	while (*f) {
krh@57	689	end = strchr(f, '/');
krh@48	690	if (end == NULL)
krh@48	691	end = f + strlen(f);
krh@57	692	length = end - f;
krh@57	693	memcpy(dirname, f, length);
krh@48	694	dirname[length] ='\0';
krh@95	695	name = hashtable_tokenize(&importer->table, dirname);
krh@48	696	if (d->last == NULL \|\| d->last->name != name) {
krh@48	697	d->last = array_add(&d->files, sizeof *d);
krh@48	698	d->last->name = name;
krh@48	699	d->last->last = NULL;
krh@48	700	array_init(&d->last->files);
krh@52	701	array_init(&d->last->packages);
krh@48	702	}
krh@48	703	d = d->last;
krh@57	704	f = end + 1;
krh@57	705	if (*end == '\0')
krh@57	706	break;
krh@48	707	}
krh@48	708
krh@52	709	r = array_add(&d->packages, sizeof *r);
krh@52	710	*r = filenames[i].package;
krh@52	711	free(filenames[i].name);
krh@48	712	}
krh@48	713
krh@48	714	count_entries(&root);
krh@150	715	e = importer->set->files.data;
danw@120	716	e->name = root.name;
danw@120	717	e->flags = RAZOR_ENTRY_LAST;
danw@129	718	e->start = importer->files.size ? 1 : 0;
danw@117	719	list_set_empty(&e->packages);
krh@48	720
krh@56	721	serialize_files(importer->set, &root, &importer->set->files);
krh@48	722
krh@48	723	array_release(&importer->files);
krh@48	724	}
krh@48	725
danw@159	726	static struct razor_entry *
danw@159	727	find_entry(struct razor_set set, struct razor_entry dir, const char *pattern);
danw@159	728
danw@159	729	static void
danw@159	730	list_to_array(struct list list, struct array array)
danw@159	731	{
danw@159	732	uint32_t *item;
danw@159	733
danw@159	734	while (list) {
danw@159	735	item = array_add(array, sizeof *item);
danw@159	736	*item = list->data;
danw@159	737	list = list_next(list);
danw@159	738	}
danw@159	739	}
danw@159	740
danw@159	741	static int
danw@159	742	compare_file_requires(const void p1, const void p2, void *data)
danw@159	743	{
danw@159	744	uint32_t f1 = (void )p1, f2 = (void )p2;
danw@159	745	const char *pool = data;
danw@159	746
danw@159	747	return strcmp(&pool[f1], &pool[f2]);
danw@159	748	}
danw@159	749
danw@159	750	static void
danw@159	751	find_file_provides(struct razor_importer *importer)
danw@159	752	{
danw@159	753	struct razor_property *prop;
danw@159	754	struct razor_entry top, entry;
danw@159	755	struct razor_package *packages;
danw@159	756	struct array pkgarray, pkgprops;
danw@159	757	uint32_t req, req_start, req_end, pkg, *pkg_end;
danw@159	758	uint32_t map, newprop_id, newprop;
danw@159	759	char *pool;
danw@159	760
danw@159	761	pool = importer->set->string_pool.data;
danw@159	762	packages = importer->set->packages.data;
danw@159	763	top = importer->set->files.data;
danw@159	764
danw@159	765	req = req_start = importer->file_requires.data;
danw@159	766	req_end = importer->file_requires.data + importer->file_requires.size;
danw@159	767	map = qsort_with_data(req, req_end - req, sizeof *req,
danw@159	768	compare_file_requires, pool);
danw@159	769	free(map);
danw@159	770
danw@159	771	for (req = req_start; req < req_end; req++) {
danw@159	772	if (req > req_start && req[0] == req[-1])
danw@159	773	continue;
danw@159	774	entry = find_entry(importer->set, top, &pool[*req]);
danw@159	775	if (entry) {
danw@159	776	prop = array_add(&importer->set->properties, sizeof *prop);
danw@159	777	prop->name = *req;
danw@159	778	prop->type = RAZOR_PROPERTY_PROVIDES;
danw@159	779	prop->relation = RAZOR_VERSION_EQUAL;
danw@159	780	prop->version = hashtable_tokenize(&importer->table, "");
danw@159	781
danw@159	782	/* Copy package list from entry to property */
danw@159	783	array_init(&pkgarray);
danw@159	784	list_to_array(list_first(&entry->packages, &importer->set->package_pool), &pkgarray);
danw@159	785	list_set_array(&prop->packages, &importer->set->package_pool, &pkgarray, 0);
danw@159	786
danw@159	787	/* Update property list of each providing package */
danw@159	788	pkg_end = pkgarray.data + pkgarray.size;
danw@159	789	newprop_id = prop - (struct razor_property *)importer->set->properties.data;
danw@159	790
danw@159	791	for (pkg = pkgarray.data; pkg < pkg_end; pkg++) {
danw@159	792	array_init(&pkgprops);
danw@159	793	list_to_array(list_first(&packages[*pkg].properties, &importer->set->property_pool), &pkgprops);
danw@159	794	newprop = array_add(&pkgprops, sizeof *newprop);
danw@159	795	*newprop = newprop_id;
danw@159	796	list_set_array(&packages[*pkg].properties, &importer->set->property_pool, &pkgprops, 1);
danw@159	797	array_release(&pkgprops);
danw@159	798	}
danw@159	799	array_release(&pkgarray);
danw@159	800	}
danw@159	801	}
danw@159	802
danw@159	803	array_release(&importer->file_requires);
danw@159	804	}
danw@159	805
krh@56	806	static void
danw@108	807	build_package_file_lists(struct razor_set set, uint32_t rmap)
krh@54	808	{
krh@56	809	struct razor_package p, packages;
krh@56	810	struct array *pkgs;
krh@54	811	struct razor_entry e, end;
danw@117	812	struct list *r;
danw@117	813	uint32_t *q;
krh@56	814	int i, count;
krh@54	815
krh@56	816	count = set->packages.size / sizeof *p;
krh@56	817	pkgs = zalloc(count * sizeof *pkgs);
krh@54	818
krh@56	819	end = set->files.data + set->files.size;
krh@92	820	for (e = set->files.data; e < end; e++) {
danw@117	821	list_remap_head(&e->packages, rmap);
danw@116	822	r = list_first(&e->packages, &set->package_pool);
danw@116	823	while (r) {
danw@117	824	q = array_add(&pkgs[r->data], sizeof *q);
krh@56	825	q = e - (struct razor_entry ) set->files.data;
danw@116	826	r = list_next(r);
krh@54	827	}
krh@54	828	}
krh@54	829
krh@56	830	packages = set->packages.data;
krh@56	831	for (i = 0; i < count; i++) {
danw@124	832	list_set_array(&packages[i].files, &set->file_pool, &pkgs[i], 0);
krh@56	833	array_release(&pkgs[i]);
krh@48	834	}
krh@56	835	free(pkgs);
krh@52	836	}
krh@52	837
krh@27	838	struct razor_set *
krh@30	839	razor_importer_finish(struct razor_importer *importer)
krh@9	840	{
krh@30	841	struct razor_set *set;
danw@108	842	uint32_t map, rmap;
krh@39	843	int i, count;
krh@18	844
danw@159	845	build_file_tree(importer);
danw@159	846	find_file_provides(importer);
danw@159	847
krh@66	848	map = uniqueify_properties(importer->set);
danw@116	849	list_remap_pool(&importer->set->property_pool, map);
krh@39	850	free(map);
krh@25	851
krh@30	852	count = importer->set->packages.size / sizeof(struct razor_package);
krh@30	853	map = qsort_with_data(importer->set->packages.data,
krh@25	854	count,
krh@25	855	sizeof(struct razor_package),
krh@25	856	compare_packages,
krh@30	857	importer->set);
krh@39	858
krh@39	859	rmap = malloc(count * sizeof *rmap);
krh@39	860	for (i = 0; i < count; i++)
krh@39	861	rmap[map[i]] = i;
krh@25	862	free(map);
krh@13	863
danw@116	864	list_remap_pool(&importer->set->package_pool, rmap);
krh@60	865	build_package_file_lists(importer->set, rmap);
krh@66	866	remap_property_package_links(&importer->set->properties, rmap);
krh@52	867	free(rmap);
krh@48	868
krh@30	869	set = importer->set;
krh@78	870	hashtable_release(&importer->table);
krh@30	871	free(importer);
krh@30	872
krh@30	873	return set;
krh@9	874	}
krh@9	875
krh@92	876	struct razor_package_iterator {
krh@92	877	struct razor_set *set;
krh@92	878	struct razor_package package, end;
danw@117	879	struct list *index;
krh@92	880	};
krh@92	881
danw@137	882	static struct razor_package_iterator *
krh@101	883	razor_package_iterator_create_with_index(struct razor_set *set,
danw@117	884	struct list *index)
krh@3	885	{
krh@92	886	struct razor_package_iterator *pi;
krh@92	887
krh@92	888	pi = zalloc(sizeof *pi);
krh@92	889	pi->set = set;
krh@101	890	pi->index = index;
krh@92	891
krh@92	892	return pi;
krh@92	893	}
krh@92	894
krh@101	895	struct razor_package_iterator *
krh@101	896	razor_package_iterator_create(struct razor_set *set)
krh@101	897	{
danw@116	898	struct razor_package_iterator *pi;
danw@116	899
danw@116	900	pi = zalloc(sizeof *pi);
danw@116	901	pi->set = set;
danw@116	902	pi->end = set->packages.data + set->packages.size;
danw@116	903	pi->package = set->packages.data;
danw@116	904
danw@116	905	return pi;
krh@101	906	}
krh@101	907
krh@101	908	struct razor_package_iterator *
krh@101	909	razor_package_iterator_create_for_property(struct razor_set *set,
krh@101	910	struct razor_property *property)
krh@101	911	{
danw@117	912	struct list *index;
krh@101	913
danw@116	914	index = list_first(&property->packages, &set->package_pool);
krh@101	915	return razor_package_iterator_create_with_index(set, index);
krh@101	916	}
krh@101	917
krh@92	918	int
krh@92	919	razor_package_iterator_next(struct razor_package_iterator *pi,
krh@92	920	struct razor_package **package,
krh@92	921	const char name, const char version)
krh@92	922	{
krh@6	923	char *pool;
krh@101	924	int valid;
krh@101	925	struct razor_package p, packages;
krh@3	926
danw@116	927	if (pi->package) {
krh@101	928	p = pi->package++;
krh@101	929	valid = p < pi->end;
danw@116	930	} else if (pi->index) {
danw@116	931	packages = pi->set->packages.data;
danw@117	932	p = &packages[pi->index->data];
danw@116	933	pi->index = list_next(pi->index);
danw@116	934	valid = 1;
danw@116	935	} else
danw@116	936	valid = 0;
krh@92	937
krh@101	938	if (valid) {
krh@101	939	pool = pi->set->string_pool.data;
krh@101	940	*package = p;
danw@120	941	*name = &pool[p->name];
krh@101	942	*version = &pool[p->version];
krh@101	943	} else {
krh@101	944	*package = NULL;
krh@101	945	}
krh@101	946
krh@101	947	return valid;
krh@92	948	}
krh@92	949
krh@92	950	void
krh@92	951	razor_package_iterator_destroy(struct razor_package_iterator *pi)
krh@92	952	{
krh@92	953	free(pi);
krh@3	954	}
krh@3	955
krh@10	956	struct razor_package *
krh@10	957	razor_set_get_package(struct razor_set set, const char package)
krh@10	958	{
krh@97	959	struct razor_package_iterator *pi;
krh@97	960	struct razor_package *p;
krh@97	961	const char name, version;
krh@97	962
krh@97	963	pi = razor_package_iterator_create(set);
krh@97	964	while (razor_package_iterator_next(pi, &p, &name, &version)) {
krh@97	965	if (strcmp(package, name) == 0)
krh@97	966	break;
krh@97	967	}
krh@97	968	razor_package_iterator_destroy(pi);
krh@97	969
krh@97	970	return p;
krh@10	971	}
krh@10	972
krh@92	973	struct razor_property_iterator {
krh@92	974	struct razor_set *set;
krh@92	975	struct razor_property property, end;
danw@117	976	struct list *index;
krh@92	977	};
krh@92	978
krh@92	979	struct razor_property_iterator *
krh@92	980	razor_property_iterator_create(struct razor_set *set,
krh@92	981	struct razor_package *package)
krh@92	982	{
krh@92	983	struct razor_property_iterator *pi;
krh@92	984
krh@92	985	pi = zalloc(sizeof *pi);
krh@92	986	pi->set = set;
krh@98	987
danw@116	988	if (package) {
danw@117	989	pi->index = list_first(&package->properties,
danw@117	990	&set->property_pool);
danw@116	991	} else {
danw@116	992	pi->property = set->properties.data;
danw@116	993	pi->end = set->properties.data + set->properties.size;
danw@116	994	}
krh@92	995
krh@92	996	return pi;
krh@92	997	}
krh@92	998
krh@92	999	int
krh@92	1000	razor_property_iterator_next(struct razor_property_iterator *pi,
krh@92	1001	struct razor_property **property,
danw@109	1002	const char **name,
danw@109	1003	enum razor_version_relation *relation,
danw@109	1004	const char **version,
krh@92	1005	enum razor_property_type *type)
krh@92	1006	{
krh@92	1007	char *pool;
krh@92	1008	int valid;
krh@92	1009	struct razor_property p, properties;
krh@92	1010
danw@116	1011	if (pi->property) {
krh@92	1012	p = pi->property++;
krh@92	1013	valid = p < pi->end;
danw@116	1014	} else if (pi->index) {
danw@116	1015	properties = pi->set->properties.data;
danw@117	1016	p = &properties[pi->index->data];
danw@116	1017	pi->index = list_next(pi->index);
danw@116	1018	valid = 1;
danw@116	1019	} else
danw@116	1020	valid = 0;
krh@92	1021
krh@96	1022	if (valid) {
krh@96	1023	pool = pi->set->string_pool.data;
krh@96	1024	*property = p;
danw@119	1025	*name = &pool[p->name];
danw@109	1026	*relation = p->relation;
krh@96	1027	*version = &pool[p->version];
danw@119	1028	*type = p->type;
krh@96	1029	} else {
krh@96	1030	*property = NULL;
krh@96	1031	}
krh@92	1032
krh@92	1033	return valid;
krh@92	1034	}
krh@92	1035
krh@66	1036	void
krh@92	1037	razor_property_iterator_destroy(struct razor_property_iterator *pi)
krh@8	1038	{
krh@92	1039	free(pi);
krh@10	1040	}
krh@10	1041
krh@56	1042	static struct razor_entry *
krh@56	1043	find_entry(struct razor_set set, struct razor_entry dir, const char *pattern)
krh@56	1044	{
krh@56	1045	struct razor_entry *e;
krh@56	1046	const char n, pool = set->string_pool.data;
krh@56	1047	int len;
krh@56	1048
krh@56	1049	e = (struct razor_entry *) set->files.data + dir->start;
krh@56	1050	do {
danw@120	1051	n = pool + e->name;
krh@56	1052	if (strcmp(pattern + 1, n) == 0)
krh@56	1053	return e;
krh@57	1054	len = strlen(n);
krh@56	1055	if (e->start != 0 && strncmp(pattern + 1, n, len) == 0 &&
krh@56	1056	pattern[len + 1] == '/') {
krh@56	1057	return find_entry(set, e, pattern + len + 1);
krh@56	1058	}
danw@120	1059	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56	1060
krh@56	1061	return NULL;
krh@56	1062	}
krh@56	1063
krh@56	1064	static void
krh@56	1065	list_dir(struct razor_set set, struct razor_entry dir,
danw@127	1066	char prefix, const char pattern)
krh@56	1067	{
krh@56	1068	struct razor_entry *e;
krh@56	1069	const char n, pool = set->string_pool.data;
krh@56	1070
krh@56	1071	e = (struct razor_entry *) set->files.data + dir->start;
krh@56	1072	do {
danw@120	1073	n = pool + e->name;
krh@56	1074	if (pattern && pattern[0] && fnmatch(pattern, n, 0) != 0)
krh@56	1075	continue;
danw@127	1076	printf("%s/%s\n", prefix, n);
danw@127	1077	if (e->start) {
danw@127	1078	char *sub = prefix + strlen (prefix);
danw@127	1079	*sub = '/';
danw@127	1080	strcpy (sub + 1, n);
danw@127	1081	list_dir(set, e, prefix, pattern);
danw@127	1082	*sub = '\0';
danw@127	1083	}
danw@120	1084	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56	1085	}
krh@56	1086
krh@56	1087	void
krh@56	1088	razor_set_list_files(struct razor_set set, const char pattern)
krh@56	1089	{
krh@56	1090	struct razor_entry *e;
krh@56	1091	char buffer[512], p, base;
krh@56	1092
danw@127	1093	if (pattern == NULL \|\| !strcmp (pattern, "/")) {
danw@127	1094	buffer[0] = '\0';
danw@127	1095	list_dir(set, set->files.data, buffer, NULL);
danw@127	1096	return;
danw@127	1097	}
krh@56	1098
krh@56	1099	strcpy(buffer, pattern);
krh@56	1100	e = find_entry(set, set->files.data, buffer);
krh@56	1101	if (e && e->start > 0) {
krh@56	1102	base = NULL;
krh@56	1103	} else {
krh@56	1104	p = strrchr(buffer, '/');
krh@56	1105	if (p) {
krh@56	1106	*p = '\0';
krh@56	1107	base = p + 1;
krh@56	1108	} else {
krh@56	1109	base = NULL;
krh@56	1110	}
krh@56	1111	}
krh@56	1112	e = find_entry(set, set->files.data, buffer);
krh@56	1113	if (e->start != 0)
krh@56	1114	list_dir(set, e, buffer, base);
krh@56	1115	}
krh@56	1116
krh@102	1117	struct razor_package_iterator *
krh@102	1118	razor_package_iterator_create_for_file(struct razor_set *set,
krh@102	1119	const char *filename)
krh@56	1120	{
krh@102	1121	struct razor_entry *entry;
danw@117	1122	struct list *index;
krh@56	1123
krh@102	1124	entry = find_entry(set, set->files.data, filename);
krh@102	1125	if (entry == NULL)
krh@102	1126	return NULL;
krh@56	1127
danw@116	1128	index = list_first(&entry->packages, &set->package_pool);
krh@102	1129	return razor_package_iterator_create_with_index(set, index);
krh@56	1130	}
krh@56	1131
danw@117	1132	static struct list *
danw@117	1133	list_package_files(struct razor_set set, struct list r,
danw@108	1134	struct razor_entry *dir, uint32_t end,
krh@56	1135	char *prefix)
krh@56	1136	{
krh@56	1137	struct razor_entry e, f, *entries;
danw@108	1138	uint32_t next, file;
krh@56	1139	char *pool;
krh@56	1140	int len;
krh@56	1141
krh@56	1142	entries = (struct razor_entry *) set->files.data;
krh@56	1143	pool = set->string_pool.data;
krh@56	1144
krh@56	1145	e = entries + dir->start;
krh@56	1146	do {
danw@117	1147	if (entries + r->data == e) {
danw@120	1148	printf("%s/%s\n", prefix, pool + e->name);
danw@116	1149	r = list_next(r);
danw@116	1150	if (!r)
krh@83	1151	return NULL;
danw@117	1152	if (r->data >= end)
krh@83	1153	return r;
krh@56	1154	}
danw@120	1155	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56	1156
krh@56	1157	e = entries + dir->start;
krh@56	1158	do {
krh@56	1159	if (e->start == 0)
krh@56	1160	continue;
krh@56	1161
danw@120	1162	if (e->flags & RAZOR_ENTRY_LAST)
krh@56	1163	next = end;
krh@56	1164	else {
krh@56	1165	f = e + 1;
danw@120	1166	while (f->start == 0 && !(f->flags & RAZOR_ENTRY_LAST))
krh@56	1167	f++;
krh@56	1168	if (f->start == 0)
krh@56	1169	next = end;
krh@56	1170	else
krh@56	1171	next = f->start;
krh@56	1172	}
krh@56	1173
danw@117	1174	file = r->data;
krh@83	1175	if (e->start <= file && file < next) {
krh@56	1176	len = strlen(prefix);
krh@56	1177	prefix[len] = '/';
danw@120	1178	strcpy(prefix + len + 1, pool + e->name);
krh@56	1179	r = list_package_files(set, r, e, next, prefix);
krh@56	1180	prefix[len] = '\0';
krh@56	1181	}
danw@120	1182	} while (!((e++)->flags & RAZOR_ENTRY_LAST) && r != NULL);
krh@56	1183
krh@56	1184	return r;
krh@56	1185	}
krh@56	1186
krh@56	1187	void
krh@56	1188	razor_set_list_package_files(struct razor_set set, const char name)
krh@56	1189	{
krh@56	1190	struct razor_package *package;
danw@117	1191	struct list *r;
danw@117	1192	uint32_t end;
krh@56	1193	char buffer[512];
krh@56	1194
krh@56	1195	package = razor_set_get_package(set, name);
krh@56	1196
danw@116	1197	r = list_first(&package->files, &set->file_pool);
krh@56	1198	end = set->files.size / sizeof (struct razor_entry);
krh@56	1199	buffer[0] = '\0';
krh@56	1200	list_package_files(set, r, set->files.data, end, buffer);
krh@56	1201	}
krh@56	1202
krh@43	1203	static void
krh@21	1204	razor_set_validate(struct razor_set set, struct array unsatisfied)
krh@21	1205	{
krh@66	1206	struct razor_property r, p, *end;
danw@108	1207	uint32_t *u;
krh@21	1208	char *pool;
krh@21	1209
krh@66	1210	end = set->properties.data + set->properties.size;
krh@21	1211	pool = set->string_pool.data;
krh@21	1212
krh@66	1213	for (r = set->properties.data, p = r; r < end; r++) {
danw@119	1214	if (r->type != RAZOR_PROPERTY_REQUIRES)
krh@66	1215	continue;
krh@66	1216
danw@129	1217	p = r;
danw@129	1218	while (p < end && p->name == r->name &&
danw@129	1219	p->type == r->type)
danw@129	1220	p++;
krh@37	1221
krh@35	1222	/* If there is more than one version of a provides,
krh@35	1223	* seek to the end for the highest version. */
krh@66	1224	/* FIXME: This doesn't work if we have a series of
krh@66	1225	* requires a = 1, provides a = 1, requires a = 2,
krh@66	1226	* provides a = 2, as the kernel and kernel-devel
krh@66	1227	* does.*/
danw@119	1228	while (p + 1 < end && p->name == (p + 1)->name &&
danw@119	1229	p->type == (p + 1)->type)
krh@35	1230	p++;
krh@37	1231
krh@37	1232	/* FIXME: We need to track property flags (<, <=, =
krh@37	1233	* etc) to properly determine if a requires is
krh@37	1234	* satisfied. The current code doesn't track that the
krh@37	1235	* requires a = 1 isn't satisfied by a = 2 provides. */
krh@37	1236
krh@66	1237	if (p == end \|\|
danw@119	1238	p->type != RAZOR_PROPERTY_PROVIDES \|\|
danw@119	1239	r->name != p->name \|\|
krh@35	1240	versioncmp(&pool[r->version], &pool[p->version]) > 0) {
krh@35	1241	/* FIXME: We ignore file requires for now. */
danw@119	1242	if (pool[r->name] == '/')
krh@35	1243	continue;
krh@21	1244	u = array_add(unsatisfied, sizeof *u);
krh@66	1245	u = r - (struct razor_property ) set->properties.data;
krh@21	1246	}
krh@21	1247	}
krh@21	1248	}
krh@21	1249
krh@21	1250	void
krh@21	1251	razor_set_list_unsatisfied(struct razor_set *set)
krh@21	1252	{
krh@21	1253	struct array unsatisfied;
krh@66	1254	struct razor_property properties, r;
danw@108	1255	uint32_t u, end;
krh@21	1256	char *pool;
krh@21	1257
krh@21	1258	array_init(&unsatisfied);
krh@21	1259	razor_set_validate(set, &unsatisfied);
krh@21	1260
krh@21	1261	end = unsatisfied.data + unsatisfied.size;
krh@66	1262	properties = set->properties.data;
krh@21	1263	pool = set->string_pool.data;
krh@21	1264
krh@21	1265	for (u = unsatisfied.data; u < end; u++) {
krh@66	1266	r = properties + *u;
krh@66	1267	if (pool[r->version] == '\0')
krh@66	1268	printf("%ss not satisfied\n",
danw@119	1269	&pool[r->name]);
krh@66	1270	else
krh@66	1271	printf("%s-%s not satisfied\n",
danw@119	1272	&pool[r->name],
krh@66	1273	&pool[r->version]);
krh@21	1274	}
krh@21	1275
krh@21	1276	array_release(&unsatisfied);
krh@21	1277	}
krh@21	1278
danw@120	1279	#define UPSTREAM_SOURCE 0x80
krh@41	1280
krh@41	1281	struct source {
krh@41	1282	struct razor_set *set;
danw@108	1283	uint32_t *property_map;
danw@127	1284	uint32_t *file_map;
krh@41	1285	};
krh@41	1286
krh@79	1287	struct razor_merger {
krh@79	1288	struct razor_set *set;
krh@79	1289	struct hashtable table;
krh@79	1290	struct source source1;
krh@79	1291	struct source source2;
krh@79	1292	};
krh@79	1293
krh@79	1294	static struct razor_merger *
krh@79	1295	razor_merger_create(struct razor_set set1, struct razor_set set2)
krh@41	1296	{
krh@79	1297	struct razor_merger *merger;
krh@41	1298	int count;
krh@41	1299	size_t size;
krh@41	1300
krh@79	1301	merger = zalloc(sizeof *merger);
krh@79	1302	merger->set = razor_set_create();
krh@79	1303	hashtable_init(&merger->table, &merger->set->string_pool);
krh@41	1304
danw@127	1305	merger->source1.set = set1;
krh@79	1306	count = set1->properties.size / sizeof (struct razor_property);
krh@79	1307	size = count * sizeof merger->source1.property_map[0];
krh@79	1308	merger->source1.property_map = zalloc(size);
danw@127	1309	count = set1->files.size / sizeof (struct razor_entry);
danw@127	1310	size = count * sizeof merger->source1.file_map[0];
danw@127	1311	merger->source1.file_map = zalloc(size);
krh@79	1312
danw@127	1313	merger->source2.set = set2;
krh@79	1314	count = set2->properties.size / sizeof (struct razor_property);
krh@79	1315	size = count * sizeof merger->source2.property_map[0];
krh@79	1316	merger->source2.property_map = zalloc(size);
danw@127	1317	count = set2->files.size / sizeof (struct razor_entry);
danw@127	1318	size = count * sizeof merger->source2.file_map[0];
danw@127	1319	merger->source2.file_map = zalloc(size);
krh@79	1320
krh@79	1321	return merger;
krh@41	1322	}
krh@41	1323
krh@33	1324	static void
krh@79	1325	add_package(struct razor_merger *merger,
krh@41	1326	struct razor_package package, struct source source,
danw@108	1327	uint32_t flags)
krh@33	1328	{
krh@33	1329	char *pool;
danw@117	1330	struct list *r;
krh@41	1331	struct razor_package *p;
krh@33	1332
krh@41	1333	pool = source->set->string_pool.data;
krh@79	1334	p = array_add(&merger->set->packages, sizeof *p);
krh@79	1335	p->name = hashtable_tokenize(&merger->table, &pool[package->name]);
danw@120	1336	p->flags = flags;
krh@79	1337	p->version = hashtable_tokenize(&merger->table,
krh@79	1338	&pool[package->version]);
danw@127	1339
krh@66	1340	p->properties = package->properties;
danw@116	1341	r = list_first(&package->properties, &source->set->property_pool);
danw@116	1342	while (r) {
danw@117	1343	source->property_map[r->data] = 1;
danw@116	1344	r = list_next(r);
krh@64	1345	}
danw@127	1346
danw@127	1347	p->files = package->files;
danw@127	1348	r = list_first(&package->files, &source->set->file_pool);
danw@127	1349	while (r) {
danw@127	1350	source->file_map[r->data] = 1;
danw@127	1351	r = list_next(r);
danw@127	1352	}
krh@41	1353	}
krh@41	1354
danw@108	1355	static uint32_t
krh@79	1356	add_property(struct razor_merger *merger,
danw@109	1357	const char *name, enum razor_version_relation relation,
danw@109	1358	const char *version, int type)
krh@41	1359	{
krh@41	1360	struct razor_property *p;
krh@41	1361
krh@79	1362	p = array_add(&merger->set->properties, sizeof *p);
danw@119	1363	p->name = hashtable_tokenize(&merger->table, name);
danw@119	1364	p->flags = 0;
danw@119	1365	p->type = type;
danw@109	1366	p->relation = relation;
krh@79	1367	p->version = hashtable_tokenize(&merger->table, version);
krh@41	1368
krh@79	1369	return p - (struct razor_property *) merger->set->properties.data;
krh@41	1370	}
krh@41	1371
krh@41	1372	static void
krh@79	1373	merge_properties(struct razor_merger *merger)
krh@41	1374	{
krh@41	1375	struct razor_property p1, p2;
krh@79	1376	struct razor_set set1, set2;
danw@108	1377	uint32_t map1, map2;
krh@41	1378	int i, j, cmp, count1, count2;
krh@41	1379	char pool1, pool2;
krh@41	1380
krh@79	1381	set1 = merger->source1.set;
krh@79	1382	set2 = merger->source2.set;
krh@79	1383	map1 = merger->source1.property_map;
krh@79	1384	map2 = merger->source2.property_map;
krh@79	1385
krh@41	1386	i = 0;
krh@41	1387	j = 0;
krh@41	1388	pool1 = set1->string_pool.data;
krh@41	1389	pool2 = set2->string_pool.data;
krh@41	1390
krh@66	1391	count1 = set1->properties.size / sizeof *p1;
krh@66	1392	count2 = set2->properties.size / sizeof *p2;
krh@41	1393	while (i < count1 \|\| j < count2) {
krh@41	1394	if (i < count1 && map1[i] == 0) {
krh@41	1395	i++;
krh@41	1396	continue;
krh@41	1397	}
krh@41	1398	if (j < count2 && map2[j] == 0) {
krh@41	1399	j++;
krh@41	1400	continue;
krh@41	1401	}
krh@66	1402	p1 = (struct razor_property *) set1->properties.data + i;
krh@66	1403	p2 = (struct razor_property *) set2->properties.data + j;
krh@41	1404	if (i < count1 && j < count2)
danw@119	1405	cmp = strcmp(&pool1[p1->name], &pool2[p2->name]);
krh@41	1406	else if (i < count1)
krh@41	1407	cmp = -1;
krh@41	1408	else
krh@41	1409	cmp = 1;
krh@41	1410	if (cmp == 0)
danw@121	1411	cmp = p1->type - p2->type;
danw@121	1412	if (cmp == 0)
danw@109	1413	cmp = p1->relation - p2->relation;
danw@109	1414	if (cmp == 0)
krh@41	1415	cmp = versioncmp(&pool1[p1->version],
krh@41	1416	&pool2[p2->version]);
krh@41	1417	if (cmp < 0) {
krh@79	1418	map1[i++] = add_property(merger,
danw@119	1419	&pool1[p1->name],
danw@109	1420	p1->relation,
krh@69	1421	&pool1[p1->version],
danw@119	1422	p1->type);
krh@41	1423	} else if (cmp > 0) {
krh@79	1424	map2[j++] = add_property(merger,
danw@119	1425	&pool2[p2->name],
danw@109	1426	p2->relation,
krh@69	1427	&pool2[p2->version],
danw@119	1428	p2->type);
krh@41	1429	} else {
krh@79	1430	map1[i++] = map2[j++] = add_property(merger,
danw@119	1431	&pool1[p1->name],
danw@109	1432	p1->relation,
krh@69	1433	&pool1[p1->version],
danw@119	1434	p1->type);
krh@41	1435	}
krh@41	1436	}
krh@41	1437	}
krh@41	1438
danw@116	1439	static void
danw@117	1440	emit_properties(struct list_head properties, struct array source_pool,
danw@108	1441	uint32_t map, struct array pool)
krh@41	1442	{
danw@117	1443	uint32_t r;
danw@117	1444	struct list p, q;
krh@41	1445
krh@41	1446	r = pool->size / sizeof *q;
danw@116	1447	p = list_first(properties, source_pool);
danw@116	1448	while (p) {
krh@41	1449	q = array_add(pool, sizeof *q);
danw@117	1450	q->data = map[p->data];
danw@117	1451	q->flags = p->flags;
danw@116	1452	p = list_next(p);
krh@33	1453	}
krh@33	1454
danw@117	1455	list_set_ptr(properties, r);
krh@41	1456	}
danw@127	1457
danw@127	1458	static uint32_t
danw@127	1459	add_file(struct razor_merger merger, const char name)
danw@127	1460	{
danw@127	1461	struct razor_entry *e;
danw@127	1462
danw@127	1463	e = array_add(&merger->set->files, sizeof *e);
danw@127	1464	e->name = hashtable_tokenize(&merger->table, name);
danw@127	1465	e->flags = 0;
danw@127	1466	e->start = 0;
danw@127	1467
danw@127	1468	return e - (struct razor_entry *)merger->set->files.data;
danw@127	1469	}
danw@127	1470
danw@129	1471	/* FIXME. Blah */
danw@127	1472	static int
danw@127	1473	fix_file_map(uint32_t *map,
danw@127	1474	struct razor_entry *files,
danw@127	1475	struct razor_entry *top)
danw@127	1476	{
danw@127	1477	uint32_t e;
danw@127	1478	int found_file = 0;
danw@127	1479
danw@127	1480	e = top->start;
danw@127	1481	do {
danw@127	1482	if (files[e].start)
danw@127	1483	fix_file_map(map, files, &files[e]);
danw@127	1484	if (map[e])
danw@127	1485	found_file = 1;
danw@127	1486	} while (!(files[e++].flags & RAZOR_ENTRY_LAST));
danw@127	1487
danw@127	1488	if (found_file)
danw@127	1489	map[top - files] = 1;
danw@127	1490	return found_file;
danw@127	1491	}
danw@127	1492
danw@127	1493	struct merge_directory {
danw@127	1494	uint32_t merged, dir1, dir2;
danw@127	1495	};
danw@127	1496
danw@127	1497	static void
danw@127	1498	merge_one_directory(struct razor_merger merger, struct merge_directory md)
danw@127	1499	{
danw@127	1500	struct razor_entry root1, root2, mroot, e1, *e2;
danw@127	1501	struct razor_set set1, set2;
danw@127	1502	struct array merge_stack;
danw@127	1503	struct merge_directory child_md, end_md;
danw@127	1504	uint32_t map1, map2, start, last;
danw@127	1505	int cmp;
danw@127	1506	char pool1, pool2;
danw@127	1507
danw@127	1508	set1 = merger->source1.set;
danw@127	1509	set2 = merger->source2.set;
danw@127	1510	map1 = merger->source1.file_map;
danw@127	1511	map2 = merger->source2.file_map;
danw@127	1512	pool1 = set1->string_pool.data;
danw@127	1513	pool2 = set2->string_pool.data;
danw@127	1514	root1 = (struct razor_entry *) set1->files.data;
danw@127	1515	root2 = (struct razor_entry *) set2->files.data;
danw@127	1516
danw@127	1517	array_init(&merge_stack);
danw@127	1518
danw@127	1519	start = merger->set->files.size / sizeof (struct razor_entry);
danw@127	1520	last = 0;
danw@127	1521	e1 = md->dir1 ? root1 + md->dir1 : NULL;
danw@127	1522	e2 = md->dir2 ? root2 + md->dir2 : NULL;
danw@127	1523	while (e1 \|\| e2) {
danw@127	1524	if (!e2 && !map1[e1 - root1]) {
danw@127	1525	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1526	e1 = NULL;
danw@127	1527	continue;
danw@127	1528	}
danw@127	1529	if (!e1 && !map2[e2 - root2]) {
danw@127	1530	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1531	e2 = NULL;
danw@127	1532	continue;
danw@127	1533	}
danw@127	1534	if (e1 && !map1[e1 - root1] &&
danw@127	1535	e2 && !map1[e2 - root2]) {
danw@127	1536	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1537	e1 = NULL;
danw@127	1538	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1539	e2 = NULL;
danw@127	1540	continue;
danw@127	1541	}
danw@127	1542
danw@127	1543	if (!e1)
danw@127	1544	cmp = 1;
danw@127	1545	else if (!e2)
danw@127	1546	cmp = -1;
danw@127	1547	else {
danw@127	1548	cmp = strcmp (&pool1[e1->name],
danw@127	1549	&pool2[e2->name]);
danw@127	1550	}
danw@127	1551
danw@127	1552	if (cmp < 0) {
danw@127	1553	if (map1[e1 - root1]) {
danw@127	1554	map1[e1 - root1] = last =
danw@127	1555	add_file(merger, &pool1[e1->name]);
danw@127	1556	if (e1->start) {
danw@127	1557	child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127	1558	child_md->merged = last;
danw@127	1559	child_md->dir1 = e1->start;
danw@127	1560	child_md->dir2 = 0;
danw@127	1561	}
danw@127	1562	}
danw@127	1563	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1564	e1 = NULL;
danw@127	1565	} else if (cmp > 0) {
danw@127	1566	if (map2[e2 - root2]) {
danw@127	1567	map2[e2 - root2] = last =
danw@127	1568	add_file(merger, &pool2[e2->name]);
danw@127	1569	if (e2->start) {
danw@127	1570	child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127	1571	child_md->merged = last;
danw@127	1572	child_md->dir1 = 0;
danw@127	1573	child_md->dir2 = e2->start;
danw@127	1574	}
danw@127	1575	}
danw@127	1576	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1577	e2 = NULL;
danw@127	1578	} else {
danw@127	1579	map1[e1 - root1] = map2[e2- root2] = last =
danw@127	1580	add_file(merger, &pool1[e1->name]);
danw@127	1581	if (e1->start \|\| e2->start) {
danw@127	1582	child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127	1583	child_md->merged = last;
danw@127	1584	child_md->dir1 = e1->start;
danw@127	1585	child_md->dir2 = e2->start;
danw@127	1586	}
danw@127	1587	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1588	e1 = NULL;
danw@127	1589	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1590	e2 = NULL;
danw@127	1591	}
danw@127	1592	}
danw@127	1593
danw@127	1594	mroot = (struct razor_entry *)merger->set->files.data;
danw@127	1595	if (last) {
danw@127	1596	mroot[last].flags = RAZOR_ENTRY_LAST;
danw@127	1597	mroot[md->merged].start = start;
danw@127	1598	} else
danw@127	1599	mroot[md->merged].start = 0;
danw@127	1600
danw@127	1601	end_md = merge_stack.data + merge_stack.size;
danw@127	1602	for (child_md = merge_stack.data; child_md < end_md; child_md++)
danw@127	1603	merge_one_directory(merger, child_md);
danw@127	1604	array_release(&merge_stack);
danw@127	1605	}
danw@127	1606
danw@127	1607	static void
danw@127	1608	merge_files(struct razor_merger *merger)
danw@127	1609	{
danw@129	1610	struct razor_entry *root;
danw@127	1611	struct merge_directory md;
danw@127	1612	uint32_t map1, map2;
danw@127	1613
danw@127	1614	map1 = merger->source1.file_map;
danw@127	1615	map2 = merger->source2.file_map;
danw@127	1616
danw@127	1617	md.merged = add_file(merger, "");
danw@129	1618
danw@129	1619	if (merger->source1.set->files.size) {
danw@129	1620	root = (struct razor_entry *) merger->source1.set->files.data;
danw@129	1621	if (root->start)
danw@129	1622	fix_file_map(map1, root, root);
danw@129	1623	md.dir1 = root->start;
danw@129	1624	} else
danw@129	1625	md.dir1 = 0;
danw@129	1626
danw@129	1627	if (merger->source2.set->files.size) {
danw@129	1628	root = (struct razor_entry *) merger->source2.set->files.data;
danw@129	1629	if (root->start)
danw@129	1630	fix_file_map(map2, root, root);
danw@129	1631	md.dir2 = root->start;
danw@129	1632	} else
danw@129	1633	md.dir2 = 0;
danw@129	1634
danw@127	1635	merge_one_directory(merger, &md);
danw@127	1636	}
danw@127	1637
danw@127	1638	static void
danw@127	1639	emit_files(struct list_head files, struct array source_pool,
danw@127	1640	uint32_t map, struct array pool)
danw@127	1641	{
danw@127	1642	uint32_t r;
danw@127	1643	struct list p, q;
danw@127	1644
danw@127	1645	r = pool->size / sizeof *q;
danw@127	1646	p = list_first(files, source_pool);
danw@127	1647	while (p) {
danw@127	1648	q = array_add(pool, sizeof *q);
danw@127	1649	q->data = map[p->data];
danw@127	1650	q->flags = p->flags;
danw@127	1651	p = list_next(p);
danw@127	1652	}
danw@127	1653
danw@127	1654	list_set_ptr(files, r);
danw@127	1655	}
danw@127	1656
krh@41	1657	/* Rebuild property->packages maps. We can't just remap these, as a
krh@41	1658	* property may have lost or gained a number of packages. Allocate an
krh@41	1659	* array per property and loop through the packages and add them to
krh@41	1660	* the arrays for their properties. */
krh@41	1661	static void
danw@127	1662	rebuild_property_package_lists(struct razor_set *set)
krh@41	1663	{
krh@66	1664	struct array pkgs, a;
krh@41	1665	struct razor_package pkg, pkg_end;
krh@41	1666	struct razor_property prop, prop_end;
danw@117	1667	struct list *r;
danw@117	1668	uint32_t *q;
krh@66	1669	int count;
krh@41	1670
krh@66	1671	count = set->properties.size / sizeof (struct razor_property);
krh@66	1672	pkgs = zalloc(count * sizeof *pkgs);
krh@41	1673	pkg_end = set->packages.data + set->packages.size;
krh@41	1674
krh@41	1675	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {
danw@128	1676	r = list_first(&pkg->properties, &set->property_pool);
danw@116	1677	while (r) {
danw@117	1678	q = array_add(&pkgs[r->data], sizeof *q);
krh@41	1679	q = pkg - (struct razor_package ) set->packages.data;
danw@116	1680	r = list_next(r);
krh@41	1681	}
krh@33	1682	}
krh@33	1683
krh@66	1684	prop_end = set->properties.data + set->properties.size;
krh@66	1685	a = pkgs;
krh@66	1686	for (prop = set->properties.data; prop < prop_end; prop++, a++) {
danw@128	1687	list_set_array(&prop->packages, &set->package_pool, a, 0);
krh@41	1688	array_release(a);
krh@41	1689	}
krh@66	1690	free(pkgs);
krh@33	1691	}
krh@33	1692
danw@127	1693	static void
danw@127	1694	rebuild_file_package_lists(struct razor_set *set)
danw@127	1695	{
danw@127	1696	struct array pkgs, a;
danw@127	1697	struct razor_package pkg, pkg_end;
danw@127	1698	struct razor_entry entry, entry_end;
danw@127	1699	struct list *r;
danw@127	1700	uint32_t *q;
danw@127	1701	int count;
danw@127	1702
danw@127	1703	count = set->files.size / sizeof (struct razor_entry);
danw@127	1704	pkgs = zalloc(count * sizeof *pkgs);
danw@127	1705	pkg_end = set->packages.data + set->packages.size;
danw@127	1706
danw@127	1707	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {
danw@128	1708	r = list_first(&pkg->files, &set->file_pool);
danw@127	1709	while (r) {
danw@127	1710	q = array_add(&pkgs[r->data], sizeof *q);
danw@127	1711	q = pkg - (struct razor_package ) set->packages.data;
danw@127	1712	r = list_next(r);
danw@127	1713	}
danw@127	1714	}
danw@127	1715
danw@127	1716	entry_end = set->files.data + set->files.size;
danw@127	1717	a = pkgs;
danw@127	1718	for (entry = set->files.data; entry < entry_end; entry++, a++) {
danw@128	1719	list_set_array(&entry->packages, &set->package_pool, a, 0);
danw@127	1720	array_release(a);
danw@127	1721	}
danw@127	1722	free(pkgs);
danw@127	1723	}
danw@127	1724
danw@137	1725	static struct razor_set *
krh@79	1726	razor_merger_finish(struct razor_merger *merger)
krh@79	1727	{
krh@79	1728	struct razor_set *result;
krh@41	1729	struct razor_package p, pend;
krh@33	1730
krh@41	1731	/* As we built the package list, we filled out a bitvector of
krh@41	1732	* the properties that are referenced by the packages in the
krh@41	1733	* new set. Now we do a parallel loop through the properties
krh@41	1734	* and emit those marked in the bit vector to the new set. In
krh@41	1735	* the process, we update the bit vector to actually map from
krh@41	1736	* indices in the old property list to indices in the new
krh@41	1737	* property list for both sets. */
krh@41	1738
krh@79	1739	merge_properties(merger);
danw@127	1740	merge_files(merger);
krh@41	1741
krh@41	1742	/* Now we loop through the packages again and emit the
krh@41	1743	* property lists, remapped to point to the new properties. */
krh@41	1744
krh@79	1745	pend = merger->set->packages.data + merger->set->packages.size;
krh@79	1746	for (p = merger->set->packages.data; p < pend; p++) {
krh@41	1747	struct source *src;
krh@41	1748
danw@120	1749	if (p->flags & UPSTREAM_SOURCE)
krh@79	1750	src = &merger->source2;
krh@41	1751	else
krh@79	1752	src = &merger->source1;
krh@41	1753
danw@116	1754	emit_properties(&p->properties,
danw@116	1755	&src->set->property_pool,
danw@116	1756	src->property_map,
danw@116	1757	&merger->set->property_pool);
danw@127	1758	emit_files(&p->files,
danw@127	1759	&src->set->file_pool,
danw@127	1760	src->file_map,
danw@127	1761	&merger->set->file_pool);
danw@120	1762	p->flags &= ~UPSTREAM_SOURCE;
krh@33	1763	}
krh@33	1764
danw@127	1765	rebuild_property_package_lists(merger->set);
danw@127	1766	rebuild_file_package_lists(merger->set);
krh@41	1767
danw@129	1768	result = merger->set;
danw@129	1769	hashtable_release(&merger->table);
danw@129	1770	free(merger);
danw@129	1771
danw@129	1772	return result;
danw@129	1773	}
danw@129	1774
danw@146	1775	/* The diff order matters. We should sort the packages so that a
danw@146	1776	* REMOVE of a package comes before the INSTALL, and so that all
danw@146	1777	* requires for a package have been installed before the package.
danw@146	1778	**/
danw@146	1779
danw@146	1780	void
danw@146	1781	razor_set_diff(struct razor_set set, struct razor_set upstream,
danw@146	1782	razor_package_callback_t callback, void *data)
danw@146	1783	{
danw@146	1784	struct razor_package_iterator pi1, pi2;
danw@146	1785	struct razor_package p1, p2;
danw@146	1786	const char name1, name2, version1, version2;
danw@146	1787	int res;
danw@146	1788
danw@146	1789	pi1 = razor_package_iterator_create(set);
danw@146	1790	pi2 = razor_package_iterator_create(upstream);
danw@146	1791
danw@146	1792	razor_package_iterator_next(pi1, &p1, &name1, &version1);
danw@146	1793	razor_package_iterator_next(pi2, &p2, &name2, &version2);
danw@146	1794
danw@146	1795	while (p1 \|\| p2) {
danw@146	1796	if (p1 && p2) {
danw@146	1797	res = strcmp(name1, name2);
danw@146	1798	if (res == 0)
danw@146	1799	res = versioncmp(version1, version2);
danw@146	1800	} else {
danw@146	1801	res = 0;
danw@146	1802	}
danw@146	1803
danw@146	1804	if (p2 == NULL \|\| res < 0)
danw@146	1805	callback(name1, version1, NULL, data);
danw@146	1806	else if (p1 == NULL \|\| res > 0)
danw@146	1807	callback(name2, NULL, version2, data);
danw@146	1808
danw@146	1809	if (p1 != NULL && res <= 0)
danw@146	1810	razor_package_iterator_next(pi1, &p1,
danw@146	1811	&name1, &version1);
danw@146	1812	if (p2 != NULL && res >= 0)
danw@146	1813	razor_package_iterator_next(pi2, &p2,
danw@146	1814	&name2, &version2);
danw@146	1815	}
danw@146	1816
danw@146	1817	razor_package_iterator_destroy(pi1);
danw@146	1818	razor_package_iterator_destroy(pi2);
danw@146	1819	}
danw@146	1820
danw@141	1821
danw@141	1822	struct razor_transaction_resolver {
danw@141	1823	struct razor_set system, upstream;
danw@141	1824	struct bitarray syspkgs, uppkgs;
danw@141	1825	struct array packages;
danw@141	1826	int errors;
danw@141	1827	};
danw@141	1828
danw@144	1829	static int
danw@144	1830	package_in_set(void package, struct razor_set set)
danw@144	1831	{
danw@144	1832	return package >= set->packages.data &&
danw@144	1833	package < set->packages.data + set->packages.size;
danw@144	1834	}
danw@144	1835
danw@144	1836	static int
danw@144	1837	property_in_set(void property, struct razor_set set)
danw@144	1838	{
danw@144	1839	return property >= set->properties.data &&
danw@144	1840	property < set->properties.data + set->properties.size;
danw@144	1841	}
danw@144	1842
danw@144	1843	static int
danw@144	1844	compare_transaction_packages(const void one, const void two)
danw@144	1845	{
danw@160	1846	struct razor_transaction_package *tp1 = (void )one;
danw@160	1847	struct razor_transaction_package *tp2 = (void )two;
danw@160	1848
danw@160	1849	if (!(*tp1)->name)
danw@160	1850	return 1;
danw@160	1851	else if (!(*tp2)->name)
danw@160	1852	return -1;
danw@160	1853	else
danw@160	1854	return strcmp((tp1)->name, (tp2)->name);
danw@144	1855	}
danw@144	1856
danw@141	1857	static void
danw@160	1858	resolve_new_packages(struct razor_transaction_resolver *trans,
danw@160	1859	int start, int end)
krh@38	1860	{
danw@144	1861	struct razor_package sp, spkgs, up, upkgs, send, uend;
danw@160	1862	struct razor_transaction_package **packages;
danw@144	1863	const char spool, upool;
danw@144	1864	int i;
danw@144	1865
danw@144	1866	spkgs = trans->system->packages.data;
danw@144	1867	send = trans->system->packages.data + trans->system->packages.size;
danw@144	1868	spool = trans->system->string_pool.data;
danw@144	1869	upkgs = trans->upstream->packages.data;
danw@144	1870	uend = trans->upstream->packages.data + trans->upstream->packages.size;
danw@144	1871	upool = trans->upstream->string_pool.data;
danw@144	1872
danw@160	1873	packages = calloc(end - start, sizeof *packages);
danw@160	1874	for (i = start; i < end; i++)
danw@160	1875	packages[i - start] = ((struct razor_transaction_package *)trans->packages.data) + i;
danw@160	1876	qsort(packages, end - start, sizeof *packages,
danw@160	1877	compare_transaction_packages);
danw@144	1878
danw@144	1879	sp = spkgs;
danw@144	1880	up = upkgs;
danw@160	1881	for (i = 0; i < end - start; i++) {
danw@160	1882	if (!packages[i]->name)
danw@160	1883	continue;
danw@160	1884	while (sp < send && strcmp(&spool[sp->name], packages[i]->name) < 0)
danw@144	1885	sp++;
danw@160	1886	while (up < uend && strcmp(&upool[up->name], packages[i]->name) < 0)
danw@144	1887	up++;
danw@144	1888
danw@160	1889	if (packages[i]->state == RAZOR_PACKAGE_REMOVE \|\|
danw@160	1890	packages[i]->state == RAZOR_PACKAGE_OBSOLETED) {
danw@160	1891	if (sp < send && strcmp(packages[i]->name, &spool[sp->name]) == 0) {
danw@160	1892	packages[i]->old_package = sp;
danw@160	1893	packages[i]->name = &spool[sp->name];
danw@160	1894	packages[i]->old_version = &spool[sp->version];
danw@144	1895	bitarray_set(&trans->syspkgs, sp - spkgs, 0);
danw@144	1896	} else {
danw@160	1897	packages[i]->name = strdup(packages[i]->name);
danw@160	1898	packages[i]->state = RAZOR_PACKAGE_REMOVE_NOT_INSTALLED;
danw@144	1899	trans->errors++;
danw@144	1900	}
danw@144	1901	} else {
danw@160	1902	if (up < uend && strcmp(packages[i]->name, &upool[up->name]) == 0) {
danw@160	1903	packages[i]->new_package = up;
danw@160	1904	packages[i]->name = &upool[up->name];
danw@160	1905	packages[i]->new_version = &upool[up->version];
danw@160	1906	if (sp < send && strcmp(packages[i]->name, &spool[sp->name]) == 0) {
danw@160	1907	packages[i]->old_package = sp;
danw@160	1908	packages[i]->old_version = &spool[sp->version];
danw@144	1909	if (versioncmp(&spool[sp->version], &upool[up->version]) >= 0) {
danw@160	1910	packages[i]->state = RAZOR_PACKAGE_UP_TO_DATE;
danw@144	1911	trans->errors++;
danw@144	1912	continue;
danw@144	1913	}
danw@144	1914	bitarray_set(&trans->syspkgs, sp - spkgs, 0);
danw@144	1915	}
danw@144	1916	bitarray_set(&trans->uppkgs, up - upkgs, 1);
danw@144	1917	} else {
danw@160	1918	packages[i]->name = strdup(packages[i]->name);
danw@160	1919	packages[i]->state = RAZOR_PACKAGE_INSTALL_UNAVAILABLE;
danw@144	1920	trans->errors++;
krh@105	1921	}
krh@105	1922	}
krh@38	1923	}
krh@38	1924	}
krh@38	1925
krh@38	1926	static void
danw@141	1927	find_all_packages(struct razor_transaction_resolver *trans)
krh@38	1928	{
danw@137	1929	struct razor_transaction_package *tp;
danw@144	1930	struct razor_package sp, spkgs, send, up, upkgs, uend;
danw@144	1931	const char spool, upool;
danw@144	1932
danw@144	1933	spkgs = trans->system->packages.data;
danw@144	1934	send = trans->system->packages.data + trans->system->packages.size;
danw@144	1935	spool = trans->system->string_pool.data;
danw@144	1936	up = upkgs = trans->upstream->packages.data;
danw@141	1937	uend = trans->upstream->packages.data + trans->upstream->packages.size;
danw@141	1938	upool = trans->upstream->string_pool.data;
krh@38	1939
danw@144	1940	for (sp = spkgs; sp < send; sp++) {
danw@144	1941	while (up < uend && strcmp(&spool[sp->name], &upool[up->name]) > 0)
danw@144	1942	up++;
danw@144	1943	if (strcmp(&spool[sp->name], &upool[up->name]) == 0) {
danw@141	1944	tp = array_add(&trans->packages, sizeof *tp);
danw@137	1945	memset(tp, 0, sizeof *tp);
danw@147	1946	tp->old_package = sp;
danw@147	1947	tp->new_package = up;
danw@144	1948	tp->name = &upool[up->name];
danw@147	1949	tp->old_version = &spool[sp->version];
danw@147	1950	tp->new_version = &upool[up->version];
danw@137	1951	tp->state = RAZOR_PACKAGE_INSTALL;
danw@144	1952	bitarray_set(&trans->uppkgs, up - upkgs, 1);
danw@144	1953	bitarray_set(&trans->syspkgs, sp - spkgs, 0);
krh@38	1954	}
krh@38	1955	}
krh@38	1956	}
krh@38	1957
danw@137	1958	static int
danw@137	1959	provider_satisfies_requirement(struct razor_property *provider,
danw@137	1960	const char *provider_strings,
danw@137	1961	struct razor_property *requirement,
danw@137	1962	const char *requirement_strings)
danw@137	1963	{
danw@137	1964	int cmp, len;
danw@137	1965	const char *provided = &provider_strings[provider->version];
danw@137	1966	const char *required = &requirement_strings[requirement->version];
danw@137	1967
danw@137	1968	if (!*required)
danw@137	1969	return 1;
danw@137	1970
danw@137	1971	cmp = versioncmp(provided, required);
danw@137	1972
danw@137	1973	switch (requirement->relation) {
danw@137	1974	case RAZOR_VERSION_LESS:
danw@137	1975	return cmp < 0;
danw@137	1976
danw@137	1977	case RAZOR_VERSION_LESS_OR_EQUAL:
danw@137	1978	if (cmp <= 0)
danw@137	1979	return 1;
danw@137	1980	/* fall through: FIXME, make sure this is correct */
danw@137	1981
danw@137	1982	case RAZOR_VERSION_EQUAL:
danw@137	1983	if (cmp == 0)
danw@137	1984	return 1;
danw@137	1985
danw@137	1986	/* "foo == 1.1" is satisfied by "foo 1.1-2" */
danw@137	1987	len = strlen(required);
danw@137	1988	if (!strncmp(required, provided, len) && provided[len] == '-')
danw@137	1989	return 1;
danw@137	1990	return 0;
danw@137	1991
danw@137	1992	case RAZOR_VERSION_GREATER_OR_EQUAL:
danw@137	1993	return cmp >= 0;
danw@137	1994
danw@137	1995	case RAZOR_VERSION_GREATER:
danw@137	1996	return cmp > 0;
danw@137	1997	}
danw@137	1998
danw@137	1999	/* shouldn't happen */
danw@137	2000	return 0;
danw@137	2001	}
danw@137	2002
danw@142	2003	static struct razor_package *
danw@144	2004	find_package_for_file(struct razor_set set, struct bitarray pkgbits,
danw@144	2005	const char *filename, int installed)
danw@134	2006	{
danw@142	2007	struct razor_package *pkgs = set->packages.data;
danw@140	2008	struct razor_entry *entry;
danw@140	2009	struct list *p;
danw@134	2010
danw@140	2011	if (filename[0] != '/')
danw@140	2012	return 0;
danw@140	2013
danw@142	2014	entry = find_entry(set, set->files.data, filename);
danw@140	2015	if (!entry)
danw@140	2016	return 0;
danw@140	2017
danw@142	2018	for (p = list_first(&entry->packages, &set->package_pool); p; p = list_next(p)) {
danw@142	2019	if (bitarray_get(pkgbits, p->data) == installed)
danw@142	2020	return &pkgs[p->data];
danw@134	2021	}
danw@142	2022	return NULL;
danw@142	2023	}
danw@142	2024
danw@142	2025	static struct razor_package *
danw@144	2026	find_installed_package_for_file(struct razor_transaction_resolver *trans,
danw@144	2027	const char *filename)
danw@142	2028	{
danw@144	2029	struct razor_package *pkg;
danw@144	2030
danw@144	2031	pkg = find_package_for_file(trans->system, &trans->syspkgs,
danw@144	2032	filename, 1);
danw@144	2033	if (!pkg)
danw@144	2034	pkg = find_package_for_file(trans->upstream, &trans->uppkgs,
danw@144	2035	filename, 1);
danw@144	2036	return pkg;
danw@142	2037	}
danw@142	2038
danw@142	2039	static struct razor_package *
danw@144	2040	find_uninstalled_package_for_file(struct razor_transaction_resolver *trans,
danw@144	2041	const char *filename)
danw@142	2042	{
danw@144	2043	struct razor_package *pkg;
danw@144	2044
danw@144	2045	pkg = find_package_for_file(trans->upstream, &trans->uppkgs,
danw@144	2046	filename, 0);
danw@144	2047	if (!pkg)
danw@144	2048	pkg = find_package_for_file(trans->system, &trans->syspkgs,
danw@144	2049	filename, 0);
danw@144	2050	return pkg;
danw@134	2051	}
danw@134	2052
danw@154	2053	static struct razor_property *
danw@154	2054	skip_to_matching_property(struct razor_transaction_resolver *trans,
danw@154	2055	struct razor_property *match,
danw@154	2056	struct razor_property *prop)
danw@154	2057	{
danw@154	2058	struct razor_set mset, pset;
danw@154	2059	const char ppool, mpool;
danw@154	2060	struct razor_property *prop_end;
danw@154	2061
danw@154	2062	if (property_in_set(match, trans->system))
danw@154	2063	mset = trans->system;
danw@154	2064	else
danw@154	2065	mset = trans->upstream;
danw@154	2066
danw@154	2067	if (property_in_set(prop, trans->system))
danw@154	2068	pset = trans->system;
danw@154	2069	else if (property_in_set(prop, trans->upstream))
danw@154	2070	pset = trans->upstream;
danw@154	2071	else
danw@154	2072	return prop;
danw@154	2073
danw@154	2074	prop_end = pset->properties.data + pset->properties.size;
danw@154	2075	ppool = pset->string_pool.data;
danw@154	2076	mpool = mset->string_pool.data;
danw@154	2077
danw@154	2078	while (prop < prop_end &&
danw@154	2079	strcmp(&ppool[prop->name], &mpool[match->name]) < 0)
danw@154	2080	prop++;
danw@154	2081	return prop;
danw@154	2082	}
danw@154	2083
danw@140	2084	static struct razor_package *
danw@144	2085	find_package_matching(struct razor_transaction_resolver *trans, int installed,
danw@154	2086	struct razor_property *prop,
danw@144	2087	struct razor_property *req,
danw@144	2088	struct razor_set *req_set)
danw@138	2089	{
danw@144	2090	struct razor_set *set;
danw@144	2091	struct bitarray *pkgbits;
danw@144	2092	struct razor_package *pkgs;
danw@154	2093	struct razor_property props, prop_end;
danw@144	2094	enum razor_property_type match_type;
danw@144	2095	const char *pool;
danw@154	2096	const char *rpool;
danw@154	2097	int match_name = (req->type == RAZOR_PROPERTY_OBSOLETES);
danw@144	2098	int match;
danw@144	2099
danw@144	2100	if (property_in_set(prop, trans->system)) {
danw@144	2101	set = trans->system;
danw@144	2102	pkgbits = &trans->syspkgs;
danw@144	2103	} else if (property_in_set(prop, trans->upstream)) {
danw@144	2104	set = trans->upstream;
danw@144	2105	pkgbits = &trans->uppkgs;
danw@144	2106	} else
danw@144	2107	return NULL;
danw@144	2108
danw@154	2109	if (!req_set) {
danw@154	2110	if (property_in_set(req, trans->system))
danw@154	2111	req_set = trans->system;
danw@154	2112	else
danw@154	2113	req_set = trans->upstream;
danw@154	2114	}
danw@154	2115	rpool = req_set->string_pool.data;
danw@154	2116
danw@144	2117	if (req->type == RAZOR_PROPERTY_PROVIDES)
danw@144	2118	match_type = RAZOR_PROPERTY_CONFLICTS;
danw@144	2119	else
danw@144	2120	match_type = RAZOR_PROPERTY_PROVIDES;
danw@144	2121
danw@144	2122	pkgs = set->packages.data;
danw@144	2123	props = set->properties.data;
danw@144	2124	prop_end = set->properties.data + set->properties.size;
danw@144	2125	pool = set->string_pool.data;
danw@144	2126
danw@144	2127	/* Find first matching property */
danw@144	2128	while (prop < prop_end &&
danw@144	2129	strcmp(&pool[prop->name], &rpool[req->name]) < 0)
danw@144	2130	prop++;
danw@144	2131	if (prop == prop_end \|\|
danw@144	2132	strcmp(&pool[prop->name], &rpool[req->name]) > 0)
danw@144	2133	return NULL;
danw@144	2134
danw@144	2135	if (prop->type < match_type) {
danw@144	2136	while (prop < prop_end && prop->type != match_type)
danw@144	2137	prop++;
danw@144	2138	} else {
danw@144	2139	while (prop >= props && prop->type != match_type)
danw@144	2140	prop--;
danw@144	2141	while (prop > props + 1 && (prop - 1)->type == match_type)
danw@144	2142	prop--;
danw@144	2143	}
danw@144	2144
danw@153	2145	/* Scan matching properties */
danw@144	2146	while (prop < prop_end && prop->type == match_type &&
danw@144	2147	strcmp(&pool[prop->name], &rpool[req->name]) == 0) {
danw@144	2148	if (match_type == RAZOR_PROPERTY_PROVIDES)
danw@144	2149	match = provider_satisfies_requirement(prop, pool, req, rpool);
danw@144	2150	else
danw@144	2151	match = provider_satisfies_requirement(req, rpool, prop, pool);
danw@144	2152	if (match) {
danw@140	2153	struct list *pkg;
danw@140	2154
danw@144	2155	for (pkg = list_first(&prop->packages, &set->package_pool); pkg; pkg = list_next(pkg)) {
danw@144	2156	if (bitarray_get(pkgbits, pkg->data) != installed)
danw@140	2157	continue;
danw@140	2158	if (!match_name \|\|
danw@144	2159	strcmp(&pool[pkgs[pkg->data].name],
danw@144	2160	&rpool[req->name]) == 0)
danw@144	2161	return &pkgs[pkg->data];
danw@140	2162	}
danw@140	2163	}
danw@144	2164	prop++;
danw@140	2165	}
danw@140	2166
danw@140	2167	return NULL;
danw@138	2168	}
danw@138	2169
danw@140	2170	static struct razor_package *
danw@144	2171	find_installed_package_for_property(struct razor_transaction_resolver *trans,
danw@154	2172	struct razor_property *sys_start,
danw@154	2173	struct razor_property *up_start,
danw@144	2174	struct razor_property *req)
danw@138	2175	{
danw@144	2176	struct razor_package *pkg;
danw@144	2177
danw@154	2178	pkg = find_package_matching(trans, 1, sys_start, req, NULL);
danw@144	2179	if (!pkg)
danw@154	2180	pkg = find_package_matching(trans, 1, up_start, req, NULL);
danw@144	2181	return pkg;
danw@144	2182	}
danw@144	2183
danw@144	2184	static struct razor_package *
danw@144	2185	find_uninstalled_package_for_property(struct razor_transaction_resolver *trans,
danw@154	2186	struct razor_property *sys_start,
danw@154	2187	struct razor_property *up_start,
danw@144	2188	struct razor_property *req)
danw@144	2189	{
danw@144	2190	struct razor_package *pkg;
danw@144	2191
danw@154	2192	pkg = find_package_matching(trans, 0, up_start, req, NULL);
danw@144	2193	if (!pkg)
danw@154	2194	pkg = find_package_matching(trans, 0, sys_start, req, NULL);
danw@144	2195	return pkg;
danw@140	2196	}
danw@140	2197
danw@147	2198	static struct razor_transaction_package *
danw@147	2199	find_transaction_package(struct razor_transaction_resolver *trans,
danw@147	2200	const char *name)
danw@147	2201	{
danw@147	2202	struct razor_transaction_package *packages;
danw@147	2203	int count, i;
danw@147	2204
danw@147	2205	packages = trans->packages.data;
danw@147	2206	count = trans->packages.size / sizeof *packages;
danw@147	2207	for (i = 0; i < count; i++) {
danw@147	2208	if (packages[i].name && !strcmp(packages[i].name, name))
danw@147	2209	return &packages[i];
danw@147	2210	}
danw@147	2211	return NULL;
danw@147	2212	}
danw@147	2213
danw@160	2214	/* FIXME? */
danw@160	2215	static int
danw@160	2216	prop_is_being_installed(struct razor_transaction_resolver *trans,
danw@160	2217	struct razor_property *prop)
danw@160	2218	{
danw@160	2219	struct list *pkg;
danw@160	2220
danw@160	2221	for (pkg = list_first(&prop->packages, &trans->upstream->package_pool); pkg; pkg = list_next(pkg)) {
danw@160	2222	if (bitarray_get(&trans->uppkgs, pkg->data))
danw@160	2223	return 1;
danw@160	2224	}
danw@160	2225	return 0;
danw@160	2226	}
danw@160	2227
danw@160	2228	static int
danw@160	2229	prop_is_being_removed(struct razor_transaction_resolver *trans,
danw@160	2230	struct razor_property *prop)
danw@160	2231	{
danw@160	2232	struct list *pkg;
danw@160	2233
danw@160	2234	for (pkg = list_first(&prop->packages, &trans->system->package_pool); pkg; pkg = list_next(pkg)) {
danw@160	2235	if (bitarray_get(&trans->syspkgs, pkg->data))
danw@160	2236	return 0;
danw@160	2237	}
danw@160	2238	return 1;
danw@160	2239	}
danw@160	2240
danw@160	2241	static int
danw@160	2242	prop_is_being_updated(struct razor_transaction_resolver *trans,
danw@160	2243	struct razor_property *prop)
danw@160	2244	{
danw@160	2245	struct razor_package *packages = trans->system->packages.data;
danw@160	2246	const char *pool = trans->system->string_pool.data;
danw@160	2247	struct razor_transaction_package *tp;
danw@160	2248	struct list *pkg;
danw@160	2249
danw@160	2250	/* Assumes prop_is_being_removed returns true */
danw@160	2251
danw@160	2252	for (pkg = list_first(&prop->packages, &trans->system->package_pool); pkg; pkg = list_next(pkg)) {
danw@160	2253	tp = find_transaction_package(trans, &pool[packages[pkg->data].name]);
danw@160	2254	if (tp && tp->state == RAZOR_PACKAGE_REMOVE)
danw@160	2255	return 0;
danw@160	2256	}
danw@160	2257	return 1;
danw@160	2258	}
danw@160	2259
danw@131	2260	static void
danw@141	2261	add_transaction_package(struct razor_transaction_resolver *trans,
danw@147	2262	struct razor_package *new_package,
danw@147	2263	struct razor_package *old_package,
danw@140	2264	enum razor_transaction_package_state state,
danw@144	2265	const char *req_package,
danw@144	2266	struct razor_property *req_prop)
danw@131	2267	{
danw@147	2268	struct razor_set new_package_set, old_package_set, *req_set;
danw@160	2269	struct bitarray *reqpkgbits;
danw@147	2270	struct razor_transaction_package tp, already;
danw@140	2271	const char *pool;
danw@140	2272	struct razor_package *pkgs;
danw@140	2273	struct list *pkg;
danw@147	2274	int contradiction = 0;
danw@147	2275
danw@160	2276	if (package_in_set(new_package, trans->system))
danw@147	2277	new_package_set = trans->system;
danw@160	2278	else
danw@147	2279	new_package_set = trans->upstream;
danw@160	2280	if (package_in_set(old_package, trans->system))
danw@147	2281	old_package_set = trans->system;
danw@160	2282	else
danw@147	2283	old_package_set = trans->upstream;
danw@145	2284	if (property_in_set(req_prop, trans->system)) {
danw@145	2285	req_set = trans->system;
danw@145	2286	reqpkgbits = &trans->syspkgs;
danw@145	2287	} else {
danw@145	2288	req_set = trans->upstream;
danw@145	2289	reqpkgbits = &trans->uppkgs;
danw@145	2290	}
danw@144	2291
danw@147	2292	if (new_package) {
danw@147	2293	pool = new_package_set->string_pool.data;
danw@147	2294	already = find_transaction_package(trans, &pool[new_package->name]);
danw@147	2295	if (already) {
danw@147	2296	if (already->new_package == new_package) {
danw@147	2297	/* Already taken care of */
danw@147	2298	return;
danw@147	2299	}
danw@147	2300	/* Oops. We lose */
danw@147	2301	if (state != RAZOR_PACKAGE_CONTRADICTION)
danw@147	2302	contradiction = 1;
danw@147	2303	}
danw@147	2304	} else if (old_package) {
danw@147	2305	pool = old_package_set->string_pool.data;
danw@147	2306	already = find_transaction_package(trans, &pool[old_package->name]);
danw@147	2307	if (already) {
danw@147	2308	if (already->old_package == old_package) {
danw@147	2309	/* Already taken care of */
danw@147	2310	return;
danw@147	2311	}
danw@147	2312	/* Oops. We lose */
danw@147	2313	if (state != RAZOR_PACKAGE_CONTRADICTION)
danw@147	2314	contradiction = 1;
danw@147	2315	}
danw@147	2316	} else
danw@147	2317	state = RAZOR_PACKAGE_UNSATISFIABLE;
danw@147	2318
danw@141	2319	tp = array_add(&trans->packages, sizeof *tp);
danw@140	2320	memset(tp, 0, sizeof *tp);
danw@131	2321
danw@147	2322	if (new_package) {
danw@147	2323	pool = new_package_set->string_pool.data;
danw@147	2324	tp->new_package = new_package;
danw@147	2325	tp->name = &pool[new_package->name];
danw@147	2326	tp->new_version = &pool[new_package->version];
danw@147	2327
danw@147	2328	pkgs = new_package_set->packages.data;
danw@147	2329	}
danw@147	2330	if (old_package) {
danw@147	2331	pool = old_package_set->string_pool.data;
danw@147	2332	tp->old_package = old_package;
danw@147	2333	tp->name = &pool[old_package->name];
danw@147	2334	tp->old_version = &pool[old_package->version];
danw@147	2335
danw@147	2336	pkgs = old_package_set->packages.data;
danw@147	2337	}
danw@147	2338
danw@147	2339	tp->state = state;
danw@147	2340	if (state != RAZOR_PACKAGE_INSTALL &&
danw@154	2341	state != RAZOR_PACKAGE_FORCED_UPDATE &&
danw@154	2342	state != RAZOR_PACKAGE_REMOVE &&
danw@154	2343	state != RAZOR_PACKAGE_OBSOLETED)
danw@145	2344	trans->errors++;
danw@147	2345
danw@147	2346	if (contradiction) {
danw@147	2347	/* Do this now, after adding tp, so that it ends up
danw@147	2348	* after both the INSTALL and the REMOVE in the array.
danw@147	2349	*/
danw@147	2350	add_transaction_package(trans, new_package, old_package,
danw@147	2351	RAZOR_PACKAGE_CONTRADICTION,
danw@147	2352	NULL, NULL);
danw@145	2353	}
danw@140	2354
danw@144	2355	if (req_package)
danw@145	2356	tp->dep_package = req_package;
danw@145	2357	if (!req_prop)
danw@145	2358	return;
danw@145	2359
danw@145	2360	pool = req_set->string_pool.data;
danw@145	2361	pkgs = req_set->packages.data;
danw@145	2362	if (!req_package) {
danw@145	2363	for (pkg = list_first(&req_prop->packages, &req_set->package_pool); pkg; pkg = list_next(pkg)) {
danw@145	2364	if (bitarray_get(reqpkgbits, pkg->data))
danw@144	2365	break;
danw@144	2366	}
danw@145	2367	if (pkg)
danw@145	2368	tp->dep_package = &pool[pkgs[pkg->data].name];
danw@131	2369	}
danw@144	2370
danw@145	2371	tp->dep_type = req_prop->type;
danw@145	2372	tp->dep_property = &pool[req_prop->name];
danw@145	2373	tp->dep_relation = req_prop->relation;
danw@145	2374	tp->dep_version = &pool[req_prop->version];
danw@140	2375	}
danw@140	2376
danw@160	2377	static void
danw@160	2378	razor_transaction_satisfy(struct razor_transaction_resolver *trans)
danw@147	2379	{
danw@160	2380	struct razor_package spkgs, upkgs, *pkg;
danw@144	2381	struct razor_property sp, sprops, *sprop_end;
danw@144	2382	struct razor_property up, uprops, *uprop_end;
danw@160	2383	struct razor_property sr, ur, *first_up;
danw@160	2384	const char spool, upool, *removed_package;
danw@160	2385	struct list *reqpkg;
danw@134	2386
danw@140	2387	spkgs = trans->system->packages.data;
danw@140	2388	sprops = trans->system->properties.data;
danw@144	2389	sprop_end = trans->system->properties.data + trans->system->properties.size;
danw@145	2390	spool = trans->system->string_pool.data;
danw@140	2391	upkgs = trans->upstream->packages.data;
danw@140	2392	uprops = trans->upstream->properties.data;
danw@144	2393	uprop_end = trans->upstream->properties.data + trans->upstream->properties.size;
danw@140	2394	upool = trans->upstream->string_pool.data;
krh@33	2395
danw@144	2396	sp = sprops;
danw@160	2397	for (up = uprops; up < uprop_end; up++) {
danw@140	2398	/* Skip 'up' ahead to a property of a package which is
danw@140	2399	* to-be-installed.
danw@140	2400	*/
danw@144	2401	while (up < uprop_end &&
danw@144	2402	!prop_is_being_installed(trans, up))
danw@140	2403	up++;
danw@144	2404	if (up == uprop_end)
danw@140	2405	break;
danw@154	2406	sp = skip_to_matching_property(trans, up, sp);
krh@33	2407
danw@144	2408	switch (up->type) {
danw@140	2409	case RAZOR_PROPERTY_REQUIRES:
danw@144	2410	if (!strncmp(&upool[up->name], "rpmlib(", 7))
danw@140	2411	break;
danw@131	2412
danw@154	2413	if (find_installed_package_for_property(trans, sp, up, up) \|\|
danw@144	2414	find_installed_package_for_file(trans, &upool[up->name])) {
danw@140	2415	/* Requires something that is either installed
danw@140	2416	* or to-be-installed.
danw@140	2417	*/
danw@140	2418	break;
danw@137	2419	}
danw@137	2420
danw@140	2421	/* See if we can install a new upstream provider */
danw@154	2422	pkg = find_uninstalled_package_for_property(trans, sp, up, up);
danw@154	2423	if (!pkg)
danw@144	2424	pkg = find_uninstalled_package_for_file(trans, &upool[up->name]);
danw@160	2425	add_transaction_package(trans, pkg, NULL,
danw@144	2426	RAZOR_PACKAGE_INSTALL,
danw@144	2427	NULL, up);
danw@144	2428	break;
danw@144	2429
danw@144	2430	case RAZOR_PROPERTY_PROVIDES:
danw@144	2431	/* find_installed_package_for_property works backwards
danw@144	2432	* here, finding a conflicting installed package.
danw@144	2433	*/
danw@154	2434	pkg = find_installed_package_for_property(trans, sp, up, up);
danw@140	2435	if (!pkg)
danw@144	2436	break;
danw@144	2437
danw@145	2438	if (package_in_set(pkg, trans->system)) {
danw@145	2439	/* pkg CONFLICTS with what 'up' PROVIDES. Try
danw@145	2440	* finding an upgrade
danw@145	2441	*/
danw@160	2442	add_transaction_package(trans, NULL, pkg,
danw@160	2443	RAZOR_PACKAGE_FORCED_UPDATE,
danw@160	2444	&spool[pkg->name], sp);
danw@160	2445	} else {
danw@160	2446	add_transaction_package(trans, NULL, pkg,
danw@160	2447	RAZOR_PACKAGE_CONTRADICTION,
danw@160	2448	NULL, up);
danw@144	2449	}
danw@140	2450	break;
danw@140	2451
danw@140	2452	case RAZOR_PROPERTY_CONFLICTS:
danw@154	2453	pkg = find_installed_package_for_property(trans, sp, up, up);
danw@144	2454	if (!pkg)
danw@144	2455	break;
danw@144	2456
danw@144	2457	if (package_in_set(pkg, trans->system)) {
danw@140	2458	/* Conflicts with something already installed.
danw@140	2459	* Try to upgrade out.
danw@140	2460	*/
danw@160	2461	add_transaction_package(trans, NULL, pkg,
danw@160	2462	RAZOR_PACKAGE_FORCED_UPDATE,
danw@160	2463	NULL, up);
danw@160	2464	} else {
danw@160	2465	add_transaction_package(trans, pkg, NULL,
danw@160	2466	RAZOR_PACKAGE_CONTRADICTION,
danw@160	2467	NULL, up);
danw@140	2468	}
danw@140	2469	break;
danw@140	2470
danw@140	2471	case RAZOR_PROPERTY_OBSOLETES:
danw@154	2472	pkg = find_installed_package_for_property(trans, sp, up, up);
danw@145	2473	if (pkg) {
danw@145	2474	/* If pkg is to-be-installed, this
danw@145	2475	* will add a CONTRADICTION error as well.
danw@145	2476	*/
danw@147	2477	add_transaction_package(trans, NULL, pkg,
danw@154	2478	RAZOR_PACKAGE_OBSOLETED,
danw@144	2479	NULL, up);
danw@140	2480	}
danw@140	2481	break;
danw@140	2482
danw@140	2483	default:
danw@140	2484	/* can't happen */
danw@140	2485	break;
danw@131	2486	}
krh@37	2487	}
danw@154	2488
danw@154	2489	up = uprops;
danw@154	2490	for (sp = sprops; sp < sprop_end; sp++) {
danw@154	2491	/* Skip 'sp' ahead to a PROVIDES of a package which is
danw@154	2492	* to-be-removed.
danw@154	2493	*/
danw@154	2494	while (sp < sprop_end &&
danw@154	2495	(sp->type != RAZOR_PROPERTY_PROVIDES \|\|
danw@154	2496	!prop_is_being_removed(trans, sp)))
danw@154	2497	sp++;
danw@154	2498	if (sp == sprop_end)
danw@154	2499	break;
danw@154	2500
danw@154	2501	removed_package = &spool[spkgs[list_first(&sp->packages, &trans->system->package_pool)->data].name];
danw@154	2502
danw@154	2503	/* Skip 'up' to match */
danw@154	2504	up = skip_to_matching_property(trans, sp, up);
danw@154	2505	ur = first_up = up;
danw@154	2506
danw@154	2507	/* If the package is just being upgraded, we may
danw@154	2508	* already be installing an identical PROVIDES, so
danw@154	2509	* check for that.
danw@154	2510	*/
danw@154	2511	while (up < uprop_end &&
danw@154	2512	strcmp(&spool[sp->name], &upool[up->name]) == 0 &&
danw@154	2513	(up->type != RAZOR_PROPERTY_PROVIDES \|\|
danw@154	2514	sp->relation != up->relation \|\|
danw@154	2515	strcmp(&spool[sp->name], &upool[up->name]) != 0))
danw@154	2516	up++;
danw@154	2517	if (up < uprop_end &&
danw@154	2518	up->type == RAZOR_PROPERTY_PROVIDES &&
danw@154	2519	strcmp(&spool[sp->name], &upool[up->name]) == 0 &&
danw@154	2520	sp->relation == up->relation &&
danw@154	2521	strcmp(&spool[sp->version], &upool[up->version]) == 0 &&
danw@154	2522	prop_is_being_installed(trans, up)) {
danw@154	2523	up = first_up;
danw@154	2524	continue;
danw@154	2525	}
danw@154	2526	up = first_up;
danw@154	2527
danw@154	2528	/* For all still-installed packages that require
danw@154	2529	* sp->name, see if they are satisfied by any other
danw@154	2530	* still-installed or to-be-installed property. If
danw@154	2531	* not, either remove or attempt to update the
danw@154	2532	* package, depending on why the required property has
danw@154	2533	* disappeared
danw@154	2534	*/
danw@154	2535	sr = sp;
danw@154	2536	while (sr > sprops + 1 && (sr - 1)->name == sr->name)
danw@154	2537	sr--;
danw@154	2538	for (; sr->type == RAZOR_PROPERTY_REQUIRES; sr++) {
danw@154	2539	if (prop_is_being_removed(trans, sr))
danw@154	2540	continue;
danw@154	2541	if (find_installed_package_for_property(trans, sp, up, sr))
danw@154	2542	continue;
danw@154	2543
danw@154	2544	for (reqpkg = list_first(&sr->packages, &trans->system->package_pool); reqpkg; reqpkg = list_next(reqpkg)) {
danw@154	2545	if (!bitarray_get(&trans->syspkgs, reqpkg->data))
danw@154	2546	continue;
danw@154	2547	pkg = &spkgs[reqpkg->data];
danw@154	2548	if (prop_is_being_updated(trans, sp)) {
danw@160	2549	add_transaction_package(trans, NULL, pkg,
danw@160	2550	RAZOR_PACKAGE_FORCED_UPDATE,
danw@160	2551	removed_package, NULL);
danw@154	2552	} else {
danw@154	2553	add_transaction_package(trans, NULL, pkg,
danw@154	2554	RAZOR_PACKAGE_REMOVE,
danw@154	2555	removed_package, sr);
danw@154	2556	}
danw@154	2557	}
danw@154	2558	}
danw@154	2559	}
danw@154	2560	}
danw@129	2561
danw@137	2562	struct razor_transaction *
danw@137	2563	razor_transaction_create(struct razor_set system, struct razor_set upstream,
danw@137	2564	int update_count, const char **update_packages,
danw@137	2565	int remove_count, const char **remove_packages)
danw@137	2566	{
danw@141	2567	struct razor_transaction_resolver trans;
danw@141	2568	struct razor_transaction *ret_trans;
danw@160	2569	struct razor_transaction_package *tp;
danw@160	2570	int start, end, i;
danw@137	2571
danw@141	2572	trans.system = system;
danw@141	2573	trans.upstream = upstream ? upstream : razor_set_create();
danw@141	2574	array_init(&trans.packages);
danw@141	2575	bitarray_init(&trans.syspkgs, trans.system->packages.size / sizeof (struct razor_package), 1);
danw@141	2576	bitarray_init(&trans.uppkgs, trans.upstream->packages.size / sizeof (struct razor_package), 0);
danw@141	2577	trans.errors = 0;
danw@137	2578
danw@144	2579	if (update_count > 0 \|\| remove_count > 0) {
danw@160	2580	for (i = 0; i < update_count; i++) {
danw@160	2581	tp = array_add(&trans.packages, sizeof *tp);
danw@160	2582	memset(tp, 0, sizeof *tp);
danw@160	2583	tp->name = update_packages[i];
danw@160	2584	tp->state = RAZOR_PACKAGE_INSTALL;
danw@160	2585	}
danw@160	2586	for (i = 0; i < remove_count; i++) {
danw@160	2587	tp = array_add(&trans.packages, sizeof *tp);
danw@160	2588	memset(tp, 0, sizeof *tp);
danw@160	2589	tp->name = remove_packages[i];
danw@160	2590	tp->state = RAZOR_PACKAGE_REMOVE;
danw@160	2591	}
danw@144	2592	} else
danw@141	2593	find_all_packages(&trans);
danw@137	2594
danw@137	2595	start = 0;
danw@141	2596	end = trans.packages.size / sizeof (struct razor_transaction_package);
danw@137	2597
danw@160	2598	while (start != end) {
danw@160	2599	resolve_new_packages(&trans, start, end);
danw@160	2600	if (trans.errors)
danw@160	2601	break;
danw@160	2602
danw@160	2603	razor_transaction_satisfy(&trans);
danw@137	2604
danw@137	2605	start = end;
danw@141	2606	end = trans.packages.size / sizeof (struct razor_transaction_package);
danw@137	2607	}
danw@137	2608
danw@141	2609	ret_trans = zalloc(sizeof *ret_trans);
danw@141	2610	ret_trans->system = trans.system;
danw@141	2611	ret_trans->upstream = trans.upstream;
danw@141	2612	ret_trans->packages = trans.packages.data;
danw@141	2613	ret_trans->package_count = end;
danw@141	2614	ret_trans->errors = trans.errors;
danw@141	2615	return ret_trans;
danw@137	2616	}
danw@137	2617
danw@137	2618	const char * const razor_version_relations[] = {
danw@137	2619	/* same order as enum razor_version_relation */
danw@137	2620	"<", "<=", "=", ">=", ">"
danw@137	2621	};
danw@137	2622
danw@140	2623	const char * const razor_property_types[] = {
danw@140	2624	/* same order as enum razor_property_type */
danw@140	2625	"requires", "provides", "conflicts with", "obsoletes"
danw@140	2626	};
danw@140	2627
danw@137	2628	void
danw@137	2629	razor_transaction_describe(struct razor_transaction *trans)
danw@137	2630	{
danw@137	2631	struct razor_transaction_package p, pend, *tps;
danw@137	2632	int errors_only = 0;
danw@137	2633
danw@137	2634	tps = trans->packages;
danw@137	2635	pend = trans->packages + trans->package_count;
danw@137	2636	for (p = trans->packages; p < pend; p++) {
danw@137	2637	switch (p->state) {
danw@137	2638	case RAZOR_PACKAGE_INSTALL:
danw@137	2639	if (errors_only)
danw@137	2640	break;
danw@137	2641
danw@147	2642	printf("Installing %s %s", p->name, p->new_version);
danw@145	2643	if (p->dep_package) {
danw@145	2644	if (p->dep_type == RAZOR_PROPERTY_CONFLICTS &&
danw@145	2645	!strcmp(p->dep_package, p->name)) {
danw@147	2646	printf(" because %s %s conflicts with %s",
danw@147	2647	p->name, p->old_version, p->dep_property);
danw@145	2648	if (*p->dep_version) {
danw@145	2649	printf(" %s %s",
danw@145	2650	razor_version_relations[p->dep_relation],
danw@145	2651	p->dep_version);
danw@145	2652	}
danw@145	2653	} else {
danw@145	2654	printf(" for %s", p->dep_package);
danw@145	2655	if (*p->dep_version) {
danw@145	2656	printf(", which %s %s %s %s",
danw@145	2657	razor_property_types[p->dep_type],
danw@145	2658	p->dep_property,
danw@145	2659	razor_version_relations[p->dep_relation],
danw@145	2660	p->dep_version);
danw@145	2661	} else if (strcmp(p->dep_property, p->name) != 0) {
danw@145	2662	printf(", which %s %s",
danw@145	2663	razor_property_types[p->dep_type],
danw@145	2664	p->dep_property);
danw@145	2665	}
danw@137	2666	}
danw@137	2667	}
danw@137	2668	printf("\n");
danw@137	2669	break;
danw@137	2670
danw@154	2671	case RAZOR_PACKAGE_FORCED_UPDATE:
danw@154	2672	if (errors_only)
danw@154	2673	break;
danw@154	2674
danw@154	2675	printf("Updating %s to %s due to update of %s\n",
danw@154	2676	p->name, p->new_version, p->dep_package);
danw@154	2677	break;
danw@154	2678
danw@137	2679	case RAZOR_PACKAGE_REMOVE:
danw@137	2680	if (errors_only)
danw@137	2681	break;
danw@147	2682	printf("Removing %s %s", p->name, p->old_version);
danw@145	2683	if (p->dep_package) {
danw@154	2684	printf(" which required %s",
danw@154	2685	p->dep_package);
danw@154	2686	if (strcmp(p->dep_property, p->name) != 0)
danw@154	2687	printf(" for %s", p->dep_property);
danw@154	2688	}
danw@154	2689	printf("\n");
danw@154	2690	break;
danw@154	2691
danw@154	2692	case RAZOR_PACKAGE_OBSOLETED:
danw@154	2693	if (errors_only)
danw@154	2694	break;
danw@154	2695	printf("Removing %s %s", p->name, p->old_version);
danw@154	2696	if (p->dep_package) {
danw@154	2697	printf(" which is obsoleted by %s",
danw@154	2698	p->dep_package);
danw@137	2699	}
danw@137	2700	printf("\n");
danw@137	2701	break;
danw@137	2702
danw@145	2703	case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:
danw@145	2704	printf("Error: can't install %s: not found\n", p->name);
danw@137	2705	errors_only = 1;
danw@137	2706	break;
danw@137	2707
danw@145	2708	case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:
danw@145	2709	printf("Error: can't remove %s: not installed\n", p->name);
danw@137	2710	errors_only = 1;
danw@137	2711	break;
danw@137	2712
danw@145	2713	case RAZOR_PACKAGE_UP_TO_DATE:
danw@147	2714	printf("Error: can't upgrade %s: %s is most recent version\n", p->name, p->old_version);
danw@145	2715	errors_only = 1;
danw@145	2716	break;
danw@145	2717
danw@145	2718	case RAZOR_PACKAGE_CONTRADICTION:
danw@147	2719	printf("Error: package %s is marked for both installation and removal\n", p->name);
danw@145	2720	errors_only = 1;
danw@145	2721	break;
danw@145	2722
danw@145	2723	case RAZOR_PACKAGE_OLD_CONFLICT:
danw@145	2724	printf("Error: can't install %s, because installed package %s conflicts with ",
danw@145	2725	p->name, p->dep_package);
danw@145	2726	if (*p->dep_version) {
danw@145	2727	printf("%s %s %s",
danw@145	2728	p->dep_property,
danw@145	2729	razor_version_relations[p->dep_relation],
danw@145	2730	p->dep_version);
danw@145	2731	} else
danw@145	2732	printf("it");
danw@145	2733	printf("\n");
danw@145	2734
danw@145	2735	errors_only = 1;
danw@145	2736	break;
danw@145	2737
danw@145	2738	case RAZOR_PACKAGE_NEW_CONFLICT:
danw@145	2739	printf("Error: can't install %s, because it conflicts with %s",
danw@145	2740	p->name, p->dep_package);
danw@145	2741	if (*p->dep_version) {
danw@145	2742	printf(" %s %s",
danw@145	2743	razor_version_relations[p->dep_relation],
danw@145	2744	p->dep_version);
danw@145	2745	}
danw@145	2746	printf("\n");
danw@145	2747
danw@145	2748	errors_only = 1;
danw@145	2749	break;
danw@145	2750
danw@145	2751	case RAZOR_PACKAGE_UNSATISFIABLE:
danw@145	2752	printf("Error: can't find package for %s", p->dep_property);
danw@145	2753	if (*p->dep_version) {
danw@145	2754	printf(" %s %s",
danw@145	2755	razor_version_relations[p->dep_relation],
danw@145	2756	p->dep_version);
danw@145	2757	}
danw@145	2758	printf(" which is required by %s\n",
danw@145	2759	p->dep_package);
danw@140	2760	errors_only = 1;
danw@140	2761	break;
danw@140	2762
danw@137	2763	default:
danw@137	2764	/* Shouldn't actually happen */
danw@137	2765	break;
danw@137	2766	}
danw@137	2767	}
danw@137	2768	}
danw@137	2769
danw@137	2770	struct razor_set *
danw@137	2771	razor_transaction_run(struct razor_transaction *trans)
danw@137	2772	{
danw@137	2773	struct array install_packages, remove_packages;
danw@137	2774	struct razor_merger *merger;
danw@137	2775	struct razor_package pkg, i, iend, r, rend, s, *send;
danw@137	2776	struct source source1, source2;
danw@137	2777	char spool, ipool, *rpool;
danw@137	2778	uint32_t *map;
danw@137	2779	int p, cmp;
danw@137	2780
danw@137	2781	/* FIXME */
danw@137	2782	if (trans->errors)
danw@137	2783	return NULL;
danw@137	2784
danw@137	2785	/* Sort the transaction packages into two arrays */
danw@137	2786	array_init(&install_packages);
danw@137	2787	array_init(&remove_packages);
danw@137	2788	for (p = 0; p < trans->package_count; p++) {
danw@160	2789	if (trans->packages[p].new_package) {
danw@137	2790	pkg = array_add(&install_packages, sizeof *pkg);
danw@147	2791	pkg = trans->packages[p].new_package;
danw@147	2792	} else {
danw@137	2793	pkg = array_add(&remove_packages, sizeof *pkg);
danw@147	2794	pkg = trans->packages[p].old_package;
danw@147	2795	}
danw@137	2796	}
danw@137	2797	map = qsort_with_data(install_packages.data,
danw@137	2798	install_packages.size / sizeof *pkg,
danw@137	2799	sizeof *pkg,
danw@137	2800	compare_packages,
danw@137	2801	trans->upstream);
danw@137	2802	free(map);
danw@137	2803	map = qsort_with_data(remove_packages.data,
danw@137	2804	remove_packages.size / sizeof *pkg,
danw@137	2805	sizeof *pkg,
danw@137	2806	compare_packages,
danw@137	2807	trans->system);
danw@137	2808	free(map);
danw@137	2809
danw@137	2810	merger = razor_merger_create(trans->system, trans->upstream);
danw@137	2811
danw@137	2812	source1 = &merger->source1;
danw@137	2813	source2 = &merger->source2;
danw@137	2814
danw@137	2815	i = install_packages.data;
danw@137	2816	iend = install_packages.data + install_packages.size;
danw@137	2817	ipool = trans->upstream->string_pool.data;
danw@137	2818
danw@137	2819	r = remove_packages.data;
danw@137	2820	rend = remove_packages.data + remove_packages.size;
danw@137	2821	rpool = trans->system->string_pool.data;
danw@137	2822
danw@137	2823	s = trans->system->packages.data;
danw@137	2824	send = trans->system->packages.data + trans->system->packages.size;
danw@137	2825	spool = trans->system->string_pool.data;
danw@137	2826
danw@137	2827	while (s < send \|\| i < iend) {
danw@137	2828	/* Check if s is being removed */
danw@137	2829	if (s < send && r < rend &&
danw@137	2830	s->name == r->name && s->version && r->version) {
danw@137	2831	s++;
danw@137	2832	r++;
danw@137	2833	continue;
danw@137	2834	}
danw@137	2835
danw@137	2836	if (s < send && i < iend)
danw@137	2837	cmp = strcmp(&spool[s->name], &ipool[i->name]);
danw@137	2838	else if (s < send)
danw@137	2839	cmp = -1;
danw@137	2840	else
danw@137	2841	cmp = 1;
danw@137	2842	if (cmp < 0) {
danw@137	2843	add_package(merger, s, source1, 0);
danw@137	2844	s++;
danw@137	2845	} else if (cmp == 0) {
danw@137	2846	add_package(merger, i, source2, UPSTREAM_SOURCE);
danw@137	2847	s++;
danw@137	2848	i++;
danw@137	2849	} else {
danw@137	2850	add_package(merger, i, source2, UPSTREAM_SOURCE);
danw@137	2851	i++;
danw@137	2852	}
danw@137	2853	}
danw@137	2854
danw@137	2855	array_release(&install_packages);
danw@137	2856	array_release(&remove_packages);
danw@137	2857
danw@137	2858	return razor_merger_finish(merger);
danw@137	2859	}
danw@137	2860
danw@137	2861	void
danw@137	2862	razor_transaction_destroy(struct razor_transaction *trans)
danw@137	2863	{
danw@137	2864	int p;
danw@137	2865
danw@137	2866	for (p = 0; p < trans->package_count; p++) {
danw@145	2867	if (!trans->packages[p].dep_package &&
danw@137	2868	(trans->packages[p].state == RAZOR_PACKAGE_INSTALL_UNAVAILABLE \|\|
danw@137	2869	trans->packages[p].state == RAZOR_PACKAGE_REMOVE_NOT_INSTALLED))
danw@137	2870	free((char *)trans->packages[p].name);
danw@137	2871	}
danw@137	2872	free(trans);
danw@137	2873
danw@137	2874	/* FIXME: free upstream if it was created as an empty set */
danw@137	2875	}

author	Dan Winship <danw@gnome.org>
	Tue Mar 11 11:43:54 2008 -0400 (2008-03-11)
changeset 160	00f19df51272
parent 159	9307d0e0b44f
child 162	9170be6cebf0
permissions	-rw-r--r--