razor: razor.c@8b9849d1e5b0

     1 /*

     2  * Copyright (C) 2008  Kristian Høgsberg <krh@redhat.com>

     3  * Copyright (C) 2008  Red Hat, Inc

     4  *

     5  * This program is free software; you can redistribute it and/or modify

     6  * it under the terms of the GNU General Public License as published by

     7  * the Free Software Foundation; either version 2 of the License, or

     8  * (at your option) any later version.

     9  *

    10  * This program is distributed in the hope that it will be useful,

    11  * but WITHOUT ANY WARRANTY; without even the implied warranty of

    12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    13  * GNU General Public License for more details.

    14  *

    15  * You should have received a copy of the GNU General Public License along

    16  * with this program; if not, write to the Free Software Foundation, Inc.,

    17  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.

    18  */

    20 #define _GNU_SOURCE

    22 #include <stdlib.h>

    23 #include <stddef.h>

    24 #include <stdint.h>

    25 #include <stdio.h>

    26 #include <string.h>

    27 #include <sys/types.h>

    28 #include <sys/stat.h>

    29 #include <sys/mman.h>

    30 #include <unistd.h>

    31 #include <fcntl.h>

    32 #include <errno.h>

    33 #include <ctype.h>

    34 #include <fnmatch.h>

    36 #include "razor.h"

    37 #include "razor-internal.h"

    38 #include "types.h"

    40 struct razor_set_section {

    41 	uint32_t type;

    42 	uint32_t offset;

    43 	uint32_t size;

    44 };

    46 struct razor_set_header {

    47 	uint32_t magic;

    48 	uint32_t version;

    49 	struct razor_set_section sections[0];

    50 };

    52 #define RAZOR_MAGIC 0x7a7a7a7a

    53 #define RAZOR_VERSION 1

    55 #define RAZOR_STRING_POOL		0

    56 #define RAZOR_PACKAGES			1

    57 #define RAZOR_PROPERTIES		2

    58 #define RAZOR_FILES			3

    59 #define RAZOR_PACKAGE_POOL		4

    60 #define RAZOR_PROPERTY_POOL		5

    61 #define RAZOR_FILE_POOL			6

    62 #define RAZOR_FILE_STRING_POOL		7

    63 #define RAZOR_DETAILS_STRING_POOL	8

    65 struct razor_package {

    66 	uint name  : 24;

    67 	uint flags : 8;

    68 	uint32_t version;

    69 	uint32_t arch;

    70 	uint32_t summary;

    71 	uint32_t description;

    72 	uint32_t url;

    73 	uint32_t license;

    74 	struct list_head properties;

    75 	struct list_head files;

    76 };

    78 struct razor_property {

    79 	uint name  : 24;

    80 	uint flags : 6;

    81 	enum razor_property_type type : 2;

    82 	enum razor_version_relation relation : 32;

    83 	uint32_t version;

    84 	struct list_head packages;

    85 };

    87 struct razor_entry {

    88 	uint name  : 24;

    89 	uint flags : 8;

    90 	uint32_t start;

    91 	struct list_head packages;

    92 };

    94 #define RAZOR_ENTRY_LAST	0x80

    96 struct razor_set {

    97 	struct array string_pool;

    98  	struct array packages;

    99  	struct array properties;

   100  	struct array files;

   101 	struct array package_pool;

   102  	struct array property_pool;

   103  	struct array file_pool;

   104 	struct array file_string_pool;

   105 	struct array details_string_pool;

   106 	struct razor_set_header *header;

   107 };

   109 struct import_entry {

   110 	uint32_t package;

   111 	char *name;

   112 };

   114 struct import_directory {

   115 	uint32_t name, count;

   116 	struct array files;

   117 	struct array packages;

   118 	struct import_directory *last;

   119 };

   121 struct razor_importer {

   122 	struct razor_set *set;

   123 	struct hashtable table;

   124 	struct hashtable file_table;

   125 	struct hashtable details_table;

   126 	struct razor_package *package;

   127 	struct array properties;

   128 	struct array files;

   129 	struct array file_requires;

   130 };

   132 static void *

   133 zalloc(size_t size)

   134 {

   135 	void *p;

   137 	p = malloc(size);

   138 	memset(p, 0, size);

   140 	return p;

   141 }

   143 struct razor_set_section razor_sections[] = {

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

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

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

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

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

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

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

   151 	{ RAZOR_FILE_STRING_POOL,	offsetof(struct razor_set, file_string_pool) },

   152 	{ RAZOR_DETAILS_STRING_POOL,	offsetof(struct razor_set, details_string_pool) },

   153 };

   155 struct razor_set *

   156 razor_set_create(void)

   157 {

   158 	struct razor_set *set;

   159 	struct razor_entry *e;

   160 	char *empty;

   162 	set = zalloc(sizeof *set);

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

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

   166 	*empty = '\0';

   167 	empty = array_add(&set->file_string_pool, 1);

   168 	*empty = '\0';

   169 	empty = array_add(&set->details_string_pool, 1);

   170 	*empty = '\0';

   171 	e->name = 0;

   172 	e->flags = RAZOR_ENTRY_LAST;

   173 	e->start = 0;

   174 	list_set_empty(&e->packages);

   176 	return set;

   177 }

   179 struct razor_set *

   180 razor_set_open(const char *filename)

   181 {

   182 	struct razor_set *set;

   183 	struct razor_set_section *s;

   184 	struct stat stat;

   185 	struct array *array;

   186 	int fd;

   188 	set = zalloc(sizeof *set);

   189 	fd = open(filename, O_RDONLY);

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

   191 		return NULL;

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

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

   194 		free(set);

   195 		return NULL;

   196 	}

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

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

   200 			continue;

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

   202 			continue;

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

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

   205 		array->size = s->size;

   206 		array->alloc = s->size;

   207 	}

   208 	close(fd);

   210 	return set;

   211 }

   213 void

   214 razor_set_destroy(struct razor_set *set)

   215 {

   216 	unsigned int size;

   217 	struct array *a;

   218 	int i;

   220 	if (set->header) {

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

   222 			;

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

   224 		munmap(set->header, size);

   225 	} else {

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

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

   228 			free(a->data);

   229 		}

   230 	}

   232 	free(set);

   233 }

   235 int

   236 razor_set_write_to_fd(struct razor_set *set, int fd)

   237 {

   238 	char data[4096];

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

   240 	struct array *a;

   241 	uint32_t offset;

   242 	int i;

   244 	memset(data, 0, sizeof data);

   245 	header->magic = RAZOR_MAGIC;

   246 	header->version = RAZOR_VERSION;

   247 	offset = sizeof data;

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

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

   251 			continue;

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

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

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

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

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

   257 	}

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

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

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

   263 	razor_write(fd, data, sizeof data);

   264 	memset(data, 0, sizeof data);

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

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

   267 			continue;

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

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

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

   271 	}

   273 	return 0;

   274 }

   276 int

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

   278 {

   279 	int fd, status;

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

   282 	if (fd < 0)

   283 		return -1;

   285 	status = razor_set_write_to_fd(set, fd);

   286 	if (status) {

   287 	    close(fd);

   288 	    return status;

   289 	}

   291 	return close(fd);

   292 }

   294 void

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

   296 		const char *version, const char *release)

   297 {

   298 	int len;

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

   301 		*evr_buf = '\0';

   302 		return;

   303 	}

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

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

   307 		evr_buf += len;

   308 		size -= len;

   309 	}

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

   311 	evr_buf += len;

   312 	size -= len;

   313 	if (release && *release)

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

   315 }

   317 void

   318 razor_importer_begin_package(struct razor_importer *importer,

   319 			     const char *name,

   320 			     const char *version,

   321 			     const char *arch)

   322 {

   323 	struct razor_package *p;

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

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

   327 	p->flags = 0;

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

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

   331 	importer->package = p;

   332 	array_init(&importer->properties);

   333 }

   335 void

   336 razor_importer_finish_package(struct razor_importer *importer)

   337 {

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

   339 		       &importer->set->property_pool,

   340 		       &importer->properties,

   341 		       1);

   343 	array_release(&importer->properties);

   344 }

   346 void

   347 razor_importer_add_details(struct razor_importer *importer,

   348 			   const char *summary,

   349 			   const char *description,

   350 			   const char *url,

   351 			   const char *license)

   352 {

   353 	importer->package->summary = hashtable_tokenize(&importer->details_table, summary);

   354 	importer->package->description = hashtable_tokenize(&importer->details_table, description);

   355 	importer->package->url = hashtable_tokenize(&importer->details_table, url);

   356 	importer->package->license = hashtable_tokenize(&importer->details_table, license);

   357 }

   359 void

   360 razor_importer_add_property(struct razor_importer *importer,

   361 			    const char *name,

   362 			    enum razor_version_relation relation,

   363 			    const char *version,

   364 			    enum razor_property_type type)

   365 {

   366 	struct razor_property *p;

   367 	uint32_t *r;

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

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

   371 	p->flags = 0;

   372 	p->type = type;

   373 	p->relation = relation;

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

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

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

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

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

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

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

   383 		*r = p->name;

   384 	}

   385 }

   387 void

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

   389 {

   390 	struct import_entry *e;

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

   394 	e->package = importer->package -

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

   396 	e->name = strdup(name);

   397 }

   399 struct razor_importer *

   400 razor_importer_new(void)

   401 {

   402 	struct razor_importer *importer;

   404 	importer = zalloc(sizeof *importer);

   405 	importer->set = razor_set_create();

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

   407 	hashtable_init(&importer->file_table, &importer->set->file_string_pool);

   408 	hashtable_init(&importer->details_table, &importer->set->details_string_pool);

   410 	return importer;

   411 }

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

   414 void

   415 razor_importer_destroy(struct razor_importer *importer)

   416 {

   417 	/* FIXME: write this */

   418 }

   420 static int

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

   422 {

   423 	const char *p1, *p2;

   424 	long n1, n2;

   425 	int res;

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

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

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

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

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

   433 	if (res < 0) {

   434 		n1 = 0;

   435 		p1 = s1;

   436 		p2++;

   437 	} else if (res > 0) {

   438 		p1++;

   439 		n2 = 0;

   440 		p2 = s2;

   441 	}

   443 	if (n1 != n2)

   444 		return n1 - n2;

   445 	while (*p1 && *p2) {

   446 		if (*p1 != *p2)

   447 			return *p1 - *p2;

   448 		p1++;

   449 		p2++;

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

   451 			return versioncmp(p1, p2);

   452 	}

   454 	return *p1 - *p2;

   455 }

   457 static int

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

   459 {

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

   461 	struct razor_set *set = data;

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

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

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

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

   467 	else

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

   469 }

   471 static int

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

   473 {

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

   475 	struct razor_set *set = data;

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

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

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

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

   481 		return prop1->type - prop2->type;

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

   483 		return prop1->relation - prop2->relation;

   484 	else

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

   486 }

   488 static uint32_t *

   489 uniqueify_properties(struct razor_set *set)

   490 {

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

   492 	struct array *pkgs, *p;

   493 	struct list_head *r;

   494 	uint32_t *map, *rmap;

   495 	int i, count, unique;

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

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

   499 				    count,

   500 				    sizeof(struct razor_property),

   501 				    compare_properties,

   502 				    set);

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

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

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

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

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

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

   510 			up++;

   511 			up->name = rp->name;

   512 			up->flags = 0;

   513 			up->type = rp->type;

   514 			up->relation = rp->relation;

   515 			up->version = rp->version;

   516 		}

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

   519 		rmap[map[i]] = unique;

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

   521 		*r = rp->packages;

   522 	}

   523 	free(map);

   525 	if (up != rp)

   526 		up++;

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

   528 	rp_end = up;

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

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

   531 		array_release(p);

   532 	}

   534 	free(pkgs);

   536 	return rmap;

   537 }

   539 static int

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

   541 {

   542 	const struct import_entry *e1 = p1;

   543 	const struct import_entry *e2 = p2;

   544 	const char *n1 = e1->name;

   545 	const char *n2 = e2->name;

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

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

   549 	 * sort before "foo.conf"

   550 	 *

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

   552 	 */

   553 	while (*n1 && *n2) {

   554 		if (*n1 < *n2)

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

   556 		else if (*n1 > *n2)

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

   558 		n1++;

   559 		n2++;

   560 	}

   561 	if (*n1)

   562 		return 1;

   563 	else if (*n2)

   564 		return -1;

   565 	else

   566 		return 0;

   567 }

   569 static void

   570 count_entries(struct import_directory *d)

   571 {

   572 	struct import_directory *p, *end;

   574 	p = d->files.data;

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

   576 	d->count = 0;

   577 	while (p < end) {

   578 		count_entries(p);

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

   580 		p++;

   581 	}

   582 }

   584 static void

   585 serialize_files(struct razor_set *set,

   586 		struct import_directory *d, struct array *array)

   587 {

   588 	struct import_directory *p, *end;

   589 	struct razor_entry *e = NULL;

   590 	uint32_t s;

   592 	p = d->files.data;

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

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

   595 	while (p < end) {

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

   597 		e->name = p->name;

   598 		e->flags = 0;

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

   600 		s += p->count;

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

   603 		array_release(&p->packages);

   604 		p++;

   605 	}

   606 	if (e != NULL)

   607 		e->flags |= RAZOR_ENTRY_LAST;

   609 	p = d->files.data;

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

   611 	while (p < end) {

   612 		serialize_files(set, p, array);

   613 		p++;

   614 	}

   615 }

   617 static void

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

   619 {

   620 	struct razor_property *p, *end;

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

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

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

   625 }

   627 static void

   628 build_file_tree(struct razor_importer *importer)

   629 {

   630 	int count, i, length;

   631 	struct import_entry *filenames;

   632 	char *f, *end;

   633 	uint32_t name, *r;

   634 	char dirname[256];

   635 	struct import_directory *d, root;

   636 	struct razor_entry *e;

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

   639 	razor_qsort_with_data(importer->files.data,

   640 			      count,

   641 			      sizeof (struct import_entry),

   642 			      compare_filenames,

   643 			      NULL);

   645 	root.name = hashtable_tokenize(&importer->file_table, "");

   646 	array_init(&root.files);

   647 	array_init(&root.packages);

   648 	root.last = NULL;

   650 	filenames = importer->files.data;

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

   652 		f = filenames[i].name;

   653 		if (*f != '/')

   654 			continue;

   655 		f++;

   657 		d = &root;

   658 		while (*f) {

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

   660 			if (end == NULL)

   661 				end = f + strlen(f);

   662 			length = end - f;

   663 			memcpy(dirname, f, length);

   664 			dirname[length] ='\0';

   665 			name = hashtable_tokenize(&importer->file_table, dirname);

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

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

   668 				d->last->name = name;

   669 				d->last->last = NULL;

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

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

   672 			}

   673 			d = d->last;

   674 			f = end + 1;

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

   676 				break;

   677 		}

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

   680 		*r = filenames[i].package;

   681 		free(filenames[i].name);

   682 	}

   684 	count_entries(&root);

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

   686 	e->name = root.name;

   687 	e->flags = RAZOR_ENTRY_LAST;

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

   689 	list_set_empty(&e->packages);

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

   693 	array_release(&importer->files);

   694 }

   696 static struct razor_entry *

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

   699 static void

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

   701 {

   702 	uint32_t *item;

   704 	while (list) {

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

   706 		 *item = list->data;

   707 		 list = list_next(list);

   708 	}

   709 }

   711 static int

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

   713 {

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

   715 	const char *pool = data;

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

   718 }

   720 static void

   721 find_file_provides(struct razor_importer *importer)

   722 {

   723 	struct razor_property *prop;

   724 	struct razor_entry *top, *entry;

   725 	struct razor_package *packages;

   726 	struct array pkgprops;

   727 	struct list *pkg;

   728 	uint32_t *req, *req_start, *req_end;

   729 	uint32_t *map, *newprop;

   730 	char *pool;

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

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

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

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

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

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

   739 				    compare_file_requires, pool);

   740 	free(map);

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

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

   744 			continue;

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

   746 		if (!entry)

   747 			continue;

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

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

   751 			prop->name = *req;

   752 			prop->type = RAZOR_PROPERTY_PROVIDES;

   753 			prop->relation = RAZOR_VERSION_EQUAL;

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

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

   757 			/* Update property list of pkg */

   758 			array_init(&pkgprops);

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

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

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

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

   763 			array_release(&pkgprops);

   764 		}

   765 	}

   767 	array_release(&importer->file_requires);

   768 }

   770 static void

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

   772 {

   773 	struct razor_package *p, *packages;

   774 	struct array *pkgs;

   775 	struct razor_entry *e, *end;

   776 	struct list *r;

   777 	uint32_t *q;

   778 	int i, count;

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

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

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

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

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

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

   787 		while (r) {

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

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

   790 			r = list_next(r);

   791 		}

   792 	}

   794 	packages = set->packages.data;

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

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

   797 		array_release(&pkgs[i]);

   798 	}

   799 	free(pkgs);

   800 }

   802 struct razor_set *

   803 razor_importer_finish(struct razor_importer *importer)

   804 {

   805 	struct razor_set *set;

   806 	uint32_t *map, *rmap;

   807 	int i, count;

   809 	build_file_tree(importer);

   810 	find_file_provides(importer);

   812 	map = uniqueify_properties(importer->set);

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

   814 	free(map);

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

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

   818 				    count,

   819 				    sizeof(struct razor_package),

   820 				    compare_packages,

   821 				    importer->set);

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

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

   825 		rmap[map[i]] = i;

   826 	free(map);

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

   829 	build_package_file_lists(importer->set, rmap);

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

   831 	free(rmap);

   833 	set = importer->set;

   834 	hashtable_release(&importer->table);

   835 	hashtable_release(&importer->file_table);

   836 	hashtable_release(&importer->details_table);

   837 	free(importer);

   839 	return set;

   840 }

   842 struct razor_package_iterator {

   843 	struct razor_set *set;

   844 	struct razor_package *package, *end;

   845 	struct list *index;

   846 	int free_index;

   847 };

   849 static struct razor_package_iterator *

   850 razor_package_iterator_create_with_index(struct razor_set *set,

   851 					 struct list *index)

   852 {

   853 	struct razor_package_iterator *pi;

   855 	pi = zalloc(sizeof *pi);

   856 	pi->set = set;

   857 	pi->index = index;

   859 	return pi;

   860 }

   862 struct razor_package_iterator *

   863 razor_package_iterator_create(struct razor_set *set)

   864 {

   865 	struct razor_package_iterator *pi;

   867 	pi = zalloc(sizeof *pi);

   868 	pi->set = set;

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

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

   872 	return pi;

   873 }

   875 struct razor_package_iterator *

   876 razor_package_iterator_create_for_property(struct razor_set *set,

   877 					   struct razor_property *property)

   878 {

   879 	struct list *index;

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

   882 	return razor_package_iterator_create_with_index(set, index);

   883 }

   885 int

   886 razor_package_iterator_next(struct razor_package_iterator *pi,

   887 			    struct razor_package **package,

   888 			    const char **name,

   889 			    const char **version,

   890 			    const char **arch)

   891 {

   892 	char *pool;

   893 	int valid;

   894 	struct razor_package *p, *packages;

   896 	if (pi->package) {

   897 		p = pi->package++;

   898 		valid = p < pi->end;

   899 	} else if (pi->index) {

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

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

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

   903 		valid = 1;

   904 	} else

   905 		valid = 0;

   907 	if (valid) {

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

   909 		*package = p;

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

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

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

   913 	} else {

   914 		*package = NULL;

   915 	}

   917 	return valid;

   918 }

   920 void

   921 razor_package_iterator_destroy(struct razor_package_iterator *pi)

   922 {

   923 	if (pi->free_index)

   924 		free(pi->index);

   926 	free(pi);

   927 }

   929 struct razor_package *

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

   931 {

   932 	struct razor_package_iterator *pi;

   933 	struct razor_package *p;

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

   936 	pi = razor_package_iterator_create(set);

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

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

   939 			break;

   940 	}

   941 	razor_package_iterator_destroy(pi);

   943 	return p;

   944 }

   946 void

   947 razor_package_get_details(struct razor_set *set, struct razor_package *package,

   948 			  const char **summary, const char **description,

   949 			  const char **url, const char **license)

   950 {

   951 	const char *pool = set->details_string_pool.data;

   953 	*summary = &pool[package->summary];

   954 	*description = &pool[package->description];

   955 	*url = &pool[package->url];

   956 	*license = &pool[package->license];

   957 }

   959 struct razor_property_iterator {

   960 	struct razor_set *set;

   961 	struct razor_property *property, *end;

   962 	struct list *index;

   963 };

   965 struct razor_property_iterator *

   966 razor_property_iterator_create(struct razor_set *set,

   967 			       struct razor_package *package)

   968 {

   969 	struct razor_property_iterator *pi;

   971 	pi = zalloc(sizeof *pi);

   972 	pi->set = set;

   974 	if (package) {

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

   976 				       &set->property_pool);

   977 	} else {

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

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

   980 	}

   982 	return pi;

   983 }

   985 int

   986 razor_property_iterator_next(struct razor_property_iterator *pi,

   987 			     struct razor_property **property,

   988 			     const char **name,

   989 			     enum razor_version_relation *relation,

   990 			     const char **version,

   991 			     enum razor_property_type *type)

   992 {

   993 	char *pool;

   994 	int valid;

   995 	struct razor_property *p, *properties;

   997 	if (pi->property) {

   998 		p = pi->property++;

   999 		valid = p < pi->end;

  1000 	} else if (pi->index) {

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

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

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

  1004 		valid = 1;

  1005 	} else

  1006 		valid = 0;

  1008 	if (valid) {

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

  1010 		*property = p;

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

  1012 		*relation = p->relation;

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

  1014 		*type = p->type;

  1015 	} else {

  1016 		*property = NULL;

  1017 	}

  1019 	return valid;

  1020 }

  1022 void

  1023 razor_property_iterator_destroy(struct razor_property_iterator *pi)

  1024 {

  1025 	free(pi);

  1026 }

  1028 static struct razor_entry *

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

  1030 {

  1031 	struct razor_entry *e;

  1032 	const char *n, *pool = set->file_string_pool.data;

  1033 	int len;

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

  1036 	do {

  1037 		n = pool + e->name;

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

  1039 			return e;

  1040 		len = strlen(n);

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

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

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

  1044 		}

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

  1047 	return NULL;

  1048 }

  1050 static void

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

  1052 	 char *prefix, const char *pattern)

  1053 {

  1054 	struct razor_entry *e;

  1055 	const char *n, *pool = set->file_string_pool.data;

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

  1058 	do {

  1059 		n = pool + e->name;

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

  1061 			continue;

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

  1063 		if (e->start) {

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

  1065 			*sub = '/';

  1066 			strcpy (sub + 1, n);

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

  1068 			*sub = '\0';

  1069 		}

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

  1071 }

  1073 void

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

  1075 {

  1076 	struct razor_entry *e;

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

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

  1080 		buffer[0] = '\0';

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

  1082 		return;

  1083 	}

  1085 	strcpy(buffer, pattern);

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

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

  1088 		base = NULL;

  1089 	} else {

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

  1091 		if (p) {

  1092 			*p = '\0';

  1093 			base = p + 1;

  1094 		} else {

  1095 			base = NULL;

  1096 		}

  1097 	}

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

  1099 	if (e->start != 0)

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

  1101 }

  1103 struct razor_package_iterator *

  1104 razor_package_iterator_create_for_file(struct razor_set *set,

  1105 				       const char *filename)

  1106 {

  1107 	struct razor_entry *entry;

  1108 	struct list *index;

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

  1111 	if (entry == NULL)

  1112 		return NULL;

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

  1115 	return razor_package_iterator_create_with_index(set, index);

  1116 }

  1118 static struct list *

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

  1120 		   struct razor_entry *dir, uint32_t end,

  1121 		   char *prefix)

  1122 {

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

  1124 	uint32_t next, file;

  1125 	char *pool;

  1126 	int len;

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

  1129 	pool = set->file_string_pool.data;

  1131 	e = entries + dir->start;

  1132 	do {

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

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

  1135 			r = list_next(r);

  1136 			if (!r)

  1137 				return NULL;

  1138 			if (r->data >= end)

  1139 				return r;

  1140 		}

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

  1143 	e = entries + dir->start;

  1144 	do {

  1145 		if (e->start == 0)

  1146 			continue;

  1148 		if (e->flags & RAZOR_ENTRY_LAST)

  1149 			next = end;

  1150 		else {

  1151 			f = e + 1;

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

  1153 				f++;

  1154 			if (f->start == 0)

  1155 				next = end;

  1156 			else

  1157 				next = f->start;

  1158 		}

  1160 		file = r->data;

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

  1162 			len = strlen(prefix);

  1163 			prefix[len] = '/';

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

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

  1166 			prefix[len] = '\0';

  1167 		}

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

  1170 	return r;

  1171 }

  1173 void

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

  1175 {

  1176 	struct razor_package *package;

  1177 	struct list *r;

  1178 	uint32_t end;

  1179 	char buffer[512];

  1181 	package = razor_set_get_package(set, name);

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

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

  1185 	buffer[0] = '\0';

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

  1187 }

  1189 static void

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

  1191 {

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

  1193 	uint32_t *u;

  1194 	char *pool;

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

  1197 	pool = set->string_pool.data;

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

  1200 		if (r->type != RAZOR_PROPERTY_REQUIRES)

  1201 			continue;

  1203 		p = r;

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

  1205 		       p->type == r->type)

  1206 			p++;

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

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

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

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

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

  1213 		 * does.*/

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

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

  1216 			p++;

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

  1219 		 * etc) to properly determine if a requires is

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

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

  1223 		if (p == end ||

  1224 		    p->type != RAZOR_PROPERTY_PROVIDES ||

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

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

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

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

  1229 				continue;

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

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

  1232 		}

  1233 	}

  1234 }

  1236 void

  1237 razor_set_list_unsatisfied(struct razor_set *set)

  1238 {

  1239 	struct array unsatisfied;

  1240 	struct razor_property *properties, *r;

  1241 	uint32_t *u, *end;

  1242 	char *pool;

  1244 	array_init(&unsatisfied);

  1245 	razor_set_validate(set, &unsatisfied);

  1247 	end = unsatisfied.data + unsatisfied.size;

  1248 	properties = set->properties.data;

  1249 	pool = set->string_pool.data;

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

  1252 		r = properties + *u;

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

  1254 			printf("%s not satisfied\n",

  1255 			       &pool[r->name]);

  1256 		else

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

  1258 			       &pool[r->name],

  1259 			       &pool[r->version]);

  1260 	}

  1262 	array_release(&unsatisfied);

  1263 }

  1265 #define UPSTREAM_SOURCE 0x80

  1267 struct source {

  1268 	struct razor_set *set;

  1269 	uint32_t *property_map;

  1270 	uint32_t *file_map;

  1271 };

  1273 struct razor_merger {

  1274 	struct razor_set *set;

  1275 	struct hashtable table;

  1276 	struct hashtable file_table;

  1277 	struct hashtable details_table;

  1278 	struct source source1;

  1279 	struct source source2;

  1280 };

  1282 static struct razor_merger *

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

  1284 {

  1285 	struct razor_merger *merger;

  1286 	int count;

  1287 	size_t size;

  1289 	merger = zalloc(sizeof *merger);

  1290 	merger->set = razor_set_create();

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

  1292 	hashtable_init(&merger->file_table, &merger->set->file_string_pool);

  1293 	hashtable_init(&merger->details_table, &merger->set->details_string_pool);

  1295 	merger->source1.set = set1;

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

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

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

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

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

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

  1303 	merger->source2.set = set2;

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

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

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

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

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

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

  1311 	return merger;

  1312 }

  1314 static void

  1315 add_package(struct razor_merger *merger,

  1316 	    struct razor_package *package, struct source *source,

  1317 	    uint32_t flags)

  1318 {

  1319 	char *pool;

  1320 	struct list *r;

  1321 	struct razor_package *p;

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

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

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

  1326 	p->flags = flags;

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

  1328 					&pool[package->version]);

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

  1330 				     &pool[package->arch]);

  1332 	p->properties = package->properties;

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

  1334 	while (r) {

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

  1336 		r = list_next(r);

  1337 	}

  1339 	p->files = package->files;

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

  1341 	while (r) {

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

  1343 		r = list_next(r);

  1344 	}

  1345 }

  1347 static uint32_t

  1348 add_property(struct razor_merger *merger,

  1349 	     const char *name, enum razor_version_relation relation,

  1350 	     const char *version, int type)

  1351 {

  1352 	struct razor_property *p;

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

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

  1356 	p->flags = 0;

  1357 	p->type = type;

  1358 	p->relation = relation;

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

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

  1362 }

  1364 static void

  1365 merge_properties(struct razor_merger *merger)

  1366 {

  1367 	struct razor_property *p1, *p2;

  1368 	struct razor_set *set1, *set2;

  1369 	uint32_t *map1, *map2;

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

  1371 	char *pool1, *pool2;

  1373 	set1 = merger->source1.set;

  1374 	set2 = merger->source2.set;

  1375 	map1 = merger->source1.property_map;

  1376 	map2 = merger->source2.property_map;

  1378 	i = 0;

  1379 	j = 0;

  1380 	pool1 = set1->string_pool.data;

  1381 	pool2 = set2->string_pool.data;

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

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

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

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

  1387 			i++;

  1388 			continue;

  1389 		}

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

  1391 			j++;

  1392 			continue;

  1393 		}

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

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

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

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

  1398 		else if (i < count1)

  1399 			cmp = -1;

  1400 		else

  1401 			cmp = 1;

  1402 		if (cmp == 0)

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

  1404 		if (cmp == 0)

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

  1406 		if (cmp == 0)

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

  1408 					 &pool2[p2->version]);

  1409 		if (cmp < 0) {

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

  1411 						 &pool1[p1->name],

  1412 						 p1->relation,

  1413 						 &pool1[p1->version],

  1414 						 p1->type);

  1415 		} else if (cmp > 0) {

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

  1417 						 &pool2[p2->name],

  1418 						 p2->relation,

  1419 						 &pool2[p2->version],

  1420 						 p2->type);

  1421 		} else  {

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

  1423 							     &pool1[p1->name],

  1424 							     p1->relation,

  1425 							     &pool1[p1->version],

  1426 							     p1->type);

  1427 		}

  1428 	}

  1429 }

  1431 static void

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

  1433 		uint32_t *map, struct array *pool)

  1434 {

  1435 	uint32_t r;

  1436 	struct list *p, *q;

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

  1439 	p = list_first(properties, source_pool);

  1440 	while (p) {

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

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

  1443 		q->flags = p->flags;

  1444 		p = list_next(p);

  1445 	}

  1447 	list_set_ptr(properties, r);

  1448 }

  1450 static uint32_t

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

  1452 {

  1453 	struct razor_entry *e;

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

  1456 	e->name = hashtable_tokenize(&merger->file_table, name);

  1457 	e->flags = 0;

  1458 	e->start = 0;

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

  1461 }

  1463 /* FIXME. Blah */

  1464 static int

  1465 fix_file_map(uint32_t *map,

  1466 	     struct razor_entry *files,

  1467 	     struct razor_entry *top)

  1468 {

  1469 	uint32_t e;

  1470 	int found_file = 0;

  1472 	e = top->start;

  1473 	do {

  1474 		if (files[e].start)

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

  1476 		if (map[e])

  1477 			found_file = 1;

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

  1480 	if (found_file)

  1481 		map[top - files] = 1;

  1482 	return found_file;

  1483 }

  1485 struct merge_directory {

  1486 	uint32_t merged, dir1, dir2;

  1487 };

  1489 static void

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

  1491 {

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

  1493 	struct razor_set *set1, *set2;

  1494 	struct array merge_stack;

  1495 	struct merge_directory *child_md, *end_md;

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

  1497 	int cmp;

  1498 	char *pool1, *pool2;

  1500 	set1 = merger->source1.set;

  1501 	set2 = merger->source2.set;

  1502 	map1 = merger->source1.file_map;

  1503 	map2 = merger->source2.file_map;

  1504 	pool1 = set1->string_pool.data;

  1505 	pool2 = set2->string_pool.data;

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

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

  1509 	array_init(&merge_stack);

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

  1512 	last = 0;

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

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

  1515 	while (e1 || e2) {

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

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

  1518 				e1 = NULL;

  1519 			continue;

  1520 		}

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

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

  1523 				e2 = NULL;

  1524 			continue;

  1525 		}

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

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

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

  1529 				e1 = NULL;

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

  1531 				e2 = NULL;

  1532 			continue;

  1533 		}

  1535 		if (!e1)

  1536 			cmp = 1;

  1537 		else if (!e2)

  1538 			cmp = -1;

  1539 		else {

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

  1541 				      &pool2[e2->name]);

  1542 		}

  1544 		if (cmp < 0) {

  1545 			if (map1[e1 - root1]) {

  1546 				map1[e1 - root1] = last =

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

  1548 				if (e1->start) {

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

  1550 					child_md->merged = last;

  1551 					child_md->dir1 = e1->start;

  1552 					child_md->dir2 = 0;

  1553 				}

  1554 			}

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

  1556 				e1 = NULL;

  1557 		} else if (cmp > 0) {

  1558 			if (map2[e2 - root2]) {

  1559 				map2[e2 - root2] = last =

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

  1561 				if (e2->start) {

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

  1563 					child_md->merged = last;

  1564 					child_md->dir1 = 0;

  1565 					child_md->dir2 = e2->start;

  1566 				}

  1567 			}

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

  1569 				e2 = NULL;

  1570 		} else {

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

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

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

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

  1575 				child_md->merged = last;

  1576 				child_md->dir1 = e1->start;

  1577 				child_md->dir2 = e2->start;

  1578 			}

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

  1580 				e1 = NULL;

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

  1582 				e2 = NULL;

  1583 		}

  1584 	}

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

  1587 	if (last) {

  1588 		mroot[last].flags = RAZOR_ENTRY_LAST;

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

  1590 	} else

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

  1593 	end_md = merge_stack.data + merge_stack.size;

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

  1595 		merge_one_directory(merger, child_md);

  1596 	array_release(&merge_stack);

  1597 }

  1599 static void

  1600 merge_files(struct razor_merger *merger)

  1601 {

  1602 	struct razor_entry *root;

  1603 	struct merge_directory md;

  1604 	uint32_t *map1, *map2;

  1606 	map1 = merger->source1.file_map;

  1607 	map2 = merger->source2.file_map;

  1609 	md.merged = 0;

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

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

  1613 		if (root->start)

  1614 			fix_file_map(map1, root, root);

  1615 		md.dir1 = root->start;

  1616 	} else

  1617 		md.dir1 = 0;

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

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

  1621 		if (root->start)

  1622 			fix_file_map(map2, root, root);

  1623 		md.dir2 = root->start;

  1624 	} else

  1625 		md.dir2 = 0;

  1627 	merge_one_directory(merger, &md);

  1628 }

  1630 static void

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

  1632 	   uint32_t *map, struct array *pool)

  1633 {

  1634 	uint32_t r;

  1635 	struct list *p, *q;

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

  1638 	p = list_first(files, source_pool);

  1639 	while (p) {

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

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

  1642 		q->flags = p->flags;

  1643 		p = list_next(p);

  1644 	}

  1646 	list_set_ptr(files, r);

  1647 }

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

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

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

  1652  * the arrays for their properties. */

  1653 static void

  1654 rebuild_property_package_lists(struct razor_set *set)

  1655 {

  1656 	struct array *pkgs, *a;

  1657 	struct razor_package *pkg, *pkg_end;

  1658 	struct razor_property *prop, *prop_end;

  1659 	struct list *r;

  1660 	uint32_t *q;

  1661 	int count;

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

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

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

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

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

  1669 		while (r) {

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

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

  1672 			r = list_next(r);

  1673 		}

  1674 	}

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

  1677 	a = pkgs;

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

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

  1680 		array_release(a);

  1681 	}

  1682 	free(pkgs);

  1683 }

  1685 static void

  1686 rebuild_file_package_lists(struct razor_set *set)

  1687 {

  1688 	struct array *pkgs, *a;

  1689 	struct razor_package *pkg, *pkg_end;

  1690 	struct razor_entry *entry, *entry_end;

  1691 	struct list *r;

  1692 	uint32_t *q;

  1693 	int count;

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

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

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

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

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

  1701 		while (r) {

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

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

  1704 			r = list_next(r);

  1705 		}

  1706 	}

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

  1709 	a = pkgs;

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

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

  1712 		array_release(a);

  1713 	}

  1714 	free(pkgs);

  1715 }

  1717 static struct razor_set *

  1718 razor_merger_finish(struct razor_merger *merger)

  1719 {

  1720 	struct razor_set *result;

  1721 	struct razor_package *p, *pend;

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

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

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

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

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

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

  1729 	 * property list for both sets. */

  1731 	merge_properties(merger);

  1732 	merge_files(merger);

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

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

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

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

  1739 		struct source *src;

  1741 		if (p->flags & UPSTREAM_SOURCE)

  1742 			src = &merger->source2;

  1743 		else

  1744 			src = &merger->source1;

  1746 		emit_properties(&p->properties,

  1747 				&src->set->property_pool,

  1748 				src->property_map,

  1749 				&merger->set->property_pool);

  1750 		emit_files(&p->files,

  1751 			   &src->set->file_pool,

  1752 			   src->file_map,

  1753 			   &merger->set->file_pool);

  1754 		p->flags &= ~UPSTREAM_SOURCE;

  1755 	}

  1757 	rebuild_property_package_lists(merger->set);

  1758 	rebuild_file_package_lists(merger->set);

  1760 	result = merger->set;

  1761 	hashtable_release(&merger->table);

  1762 	hashtable_release(&merger->file_table);

  1763 	hashtable_release(&merger->details_table);

  1764 	free(merger);

  1766 	return result;

  1767 }

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

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

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

  1772  **/

  1774 void

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

  1776 	       razor_package_callback_t callback, void *data)

  1777 {

  1778 	struct razor_package_iterator *pi1, *pi2;

  1779 	struct razor_package *p1, *p2;

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

  1781 	int res;

  1783 	pi1 = razor_package_iterator_create(set);

  1784 	pi2 = razor_package_iterator_create(upstream);

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

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

  1789 	while (p1 || p2) {

  1790 		if (p1 && p2) {

  1791 			res = strcmp(name1, name2);

  1792 			if (res == 0)

  1793 				res = versioncmp(version1, version2);

  1794 		} else {

  1795 			res = 0;

  1796 		}

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

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

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

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

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

  1804 			razor_package_iterator_next(pi1, &p1,

  1805 						    &name1, &version1, &arch1);

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

  1807 			razor_package_iterator_next(pi2, &p2,

  1808 						    &name2, &version2, &arch2);

  1809 	}

  1811 	razor_package_iterator_destroy(pi1);

  1812 	razor_package_iterator_destroy(pi2);

  1813 }

  1815 struct razor_transaction;

  1816 struct razor_transaction_package;

  1817 struct razor_transaction_resolver;

  1819 struct razor_transaction {

  1820 	int package_count, errors;

  1821 	struct razor_set *system, *upstream;

  1823 	struct bitarray syspkgs, uppkgs;

  1824 	struct array packages;

  1825 };

  1827 struct razor_transaction_package {

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

  1829 	struct razor_package *old_package, *new_package;

  1830 	enum razor_transaction_package_state state;

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

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

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

  1835 	 * additional information.

  1836 	 *

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

  1838 	 * required something that this package provides. If dep_type

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

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

  1841 	 *

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

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

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

  1845 	 *

  1846 	 * For OLD_CONFLICT or NEW_CONFLICT, dep_package is an

  1847 	 * existing package that conflicts with this one. The

  1848 	 * conflicting property comes from the already-installed

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

  1850 	 * for NEW_CONFLICT.

  1851 	 *

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

  1853 	 * but the name field will be NULL.

  1854 	 */

  1855 	const char *dep_package;

  1856 	enum razor_property_type dep_type;

  1857 	const char *dep_property;

  1858 	enum razor_version_relation dep_relation;

  1859 	const char *dep_version;

  1860 };

  1862 static int

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

  1864 {

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

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

  1867 }

  1869 static int

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

  1871 {

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

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

  1874 }

  1876 static struct razor_package *

  1877 property_provider_package(struct razor_transaction *trans,

  1878 			  struct razor_property *prop,

  1879 			  int installed)

  1880 {

  1881 	struct razor_set *set;

  1882 	struct bitarray *pkgbits;

  1883 	struct razor_package *pkgs;

  1884 	struct list *p;

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

  1887 		return NULL;

  1888 	else if (!installed &&

  1889 		 prop->type != RAZOR_PROPERTY_PROVIDES &&

  1890 		 prop->type != RAZOR_PROPERTY_OBSOLETES)

  1891 		return NULL;

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

  1894 		set = trans->system;

  1895 		pkgbits = &trans->syspkgs;

  1896 	} else {

  1897 		set = trans->upstream;

  1898 		pkgbits = &trans->uppkgs;

  1899 	}

  1900 	pkgs = set->packages.data;

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

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

  1904 			continue;

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

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

  1907 			return &pkgs[p->data];

  1908 	}

  1909 	return NULL;

  1910 }

  1912 static int

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

  1914 {

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

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

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

  1919 		return 1;

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

  1921 		return -1;

  1922 	else

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

  1924 }

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

  1927 static void

  1928 resolve_new_packages(struct razor_transaction *trans,

  1929 		     int start, int end)

  1930 {

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

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

  1933 	struct razor_transaction_package **packages;

  1934 	const char *spool, *upool;

  1935 	int i;

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

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

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

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

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

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

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

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

  1946 	 * descriptions.

  1947 	 */

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

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

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

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

  1952 	      compare_transaction_packages);

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

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

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

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

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

  1959 			continue;

  1961 		spkg = NULL;

  1962 		while (sp < sp_end &&

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

  1964 			sp++;

  1965 		while (sp < sp_end &&

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

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

  1968 			sp++;

  1970 		upkg = NULL;

  1971 		while (up < up_end &&

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

  1973 			up++;

  1974 		while (up < up_end &&

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

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

  1977 			up++;

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

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

  1981 			if (spkg) {

  1982 				packages[i]->old_package = spkg;

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

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

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

  1986 			}

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

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

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

  1990 				trans->errors++;

  1991 			}

  1992 		} else {

  1993 			if (upkg) {

  1994 				packages[i]->new_package = upkg;

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

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

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

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

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

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

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

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

  2004 				}

  2006 				if (spkg) {

  2007 					packages[i]->old_package = spkg;

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

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

  2010 						packages[i]->state = RAZOR_PACKAGE_UP_TO_DATE;

  2011 						trans->errors++;

  2012 						continue;

  2013 					}

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

  2015 				}

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

  2017 			}

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

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

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

  2021 				trans->errors++;

  2022 			}

  2023 		}

  2024 	}

  2025 }

  2027 static int

  2028 provider_satisfies_requirement(struct razor_property *provider,

  2029 			       const char *provider_strings,

  2030 			       struct razor_property *requirement,

  2031 			       const char *requirement_strings)

  2032 {

  2033 	int cmp, len;

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

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

  2037 	if (!*required)

  2038 		return 1;

  2039 	if (!*provided) {

  2040 		if (requirement->relation >= RAZOR_VERSION_EQUAL)

  2041 			return 1;

  2042 		else

  2043 			return 0;

  2044 	}

  2046 	cmp = versioncmp(provided, required);

  2048 	switch (requirement->relation) {

  2049 	case RAZOR_VERSION_LESS:

  2050 		return cmp < 0;

  2052 	case RAZOR_VERSION_LESS_OR_EQUAL:

  2053 		if (cmp <= 0)

  2054 			return 1;

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

  2057 	case RAZOR_VERSION_EQUAL:

  2058 		if (cmp == 0)

  2059 			return 1;

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

  2062 		len = strlen(required);

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

  2064 			return 1;

  2065 		return 0;

  2067 	case RAZOR_VERSION_GREATER_OR_EQUAL:

  2068 		return cmp >= 0;

  2070 	case RAZOR_VERSION_GREATER:

  2071 		return cmp > 0;

  2072 	}

  2074 	/* shouldn't happen */

  2075 	return 0;

  2076 }

  2078 static struct razor_package *

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

  2080 		      const char *filename, int installed)

  2081 {

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

  2083 	struct razor_entry *entry;

  2084 	struct list *p;

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

  2087 		return 0;

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

  2090 	if (!entry)

  2091 		return 0;

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

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

  2095 			return &pkgs[p->data];

  2096 	}

  2097 	return NULL;

  2098 }

  2100 static struct razor_package *

  2101 find_installed_package_for_file(struct razor_transaction *trans,

  2102 				const char *filename)

  2103 {

  2104 	struct razor_package *pkg;

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

  2107 				    filename, 1);

  2108 	if (!pkg)

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

  2110 					    filename, 1);

  2111 	return pkg;

  2112 }

  2114 static struct razor_package *

  2115 find_uninstalled_package_for_file(struct razor_transaction *trans,

  2116 				  const char *filename)

  2117 {

  2118 	struct razor_package *pkg;

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

  2121 				    filename, 0);

  2122 	if (!pkg)

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

  2124 					    filename, 0);

  2125 	return pkg;

  2126 }

  2128 static struct razor_property *

  2129 skip_to_matching_property(struct razor_transaction *trans,

  2130 			  struct razor_property *match,

  2131 			  struct razor_property *prop)

  2132 {

  2133 	struct razor_set *mset, *pset;

  2134 	const char *ppool, *mpool;

  2135 	struct razor_property *prop_end;

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

  2138 		mset = trans->system;

  2139 	else

  2140 		mset = trans->upstream;

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

  2143 		pset = trans->system;

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

  2145 		pset = trans->upstream;

  2146 	else

  2147 		return prop;

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

  2150 	ppool = pset->string_pool.data;

  2151 	mpool = mset->string_pool.data;

  2153 	while (prop < prop_end &&

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

  2155 		prop++;

  2156 	return prop;

  2157 }

  2159 static struct razor_package *

  2160 find_package_matching(struct razor_transaction *trans, int installed,

  2161 		      struct razor_property *prop,

  2162 		      struct razor_property *req,

  2163 		      struct razor_set *req_set)

  2164 {

  2165 	struct razor_set *set;

  2166 	struct bitarray *pkgbits;

  2167 	struct razor_package *pkgs;

  2168 	struct razor_property *props, *prop_end;

  2169 	enum razor_property_type match_type;

  2170 	const char *pool;

  2171 	const char *rpool;

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

  2173 	int match;

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

  2176 		set = trans->system;

  2177 		pkgbits = &trans->syspkgs;

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

  2179 		set = trans->upstream;

  2180 		pkgbits = &trans->uppkgs;

  2181 	} else

  2182 		return NULL;

  2184 	if (!req_set) {

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

  2186 			req_set = trans->system;

  2187 		else

  2188 			req_set = trans->upstream;

  2189 	}

  2190 	rpool = req_set->string_pool.data;

  2192 	if (req->type == RAZOR_PROPERTY_PROVIDES)

  2193 		match_type = RAZOR_PROPERTY_CONFLICTS;

  2194 	else

  2195 		match_type = RAZOR_PROPERTY_PROVIDES;

  2197 	pkgs = set->packages.data;

  2198 	props = set->properties.data;

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

  2200 	pool = set->string_pool.data;

  2202 	/* Find first matching property */

  2203 	while (prop < prop_end &&

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

  2205 		prop++;

  2206 	if (prop == prop_end ||

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

  2208 		return NULL;

  2210 	if (prop->type < match_type) {

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

  2212 			prop++;

  2213 	} else {

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

  2215 			prop--;

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

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

  2218 			prop--;

  2219 	}

  2221 	/* Scan matching properties */

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

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

  2224 		if (match_type == RAZOR_PROPERTY_PROVIDES)

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

  2226 		else

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

  2228 		if (match) {

  2229 			struct list *pkg;

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

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

  2233 					continue;

  2234 				if (!match_name ||

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

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

  2237 					return &pkgs[pkg->data];

  2238 			}

  2239 		}

  2240 		prop++;

  2241 	}

  2243 	return NULL;

  2244 }

  2246 static struct razor_package *

  2247 find_installed_package_for_property(struct razor_transaction *trans,

  2248 				    struct razor_property *sys_start,

  2249 				    struct razor_property *up_start,

  2250 				    struct razor_property *req)

  2251 {

  2252 	struct razor_package *pkg;

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

  2255 	if (!pkg)

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

  2257 	return pkg;

  2258 }

  2260 static struct razor_package *

  2261 find_uninstalled_package_for_property(struct razor_transaction *trans,

  2262 				      struct razor_property *sys_start,

  2263 				      struct razor_property *up_start,

  2264 				      struct razor_property *req)

  2265 {

  2266 	struct razor_package *pkg;

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

  2269 	if (!pkg)

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

  2271 	return pkg;

  2272 }

  2274 static struct razor_transaction_package *

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

  2276 {

  2277 	struct razor_transaction_package *packages;

  2278 	int count, i;

  2280 	packages = trans->packages.data;

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

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

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

  2284 			return &packages[i];

  2285 	}

  2286 	return NULL;

  2287 }

  2289 /* FIXME? */

  2290 static int

  2291 prop_is_being_installed(struct razor_transaction *trans,

  2292 			struct razor_property *prop)

  2293 {

  2294 	struct list *pkg;

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

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

  2298 			return 1;

  2299 	}

  2300 	return 0;

  2301 }

  2303 static int

  2304 prop_is_being_removed(struct razor_transaction *trans,

  2305 		      struct razor_property *prop)

  2306 {

  2307 	struct list *pkg;

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

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

  2311 			return 0;

  2312 	}

  2313 	return 1;

  2314 }

  2316 static int

  2317 prop_is_being_updated(struct razor_transaction *trans,

  2318 		      struct razor_property *prop)

  2319 {

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

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

  2322 	struct razor_transaction_package *tp;

  2323 	struct list *pkg;

  2325 	/* Assumes prop_is_being_removed returns true */

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

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

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

  2330 			return 0;

  2331 	}

  2332 	return 1;

  2333 }

  2335 static void

  2336 add_transaction_package(struct razor_transaction *trans,

  2337 			struct razor_package *new_package,

  2338 			struct razor_package *old_package,

  2339 			enum razor_transaction_package_state state,

  2340 			const char *req_package,

  2341 			struct razor_property *req_prop)

  2342 {

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

  2344 	struct bitarray *reqpkgbits;

  2345 	struct razor_transaction_package *tp, *already;

  2346 	const char *pool;

  2347 	struct razor_package *pkgs;

  2348 	struct list *pkg;

  2349 	int contradiction = 0;

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

  2352 		new_package_set = trans->system;

  2353 	else

  2354 		new_package_set = trans->upstream;

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

  2356 		old_package_set = trans->system;

  2357 	else

  2358 		old_package_set = trans->upstream;

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

  2360 		req_set = trans->system;

  2361 		reqpkgbits = &trans->syspkgs;

  2362 	} else {

  2363 		req_set = trans->upstream;

  2364 		reqpkgbits = &trans->uppkgs;

  2365 	}

  2367 	if (new_package) {

  2368 		pool = new_package_set->string_pool.data;

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

  2370 		if (already) {

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

  2372 				/* Already taken care of */

  2373 				return;

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

  2375 				   already->state == RAZOR_PACKAGE_FORCED_UPDATE) {

  2376 				already->new_package = new_package;

  2377 				return;

  2378 			} else if (new_package_set == trans->upstream) {

  2379 				return;

  2380 			}

  2382 			/* Oops. We lose */

  2383 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2384 				contradiction = 1;

  2385 		}

  2386 	} else if (old_package) {

  2387 		pool = old_package_set->string_pool.data;

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

  2389 		if (already) {

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

  2391 				/* Already taken care of */

  2392 				return;

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

  2394 				already->old_package = old_package;

  2395 				return;

  2396 			}

  2398 			/* Oops. We lose */

  2399 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2400 				contradiction = 1;

  2401 		}

  2402 	} else

  2403 		state = RAZOR_PACKAGE_UNSATISFIABLE;

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

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

  2408 	if (new_package) {

  2409 		pool = new_package_set->string_pool.data;

  2410 		tp->new_package = new_package;

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

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

  2414 		pkgs = new_package_set->packages.data;

  2415 	}

  2416 	if (old_package) {

  2417 		pool = old_package_set->string_pool.data;

  2418 		tp->old_package = old_package;

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

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

  2422 		pkgs = old_package_set->packages.data;

  2423 	}

  2425 	tp->state = state;

  2426 	if (state != RAZOR_PACKAGE_INSTALL &&

  2427 	    state != RAZOR_PACKAGE_FORCED_UPDATE &&

  2428 	    state != RAZOR_PACKAGE_REMOVE &&

  2429 	    state != RAZOR_PACKAGE_OBSOLETED)

  2430 		trans->errors++;

  2432 	if (contradiction) {

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

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

  2435 		 */

  2436 		add_transaction_package(trans, new_package, old_package,

  2437 					RAZOR_PACKAGE_CONTRADICTION,

  2438 					NULL, NULL);

  2439 	}

  2441 	if (req_package)

  2442 		tp->dep_package = req_package;

  2443 	if (!req_prop)

  2444 		return;

  2446 	pool = req_set->string_pool.data;

  2447 	pkgs = req_set->packages.data;

  2448 	if (!req_package) {

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

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

  2451 				break;

  2452 		}

  2453 		if (pkg)

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

  2455 	}

  2457 	tp->dep_type = req_prop->type;

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

  2459 	tp->dep_relation = req_prop->relation;

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

  2461 }

  2463 static void

  2464 razor_transaction_satisfy(struct razor_transaction *trans)

  2465 {

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

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

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

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

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

  2471 	struct list *reqpkg;

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

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

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

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

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

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

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

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

  2482 	sp = sprops;

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

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

  2485 		 * to-be-installed.

  2486 		 */

  2487 		while (up < uprop_end &&

  2488 		       !prop_is_being_installed(trans, up))

  2489 			up++;

  2490 		if (up == uprop_end)

  2491 			break;

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

  2494 		switch (up->type) {

  2495 		case RAZOR_PROPERTY_REQUIRES:

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

  2497 				break;

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

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

  2501 				/* Requires something that is either installed

  2502 				 * or to-be-installed.

  2503 				 */

  2504 				break;

  2505 			}

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

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

  2509 			if (!pkg)

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

  2511 			add_transaction_package(trans, pkg, NULL,

  2512 						RAZOR_PACKAGE_INSTALL,

  2513 						NULL, up);

  2514 			break;

  2516 		case RAZOR_PROPERTY_PROVIDES:

  2517 			/* find_installed_package_for_property works backwards

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

  2519 			 */

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

  2521 			if (!pkg)

  2522 				break;

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

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

  2526 				 * finding an upgrade

  2527 				 */

  2528 				add_transaction_package(trans, NULL, pkg,

  2529 							RAZOR_PACKAGE_FORCED_UPDATE,

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

  2531 			} else {

  2532 				add_transaction_package(trans, NULL, pkg,

  2533 							RAZOR_PACKAGE_CONTRADICTION,

  2534 							NULL, up);

  2535 			}

  2536 			break;

  2538 		case RAZOR_PROPERTY_CONFLICTS:

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

  2540 			if (!pkg)

  2541 				break;

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

  2544 				/* Conflicts with something already installed.

  2545 				 * Try to upgrade out.

  2546 				 */

  2547 				add_transaction_package(trans, NULL, pkg,

  2548 							RAZOR_PACKAGE_FORCED_UPDATE,

  2549 							NULL, up);

  2550 			} else {

  2551 				add_transaction_package(trans, pkg, NULL,

  2552 							RAZOR_PACKAGE_CONTRADICTION,

  2553 							NULL, up);

  2554 			}

  2555 			break;

  2557 		case RAZOR_PROPERTY_OBSOLETES:

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

  2559 			if (pkg) {

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

  2561 				 * will add a CONTRADICTION error as well.

  2562 				 */

  2563 				add_transaction_package(trans, NULL, pkg,

  2564 							RAZOR_PACKAGE_OBSOLETED,

  2565 							NULL, up);

  2566 			}

  2567 			break;

  2569 		default:

  2570 			/* can't happen */

  2571 			break;

  2572 		}

  2573 	}

  2575 	up = uprops;

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

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

  2578 		 * to-be-removed.

  2579 		 */

  2580 		while (sp < sprop_end &&

  2581 		       (sp->type != RAZOR_PROPERTY_PROVIDES ||

  2582 			!prop_is_being_removed(trans, sp)))

  2583 			sp++;

  2584 		if (sp == sprop_end)

  2585 			break;

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

  2589 		/* Skip 'up' to match */

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

  2591 		ur = first_up = up;

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

  2594 		 * already be installing an identical PROVIDES, so

  2595 		 * check for that.

  2596 		 */

  2597 		while (up < uprop_end &&

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

  2599 		       (up->type != RAZOR_PROPERTY_PROVIDES ||

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

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

  2602 			up++;

  2603 		if (up < uprop_end &&

  2604 		    up->type == RAZOR_PROPERTY_PROVIDES &&

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

  2606 		    sp->relation == up->relation &&

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

  2608 		    prop_is_being_installed(trans, up)) {

  2609 			up = first_up;

  2610 			continue;

  2611 		}

  2612 		up = first_up;

  2614 		/* For all still-installed packages that require

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

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

  2617 		 * not, either remove or attempt to update the

  2618 		 * package, depending on why the required property has

  2619 		 * disappeared

  2620 		 */

  2621 		sr = sp;

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

  2623 			sr--;

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

  2625 			if (prop_is_being_removed(trans, sr))

  2626 				continue;

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

  2628 				continue;

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

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

  2632 					continue;

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

  2634 				if (prop_is_being_updated(trans, sp)) {

  2635 					add_transaction_package(trans, NULL, pkg,

  2636 								RAZOR_PACKAGE_FORCED_UPDATE,

  2637 								removed_package, NULL);

  2638 				} else {

  2639 					add_transaction_package(trans, NULL, pkg,

  2640 								RAZOR_PACKAGE_REMOVE,

  2641 								removed_package, sr);

  2642 				}

  2643 			}

  2644 		}

  2645 	}

  2646 }

  2648 void

  2649 razor_transaction_install_package(struct razor_transaction *transaction,

  2650 				  struct razor_package *package)

  2651 {

  2652 	add_transaction_package(transaction, package, NULL,

  2653 				RAZOR_PACKAGE_INSTALL, NULL, NULL);

  2654 }

  2656 void

  2657 razor_transaction_remove_package(struct razor_transaction *transaction,

  2658 				 struct razor_package *package)

  2659 {

  2660 	add_transaction_package(transaction, NULL, package,

  2661 				RAZOR_PACKAGE_REMOVE, NULL, NULL);

  2662 }

  2664 void

  2665 razor_transaction_update_all(struct razor_transaction *trans)

  2666 {

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

  2668 	const char *spool, *upool;

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

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

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

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

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

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

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

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

  2679 			up++;

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

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

  2682 			add_transaction_package(trans, up, sp,

  2683 						RAZOR_PACKAGE_INSTALL,

  2684 						NULL, NULL);

  2685 		}

  2686 	}

  2687 }

  2689 struct razor_transaction *

  2690 razor_transaction_create(struct razor_set *system, struct razor_set *upstream)

  2691 {

  2692 	struct razor_transaction *trans;

  2693 	int count;

  2695 	trans = zalloc(sizeof *trans);

  2697 	trans->system = system;

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

  2699 	array_init(&trans->packages);

  2700 	count = trans->system->packages.size / sizeof (struct razor_package);

  2701 	bitarray_init(&trans->syspkgs, count, 1);

  2702 	count = trans->upstream->packages.size / sizeof (struct razor_package);

  2703 	bitarray_init(&trans->uppkgs, count, 0);

  2705 	return trans;

  2706 }

  2708 static void

  2709 resolve_transaction(struct razor_transaction *trans)

  2710 {

  2711 	int start, end;

  2713 	if (trans->package_count > 0)

  2714 		/* Already did this, return. */

  2715 		return;

  2717 	start = 0;

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

  2720 	while (start != end) {

  2721 		resolve_new_packages(trans, start, end);

  2722 		if (trans->errors)

  2723 			break;

  2725 		razor_transaction_satisfy(trans);

  2727 		start = end;

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

  2729 	}

  2731 	trans->package_count = end;

  2732 }

  2734 const char * const razor_version_relations[] = {

  2735 	/* same order as enum razor_version_relation */

  2736 	"<", "<=", "=", ">=", ">"

  2737 };

  2739 const char * const razor_property_types[] = {

  2740 	/* same order as enum razor_property_type */

  2741 	"requires", "provides", "conflicts with", "obsoletes"

  2742 };

  2744 static void

  2745 print_requirement(struct razor_transaction_package *p)

  2746 {

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

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

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

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

  2751 		if (*p->dep_version) {

  2752 			printf(" %s %s",

  2753 			       razor_version_relations[p->dep_relation],

  2754 			       p->dep_version);

  2755 		}

  2756 	} else {

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

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

  2759 		if (*p->dep_version) {

  2760 			printf(", which %s %s %s %s",

  2761 			       razor_property_types[p->dep_type],

  2762 			       p->dep_property,

  2763 			       razor_version_relations[p->dep_relation],

  2764 			       p->dep_version);

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

  2766 			printf(", which %s %s",

  2767 			       razor_property_types[p->dep_type],

  2768 			       p->dep_property);

  2769 		}

  2770 	}

  2771 }

  2773 int

  2774 razor_transaction_resolve(struct razor_transaction *trans)

  2775 {

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

  2777 	int errors_only = 0;

  2779 	resolve_transaction(trans);

  2781 	tps = trans->packages.data;

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

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

  2784 		switch (p->state) {

  2785 		case RAZOR_PACKAGE_INSTALL:

  2786 			if (errors_only)

  2787 				break;

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

  2790 			if (p->dep_package)

  2791 				print_requirement(p);

  2792 			printf("\n");

  2793 			break;

  2795 		case RAZOR_PACKAGE_FORCED_UPDATE:

  2796 			if (errors_only)

  2797 				break;

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

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

  2801 			break;

  2803 		case RAZOR_PACKAGE_REMOVE:

  2804 			if (errors_only)

  2805 				break;

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

  2807 			if (p->dep_package) {

  2808 				printf(" which required %s",

  2809 				       p->dep_package);

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

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

  2812 			}

  2813 			printf("\n");

  2814 			break;

  2816 		case RAZOR_PACKAGE_OBSOLETED:

  2817 			if (errors_only)

  2818 				break;

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

  2820 			if (p->dep_package) {

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

  2822 				       p->dep_package);

  2823 			}

  2824 			printf("\n");

  2825 			break;

  2827 		case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:

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

  2829 			if (p->dep_package) {

  2830 				printf(" (which is required");

  2831 				print_requirement(p);

  2832 				printf(")");

  2833 			}

  2834 			printf("\n");

  2835 			errors_only = 1;

  2836 			break;

  2838 		case RAZOR_PACKAGE_UPDATE_UNAVAILABLE:

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

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

  2841 			errors_only = 1;

  2842 			break;

  2844 		case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:

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

  2846 			errors_only = 1;

  2847 			break;

  2849 		case RAZOR_PACKAGE_UP_TO_DATE:

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

  2851 			if (p->dep_package)

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

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

  2854 			errors_only = 1;

  2855 			break;

  2857 		case RAZOR_PACKAGE_CONTRADICTION:

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

  2859 			errors_only = 1;

  2860 			break;

  2862 		case RAZOR_PACKAGE_OLD_CONFLICT:

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

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

  2865 			if (*p->dep_version) {

  2866 				printf("%s %s %s",

  2867 				       p->dep_property,

  2868 				       razor_version_relations[p->dep_relation],

  2869 				       p->dep_version);

  2870 			} else

  2871 				printf("it");

  2872 			printf("\n");

  2874 			errors_only = 1;

  2875 			break;

  2877 		case RAZOR_PACKAGE_NEW_CONFLICT:

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

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

  2880 			if (*p->dep_version) {

  2881 				printf(" %s %s",

  2882 				       razor_version_relations[p->dep_relation],

  2883 				       p->dep_version);

  2884 			}

  2885 			printf("\n");

  2887 			errors_only = 1;

  2888 			break;

  2890 		case RAZOR_PACKAGE_UNSATISFIABLE:

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

  2892 			if (*p->dep_version) {

  2893 				printf(" %s %s",

  2894 					razor_version_relations[p->dep_relation],

  2895 					p->dep_version);

  2896 			}

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

  2898 				p->dep_package);

  2899 			errors_only = 1;

  2900 			break;

  2902 		default:

  2903 			/* Shouldn't actually happen */

  2904 			break;

  2905 		}

  2906 	}

  2908 	return trans->errors;

  2909 }

  2911 int

  2912 razor_transaction_unsatisfied_property(struct razor_transaction *trans,

  2913 				       const char *name,

  2914 				       enum razor_version_relation rel,

  2915 				       const char *version)

  2916 {

  2917 	struct razor_transaction_package *p, *end;

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

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

  2921 		if (p->state != RAZOR_PACKAGE_UNSATISFIABLE)

  2922 			continue;

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

  2924 		    rel != p->dep_relation ||

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

  2926 			continue;

  2928 		return 1;

  2929 	}

  2931 	return 0;

  2932 }

  2934 struct razor_set *

  2935 razor_transaction_finish(struct razor_transaction *trans)

  2936 {

  2937 	struct array install_packages, remove_packages;

  2938 	struct razor_merger *merger;

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

  2940 	struct razor_set *set;

  2941 	struct source *source1, *source2;

  2942 	char *spool, *ipool, *rpool;

  2943 	uint32_t *map;

  2944 	struct razor_transaction_package *p, *end;

  2945 	int cmp;

  2947 	/* FIXME */

  2948 	if (trans->errors)

  2949 		return NULL;

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

  2952 	array_init(&install_packages);

  2953 	array_init(&remove_packages);

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

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

  2957 		if (p->new_package) {

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

  2959 			*pkg = *p->new_package;

  2960 		} else {

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

  2962 			*pkg = *p->old_package;

  2963 		}

  2964 	}

  2965 	map = razor_qsort_with_data(install_packages.data,

  2966 				    install_packages.size / sizeof *pkg,

  2967 				    sizeof *pkg,

  2968 				    compare_packages,

  2969 				    trans->upstream);

  2970 	free(map);

  2971 	map = razor_qsort_with_data(remove_packages.data,

  2972 				    remove_packages.size / sizeof *pkg,

  2973 				    sizeof *pkg,

  2974 				    compare_packages,

  2975 				    trans->system);

  2976 	free(map);

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

  2980 	source1 = &merger->source1;

  2981 	source2 = &merger->source2;

  2983 	i = install_packages.data;

  2984 	iend = install_packages.data + install_packages.size;

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

  2987 	r = remove_packages.data;

  2988 	rend = remove_packages.data + remove_packages.size;

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

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

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

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

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

  2996 		/* Check if s is being removed */

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

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

  2999 			s++;

  3000 			r++;

  3001 			continue;

  3002 		}

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

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

  3006 		else if (s < send)

  3007 			cmp = -1;

  3008 		else

  3009 			cmp = 1;

  3010 		if (cmp < 0) {

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

  3012 			s++;

  3013 		} else if (cmp == 0) {

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

  3015 			s++;

  3016 			i++;

  3017 		} else {

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

  3019 			i++;

  3020 		}

  3021 	}

  3023 	array_release(&install_packages);

  3024 	array_release(&remove_packages);

  3026 	set = razor_merger_finish(merger);

  3027 	razor_transaction_destroy(trans);

  3029 	return set;

  3030 }

  3032 void

  3033 razor_transaction_destroy(struct razor_transaction *trans)

  3034 {

  3035 	struct razor_transaction_package *p, *end;

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

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

  3039 		if (!p->dep_package &&

  3040 		    (p->state == RAZOR_PACKAGE_INSTALL_UNAVAILABLE ||

  3041 		     p->state == RAZOR_PACKAGE_REMOVE_NOT_INSTALLED))

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

  3043 	}

  3045 	array_release(&trans->packages);

  3046 	bitarray_release(&trans->syspkgs);

  3047 	bitarray_release(&trans->uppkgs);

  3048 	free(trans);

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

  3051 }

  3053 struct razor_package_query {

  3054 	struct razor_set *set;

  3055 	char *vector;

  3056 	int count;

  3057 };

  3059 struct razor_package_query *

  3060 razor_package_query_create(struct razor_set *set)

  3061 {

  3062 	struct razor_package_query *pq;

  3063 	int count;

  3065 	pq = zalloc(sizeof *pq);

  3066 	pq->set = set;

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

  3068 	pq->vector = zalloc(count * sizeof(char));

  3070 	return pq;

  3071 }

  3073 void

  3074 razor_package_query_add_package(struct razor_package_query *pq,

  3075 				struct razor_package *p)

  3076 {

  3077 	struct razor_package *packages;

  3079 	packages = pq->set->packages.data;

  3080 	pq->count += pq->vector[p - packages] ^ 1;

  3081 	pq->vector[p - packages] = 1;

  3082 }

  3084 void

  3085 razor_package_query_add_iterator(struct razor_package_query *pq,

  3086 				 struct razor_package_iterator *pi)

  3087 {

  3088 	struct razor_package *packages, *p;

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

  3091 	packages = pq->set->packages.data;

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

  3093 		pq->count += pq->vector[p - packages] ^ 1;

  3094 		pq->vector[p - packages] = 1;

  3095 	}

  3096 }

  3098 struct razor_package_iterator *

  3099 razor_package_query_finish(struct razor_package_query *pq)

  3100 {

  3101 	struct razor_package_iterator *pi;

  3102 	struct razor_set *set;

  3103 	struct list *index;

  3104 	int i, j, count;

  3106 	set = pq->set;

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

  3108 	index = zalloc(pq->count * sizeof *index);

  3110 	for (i = 0, j = 0; i < count; i++) {

  3111 		if (!pq->vector[i])

  3112 			continue;

  3114 		index[j].data = i;

  3115 		if (j == pq->count - 1)

  3116 			index[j].flags = 0x80;

  3117 		j++;

  3118 	}

  3120 	free(pq);

  3122 	pi = razor_package_iterator_create_with_index(set, index);

  3123 	pi->free_index = 1;

  3125 	return pi;

  3126 }

author	James Bowes <jbowes@redhat.com>
	Sun Jun 15 11:21:24 2008 -0400 (2008-06-15)
changeset 228	8b9849d1e5b0
parent 227	6a47b5fc2791
child 229	cae6308aa5b1
permissions	-rw-r--r--