razor: razor.c@28e203d118c7

     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 	struct list_head properties;

    49 	struct list_head files;

    50 };

    52 struct razor_property {

    53 	uint name  : 24;

    54 	uint flags : 6;

    55 	enum razor_property_type type : 2;

    56 	enum razor_version_relation relation : 32;

    57 	uint32_t version;

    58 	struct list_head packages;

    59 };

    61 struct razor_entry {

    62 	uint name  : 24;

    63 	uint flags : 8;

    64 	uint32_t start;

    65 	struct list_head packages;

    66 };

    68 #define RAZOR_ENTRY_LAST	0x80

    70 struct razor_set {

    71 	struct array string_pool;

    72  	struct array packages;

    73  	struct array properties;

    74  	struct array files;

    75 	struct array package_pool;

    76  	struct array property_pool;

    77  	struct array file_pool;

    78 	struct razor_set_header *header;

    79 };

    81 struct import_entry {

    82 	uint32_t package;

    83 	char *name;

    84 };

    86 struct import_directory {

    87 	uint32_t name, count;

    88 	struct array files;

    89 	struct array packages;

    90 	struct import_directory *last;

    91 };

    93 struct razor_importer {

    94 	struct razor_set *set;

    95 	struct hashtable table;

    96 	struct razor_package *package;

    97 	struct array properties;

    98 	struct array files;

    99 	struct array file_requires;

   100 };

   102 static void *

   103 zalloc(size_t size)

   104 {

   105 	void *p;

   107 	p = malloc(size);

   108 	memset(p, 0, size);

   110 	return p;

   111 }

   113 struct razor_set_section razor_sections[] = {

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

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

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

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

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

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

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

   121 };

   123 struct razor_set *

   124 razor_set_create(void)

   125 {

   126 	struct razor_set *set;

   127 	struct razor_entry *e;

   128 	char *empty;

   130 	set = zalloc(sizeof *set);

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

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

   134 	*empty = '\0';

   135 	e->name = 0;

   136 	e->flags = RAZOR_ENTRY_LAST;

   137 	e->start = 0;

   138 	list_set_empty(&e->packages);

   140 	return set;

   141 }

   143 struct razor_set *

   144 razor_set_open(const char *filename)

   145 {

   146 	struct razor_set *set;

   147 	struct razor_set_section *s;

   148 	struct stat stat;

   149 	struct array *array;

   150 	int fd;

   152 	set = zalloc(sizeof *set);

   153 	fd = open(filename, O_RDONLY);

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

   155 		return NULL;

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

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

   158 		free(set);

   159 		return NULL;

   160 	}

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

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

   164 			continue;

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

   166 			continue;

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

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

   169 		array->size = s->size;

   170 		array->alloc = s->size;

   171 	}

   172 	close(fd);

   174 	return set;

   175 }

   177 void

   178 razor_set_destroy(struct razor_set *set)

   179 {

   180 	unsigned int size;

   181 	struct array *a;

   182 	int i;

   184 	if (set->header) {

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

   186 			;

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

   188 		munmap(set->header, size);

   189 	} else {

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

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

   192 			free(a->data);

   193 		}

   194 	}

   196 	free(set);

   197 }

   199 int

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

   201 {

   202 	char data[4096];

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

   204 	struct array *a;

   205 	uint32_t offset;

   206 	int i, fd;

   208 	memset(data, 0, sizeof data);

   209 	header->magic = RAZOR_MAGIC;

   210 	header->version = RAZOR_VERSION;

   211 	offset = sizeof data;

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

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

   215 			continue;

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

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

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

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

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

   221 	}

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

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

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

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

   228 	if (fd < 0)

   229 		return -1;

   231 	razor_write(fd, data, sizeof data);

   232 	memset(data, 0, sizeof data);

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

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

   235 			continue;

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

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

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

   239 	}

   241 	close(fd);

   243 	return 0;

   244 }

   246 void

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

   248 		const char *version, const char *release)

   249 {

   250 	int len;

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

   253 		*evr_buf = '\0';

   254 		return;

   255 	}

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

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

   259 		evr_buf += len;

   260 		size -= len;

   261 	}

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

   263 	evr_buf += len;

   264 	size -= len;

   265 	if (release && *release)

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

   267 }

   269 void

   270 razor_importer_begin_package(struct razor_importer *importer,

   271 			     const char *name, const char *version)

   272 {

   273 	struct razor_package *p;

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

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

   277 	p->flags = 0;

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

   280 	importer->package = p;

   281 	array_init(&importer->properties);

   282 }

   284 void

   285 razor_importer_finish_package(struct razor_importer *importer)

   286 {

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

   288 		       &importer->set->property_pool,

   289 		       &importer->properties,

   290 		       1);

   292 	array_release(&importer->properties);

   293 }

   295 void

   296 razor_importer_add_property(struct razor_importer *importer,

   297 			    const char *name,

   298 			    enum razor_version_relation relation,

   299 			    const char *version,

   300 			    enum razor_property_type type)

   301 {

   302 	struct razor_property *p;

   303 	uint32_t *r;

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

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

   307 	p->flags = 0;

   308 	p->type = type;

   309 	p->relation = relation;

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

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

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

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

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

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

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

   319 		*r = p->name;

   320 	}

   321 }

   323 void

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

   325 {

   326 	struct import_entry *e;

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

   330 	e->package = importer->package -

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

   332 	e->name = strdup(name);

   333 }

   335 struct razor_importer *

   336 razor_importer_new(void)

   337 {

   338 	struct razor_importer *importer;

   340 	importer = zalloc(sizeof *importer);

   341 	importer->set = razor_set_create();

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

   344 	return importer;

   345 }

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

   348 void

   349 razor_importer_destroy(struct razor_importer *importer)

   350 {

   351 	/* FIXME: write this */

   352 }

   355 typedef int (*compare_with_data_func_t)(const void *p1,

   356 					const void *p,

   357 					void *data);

   359 struct qsort_context {

   360 	size_t size;

   361 	compare_with_data_func_t compare;

   362 	void *data;

   363 };

   365 static void

   366 qsort_swap(void *p1, void *p2, size_t size)

   367 {

   368 	char buffer[size];

   370 	memcpy(buffer, p1, size);

   371 	memcpy(p1, p2, size);

   372 	memcpy(p2, buffer, size);

   373 }

   375 static void

   376 __qsort_with_data(void *base, size_t nelem, uint32_t *map,

   377 		  struct qsort_context *ctx)

   378 {

   379 	void *p, *start, *end, *pivot;

   380 	uint32_t *mp, *mstart, *mend, tmp;

   381 	int left, right, result;

   382 	size_t size = ctx->size;

   384 	p = base;

   385 	start = base;

   386 	end = base + nelem * size;

   387 	mp = map;

   388 	mstart = map;

   389 	mend = map + nelem;

   390 	pivot = base + (random() % nelem) * size;

   392 	while (p < end) {

   393 		result = ctx->compare(p, pivot, ctx->data);

   394 		if (result < 0) {

   395 			qsort_swap(p, start, size);

   396 			tmp = *mp;

   397 			*mp = *mstart;

   398 			*mstart = tmp;

   399 			if (start == pivot)

   400 				pivot = p;

   401 			start += size;

   402 			mstart++;

   403 			p += size;

   404 			mp++;

   405 		} else if (result == 0) {

   406 			p += size;

   407 			mp++;

   408 		} else {

   409  			end -= size;

   410 			mend--;

   411 			qsort_swap(p, end, size);

   412 			tmp = *mp;

   413 			*mp = *mend;

   414 			*mend = tmp;

   415 			if (end == pivot)

   416 				pivot = p;

   417 		}

   418 	}

   420 	left = (start - base) / size;

   421 	right = (base + nelem * size - end) / size;

   422 	if (left > 1)

   423 		__qsort_with_data(base, left, map, ctx);

   424 	if (right > 1)

   425 		__qsort_with_data(end, right, mend, ctx);

   426 }

   428 static uint32_t *

   429 qsort_with_data(void *base, size_t nelem, size_t size,

   430 		compare_with_data_func_t compare, void *data)

   431 {

   432 	struct qsort_context ctx;

   433 	uint32_t *map;

   434 	int i;

   436 	if (nelem == 0)

   437 		return NULL;

   439 	ctx.size = size;

   440 	ctx.compare = compare;

   441 	ctx.data = data;

   443 	map = malloc(nelem * sizeof (uint32_t));

   444 	for (i = 0; i < nelem; i++)

   445 		map[i] = i;

   447 	__qsort_with_data(base, nelem, map, &ctx);

   449 	return map;

   450 }

   452 static int

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

   454 {

   455 	const char *p1, *p2;

   456 	long n1, n2;

   457 	int res;

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

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

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

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

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

   465 	if (res < 0) {

   466 		n1 = 0;

   467 		p1 = s1;

   468 		p2++;

   469 	} else if (res > 0) {

   470 		p1++;

   471 		n2 = 0;

   472 		p2 = s2;

   473 	}

   475 	if (n1 != n2)

   476 		return n1 - n2;

   477 	while (*p1 && *p2) {

   478 		if (*p1 != *p2)

   479 			return *p1 - *p2;

   480 		p1++;

   481 		p2++;

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

   483 			return versioncmp(p1, p2);

   484 	}

   486 	return *p1 - *p2;

   487 }

   489 static int

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

   491 {

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

   493 	struct razor_set *set = data;

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

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

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

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

   499 	else

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

   501 }

   503 static int

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

   505 {

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

   507 	struct razor_set *set = data;

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

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

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

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

   513 		return prop1->type - prop2->type;

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

   515 		return prop1->relation - prop2->relation;

   516 	else

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

   518 }

   520 static uint32_t *

   521 uniqueify_properties(struct razor_set *set)

   522 {

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

   524 	struct array *pkgs, *p;

   525 	struct list_head *r;

   526 	uint32_t *map, *rmap;

   527 	int i, count, unique;

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

   530 	map = qsort_with_data(set->properties.data,

   531 			      count,

   532 			      sizeof(struct razor_property),

   533 			      compare_properties,

   534 			      set);

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

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

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

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

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

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

   542 			up++;

   543 			up->name = rp->name;

   544 			up->flags = 0;

   545 			up->type = rp->type;

   546 			up->relation = rp->relation;

   547 			up->version = rp->version;

   548 		}

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

   551 		rmap[map[i]] = unique;

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

   553 		*r = rp->packages;

   554 	}

   555 	free(map);

   557 	if (up != rp)

   558 		up++;

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

   560 	rp_end = up;

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

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

   563 		array_release(p);

   564 	}

   566 	free(pkgs);

   568 	return rmap;

   569 }

   571 static int

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

   573 {

   574 	const struct import_entry *e1 = p1;

   575 	const struct import_entry *e2 = p2;

   576 	const char *n1 = e1->name;

   577 	const char *n2 = e2->name;

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

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

   581 	 * sort before "foo.conf"

   582 	 *

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

   584 	 */

   585 	while (*n1 && *n2) {

   586 		if (*n1 < *n2)

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

   588 		else if (*n1 > *n2)

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

   590 		n1++;

   591 		n2++;

   592 	}

   593 	if (*n1)

   594 		return 1;

   595 	else if (*n2)

   596 		return -1;

   597 	else

   598 		return 0;

   599 }

   601 static void

   602 count_entries(struct import_directory *d)

   603 {

   604 	struct import_directory *p, *end;

   606 	p = d->files.data;

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

   608 	d->count = 0;

   609 	while (p < end) {

   610 		count_entries(p);

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

   612 		p++;

   613 	}

   614 }

   616 static void

   617 serialize_files(struct razor_set *set,

   618 		struct import_directory *d, struct array *array)

   619 {

   620 	struct import_directory *p, *end;

   621 	struct razor_entry *e = NULL;

   622 	uint32_t s;

   624 	p = d->files.data;

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

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

   627 	while (p < end) {

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

   629 		e->name = p->name;

   630 		e->flags = 0;

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

   632 		s += p->count;

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

   635 		array_release(&p->packages);

   636 		p++;

   637 	}

   638 	if (e != NULL)

   639 		e->flags |= RAZOR_ENTRY_LAST;

   641 	p = d->files.data;

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

   643 	while (p < end) {

   644 		serialize_files(set, p, array);

   645 		p++;

   646 	}

   647 }

   649 static void

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

   651 {

   652 	struct razor_property *p, *end;

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

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

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

   657 }

   659 static void

   660 build_file_tree(struct razor_importer *importer)

   661 {

   662 	int count, i, length;

   663 	struct import_entry *filenames;

   664 	char *f, *end;

   665 	uint32_t name, *r;

   666 	char dirname[256];

   667 	struct import_directory *d, root;

   668 	struct razor_entry *e;

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

   671 	qsort_with_data(importer->files.data,

   672 			count,

   673 			sizeof (struct import_entry),

   674 			compare_filenames,

   675 			NULL);

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

   678 	array_init(&root.files);

   679 	array_init(&root.packages);

   680 	root.last = NULL;

   682 	filenames = importer->files.data;

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

   684 		f = filenames[i].name;

   685 		if (*f != '/')

   686 			continue;

   687 		f++;

   689 		d = &root;

   690 		while (*f) {

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

   692 			if (end == NULL)

   693 				end = f + strlen(f);

   694 			length = end - f;

   695 			memcpy(dirname, f, length);

   696 			dirname[length] ='\0';

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

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

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

   700 				d->last->name = name;

   701 				d->last->last = NULL;

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

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

   704 			}

   705 			d = d->last;

   706 			f = end + 1;

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

   708 				break;

   709 		}

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

   712 		*r = filenames[i].package;

   713 		free(filenames[i].name);

   714 	}

   716 	count_entries(&root);

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

   718 	e->name = root.name;

   719 	e->flags = RAZOR_ENTRY_LAST;

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

   721 	list_set_empty(&e->packages);

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

   725 	array_release(&importer->files);

   726 }

   728 static struct razor_entry *

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

   731 static void

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

   733 {

   734 	uint32_t *item;

   736 	while (list) {

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

   738 		 *item = list->data;

   739 		 list = list_next(list);

   740 	}

   741 }

   743 static int

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

   745 {

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

   747 	const char *pool = data;

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

   750 }

   752 static void

   753 find_file_provides(struct razor_importer *importer)

   754 {

   755 	struct razor_property *prop;

   756 	struct razor_entry *top, *entry;

   757 	struct razor_package *packages;

   758 	struct array pkgprops;

   759 	struct list *pkg;

   760 	uint32_t *req, *req_start, *req_end;

   761 	uint32_t *map, *newprop;

   762 	char *pool;

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

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

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

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

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

   770 	map = qsort_with_data(req, req_end - req, sizeof *req,

   771 			      compare_file_requires, pool);

   772 	free(map);

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

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

   776 			continue;

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

   778 		if (!entry)

   779 			continue;

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

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

   783 			prop->name = *req;

   784 			prop->type = RAZOR_PROPERTY_PROVIDES;

   785 			prop->relation = RAZOR_VERSION_EQUAL;

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

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

   789 			/* Update property list of pkg */

   790 			array_init(&pkgprops);

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

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

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

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

   795 			array_release(&pkgprops);

   796 		}

   797 	}

   799 	array_release(&importer->file_requires);

   800 }

   802 static void

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

   804 {

   805 	struct razor_package *p, *packages;

   806 	struct array *pkgs;

   807 	struct razor_entry *e, *end;

   808 	struct list *r;

   809 	uint32_t *q;

   810 	int i, count;

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

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

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

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

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

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

   819 		while (r) {

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

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

   822 			r = list_next(r);

   823 		}

   824 	}

   826 	packages = set->packages.data;

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

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

   829 		array_release(&pkgs[i]);

   830 	}

   831 	free(pkgs);

   832 }

   834 struct razor_set *

   835 razor_importer_finish(struct razor_importer *importer)

   836 {

   837 	struct razor_set *set;

   838 	uint32_t *map, *rmap;

   839 	int i, count;

   841 	build_file_tree(importer);

   842 	find_file_provides(importer);

   844 	map = uniqueify_properties(importer->set);

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

   846 	free(map);

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

   849 	map = qsort_with_data(importer->set->packages.data,

   850 			      count,

   851 			      sizeof(struct razor_package),

   852 			      compare_packages,

   853 			      importer->set);

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

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

   857 		rmap[map[i]] = i;

   858 	free(map);

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

   861 	build_package_file_lists(importer->set, rmap);

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

   863 	free(rmap);

   865 	set = importer->set;

   866 	hashtable_release(&importer->table);

   867 	free(importer);

   869 	return set;

   870 }

   872 struct razor_package_iterator {

   873 	struct razor_set *set;

   874 	struct razor_package *package, *end;

   875 	struct list *index;

   876 };

   878 static struct razor_package_iterator *

   879 razor_package_iterator_create_with_index(struct razor_set *set,

   880 					 struct list *index)

   881 {

   882 	struct razor_package_iterator *pi;

   884 	pi = zalloc(sizeof *pi);

   885 	pi->set = set;

   886 	pi->index = index;

   888 	return pi;

   889 }

   891 struct razor_package_iterator *

   892 razor_package_iterator_create(struct razor_set *set)

   893 {

   894 	struct razor_package_iterator *pi;

   896 	pi = zalloc(sizeof *pi);

   897 	pi->set = set;

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

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

   901 	return pi;

   902 }

   904 struct razor_package_iterator *

   905 razor_package_iterator_create_for_property(struct razor_set *set,

   906 					   struct razor_property *property)

   907 {

   908 	struct list *index;

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

   911 	return razor_package_iterator_create_with_index(set, index);

   912 }

   914 int

   915 razor_package_iterator_next(struct razor_package_iterator *pi,

   916 			    struct razor_package **package,

   917 			    const char **name, const char **version)

   918 {

   919 	char *pool;

   920 	int valid;

   921 	struct razor_package *p, *packages;

   923 	if (pi->package) {

   924 		p = pi->package++;

   925 		valid = p < pi->end;

   926 	} else if (pi->index) {

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

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

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

   930 		valid = 1;

   931 	} else

   932 		valid = 0;

   934 	if (valid) {

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

   936 		*package = p;

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

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

   939 	} else {

   940 		*package = NULL;

   941 	}

   943 	return valid;

   944 }

   946 void

   947 razor_package_iterator_destroy(struct razor_package_iterator *pi)

   948 {

   949 	free(pi);

   950 }

   952 struct razor_package *

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

   954 {

   955 	struct razor_package_iterator *pi;

   956 	struct razor_package *p;

   957 	const char *name, *version;

   959 	pi = razor_package_iterator_create(set);

   960 	while (razor_package_iterator_next(pi, &p, &name, &version)) {

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

   962 			break;

   963 	}

   964 	razor_package_iterator_destroy(pi);

   966 	return p;

   967 }

   969 struct razor_property_iterator {

   970 	struct razor_set *set;

   971 	struct razor_property *property, *end;

   972 	struct list *index;

   973 };

   975 struct razor_property_iterator *

   976 razor_property_iterator_create(struct razor_set *set,

   977 			       struct razor_package *package)

   978 {

   979 	struct razor_property_iterator *pi;

   981 	pi = zalloc(sizeof *pi);

   982 	pi->set = set;

   984 	if (package) {

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

   986 				       &set->property_pool);

   987 	} else {

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

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

   990 	}

   992 	return pi;

   993 }

   995 int

   996 razor_property_iterator_next(struct razor_property_iterator *pi,

   997 			     struct razor_property **property,

   998 			     const char **name,

   999 			     enum razor_version_relation *relation,

  1000 			     const char **version,

  1001 			     enum razor_property_type *type)

  1002 {

  1003 	char *pool;

  1004 	int valid;

  1005 	struct razor_property *p, *properties;

  1007 	if (pi->property) {

  1008 		p = pi->property++;

  1009 		valid = p < pi->end;

  1010 	} else if (pi->index) {

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

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

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

  1014 		valid = 1;

  1015 	} else

  1016 		valid = 0;

  1018 	if (valid) {

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

  1020 		*property = p;

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

  1022 		*relation = p->relation;

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

  1024 		*type = p->type;

  1025 	} else {

  1026 		*property = NULL;

  1027 	}

  1029 	return valid;

  1030 }

  1032 void

  1033 razor_property_iterator_destroy(struct razor_property_iterator *pi)

  1034 {

  1035 	free(pi);

  1036 }

  1038 static struct razor_entry *

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

  1040 {

  1041 	struct razor_entry *e;

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

  1043 	int len;

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

  1046 	do {

  1047 		n = pool + e->name;

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

  1049 			return e;

  1050 		len = strlen(n);

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

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

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

  1054 		}

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

  1057 	return NULL;

  1058 }

  1060 static void

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

  1062 	 char *prefix, const char *pattern)

  1063 {

  1064 	struct razor_entry *e;

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

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

  1068 	do {

  1069 		n = pool + e->name;

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

  1071 			continue;

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

  1073 		if (e->start) {

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

  1075 			*sub = '/';

  1076 			strcpy (sub + 1, n);

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

  1078 			*sub = '\0';

  1079 		}

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

  1081 }

  1083 void

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

  1085 {

  1086 	struct razor_entry *e;

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

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

  1090 		buffer[0] = '\0';

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

  1092 		return;

  1093 	}

  1095 	strcpy(buffer, pattern);

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

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

  1098 		base = NULL;

  1099 	} else {

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

  1101 		if (p) {

  1102 			*p = '\0';

  1103 			base = p + 1;

  1104 		} else {

  1105 			base = NULL;

  1106 		}

  1107 	}

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

  1109 	if (e->start != 0)

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

  1111 }

  1113 struct razor_package_iterator *

  1114 razor_package_iterator_create_for_file(struct razor_set *set,

  1115 				       const char *filename)

  1116 {

  1117 	struct razor_entry *entry;

  1118 	struct list *index;

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

  1121 	if (entry == NULL)

  1122 		return NULL;

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

  1125 	return razor_package_iterator_create_with_index(set, index);

  1126 }

  1128 static struct list *

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

  1130 		   struct razor_entry *dir, uint32_t end,

  1131 		   char *prefix)

  1132 {

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

  1134 	uint32_t next, file;

  1135 	char *pool;

  1136 	int len;

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

  1139 	pool = set->string_pool.data;

  1141 	e = entries + dir->start;

  1142 	do {

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

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

  1145 			r = list_next(r);

  1146 			if (!r)

  1147 				return NULL;

  1148 			if (r->data >= end)

  1149 				return r;

  1150 		}

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

  1153 	e = entries + dir->start;

  1154 	do {

  1155 		if (e->start == 0)

  1156 			continue;

  1158 		if (e->flags & RAZOR_ENTRY_LAST)

  1159 			next = end;

  1160 		else {

  1161 			f = e + 1;

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

  1163 				f++;

  1164 			if (f->start == 0)

  1165 				next = end;

  1166 			else

  1167 				next = f->start;

  1168 		}

  1170 		file = r->data;

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

  1172 			len = strlen(prefix);

  1173 			prefix[len] = '/';

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

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

  1176 			prefix[len] = '\0';

  1177 		}

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

  1180 	return r;

  1181 }

  1183 void

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

  1185 {

  1186 	struct razor_package *package;

  1187 	struct list *r;

  1188 	uint32_t end;

  1189 	char buffer[512];

  1191 	package = razor_set_get_package(set, name);

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

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

  1195 	buffer[0] = '\0';

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

  1197 }

  1199 static void

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

  1201 {

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

  1203 	uint32_t *u;

  1204 	char *pool;

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

  1207 	pool = set->string_pool.data;

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

  1210 		if (r->type != RAZOR_PROPERTY_REQUIRES)

  1211 			continue;

  1213 		p = r;

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

  1215 		       p->type == r->type)

  1216 			p++;

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

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

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

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

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

  1223 		 * does.*/

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

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

  1226 			p++;

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

  1229 		 * etc) to properly determine if a requires is

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

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

  1233 		if (p == end ||

  1234 		    p->type != RAZOR_PROPERTY_PROVIDES ||

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

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

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

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

  1239 				continue;

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

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

  1242 		}

  1243 	}

  1244 }

  1246 void

  1247 razor_set_list_unsatisfied(struct razor_set *set)

  1248 {

  1249 	struct array unsatisfied;

  1250 	struct razor_property *properties, *r;

  1251 	uint32_t *u, *end;

  1252 	char *pool;

  1254 	array_init(&unsatisfied);

  1255 	razor_set_validate(set, &unsatisfied);

  1257 	end = unsatisfied.data + unsatisfied.size;

  1258 	properties = set->properties.data;

  1259 	pool = set->string_pool.data;

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

  1262 		r = properties + *u;

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

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

  1265 			       &pool[r->name]);

  1266 		else

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

  1268 			       &pool[r->name],

  1269 			       &pool[r->version]);

  1270 	}

  1272 	array_release(&unsatisfied);

  1273 }

  1275 #define UPSTREAM_SOURCE 0x80

  1277 struct source {

  1278 	struct razor_set *set;

  1279 	uint32_t *property_map;

  1280 	uint32_t *file_map;

  1281 };

  1283 struct razor_merger {

  1284 	struct razor_set *set;

  1285 	struct hashtable table;

  1286 	struct source source1;

  1287 	struct source source2;

  1288 };

  1290 static struct razor_merger *

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

  1292 {

  1293 	struct razor_merger *merger;

  1294 	int count;

  1295 	size_t size;

  1297 	merger = zalloc(sizeof *merger);

  1298 	merger->set = razor_set_create();

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

  1301 	merger->source1.set = set1;

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

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

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

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

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

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

  1309 	merger->source2.set = set2;

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

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

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

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

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

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

  1317 	return merger;

  1318 }

  1320 static void

  1321 add_package(struct razor_merger *merger,

  1322 	    struct razor_package *package, struct source *source,

  1323 	    uint32_t flags)

  1324 {

  1325 	char *pool;

  1326 	struct list *r;

  1327 	struct razor_package *p;

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

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

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

  1332 	p->flags = flags;

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

  1334 					&pool[package->version]);

  1336 	p->properties = package->properties;

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

  1338 	while (r) {

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

  1340 		r = list_next(r);

  1341 	}

  1343 	p->files = package->files;

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

  1345 	while (r) {

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

  1347 		r = list_next(r);

  1348 	}

  1349 }

  1351 static uint32_t

  1352 add_property(struct razor_merger *merger,

  1353 	     const char *name, enum razor_version_relation relation,

  1354 	     const char *version, int type)

  1355 {

  1356 	struct razor_property *p;

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

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

  1360 	p->flags = 0;

  1361 	p->type = type;

  1362 	p->relation = relation;

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

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

  1366 }

  1368 static void

  1369 merge_properties(struct razor_merger *merger)

  1370 {

  1371 	struct razor_property *p1, *p2;

  1372 	struct razor_set *set1, *set2;

  1373 	uint32_t *map1, *map2;

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

  1375 	char *pool1, *pool2;

  1377 	set1 = merger->source1.set;

  1378 	set2 = merger->source2.set;

  1379 	map1 = merger->source1.property_map;

  1380 	map2 = merger->source2.property_map;

  1382 	i = 0;

  1383 	j = 0;

  1384 	pool1 = set1->string_pool.data;

  1385 	pool2 = set2->string_pool.data;

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

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

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

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

  1391 			i++;

  1392 			continue;

  1393 		}

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

  1395 			j++;

  1396 			continue;

  1397 		}

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

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

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

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

  1402 		else if (i < count1)

  1403 			cmp = -1;

  1404 		else

  1405 			cmp = 1;

  1406 		if (cmp == 0)

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

  1408 		if (cmp == 0)

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

  1410 		if (cmp == 0)

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

  1412 					 &pool2[p2->version]);

  1413 		if (cmp < 0) {

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

  1415 						 &pool1[p1->name],

  1416 						 p1->relation,

  1417 						 &pool1[p1->version],

  1418 						 p1->type);

  1419 		} else if (cmp > 0) {

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

  1421 						 &pool2[p2->name],

  1422 						 p2->relation,

  1423 						 &pool2[p2->version],

  1424 						 p2->type);

  1425 		} else  {

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

  1427 							     &pool1[p1->name],

  1428 							     p1->relation,

  1429 							     &pool1[p1->version],

  1430 							     p1->type);

  1431 		}

  1432 	}

  1433 }

  1435 static void

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

  1437 		uint32_t *map, struct array *pool)

  1438 {

  1439 	uint32_t r;

  1440 	struct list *p, *q;

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

  1443 	p = list_first(properties, source_pool);

  1444 	while (p) {

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

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

  1447 		q->flags = p->flags;

  1448 		p = list_next(p);

  1449 	}

  1451 	list_set_ptr(properties, r);

  1452 }

  1454 static uint32_t

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

  1456 {

  1457 	struct razor_entry *e;

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

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

  1461 	e->flags = 0;

  1462 	e->start = 0;

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

  1465 }

  1467 /* FIXME. Blah */

  1468 static int

  1469 fix_file_map(uint32_t *map,

  1470 	     struct razor_entry *files,

  1471 	     struct razor_entry *top)

  1472 {

  1473 	uint32_t e;

  1474 	int found_file = 0;

  1476 	e = top->start;

  1477 	do {

  1478 		if (files[e].start)

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

  1480 		if (map[e])

  1481 			found_file = 1;

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

  1484 	if (found_file)

  1485 		map[top - files] = 1;

  1486 	return found_file;

  1487 }

  1489 struct merge_directory {

  1490 	uint32_t merged, dir1, dir2;

  1491 };

  1493 static void

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

  1495 {

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

  1497 	struct razor_set *set1, *set2;

  1498 	struct array merge_stack;

  1499 	struct merge_directory *child_md, *end_md;

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

  1501 	int cmp;

  1502 	char *pool1, *pool2;

  1504 	set1 = merger->source1.set;

  1505 	set2 = merger->source2.set;

  1506 	map1 = merger->source1.file_map;

  1507 	map2 = merger->source2.file_map;

  1508 	pool1 = set1->string_pool.data;

  1509 	pool2 = set2->string_pool.data;

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

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

  1513 	array_init(&merge_stack);

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

  1516 	last = 0;

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

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

  1519 	while (e1 || e2) {

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

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

  1522 				e1 = NULL;

  1523 			continue;

  1524 		}

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

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

  1527 				e2 = NULL;

  1528 			continue;

  1529 		}

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

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

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

  1533 				e1 = NULL;

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

  1535 				e2 = NULL;

  1536 			continue;

  1537 		}

  1539 		if (!e1)

  1540 			cmp = 1;

  1541 		else if (!e2)

  1542 			cmp = -1;

  1543 		else {

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

  1545 				      &pool2[e2->name]);

  1546 		}

  1548 		if (cmp < 0) {

  1549 			if (map1[e1 - root1]) {

  1550 				map1[e1 - root1] = last =

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

  1552 				if (e1->start) {

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

  1554 					child_md->merged = last;

  1555 					child_md->dir1 = e1->start;

  1556 					child_md->dir2 = 0;

  1557 				}

  1558 			}

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

  1560 				e1 = NULL;

  1561 		} else if (cmp > 0) {

  1562 			if (map2[e2 - root2]) {

  1563 				map2[e2 - root2] = last =

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

  1565 				if (e2->start) {

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

  1567 					child_md->merged = last;

  1568 					child_md->dir1 = 0;

  1569 					child_md->dir2 = e2->start;

  1570 				}

  1571 			}

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

  1573 				e2 = NULL;

  1574 		} else {

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

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

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

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

  1579 				child_md->merged = last;

  1580 				child_md->dir1 = e1->start;

  1581 				child_md->dir2 = e2->start;

  1582 			}

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

  1584 				e1 = NULL;

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

  1586 				e2 = NULL;

  1587 		}

  1588 	}

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

  1591 	if (last) {

  1592 		mroot[last].flags = RAZOR_ENTRY_LAST;

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

  1594 	} else

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

  1597 	end_md = merge_stack.data + merge_stack.size;

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

  1599 		merge_one_directory(merger, child_md);

  1600 	array_release(&merge_stack);

  1601 }

  1603 static void

  1604 merge_files(struct razor_merger *merger)

  1605 {

  1606 	struct razor_entry *root;

  1607 	struct merge_directory md;

  1608 	uint32_t *map1, *map2;

  1610 	map1 = merger->source1.file_map;

  1611 	map2 = merger->source2.file_map;

  1613 	md.merged = 0;

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

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

  1617 		if (root->start)

  1618 			fix_file_map(map1, root, root);

  1619 		md.dir1 = root->start;

  1620 	} else

  1621 		md.dir1 = 0;

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

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

  1625 		if (root->start)

  1626 			fix_file_map(map2, root, root);

  1627 		md.dir2 = root->start;

  1628 	} else

  1629 		md.dir2 = 0;

  1631 	merge_one_directory(merger, &md);

  1632 }

  1634 static void

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

  1636 	   uint32_t *map, struct array *pool)

  1637 {

  1638 	uint32_t r;

  1639 	struct list *p, *q;

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

  1642 	p = list_first(files, source_pool);

  1643 	while (p) {

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

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

  1646 		q->flags = p->flags;

  1647 		p = list_next(p);

  1648 	}

  1650 	list_set_ptr(files, r);

  1651 }

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

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

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

  1656  * the arrays for their properties. */

  1657 static void

  1658 rebuild_property_package_lists(struct razor_set *set)

  1659 {

  1660 	struct array *pkgs, *a;

  1661 	struct razor_package *pkg, *pkg_end;

  1662 	struct razor_property *prop, *prop_end;

  1663 	struct list *r;

  1664 	uint32_t *q;

  1665 	int count;

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

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

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

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

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

  1673 		while (r) {

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

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

  1676 			r = list_next(r);

  1677 		}

  1678 	}

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

  1681 	a = pkgs;

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

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

  1684 		array_release(a);

  1685 	}

  1686 	free(pkgs);

  1687 }

  1689 static void

  1690 rebuild_file_package_lists(struct razor_set *set)

  1691 {

  1692 	struct array *pkgs, *a;

  1693 	struct razor_package *pkg, *pkg_end;

  1694 	struct razor_entry *entry, *entry_end;

  1695 	struct list *r;

  1696 	uint32_t *q;

  1697 	int count;

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

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

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

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

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

  1705 		while (r) {

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

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

  1708 			r = list_next(r);

  1709 		}

  1710 	}

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

  1713 	a = pkgs;

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

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

  1716 		array_release(a);

  1717 	}

  1718 	free(pkgs);

  1719 }

  1721 static struct razor_set *

  1722 razor_merger_finish(struct razor_merger *merger)

  1723 {

  1724 	struct razor_set *result;

  1725 	struct razor_package *p, *pend;

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

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

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

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

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

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

  1733 	 * property list for both sets. */

  1735 	merge_properties(merger);

  1736 	merge_files(merger);

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

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

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

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

  1743 		struct source *src;

  1745 		if (p->flags & UPSTREAM_SOURCE)

  1746 			src = &merger->source2;

  1747 		else

  1748 			src = &merger->source1;

  1750 		emit_properties(&p->properties,

  1751 				&src->set->property_pool,

  1752 				src->property_map,

  1753 				&merger->set->property_pool);

  1754 		emit_files(&p->files,

  1755 			   &src->set->file_pool,

  1756 			   src->file_map,

  1757 			   &merger->set->file_pool);

  1758 		p->flags &= ~UPSTREAM_SOURCE;

  1759 	}

  1761 	rebuild_property_package_lists(merger->set);

  1762 	rebuild_file_package_lists(merger->set);

  1764 	result = merger->set;

  1765 	hashtable_release(&merger->table);

  1766 	free(merger);

  1768 	return result;

  1769 }

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

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

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

  1774  **/

  1776 void

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

  1778 	       razor_package_callback_t callback, void *data)

  1779 {

  1780 	struct razor_package_iterator *pi1, *pi2;

  1781 	struct razor_package *p1, *p2;

  1782 	const char *name1, *name2, *version1, *version2;

  1783 	int res;

  1785 	pi1 = razor_package_iterator_create(set);

  1786 	pi2 = razor_package_iterator_create(upstream);

  1788 	razor_package_iterator_next(pi1, &p1, &name1, &version1);

  1789 	razor_package_iterator_next(pi2, &p2, &name2, &version2);

  1791 	while (p1 || p2) {

  1792 		if (p1 && p2) {

  1793 			res = strcmp(name1, name2);

  1794 			if (res == 0)

  1795 				res = versioncmp(version1, version2);

  1796 		} else {

  1797 			res = 0;

  1798 		}

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

  1801 			callback(name1, version1, NULL, data);

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

  1803 			callback(name2, NULL, version2, data);

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

  1806 			razor_package_iterator_next(pi1, &p1,

  1807 						    &name1, &version1);

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

  1809 			razor_package_iterator_next(pi2, &p2,

  1810 						    &name2, &version2);

  1811 	}

  1813 	razor_package_iterator_destroy(pi1);

  1814 	razor_package_iterator_destroy(pi2);

  1815 }

  1818 struct razor_transaction_resolver {

  1819 	struct razor_set *system, *upstream;

  1820 	struct bitarray syspkgs, uppkgs;

  1821 	struct array packages;

  1822 	int errors;

  1823 };

  1825 static int

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

  1827 {

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

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

  1830 }

  1832 static int

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

  1834 {

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

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

  1837 }

  1839 static int

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

  1841 {

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

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

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

  1846 		return 1;

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

  1848 		return -1;

  1849 	else

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

  1851 }

  1853 static void

  1854 resolve_new_packages(struct razor_transaction_resolver *trans,

  1855 		     int start, int end)

  1856 {

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

  1858 	struct razor_transaction_package **packages;

  1859 	const char *spool, *upool;

  1860 	int i;

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

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

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

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

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

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

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

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

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

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

  1873 	      compare_transaction_packages);

  1875 	sp = spkgs;

  1876 	up = upkgs;

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

  1878 		if (!packages[i]->name)

  1879 			continue;

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

  1881 			sp++;

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

  1883 			up++;

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

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

  1887 			if (sp < send && strcmp(packages[i]->name, &spool[sp->name]) == 0) {

  1888 				packages[i]->old_package = sp;

  1889 				packages[i]->name = &spool[sp->name];

  1890 				packages[i]->old_version = &spool[sp->version];

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

  1892 			} else {

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

  1894 				packages[i]->state = RAZOR_PACKAGE_REMOVE_NOT_INSTALLED;

  1895 				trans->errors++;

  1896 			}

  1897 		} else {

  1898 			if (up < uend && strcmp(packages[i]->name, &upool[up->name]) == 0) {

  1899 				packages[i]->new_package = up;

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

  1901 				packages[i]->new_version = &upool[up->version];

  1902 				if (sp < send && strcmp(packages[i]->name, &spool[sp->name]) == 0) {

  1903 					packages[i]->old_package = sp;

  1904 					packages[i]->old_version = &spool[sp->version];

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

  1906 						packages[i]->state = RAZOR_PACKAGE_UP_TO_DATE;

  1907 						trans->errors++;

  1908 						continue;

  1909 					}

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

  1911 				}

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

  1913 			} else {

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

  1915 				packages[i]->state = RAZOR_PACKAGE_INSTALL_UNAVAILABLE;

  1916 				trans->errors++;

  1917 			}

  1918 		}

  1919 	}

  1920 }

  1922 static void

  1923 find_all_packages(struct razor_transaction_resolver *trans)

  1924 {

  1925 	struct razor_transaction_package *tp;

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

  1927 	const char *spool, *upool;

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

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

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

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

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

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

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

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

  1938 			up++;

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

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

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

  1942 			tp->old_package = sp;

  1943 			tp->new_package = up;

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

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

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

  1947 			tp->state = RAZOR_PACKAGE_INSTALL;

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

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

  1950 		}

  1951 	}

  1952 }

  1954 static int

  1955 provider_satisfies_requirement(struct razor_property *provider,

  1956 			       const char *provider_strings,

  1957 			       struct razor_property *requirement,

  1958 			       const char *requirement_strings)

  1959 {

  1960 	int cmp, len;

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

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

  1964 	if (!*required)

  1965 		return 1;

  1967 	cmp = versioncmp(provided, required);

  1969 	switch (requirement->relation) {

  1970 	case RAZOR_VERSION_LESS:

  1971 		return cmp < 0;

  1973 	case RAZOR_VERSION_LESS_OR_EQUAL:

  1974 		if (cmp <= 0)

  1975 			return 1;

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

  1978 	case RAZOR_VERSION_EQUAL:

  1979 		if (cmp == 0)

  1980 			return 1;

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

  1983 		len = strlen(required);

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

  1985 			return 1;

  1986 		return 0;

  1988 	case RAZOR_VERSION_GREATER_OR_EQUAL:

  1989 		return cmp >= 0;

  1991 	case RAZOR_VERSION_GREATER:

  1992 		return cmp > 0;

  1993 	}

  1995 	/* shouldn't happen */

  1996 	return 0;

  1997 }

  1999 static struct razor_package *

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

  2001 		      const char *filename, int installed)

  2002 {

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

  2004 	struct razor_entry *entry;

  2005 	struct list *p;

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

  2008 		return 0;

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

  2011 	if (!entry)

  2012 		return 0;

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

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

  2016 			return &pkgs[p->data];

  2017 	}

  2018 	return NULL;

  2019 }

  2021 static struct razor_package *

  2022 find_installed_package_for_file(struct razor_transaction_resolver *trans,

  2023 				const char *filename)

  2024 {

  2025 	struct razor_package *pkg;

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

  2028 				    filename, 1);

  2029 	if (!pkg)

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

  2031 					    filename, 1);

  2032 	return pkg;

  2033 }

  2035 static struct razor_package *

  2036 find_uninstalled_package_for_file(struct razor_transaction_resolver *trans,

  2037 				  const char *filename)

  2038 {

  2039 	struct razor_package *pkg;

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

  2042 				    filename, 0);

  2043 	if (!pkg)

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

  2045 					    filename, 0);

  2046 	return pkg;

  2047 }

  2049 static struct razor_property *

  2050 skip_to_matching_property(struct razor_transaction_resolver *trans,

  2051 			  struct razor_property *match,

  2052 			  struct razor_property *prop)

  2053 {

  2054 	struct razor_set *mset, *pset;

  2055 	const char *ppool, *mpool;

  2056 	struct razor_property *prop_end;

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

  2059 		mset = trans->system;

  2060 	else

  2061 		mset = trans->upstream;

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

  2064 		pset = trans->system;

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

  2066 		pset = trans->upstream;

  2067 	else

  2068 		return prop;

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

  2071 	ppool = pset->string_pool.data;

  2072 	mpool = mset->string_pool.data;

  2074 	while (prop < prop_end &&

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

  2076 		prop++;

  2077 	return prop;

  2078 }

  2080 static struct razor_package *

  2081 find_package_matching(struct razor_transaction_resolver *trans, int installed,

  2082 		      struct razor_property *prop,

  2083 		      struct razor_property *req,

  2084 		      struct razor_set *req_set)

  2085 {

  2086 	struct razor_set *set;

  2087 	struct bitarray *pkgbits;

  2088 	struct razor_package *pkgs;

  2089 	struct razor_property *props, *prop_end;

  2090 	enum razor_property_type match_type;

  2091 	const char *pool;

  2092 	const char *rpool;

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

  2094 	int match;

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

  2097 		set = trans->system;

  2098 		pkgbits = &trans->syspkgs;

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

  2100 		set = trans->upstream;

  2101 		pkgbits = &trans->uppkgs;

  2102 	} else

  2103 		return NULL;

  2105 	if (!req_set) {

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

  2107 			req_set = trans->system;

  2108 		else

  2109 			req_set = trans->upstream;

  2110 	}

  2111 	rpool = req_set->string_pool.data;

  2113 	if (req->type == RAZOR_PROPERTY_PROVIDES)

  2114 		match_type = RAZOR_PROPERTY_CONFLICTS;

  2115 	else

  2116 		match_type = RAZOR_PROPERTY_PROVIDES;

  2118 	pkgs = set->packages.data;

  2119 	props = set->properties.data;

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

  2121 	pool = set->string_pool.data;

  2123 	/* Find first matching property */

  2124 	while (prop < prop_end &&

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

  2126 		prop++;

  2127 	if (prop == prop_end ||

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

  2129 		return NULL;

  2131 	if (prop->type < match_type) {

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

  2133 			prop++;

  2134 	} else {

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

  2136 			prop--;

  2137 		while (prop > props + 1 && (prop - 1)->type == match_type)

  2138 			prop--;

  2139 	}

  2141 	/* Scan matching properties */

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

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

  2144 		if (match_type == RAZOR_PROPERTY_PROVIDES)

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

  2146 		else

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

  2148 		if (match) {

  2149 			struct list *pkg;

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

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

  2153 					continue;

  2154 				if (!match_name ||

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

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

  2157 					return &pkgs[pkg->data];

  2158 			}

  2159 		}

  2160 		prop++;

  2161 	}

  2163 	return NULL;

  2164 }

  2166 static struct razor_package *

  2167 find_installed_package_for_property(struct razor_transaction_resolver *trans,

  2168 				    struct razor_property *sys_start,

  2169 				    struct razor_property *up_start,

  2170 				    struct razor_property *req)

  2171 {

  2172 	struct razor_package *pkg;

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

  2175 	if (!pkg)

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

  2177 	return pkg;

  2178 }

  2180 static struct razor_package *

  2181 find_uninstalled_package_for_property(struct razor_transaction_resolver *trans,

  2182 				      struct razor_property *sys_start,

  2183 				      struct razor_property *up_start,

  2184 				      struct razor_property *req)

  2185 {

  2186 	struct razor_package *pkg;

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

  2189 	if (!pkg)

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

  2191 	return pkg;

  2192 }

  2194 static struct razor_transaction_package *

  2195 find_transaction_package(struct razor_transaction_resolver *trans,

  2196 			 const char *name)

  2197 {

  2198 	struct razor_transaction_package *packages;

  2199 	int count, i;

  2201 	packages = trans->packages.data;

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

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

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

  2205 			return &packages[i];

  2206 	}

  2207 	return NULL;

  2208 }

  2210 /* FIXME? */

  2211 static int

  2212 prop_is_being_installed(struct razor_transaction_resolver *trans,

  2213 			struct razor_property *prop)

  2214 {

  2215 	struct list *pkg;

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

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

  2219 			return 1;

  2220 	}

  2221 	return 0;

  2222 }

  2224 static int

  2225 prop_is_being_removed(struct razor_transaction_resolver *trans,

  2226 		      struct razor_property *prop)

  2227 {

  2228 	struct list *pkg;

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

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

  2232 			return 0;

  2233 	}

  2234 	return 1;

  2235 }

  2237 static int

  2238 prop_is_being_updated(struct razor_transaction_resolver *trans,

  2239 		      struct razor_property *prop)

  2240 {

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

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

  2243 	struct razor_transaction_package *tp;

  2244 	struct list *pkg;

  2246 	/* Assumes prop_is_being_removed returns true */

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

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

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

  2251 			return 0;

  2252 	}

  2253 	return 1;

  2254 }

  2256 static void

  2257 add_transaction_package(struct razor_transaction_resolver *trans,

  2258 			struct razor_package *new_package,

  2259 			struct razor_package *old_package,

  2260 			enum razor_transaction_package_state state,

  2261 			const char *req_package,

  2262 			struct razor_property *req_prop)

  2263 {

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

  2265 	struct bitarray *reqpkgbits;

  2266 	struct razor_transaction_package *tp, *already;

  2267 	const char *pool;

  2268 	struct razor_package *pkgs;

  2269 	struct list *pkg;

  2270 	int contradiction = 0;

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

  2273 		new_package_set = trans->system;

  2274 	else

  2275 		new_package_set = trans->upstream;

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

  2277 		old_package_set = trans->system;

  2278 	else

  2279 		old_package_set = trans->upstream;

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

  2281 		req_set = trans->system;

  2282 		reqpkgbits = &trans->syspkgs;

  2283 	} else {

  2284 		req_set = trans->upstream;

  2285 		reqpkgbits = &trans->uppkgs;

  2286 	}

  2288 	if (new_package) {

  2289 		pool = new_package_set->string_pool.data;

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

  2291 		if (already) {

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

  2293 				/* Already taken care of */

  2294 				return;

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

  2296 				   already->state == RAZOR_PACKAGE_FORCED_UPDATE) {

  2297 				already->new_package = new_package;

  2298 				return;

  2299 			}

  2301 			/* Oops. We lose */

  2302 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2303 				contradiction = 1;

  2304 		}

  2305 	} else if (old_package) {

  2306 		pool = old_package_set->string_pool.data;

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

  2308 		if (already) {

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

  2310 				/* Already taken care of */

  2311 				return;

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

  2313 				already->old_package = old_package;

  2314 				return;

  2315 			}

  2317 			/* Oops. We lose */

  2318 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2319 				contradiction = 1;

  2320 		}

  2321 	} else

  2322 		state = RAZOR_PACKAGE_UNSATISFIABLE;

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

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

  2327 	if (new_package) {

  2328 		pool = new_package_set->string_pool.data;

  2329 		tp->new_package = new_package;

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

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

  2333 		pkgs = new_package_set->packages.data;

  2334 	}

  2335 	if (old_package) {

  2336 		pool = old_package_set->string_pool.data;

  2337 		tp->old_package = old_package;

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

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

  2341 		pkgs = old_package_set->packages.data;

  2342 	}

  2344 	tp->state = state;

  2345 	if (state != RAZOR_PACKAGE_INSTALL &&

  2346 	    state != RAZOR_PACKAGE_FORCED_UPDATE &&

  2347 	    state != RAZOR_PACKAGE_REMOVE &&

  2348 	    state != RAZOR_PACKAGE_OBSOLETED)

  2349 		trans->errors++;

  2351 	if (contradiction) {

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

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

  2354 		 */

  2355 		add_transaction_package(trans, new_package, old_package,

  2356 					RAZOR_PACKAGE_CONTRADICTION,

  2357 					NULL, NULL);

  2358 	}

  2360 	if (req_package)

  2361 		tp->dep_package = req_package;

  2362 	if (!req_prop)

  2363 		return;

  2365 	pool = req_set->string_pool.data;

  2366 	pkgs = req_set->packages.data;

  2367 	if (!req_package) {

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

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

  2370 				break;

  2371 		}

  2372 		if (pkg)

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

  2374 	}

  2376 	tp->dep_type = req_prop->type;

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

  2378 	tp->dep_relation = req_prop->relation;

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

  2380 }

  2382 static void

  2383 razor_transaction_satisfy(struct razor_transaction_resolver *trans)

  2384 {

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

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

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

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

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

  2390 	struct list *reqpkg;

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

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

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

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

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

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

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

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

  2401 	sp = sprops;

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

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

  2404 		 * to-be-installed.

  2405 		 */

  2406 		while (up < uprop_end &&

  2407 		       !prop_is_being_installed(trans, up))

  2408 			up++;

  2409 		if (up == uprop_end)

  2410 			break;

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

  2413 		switch (up->type) {

  2414 		case RAZOR_PROPERTY_REQUIRES:

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

  2416 				break;

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

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

  2420 				/* Requires something that is either installed

  2421 				 * or to-be-installed.

  2422 				 */

  2423 				break;

  2424 			}

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

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

  2428 			if (!pkg)

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

  2430 			add_transaction_package(trans, pkg, NULL,

  2431 						RAZOR_PACKAGE_INSTALL,

  2432 						NULL, up);

  2433 			break;

  2435 		case RAZOR_PROPERTY_PROVIDES:

  2436 			/* find_installed_package_for_property works backwards

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

  2438 			 */

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

  2440 			if (!pkg)

  2441 				break;

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

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

  2445 				 * finding an upgrade

  2446 				 */

  2447 				add_transaction_package(trans, NULL, pkg,

  2448 							RAZOR_PACKAGE_FORCED_UPDATE,

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

  2450 			} else {

  2451 				add_transaction_package(trans, NULL, pkg,

  2452 							RAZOR_PACKAGE_CONTRADICTION,

  2453 							NULL, up);

  2454 			}

  2455 			break;

  2457 		case RAZOR_PROPERTY_CONFLICTS:

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

  2459 			if (!pkg)

  2460 				break;

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

  2463 				/* Conflicts with something already installed.

  2464 				 * Try to upgrade out.

  2465 				 */

  2466 				add_transaction_package(trans, NULL, pkg,

  2467 							RAZOR_PACKAGE_FORCED_UPDATE,

  2468 							NULL, up);

  2469 			} else {

  2470 				add_transaction_package(trans, pkg, NULL,

  2471 							RAZOR_PACKAGE_CONTRADICTION,

  2472 							NULL, up);

  2473 			}

  2474 			break;

  2476 		case RAZOR_PROPERTY_OBSOLETES:

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

  2478 			if (pkg) {

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

  2480 				 * will add a CONTRADICTION error as well.

  2481 				 */

  2482 				add_transaction_package(trans, NULL, pkg,

  2483 							RAZOR_PACKAGE_OBSOLETED,

  2484 							NULL, up);

  2485 			}

  2486 			break;

  2488 		default:

  2489 			/* can't happen */

  2490 			break;

  2491 		}

  2492 	}

  2494 	up = uprops;

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

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

  2497 		 * to-be-removed.

  2498 		 */

  2499 		while (sp < sprop_end &&

  2500 		       (sp->type != RAZOR_PROPERTY_PROVIDES ||

  2501 			!prop_is_being_removed(trans, sp)))

  2502 			sp++;

  2503 		if (sp == sprop_end)

  2504 			break;

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

  2508 		/* Skip 'up' to match */

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

  2510 		ur = first_up = up;

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

  2513 		 * already be installing an identical PROVIDES, so

  2514 		 * check for that.

  2515 		 */

  2516 		while (up < uprop_end &&

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

  2518 		       (up->type != RAZOR_PROPERTY_PROVIDES ||

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

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

  2521 			up++;

  2522 		if (up < uprop_end &&

  2523 		    up->type == RAZOR_PROPERTY_PROVIDES &&

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

  2525 		    sp->relation == up->relation &&

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

  2527 		    prop_is_being_installed(trans, up)) {

  2528 			up = first_up;

  2529 			continue;

  2530 		}

  2531 		up = first_up;

  2533 		/* For all still-installed packages that require

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

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

  2536 		 * not, either remove or attempt to update the

  2537 		 * package, depending on why the required property has

  2538 		 * disappeared

  2539 		 */

  2540 		sr = sp;

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

  2542 			sr--;

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

  2544 			if (prop_is_being_removed(trans, sr))

  2545 				continue;

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

  2547 				continue;

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

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

  2551 					continue;

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

  2553 				if (prop_is_being_updated(trans, sp)) {

  2554 					add_transaction_package(trans, NULL, pkg,

  2555 								RAZOR_PACKAGE_FORCED_UPDATE,

  2556 								removed_package, NULL);

  2557 				} else {

  2558 					add_transaction_package(trans, NULL, pkg,

  2559 								RAZOR_PACKAGE_REMOVE,

  2560 								removed_package, sr);

  2561 				}

  2562 			}

  2563 		}

  2564 	}

  2565 }

  2567 struct razor_transaction *

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

  2569 			 int update_count, const char **update_packages,

  2570 			 int remove_count, const char **remove_packages)

  2571 {

  2572 	struct razor_transaction_resolver trans;

  2573 	struct razor_transaction *ret_trans;

  2574 	struct razor_transaction_package *tp;

  2575 	int start, end, i;

  2577 	trans.system = system;

  2578 	trans.upstream = upstream ? upstream : razor_set_create();

  2579 	array_init(&trans.packages);

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

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

  2582 	trans.errors = 0;

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

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

  2586 			tp = array_add(&trans.packages, sizeof *tp);

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

  2588 			tp->name = update_packages[i];

  2589 			tp->state = RAZOR_PACKAGE_INSTALL;

  2590 		}

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

  2592 			tp = array_add(&trans.packages, sizeof *tp);

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

  2594 			tp->name = remove_packages[i];

  2595 			tp->state = RAZOR_PACKAGE_REMOVE;

  2596 		}

  2597 	} else

  2598 		find_all_packages(&trans);

  2600 	start = 0;

  2601 	end = trans.packages.size / sizeof (struct razor_transaction_package);

  2603 	while (start != end) {

  2604 		resolve_new_packages(&trans, start, end);

  2605 		if (trans.errors)

  2606 			break;

  2608 		razor_transaction_satisfy(&trans);

  2610 		start = end;

  2611 		end = trans.packages.size / sizeof (struct razor_transaction_package);

  2612 	}

  2614 	ret_trans = zalloc(sizeof *ret_trans);

  2615 	ret_trans->system = trans.system;

  2616 	ret_trans->upstream = trans.upstream;

  2617 	ret_trans->packages = trans.packages.data;

  2618 	ret_trans->package_count = end;

  2619 	ret_trans->errors = trans.errors;

  2620 	return ret_trans;

  2621 }

  2623 const char * const razor_version_relations[] = {

  2624 	/* same order as enum razor_version_relation */

  2625 	"<", "<=", "=", ">=", ">"

  2626 };

  2628 const char * const razor_property_types[] = {

  2629 	/* same order as enum razor_property_type */

  2630 	"requires", "provides", "conflicts with", "obsoletes"

  2631 };

  2633 void

  2634 razor_transaction_describe(struct razor_transaction *trans)

  2635 {

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

  2637 	int errors_only = 0;

  2639 	tps = trans->packages;

  2640 	pend = trans->packages + trans->package_count;

  2641 	for (p = trans->packages; p < pend; p++) {

  2642 		switch (p->state) {

  2643 		case RAZOR_PACKAGE_INSTALL:

  2644 			if (errors_only)

  2645 				break;

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

  2648 			if (p->dep_package) {

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

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

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

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

  2653 					if (*p->dep_version) {

  2654 						printf(" %s %s",

  2655 						       razor_version_relations[p->dep_relation],

  2656 						       p->dep_version);

  2657 					}

  2658 				} else {

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

  2660 					if (*p->dep_version) {

  2661 						printf(", which %s %s %s %s",

  2662 						       razor_property_types[p->dep_type],

  2663 						       p->dep_property,

  2664 						       razor_version_relations[p->dep_relation],

  2665 						       p->dep_version);

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

  2667 						printf(", which %s %s",

  2668 						       razor_property_types[p->dep_type],

  2669 						       p->dep_property);

  2670 					}

  2671 				}

  2672 			}

  2673 			printf("\n");

  2674 			break;

  2676 		case RAZOR_PACKAGE_FORCED_UPDATE:

  2677 			if (errors_only)

  2678 				break;

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

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

  2682 			break;

  2684 		case RAZOR_PACKAGE_REMOVE:

  2685 			if (errors_only)

  2686 				break;

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

  2688 			if (p->dep_package) {

  2689 				printf(" which required %s",

  2690 				       p->dep_package);

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

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

  2693 			}

  2694 			printf("\n");

  2695 			break;

  2697 		case RAZOR_PACKAGE_OBSOLETED:

  2698 			if (errors_only)

  2699 				break;

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

  2701 			if (p->dep_package) {

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

  2703 				       p->dep_package);

  2704 			}

  2705 			printf("\n");

  2706 			break;

  2708 		case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:

  2709 			printf("Error: can't install %s: not found\n", p->name);

  2710 			errors_only = 1;

  2711 			break;

  2713 		case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:

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

  2715 			errors_only = 1;

  2716 			break;

  2718 		case RAZOR_PACKAGE_UP_TO_DATE:

  2719 			printf("Error: can't upgrade %s: %s is most recent version\n", p->name, p->old_version);

  2720 			errors_only = 1;

  2721 			break;

  2723 		case RAZOR_PACKAGE_CONTRADICTION:

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

  2725 			errors_only = 1;

  2726 			break;

  2728 		case RAZOR_PACKAGE_OLD_CONFLICT:

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

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

  2731 			if (*p->dep_version) {

  2732 				printf("%s %s %s",

  2733 				       p->dep_property,

  2734 				       razor_version_relations[p->dep_relation],

  2735 				       p->dep_version);

  2736 			} else

  2737 				printf("it");

  2738 			printf("\n");

  2740 			errors_only = 1;

  2741 			break;

  2743 		case RAZOR_PACKAGE_NEW_CONFLICT:

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

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

  2746 			if (*p->dep_version) {

  2747 				printf(" %s %s",

  2748 				       razor_version_relations[p->dep_relation],

  2749 				       p->dep_version);

  2750 			}

  2751 			printf("\n");

  2753 			errors_only = 1;

  2754 			break;

  2756 		case RAZOR_PACKAGE_UNSATISFIABLE:

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

  2758 			if (*p->dep_version) {

  2759 				printf(" %s %s",

  2760 					razor_version_relations[p->dep_relation],

  2761 					p->dep_version);

  2762 			}

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

  2764 				p->dep_package);

  2765 			errors_only = 1;

  2766 			break;

  2768 		default:

  2769 			/* Shouldn't actually happen */

  2770 			break;

  2771 		}

  2772 	}

  2773 }

  2775 struct razor_set *

  2776 razor_transaction_run(struct razor_transaction *trans)

  2777 {

  2778 	struct array install_packages, remove_packages;

  2779 	struct razor_merger *merger;

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

  2781 	struct source *source1, *source2;

  2782 	char *spool, *ipool, *rpool;

  2783 	uint32_t *map;

  2784 	int p, cmp;

  2786 	/* FIXME */

  2787 	if (trans->errors)

  2788 		return NULL;

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

  2791 	array_init(&install_packages);

  2792 	array_init(&remove_packages);

  2793 	for (p = 0; p < trans->package_count; p++) {

  2794 		if (trans->packages[p].new_package) {

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

  2796 			*pkg = *trans->packages[p].new_package;

  2797 		} else {

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

  2799 			*pkg = *trans->packages[p].old_package;

  2800 		}

  2801 	}

  2802 	map = qsort_with_data(install_packages.data,

  2803 			      install_packages.size / sizeof *pkg,

  2804 			      sizeof *pkg,

  2805 			      compare_packages,

  2806 			      trans->upstream);

  2807 	free(map);

  2808 	map = qsort_with_data(remove_packages.data,

  2809 			      remove_packages.size / sizeof *pkg,

  2810 			      sizeof *pkg,

  2811 			      compare_packages,

  2812 			      trans->system);

  2813 	free(map);

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

  2817 	source1 = &merger->source1;

  2818 	source2 = &merger->source2;

  2820 	i = install_packages.data;

  2821 	iend = install_packages.data + install_packages.size;

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

  2824 	r = remove_packages.data;

  2825 	rend = remove_packages.data + remove_packages.size;

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

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

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

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

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

  2833 		/* Check if s is being removed */

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

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

  2836 			s++;

  2837 			r++;

  2838 			continue;

  2839 		}

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

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

  2843 		else if (s < send)

  2844 			cmp = -1;

  2845 		else

  2846 			cmp = 1;

  2847 		if (cmp < 0) {

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

  2849 			s++;

  2850 		} else if (cmp == 0) {

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

  2852 			s++;

  2853 			i++;

  2854 		} else {

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

  2856 			i++;

  2857 		}

  2858 	}

  2860 	array_release(&install_packages);

  2861 	array_release(&remove_packages);

  2863 	return razor_merger_finish(merger);

  2864 }

  2866 void

  2867 razor_transaction_destroy(struct razor_transaction *trans)

  2868 {

  2869 	int p;

  2871 	for (p = 0; p < trans->package_count; p++) {

  2872 		if (!trans->packages[p].dep_package &&

  2873 		    (trans->packages[p].state == RAZOR_PACKAGE_INSTALL_UNAVAILABLE ||

  2874 		     trans->packages[p].state == RAZOR_PACKAGE_REMOVE_NOT_INSTALLED))

  2875 			free((char *)trans->packages[p].name);

  2876 	}

  2877 	free(trans);

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

  2880 }

author	Dan Winship <danw@gnome.org>
	Tue Mar 11 18:12:02 2008 -0400 (2008-03-11)
changeset 167	28e203d118c7
parent 166	8a1573991d22
child 168	680d18568209
permissions	-rw-r--r--