razor: razor.c@b38fc517ea04

     1 #define _GNU_SOURCE

     3 #include <stdlib.h>

     4 #include <stddef.h>

     5 #include <stdint.h>

     6 #include <stdio.h>

     7 #include <string.h>

     8 #include <sys/types.h>

     9 #include <sys/stat.h>

    10 #include <sys/mman.h>

    11 #include <unistd.h>

    12 #include <fcntl.h>

    13 #include <errno.h>

    14 #include <ctype.h>

    15 #include <fnmatch.h>

    17 #include "razor.h"

    18 #include "razor-internal.h"

    19 #include "types.h"

    21 struct razor_set_section {

    22 	uint32_t type;

    23 	uint32_t offset;

    24 	uint32_t size;

    25 };

    27 struct razor_set_header {

    28 	uint32_t magic;

    29 	uint32_t version;

    30 	struct razor_set_section sections[0];

    31 };

    33 #define RAZOR_MAGIC 0x7a7a7a7a

    34 #define RAZOR_VERSION 1

    36 #define RAZOR_STRING_POOL	0

    37 #define RAZOR_PACKAGES		1

    38 #define RAZOR_PROPERTIES	2

    39 #define RAZOR_FILES		3

    40 #define RAZOR_PACKAGE_POOL	4

    41 #define RAZOR_PROPERTY_POOL	5

    42 #define RAZOR_FILE_POOL		6

    44 struct razor_package {

    45 	uint name  : 24;

    46 	uint flags : 8;

    47 	uint32_t version;

    48 	uint32_t arch;

    49 	struct list_head properties;

    50 	struct list_head files;

    51 };

    53 struct razor_property {

    54 	uint name  : 24;

    55 	uint flags : 6;

    56 	enum razor_property_type type : 2;

    57 	enum razor_version_relation relation : 32;

    58 	uint32_t version;

    59 	struct list_head packages;

    60 };

    62 struct razor_entry {

    63 	uint name  : 24;

    64 	uint flags : 8;

    65 	uint32_t start;

    66 	struct list_head packages;

    67 };

    69 #define RAZOR_ENTRY_LAST	0x80

    71 struct razor_set {

    72 	struct array string_pool;

    73  	struct array packages;

    74  	struct array properties;

    75  	struct array files;

    76 	struct array package_pool;

    77  	struct array property_pool;

    78  	struct array file_pool;

    79 	struct razor_set_header *header;

    80 };

    82 struct import_entry {

    83 	uint32_t package;

    84 	char *name;

    85 };

    87 struct import_directory {

    88 	uint32_t name, count;

    89 	struct array files;

    90 	struct array packages;

    91 	struct import_directory *last;

    92 };

    94 struct razor_importer {

    95 	struct razor_set *set;

    96 	struct hashtable table;

    97 	struct razor_package *package;

    98 	struct array properties;

    99 	struct array files;

   100 	struct array file_requires;

   101 };

   103 static void *

   104 zalloc(size_t size)

   105 {

   106 	void *p;

   108 	p = malloc(size);

   109 	memset(p, 0, size);

   111 	return p;

   112 }

   114 struct razor_set_section razor_sections[] = {

   115 	{ RAZOR_STRING_POOL,	offsetof(struct razor_set, string_pool) },

   116 	{ RAZOR_PACKAGES,	offsetof(struct razor_set, packages) },

   117 	{ RAZOR_PROPERTIES,	offsetof(struct razor_set, properties) },

   118 	{ RAZOR_FILES,		offsetof(struct razor_set, files) },

   119 	{ RAZOR_PACKAGE_POOL,	offsetof(struct razor_set, package_pool) },

   120 	{ RAZOR_PROPERTY_POOL,	offsetof(struct razor_set, property_pool) },

   121 	{ RAZOR_FILE_POOL,	offsetof(struct razor_set, file_pool) },

   122 };

   124 struct razor_set *

   125 razor_set_create(void)

   126 {

   127 	struct razor_set *set;

   128 	struct razor_entry *e;

   129 	char *empty;

   131 	set = zalloc(sizeof *set);

   133 	e = array_add(&set->files, sizeof *e);

   134 	empty = array_add(&set->string_pool, 1);

   135 	*empty = '\0';

   136 	e->name = 0;

   137 	e->flags = RAZOR_ENTRY_LAST;

   138 	e->start = 0;

   139 	list_set_empty(&e->packages);

   141 	return set;

   142 }

   144 struct razor_set *

   145 razor_set_open(const char *filename)

   146 {

   147 	struct razor_set *set;

   148 	struct razor_set_section *s;

   149 	struct stat stat;

   150 	struct array *array;

   151 	int fd;

   153 	set = zalloc(sizeof *set);

   154 	fd = open(filename, O_RDONLY);

   155 	if (fstat(fd, &stat) < 0)

   156 		return NULL;

   157 	set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);

   158 	if (set->header == MAP_FAILED) {

   159 		free(set);

   160 		return NULL;

   161 	}

   163 	for (s = set->header->sections; ~s->type; s++) {

   164 		if (s->type >= ARRAY_SIZE(razor_sections))

   165 			continue;

   166 		if (s->type != razor_sections[s->type].type)

   167 			continue;

   168 		array = (void *) set + razor_sections[s->type].offset;

   169 		array->data = (void *) set->header + s->offset;

   170 		array->size = s->size;

   171 		array->alloc = s->size;

   172 	}

   173 	close(fd);

   175 	return set;

   176 }

   178 void

   179 razor_set_destroy(struct razor_set *set)

   180 {

   181 	unsigned int size;

   182 	struct array *a;

   183 	int i;

   185 	if (set->header) {

   186 		for (i = 0; set->header->sections[i].type; i++)

   187 			;

   188 		size = set->header->sections[i].type;

   189 		munmap(set->header, size);

   190 	} else {

   191 		for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {

   192 			a = (void *) set + razor_sections[i].offset;

   193 			free(a->data);

   194 		}

   195 	}

   197 	free(set);

   198 }

   200 int

   201 razor_set_write(struct razor_set *set, const char *filename)

   202 {

   203 	char data[4096];

   204 	struct razor_set_header *header = (struct razor_set_header *) data;

   205 	struct array *a;

   206 	uint32_t offset;

   207 	int i, fd;

   209 	memset(data, 0, sizeof data);

   210 	header->magic = RAZOR_MAGIC;

   211 	header->version = RAZOR_VERSION;

   212 	offset = sizeof data;

   214 	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {

   215 		if (razor_sections[i].type != i)

   216 			continue;

   217 		a = (void *) set + razor_sections[i].offset;

   218 		header->sections[i].type = i;

   219 		header->sections[i].offset = offset;

   220 		header->sections[i].size = a->size;

   221 		offset += ALIGN(a->size, 4096);

   222 	}

   224 	header->sections[i].type = ~0;

   225 	header->sections[i].offset = 0;

   226 	header->sections[i].size = 0;

   228 	fd = open(filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);

   229 	if (fd < 0)

   230 		return -1;

   232 	razor_write(fd, data, sizeof data);

   233 	memset(data, 0, sizeof data);

   234 	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {

   235 		if (razor_sections[i].type != i)

   236 			continue;

   237 		a = (void *) set + razor_sections[i].offset;

   238 		razor_write(fd, a->data, a->size);

   239 		razor_write(fd, data, ALIGN(a->size, 4096) - a->size);

   240 	}

   242 	close(fd);

   244 	return 0;

   245 }

   247 void

   248 razor_build_evr(char *evr_buf, int size, const char *epoch,

   249 		const char *version, const char *release)

   250 {

   251 	int len;

   253 	if (!version || !*version) {

   254 		*evr_buf = '\0';

   255 		return;

   256 	}

   258 	if (epoch && *epoch && strcmp(epoch, "0") != 0) {

   259 		len = snprintf(evr_buf, size, "%s:", epoch);

   260 		evr_buf += len;

   261 		size -= len;

   262 	}

   263 	len = snprintf(evr_buf, size, "%s", version);

   264 	evr_buf += len;

   265 	size -= len;

   266 	if (release && *release)

   267 		snprintf(evr_buf, size, "-%s", release);

   268 }

   270 void

   271 razor_importer_begin_package(struct razor_importer *importer,

   272 			     const char *name,

   273 			     const char *version,

   274 			     const char *arch)

   275 {

   276 	struct razor_package *p;

   278 	p = array_add(&importer->set->packages, sizeof *p);

   279 	p->name = hashtable_tokenize(&importer->table, name);

   280 	p->flags = 0;

   281 	p->version = hashtable_tokenize(&importer->table, version);

   282 	p->arch = hashtable_tokenize(&importer->table, arch);

   284 	importer->package = p;

   285 	array_init(&importer->properties);

   286 }

   288 void

   289 razor_importer_finish_package(struct razor_importer *importer)

   290 {

   291 	list_set_array(&importer->package->properties,

   292 		       &importer->set->property_pool,

   293 		       &importer->properties,

   294 		       1);

   296 	array_release(&importer->properties);

   297 }

   299 void

   300 razor_importer_add_property(struct razor_importer *importer,

   301 			    const char *name,

   302 			    enum razor_version_relation relation,

   303 			    const char *version,

   304 			    enum razor_property_type type)

   305 {

   306 	struct razor_property *p;

   307 	uint32_t *r;

   309 	p = array_add(&importer->set->properties, sizeof *p);

   310 	p->name = hashtable_tokenize(&importer->table, name);

   311 	p->flags = 0;

   312 	p->type = type;

   313 	p->relation = relation;

   314 	p->version = hashtable_tokenize(&importer->table, version);

   315 	list_set_ptr(&p->packages, importer->package -

   316 		     (struct razor_package *) importer->set->packages.data);

   318 	r = array_add(&importer->properties, sizeof *r);

   319 	*r = p - (struct razor_property *) importer->set->properties.data;

   321 	if (type == RAZOR_PROPERTY_REQUIRES && *name == '/') {

   322 		r = array_add(&importer->file_requires, sizeof *r);

   323 		*r = p->name;

   324 	}

   325 }

   327 void

   328 razor_importer_add_file(struct razor_importer *importer, const char *name)

   329 {

   330 	struct import_entry *e;

   332 	e = array_add(&importer->files, sizeof *e);

   334 	e->package = importer->package -

   335 		(struct razor_package *) importer->set->packages.data;

   336 	e->name = strdup(name);

   337 }

   339 struct razor_importer *

   340 razor_importer_new(void)

   341 {

   342 	struct razor_importer *importer;

   344 	importer = zalloc(sizeof *importer);

   345 	importer->set = razor_set_create();

   346 	hashtable_init(&importer->table, &importer->set->string_pool);

   348 	return importer;

   349 }

   351 /* Destroy an importer without creating the set. */

   352 void

   353 razor_importer_destroy(struct razor_importer *importer)

   354 {

   355 	/* FIXME: write this */

   356 }

   358 static int

   359 versioncmp(const char *s1, const char *s2)

   360 {

   361 	const char *p1, *p2;

   362 	long n1, n2;

   363 	int res;

   365 	n1 = strtol(s1, (char **) &p1, 10);

   366 	n2 = strtol(s2, (char **) &p2, 10);

   368 	/* Epoch; if one but not the other has an epoch set, default

   369 	 * the epoch-less version to 0. */

   370 	res = (*p1 == ':') - (*p2 == ':');

   371 	if (res < 0) {

   372 		n1 = 0;

   373 		p1 = s1;

   374 		p2++;

   375 	} else if (res > 0) {

   376 		p1++;

   377 		n2 = 0;

   378 		p2 = s2;

   379 	}

   381 	if (n1 != n2)

   382 		return n1 - n2;

   383 	while (*p1 && *p2) {

   384 		if (*p1 != *p2)

   385 			return *p1 - *p2;

   386 		p1++;

   387 		p2++;

   388 		if (isdigit(*p1) && isdigit(*p2))

   389 			return versioncmp(p1, p2);

   390 	}

   392 	return *p1 - *p2;

   393 }

   395 static int

   396 compare_packages(const void *p1, const void *p2, void *data)

   397 {

   398 	const struct razor_package *pkg1 = p1, *pkg2 = p2;

   399 	struct razor_set *set = data;

   400 	char *pool = set->string_pool.data;

   402 	/* FIXME: what if the flags are different? */

   403 	if (pkg1->name == pkg2->name)

   404 		return versioncmp(&pool[pkg1->version], &pool[pkg2->version]);

   405 	else

   406 		return strcmp(&pool[pkg1->name], &pool[pkg2->name]);

   407 }

   409 static int

   410 compare_properties(const void *p1, const void *p2, void *data)

   411 {

   412 	const struct razor_property *prop1 = p1, *prop2 = p2;

   413 	struct razor_set *set = data;

   414 	char *pool = set->string_pool.data;

   416 	if (prop1->name != prop2->name)

   417 		return strcmp(&pool[prop1->name], &pool[prop2->name]);

   418 	else if (prop1->type != prop2->type)

   419 		return prop1->type - prop2->type;

   420 	else if (prop1->relation != prop2->relation)

   421 		return prop1->relation - prop2->relation;

   422 	else

   423 		return versioncmp(&pool[prop1->version], &pool[prop2->version]);

   424 }

   426 static uint32_t *

   427 uniqueify_properties(struct razor_set *set)

   428 {

   429 	struct razor_property *rp, *up, *rp_end;

   430 	struct array *pkgs, *p;

   431 	struct list_head *r;

   432 	uint32_t *map, *rmap;

   433 	int i, count, unique;

   435 	count = set->properties.size / sizeof(struct razor_property);

   436 	map = razor_qsort_with_data(set->properties.data,

   437 				    count,

   438 				    sizeof(struct razor_property),

   439 				    compare_properties,

   440 				    set);

   442 	rp_end = set->properties.data + set->properties.size;

   443 	rmap = malloc(count * sizeof *map);

   444 	pkgs = zalloc(count * sizeof *pkgs);

   445 	for (rp = set->properties.data, up = rp, i = 0; rp < rp_end; rp++, i++) {

   446 		if (rp->name != up->name || rp->type != up->type ||

   447 		    rp->relation != up->relation || rp->version != up->version) {

   448 			up++;

   449 			up->name = rp->name;

   450 			up->flags = 0;

   451 			up->type = rp->type;

   452 			up->relation = rp->relation;

   453 			up->version = rp->version;

   454 		}

   456 		unique = up - (struct razor_property *) set->properties.data;

   457 		rmap[map[i]] = unique;

   458 		r = array_add(&pkgs[unique], sizeof *r);

   459 		*r = rp->packages;

   460 	}

   461 	free(map);

   463 	if (up != rp)

   464 		up++;

   465 	set->properties.size = (void *) up - set->properties.data;

   466 	rp_end = up;

   467 	for (rp = set->properties.data, p = pkgs; rp < rp_end; rp++, p++) {

   468 		list_set_array(&rp->packages, &set->package_pool, p, 0);

   469 		array_release(p);

   470 	}

   472 	free(pkgs);

   474 	return rmap;

   475 }

   477 static int

   478 compare_filenames(const void *p1, const void *p2, void *data)

   479 {

   480 	const struct import_entry *e1 = p1;

   481 	const struct import_entry *e2 = p2;

   482 	const char *n1 = e1->name;

   483 	const char *n2 = e2->name;

   485 	/* Need to make sure that the contents of a directory

   486 	 * are sorted immediately after it. So "foo/bar" has to

   487 	 * sort before "foo.conf"

   488 	 *

   489 	 * FIXME: this is about 60% slower than strcmp

   490 	 */

   491 	while (*n1 && *n2) {

   492 		if (*n1 < *n2)

   493 			return *n2 == '/' ? 1 : -1;

   494 		else if (*n1 > *n2)

   495 			return *n1 == '/' ? -1 : 1;

   496 		n1++;

   497 		n2++;

   498 	}

   499 	if (*n1)

   500 		return 1;

   501 	else if (*n2)

   502 		return -1;

   503 	else

   504 		return 0;

   505 }

   507 static void

   508 count_entries(struct import_directory *d)

   509 {

   510 	struct import_directory *p, *end;

   512 	p = d->files.data;

   513 	end = d->files.data + d->files.size;

   514 	d->count = 0;

   515 	while (p < end) {

   516 		count_entries(p);

   517 		d->count += p->count + 1;

   518 		p++;

   519 	}

   520 }

   522 static void

   523 serialize_files(struct razor_set *set,

   524 		struct import_directory *d, struct array *array)

   525 {

   526 	struct import_directory *p, *end;

   527 	struct razor_entry *e = NULL;

   528 	uint32_t s;

   530 	p = d->files.data;

   531 	end = d->files.data + d->files.size;

   532 	s = array->size / sizeof *e + d->files.size / sizeof *p;

   533 	while (p < end) {

   534 		e = array_add(array, sizeof *e);

   535 		e->name = p->name;

   536 		e->flags = 0;

   537 		e->start = p->count > 0 ? s : 0;

   538 		s += p->count;

   540 		list_set_array(&e->packages, &set->package_pool, &p->packages, 0);

   541 		array_release(&p->packages);

   542 		p++;

   543 	}

   544 	if (e != NULL)

   545 		e->flags |= RAZOR_ENTRY_LAST;

   547 	p = d->files.data;

   548 	end = d->files.data + d->files.size;

   549 	while (p < end) {

   550 		serialize_files(set, p, array);

   551 		p++;

   552 	}

   553 }

   555 static void

   556 remap_property_package_links(struct array *properties, uint32_t *rmap)

   557 {

   558 	struct razor_property *p, *end;

   560 	end = properties->data + properties->size;

   561 	for (p = properties->data; p < end; p++)

   562 		list_remap_head(&p->packages, rmap);

   563 }

   565 static void

   566 build_file_tree(struct razor_importer *importer)

   567 {

   568 	int count, i, length;

   569 	struct import_entry *filenames;

   570 	char *f, *end;

   571 	uint32_t name, *r;

   572 	char dirname[256];

   573 	struct import_directory *d, root;

   574 	struct razor_entry *e;

   576 	count = importer->files.size / sizeof (struct import_entry);

   577 	razor_qsort_with_data(importer->files.data,

   578 			      count,

   579 			      sizeof (struct import_entry),

   580 			      compare_filenames,

   581 			      NULL);

   583 	root.name = hashtable_tokenize(&importer->table, "");

   584 	array_init(&root.files);

   585 	array_init(&root.packages);

   586 	root.last = NULL;

   588 	filenames = importer->files.data;

   589 	for (i = 0; i < count; i++) {

   590 		f = filenames[i].name;

   591 		if (*f != '/')

   592 			continue;

   593 		f++;

   595 		d = &root;

   596 		while (*f) {

   597 			end = strchr(f, '/');

   598 			if (end == NULL)

   599 				end = f + strlen(f);

   600 			length = end - f;

   601 			memcpy(dirname, f, length);

   602 			dirname[length] ='\0';

   603 			name = hashtable_tokenize(&importer->table, dirname);

   604 			if (d->last == NULL || d->last->name != name) {

   605 				d->last = array_add(&d->files, sizeof *d);

   606 				d->last->name = name;

   607 				d->last->last = NULL;

   608 				array_init(&d->last->files);

   609 				array_init(&d->last->packages);

   610 			}

   611 			d = d->last;

   612 			f = end + 1;

   613 			if (*end == '\0')

   614 				break;

   615 		}

   617 		r = array_add(&d->packages, sizeof *r);

   618 		*r = filenames[i].package;

   619 		free(filenames[i].name);

   620 	}

   622 	count_entries(&root);

   623 	e = importer->set->files.data;

   624 	e->name = root.name;

   625 	e->flags = RAZOR_ENTRY_LAST;

   626 	e->start = importer->files.size ? 1 : 0;

   627 	list_set_empty(&e->packages);

   629 	serialize_files(importer->set, &root, &importer->set->files);

   631 	array_release(&importer->files);

   632 }

   634 static struct razor_entry *

   635 find_entry(struct razor_set *set, struct razor_entry *dir, const char *pattern);

   637 static void

   638 list_to_array(struct list *list, struct array *array)

   639 {

   640 	uint32_t *item;

   642 	while (list) {

   643 		 item = array_add(array, sizeof *item);

   644 		 *item = list->data;

   645 		 list = list_next(list);

   646 	}

   647 }

   649 static int

   650 compare_file_requires(const void *p1, const void *p2, void *data)

   651 {

   652 	uint32_t *f1 = (void *)p1, *f2 = (void *)p2;

   653 	const char *pool = data;

   655 	return strcmp(&pool[*f1], &pool[*f2]);

   656 }

   658 static void

   659 find_file_provides(struct razor_importer *importer)

   660 {

   661 	struct razor_property *prop;

   662 	struct razor_entry *top, *entry;

   663 	struct razor_package *packages;

   664 	struct array pkgprops;

   665 	struct list *pkg;

   666 	uint32_t *req, *req_start, *req_end;

   667 	uint32_t *map, *newprop;

   668 	char *pool;

   670 	pool = importer->set->string_pool.data;

   671 	packages = importer->set->packages.data;

   672 	top = importer->set->files.data;

   674 	req = req_start = importer->file_requires.data;

   675 	req_end = importer->file_requires.data + importer->file_requires.size;

   676 	map = razor_qsort_with_data(req, req_end - req, sizeof *req,

   677 				    compare_file_requires, pool);

   678 	free(map);

   680 	for (req = req_start; req < req_end; req++) {

   681 		if (req > req_start && req[0] == req[-1])

   682 			continue;

   683 		entry = find_entry(importer->set, top, &pool[*req]);

   684 		if (!entry)

   685 			continue;

   687 		for (pkg = list_first(&entry->packages, &importer->set->package_pool); pkg; pkg = list_next(pkg)) {

   688 			prop = array_add(&importer->set->properties, sizeof *prop);

   689 			prop->name = *req;

   690 			prop->type = RAZOR_PROPERTY_PROVIDES;

   691 			prop->relation = RAZOR_VERSION_EQUAL;

   692 			prop->version = hashtable_tokenize(&importer->table, "");

   693 			list_set_ptr(&prop->packages, pkg->data);

   695 			/* Update property list of pkg */

   696 			array_init(&pkgprops);

   697 			list_to_array(list_first(&packages[pkg->data].properties, &importer->set->property_pool), &pkgprops);

   698 			newprop = array_add(&pkgprops, sizeof *newprop);

   699 			*newprop = prop - (struct razor_property *)importer->set->properties.data;

   700 			list_set_array(&packages[pkg->data].properties, &importer->set->property_pool, &pkgprops, 1);

   701 			array_release(&pkgprops);

   702 		}

   703 	}

   705 	array_release(&importer->file_requires);

   706 }

   708 static void

   709 build_package_file_lists(struct razor_set *set, uint32_t *rmap)

   710 {

   711 	struct razor_package *p, *packages;

   712 	struct array *pkgs;

   713 	struct razor_entry *e, *end;

   714 	struct list *r;

   715 	uint32_t *q;

   716 	int i, count;

   718 	count = set->packages.size / sizeof *p;

   719 	pkgs = zalloc(count * sizeof *pkgs);

   721 	end = set->files.data + set->files.size;

   722 	for (e = set->files.data; e < end; e++) {

   723 		list_remap_head(&e->packages, rmap);

   724 		r = list_first(&e->packages, &set->package_pool);

   725 		while (r) {

   726 			q = array_add(&pkgs[r->data], sizeof *q);

   727 			*q = e - (struct razor_entry *) set->files.data;

   728 			r = list_next(r);

   729 		}

   730 	}

   732 	packages = set->packages.data;

   733 	for (i = 0; i < count; i++) {

   734 		list_set_array(&packages[i].files, &set->file_pool, &pkgs[i], 0);

   735 		array_release(&pkgs[i]);

   736 	}

   737 	free(pkgs);

   738 }

   740 struct razor_set *

   741 razor_importer_finish(struct razor_importer *importer)

   742 {

   743 	struct razor_set *set;

   744 	uint32_t *map, *rmap;

   745 	int i, count;

   747 	build_file_tree(importer);

   748 	find_file_provides(importer);

   750 	map = uniqueify_properties(importer->set);

   751 	list_remap_pool(&importer->set->property_pool, map);

   752 	free(map);

   754 	count = importer->set->packages.size / sizeof(struct razor_package);

   755 	map = razor_qsort_with_data(importer->set->packages.data,

   756 				    count,

   757 				    sizeof(struct razor_package),

   758 				    compare_packages,

   759 				    importer->set);

   761 	rmap = malloc(count * sizeof *rmap);

   762 	for (i = 0; i < count; i++)

   763 		rmap[map[i]] = i;

   764 	free(map);

   766 	list_remap_pool(&importer->set->package_pool, rmap);

   767 	build_package_file_lists(importer->set, rmap);

   768 	remap_property_package_links(&importer->set->properties, rmap);

   769 	free(rmap);

   771 	set = importer->set;

   772 	hashtable_release(&importer->table);

   773 	free(importer);

   775 	return set;

   776 }

   778 struct razor_package_iterator {

   779 	struct razor_set *set;

   780 	struct razor_package *package, *end;

   781 	struct list *index;

   782 };

   784 static struct razor_package_iterator *

   785 razor_package_iterator_create_with_index(struct razor_set *set,

   786 					 struct list *index)

   787 {

   788 	struct razor_package_iterator *pi;

   790 	pi = zalloc(sizeof *pi);

   791 	pi->set = set;

   792 	pi->index = index;

   794 	return pi;

   795 }

   797 struct razor_package_iterator *

   798 razor_package_iterator_create(struct razor_set *set)

   799 {

   800 	struct razor_package_iterator *pi;

   802 	pi = zalloc(sizeof *pi);

   803 	pi->set = set;

   804 	pi->end = set->packages.data + set->packages.size;

   805 	pi->package = set->packages.data;

   807 	return pi;

   808 }

   810 struct razor_package_iterator *

   811 razor_package_iterator_create_for_property(struct razor_set *set,

   812 					   struct razor_property *property)

   813 {

   814 	struct list *index;

   816 	index = list_first(&property->packages, &set->package_pool);

   817 	return razor_package_iterator_create_with_index(set, index);

   818 }

   820 int

   821 razor_package_iterator_next(struct razor_package_iterator *pi,

   822 			    struct razor_package **package,

   823 			    const char **name,

   824 			    const char **version,

   825 			    const char **arch)

   826 {

   827 	char *pool;

   828 	int valid;

   829 	struct razor_package *p, *packages;

   831 	if (pi->package) {

   832 		p = pi->package++;

   833 		valid = p < pi->end;

   834 	} else if (pi->index) {

   835 		packages = pi->set->packages.data;

   836 		p = &packages[pi->index->data];

   837 		pi->index = list_next(pi->index);

   838 		valid = 1;

   839 	} else

   840 		valid = 0;

   842 	if (valid) {

   843 		pool = pi->set->string_pool.data;

   844 		*package = p;

   845 		*name = &pool[p->name];

   846 		*version = &pool[p->version];

   847 		*arch = &pool[p->arch];

   848 	} else {

   849 		*package = NULL;

   850 	}

   852 	return valid;

   853 }

   855 void

   856 razor_package_iterator_destroy(struct razor_package_iterator *pi)

   857 {

   858 	free(pi);

   859 }

   861 struct razor_package *

   862 razor_set_get_package(struct razor_set *set, const char *package)

   863 {

   864 	struct razor_package_iterator *pi;

   865 	struct razor_package *p;

   866 	const char *name, *version, *arch;

   868 	pi = razor_package_iterator_create(set);

   869 	while (razor_package_iterator_next(pi, &p, &name, &version, &arch)) {

   870 		if (strcmp(package, name) == 0)

   871 			break;

   872 	}

   873 	razor_package_iterator_destroy(pi);

   875 	return p;

   876 }

   878 struct razor_property_iterator {

   879 	struct razor_set *set;

   880 	struct razor_property *property, *end;

   881 	struct list *index;

   882 };

   884 struct razor_property_iterator *

   885 razor_property_iterator_create(struct razor_set *set,

   886 			       struct razor_package *package)

   887 {

   888 	struct razor_property_iterator *pi;

   890 	pi = zalloc(sizeof *pi);

   891 	pi->set = set;

   893 	if (package) {

   894 		pi->index = list_first(&package->properties,

   895 				       &set->property_pool);

   896 	} else {

   897 		pi->property = set->properties.data;

   898 		pi->end = set->properties.data + set->properties.size;

   899 	}

   901 	return pi;

   902 }

   904 int

   905 razor_property_iterator_next(struct razor_property_iterator *pi,

   906 			     struct razor_property **property,

   907 			     const char **name,

   908 			     enum razor_version_relation *relation,

   909 			     const char **version,

   910 			     enum razor_property_type *type)

   911 {

   912 	char *pool;

   913 	int valid;

   914 	struct razor_property *p, *properties;

   916 	if (pi->property) {

   917 		p = pi->property++;

   918 		valid = p < pi->end;

   919 	} else if (pi->index) {

   920 		properties = pi->set->properties.data;

   921 		p = &properties[pi->index->data];

   922 		pi->index = list_next(pi->index);

   923 		valid = 1;

   924 	} else

   925 		valid = 0;

   927 	if (valid) {

   928 		pool = pi->set->string_pool.data;

   929 		*property = p;

   930 		*name = &pool[p->name];

   931 		*relation = p->relation;

   932 		*version = &pool[p->version];

   933 		*type = p->type;

   934 	} else {

   935 		*property = NULL;

   936 	}

   938 	return valid;

   939 }

   941 void

   942 razor_property_iterator_destroy(struct razor_property_iterator *pi)

   943 {

   944 	free(pi);

   945 }

   947 static struct razor_entry *

   948 find_entry(struct razor_set *set, struct razor_entry *dir, const char *pattern)

   949 {

   950 	struct razor_entry *e;

   951 	const char *n, *pool = set->string_pool.data;

   952 	int len;

   954 	e = (struct razor_entry *) set->files.data + dir->start;

   955 	do {

   956 		n = pool + e->name;

   957 		if (strcmp(pattern + 1, n) == 0)

   958 			return e;

   959 		len = strlen(n);

   960 		if (e->start != 0 && strncmp(pattern + 1, n, len) == 0 &&

   961 		    pattern[len + 1] == '/') {

   962 			return find_entry(set, e, pattern + len + 1);

   963 		}

   964 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));

   966 	return NULL;

   967 }

   969 static void

   970 list_dir(struct razor_set *set, struct razor_entry *dir,

   971 	 char *prefix, const char *pattern)

   972 {

   973 	struct razor_entry *e;

   974 	const char *n, *pool = set->string_pool.data;

   976 	e = (struct razor_entry *) set->files.data + dir->start;

   977 	do {

   978 		n = pool + e->name;

   979 		if (pattern && pattern[0] && fnmatch(pattern, n, 0) != 0)

   980 			continue;

   981 		printf("%s/%s\n", prefix, n);

   982 		if (e->start) {

   983 			char *sub = prefix + strlen (prefix);

   984 			*sub = '/';

   985 			strcpy (sub + 1, n);

   986 			list_dir(set, e, prefix, pattern);

   987 			*sub = '\0';

   988 		}

   989 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));

   990 }

   992 void

   993 razor_set_list_files(struct razor_set *set, const char *pattern)

   994 {

   995 	struct razor_entry *e;

   996 	char buffer[512], *p, *base;

   998 	if (pattern == NULL || !strcmp (pattern, "/")) {

   999 		buffer[0] = '\0';

  1000 		list_dir(set, set->files.data, buffer, NULL);

  1001 		return;

  1002 	}

  1004 	strcpy(buffer, pattern);

  1005 	e = find_entry(set, set->files.data, buffer);

  1006 	if (e && e->start > 0) {

  1007 		base = NULL;

  1008 	} else {

  1009 		p = strrchr(buffer, '/');

  1010 		if (p) {

  1011 			*p = '\0';

  1012 			base = p + 1;

  1013 		} else {

  1014 			base = NULL;

  1015 		}

  1016 	}

  1017 	e = find_entry(set, set->files.data, buffer);

  1018 	if (e->start != 0)

  1019 		list_dir(set, e, buffer, base);

  1020 }

  1022 struct razor_package_iterator *

  1023 razor_package_iterator_create_for_file(struct razor_set *set,

  1024 				       const char *filename)

  1025 {

  1026 	struct razor_entry *entry;

  1027 	struct list *index;

  1029 	entry = find_entry(set, set->files.data, filename);

  1030 	if (entry == NULL)

  1031 		return NULL;

  1033 	index = list_first(&entry->packages, &set->package_pool);

  1034 	return razor_package_iterator_create_with_index(set, index);

  1035 }

  1037 static struct list *

  1038 list_package_files(struct razor_set *set, struct list *r,

  1039 		   struct razor_entry *dir, uint32_t end,

  1040 		   char *prefix)

  1041 {

  1042 	struct razor_entry *e, *f, *entries;

  1043 	uint32_t next, file;

  1044 	char *pool;

  1045 	int len;

  1047 	entries = (struct razor_entry *) set->files.data;

  1048 	pool = set->string_pool.data;

  1050 	e = entries + dir->start;

  1051 	do {

  1052 		if (entries + r->data == e) {

  1053 			printf("%s/%s\n", prefix, pool + e->name);

  1054 			r = list_next(r);

  1055 			if (!r)

  1056 				return NULL;

  1057 			if (r->data >= end)

  1058 				return r;

  1059 		}

  1060 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));

  1062 	e = entries + dir->start;

  1063 	do {

  1064 		if (e->start == 0)

  1065 			continue;

  1067 		if (e->flags & RAZOR_ENTRY_LAST)

  1068 			next = end;

  1069 		else {

  1070 			f = e + 1;

  1071 			while (f->start == 0 && !(f->flags & RAZOR_ENTRY_LAST))

  1072 				f++;

  1073 			if (f->start == 0)

  1074 				next = end;

  1075 			else

  1076 				next = f->start;

  1077 		}

  1079 		file = r->data;

  1080 		if (e->start <= file && file < next) {

  1081 			len = strlen(prefix);

  1082 			prefix[len] = '/';

  1083 			strcpy(prefix + len + 1, pool + e->name);

  1084 			r = list_package_files(set, r, e, next, prefix);

  1085 			prefix[len] = '\0';

  1086 		}

  1087 	} while (!((e++)->flags & RAZOR_ENTRY_LAST) && r != NULL);

  1089 	return r;

  1090 }

  1092 void

  1093 razor_set_list_package_files(struct razor_set *set, const char *name)

  1094 {

  1095 	struct razor_package *package;

  1096 	struct list *r;

  1097 	uint32_t end;

  1098 	char buffer[512];

  1100 	package = razor_set_get_package(set, name);

  1102 	r = list_first(&package->files, &set->file_pool);

  1103 	end = set->files.size / sizeof (struct razor_entry);

  1104 	buffer[0] = '\0';

  1105 	list_package_files(set, r, set->files.data, end, buffer);

  1106 }

  1108 static void

  1109 razor_set_validate(struct razor_set *set, struct array *unsatisfied)

  1110 {

  1111 	struct razor_property *r, *p, *end;

  1112 	uint32_t *u;

  1113 	char *pool;

  1115 	end = set->properties.data + set->properties.size;

  1116 	pool = set->string_pool.data;

  1118 	for (r = set->properties.data, p = r; r < end; r++) {

  1119 		if (r->type != RAZOR_PROPERTY_REQUIRES)

  1120 			continue;

  1122 		p = r;

  1123 		while (p < end && p->name == r->name &&

  1124 		       p->type == r->type)

  1125 			p++;

  1127 		/* If there is more than one version of a provides,

  1128 		 * seek to the end for the highest version. */

  1129 		/* FIXME: This doesn't work if we have a series of

  1130 		 * requires a = 1, provides a = 1, requires a = 2,

  1131 		 * provides a = 2, as the kernel and kernel-devel

  1132 		 * does.*/

  1133 		while (p + 1 < end && p->name == (p + 1)->name &&

  1134 		       p->type == (p + 1)->type)

  1135 			p++;

  1137 		/* FIXME: We need to track property flags (<, <=, =

  1138 		 * etc) to properly determine if a requires is

  1139 		 * satisfied.  The current code doesn't track that the

  1140 		 * requires a = 1 isn't satisfied by a = 2 provides. */

  1142 		if (p == end ||

  1143 		    p->type != RAZOR_PROPERTY_PROVIDES ||

  1144 		    r->name != p->name ||

  1145 		    versioncmp(&pool[r->version], &pool[p->version]) > 0) {

  1146 			/* FIXME: We ignore file requires for now. */

  1147 			if (pool[r->name] == '/')

  1148 				continue;

  1149 			u = array_add(unsatisfied, sizeof *u);

  1150 			*u = r - (struct razor_property *) set->properties.data;

  1151 		}

  1152 	}

  1153 }

  1155 void

  1156 razor_set_list_unsatisfied(struct razor_set *set)

  1157 {

  1158 	struct array unsatisfied;

  1159 	struct razor_property *properties, *r;

  1160 	uint32_t *u, *end;

  1161 	char *pool;

  1163 	array_init(&unsatisfied);

  1164 	razor_set_validate(set, &unsatisfied);

  1166 	end = unsatisfied.data + unsatisfied.size;

  1167 	properties = set->properties.data;

  1168 	pool = set->string_pool.data;

  1170 	for (u = unsatisfied.data; u < end; u++) {

  1171 		r = properties + *u;

  1172 		if (pool[r->version] == '\0')

  1173 			printf("%ss not satisfied\n",

  1174 			       &pool[r->name]);

  1175 		else

  1176 			printf("%s-%s not satisfied\n",

  1177 			       &pool[r->name],

  1178 			       &pool[r->version]);

  1179 	}

  1181 	array_release(&unsatisfied);

  1182 }

  1184 #define UPSTREAM_SOURCE 0x80

  1186 struct source {

  1187 	struct razor_set *set;

  1188 	uint32_t *property_map;

  1189 	uint32_t *file_map;

  1190 };

  1192 struct razor_merger {

  1193 	struct razor_set *set;

  1194 	struct hashtable table;

  1195 	struct source source1;

  1196 	struct source source2;

  1197 };

  1199 static struct razor_merger *

  1200 razor_merger_create(struct razor_set *set1, struct razor_set *set2)

  1201 {

  1202 	struct razor_merger *merger;

  1203 	int count;

  1204 	size_t size;

  1206 	merger = zalloc(sizeof *merger);

  1207 	merger->set = razor_set_create();

  1208 	hashtable_init(&merger->table, &merger->set->string_pool);

  1210 	merger->source1.set = set1;

  1211 	count = set1->properties.size / sizeof (struct razor_property);

  1212 	size = count * sizeof merger->source1.property_map[0];

  1213 	merger->source1.property_map = zalloc(size);

  1214 	count = set1->files.size / sizeof (struct razor_entry);

  1215 	size = count * sizeof merger->source1.file_map[0];

  1216 	merger->source1.file_map = zalloc(size);

  1218 	merger->source2.set = set2;

  1219 	count = set2->properties.size / sizeof (struct razor_property);

  1220 	size = count * sizeof merger->source2.property_map[0];

  1221 	merger->source2.property_map = zalloc(size);

  1222 	count = set2->files.size / sizeof (struct razor_entry);

  1223 	size = count * sizeof merger->source2.file_map[0];

  1224 	merger->source2.file_map = zalloc(size);

  1226 	return merger;

  1227 }

  1229 static void

  1230 add_package(struct razor_merger *merger,

  1231 	    struct razor_package *package, struct source *source,

  1232 	    uint32_t flags)

  1233 {

  1234 	char *pool;

  1235 	struct list *r;

  1236 	struct razor_package *p;

  1238 	pool = source->set->string_pool.data;

  1239 	p = array_add(&merger->set->packages, sizeof *p);

  1240 	p->name = hashtable_tokenize(&merger->table, &pool[package->name]);

  1241 	p->flags = flags;

  1242 	p->version = hashtable_tokenize(&merger->table,

  1243 					&pool[package->version]);

  1244 	p->arch = hashtable_tokenize(&merger->table,

  1245 				     &pool[package->arch]);

  1247 	p->properties = package->properties;

  1248 	r = list_first(&package->properties, &source->set->property_pool);

  1249 	while (r) {

  1250 		source->property_map[r->data] = 1;

  1251 		r = list_next(r);

  1252 	}

  1254 	p->files = package->files;

  1255 	r = list_first(&package->files, &source->set->file_pool);

  1256 	while (r) {

  1257 		source->file_map[r->data] = 1;

  1258 		r = list_next(r);

  1259 	}

  1260 }

  1262 static uint32_t

  1263 add_property(struct razor_merger *merger,

  1264 	     const char *name, enum razor_version_relation relation,

  1265 	     const char *version, int type)

  1266 {

  1267 	struct razor_property *p;

  1269 	p = array_add(&merger->set->properties, sizeof *p);

  1270 	p->name = hashtable_tokenize(&merger->table, name);

  1271 	p->flags = 0;

  1272 	p->type = type;

  1273 	p->relation = relation;

  1274 	p->version = hashtable_tokenize(&merger->table, version);

  1276 	return p - (struct razor_property *) merger->set->properties.data;

  1277 }

  1279 static void

  1280 merge_properties(struct razor_merger *merger)

  1281 {

  1282 	struct razor_property *p1, *p2;

  1283 	struct razor_set *set1, *set2;

  1284 	uint32_t *map1, *map2;

  1285 	int i, j, cmp, count1, count2;

  1286 	char *pool1, *pool2;

  1288 	set1 = merger->source1.set;

  1289 	set2 = merger->source2.set;

  1290 	map1 = merger->source1.property_map;

  1291 	map2 = merger->source2.property_map;

  1293 	i = 0;

  1294 	j = 0;

  1295 	pool1 = set1->string_pool.data;

  1296 	pool2 = set2->string_pool.data;

  1298 	count1 = set1->properties.size / sizeof *p1;

  1299 	count2 = set2->properties.size / sizeof *p2;

  1300 	while (i < count1 || j < count2) {

  1301 		if (i < count1 && map1[i] == 0) {

  1302 			i++;

  1303 			continue;

  1304 		}

  1305 		if (j < count2 && map2[j] == 0) {

  1306 			j++;

  1307 			continue;

  1308 		}

  1309 		p1 = (struct razor_property *) set1->properties.data + i;

  1310 		p2 = (struct razor_property *) set2->properties.data + j;

  1311 		if (i < count1 && j < count2)

  1312 			cmp = strcmp(&pool1[p1->name], &pool2[p2->name]);

  1313 		else if (i < count1)

  1314 			cmp = -1;

  1315 		else

  1316 			cmp = 1;

  1317 		if (cmp == 0)

  1318 			cmp = p1->type - p2->type;

  1319 		if (cmp == 0)

  1320 			cmp = p1->relation - p2->relation;

  1321 		if (cmp == 0)

  1322 			cmp = versioncmp(&pool1[p1->version],

  1323 					 &pool2[p2->version]);

  1324 		if (cmp < 0) {

  1325 			map1[i++] = add_property(merger,

  1326 						 &pool1[p1->name],

  1327 						 p1->relation,

  1328 						 &pool1[p1->version],

  1329 						 p1->type);

  1330 		} else if (cmp > 0) {

  1331 			map2[j++] = add_property(merger,

  1332 						 &pool2[p2->name],

  1333 						 p2->relation,

  1334 						 &pool2[p2->version],

  1335 						 p2->type);

  1336 		} else  {

  1337 			map1[i++] = map2[j++] = add_property(merger,

  1338 							     &pool1[p1->name],

  1339 							     p1->relation,

  1340 							     &pool1[p1->version],

  1341 							     p1->type);

  1342 		}

  1343 	}

  1344 }

  1346 static void

  1347 emit_properties(struct list_head *properties, struct array *source_pool,

  1348 		uint32_t *map, struct array *pool)

  1349 {

  1350 	uint32_t r;

  1351 	struct list *p, *q;

  1353 	r = pool->size / sizeof *q;

  1354 	p = list_first(properties, source_pool);

  1355 	while (p) {

  1356 		q = array_add(pool, sizeof *q);

  1357 		q->data = map[p->data];

  1358 		q->flags = p->flags;

  1359 		p = list_next(p);

  1360 	}

  1362 	list_set_ptr(properties, r);

  1363 }

  1365 static uint32_t

  1366 add_file(struct razor_merger *merger, const char *name)

  1367 {

  1368 	struct razor_entry *e;

  1370 	e = array_add(&merger->set->files, sizeof *e);

  1371 	e->name = hashtable_tokenize(&merger->table, name);

  1372 	e->flags = 0;

  1373 	e->start = 0;

  1375 	return e - (struct razor_entry *)merger->set->files.data;

  1376 }

  1378 /* FIXME. Blah */

  1379 static int

  1380 fix_file_map(uint32_t *map,

  1381 	     struct razor_entry *files,

  1382 	     struct razor_entry *top)

  1383 {

  1384 	uint32_t e;

  1385 	int found_file = 0;

  1387 	e = top->start;

  1388 	do {

  1389 		if (files[e].start)

  1390 			fix_file_map(map, files, &files[e]);

  1391 		if (map[e])

  1392 			found_file = 1;

  1393 	} while (!(files[e++].flags & RAZOR_ENTRY_LAST));

  1395 	if (found_file)

  1396 		map[top - files] = 1;

  1397 	return found_file;

  1398 }

  1400 struct merge_directory {

  1401 	uint32_t merged, dir1, dir2;

  1402 };

  1404 static void

  1405 merge_one_directory(struct razor_merger *merger, struct merge_directory *md)

  1406 {

  1407 	struct razor_entry *root1, *root2, *mroot, *e1, *e2;

  1408 	struct razor_set *set1, *set2;

  1409 	struct array merge_stack;

  1410 	struct merge_directory *child_md, *end_md;

  1411 	uint32_t *map1, *map2, start, last;

  1412 	int cmp;

  1413 	char *pool1, *pool2;

  1415 	set1 = merger->source1.set;

  1416 	set2 = merger->source2.set;

  1417 	map1 = merger->source1.file_map;

  1418 	map2 = merger->source2.file_map;

  1419 	pool1 = set1->string_pool.data;

  1420 	pool2 = set2->string_pool.data;

  1421 	root1 = (struct razor_entry *) set1->files.data;

  1422 	root2 = (struct razor_entry *) set2->files.data;

  1424 	array_init(&merge_stack);

  1426 	start = merger->set->files.size / sizeof (struct razor_entry);

  1427 	last = 0;

  1428 	e1 = md->dir1 ? root1 + md->dir1 : NULL;

  1429 	e2 = md->dir2 ? root2 + md->dir2 : NULL;

  1430 	while (e1 || e2) {

  1431 		if (!e2 && !map1[e1 - root1]) {

  1432 			if ((e1++)->flags & RAZOR_ENTRY_LAST)

  1433 				e1 = NULL;

  1434 			continue;

  1435 		}

  1436 		if (!e1 && !map2[e2 - root2]) {

  1437 			if ((e2++)->flags & RAZOR_ENTRY_LAST)

  1438 				e2 = NULL;

  1439 			continue;

  1440 		}

  1441 		if (e1 && !map1[e1 - root1] &&

  1442 		    e2 && !map1[e2 - root2]) {

  1443 			if ((e1++)->flags & RAZOR_ENTRY_LAST)

  1444 				e1 = NULL;

  1445 			if ((e2++)->flags & RAZOR_ENTRY_LAST)

  1446 				e2 = NULL;

  1447 			continue;

  1448 		}

  1450 		if (!e1)

  1451 			cmp = 1;

  1452 		else if (!e2)

  1453 			cmp = -1;

  1454 		else {

  1455 			cmp = strcmp (&pool1[e1->name],

  1456 				      &pool2[e2->name]);

  1457 		}

  1459 		if (cmp < 0) {

  1460 			if (map1[e1 - root1]) {

  1461 				map1[e1 - root1] = last =

  1462 					add_file(merger, &pool1[e1->name]);

  1463 				if (e1->start) {

  1464 					child_md = array_add(&merge_stack, sizeof (struct merge_directory));

  1465 					child_md->merged = last;

  1466 					child_md->dir1 = e1->start;

  1467 					child_md->dir2 = 0;

  1468 				}

  1469 			}

  1470 			if ((e1++)->flags & RAZOR_ENTRY_LAST)

  1471 				e1 = NULL;

  1472 		} else if (cmp > 0) {

  1473 			if (map2[e2 - root2]) {

  1474 				map2[e2 - root2] = last =

  1475 					add_file(merger, &pool2[e2->name]);

  1476 				if (e2->start) {

  1477 					child_md = array_add(&merge_stack, sizeof (struct merge_directory));

  1478 					child_md->merged = last;

  1479 					child_md->dir1 = 0;

  1480 					child_md->dir2 = e2->start;

  1481 				}

  1482 			}

  1483 			if ((e2++)->flags & RAZOR_ENTRY_LAST)

  1484 				e2 = NULL;

  1485 		} else {

  1486 			map1[e1 - root1] = map2[e2- root2] = last =

  1487 				add_file(merger, &pool1[e1->name]);

  1488 			if (e1->start || e2->start) {

  1489 				child_md = array_add(&merge_stack, sizeof (struct merge_directory));

  1490 				child_md->merged = last;

  1491 				child_md->dir1 = e1->start;

  1492 				child_md->dir2 = e2->start;

  1493 			}

  1494 			if ((e1++)->flags & RAZOR_ENTRY_LAST)

  1495 				e1 = NULL;

  1496 			if ((e2++)->flags & RAZOR_ENTRY_LAST)

  1497 				e2 = NULL;

  1498 		}

  1499 	}

  1501 	mroot = (struct razor_entry *)merger->set->files.data;

  1502 	if (last) {

  1503 		mroot[last].flags = RAZOR_ENTRY_LAST;

  1504 		mroot[md->merged].start = start;

  1505 	} else

  1506 		mroot[md->merged].start = 0;

  1508 	end_md = merge_stack.data + merge_stack.size;

  1509 	for (child_md = merge_stack.data; child_md < end_md; child_md++)

  1510 		merge_one_directory(merger, child_md);

  1511 	array_release(&merge_stack);

  1512 }

  1514 static void

  1515 merge_files(struct razor_merger *merger)

  1516 {

  1517 	struct razor_entry *root;

  1518 	struct merge_directory md;

  1519 	uint32_t *map1, *map2;

  1521 	map1 = merger->source1.file_map;

  1522 	map2 = merger->source2.file_map;

  1524 	md.merged = 0;

  1526 	if (merger->source1.set->files.size) {

  1527 		root = (struct razor_entry *) merger->source1.set->files.data;

  1528 		if (root->start)

  1529 			fix_file_map(map1, root, root);

  1530 		md.dir1 = root->start;

  1531 	} else

  1532 		md.dir1 = 0;

  1534 	if (merger->source2.set->files.size) {

  1535 		root = (struct razor_entry *) merger->source2.set->files.data;

  1536 		if (root->start)

  1537 			fix_file_map(map2, root, root);

  1538 		md.dir2 = root->start;

  1539 	} else

  1540 		md.dir2 = 0;

  1542 	merge_one_directory(merger, &md);

  1543 }

  1545 static void

  1546 emit_files(struct list_head *files, struct array *source_pool,

  1547 	   uint32_t *map, struct array *pool)

  1548 {

  1549 	uint32_t r;

  1550 	struct list *p, *q;

  1552 	r = pool->size / sizeof *q;

  1553 	p = list_first(files, source_pool);

  1554 	while (p) {

  1555 		q = array_add(pool, sizeof *q);

  1556 		q->data = map[p->data];

  1557 		q->flags = p->flags;

  1558 		p = list_next(p);

  1559 	}

  1561 	list_set_ptr(files, r);

  1562 }

  1564 /* Rebuild property->packages maps.  We can't just remap these, as a

  1565  * property may have lost or gained a number of packages.  Allocate an

  1566  * array per property and loop through the packages and add them to

  1567  * the arrays for their properties. */

  1568 static void

  1569 rebuild_property_package_lists(struct razor_set *set)

  1570 {

  1571 	struct array *pkgs, *a;

  1572 	struct razor_package *pkg, *pkg_end;

  1573 	struct razor_property *prop, *prop_end;

  1574 	struct list *r;

  1575 	uint32_t *q;

  1576 	int count;

  1578 	count = set->properties.size / sizeof (struct razor_property);

  1579 	pkgs = zalloc(count * sizeof *pkgs);

  1580 	pkg_end = set->packages.data + set->packages.size;

  1582 	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {

  1583 		r = list_first(&pkg->properties, &set->property_pool);

  1584 		while (r) {

  1585 			q = array_add(&pkgs[r->data], sizeof *q);

  1586 			*q = pkg - (struct razor_package *) set->packages.data;

  1587 			r = list_next(r);

  1588 		}

  1589 	}

  1591 	prop_end = set->properties.data + set->properties.size;

  1592 	a = pkgs;

  1593 	for (prop = set->properties.data; prop < prop_end; prop++, a++) {

  1594 		list_set_array(&prop->packages, &set->package_pool, a, 0);

  1595 		array_release(a);

  1596 	}

  1597 	free(pkgs);

  1598 }

  1600 static void

  1601 rebuild_file_package_lists(struct razor_set *set)

  1602 {

  1603 	struct array *pkgs, *a;

  1604 	struct razor_package *pkg, *pkg_end;

  1605 	struct razor_entry *entry, *entry_end;

  1606 	struct list *r;

  1607 	uint32_t *q;

  1608 	int count;

  1610 	count = set->files.size / sizeof (struct razor_entry);

  1611 	pkgs = zalloc(count * sizeof *pkgs);

  1612 	pkg_end = set->packages.data + set->packages.size;

  1614 	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {

  1615 		r = list_first(&pkg->files, &set->file_pool);

  1616 		while (r) {

  1617 			q = array_add(&pkgs[r->data], sizeof *q);

  1618 			*q = pkg - (struct razor_package *) set->packages.data;

  1619 			r = list_next(r);

  1620 		}

  1621 	}

  1623 	entry_end = set->files.data + set->files.size;

  1624 	a = pkgs;

  1625 	for (entry = set->files.data; entry < entry_end; entry++, a++) {

  1626 		list_set_array(&entry->packages, &set->package_pool, a, 0);

  1627 		array_release(a);

  1628 	}

  1629 	free(pkgs);

  1630 }

  1632 static struct razor_set *

  1633 razor_merger_finish(struct razor_merger *merger)

  1634 {

  1635 	struct razor_set *result;

  1636 	struct razor_package *p, *pend;

  1638 	/* As we built the package list, we filled out a bitvector of

  1639 	 * the properties that are referenced by the packages in the

  1640 	 * new set.  Now we do a parallel loop through the properties

  1641 	 * and emit those marked in the bit vector to the new set.  In

  1642 	 * the process, we update the bit vector to actually map from

  1643 	 * indices in the old property list to indices in the new

  1644 	 * property list for both sets. */

  1646 	merge_properties(merger);

  1647 	merge_files(merger);

  1649 	/* Now we loop through the packages again and emit the

  1650 	 * property lists, remapped to point to the new properties. */

  1652 	pend = merger->set->packages.data + merger->set->packages.size;

  1653 	for (p = merger->set->packages.data; p < pend; p++) {

  1654 		struct source *src;

  1656 		if (p->flags & UPSTREAM_SOURCE)

  1657 			src = &merger->source2;

  1658 		else

  1659 			src = &merger->source1;

  1661 		emit_properties(&p->properties,

  1662 				&src->set->property_pool,

  1663 				src->property_map,

  1664 				&merger->set->property_pool);

  1665 		emit_files(&p->files,

  1666 			   &src->set->file_pool,

  1667 			   src->file_map,

  1668 			   &merger->set->file_pool);

  1669 		p->flags &= ~UPSTREAM_SOURCE;

  1670 	}

  1672 	rebuild_property_package_lists(merger->set);

  1673 	rebuild_file_package_lists(merger->set);

  1675 	result = merger->set;

  1676 	hashtable_release(&merger->table);

  1677 	free(merger);

  1679 	return result;

  1680 }

  1682 /* The diff order matters.  We should sort the packages so that a

  1683  * REMOVE of a package comes before the INSTALL, and so that all

  1684  * requires for a package have been installed before the package.

  1685  **/

  1687 void

  1688 razor_set_diff(struct razor_set *set, struct razor_set *upstream,

  1689 	       razor_package_callback_t callback, void *data)

  1690 {

  1691 	struct razor_package_iterator *pi1, *pi2;

  1692 	struct razor_package *p1, *p2;

  1693 	const char *name1, *name2, *version1, *version2, *arch1, *arch2;

  1694 	int res;

  1696 	pi1 = razor_package_iterator_create(set);

  1697 	pi2 = razor_package_iterator_create(upstream);

  1699 	razor_package_iterator_next(pi1, &p1, &name1, &version1, &arch1);

  1700 	razor_package_iterator_next(pi2, &p2, &name2, &version2, &arch2);

  1702 	while (p1 || p2) {

  1703 		if (p1 && p2) {

  1704 			res = strcmp(name1, name2);

  1705 			if (res == 0)

  1706 				res = versioncmp(version1, version2);

  1707 		} else {

  1708 			res = 0;

  1709 		}

  1711 		if (p2 == NULL || res < 0)

  1712 			callback(name1, version1, NULL, arch1, data);

  1713 		else if (p1 == NULL || res > 0)

  1714 			callback(name2, NULL, version2, arch2, data);

  1716 		if (p1 != NULL && res <= 0)

  1717 			razor_package_iterator_next(pi1, &p1,

  1718 						    &name1, &version1, &arch1);

  1719 		if (p2 != NULL && res >= 0)

  1720 			razor_package_iterator_next(pi2, &p2,

  1721 						    &name2, &version2, &arch2);

  1722 	}

  1724 	razor_package_iterator_destroy(pi1);

  1725 	razor_package_iterator_destroy(pi2);

  1726 }

  1728 struct razor_transaction;

  1729 struct razor_transaction_package;

  1730 struct razor_transaction_resolver;

  1732 struct razor_transaction {

  1733 	int package_count, errors;

  1734 	struct razor_set *system, *upstream;

  1736 	struct bitarray syspkgs, uppkgs;

  1737 	struct array packages;

  1738 };

  1740 struct razor_transaction_package {

  1741 	const char *name, *old_version, *new_version;

  1742 	struct razor_package *old_package, *new_package;

  1743 	enum razor_transaction_package_state state;

  1745 	/* dep_package is the name of the package that resulted in

  1746 	 * this entry being created (or NULL if the user requested the

  1747 	 * install/remove), with the other dep_ fields providing

  1748 	 * additional information.

  1749 	 *

  1750 	 * For INSTALL, if dep_type is REQUIRES, then dep_package

  1751 	 * required something that this package provides. If dep_type

  1752 	 * is CONFLICTS, then dep_package is a package that conflicted

  1753 	 * with an older version of this package, forcing an upgrade.

  1754 	 *

  1755 	 * For REMOVE, if dep_type is REQUIRES, then dep_package is a

  1756 	 * package that is being removed. If dep_type is OBSOLETES,

  1757 	 * then dep_package is a package that obsoletes this one.

  1758 	 *

  1759 	 * For OLD_CONFLICT or NEW_CONFLICT, dep_package is an

  1760 	 * existing package that conflicts with this one. The

  1761 	 * conflicting property comes from the already-installed

  1762 	 * package for OLD_CONFLICT, or the to-be-installed package

  1763 	 * for NEW_CONFLICT.

  1764 	 *

  1765 	 * For UNSATISFIABLE, the dep_ fields are as for an INSTALL,

  1766 	 * but the name field will be NULL.

  1767 	 */

  1768 	const char *dep_package;

  1769 	enum razor_property_type dep_type;

  1770 	const char *dep_property;

  1771 	enum razor_version_relation dep_relation;

  1772 	const char *dep_version;

  1773 };

  1775 static int

  1776 package_in_set(void *package, struct razor_set *set)

  1777 {

  1778 	return package >= set->packages.data &&

  1779 		package < set->packages.data + set->packages.size;

  1780 }

  1782 static int

  1783 property_in_set(void *property, struct razor_set *set)

  1784 {

  1785 	return property >= set->properties.data &&

  1786 		property < set->properties.data + set->properties.size;

  1787 }

  1789 static struct razor_package *

  1790 property_provider_package(struct razor_transaction *trans,

  1791 			  struct razor_property *prop,

  1792 			  int installed)

  1793 {

  1794 	struct razor_set *set;

  1795 	struct bitarray *pkgbits;

  1796 	struct razor_package *pkgs;

  1797 	struct list *p;

  1799 	if (installed && prop->type != RAZOR_PROPERTY_PROVIDES)

  1800 		return NULL;

  1801 	else if (!installed &&

  1802 		 prop->type != RAZOR_PROPERTY_PROVIDES &&

  1803 		 prop->type != RAZOR_PROPERTY_OBSOLETES)

  1804 		return NULL;

  1806 	if (property_in_set(prop, trans->system)) {

  1807 		set = trans->system;

  1808 		pkgbits = &trans->syspkgs;

  1809 	} else {

  1810 		set = trans->upstream;

  1811 		pkgbits = &trans->uppkgs;

  1812 	}

  1813 	pkgs = set->packages.data;

  1815 	for (p = list_first(&prop->packages, &set->package_pool); p; p = list_next(p)) {

  1816 		if (bitarray_get(pkgbits, p->data) != installed)

  1817 			continue;

  1818 		if (prop->type == RAZOR_PROPERTY_OBSOLETES ||

  1819 		    pkgs[p->data].name == prop->name)

  1820 			return &pkgs[p->data];

  1821 	}

  1822 	return NULL;

  1823 }

  1825 static int

  1826 compare_transaction_packages(const void *one, const void *two)

  1827 {

  1828 	struct razor_transaction_package **tp1 = (void *)one;

  1829 	struct razor_transaction_package **tp2 = (void *)two;

  1831 	if (!(*tp1)->name)

  1832 		return 1;

  1833 	else if (!(*tp2)->name)

  1834 		return -1;

  1835 	else

  1836 		return strcmp((*tp1)->name, (*tp2)->name);

  1837 }

  1839 /* FIXME: merge this into the other property loop in razor_transaction_satisfy */

  1840 static void

  1841 resolve_new_packages(struct razor_transaction *trans,

  1842 		     int start, int end)

  1843 {

  1844 	struct razor_property *sp, *up, *sp_end, *up_end;

  1845 	struct razor_package *spkg, *spkgs, *upkg, *upkgs;

  1846 	struct razor_transaction_package **packages;

  1847 	const char *spool, *upool;

  1848 	int i;

  1850 	sp_end = trans->system->properties.data + trans->system->properties.size;

  1851 	spool = trans->system->string_pool.data;

  1852 	spkgs = trans->system->packages.data;

  1853 	up_end = trans->upstream->properties.data + trans->upstream->properties.size;

  1854 	upool = trans->upstream->string_pool.data;

  1855 	upkgs = trans->upstream->packages.data;

  1857 	/* FIXME, check if sorting the packages directly (rather than

  1858 	 * sorting pointers-to-packages) still results in confusing

  1859 	 * descriptions.

  1860 	 */

  1861 	packages = calloc(end - start, sizeof *packages);

  1862 	for (i = start; i < end; i++)

  1863 		packages[i - start] = ((struct razor_transaction_package *)trans->packages.data) + i;

  1864 	qsort(packages, end - start, sizeof *packages,

  1865 	      compare_transaction_packages);

  1867 	sp = trans->system->properties.data;

  1868 	up = trans->upstream->properties.data;

  1869 	for (i = 0; i < end - start; i++) {

  1870 		if (!packages[i]->name ||

  1871 		    packages[i]->state >= RAZOR_PACKAGE_FIRST_ERROR_STATE)

  1872 			continue;

  1874 		spkg = NULL;

  1875 		while (sp < sp_end &&

  1876 		       strcmp(&spool[sp->name], packages[i]->name) < 0)

  1877 			sp++;

  1878 		while (sp < sp_end &&

  1879 		       strcmp(&spool[sp->name], packages[i]->name) == 0 &&

  1880 		       !(spkg = property_provider_package(trans, sp, 1)))

  1881 			sp++;

  1883 		upkg = NULL;

  1884 		while (up < up_end &&

  1885 		       strcmp(&upool[up->name], packages[i]->name) < 0)

  1886 			up++;

  1887 		while (up < up_end &&

  1888 		       strcmp(&upool[up->name], packages[i]->name) == 0 &&

  1889 		       !(upkg = property_provider_package(trans, up, 0)))

  1890 			up++;

  1892 		if (packages[i]->state == RAZOR_PACKAGE_REMOVE ||

  1893 		    packages[i]->state == RAZOR_PACKAGE_OBSOLETED) {

  1894 			if (spkg) {

  1895 				packages[i]->old_package = spkg;

  1896 				packages[i]->name = &spool[spkg->name];

  1897 				packages[i]->old_version = &spool[spkg->version];

  1898 				bitarray_set(&trans->syspkgs, spkg - spkgs, 0);

  1899 			}

  1900 			if (!packages[i]->old_package) {

  1901 				packages[i]->name = strdup(packages[i]->name);

  1902 				packages[i]->state |= RAZOR_PACKAGE_UNAVAILABLE_FLAG;

  1903 				trans->errors++;

  1904 			}

  1905 		} else {

  1906 			if (upkg) {

  1907 				packages[i]->new_package = upkg;

  1908 				packages[i]->name = &upool[upkg->name];

  1909 				packages[i]->new_version = &upool[upkg->version];

  1911 				if (up->name != upkg->name) {

  1912 					packages[i]->dep_package = &upool[upkg->name];

  1913 					packages[i]->dep_type = up->type;

  1914 					packages[i]->dep_property = &upool[up->name];

  1915 					packages[i]->dep_relation = up->relation;

  1916 					packages[i]->dep_version = &upool[up->version];

  1917 				}

  1919 				if (spkg) {

  1920 					packages[i]->old_package = spkg;

  1921 					packages[i]->old_version = &spool[spkg->version];

  1922 					if (versioncmp(&spool[spkg->version], &upool[up->version]) >= 0) {

  1923 						packages[i]->state = RAZOR_PACKAGE_UP_TO_DATE;

  1924 						trans->errors++;

  1925 						continue;

  1926 					}

  1927 					bitarray_set(&trans->syspkgs, spkg - spkgs, 0);

  1928 				}

  1929 				bitarray_set(&trans->uppkgs, upkg - upkgs, 1);

  1930 			}

  1931 			if (!packages[i]->new_package) {

  1932 				packages[i]->name = strdup(packages[i]->name);

  1933 				packages[i]->state |= RAZOR_PACKAGE_UNAVAILABLE_FLAG;

  1934 				trans->errors++;

  1935 			}

  1936 		}

  1937 	}

  1938 }

  1940 static void

  1941 find_all_packages(struct razor_transaction *trans)

  1942 {

  1943 	struct razor_transaction_package *tp;

  1944 	struct razor_package *sp, *spkgs, *send, *up, *upkgs, *uend;

  1945 	const char *spool, *upool;

  1947 	spkgs = trans->system->packages.data;

  1948 	send = trans->system->packages.data + trans->system->packages.size;

  1949 	spool = trans->system->string_pool.data;

  1950 	up = upkgs = trans->upstream->packages.data;

  1951 	uend = trans->upstream->packages.data + trans->upstream->packages.size;

  1952 	upool = trans->upstream->string_pool.data;

  1954 	for (sp = spkgs; sp < send; sp++) {

  1955 		while (up < uend && strcmp(&spool[sp->name], &upool[up->name]) > 0)

  1956 			up++;

  1957 		if (strcmp(&spool[sp->name], &upool[up->name]) == 0 &&

  1958 		    versioncmp(&spool[sp->version], &upool[up->version]) < 0) {

  1959 			tp = array_add(&trans->packages, sizeof *tp);

  1960 			memset(tp, 0, sizeof *tp);

  1961 			tp->old_package = sp;

  1962 			tp->new_package = up;

  1963 			tp->name = &upool[up->name];

  1964 			tp->old_version = &spool[sp->version];

  1965 			tp->new_version = &upool[up->version];

  1966 			tp->state = RAZOR_PACKAGE_INSTALL;

  1967 			bitarray_set(&trans->uppkgs, up - upkgs, 1);

  1968 			bitarray_set(&trans->syspkgs, sp - spkgs, 0);

  1969 		}

  1970 	}

  1971 }

  1973 static int

  1974 provider_satisfies_requirement(struct razor_property *provider,

  1975 			       const char *provider_strings,

  1976 			       struct razor_property *requirement,

  1977 			       const char *requirement_strings)

  1978 {

  1979 	int cmp, len;

  1980 	const char *provided = &provider_strings[provider->version];

  1981 	const char *required = &requirement_strings[requirement->version];

  1983 	if (!*required)

  1984 		return 1;

  1985 	if (!*provided) {

  1986 		if (requirement->relation >= RAZOR_VERSION_EQUAL)

  1987 			return 1;

  1988 		else

  1989 			return 0;

  1990 	}

  1992 	cmp = versioncmp(provided, required);

  1994 	switch (requirement->relation) {

  1995 	case RAZOR_VERSION_LESS:

  1996 		return cmp < 0;

  1998 	case RAZOR_VERSION_LESS_OR_EQUAL:

  1999 		if (cmp <= 0)

  2000 			return 1;

  2001 		/* fall through: FIXME, make sure this is correct */

  2003 	case RAZOR_VERSION_EQUAL:

  2004 		if (cmp == 0)

  2005 			return 1;

  2007 		/* "foo == 1.1" is satisfied by "foo 1.1-2" */

  2008 		len = strlen(required);

  2009 		if (!strncmp(required, provided, len) && provided[len] == '-')

  2010 			return 1;

  2011 		return 0;

  2013 	case RAZOR_VERSION_GREATER_OR_EQUAL:

  2014 		return cmp >= 0;

  2016 	case RAZOR_VERSION_GREATER:

  2017 		return cmp > 0;

  2018 	}

  2020 	/* shouldn't happen */

  2021 	return 0;

  2022 }

  2024 static struct razor_package *

  2025 find_package_for_file(struct razor_set *set, struct bitarray *pkgbits,

  2026 		      const char *filename, int installed)

  2027 {

  2028 	struct razor_package *pkgs = set->packages.data;

  2029 	struct razor_entry *entry;

  2030 	struct list *p;

  2032 	if (filename[0] != '/')

  2033 		return 0;

  2035 	entry = find_entry(set, set->files.data, filename);

  2036 	if (!entry)

  2037 		return 0;

  2039 	for (p = list_first(&entry->packages, &set->package_pool); p; p = list_next(p)) {

  2040 		if (bitarray_get(pkgbits, p->data) == installed)

  2041 			return &pkgs[p->data];

  2042 	}

  2043 	return NULL;

  2044 }

  2046 static struct razor_package *

  2047 find_installed_package_for_file(struct razor_transaction *trans,

  2048 				const char *filename)

  2049 {

  2050 	struct razor_package *pkg;

  2052 	pkg = find_package_for_file(trans->system, &trans->syspkgs,

  2053 				    filename, 1);

  2054 	if (!pkg)

  2055 		pkg = find_package_for_file(trans->upstream, &trans->uppkgs,

  2056 					    filename, 1);

  2057 	return pkg;

  2058 }

  2060 static struct razor_package *

  2061 find_uninstalled_package_for_file(struct razor_transaction *trans,

  2062 				  const char *filename)

  2063 {

  2064 	struct razor_package *pkg;

  2066 	pkg = find_package_for_file(trans->upstream, &trans->uppkgs,

  2067 				    filename, 0);

  2068 	if (!pkg)

  2069 		pkg = find_package_for_file(trans->system, &trans->syspkgs,

  2070 					    filename, 0);

  2071 	return pkg;

  2072 }

  2074 static struct razor_property *

  2075 skip_to_matching_property(struct razor_transaction *trans,

  2076 			  struct razor_property *match,

  2077 			  struct razor_property *prop)

  2078 {

  2079 	struct razor_set *mset, *pset;

  2080 	const char *ppool, *mpool;

  2081 	struct razor_property *prop_end;

  2083 	if (property_in_set(match, trans->system))

  2084 		mset = trans->system;

  2085 	else

  2086 		mset = trans->upstream;

  2088 	if (property_in_set(prop, trans->system))

  2089 		pset = trans->system;

  2090 	else if (property_in_set(prop, trans->upstream))

  2091 		pset = trans->upstream;

  2092 	else

  2093 		return prop;

  2095 	prop_end = pset->properties.data + pset->properties.size;

  2096 	ppool = pset->string_pool.data;

  2097 	mpool = mset->string_pool.data;

  2099 	while (prop < prop_end &&

  2100 	       strcmp(&ppool[prop->name], &mpool[match->name]) < 0)

  2101 		prop++;

  2102 	return prop;

  2103 }

  2105 static struct razor_package *

  2106 find_package_matching(struct razor_transaction *trans, int installed,

  2107 		      struct razor_property *prop,

  2108 		      struct razor_property *req,

  2109 		      struct razor_set *req_set)

  2110 {

  2111 	struct razor_set *set;

  2112 	struct bitarray *pkgbits;

  2113 	struct razor_package *pkgs;

  2114 	struct razor_property *props, *prop_end;

  2115 	enum razor_property_type match_type;

  2116 	const char *pool;

  2117 	const char *rpool;

  2118 	int match_name = (req->type == RAZOR_PROPERTY_OBSOLETES);

  2119 	int match;

  2121 	if (property_in_set(prop, trans->system)) {

  2122 		set = trans->system;

  2123 		pkgbits = &trans->syspkgs;

  2124 	} else if (property_in_set(prop, trans->upstream)) {

  2125 		set = trans->upstream;

  2126 		pkgbits = &trans->uppkgs;

  2127 	} else

  2128 		return NULL;

  2130 	if (!req_set) {

  2131 		if (property_in_set(req, trans->system))

  2132 			req_set = trans->system;

  2133 		else

  2134 			req_set = trans->upstream;

  2135 	}

  2136 	rpool = req_set->string_pool.data;

  2138 	if (req->type == RAZOR_PROPERTY_PROVIDES)

  2139 		match_type = RAZOR_PROPERTY_CONFLICTS;

  2140 	else

  2141 		match_type = RAZOR_PROPERTY_PROVIDES;

  2143 	pkgs = set->packages.data;

  2144 	props = set->properties.data;

  2145 	prop_end = set->properties.data + set->properties.size;

  2146 	pool = set->string_pool.data;

  2148 	/* Find first matching property */

  2149 	while (prop < prop_end &&

  2150 	       strcmp(&pool[prop->name], &rpool[req->name]) < 0)

  2151 		prop++;

  2152 	if (prop == prop_end ||

  2153 	    strcmp(&pool[prop->name], &rpool[req->name]) > 0)

  2154 		return NULL;

  2156 	if (prop->type < match_type) {

  2157 		while (prop < prop_end && prop->type != match_type)

  2158 			prop++;

  2159 	} else {

  2160 		while (prop >= props && prop->type != match_type)

  2161 			prop--;

  2162 		while (prop > props + 1 && (prop - 1)->name == prop->name &&

  2163 		       (prop - 1)->type == match_type)

  2164 			prop--;

  2165 	}

  2167 	/* Scan matching properties */

  2168 	while (prop < prop_end && prop->type == match_type &&

  2169 	       strcmp(&pool[prop->name], &rpool[req->name]) == 0) {

  2170 		if (match_type == RAZOR_PROPERTY_PROVIDES)

  2171 			match = provider_satisfies_requirement(prop, pool, req, rpool);

  2172 		else

  2173 			match = provider_satisfies_requirement(req, rpool, prop, pool);

  2174 		if (match) {

  2175 			struct list *pkg;

  2177 			for (pkg = list_first(&prop->packages, &set->package_pool); pkg; pkg = list_next(pkg)) {

  2178 				if (bitarray_get(pkgbits, pkg->data) != installed)

  2179 					continue;

  2180 				if (!match_name ||

  2181 				    strcmp(&pool[pkgs[pkg->data].name],

  2182 					   &rpool[req->name]) == 0)

  2183 					return &pkgs[pkg->data];

  2184 			}

  2185 		}

  2186 		prop++;

  2187 	}

  2189 	return NULL;

  2190 }

  2192 static struct razor_package *

  2193 find_installed_package_for_property(struct razor_transaction *trans,

  2194 				    struct razor_property *sys_start,

  2195 				    struct razor_property *up_start,

  2196 				    struct razor_property *req)

  2197 {

  2198 	struct razor_package *pkg;

  2200 	pkg = find_package_matching(trans, 1, sys_start, req, NULL);

  2201 	if (!pkg)

  2202 		pkg = find_package_matching(trans, 1, up_start, req, NULL);

  2203 	return pkg;

  2204 }

  2206 static struct razor_package *

  2207 find_uninstalled_package_for_property(struct razor_transaction *trans,

  2208 				      struct razor_property *sys_start,

  2209 				      struct razor_property *up_start,

  2210 				      struct razor_property *req)

  2211 {

  2212 	struct razor_package *pkg;

  2214 	pkg = find_package_matching(trans, 0, up_start, req, NULL);

  2215 	if (!pkg)

  2216 		pkg = find_package_matching(trans, 0, sys_start, req, NULL);

  2217 	return pkg;

  2218 }

  2220 static struct razor_transaction_package *

  2221 find_transaction_package(struct razor_transaction *trans, const char *name)

  2222 {

  2223 	struct razor_transaction_package *packages;

  2224 	int count, i;

  2226 	packages = trans->packages.data;

  2227 	count = trans->packages.size / sizeof *packages;

  2228 	for (i = 0; i < count; i++) {

  2229 		if (packages[i].name && !strcmp(packages[i].name, name))

  2230 			return &packages[i];

  2231 	}

  2232 	return NULL;

  2233 }

  2235 /* FIXME? */

  2236 static int

  2237 prop_is_being_installed(struct razor_transaction *trans,

  2238 			struct razor_property *prop)

  2239 {

  2240 	struct list *pkg;

  2242 	for (pkg = list_first(&prop->packages, &trans->upstream->package_pool); pkg; pkg = list_next(pkg)) {

  2243 		if (bitarray_get(&trans->uppkgs, pkg->data))

  2244 			return 1;

  2245 	}

  2246 	return 0;

  2247 }

  2249 static int

  2250 prop_is_being_removed(struct razor_transaction *trans,

  2251 		      struct razor_property *prop)

  2252 {

  2253 	struct list *pkg;

  2255 	for (pkg = list_first(&prop->packages, &trans->system->package_pool); pkg; pkg = list_next(pkg)) {

  2256 		if (bitarray_get(&trans->syspkgs, pkg->data))

  2257 			return 0;

  2258 	}

  2259 	return 1;

  2260 }

  2262 static int

  2263 prop_is_being_updated(struct razor_transaction *trans,

  2264 		      struct razor_property *prop)

  2265 {

  2266 	struct razor_package *packages = trans->system->packages.data;

  2267 	const char *pool = trans->system->string_pool.data;

  2268 	struct razor_transaction_package *tp;

  2269 	struct list *pkg;

  2271 	/* Assumes prop_is_being_removed returns true */

  2273 	for (pkg = list_first(&prop->packages, &trans->system->package_pool); pkg; pkg = list_next(pkg)) {

  2274 		tp = find_transaction_package(trans, &pool[packages[pkg->data].name]);

  2275 		if (tp && tp->state == RAZOR_PACKAGE_REMOVE)

  2276 			return 0;

  2277 	}

  2278 	return 1;

  2279 }

  2281 static void

  2282 add_transaction_package(struct razor_transaction *trans,

  2283 			struct razor_package *new_package,

  2284 			struct razor_package *old_package,

  2285 			enum razor_transaction_package_state state,

  2286 			const char *req_package,

  2287 			struct razor_property *req_prop)

  2288 {

  2289 	struct razor_set *new_package_set, *old_package_set, *req_set;

  2290 	struct bitarray *reqpkgbits;

  2291 	struct razor_transaction_package *tp, *already;

  2292 	const char *pool;

  2293 	struct razor_package *pkgs;

  2294 	struct list *pkg;

  2295 	int contradiction = 0;

  2297 	if (package_in_set(new_package, trans->system))

  2298 		new_package_set = trans->system;

  2299 	else

  2300 		new_package_set = trans->upstream;

  2301 	if (package_in_set(old_package, trans->system))

  2302 		old_package_set = trans->system;

  2303 	else

  2304 		old_package_set = trans->upstream;

  2305 	if (property_in_set(req_prop, trans->system)) {

  2306 		req_set = trans->system;

  2307 		reqpkgbits = &trans->syspkgs;

  2308 	} else {

  2309 		req_set = trans->upstream;

  2310 		reqpkgbits = &trans->uppkgs;

  2311 	}

  2313 	if (new_package) {

  2314 		pool = new_package_set->string_pool.data;

  2315 		already = find_transaction_package(trans, &pool[new_package->name]);

  2316 		if (already) {

  2317 			if (already->new_package == new_package) {

  2318 				/* Already taken care of */

  2319 				return;

  2320 			} else if (new_package_set == trans->upstream &&

  2321 				   already->state == RAZOR_PACKAGE_FORCED_UPDATE) {

  2322 				already->new_package = new_package;

  2323 				return;

  2324 			}

  2326 			/* Oops. We lose */

  2327 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2328 				contradiction = 1;

  2329 		}

  2330 	} else if (old_package) {

  2331 		pool = old_package_set->string_pool.data;

  2332 		already = find_transaction_package(trans, &pool[old_package->name]);

  2333 		if (already) {

  2334 			if (already->old_package == old_package) {

  2335 				/* Already taken care of */

  2336 				return;

  2337 			} else if (old_package_set == trans->system) {

  2338 				already->old_package = old_package;

  2339 				return;

  2340 			}

  2342 			/* Oops. We lose */

  2343 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2344 				contradiction = 1;

  2345 		}

  2346 	} else

  2347 		state = RAZOR_PACKAGE_UNSATISFIABLE;

  2349 	tp = array_add(&trans->packages, sizeof *tp);

  2350 	memset(tp, 0, sizeof *tp);

  2352 	if (new_package) {

  2353 		pool = new_package_set->string_pool.data;

  2354 		tp->new_package = new_package;

  2355 		tp->name = &pool[new_package->name];

  2356 		tp->new_version = &pool[new_package->version];

  2358 		pkgs = new_package_set->packages.data;

  2359 	}

  2360 	if (old_package) {

  2361 		pool = old_package_set->string_pool.data;

  2362 		tp->old_package = old_package;

  2363 		tp->name = &pool[old_package->name];

  2364 		tp->old_version = &pool[old_package->version];

  2366 		pkgs = old_package_set->packages.data;

  2367 	}

  2369 	tp->state = state;

  2370 	if (state != RAZOR_PACKAGE_INSTALL &&

  2371 	    state != RAZOR_PACKAGE_FORCED_UPDATE &&

  2372 	    state != RAZOR_PACKAGE_REMOVE &&

  2373 	    state != RAZOR_PACKAGE_OBSOLETED)

  2374 		trans->errors++;

  2376 	if (contradiction) {

  2377 		/* Do this now, after adding tp, so that it ends up

  2378 		 * after both the INSTALL and the REMOVE in the array.

  2379 		 */

  2380 		add_transaction_package(trans, new_package, old_package,

  2381 					RAZOR_PACKAGE_CONTRADICTION,

  2382 					NULL, NULL);

  2383 	}

  2385 	if (req_package)

  2386 		tp->dep_package = req_package;

  2387 	if (!req_prop)

  2388 		return;

  2390 	pool = req_set->string_pool.data;

  2391 	pkgs = req_set->packages.data;

  2392 	if (!req_package) {

  2393 		for (pkg = list_first(&req_prop->packages, &req_set->package_pool); pkg; pkg = list_next(pkg)) {

  2394 			if (bitarray_get(reqpkgbits, pkg->data))

  2395 				break;

  2396 		}

  2397 		if (pkg)

  2398 			tp->dep_package = &pool[pkgs[pkg->data].name];

  2399 	}

  2401 	tp->dep_type = req_prop->type;

  2402 	tp->dep_property = &pool[req_prop->name];

  2403 	tp->dep_relation = req_prop->relation;

  2404 	tp->dep_version = &pool[req_prop->version];

  2405 }

  2407 static void

  2408 razor_transaction_satisfy(struct razor_transaction *trans)

  2409 {

  2410 	struct razor_package *spkgs, *upkgs, *pkg;

  2411 	struct razor_property *sp, *sprops, *sprop_end;

  2412 	struct razor_property *up, *uprops, *uprop_end;

  2413 	struct razor_property *sr, *ur, *first_up;

  2414 	const char *spool, *upool, *removed_package;

  2415 	struct list *reqpkg;

  2417 	spkgs = trans->system->packages.data;

  2418 	sprops = trans->system->properties.data;

  2419 	sprop_end = trans->system->properties.data + trans->system->properties.size;

  2420 	spool = trans->system->string_pool.data;

  2421 	upkgs = trans->upstream->packages.data;

  2422 	uprops = trans->upstream->properties.data;

  2423 	uprop_end = trans->upstream->properties.data + trans->upstream->properties.size;

  2424 	upool = trans->upstream->string_pool.data;

  2426 	sp = sprops;

  2427 	for (up = uprops; up < uprop_end; up++) {

  2428 		/* Skip 'up' ahead to a property of a package which is

  2429 		 * to-be-installed.

  2430 		 */

  2431 		while (up < uprop_end &&

  2432 		       !prop_is_being_installed(trans, up))

  2433 			up++;

  2434 		if (up == uprop_end)

  2435 			break;

  2436 		sp = skip_to_matching_property(trans, up, sp);

  2438 		switch (up->type) {

  2439 		case RAZOR_PROPERTY_REQUIRES:

  2440 			if (!strncmp(&upool[up->name], "rpmlib(", 7))

  2441 				break;

  2443 			if (find_installed_package_for_property(trans, sp, up, up) ||

  2444 			    find_installed_package_for_file(trans, &upool[up->name])) {

  2445 				/* Requires something that is either installed

  2446 				 * or to-be-installed.

  2447 				 */

  2448 				break;

  2449 			}

  2451 			/* See if we can install a new upstream provider */

  2452 			pkg = find_uninstalled_package_for_property(trans, sp, up, up);

  2453 			if (!pkg)

  2454 				pkg = find_uninstalled_package_for_file(trans, &upool[up->name]);

  2455 			add_transaction_package(trans, pkg, NULL,

  2456 						RAZOR_PACKAGE_INSTALL,

  2457 						NULL, up);

  2458 			break;

  2460 		case RAZOR_PROPERTY_PROVIDES:

  2461 			/* find_installed_package_for_property works backwards

  2462 			 * here, finding a *conflicting* installed package.

  2463 			 */

  2464 			pkg = find_installed_package_for_property(trans, sp, up, up);

  2465 			if (!pkg)

  2466 				break;

  2468 			if (package_in_set(pkg, trans->system)) {

  2469 				/* pkg CONFLICTS with what 'up' PROVIDES. Try

  2470 				 * finding an upgrade

  2471 				 */

  2472 				add_transaction_package(trans, NULL, pkg,

  2473 							RAZOR_PACKAGE_FORCED_UPDATE,

  2474 							&upool[up->name], sp);

  2475 			} else {

  2476 				add_transaction_package(trans, NULL, pkg,

  2477 							RAZOR_PACKAGE_CONTRADICTION,

  2478 							NULL, up);

  2479 			}

  2480 			break;

  2482 		case RAZOR_PROPERTY_CONFLICTS:

  2483 			pkg = find_installed_package_for_property(trans, sp, up, up);

  2484 			if (!pkg)

  2485 				break;

  2487 			if (package_in_set(pkg, trans->system)) {

  2488 				/* Conflicts with something already installed.

  2489 				 * Try to upgrade out.

  2490 				 */

  2491 				add_transaction_package(trans, NULL, pkg,

  2492 							RAZOR_PACKAGE_FORCED_UPDATE,

  2493 							NULL, up);

  2494 			} else {

  2495 				add_transaction_package(trans, pkg, NULL,

  2496 							RAZOR_PACKAGE_CONTRADICTION,

  2497 							NULL, up);

  2498 			}

  2499 			break;

  2501 		case RAZOR_PROPERTY_OBSOLETES:

  2502 			pkg = find_installed_package_for_property(trans, sp, up, up);

  2503 			if (pkg) {

  2504 				/* If pkg is to-be-installed, this

  2505 				 * will add a CONTRADICTION error as well.

  2506 				 */

  2507 				add_transaction_package(trans, NULL, pkg,

  2508 							RAZOR_PACKAGE_OBSOLETED,

  2509 							NULL, up);

  2510 			}

  2511 			break;

  2513 		default:

  2514 			/* can't happen */

  2515 			break;

  2516 		}

  2517 	}

  2519 	up = uprops;

  2520 	for (sp = sprops; sp < sprop_end; sp++) {

  2521 		/* Skip 'sp' ahead to a PROVIDES of a package which is

  2522 		 * to-be-removed.

  2523 		 */

  2524 		while (sp < sprop_end &&

  2525 		       (sp->type != RAZOR_PROPERTY_PROVIDES ||

  2526 			!prop_is_being_removed(trans, sp)))

  2527 			sp++;

  2528 		if (sp == sprop_end)

  2529 			break;

  2531 		removed_package = &spool[spkgs[list_first(&sp->packages, &trans->system->package_pool)->data].name];

  2533 		/* Skip 'up' to match */

  2534 		up = skip_to_matching_property(trans, sp, up);

  2535 		ur = first_up = up;

  2537 		/* If the package is just being upgraded, we may

  2538 		 * already be installing an identical PROVIDES, so

  2539 		 * check for that.

  2540 		 */

  2541 		while (up < uprop_end &&

  2542 		       strcmp(&spool[sp->name], &upool[up->name]) == 0 &&

  2543 		       (up->type != RAZOR_PROPERTY_PROVIDES ||

  2544 			sp->relation != up->relation ||

  2545 			strcmp(&spool[sp->name], &upool[up->name]) != 0))

  2546 			up++;

  2547 		if (up < uprop_end &&

  2548 		    up->type == RAZOR_PROPERTY_PROVIDES &&

  2549 		    strcmp(&spool[sp->name], &upool[up->name]) == 0 &&

  2550 		    sp->relation == up->relation &&

  2551 		    strcmp(&spool[sp->version], &upool[up->version]) == 0 &&

  2552 		    prop_is_being_installed(trans, up)) {

  2553 			up = first_up;

  2554 			continue;

  2555 		}

  2556 		up = first_up;

  2558 		/* For all still-installed packages that require

  2559 		 * sp->name, see if they are satisfied by any other

  2560 		 * still-installed or to-be-installed property. If

  2561 		 * not, either remove or attempt to update the

  2562 		 * package, depending on why the required property has

  2563 		 * disappeared

  2564 		 */

  2565 		sr = sp;

  2566 		while (sr > sprops + 1 && (sr - 1)->name == sr->name)

  2567 			sr--;

  2568 		for (; sr->type == RAZOR_PROPERTY_REQUIRES; sr++) {

  2569 			if (prop_is_being_removed(trans, sr))

  2570 				continue;

  2571 			if (find_installed_package_for_property(trans, sp, up, sr))

  2572 				continue;

  2574 			for (reqpkg = list_first(&sr->packages, &trans->system->package_pool); reqpkg; reqpkg = list_next(reqpkg)) {

  2575 				if (!bitarray_get(&trans->syspkgs, reqpkg->data))

  2576 					continue;

  2577 				pkg = &spkgs[reqpkg->data];

  2578 				if (prop_is_being_updated(trans, sp)) {

  2579 					add_transaction_package(trans, NULL, pkg,

  2580 								RAZOR_PACKAGE_FORCED_UPDATE,

  2581 								removed_package, NULL);

  2582 				} else {

  2583 					add_transaction_package(trans, NULL, pkg,

  2584 								RAZOR_PACKAGE_REMOVE,

  2585 								removed_package, sr);

  2586 				}

  2587 			}

  2588 		}

  2589 	}

  2590 }

  2592 struct razor_transaction *

  2593 razor_transaction_create(struct razor_set *system, struct razor_set *upstream,

  2594 			 int update_count, const char **update_packages,

  2595 			 int remove_count, const char **remove_packages)

  2596 {

  2597 	struct razor_transaction *trans;

  2598 	struct razor_transaction_package *tp;

  2599 	int start, end, i;

  2601 	trans = zalloc(sizeof *trans);

  2603 	trans->system = system;

  2604 	trans->upstream = upstream ? upstream : razor_set_create();

  2605 	array_init(&trans->packages);

  2606 	bitarray_init(&trans->syspkgs, trans->system->packages.size / sizeof (struct razor_package), 1);

  2607 	bitarray_init(&trans->uppkgs, trans->upstream->packages.size / sizeof (struct razor_package), 0);

  2608 	trans->errors = 0;

  2610 	if (update_count > 0 || remove_count > 0) {

  2611 		for (i = 0; i < update_count; i++) {

  2612 			tp = array_add(&trans->packages, sizeof *tp);

  2613 			memset(tp, 0, sizeof *tp);

  2614 			tp->name = update_packages[i];

  2615 			tp->state = RAZOR_PACKAGE_INSTALL;

  2616 		}

  2617 		for (i = 0; i < remove_count; i++) {

  2618 			tp = array_add(&trans->packages, sizeof *tp);

  2619 			memset(tp, 0, sizeof *tp);

  2620 			tp->name = remove_packages[i];

  2621 			tp->state = RAZOR_PACKAGE_REMOVE;

  2622 		}

  2623 	} else

  2624 		find_all_packages(trans);

  2626 	start = 0;

  2627 	end = trans->packages.size / sizeof (struct razor_transaction_package);

  2629 	while (start != end) {

  2630 		resolve_new_packages(trans, start, end);

  2631 		if (trans->errors)

  2632 			break;

  2634 		razor_transaction_satisfy(trans);

  2636 		start = end;

  2637 		end = trans->packages.size / sizeof (struct razor_transaction_package);

  2638 	}

  2640 	trans->package_count = end;

  2642 	return trans;

  2643 }

  2645 const char * const razor_version_relations[] = {

  2646 	/* same order as enum razor_version_relation */

  2647 	"<", "<=", "=", ">=", ">"

  2648 };

  2650 const char * const razor_property_types[] = {

  2651 	/* same order as enum razor_property_type */

  2652 	"requires", "provides", "conflicts with", "obsoletes"

  2653 };

  2655 static void

  2656 print_requirement(struct razor_transaction_package *p)

  2657 {

  2658 	if (p->dep_type == RAZOR_PROPERTY_CONFLICTS &&

  2659 	    !strcmp(p->dep_package, p->name)) {

  2660 		printf(" because %s %s conflicts with %s",

  2661 		       p->name, p->old_version, p->dep_property);

  2662 		if (*p->dep_version) {

  2663 			printf(" %s %s",

  2664 			       razor_version_relations[p->dep_relation],

  2665 			       p->dep_version);

  2666 		}

  2667 	} else {

  2668 		if (strcmp(p->name, p->dep_package) != 0)

  2669 			printf(" for %s", p->dep_package);

  2670 		if (*p->dep_version) {

  2671 			printf(", which %s %s %s %s",

  2672 			       razor_property_types[p->dep_type],

  2673 			       p->dep_property,

  2674 			       razor_version_relations[p->dep_relation],

  2675 			       p->dep_version);

  2676 		} else if (strcmp(p->dep_property, p->name) != 0) {

  2677 			printf(", which %s %s",

  2678 			       razor_property_types[p->dep_type],

  2679 			       p->dep_property);

  2680 		}

  2681 	}

  2682 }

  2684 int

  2685 razor_transaction_describe(struct razor_transaction *trans)

  2686 {

  2687 	struct razor_transaction_package *p, *pend, *tps;

  2688 	int errors_only = 0;

  2690 	tps = trans->packages.data;

  2691 	pend = trans->packages.data + trans->packages.size;

  2692 	for (p = trans->packages.data; p < pend; p++) {

  2693 		switch (p->state) {

  2694 		case RAZOR_PACKAGE_INSTALL:

  2695 			if (errors_only)

  2696 				break;

  2698 			printf("Installing %s %s", p->name, p->new_version);

  2699 			if (p->dep_package)

  2700 				print_requirement(p);

  2701 			printf("\n");

  2702 			break;

  2704 		case RAZOR_PACKAGE_FORCED_UPDATE:

  2705 			if (errors_only)

  2706 				break;

  2708 			printf("Updating %s to %s due to update of %s\n",

  2709 			       p->name, p->new_version, p->dep_package);

  2710 			break;

  2712 		case RAZOR_PACKAGE_REMOVE:

  2713 			if (errors_only)

  2714 				break;

  2715 			printf("Removing %s %s", p->name, p->old_version);

  2716 			if (p->dep_package) {

  2717 				printf(" which required %s",

  2718 				       p->dep_package);

  2719 				if (strcmp(p->dep_property, p->dep_package) != 0)

  2720 					printf(" for %s", p->dep_property);

  2721 			}

  2722 			printf("\n");

  2723 			break;

  2725 		case RAZOR_PACKAGE_OBSOLETED:

  2726 			if (errors_only)

  2727 				break;

  2728 			printf("Removing %s %s", p->name, p->old_version);

  2729 			if (p->dep_package) {

  2730 				printf(" which is obsoleted by %s",

  2731 				       p->dep_package);

  2732 			}

  2733 			printf("\n");

  2734 			break;

  2736 		case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:

  2737 			printf("Error: can't find %s", p->name);

  2738 			if (p->dep_package) {

  2739 				printf(" (which is required");

  2740 				print_requirement(p);

  2741 				printf(")");

  2742 			}

  2743 			printf("\n");

  2744 			errors_only = 1;

  2745 			break;

  2747 		case RAZOR_PACKAGE_UPDATE_UNAVAILABLE:

  2748 			printf("Error: can't find an updated version of %s (which must be updated due to update of %s)\n",

  2749 			       p->name, p->dep_package);

  2750 			errors_only = 1;

  2751 			break;

  2753 		case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:

  2754 			printf("Error: can't remove %s: not installed\n", p->name);

  2755 			errors_only = 1;

  2756 			break;

  2758 		case RAZOR_PACKAGE_UP_TO_DATE:

  2759 			printf("Error: can't update %s", p->name);

  2760 			if (p->dep_package)

  2761 				printf(" (which must be updated due to update of %s)", p->dep_package);

  2762 			printf(": %s is most recent version\n", p->old_version);

  2763 			errors_only = 1;

  2764 			break;

  2766 		case RAZOR_PACKAGE_CONTRADICTION:

  2767 			printf("Error: package %s is marked for both installation and removal\n", p->name);

  2768 			errors_only = 1;

  2769 			break;

  2771 		case RAZOR_PACKAGE_OLD_CONFLICT:

  2772 			printf("Error: can't install %s, because installed package %s conflicts with ",

  2773 			       p->name, p->dep_package);

  2774 			if (*p->dep_version) {

  2775 				printf("%s %s %s",

  2776 				       p->dep_property,

  2777 				       razor_version_relations[p->dep_relation],

  2778 				       p->dep_version);

  2779 			} else

  2780 				printf("it");

  2781 			printf("\n");

  2783 			errors_only = 1;

  2784 			break;

  2786 		case RAZOR_PACKAGE_NEW_CONFLICT:

  2787 			printf("Error: can't install %s, because it conflicts with %s",

  2788 			       p->name, p->dep_package);

  2789 			if (*p->dep_version) {

  2790 				printf(" %s %s",

  2791 				       razor_version_relations[p->dep_relation],

  2792 				       p->dep_version);

  2793 			}

  2794 			printf("\n");

  2796 			errors_only = 1;

  2797 			break;

  2799 		case RAZOR_PACKAGE_UNSATISFIABLE:

  2800 			printf("Error: can't find package for %s", p->dep_property);

  2801 			if (*p->dep_version) {

  2802 				printf(" %s %s",

  2803 					razor_version_relations[p->dep_relation],

  2804 					p->dep_version);

  2805 			}

  2806 			printf(" which is required by %s\n",

  2807 				p->dep_package);

  2808 			errors_only = 1;

  2809 			break;

  2811 		default:

  2812 			/* Shouldn't actually happen */

  2813 			break;

  2814 		}

  2815 	}

  2817 	return trans->errors;

  2818 }

  2820 int

  2821 razor_transaction_unsatisfied_property(struct razor_transaction *trans,

  2822 				       const char *name,

  2823 				       enum razor_version_relation rel,

  2824 				       const char *version)

  2825 {

  2826 	struct razor_transaction_package *p, *end;

  2828 	end = trans->packages.data + trans->packages.size;

  2829 	for (p = trans->packages.data; p < end; p++) {

  2830 		if (p->state != RAZOR_PACKAGE_UNSATISFIABLE)

  2831 			continue;

  2832 		if (strcmp(name, p->dep_property) != 0 ||

  2833 		    rel != p->dep_relation ||

  2834 		    strcmp(version, p->dep_version) != 0)

  2835 			continue;

  2837 		return 1;

  2838 	}

  2840 	return 0;

  2841 }

  2843 struct razor_set *

  2844 razor_transaction_finish(struct razor_transaction *trans)

  2845 {

  2846 	struct array install_packages, remove_packages;

  2847 	struct razor_merger *merger;

  2848 	struct razor_package *pkg, *i, *iend, *r, *rend, *s, *send;

  2849 	struct razor_set *set;

  2850 	struct source *source1, *source2;

  2851 	char *spool, *ipool, *rpool;

  2852 	uint32_t *map;

  2853 	struct razor_transaction_package *p, *end;

  2854 	int cmp;

  2856 	/* FIXME */

  2857 	if (trans->errors)

  2858 		return NULL;

  2860 	/* Sort the transaction packages into two arrays */

  2861 	array_init(&install_packages);

  2862 	array_init(&remove_packages);

  2864 	end = trans->packages.data + trans->packages.size;

  2865 	for (p = trans->packages.data; p < end; p++) {

  2866 		if (p->new_package) {

  2867 			pkg = array_add(&install_packages, sizeof *pkg);

  2868 			*pkg = *p->new_package;

  2869 		} else {

  2870 			pkg = array_add(&remove_packages, sizeof *pkg);

  2871 			*pkg = *p->old_package;

  2872 		}

  2873 	}

  2874 	map = razor_qsort_with_data(install_packages.data,

  2875 				    install_packages.size / sizeof *pkg,

  2876 				    sizeof *pkg,

  2877 				    compare_packages,

  2878 				    trans->upstream);

  2879 	free(map);

  2880 	map = razor_qsort_with_data(remove_packages.data,

  2881 				    remove_packages.size / sizeof *pkg,

  2882 				    sizeof *pkg,

  2883 				    compare_packages,

  2884 				    trans->system);

  2885 	free(map);

  2887 	merger = razor_merger_create(trans->system, trans->upstream);

  2889 	source1 = &merger->source1;

  2890 	source2 = &merger->source2;

  2892 	i = install_packages.data;

  2893 	iend = install_packages.data + install_packages.size;

  2894 	ipool = trans->upstream->string_pool.data;

  2896 	r = remove_packages.data;

  2897 	rend = remove_packages.data + remove_packages.size;

  2898 	rpool = trans->system->string_pool.data;

  2900 	s = trans->system->packages.data;

  2901 	send = trans->system->packages.data + trans->system->packages.size;

  2902 	spool = trans->system->string_pool.data;

  2904 	while (s < send || i < iend) {

  2905 		/* Check if s is being removed */

  2906 		if (s < send && r < rend &&

  2907 		    s->name == r->name && s->version && r->version) {

  2908 			s++;

  2909 			r++;

  2910 			continue;

  2911 		}

  2913 		if (s < send && i < iend)

  2914 			cmp = strcmp(&spool[s->name], &ipool[i->name]);

  2915 		else if (s < send)

  2916 			cmp = -1;

  2917 		else

  2918 			cmp = 1;

  2919 		if (cmp < 0) {

  2920 			add_package(merger, s, source1, 0);

  2921 			s++;

  2922 		} else if (cmp == 0) {

  2923 			add_package(merger, i, source2, UPSTREAM_SOURCE);

  2924 			s++;

  2925 			i++;

  2926 		} else {

  2927 			add_package(merger, i, source2, UPSTREAM_SOURCE);

  2928 			i++;

  2929 		}

  2930 	}

  2932 	array_release(&install_packages);

  2933 	array_release(&remove_packages);

  2935 	set = razor_merger_finish(merger);

  2936 	razor_transaction_destroy(trans);

  2938 	return set;

  2939 }

  2941 void

  2942 razor_transaction_destroy(struct razor_transaction *trans)

  2943 {

  2944 	struct razor_transaction_package *p, *end;

  2946 	end = trans->packages.data + trans->packages.size;

  2947 	for (p = trans->packages.data; p < end; p++) {

  2948 		if (!p->dep_package &&

  2949 		    (p->state == RAZOR_PACKAGE_INSTALL_UNAVAILABLE ||

  2950 		     p->state == RAZOR_PACKAGE_REMOVE_NOT_INSTALLED))

  2951 			free((char *)p->name);

  2952 	}

  2954 	array_release(&trans->packages);

  2955 	bitarray_release(&trans->syspkgs);

  2956 	bitarray_release(&trans->uppkgs);

  2957 	free(trans);

  2959 	/* FIXME: free upstream if it was created as an empty set */

  2960 }

author	Kristian H?gsberg <krh@redhat.com>
	Mon Apr 07 00:06:22 2008 -0400 (2008-04-07)
changeset 196	b38fc517ea04
parent 195	7a53d1711083
child 197	d29026900856
permissions	-rw-r--r--