krh@15: #define _GNU_SOURCE
krh@15: 
krh@0: #include <stdlib.h>
krh@19: #include <stddef.h>
danw@108: #include <stdint.h>
krh@0: #include <stdio.h>
krh@0: #include <string.h>
krh@0: #include <sys/types.h>
krh@0: #include <sys/stat.h>
krh@0: #include <sys/mman.h>
krh@0: #include <unistd.h>
krh@0: #include <fcntl.h>
krh@15: #include <errno.h>
krh@35: #include <ctype.h>
krh@54: #include <fnmatch.h>
krh@0: 
krh@27: #include "razor.h"
krh@91: #include "razor-internal.h"
danw@115: #include "types.h"
krh@30: 
krh@30: struct razor_set_section {
danw@108: 	uint32_t type;
danw@108: 	uint32_t offset;
danw@108: 	uint32_t size;
krh@30: };
krh@30: 
krh@30: struct razor_set_header {
danw@108: 	uint32_t magic;
danw@108: 	uint32_t version;
krh@30: 	struct razor_set_section sections[0];
krh@30: };
krh@30: 
krh@30: #define RAZOR_MAGIC 0x7a7a7a7a
krh@30: #define RAZOR_VERSION 1
krh@30: 
krh@66: #define RAZOR_STRING_POOL	0
krh@66: #define RAZOR_PACKAGES		1
krh@66: #define RAZOR_PROPERTIES	2
krh@66: #define RAZOR_FILES		3
krh@66: #define RAZOR_PACKAGE_POOL	4
krh@66: #define RAZOR_PROPERTY_POOL	5
krh@66: #define RAZOR_FILE_POOL		6
krh@30: 
krh@30: struct razor_package {
danw@120: 	uint name  : 24;
danw@120: 	uint flags : 8;
danw@108: 	uint32_t version;
danw@117: 	struct list_head properties;
danw@117: 	struct list_head files;
krh@30: };
krh@30: 
krh@30: struct razor_property {
danw@119: 	uint name  : 24;
danw@119: 	uint flags : 6;
danw@119: 	uint type  : 2;
danw@109: 	uint32_t relation;
danw@108: 	uint32_t version;
danw@117: 	struct list_head packages;
krh@30: };
krh@30: 
krh@48: struct razor_entry {
danw@120: 	uint name  : 24;
danw@120: 	uint flags : 8;
danw@108: 	uint32_t start;
danw@117: 	struct list_head packages;
krh@48: };
krh@48: 
danw@120: #define RAZOR_ENTRY_LAST	0x80
danw@120: 
krh@30: struct razor_set {
krh@30: 	struct array string_pool;
krh@30:  	struct array packages;
krh@66:  	struct array properties;
krh@56:  	struct array files;
krh@56: 	struct array package_pool;
krh@66:  	struct array property_pool;
krh@56:  	struct array file_pool;
krh@30: 	struct razor_set_header *header;
krh@30: };
krh@30: 
krh@52: struct import_entry {
danw@108: 	uint32_t package;
krh@52: 	char *name;
krh@52: };
krh@52: 
krh@52: struct import_directory {
danw@108: 	uint32_t name, count;
krh@52: 	struct array files;
krh@52: 	struct array packages;
krh@52: 	struct import_directory *last;
krh@52: };
krh@52: 
krh@30: struct razor_importer {
krh@30: 	struct razor_set *set;
krh@78: 	struct hashtable table;
krh@30: 	struct razor_package *package;
krh@66: 	struct array properties;
krh@48: 	struct array files;
krh@30: };
krh@30: 
krh@0: static void *
krh@0: zalloc(size_t size)
krh@0: {
krh@0: 	void *p;
krh@0: 
krh@0: 	p = malloc(size);
krh@0: 	memset(p, 0, size);
krh@0: 
krh@0: 	return p;
krh@0: }
krh@0: 
krh@19: struct razor_set_section razor_sections[] = {
krh@56: 	{ RAZOR_STRING_POOL,	offsetof(struct razor_set, string_pool) },
krh@19: 	{ RAZOR_PACKAGES,	offsetof(struct razor_set, packages) },
krh@66: 	{ RAZOR_PROPERTIES,	offsetof(struct razor_set, properties) },
krh@56: 	{ RAZOR_FILES,		offsetof(struct razor_set, files) },
krh@39: 	{ RAZOR_PACKAGE_POOL,	offsetof(struct razor_set, package_pool) },
krh@66: 	{ RAZOR_PROPERTY_POOL,	offsetof(struct razor_set, property_pool) },
krh@56: 	{ RAZOR_FILE_POOL,	offsetof(struct razor_set, file_pool) },
krh@19: };
krh@19: 
krh@4: struct razor_set *
krh@4: razor_set_create(void)
krh@0: {
krh@18: 	return zalloc(sizeof(struct razor_set));
krh@0: }
krh@0: 
krh@4: struct razor_set *
krh@4: razor_set_open(const char *filename)
krh@0: {
krh@4: 	struct razor_set *set;
krh@19: 	struct razor_set_section *s;
krh@0: 	struct stat stat;
krh@19: 	struct array *array;
krh@19: 	int fd;
krh@0: 
krh@4: 	set = zalloc(sizeof *set);
krh@0: 	fd = open(filename, O_RDONLY);
krh@0: 	if (fstat(fd, &stat) < 0)
krh@0: 		return NULL;
krh@4: 	set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
krh@4: 	if (set->header == MAP_FAILED) {
krh@4: 		free(set);
krh@0: 		return NULL;
krh@0: 	}
krh@0: 
krh@19: 	for (s = set->header->sections; ~s->type; s++) {
krh@19: 		if (s->type >= ARRAY_SIZE(razor_sections))
krh@19: 			continue;
krh@19: 		if (s->type != razor_sections[s->type].type)
krh@19: 			continue;
krh@19: 		array = (void *) set + razor_sections[s->type].offset;
krh@19: 		array->data = (void *) set->header + s->offset;
krh@19: 		array->size = s->size;
krh@19: 		array->alloc = s->size;
krh@0: 	}
krh@0: 	close(fd);
krh@0: 
krh@4: 	return set;
krh@0: }
krh@0: 
krh@0: void
krh@4: razor_set_destroy(struct razor_set *set)
krh@0: {
krh@0: 	unsigned int size;
krh@19: 	struct array *a;
krh@0: 	int i;
krh@0: 
krh@4: 	if (set->header) {
krh@4: 		for (i = 0; set->header->sections[i].type; i++)
krh@0: 			;
krh@4: 		size = set->header->sections[i].type;
krh@4: 		munmap(set->header, size);
krh@0: 	} else {
krh@19: 		for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19: 			a = (void *) set + razor_sections[i].offset;
krh@19: 			free(a->data);
krh@19: 		}
krh@0: 	}
krh@0: 
krh@4: 	free(set);
krh@0: }
krh@0: 
krh@43: int
krh@4: razor_set_write(struct razor_set *set, const char *filename)
krh@0: {
krh@0: 	char data[4096];
krh@4: 	struct razor_set_header *header = (struct razor_set_header *) data;
krh@19: 	struct array *a;
danw@108: 	uint32_t offset;
krh@17: 	int i, fd;
krh@0: 
krh@0: 	memset(data, 0, sizeof data);
krh@4: 	header->magic = RAZOR_MAGIC;
krh@4: 	header->version = RAZOR_VERSION;
krh@17: 	offset = sizeof data;
krh@0: 
krh@19: 	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19: 		if (razor_sections[i].type != i)
krh@19: 			continue;
krh@19: 		a = (void *) set + razor_sections[i].offset;
krh@19: 		header->sections[i].type = i;
krh@17: 		header->sections[i].offset = offset;
krh@19: 		header->sections[i].size = a->size;
krh@91: 		offset += ALIGN(a->size, 4096);
krh@17: 	}
krh@0: 
krh@19: 	header->sections[i].type = ~0;
krh@17: 	header->sections[i].offset = 0;
krh@17: 	header->sections[i].size = 0;
krh@10: 
krh@0: 	fd = open(filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);
krh@0: 	if (fd < 0)
krh@0: 		return -1;
krh@0: 
krh@91: 	razor_write(fd, data, sizeof data);
danw@113: 	memset(data, 0, sizeof data);
krh@19: 	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19: 		if (razor_sections[i].type != i)
krh@19: 			continue;
krh@19: 		a = (void *) set + razor_sections[i].offset;
danw@113: 		razor_write(fd, a->data, a->size);
danw@113: 		razor_write(fd, data, ALIGN(a->size, 4096) - a->size);
krh@19: 	}
krh@17: 
krh@17: 	close(fd);
krh@0: 
krh@0: 	return 0;
krh@0: }
krh@0: 
krh@27: void
krh@30: razor_importer_begin_package(struct razor_importer *importer,
krh@30: 			     const char *name, const char *version)
krh@13: {
krh@25: 	struct razor_package *p;
krh@13: 
krh@30: 	p = array_add(&importer->set->packages, sizeof *p);
krh@95: 	p->name = hashtable_tokenize(&importer->table, name);
danw@120: 	p->flags = 0;
krh@95: 	p->version = hashtable_tokenize(&importer->table, version);
krh@13: 
krh@30: 	importer->package = p;
krh@66: 	array_init(&importer->properties);
krh@13: }
krh@13: 
krh@13: void
krh@30: razor_importer_finish_package(struct razor_importer *importer)
krh@13: {
danw@117: 	list_set_array(&importer->package->properties,
danw@117: 		       &importer->set->property_pool,
danw@124: 		       &importer->properties,
danw@124: 		       1);
krh@13: 
krh@66: 	array_release(&importer->properties);
krh@13: }
krh@13: 
krh@66: void
krh@30: razor_importer_add_property(struct razor_importer *importer,
danw@109: 			    const char *name,
danw@109: 			    enum razor_version_relation relation,
danw@109: 			    const char *version,
krh@66: 			    enum razor_property_type type)
krh@13: {
krh@25: 	struct razor_property *p;
danw@108: 	uint32_t *r;
krh@13: 
krh@66: 	p = array_add(&importer->set->properties, sizeof *p);
danw@119: 	p->name = hashtable_tokenize(&importer->table, name);
danw@119: 	p->flags = 0;
danw@119: 	p->type = type;
danw@109: 	p->relation = relation;
krh@95: 	p->version = hashtable_tokenize(&importer->table, version);
danw@117: 	list_set_ptr(&p->packages, importer->package -
danw@117: 		     (struct razor_package *) importer->set->packages.data);
krh@13: 
krh@66: 	r = array_add(&importer->properties, sizeof *r);
krh@66: 	*r = p - (struct razor_property *) importer->set->properties.data;
krh@30: }
krh@30: 
krh@46: void
krh@46: razor_importer_add_file(struct razor_importer *importer, const char *name)
krh@46: {
krh@52: 	struct import_entry *e;
krh@48: 
krh@52: 	e = array_add(&importer->files, sizeof *e);
krh@52: 
krh@52: 	e->package = importer->package -
krh@52: 		(struct razor_package *) importer->set->packages.data;
krh@52: 	e->name = strdup(name);
krh@46: }
krh@46: 
krh@30: struct razor_importer *
krh@30: razor_importer_new(void)
krh@30: {
krh@30: 	struct razor_importer *importer;
krh@30: 
krh@30: 	importer = zalloc(sizeof *importer);
krh@30: 	importer->set = razor_set_create();
krh@78: 	hashtable_init(&importer->table, &importer->set->string_pool);
krh@30: 
krh@30: 	return importer;
krh@9: }
krh@9: 
krh@75: /* Destroy an importer without creating the set. */
krh@75: void
krh@75: razor_importer_destroy(struct razor_importer *importer)
krh@75: {
krh@75: 	/* FIXME: write this */
krh@75: }
krh@75: 
krh@75: 
krh@22: typedef int (*compare_with_data_func_t)(const void *p1,
krh@22: 					const void *p,
krh@22: 					void *data);
krh@22: 
krh@25: struct qsort_context {
krh@25: 	size_t size;
krh@25: 	compare_with_data_func_t compare;
krh@25: 	void *data;
krh@25: };
krh@25: 
krh@22: static void
krh@22: qsort_swap(void *p1, void *p2, size_t size)
krh@22: {
krh@22: 	char buffer[size];
krh@22: 
krh@22: 	memcpy(buffer, p1, size);
krh@22: 	memcpy(p1, p2, size);
krh@22: 	memcpy(p2, buffer, size);
krh@22: }
krh@22: 
krh@25: static void
danw@108: __qsort_with_data(void *base, size_t nelem, uint32_t *map,
krh@25: 		  struct qsort_context *ctx)
krh@22: {
krh@22: 	void *p, *start, *end, *pivot;
danw@108: 	uint32_t *mp, *mstart, *mend, tmp;
krh@22: 	int left, right, result;
krh@25: 	size_t size = ctx->size;
krh@22: 
krh@22: 	p = base;
krh@22: 	start = base;
krh@22: 	end = base + nelem * size;
krh@25: 	mp = map;
krh@25: 	mstart = map;
krh@25: 	mend = map + nelem;
krh@22: 	pivot = base + (random() % nelem) * size;
krh@25: 
krh@22: 	while (p < end) {
krh@25: 		result = ctx->compare(p, pivot, ctx->data);
krh@22: 		if (result < 0) {
krh@22: 			qsort_swap(p, start, size);
krh@25: 			tmp = *mp;
krh@25: 			*mp = *mstart;
krh@25: 			*mstart = tmp;
krh@22: 			if (start == pivot)
krh@22: 				pivot = p;
krh@22: 			start += size;
krh@25: 			mstart++;
krh@22: 			p += size;
krh@29: 			mp++;
krh@22: 		} else if (result == 0) {
krh@22: 			p += size;
krh@25: 			mp++;
krh@22: 		} else {
krh@22:  			end -= size;
krh@25: 			mend--;
krh@22: 			qsort_swap(p, end, size);
krh@25: 			tmp = *mp;
krh@29: 			*mp = *mend;
krh@29: 			*mend = tmp;
krh@22: 			if (end == pivot)
krh@22: 				pivot = p;
krh@22: 		}
krh@22: 	}
krh@22: 
krh@22: 	left = (start - base) / size;
krh@22: 	right = (base + nelem * size - end) / size;
krh@22: 	if (left > 1)
krh@25: 		__qsort_with_data(base, left, map, ctx);
krh@22: 	if (right > 1)
krh@25: 		__qsort_with_data(end, right, mend, ctx);
krh@25: }
krh@25: 
danw@137: static uint32_t *
krh@25: qsort_with_data(void *base, size_t nelem, size_t size,
krh@25: 		compare_with_data_func_t compare, void *data)
krh@25: {
krh@25: 	struct qsort_context ctx;
danw@108: 	uint32_t *map;
krh@25: 	int i;
krh@25: 
krh@75: 	if (nelem == 0)
krh@75: 		return NULL;
krh@75: 
krh@25: 	ctx.size = size;
krh@25: 	ctx.compare = compare;
krh@25: 	ctx.data = data;
krh@25: 
danw@108: 	map = malloc(nelem * sizeof (uint32_t));
krh@25: 	for (i = 0; i < nelem; i++)
krh@25: 		map[i] = i;
krh@25: 
krh@25: 	__qsort_with_data(base, nelem, map, &ctx);
krh@25: 
krh@25: 	return map;
krh@22: }
krh@9: 
krh@9: static int
krh@35: versioncmp(const char *s1, const char *s2)
krh@35: {
krh@35: 	const char *p1, *p2;
krh@35: 	long n1, n2;
krh@35: 	int res;
krh@35: 
krh@35: 	n1 = strtol(s1, (char **) &p1, 0);
krh@35: 	n2 = strtol(s2, (char **) &p2, 0);
krh@35: 
krh@35: 	/* Epoch; if one but not the other has an epoch set, default
krh@35: 	 * the epoch-less version to 0. */
krh@35: 	res = (*p1 == ':') - (*p2 == ':');
krh@35: 	if (res < 0) {
krh@35: 		n1 = 0;
krh@35: 		p1 = s1;
krh@35: 		p2++;
krh@35: 	} else if (res > 0) {
krh@35: 		p1++;
krh@35: 		n2 = 0;
krh@35: 		p2 = s2;
krh@35: 	}
krh@35: 
krh@35: 	if (n1 != n2)
krh@35: 		return n1 - n2;
krh@35: 	while (*p1 && *p2) {
krh@35: 		if (*p1 != *p2)
krh@35: 			return *p1 - *p2;
krh@35: 		p1++;
krh@35: 		p2++;
krh@35: 		if (isdigit(*p1) && isdigit(*p2))
krh@35: 			return versioncmp(p1, p2);
krh@35: 	}
krh@35: 
krh@35: 	return *p1 - *p2;
krh@35: }
krh@35: 
krh@35: static int
krh@22: compare_packages(const void *p1, const void *p2, void *data)
krh@9: {
krh@25: 	const struct razor_package *pkg1 = p1, *pkg2 = p2;
krh@22: 	struct razor_set *set = data;
krh@22: 	char *pool = set->string_pool.data;
krh@9: 
danw@120: 	/* FIXME: what if the flags are different? */
krh@23: 	if (pkg1->name == pkg2->name)
krh@35: 		return versioncmp(&pool[pkg1->version], &pool[pkg2->version]);
krh@23: 	else
krh@23: 		return strcmp(&pool[pkg1->name], &pool[pkg2->name]);
krh@9: }
krh@9: 
krh@9: static int
krh@22: compare_properties(const void *p1, const void *p2, void *data)
krh@9: {
krh@25: 	const struct razor_property *prop1 = p1, *prop2 = p2;
krh@22: 	struct razor_set *set = data;
krh@22: 	char *pool = set->string_pool.data;
krh@9: 
danw@119: 	if (prop1->name != prop2->name) 
danw@119: 		return strcmp(&pool[prop1->name], &pool[prop2->name]);
danw@119: 	else if (prop1->type != prop2->type)
danw@119: 		return prop1->type - prop2->type;
danw@119: 	else if (prop1->relation != prop2->relation)
danw@119: 		return prop1->relation - prop2->relation;
krh@12: 	else
danw@119: 		return versioncmp(&pool[prop1->version], &pool[prop2->version]);
krh@9: }
krh@9: 
danw@108: static uint32_t *
krh@66: uniqueify_properties(struct razor_set *set)
krh@9: {
krh@25: 	struct razor_property *rp, *up, *rp_end;
krh@18: 	struct array *pkgs, *p;
danw@117: 	struct list_head *r;
danw@117: 	uint32_t *map, *rmap;
krh@18: 	int i, count, unique;
krh@9: 
krh@66: 	count = set->properties.size / sizeof(struct razor_property);
krh@66: 	map = qsort_with_data(set->properties.data,
krh@25: 			      count,
krh@25: 			      sizeof(struct razor_property),
krh@25: 			      compare_properties,
krh@25: 			      set);
krh@9: 
krh@66: 	rp_end = set->properties.data + set->properties.size;
krh@25: 	rmap = malloc(count * sizeof *map);
krh@25: 	pkgs = zalloc(count * sizeof *pkgs);
krh@66: 	for (rp = set->properties.data, up = rp, i = 0; rp < rp_end; rp++, i++) {
danw@119: 		if (rp->name != up->name || rp->type != up->type ||
danw@119: 		    rp->relation != up->relation || rp->version != up->version) {
krh@25: 			up++;
krh@25: 			up->name = rp->name;
danw@119: 			up->flags = 0;
danw@119: 			up->type = rp->type;
danw@109: 			up->relation = rp->relation;
krh@25: 			up->version = rp->version;
krh@10: 		}
krh@25: 
krh@66: 		unique = up - (struct razor_property *) set->properties.data;
krh@25: 		rmap[map[i]] = unique;
krh@25: 		r = array_add(&pkgs[unique], sizeof *r);
krh@25: 		*r = rp->packages;
krh@10: 	}
krh@25: 	free(map);
krh@9: 
danw@124: 	if (up != rp)
danw@124: 		up++;
krh@66: 	set->properties.size = (void *) up - set->properties.data;
krh@25: 	rp_end = up;
krh@66: 	for (rp = set->properties.data, p = pkgs; rp < rp_end; rp++, p++) {
danw@124: 		list_set_array(&rp->packages, &set->package_pool, p, 0);
krh@25: 		array_release(p);
krh@18: 	}
krh@18: 
krh@18: 	free(pkgs);
krh@18: 
krh@25: 	return rmap;
krh@10: }
krh@10: 
krh@48: static int
krh@48: compare_filenames(const void *p1, const void *p2, void *data)
krh@48: {
krh@52: 	const struct import_entry *e1 = p1;
krh@52: 	const struct import_entry *e2 = p2;
danw@126: 	const char *n1 = e1->name;
danw@126: 	const char *n2 = e2->name;
krh@48: 
danw@126: 	/* Need to make sure that the contents of a directory
danw@126: 	 * are sorted immediately after it. So "foo/bar" has to
danw@126: 	 * sort before "foo.conf"
danw@126: 	 *
danw@126: 	 * FIXME: this is about 60% slower than strcmp
danw@126: 	 */
danw@126: 	while (*n1 && *n2) {
danw@126: 		if (*n1 < *n2)
danw@126: 			return *n2 == '/' ? 1 : -1;
danw@126: 		else if (*n1 > *n2)
danw@126: 			return *n1 == '/' ? -1 : 1;
danw@126: 		n1++;
danw@126: 		n2++;
danw@126: 	}
danw@126: 	if (*n1)
danw@126: 		return 1;
danw@126: 	else if (*n2)
danw@126: 		return -1;
danw@126: 	else
danw@126: 		return 0;
krh@48: }
krh@48: 
krh@48: static void
krh@52: count_entries(struct import_directory *d)
krh@48: {
krh@52: 	struct import_directory *p, *end;
krh@48: 
krh@48: 	p = d->files.data;
krh@48: 	end = d->files.data + d->files.size;
krh@48: 	d->count = 0;
krh@48: 	while (p < end) {
krh@48: 		count_entries(p);
krh@48: 		d->count += p->count + 1;
krh@48: 		p++;
krh@48: 	}		
krh@48: }
krh@48: 
krh@48: static void
krh@52: serialize_files(struct razor_set *set,
krh@52: 		struct import_directory *d, struct array *array)
krh@48: {
krh@52: 	struct import_directory *p, *end;
krh@56: 	struct razor_entry *e = NULL;
danw@114: 	uint32_t s;
krh@48: 
krh@48: 	p = d->files.data;
krh@48: 	end = d->files.data + d->files.size;
krh@48: 	s = array->size / sizeof *e + d->files.size / sizeof *p;
krh@48: 	while (p < end) {
krh@48: 		e = array_add(array, sizeof *e);
krh@48: 		e->name = p->name;
danw@120: 		e->flags = 0;
krh@56: 		e->start = p->count > 0 ? s : 0;
krh@48: 		s += p->count;
krh@60: 
danw@124: 		list_set_array(&e->packages, &set->package_pool, &p->packages, 0);
krh@52: 		array_release(&p->packages);
krh@48: 		p++;
krh@48: 	}		
krh@56: 	if (e != NULL)
danw@120: 		e->flags |= RAZOR_ENTRY_LAST;
krh@48: 
krh@48: 	p = d->files.data;
krh@48: 	end = d->files.data + d->files.size;
krh@48: 	while (p < end) {
krh@52: 		serialize_files(set, p, array);
krh@48: 		p++;
krh@48: 	}
krh@48: }
krh@48: 
krh@48: static void
danw@108: remap_property_package_links(struct array *properties, uint32_t *rmap)
krh@61: {
krh@61: 	struct razor_property *p, *end;
krh@61: 
krh@61: 	end = properties->data + properties->size;
krh@61: 	for (p = properties->data; p < end; p++)
danw@117: 		list_remap_head(&p->packages, rmap);
krh@61: }
krh@61: 
krh@61: static void
krh@48: build_file_tree(struct razor_importer *importer)
krh@48: {
krh@48: 	int count, i, length;
krh@52: 	struct import_entry *filenames;
krh@52: 	char *f, *end;
danw@108: 	uint32_t name, *r;
krh@48: 	char dirname[256];
krh@52: 	struct import_directory *d, root;
krh@48: 	struct razor_entry *e;
krh@48: 
krh@52: 	count = importer->files.size / sizeof (struct import_entry);
krh@48: 	qsort_with_data(importer->files.data,
krh@48: 			count,
krh@52: 			sizeof (struct import_entry),
krh@48: 			compare_filenames,
krh@48: 			NULL);
krh@48: 
krh@95: 	root.name = hashtable_tokenize(&importer->table, "");
krh@48: 	array_init(&root.files);
krh@52: 	array_init(&root.packages);
krh@48: 	root.last = NULL;
krh@48: 
krh@48: 	filenames = importer->files.data;
krh@48: 	for (i = 0; i < count; i++) {
krh@52: 		f = filenames[i].name;
krh@48: 		if (*f != '/')
krh@48: 			continue;
krh@57: 		f++;
krh@48: 
krh@48: 		d = &root;
krh@48: 		while (*f) {
krh@57: 			end = strchr(f, '/');
krh@48: 			if (end == NULL)
krh@48: 				end = f + strlen(f);
krh@57: 			length = end - f;
krh@57: 			memcpy(dirname, f, length);
krh@48: 			dirname[length] ='\0';
krh@95: 			name = hashtable_tokenize(&importer->table, dirname);
krh@48: 			if (d->last == NULL || d->last->name != name) {
krh@48: 				d->last = array_add(&d->files, sizeof *d);
krh@48: 				d->last->name = name;
krh@48: 				d->last->last = NULL;
krh@48: 				array_init(&d->last->files);
krh@52: 				array_init(&d->last->packages);
krh@48: 			}
krh@48: 			d = d->last;				
krh@57: 			f = end + 1;
krh@57: 			if (*end == '\0')
krh@57: 				break;
krh@48: 		}
krh@48: 
krh@52: 		r = array_add(&d->packages, sizeof *r);
krh@52: 		*r = filenames[i].package;
krh@52: 		free(filenames[i].name);
krh@48: 	}
krh@48: 
krh@48: 	count_entries(&root);
krh@56: 	array_init(&importer->set->files);
krh@48: 
krh@56: 	e = array_add(&importer->set->files, sizeof *e);
danw@120: 	e->name = root.name;
danw@120: 	e->flags = RAZOR_ENTRY_LAST;
danw@129: 	e->start = importer->files.size ? 1 : 0;
danw@117: 	list_set_empty(&e->packages);
krh@48: 
krh@56: 	serialize_files(importer->set, &root, &importer->set->files);
krh@48: 
krh@48: 	array_release(&importer->files);
krh@48: }
krh@48: 
krh@56: static void
danw@108: build_package_file_lists(struct razor_set *set, uint32_t *rmap)
krh@54: {
krh@56: 	struct razor_package *p, *packages;
krh@56: 	struct array *pkgs;
krh@54: 	struct razor_entry *e, *end;
danw@117: 	struct list *r;
danw@117: 	uint32_t *q;
krh@56: 	int i, count;
krh@54: 
krh@56: 	count = set->packages.size / sizeof *p;
krh@56: 	pkgs = zalloc(count * sizeof *pkgs);
krh@54: 
krh@56: 	end = set->files.data + set->files.size;
krh@92: 	for (e = set->files.data; e < end; e++) {
danw@117: 		list_remap_head(&e->packages, rmap);
danw@116: 		r = list_first(&e->packages, &set->package_pool);
danw@116: 		while (r) {
danw@117: 			q = array_add(&pkgs[r->data], sizeof *q);
krh@56: 			*q = e - (struct razor_entry *) set->files.data;
danw@116: 			r = list_next(r);
krh@54: 		}
krh@54: 	}
krh@54: 
krh@56: 	packages = set->packages.data;
krh@56: 	for (i = 0; i < count; i++) {
danw@124: 		list_set_array(&packages[i].files, &set->file_pool, &pkgs[i], 0);
krh@56: 		array_release(&pkgs[i]);
krh@48: 	}
krh@56: 	free(pkgs);
krh@52: }
krh@52: 
krh@27: struct razor_set *
krh@30: razor_importer_finish(struct razor_importer *importer)
krh@9: {
krh@30: 	struct razor_set *set;
danw@108: 	uint32_t *map, *rmap;
krh@39: 	int i, count;
krh@18: 
krh@66: 	map = uniqueify_properties(importer->set);
danw@116: 	list_remap_pool(&importer->set->property_pool, map);
krh@39: 	free(map);
krh@25: 
krh@30: 	count = importer->set->packages.size / sizeof(struct razor_package);
krh@30: 	map = qsort_with_data(importer->set->packages.data,
krh@25: 			      count,
krh@25: 			      sizeof(struct razor_package),
krh@25: 			      compare_packages,
krh@30: 			      importer->set);
krh@39: 
krh@39: 	rmap = malloc(count * sizeof *rmap);
krh@39: 	for (i = 0; i < count; i++)
krh@39: 		rmap[map[i]] = i;
krh@25: 	free(map);
krh@13: 
krh@48: 	build_file_tree(importer);
danw@116: 	list_remap_pool(&importer->set->package_pool, rmap);
krh@60: 	build_package_file_lists(importer->set, rmap);
krh@66: 	remap_property_package_links(&importer->set->properties, rmap);
krh@52: 	free(rmap);
krh@48: 
krh@30: 	set = importer->set;
krh@78: 	hashtable_release(&importer->table);
krh@30: 	free(importer);
krh@30: 
krh@30: 	return set;
krh@9: }
krh@9: 
krh@92: struct razor_package_iterator {
krh@92: 	struct razor_set *set;
krh@92: 	struct razor_package *package, *end;
danw@117: 	struct list *index;
krh@92: };
krh@92: 
danw@137: static struct razor_package_iterator *
krh@101: razor_package_iterator_create_with_index(struct razor_set *set,
danw@117: 					 struct list *index)
krh@3: {
krh@92: 	struct razor_package_iterator *pi;
krh@92: 
krh@92: 	pi = zalloc(sizeof *pi);
krh@92: 	pi->set = set;
krh@101: 	pi->index = index;
krh@92: 
krh@92: 	return pi;
krh@92: }
krh@92: 
krh@101: struct razor_package_iterator *
krh@101: razor_package_iterator_create(struct razor_set *set)
krh@101: {
danw@116: 	struct razor_package_iterator *pi;
danw@116: 
danw@116: 	pi = zalloc(sizeof *pi);
danw@116: 	pi->set = set;
danw@116: 	pi->end = set->packages.data + set->packages.size;
danw@116: 	pi->package = set->packages.data;
danw@116: 
danw@116: 	return pi;
krh@101: }
krh@101: 
krh@101: struct razor_package_iterator *
krh@101: razor_package_iterator_create_for_property(struct razor_set *set,
krh@101: 					   struct razor_property *property)
krh@101: {
danw@117: 	struct list *index;
krh@101: 
danw@116: 	index = list_first(&property->packages, &set->package_pool);
krh@101: 	return razor_package_iterator_create_with_index(set, index);
krh@101: }
krh@101: 
krh@92: int
krh@92: razor_package_iterator_next(struct razor_package_iterator *pi,
krh@92: 			    struct razor_package **package,
krh@92: 			    const char **name, const char **version)
krh@92: {
krh@6: 	char *pool;
krh@101: 	int valid;
krh@101: 	struct razor_package *p, *packages;
krh@3: 
danw@116: 	if (pi->package) {
krh@101: 		p = pi->package++;
krh@101: 		valid = p < pi->end;
danw@116: 	} else if (pi->index) {
danw@116: 		packages = pi->set->packages.data;
danw@117: 		p = &packages[pi->index->data];
danw@116: 		pi->index = list_next(pi->index);
danw@116: 		valid = 1;
danw@116: 	} else
danw@116: 		valid = 0;
krh@92: 
krh@101: 	if (valid) {
krh@101: 		pool = pi->set->string_pool.data;
krh@101: 		*package = p;
danw@120: 		*name = &pool[p->name];
krh@101: 		*version = &pool[p->version];
krh@101: 	} else {
krh@101: 		*package = NULL;
krh@101: 	}
krh@101: 
krh@101: 	return valid;
krh@92: }
krh@92: 
krh@92: void
krh@92: razor_package_iterator_destroy(struct razor_package_iterator *pi)
krh@92: {
krh@92: 	free(pi);
krh@3: }
krh@3: 
krh@10: struct razor_package *
krh@10: razor_set_get_package(struct razor_set *set, const char *package)
krh@10: {
krh@97: 	struct razor_package_iterator *pi;
krh@97: 	struct razor_package *p;
krh@97: 	const char *name, *version;
krh@97: 
krh@97: 	pi = razor_package_iterator_create(set);
krh@97: 	while (razor_package_iterator_next(pi, &p, &name, &version)) {
krh@97: 		if (strcmp(package, name) == 0)
krh@97: 			break;
krh@97: 	}
krh@97: 	razor_package_iterator_destroy(pi);
krh@97: 
krh@97: 	return p;
krh@10: }
krh@10: 
krh@92: struct razor_property_iterator {
krh@92: 	struct razor_set *set;
krh@92: 	struct razor_property *property, *end;
danw@117: 	struct list *index;
krh@92: };
krh@92: 
krh@92: struct razor_property_iterator *
krh@92: razor_property_iterator_create(struct razor_set *set,
krh@92: 			       struct razor_package *package)
krh@92: {
krh@92: 	struct razor_property_iterator *pi;
krh@92: 
krh@92: 	pi = zalloc(sizeof *pi);
krh@92: 	pi->set = set;
krh@98: 
danw@116: 	if (package) {
danw@117: 		pi->index = list_first(&package->properties,
danw@117: 				       &set->property_pool);
danw@116: 	} else {
danw@116: 		pi->property = set->properties.data;
danw@116: 		pi->end = set->properties.data + set->properties.size;
danw@116: 	}
krh@92: 
krh@92: 	return pi;
krh@92: }
krh@92: 
krh@92: int
krh@92: razor_property_iterator_next(struct razor_property_iterator *pi,
krh@92: 			     struct razor_property **property,
danw@109: 			     const char **name,
danw@109: 			     enum razor_version_relation *relation,
danw@109: 			     const char **version,
krh@92: 			     enum razor_property_type *type)
krh@92: {
krh@92: 	char *pool;
krh@92: 	int valid;
krh@92: 	struct razor_property *p, *properties;
krh@92: 
danw@116: 	if (pi->property) {
krh@92: 		p = pi->property++;
krh@92: 		valid = p < pi->end;
danw@116: 	} else if (pi->index) {
danw@116: 		properties = pi->set->properties.data;
danw@117: 		p = &properties[pi->index->data];
danw@116: 		pi->index = list_next(pi->index);
danw@116: 		valid = 1;
danw@116: 	} else
danw@116: 		valid = 0;
krh@92: 
krh@96: 	if (valid) {
krh@96: 		pool = pi->set->string_pool.data;
krh@96: 		*property = p;
danw@119: 		*name = &pool[p->name];
danw@109: 		*relation = p->relation;
krh@96: 		*version = &pool[p->version];
danw@119: 		*type = p->type;
krh@96: 	} else {
krh@96: 		*property = NULL;
krh@96: 	}
krh@92: 
krh@92: 	return valid;
krh@92: }
krh@92: 
krh@66: void
krh@92: razor_property_iterator_destroy(struct razor_property_iterator *pi)
krh@8: {
krh@92: 	free(pi);
krh@10: }
krh@10: 
krh@56: static struct razor_entry *
krh@56: find_entry(struct razor_set *set, struct razor_entry *dir, const char *pattern)
krh@56: {
krh@56: 	struct razor_entry *e;
krh@56: 	const char *n, *pool = set->string_pool.data;
krh@56: 	int len;
krh@56: 
krh@56: 	e = (struct razor_entry *) set->files.data + dir->start;
krh@56: 	do {
danw@120: 		n = pool + e->name;
krh@56: 		if (strcmp(pattern + 1, n) == 0)
krh@56: 			return e;
krh@57: 		len = strlen(n);
krh@56: 		if (e->start != 0 && strncmp(pattern + 1, n, len) == 0 &&
krh@56: 		    pattern[len + 1] == '/') {
krh@56: 			return find_entry(set, e, pattern + len + 1);
krh@56: 		}
danw@120: 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56: 
krh@56: 	return NULL;
krh@56: }
krh@56: 
krh@56: static void
krh@56: list_dir(struct razor_set *set, struct razor_entry *dir,
danw@127: 	 char *prefix, const char *pattern)
krh@56: {
krh@56: 	struct razor_entry *e;
krh@56: 	const char *n, *pool = set->string_pool.data;
krh@56: 
krh@56: 	e = (struct razor_entry *) set->files.data + dir->start;
krh@56: 	do {
danw@120: 		n = pool + e->name;
krh@56: 		if (pattern && pattern[0] && fnmatch(pattern, n, 0) != 0)
krh@56: 			continue;
danw@127: 		printf("%s/%s\n", prefix, n);
danw@127: 		if (e->start) {
danw@127: 			char *sub = prefix + strlen (prefix);
danw@127: 			*sub = '/';
danw@127: 			strcpy (sub + 1, n);
danw@127: 			list_dir(set, e, prefix, pattern);
danw@127: 			*sub = '\0';
danw@127: 		}
danw@120: 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56: }
krh@56: 
krh@56: void
krh@56: razor_set_list_files(struct razor_set *set, const char *pattern)
krh@56: {
krh@56: 	struct razor_entry *e;
krh@56: 	char buffer[512], *p, *base;
krh@56: 
danw@127: 	if (pattern == NULL || !strcmp (pattern, "/")) {
danw@127: 		buffer[0] = '\0';
danw@127: 		list_dir(set, set->files.data, buffer, NULL);
danw@127: 		return;
danw@127: 	}
krh@56: 
krh@56: 	strcpy(buffer, pattern);
krh@56: 	e = find_entry(set, set->files.data, buffer);
krh@56: 	if (e && e->start > 0) {
krh@56: 		base = NULL;
krh@56: 	} else {
krh@56: 		p = strrchr(buffer, '/');
krh@56: 		if (p) {
krh@56: 			*p = '\0';
krh@56: 			base = p + 1;
krh@56: 		} else {
krh@56: 			base = NULL;
krh@56: 		}
krh@56: 	}
krh@56: 	e = find_entry(set, set->files.data, buffer);
krh@56: 	if (e->start != 0)
krh@56: 		list_dir(set, e, buffer, base);
krh@56: }
krh@56: 
krh@102: struct razor_package_iterator *
krh@102: razor_package_iterator_create_for_file(struct razor_set *set,
krh@102: 				       const char *filename)
krh@56: {
krh@102: 	struct razor_entry *entry;
danw@117: 	struct list *index;
krh@56: 
krh@102: 	entry = find_entry(set, set->files.data, filename);
krh@102: 	if (entry == NULL)
krh@102: 		return NULL;
krh@56: 	
danw@116: 	index = list_first(&entry->packages, &set->package_pool);
krh@102: 	return razor_package_iterator_create_with_index(set, index);
krh@56: }
krh@56: 
danw@117: static struct list *
danw@117: list_package_files(struct razor_set *set, struct list *r,
danw@108: 		   struct razor_entry *dir, uint32_t end,
krh@56: 		   char *prefix)
krh@56: {
krh@56: 	struct razor_entry *e, *f, *entries;
danw@108: 	uint32_t next, file;
krh@56: 	char *pool;
krh@56: 	int len;
krh@56: 	
krh@56: 	entries = (struct razor_entry *) set->files.data;
krh@56: 	pool = set->string_pool.data;
krh@56: 
krh@56: 	e = entries + dir->start;
krh@56: 	do {
danw@117: 		if (entries + r->data == e) {
danw@120: 			printf("%s/%s\n", prefix, pool + e->name);
danw@116: 			r = list_next(r);
danw@116: 			if (!r)
krh@83: 				return NULL;
danw@117: 			if (r->data >= end)
krh@83: 				return r;
krh@56: 		}
danw@120: 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56: 
krh@56: 	e = entries + dir->start;
krh@56: 	do {
krh@56: 		if (e->start == 0)
krh@56: 			continue;
krh@56: 
danw@120: 		if (e->flags & RAZOR_ENTRY_LAST)
krh@56: 			next = end;
krh@56: 		else {
krh@56: 			f = e + 1; 
danw@120: 			while (f->start == 0 && !(f->flags & RAZOR_ENTRY_LAST))
krh@56: 				f++;
krh@56: 			if (f->start == 0)
krh@56: 				next = end;
krh@56: 			else
krh@56: 				next = f->start;
krh@56: 		}
krh@56: 
danw@117: 		file = r->data;
krh@83: 		if (e->start <= file && file < next) {
krh@56: 			len = strlen(prefix);
krh@56: 			prefix[len] = '/';
danw@120: 			strcpy(prefix + len + 1, pool + e->name);
krh@56: 			r = list_package_files(set, r, e, next, prefix);
krh@56: 			prefix[len] = '\0';
krh@56: 		}
danw@120: 	} while (!((e++)->flags & RAZOR_ENTRY_LAST) && r != NULL);
krh@56: 
krh@56: 	return r;
krh@56: }
krh@56: 
krh@56: void
krh@56: razor_set_list_package_files(struct razor_set *set, const char *name)
krh@56: {
krh@56: 	struct razor_package *package;
danw@117: 	struct list *r;
danw@117: 	uint32_t end;
krh@56: 	char buffer[512];
krh@56: 
krh@56: 	package = razor_set_get_package(set, name);
krh@56: 
danw@116: 	r = list_first(&package->files, &set->file_pool);
krh@56: 	end = set->files.size / sizeof (struct razor_entry);
krh@56: 	buffer[0] = '\0';
krh@56: 	list_package_files(set, r, set->files.data, end, buffer);
krh@56: }
krh@56: 
krh@43: static void
krh@21: razor_set_validate(struct razor_set *set, struct array *unsatisfied)
krh@21: {
krh@66: 	struct razor_property *r, *p, *end;
danw@108: 	uint32_t *u;
krh@21: 	char *pool;
krh@21: 
krh@66: 	end = set->properties.data + set->properties.size;
krh@21: 	pool = set->string_pool.data;
krh@21: 	
krh@66: 	for (r = set->properties.data, p = r; r < end; r++) {
danw@119: 		if (r->type != RAZOR_PROPERTY_REQUIRES)
krh@66: 			continue;
krh@66: 
danw@129: 		p = r;
danw@129: 		while (p < end && p->name == r->name &&
danw@129: 		       p->type == r->type)
danw@129: 			p++;
krh@37: 
krh@35: 		/* If there is more than one version of a provides,
krh@35: 		 * seek to the end for the highest version. */
krh@66: 		/* FIXME: This doesn't work if we have a series of
krh@66: 		 * requires a = 1, provides a = 1, requires a = 2,
krh@66: 		 * provides a = 2, as the kernel and kernel-devel
krh@66: 		 * does.*/
danw@119: 		while (p + 1 < end && p->name == (p + 1)->name &&
danw@119: 		       p->type == (p + 1)->type)
krh@35: 			p++;
krh@37: 
krh@37: 		/* FIXME: We need to track property flags (<, <=, =
krh@37: 		 * etc) to properly determine if a requires is
krh@37: 		 * satisfied.  The current code doesn't track that the
krh@37: 		 * requires a = 1 isn't satisfied by a = 2 provides. */
krh@37: 
krh@66: 		if (p == end ||
danw@119: 		    p->type != RAZOR_PROPERTY_PROVIDES ||
danw@119: 		    r->name != p->name ||
krh@35: 		    versioncmp(&pool[r->version], &pool[p->version]) > 0) {
krh@35: 			/* FIXME: We ignore file requires for now. */
danw@119: 			if (pool[r->name] == '/')
krh@35: 				continue;
krh@21: 			u = array_add(unsatisfied, sizeof *u);
krh@66: 			*u = r - (struct razor_property *) set->properties.data;
krh@21: 		}
krh@21: 	}
krh@21: }
krh@21: 
krh@21: void
krh@21: razor_set_list_unsatisfied(struct razor_set *set)
krh@21: {
krh@21: 	struct array unsatisfied;
krh@66: 	struct razor_property *properties, *r;
danw@108: 	uint32_t *u, *end;
krh@21: 	char *pool;
krh@21: 
krh@21: 	array_init(&unsatisfied);
krh@21: 	razor_set_validate(set, &unsatisfied);
krh@21: 
krh@21: 	end = unsatisfied.data + unsatisfied.size;
krh@66: 	properties = set->properties.data;
krh@21: 	pool = set->string_pool.data;
krh@21: 
krh@21: 	for (u = unsatisfied.data; u < end; u++) {
krh@66: 		r = properties + *u;
krh@66: 		if (pool[r->version] == '\0')
krh@66: 			printf("%ss not satisfied\n",
danw@119: 			       &pool[r->name]);
krh@66: 		else
krh@66: 			printf("%s-%s not satisfied\n",
danw@119: 			       &pool[r->name],
krh@66: 			       &pool[r->version]);
krh@21: 	}
krh@21: 
krh@21: 	array_release(&unsatisfied);
krh@21: }
krh@21: 
danw@120: #define UPSTREAM_SOURCE 0x80
krh@41: 
krh@41: struct source {
krh@41: 	struct razor_set *set;
danw@108: 	uint32_t *property_map;
danw@127: 	uint32_t *file_map;
krh@41: };
krh@41: 
krh@79: struct razor_merger {
krh@79: 	struct razor_set *set;
krh@79: 	struct hashtable table;
krh@79: 	struct source source1;
krh@79: 	struct source source2;
krh@79: };
krh@79: 
krh@79: static struct razor_merger *
krh@79: razor_merger_create(struct razor_set *set1, struct razor_set *set2)
krh@41: {
krh@79: 	struct razor_merger *merger;
krh@41: 	int count;
krh@41: 	size_t size;
krh@41: 
krh@79: 	merger = zalloc(sizeof *merger);
krh@79: 	merger->set = razor_set_create();
krh@79: 	hashtable_init(&merger->table, &merger->set->string_pool);
krh@41: 
danw@127: 	merger->source1.set = set1;
krh@79: 	count = set1->properties.size / sizeof (struct razor_property);
krh@79: 	size = count * sizeof merger->source1.property_map[0];
krh@79: 	merger->source1.property_map = zalloc(size);
danw@127: 	count = set1->files.size / sizeof (struct razor_entry);
danw@127: 	size = count * sizeof merger->source1.file_map[0];
danw@127: 	merger->source1.file_map = zalloc(size);
krh@79: 
danw@127: 	merger->source2.set = set2;
krh@79: 	count = set2->properties.size / sizeof (struct razor_property);
krh@79: 	size = count * sizeof merger->source2.property_map[0];
krh@79: 	merger->source2.property_map = zalloc(size);
danw@127: 	count = set2->files.size / sizeof (struct razor_entry);
danw@127: 	size = count * sizeof merger->source2.file_map[0];
danw@127: 	merger->source2.file_map = zalloc(size);
krh@79: 
krh@79: 	return merger;
krh@41: }
krh@41: 
krh@33: static void
krh@79: add_package(struct razor_merger *merger,
krh@41: 	    struct razor_package *package, struct source *source,
danw@108: 	    uint32_t flags)
krh@33: {
krh@33: 	char *pool;
danw@117: 	struct list *r;
krh@41: 	struct razor_package *p;
krh@33: 
krh@41: 	pool = source->set->string_pool.data;
krh@79: 	p = array_add(&merger->set->packages, sizeof *p);
krh@79: 	p->name = hashtable_tokenize(&merger->table, &pool[package->name]);
danw@120: 	p->flags = flags;
krh@79: 	p->version = hashtable_tokenize(&merger->table,
krh@79: 					&pool[package->version]);
danw@127: 
krh@66: 	p->properties = package->properties;
danw@116: 	r = list_first(&package->properties, &source->set->property_pool);
danw@116: 	while (r) {
danw@117: 		source->property_map[r->data] = 1;
danw@116: 		r = list_next(r);
krh@64: 	}
danw@127: 
danw@127: 	p->files = package->files;
danw@127: 	r = list_first(&package->files, &source->set->file_pool);
danw@127: 	while (r) {
danw@127: 		source->file_map[r->data] = 1;
danw@127: 		r = list_next(r);
danw@127: 	}
krh@41: }
krh@41: 
danw@108: static uint32_t
krh@79: add_property(struct razor_merger *merger,
danw@109: 	     const char *name, enum razor_version_relation relation,
danw@109: 	     const char *version, int type)
krh@41: {
krh@41: 	struct razor_property *p;
krh@41: 
krh@79: 	p = array_add(&merger->set->properties, sizeof *p);
danw@119: 	p->name = hashtable_tokenize(&merger->table, name);
danw@119: 	p->flags = 0;
danw@119: 	p->type = type;
danw@109: 	p->relation = relation;
krh@79: 	p->version = hashtable_tokenize(&merger->table, version);
krh@41: 
krh@79: 	return p - (struct razor_property *) merger->set->properties.data;
krh@41: }
krh@41: 
krh@41: static void
krh@79: merge_properties(struct razor_merger *merger)
krh@41: {
krh@41: 	struct razor_property *p1, *p2;
krh@79: 	struct razor_set *set1, *set2;
danw@108: 	uint32_t *map1, *map2;
krh@41: 	int i, j, cmp, count1, count2;
krh@41: 	char *pool1, *pool2;
krh@41: 
krh@79: 	set1 = merger->source1.set;
krh@79: 	set2 = merger->source2.set;
krh@79: 	map1 = merger->source1.property_map;
krh@79: 	map2 = merger->source2.property_map;
krh@79: 
krh@41: 	i = 0;
krh@41: 	j = 0;
krh@41: 	pool1 = set1->string_pool.data;
krh@41: 	pool2 = set2->string_pool.data;
krh@41: 
krh@66: 	count1 = set1->properties.size / sizeof *p1;
krh@66: 	count2 = set2->properties.size / sizeof *p2;
krh@41: 	while (i < count1 || j < count2) {
krh@41: 		if (i < count1 && map1[i] == 0) {
krh@41: 			i++;
krh@41: 			continue;
krh@41: 		}
krh@41: 		if (j < count2 && map2[j] == 0) {
krh@41: 			j++;
krh@41: 			continue;
krh@41: 		}
krh@66: 		p1 = (struct razor_property *) set1->properties.data + i;
krh@66: 		p2 = (struct razor_property *) set2->properties.data + j;
krh@41: 		if (i < count1 && j < count2)
danw@119: 			cmp = strcmp(&pool1[p1->name], &pool2[p2->name]);
krh@41: 		else if (i < count1)
krh@41: 			cmp = -1;
krh@41: 		else
krh@41: 			cmp = 1;
krh@41: 		if (cmp == 0)
danw@121: 			cmp = p1->type - p2->type;
danw@121: 		if (cmp == 0)
danw@109: 			cmp = p1->relation - p2->relation;
danw@109: 		if (cmp == 0)
krh@41: 			cmp = versioncmp(&pool1[p1->version],
krh@41: 					 &pool2[p2->version]);
krh@41: 		if (cmp < 0) {
krh@79: 			map1[i++] = add_property(merger,
danw@119: 						 &pool1[p1->name],
danw@109: 						 p1->relation,
krh@69: 						 &pool1[p1->version],
danw@119: 						 p1->type);
krh@41: 		} else if (cmp > 0) {
krh@79: 			map2[j++] = add_property(merger,
danw@119: 						 &pool2[p2->name],
danw@109: 						 p2->relation,
krh@69: 						 &pool2[p2->version],
danw@119: 						 p2->type);
krh@41: 		} else  {
krh@79: 			map1[i++] = map2[j++] = add_property(merger,
danw@119: 							     &pool1[p1->name],
danw@109: 							     p1->relation,
krh@69: 							     &pool1[p1->version],
danw@119: 							     p1->type);
krh@41: 		}
krh@41: 	}
krh@41: }
krh@41: 
danw@116: static void
danw@117: emit_properties(struct list_head *properties, struct array *source_pool,
danw@108: 		uint32_t *map, struct array *pool)
krh@41: {
danw@117: 	uint32_t r;
danw@117: 	struct list *p, *q;
krh@41: 
krh@41: 	r = pool->size / sizeof *q;
danw@116: 	p = list_first(properties, source_pool);
danw@116: 	while (p) {
krh@41: 		q = array_add(pool, sizeof *q);
danw@117: 		q->data = map[p->data];
danw@117: 		q->flags = p->flags;
danw@116: 		p = list_next(p);
krh@33: 	}
krh@33: 
danw@117: 	list_set_ptr(properties, r);
krh@41: }
danw@127: 
danw@127: static uint32_t
danw@127: add_file(struct razor_merger *merger, const char *name)
danw@127: {
danw@127: 	struct razor_entry *e;
danw@127: 
danw@127: 	e = array_add(&merger->set->files, sizeof *e);
danw@127: 	e->name = hashtable_tokenize(&merger->table, name);
danw@127: 	e->flags = 0;
danw@127: 	e->start = 0;
danw@127: 
danw@127: 	return e - (struct razor_entry *)merger->set->files.data;
danw@127: }
danw@127: 
danw@129: /* FIXME. Blah */
danw@127: static int
danw@127: fix_file_map(uint32_t *map,
danw@127: 	     struct razor_entry *files,
danw@127: 	     struct razor_entry *top)
danw@127: {
danw@127: 	uint32_t e;
danw@127: 	int found_file = 0;
danw@127: 
danw@127: 	e = top->start;
danw@127: 	do {
danw@127: 		if (files[e].start)
danw@127: 			fix_file_map(map, files, &files[e]);
danw@127: 		if (map[e])
danw@127: 			found_file = 1;
danw@127: 	} while (!(files[e++].flags & RAZOR_ENTRY_LAST));
danw@127: 
danw@127: 	if (found_file)
danw@127: 		map[top - files] = 1;
danw@127: 	return found_file;
danw@127: }
danw@127: 
danw@127: struct merge_directory {
danw@127: 	uint32_t merged, dir1, dir2;
danw@127: };
danw@127: 
danw@127: static void
danw@127: merge_one_directory(struct razor_merger *merger, struct merge_directory *md)
danw@127: {
danw@127: 	struct razor_entry *root1, *root2, *mroot, *e1, *e2;
danw@127: 	struct razor_set *set1, *set2;
danw@127: 	struct array merge_stack;
danw@127: 	struct merge_directory *child_md, *end_md;
danw@127: 	uint32_t *map1, *map2, start, last;
danw@127: 	int cmp;
danw@127: 	char *pool1, *pool2;
danw@127: 
danw@127: 	set1 = merger->source1.set;
danw@127: 	set2 = merger->source2.set;
danw@127: 	map1 = merger->source1.file_map;
danw@127: 	map2 = merger->source2.file_map;
danw@127: 	pool1 = set1->string_pool.data;
danw@127: 	pool2 = set2->string_pool.data;
danw@127: 	root1 = (struct razor_entry *) set1->files.data;
danw@127: 	root2 = (struct razor_entry *) set2->files.data;
danw@127: 
danw@127: 	array_init(&merge_stack);
danw@127: 
danw@127: 	start = merger->set->files.size / sizeof (struct razor_entry);
danw@127: 	last = 0;
danw@127: 	e1 = md->dir1 ? root1 + md->dir1 : NULL;
danw@127: 	e2 = md->dir2 ? root2 + md->dir2 : NULL;
danw@127: 	while (e1 || e2) {
danw@127: 		if (!e2 && !map1[e1 - root1]) {
danw@127: 			if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127: 				e1 = NULL;
danw@127: 			continue;
danw@127: 		}
danw@127: 		if (!e1 && !map2[e2 - root2]) {
danw@127: 			if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127: 				e2 = NULL;
danw@127: 			continue;
danw@127: 		}
danw@127: 		if (e1 && !map1[e1 - root1] &&
danw@127: 		    e2 && !map1[e2 - root2]) {
danw@127: 			if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127: 				e1 = NULL;
danw@127: 			if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127: 				e2 = NULL;
danw@127: 			continue;
danw@127: 		}
danw@127: 
danw@127: 		if (!e1)
danw@127: 			cmp = 1;
danw@127: 		else if (!e2)
danw@127: 			cmp = -1;
danw@127: 		else {
danw@127: 			cmp = strcmp (&pool1[e1->name],
danw@127: 				      &pool2[e2->name]);
danw@127: 		}
danw@127: 
danw@127: 		if (cmp < 0) {
danw@127: 			if (map1[e1 - root1]) {
danw@127: 				map1[e1 - root1] = last =
danw@127: 					add_file(merger, &pool1[e1->name]);
danw@127: 				if (e1->start) {
danw@127: 					child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127: 					child_md->merged = last;
danw@127: 					child_md->dir1 = e1->start;
danw@127: 					child_md->dir2 = 0;
danw@127: 				}
danw@127: 			}
danw@127: 			if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127: 				e1 = NULL;
danw@127: 		} else if (cmp > 0) {
danw@127: 			if (map2[e2 - root2]) {
danw@127: 				map2[e2 - root2] = last =
danw@127: 					add_file(merger, &pool2[e2->name]);
danw@127: 				if (e2->start) {
danw@127: 					child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127: 					child_md->merged = last;
danw@127: 					child_md->dir1 = 0;
danw@127: 					child_md->dir2 = e2->start;
danw@127: 				}
danw@127: 			}
danw@127: 			if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127: 				e2 = NULL;
danw@127: 		} else {
danw@127: 			map1[e1 - root1] = map2[e2- root2] = last =
danw@127: 				add_file(merger, &pool1[e1->name]);
danw@127: 			if (e1->start || e2->start) {
danw@127: 				child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127: 				child_md->merged = last;
danw@127: 				child_md->dir1 = e1->start;
danw@127: 				child_md->dir2 = e2->start;
danw@127: 			}
danw@127: 			if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127: 				e1 = NULL;
danw@127: 			if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127: 				e2 = NULL;
danw@127: 		}
danw@127: 	}
danw@127: 
danw@127: 	mroot = (struct razor_entry *)merger->set->files.data;
danw@127: 	if (last) {
danw@127: 		mroot[last].flags = RAZOR_ENTRY_LAST;
danw@127: 		mroot[md->merged].start = start;
danw@127: 	} else
danw@127: 		mroot[md->merged].start = 0;
danw@127: 
danw@127: 	end_md = merge_stack.data + merge_stack.size;
danw@127: 	for (child_md = merge_stack.data; child_md < end_md; child_md++)
danw@127: 		merge_one_directory(merger, child_md);
danw@127: 	array_release(&merge_stack);
danw@127: }
danw@127: 
danw@127: static void
danw@127: merge_files(struct razor_merger *merger)
danw@127: {
danw@129: 	struct razor_entry *root;
danw@127: 	struct merge_directory md;
danw@127: 	uint32_t *map1, *map2;
danw@127: 
danw@127: 	map1 = merger->source1.file_map;
danw@127: 	map2 = merger->source2.file_map;
danw@127: 
danw@127: 	md.merged = add_file(merger, "");
danw@129: 
danw@129: 	if (merger->source1.set->files.size) {
danw@129: 		root = (struct razor_entry *) merger->source1.set->files.data;
danw@129: 		if (root->start)
danw@129: 			fix_file_map(map1, root, root);
danw@129: 		md.dir1 = root->start;
danw@129: 	} else
danw@129: 		md.dir1 = 0;
danw@129: 
danw@129: 	if (merger->source2.set->files.size) {
danw@129: 		root = (struct razor_entry *) merger->source2.set->files.data;
danw@129: 		if (root->start)
danw@129: 			fix_file_map(map2, root, root);
danw@129: 		md.dir2 = root->start;
danw@129: 	} else
danw@129: 		md.dir2 = 0;
danw@129: 
danw@127: 	merge_one_directory(merger, &md);
danw@127: }
danw@127: 
danw@127: static void
danw@127: emit_files(struct list_head *files, struct array *source_pool,
danw@127: 	   uint32_t *map, struct array *pool)
danw@127: {
danw@127: 	uint32_t r;
danw@127: 	struct list *p, *q;
danw@127: 
danw@127: 	r = pool->size / sizeof *q;
danw@127: 	p = list_first(files, source_pool);
danw@127: 	while (p) {
danw@127: 		q = array_add(pool, sizeof *q);
danw@127: 		q->data = map[p->data];
danw@127: 		q->flags = p->flags;
danw@127: 		p = list_next(p);
danw@127: 	}
danw@127: 
danw@127: 	list_set_ptr(files, r);
danw@127: }
danw@127: 
krh@41: /* Rebuild property->packages maps.  We can't just remap these, as a
krh@41:  * property may have lost or gained a number of packages.  Allocate an
krh@41:  * array per property and loop through the packages and add them to
krh@41:  * the arrays for their properties. */
krh@41: static void
danw@127: rebuild_property_package_lists(struct razor_set *set)
krh@41: {
krh@66: 	struct array *pkgs, *a;
krh@41: 	struct razor_package *pkg, *pkg_end;
krh@41: 	struct razor_property *prop, *prop_end;
danw@117: 	struct list *r;
danw@117: 	uint32_t *q;
krh@66: 	int count;
krh@41: 
krh@66: 	count = set->properties.size / sizeof (struct razor_property);
krh@66: 	pkgs = zalloc(count * sizeof *pkgs);
krh@41: 	pkg_end = set->packages.data + set->packages.size;
krh@41: 
krh@41: 	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {
danw@128: 		r = list_first(&pkg->properties, &set->property_pool);
danw@116: 		while (r) {
danw@117: 			q = array_add(&pkgs[r->data], sizeof *q);
krh@41: 			*q = pkg - (struct razor_package *) set->packages.data;
danw@116: 			r = list_next(r);
krh@41: 		}
krh@33: 	}
krh@33: 
krh@66: 	prop_end = set->properties.data + set->properties.size;
krh@66: 	a = pkgs;
krh@66: 	for (prop = set->properties.data; prop < prop_end; prop++, a++) {
danw@128: 		list_set_array(&prop->packages, &set->package_pool, a, 0);
krh@41: 		array_release(a);
krh@41: 	}
krh@66: 	free(pkgs);
krh@33: }
krh@33: 
danw@127: static void
danw@127: rebuild_file_package_lists(struct razor_set *set)
danw@127: {
danw@127: 	struct array *pkgs, *a;
danw@127: 	struct razor_package *pkg, *pkg_end;
danw@127: 	struct razor_entry *entry, *entry_end;
danw@127: 	struct list *r;
danw@127: 	uint32_t *q;
danw@127: 	int count;
danw@127: 
danw@127: 	count = set->files.size / sizeof (struct razor_entry);
danw@127: 	pkgs = zalloc(count * sizeof *pkgs);
danw@127: 	pkg_end = set->packages.data + set->packages.size;
danw@127: 
danw@127: 	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {
danw@128: 		r = list_first(&pkg->files, &set->file_pool);
danw@127: 		while (r) {
danw@127: 			q = array_add(&pkgs[r->data], sizeof *q);
danw@127: 			*q = pkg - (struct razor_package *) set->packages.data;
danw@127: 			r = list_next(r);
danw@127: 		}
danw@127: 	}
danw@127: 
danw@127: 	entry_end = set->files.data + set->files.size;
danw@127: 	a = pkgs;
danw@127: 	for (entry = set->files.data; entry < entry_end; entry++, a++) {
danw@128: 		list_set_array(&entry->packages, &set->package_pool, a, 0);
danw@127: 		array_release(a);
danw@127: 	}
danw@127: 	free(pkgs);
danw@127: }
danw@127: 
danw@137: static struct razor_set *
krh@79: razor_merger_finish(struct razor_merger *merger)
krh@79: {
krh@79: 	struct razor_set *result;
krh@41: 	struct razor_package *p, *pend;
krh@33: 
krh@41: 	/* As we built the package list, we filled out a bitvector of
krh@41: 	 * the properties that are referenced by the packages in the
krh@41: 	 * new set.  Now we do a parallel loop through the properties
krh@41: 	 * and emit those marked in the bit vector to the new set.  In
krh@41: 	 * the process, we update the bit vector to actually map from
krh@41: 	 * indices in the old property list to indices in the new
krh@41: 	 * property list for both sets. */
krh@41: 
krh@79: 	merge_properties(merger);
danw@127: 	merge_files(merger);
krh@41: 
krh@41: 	/* Now we loop through the packages again and emit the
krh@41: 	 * property lists, remapped to point to the new properties. */
krh@41: 
krh@79: 	pend = merger->set->packages.data + merger->set->packages.size;
krh@79: 	for (p = merger->set->packages.data; p < pend; p++) {
krh@41: 		struct source *src;
krh@41: 
danw@120: 		if (p->flags & UPSTREAM_SOURCE)
krh@79: 			src = &merger->source2;
krh@41: 		else
krh@79: 			src = &merger->source1;
krh@41: 
danw@116: 		emit_properties(&p->properties,
danw@116: 				&src->set->property_pool,
danw@116: 				src->property_map,
danw@116: 				&merger->set->property_pool);
danw@127: 		emit_files(&p->files,
danw@127: 			   &src->set->file_pool,
danw@127: 			   src->file_map,
danw@127: 			   &merger->set->file_pool);
danw@120: 		p->flags &= ~UPSTREAM_SOURCE;
krh@33: 	}
krh@33: 
danw@127: 	rebuild_property_package_lists(merger->set);
danw@127: 	rebuild_file_package_lists(merger->set);
krh@41: 
danw@129: 	result = merger->set;
danw@129: 	hashtable_release(&merger->table);
danw@129: 	free(merger);
danw@129: 
danw@129: 	return result;
danw@129: }
danw@129: 
danw@141: 
danw@141: struct razor_transaction_resolver {
danw@141: 	struct razor_set *system, *upstream;
danw@141: 	struct bitarray syspkgs, uppkgs;
danw@141: 	struct array packages;
danw@141: 	int errors;
danw@141: };
danw@141: 
danw@141: static void
danw@141: find_packages(struct razor_transaction_resolver *trans,
danw@141: 	      int count, const char **package_names,
danw@137: 	      enum razor_transaction_package_state state)
krh@38: {
danw@141: 	struct razor_set *set;
danw@141: 	struct bitarray *pkgbits;
krh@105: 	struct razor_package_iterator *pi;
krh@105: 	struct razor_package *p, *packages;
krh@105: 	const char *name, *version;
danw@137: 	struct razor_transaction_package *tp;
danw@141: 	int i, *found;
danw@141: 
danw@141: 	if (state == RAZOR_PACKAGE_INSTALL) {
danw@141: 		set = trans->upstream;
danw@141: 		pkgbits = &trans->uppkgs;
danw@141: 	} else {
danw@141: 		set = trans->system;
danw@141: 		pkgbits = &trans->syspkgs;
danw@141: 	}
krh@38: 
krh@105: 	packages = (struct razor_package *) set->packages.data;
krh@105: 	pi = razor_package_iterator_create(set);
danw@137: 	found = zalloc(count * sizeof (int));
krh@105: 
krh@105: 	while (razor_package_iterator_next(pi, &p, &name, &version)) {
krh@105: 		for (i = 0; i < count; i++) {
krh@105: 			if (strcmp(name, package_names[i]) == 0) {
danw@137: 				found[i] = 1;
danw@141: 				tp = array_add(&trans->packages, sizeof *tp);
danw@137: 				memset(tp, 0, sizeof *tp);
danw@137: 				tp->package = p;
danw@137: 				tp->name = name;
danw@137: 				tp->version = version;
danw@137: 				tp->state = state;
danw@140: 				bitarray_set(pkgbits, p - packages,
danw@140: 					     state == RAZOR_PACKAGE_INSTALL);
krh@105: 				break;
krh@105: 			}
krh@105: 		}
krh@38: 	}
krh@105: 
danw@137: 	for (i = 0; i < count; i++) {
danw@137: 		if (!found[i]) {
danw@141: 			tp = array_add(&trans->packages, sizeof *tp);
danw@137: 			memset(tp, 0, sizeof *tp);
danw@137: 			tp->name = strdup(package_names[i]);
danw@137: 			tp->state = state | RAZOR_PACKAGE_UNAVAILABLE;
danw@141: 			trans->errors++;
danw@137: 		}
danw@137: 	}
danw@137: 
krh@105: 	razor_package_iterator_destroy(pi);
danw@137: 	free(found);
krh@38: }
krh@38: 
krh@38: static void
danw@141: find_all_packages(struct razor_transaction_resolver *trans)
krh@38: {
danw@137: 	struct razor_transaction_package *tp;
danw@140: 	struct razor_package *p, *packages, *u, *pend, *uend;
krh@38: 	char *pool, *upool;
krh@38: 
danw@141: 	packages = trans->system->packages.data;
danw@141: 	pend = trans->system->packages.data + trans->system->packages.size;
danw@141: 	pool = trans->system->string_pool.data;
danw@141: 	u = trans->upstream->packages.data;
danw@141: 	uend = trans->upstream->packages.data + trans->upstream->packages.size;
danw@141: 	upool = trans->upstream->string_pool.data;
krh@38: 
danw@140: 	for (p = packages; p < pend; p++) {
krh@38: 		while (u < uend && strcmp(&pool[p->name], &upool[u->name]) > 0)
krh@38: 			u++;
krh@38: 		if (strcmp(&pool[p->name], &upool[u->name]) == 0) {
danw@141: 			tp = array_add(&trans->packages, sizeof *tp);
danw@137: 			memset(tp, 0, sizeof *tp);
danw@137: 			tp->name = &upool[u->name];
danw@137: 			tp->version = &upool[u->version];
danw@137: 			tp->state = RAZOR_PACKAGE_INSTALL;
danw@141: 			bitarray_set(&trans->uppkgs, p - packages, 1);
krh@38: 		}
krh@38: 	}
krh@38: }
krh@38: 
danw@137: /* FIXME: wrong, need to compare names, not razor_package* */
danw@134: static int
danw@137: find_transaction_package(struct array *package_array,
danw@137: 			 struct razor_package *package)
danw@137: {
danw@137: 	struct razor_transaction_package *tps = package_array->data;
danw@137: 	int i, tpcount = package_array->size / sizeof *tps;
danw@137: 
danw@137: 	for (i = 0; i < tpcount; i++) {
danw@137: 		if (tps[i].package == package)
danw@137: 			return i;
danw@137: 	}
danw@137: 	return -1;
danw@137: }
danw@137: 
danw@137: static int
danw@137: provider_satisfies_requirement(struct razor_property *provider,
danw@137: 			       const char *provider_strings,
danw@137: 			       struct razor_property *requirement,
danw@137: 			       const char *requirement_strings)
danw@137: {
danw@137: 	int cmp, len;
danw@137: 	const char *provided = &provider_strings[provider->version];
danw@137: 	const char *required = &requirement_strings[requirement->version];
danw@137: 
danw@137: 	if (!*required)
danw@137: 		return 1;
danw@137: 
danw@137: 	cmp = versioncmp(provided, required);
danw@137: 
danw@137: 	switch (requirement->relation) {
danw@137: 	case RAZOR_VERSION_LESS:
danw@137: 		return cmp < 0;
danw@137: 
danw@137: 	case RAZOR_VERSION_LESS_OR_EQUAL:
danw@137: 		if (cmp <= 0)
danw@137: 			return 1;
danw@137: 		/* fall through: FIXME, make sure this is correct */
danw@137: 
danw@137: 	case RAZOR_VERSION_EQUAL:
danw@137: 		if (cmp == 0)
danw@137: 			return 1;
danw@137: 
danw@137: 		/* "foo == 1.1" is satisfied by "foo 1.1-2" */
danw@137: 		len = strlen(required);
danw@137: 		if (!strncmp(required, provided, len) && provided[len] == '-')
danw@137: 			return 1;
danw@137: 		return 0;
danw@137: 
danw@137: 	case RAZOR_VERSION_GREATER_OR_EQUAL:
danw@137: 		return cmp >= 0;
danw@137: 
danw@137: 	case RAZOR_VERSION_GREATER:
danw@137: 		return cmp > 0;
danw@137: 	}
danw@137: 
danw@137: 	/* shouldn't happen */
danw@137: 	return 0;
danw@137: }
danw@137: 
danw@142: static struct razor_package *
danw@142: find_file(struct razor_set *set, struct bitarray *pkgbits,
danw@142: 	  const char *filename, int installed)
danw@134: {
danw@142: 	struct razor_package *pkgs = set->packages.data;
danw@140: 	struct razor_entry *entry;
danw@140: 	struct list *p;
danw@134: 
danw@140: 	if (filename[0] != '/')
danw@140: 		return 0;
danw@140: 
danw@142: 	entry = find_entry(set, set->files.data, filename);
danw@140: 	if (!entry)
danw@140: 		return 0;
danw@140: 
danw@142: 	for (p = list_first(&entry->packages, &set->package_pool); p; p = list_next(p)) {
danw@142: 		if (bitarray_get(pkgbits, p->data) == installed)
danw@142: 			return &pkgs[p->data];
danw@134: 	}
danw@142: 	return NULL;
danw@142: }
danw@142: 
danw@142: static struct razor_package *
danw@142: find_system_file(struct razor_transaction_resolver *trans,
danw@142: 		 const char *filename, int installed)
danw@142: {
danw@142: 	return find_file(trans->system, &trans->syspkgs, filename, installed);
danw@142: }
danw@142: 
danw@142: static struct razor_package *
danw@142: find_upstream_file(struct razor_transaction_resolver *trans,
danw@142: 		   const char *filename, int installed)
danw@142: {
danw@142: 	return find_file(trans->upstream, &trans->uppkgs, filename, installed);
danw@134: }
danw@134: 
danw@140: static struct razor_package *
danw@141: find_system_provider(struct razor_transaction_resolver *trans,
danw@140: 		     int installed, int match_name,
danw@140: 		     struct razor_property *req, int *sp)
danw@138: {
danw@140: 	struct razor_package *spkgs = trans->system->packages.data;
danw@140: 	struct razor_property *sprops = trans->system->properties.data;
danw@140: 	const char *spool = trans->system->string_pool.data;
danw@140: 	const char *upool = trans->upstream->string_pool.data;
danw@140: 	int scount = trans->system->properties.size / sizeof *sprops;
danw@138: 
danw@140: 	/* Skip ahead to first matching PROVIDES */
danw@140: 	while (*sp < scount &&
danw@140: 	       strcmp(&spool[sprops[*sp].name], &upool[req->name]) < 0)
danw@140: 		(*sp)++;
danw@140: 	while (*sp < scount &&
danw@140: 	       sprops[*sp].type != RAZOR_PROPERTY_PROVIDES &&
danw@140: 	       strcmp(&spool[sprops[*sp].name], &upool[req->name]) == 0)
danw@140: 		(*sp)++;	       
danw@140: 
danw@140: 	/* Scan matching PROVIDES */
danw@140: 	while (*sp < scount &&
danw@140: 	       sprops[*sp].type == RAZOR_PROPERTY_PROVIDES &&
danw@140: 	       strcmp(&spool[sprops[*sp].name],
danw@140: 		      &upool[req->name]) == 0) {
danw@140: 		if (provider_satisfies_requirement(&sprops[*sp], spool,
danw@140: 						   req, upool)) {
danw@140: 			struct list *pkg;
danw@140: 
danw@140: 			for (pkg = list_first(&sprops[*sp].packages, &trans->system->package_pool); pkg; pkg = list_next(pkg)) {
danw@141: 				if (bitarray_get(&trans->syspkgs, pkg->data) != installed)
danw@140: 					continue;
danw@140: 				if (!match_name ||
danw@140: 				    strcmp(&spool[spkgs[pkg->data].name],
danw@140: 					   &upool[req->name]) == 0)
danw@140: 					return &spkgs[pkg->data];
danw@140: 			}
danw@140: 		}
danw@140: 		(*sp)++;
danw@140: 	}
danw@140: 
danw@140: 	return NULL;
danw@138: }
danw@138: 
danw@140: static struct razor_package *
danw@141: find_upstream_provider(struct razor_transaction_resolver *trans,
danw@140: 		       int installed, int match_name,
danw@140: 		       struct razor_property *req, int up)
danw@138: {
danw@140: 	struct razor_package *upkgs = trans->upstream->packages.data;
danw@140: 	struct razor_property *uprops = trans->upstream->properties.data;
danw@140: 	const char *upool = trans->upstream->string_pool.data;
danw@140: 	int ucount = trans->upstream->properties.size / sizeof *uprops;
danw@140: 
danw@140: 	/* Skip to first matching provide */
danw@140: 	if (req->type < RAZOR_PROPERTY_PROVIDES) {
danw@140: 		while (up < ucount &&
danw@140: 		       uprops[up].type != RAZOR_PROPERTY_PROVIDES)
danw@140: 			up++;
danw@140: 	} else {
danw@140: 		while (up >= 0 &&
danw@140: 		       uprops[up].type != RAZOR_PROPERTY_PROVIDES)
danw@140: 			up--;
danw@140: 		while (up > 0 &&
danw@140: 		       uprops[up - 1].type == RAZOR_PROPERTY_PROVIDES)
danw@140: 			up--;
danw@140: 		if (up < 0)
danw@140: 			return NULL;
danw@140: 	}
danw@140: 
danw@140: 	/* Scan matching PROVIDES */
danw@140: 	while (up < ucount &&
danw@140: 	       uprops[up].type == RAZOR_PROPERTY_PROVIDES &&
danw@140: 	       uprops[up].name == req->name) {
danw@140: 		if (provider_satisfies_requirement(&uprops[up], upool,
danw@140: 						   req, upool)) {
danw@140: 			struct list *pkg;
danw@140: 
danw@140: 			for (pkg = list_first(&uprops[up].packages, &trans->upstream->package_pool); pkg; pkg = list_next(pkg)) {
danw@141: 				if (bitarray_get(&trans->uppkgs, pkg->data) != installed)
danw@140: 					continue;
danw@140: 				if (!match_name ||
danw@140: 				    strcmp(&upool[upkgs[pkg->data].name],
danw@140: 					   &upool[req->name]) == 0)
danw@140: 					return &upkgs[pkg->data];
danw@140: 			}
danw@140: 		}
danw@140: 		up++;
danw@140: 	}
danw@140: 	return NULL;
danw@140: }
danw@140: 
danw@140: static struct razor_package *
danw@141: find_upgrade(struct razor_transaction_resolver *trans,
danw@141: 	     struct razor_property *obsolete, int up)
danw@140: {
danw@140: 	struct razor_property *uprops = trans->upstream->properties.data;
danw@140: 	const char *upool = trans->upstream->string_pool.data;
danw@140: 	struct razor_property req;
danw@140: 
danw@140: 	if (uprops[up].relation > RAZOR_VERSION_EQUAL ||
danw@140: 	    !upool[uprops[up].version])
danw@140: 		return NULL;
danw@140: 
danw@140: 	memcpy(&req, obsolete, sizeof req);
danw@140: 	req.type = RAZOR_PROPERTY_REQUIRES;
danw@140: 	if (uprops[up].relation == RAZOR_VERSION_LESS)
danw@140: 		req.relation = RAZOR_VERSION_GREATER_OR_EQUAL;
danw@138: 	else
danw@140: 		req.relation = RAZOR_VERSION_GREATER;
danw@140: 
danw@140: 	/* We need to rewind up, since OBSOLETES > PROVIDES, so we've
danw@140: 	 * already gone past the possible upgrades.
danw@140: 	 */
danw@140: 	while (up >= 0 &&
danw@140: 	       uprops[up].type != RAZOR_PROPERTY_PROVIDES)
danw@140: 		up--;
danw@140: 	while (up > 0 &&
danw@140: 	       uprops[up - 1].type == RAZOR_PROPERTY_PROVIDES)
danw@140: 		up--;
danw@140: 	if (up < 0)
danw@140: 		return NULL;
danw@140: 
danw@141: 	return find_upstream_provider(trans, 0, 1, &req, up);
danw@140: }
danw@140: 
danw@131: static void
danw@141: add_transaction_package(struct razor_transaction_resolver *trans,
danw@140: 			struct razor_package *package,
danw@140: 			struct razor_set *package_set,
danw@140: 			enum razor_transaction_package_state state,
danw@140: 			struct razor_property *req_prop,
danw@140: 			struct razor_set *req_set)
danw@131: {
danw@140: 	struct razor_transaction_package *tp;
danw@140: 	const char *pool;
danw@140: 	struct razor_package *pkgs;
danw@140: 	struct list *pkg;
danw@131: 
danw@141: 	tp = array_add(&trans->packages, sizeof *tp);
danw@140: 	memset(tp, 0, sizeof *tp);
danw@131: 
danw@140: 	if (package) {
danw@140: 		tp->package = package;
danw@140: 		pool = package_set->string_pool.data;
danw@140: 		tp->name = &pool[package->name];
danw@140: 		tp->version = &pool[package->version];
danw@140: 		tp->state = state;
danw@140: 	} else
danw@140: 		tp->state = state | RAZOR_PACKAGE_UNSATISFIABLE;
danw@140: 
danw@140: 	for (pkg = list_first(&req_prop->packages, &req_set->package_pool); pkg; pkg = list_next(pkg)) {
danw@141: 		if (bitarray_get(&trans->uppkgs, pkg->data))
danw@140: 			break;
danw@131: 	}
danw@140: 	if (pkg) {
danw@140: 		pool = req_set->string_pool.data;
danw@140: 		pkgs = req_set->packages.data;
danw@140: 		tp->req_package = &pool[pkgs[pkg->data].name];
danw@140: 	}
danw@140: 	tp->req_type = req_prop->type;
danw@140: 	tp->req_property = &pool[req_prop->name];
danw@140: 	tp->req_relation = req_prop->relation;
danw@140: 	tp->req_version = &pool[req_prop->version];
danw@140: 
danw@140: 	pkgs = package_set->packages.data;
danw@140: 	if (tp->state == RAZOR_PACKAGE_INSTALL)
danw@141: 		bitarray_set(&trans->uppkgs, package - pkgs, 1);
danw@140: 	else if (tp->state == RAZOR_PACKAGE_REMOVE)
danw@141: 		bitarray_set(&trans->syspkgs, package - pkgs, 0);
danw@140: 	else
danw@140: 		trans->errors++;
danw@140: }
danw@140: 
danw@140: /* FIXME */
danw@140: static int
danw@141: prop_is_being_installed(struct razor_transaction_resolver *trans,
danw@141: 			struct razor_property *prop)
danw@140: {
danw@140: 	struct list *pkg;
danw@140: 
danw@141: 	for (pkg = list_first(&prop->packages, &trans->upstream->package_pool); pkg; pkg = list_next(pkg)) {
danw@141: 		if (bitarray_get(&trans->uppkgs, pkg->data))
danw@140: 			return 1;
danw@140: 	}
danw@140: 	return 0;
danw@131: }
danw@131: 
danw@137: static void
danw@141: razor_transaction_satisfy_installs(struct razor_transaction_resolver *trans)
krh@33: {
danw@140: 	struct razor_package *spkgs, *upkgs, *pkg;
danw@142: 	struct razor_property *prop, *sprops, *uprops;
danw@140: 	int sp, up, ucount;
danw@140: 	const char *upool;
danw@134: 
danw@140: 	spkgs = trans->system->packages.data;
danw@140: 	sprops = trans->system->properties.data;
danw@140: 	upkgs = trans->upstream->packages.data;
danw@140: 	uprops = trans->upstream->properties.data;
danw@140: 	ucount = trans->upstream->properties.size / sizeof *uprops;
danw@140: 	upool = trans->upstream->string_pool.data;
krh@33: 
danw@140: 	sp = up = 0;
danw@140: 	while (up < ucount) {
danw@140: 		/* Skip 'up' ahead to a property of a package which is
danw@140: 		 * to-be-installed.
danw@140: 		 */
danw@140: 		while (up < ucount &&
danw@140: 		       (uprops[up].type == RAZOR_PROPERTY_PROVIDES ||
danw@141: 			!prop_is_being_installed(trans, &uprops[up])))
danw@140: 			up++;
danw@140: 		if (up == ucount)
danw@140: 			break;
krh@33: 
danw@142: 		prop = &uprops[up];
danw@142: 		switch (prop->type) {
danw@140: 		case RAZOR_PROPERTY_REQUIRES:
danw@142: 			if (!strncmp(&upool[prop->name], "rpmlib(", 7))
danw@140: 				break;
danw@131: 
danw@142: 			if (find_system_provider(trans, 1, 0, prop, &sp) ||
danw@142: 			    find_upstream_provider(trans, 1, 0, prop, up) ||
danw@142: 			    find_system_file(trans, &upool[prop->name], 1) ||
danw@142: 			    find_upstream_file(trans, &upool[prop->name], 1)) {
danw@140: 				/* Requires something that is either installed
danw@140: 				 * or to-be-installed.
danw@140: 				 */
danw@140: 				break;
danw@137: 			}
danw@137: 
danw@140: 			/* See if we can install a new upstream provider */
danw@142: 			pkg = find_upstream_provider(trans, 0, 0, prop, up);
danw@140: 			if (!pkg)
danw@142: 				pkg = find_upstream_file(trans, &upool[prop->name], 0);
danw@141: 			add_transaction_package(trans, pkg, trans->upstream,
danw@140: 						RAZOR_PACKAGE_INSTALL,
danw@142: 						prop, trans->upstream);
danw@140: 			break;
danw@140: 
danw@140: 		case RAZOR_PROPERTY_CONFLICTS:
danw@142: 			if ((pkg = find_system_provider(trans, 1, 1, prop, &sp))) {
danw@140: 				struct razor_package *upgrade;
danw@140: 
danw@140: 				/* Conflicts with something already installed.
danw@140: 				 * Try to upgrade out.
danw@140: 				 */
danw@142: 				upgrade = find_upgrade(trans, prop, up);
danw@140: 				if (upgrade) {
danw@141: 					bitarray_set(&trans->syspkgs, pkg - spkgs, 0);
danw@141: 					add_transaction_package(trans, upgrade,
danw@141: 								trans->upstream,
danw@140: 								RAZOR_PACKAGE_INSTALL,
danw@142: 								prop, trans->upstream);
danw@140: 				} else {
danw@141: 					add_transaction_package(trans, pkg,
danw@141: 								trans->system, 
danw@140: 								RAZOR_PACKAGE_INSTALL_CONFLICT,
danw@142: 								prop, trans->upstream);
danw@140: 				}
danw@142: 			} else if ((pkg = find_upstream_provider(trans, 1, 1, prop, up))) {
danw@140: 				/* Conflicts with something already to-be-installed */
danw@141: 				add_transaction_package(trans, pkg,
danw@141: 							trans->upstream, 
danw@140: 							RAZOR_PACKAGE_INSTALL_CONFLICT,
danw@142: 							prop, trans->upstream);
danw@140: 			}
danw@140: 			break;
danw@140: 
danw@140: 		case RAZOR_PROPERTY_OBSOLETES:
danw@142: 			if ((pkg = find_system_provider(trans, 1, 1, prop, &sp))) {
danw@140: 				/* Obsoletes something installed */
danw@141: 				add_transaction_package(trans, pkg,
danw@141: 							trans->system, 
danw@140: 							RAZOR_PACKAGE_REMOVE,
danw@142: 							prop, trans->upstream);
danw@142: 			} else if ((pkg = find_upstream_provider(trans, 1, 1, prop, up))) {
danw@140: 				/* Obsoletes something that was to-be-installed */
danw@141: 				add_transaction_package(trans, pkg,
danw@141: 							trans->upstream, 
danw@140: 							RAZOR_PACKAGE_REMOVE_CONFLICT,
danw@142: 							prop, trans->upstream);
danw@140: 			}
danw@140: 			break;
danw@140: 
danw@140: 		default:
danw@140: 			/* can't happen */
danw@140: 			break;
danw@131: 		}
danw@140: 		up++;
krh@37: 	}
krh@33: }
krh@33: 
danw@130: /* Look through pkg's PROVIDES, and for each one that no other package
danw@130:  * provides, add its property index to lost_provides.
danw@130:  */
danw@130: static void
danw@130: gather_lost_provides(struct razor_set *set, struct razor_package *pkg,
danw@130: 		     struct array *lost_provides)
danw@130: {
danw@130: 	struct razor_property *props = set->properties.data, *prop;
danw@130: 	struct list *p, *providers;
danw@130: 	uint32_t *lost;
danw@130: 
danw@130: 	for (p = list_first(&pkg->properties, &set->property_pool); p; p = list_next(p)) {
danw@130: 		prop = &props[p->data];
danw@130: 		if (prop->type != RAZOR_PROPERTY_PROVIDES)
danw@130: 			continue;
danw@130: 
danw@130: 		providers = list_first(&prop->packages, &set->package_pool);
danw@130: 		if (providers && !list_next(providers)) {
danw@130: 			lost = array_add(lost_provides, sizeof *lost);
danw@130: 			*lost = p->data;
danw@130: 		}
danw@130: 	}
danw@130: }
danw@130: 
danw@130: static void
danw@139: gather_lost_files(struct razor_set *set, struct razor_package *pkg,
danw@139: 		  struct array *lost_files)
danw@130: {
danw@139: 	struct razor_entry *entries = set->files.data, *entry, **lost;
danw@139: 	struct list *e, *providers;
danw@139: 
danw@139: 	for (e = list_first(&pkg->files, &set->file_pool); e; e = list_next(e)) {
danw@139: 		entry = &entries[e->data];
danw@139: 		providers = list_first(&entry->packages, &set->package_pool);
danw@139: 		if (providers && !list_next(providers)) {
danw@139: 			lost = array_add(lost_files, sizeof *lost);
danw@139: 			*lost = entry;
danw@139: 		}
danw@139: 	}
danw@139: }
danw@139: 
danw@139: static void
danw@141: lose_required_package(struct razor_transaction_resolver *trans,
danw@139: 		      struct razor_property *req,
danw@139: 		      struct list_head *lost_package_list)
danw@139: {
danw@139: 	struct razor_package *pkgs, *lost_package;
danw@137: 	char *pool = trans->system->string_pool.data;
danw@130: 	struct list *p;
danw@137: 	struct razor_transaction_package *tp, *packages;;
danw@137: 	int already;
danw@130: 
danw@137: 	pkgs = trans->system->packages.data;
danw@139: 	lost_package = &pkgs[list_first(lost_package_list, &trans->system->package_pool)->data];
danw@139: 
danw@139: 	for (p = list_first(&req->packages, &trans->system->package_pool); p; p = list_next(p)) {
danw@141: 		packages = trans->packages.data;
danw@141: 		already = find_transaction_package(&trans->packages, &pkgs[p->data]);
danw@139: 		if (already != -1 &&
danw@139: 		    (packages[already].state & RAZOR_PACKAGE_REMOVE))
danw@139: 			continue;
danw@139: 
danw@141: 		tp = array_add(&trans->packages, sizeof *tp);
danw@139: 		memset(tp, 0, sizeof *tp);
danw@139: 		tp->package = &pkgs[p->data];
danw@139: 		tp->name = &pool[tp->package->name];
danw@139: 		tp->version = &pool[tp->package->version];
danw@139: 		tp->req_package = &pool[lost_package->name];
danw@140: 		tp->req_type = req->type;
danw@139: 		tp->req_property = &pool[req->name];
danw@139: 		tp->req_relation = req->relation;
danw@139: 		tp->req_version = &pool[req->version];
danw@139: 		if (already != -1) {
danw@139: 			tp->state = RAZOR_PACKAGE_REMOVE_BLOCKED;
danw@139: 			trans->errors++;
danw@140: 		} else {
danw@139: 			tp->state = RAZOR_PACKAGE_REMOVE;
danw@141: 			bitarray_set(&trans->syspkgs, p->data, 0);
danw@140: 		}
danw@139: 	}
danw@139: }
danw@139: 
danw@139: static void
danw@141: lose_requirement(struct razor_transaction_resolver *trans,
danw@139: 		 struct razor_property *req,
danw@139: 		 struct razor_property *lost_provider,
danw@139: 		 struct razor_property *first_provider)
danw@139: {
danw@139: 	struct razor_property *provider, *prop_end;
danw@139: 	char *pool = trans->system->string_pool.data;
danw@139: 
danw@137: 	prop_end = trans->system->properties.data + trans->system->properties.size;
danw@130: 
danw@137: 	/* See if any other provider satisfies req */
danw@137: 	for (provider = first_provider;
danw@137: 	     provider < prop_end && provider->type == RAZOR_PROPERTY_PROVIDES && provider->name == lost_provider->name;
danw@137: 	     provider++) {
danw@137: 		if (provider == lost_provider)
danw@137: 			continue;
danw@137: 
danw@137: 		if (provider_satisfies_requirement(provider, pool, req, pool))
danw@137: 			return;
danw@137: 	}
danw@137: 
danw@141: 	lose_required_package(trans, req, &lost_provider->packages);
danw@130: }
danw@130: 
danw@137: static void
danw@141: razor_transaction_satisfy_removes(struct razor_transaction_resolver *trans,
danw@137: 				  int start, int end)
danw@129: {
danw@137: 	struct razor_transaction_package *packages;
danw@129: 	struct razor_package *pkgs;
danw@137: 	int pkg_count, r;
danw@137: 	uint32_t *lost, *lost_end;
danw@139: 	struct razor_entry *entry, **lostf, **lostf_end;
danw@137: 	struct razor_property *props, *prop_end, *req, *first_provider;
danw@139: 	struct array lost_provides, lost_files;
danw@139: 	char *pool;
danw@129: 
danw@137: 	pkgs = trans->system->packages.data;
danw@137: 	pkg_count = trans->system->packages.size / sizeof (struct razor_package);
danw@137: 	props = trans->system->properties.data;
danw@137: 	prop_end = trans->system->properties.data + trans->system->properties.size;
danw@139: 	pool = trans->system->string_pool.data;
danw@130: 
danw@139: 	array_init(&lost_files);
danw@139: 	array_init(&lost_provides);
danw@137: 	for (r = start; r < end; r++) {
danw@141: 		packages = trans->packages.data;
danw@137: 		if (packages[r].state != RAZOR_PACKAGE_REMOVE)
danw@137: 			continue;
danw@137: 
danw@137: 		gather_lost_provides(trans->system, packages[r].package,
danw@137: 				     &lost_provides);
danw@139: 		gather_lost_files(trans->system, packages[r].package,
danw@139: 				  &lost_files);
danw@139: 	}
danw@130: 
danw@139: 	/* Handle lost_provides */
danw@139: 	lost_end = lost_provides.data + lost_provides.size;
danw@139: 	for (lost = lost_provides.data; lost < lost_end; lost++) {
danw@139: 		/* Requires FOO will appear before Provides FOO */
danw@139: 		for (req = &props[*lost]; req > props && req->name == props[*lost].name && req->type != RAZOR_PROPERTY_REQUIRES; req--)
danw@139: 			;
danw@139: 		first_provider = req + 1;
danw@137: 
danw@139: 		while (req > props && req->name == props[*lost].name) {
danw@141: 			lose_requirement(trans, req, &props[*lost],
danw@141: 					 first_provider);
danw@139: 			req--;
danw@130: 		}
danw@130: 	}
danw@139: 	array_release(&lost_provides);
danw@139: 
danw@139: 	/* And now lost_files. FIXME, inefficient */
danw@139: 	lostf_end = lost_files.data + lost_files.size;
danw@139: 
danw@139: 	req = props;
danw@139: 	/* Due to the sorting of props, this loop is likely a no-op */
danw@140: 	while (req < prop_end && pool[req->name] != '/')
danw@139: 		req++;
danw@139: 
danw@139: 	for (; req < prop_end && pool[req->name] == '/'; req++) {
danw@139: 		if (req->type != RAZOR_PROPERTY_REQUIRES)
danw@139: 			continue;
danw@139: 
danw@139: 		entry = find_entry(trans->system, trans->system->files.data,
danw@139: 				   &pool[req->name]);
danw@139: 		if (!entry)
danw@139: 			continue;
danw@139: 
danw@139: 		for (lostf = lost_files.data; lostf < lostf_end; lostf++) {
danw@139: 			if (*lostf == entry)
danw@139: 				break;
danw@139: 		}
danw@139: 		if (lostf == lostf_end)
danw@139: 			continue;
danw@139: 
danw@141: 		lose_required_package(trans, req, &entry->packages);
danw@139: 	}
danw@139: 	array_release(&lost_files);
danw@129: }
danw@129: 
krh@44: /* The diff order matters.  We should sort the packages so that a
krh@44:  * REMOVE of a package comes before the INSTALL, and so that all
krh@44:  * requires for a package have been installed before the package.
krh@44:  **/
krh@44: 
krh@44: void
krh@44: razor_set_diff(struct razor_set *set, struct razor_set *upstream,
krh@44: 	       razor_package_callback_t callback, void *data)
krh@44: {
krh@103: 	struct razor_package_iterator *pi1, *pi2;
krh@103: 	struct razor_package *p1, *p2;
krh@103: 	const char *name1, *name2, *version1, *version2;
krh@106: 	int res;
krh@44: 
krh@103: 	pi1 = razor_package_iterator_create(set);
krh@103: 	pi2 = razor_package_iterator_create(upstream);
krh@44: 
krh@103: 	razor_package_iterator_next(pi1, &p1, &name1, &version1);
krh@103: 	razor_package_iterator_next(pi2, &p2, &name2, &version2);
krh@44: 
krh@103: 	while (p1 || p2) {
krh@103: 		if (p1 && p2) {
krh@103: 			res = strcmp(name1, name2);
krh@44: 			if (res == 0)
krh@103: 				res = versioncmp(version1, version2);
krh@106: 		} else {
krh@106: 			res = 0;
krh@44: 		}
krh@44: 
krh@103: 		if (p2 == NULL || res < 0)
krh@103: 			callback(name1, version1, NULL, data);
krh@103: 		else if (p1 == NULL || res > 0)
krh@103: 			callback(name2, NULL, version2, data);
krh@103: 
krh@103: 		if (p1 != NULL && res <= 0)
krh@103: 			razor_package_iterator_next(pi1, &p1,
krh@103: 						    &name1, &version1);
krh@103: 		if (p2 != NULL && res >= 0)
krh@103: 			razor_package_iterator_next(pi2, &p2,
krh@103: 						    &name2, &version2);
krh@44: 	}
krh@103: 
krh@103: 	razor_package_iterator_destroy(pi1);
krh@103: 	razor_package_iterator_destroy(pi2);
krh@44: }
danw@137: 
danw@137: struct razor_transaction *
danw@137: razor_transaction_create(struct razor_set *system, struct razor_set *upstream,
danw@137: 			 int update_count, const char **update_packages,
danw@137: 			 int remove_count, const char **remove_packages)
danw@137: {
danw@141: 	struct razor_transaction_resolver trans;
danw@141: 	struct razor_transaction *ret_trans;
danw@137: 	int start, end;
danw@137: 
danw@141: 	trans.system = system;
danw@141: 	trans.upstream = upstream ? upstream : razor_set_create();
danw@141: 	array_init(&trans.packages);
danw@141: 	bitarray_init(&trans.syspkgs, trans.system->packages.size / sizeof (struct razor_package), 1);
danw@141: 	bitarray_init(&trans.uppkgs, trans.upstream->packages.size / sizeof (struct razor_package), 0);
danw@141: 	trans.errors = 0;
danw@137: 
danw@137: 	/* Find initial upstream packages to be installed */
danw@137: 	if (update_count > 0) {
danw@141: 		find_packages(&trans, update_count, update_packages,
danw@141: 			      RAZOR_PACKAGE_INSTALL);
danw@137: 	} else if (remove_count == 0)
danw@141: 		find_all_packages(&trans);
danw@137: 
danw@137: 	/* Find initial installed packages to remove. */
danw@137: 	if (remove_count > 0) {
danw@141: 		find_packages(&trans, remove_count, remove_packages,
danw@141: 			      RAZOR_PACKAGE_REMOVE);
danw@137: 	}
danw@137: 
danw@137: 	start = 0;
danw@141: 	end = trans.packages.size / sizeof (struct razor_transaction_package);
danw@137: 
danw@141: 	while (!trans.errors && start != end) {
danw@141: 		razor_transaction_satisfy_installs(&trans);
danw@141: 		razor_transaction_satisfy_removes(&trans, start, end);
danw@137: 
danw@137: 		start = end;
danw@141: 		end = trans.packages.size / sizeof (struct razor_transaction_package);
danw@137: 	}
danw@137: 
danw@141: 	ret_trans = zalloc(sizeof *ret_trans);
danw@141: 	ret_trans->system = trans.system;
danw@141: 	ret_trans->upstream = trans.upstream;
danw@141: 	ret_trans->packages = trans.packages.data;
danw@141: 	ret_trans->package_count = end;
danw@141: 	ret_trans->errors = trans.errors;
danw@141: 	return ret_trans;
danw@137: }
danw@137: 
danw@137: const char * const razor_version_relations[] = {
danw@137: 	/* same order as enum razor_version_relation */
danw@137: 	"<", "<=", "=", ">=", ">"
danw@137: };
danw@137: 
danw@140: const char * const razor_property_types[] = {
danw@140: 	/* same order as enum razor_property_type */
danw@140: 	"requires", "provides", "conflicts with", "obsoletes"
danw@140: };
danw@140: 
danw@140: const char * const razor_property_types_removal[] = {
danw@140: 	/* same order as enum razor_property_type */
danw@140: 	"required", "provided", "conflicted with", "was obsoleted by"
danw@140: };
danw@140: 
danw@137: void
danw@137: razor_transaction_describe(struct razor_transaction *trans)
danw@137: {
danw@137: 	struct razor_transaction_package *p, *pend, *tps;
danw@137: 	int errors_only = 0;
danw@137: 
danw@137: 	tps = trans->packages;
danw@137: 	pend = trans->packages + trans->package_count;
danw@137: 	for (p = trans->packages; p < pend; p++) {
danw@137: 		switch (p->state) {
danw@137: 		case RAZOR_PACKAGE_INSTALL:
danw@137: 			if (errors_only)
danw@137: 				break;
danw@137: 
danw@137: 			printf ("Installing %s %s", p->name, p->version);
danw@137: 			if (p->req_package) {
danw@137: 				printf (" for %s", p->req_package);
danw@140: 			print_requirement:
danw@137: 				if (*p->req_version) {
danw@140: 					printf (", which %s %s %s %s",
danw@140: 						razor_property_types[p->req_type],
danw@137: 						p->req_property,
danw@137: 						razor_version_relations[p->req_relation],
danw@137: 						p->req_version);
danw@137: 				} else if (strcmp(p->req_property, p->name) != 0) {
danw@140: 					printf (", which %s %s",
danw@140: 						razor_property_types[p->req_type],
danw@137: 						p->req_property);
danw@137: 				}
danw@137: 			}
danw@137: 			printf("\n");
danw@137: 			break;
danw@137: 
danw@137: 		case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:
danw@137: 			if (*p->req_version && strcmp(p->req_property, p->name) == 0) {
danw@137: 				printf ("Can't find %s %s %s, which is required by %s",
danw@137: 					p->name,
danw@137: 					razor_version_relations[p->req_relation],
danw@137: 					p->req_version,
danw@137: 					p->req_package);
danw@137: 			} else {
danw@137: 				printf ("Can't find %s", p->name);
danw@137: 				if (*p->version)
danw@137: 					printf (" %s", p->version);
danw@137: 				
danw@137: 				if (p->req_package) {
danw@137: 					printf ("  which is required by %s",
danw@137: 						p->req_package);
danw@137: 					if (strcmp(p->req_property, p->name) != 0)
danw@137: 						printf (" for %s", p->req_property);
danw@137: 				}
danw@137: 			}
danw@137: 			printf("\n");
danw@137: 			errors_only = 1;
danw@137: 			break;
danw@137: 
danw@140: 		case RAZOR_PACKAGE_INSTALL_CONFLICT:
danw@140: 			printf ("Cannot install %s", p->req_package);
danw@137: 			errors_only = 1;
danw@140: 			goto print_requirement;
danw@137: 
danw@137: 		case RAZOR_PACKAGE_INSTALL_UNSATISFIABLE:
danw@137: 			printf ("Cannot find package for %s", p->req_property);
danw@137: 			if (*p->req_version) {
danw@137: 				printf (" %s %s",
danw@137: 					razor_version_relations[p->req_relation],
danw@137: 					p->req_version);
danw@137: 			}
danw@137: 			printf (" which is required by %s\n",
danw@137: 				p->req_package);
danw@137: 			errors_only = 1;
danw@137: 			break;
danw@137: 
danw@137: 		case RAZOR_PACKAGE_REMOVE:
danw@137: 			if (errors_only)
danw@137: 				break;
danw@137: 			printf ("Removing %s %s", p->name, p->version);
danw@137: 			if (p->req_package) {
danw@140: 				printf (" which %s %s",
danw@140: 					razor_property_types_removal[p->req_type],
danw@140: 					p->req_package);
danw@140: 				if (strcmp(p->req_property, p->name) != 0)
danw@137: 					printf (" for %s", p->req_property);
danw@137: 			}
danw@137: 			printf("\n");
danw@137: 			break;
danw@137: 
danw@137: 		case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:
danw@137: 			printf ("Package %s is not installed\n", p->name);
danw@137: 			errors_only = 1;
danw@137: 			break;
danw@137: 
danw@137: 		case RAZOR_PACKAGE_REMOVE_BLOCKED:
danw@137: 			printf ("Cannot remove %s, which is marked for installation but requires %s\n", p->name, p->req_package);
danw@137: 			errors_only = 1;
danw@137: 			break;
danw@137: 
danw@140: 		case RAZOR_PACKAGE_REMOVE_CONFLICT:
danw@140: 			printf ("Cannot remove %s, which is marked for installation but is obsoleted by %s\n", p->name, p->req_package);
danw@140: 			errors_only = 1;
danw@140: 			break;
danw@140: 
danw@137: 		default:
danw@137: 			/* Shouldn't actually happen */
danw@137: 			break;
danw@137: 		}
danw@137: 	}
danw@137: }
danw@137: 
danw@137: struct razor_set *
danw@137: razor_transaction_run(struct razor_transaction *trans)
danw@137: {
danw@137: 	struct array install_packages, remove_packages;
danw@137: 	struct razor_merger *merger;
danw@137: 	struct razor_package *pkg, *i, *iend, *r, *rend, *s, *send;
danw@137: 	struct source *source1, *source2;
danw@137: 	char *spool, *ipool, *rpool;
danw@137: 	uint32_t *map;
danw@137: 	int p, cmp;
danw@137: 
danw@137: 	/* FIXME */
danw@137: 	if (trans->errors)
danw@137: 		return NULL;
danw@137: 
danw@137: 	/* Sort the transaction packages into two arrays */
danw@137: 	array_init(&install_packages);
danw@137: 	array_init(&remove_packages);
danw@137: 	for (p = 0; p < trans->package_count; p++) {
danw@137: 		if (trans->packages[p].state & RAZOR_PACKAGE_INSTALL)
danw@137: 			pkg = array_add(&install_packages, sizeof *pkg);
danw@137: 		else
danw@137: 			pkg = array_add(&remove_packages, sizeof *pkg);
danw@137: 		*pkg = *trans->packages[p].package;
danw@137: 	}
danw@137: 	map = qsort_with_data(install_packages.data,
danw@137: 			      install_packages.size / sizeof *pkg,
danw@137: 			      sizeof *pkg,
danw@137: 			      compare_packages,
danw@137: 			      trans->upstream);
danw@137: 	free(map);
danw@137: 	map = qsort_with_data(remove_packages.data,
danw@137: 			      remove_packages.size / sizeof *pkg,
danw@137: 			      sizeof *pkg,
danw@137: 			      compare_packages,
danw@137: 			      trans->system);
danw@137: 	free(map);
danw@137: 
danw@137: 	merger = razor_merger_create(trans->system, trans->upstream);
danw@137: 
danw@137: 	source1 = &merger->source1;
danw@137: 	source2 = &merger->source2;
danw@137: 
danw@137: 	i = install_packages.data;
danw@137: 	iend = install_packages.data + install_packages.size;
danw@137: 	ipool = trans->upstream->string_pool.data;
danw@137: 
danw@137: 	r = remove_packages.data;
danw@137: 	rend = remove_packages.data + remove_packages.size;
danw@137: 	rpool = trans->system->string_pool.data;
danw@137: 
danw@137: 	s = trans->system->packages.data;
danw@137: 	send = trans->system->packages.data + trans->system->packages.size;
danw@137: 	spool = trans->system->string_pool.data;
danw@137: 
danw@137: 	while (s < send || i < iend) {
danw@137: 		/* Check if s is being removed */
danw@137: 		if (s < send && r < rend &&
danw@137: 		    s->name == r->name && s->version && r->version) {
danw@137: 			s++;
danw@137: 			r++;
danw@137: 			continue;
danw@137: 		}
danw@137: 
danw@137: 		if (s < send && i < iend)
danw@137: 			cmp = strcmp(&spool[s->name], &ipool[i->name]);
danw@137: 		else if (s < send)
danw@137: 			cmp = -1;
danw@137: 		else
danw@137: 			cmp = 1;
danw@137: 		if (cmp < 0) {
danw@137: 			add_package(merger, s, source1, 0);
danw@137: 			s++;
danw@137: 		} else if (cmp == 0) {
danw@137: 			add_package(merger, i, source2, UPSTREAM_SOURCE);
danw@137: 			s++;
danw@137: 			i++;
danw@137: 		} else {
danw@137: 			add_package(merger, i, source2, UPSTREAM_SOURCE);
danw@137: 			i++;
danw@137: 		}
danw@137: 	}
danw@137: 
danw@137: 	array_release(&install_packages);
danw@137: 	array_release(&remove_packages);
danw@137: 
danw@137: 	return razor_merger_finish(merger);
danw@137: }
danw@137: 
danw@137: void
danw@137: razor_transaction_destroy(struct razor_transaction *trans)
danw@137: {
danw@137: 	int p;
danw@137: 
danw@137: 	for (p = 0; p < trans->package_count; p++) {
danw@137: 		if (!trans->packages[p].req_package &&
danw@137: 		    (trans->packages[p].state == RAZOR_PACKAGE_INSTALL_UNAVAILABLE ||
danw@137: 		     trans->packages[p].state == RAZOR_PACKAGE_REMOVE_NOT_INSTALLED))
danw@137: 			free((char *)trans->packages[p].name);
danw@137: 	}
danw@137: 	free(trans);
danw@137: 
danw@137: 	/* FIXME: free upstream if it was created as an empty set */
danw@137: }