razor: razor.c@6e94ebe58141

     1 #define _GNU_SOURCE

     3 #include <stdlib.h>

     4 #include <stddef.h>

     5 #include <stdint.h>

     6 #include <stdio.h>

     7 #include <string.h>

     8 #include <sys/types.h>

     9 #include <sys/stat.h>

    10 #include <sys/mman.h>

    11 #include <unistd.h>

    12 #include <fcntl.h>

    13 #include <errno.h>

    14 #include <ctype.h>

    15 #include <fnmatch.h>

    17 #include "razor.h"

    18 #include "razor-internal.h"

    19 #include "types.h"

    21 struct razor_set_section {

    22 	uint32_t type;

    23 	uint32_t offset;

    24 	uint32_t size;

    25 };

    27 struct razor_set_header {

    28 	uint32_t magic;

    29 	uint32_t version;

    30 	struct razor_set_section sections[0];

    31 };

    33 #define RAZOR_MAGIC 0x7a7a7a7a

    34 #define RAZOR_VERSION 1

    36 #define RAZOR_STRING_POOL	0

    37 #define RAZOR_PACKAGES		1

    38 #define RAZOR_PROPERTIES	2

    39 #define RAZOR_FILES		3

    40 #define RAZOR_PACKAGE_POOL	4

    41 #define RAZOR_PROPERTY_POOL	5

    42 #define RAZOR_FILE_POOL		6

    44 struct razor_package {

    45 	uint name  : 24;

    46 	uint flags : 8;

    47 	uint32_t version;

    48 	struct list_head properties;

    49 	struct list_head files;

    50 };

    52 struct razor_property {

    53 	uint name  : 24;

    54 	uint flags : 6;

    55 	enum razor_property_type type : 2;

    56 	enum razor_version_relation relation : 32;

    57 	uint32_t version;

    58 	struct list_head packages;

    59 };

    61 struct razor_entry {

    62 	uint name  : 24;

    63 	uint flags : 8;

    64 	uint32_t start;

    65 	struct list_head packages;

    66 };

    68 #define RAZOR_ENTRY_LAST	0x80

    70 struct razor_set {

    71 	struct array string_pool;

    72  	struct array packages;

    73  	struct array properties;

    74  	struct array files;

    75 	struct array package_pool;

    76  	struct array property_pool;

    77  	struct array file_pool;

    78 	struct razor_set_header *header;

    79 };

    81 struct import_entry {

    82 	uint32_t package;

    83 	char *name;

    84 };

    86 struct import_directory {

    87 	uint32_t name, count;

    88 	struct array files;

    89 	struct array packages;

    90 	struct import_directory *last;

    91 };

    93 struct razor_importer {

    94 	struct razor_set *set;

    95 	struct hashtable table;

    96 	struct razor_package *package;

    97 	struct array properties;

    98 	struct array files;

    99 	struct array file_requires;

   100 };

   102 static void *

   103 zalloc(size_t size)

   104 {

   105 	void *p;

   107 	p = malloc(size);

   108 	memset(p, 0, size);

   110 	return p;

   111 }

   113 struct razor_set_section razor_sections[] = {

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

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

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

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

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

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

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

   121 };

   123 struct razor_set *

   124 razor_set_create(void)

   125 {

   126 	struct razor_set *set;

   127 	struct razor_entry *e;

   128 	char *empty;

   130 	set = zalloc(sizeof *set);

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

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

   134 	*empty = '\0';

   135 	e->name = 0;

   136 	e->flags = RAZOR_ENTRY_LAST;

   137 	e->start = 0;

   138 	list_set_empty(&e->packages);

   140 	return set;

   141 }

   143 struct razor_set *

   144 razor_set_open(const char *filename)

   145 {

   146 	struct razor_set *set;

   147 	struct razor_set_section *s;

   148 	struct stat stat;

   149 	struct array *array;

   150 	int fd;

   152 	set = zalloc(sizeof *set);

   153 	fd = open(filename, O_RDONLY);

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

   155 		return NULL;

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

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

   158 		free(set);

   159 		return NULL;

   160 	}

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

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

   164 			continue;

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

   166 			continue;

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

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

   169 		array->size = s->size;

   170 		array->alloc = s->size;

   171 	}

   172 	close(fd);

   174 	return set;

   175 }

   177 void

   178 razor_set_destroy(struct razor_set *set)

   179 {

   180 	unsigned int size;

   181 	struct array *a;

   182 	int i;

   184 	if (set->header) {

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

   186 			;

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

   188 		munmap(set->header, size);

   189 	} else {

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

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

   192 			free(a->data);

   193 		}

   194 	}

   196 	free(set);

   197 }

   199 int

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

   201 {

   202 	char data[4096];

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

   204 	struct array *a;

   205 	uint32_t offset;

   206 	int i, fd;

   208 	memset(data, 0, sizeof data);

   209 	header->magic = RAZOR_MAGIC;

   210 	header->version = RAZOR_VERSION;

   211 	offset = sizeof data;

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

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

   215 			continue;

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

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

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

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

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

   221 	}

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

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

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

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

   228 	if (fd < 0)

   229 		return -1;

   231 	razor_write(fd, data, sizeof data);

   232 	memset(data, 0, sizeof data);

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

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

   235 			continue;

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

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

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

   239 	}

   241 	close(fd);

   243 	return 0;

   244 }

   246 void

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

   248 		const char *version, const char *release)

   249 {

   250 	int len;

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

   253 		*evr_buf = '\0';

   254 		return;

   255 	}

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

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

   259 		evr_buf += len;

   260 		size -= len;

   261 	}

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

   263 	evr_buf += len;

   264 	size -= len;

   265 	if (release && *release)

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

   267 }

   269 void

   270 razor_importer_begin_package(struct razor_importer *importer,

   271 			     const char *name, const char *version)

   272 {

   273 	struct razor_package *p;

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

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

   277 	p->flags = 0;

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

   280 	importer->package = p;

   281 	array_init(&importer->properties);

   282 }

   284 void

   285 razor_importer_finish_package(struct razor_importer *importer)

   286 {

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

   288 		       &importer->set->property_pool,

   289 		       &importer->properties,

   290 		       1);

   292 	array_release(&importer->properties);

   293 }

   295 void

   296 razor_importer_add_property(struct razor_importer *importer,

   297 			    const char *name,

   298 			    enum razor_version_relation relation,

   299 			    const char *version,

   300 			    enum razor_property_type type)

   301 {

   302 	struct razor_property *p;

   303 	uint32_t *r;

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

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

   307 	p->flags = 0;

   308 	p->type = type;

   309 	p->relation = relation;

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

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

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

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

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

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

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

   319 		*r = p->name;

   320 	}

   321 }

   323 void

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

   325 {

   326 	struct import_entry *e;

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

   330 	e->package = importer->package -

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

   332 	e->name = strdup(name);

   333 }

   335 struct razor_importer *

   336 razor_importer_new(void)

   337 {

   338 	struct razor_importer *importer;

   340 	importer = zalloc(sizeof *importer);

   341 	importer->set = razor_set_create();

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

   344 	return importer;

   345 }

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

   348 void

   349 razor_importer_destroy(struct razor_importer *importer)

   350 {

   351 	/* FIXME: write this */

   352 }

   354 static int

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

   356 {

   357 	const char *p1, *p2;

   358 	long n1, n2;

   359 	int res;

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

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

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

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

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

   367 	if (res < 0) {

   368 		n1 = 0;

   369 		p1 = s1;

   370 		p2++;

   371 	} else if (res > 0) {

   372 		p1++;

   373 		n2 = 0;

   374 		p2 = s2;

   375 	}

   377 	if (n1 != n2)

   378 		return n1 - n2;

   379 	while (*p1 && *p2) {

   380 		if (*p1 != *p2)

   381 			return *p1 - *p2;

   382 		p1++;

   383 		p2++;

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

   385 			return versioncmp(p1, p2);

   386 	}

   388 	return *p1 - *p2;

   389 }

   391 static int

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

   393 {

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

   395 	struct razor_set *set = data;

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

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

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

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

   401 	else

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

   403 }

   405 static int

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

   407 {

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

   409 	struct razor_set *set = data;

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

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

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

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

   415 		return prop1->type - prop2->type;

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

   417 		return prop1->relation - prop2->relation;

   418 	else

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

   420 }

   422 static uint32_t *

   423 uniqueify_properties(struct razor_set *set)

   424 {

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

   426 	struct array *pkgs, *p;

   427 	struct list_head *r;

   428 	uint32_t *map, *rmap;

   429 	int i, count, unique;

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

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

   433 				    count,

   434 				    sizeof(struct razor_property),

   435 				    compare_properties,

   436 				    set);

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

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

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

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

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

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

   444 			up++;

   445 			up->name = rp->name;

   446 			up->flags = 0;

   447 			up->type = rp->type;

   448 			up->relation = rp->relation;

   449 			up->version = rp->version;

   450 		}

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

   453 		rmap[map[i]] = unique;

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

   455 		*r = rp->packages;

   456 	}

   457 	free(map);

   459 	if (up != rp)

   460 		up++;

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

   462 	rp_end = up;

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

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

   465 		array_release(p);

   466 	}

   468 	free(pkgs);

   470 	return rmap;

   471 }

   473 static int

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

   475 {

   476 	const struct import_entry *e1 = p1;

   477 	const struct import_entry *e2 = p2;

   478 	const char *n1 = e1->name;

   479 	const char *n2 = e2->name;

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

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

   483 	 * sort before "foo.conf"

   484 	 *

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

   486 	 */

   487 	while (*n1 && *n2) {

   488 		if (*n1 < *n2)

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

   490 		else if (*n1 > *n2)

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

   492 		n1++;

   493 		n2++;

   494 	}

   495 	if (*n1)

   496 		return 1;

   497 	else if (*n2)

   498 		return -1;

   499 	else

   500 		return 0;

   501 }

   503 static void

   504 count_entries(struct import_directory *d)

   505 {

   506 	struct import_directory *p, *end;

   508 	p = d->files.data;

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

   510 	d->count = 0;

   511 	while (p < end) {

   512 		count_entries(p);

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

   514 		p++;

   515 	}

   516 }

   518 static void

   519 serialize_files(struct razor_set *set,

   520 		struct import_directory *d, struct array *array)

   521 {

   522 	struct import_directory *p, *end;

   523 	struct razor_entry *e = NULL;

   524 	uint32_t s;

   526 	p = d->files.data;

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

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

   529 	while (p < end) {

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

   531 		e->name = p->name;

   532 		e->flags = 0;

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

   534 		s += p->count;

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

   537 		array_release(&p->packages);

   538 		p++;

   539 	}

   540 	if (e != NULL)

   541 		e->flags |= RAZOR_ENTRY_LAST;

   543 	p = d->files.data;

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

   545 	while (p < end) {

   546 		serialize_files(set, p, array);

   547 		p++;

   548 	}

   549 }

   551 static void

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

   553 {

   554 	struct razor_property *p, *end;

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

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

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

   559 }

   561 static void

   562 build_file_tree(struct razor_importer *importer)

   563 {

   564 	int count, i, length;

   565 	struct import_entry *filenames;

   566 	char *f, *end;

   567 	uint32_t name, *r;

   568 	char dirname[256];

   569 	struct import_directory *d, root;

   570 	struct razor_entry *e;

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

   573 	razor_qsort_with_data(importer->files.data,

   574 			      count,

   575 			      sizeof (struct import_entry),

   576 			      compare_filenames,

   577 			      NULL);

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

   580 	array_init(&root.files);

   581 	array_init(&root.packages);

   582 	root.last = NULL;

   584 	filenames = importer->files.data;

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

   586 		f = filenames[i].name;

   587 		if (*f != '/')

   588 			continue;

   589 		f++;

   591 		d = &root;

   592 		while (*f) {

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

   594 			if (end == NULL)

   595 				end = f + strlen(f);

   596 			length = end - f;

   597 			memcpy(dirname, f, length);

   598 			dirname[length] ='\0';

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

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

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

   602 				d->last->name = name;

   603 				d->last->last = NULL;

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

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

   606 			}

   607 			d = d->last;

   608 			f = end + 1;

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

   610 				break;

   611 		}

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

   614 		*r = filenames[i].package;

   615 		free(filenames[i].name);

   616 	}

   618 	count_entries(&root);

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

   620 	e->name = root.name;

   621 	e->flags = RAZOR_ENTRY_LAST;

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

   623 	list_set_empty(&e->packages);

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

   627 	array_release(&importer->files);

   628 }

   630 static struct razor_entry *

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

   633 static void

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

   635 {

   636 	uint32_t *item;

   638 	while (list) {

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

   640 		 *item = list->data;

   641 		 list = list_next(list);

   642 	}

   643 }

   645 static int

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

   647 {

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

   649 	const char *pool = data;

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

   652 }

   654 static void

   655 find_file_provides(struct razor_importer *importer)

   656 {

   657 	struct razor_property *prop;

   658 	struct razor_entry *top, *entry;

   659 	struct razor_package *packages;

   660 	struct array pkgprops;

   661 	struct list *pkg;

   662 	uint32_t *req, *req_start, *req_end;

   663 	uint32_t *map, *newprop;

   664 	char *pool;

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

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

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

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

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

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

   673 				    compare_file_requires, pool);

   674 	free(map);

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

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

   678 			continue;

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

   680 		if (!entry)

   681 			continue;

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

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

   685 			prop->name = *req;

   686 			prop->type = RAZOR_PROPERTY_PROVIDES;

   687 			prop->relation = RAZOR_VERSION_EQUAL;

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

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

   691 			/* Update property list of pkg */

   692 			array_init(&pkgprops);

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

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

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

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

   697 			array_release(&pkgprops);

   698 		}

   699 	}

   701 	array_release(&importer->file_requires);

   702 }

   704 static void

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

   706 {

   707 	struct razor_package *p, *packages;

   708 	struct array *pkgs;

   709 	struct razor_entry *e, *end;

   710 	struct list *r;

   711 	uint32_t *q;

   712 	int i, count;

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

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

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

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

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

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

   721 		while (r) {

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

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

   724 			r = list_next(r);

   725 		}

   726 	}

   728 	packages = set->packages.data;

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

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

   731 		array_release(&pkgs[i]);

   732 	}

   733 	free(pkgs);

   734 }

   736 struct razor_set *

   737 razor_importer_finish(struct razor_importer *importer)

   738 {

   739 	struct razor_set *set;

   740 	uint32_t *map, *rmap;

   741 	int i, count;

   743 	build_file_tree(importer);

   744 	find_file_provides(importer);

   746 	map = uniqueify_properties(importer->set);

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

   748 	free(map);

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

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

   752 				    count,

   753 				    sizeof(struct razor_package),

   754 				    compare_packages,

   755 				    importer->set);

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

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

   759 		rmap[map[i]] = i;

   760 	free(map);

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

   763 	build_package_file_lists(importer->set, rmap);

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

   765 	free(rmap);

   767 	set = importer->set;

   768 	hashtable_release(&importer->table);

   769 	free(importer);

   771 	return set;

   772 }

   774 struct razor_package_iterator {

   775 	struct razor_set *set;

   776 	struct razor_package *package, *end;

   777 	struct list *index;

   778 };

   780 static struct razor_package_iterator *

   781 razor_package_iterator_create_with_index(struct razor_set *set,

   782 					 struct list *index)

   783 {

   784 	struct razor_package_iterator *pi;

   786 	pi = zalloc(sizeof *pi);

   787 	pi->set = set;

   788 	pi->index = index;

   790 	return pi;

   791 }

   793 struct razor_package_iterator *

   794 razor_package_iterator_create(struct razor_set *set)

   795 {

   796 	struct razor_package_iterator *pi;

   798 	pi = zalloc(sizeof *pi);

   799 	pi->set = set;

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

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

   803 	return pi;

   804 }

   806 struct razor_package_iterator *

   807 razor_package_iterator_create_for_property(struct razor_set *set,

   808 					   struct razor_property *property)

   809 {

   810 	struct list *index;

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

   813 	return razor_package_iterator_create_with_index(set, index);

   814 }

   816 int

   817 razor_package_iterator_next(struct razor_package_iterator *pi,

   818 			    struct razor_package **package,

   819 			    const char **name, const char **version)

   820 {

   821 	char *pool;

   822 	int valid;

   823 	struct razor_package *p, *packages;

   825 	if (pi->package) {

   826 		p = pi->package++;

   827 		valid = p < pi->end;

   828 	} else if (pi->index) {

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

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

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

   832 		valid = 1;

   833 	} else

   834 		valid = 0;

   836 	if (valid) {

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

   838 		*package = p;

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

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

   841 	} else {

   842 		*package = NULL;

   843 	}

   845 	return valid;

   846 }

   848 void

   849 razor_package_iterator_destroy(struct razor_package_iterator *pi)

   850 {

   851 	free(pi);

   852 }

   854 struct razor_package *

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

   856 {

   857 	struct razor_package_iterator *pi;

   858 	struct razor_package *p;

   859 	const char *name, *version;

   861 	pi = razor_package_iterator_create(set);

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

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

   864 			break;

   865 	}

   866 	razor_package_iterator_destroy(pi);

   868 	return p;

   869 }

   871 struct razor_property_iterator {

   872 	struct razor_set *set;

   873 	struct razor_property *property, *end;

   874 	struct list *index;

   875 };

   877 struct razor_property_iterator *

   878 razor_property_iterator_create(struct razor_set *set,

   879 			       struct razor_package *package)

   880 {

   881 	struct razor_property_iterator *pi;

   883 	pi = zalloc(sizeof *pi);

   884 	pi->set = set;

   886 	if (package) {

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

   888 				       &set->property_pool);

   889 	} else {

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

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

   892 	}

   894 	return pi;

   895 }

   897 int

   898 razor_property_iterator_next(struct razor_property_iterator *pi,

   899 			     struct razor_property **property,

   900 			     const char **name,

   901 			     enum razor_version_relation *relation,

   902 			     const char **version,

   903 			     enum razor_property_type *type)

   904 {

   905 	char *pool;

   906 	int valid;

   907 	struct razor_property *p, *properties;

   909 	if (pi->property) {

   910 		p = pi->property++;

   911 		valid = p < pi->end;

   912 	} else if (pi->index) {

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

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

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

   916 		valid = 1;

   917 	} else

   918 		valid = 0;

   920 	if (valid) {

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

   922 		*property = p;

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

   924 		*relation = p->relation;

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

   926 		*type = p->type;

   927 	} else {

   928 		*property = NULL;

   929 	}

   931 	return valid;

   932 }

   934 void

   935 razor_property_iterator_destroy(struct razor_property_iterator *pi)

   936 {

   937 	free(pi);

   938 }

   940 static struct razor_entry *

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

   942 {

   943 	struct razor_entry *e;

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

   945 	int len;

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

   948 	do {

   949 		n = pool + e->name;

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

   951 			return e;

   952 		len = strlen(n);

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

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

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

   956 		}

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

   959 	return NULL;

   960 }

   962 static void

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

   964 	 char *prefix, const char *pattern)

   965 {

   966 	struct razor_entry *e;

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

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

   970 	do {

   971 		n = pool + e->name;

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

   973 			continue;

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

   975 		if (e->start) {

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

   977 			*sub = '/';

   978 			strcpy (sub + 1, n);

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

   980 			*sub = '\0';

   981 		}

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

   983 }

   985 void

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

   987 {

   988 	struct razor_entry *e;

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

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

   992 		buffer[0] = '\0';

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

   994 		return;

   995 	}

   997 	strcpy(buffer, pattern);

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

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

  1000 		base = NULL;

  1001 	} else {

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

  1003 		if (p) {

  1004 			*p = '\0';

  1005 			base = p + 1;

  1006 		} else {

  1007 			base = NULL;

  1008 		}

  1009 	}

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

  1011 	if (e->start != 0)

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

  1013 }

  1015 struct razor_package_iterator *

  1016 razor_package_iterator_create_for_file(struct razor_set *set,

  1017 				       const char *filename)

  1018 {

  1019 	struct razor_entry *entry;

  1020 	struct list *index;

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

  1023 	if (entry == NULL)

  1024 		return NULL;

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

  1027 	return razor_package_iterator_create_with_index(set, index);

  1028 }

  1030 static struct list *

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

  1032 		   struct razor_entry *dir, uint32_t end,

  1033 		   char *prefix)

  1034 {

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

  1036 	uint32_t next, file;

  1037 	char *pool;

  1038 	int len;

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

  1041 	pool = set->string_pool.data;

  1043 	e = entries + dir->start;

  1044 	do {

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

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

  1047 			r = list_next(r);

  1048 			if (!r)

  1049 				return NULL;

  1050 			if (r->data >= end)

  1051 				return r;

  1052 		}

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

  1055 	e = entries + dir->start;

  1056 	do {

  1057 		if (e->start == 0)

  1058 			continue;

  1060 		if (e->flags & RAZOR_ENTRY_LAST)

  1061 			next = end;

  1062 		else {

  1063 			f = e + 1;

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

  1065 				f++;

  1066 			if (f->start == 0)

  1067 				next = end;

  1068 			else

  1069 				next = f->start;

  1070 		}

  1072 		file = r->data;

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

  1074 			len = strlen(prefix);

  1075 			prefix[len] = '/';

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

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

  1078 			prefix[len] = '\0';

  1079 		}

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

  1082 	return r;

  1083 }

  1085 void

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

  1087 {

  1088 	struct razor_package *package;

  1089 	struct list *r;

  1090 	uint32_t end;

  1091 	char buffer[512];

  1093 	package = razor_set_get_package(set, name);

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

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

  1097 	buffer[0] = '\0';

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

  1099 }

  1101 static void

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

  1103 {

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

  1105 	uint32_t *u;

  1106 	char *pool;

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

  1109 	pool = set->string_pool.data;

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

  1112 		if (r->type != RAZOR_PROPERTY_REQUIRES)

  1113 			continue;

  1115 		p = r;

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

  1117 		       p->type == r->type)

  1118 			p++;

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

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

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

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

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

  1125 		 * does.*/

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

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

  1128 			p++;

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

  1131 		 * etc) to properly determine if a requires is

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

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

  1135 		if (p == end ||

  1136 		    p->type != RAZOR_PROPERTY_PROVIDES ||

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

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

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

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

  1141 				continue;

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

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

  1144 		}

  1145 	}

  1146 }

  1148 void

  1149 razor_set_list_unsatisfied(struct razor_set *set)

  1150 {

  1151 	struct array unsatisfied;

  1152 	struct razor_property *properties, *r;

  1153 	uint32_t *u, *end;

  1154 	char *pool;

  1156 	array_init(&unsatisfied);

  1157 	razor_set_validate(set, &unsatisfied);

  1159 	end = unsatisfied.data + unsatisfied.size;

  1160 	properties = set->properties.data;

  1161 	pool = set->string_pool.data;

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

  1164 		r = properties + *u;

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

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

  1167 			       &pool[r->name]);

  1168 		else

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

  1170 			       &pool[r->name],

  1171 			       &pool[r->version]);

  1172 	}

  1174 	array_release(&unsatisfied);

  1175 }

  1177 #define UPSTREAM_SOURCE 0x80

  1179 struct source {

  1180 	struct razor_set *set;

  1181 	uint32_t *property_map;

  1182 	uint32_t *file_map;

  1183 };

  1185 struct razor_merger {

  1186 	struct razor_set *set;

  1187 	struct hashtable table;

  1188 	struct source source1;

  1189 	struct source source2;

  1190 };

  1192 static struct razor_merger *

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

  1194 {

  1195 	struct razor_merger *merger;

  1196 	int count;

  1197 	size_t size;

  1199 	merger = zalloc(sizeof *merger);

  1200 	merger->set = razor_set_create();

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

  1203 	merger->source1.set = set1;

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

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

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

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

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

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

  1211 	merger->source2.set = set2;

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

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

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

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

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

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

  1219 	return merger;

  1220 }

  1222 static void

  1223 add_package(struct razor_merger *merger,

  1224 	    struct razor_package *package, struct source *source,

  1225 	    uint32_t flags)

  1226 {

  1227 	char *pool;

  1228 	struct list *r;

  1229 	struct razor_package *p;

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

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

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

  1234 	p->flags = flags;

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

  1236 					&pool[package->version]);

  1238 	p->properties = package->properties;

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

  1240 	while (r) {

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

  1242 		r = list_next(r);

  1243 	}

  1245 	p->files = package->files;

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

  1247 	while (r) {

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

  1249 		r = list_next(r);

  1250 	}

  1251 }

  1253 static uint32_t

  1254 add_property(struct razor_merger *merger,

  1255 	     const char *name, enum razor_version_relation relation,

  1256 	     const char *version, int type)

  1257 {

  1258 	struct razor_property *p;

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

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

  1262 	p->flags = 0;

  1263 	p->type = type;

  1264 	p->relation = relation;

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

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

  1268 }

  1270 static void

  1271 merge_properties(struct razor_merger *merger)

  1272 {

  1273 	struct razor_property *p1, *p2;

  1274 	struct razor_set *set1, *set2;

  1275 	uint32_t *map1, *map2;

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

  1277 	char *pool1, *pool2;

  1279 	set1 = merger->source1.set;

  1280 	set2 = merger->source2.set;

  1281 	map1 = merger->source1.property_map;

  1282 	map2 = merger->source2.property_map;

  1284 	i = 0;

  1285 	j = 0;

  1286 	pool1 = set1->string_pool.data;

  1287 	pool2 = set2->string_pool.data;

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

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

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

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

  1293 			i++;

  1294 			continue;

  1295 		}

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

  1297 			j++;

  1298 			continue;

  1299 		}

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

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

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

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

  1304 		else if (i < count1)

  1305 			cmp = -1;

  1306 		else

  1307 			cmp = 1;

  1308 		if (cmp == 0)

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

  1310 		if (cmp == 0)

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

  1312 		if (cmp == 0)

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

  1314 					 &pool2[p2->version]);

  1315 		if (cmp < 0) {

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

  1317 						 &pool1[p1->name],

  1318 						 p1->relation,

  1319 						 &pool1[p1->version],

  1320 						 p1->type);

  1321 		} else if (cmp > 0) {

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

  1323 						 &pool2[p2->name],

  1324 						 p2->relation,

  1325 						 &pool2[p2->version],

  1326 						 p2->type);

  1327 		} else  {

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

  1329 							     &pool1[p1->name],

  1330 							     p1->relation,

  1331 							     &pool1[p1->version],

  1332 							     p1->type);

  1333 		}

  1334 	}

  1335 }

  1337 static void

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

  1339 		uint32_t *map, struct array *pool)

  1340 {

  1341 	uint32_t r;

  1342 	struct list *p, *q;

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

  1345 	p = list_first(properties, source_pool);

  1346 	while (p) {

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

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

  1349 		q->flags = p->flags;

  1350 		p = list_next(p);

  1351 	}

  1353 	list_set_ptr(properties, r);

  1354 }

  1356 static uint32_t

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

  1358 {

  1359 	struct razor_entry *e;

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

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

  1363 	e->flags = 0;

  1364 	e->start = 0;

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

  1367 }

  1369 /* FIXME. Blah */

  1370 static int

  1371 fix_file_map(uint32_t *map,

  1372 	     struct razor_entry *files,

  1373 	     struct razor_entry *top)

  1374 {

  1375 	uint32_t e;

  1376 	int found_file = 0;

  1378 	e = top->start;

  1379 	do {

  1380 		if (files[e].start)

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

  1382 		if (map[e])

  1383 			found_file = 1;

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

  1386 	if (found_file)

  1387 		map[top - files] = 1;

  1388 	return found_file;

  1389 }

  1391 struct merge_directory {

  1392 	uint32_t merged, dir1, dir2;

  1393 };

  1395 static void

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

  1397 {

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

  1399 	struct razor_set *set1, *set2;

  1400 	struct array merge_stack;

  1401 	struct merge_directory *child_md, *end_md;

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

  1403 	int cmp;

  1404 	char *pool1, *pool2;

  1406 	set1 = merger->source1.set;

  1407 	set2 = merger->source2.set;

  1408 	map1 = merger->source1.file_map;

  1409 	map2 = merger->source2.file_map;

  1410 	pool1 = set1->string_pool.data;

  1411 	pool2 = set2->string_pool.data;

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

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

  1415 	array_init(&merge_stack);

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

  1418 	last = 0;

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

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

  1421 	while (e1 || e2) {

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

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

  1424 				e1 = NULL;

  1425 			continue;

  1426 		}

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

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

  1429 				e2 = NULL;

  1430 			continue;

  1431 		}

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

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

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

  1435 				e1 = NULL;

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

  1437 				e2 = NULL;

  1438 			continue;

  1439 		}

  1441 		if (!e1)

  1442 			cmp = 1;

  1443 		else if (!e2)

  1444 			cmp = -1;

  1445 		else {

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

  1447 				      &pool2[e2->name]);

  1448 		}

  1450 		if (cmp < 0) {

  1451 			if (map1[e1 - root1]) {

  1452 				map1[e1 - root1] = last =

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

  1454 				if (e1->start) {

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

  1456 					child_md->merged = last;

  1457 					child_md->dir1 = e1->start;

  1458 					child_md->dir2 = 0;

  1459 				}

  1460 			}

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

  1462 				e1 = NULL;

  1463 		} else if (cmp > 0) {

  1464 			if (map2[e2 - root2]) {

  1465 				map2[e2 - root2] = last =

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

  1467 				if (e2->start) {

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

  1469 					child_md->merged = last;

  1470 					child_md->dir1 = 0;

  1471 					child_md->dir2 = e2->start;

  1472 				}

  1473 			}

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

  1475 				e2 = NULL;

  1476 		} else {

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

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

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

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

  1481 				child_md->merged = last;

  1482 				child_md->dir1 = e1->start;

  1483 				child_md->dir2 = e2->start;

  1484 			}

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

  1486 				e1 = NULL;

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

  1488 				e2 = NULL;

  1489 		}

  1490 	}

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

  1493 	if (last) {

  1494 		mroot[last].flags = RAZOR_ENTRY_LAST;

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

  1496 	} else

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

  1499 	end_md = merge_stack.data + merge_stack.size;

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

  1501 		merge_one_directory(merger, child_md);

  1502 	array_release(&merge_stack);

  1503 }

  1505 static void

  1506 merge_files(struct razor_merger *merger)

  1507 {

  1508 	struct razor_entry *root;

  1509 	struct merge_directory md;

  1510 	uint32_t *map1, *map2;

  1512 	map1 = merger->source1.file_map;

  1513 	map2 = merger->source2.file_map;

  1515 	md.merged = 0;

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

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

  1519 		if (root->start)

  1520 			fix_file_map(map1, root, root);

  1521 		md.dir1 = root->start;

  1522 	} else

  1523 		md.dir1 = 0;

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

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

  1527 		if (root->start)

  1528 			fix_file_map(map2, root, root);

  1529 		md.dir2 = root->start;

  1530 	} else

  1531 		md.dir2 = 0;

  1533 	merge_one_directory(merger, &md);

  1534 }

  1536 static void

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

  1538 	   uint32_t *map, struct array *pool)

  1539 {

  1540 	uint32_t r;

  1541 	struct list *p, *q;

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

  1544 	p = list_first(files, source_pool);

  1545 	while (p) {

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

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

  1548 		q->flags = p->flags;

  1549 		p = list_next(p);

  1550 	}

  1552 	list_set_ptr(files, r);

  1553 }

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

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

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

  1558  * the arrays for their properties. */

  1559 static void

  1560 rebuild_property_package_lists(struct razor_set *set)

  1561 {

  1562 	struct array *pkgs, *a;

  1563 	struct razor_package *pkg, *pkg_end;

  1564 	struct razor_property *prop, *prop_end;

  1565 	struct list *r;

  1566 	uint32_t *q;

  1567 	int count;

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

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

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

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

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

  1575 		while (r) {

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

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

  1578 			r = list_next(r);

  1579 		}

  1580 	}

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

  1583 	a = pkgs;

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

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

  1586 		array_release(a);

  1587 	}

  1588 	free(pkgs);

  1589 }

  1591 static void

  1592 rebuild_file_package_lists(struct razor_set *set)

  1593 {

  1594 	struct array *pkgs, *a;

  1595 	struct razor_package *pkg, *pkg_end;

  1596 	struct razor_entry *entry, *entry_end;

  1597 	struct list *r;

  1598 	uint32_t *q;

  1599 	int count;

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

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

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

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

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

  1607 		while (r) {

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

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

  1610 			r = list_next(r);

  1611 		}

  1612 	}

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

  1615 	a = pkgs;

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

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

  1618 		array_release(a);

  1619 	}

  1620 	free(pkgs);

  1621 }

  1623 static struct razor_set *

  1624 razor_merger_finish(struct razor_merger *merger)

  1625 {

  1626 	struct razor_set *result;

  1627 	struct razor_package *p, *pend;

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

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

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

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

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

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

  1635 	 * property list for both sets. */

  1637 	merge_properties(merger);

  1638 	merge_files(merger);

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

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

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

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

  1645 		struct source *src;

  1647 		if (p->flags & UPSTREAM_SOURCE)

  1648 			src = &merger->source2;

  1649 		else

  1650 			src = &merger->source1;

  1652 		emit_properties(&p->properties,

  1653 				&src->set->property_pool,

  1654 				src->property_map,

  1655 				&merger->set->property_pool);

  1656 		emit_files(&p->files,

  1657 			   &src->set->file_pool,

  1658 			   src->file_map,

  1659 			   &merger->set->file_pool);

  1660 		p->flags &= ~UPSTREAM_SOURCE;

  1661 	}

  1663 	rebuild_property_package_lists(merger->set);

  1664 	rebuild_file_package_lists(merger->set);

  1666 	result = merger->set;

  1667 	hashtable_release(&merger->table);

  1668 	free(merger);

  1670 	return result;

  1671 }

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

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

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

  1676  **/

  1678 void

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

  1680 	       razor_package_callback_t callback, void *data)

  1681 {

  1682 	struct razor_package_iterator *pi1, *pi2;

  1683 	struct razor_package *p1, *p2;

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

  1685 	int res;

  1687 	pi1 = razor_package_iterator_create(set);

  1688 	pi2 = razor_package_iterator_create(upstream);

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

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

  1693 	while (p1 || p2) {

  1694 		if (p1 && p2) {

  1695 			res = strcmp(name1, name2);

  1696 			if (res == 0)

  1697 				res = versioncmp(version1, version2);

  1698 		} else {

  1699 			res = 0;

  1700 		}

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

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

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

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

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

  1708 			razor_package_iterator_next(pi1, &p1,

  1709 						    &name1, &version1);

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

  1711 			razor_package_iterator_next(pi2, &p2,

  1712 						    &name2, &version2);

  1713 	}

  1715 	razor_package_iterator_destroy(pi1);

  1716 	razor_package_iterator_destroy(pi2);

  1717 }

  1719 struct razor_transaction;

  1720 struct razor_transaction_package;

  1721 struct razor_transaction_resolver;

  1723 struct razor_transaction {

  1724 	int package_count, errors;

  1725 	struct razor_set *system, *upstream;

  1727 	struct bitarray syspkgs, uppkgs;

  1728 	struct array packages;

  1729 };

  1731 struct razor_transaction_package {

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

  1733 	struct razor_package *old_package, *new_package;

  1734 	enum razor_transaction_package_state state;

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

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

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

  1739 	 * additional information.

  1740 	 *

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

  1742 	 * required something that this package provides. If dep_type

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

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

  1745 	 *

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

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

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

  1749 	 *

  1750 	 * For OLD_CONFLICT or NEW_CONFLICT, dep_package is an

  1751 	 * existing package that conflicts with this one. The

  1752 	 * conflicting property comes from the already-installed

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

  1754 	 * for NEW_CONFLICT.

  1755 	 *

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

  1757 	 * but the name field will be NULL.

  1758 	 */

  1759 	const char *dep_package;

  1760 	enum razor_property_type dep_type;

  1761 	const char *dep_property;

  1762 	enum razor_version_relation dep_relation;

  1763 	const char *dep_version;

  1764 };

  1766 static int

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

  1768 {

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

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

  1771 }

  1773 static int

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

  1775 {

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

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

  1778 }

  1780 static struct razor_package *

  1781 property_provider_package(struct razor_transaction *trans,

  1782 			  struct razor_property *prop,

  1783 			  int installed)

  1784 {

  1785 	struct razor_set *set;

  1786 	struct bitarray *pkgbits;

  1787 	struct razor_package *pkgs;

  1788 	struct list *p;

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

  1791 		return NULL;

  1792 	else if (!installed &&

  1793 		 prop->type != RAZOR_PROPERTY_PROVIDES &&

  1794 		 prop->type != RAZOR_PROPERTY_OBSOLETES)

  1795 		return NULL;

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

  1798 		set = trans->system;

  1799 		pkgbits = &trans->syspkgs;

  1800 	} else {

  1801 		set = trans->upstream;

  1802 		pkgbits = &trans->uppkgs;

  1803 	}

  1804 	pkgs = set->packages.data;

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

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

  1808 			continue;

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

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

  1811 			return &pkgs[p->data];

  1812 	}

  1813 	return NULL;

  1814 }

  1816 static int

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

  1818 {

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

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

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

  1823 		return 1;

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

  1825 		return -1;

  1826 	else

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

  1828 }

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

  1831 static void

  1832 resolve_new_packages(struct razor_transaction *trans,

  1833 		     int start, int end)

  1834 {

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

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

  1837 	struct razor_transaction_package **packages;

  1838 	const char *spool, *upool;

  1839 	int i;

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

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

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

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

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

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

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

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

  1850 	 * descriptions.

  1851 	 */

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

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

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

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

  1856 	      compare_transaction_packages);

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

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

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

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

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

  1863 			continue;

  1865 		spkg = NULL;

  1866 		while (sp < sp_end &&

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

  1868 			sp++;

  1869 		while (sp < sp_end &&

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

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

  1872 			sp++;

  1874 		upkg = NULL;

  1875 		while (up < up_end &&

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

  1877 			up++;

  1878 		while (up < up_end &&

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

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

  1881 			up++;

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

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

  1885 			if (spkg) {

  1886 				packages[i]->old_package = spkg;

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

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

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

  1890 			}

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

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

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

  1894 				trans->errors++;

  1895 			}

  1896 		} else {

  1897 			if (upkg) {

  1898 				packages[i]->new_package = upkg;

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

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

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

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

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

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

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

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

  1908 				}

  1910 				if (spkg) {

  1911 					packages[i]->old_package = spkg;

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

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

  1914 						packages[i]->state = RAZOR_PACKAGE_UP_TO_DATE;

  1915 						trans->errors++;

  1916 						continue;

  1917 					}

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

  1919 				}

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

  1921 			}

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

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

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

  1925 				trans->errors++;

  1926 			}

  1927 		}

  1928 	}

  1929 }

  1931 static void

  1932 find_all_packages(struct razor_transaction *trans)

  1933 {

  1934 	struct razor_transaction_package *tp;

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

  1936 	const char *spool, *upool;

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

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

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

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

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

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

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

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

  1947 			up++;

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

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

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

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

  1952 			tp->old_package = sp;

  1953 			tp->new_package = up;

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

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

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

  1957 			tp->state = RAZOR_PACKAGE_INSTALL;

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

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

  1960 		}

  1961 	}

  1962 }

  1964 static int

  1965 provider_satisfies_requirement(struct razor_property *provider,

  1966 			       const char *provider_strings,

  1967 			       struct razor_property *requirement,

  1968 			       const char *requirement_strings)

  1969 {

  1970 	int cmp, len;

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

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

  1974 	if (!*required)

  1975 		return 1;

  1976 	if (!*provided) {

  1977 		if (requirement->relation >= RAZOR_VERSION_EQUAL)

  1978 			return 1;

  1979 		else

  1980 			return 0;

  1981 	}

  1983 	cmp = versioncmp(provided, required);

  1985 	switch (requirement->relation) {

  1986 	case RAZOR_VERSION_LESS:

  1987 		return cmp < 0;

  1989 	case RAZOR_VERSION_LESS_OR_EQUAL:

  1990 		if (cmp <= 0)

  1991 			return 1;

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

  1994 	case RAZOR_VERSION_EQUAL:

  1995 		if (cmp == 0)

  1996 			return 1;

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

  1999 		len = strlen(required);

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

  2001 			return 1;

  2002 		return 0;

  2004 	case RAZOR_VERSION_GREATER_OR_EQUAL:

  2005 		return cmp >= 0;

  2007 	case RAZOR_VERSION_GREATER:

  2008 		return cmp > 0;

  2009 	}

  2011 	/* shouldn't happen */

  2012 	return 0;

  2013 }

  2015 static struct razor_package *

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

  2017 		      const char *filename, int installed)

  2018 {

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

  2020 	struct razor_entry *entry;

  2021 	struct list *p;

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

  2024 		return 0;

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

  2027 	if (!entry)

  2028 		return 0;

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

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

  2032 			return &pkgs[p->data];

  2033 	}

  2034 	return NULL;

  2035 }

  2037 static struct razor_package *

  2038 find_installed_package_for_file(struct razor_transaction *trans,

  2039 				const char *filename)

  2040 {

  2041 	struct razor_package *pkg;

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

  2044 				    filename, 1);

  2045 	if (!pkg)

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

  2047 					    filename, 1);

  2048 	return pkg;

  2049 }

  2051 static struct razor_package *

  2052 find_uninstalled_package_for_file(struct razor_transaction *trans,

  2053 				  const char *filename)

  2054 {

  2055 	struct razor_package *pkg;

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

  2058 				    filename, 0);

  2059 	if (!pkg)

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

  2061 					    filename, 0);

  2062 	return pkg;

  2063 }

  2065 static struct razor_property *

  2066 skip_to_matching_property(struct razor_transaction *trans,

  2067 			  struct razor_property *match,

  2068 			  struct razor_property *prop)

  2069 {

  2070 	struct razor_set *mset, *pset;

  2071 	const char *ppool, *mpool;

  2072 	struct razor_property *prop_end;

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

  2075 		mset = trans->system;

  2076 	else

  2077 		mset = trans->upstream;

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

  2080 		pset = trans->system;

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

  2082 		pset = trans->upstream;

  2083 	else

  2084 		return prop;

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

  2087 	ppool = pset->string_pool.data;

  2088 	mpool = mset->string_pool.data;

  2090 	while (prop < prop_end &&

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

  2092 		prop++;

  2093 	return prop;

  2094 }

  2096 static struct razor_package *

  2097 find_package_matching(struct razor_transaction *trans, int installed,

  2098 		      struct razor_property *prop,

  2099 		      struct razor_property *req,

  2100 		      struct razor_set *req_set)

  2101 {

  2102 	struct razor_set *set;

  2103 	struct bitarray *pkgbits;

  2104 	struct razor_package *pkgs;

  2105 	struct razor_property *props, *prop_end;

  2106 	enum razor_property_type match_type;

  2107 	const char *pool;

  2108 	const char *rpool;

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

  2110 	int match;

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

  2113 		set = trans->system;

  2114 		pkgbits = &trans->syspkgs;

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

  2116 		set = trans->upstream;

  2117 		pkgbits = &trans->uppkgs;

  2118 	} else

  2119 		return NULL;

  2121 	if (!req_set) {

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

  2123 			req_set = trans->system;

  2124 		else

  2125 			req_set = trans->upstream;

  2126 	}

  2127 	rpool = req_set->string_pool.data;

  2129 	if (req->type == RAZOR_PROPERTY_PROVIDES)

  2130 		match_type = RAZOR_PROPERTY_CONFLICTS;

  2131 	else

  2132 		match_type = RAZOR_PROPERTY_PROVIDES;

  2134 	pkgs = set->packages.data;

  2135 	props = set->properties.data;

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

  2137 	pool = set->string_pool.data;

  2139 	/* Find first matching property */

  2140 	while (prop < prop_end &&

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

  2142 		prop++;

  2143 	if (prop == prop_end ||

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

  2145 		return NULL;

  2147 	if (prop->type < match_type) {

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

  2149 			prop++;

  2150 	} else {

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

  2152 			prop--;

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

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

  2155 			prop--;

  2156 	}

  2158 	/* Scan matching properties */

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

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

  2161 		if (match_type == RAZOR_PROPERTY_PROVIDES)

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

  2163 		else

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

  2165 		if (match) {

  2166 			struct list *pkg;

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

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

  2170 					continue;

  2171 				if (!match_name ||

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

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

  2174 					return &pkgs[pkg->data];

  2175 			}

  2176 		}

  2177 		prop++;

  2178 	}

  2180 	return NULL;

  2181 }

  2183 static struct razor_package *

  2184 find_installed_package_for_property(struct razor_transaction *trans,

  2185 				    struct razor_property *sys_start,

  2186 				    struct razor_property *up_start,

  2187 				    struct razor_property *req)

  2188 {

  2189 	struct razor_package *pkg;

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

  2192 	if (!pkg)

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

  2194 	return pkg;

  2195 }

  2197 static struct razor_package *

  2198 find_uninstalled_package_for_property(struct razor_transaction *trans,

  2199 				      struct razor_property *sys_start,

  2200 				      struct razor_property *up_start,

  2201 				      struct razor_property *req)

  2202 {

  2203 	struct razor_package *pkg;

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

  2206 	if (!pkg)

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

  2208 	return pkg;

  2209 }

  2211 static struct razor_transaction_package *

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

  2213 {

  2214 	struct razor_transaction_package *packages;

  2215 	int count, i;

  2217 	packages = trans->packages.data;

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

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

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

  2221 			return &packages[i];

  2222 	}

  2223 	return NULL;

  2224 }

  2226 /* FIXME? */

  2227 static int

  2228 prop_is_being_installed(struct razor_transaction *trans,

  2229 			struct razor_property *prop)

  2230 {

  2231 	struct list *pkg;

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

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

  2235 			return 1;

  2236 	}

  2237 	return 0;

  2238 }

  2240 static int

  2241 prop_is_being_removed(struct razor_transaction *trans,

  2242 		      struct razor_property *prop)

  2243 {

  2244 	struct list *pkg;

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

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

  2248 			return 0;

  2249 	}

  2250 	return 1;

  2251 }

  2253 static int

  2254 prop_is_being_updated(struct razor_transaction *trans,

  2255 		      struct razor_property *prop)

  2256 {

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

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

  2259 	struct razor_transaction_package *tp;

  2260 	struct list *pkg;

  2262 	/* Assumes prop_is_being_removed returns true */

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

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

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

  2267 			return 0;

  2268 	}

  2269 	return 1;

  2270 }

  2272 static void

  2273 add_transaction_package(struct razor_transaction *trans,

  2274 			struct razor_package *new_package,

  2275 			struct razor_package *old_package,

  2276 			enum razor_transaction_package_state state,

  2277 			const char *req_package,

  2278 			struct razor_property *req_prop)

  2279 {

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

  2281 	struct bitarray *reqpkgbits;

  2282 	struct razor_transaction_package *tp, *already;

  2283 	const char *pool;

  2284 	struct razor_package *pkgs;

  2285 	struct list *pkg;

  2286 	int contradiction = 0;

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

  2289 		new_package_set = trans->system;

  2290 	else

  2291 		new_package_set = trans->upstream;

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

  2293 		old_package_set = trans->system;

  2294 	else

  2295 		old_package_set = trans->upstream;

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

  2297 		req_set = trans->system;

  2298 		reqpkgbits = &trans->syspkgs;

  2299 	} else {

  2300 		req_set = trans->upstream;

  2301 		reqpkgbits = &trans->uppkgs;

  2302 	}

  2304 	if (new_package) {

  2305 		pool = new_package_set->string_pool.data;

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

  2307 		if (already) {

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

  2309 				/* Already taken care of */

  2310 				return;

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

  2312 				   already->state == RAZOR_PACKAGE_FORCED_UPDATE) {

  2313 				already->new_package = new_package;

  2314 				return;

  2315 			}

  2317 			/* Oops. We lose */

  2318 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2319 				contradiction = 1;

  2320 		}

  2321 	} else if (old_package) {

  2322 		pool = old_package_set->string_pool.data;

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

  2324 		if (already) {

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

  2326 				/* Already taken care of */

  2327 				return;

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

  2329 				already->old_package = old_package;

  2330 				return;

  2331 			}

  2333 			/* Oops. We lose */

  2334 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2335 				contradiction = 1;

  2336 		}

  2337 	} else

  2338 		state = RAZOR_PACKAGE_UNSATISFIABLE;

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

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

  2343 	if (new_package) {

  2344 		pool = new_package_set->string_pool.data;

  2345 		tp->new_package = new_package;

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

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

  2349 		pkgs = new_package_set->packages.data;

  2350 	}

  2351 	if (old_package) {

  2352 		pool = old_package_set->string_pool.data;

  2353 		tp->old_package = old_package;

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

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

  2357 		pkgs = old_package_set->packages.data;

  2358 	}

  2360 	tp->state = state;

  2361 	if (state != RAZOR_PACKAGE_INSTALL &&

  2362 	    state != RAZOR_PACKAGE_FORCED_UPDATE &&

  2363 	    state != RAZOR_PACKAGE_REMOVE &&

  2364 	    state != RAZOR_PACKAGE_OBSOLETED)

  2365 		trans->errors++;

  2367 	if (contradiction) {

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

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

  2370 		 */

  2371 		add_transaction_package(trans, new_package, old_package,

  2372 					RAZOR_PACKAGE_CONTRADICTION,

  2373 					NULL, NULL);

  2374 	}

  2376 	if (req_package)

  2377 		tp->dep_package = req_package;

  2378 	if (!req_prop)

  2379 		return;

  2381 	pool = req_set->string_pool.data;

  2382 	pkgs = req_set->packages.data;

  2383 	if (!req_package) {

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

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

  2386 				break;

  2387 		}

  2388 		if (pkg)

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

  2390 	}

  2392 	tp->dep_type = req_prop->type;

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

  2394 	tp->dep_relation = req_prop->relation;

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

  2396 }

  2398 static void

  2399 razor_transaction_satisfy(struct razor_transaction *trans)

  2400 {

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

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

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

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

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

  2406 	struct list *reqpkg;

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

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

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

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

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

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

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

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

  2417 	sp = sprops;

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

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

  2420 		 * to-be-installed.

  2421 		 */

  2422 		while (up < uprop_end &&

  2423 		       !prop_is_being_installed(trans, up))

  2424 			up++;

  2425 		if (up == uprop_end)

  2426 			break;

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

  2429 		switch (up->type) {

  2430 		case RAZOR_PROPERTY_REQUIRES:

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

  2432 				break;

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

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

  2436 				/* Requires something that is either installed

  2437 				 * or to-be-installed.

  2438 				 */

  2439 				break;

  2440 			}

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

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

  2444 			if (!pkg)

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

  2446 			add_transaction_package(trans, pkg, NULL,

  2447 						RAZOR_PACKAGE_INSTALL,

  2448 						NULL, up);

  2449 			break;

  2451 		case RAZOR_PROPERTY_PROVIDES:

  2452 			/* find_installed_package_for_property works backwards

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

  2454 			 */

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

  2456 			if (!pkg)

  2457 				break;

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

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

  2461 				 * finding an upgrade

  2462 				 */

  2463 				add_transaction_package(trans, NULL, pkg,

  2464 							RAZOR_PACKAGE_FORCED_UPDATE,

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

  2466 			} else {

  2467 				add_transaction_package(trans, NULL, pkg,

  2468 							RAZOR_PACKAGE_CONTRADICTION,

  2469 							NULL, up);

  2470 			}

  2471 			break;

  2473 		case RAZOR_PROPERTY_CONFLICTS:

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

  2475 			if (!pkg)

  2476 				break;

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

  2479 				/* Conflicts with something already installed.

  2480 				 * Try to upgrade out.

  2481 				 */

  2482 				add_transaction_package(trans, NULL, pkg,

  2483 							RAZOR_PACKAGE_FORCED_UPDATE,

  2484 							NULL, up);

  2485 			} else {

  2486 				add_transaction_package(trans, pkg, NULL,

  2487 							RAZOR_PACKAGE_CONTRADICTION,

  2488 							NULL, up);

  2489 			}

  2490 			break;

  2492 		case RAZOR_PROPERTY_OBSOLETES:

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

  2494 			if (pkg) {

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

  2496 				 * will add a CONTRADICTION error as well.

  2497 				 */

  2498 				add_transaction_package(trans, NULL, pkg,

  2499 							RAZOR_PACKAGE_OBSOLETED,

  2500 							NULL, up);

  2501 			}

  2502 			break;

  2504 		default:

  2505 			/* can't happen */

  2506 			break;

  2507 		}

  2508 	}

  2510 	up = uprops;

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

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

  2513 		 * to-be-removed.

  2514 		 */

  2515 		while (sp < sprop_end &&

  2516 		       (sp->type != RAZOR_PROPERTY_PROVIDES ||

  2517 			!prop_is_being_removed(trans, sp)))

  2518 			sp++;

  2519 		if (sp == sprop_end)

  2520 			break;

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

  2524 		/* Skip 'up' to match */

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

  2526 		ur = first_up = up;

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

  2529 		 * already be installing an identical PROVIDES, so

  2530 		 * check for that.

  2531 		 */

  2532 		while (up < uprop_end &&

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

  2534 		       (up->type != RAZOR_PROPERTY_PROVIDES ||

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

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

  2537 			up++;

  2538 		if (up < uprop_end &&

  2539 		    up->type == RAZOR_PROPERTY_PROVIDES &&

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

  2541 		    sp->relation == up->relation &&

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

  2543 		    prop_is_being_installed(trans, up)) {

  2544 			up = first_up;

  2545 			continue;

  2546 		}

  2547 		up = first_up;

  2549 		/* For all still-installed packages that require

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

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

  2552 		 * not, either remove or attempt to update the

  2553 		 * package, depending on why the required property has

  2554 		 * disappeared

  2555 		 */

  2556 		sr = sp;

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

  2558 			sr--;

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

  2560 			if (prop_is_being_removed(trans, sr))

  2561 				continue;

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

  2563 				continue;

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

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

  2567 					continue;

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

  2569 				if (prop_is_being_updated(trans, sp)) {

  2570 					add_transaction_package(trans, NULL, pkg,

  2571 								RAZOR_PACKAGE_FORCED_UPDATE,

  2572 								removed_package, NULL);

  2573 				} else {

  2574 					add_transaction_package(trans, NULL, pkg,

  2575 								RAZOR_PACKAGE_REMOVE,

  2576 								removed_package, sr);

  2577 				}

  2578 			}

  2579 		}

  2580 	}

  2581 }

  2583 struct razor_transaction *

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

  2585 			 int update_count, const char **update_packages,

  2586 			 int remove_count, const char **remove_packages)

  2587 {

  2588 	struct razor_transaction *trans;

  2589 	struct razor_transaction_package *tp;

  2590 	int start, end, i;

  2592 	trans = zalloc(sizeof *trans);

  2594 	trans->system = system;

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

  2596 	array_init(&trans->packages);

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

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

  2599 	trans->errors = 0;

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

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

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

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

  2605 			tp->name = update_packages[i];

  2606 			tp->state = RAZOR_PACKAGE_INSTALL;

  2607 		}

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

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

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

  2611 			tp->name = remove_packages[i];

  2612 			tp->state = RAZOR_PACKAGE_REMOVE;

  2613 		}

  2614 	} else

  2615 		find_all_packages(trans);

  2617 	start = 0;

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

  2620 	while (start != end) {

  2621 		resolve_new_packages(trans, start, end);

  2622 		if (trans->errors)

  2623 			break;

  2625 		razor_transaction_satisfy(trans);

  2627 		start = end;

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

  2629 	}

  2631 	trans->package_count = end;

  2633 	return trans;

  2634 }

  2636 const char * const razor_version_relations[] = {

  2637 	/* same order as enum razor_version_relation */

  2638 	"<", "<=", "=", ">=", ">"

  2639 };

  2641 const char * const razor_property_types[] = {

  2642 	/* same order as enum razor_property_type */

  2643 	"requires", "provides", "conflicts with", "obsoletes"

  2644 };

  2646 static void

  2647 print_requirement(struct razor_transaction_package *p)

  2648 {

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

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

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

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

  2653 		if (*p->dep_version) {

  2654 			printf(" %s %s",

  2655 			       razor_version_relations[p->dep_relation],

  2656 			       p->dep_version);

  2657 		}

  2658 	} else {

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

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

  2661 		if (*p->dep_version) {

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

  2663 			       razor_property_types[p->dep_type],

  2664 			       p->dep_property,

  2665 			       razor_version_relations[p->dep_relation],

  2666 			       p->dep_version);

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

  2668 			printf(", which %s %s",

  2669 			       razor_property_types[p->dep_type],

  2670 			       p->dep_property);

  2671 		}

  2672 	}

  2673 }

  2675 int

  2676 razor_transaction_describe(struct razor_transaction *trans)

  2677 {

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

  2679 	int errors_only = 0;

  2681 	tps = trans->packages.data;

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

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

  2684 		switch (p->state) {

  2685 		case RAZOR_PACKAGE_INSTALL:

  2686 			if (errors_only)

  2687 				break;

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

  2690 			if (p->dep_package)

  2691 				print_requirement(p);

  2692 			printf("\n");

  2693 			break;

  2695 		case RAZOR_PACKAGE_FORCED_UPDATE:

  2696 			if (errors_only)

  2697 				break;

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

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

  2701 			break;

  2703 		case RAZOR_PACKAGE_REMOVE:

  2704 			if (errors_only)

  2705 				break;

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

  2707 			if (p->dep_package) {

  2708 				printf(" which required %s",

  2709 				       p->dep_package);

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

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

  2712 			}

  2713 			printf("\n");

  2714 			break;

  2716 		case RAZOR_PACKAGE_OBSOLETED:

  2717 			if (errors_only)

  2718 				break;

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

  2720 			if (p->dep_package) {

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

  2722 				       p->dep_package);

  2723 			}

  2724 			printf("\n");

  2725 			break;

  2727 		case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:

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

  2729 			if (p->dep_package) {

  2730 				printf(" (which is required");

  2731 				print_requirement(p);

  2732 				printf(")");

  2733 			}

  2734 			printf("\n");

  2735 			errors_only = 1;

  2736 			break;

  2738 		case RAZOR_PACKAGE_UPDATE_UNAVAILABLE:

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

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

  2741 			errors_only = 1;

  2742 			break;

  2744 		case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:

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

  2746 			errors_only = 1;

  2747 			break;

  2749 		case RAZOR_PACKAGE_UP_TO_DATE:

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

  2751 			if (p->dep_package)

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

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

  2754 			errors_only = 1;

  2755 			break;

  2757 		case RAZOR_PACKAGE_CONTRADICTION:

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

  2759 			errors_only = 1;

  2760 			break;

  2762 		case RAZOR_PACKAGE_OLD_CONFLICT:

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

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

  2765 			if (*p->dep_version) {

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

  2767 				       p->dep_property,

  2768 				       razor_version_relations[p->dep_relation],

  2769 				       p->dep_version);

  2770 			} else

  2771 				printf("it");

  2772 			printf("\n");

  2774 			errors_only = 1;

  2775 			break;

  2777 		case RAZOR_PACKAGE_NEW_CONFLICT:

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

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

  2780 			if (*p->dep_version) {

  2781 				printf(" %s %s",

  2782 				       razor_version_relations[p->dep_relation],

  2783 				       p->dep_version);

  2784 			}

  2785 			printf("\n");

  2787 			errors_only = 1;

  2788 			break;

  2790 		case RAZOR_PACKAGE_UNSATISFIABLE:

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

  2792 			if (*p->dep_version) {

  2793 				printf(" %s %s",

  2794 					razor_version_relations[p->dep_relation],

  2795 					p->dep_version);

  2796 			}

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

  2798 				p->dep_package);

  2799 			errors_only = 1;

  2800 			break;

  2802 		default:

  2803 			/* Shouldn't actually happen */

  2804 			break;

  2805 		}

  2806 	}

  2808 	return trans->errors;

  2809 }

  2811 int

  2812 razor_transaction_unsatisfied_property(struct razor_transaction *trans,

  2813 				       const char *name,

  2814 				       enum razor_version_relation rel,

  2815 				       const char *version)

  2816 {

  2817 	struct razor_transaction_package *p, *end;

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

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

  2821 		if (p->state != RAZOR_PACKAGE_UNSATISFIABLE)

  2822 			continue;

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

  2824 		    rel != p->dep_relation ||

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

  2826 			continue;

  2828 		return 1;

  2829 	}

  2831 	return 0;

  2832 }

  2834 struct razor_set *

  2835 razor_transaction_run(struct razor_transaction *trans)

  2836 {

  2837 	struct array install_packages, remove_packages;

  2838 	struct razor_merger *merger;

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

  2840 	struct source *source1, *source2;

  2841 	char *spool, *ipool, *rpool;

  2842 	uint32_t *map;

  2843 	struct razor_transaction_package *p, *end;

  2844 	int cmp;

  2846 	/* FIXME */

  2847 	if (trans->errors)

  2848 		return NULL;

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

  2851 	array_init(&install_packages);

  2852 	array_init(&remove_packages);

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

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

  2856 		if (p->new_package) {

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

  2858 			*pkg = *p->new_package;

  2859 		} else {

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

  2861 			*pkg = *p->old_package;

  2862 		}

  2863 	}

  2864 	map = razor_qsort_with_data(install_packages.data,

  2865 				    install_packages.size / sizeof *pkg,

  2866 				    sizeof *pkg,

  2867 				    compare_packages,

  2868 				    trans->upstream);

  2869 	free(map);

  2870 	map = razor_qsort_with_data(remove_packages.data,

  2871 				    remove_packages.size / sizeof *pkg,

  2872 				    sizeof *pkg,

  2873 				    compare_packages,

  2874 				    trans->system);

  2875 	free(map);

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

  2879 	source1 = &merger->source1;

  2880 	source2 = &merger->source2;

  2882 	i = install_packages.data;

  2883 	iend = install_packages.data + install_packages.size;

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

  2886 	r = remove_packages.data;

  2887 	rend = remove_packages.data + remove_packages.size;

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

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

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

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

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

  2895 		/* Check if s is being removed */

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

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

  2898 			s++;

  2899 			r++;

  2900 			continue;

  2901 		}

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

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

  2905 		else if (s < send)

  2906 			cmp = -1;

  2907 		else

  2908 			cmp = 1;

  2909 		if (cmp < 0) {

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

  2911 			s++;

  2912 		} else if (cmp == 0) {

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

  2914 			s++;

  2915 			i++;

  2916 		} else {

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

  2918 			i++;

  2919 		}

  2920 	}

  2922 	array_release(&install_packages);

  2923 	array_release(&remove_packages);

  2925 	return razor_merger_finish(merger);

  2926 }

  2928 void

  2929 razor_transaction_destroy(struct razor_transaction *trans)

  2930 {

  2931 	struct razor_transaction_package *p, *end;

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

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

  2935 		if (!p->dep_package &&

  2936 		    (p->state == RAZOR_PACKAGE_INSTALL_UNAVAILABLE ||

  2937 		     p->state == RAZOR_PACKAGE_REMOVE_NOT_INSTALLED))

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

  2939 	}

  2940 	free(trans);

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

  2943 }

author	Kristian H?gsberg <krh@redhat.com>
	Sun Apr 06 19:34:58 2008 -0400 (2008-04-06)
changeset 191	6e94ebe58141
parent 190	d8b7dd11813d
child 192	55b177b689c0
permissions	-rw-r--r--