razor: razor.c@ed154b422dc0

     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;

   129 	set = zalloc(sizeof *set);

   131 	array_init(&set->files);

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

   133 	e->name = 0;

   134 	e->flags = RAZOR_ENTRY_LAST;

   135 	e->start = 0;

   136 	list_set_empty(&e->packages);

   138 	return set;

   139 }

   141 struct razor_set *

   142 razor_set_open(const char *filename)

   143 {

   144 	struct razor_set *set;

   145 	struct razor_set_section *s;

   146 	struct stat stat;

   147 	struct array *array;

   148 	int fd;

   150 	set = zalloc(sizeof *set);

   151 	fd = open(filename, O_RDONLY);

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

   153 		return NULL;

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

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

   156 		free(set);

   157 		return NULL;

   158 	}

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

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

   162 			continue;

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

   164 			continue;

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

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

   167 		array->size = s->size;

   168 		array->alloc = s->size;

   169 	}

   170 	close(fd);

   172 	return set;

   173 }

   175 void

   176 razor_set_destroy(struct razor_set *set)

   177 {

   178 	unsigned int size;

   179 	struct array *a;

   180 	int i;

   182 	if (set->header) {

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

   184 			;

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

   186 		munmap(set->header, size);

   187 	} else {

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

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

   190 			free(a->data);

   191 		}

   192 	}

   194 	free(set);

   195 }

   197 int

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

   199 {

   200 	char data[4096];

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

   202 	struct array *a;

   203 	uint32_t offset;

   204 	int i, fd;

   206 	memset(data, 0, sizeof data);

   207 	header->magic = RAZOR_MAGIC;

   208 	header->version = RAZOR_VERSION;

   209 	offset = sizeof data;

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

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

   213 			continue;

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

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

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

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

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

   219 	}

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

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

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

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

   226 	if (fd < 0)

   227 		return -1;

   229 	razor_write(fd, data, sizeof data);

   230 	memset(data, 0, sizeof data);

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

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

   233 			continue;

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

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

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

   237 	}

   239 	close(fd);

   241 	return 0;

   242 }

   244 void

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

   246 		const char *version, const char *release)

   247 {

   248 	int len;

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

   251 		*evr_buf = '\0';

   252 		return;

   253 	}

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

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

   257 		evr_buf += len;

   258 		size -= len;

   259 	}

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

   261 	evr_buf += len;

   262 	size -= len;

   263 	if (release && *release)

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

   265 }

   267 void

   268 razor_importer_begin_package(struct razor_importer *importer,

   269 			     const char *name, const char *version)

   270 {

   271 	struct razor_package *p;

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

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

   275 	p->flags = 0;

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

   278 	importer->package = p;

   279 	array_init(&importer->properties);

   280 }

   282 void

   283 razor_importer_finish_package(struct razor_importer *importer)

   284 {

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

   286 		       &importer->set->property_pool,

   287 		       &importer->properties,

   288 		       1);

   290 	array_release(&importer->properties);

   291 }

   293 void

   294 razor_importer_add_property(struct razor_importer *importer,

   295 			    const char *name,

   296 			    enum razor_version_relation relation,

   297 			    const char *version,

   298 			    enum razor_property_type type)

   299 {

   300 	struct razor_property *p;

   301 	uint32_t *r;

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

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

   305 	p->flags = 0;

   306 	p->type = type;

   307 	p->relation = relation;

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

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

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

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

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

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

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

   317 		*r = p->name;

   318 	}

   319 }

   321 void

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

   323 {

   324 	struct import_entry *e;

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

   328 	e->package = importer->package -

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

   330 	e->name = strdup(name);

   331 }

   333 struct razor_importer *

   334 razor_importer_new(void)

   335 {

   336 	struct razor_importer *importer;

   338 	importer = zalloc(sizeof *importer);

   339 	importer->set = razor_set_create();

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

   342 	return importer;

   343 }

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

   346 void

   347 razor_importer_destroy(struct razor_importer *importer)

   348 {

   349 	/* FIXME: write this */

   350 }

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

   354 					const void *p,

   355 					void *data);

   357 struct qsort_context {

   358 	size_t size;

   359 	compare_with_data_func_t compare;

   360 	void *data;

   361 };

   363 static void

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

   365 {

   366 	char buffer[size];

   368 	memcpy(buffer, p1, size);

   369 	memcpy(p1, p2, size);

   370 	memcpy(p2, buffer, size);

   371 }

   373 static void

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

   375 		  struct qsort_context *ctx)

   376 {

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

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

   379 	int left, right, result;

   380 	size_t size = ctx->size;

   382 	p = base;

   383 	start = base;

   384 	end = base + nelem * size;

   385 	mp = map;

   386 	mstart = map;

   387 	mend = map + nelem;

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

   390 	while (p < end) {

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

   392 		if (result < 0) {

   393 			qsort_swap(p, start, size);

   394 			tmp = *mp;

   395 			*mp = *mstart;

   396 			*mstart = tmp;

   397 			if (start == pivot)

   398 				pivot = p;

   399 			start += size;

   400 			mstart++;

   401 			p += size;

   402 			mp++;

   403 		} else if (result == 0) {

   404 			p += size;

   405 			mp++;

   406 		} else {

   407  			end -= size;

   408 			mend--;

   409 			qsort_swap(p, end, size);

   410 			tmp = *mp;

   411 			*mp = *mend;

   412 			*mend = tmp;

   413 			if (end == pivot)

   414 				pivot = p;

   415 		}

   416 	}

   418 	left = (start - base) / size;

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

   420 	if (left > 1)

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

   422 	if (right > 1)

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

   424 }

   426 static uint32_t *

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

   428 		compare_with_data_func_t compare, void *data)

   429 {

   430 	struct qsort_context ctx;

   431 	uint32_t *map;

   432 	int i;

   434 	if (nelem == 0)

   435 		return NULL;

   437 	ctx.size = size;

   438 	ctx.compare = compare;

   439 	ctx.data = data;

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

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

   443 		map[i] = i;

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

   447 	return map;

   448 }

   450 static int

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

   452 {

   453 	const char *p1, *p2;

   454 	long n1, n2;

   455 	int res;

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

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

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

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

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

   463 	if (res < 0) {

   464 		n1 = 0;

   465 		p1 = s1;

   466 		p2++;

   467 	} else if (res > 0) {

   468 		p1++;

   469 		n2 = 0;

   470 		p2 = s2;

   471 	}

   473 	if (n1 != n2)

   474 		return n1 - n2;

   475 	while (*p1 && *p2) {

   476 		if (*p1 != *p2)

   477 			return *p1 - *p2;

   478 		p1++;

   479 		p2++;

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

   481 			return versioncmp(p1, p2);

   482 	}

   484 	return *p1 - *p2;

   485 }

   487 static int

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

   489 {

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

   491 	struct razor_set *set = data;

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

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

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

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

   497 	else

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

   499 }

   501 static int

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

   503 {

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

   505 	struct razor_set *set = data;

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

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

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

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

   511 		return prop1->type - prop2->type;

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

   513 		return prop1->relation - prop2->relation;

   514 	else

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

   516 }

   518 static uint32_t *

   519 uniqueify_properties(struct razor_set *set)

   520 {

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

   522 	struct array *pkgs, *p;

   523 	struct list_head *r;

   524 	uint32_t *map, *rmap;

   525 	int i, count, unique;

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

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

   529 			      count,

   530 			      sizeof(struct razor_property),

   531 			      compare_properties,

   532 			      set);

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

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

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

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

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

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

   540 			up++;

   541 			up->name = rp->name;

   542 			up->flags = 0;

   543 			up->type = rp->type;

   544 			up->relation = rp->relation;

   545 			up->version = rp->version;

   546 		}

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

   549 		rmap[map[i]] = unique;

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

   551 		*r = rp->packages;

   552 	}

   553 	free(map);

   555 	if (up != rp)

   556 		up++;

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

   558 	rp_end = up;

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

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

   561 		array_release(p);

   562 	}

   564 	free(pkgs);

   566 	return rmap;

   567 }

   569 static int

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

   571 {

   572 	const struct import_entry *e1 = p1;

   573 	const struct import_entry *e2 = p2;

   574 	const char *n1 = e1->name;

   575 	const char *n2 = e2->name;

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

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

   579 	 * sort before "foo.conf"

   580 	 *

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

   582 	 */

   583 	while (*n1 && *n2) {

   584 		if (*n1 < *n2)

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

   586 		else if (*n1 > *n2)

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

   588 		n1++;

   589 		n2++;

   590 	}

   591 	if (*n1)

   592 		return 1;

   593 	else if (*n2)

   594 		return -1;

   595 	else

   596 		return 0;

   597 }

   599 static void

   600 count_entries(struct import_directory *d)

   601 {

   602 	struct import_directory *p, *end;

   604 	p = d->files.data;

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

   606 	d->count = 0;

   607 	while (p < end) {

   608 		count_entries(p);

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

   610 		p++;

   611 	}

   612 }

   614 static void

   615 serialize_files(struct razor_set *set,

   616 		struct import_directory *d, struct array *array)

   617 {

   618 	struct import_directory *p, *end;

   619 	struct razor_entry *e = NULL;

   620 	uint32_t s;

   622 	p = d->files.data;

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

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

   625 	while (p < end) {

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

   627 		e->name = p->name;

   628 		e->flags = 0;

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

   630 		s += p->count;

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

   633 		array_release(&p->packages);

   634 		p++;

   635 	}

   636 	if (e != NULL)

   637 		e->flags |= RAZOR_ENTRY_LAST;

   639 	p = d->files.data;

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

   641 	while (p < end) {

   642 		serialize_files(set, p, array);

   643 		p++;

   644 	}

   645 }

   647 static void

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

   649 {

   650 	struct razor_property *p, *end;

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

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

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

   655 }

   657 static void

   658 build_file_tree(struct razor_importer *importer)

   659 {

   660 	int count, i, length;

   661 	struct import_entry *filenames;

   662 	char *f, *end;

   663 	uint32_t name, *r;

   664 	char dirname[256];

   665 	struct import_directory *d, root;

   666 	struct razor_entry *e;

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

   669 	qsort_with_data(importer->files.data,

   670 			count,

   671 			sizeof (struct import_entry),

   672 			compare_filenames,

   673 			NULL);

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

   676 	array_init(&root.files);

   677 	array_init(&root.packages);

   678 	root.last = NULL;

   680 	filenames = importer->files.data;

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

   682 		f = filenames[i].name;

   683 		if (*f != '/')

   684 			continue;

   685 		f++;

   687 		d = &root;

   688 		while (*f) {

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

   690 			if (end == NULL)

   691 				end = f + strlen(f);

   692 			length = end - f;

   693 			memcpy(dirname, f, length);

   694 			dirname[length] ='\0';

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

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

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

   698 				d->last->name = name;

   699 				d->last->last = NULL;

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

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

   702 			}

   703 			d = d->last;

   704 			f = end + 1;

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

   706 				break;

   707 		}

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

   710 		*r = filenames[i].package;

   711 		free(filenames[i].name);

   712 	}

   714 	count_entries(&root);

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

   716 	e->name = root.name;

   717 	e->flags = RAZOR_ENTRY_LAST;

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

   719 	list_set_empty(&e->packages);

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

   723 	array_release(&importer->files);

   724 }

   726 static struct razor_entry *

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

   729 static void

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

   731 {

   732 	uint32_t *item;

   734 	while (list) {

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

   736 		 *item = list->data;

   737 		 list = list_next(list);

   738 	}

   739 }

   741 static int

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

   743 {

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

   745 	const char *pool = data;

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

   748 }

   750 static void

   751 find_file_provides(struct razor_importer *importer)

   752 {

   753 	struct razor_property *prop;

   754 	struct razor_entry *top, *entry;

   755 	struct razor_package *packages;

   756 	struct array pkgprops;

   757 	struct list *pkg;

   758 	uint32_t *req, *req_start, *req_end;

   759 	uint32_t *map, *newprop;

   760 	char *pool;

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

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

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

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

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

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

   769 			      compare_file_requires, pool);

   770 	free(map);

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

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

   774 			continue;

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

   776 		if (!entry)

   777 			continue;

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

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

   781 			prop->name = *req;

   782 			prop->type = RAZOR_PROPERTY_PROVIDES;

   783 			prop->relation = RAZOR_VERSION_EQUAL;

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

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

   787 			/* Update property list of pkg */

   788 			array_init(&pkgprops);

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

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

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

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

   793 			array_release(&pkgprops);

   794 		}

   795 	}

   797 	array_release(&importer->file_requires);

   798 }

   800 static void

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

   802 {

   803 	struct razor_package *p, *packages;

   804 	struct array *pkgs;

   805 	struct razor_entry *e, *end;

   806 	struct list *r;

   807 	uint32_t *q;

   808 	int i, count;

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

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

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

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

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

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

   817 		while (r) {

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

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

   820 			r = list_next(r);

   821 		}

   822 	}

   824 	packages = set->packages.data;

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

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

   827 		array_release(&pkgs[i]);

   828 	}

   829 	free(pkgs);

   830 }

   832 struct razor_set *

   833 razor_importer_finish(struct razor_importer *importer)

   834 {

   835 	struct razor_set *set;

   836 	uint32_t *map, *rmap;

   837 	int i, count;

   839 	build_file_tree(importer);

   840 	find_file_provides(importer);

   842 	map = uniqueify_properties(importer->set);

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

   844 	free(map);

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

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

   848 			      count,

   849 			      sizeof(struct razor_package),

   850 			      compare_packages,

   851 			      importer->set);

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

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

   855 		rmap[map[i]] = i;

   856 	free(map);

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

   859 	build_package_file_lists(importer->set, rmap);

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

   861 	free(rmap);

   863 	set = importer->set;

   864 	hashtable_release(&importer->table);

   865 	free(importer);

   867 	return set;

   868 }

   870 struct razor_package_iterator {

   871 	struct razor_set *set;

   872 	struct razor_package *package, *end;

   873 	struct list *index;

   874 };

   876 static struct razor_package_iterator *

   877 razor_package_iterator_create_with_index(struct razor_set *set,

   878 					 struct list *index)

   879 {

   880 	struct razor_package_iterator *pi;

   882 	pi = zalloc(sizeof *pi);

   883 	pi->set = set;

   884 	pi->index = index;

   886 	return pi;

   887 }

   889 struct razor_package_iterator *

   890 razor_package_iterator_create(struct razor_set *set)

   891 {

   892 	struct razor_package_iterator *pi;

   894 	pi = zalloc(sizeof *pi);

   895 	pi->set = set;

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

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

   899 	return pi;

   900 }

   902 struct razor_package_iterator *

   903 razor_package_iterator_create_for_property(struct razor_set *set,

   904 					   struct razor_property *property)

   905 {

   906 	struct list *index;

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

   909 	return razor_package_iterator_create_with_index(set, index);

   910 }

   912 int

   913 razor_package_iterator_next(struct razor_package_iterator *pi,

   914 			    struct razor_package **package,

   915 			    const char **name, const char **version)

   916 {

   917 	char *pool;

   918 	int valid;

   919 	struct razor_package *p, *packages;

   921 	if (pi->package) {

   922 		p = pi->package++;

   923 		valid = p < pi->end;

   924 	} else if (pi->index) {

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

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

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

   928 		valid = 1;

   929 	} else

   930 		valid = 0;

   932 	if (valid) {

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

   934 		*package = p;

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

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

   937 	} else {

   938 		*package = NULL;

   939 	}

   941 	return valid;

   942 }

   944 void

   945 razor_package_iterator_destroy(struct razor_package_iterator *pi)

   946 {

   947 	free(pi);

   948 }

   950 struct razor_package *

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

   952 {

   953 	struct razor_package_iterator *pi;

   954 	struct razor_package *p;

   955 	const char *name, *version;

   957 	pi = razor_package_iterator_create(set);

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

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

   960 			break;

   961 	}

   962 	razor_package_iterator_destroy(pi);

   964 	return p;

   965 }

   967 struct razor_property_iterator {

   968 	struct razor_set *set;

   969 	struct razor_property *property, *end;

   970 	struct list *index;

   971 };

   973 struct razor_property_iterator *

   974 razor_property_iterator_create(struct razor_set *set,

   975 			       struct razor_package *package)

   976 {

   977 	struct razor_property_iterator *pi;

   979 	pi = zalloc(sizeof *pi);

   980 	pi->set = set;

   982 	if (package) {

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

   984 				       &set->property_pool);

   985 	} else {

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

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

   988 	}

   990 	return pi;

   991 }

   993 int

   994 razor_property_iterator_next(struct razor_property_iterator *pi,

   995 			     struct razor_property **property,

   996 			     const char **name,

   997 			     enum razor_version_relation *relation,

   998 			     const char **version,

   999 			     enum razor_property_type *type)

  1000 {

  1001 	char *pool;

  1002 	int valid;

  1003 	struct razor_property *p, *properties;

  1005 	if (pi->property) {

  1006 		p = pi->property++;

  1007 		valid = p < pi->end;

  1008 	} else if (pi->index) {

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

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

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

  1012 		valid = 1;

  1013 	} else

  1014 		valid = 0;

  1016 	if (valid) {

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

  1018 		*property = p;

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

  1020 		*relation = p->relation;

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

  1022 		*type = p->type;

  1023 	} else {

  1024 		*property = NULL;

  1025 	}

  1027 	return valid;

  1028 }

  1030 void

  1031 razor_property_iterator_destroy(struct razor_property_iterator *pi)

  1032 {

  1033 	free(pi);

  1034 }

  1036 static struct razor_entry *

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

  1038 {

  1039 	struct razor_entry *e;

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

  1041 	int len;

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

  1044 	do {

  1045 		n = pool + e->name;

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

  1047 			return e;

  1048 		len = strlen(n);

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

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

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

  1052 		}

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

  1055 	return NULL;

  1056 }

  1058 static void

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

  1060 	 char *prefix, const char *pattern)

  1061 {

  1062 	struct razor_entry *e;

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

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

  1066 	do {

  1067 		n = pool + e->name;

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

  1069 			continue;

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

  1071 		if (e->start) {

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

  1073 			*sub = '/';

  1074 			strcpy (sub + 1, n);

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

  1076 			*sub = '\0';

  1077 		}

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

  1079 }

  1081 void

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

  1083 {

  1084 	struct razor_entry *e;

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

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

  1088 		buffer[0] = '\0';

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

  1090 		return;

  1091 	}

  1093 	strcpy(buffer, pattern);

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

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

  1096 		base = NULL;

  1097 	} else {

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

  1099 		if (p) {

  1100 			*p = '\0';

  1101 			base = p + 1;

  1102 		} else {

  1103 			base = NULL;

  1104 		}

  1105 	}

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

  1107 	if (e->start != 0)

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

  1109 }

  1111 struct razor_package_iterator *

  1112 razor_package_iterator_create_for_file(struct razor_set *set,

  1113 				       const char *filename)

  1114 {

  1115 	struct razor_entry *entry;

  1116 	struct list *index;

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

  1119 	if (entry == NULL)

  1120 		return NULL;

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

  1123 	return razor_package_iterator_create_with_index(set, index);

  1124 }

  1126 static struct list *

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

  1128 		   struct razor_entry *dir, uint32_t end,

  1129 		   char *prefix)

  1130 {

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

  1132 	uint32_t next, file;

  1133 	char *pool;

  1134 	int len;

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

  1137 	pool = set->string_pool.data;

  1139 	e = entries + dir->start;

  1140 	do {

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

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

  1143 			r = list_next(r);

  1144 			if (!r)

  1145 				return NULL;

  1146 			if (r->data >= end)

  1147 				return r;

  1148 		}

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

  1151 	e = entries + dir->start;

  1152 	do {

  1153 		if (e->start == 0)

  1154 			continue;

  1156 		if (e->flags & RAZOR_ENTRY_LAST)

  1157 			next = end;

  1158 		else {

  1159 			f = e + 1;

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

  1161 				f++;

  1162 			if (f->start == 0)

  1163 				next = end;

  1164 			else

  1165 				next = f->start;

  1166 		}

  1168 		file = r->data;

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

  1170 			len = strlen(prefix);

  1171 			prefix[len] = '/';

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

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

  1174 			prefix[len] = '\0';

  1175 		}

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

  1178 	return r;

  1179 }

  1181 void

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

  1183 {

  1184 	struct razor_package *package;

  1185 	struct list *r;

  1186 	uint32_t end;

  1187 	char buffer[512];

  1189 	package = razor_set_get_package(set, name);

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

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

  1193 	buffer[0] = '\0';

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

  1195 }

  1197 static void

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

  1199 {

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

  1201 	uint32_t *u;

  1202 	char *pool;

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

  1205 	pool = set->string_pool.data;

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

  1208 		if (r->type != RAZOR_PROPERTY_REQUIRES)

  1209 			continue;

  1211 		p = r;

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

  1213 		       p->type == r->type)

  1214 			p++;

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

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

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

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

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

  1221 		 * does.*/

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

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

  1224 			p++;

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

  1227 		 * etc) to properly determine if a requires is

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

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

  1231 		if (p == end ||

  1232 		    p->type != RAZOR_PROPERTY_PROVIDES ||

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

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

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

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

  1237 				continue;

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

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

  1240 		}

  1241 	}

  1242 }

  1244 void

  1245 razor_set_list_unsatisfied(struct razor_set *set)

  1246 {

  1247 	struct array unsatisfied;

  1248 	struct razor_property *properties, *r;

  1249 	uint32_t *u, *end;

  1250 	char *pool;

  1252 	array_init(&unsatisfied);

  1253 	razor_set_validate(set, &unsatisfied);

  1255 	end = unsatisfied.data + unsatisfied.size;

  1256 	properties = set->properties.data;

  1257 	pool = set->string_pool.data;

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

  1260 		r = properties + *u;

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

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

  1263 			       &pool[r->name]);

  1264 		else

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

  1266 			       &pool[r->name],

  1267 			       &pool[r->version]);

  1268 	}

  1270 	array_release(&unsatisfied);

  1271 }

  1273 #define UPSTREAM_SOURCE 0x80

  1275 struct source {

  1276 	struct razor_set *set;

  1277 	uint32_t *property_map;

  1278 	uint32_t *file_map;

  1279 };

  1281 struct razor_merger {

  1282 	struct razor_set *set;

  1283 	struct hashtable table;

  1284 	struct source source1;

  1285 	struct source source2;

  1286 };

  1288 static struct razor_merger *

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

  1290 {

  1291 	struct razor_merger *merger;

  1292 	int count;

  1293 	size_t size;

  1295 	merger = zalloc(sizeof *merger);

  1296 	merger->set = razor_set_create();

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

  1299 	merger->source1.set = set1;

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

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

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

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

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

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

  1307 	merger->source2.set = set2;

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

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

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

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

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

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

  1315 	return merger;

  1316 }

  1318 static void

  1319 add_package(struct razor_merger *merger,

  1320 	    struct razor_package *package, struct source *source,

  1321 	    uint32_t flags)

  1322 {

  1323 	char *pool;

  1324 	struct list *r;

  1325 	struct razor_package *p;

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

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

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

  1330 	p->flags = flags;

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

  1332 					&pool[package->version]);

  1334 	p->properties = package->properties;

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

  1336 	while (r) {

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

  1338 		r = list_next(r);

  1339 	}

  1341 	p->files = package->files;

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

  1343 	while (r) {

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

  1345 		r = list_next(r);

  1346 	}

  1347 }

  1349 static uint32_t

  1350 add_property(struct razor_merger *merger,

  1351 	     const char *name, enum razor_version_relation relation,

  1352 	     const char *version, int type)

  1353 {

  1354 	struct razor_property *p;

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

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

  1358 	p->flags = 0;

  1359 	p->type = type;

  1360 	p->relation = relation;

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

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

  1364 }

  1366 static void

  1367 merge_properties(struct razor_merger *merger)

  1368 {

  1369 	struct razor_property *p1, *p2;

  1370 	struct razor_set *set1, *set2;

  1371 	uint32_t *map1, *map2;

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

  1373 	char *pool1, *pool2;

  1375 	set1 = merger->source1.set;

  1376 	set2 = merger->source2.set;

  1377 	map1 = merger->source1.property_map;

  1378 	map2 = merger->source2.property_map;

  1380 	i = 0;

  1381 	j = 0;

  1382 	pool1 = set1->string_pool.data;

  1383 	pool2 = set2->string_pool.data;

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

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

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

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

  1389 			i++;

  1390 			continue;

  1391 		}

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

  1393 			j++;

  1394 			continue;

  1395 		}

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

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

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

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

  1400 		else if (i < count1)

  1401 			cmp = -1;

  1402 		else

  1403 			cmp = 1;

  1404 		if (cmp == 0)

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

  1406 		if (cmp == 0)

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

  1408 		if (cmp == 0)

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

  1410 					 &pool2[p2->version]);

  1411 		if (cmp < 0) {

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

  1413 						 &pool1[p1->name],

  1414 						 p1->relation,

  1415 						 &pool1[p1->version],

  1416 						 p1->type);

  1417 		} else if (cmp > 0) {

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

  1419 						 &pool2[p2->name],

  1420 						 p2->relation,

  1421 						 &pool2[p2->version],

  1422 						 p2->type);

  1423 		} else  {

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

  1425 							     &pool1[p1->name],

  1426 							     p1->relation,

  1427 							     &pool1[p1->version],

  1428 							     p1->type);

  1429 		}

  1430 	}

  1431 }

  1433 static void

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

  1435 		uint32_t *map, struct array *pool)

  1436 {

  1437 	uint32_t r;

  1438 	struct list *p, *q;

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

  1441 	p = list_first(properties, source_pool);

  1442 	while (p) {

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

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

  1445 		q->flags = p->flags;

  1446 		p = list_next(p);

  1447 	}

  1449 	list_set_ptr(properties, r);

  1450 }

  1452 static uint32_t

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

  1454 {

  1455 	struct razor_entry *e;

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

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

  1459 	e->flags = 0;

  1460 	e->start = 0;

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

  1463 }

  1465 /* FIXME. Blah */

  1466 static int

  1467 fix_file_map(uint32_t *map,

  1468 	     struct razor_entry *files,

  1469 	     struct razor_entry *top)

  1470 {

  1471 	uint32_t e;

  1472 	int found_file = 0;

  1474 	e = top->start;

  1475 	do {

  1476 		if (files[e].start)

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

  1478 		if (map[e])

  1479 			found_file = 1;

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

  1482 	if (found_file)

  1483 		map[top - files] = 1;

  1484 	return found_file;

  1485 }

  1487 struct merge_directory {

  1488 	uint32_t merged, dir1, dir2;

  1489 };

  1491 static void

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

  1493 {

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

  1495 	struct razor_set *set1, *set2;

  1496 	struct array merge_stack;

  1497 	struct merge_directory *child_md, *end_md;

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

  1499 	int cmp;

  1500 	char *pool1, *pool2;

  1502 	set1 = merger->source1.set;

  1503 	set2 = merger->source2.set;

  1504 	map1 = merger->source1.file_map;

  1505 	map2 = merger->source2.file_map;

  1506 	pool1 = set1->string_pool.data;

  1507 	pool2 = set2->string_pool.data;

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

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

  1511 	array_init(&merge_stack);

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

  1514 	last = 0;

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

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

  1517 	while (e1 || e2) {

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

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

  1520 				e1 = NULL;

  1521 			continue;

  1522 		}

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

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

  1525 				e2 = NULL;

  1526 			continue;

  1527 		}

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

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

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

  1531 				e1 = NULL;

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

  1533 				e2 = NULL;

  1534 			continue;

  1535 		}

  1537 		if (!e1)

  1538 			cmp = 1;

  1539 		else if (!e2)

  1540 			cmp = -1;

  1541 		else {

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

  1543 				      &pool2[e2->name]);

  1544 		}

  1546 		if (cmp < 0) {

  1547 			if (map1[e1 - root1]) {

  1548 				map1[e1 - root1] = last =

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

  1550 				if (e1->start) {

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

  1552 					child_md->merged = last;

  1553 					child_md->dir1 = e1->start;

  1554 					child_md->dir2 = 0;

  1555 				}

  1556 			}

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

  1558 				e1 = NULL;

  1559 		} else if (cmp > 0) {

  1560 			if (map2[e2 - root2]) {

  1561 				map2[e2 - root2] = last =

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

  1563 				if (e2->start) {

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

  1565 					child_md->merged = last;

  1566 					child_md->dir1 = 0;

  1567 					child_md->dir2 = e2->start;

  1568 				}

  1569 			}

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

  1571 				e2 = NULL;

  1572 		} else {

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

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

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

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

  1577 				child_md->merged = last;

  1578 				child_md->dir1 = e1->start;

  1579 				child_md->dir2 = e2->start;

  1580 			}

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

  1582 				e1 = NULL;

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

  1584 				e2 = NULL;

  1585 		}

  1586 	}

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

  1589 	if (last) {

  1590 		mroot[last].flags = RAZOR_ENTRY_LAST;

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

  1592 	} else

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

  1595 	end_md = merge_stack.data + merge_stack.size;

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

  1597 		merge_one_directory(merger, child_md);

  1598 	array_release(&merge_stack);

  1599 }

  1601 static void

  1602 merge_files(struct razor_merger *merger)

  1603 {

  1604 	struct razor_entry *root;

  1605 	struct merge_directory md;

  1606 	uint32_t *map1, *map2;

  1608 	map1 = merger->source1.file_map;

  1609 	map2 = merger->source2.file_map;

  1611 	md.merged = 0;

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

  1613 	root->name = hashtable_tokenize(&merger->table, "");

  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 			}

  2296 			/* Oops. We lose */

  2297 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2298 				contradiction = 1;

  2299 		}

  2300 	} else if (old_package) {

  2301 		pool = old_package_set->string_pool.data;

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

  2303 		if (already) {

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

  2305 				/* Already taken care of */

  2306 				return;

  2307 			}

  2308 			/* Oops. We lose */

  2309 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2310 				contradiction = 1;

  2311 		}

  2312 	} else

  2313 		state = RAZOR_PACKAGE_UNSATISFIABLE;

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

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

  2318 	if (new_package) {

  2319 		pool = new_package_set->string_pool.data;

  2320 		tp->new_package = new_package;

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

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

  2324 		pkgs = new_package_set->packages.data;

  2325 	}

  2326 	if (old_package) {

  2327 		pool = old_package_set->string_pool.data;

  2328 		tp->old_package = old_package;

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

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

  2332 		pkgs = old_package_set->packages.data;

  2333 	}

  2335 	tp->state = state;

  2336 	if (state != RAZOR_PACKAGE_INSTALL &&

  2337 	    state != RAZOR_PACKAGE_FORCED_UPDATE &&

  2338 	    state != RAZOR_PACKAGE_REMOVE &&

  2339 	    state != RAZOR_PACKAGE_OBSOLETED)

  2340 		trans->errors++;

  2342 	if (contradiction) {

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

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

  2345 		 */

  2346 		add_transaction_package(trans, new_package, old_package,

  2347 					RAZOR_PACKAGE_CONTRADICTION,

  2348 					NULL, NULL);

  2349 	}

  2351 	if (req_package)

  2352 		tp->dep_package = req_package;

  2353 	if (!req_prop)

  2354 		return;

  2356 	pool = req_set->string_pool.data;

  2357 	pkgs = req_set->packages.data;

  2358 	if (!req_package) {

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

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

  2361 				break;

  2362 		}

  2363 		if (pkg)

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

  2365 	}

  2367 	tp->dep_type = req_prop->type;

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

  2369 	tp->dep_relation = req_prop->relation;

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

  2371 }

  2373 static void

  2374 razor_transaction_satisfy(struct razor_transaction_resolver *trans)

  2375 {

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

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

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

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

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

  2381 	struct list *reqpkg;

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

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

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

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

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

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

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

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

  2392 	sp = sprops;

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

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

  2395 		 * to-be-installed.

  2396 		 */

  2397 		while (up < uprop_end &&

  2398 		       !prop_is_being_installed(trans, up))

  2399 			up++;

  2400 		if (up == uprop_end)

  2401 			break;

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

  2404 		switch (up->type) {

  2405 		case RAZOR_PROPERTY_REQUIRES:

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

  2407 				break;

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

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

  2411 				/* Requires something that is either installed

  2412 				 * or to-be-installed.

  2413 				 */

  2414 				break;

  2415 			}

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

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

  2419 			if (!pkg)

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

  2421 			add_transaction_package(trans, pkg, NULL,

  2422 						RAZOR_PACKAGE_INSTALL,

  2423 						NULL, up);

  2424 			break;

  2426 		case RAZOR_PROPERTY_PROVIDES:

  2427 			/* find_installed_package_for_property works backwards

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

  2429 			 */

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

  2431 			if (!pkg)

  2432 				break;

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

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

  2436 				 * finding an upgrade

  2437 				 */

  2438 				add_transaction_package(trans, NULL, pkg,

  2439 							RAZOR_PACKAGE_FORCED_UPDATE,

  2440 							&spool[pkg->name], sp);

  2441 			} else {

  2442 				add_transaction_package(trans, NULL, pkg,

  2443 							RAZOR_PACKAGE_CONTRADICTION,

  2444 							NULL, up);

  2445 			}

  2446 			break;

  2448 		case RAZOR_PROPERTY_CONFLICTS:

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

  2450 			if (!pkg)

  2451 				break;

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

  2454 				/* Conflicts with something already installed.

  2455 				 * Try to upgrade out.

  2456 				 */

  2457 				add_transaction_package(trans, NULL, pkg,

  2458 							RAZOR_PACKAGE_FORCED_UPDATE,

  2459 							NULL, up);

  2460 			} else {

  2461 				add_transaction_package(trans, pkg, NULL,

  2462 							RAZOR_PACKAGE_CONTRADICTION,

  2463 							NULL, up);

  2464 			}

  2465 			break;

  2467 		case RAZOR_PROPERTY_OBSOLETES:

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

  2469 			if (pkg) {

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

  2471 				 * will add a CONTRADICTION error as well.

  2472 				 */

  2473 				add_transaction_package(trans, NULL, pkg,

  2474 							RAZOR_PACKAGE_OBSOLETED,

  2475 							NULL, up);

  2476 			}

  2477 			break;

  2479 		default:

  2480 			/* can't happen */

  2481 			break;

  2482 		}

  2483 	}

  2485 	up = uprops;

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

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

  2488 		 * to-be-removed.

  2489 		 */

  2490 		while (sp < sprop_end &&

  2491 		       (sp->type != RAZOR_PROPERTY_PROVIDES ||

  2492 			!prop_is_being_removed(trans, sp)))

  2493 			sp++;

  2494 		if (sp == sprop_end)

  2495 			break;

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

  2499 		/* Skip 'up' to match */

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

  2501 		ur = first_up = up;

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

  2504 		 * already be installing an identical PROVIDES, so

  2505 		 * check for that.

  2506 		 */

  2507 		while (up < uprop_end &&

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

  2509 		       (up->type != RAZOR_PROPERTY_PROVIDES ||

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

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

  2512 			up++;

  2513 		if (up < uprop_end &&

  2514 		    up->type == RAZOR_PROPERTY_PROVIDES &&

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

  2516 		    sp->relation == up->relation &&

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

  2518 		    prop_is_being_installed(trans, up)) {

  2519 			up = first_up;

  2520 			continue;

  2521 		}

  2522 		up = first_up;

  2524 		/* For all still-installed packages that require

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

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

  2527 		 * not, either remove or attempt to update the

  2528 		 * package, depending on why the required property has

  2529 		 * disappeared

  2530 		 */

  2531 		sr = sp;

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

  2533 			sr--;

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

  2535 			if (prop_is_being_removed(trans, sr))

  2536 				continue;

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

  2538 				continue;

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

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

  2542 					continue;

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

  2544 				if (prop_is_being_updated(trans, sp)) {

  2545 					add_transaction_package(trans, NULL, pkg,

  2546 								RAZOR_PACKAGE_FORCED_UPDATE,

  2547 								removed_package, NULL);

  2548 				} else {

  2549 					add_transaction_package(trans, NULL, pkg,

  2550 								RAZOR_PACKAGE_REMOVE,

  2551 								removed_package, sr);

  2552 				}

  2553 			}

  2554 		}

  2555 	}

  2556 }

  2558 struct razor_transaction *

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

  2560 			 int update_count, const char **update_packages,

  2561 			 int remove_count, const char **remove_packages)

  2562 {

  2563 	struct razor_transaction_resolver trans;

  2564 	struct razor_transaction *ret_trans;

  2565 	struct razor_transaction_package *tp;

  2566 	int start, end, i;

  2568 	trans.system = system;

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

  2570 	array_init(&trans.packages);

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

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

  2573 	trans.errors = 0;

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

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

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

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

  2579 			tp->name = update_packages[i];

  2580 			tp->state = RAZOR_PACKAGE_INSTALL;

  2581 		}

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

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

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

  2585 			tp->name = remove_packages[i];

  2586 			tp->state = RAZOR_PACKAGE_REMOVE;

  2587 		}

  2588 	} else

  2589 		find_all_packages(&trans);

  2591 	start = 0;

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

  2594 	while (start != end) {

  2595 		resolve_new_packages(&trans, start, end);

  2596 		if (trans.errors)

  2597 			break;

  2599 		razor_transaction_satisfy(&trans);

  2601 		start = end;

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

  2603 	}

  2605 	ret_trans = zalloc(sizeof *ret_trans);

  2606 	ret_trans->system = trans.system;

  2607 	ret_trans->upstream = trans.upstream;

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

  2609 	ret_trans->package_count = end;

  2610 	ret_trans->errors = trans.errors;

  2611 	return ret_trans;

  2612 }

  2614 const char * const razor_version_relations[] = {

  2615 	/* same order as enum razor_version_relation */

  2616 	"<", "<=", "=", ">=", ">"

  2617 };

  2619 const char * const razor_property_types[] = {

  2620 	/* same order as enum razor_property_type */

  2621 	"requires", "provides", "conflicts with", "obsoletes"

  2622 };

  2624 void

  2625 razor_transaction_describe(struct razor_transaction *trans)

  2626 {

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

  2628 	int errors_only = 0;

  2630 	tps = trans->packages;

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

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

  2633 		switch (p->state) {

  2634 		case RAZOR_PACKAGE_INSTALL:

  2635 			if (errors_only)

  2636 				break;

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

  2639 			if (p->dep_package) {

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

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

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

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

  2644 					if (*p->dep_version) {

  2645 						printf(" %s %s",

  2646 						       razor_version_relations[p->dep_relation],

  2647 						       p->dep_version);

  2648 					}

  2649 				} else {

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

  2651 					if (*p->dep_version) {

  2652 						printf(", which %s %s %s %s",

  2653 						       razor_property_types[p->dep_type],

  2654 						       p->dep_property,

  2655 						       razor_version_relations[p->dep_relation],

  2656 						       p->dep_version);

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

  2658 						printf(", which %s %s",

  2659 						       razor_property_types[p->dep_type],

  2660 						       p->dep_property);

  2661 					}

  2662 				}

  2663 			}

  2664 			printf("\n");

  2665 			break;

  2667 		case RAZOR_PACKAGE_FORCED_UPDATE:

  2668 			if (errors_only)

  2669 				break;

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

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

  2673 			break;

  2675 		case RAZOR_PACKAGE_REMOVE:

  2676 			if (errors_only)

  2677 				break;

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

  2679 			if (p->dep_package) {

  2680 				printf(" which required %s",

  2681 				       p->dep_package);

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

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

  2684 			}

  2685 			printf("\n");

  2686 			break;

  2688 		case RAZOR_PACKAGE_OBSOLETED:

  2689 			if (errors_only)

  2690 				break;

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

  2692 			if (p->dep_package) {

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

  2694 				       p->dep_package);

  2695 			}

  2696 			printf("\n");

  2697 			break;

  2699 		case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:

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

  2701 			errors_only = 1;

  2702 			break;

  2704 		case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:

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

  2706 			errors_only = 1;

  2707 			break;

  2709 		case RAZOR_PACKAGE_UP_TO_DATE:

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

  2711 			errors_only = 1;

  2712 			break;

  2714 		case RAZOR_PACKAGE_CONTRADICTION:

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

  2716 			errors_only = 1;

  2717 			break;

  2719 		case RAZOR_PACKAGE_OLD_CONFLICT:

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

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

  2722 			if (*p->dep_version) {

  2723 				printf("%s %s %s",

  2724 				       p->dep_property,

  2725 				       razor_version_relations[p->dep_relation],

  2726 				       p->dep_version);

  2727 			} else

  2728 				printf("it");

  2729 			printf("\n");

  2731 			errors_only = 1;

  2732 			break;

  2734 		case RAZOR_PACKAGE_NEW_CONFLICT:

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

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

  2737 			if (*p->dep_version) {

  2738 				printf(" %s %s",

  2739 				       razor_version_relations[p->dep_relation],

  2740 				       p->dep_version);

  2741 			}

  2742 			printf("\n");

  2744 			errors_only = 1;

  2745 			break;

  2747 		case RAZOR_PACKAGE_UNSATISFIABLE:

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

  2749 			if (*p->dep_version) {

  2750 				printf(" %s %s",

  2751 					razor_version_relations[p->dep_relation],

  2752 					p->dep_version);

  2753 			}

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

  2755 				p->dep_package);

  2756 			errors_only = 1;

  2757 			break;

  2759 		default:

  2760 			/* Shouldn't actually happen */

  2761 			break;

  2762 		}

  2763 	}

  2764 }

  2766 struct razor_set *

  2767 razor_transaction_run(struct razor_transaction *trans)

  2768 {

  2769 	struct array install_packages, remove_packages;

  2770 	struct razor_merger *merger;

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

  2772 	struct source *source1, *source2;

  2773 	char *spool, *ipool, *rpool;

  2774 	uint32_t *map;

  2775 	int p, cmp;

  2777 	/* FIXME */

  2778 	if (trans->errors)

  2779 		return NULL;

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

  2782 	array_init(&install_packages);

  2783 	array_init(&remove_packages);

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

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

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

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

  2788 		} else {

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

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

  2791 		}

  2792 	}

  2793 	map = qsort_with_data(install_packages.data,

  2794 			      install_packages.size / sizeof *pkg,

  2795 			      sizeof *pkg,

  2796 			      compare_packages,

  2797 			      trans->upstream);

  2798 	free(map);

  2799 	map = qsort_with_data(remove_packages.data,

  2800 			      remove_packages.size / sizeof *pkg,

  2801 			      sizeof *pkg,

  2802 			      compare_packages,

  2803 			      trans->system);

  2804 	free(map);

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

  2808 	source1 = &merger->source1;

  2809 	source2 = &merger->source2;

  2811 	i = install_packages.data;

  2812 	iend = install_packages.data + install_packages.size;

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

  2815 	r = remove_packages.data;

  2816 	rend = remove_packages.data + remove_packages.size;

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

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

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

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

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

  2824 		/* Check if s is being removed */

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

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

  2827 			s++;

  2828 			r++;

  2829 			continue;

  2830 		}

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

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

  2834 		else if (s < send)

  2835 			cmp = -1;

  2836 		else

  2837 			cmp = 1;

  2838 		if (cmp < 0) {

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

  2840 			s++;

  2841 		} else if (cmp == 0) {

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

  2843 			s++;

  2844 			i++;

  2845 		} else {

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

  2847 			i++;

  2848 		}

  2849 	}

  2851 	array_release(&install_packages);

  2852 	array_release(&remove_packages);

  2854 	return razor_merger_finish(merger);

  2855 }

  2857 void

  2858 razor_transaction_destroy(struct razor_transaction *trans)

  2859 {

  2860 	int p;

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

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

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

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

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

  2867 	}

  2868 	free(trans);

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

  2871 }

author	Dan Winship <danw@gnome.org>
	Tue Mar 11 17:15:02 2008 -0400 (2008-03-11)
changeset 164	ed154b422dc0
parent 163	978c98ddb8aa
child 165	bf7c5b2484e3
permissions	-rw-r--r--