razor: razor.c@978c98ddb8aa (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@162	55	enum razor_property_type type : 2;
danw@162	56	enum razor_version_relation relation : 32;
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@163	756	struct array pkgprops;
danw@163	757	struct list *pkg;
danw@163	758	uint32_t req, req_start, *req_end;
danw@163	759	uint32_t map, newprop;
danw@159	760	char *pool;
danw@159	761
danw@159	762	pool = importer->set->string_pool.data;
danw@159	763	packages = importer->set->packages.data;
danw@159	764	top = importer->set->files.data;
danw@159	765
danw@159	766	req = req_start = importer->file_requires.data;
danw@159	767	req_end = importer->file_requires.data + importer->file_requires.size;
danw@159	768	map = qsort_with_data(req, req_end - req, sizeof *req,
danw@159	769	compare_file_requires, pool);
danw@159	770	free(map);
danw@159	771
danw@159	772	for (req = req_start; req < req_end; req++) {
danw@159	773	if (req > req_start && req[0] == req[-1])
danw@159	774	continue;
danw@159	775	entry = find_entry(importer->set, top, &pool[*req]);
danw@163	776	if (!entry)
danw@163	777	continue;
danw@163	778
danw@163	779	for (pkg = list_first(&entry->packages, &importer->set->package_pool); pkg; pkg = list_next(pkg)) {
danw@159	780	prop = array_add(&importer->set->properties, sizeof *prop);
danw@159	781	prop->name = *req;
danw@159	782	prop->type = RAZOR_PROPERTY_PROVIDES;
danw@159	783	prop->relation = RAZOR_VERSION_EQUAL;
danw@159	784	prop->version = hashtable_tokenize(&importer->table, "");
danw@163	785	list_set_ptr(&prop->packages, pkg->data);
danw@163	786
danw@163	787	/* Update property list of pkg */
danw@163	788	array_init(&pkgprops);
danw@163	789	list_to_array(list_first(&packages[pkg->data].properties, &importer->set->property_pool), &pkgprops);
danw@163	790	newprop = array_add(&pkgprops, sizeof *newprop);
danw@163	791	newprop = prop - (struct razor_property )importer->set->properties.data;
danw@163	792	list_set_array(&packages[pkg->data].properties, &importer->set->property_pool, &pkgprops, 1);
danw@163	793	array_release(&pkgprops);
danw@159	794	}
danw@159	795	}
danw@159	796
danw@159	797	array_release(&importer->file_requires);
danw@159	798	}
danw@159	799
krh@56	800	static void
danw@108	801	build_package_file_lists(struct razor_set set, uint32_t rmap)
krh@54	802	{
krh@56	803	struct razor_package p, packages;
krh@56	804	struct array *pkgs;
krh@54	805	struct razor_entry e, end;
danw@117	806	struct list *r;
danw@117	807	uint32_t *q;
krh@56	808	int i, count;
krh@54	809
krh@56	810	count = set->packages.size / sizeof *p;
krh@56	811	pkgs = zalloc(count * sizeof *pkgs);
krh@54	812
krh@56	813	end = set->files.data + set->files.size;
krh@92	814	for (e = set->files.data; e < end; e++) {
danw@117	815	list_remap_head(&e->packages, rmap);
danw@116	816	r = list_first(&e->packages, &set->package_pool);
danw@116	817	while (r) {
danw@117	818	q = array_add(&pkgs[r->data], sizeof *q);
krh@56	819	q = e - (struct razor_entry ) set->files.data;
danw@116	820	r = list_next(r);
krh@54	821	}
krh@54	822	}
krh@54	823
krh@56	824	packages = set->packages.data;
krh@56	825	for (i = 0; i < count; i++) {
danw@124	826	list_set_array(&packages[i].files, &set->file_pool, &pkgs[i], 0);
krh@56	827	array_release(&pkgs[i]);
krh@48	828	}
krh@56	829	free(pkgs);
krh@52	830	}
krh@52	831
krh@27	832	struct razor_set *
krh@30	833	razor_importer_finish(struct razor_importer *importer)
krh@9	834	{
krh@30	835	struct razor_set *set;
danw@108	836	uint32_t map, rmap;
krh@39	837	int i, count;
krh@18	838
danw@159	839	build_file_tree(importer);
danw@159	840	find_file_provides(importer);
danw@159	841
krh@66	842	map = uniqueify_properties(importer->set);
danw@116	843	list_remap_pool(&importer->set->property_pool, map);
krh@39	844	free(map);
krh@25	845
krh@30	846	count = importer->set->packages.size / sizeof(struct razor_package);
krh@30	847	map = qsort_with_data(importer->set->packages.data,
krh@25	848	count,
krh@25	849	sizeof(struct razor_package),
krh@25	850	compare_packages,
krh@30	851	importer->set);
krh@39	852
krh@39	853	rmap = malloc(count * sizeof *rmap);
krh@39	854	for (i = 0; i < count; i++)
krh@39	855	rmap[map[i]] = i;
krh@25	856	free(map);
krh@13	857
danw@116	858	list_remap_pool(&importer->set->package_pool, rmap);
krh@60	859	build_package_file_lists(importer->set, rmap);
krh@66	860	remap_property_package_links(&importer->set->properties, rmap);
krh@52	861	free(rmap);
krh@48	862
krh@30	863	set = importer->set;
krh@78	864	hashtable_release(&importer->table);
krh@30	865	free(importer);
krh@30	866
krh@30	867	return set;
krh@9	868	}
krh@9	869
krh@92	870	struct razor_package_iterator {
krh@92	871	struct razor_set *set;
krh@92	872	struct razor_package package, end;
danw@117	873	struct list *index;
krh@92	874	};
krh@92	875
danw@137	876	static struct razor_package_iterator *
krh@101	877	razor_package_iterator_create_with_index(struct razor_set *set,
danw@117	878	struct list *index)
krh@3	879	{
krh@92	880	struct razor_package_iterator *pi;
krh@92	881
krh@92	882	pi = zalloc(sizeof *pi);
krh@92	883	pi->set = set;
krh@101	884	pi->index = index;
krh@92	885
krh@92	886	return pi;
krh@92	887	}
krh@92	888
krh@101	889	struct razor_package_iterator *
krh@101	890	razor_package_iterator_create(struct razor_set *set)
krh@101	891	{
danw@116	892	struct razor_package_iterator *pi;
danw@116	893
danw@116	894	pi = zalloc(sizeof *pi);
danw@116	895	pi->set = set;
danw@116	896	pi->end = set->packages.data + set->packages.size;
danw@116	897	pi->package = set->packages.data;
danw@116	898
danw@116	899	return pi;
krh@101	900	}
krh@101	901
krh@101	902	struct razor_package_iterator *
krh@101	903	razor_package_iterator_create_for_property(struct razor_set *set,
krh@101	904	struct razor_property *property)
krh@101	905	{
danw@117	906	struct list *index;
krh@101	907
danw@116	908	index = list_first(&property->packages, &set->package_pool);
krh@101	909	return razor_package_iterator_create_with_index(set, index);
krh@101	910	}
krh@101	911
krh@92	912	int
krh@92	913	razor_package_iterator_next(struct razor_package_iterator *pi,
krh@92	914	struct razor_package **package,
krh@92	915	const char name, const char version)
krh@92	916	{
krh@6	917	char *pool;
krh@101	918	int valid;
krh@101	919	struct razor_package p, packages;
krh@3	920
danw@116	921	if (pi->package) {
krh@101	922	p = pi->package++;
krh@101	923	valid = p < pi->end;
danw@116	924	} else if (pi->index) {
danw@116	925	packages = pi->set->packages.data;
danw@117	926	p = &packages[pi->index->data];
danw@116	927	pi->index = list_next(pi->index);
danw@116	928	valid = 1;
danw@116	929	} else
danw@116	930	valid = 0;
krh@92	931
krh@101	932	if (valid) {
krh@101	933	pool = pi->set->string_pool.data;
krh@101	934	*package = p;
danw@120	935	*name = &pool[p->name];
krh@101	936	*version = &pool[p->version];
krh@101	937	} else {
krh@101	938	*package = NULL;
krh@101	939	}
krh@101	940
krh@101	941	return valid;
krh@92	942	}
krh@92	943
krh@92	944	void
krh@92	945	razor_package_iterator_destroy(struct razor_package_iterator *pi)
krh@92	946	{
krh@92	947	free(pi);
krh@3	948	}
krh@3	949
krh@10	950	struct razor_package *
krh@10	951	razor_set_get_package(struct razor_set set, const char package)
krh@10	952	{
krh@97	953	struct razor_package_iterator *pi;
krh@97	954	struct razor_package *p;
krh@97	955	const char name, version;
krh@97	956
krh@97	957	pi = razor_package_iterator_create(set);
krh@97	958	while (razor_package_iterator_next(pi, &p, &name, &version)) {
krh@97	959	if (strcmp(package, name) == 0)
krh@97	960	break;
krh@97	961	}
krh@97	962	razor_package_iterator_destroy(pi);
krh@97	963
krh@97	964	return p;
krh@10	965	}
krh@10	966
krh@92	967	struct razor_property_iterator {
krh@92	968	struct razor_set *set;
krh@92	969	struct razor_property property, end;
danw@117	970	struct list *index;
krh@92	971	};
krh@92	972
krh@92	973	struct razor_property_iterator *
krh@92	974	razor_property_iterator_create(struct razor_set *set,
krh@92	975	struct razor_package *package)
krh@92	976	{
krh@92	977	struct razor_property_iterator *pi;
krh@92	978
krh@92	979	pi = zalloc(sizeof *pi);
krh@92	980	pi->set = set;
krh@98	981
danw@116	982	if (package) {
danw@117	983	pi->index = list_first(&package->properties,
danw@117	984	&set->property_pool);
danw@116	985	} else {
danw@116	986	pi->property = set->properties.data;
danw@116	987	pi->end = set->properties.data + set->properties.size;
danw@116	988	}
krh@92	989
krh@92	990	return pi;
krh@92	991	}
krh@92	992
krh@92	993	int
krh@92	994	razor_property_iterator_next(struct razor_property_iterator *pi,
krh@92	995	struct razor_property **property,
danw@109	996	const char **name,
danw@109	997	enum razor_version_relation *relation,
danw@109	998	const char **version,
krh@92	999	enum razor_property_type *type)
krh@92	1000	{
krh@92	1001	char *pool;
krh@92	1002	int valid;
krh@92	1003	struct razor_property p, properties;
krh@92	1004
danw@116	1005	if (pi->property) {
krh@92	1006	p = pi->property++;
krh@92	1007	valid = p < pi->end;
danw@116	1008	} else if (pi->index) {
danw@116	1009	properties = pi->set->properties.data;
danw@117	1010	p = &properties[pi->index->data];
danw@116	1011	pi->index = list_next(pi->index);
danw@116	1012	valid = 1;
danw@116	1013	} else
danw@116	1014	valid = 0;
krh@92	1015
krh@96	1016	if (valid) {
krh@96	1017	pool = pi->set->string_pool.data;
krh@96	1018	*property = p;
danw@119	1019	*name = &pool[p->name];
danw@109	1020	*relation = p->relation;
krh@96	1021	*version = &pool[p->version];
danw@119	1022	*type = p->type;
krh@96	1023	} else {
krh@96	1024	*property = NULL;
krh@96	1025	}
krh@92	1026
krh@92	1027	return valid;
krh@92	1028	}
krh@92	1029
krh@66	1030	void
krh@92	1031	razor_property_iterator_destroy(struct razor_property_iterator *pi)
krh@8	1032	{
krh@92	1033	free(pi);
krh@10	1034	}
krh@10	1035
krh@56	1036	static struct razor_entry *
krh@56	1037	find_entry(struct razor_set set, struct razor_entry dir, const char *pattern)
krh@56	1038	{
krh@56	1039	struct razor_entry *e;
krh@56	1040	const char n, pool = set->string_pool.data;
krh@56	1041	int len;
krh@56	1042
krh@56	1043	e = (struct razor_entry *) set->files.data + dir->start;
krh@56	1044	do {
danw@120	1045	n = pool + e->name;
krh@56	1046	if (strcmp(pattern + 1, n) == 0)
krh@56	1047	return e;
krh@57	1048	len = strlen(n);
krh@56	1049	if (e->start != 0 && strncmp(pattern + 1, n, len) == 0 &&
krh@56	1050	pattern[len + 1] == '/') {
krh@56	1051	return find_entry(set, e, pattern + len + 1);
krh@56	1052	}
danw@120	1053	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56	1054
krh@56	1055	return NULL;
krh@56	1056	}
krh@56	1057
krh@56	1058	static void
krh@56	1059	list_dir(struct razor_set set, struct razor_entry dir,
danw@127	1060	char prefix, const char pattern)
krh@56	1061	{
krh@56	1062	struct razor_entry *e;
krh@56	1063	const char n, pool = set->string_pool.data;
krh@56	1064
krh@56	1065	e = (struct razor_entry *) set->files.data + dir->start;
krh@56	1066	do {
danw@120	1067	n = pool + e->name;
krh@56	1068	if (pattern && pattern[0] && fnmatch(pattern, n, 0) != 0)
krh@56	1069	continue;
danw@127	1070	printf("%s/%s\n", prefix, n);
danw@127	1071	if (e->start) {
danw@127	1072	char *sub = prefix + strlen (prefix);
danw@127	1073	*sub = '/';
danw@127	1074	strcpy (sub + 1, n);
danw@127	1075	list_dir(set, e, prefix, pattern);
danw@127	1076	*sub = '\0';
danw@127	1077	}
danw@120	1078	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56	1079	}
krh@56	1080
krh@56	1081	void
krh@56	1082	razor_set_list_files(struct razor_set set, const char pattern)
krh@56	1083	{
krh@56	1084	struct razor_entry *e;
krh@56	1085	char buffer[512], p, base;
krh@56	1086
danw@127	1087	if (pattern == NULL \|\| !strcmp (pattern, "/")) {
danw@127	1088	buffer[0] = '\0';
danw@127	1089	list_dir(set, set->files.data, buffer, NULL);
danw@127	1090	return;
danw@127	1091	}
krh@56	1092
krh@56	1093	strcpy(buffer, pattern);
krh@56	1094	e = find_entry(set, set->files.data, buffer);
krh@56	1095	if (e && e->start > 0) {
krh@56	1096	base = NULL;
krh@56	1097	} else {
krh@56	1098	p = strrchr(buffer, '/');
krh@56	1099	if (p) {
krh@56	1100	*p = '\0';
krh@56	1101	base = p + 1;
krh@56	1102	} else {
krh@56	1103	base = NULL;
krh@56	1104	}
krh@56	1105	}
krh@56	1106	e = find_entry(set, set->files.data, buffer);
krh@56	1107	if (e->start != 0)
krh@56	1108	list_dir(set, e, buffer, base);
krh@56	1109	}
krh@56	1110
krh@102	1111	struct razor_package_iterator *
krh@102	1112	razor_package_iterator_create_for_file(struct razor_set *set,
krh@102	1113	const char *filename)
krh@56	1114	{
krh@102	1115	struct razor_entry *entry;
danw@117	1116	struct list *index;
krh@56	1117
krh@102	1118	entry = find_entry(set, set->files.data, filename);
krh@102	1119	if (entry == NULL)
krh@102	1120	return NULL;
krh@56	1121
danw@116	1122	index = list_first(&entry->packages, &set->package_pool);
krh@102	1123	return razor_package_iterator_create_with_index(set, index);
krh@56	1124	}
krh@56	1125
danw@117	1126	static struct list *
danw@117	1127	list_package_files(struct razor_set set, struct list r,
danw@108	1128	struct razor_entry *dir, uint32_t end,
krh@56	1129	char *prefix)
krh@56	1130	{
krh@56	1131	struct razor_entry e, f, *entries;
danw@108	1132	uint32_t next, file;
krh@56	1133	char *pool;
krh@56	1134	int len;
krh@56	1135
krh@56	1136	entries = (struct razor_entry *) set->files.data;
krh@56	1137	pool = set->string_pool.data;
krh@56	1138
krh@56	1139	e = entries + dir->start;
krh@56	1140	do {
danw@117	1141	if (entries + r->data == e) {
danw@120	1142	printf("%s/%s\n", prefix, pool + e->name);
danw@116	1143	r = list_next(r);
danw@116	1144	if (!r)
krh@83	1145	return NULL;
danw@117	1146	if (r->data >= end)
krh@83	1147	return r;
krh@56	1148	}
danw@120	1149	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56	1150
krh@56	1151	e = entries + dir->start;
krh@56	1152	do {
krh@56	1153	if (e->start == 0)
krh@56	1154	continue;
krh@56	1155
danw@120	1156	if (e->flags & RAZOR_ENTRY_LAST)
krh@56	1157	next = end;
krh@56	1158	else {
krh@56	1159	f = e + 1;
danw@120	1160	while (f->start == 0 && !(f->flags & RAZOR_ENTRY_LAST))
krh@56	1161	f++;
krh@56	1162	if (f->start == 0)
krh@56	1163	next = end;
krh@56	1164	else
krh@56	1165	next = f->start;
krh@56	1166	}
krh@56	1167
danw@117	1168	file = r->data;
krh@83	1169	if (e->start <= file && file < next) {
krh@56	1170	len = strlen(prefix);
krh@56	1171	prefix[len] = '/';
danw@120	1172	strcpy(prefix + len + 1, pool + e->name);
krh@56	1173	r = list_package_files(set, r, e, next, prefix);
krh@56	1174	prefix[len] = '\0';
krh@56	1175	}
danw@120	1176	} while (!((e++)->flags & RAZOR_ENTRY_LAST) && r != NULL);
krh@56	1177
krh@56	1178	return r;
krh@56	1179	}
krh@56	1180
krh@56	1181	void
krh@56	1182	razor_set_list_package_files(struct razor_set set, const char name)
krh@56	1183	{
krh@56	1184	struct razor_package *package;
danw@117	1185	struct list *r;
danw@117	1186	uint32_t end;
krh@56	1187	char buffer[512];
krh@56	1188
krh@56	1189	package = razor_set_get_package(set, name);
krh@56	1190
danw@116	1191	r = list_first(&package->files, &set->file_pool);
krh@56	1192	end = set->files.size / sizeof (struct razor_entry);
krh@56	1193	buffer[0] = '\0';
krh@56	1194	list_package_files(set, r, set->files.data, end, buffer);
krh@56	1195	}
krh@56	1196
krh@43	1197	static void
krh@21	1198	razor_set_validate(struct razor_set set, struct array unsatisfied)
krh@21	1199	{
krh@66	1200	struct razor_property r, p, *end;
danw@108	1201	uint32_t *u;
krh@21	1202	char *pool;
krh@21	1203
krh@66	1204	end = set->properties.data + set->properties.size;
krh@21	1205	pool = set->string_pool.data;
krh@21	1206
krh@66	1207	for (r = set->properties.data, p = r; r < end; r++) {
danw@119	1208	if (r->type != RAZOR_PROPERTY_REQUIRES)
krh@66	1209	continue;
krh@66	1210
danw@129	1211	p = r;
danw@129	1212	while (p < end && p->name == r->name &&
danw@129	1213	p->type == r->type)
danw@129	1214	p++;
krh@37	1215
krh@35	1216	/* If there is more than one version of a provides,
krh@35	1217	* seek to the end for the highest version. */
krh@66	1218	/* FIXME: This doesn't work if we have a series of
krh@66	1219	* requires a = 1, provides a = 1, requires a = 2,
krh@66	1220	* provides a = 2, as the kernel and kernel-devel
krh@66	1221	* does.*/
danw@119	1222	while (p + 1 < end && p->name == (p + 1)->name &&
danw@119	1223	p->type == (p + 1)->type)
krh@35	1224	p++;
krh@37	1225
krh@37	1226	/* FIXME: We need to track property flags (<, <=, =
krh@37	1227	* etc) to properly determine if a requires is
krh@37	1228	* satisfied. The current code doesn't track that the
krh@37	1229	* requires a = 1 isn't satisfied by a = 2 provides. */
krh@37	1230
krh@66	1231	if (p == end \|\|
danw@119	1232	p->type != RAZOR_PROPERTY_PROVIDES \|\|
danw@119	1233	r->name != p->name \|\|
krh@35	1234	versioncmp(&pool[r->version], &pool[p->version]) > 0) {
krh@35	1235	/* FIXME: We ignore file requires for now. */
danw@119	1236	if (pool[r->name] == '/')
krh@35	1237	continue;
krh@21	1238	u = array_add(unsatisfied, sizeof *u);
krh@66	1239	u = r - (struct razor_property ) set->properties.data;
krh@21	1240	}
krh@21	1241	}
krh@21	1242	}
krh@21	1243
krh@21	1244	void
krh@21	1245	razor_set_list_unsatisfied(struct razor_set *set)
krh@21	1246	{
krh@21	1247	struct array unsatisfied;
krh@66	1248	struct razor_property properties, r;
danw@108	1249	uint32_t u, end;
krh@21	1250	char *pool;
krh@21	1251
krh@21	1252	array_init(&unsatisfied);
krh@21	1253	razor_set_validate(set, &unsatisfied);
krh@21	1254
krh@21	1255	end = unsatisfied.data + unsatisfied.size;
krh@66	1256	properties = set->properties.data;
krh@21	1257	pool = set->string_pool.data;
krh@21	1258
krh@21	1259	for (u = unsatisfied.data; u < end; u++) {
krh@66	1260	r = properties + *u;
krh@66	1261	if (pool[r->version] == '\0')
krh@66	1262	printf("%ss not satisfied\n",
danw@119	1263	&pool[r->name]);
krh@66	1264	else
krh@66	1265	printf("%s-%s not satisfied\n",
danw@119	1266	&pool[r->name],
krh@66	1267	&pool[r->version]);
krh@21	1268	}
krh@21	1269
krh@21	1270	array_release(&unsatisfied);
krh@21	1271	}
krh@21	1272
danw@120	1273	#define UPSTREAM_SOURCE 0x80
krh@41	1274
krh@41	1275	struct source {
krh@41	1276	struct razor_set *set;
danw@108	1277	uint32_t *property_map;
danw@127	1278	uint32_t *file_map;
krh@41	1279	};
krh@41	1280
krh@79	1281	struct razor_merger {
krh@79	1282	struct razor_set *set;
krh@79	1283	struct hashtable table;
krh@79	1284	struct source source1;
krh@79	1285	struct source source2;
krh@79	1286	};
krh@79	1287
krh@79	1288	static struct razor_merger *
krh@79	1289	razor_merger_create(struct razor_set set1, struct razor_set set2)
krh@41	1290	{
krh@79	1291	struct razor_merger *merger;
krh@41	1292	int count;
krh@41	1293	size_t size;
krh@41	1294
krh@79	1295	merger = zalloc(sizeof *merger);
krh@79	1296	merger->set = razor_set_create();
krh@79	1297	hashtable_init(&merger->table, &merger->set->string_pool);
krh@41	1298
danw@127	1299	merger->source1.set = set1;
krh@79	1300	count = set1->properties.size / sizeof (struct razor_property);
krh@79	1301	size = count * sizeof merger->source1.property_map[0];
krh@79	1302	merger->source1.property_map = zalloc(size);
danw@127	1303	count = set1->files.size / sizeof (struct razor_entry);
danw@127	1304	size = count * sizeof merger->source1.file_map[0];
danw@127	1305	merger->source1.file_map = zalloc(size);
krh@79	1306
danw@127	1307	merger->source2.set = set2;
krh@79	1308	count = set2->properties.size / sizeof (struct razor_property);
krh@79	1309	size = count * sizeof merger->source2.property_map[0];
krh@79	1310	merger->source2.property_map = zalloc(size);
danw@127	1311	count = set2->files.size / sizeof (struct razor_entry);
danw@127	1312	size = count * sizeof merger->source2.file_map[0];
danw@127	1313	merger->source2.file_map = zalloc(size);
krh@79	1314
krh@79	1315	return merger;
krh@41	1316	}
krh@41	1317
krh@33	1318	static void
krh@79	1319	add_package(struct razor_merger *merger,
krh@41	1320	struct razor_package package, struct source source,
danw@108	1321	uint32_t flags)
krh@33	1322	{
krh@33	1323	char *pool;
danw@117	1324	struct list *r;
krh@41	1325	struct razor_package *p;
krh@33	1326
krh@41	1327	pool = source->set->string_pool.data;
krh@79	1328	p = array_add(&merger->set->packages, sizeof *p);
krh@79	1329	p->name = hashtable_tokenize(&merger->table, &pool[package->name]);
danw@120	1330	p->flags = flags;
krh@79	1331	p->version = hashtable_tokenize(&merger->table,
krh@79	1332	&pool[package->version]);
danw@127	1333
krh@66	1334	p->properties = package->properties;
danw@116	1335	r = list_first(&package->properties, &source->set->property_pool);
danw@116	1336	while (r) {
danw@117	1337	source->property_map[r->data] = 1;
danw@116	1338	r = list_next(r);
krh@64	1339	}
danw@127	1340
danw@127	1341	p->files = package->files;
danw@127	1342	r = list_first(&package->files, &source->set->file_pool);
danw@127	1343	while (r) {
danw@127	1344	source->file_map[r->data] = 1;
danw@127	1345	r = list_next(r);
danw@127	1346	}
krh@41	1347	}
krh@41	1348
danw@108	1349	static uint32_t
krh@79	1350	add_property(struct razor_merger *merger,
danw@109	1351	const char *name, enum razor_version_relation relation,
danw@109	1352	const char *version, int type)
krh@41	1353	{
krh@41	1354	struct razor_property *p;
krh@41	1355
krh@79	1356	p = array_add(&merger->set->properties, sizeof *p);
danw@119	1357	p->name = hashtable_tokenize(&merger->table, name);
danw@119	1358	p->flags = 0;
danw@119	1359	p->type = type;
danw@109	1360	p->relation = relation;
krh@79	1361	p->version = hashtable_tokenize(&merger->table, version);
krh@41	1362
krh@79	1363	return p - (struct razor_property *) merger->set->properties.data;
krh@41	1364	}
krh@41	1365
krh@41	1366	static void
krh@79	1367	merge_properties(struct razor_merger *merger)
krh@41	1368	{
krh@41	1369	struct razor_property p1, p2;
krh@79	1370	struct razor_set set1, set2;
danw@108	1371	uint32_t map1, map2;
krh@41	1372	int i, j, cmp, count1, count2;
krh@41	1373	char pool1, pool2;
krh@41	1374
krh@79	1375	set1 = merger->source1.set;
krh@79	1376	set2 = merger->source2.set;
krh@79	1377	map1 = merger->source1.property_map;
krh@79	1378	map2 = merger->source2.property_map;
krh@79	1379
krh@41	1380	i = 0;
krh@41	1381	j = 0;
krh@41	1382	pool1 = set1->string_pool.data;
krh@41	1383	pool2 = set2->string_pool.data;
krh@41	1384
krh@66	1385	count1 = set1->properties.size / sizeof *p1;
krh@66	1386	count2 = set2->properties.size / sizeof *p2;
krh@41	1387	while (i < count1 \|\| j < count2) {
krh@41	1388	if (i < count1 && map1[i] == 0) {
krh@41	1389	i++;
krh@41	1390	continue;
krh@41	1391	}
krh@41	1392	if (j < count2 && map2[j] == 0) {
krh@41	1393	j++;
krh@41	1394	continue;
krh@41	1395	}
krh@66	1396	p1 = (struct razor_property *) set1->properties.data + i;
krh@66	1397	p2 = (struct razor_property *) set2->properties.data + j;
krh@41	1398	if (i < count1 && j < count2)
danw@119	1399	cmp = strcmp(&pool1[p1->name], &pool2[p2->name]);
krh@41	1400	else if (i < count1)
krh@41	1401	cmp = -1;
krh@41	1402	else
krh@41	1403	cmp = 1;
krh@41	1404	if (cmp == 0)
danw@121	1405	cmp = p1->type - p2->type;
danw@121	1406	if (cmp == 0)
danw@109	1407	cmp = p1->relation - p2->relation;
danw@109	1408	if (cmp == 0)
krh@41	1409	cmp = versioncmp(&pool1[p1->version],
krh@41	1410	&pool2[p2->version]);
krh@41	1411	if (cmp < 0) {
krh@79	1412	map1[i++] = add_property(merger,
danw@119	1413	&pool1[p1->name],
danw@109	1414	p1->relation,
krh@69	1415	&pool1[p1->version],
danw@119	1416	p1->type);
krh@41	1417	} else if (cmp > 0) {
krh@79	1418	map2[j++] = add_property(merger,
danw@119	1419	&pool2[p2->name],
danw@109	1420	p2->relation,
krh@69	1421	&pool2[p2->version],
danw@119	1422	p2->type);
krh@41	1423	} else {
krh@79	1424	map1[i++] = map2[j++] = add_property(merger,
danw@119	1425	&pool1[p1->name],
danw@109	1426	p1->relation,
krh@69	1427	&pool1[p1->version],
danw@119	1428	p1->type);
krh@41	1429	}
krh@41	1430	}
krh@41	1431	}
krh@41	1432
danw@116	1433	static void
danw@117	1434	emit_properties(struct list_head properties, struct array source_pool,
danw@108	1435	uint32_t map, struct array pool)
krh@41	1436	{
danw@117	1437	uint32_t r;
danw@117	1438	struct list p, q;
krh@41	1439
krh@41	1440	r = pool->size / sizeof *q;
danw@116	1441	p = list_first(properties, source_pool);
danw@116	1442	while (p) {
krh@41	1443	q = array_add(pool, sizeof *q);
danw@117	1444	q->data = map[p->data];
danw@117	1445	q->flags = p->flags;
danw@116	1446	p = list_next(p);
krh@33	1447	}
krh@33	1448
danw@117	1449	list_set_ptr(properties, r);
krh@41	1450	}
danw@127	1451
danw@127	1452	static uint32_t
danw@127	1453	add_file(struct razor_merger merger, const char name)
danw@127	1454	{
danw@127	1455	struct razor_entry *e;
danw@127	1456
danw@127	1457	e = array_add(&merger->set->files, sizeof *e);
danw@127	1458	e->name = hashtable_tokenize(&merger->table, name);
danw@127	1459	e->flags = 0;
danw@127	1460	e->start = 0;
danw@127	1461
danw@127	1462	return e - (struct razor_entry *)merger->set->files.data;
danw@127	1463	}
danw@127	1464
danw@129	1465	/* FIXME. Blah */
danw@127	1466	static int
danw@127	1467	fix_file_map(uint32_t *map,
danw@127	1468	struct razor_entry *files,
danw@127	1469	struct razor_entry *top)
danw@127	1470	{
danw@127	1471	uint32_t e;
danw@127	1472	int found_file = 0;
danw@127	1473
danw@127	1474	e = top->start;
danw@127	1475	do {
danw@127	1476	if (files[e].start)
danw@127	1477	fix_file_map(map, files, &files[e]);
danw@127	1478	if (map[e])
danw@127	1479	found_file = 1;
danw@127	1480	} while (!(files[e++].flags & RAZOR_ENTRY_LAST));
danw@127	1481
danw@127	1482	if (found_file)
danw@127	1483	map[top - files] = 1;
danw@127	1484	return found_file;
danw@127	1485	}
danw@127	1486
danw@127	1487	struct merge_directory {
danw@127	1488	uint32_t merged, dir1, dir2;
danw@127	1489	};
danw@127	1490
danw@127	1491	static void
danw@127	1492	merge_one_directory(struct razor_merger merger, struct merge_directory md)
danw@127	1493	{
danw@127	1494	struct razor_entry root1, root2, mroot, e1, *e2;
danw@127	1495	struct razor_set set1, set2;
danw@127	1496	struct array merge_stack;
danw@127	1497	struct merge_directory child_md, end_md;
danw@127	1498	uint32_t map1, map2, start, last;
danw@127	1499	int cmp;
danw@127	1500	char pool1, pool2;
danw@127	1501
danw@127	1502	set1 = merger->source1.set;
danw@127	1503	set2 = merger->source2.set;
danw@127	1504	map1 = merger->source1.file_map;
danw@127	1505	map2 = merger->source2.file_map;
danw@127	1506	pool1 = set1->string_pool.data;
danw@127	1507	pool2 = set2->string_pool.data;
danw@127	1508	root1 = (struct razor_entry *) set1->files.data;
danw@127	1509	root2 = (struct razor_entry *) set2->files.data;
danw@127	1510
danw@127	1511	array_init(&merge_stack);
danw@127	1512
danw@127	1513	start = merger->set->files.size / sizeof (struct razor_entry);
danw@127	1514	last = 0;
danw@127	1515	e1 = md->dir1 ? root1 + md->dir1 : NULL;
danw@127	1516	e2 = md->dir2 ? root2 + md->dir2 : NULL;
danw@127	1517	while (e1 \|\| e2) {
danw@127	1518	if (!e2 && !map1[e1 - root1]) {
danw@127	1519	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1520	e1 = NULL;
danw@127	1521	continue;
danw@127	1522	}
danw@127	1523	if (!e1 && !map2[e2 - root2]) {
danw@127	1524	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1525	e2 = NULL;
danw@127	1526	continue;
danw@127	1527	}
danw@127	1528	if (e1 && !map1[e1 - root1] &&
danw@127	1529	e2 && !map1[e2 - root2]) {
danw@127	1530	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1531	e1 = NULL;
danw@127	1532	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1533	e2 = NULL;
danw@127	1534	continue;
danw@127	1535	}
danw@127	1536
danw@127	1537	if (!e1)
danw@127	1538	cmp = 1;
danw@127	1539	else if (!e2)
danw@127	1540	cmp = -1;
danw@127	1541	else {
danw@127	1542	cmp = strcmp (&pool1[e1->name],
danw@127	1543	&pool2[e2->name]);
danw@127	1544	}
danw@127	1545
danw@127	1546	if (cmp < 0) {
danw@127	1547	if (map1[e1 - root1]) {
danw@127	1548	map1[e1 - root1] = last =
danw@127	1549	add_file(merger, &pool1[e1->name]);
danw@127	1550	if (e1->start) {
danw@127	1551	child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127	1552	child_md->merged = last;
danw@127	1553	child_md->dir1 = e1->start;
danw@127	1554	child_md->dir2 = 0;
danw@127	1555	}
danw@127	1556	}
danw@127	1557	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1558	e1 = NULL;
danw@127	1559	} else if (cmp > 0) {
danw@127	1560	if (map2[e2 - root2]) {
danw@127	1561	map2[e2 - root2] = last =
danw@127	1562	add_file(merger, &pool2[e2->name]);
danw@127	1563	if (e2->start) {
danw@127	1564	child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127	1565	child_md->merged = last;
danw@127	1566	child_md->dir1 = 0;
danw@127	1567	child_md->dir2 = e2->start;
danw@127	1568	}
danw@127	1569	}
danw@127	1570	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1571	e2 = NULL;
danw@127	1572	} else {
danw@127	1573	map1[e1 - root1] = map2[e2- root2] = last =
danw@127	1574	add_file(merger, &pool1[e1->name]);
danw@127	1575	if (e1->start \|\| e2->start) {
danw@127	1576	child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127	1577	child_md->merged = last;
danw@127	1578	child_md->dir1 = e1->start;
danw@127	1579	child_md->dir2 = e2->start;
danw@127	1580	}
danw@127	1581	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1582	e1 = NULL;
danw@127	1583	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1584	e2 = NULL;
danw@127	1585	}
danw@127	1586	}
danw@127	1587
danw@127	1588	mroot = (struct razor_entry *)merger->set->files.data;
danw@127	1589	if (last) {
danw@127	1590	mroot[last].flags = RAZOR_ENTRY_LAST;
danw@127	1591	mroot[md->merged].start = start;
danw@127	1592	} else
danw@127	1593	mroot[md->merged].start = 0;
danw@127	1594
danw@127	1595	end_md = merge_stack.data + merge_stack.size;
danw@127	1596	for (child_md = merge_stack.data; child_md < end_md; child_md++)
danw@127	1597	merge_one_directory(merger, child_md);
danw@127	1598	array_release(&merge_stack);
danw@127	1599	}
danw@127	1600
danw@127	1601	static void
danw@127	1602	merge_files(struct razor_merger *merger)
danw@127	1603	{
danw@129	1604	struct razor_entry *root;
danw@127	1605	struct merge_directory md;
danw@127	1606	uint32_t map1, map2;
danw@127	1607
danw@127	1608	map1 = merger->source1.file_map;
danw@127	1609	map2 = merger->source2.file_map;
danw@127	1610
danw@127	1611	md.merged = add_file(merger, "");
danw@129	1612
danw@129	1613	if (merger->source1.set->files.size) {
danw@129	1614	root = (struct razor_entry *) merger->source1.set->files.data;
danw@129	1615	if (root->start)
danw@129	1616	fix_file_map(map1, root, root);
danw@129	1617	md.dir1 = root->start;
danw@129	1618	} else
danw@129	1619	md.dir1 = 0;
danw@129	1620
danw@129	1621	if (merger->source2.set->files.size) {
danw@129	1622	root = (struct razor_entry *) merger->source2.set->files.data;
danw@129	1623	if (root->start)
danw@129	1624	fix_file_map(map2, root, root);
danw@129	1625	md.dir2 = root->start;
danw@129	1626	} else
danw@129	1627	md.dir2 = 0;
danw@129	1628
danw@127	1629	merge_one_directory(merger, &md);
danw@127	1630	}
danw@127	1631
danw@127	1632	static void
danw@127	1633	emit_files(struct list_head files, struct array source_pool,
danw@127	1634	uint32_t map, struct array pool)
danw@127	1635	{
danw@127	1636	uint32_t r;
danw@127	1637	struct list p, q;
danw@127	1638
danw@127	1639	r = pool->size / sizeof *q;
danw@127	1640	p = list_first(files, source_pool);
danw@127	1641	while (p) {
danw@127	1642	q = array_add(pool, sizeof *q);
danw@127	1643	q->data = map[p->data];
danw@127	1644	q->flags = p->flags;
danw@127	1645	p = list_next(p);
danw@127	1646	}
danw@127	1647
danw@127	1648	list_set_ptr(files, r);
danw@127	1649	}
danw@127	1650
krh@41	1651	/* Rebuild property->packages maps. We can't just remap these, as a
krh@41	1652	* property may have lost or gained a number of packages. Allocate an
krh@41	1653	* array per property and loop through the packages and add them to
krh@41	1654	* the arrays for their properties. */
krh@41	1655	static void
danw@127	1656	rebuild_property_package_lists(struct razor_set *set)
krh@41	1657	{
krh@66	1658	struct array pkgs, a;
krh@41	1659	struct razor_package pkg, pkg_end;
krh@41	1660	struct razor_property prop, prop_end;
danw@117	1661	struct list *r;
danw@117	1662	uint32_t *q;
krh@66	1663	int count;
krh@41	1664
krh@66	1665	count = set->properties.size / sizeof (struct razor_property);
krh@66	1666	pkgs = zalloc(count * sizeof *pkgs);
krh@41	1667	pkg_end = set->packages.data + set->packages.size;
krh@41	1668
krh@41	1669	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {
danw@128	1670	r = list_first(&pkg->properties, &set->property_pool);
danw@116	1671	while (r) {
danw@117	1672	q = array_add(&pkgs[r->data], sizeof *q);
krh@41	1673	q = pkg - (struct razor_package ) set->packages.data;
danw@116	1674	r = list_next(r);
krh@41	1675	}
krh@33	1676	}
krh@33	1677
krh@66	1678	prop_end = set->properties.data + set->properties.size;
krh@66	1679	a = pkgs;
krh@66	1680	for (prop = set->properties.data; prop < prop_end; prop++, a++) {
danw@128	1681	list_set_array(&prop->packages, &set->package_pool, a, 0);
krh@41	1682	array_release(a);
krh@41	1683	}
krh@66	1684	free(pkgs);
krh@33	1685	}
krh@33	1686
danw@127	1687	static void
danw@127	1688	rebuild_file_package_lists(struct razor_set *set)
danw@127	1689	{
danw@127	1690	struct array pkgs, a;
danw@127	1691	struct razor_package pkg, pkg_end;
danw@127	1692	struct razor_entry entry, entry_end;
danw@127	1693	struct list *r;
danw@127	1694	uint32_t *q;
danw@127	1695	int count;
danw@127	1696
danw@127	1697	count = set->files.size / sizeof (struct razor_entry);
danw@127	1698	pkgs = zalloc(count * sizeof *pkgs);
danw@127	1699	pkg_end = set->packages.data + set->packages.size;
danw@127	1700
danw@127	1701	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {
danw@128	1702	r = list_first(&pkg->files, &set->file_pool);
danw@127	1703	while (r) {
danw@127	1704	q = array_add(&pkgs[r->data], sizeof *q);
danw@127	1705	q = pkg - (struct razor_package ) set->packages.data;
danw@127	1706	r = list_next(r);
danw@127	1707	}
danw@127	1708	}
danw@127	1709
danw@127	1710	entry_end = set->files.data + set->files.size;
danw@127	1711	a = pkgs;
danw@127	1712	for (entry = set->files.data; entry < entry_end; entry++, a++) {
danw@128	1713	list_set_array(&entry->packages, &set->package_pool, a, 0);
danw@127	1714	array_release(a);
danw@127	1715	}
danw@127	1716	free(pkgs);
danw@127	1717	}
danw@127	1718
danw@137	1719	static struct razor_set *
krh@79	1720	razor_merger_finish(struct razor_merger *merger)
krh@79	1721	{
krh@79	1722	struct razor_set *result;
krh@41	1723	struct razor_package p, pend;
krh@33	1724
krh@41	1725	/* As we built the package list, we filled out a bitvector of
krh@41	1726	* the properties that are referenced by the packages in the
krh@41	1727	* new set. Now we do a parallel loop through the properties
krh@41	1728	* and emit those marked in the bit vector to the new set. In
krh@41	1729	* the process, we update the bit vector to actually map from
krh@41	1730	* indices in the old property list to indices in the new
krh@41	1731	* property list for both sets. */
krh@41	1732
krh@79	1733	merge_properties(merger);
danw@127	1734	merge_files(merger);
krh@41	1735
krh@41	1736	/* Now we loop through the packages again and emit the
krh@41	1737	* property lists, remapped to point to the new properties. */
krh@41	1738
krh@79	1739	pend = merger->set->packages.data + merger->set->packages.size;
krh@79	1740	for (p = merger->set->packages.data; p < pend; p++) {
krh@41	1741	struct source *src;
krh@41	1742
danw@120	1743	if (p->flags & UPSTREAM_SOURCE)
krh@79	1744	src = &merger->source2;
krh@41	1745	else
krh@79	1746	src = &merger->source1;
krh@41	1747
danw@116	1748	emit_properties(&p->properties,
danw@116	1749	&src->set->property_pool,
danw@116	1750	src->property_map,
danw@116	1751	&merger->set->property_pool);
danw@127	1752	emit_files(&p->files,
danw@127	1753	&src->set->file_pool,
danw@127	1754	src->file_map,
danw@127	1755	&merger->set->file_pool);
danw@120	1756	p->flags &= ~UPSTREAM_SOURCE;
krh@33	1757	}
krh@33	1758
danw@127	1759	rebuild_property_package_lists(merger->set);
danw@127	1760	rebuild_file_package_lists(merger->set);
krh@41	1761
danw@129	1762	result = merger->set;
danw@129	1763	hashtable_release(&merger->table);
danw@129	1764	free(merger);
danw@129	1765
danw@129	1766	return result;
danw@129	1767	}
danw@129	1768
danw@146	1769	/* The diff order matters. We should sort the packages so that a
danw@146	1770	* REMOVE of a package comes before the INSTALL, and so that all
danw@146	1771	* requires for a package have been installed before the package.
danw@146	1772	**/
danw@146	1773
danw@146	1774	void
danw@146	1775	razor_set_diff(struct razor_set set, struct razor_set upstream,
danw@146	1776	razor_package_callback_t callback, void *data)
danw@146	1777	{
danw@146	1778	struct razor_package_iterator pi1, pi2;
danw@146	1779	struct razor_package p1, p2;
danw@146	1780	const char name1, name2, version1, version2;
danw@146	1781	int res;
danw@146	1782
danw@146	1783	pi1 = razor_package_iterator_create(set);
danw@146	1784	pi2 = razor_package_iterator_create(upstream);
danw@146	1785
danw@146	1786	razor_package_iterator_next(pi1, &p1, &name1, &version1);
danw@146	1787	razor_package_iterator_next(pi2, &p2, &name2, &version2);
danw@146	1788
danw@146	1789	while (p1 \|\| p2) {
danw@146	1790	if (p1 && p2) {
danw@146	1791	res = strcmp(name1, name2);
danw@146	1792	if (res == 0)
danw@146	1793	res = versioncmp(version1, version2);
danw@146	1794	} else {
danw@146	1795	res = 0;
danw@146	1796	}
danw@146	1797
danw@146	1798	if (p2 == NULL \|\| res < 0)
danw@146	1799	callback(name1, version1, NULL, data);
danw@146	1800	else if (p1 == NULL \|\| res > 0)
danw@146	1801	callback(name2, NULL, version2, data);
danw@146	1802
danw@146	1803	if (p1 != NULL && res <= 0)
danw@146	1804	razor_package_iterator_next(pi1, &p1,
danw@146	1805	&name1, &version1);
danw@146	1806	if (p2 != NULL && res >= 0)
danw@146	1807	razor_package_iterator_next(pi2, &p2,
danw@146	1808	&name2, &version2);
danw@146	1809	}
danw@146	1810
danw@146	1811	razor_package_iterator_destroy(pi1);
danw@146	1812	razor_package_iterator_destroy(pi2);
danw@146	1813	}
danw@146	1814
danw@141	1815
danw@141	1816	struct razor_transaction_resolver {
danw@141	1817	struct razor_set system, upstream;
danw@141	1818	struct bitarray syspkgs, uppkgs;
danw@141	1819	struct array packages;
danw@141	1820	int errors;
danw@141	1821	};
danw@141	1822
danw@144	1823	static int
danw@144	1824	package_in_set(void package, struct razor_set set)
danw@144	1825	{
danw@144	1826	return package >= set->packages.data &&
danw@144	1827	package < set->packages.data + set->packages.size;
danw@144	1828	}
danw@144	1829
danw@144	1830	static int
danw@144	1831	property_in_set(void property, struct razor_set set)
danw@144	1832	{
danw@144	1833	return property >= set->properties.data &&
danw@144	1834	property < set->properties.data + set->properties.size;
danw@144	1835	}
danw@144	1836
danw@144	1837	static int
danw@144	1838	compare_transaction_packages(const void one, const void two)
danw@144	1839	{
danw@160	1840	struct razor_transaction_package *tp1 = (void )one;
danw@160	1841	struct razor_transaction_package *tp2 = (void )two;
danw@160	1842
danw@160	1843	if (!(*tp1)->name)
danw@160	1844	return 1;
danw@160	1845	else if (!(*tp2)->name)
danw@160	1846	return -1;
danw@160	1847	else
danw@160	1848	return strcmp((tp1)->name, (tp2)->name);
danw@144	1849	}
danw@144	1850
danw@141	1851	static void
danw@160	1852	resolve_new_packages(struct razor_transaction_resolver *trans,
danw@160	1853	int start, int end)
krh@38	1854	{
danw@144	1855	struct razor_package sp, spkgs, up, upkgs, send, uend;
danw@160	1856	struct razor_transaction_package **packages;
danw@144	1857	const char spool, upool;
danw@144	1858	int i;
danw@144	1859
danw@144	1860	spkgs = trans->system->packages.data;
danw@144	1861	send = trans->system->packages.data + trans->system->packages.size;
danw@144	1862	spool = trans->system->string_pool.data;
danw@144	1863	upkgs = trans->upstream->packages.data;
danw@144	1864	uend = trans->upstream->packages.data + trans->upstream->packages.size;
danw@144	1865	upool = trans->upstream->string_pool.data;
danw@144	1866
danw@160	1867	packages = calloc(end - start, sizeof *packages);
danw@160	1868	for (i = start; i < end; i++)
danw@160	1869	packages[i - start] = ((struct razor_transaction_package *)trans->packages.data) + i;
danw@160	1870	qsort(packages, end - start, sizeof *packages,
danw@160	1871	compare_transaction_packages);
danw@144	1872
danw@144	1873	sp = spkgs;
danw@144	1874	up = upkgs;
danw@160	1875	for (i = 0; i < end - start; i++) {
danw@160	1876	if (!packages[i]->name)
danw@160	1877	continue;
danw@160	1878	while (sp < send && strcmp(&spool[sp->name], packages[i]->name) < 0)
danw@144	1879	sp++;
danw@160	1880	while (up < uend && strcmp(&upool[up->name], packages[i]->name) < 0)
danw@144	1881	up++;
danw@144	1882
danw@160	1883	if (packages[i]->state == RAZOR_PACKAGE_REMOVE \|\|
danw@160	1884	packages[i]->state == RAZOR_PACKAGE_OBSOLETED) {
danw@160	1885	if (sp < send && strcmp(packages[i]->name, &spool[sp->name]) == 0) {
danw@160	1886	packages[i]->old_package = sp;
danw@160	1887	packages[i]->name = &spool[sp->name];
danw@160	1888	packages[i]->old_version = &spool[sp->version];
danw@144	1889	bitarray_set(&trans->syspkgs, sp - spkgs, 0);
danw@144	1890	} else {
danw@160	1891	packages[i]->name = strdup(packages[i]->name);
danw@160	1892	packages[i]->state = RAZOR_PACKAGE_REMOVE_NOT_INSTALLED;
danw@144	1893	trans->errors++;
danw@144	1894	}
danw@144	1895	} else {
danw@160	1896	if (up < uend && strcmp(packages[i]->name, &upool[up->name]) == 0) {
danw@160	1897	packages[i]->new_package = up;
danw@160	1898	packages[i]->name = &upool[up->name];
danw@160	1899	packages[i]->new_version = &upool[up->version];
danw@160	1900	if (sp < send && strcmp(packages[i]->name, &spool[sp->name]) == 0) {
danw@160	1901	packages[i]->old_package = sp;
danw@160	1902	packages[i]->old_version = &spool[sp->version];
danw@144	1903	if (versioncmp(&spool[sp->version], &upool[up->version]) >= 0) {
danw@160	1904	packages[i]->state = RAZOR_PACKAGE_UP_TO_DATE;
danw@144	1905	trans->errors++;
danw@144	1906	continue;
danw@144	1907	}
danw@144	1908	bitarray_set(&trans->syspkgs, sp - spkgs, 0);
danw@144	1909	}
danw@144	1910	bitarray_set(&trans->uppkgs, up - upkgs, 1);
danw@144	1911	} else {
danw@160	1912	packages[i]->name = strdup(packages[i]->name);
danw@160	1913	packages[i]->state = RAZOR_PACKAGE_INSTALL_UNAVAILABLE;
danw@144	1914	trans->errors++;
krh@105	1915	}
krh@105	1916	}
krh@38	1917	}
krh@38	1918	}
krh@38	1919
krh@38	1920	static void
danw@141	1921	find_all_packages(struct razor_transaction_resolver *trans)
krh@38	1922	{
danw@137	1923	struct razor_transaction_package *tp;
danw@144	1924	struct razor_package sp, spkgs, send, up, upkgs, uend;
danw@144	1925	const char spool, upool;
danw@144	1926
danw@144	1927	spkgs = trans->system->packages.data;
danw@144	1928	send = trans->system->packages.data + trans->system->packages.size;
danw@144	1929	spool = trans->system->string_pool.data;
danw@144	1930	up = upkgs = trans->upstream->packages.data;
danw@141	1931	uend = trans->upstream->packages.data + trans->upstream->packages.size;
danw@141	1932	upool = trans->upstream->string_pool.data;
krh@38	1933
danw@144	1934	for (sp = spkgs; sp < send; sp++) {
danw@144	1935	while (up < uend && strcmp(&spool[sp->name], &upool[up->name]) > 0)
danw@144	1936	up++;
danw@144	1937	if (strcmp(&spool[sp->name], &upool[up->name]) == 0) {
danw@141	1938	tp = array_add(&trans->packages, sizeof *tp);
danw@137	1939	memset(tp, 0, sizeof *tp);
danw@147	1940	tp->old_package = sp;
danw@147	1941	tp->new_package = up;
danw@144	1942	tp->name = &upool[up->name];
danw@147	1943	tp->old_version = &spool[sp->version];
danw@147	1944	tp->new_version = &upool[up->version];
danw@137	1945	tp->state = RAZOR_PACKAGE_INSTALL;
danw@144	1946	bitarray_set(&trans->uppkgs, up - upkgs, 1);
danw@144	1947	bitarray_set(&trans->syspkgs, sp - spkgs, 0);
krh@38	1948	}
krh@38	1949	}
krh@38	1950	}
krh@38	1951
danw@137	1952	static int
danw@137	1953	provider_satisfies_requirement(struct razor_property *provider,
danw@137	1954	const char *provider_strings,
danw@137	1955	struct razor_property *requirement,
danw@137	1956	const char *requirement_strings)
danw@137	1957	{
danw@137	1958	int cmp, len;
danw@137	1959	const char *provided = &provider_strings[provider->version];
danw@137	1960	const char *required = &requirement_strings[requirement->version];
danw@137	1961
danw@137	1962	if (!*required)
danw@137	1963	return 1;
danw@137	1964
danw@137	1965	cmp = versioncmp(provided, required);
danw@137	1966
danw@137	1967	switch (requirement->relation) {
danw@137	1968	case RAZOR_VERSION_LESS:
danw@137	1969	return cmp < 0;
danw@137	1970
danw@137	1971	case RAZOR_VERSION_LESS_OR_EQUAL:
danw@137	1972	if (cmp <= 0)
danw@137	1973	return 1;
danw@137	1974	/* fall through: FIXME, make sure this is correct */
danw@137	1975
danw@137	1976	case RAZOR_VERSION_EQUAL:
danw@137	1977	if (cmp == 0)
danw@137	1978	return 1;
danw@137	1979
danw@137	1980	/* "foo == 1.1" is satisfied by "foo 1.1-2" */
danw@137	1981	len = strlen(required);
danw@137	1982	if (!strncmp(required, provided, len) && provided[len] == '-')
danw@137	1983	return 1;
danw@137	1984	return 0;
danw@137	1985
danw@137	1986	case RAZOR_VERSION_GREATER_OR_EQUAL:
danw@137	1987	return cmp >= 0;
danw@137	1988
danw@137	1989	case RAZOR_VERSION_GREATER:
danw@137	1990	return cmp > 0;
danw@137	1991	}
danw@137	1992
danw@137	1993	/* shouldn't happen */
danw@137	1994	return 0;
danw@137	1995	}
danw@137	1996
danw@142	1997	static struct razor_package *
danw@144	1998	find_package_for_file(struct razor_set set, struct bitarray pkgbits,
danw@144	1999	const char *filename, int installed)
danw@134	2000	{
danw@142	2001	struct razor_package *pkgs = set->packages.data;
danw@140	2002	struct razor_entry *entry;
danw@140	2003	struct list *p;
danw@134	2004
danw@140	2005	if (filename[0] != '/')
danw@140	2006	return 0;
danw@140	2007
danw@142	2008	entry = find_entry(set, set->files.data, filename);
danw@140	2009	if (!entry)
danw@140	2010	return 0;
danw@140	2011
danw@142	2012	for (p = list_first(&entry->packages, &set->package_pool); p; p = list_next(p)) {
danw@142	2013	if (bitarray_get(pkgbits, p->data) == installed)
danw@142	2014	return &pkgs[p->data];
danw@134	2015	}
danw@142	2016	return NULL;
danw@142	2017	}
danw@142	2018
danw@142	2019	static struct razor_package *
danw@144	2020	find_installed_package_for_file(struct razor_transaction_resolver *trans,
danw@144	2021	const char *filename)
danw@142	2022	{
danw@144	2023	struct razor_package *pkg;
danw@144	2024
danw@144	2025	pkg = find_package_for_file(trans->system, &trans->syspkgs,
danw@144	2026	filename, 1);
danw@144	2027	if (!pkg)
danw@144	2028	pkg = find_package_for_file(trans->upstream, &trans->uppkgs,
danw@144	2029	filename, 1);
danw@144	2030	return pkg;
danw@142	2031	}
danw@142	2032
danw@142	2033	static struct razor_package *
danw@144	2034	find_uninstalled_package_for_file(struct razor_transaction_resolver *trans,
danw@144	2035	const char *filename)
danw@142	2036	{
danw@144	2037	struct razor_package *pkg;
danw@144	2038
danw@144	2039	pkg = find_package_for_file(trans->upstream, &trans->uppkgs,
danw@144	2040	filename, 0);
danw@144	2041	if (!pkg)
danw@144	2042	pkg = find_package_for_file(trans->system, &trans->syspkgs,
danw@144	2043	filename, 0);
danw@144	2044	return pkg;
danw@134	2045	}
danw@134	2046
danw@154	2047	static struct razor_property *
danw@154	2048	skip_to_matching_property(struct razor_transaction_resolver *trans,
danw@154	2049	struct razor_property *match,
danw@154	2050	struct razor_property *prop)
danw@154	2051	{
danw@154	2052	struct razor_set mset, pset;
danw@154	2053	const char ppool, mpool;
danw@154	2054	struct razor_property *prop_end;
danw@154	2055
danw@154	2056	if (property_in_set(match, trans->system))
danw@154	2057	mset = trans->system;
danw@154	2058	else
danw@154	2059	mset = trans->upstream;
danw@154	2060
danw@154	2061	if (property_in_set(prop, trans->system))
danw@154	2062	pset = trans->system;
danw@154	2063	else if (property_in_set(prop, trans->upstream))
danw@154	2064	pset = trans->upstream;
danw@154	2065	else
danw@154	2066	return prop;
danw@154	2067
danw@154	2068	prop_end = pset->properties.data + pset->properties.size;
danw@154	2069	ppool = pset->string_pool.data;
danw@154	2070	mpool = mset->string_pool.data;
danw@154	2071
danw@154	2072	while (prop < prop_end &&
danw@154	2073	strcmp(&ppool[prop->name], &mpool[match->name]) < 0)
danw@154	2074	prop++;
danw@154	2075	return prop;
danw@154	2076	}
danw@154	2077
danw@140	2078	static struct razor_package *
danw@144	2079	find_package_matching(struct razor_transaction_resolver *trans, int installed,
danw@154	2080	struct razor_property *prop,
danw@144	2081	struct razor_property *req,
danw@144	2082	struct razor_set *req_set)
danw@138	2083	{
danw@144	2084	struct razor_set *set;
danw@144	2085	struct bitarray *pkgbits;
danw@144	2086	struct razor_package *pkgs;
danw@154	2087	struct razor_property props, prop_end;
danw@144	2088	enum razor_property_type match_type;
danw@144	2089	const char *pool;
danw@154	2090	const char *rpool;
danw@154	2091	int match_name = (req->type == RAZOR_PROPERTY_OBSOLETES);
danw@144	2092	int match;
danw@144	2093
danw@144	2094	if (property_in_set(prop, trans->system)) {
danw@144	2095	set = trans->system;
danw@144	2096	pkgbits = &trans->syspkgs;
danw@144	2097	} else if (property_in_set(prop, trans->upstream)) {
danw@144	2098	set = trans->upstream;
danw@144	2099	pkgbits = &trans->uppkgs;
danw@144	2100	} else
danw@144	2101	return NULL;
danw@144	2102
danw@154	2103	if (!req_set) {
danw@154	2104	if (property_in_set(req, trans->system))
danw@154	2105	req_set = trans->system;
danw@154	2106	else
danw@154	2107	req_set = trans->upstream;
danw@154	2108	}
danw@154	2109	rpool = req_set->string_pool.data;
danw@154	2110
danw@144	2111	if (req->type == RAZOR_PROPERTY_PROVIDES)
danw@144	2112	match_type = RAZOR_PROPERTY_CONFLICTS;
danw@144	2113	else
danw@144	2114	match_type = RAZOR_PROPERTY_PROVIDES;
danw@144	2115
danw@144	2116	pkgs = set->packages.data;
danw@144	2117	props = set->properties.data;
danw@144	2118	prop_end = set->properties.data + set->properties.size;
danw@144	2119	pool = set->string_pool.data;
danw@144	2120
danw@144	2121	/* Find first matching property */
danw@144	2122	while (prop < prop_end &&
danw@144	2123	strcmp(&pool[prop->name], &rpool[req->name]) < 0)
danw@144	2124	prop++;
danw@144	2125	if (prop == prop_end \|\|
danw@144	2126	strcmp(&pool[prop->name], &rpool[req->name]) > 0)
danw@144	2127	return NULL;
danw@144	2128
danw@144	2129	if (prop->type < match_type) {
danw@144	2130	while (prop < prop_end && prop->type != match_type)
danw@144	2131	prop++;
danw@144	2132	} else {
danw@144	2133	while (prop >= props && prop->type != match_type)
danw@144	2134	prop--;
danw@144	2135	while (prop > props + 1 && (prop - 1)->type == match_type)
danw@144	2136	prop--;
danw@144	2137	}
danw@144	2138
danw@153	2139	/* Scan matching properties */
danw@144	2140	while (prop < prop_end && prop->type == match_type &&
danw@144	2141	strcmp(&pool[prop->name], &rpool[req->name]) == 0) {
danw@144	2142	if (match_type == RAZOR_PROPERTY_PROVIDES)
danw@144	2143	match = provider_satisfies_requirement(prop, pool, req, rpool);
danw@144	2144	else
danw@144	2145	match = provider_satisfies_requirement(req, rpool, prop, pool);
danw@144	2146	if (match) {
danw@140	2147	struct list *pkg;
danw@140	2148
danw@144	2149	for (pkg = list_first(&prop->packages, &set->package_pool); pkg; pkg = list_next(pkg)) {
danw@144	2150	if (bitarray_get(pkgbits, pkg->data) != installed)
danw@140	2151	continue;
danw@140	2152	if (!match_name \|\|
danw@144	2153	strcmp(&pool[pkgs[pkg->data].name],
danw@144	2154	&rpool[req->name]) == 0)
danw@144	2155	return &pkgs[pkg->data];
danw@140	2156	}
danw@140	2157	}
danw@144	2158	prop++;
danw@140	2159	}
danw@140	2160
danw@140	2161	return NULL;
danw@138	2162	}
danw@138	2163
danw@140	2164	static struct razor_package *
danw@144	2165	find_installed_package_for_property(struct razor_transaction_resolver *trans,
danw@154	2166	struct razor_property *sys_start,
danw@154	2167	struct razor_property *up_start,
danw@144	2168	struct razor_property *req)
danw@138	2169	{
danw@144	2170	struct razor_package *pkg;
danw@144	2171
danw@154	2172	pkg = find_package_matching(trans, 1, sys_start, req, NULL);
danw@144	2173	if (!pkg)
danw@154	2174	pkg = find_package_matching(trans, 1, up_start, req, NULL);
danw@144	2175	return pkg;
danw@144	2176	}
danw@144	2177
danw@144	2178	static struct razor_package *
danw@144	2179	find_uninstalled_package_for_property(struct razor_transaction_resolver *trans,
danw@154	2180	struct razor_property *sys_start,
danw@154	2181	struct razor_property *up_start,
danw@144	2182	struct razor_property *req)
danw@144	2183	{
danw@144	2184	struct razor_package *pkg;
danw@144	2185
danw@154	2186	pkg = find_package_matching(trans, 0, up_start, req, NULL);
danw@144	2187	if (!pkg)
danw@154	2188	pkg = find_package_matching(trans, 0, sys_start, req, NULL);
danw@144	2189	return pkg;
danw@140	2190	}
danw@140	2191
danw@147	2192	static struct razor_transaction_package *
danw@147	2193	find_transaction_package(struct razor_transaction_resolver *trans,
danw@147	2194	const char *name)
danw@147	2195	{
danw@147	2196	struct razor_transaction_package *packages;
danw@147	2197	int count, i;
danw@147	2198
danw@147	2199	packages = trans->packages.data;
danw@147	2200	count = trans->packages.size / sizeof *packages;
danw@147	2201	for (i = 0; i < count; i++) {
danw@147	2202	if (packages[i].name && !strcmp(packages[i].name, name))
danw@147	2203	return &packages[i];
danw@147	2204	}
danw@147	2205	return NULL;
danw@147	2206	}
danw@147	2207
danw@160	2208	/* FIXME? */
danw@160	2209	static int
danw@160	2210	prop_is_being_installed(struct razor_transaction_resolver *trans,
danw@160	2211	struct razor_property *prop)
danw@160	2212	{
danw@160	2213	struct list *pkg;
danw@160	2214
danw@160	2215	for (pkg = list_first(&prop->packages, &trans->upstream->package_pool); pkg; pkg = list_next(pkg)) {
danw@160	2216	if (bitarray_get(&trans->uppkgs, pkg->data))
danw@160	2217	return 1;
danw@160	2218	}
danw@160	2219	return 0;
danw@160	2220	}
danw@160	2221
danw@160	2222	static int
danw@160	2223	prop_is_being_removed(struct razor_transaction_resolver *trans,
danw@160	2224	struct razor_property *prop)
danw@160	2225	{
danw@160	2226	struct list *pkg;
danw@160	2227
danw@160	2228	for (pkg = list_first(&prop->packages, &trans->system->package_pool); pkg; pkg = list_next(pkg)) {
danw@160	2229	if (bitarray_get(&trans->syspkgs, pkg->data))
danw@160	2230	return 0;
danw@160	2231	}
danw@160	2232	return 1;
danw@160	2233	}
danw@160	2234
danw@160	2235	static int
danw@160	2236	prop_is_being_updated(struct razor_transaction_resolver *trans,
danw@160	2237	struct razor_property *prop)
danw@160	2238	{
danw@160	2239	struct razor_package *packages = trans->system->packages.data;
danw@160	2240	const char *pool = trans->system->string_pool.data;
danw@160	2241	struct razor_transaction_package *tp;
danw@160	2242	struct list *pkg;
danw@160	2243
danw@160	2244	/* Assumes prop_is_being_removed returns true */
danw@160	2245
danw@160	2246	for (pkg = list_first(&prop->packages, &trans->system->package_pool); pkg; pkg = list_next(pkg)) {
danw@160	2247	tp = find_transaction_package(trans, &pool[packages[pkg->data].name]);
danw@160	2248	if (tp && tp->state == RAZOR_PACKAGE_REMOVE)
danw@160	2249	return 0;
danw@160	2250	}
danw@160	2251	return 1;
danw@160	2252	}
danw@160	2253
danw@131	2254	static void
danw@141	2255	add_transaction_package(struct razor_transaction_resolver *trans,
danw@147	2256	struct razor_package *new_package,
danw@147	2257	struct razor_package *old_package,
danw@140	2258	enum razor_transaction_package_state state,
danw@144	2259	const char *req_package,
danw@144	2260	struct razor_property *req_prop)
danw@131	2261	{
danw@147	2262	struct razor_set new_package_set, old_package_set, *req_set;
danw@160	2263	struct bitarray *reqpkgbits;
danw@147	2264	struct razor_transaction_package tp, already;
danw@140	2265	const char *pool;
danw@140	2266	struct razor_package *pkgs;
danw@140	2267	struct list *pkg;
danw@147	2268	int contradiction = 0;
danw@147	2269
danw@160	2270	if (package_in_set(new_package, trans->system))
danw@147	2271	new_package_set = trans->system;
danw@160	2272	else
danw@147	2273	new_package_set = trans->upstream;
danw@160	2274	if (package_in_set(old_package, trans->system))
danw@147	2275	old_package_set = trans->system;
danw@160	2276	else
danw@147	2277	old_package_set = trans->upstream;
danw@145	2278	if (property_in_set(req_prop, trans->system)) {
danw@145	2279	req_set = trans->system;
danw@145	2280	reqpkgbits = &trans->syspkgs;
danw@145	2281	} else {
danw@145	2282	req_set = trans->upstream;
danw@145	2283	reqpkgbits = &trans->uppkgs;
danw@145	2284	}
danw@144	2285
danw@147	2286	if (new_package) {
danw@147	2287	pool = new_package_set->string_pool.data;
danw@147	2288	already = find_transaction_package(trans, &pool[new_package->name]);
danw@147	2289	if (already) {
danw@147	2290	if (already->new_package == new_package) {
danw@147	2291	/* Already taken care of */
danw@147	2292	return;
danw@147	2293	}
danw@147	2294	/* Oops. We lose */
danw@147	2295	if (state != RAZOR_PACKAGE_CONTRADICTION)
danw@147	2296	contradiction = 1;
danw@147	2297	}
danw@147	2298	} else if (old_package) {
danw@147	2299	pool = old_package_set->string_pool.data;
danw@147	2300	already = find_transaction_package(trans, &pool[old_package->name]);
danw@147	2301	if (already) {
danw@147	2302	if (already->old_package == old_package) {
danw@147	2303	/* Already taken care of */
danw@147	2304	return;
danw@147	2305	}
danw@147	2306	/* Oops. We lose */
danw@147	2307	if (state != RAZOR_PACKAGE_CONTRADICTION)
danw@147	2308	contradiction = 1;
danw@147	2309	}
danw@147	2310	} else
danw@147	2311	state = RAZOR_PACKAGE_UNSATISFIABLE;
danw@147	2312
danw@141	2313	tp = array_add(&trans->packages, sizeof *tp);
danw@140	2314	memset(tp, 0, sizeof *tp);
danw@131	2315
danw@147	2316	if (new_package) {
danw@147	2317	pool = new_package_set->string_pool.data;
danw@147	2318	tp->new_package = new_package;
danw@147	2319	tp->name = &pool[new_package->name];
danw@147	2320	tp->new_version = &pool[new_package->version];
danw@147	2321
danw@147	2322	pkgs = new_package_set->packages.data;
danw@147	2323	}
danw@147	2324	if (old_package) {
danw@147	2325	pool = old_package_set->string_pool.data;
danw@147	2326	tp->old_package = old_package;
danw@147	2327	tp->name = &pool[old_package->name];
danw@147	2328	tp->old_version = &pool[old_package->version];
danw@147	2329
danw@147	2330	pkgs = old_package_set->packages.data;
danw@147	2331	}
danw@147	2332
danw@147	2333	tp->state = state;
danw@147	2334	if (state != RAZOR_PACKAGE_INSTALL &&
danw@154	2335	state != RAZOR_PACKAGE_FORCED_UPDATE &&
danw@154	2336	state != RAZOR_PACKAGE_REMOVE &&
danw@154	2337	state != RAZOR_PACKAGE_OBSOLETED)
danw@145	2338	trans->errors++;
danw@147	2339
danw@147	2340	if (contradiction) {
danw@147	2341	/* Do this now, after adding tp, so that it ends up
danw@147	2342	* after both the INSTALL and the REMOVE in the array.
danw@147	2343	*/
danw@147	2344	add_transaction_package(trans, new_package, old_package,
danw@147	2345	RAZOR_PACKAGE_CONTRADICTION,
danw@147	2346	NULL, NULL);
danw@145	2347	}
danw@140	2348
danw@144	2349	if (req_package)
danw@145	2350	tp->dep_package = req_package;
danw@145	2351	if (!req_prop)
danw@145	2352	return;
danw@145	2353
danw@145	2354	pool = req_set->string_pool.data;
danw@145	2355	pkgs = req_set->packages.data;
danw@145	2356	if (!req_package) {
danw@145	2357	for (pkg = list_first(&req_prop->packages, &req_set->package_pool); pkg; pkg = list_next(pkg)) {
danw@145	2358	if (bitarray_get(reqpkgbits, pkg->data))
danw@144	2359	break;
danw@144	2360	}
danw@145	2361	if (pkg)
danw@145	2362	tp->dep_package = &pool[pkgs[pkg->data].name];
danw@131	2363	}
danw@144	2364
danw@145	2365	tp->dep_type = req_prop->type;
danw@145	2366	tp->dep_property = &pool[req_prop->name];
danw@145	2367	tp->dep_relation = req_prop->relation;
danw@145	2368	tp->dep_version = &pool[req_prop->version];
danw@140	2369	}
danw@140	2370
danw@160	2371	static void
danw@160	2372	razor_transaction_satisfy(struct razor_transaction_resolver *trans)
danw@147	2373	{
danw@160	2374	struct razor_package spkgs, upkgs, *pkg;
danw@144	2375	struct razor_property sp, sprops, *sprop_end;
danw@144	2376	struct razor_property up, uprops, *uprop_end;
danw@160	2377	struct razor_property sr, ur, *first_up;
danw@160	2378	const char spool, upool, *removed_package;
danw@160	2379	struct list *reqpkg;
danw@134	2380
danw@140	2381	spkgs = trans->system->packages.data;
danw@140	2382	sprops = trans->system->properties.data;
danw@144	2383	sprop_end = trans->system->properties.data + trans->system->properties.size;
danw@145	2384	spool = trans->system->string_pool.data;
danw@140	2385	upkgs = trans->upstream->packages.data;
danw@140	2386	uprops = trans->upstream->properties.data;
danw@144	2387	uprop_end = trans->upstream->properties.data + trans->upstream->properties.size;
danw@140	2388	upool = trans->upstream->string_pool.data;
krh@33	2389
danw@144	2390	sp = sprops;
danw@160	2391	for (up = uprops; up < uprop_end; up++) {
danw@140	2392	/* Skip 'up' ahead to a property of a package which is
danw@140	2393	* to-be-installed.
danw@140	2394	*/
danw@144	2395	while (up < uprop_end &&
danw@144	2396	!prop_is_being_installed(trans, up))
danw@140	2397	up++;
danw@144	2398	if (up == uprop_end)
danw@140	2399	break;
danw@154	2400	sp = skip_to_matching_property(trans, up, sp);
krh@33	2401
danw@144	2402	switch (up->type) {
danw@140	2403	case RAZOR_PROPERTY_REQUIRES:
danw@144	2404	if (!strncmp(&upool[up->name], "rpmlib(", 7))
danw@140	2405	break;
danw@131	2406
danw@154	2407	if (find_installed_package_for_property(trans, sp, up, up) \|\|
danw@144	2408	find_installed_package_for_file(trans, &upool[up->name])) {
danw@140	2409	/* Requires something that is either installed
danw@140	2410	* or to-be-installed.
danw@140	2411	*/
danw@140	2412	break;
danw@137	2413	}
danw@137	2414
danw@140	2415	/* See if we can install a new upstream provider */
danw@154	2416	pkg = find_uninstalled_package_for_property(trans, sp, up, up);
danw@154	2417	if (!pkg)
danw@144	2418	pkg = find_uninstalled_package_for_file(trans, &upool[up->name]);
danw@160	2419	add_transaction_package(trans, pkg, NULL,
danw@144	2420	RAZOR_PACKAGE_INSTALL,
danw@144	2421	NULL, up);
danw@144	2422	break;
danw@144	2423
danw@144	2424	case RAZOR_PROPERTY_PROVIDES:
danw@144	2425	/* find_installed_package_for_property works backwards
danw@144	2426	* here, finding a conflicting installed package.
danw@144	2427	*/
danw@154	2428	pkg = find_installed_package_for_property(trans, sp, up, up);
danw@140	2429	if (!pkg)
danw@144	2430	break;
danw@144	2431
danw@145	2432	if (package_in_set(pkg, trans->system)) {
danw@145	2433	/* pkg CONFLICTS with what 'up' PROVIDES. Try
danw@145	2434	* finding an upgrade
danw@145	2435	*/
danw@160	2436	add_transaction_package(trans, NULL, pkg,
danw@160	2437	RAZOR_PACKAGE_FORCED_UPDATE,
danw@160	2438	&spool[pkg->name], sp);
danw@160	2439	} else {
danw@160	2440	add_transaction_package(trans, NULL, pkg,
danw@160	2441	RAZOR_PACKAGE_CONTRADICTION,
danw@160	2442	NULL, up);
danw@144	2443	}
danw@140	2444	break;
danw@140	2445
danw@140	2446	case RAZOR_PROPERTY_CONFLICTS:
danw@154	2447	pkg = find_installed_package_for_property(trans, sp, up, up);
danw@144	2448	if (!pkg)
danw@144	2449	break;
danw@144	2450
danw@144	2451	if (package_in_set(pkg, trans->system)) {
danw@140	2452	/* Conflicts with something already installed.
danw@140	2453	* Try to upgrade out.
danw@140	2454	*/
danw@160	2455	add_transaction_package(trans, NULL, pkg,
danw@160	2456	RAZOR_PACKAGE_FORCED_UPDATE,
danw@160	2457	NULL, up);
danw@160	2458	} else {
danw@160	2459	add_transaction_package(trans, pkg, NULL,
danw@160	2460	RAZOR_PACKAGE_CONTRADICTION,
danw@160	2461	NULL, up);
danw@140	2462	}
danw@140	2463	break;
danw@140	2464
danw@140	2465	case RAZOR_PROPERTY_OBSOLETES:
danw@154	2466	pkg = find_installed_package_for_property(trans, sp, up, up);
danw@145	2467	if (pkg) {
danw@145	2468	/* If pkg is to-be-installed, this
danw@145	2469	* will add a CONTRADICTION error as well.
danw@145	2470	*/
danw@147	2471	add_transaction_package(trans, NULL, pkg,
danw@154	2472	RAZOR_PACKAGE_OBSOLETED,
danw@144	2473	NULL, up);
danw@140	2474	}
danw@140	2475	break;
danw@140	2476
danw@140	2477	default:
danw@140	2478	/* can't happen */
danw@140	2479	break;
danw@131	2480	}
krh@37	2481	}
danw@154	2482
danw@154	2483	up = uprops;
danw@154	2484	for (sp = sprops; sp < sprop_end; sp++) {
danw@154	2485	/* Skip 'sp' ahead to a PROVIDES of a package which is
danw@154	2486	* to-be-removed.
danw@154	2487	*/
danw@154	2488	while (sp < sprop_end &&
danw@154	2489	(sp->type != RAZOR_PROPERTY_PROVIDES \|\|
danw@154	2490	!prop_is_being_removed(trans, sp)))
danw@154	2491	sp++;
danw@154	2492	if (sp == sprop_end)
danw@154	2493	break;
danw@154	2494
danw@154	2495	removed_package = &spool[spkgs[list_first(&sp->packages, &trans->system->package_pool)->data].name];
danw@154	2496
danw@154	2497	/* Skip 'up' to match */
danw@154	2498	up = skip_to_matching_property(trans, sp, up);
danw@154	2499	ur = first_up = up;
danw@154	2500
danw@154	2501	/* If the package is just being upgraded, we may
danw@154	2502	* already be installing an identical PROVIDES, so
danw@154	2503	* check for that.
danw@154	2504	*/
danw@154	2505	while (up < uprop_end &&
danw@154	2506	strcmp(&spool[sp->name], &upool[up->name]) == 0 &&
danw@154	2507	(up->type != RAZOR_PROPERTY_PROVIDES \|\|
danw@154	2508	sp->relation != up->relation \|\|
danw@154	2509	strcmp(&spool[sp->name], &upool[up->name]) != 0))
danw@154	2510	up++;
danw@154	2511	if (up < uprop_end &&
danw@154	2512	up->type == RAZOR_PROPERTY_PROVIDES &&
danw@154	2513	strcmp(&spool[sp->name], &upool[up->name]) == 0 &&
danw@154	2514	sp->relation == up->relation &&
danw@154	2515	strcmp(&spool[sp->version], &upool[up->version]) == 0 &&
danw@154	2516	prop_is_being_installed(trans, up)) {
danw@154	2517	up = first_up;
danw@154	2518	continue;
danw@154	2519	}
danw@154	2520	up = first_up;
danw@154	2521
danw@154	2522	/* For all still-installed packages that require
danw@154	2523	* sp->name, see if they are satisfied by any other
danw@154	2524	* still-installed or to-be-installed property. If
danw@154	2525	* not, either remove or attempt to update the
danw@154	2526	* package, depending on why the required property has
danw@154	2527	* disappeared
danw@154	2528	*/
danw@154	2529	sr = sp;
danw@154	2530	while (sr > sprops + 1 && (sr - 1)->name == sr->name)
danw@154	2531	sr--;
danw@154	2532	for (; sr->type == RAZOR_PROPERTY_REQUIRES; sr++) {
danw@154	2533	if (prop_is_being_removed(trans, sr))
danw@154	2534	continue;
danw@154	2535	if (find_installed_package_for_property(trans, sp, up, sr))
danw@154	2536	continue;
danw@154	2537
danw@154	2538	for (reqpkg = list_first(&sr->packages, &trans->system->package_pool); reqpkg; reqpkg = list_next(reqpkg)) {
danw@154	2539	if (!bitarray_get(&trans->syspkgs, reqpkg->data))
danw@154	2540	continue;
danw@154	2541	pkg = &spkgs[reqpkg->data];
danw@154	2542	if (prop_is_being_updated(trans, sp)) {
danw@160	2543	add_transaction_package(trans, NULL, pkg,
danw@160	2544	RAZOR_PACKAGE_FORCED_UPDATE,
danw@160	2545	removed_package, NULL);
danw@154	2546	} else {
danw@154	2547	add_transaction_package(trans, NULL, pkg,
danw@154	2548	RAZOR_PACKAGE_REMOVE,
danw@154	2549	removed_package, sr);
danw@154	2550	}
danw@154	2551	}
danw@154	2552	}
danw@154	2553	}
danw@154	2554	}
danw@129	2555
danw@137	2556	struct razor_transaction *
danw@137	2557	razor_transaction_create(struct razor_set system, struct razor_set upstream,
danw@137	2558	int update_count, const char **update_packages,
danw@137	2559	int remove_count, const char **remove_packages)
danw@137	2560	{
danw@141	2561	struct razor_transaction_resolver trans;
danw@141	2562	struct razor_transaction *ret_trans;
danw@160	2563	struct razor_transaction_package *tp;
danw@160	2564	int start, end, i;
danw@137	2565
danw@141	2566	trans.system = system;
danw@141	2567	trans.upstream = upstream ? upstream : razor_set_create();
danw@141	2568	array_init(&trans.packages);
danw@141	2569	bitarray_init(&trans.syspkgs, trans.system->packages.size / sizeof (struct razor_package), 1);
danw@141	2570	bitarray_init(&trans.uppkgs, trans.upstream->packages.size / sizeof (struct razor_package), 0);
danw@141	2571	trans.errors = 0;
danw@137	2572
danw@144	2573	if (update_count > 0 \|\| remove_count > 0) {
danw@160	2574	for (i = 0; i < update_count; i++) {
danw@160	2575	tp = array_add(&trans.packages, sizeof *tp);
danw@160	2576	memset(tp, 0, sizeof *tp);
danw@160	2577	tp->name = update_packages[i];
danw@160	2578	tp->state = RAZOR_PACKAGE_INSTALL;
danw@160	2579	}
danw@160	2580	for (i = 0; i < remove_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 = remove_packages[i];
danw@160	2584	tp->state = RAZOR_PACKAGE_REMOVE;
danw@160	2585	}
danw@144	2586	} else
danw@141	2587	find_all_packages(&trans);
danw@137	2588
danw@137	2589	start = 0;
danw@141	2590	end = trans.packages.size / sizeof (struct razor_transaction_package);
danw@137	2591
danw@160	2592	while (start != end) {
danw@160	2593	resolve_new_packages(&trans, start, end);
danw@160	2594	if (trans.errors)
danw@160	2595	break;
danw@160	2596
danw@160	2597	razor_transaction_satisfy(&trans);
danw@137	2598
danw@137	2599	start = end;
danw@141	2600	end = trans.packages.size / sizeof (struct razor_transaction_package);
danw@137	2601	}
danw@137	2602
danw@141	2603	ret_trans = zalloc(sizeof *ret_trans);
danw@141	2604	ret_trans->system = trans.system;
danw@141	2605	ret_trans->upstream = trans.upstream;
danw@141	2606	ret_trans->packages = trans.packages.data;
danw@141	2607	ret_trans->package_count = end;
danw@141	2608	ret_trans->errors = trans.errors;
danw@141	2609	return ret_trans;
danw@137	2610	}
danw@137	2611
danw@137	2612	const char * const razor_version_relations[] = {
danw@137	2613	/* same order as enum razor_version_relation */
danw@137	2614	"<", "<=", "=", ">=", ">"
danw@137	2615	};
danw@137	2616
danw@140	2617	const char * const razor_property_types[] = {
danw@140	2618	/* same order as enum razor_property_type */
danw@140	2619	"requires", "provides", "conflicts with", "obsoletes"
danw@140	2620	};
danw@140	2621
danw@137	2622	void
danw@137	2623	razor_transaction_describe(struct razor_transaction *trans)
danw@137	2624	{
danw@137	2625	struct razor_transaction_package p, pend, *tps;
danw@137	2626	int errors_only = 0;
danw@137	2627
danw@137	2628	tps = trans->packages;
danw@137	2629	pend = trans->packages + trans->package_count;
danw@137	2630	for (p = trans->packages; p < pend; p++) {
danw@137	2631	switch (p->state) {
danw@137	2632	case RAZOR_PACKAGE_INSTALL:
danw@137	2633	if (errors_only)
danw@137	2634	break;
danw@137	2635
danw@147	2636	printf("Installing %s %s", p->name, p->new_version);
danw@145	2637	if (p->dep_package) {
danw@145	2638	if (p->dep_type == RAZOR_PROPERTY_CONFLICTS &&
danw@145	2639	!strcmp(p->dep_package, p->name)) {
danw@147	2640	printf(" because %s %s conflicts with %s",
danw@147	2641	p->name, p->old_version, p->dep_property);
danw@145	2642	if (*p->dep_version) {
danw@145	2643	printf(" %s %s",
danw@145	2644	razor_version_relations[p->dep_relation],
danw@145	2645	p->dep_version);
danw@145	2646	}
danw@145	2647	} else {
danw@145	2648	printf(" for %s", p->dep_package);
danw@145	2649	if (*p->dep_version) {
danw@145	2650	printf(", which %s %s %s %s",
danw@145	2651	razor_property_types[p->dep_type],
danw@145	2652	p->dep_property,
danw@145	2653	razor_version_relations[p->dep_relation],
danw@145	2654	p->dep_version);
danw@145	2655	} else if (strcmp(p->dep_property, p->name) != 0) {
danw@145	2656	printf(", which %s %s",
danw@145	2657	razor_property_types[p->dep_type],
danw@145	2658	p->dep_property);
danw@145	2659	}
danw@137	2660	}
danw@137	2661	}
danw@137	2662	printf("\n");
danw@137	2663	break;
danw@137	2664
danw@154	2665	case RAZOR_PACKAGE_FORCED_UPDATE:
danw@154	2666	if (errors_only)
danw@154	2667	break;
danw@154	2668
danw@154	2669	printf("Updating %s to %s due to update of %s\n",
danw@154	2670	p->name, p->new_version, p->dep_package);
danw@154	2671	break;
danw@154	2672
danw@137	2673	case RAZOR_PACKAGE_REMOVE:
danw@137	2674	if (errors_only)
danw@137	2675	break;
danw@147	2676	printf("Removing %s %s", p->name, p->old_version);
danw@145	2677	if (p->dep_package) {
danw@154	2678	printf(" which required %s",
danw@154	2679	p->dep_package);
danw@162	2680	if (strcmp(p->dep_property, p->dep_package) != 0)
danw@154	2681	printf(" for %s", p->dep_property);
danw@154	2682	}
danw@154	2683	printf("\n");
danw@154	2684	break;
danw@154	2685
danw@154	2686	case RAZOR_PACKAGE_OBSOLETED:
danw@154	2687	if (errors_only)
danw@154	2688	break;
danw@154	2689	printf("Removing %s %s", p->name, p->old_version);
danw@154	2690	if (p->dep_package) {
danw@154	2691	printf(" which is obsoleted by %s",
danw@154	2692	p->dep_package);
danw@137	2693	}
danw@137	2694	printf("\n");
danw@137	2695	break;
danw@137	2696
danw@145	2697	case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:
danw@145	2698	printf("Error: can't install %s: not found\n", p->name);
danw@137	2699	errors_only = 1;
danw@137	2700	break;
danw@137	2701
danw@145	2702	case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:
danw@145	2703	printf("Error: can't remove %s: not installed\n", p->name);
danw@137	2704	errors_only = 1;
danw@137	2705	break;
danw@137	2706
danw@145	2707	case RAZOR_PACKAGE_UP_TO_DATE:
danw@147	2708	printf("Error: can't upgrade %s: %s is most recent version\n", p->name, p->old_version);
danw@145	2709	errors_only = 1;
danw@145	2710	break;
danw@145	2711
danw@145	2712	case RAZOR_PACKAGE_CONTRADICTION:
danw@147	2713	printf("Error: package %s is marked for both installation and removal\n", p->name);
danw@145	2714	errors_only = 1;
danw@145	2715	break;
danw@145	2716
danw@145	2717	case RAZOR_PACKAGE_OLD_CONFLICT:
danw@145	2718	printf("Error: can't install %s, because installed package %s conflicts with ",
danw@145	2719	p->name, p->dep_package);
danw@145	2720	if (*p->dep_version) {
danw@145	2721	printf("%s %s %s",
danw@145	2722	p->dep_property,
danw@145	2723	razor_version_relations[p->dep_relation],
danw@145	2724	p->dep_version);
danw@145	2725	} else
danw@145	2726	printf("it");
danw@145	2727	printf("\n");
danw@145	2728
danw@145	2729	errors_only = 1;
danw@145	2730	break;
danw@145	2731
danw@145	2732	case RAZOR_PACKAGE_NEW_CONFLICT:
danw@145	2733	printf("Error: can't install %s, because it conflicts with %s",
danw@145	2734	p->name, p->dep_package);
danw@145	2735	if (*p->dep_version) {
danw@145	2736	printf(" %s %s",
danw@145	2737	razor_version_relations[p->dep_relation],
danw@145	2738	p->dep_version);
danw@145	2739	}
danw@145	2740	printf("\n");
danw@145	2741
danw@145	2742	errors_only = 1;
danw@145	2743	break;
danw@145	2744
danw@145	2745	case RAZOR_PACKAGE_UNSATISFIABLE:
danw@145	2746	printf("Error: can't find package for %s", p->dep_property);
danw@145	2747	if (*p->dep_version) {
danw@145	2748	printf(" %s %s",
danw@145	2749	razor_version_relations[p->dep_relation],
danw@145	2750	p->dep_version);
danw@145	2751	}
danw@145	2752	printf(" which is required by %s\n",
danw@145	2753	p->dep_package);
danw@140	2754	errors_only = 1;
danw@140	2755	break;
danw@140	2756
danw@137	2757	default:
danw@137	2758	/* Shouldn't actually happen */
danw@137	2759	break;
danw@137	2760	}
danw@137	2761	}
danw@137	2762	}
danw@137	2763
danw@137	2764	struct razor_set *
danw@137	2765	razor_transaction_run(struct razor_transaction *trans)
danw@137	2766	{
danw@137	2767	struct array install_packages, remove_packages;
danw@137	2768	struct razor_merger *merger;
danw@137	2769	struct razor_package pkg, i, iend, r, rend, s, *send;
danw@137	2770	struct source source1, source2;
danw@137	2771	char spool, ipool, *rpool;
danw@137	2772	uint32_t *map;
danw@137	2773	int p, cmp;
danw@137	2774
danw@137	2775	/* FIXME */
danw@137	2776	if (trans->errors)
danw@137	2777	return NULL;
danw@137	2778
danw@137	2779	/* Sort the transaction packages into two arrays */
danw@137	2780	array_init(&install_packages);
danw@137	2781	array_init(&remove_packages);
danw@137	2782	for (p = 0; p < trans->package_count; p++) {
danw@160	2783	if (trans->packages[p].new_package) {
danw@137	2784	pkg = array_add(&install_packages, sizeof *pkg);
danw@147	2785	pkg = trans->packages[p].new_package;
danw@147	2786	} else {
danw@137	2787	pkg = array_add(&remove_packages, sizeof *pkg);
danw@147	2788	pkg = trans->packages[p].old_package;
danw@147	2789	}
danw@137	2790	}
danw@137	2791	map = qsort_with_data(install_packages.data,
danw@137	2792	install_packages.size / sizeof *pkg,
danw@137	2793	sizeof *pkg,
danw@137	2794	compare_packages,
danw@137	2795	trans->upstream);
danw@137	2796	free(map);
danw@137	2797	map = qsort_with_data(remove_packages.data,
danw@137	2798	remove_packages.size / sizeof *pkg,
danw@137	2799	sizeof *pkg,
danw@137	2800	compare_packages,
danw@137	2801	trans->system);
danw@137	2802	free(map);
danw@137	2803
danw@137	2804	merger = razor_merger_create(trans->system, trans->upstream);
danw@137	2805
danw@137	2806	source1 = &merger->source1;
danw@137	2807	source2 = &merger->source2;
danw@137	2808
danw@137	2809	i = install_packages.data;
danw@137	2810	iend = install_packages.data + install_packages.size;
danw@137	2811	ipool = trans->upstream->string_pool.data;
danw@137	2812
danw@137	2813	r = remove_packages.data;
danw@137	2814	rend = remove_packages.data + remove_packages.size;
danw@137	2815	rpool = trans->system->string_pool.data;
danw@137	2816
danw@137	2817	s = trans->system->packages.data;
danw@137	2818	send = trans->system->packages.data + trans->system->packages.size;
danw@137	2819	spool = trans->system->string_pool.data;
danw@137	2820
danw@137	2821	while (s < send \|\| i < iend) {
danw@137	2822	/* Check if s is being removed */
danw@137	2823	if (s < send && r < rend &&
danw@137	2824	s->name == r->name && s->version && r->version) {
danw@137	2825	s++;
danw@137	2826	r++;
danw@137	2827	continue;
danw@137	2828	}
danw@137	2829
danw@137	2830	if (s < send && i < iend)
danw@137	2831	cmp = strcmp(&spool[s->name], &ipool[i->name]);
danw@137	2832	else if (s < send)
danw@137	2833	cmp = -1;
danw@137	2834	else
danw@137	2835	cmp = 1;
danw@137	2836	if (cmp < 0) {
danw@137	2837	add_package(merger, s, source1, 0);
danw@137	2838	s++;
danw@137	2839	} else if (cmp == 0) {
danw@137	2840	add_package(merger, i, source2, UPSTREAM_SOURCE);
danw@137	2841	s++;
danw@137	2842	i++;
danw@137	2843	} else {
danw@137	2844	add_package(merger, i, source2, UPSTREAM_SOURCE);
danw@137	2845	i++;
danw@137	2846	}
danw@137	2847	}
danw@137	2848
danw@137	2849	array_release(&install_packages);
danw@137	2850	array_release(&remove_packages);
danw@137	2851
danw@137	2852	return razor_merger_finish(merger);
danw@137	2853	}
danw@137	2854
danw@137	2855	void
danw@137	2856	razor_transaction_destroy(struct razor_transaction *trans)
danw@137	2857	{
danw@137	2858	int p;
danw@137	2859
danw@137	2860	for (p = 0; p < trans->package_count; p++) {
danw@145	2861	if (!trans->packages[p].dep_package &&
danw@137	2862	(trans->packages[p].state == RAZOR_PACKAGE_INSTALL_UNAVAILABLE \|\|
danw@137	2863	trans->packages[p].state == RAZOR_PACKAGE_REMOVE_NOT_INSTALLED))
danw@137	2864	free((char *)trans->packages[p].name);
danw@137	2865	}
danw@137	2866	free(trans);
danw@137	2867
danw@137	2868	/* FIXME: free upstream if it was created as an empty set */
danw@137	2869	}

author	Dan Winship <danw@gnome.org>
	Tue Mar 11 16:48:20 2008 -0400 (2008-03-11)
changeset 163	978c98ddb8aa
parent 162	9170be6cebf0
child 164	ed154b422dc0
permissions	-rw-r--r--