razor: razor.c@00f19df51272

     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 	uint type  : 2;

    56 	uint32_t relation;

    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 pkgarray, pkgprops;

   757 	uint32_t *req, *req_start, *req_end, *pkg, *pkg_end;

   758 	uint32_t *map, newprop_id, *newprop;

   759 	char *pool;

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

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

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

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

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

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

   768 			      compare_file_requires, pool);

   769 	free(map);

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

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

   773 			continue;

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

   775 		if (entry) {

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

   777 			prop->name = *req;

   778 			prop->type = RAZOR_PROPERTY_PROVIDES;

   779 			prop->relation = RAZOR_VERSION_EQUAL;

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

   782 			/* Copy package list from entry to property */

   783 			array_init(&pkgarray);

   784 			list_to_array(list_first(&entry->packages, &importer->set->package_pool), &pkgarray);

   785 			list_set_array(&prop->packages, &importer->set->package_pool, &pkgarray, 0);

   787 			/* Update property list of each providing package */

   788 			pkg_end = pkgarray.data + pkgarray.size;

   789 			newprop_id = prop - (struct razor_property *)importer->set->properties.data;

   791 			for (pkg = pkgarray.data; pkg < pkg_end; pkg++) {

   792 				array_init(&pkgprops);

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

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

   795 				*newprop = newprop_id;

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

   797 				array_release(&pkgprops);

   798 			}

   799 			array_release(&pkgarray);

   800 		}

   801 	}

   803 	array_release(&importer->file_requires);

   804 }

   806 static void

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

   808 {

   809 	struct razor_package *p, *packages;

   810 	struct array *pkgs;

   811 	struct razor_entry *e, *end;

   812 	struct list *r;

   813 	uint32_t *q;

   814 	int i, count;

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

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

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

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

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

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

   823 		while (r) {

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

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

   826 			r = list_next(r);

   827 		}

   828 	}

   830 	packages = set->packages.data;

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

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

   833 		array_release(&pkgs[i]);

   834 	}

   835 	free(pkgs);

   836 }

   838 struct razor_set *

   839 razor_importer_finish(struct razor_importer *importer)

   840 {

   841 	struct razor_set *set;

   842 	uint32_t *map, *rmap;

   843 	int i, count;

   845 	build_file_tree(importer);

   846 	find_file_provides(importer);

   848 	map = uniqueify_properties(importer->set);

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

   850 	free(map);

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

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

   854 			      count,

   855 			      sizeof(struct razor_package),

   856 			      compare_packages,

   857 			      importer->set);

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

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

   861 		rmap[map[i]] = i;

   862 	free(map);

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

   865 	build_package_file_lists(importer->set, rmap);

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

   867 	free(rmap);

   869 	set = importer->set;

   870 	hashtable_release(&importer->table);

   871 	free(importer);

   873 	return set;

   874 }

   876 struct razor_package_iterator {

   877 	struct razor_set *set;

   878 	struct razor_package *package, *end;

   879 	struct list *index;

   880 };

   882 static struct razor_package_iterator *

   883 razor_package_iterator_create_with_index(struct razor_set *set,

   884 					 struct list *index)

   885 {

   886 	struct razor_package_iterator *pi;

   888 	pi = zalloc(sizeof *pi);

   889 	pi->set = set;

   890 	pi->index = index;

   892 	return pi;

   893 }

   895 struct razor_package_iterator *

   896 razor_package_iterator_create(struct razor_set *set)

   897 {

   898 	struct razor_package_iterator *pi;

   900 	pi = zalloc(sizeof *pi);

   901 	pi->set = set;

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

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

   905 	return pi;

   906 }

   908 struct razor_package_iterator *

   909 razor_package_iterator_create_for_property(struct razor_set *set,

   910 					   struct razor_property *property)

   911 {

   912 	struct list *index;

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

   915 	return razor_package_iterator_create_with_index(set, index);

   916 }

   918 int

   919 razor_package_iterator_next(struct razor_package_iterator *pi,

   920 			    struct razor_package **package,

   921 			    const char **name, const char **version)

   922 {

   923 	char *pool;

   924 	int valid;

   925 	struct razor_package *p, *packages;

   927 	if (pi->package) {

   928 		p = pi->package++;

   929 		valid = p < pi->end;

   930 	} else if (pi->index) {

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

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

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

   934 		valid = 1;

   935 	} else

   936 		valid = 0;

   938 	if (valid) {

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

   940 		*package = p;

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

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

   943 	} else {

   944 		*package = NULL;

   945 	}

   947 	return valid;

   948 }

   950 void

   951 razor_package_iterator_destroy(struct razor_package_iterator *pi)

   952 {

   953 	free(pi);

   954 }

   956 struct razor_package *

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

   958 {

   959 	struct razor_package_iterator *pi;

   960 	struct razor_package *p;

   961 	const char *name, *version;

   963 	pi = razor_package_iterator_create(set);

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

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

   966 			break;

   967 	}

   968 	razor_package_iterator_destroy(pi);

   970 	return p;

   971 }

   973 struct razor_property_iterator {

   974 	struct razor_set *set;

   975 	struct razor_property *property, *end;

   976 	struct list *index;

   977 };

   979 struct razor_property_iterator *

   980 razor_property_iterator_create(struct razor_set *set,

   981 			       struct razor_package *package)

   982 {

   983 	struct razor_property_iterator *pi;

   985 	pi = zalloc(sizeof *pi);

   986 	pi->set = set;

   988 	if (package) {

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

   990 				       &set->property_pool);

   991 	} else {

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

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

   994 	}

   996 	return pi;

   997 }

   999 int

  1000 razor_property_iterator_next(struct razor_property_iterator *pi,

  1001 			     struct razor_property **property,

  1002 			     const char **name,

  1003 			     enum razor_version_relation *relation,

  1004 			     const char **version,

  1005 			     enum razor_property_type *type)

  1006 {

  1007 	char *pool;

  1008 	int valid;

  1009 	struct razor_property *p, *properties;

  1011 	if (pi->property) {

  1012 		p = pi->property++;

  1013 		valid = p < pi->end;

  1014 	} else if (pi->index) {

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

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

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

  1018 		valid = 1;

  1019 	} else

  1020 		valid = 0;

  1022 	if (valid) {

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

  1024 		*property = p;

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

  1026 		*relation = p->relation;

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

  1028 		*type = p->type;

  1029 	} else {

  1030 		*property = NULL;

  1031 	}

  1033 	return valid;

  1034 }

  1036 void

  1037 razor_property_iterator_destroy(struct razor_property_iterator *pi)

  1038 {

  1039 	free(pi);

  1040 }

  1042 static struct razor_entry *

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

  1044 {

  1045 	struct razor_entry *e;

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

  1047 	int len;

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

  1050 	do {

  1051 		n = pool + e->name;

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

  1053 			return e;

  1054 		len = strlen(n);

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

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

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

  1058 		}

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

  1061 	return NULL;

  1062 }

  1064 static void

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

  1066 	 char *prefix, const char *pattern)

  1067 {

  1068 	struct razor_entry *e;

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

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

  1072 	do {

  1073 		n = pool + e->name;

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

  1075 			continue;

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

  1077 		if (e->start) {

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

  1079 			*sub = '/';

  1080 			strcpy (sub + 1, n);

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

  1082 			*sub = '\0';

  1083 		}

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

  1085 }

  1087 void

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

  1089 {

  1090 	struct razor_entry *e;

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

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

  1094 		buffer[0] = '\0';

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

  1096 		return;

  1097 	}

  1099 	strcpy(buffer, pattern);

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

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

  1102 		base = NULL;

  1103 	} else {

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

  1105 		if (p) {

  1106 			*p = '\0';

  1107 			base = p + 1;

  1108 		} else {

  1109 			base = NULL;

  1110 		}

  1111 	}

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

  1113 	if (e->start != 0)

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

  1115 }

  1117 struct razor_package_iterator *

  1118 razor_package_iterator_create_for_file(struct razor_set *set,

  1119 				       const char *filename)

  1120 {

  1121 	struct razor_entry *entry;

  1122 	struct list *index;

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

  1125 	if (entry == NULL)

  1126 		return NULL;

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

  1129 	return razor_package_iterator_create_with_index(set, index);

  1130 }

  1132 static struct list *

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

  1134 		   struct razor_entry *dir, uint32_t end,

  1135 		   char *prefix)

  1136 {

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

  1138 	uint32_t next, file;

  1139 	char *pool;

  1140 	int len;

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

  1143 	pool = set->string_pool.data;

  1145 	e = entries + dir->start;

  1146 	do {

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

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

  1149 			r = list_next(r);

  1150 			if (!r)

  1151 				return NULL;

  1152 			if (r->data >= end)

  1153 				return r;

  1154 		}

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

  1157 	e = entries + dir->start;

  1158 	do {

  1159 		if (e->start == 0)

  1160 			continue;

  1162 		if (e->flags & RAZOR_ENTRY_LAST)

  1163 			next = end;

  1164 		else {

  1165 			f = e + 1;

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

  1167 				f++;

  1168 			if (f->start == 0)

  1169 				next = end;

  1170 			else

  1171 				next = f->start;

  1172 		}

  1174 		file = r->data;

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

  1176 			len = strlen(prefix);

  1177 			prefix[len] = '/';

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

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

  1180 			prefix[len] = '\0';

  1181 		}

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

  1184 	return r;

  1185 }

  1187 void

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

  1189 {

  1190 	struct razor_package *package;

  1191 	struct list *r;

  1192 	uint32_t end;

  1193 	char buffer[512];

  1195 	package = razor_set_get_package(set, name);

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

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

  1199 	buffer[0] = '\0';

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

  1201 }

  1203 static void

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

  1205 {

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

  1207 	uint32_t *u;

  1208 	char *pool;

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

  1211 	pool = set->string_pool.data;

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

  1214 		if (r->type != RAZOR_PROPERTY_REQUIRES)

  1215 			continue;

  1217 		p = r;

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

  1219 		       p->type == r->type)

  1220 			p++;

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

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

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

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

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

  1227 		 * does.*/

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

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

  1230 			p++;

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

  1233 		 * etc) to properly determine if a requires is

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

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

  1237 		if (p == end ||

  1238 		    p->type != RAZOR_PROPERTY_PROVIDES ||

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

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

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

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

  1243 				continue;

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

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

  1246 		}

  1247 	}

  1248 }

  1250 void

  1251 razor_set_list_unsatisfied(struct razor_set *set)

  1252 {

  1253 	struct array unsatisfied;

  1254 	struct razor_property *properties, *r;

  1255 	uint32_t *u, *end;

  1256 	char *pool;

  1258 	array_init(&unsatisfied);

  1259 	razor_set_validate(set, &unsatisfied);

  1261 	end = unsatisfied.data + unsatisfied.size;

  1262 	properties = set->properties.data;

  1263 	pool = set->string_pool.data;

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

  1266 		r = properties + *u;

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

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

  1269 			       &pool[r->name]);

  1270 		else

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

  1272 			       &pool[r->name],

  1273 			       &pool[r->version]);

  1274 	}

  1276 	array_release(&unsatisfied);

  1277 }

  1279 #define UPSTREAM_SOURCE 0x80

  1281 struct source {

  1282 	struct razor_set *set;

  1283 	uint32_t *property_map;

  1284 	uint32_t *file_map;

  1285 };

  1287 struct razor_merger {

  1288 	struct razor_set *set;

  1289 	struct hashtable table;

  1290 	struct source source1;

  1291 	struct source source2;

  1292 };

  1294 static struct razor_merger *

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

  1296 {

  1297 	struct razor_merger *merger;

  1298 	int count;

  1299 	size_t size;

  1301 	merger = zalloc(sizeof *merger);

  1302 	merger->set = razor_set_create();

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

  1305 	merger->source1.set = set1;

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

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

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

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

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

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

  1313 	merger->source2.set = set2;

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

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

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

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

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

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

  1321 	return merger;

  1322 }

  1324 static void

  1325 add_package(struct razor_merger *merger,

  1326 	    struct razor_package *package, struct source *source,

  1327 	    uint32_t flags)

  1328 {

  1329 	char *pool;

  1330 	struct list *r;

  1331 	struct razor_package *p;

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

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

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

  1336 	p->flags = flags;

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

  1338 					&pool[package->version]);

  1340 	p->properties = package->properties;

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

  1342 	while (r) {

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

  1344 		r = list_next(r);

  1345 	}

  1347 	p->files = package->files;

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

  1349 	while (r) {

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

  1351 		r = list_next(r);

  1352 	}

  1353 }

  1355 static uint32_t

  1356 add_property(struct razor_merger *merger,

  1357 	     const char *name, enum razor_version_relation relation,

  1358 	     const char *version, int type)

  1359 {

  1360 	struct razor_property *p;

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

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

  1364 	p->flags = 0;

  1365 	p->type = type;

  1366 	p->relation = relation;

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

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

  1370 }

  1372 static void

  1373 merge_properties(struct razor_merger *merger)

  1374 {

  1375 	struct razor_property *p1, *p2;

  1376 	struct razor_set *set1, *set2;

  1377 	uint32_t *map1, *map2;

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

  1379 	char *pool1, *pool2;

  1381 	set1 = merger->source1.set;

  1382 	set2 = merger->source2.set;

  1383 	map1 = merger->source1.property_map;

  1384 	map2 = merger->source2.property_map;

  1386 	i = 0;

  1387 	j = 0;

  1388 	pool1 = set1->string_pool.data;

  1389 	pool2 = set2->string_pool.data;

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

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

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

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

  1395 			i++;

  1396 			continue;

  1397 		}

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

  1399 			j++;

  1400 			continue;

  1401 		}

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

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

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

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

  1406 		else if (i < count1)

  1407 			cmp = -1;

  1408 		else

  1409 			cmp = 1;

  1410 		if (cmp == 0)

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

  1412 		if (cmp == 0)

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

  1414 		if (cmp == 0)

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

  1416 					 &pool2[p2->version]);

  1417 		if (cmp < 0) {

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

  1419 						 &pool1[p1->name],

  1420 						 p1->relation,

  1421 						 &pool1[p1->version],

  1422 						 p1->type);

  1423 		} else if (cmp > 0) {

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

  1425 						 &pool2[p2->name],

  1426 						 p2->relation,

  1427 						 &pool2[p2->version],

  1428 						 p2->type);

  1429 		} else  {

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

  1431 							     &pool1[p1->name],

  1432 							     p1->relation,

  1433 							     &pool1[p1->version],

  1434 							     p1->type);

  1435 		}

  1436 	}

  1437 }

  1439 static void

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

  1441 		uint32_t *map, struct array *pool)

  1442 {

  1443 	uint32_t r;

  1444 	struct list *p, *q;

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

  1447 	p = list_first(properties, source_pool);

  1448 	while (p) {

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

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

  1451 		q->flags = p->flags;

  1452 		p = list_next(p);

  1453 	}

  1455 	list_set_ptr(properties, r);

  1456 }

  1458 static uint32_t

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

  1460 {

  1461 	struct razor_entry *e;

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

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

  1465 	e->flags = 0;

  1466 	e->start = 0;

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

  1469 }

  1471 /* FIXME. Blah */

  1472 static int

  1473 fix_file_map(uint32_t *map,

  1474 	     struct razor_entry *files,

  1475 	     struct razor_entry *top)

  1476 {

  1477 	uint32_t e;

  1478 	int found_file = 0;

  1480 	e = top->start;

  1481 	do {

  1482 		if (files[e].start)

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

  1484 		if (map[e])

  1485 			found_file = 1;

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

  1488 	if (found_file)

  1489 		map[top - files] = 1;

  1490 	return found_file;

  1491 }

  1493 struct merge_directory {

  1494 	uint32_t merged, dir1, dir2;

  1495 };

  1497 static void

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

  1499 {

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

  1501 	struct razor_set *set1, *set2;

  1502 	struct array merge_stack;

  1503 	struct merge_directory *child_md, *end_md;

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

  1505 	int cmp;

  1506 	char *pool1, *pool2;

  1508 	set1 = merger->source1.set;

  1509 	set2 = merger->source2.set;

  1510 	map1 = merger->source1.file_map;

  1511 	map2 = merger->source2.file_map;

  1512 	pool1 = set1->string_pool.data;

  1513 	pool2 = set2->string_pool.data;

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

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

  1517 	array_init(&merge_stack);

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

  1520 	last = 0;

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

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

  1523 	while (e1 || e2) {

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

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

  1526 				e1 = NULL;

  1527 			continue;

  1528 		}

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

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

  1531 				e2 = NULL;

  1532 			continue;

  1533 		}

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

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

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

  1537 				e1 = NULL;

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

  1539 				e2 = NULL;

  1540 			continue;

  1541 		}

  1543 		if (!e1)

  1544 			cmp = 1;

  1545 		else if (!e2)

  1546 			cmp = -1;

  1547 		else {

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

  1549 				      &pool2[e2->name]);

  1550 		}

  1552 		if (cmp < 0) {

  1553 			if (map1[e1 - root1]) {

  1554 				map1[e1 - root1] = last =

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

  1556 				if (e1->start) {

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

  1558 					child_md->merged = last;

  1559 					child_md->dir1 = e1->start;

  1560 					child_md->dir2 = 0;

  1561 				}

  1562 			}

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

  1564 				e1 = NULL;

  1565 		} else if (cmp > 0) {

  1566 			if (map2[e2 - root2]) {

  1567 				map2[e2 - root2] = last =

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

  1569 				if (e2->start) {

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

  1571 					child_md->merged = last;

  1572 					child_md->dir1 = 0;

  1573 					child_md->dir2 = e2->start;

  1574 				}

  1575 			}

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

  1577 				e2 = NULL;

  1578 		} else {

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

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

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

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

  1583 				child_md->merged = last;

  1584 				child_md->dir1 = e1->start;

  1585 				child_md->dir2 = e2->start;

  1586 			}

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

  1588 				e1 = NULL;

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

  1590 				e2 = NULL;

  1591 		}

  1592 	}

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

  1595 	if (last) {

  1596 		mroot[last].flags = RAZOR_ENTRY_LAST;

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

  1598 	} else

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

  1601 	end_md = merge_stack.data + merge_stack.size;

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

  1603 		merge_one_directory(merger, child_md);

  1604 	array_release(&merge_stack);

  1605 }

  1607 static void

  1608 merge_files(struct razor_merger *merger)

  1609 {

  1610 	struct razor_entry *root;

  1611 	struct merge_directory md;

  1612 	uint32_t *map1, *map2;

  1614 	map1 = merger->source1.file_map;

  1615 	map2 = merger->source2.file_map;

  1617 	md.merged = add_file(merger, "");

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

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

  1621 		if (root->start)

  1622 			fix_file_map(map1, root, root);

  1623 		md.dir1 = root->start;

  1624 	} else

  1625 		md.dir1 = 0;

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

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

  1629 		if (root->start)

  1630 			fix_file_map(map2, root, root);

  1631 		md.dir2 = root->start;

  1632 	} else

  1633 		md.dir2 = 0;

  1635 	merge_one_directory(merger, &md);

  1636 }

  1638 static void

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

  1640 	   uint32_t *map, struct array *pool)

  1641 {

  1642 	uint32_t r;

  1643 	struct list *p, *q;

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

  1646 	p = list_first(files, source_pool);

  1647 	while (p) {

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

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

  1650 		q->flags = p->flags;

  1651 		p = list_next(p);

  1652 	}

  1654 	list_set_ptr(files, r);

  1655 }

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

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

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

  1660  * the arrays for their properties. */

  1661 static void

  1662 rebuild_property_package_lists(struct razor_set *set)

  1663 {

  1664 	struct array *pkgs, *a;

  1665 	struct razor_package *pkg, *pkg_end;

  1666 	struct razor_property *prop, *prop_end;

  1667 	struct list *r;

  1668 	uint32_t *q;

  1669 	int count;

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

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

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

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

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

  1677 		while (r) {

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

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

  1680 			r = list_next(r);

  1681 		}

  1682 	}

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

  1685 	a = pkgs;

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

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

  1688 		array_release(a);

  1689 	}

  1690 	free(pkgs);

  1691 }

  1693 static void

  1694 rebuild_file_package_lists(struct razor_set *set)

  1695 {

  1696 	struct array *pkgs, *a;

  1697 	struct razor_package *pkg, *pkg_end;

  1698 	struct razor_entry *entry, *entry_end;

  1699 	struct list *r;

  1700 	uint32_t *q;

  1701 	int count;

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

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

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

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

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

  1709 		while (r) {

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

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

  1712 			r = list_next(r);

  1713 		}

  1714 	}

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

  1717 	a = pkgs;

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

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

  1720 		array_release(a);

  1721 	}

  1722 	free(pkgs);

  1723 }

  1725 static struct razor_set *

  1726 razor_merger_finish(struct razor_merger *merger)

  1727 {

  1728 	struct razor_set *result;

  1729 	struct razor_package *p, *pend;

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

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

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

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

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

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

  1737 	 * property list for both sets. */

  1739 	merge_properties(merger);

  1740 	merge_files(merger);

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

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

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

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

  1747 		struct source *src;

  1749 		if (p->flags & UPSTREAM_SOURCE)

  1750 			src = &merger->source2;

  1751 		else

  1752 			src = &merger->source1;

  1754 		emit_properties(&p->properties,

  1755 				&src->set->property_pool,

  1756 				src->property_map,

  1757 				&merger->set->property_pool);

  1758 		emit_files(&p->files,

  1759 			   &src->set->file_pool,

  1760 			   src->file_map,

  1761 			   &merger->set->file_pool);

  1762 		p->flags &= ~UPSTREAM_SOURCE;

  1763 	}

  1765 	rebuild_property_package_lists(merger->set);

  1766 	rebuild_file_package_lists(merger->set);

  1768 	result = merger->set;

  1769 	hashtable_release(&merger->table);

  1770 	free(merger);

  1772 	return result;

  1773 }

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

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

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

  1778  **/

  1780 void

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

  1782 	       razor_package_callback_t callback, void *data)

  1783 {

  1784 	struct razor_package_iterator *pi1, *pi2;

  1785 	struct razor_package *p1, *p2;

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

  1787 	int res;

  1789 	pi1 = razor_package_iterator_create(set);

  1790 	pi2 = razor_package_iterator_create(upstream);

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

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

  1795 	while (p1 || p2) {

  1796 		if (p1 && p2) {

  1797 			res = strcmp(name1, name2);

  1798 			if (res == 0)

  1799 				res = versioncmp(version1, version2);

  1800 		} else {

  1801 			res = 0;

  1802 		}

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

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

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

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

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

  1810 			razor_package_iterator_next(pi1, &p1,

  1811 						    &name1, &version1);

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

  1813 			razor_package_iterator_next(pi2, &p2,

  1814 						    &name2, &version2);

  1815 	}

  1817 	razor_package_iterator_destroy(pi1);

  1818 	razor_package_iterator_destroy(pi2);

  1819 }

  1822 struct razor_transaction_resolver {

  1823 	struct razor_set *system, *upstream;

  1824 	struct bitarray syspkgs, uppkgs;

  1825 	struct array packages;

  1826 	int errors;

  1827 };

  1829 static int

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

  1831 {

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

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

  1834 }

  1836 static int

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

  1838 {

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

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

  1841 }

  1843 static int

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

  1845 {

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

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

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

  1850 		return 1;

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

  1852 		return -1;

  1853 	else

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

  1855 }

  1857 static void

  1858 resolve_new_packages(struct razor_transaction_resolver *trans,

  1859 		     int start, int end)

  1860 {

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

  1862 	struct razor_transaction_package **packages;

  1863 	const char *spool, *upool;

  1864 	int i;

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

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

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

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

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

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

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

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

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

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

  1877 	      compare_transaction_packages);

  1879 	sp = spkgs;

  1880 	up = upkgs;

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

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

  1883 			continue;

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

  1885 			sp++;

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

  1887 			up++;

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

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

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

  1892 				packages[i]->old_package = sp;

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

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

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

  1896 			} else {

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

  1898 				packages[i]->state = RAZOR_PACKAGE_REMOVE_NOT_INSTALLED;

  1899 				trans->errors++;

  1900 			}

  1901 		} else {

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

  1903 				packages[i]->new_package = up;

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

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

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

  1907 					packages[i]->old_package = sp;

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

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

  1910 						packages[i]->state = RAZOR_PACKAGE_UP_TO_DATE;

  1911 						trans->errors++;

  1912 						continue;

  1913 					}

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

  1915 				}

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

  1917 			} else {

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

  1919 				packages[i]->state = RAZOR_PACKAGE_INSTALL_UNAVAILABLE;

  1920 				trans->errors++;

  1921 			}

  1922 		}

  1923 	}

  1924 }

  1926 static void

  1927 find_all_packages(struct razor_transaction_resolver *trans)

  1928 {

  1929 	struct razor_transaction_package *tp;

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

  1931 	const char *spool, *upool;

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

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

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

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

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

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

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

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

  1942 			up++;

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

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

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

  1946 			tp->old_package = sp;

  1947 			tp->new_package = up;

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

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

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

  1951 			tp->state = RAZOR_PACKAGE_INSTALL;

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

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

  1954 		}

  1955 	}

  1956 }

  1958 static int

  1959 provider_satisfies_requirement(struct razor_property *provider,

  1960 			       const char *provider_strings,

  1961 			       struct razor_property *requirement,

  1962 			       const char *requirement_strings)

  1963 {

  1964 	int cmp, len;

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

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

  1968 	if (!*required)

  1969 		return 1;

  1971 	cmp = versioncmp(provided, required);

  1973 	switch (requirement->relation) {

  1974 	case RAZOR_VERSION_LESS:

  1975 		return cmp < 0;

  1977 	case RAZOR_VERSION_LESS_OR_EQUAL:

  1978 		if (cmp <= 0)

  1979 			return 1;

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

  1982 	case RAZOR_VERSION_EQUAL:

  1983 		if (cmp == 0)

  1984 			return 1;

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

  1987 		len = strlen(required);

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

  1989 			return 1;

  1990 		return 0;

  1992 	case RAZOR_VERSION_GREATER_OR_EQUAL:

  1993 		return cmp >= 0;

  1995 	case RAZOR_VERSION_GREATER:

  1996 		return cmp > 0;

  1997 	}

  1999 	/* shouldn't happen */

  2000 	return 0;

  2001 }

  2003 static struct razor_package *

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

  2005 		      const char *filename, int installed)

  2006 {

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

  2008 	struct razor_entry *entry;

  2009 	struct list *p;

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

  2012 		return 0;

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

  2015 	if (!entry)

  2016 		return 0;

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

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

  2020 			return &pkgs[p->data];

  2021 	}

  2022 	return NULL;

  2023 }

  2025 static struct razor_package *

  2026 find_installed_package_for_file(struct razor_transaction_resolver *trans,

  2027 				const char *filename)

  2028 {

  2029 	struct razor_package *pkg;

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

  2032 				    filename, 1);

  2033 	if (!pkg)

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

  2035 					    filename, 1);

  2036 	return pkg;

  2037 }

  2039 static struct razor_package *

  2040 find_uninstalled_package_for_file(struct razor_transaction_resolver *trans,

  2041 				  const char *filename)

  2042 {

  2043 	struct razor_package *pkg;

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

  2046 				    filename, 0);

  2047 	if (!pkg)

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

  2049 					    filename, 0);

  2050 	return pkg;

  2051 }

  2053 static struct razor_property *

  2054 skip_to_matching_property(struct razor_transaction_resolver *trans,

  2055 			  struct razor_property *match,

  2056 			  struct razor_property *prop)

  2057 {

  2058 	struct razor_set *mset, *pset;

  2059 	const char *ppool, *mpool;

  2060 	struct razor_property *prop_end;

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

  2063 		mset = trans->system;

  2064 	else

  2065 		mset = trans->upstream;

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

  2068 		pset = trans->system;

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

  2070 		pset = trans->upstream;

  2071 	else

  2072 		return prop;

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

  2075 	ppool = pset->string_pool.data;

  2076 	mpool = mset->string_pool.data;

  2078 	while (prop < prop_end &&

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

  2080 		prop++;

  2081 	return prop;

  2082 }

  2084 static struct razor_package *

  2085 find_package_matching(struct razor_transaction_resolver *trans, int installed,

  2086 		      struct razor_property *prop,

  2087 		      struct razor_property *req,

  2088 		      struct razor_set *req_set)

  2089 {

  2090 	struct razor_set *set;

  2091 	struct bitarray *pkgbits;

  2092 	struct razor_package *pkgs;

  2093 	struct razor_property *props, *prop_end;

  2094 	enum razor_property_type match_type;

  2095 	const char *pool;

  2096 	const char *rpool;

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

  2098 	int match;

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

  2101 		set = trans->system;

  2102 		pkgbits = &trans->syspkgs;

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

  2104 		set = trans->upstream;

  2105 		pkgbits = &trans->uppkgs;

  2106 	} else

  2107 		return NULL;

  2109 	if (!req_set) {

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

  2111 			req_set = trans->system;

  2112 		else

  2113 			req_set = trans->upstream;

  2114 	}

  2115 	rpool = req_set->string_pool.data;

  2117 	if (req->type == RAZOR_PROPERTY_PROVIDES)

  2118 		match_type = RAZOR_PROPERTY_CONFLICTS;

  2119 	else

  2120 		match_type = RAZOR_PROPERTY_PROVIDES;

  2122 	pkgs = set->packages.data;

  2123 	props = set->properties.data;

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

  2125 	pool = set->string_pool.data;

  2127 	/* Find first matching property */

  2128 	while (prop < prop_end &&

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

  2130 		prop++;

  2131 	if (prop == prop_end ||

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

  2133 		return NULL;

  2135 	if (prop->type < match_type) {

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

  2137 			prop++;

  2138 	} else {

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

  2140 			prop--;

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

  2142 			prop--;

  2143 	}

  2145 	/* Scan matching properties */

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

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

  2148 		if (match_type == RAZOR_PROPERTY_PROVIDES)

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

  2150 		else

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

  2152 		if (match) {

  2153 			struct list *pkg;

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

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

  2157 					continue;

  2158 				if (!match_name ||

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

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

  2161 					return &pkgs[pkg->data];

  2162 			}

  2163 		}

  2164 		prop++;

  2165 	}

  2167 	return NULL;

  2168 }

  2170 static struct razor_package *

  2171 find_installed_package_for_property(struct razor_transaction_resolver *trans,

  2172 				    struct razor_property *sys_start,

  2173 				    struct razor_property *up_start,

  2174 				    struct razor_property *req)

  2175 {

  2176 	struct razor_package *pkg;

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

  2179 	if (!pkg)

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

  2181 	return pkg;

  2182 }

  2184 static struct razor_package *

  2185 find_uninstalled_package_for_property(struct razor_transaction_resolver *trans,

  2186 				      struct razor_property *sys_start,

  2187 				      struct razor_property *up_start,

  2188 				      struct razor_property *req)

  2189 {

  2190 	struct razor_package *pkg;

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

  2193 	if (!pkg)

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

  2195 	return pkg;

  2196 }

  2198 static struct razor_transaction_package *

  2199 find_transaction_package(struct razor_transaction_resolver *trans,

  2200 			 const char *name)

  2201 {

  2202 	struct razor_transaction_package *packages;

  2203 	int count, i;

  2205 	packages = trans->packages.data;

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

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

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

  2209 			return &packages[i];

  2210 	}

  2211 	return NULL;

  2212 }

  2214 /* FIXME? */

  2215 static int

  2216 prop_is_being_installed(struct razor_transaction_resolver *trans,

  2217 			struct razor_property *prop)

  2218 {

  2219 	struct list *pkg;

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

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

  2223 			return 1;

  2224 	}

  2225 	return 0;

  2226 }

  2228 static int

  2229 prop_is_being_removed(struct razor_transaction_resolver *trans,

  2230 		      struct razor_property *prop)

  2231 {

  2232 	struct list *pkg;

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

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

  2236 			return 0;

  2237 	}

  2238 	return 1;

  2239 }

  2241 static int

  2242 prop_is_being_updated(struct razor_transaction_resolver *trans,

  2243 		      struct razor_property *prop)

  2244 {

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

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

  2247 	struct razor_transaction_package *tp;

  2248 	struct list *pkg;

  2250 	/* Assumes prop_is_being_removed returns true */

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

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

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

  2255 			return 0;

  2256 	}

  2257 	return 1;

  2258 }

  2260 static void

  2261 add_transaction_package(struct razor_transaction_resolver *trans,

  2262 			struct razor_package *new_package,

  2263 			struct razor_package *old_package,

  2264 			enum razor_transaction_package_state state,

  2265 			const char *req_package,

  2266 			struct razor_property *req_prop)

  2267 {

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

  2269 	struct bitarray *reqpkgbits;

  2270 	struct razor_transaction_package *tp, *already;

  2271 	const char *pool;

  2272 	struct razor_package *pkgs;

  2273 	struct list *pkg;

  2274 	int contradiction = 0;

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

  2277 		new_package_set = trans->system;

  2278 	else

  2279 		new_package_set = trans->upstream;

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

  2281 		old_package_set = trans->system;

  2282 	else

  2283 		old_package_set = trans->upstream;

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

  2285 		req_set = trans->system;

  2286 		reqpkgbits = &trans->syspkgs;

  2287 	} else {

  2288 		req_set = trans->upstream;

  2289 		reqpkgbits = &trans->uppkgs;

  2290 	}

  2292 	if (new_package) {

  2293 		pool = new_package_set->string_pool.data;

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

  2295 		if (already) {

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

  2297 				/* Already taken care of */

  2298 				return;

  2299 			}

  2300 			/* Oops. We lose */

  2301 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2302 				contradiction = 1;

  2303 		}

  2304 	} else if (old_package) {

  2305 		pool = old_package_set->string_pool.data;

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

  2307 		if (already) {

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

  2309 				/* Already taken care of */

  2310 				return;

  2311 			}

  2312 			/* Oops. We lose */

  2313 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2314 				contradiction = 1;

  2315 		}

  2316 	} else

  2317 		state = RAZOR_PACKAGE_UNSATISFIABLE;

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

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

  2322 	if (new_package) {

  2323 		pool = new_package_set->string_pool.data;

  2324 		tp->new_package = new_package;

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

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

  2328 		pkgs = new_package_set->packages.data;

  2329 	}

  2330 	if (old_package) {

  2331 		pool = old_package_set->string_pool.data;

  2332 		tp->old_package = old_package;

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

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

  2336 		pkgs = old_package_set->packages.data;

  2337 	}

  2339 	tp->state = state;

  2340 	if (state != RAZOR_PACKAGE_INSTALL &&

  2341 	    state != RAZOR_PACKAGE_FORCED_UPDATE &&

  2342 	    state != RAZOR_PACKAGE_REMOVE &&

  2343 	    state != RAZOR_PACKAGE_OBSOLETED)

  2344 		trans->errors++;

  2346 	if (contradiction) {

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

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

  2349 		 */

  2350 		add_transaction_package(trans, new_package, old_package,

  2351 					RAZOR_PACKAGE_CONTRADICTION,

  2352 					NULL, NULL);

  2353 	}

  2355 	if (req_package)

  2356 		tp->dep_package = req_package;

  2357 	if (!req_prop)

  2358 		return;

  2360 	pool = req_set->string_pool.data;

  2361 	pkgs = req_set->packages.data;

  2362 	if (!req_package) {

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

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

  2365 				break;

  2366 		}

  2367 		if (pkg)

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

  2369 	}

  2371 	tp->dep_type = req_prop->type;

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

  2373 	tp->dep_relation = req_prop->relation;

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

  2375 }

  2377 static void

  2378 razor_transaction_satisfy(struct razor_transaction_resolver *trans)

  2379 {

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

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

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

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

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

  2385 	struct list *reqpkg;

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

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

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

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

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

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

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

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

  2396 	sp = sprops;

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

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

  2399 		 * to-be-installed.

  2400 		 */

  2401 		while (up < uprop_end &&

  2402 		       !prop_is_being_installed(trans, up))

  2403 			up++;

  2404 		if (up == uprop_end)

  2405 			break;

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

  2408 		switch (up->type) {

  2409 		case RAZOR_PROPERTY_REQUIRES:

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

  2411 				break;

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

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

  2415 				/* Requires something that is either installed

  2416 				 * or to-be-installed.

  2417 				 */

  2418 				break;

  2419 			}

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

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

  2423 			if (!pkg)

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

  2425 			add_transaction_package(trans, pkg, NULL,

  2426 						RAZOR_PACKAGE_INSTALL,

  2427 						NULL, up);

  2428 			break;

  2430 		case RAZOR_PROPERTY_PROVIDES:

  2431 			/* find_installed_package_for_property works backwards

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

  2433 			 */

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

  2435 			if (!pkg)

  2436 				break;

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

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

  2440 				 * finding an upgrade

  2441 				 */

  2442 				add_transaction_package(trans, NULL, pkg,

  2443 							RAZOR_PACKAGE_FORCED_UPDATE,

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

  2445 			} else {

  2446 				add_transaction_package(trans, NULL, pkg,

  2447 							RAZOR_PACKAGE_CONTRADICTION,

  2448 							NULL, up);

  2449 			}

  2450 			break;

  2452 		case RAZOR_PROPERTY_CONFLICTS:

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

  2454 			if (!pkg)

  2455 				break;

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

  2458 				/* Conflicts with something already installed.

  2459 				 * Try to upgrade out.

  2460 				 */

  2461 				add_transaction_package(trans, NULL, pkg,

  2462 							RAZOR_PACKAGE_FORCED_UPDATE,

  2463 							NULL, up);

  2464 			} else {

  2465 				add_transaction_package(trans, pkg, NULL,

  2466 							RAZOR_PACKAGE_CONTRADICTION,

  2467 							NULL, up);

  2468 			}

  2469 			break;

  2471 		case RAZOR_PROPERTY_OBSOLETES:

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

  2473 			if (pkg) {

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

  2475 				 * will add a CONTRADICTION error as well.

  2476 				 */

  2477 				add_transaction_package(trans, NULL, pkg,

  2478 							RAZOR_PACKAGE_OBSOLETED,

  2479 							NULL, up);

  2480 			}

  2481 			break;

  2483 		default:

  2484 			/* can't happen */

  2485 			break;

  2486 		}

  2487 	}

  2489 	up = uprops;

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

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

  2492 		 * to-be-removed.

  2493 		 */

  2494 		while (sp < sprop_end &&

  2495 		       (sp->type != RAZOR_PROPERTY_PROVIDES ||

  2496 			!prop_is_being_removed(trans, sp)))

  2497 			sp++;

  2498 		if (sp == sprop_end)

  2499 			break;

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

  2503 		/* Skip 'up' to match */

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

  2505 		ur = first_up = up;

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

  2508 		 * already be installing an identical PROVIDES, so

  2509 		 * check for that.

  2510 		 */

  2511 		while (up < uprop_end &&

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

  2513 		       (up->type != RAZOR_PROPERTY_PROVIDES ||

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

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

  2516 			up++;

  2517 		if (up < uprop_end &&

  2518 		    up->type == RAZOR_PROPERTY_PROVIDES &&

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

  2520 		    sp->relation == up->relation &&

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

  2522 		    prop_is_being_installed(trans, up)) {

  2523 			up = first_up;

  2524 			continue;

  2525 		}

  2526 		up = first_up;

  2528 		/* For all still-installed packages that require

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

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

  2531 		 * not, either remove or attempt to update the

  2532 		 * package, depending on why the required property has

  2533 		 * disappeared

  2534 		 */

  2535 		sr = sp;

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

  2537 			sr--;

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

  2539 			if (prop_is_being_removed(trans, sr))

  2540 				continue;

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

  2542 				continue;

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

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

  2546 					continue;

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

  2548 				if (prop_is_being_updated(trans, sp)) {

  2549 					add_transaction_package(trans, NULL, pkg,

  2550 								RAZOR_PACKAGE_FORCED_UPDATE,

  2551 								removed_package, NULL);

  2552 				} else {

  2553 					add_transaction_package(trans, NULL, pkg,

  2554 								RAZOR_PACKAGE_REMOVE,

  2555 								removed_package, sr);

  2556 				}

  2557 			}

  2558 		}

  2559 	}

  2560 }

  2562 struct razor_transaction *

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

  2564 			 int update_count, const char **update_packages,

  2565 			 int remove_count, const char **remove_packages)

  2566 {

  2567 	struct razor_transaction_resolver trans;

  2568 	struct razor_transaction *ret_trans;

  2569 	struct razor_transaction_package *tp;

  2570 	int start, end, i;

  2572 	trans.system = system;

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

  2574 	array_init(&trans.packages);

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

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

  2577 	trans.errors = 0;

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

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

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

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

  2583 			tp->name = update_packages[i];

  2584 			tp->state = RAZOR_PACKAGE_INSTALL;

  2585 		}

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

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

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

  2589 			tp->name = remove_packages[i];

  2590 			tp->state = RAZOR_PACKAGE_REMOVE;

  2591 		}

  2592 	} else

  2593 		find_all_packages(&trans);

  2595 	start = 0;

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

  2598 	while (start != end) {

  2599 		resolve_new_packages(&trans, start, end);

  2600 		if (trans.errors)

  2601 			break;

  2603 		razor_transaction_satisfy(&trans);

  2605 		start = end;

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

  2607 	}

  2609 	ret_trans = zalloc(sizeof *ret_trans);

  2610 	ret_trans->system = trans.system;

  2611 	ret_trans->upstream = trans.upstream;

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

  2613 	ret_trans->package_count = end;

  2614 	ret_trans->errors = trans.errors;

  2615 	return ret_trans;

  2616 }

  2618 const char * const razor_version_relations[] = {

  2619 	/* same order as enum razor_version_relation */

  2620 	"<", "<=", "=", ">=", ">"

  2621 };

  2623 const char * const razor_property_types[] = {

  2624 	/* same order as enum razor_property_type */

  2625 	"requires", "provides", "conflicts with", "obsoletes"

  2626 };

  2628 void

  2629 razor_transaction_describe(struct razor_transaction *trans)

  2630 {

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

  2632 	int errors_only = 0;

  2634 	tps = trans->packages;

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

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

  2637 		switch (p->state) {

  2638 		case RAZOR_PACKAGE_INSTALL:

  2639 			if (errors_only)

  2640 				break;

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

  2643 			if (p->dep_package) {

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

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

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

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

  2648 					if (*p->dep_version) {

  2649 						printf(" %s %s",

  2650 						       razor_version_relations[p->dep_relation],

  2651 						       p->dep_version);

  2652 					}

  2653 				} else {

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

  2655 					if (*p->dep_version) {

  2656 						printf(", which %s %s %s %s",

  2657 						       razor_property_types[p->dep_type],

  2658 						       p->dep_property,

  2659 						       razor_version_relations[p->dep_relation],

  2660 						       p->dep_version);

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

  2662 						printf(", which %s %s",

  2663 						       razor_property_types[p->dep_type],

  2664 						       p->dep_property);

  2665 					}

  2666 				}

  2667 			}

  2668 			printf("\n");

  2669 			break;

  2671 		case RAZOR_PACKAGE_FORCED_UPDATE:

  2672 			if (errors_only)

  2673 				break;

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

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

  2677 			break;

  2679 		case RAZOR_PACKAGE_REMOVE:

  2680 			if (errors_only)

  2681 				break;

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

  2683 			if (p->dep_package) {

  2684 				printf(" which required %s",

  2685 				       p->dep_package);

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

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

  2688 			}

  2689 			printf("\n");

  2690 			break;

  2692 		case RAZOR_PACKAGE_OBSOLETED:

  2693 			if (errors_only)

  2694 				break;

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

  2696 			if (p->dep_package) {

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

  2698 				       p->dep_package);

  2699 			}

  2700 			printf("\n");

  2701 			break;

  2703 		case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:

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

  2705 			errors_only = 1;

  2706 			break;

  2708 		case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:

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

  2710 			errors_only = 1;

  2711 			break;

  2713 		case RAZOR_PACKAGE_UP_TO_DATE:

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

  2715 			errors_only = 1;

  2716 			break;

  2718 		case RAZOR_PACKAGE_CONTRADICTION:

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

  2720 			errors_only = 1;

  2721 			break;

  2723 		case RAZOR_PACKAGE_OLD_CONFLICT:

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

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

  2726 			if (*p->dep_version) {

  2727 				printf("%s %s %s",

  2728 				       p->dep_property,

  2729 				       razor_version_relations[p->dep_relation],

  2730 				       p->dep_version);

  2731 			} else

  2732 				printf("it");

  2733 			printf("\n");

  2735 			errors_only = 1;

  2736 			break;

  2738 		case RAZOR_PACKAGE_NEW_CONFLICT:

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

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

  2741 			if (*p->dep_version) {

  2742 				printf(" %s %s",

  2743 				       razor_version_relations[p->dep_relation],

  2744 				       p->dep_version);

  2745 			}

  2746 			printf("\n");

  2748 			errors_only = 1;

  2749 			break;

  2751 		case RAZOR_PACKAGE_UNSATISFIABLE:

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

  2753 			if (*p->dep_version) {

  2754 				printf(" %s %s",

  2755 					razor_version_relations[p->dep_relation],

  2756 					p->dep_version);

  2757 			}

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

  2759 				p->dep_package);

  2760 			errors_only = 1;

  2761 			break;

  2763 		default:

  2764 			/* Shouldn't actually happen */

  2765 			break;

  2766 		}

  2767 	}

  2768 }

  2770 struct razor_set *

  2771 razor_transaction_run(struct razor_transaction *trans)

  2772 {

  2773 	struct array install_packages, remove_packages;

  2774 	struct razor_merger *merger;

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

  2776 	struct source *source1, *source2;

  2777 	char *spool, *ipool, *rpool;

  2778 	uint32_t *map;

  2779 	int p, cmp;

  2781 	/* FIXME */

  2782 	if (trans->errors)

  2783 		return NULL;

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

  2786 	array_init(&install_packages);

  2787 	array_init(&remove_packages);

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

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

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

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

  2792 		} else {

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

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

  2795 		}

  2796 	}

  2797 	map = qsort_with_data(install_packages.data,

  2798 			      install_packages.size / sizeof *pkg,

  2799 			      sizeof *pkg,

  2800 			      compare_packages,

  2801 			      trans->upstream);

  2802 	free(map);

  2803 	map = qsort_with_data(remove_packages.data,

  2804 			      remove_packages.size / sizeof *pkg,

  2805 			      sizeof *pkg,

  2806 			      compare_packages,

  2807 			      trans->system);

  2808 	free(map);

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

  2812 	source1 = &merger->source1;

  2813 	source2 = &merger->source2;

  2815 	i = install_packages.data;

  2816 	iend = install_packages.data + install_packages.size;

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

  2819 	r = remove_packages.data;

  2820 	rend = remove_packages.data + remove_packages.size;

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

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

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

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

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

  2828 		/* Check if s is being removed */

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

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

  2831 			s++;

  2832 			r++;

  2833 			continue;

  2834 		}

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

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

  2838 		else if (s < send)

  2839 			cmp = -1;

  2840 		else

  2841 			cmp = 1;

  2842 		if (cmp < 0) {

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

  2844 			s++;

  2845 		} else if (cmp == 0) {

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

  2847 			s++;

  2848 			i++;

  2849 		} else {

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

  2851 			i++;

  2852 		}

  2853 	}

  2855 	array_release(&install_packages);

  2856 	array_release(&remove_packages);

  2858 	return razor_merger_finish(merger);

  2859 }

  2861 void

  2862 razor_transaction_destroy(struct razor_transaction *trans)

  2863 {

  2864 	int p;

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

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

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

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

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

  2871 	}

  2872 	free(trans);

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

  2875 }

author	Dan Winship <danw@gnome.org>
	Tue Mar 11 11:43:54 2008 -0400 (2008-03-11)
changeset 160	00f19df51272
parent 159	9307d0e0b44f
child 162	9170be6cebf0
permissions	-rw-r--r--