razor: razor.c@052dce887a07

     1 /*

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

     3  * Copyright (C) 2008  Red Hat, Inc

     4  *

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

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

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

     8  * (at your option) any later version.

     9  *

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

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

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

    13  * GNU General Public License for more details.

    14  *

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

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

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

    18  */

    20 #define _GNU_SOURCE

    22 #include <stdlib.h>

    23 #include <stddef.h>

    24 #include <stdint.h>

    25 #include <stdio.h>

    26 #include <string.h>

    27 #include <sys/types.h>

    28 #include <sys/stat.h>

    29 #include <sys/mman.h>

    30 #include <unistd.h>

    31 #include <fcntl.h>

    32 #include <errno.h>

    33 #include <ctype.h>

    34 #include <fnmatch.h>

    36 #include "razor.h"

    37 #include "razor-internal.h"

    38 #include "types.h"

    40 struct razor_set_section {

    41 	uint32_t type;

    42 	uint32_t offset;

    43 	uint32_t size;

    44 };

    46 struct razor_set_header {

    47 	uint32_t magic;

    48 	uint32_t version;

    49 	struct razor_set_section sections[0];

    50 };

    52 #define RAZOR_MAGIC 0x7a7a7a7a

    53 #define RAZOR_VERSION 1

    55 #define RAZOR_STRING_POOL	0

    56 #define RAZOR_PACKAGES		1

    57 #define RAZOR_PROPERTIES	2

    58 #define RAZOR_FILES		3

    59 #define RAZOR_PACKAGE_POOL	4

    60 #define RAZOR_PROPERTY_POOL	5

    61 #define RAZOR_FILE_POOL		6

    63 struct razor_package {

    64 	uint name  : 24;

    65 	uint flags : 8;

    66 	uint32_t version;

    67 	uint32_t arch;

    68 	struct list_head properties;

    69 	struct list_head files;

    70 };

    72 struct razor_property {

    73 	uint name  : 24;

    74 	uint flags : 6;

    75 	enum razor_property_type type : 2;

    76 	enum razor_version_relation relation : 32;

    77 	uint32_t version;

    78 	struct list_head packages;

    79 };

    81 struct razor_entry {

    82 	uint name  : 24;

    83 	uint flags : 8;

    84 	uint32_t start;

    85 	struct list_head packages;

    86 };

    88 #define RAZOR_ENTRY_LAST	0x80

    90 struct razor_set {

    91 	struct array string_pool;

    92  	struct array packages;

    93  	struct array properties;

    94  	struct array files;

    95 	struct array package_pool;

    96  	struct array property_pool;

    97  	struct array file_pool;

    98 	struct razor_set_header *header;

    99 };

   101 struct import_entry {

   102 	uint32_t package;

   103 	char *name;

   104 };

   106 struct import_directory {

   107 	uint32_t name, count;

   108 	struct array files;

   109 	struct array packages;

   110 	struct import_directory *last;

   111 };

   113 struct razor_importer {

   114 	struct razor_set *set;

   115 	struct hashtable table;

   116 	struct razor_package *package;

   117 	struct array properties;

   118 	struct array files;

   119 	struct array file_requires;

   120 };

   122 static void *

   123 zalloc(size_t size)

   124 {

   125 	void *p;

   127 	p = malloc(size);

   128 	memset(p, 0, size);

   130 	return p;

   131 }

   133 struct razor_set_section razor_sections[] = {

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

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

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

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

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

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

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

   141 };

   143 struct razor_set *

   144 razor_set_create(void)

   145 {

   146 	struct razor_set *set;

   147 	struct razor_entry *e;

   148 	char *empty;

   150 	set = zalloc(sizeof *set);

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

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

   154 	*empty = '\0';

   155 	e->name = 0;

   156 	e->flags = RAZOR_ENTRY_LAST;

   157 	e->start = 0;

   158 	list_set_empty(&e->packages);

   160 	return set;

   161 }

   163 struct razor_set *

   164 razor_set_open(const char *filename)

   165 {

   166 	struct razor_set *set;

   167 	struct razor_set_section *s;

   168 	struct stat stat;

   169 	struct array *array;

   170 	int fd;

   172 	set = zalloc(sizeof *set);

   173 	fd = open(filename, O_RDONLY);

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

   175 		return NULL;

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

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

   178 		free(set);

   179 		return NULL;

   180 	}

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

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

   184 			continue;

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

   186 			continue;

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

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

   189 		array->size = s->size;

   190 		array->alloc = s->size;

   191 	}

   192 	close(fd);

   194 	return set;

   195 }

   197 void

   198 razor_set_destroy(struct razor_set *set)

   199 {

   200 	unsigned int size;

   201 	struct array *a;

   202 	int i;

   204 	if (set->header) {

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

   206 			;

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

   208 		munmap(set->header, size);

   209 	} else {

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

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

   212 			free(a->data);

   213 		}

   214 	}

   216 	free(set);

   217 }

   219 int

   220 razor_set_write_to_fd(struct razor_set *set, int fd)

   221 {

   222 	char data[4096];

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

   224 	struct array *a;

   225 	uint32_t offset;

   226 	int i;

   228 	memset(data, 0, sizeof data);

   229 	header->magic = RAZOR_MAGIC;

   230 	header->version = RAZOR_VERSION;

   231 	offset = 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 		header->sections[i].type = i;

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

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

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

   241 	}

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

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

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

   247 	razor_write(fd, data, sizeof data);

   248 	memset(data, 0, sizeof data);

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

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

   251 			continue;

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

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

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

   255 	}

   257 	return 0;

   258 }

   260 int

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

   262 {

   263 	int fd, status;

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

   266 	if (fd < 0)

   267 		return -1;

   269 	status = razor_set_write_to_fd(set, fd);

   270 	if (status) {

   271 	    close(fd);

   272 	    return status;

   273 	}

   275 	return close(fd);

   276 }

   278 void

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

   280 		const char *version, const char *release)

   281 {

   282 	int len;

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

   285 		*evr_buf = '\0';

   286 		return;

   287 	}

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

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

   291 		evr_buf += len;

   292 		size -= len;

   293 	}

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

   295 	evr_buf += len;

   296 	size -= len;

   297 	if (release && *release)

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

   299 }

   301 void

   302 razor_importer_begin_package(struct razor_importer *importer,

   303 			     const char *name,

   304 			     const char *version,

   305 			     const char *arch)

   306 {

   307 	struct razor_package *p;

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

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

   311 	p->flags = 0;

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

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

   315 	importer->package = p;

   316 	array_init(&importer->properties);

   317 }

   319 void

   320 razor_importer_finish_package(struct razor_importer *importer)

   321 {

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

   323 		       &importer->set->property_pool,

   324 		       &importer->properties,

   325 		       1);

   327 	array_release(&importer->properties);

   328 }

   330 void

   331 razor_importer_add_property(struct razor_importer *importer,

   332 			    const char *name,

   333 			    enum razor_version_relation relation,

   334 			    const char *version,

   335 			    enum razor_property_type type)

   336 {

   337 	struct razor_property *p;

   338 	uint32_t *r;

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

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

   342 	p->flags = 0;

   343 	p->type = type;

   344 	p->relation = relation;

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

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

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

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

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

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

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

   354 		*r = p->name;

   355 	}

   356 }

   358 void

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

   360 {

   361 	struct import_entry *e;

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

   365 	e->package = importer->package -

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

   367 	e->name = strdup(name);

   368 }

   370 struct razor_importer *

   371 razor_importer_new(void)

   372 {

   373 	struct razor_importer *importer;

   375 	importer = zalloc(sizeof *importer);

   376 	importer->set = razor_set_create();

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

   379 	return importer;

   380 }

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

   383 void

   384 razor_importer_destroy(struct razor_importer *importer)

   385 {

   386 	/* FIXME: write this */

   387 }

   389 static int

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

   391 {

   392 	const char *p1, *p2;

   393 	long n1, n2;

   394 	int res;

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

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

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

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

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

   402 	if (res < 0) {

   403 		n1 = 0;

   404 		p1 = s1;

   405 		p2++;

   406 	} else if (res > 0) {

   407 		p1++;

   408 		n2 = 0;

   409 		p2 = s2;

   410 	}

   412 	if (n1 != n2)

   413 		return n1 - n2;

   414 	while (*p1 && *p2) {

   415 		if (*p1 != *p2)

   416 			return *p1 - *p2;

   417 		p1++;

   418 		p2++;

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

   420 			return versioncmp(p1, p2);

   421 	}

   423 	return *p1 - *p2;

   424 }

   426 static int

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

   428 {

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

   430 	struct razor_set *set = data;

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

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

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

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

   436 	else

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

   438 }

   440 static int

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

   442 {

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

   444 	struct razor_set *set = data;

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

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

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

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

   450 		return prop1->type - prop2->type;

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

   452 		return prop1->relation - prop2->relation;

   453 	else

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

   455 }

   457 static uint32_t *

   458 uniqueify_properties(struct razor_set *set)

   459 {

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

   461 	struct array *pkgs, *p;

   462 	struct list_head *r;

   463 	uint32_t *map, *rmap;

   464 	int i, count, unique;

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

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

   468 				    count,

   469 				    sizeof(struct razor_property),

   470 				    compare_properties,

   471 				    set);

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

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

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

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

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

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

   479 			up++;

   480 			up->name = rp->name;

   481 			up->flags = 0;

   482 			up->type = rp->type;

   483 			up->relation = rp->relation;

   484 			up->version = rp->version;

   485 		}

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

   488 		rmap[map[i]] = unique;

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

   490 		*r = rp->packages;

   491 	}

   492 	free(map);

   494 	if (up != rp)

   495 		up++;

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

   497 	rp_end = up;

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

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

   500 		array_release(p);

   501 	}

   503 	free(pkgs);

   505 	return rmap;

   506 }

   508 static int

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

   510 {

   511 	const struct import_entry *e1 = p1;

   512 	const struct import_entry *e2 = p2;

   513 	const char *n1 = e1->name;

   514 	const char *n2 = e2->name;

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

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

   518 	 * sort before "foo.conf"

   519 	 *

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

   521 	 */

   522 	while (*n1 && *n2) {

   523 		if (*n1 < *n2)

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

   525 		else if (*n1 > *n2)

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

   527 		n1++;

   528 		n2++;

   529 	}

   530 	if (*n1)

   531 		return 1;

   532 	else if (*n2)

   533 		return -1;

   534 	else

   535 		return 0;

   536 }

   538 static void

   539 count_entries(struct import_directory *d)

   540 {

   541 	struct import_directory *p, *end;

   543 	p = d->files.data;

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

   545 	d->count = 0;

   546 	while (p < end) {

   547 		count_entries(p);

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

   549 		p++;

   550 	}

   551 }

   553 static void

   554 serialize_files(struct razor_set *set,

   555 		struct import_directory *d, struct array *array)

   556 {

   557 	struct import_directory *p, *end;

   558 	struct razor_entry *e = NULL;

   559 	uint32_t s;

   561 	p = d->files.data;

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

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

   564 	while (p < end) {

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

   566 		e->name = p->name;

   567 		e->flags = 0;

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

   569 		s += p->count;

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

   572 		array_release(&p->packages);

   573 		p++;

   574 	}

   575 	if (e != NULL)

   576 		e->flags |= RAZOR_ENTRY_LAST;

   578 	p = d->files.data;

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

   580 	while (p < end) {

   581 		serialize_files(set, p, array);

   582 		p++;

   583 	}

   584 }

   586 static void

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

   588 {

   589 	struct razor_property *p, *end;

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

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

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

   594 }

   596 static void

   597 build_file_tree(struct razor_importer *importer)

   598 {

   599 	int count, i, length;

   600 	struct import_entry *filenames;

   601 	char *f, *end;

   602 	uint32_t name, *r;

   603 	char dirname[256];

   604 	struct import_directory *d, root;

   605 	struct razor_entry *e;

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

   608 	razor_qsort_with_data(importer->files.data,

   609 			      count,

   610 			      sizeof (struct import_entry),

   611 			      compare_filenames,

   612 			      NULL);

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

   615 	array_init(&root.files);

   616 	array_init(&root.packages);

   617 	root.last = NULL;

   619 	filenames = importer->files.data;

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

   621 		f = filenames[i].name;

   622 		if (*f != '/')

   623 			continue;

   624 		f++;

   626 		d = &root;

   627 		while (*f) {

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

   629 			if (end == NULL)

   630 				end = f + strlen(f);

   631 			length = end - f;

   632 			memcpy(dirname, f, length);

   633 			dirname[length] ='\0';

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

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

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

   637 				d->last->name = name;

   638 				d->last->last = NULL;

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

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

   641 			}

   642 			d = d->last;

   643 			f = end + 1;

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

   645 				break;

   646 		}

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

   649 		*r = filenames[i].package;

   650 		free(filenames[i].name);

   651 	}

   653 	count_entries(&root);

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

   655 	e->name = root.name;

   656 	e->flags = RAZOR_ENTRY_LAST;

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

   658 	list_set_empty(&e->packages);

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

   662 	array_release(&importer->files);

   663 }

   665 static struct razor_entry *

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

   668 static void

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

   670 {

   671 	uint32_t *item;

   673 	while (list) {

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

   675 		 *item = list->data;

   676 		 list = list_next(list);

   677 	}

   678 }

   680 static int

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

   682 {

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

   684 	const char *pool = data;

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

   687 }

   689 static void

   690 find_file_provides(struct razor_importer *importer)

   691 {

   692 	struct razor_property *prop;

   693 	struct razor_entry *top, *entry;

   694 	struct razor_package *packages;

   695 	struct array pkgprops;

   696 	struct list *pkg;

   697 	uint32_t *req, *req_start, *req_end;

   698 	uint32_t *map, *newprop;

   699 	char *pool;

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

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

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

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

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

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

   708 				    compare_file_requires, pool);

   709 	free(map);

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

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

   713 			continue;

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

   715 		if (!entry)

   716 			continue;

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

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

   720 			prop->name = *req;

   721 			prop->type = RAZOR_PROPERTY_PROVIDES;

   722 			prop->relation = RAZOR_VERSION_EQUAL;

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

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

   726 			/* Update property list of pkg */

   727 			array_init(&pkgprops);

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

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

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

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

   732 			array_release(&pkgprops);

   733 		}

   734 	}

   736 	array_release(&importer->file_requires);

   737 }

   739 static void

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

   741 {

   742 	struct razor_package *p, *packages;

   743 	struct array *pkgs;

   744 	struct razor_entry *e, *end;

   745 	struct list *r;

   746 	uint32_t *q;

   747 	int i, count;

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

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

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

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

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

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

   756 		while (r) {

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

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

   759 			r = list_next(r);

   760 		}

   761 	}

   763 	packages = set->packages.data;

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

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

   766 		array_release(&pkgs[i]);

   767 	}

   768 	free(pkgs);

   769 }

   771 struct razor_set *

   772 razor_importer_finish(struct razor_importer *importer)

   773 {

   774 	struct razor_set *set;

   775 	uint32_t *map, *rmap;

   776 	int i, count;

   778 	build_file_tree(importer);

   779 	find_file_provides(importer);

   781 	map = uniqueify_properties(importer->set);

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

   783 	free(map);

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

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

   787 				    count,

   788 				    sizeof(struct razor_package),

   789 				    compare_packages,

   790 				    importer->set);

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

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

   794 		rmap[map[i]] = i;

   795 	free(map);

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

   798 	build_package_file_lists(importer->set, rmap);

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

   800 	free(rmap);

   802 	set = importer->set;

   803 	hashtable_release(&importer->table);

   804 	free(importer);

   806 	return set;

   807 }

   809 struct razor_package_iterator {

   810 	struct razor_set *set;

   811 	struct razor_package *package, *end;

   812 	struct list *index;

   813 	int free_index;

   814 };

   816 static struct razor_package_iterator *

   817 razor_package_iterator_create_with_index(struct razor_set *set,

   818 					 struct list *index)

   819 {

   820 	struct razor_package_iterator *pi;

   822 	pi = zalloc(sizeof *pi);

   823 	pi->set = set;

   824 	pi->index = index;

   826 	return pi;

   827 }

   829 struct razor_package_iterator *

   830 razor_package_iterator_create(struct razor_set *set)

   831 {

   832 	struct razor_package_iterator *pi;

   834 	pi = zalloc(sizeof *pi);

   835 	pi->set = set;

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

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

   839 	return pi;

   840 }

   842 struct razor_package_iterator *

   843 razor_package_iterator_create_for_property(struct razor_set *set,

   844 					   struct razor_property *property)

   845 {

   846 	struct list *index;

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

   849 	return razor_package_iterator_create_with_index(set, index);

   850 }

   852 int

   853 razor_package_iterator_next(struct razor_package_iterator *pi,

   854 			    struct razor_package **package,

   855 			    const char **name,

   856 			    const char **version,

   857 			    const char **arch)

   858 {

   859 	char *pool;

   860 	int valid;

   861 	struct razor_package *p, *packages;

   863 	if (pi->package) {

   864 		p = pi->package++;

   865 		valid = p < pi->end;

   866 	} else if (pi->index) {

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

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

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

   870 		valid = 1;

   871 	} else

   872 		valid = 0;

   874 	if (valid) {

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

   876 		*package = p;

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

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

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

   880 	} else {

   881 		*package = NULL;

   882 	}

   884 	return valid;

   885 }

   887 void

   888 razor_package_iterator_destroy(struct razor_package_iterator *pi)

   889 {

   890 	if (pi->free_index)

   891 		free(pi->index);

   893 	free(pi);

   894 }

   896 struct razor_package *

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

   898 {

   899 	struct razor_package_iterator *pi;

   900 	struct razor_package *p;

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

   903 	pi = razor_package_iterator_create(set);

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

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

   906 			break;

   907 	}

   908 	razor_package_iterator_destroy(pi);

   910 	return p;

   911 }

   913 struct razor_property_iterator {

   914 	struct razor_set *set;

   915 	struct razor_property *property, *end;

   916 	struct list *index;

   917 };

   919 struct razor_property_iterator *

   920 razor_property_iterator_create(struct razor_set *set,

   921 			       struct razor_package *package)

   922 {

   923 	struct razor_property_iterator *pi;

   925 	pi = zalloc(sizeof *pi);

   926 	pi->set = set;

   928 	if (package) {

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

   930 				       &set->property_pool);

   931 	} else {

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

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

   934 	}

   936 	return pi;

   937 }

   939 int

   940 razor_property_iterator_next(struct razor_property_iterator *pi,

   941 			     struct razor_property **property,

   942 			     const char **name,

   943 			     enum razor_version_relation *relation,

   944 			     const char **version,

   945 			     enum razor_property_type *type)

   946 {

   947 	char *pool;

   948 	int valid;

   949 	struct razor_property *p, *properties;

   951 	if (pi->property) {

   952 		p = pi->property++;

   953 		valid = p < pi->end;

   954 	} else if (pi->index) {

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

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

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

   958 		valid = 1;

   959 	} else

   960 		valid = 0;

   962 	if (valid) {

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

   964 		*property = p;

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

   966 		*relation = p->relation;

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

   968 		*type = p->type;

   969 	} else {

   970 		*property = NULL;

   971 	}

   973 	return valid;

   974 }

   976 void

   977 razor_property_iterator_destroy(struct razor_property_iterator *pi)

   978 {

   979 	free(pi);

   980 }

   982 static struct razor_entry *

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

   984 {

   985 	struct razor_entry *e;

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

   987 	int len;

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

   990 	do {

   991 		n = pool + e->name;

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

   993 			return e;

   994 		len = strlen(n);

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

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

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

   998 		}

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

  1001 	return NULL;

  1002 }

  1004 static void

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

  1006 	 char *prefix, const char *pattern)

  1007 {

  1008 	struct razor_entry *e;

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

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

  1012 	do {

  1013 		n = pool + e->name;

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

  1015 			continue;

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

  1017 		if (e->start) {

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

  1019 			*sub = '/';

  1020 			strcpy (sub + 1, n);

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

  1022 			*sub = '\0';

  1023 		}

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

  1025 }

  1027 void

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

  1029 {

  1030 	struct razor_entry *e;

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

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

  1034 		buffer[0] = '\0';

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

  1036 		return;

  1037 	}

  1039 	strcpy(buffer, pattern);

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

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

  1042 		base = NULL;

  1043 	} else {

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

  1045 		if (p) {

  1046 			*p = '\0';

  1047 			base = p + 1;

  1048 		} else {

  1049 			base = NULL;

  1050 		}

  1051 	}

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

  1053 	if (e->start != 0)

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

  1055 }

  1057 struct razor_package_iterator *

  1058 razor_package_iterator_create_for_file(struct razor_set *set,

  1059 				       const char *filename)

  1060 {

  1061 	struct razor_entry *entry;

  1062 	struct list *index;

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

  1065 	if (entry == NULL)

  1066 		return NULL;

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

  1069 	return razor_package_iterator_create_with_index(set, index);

  1070 }

  1072 static struct list *

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

  1074 		   struct razor_entry *dir, uint32_t end,

  1075 		   char *prefix)

  1076 {

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

  1078 	uint32_t next, file;

  1079 	char *pool;

  1080 	int len;

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

  1083 	pool = set->string_pool.data;

  1085 	e = entries + dir->start;

  1086 	do {

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

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

  1089 			r = list_next(r);

  1090 			if (!r)

  1091 				return NULL;

  1092 			if (r->data >= end)

  1093 				return r;

  1094 		}

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

  1097 	e = entries + dir->start;

  1098 	do {

  1099 		if (e->start == 0)

  1100 			continue;

  1102 		if (e->flags & RAZOR_ENTRY_LAST)

  1103 			next = end;

  1104 		else {

  1105 			f = e + 1;

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

  1107 				f++;

  1108 			if (f->start == 0)

  1109 				next = end;

  1110 			else

  1111 				next = f->start;

  1112 		}

  1114 		file = r->data;

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

  1116 			len = strlen(prefix);

  1117 			prefix[len] = '/';

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

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

  1120 			prefix[len] = '\0';

  1121 		}

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

  1124 	return r;

  1125 }

  1127 void

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

  1129 {

  1130 	struct razor_package *package;

  1131 	struct list *r;

  1132 	uint32_t end;

  1133 	char buffer[512];

  1135 	package = razor_set_get_package(set, name);

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

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

  1139 	buffer[0] = '\0';

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

  1141 }

  1143 static void

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

  1145 {

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

  1147 	uint32_t *u;

  1148 	char *pool;

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

  1151 	pool = set->string_pool.data;

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

  1154 		if (r->type != RAZOR_PROPERTY_REQUIRES)

  1155 			continue;

  1157 		p = r;

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

  1159 		       p->type == r->type)

  1160 			p++;

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

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

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

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

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

  1167 		 * does.*/

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

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

  1170 			p++;

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

  1173 		 * etc) to properly determine if a requires is

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

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

  1177 		if (p == end ||

  1178 		    p->type != RAZOR_PROPERTY_PROVIDES ||

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

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

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

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

  1183 				continue;

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

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

  1186 		}

  1187 	}

  1188 }

  1190 void

  1191 razor_set_list_unsatisfied(struct razor_set *set)

  1192 {

  1193 	struct array unsatisfied;

  1194 	struct razor_property *properties, *r;

  1195 	uint32_t *u, *end;

  1196 	char *pool;

  1198 	array_init(&unsatisfied);

  1199 	razor_set_validate(set, &unsatisfied);

  1201 	end = unsatisfied.data + unsatisfied.size;

  1202 	properties = set->properties.data;

  1203 	pool = set->string_pool.data;

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

  1206 		r = properties + *u;

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

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

  1209 			       &pool[r->name]);

  1210 		else

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

  1212 			       &pool[r->name],

  1213 			       &pool[r->version]);

  1214 	}

  1216 	array_release(&unsatisfied);

  1217 }

  1219 #define UPSTREAM_SOURCE 0x80

  1221 struct source {

  1222 	struct razor_set *set;

  1223 	uint32_t *property_map;

  1224 	uint32_t *file_map;

  1225 };

  1227 struct razor_merger {

  1228 	struct razor_set *set;

  1229 	struct hashtable table;

  1230 	struct source source1;

  1231 	struct source source2;

  1232 };

  1234 static struct razor_merger *

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

  1236 {

  1237 	struct razor_merger *merger;

  1238 	int count;

  1239 	size_t size;

  1241 	merger = zalloc(sizeof *merger);

  1242 	merger->set = razor_set_create();

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

  1245 	merger->source1.set = set1;

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

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

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

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

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

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

  1253 	merger->source2.set = set2;

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

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

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

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

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

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

  1261 	return merger;

  1262 }

  1264 static void

  1265 add_package(struct razor_merger *merger,

  1266 	    struct razor_package *package, struct source *source,

  1267 	    uint32_t flags)

  1268 {

  1269 	char *pool;

  1270 	struct list *r;

  1271 	struct razor_package *p;

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

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

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

  1276 	p->flags = flags;

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

  1278 					&pool[package->version]);

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

  1280 				     &pool[package->arch]);

  1282 	p->properties = package->properties;

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

  1284 	while (r) {

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

  1286 		r = list_next(r);

  1287 	}

  1289 	p->files = package->files;

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

  1291 	while (r) {

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

  1293 		r = list_next(r);

  1294 	}

  1295 }

  1297 static uint32_t

  1298 add_property(struct razor_merger *merger,

  1299 	     const char *name, enum razor_version_relation relation,

  1300 	     const char *version, int type)

  1301 {

  1302 	struct razor_property *p;

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

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

  1306 	p->flags = 0;

  1307 	p->type = type;

  1308 	p->relation = relation;

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

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

  1312 }

  1314 static void

  1315 merge_properties(struct razor_merger *merger)

  1316 {

  1317 	struct razor_property *p1, *p2;

  1318 	struct razor_set *set1, *set2;

  1319 	uint32_t *map1, *map2;

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

  1321 	char *pool1, *pool2;

  1323 	set1 = merger->source1.set;

  1324 	set2 = merger->source2.set;

  1325 	map1 = merger->source1.property_map;

  1326 	map2 = merger->source2.property_map;

  1328 	i = 0;

  1329 	j = 0;

  1330 	pool1 = set1->string_pool.data;

  1331 	pool2 = set2->string_pool.data;

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

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

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

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

  1337 			i++;

  1338 			continue;

  1339 		}

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

  1341 			j++;

  1342 			continue;

  1343 		}

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

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

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

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

  1348 		else if (i < count1)

  1349 			cmp = -1;

  1350 		else

  1351 			cmp = 1;

  1352 		if (cmp == 0)

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

  1354 		if (cmp == 0)

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

  1356 		if (cmp == 0)

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

  1358 					 &pool2[p2->version]);

  1359 		if (cmp < 0) {

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

  1361 						 &pool1[p1->name],

  1362 						 p1->relation,

  1363 						 &pool1[p1->version],

  1364 						 p1->type);

  1365 		} else if (cmp > 0) {

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

  1367 						 &pool2[p2->name],

  1368 						 p2->relation,

  1369 						 &pool2[p2->version],

  1370 						 p2->type);

  1371 		} else  {

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

  1373 							     &pool1[p1->name],

  1374 							     p1->relation,

  1375 							     &pool1[p1->version],

  1376 							     p1->type);

  1377 		}

  1378 	}

  1379 }

  1381 static void

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

  1383 		uint32_t *map, struct array *pool)

  1384 {

  1385 	uint32_t r;

  1386 	struct list *p, *q;

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

  1389 	p = list_first(properties, source_pool);

  1390 	while (p) {

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

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

  1393 		q->flags = p->flags;

  1394 		p = list_next(p);

  1395 	}

  1397 	list_set_ptr(properties, r);

  1398 }

  1400 static uint32_t

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

  1402 {

  1403 	struct razor_entry *e;

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

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

  1407 	e->flags = 0;

  1408 	e->start = 0;

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

  1411 }

  1413 /* FIXME. Blah */

  1414 static int

  1415 fix_file_map(uint32_t *map,

  1416 	     struct razor_entry *files,

  1417 	     struct razor_entry *top)

  1418 {

  1419 	uint32_t e;

  1420 	int found_file = 0;

  1422 	e = top->start;

  1423 	do {

  1424 		if (files[e].start)

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

  1426 		if (map[e])

  1427 			found_file = 1;

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

  1430 	if (found_file)

  1431 		map[top - files] = 1;

  1432 	return found_file;

  1433 }

  1435 struct merge_directory {

  1436 	uint32_t merged, dir1, dir2;

  1437 };

  1439 static void

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

  1441 {

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

  1443 	struct razor_set *set1, *set2;

  1444 	struct array merge_stack;

  1445 	struct merge_directory *child_md, *end_md;

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

  1447 	int cmp;

  1448 	char *pool1, *pool2;

  1450 	set1 = merger->source1.set;

  1451 	set2 = merger->source2.set;

  1452 	map1 = merger->source1.file_map;

  1453 	map2 = merger->source2.file_map;

  1454 	pool1 = set1->string_pool.data;

  1455 	pool2 = set2->string_pool.data;

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

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

  1459 	array_init(&merge_stack);

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

  1462 	last = 0;

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

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

  1465 	while (e1 || e2) {

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

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

  1468 				e1 = NULL;

  1469 			continue;

  1470 		}

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

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

  1473 				e2 = NULL;

  1474 			continue;

  1475 		}

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

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

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

  1479 				e1 = NULL;

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

  1481 				e2 = NULL;

  1482 			continue;

  1483 		}

  1485 		if (!e1)

  1486 			cmp = 1;

  1487 		else if (!e2)

  1488 			cmp = -1;

  1489 		else {

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

  1491 				      &pool2[e2->name]);

  1492 		}

  1494 		if (cmp < 0) {

  1495 			if (map1[e1 - root1]) {

  1496 				map1[e1 - root1] = last =

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

  1498 				if (e1->start) {

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

  1500 					child_md->merged = last;

  1501 					child_md->dir1 = e1->start;

  1502 					child_md->dir2 = 0;

  1503 				}

  1504 			}

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

  1506 				e1 = NULL;

  1507 		} else if (cmp > 0) {

  1508 			if (map2[e2 - root2]) {

  1509 				map2[e2 - root2] = last =

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

  1511 				if (e2->start) {

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

  1513 					child_md->merged = last;

  1514 					child_md->dir1 = 0;

  1515 					child_md->dir2 = e2->start;

  1516 				}

  1517 			}

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

  1519 				e2 = NULL;

  1520 		} else {

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

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

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

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

  1525 				child_md->merged = last;

  1526 				child_md->dir1 = e1->start;

  1527 				child_md->dir2 = e2->start;

  1528 			}

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

  1530 				e1 = NULL;

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

  1532 				e2 = NULL;

  1533 		}

  1534 	}

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

  1537 	if (last) {

  1538 		mroot[last].flags = RAZOR_ENTRY_LAST;

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

  1540 	} else

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

  1543 	end_md = merge_stack.data + merge_stack.size;

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

  1545 		merge_one_directory(merger, child_md);

  1546 	array_release(&merge_stack);

  1547 }

  1549 static void

  1550 merge_files(struct razor_merger *merger)

  1551 {

  1552 	struct razor_entry *root;

  1553 	struct merge_directory md;

  1554 	uint32_t *map1, *map2;

  1556 	map1 = merger->source1.file_map;

  1557 	map2 = merger->source2.file_map;

  1559 	md.merged = 0;

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

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

  1563 		if (root->start)

  1564 			fix_file_map(map1, root, root);

  1565 		md.dir1 = root->start;

  1566 	} else

  1567 		md.dir1 = 0;

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

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

  1571 		if (root->start)

  1572 			fix_file_map(map2, root, root);

  1573 		md.dir2 = root->start;

  1574 	} else

  1575 		md.dir2 = 0;

  1577 	merge_one_directory(merger, &md);

  1578 }

  1580 static void

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

  1582 	   uint32_t *map, struct array *pool)

  1583 {

  1584 	uint32_t r;

  1585 	struct list *p, *q;

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

  1588 	p = list_first(files, source_pool);

  1589 	while (p) {

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

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

  1592 		q->flags = p->flags;

  1593 		p = list_next(p);

  1594 	}

  1596 	list_set_ptr(files, r);

  1597 }

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

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

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

  1602  * the arrays for their properties. */

  1603 static void

  1604 rebuild_property_package_lists(struct razor_set *set)

  1605 {

  1606 	struct array *pkgs, *a;

  1607 	struct razor_package *pkg, *pkg_end;

  1608 	struct razor_property *prop, *prop_end;

  1609 	struct list *r;

  1610 	uint32_t *q;

  1611 	int count;

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

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

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

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

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

  1619 		while (r) {

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

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

  1622 			r = list_next(r);

  1623 		}

  1624 	}

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

  1627 	a = pkgs;

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

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

  1630 		array_release(a);

  1631 	}

  1632 	free(pkgs);

  1633 }

  1635 static void

  1636 rebuild_file_package_lists(struct razor_set *set)

  1637 {

  1638 	struct array *pkgs, *a;

  1639 	struct razor_package *pkg, *pkg_end;

  1640 	struct razor_entry *entry, *entry_end;

  1641 	struct list *r;

  1642 	uint32_t *q;

  1643 	int count;

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

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

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

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

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

  1651 		while (r) {

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

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

  1654 			r = list_next(r);

  1655 		}

  1656 	}

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

  1659 	a = pkgs;

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

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

  1662 		array_release(a);

  1663 	}

  1664 	free(pkgs);

  1665 }

  1667 static struct razor_set *

  1668 razor_merger_finish(struct razor_merger *merger)

  1669 {

  1670 	struct razor_set *result;

  1671 	struct razor_package *p, *pend;

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

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

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

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

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

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

  1679 	 * property list for both sets. */

  1681 	merge_properties(merger);

  1682 	merge_files(merger);

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

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

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

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

  1689 		struct source *src;

  1691 		if (p->flags & UPSTREAM_SOURCE)

  1692 			src = &merger->source2;

  1693 		else

  1694 			src = &merger->source1;

  1696 		emit_properties(&p->properties,

  1697 				&src->set->property_pool,

  1698 				src->property_map,

  1699 				&merger->set->property_pool);

  1700 		emit_files(&p->files,

  1701 			   &src->set->file_pool,

  1702 			   src->file_map,

  1703 			   &merger->set->file_pool);

  1704 		p->flags &= ~UPSTREAM_SOURCE;

  1705 	}

  1707 	rebuild_property_package_lists(merger->set);

  1708 	rebuild_file_package_lists(merger->set);

  1710 	result = merger->set;

  1711 	hashtable_release(&merger->table);

  1712 	free(merger);

  1714 	return result;

  1715 }

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

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

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

  1720  **/

  1722 void

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

  1724 	       razor_package_callback_t callback, void *data)

  1725 {

  1726 	struct razor_package_iterator *pi1, *pi2;

  1727 	struct razor_package *p1, *p2;

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

  1729 	int res;

  1731 	pi1 = razor_package_iterator_create(set);

  1732 	pi2 = razor_package_iterator_create(upstream);

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

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

  1737 	while (p1 || p2) {

  1738 		if (p1 && p2) {

  1739 			res = strcmp(name1, name2);

  1740 			if (res == 0)

  1741 				res = versioncmp(version1, version2);

  1742 		} else {

  1743 			res = 0;

  1744 		}

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

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

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

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

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

  1752 			razor_package_iterator_next(pi1, &p1,

  1753 						    &name1, &version1, &arch1);

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

  1755 			razor_package_iterator_next(pi2, &p2,

  1756 						    &name2, &version2, &arch2);

  1757 	}

  1759 	razor_package_iterator_destroy(pi1);

  1760 	razor_package_iterator_destroy(pi2);

  1761 }

  1763 struct razor_transaction;

  1764 struct razor_transaction_package;

  1765 struct razor_transaction_resolver;

  1767 struct razor_transaction {

  1768 	int package_count, errors;

  1769 	struct razor_set *system, *upstream;

  1771 	struct bitarray syspkgs, uppkgs;

  1772 	struct array packages;

  1773 };

  1775 struct razor_transaction_package {

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

  1777 	struct razor_package *old_package, *new_package;

  1778 	enum razor_transaction_package_state state;

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

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

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

  1783 	 * additional information.

  1784 	 *

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

  1786 	 * required something that this package provides. If dep_type

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

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

  1789 	 *

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

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

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

  1793 	 *

  1794 	 * For OLD_CONFLICT or NEW_CONFLICT, dep_package is an

  1795 	 * existing package that conflicts with this one. The

  1796 	 * conflicting property comes from the already-installed

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

  1798 	 * for NEW_CONFLICT.

  1799 	 *

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

  1801 	 * but the name field will be NULL.

  1802 	 */

  1803 	const char *dep_package;

  1804 	enum razor_property_type dep_type;

  1805 	const char *dep_property;

  1806 	enum razor_version_relation dep_relation;

  1807 	const char *dep_version;

  1808 };

  1810 static int

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

  1812 {

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

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

  1815 }

  1817 static int

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

  1819 {

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

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

  1822 }

  1824 static struct razor_package *

  1825 property_provider_package(struct razor_transaction *trans,

  1826 			  struct razor_property *prop,

  1827 			  int installed)

  1828 {

  1829 	struct razor_set *set;

  1830 	struct bitarray *pkgbits;

  1831 	struct razor_package *pkgs;

  1832 	struct list *p;

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

  1835 		return NULL;

  1836 	else if (!installed &&

  1837 		 prop->type != RAZOR_PROPERTY_PROVIDES &&

  1838 		 prop->type != RAZOR_PROPERTY_OBSOLETES)

  1839 		return NULL;

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

  1842 		set = trans->system;

  1843 		pkgbits = &trans->syspkgs;

  1844 	} else {

  1845 		set = trans->upstream;

  1846 		pkgbits = &trans->uppkgs;

  1847 	}

  1848 	pkgs = set->packages.data;

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

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

  1852 			continue;

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

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

  1855 			return &pkgs[p->data];

  1856 	}

  1857 	return NULL;

  1858 }

  1860 static int

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

  1862 {

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

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

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

  1867 		return 1;

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

  1869 		return -1;

  1870 	else

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

  1872 }

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

  1875 static void

  1876 resolve_new_packages(struct razor_transaction *trans,

  1877 		     int start, int end)

  1878 {

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

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

  1881 	struct razor_transaction_package **packages;

  1882 	const char *spool, *upool;

  1883 	int i;

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

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

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

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

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

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

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

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

  1894 	 * descriptions.

  1895 	 */

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

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

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

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

  1900 	      compare_transaction_packages);

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

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

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

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

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

  1907 			continue;

  1909 		spkg = NULL;

  1910 		while (sp < sp_end &&

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

  1912 			sp++;

  1913 		while (sp < sp_end &&

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

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

  1916 			sp++;

  1918 		upkg = NULL;

  1919 		while (up < up_end &&

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

  1921 			up++;

  1922 		while (up < up_end &&

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

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

  1925 			up++;

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

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

  1929 			if (spkg) {

  1930 				packages[i]->old_package = spkg;

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

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

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

  1934 			}

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

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

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

  1938 				trans->errors++;

  1939 			}

  1940 		} else {

  1941 			if (upkg) {

  1942 				packages[i]->new_package = upkg;

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

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

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

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

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

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

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

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

  1952 				}

  1954 				if (spkg) {

  1955 					packages[i]->old_package = spkg;

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

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

  1958 						packages[i]->state = RAZOR_PACKAGE_UP_TO_DATE;

  1959 						trans->errors++;

  1960 						continue;

  1961 					}

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

  1963 				}

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

  1965 			}

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

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

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

  1969 				trans->errors++;

  1970 			}

  1971 		}

  1972 	}

  1973 }

  1975 static int

  1976 provider_satisfies_requirement(struct razor_property *provider,

  1977 			       const char *provider_strings,

  1978 			       struct razor_property *requirement,

  1979 			       const char *requirement_strings)

  1980 {

  1981 	int cmp, len;

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

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

  1985 	if (!*required)

  1986 		return 1;

  1987 	if (!*provided) {

  1988 		if (requirement->relation >= RAZOR_VERSION_EQUAL)

  1989 			return 1;

  1990 		else

  1991 			return 0;

  1992 	}

  1994 	cmp = versioncmp(provided, required);

  1996 	switch (requirement->relation) {

  1997 	case RAZOR_VERSION_LESS:

  1998 		return cmp < 0;

  2000 	case RAZOR_VERSION_LESS_OR_EQUAL:

  2001 		if (cmp <= 0)

  2002 			return 1;

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

  2005 	case RAZOR_VERSION_EQUAL:

  2006 		if (cmp == 0)

  2007 			return 1;

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

  2010 		len = strlen(required);

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

  2012 			return 1;

  2013 		return 0;

  2015 	case RAZOR_VERSION_GREATER_OR_EQUAL:

  2016 		return cmp >= 0;

  2018 	case RAZOR_VERSION_GREATER:

  2019 		return cmp > 0;

  2020 	}

  2022 	/* shouldn't happen */

  2023 	return 0;

  2024 }

  2026 static struct razor_package *

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

  2028 		      const char *filename, int installed)

  2029 {

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

  2031 	struct razor_entry *entry;

  2032 	struct list *p;

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

  2035 		return 0;

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

  2038 	if (!entry)

  2039 		return 0;

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

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

  2043 			return &pkgs[p->data];

  2044 	}

  2045 	return NULL;

  2046 }

  2048 static struct razor_package *

  2049 find_installed_package_for_file(struct razor_transaction *trans,

  2050 				const char *filename)

  2051 {

  2052 	struct razor_package *pkg;

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

  2055 				    filename, 1);

  2056 	if (!pkg)

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

  2058 					    filename, 1);

  2059 	return pkg;

  2060 }

  2062 static struct razor_package *

  2063 find_uninstalled_package_for_file(struct razor_transaction *trans,

  2064 				  const char *filename)

  2065 {

  2066 	struct razor_package *pkg;

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

  2069 				    filename, 0);

  2070 	if (!pkg)

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

  2072 					    filename, 0);

  2073 	return pkg;

  2074 }

  2076 static struct razor_property *

  2077 skip_to_matching_property(struct razor_transaction *trans,

  2078 			  struct razor_property *match,

  2079 			  struct razor_property *prop)

  2080 {

  2081 	struct razor_set *mset, *pset;

  2082 	const char *ppool, *mpool;

  2083 	struct razor_property *prop_end;

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

  2086 		mset = trans->system;

  2087 	else

  2088 		mset = trans->upstream;

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

  2091 		pset = trans->system;

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

  2093 		pset = trans->upstream;

  2094 	else

  2095 		return prop;

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

  2098 	ppool = pset->string_pool.data;

  2099 	mpool = mset->string_pool.data;

  2101 	while (prop < prop_end &&

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

  2103 		prop++;

  2104 	return prop;

  2105 }

  2107 static struct razor_package *

  2108 find_package_matching(struct razor_transaction *trans, int installed,

  2109 		      struct razor_property *prop,

  2110 		      struct razor_property *req,

  2111 		      struct razor_set *req_set)

  2112 {

  2113 	struct razor_set *set;

  2114 	struct bitarray *pkgbits;

  2115 	struct razor_package *pkgs;

  2116 	struct razor_property *props, *prop_end;

  2117 	enum razor_property_type match_type;

  2118 	const char *pool;

  2119 	const char *rpool;

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

  2121 	int match;

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

  2124 		set = trans->system;

  2125 		pkgbits = &trans->syspkgs;

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

  2127 		set = trans->upstream;

  2128 		pkgbits = &trans->uppkgs;

  2129 	} else

  2130 		return NULL;

  2132 	if (!req_set) {

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

  2134 			req_set = trans->system;

  2135 		else

  2136 			req_set = trans->upstream;

  2137 	}

  2138 	rpool = req_set->string_pool.data;

  2140 	if (req->type == RAZOR_PROPERTY_PROVIDES)

  2141 		match_type = RAZOR_PROPERTY_CONFLICTS;

  2142 	else

  2143 		match_type = RAZOR_PROPERTY_PROVIDES;

  2145 	pkgs = set->packages.data;

  2146 	props = set->properties.data;

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

  2148 	pool = set->string_pool.data;

  2150 	/* Find first matching property */

  2151 	while (prop < prop_end &&

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

  2153 		prop++;

  2154 	if (prop == prop_end ||

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

  2156 		return NULL;

  2158 	if (prop->type < match_type) {

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

  2160 			prop++;

  2161 	} else {

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

  2163 			prop--;

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

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

  2166 			prop--;

  2167 	}

  2169 	/* Scan matching properties */

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

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

  2172 		if (match_type == RAZOR_PROPERTY_PROVIDES)

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

  2174 		else

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

  2176 		if (match) {

  2177 			struct list *pkg;

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

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

  2181 					continue;

  2182 				if (!match_name ||

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

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

  2185 					return &pkgs[pkg->data];

  2186 			}

  2187 		}

  2188 		prop++;

  2189 	}

  2191 	return NULL;

  2192 }

  2194 static struct razor_package *

  2195 find_installed_package_for_property(struct razor_transaction *trans,

  2196 				    struct razor_property *sys_start,

  2197 				    struct razor_property *up_start,

  2198 				    struct razor_property *req)

  2199 {

  2200 	struct razor_package *pkg;

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

  2203 	if (!pkg)

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

  2205 	return pkg;

  2206 }

  2208 static struct razor_package *

  2209 find_uninstalled_package_for_property(struct razor_transaction *trans,

  2210 				      struct razor_property *sys_start,

  2211 				      struct razor_property *up_start,

  2212 				      struct razor_property *req)

  2213 {

  2214 	struct razor_package *pkg;

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

  2217 	if (!pkg)

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

  2219 	return pkg;

  2220 }

  2222 static struct razor_transaction_package *

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

  2224 {

  2225 	struct razor_transaction_package *packages;

  2226 	int count, i;

  2228 	packages = trans->packages.data;

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

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

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

  2232 			return &packages[i];

  2233 	}

  2234 	return NULL;

  2235 }

  2237 /* FIXME? */

  2238 static int

  2239 prop_is_being_installed(struct razor_transaction *trans,

  2240 			struct razor_property *prop)

  2241 {

  2242 	struct list *pkg;

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

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

  2246 			return 1;

  2247 	}

  2248 	return 0;

  2249 }

  2251 static int

  2252 prop_is_being_removed(struct razor_transaction *trans,

  2253 		      struct razor_property *prop)

  2254 {

  2255 	struct list *pkg;

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

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

  2259 			return 0;

  2260 	}

  2261 	return 1;

  2262 }

  2264 static int

  2265 prop_is_being_updated(struct razor_transaction *trans,

  2266 		      struct razor_property *prop)

  2267 {

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

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

  2270 	struct razor_transaction_package *tp;

  2271 	struct list *pkg;

  2273 	/* Assumes prop_is_being_removed returns true */

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

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

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

  2278 			return 0;

  2279 	}

  2280 	return 1;

  2281 }

  2283 static void

  2284 add_transaction_package(struct razor_transaction *trans,

  2285 			struct razor_package *new_package,

  2286 			struct razor_package *old_package,

  2287 			enum razor_transaction_package_state state,

  2288 			const char *req_package,

  2289 			struct razor_property *req_prop)

  2290 {

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

  2292 	struct bitarray *reqpkgbits;

  2293 	struct razor_transaction_package *tp, *already;

  2294 	const char *pool;

  2295 	struct razor_package *pkgs;

  2296 	struct list *pkg;

  2297 	int contradiction = 0;

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

  2300 		new_package_set = trans->system;

  2301 	else

  2302 		new_package_set = trans->upstream;

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

  2304 		old_package_set = trans->system;

  2305 	else

  2306 		old_package_set = trans->upstream;

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

  2308 		req_set = trans->system;

  2309 		reqpkgbits = &trans->syspkgs;

  2310 	} else {

  2311 		req_set = trans->upstream;

  2312 		reqpkgbits = &trans->uppkgs;

  2313 	}

  2315 	if (new_package) {

  2316 		pool = new_package_set->string_pool.data;

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

  2318 		if (already) {

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

  2320 				/* Already taken care of */

  2321 				return;

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

  2323 				   already->state == RAZOR_PACKAGE_FORCED_UPDATE) {

  2324 				already->new_package = new_package;

  2325 				return;

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

  2327 				return;

  2328 			}

  2330 			/* Oops. We lose */

  2331 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2332 				contradiction = 1;

  2333 		}

  2334 	} else if (old_package) {

  2335 		pool = old_package_set->string_pool.data;

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

  2337 		if (already) {

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

  2339 				/* Already taken care of */

  2340 				return;

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

  2342 				already->old_package = old_package;

  2343 				return;

  2344 			}

  2346 			/* Oops. We lose */

  2347 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2348 				contradiction = 1;

  2349 		}

  2350 	} else

  2351 		state = RAZOR_PACKAGE_UNSATISFIABLE;

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

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

  2356 	if (new_package) {

  2357 		pool = new_package_set->string_pool.data;

  2358 		tp->new_package = new_package;

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

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

  2362 		pkgs = new_package_set->packages.data;

  2363 	}

  2364 	if (old_package) {

  2365 		pool = old_package_set->string_pool.data;

  2366 		tp->old_package = old_package;

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

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

  2370 		pkgs = old_package_set->packages.data;

  2371 	}

  2373 	tp->state = state;

  2374 	if (state != RAZOR_PACKAGE_INSTALL &&

  2375 	    state != RAZOR_PACKAGE_FORCED_UPDATE &&

  2376 	    state != RAZOR_PACKAGE_REMOVE &&

  2377 	    state != RAZOR_PACKAGE_OBSOLETED)

  2378 		trans->errors++;

  2380 	if (contradiction) {

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

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

  2383 		 */

  2384 		add_transaction_package(trans, new_package, old_package,

  2385 					RAZOR_PACKAGE_CONTRADICTION,

  2386 					NULL, NULL);

  2387 	}

  2389 	if (req_package)

  2390 		tp->dep_package = req_package;

  2391 	if (!req_prop)

  2392 		return;

  2394 	pool = req_set->string_pool.data;

  2395 	pkgs = req_set->packages.data;

  2396 	if (!req_package) {

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

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

  2399 				break;

  2400 		}

  2401 		if (pkg)

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

  2403 	}

  2405 	tp->dep_type = req_prop->type;

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

  2407 	tp->dep_relation = req_prop->relation;

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

  2409 }

  2411 static void

  2412 razor_transaction_satisfy(struct razor_transaction *trans)

  2413 {

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

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

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

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

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

  2419 	struct list *reqpkg;

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

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

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

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

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

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

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

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

  2430 	sp = sprops;

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

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

  2433 		 * to-be-installed.

  2434 		 */

  2435 		while (up < uprop_end &&

  2436 		       !prop_is_being_installed(trans, up))

  2437 			up++;

  2438 		if (up == uprop_end)

  2439 			break;

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

  2442 		switch (up->type) {

  2443 		case RAZOR_PROPERTY_REQUIRES:

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

  2445 				break;

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

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

  2449 				/* Requires something that is either installed

  2450 				 * or to-be-installed.

  2451 				 */

  2452 				break;

  2453 			}

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

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

  2457 			if (!pkg)

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

  2459 			add_transaction_package(trans, pkg, NULL,

  2460 						RAZOR_PACKAGE_INSTALL,

  2461 						NULL, up);

  2462 			break;

  2464 		case RAZOR_PROPERTY_PROVIDES:

  2465 			/* find_installed_package_for_property works backwards

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

  2467 			 */

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

  2469 			if (!pkg)

  2470 				break;

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

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

  2474 				 * finding an upgrade

  2475 				 */

  2476 				add_transaction_package(trans, NULL, pkg,

  2477 							RAZOR_PACKAGE_FORCED_UPDATE,

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

  2479 			} else {

  2480 				add_transaction_package(trans, NULL, pkg,

  2481 							RAZOR_PACKAGE_CONTRADICTION,

  2482 							NULL, up);

  2483 			}

  2484 			break;

  2486 		case RAZOR_PROPERTY_CONFLICTS:

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

  2488 			if (!pkg)

  2489 				break;

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

  2492 				/* Conflicts with something already installed.

  2493 				 * Try to upgrade out.

  2494 				 */

  2495 				add_transaction_package(trans, NULL, pkg,

  2496 							RAZOR_PACKAGE_FORCED_UPDATE,

  2497 							NULL, up);

  2498 			} else {

  2499 				add_transaction_package(trans, pkg, NULL,

  2500 							RAZOR_PACKAGE_CONTRADICTION,

  2501 							NULL, up);

  2502 			}

  2503 			break;

  2505 		case RAZOR_PROPERTY_OBSOLETES:

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

  2507 			if (pkg) {

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

  2509 				 * will add a CONTRADICTION error as well.

  2510 				 */

  2511 				add_transaction_package(trans, NULL, pkg,

  2512 							RAZOR_PACKAGE_OBSOLETED,

  2513 							NULL, up);

  2514 			}

  2515 			break;

  2517 		default:

  2518 			/* can't happen */

  2519 			break;

  2520 		}

  2521 	}

  2523 	up = uprops;

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

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

  2526 		 * to-be-removed.

  2527 		 */

  2528 		while (sp < sprop_end &&

  2529 		       (sp->type != RAZOR_PROPERTY_PROVIDES ||

  2530 			!prop_is_being_removed(trans, sp)))

  2531 			sp++;

  2532 		if (sp == sprop_end)

  2533 			break;

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

  2537 		/* Skip 'up' to match */

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

  2539 		ur = first_up = up;

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

  2542 		 * already be installing an identical PROVIDES, so

  2543 		 * check for that.

  2544 		 */

  2545 		while (up < uprop_end &&

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

  2547 		       (up->type != RAZOR_PROPERTY_PROVIDES ||

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

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

  2550 			up++;

  2551 		if (up < uprop_end &&

  2552 		    up->type == RAZOR_PROPERTY_PROVIDES &&

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

  2554 		    sp->relation == up->relation &&

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

  2556 		    prop_is_being_installed(trans, up)) {

  2557 			up = first_up;

  2558 			continue;

  2559 		}

  2560 		up = first_up;

  2562 		/* For all still-installed packages that require

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

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

  2565 		 * not, either remove or attempt to update the

  2566 		 * package, depending on why the required property has

  2567 		 * disappeared

  2568 		 */

  2569 		sr = sp;

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

  2571 			sr--;

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

  2573 			if (prop_is_being_removed(trans, sr))

  2574 				continue;

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

  2576 				continue;

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

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

  2580 					continue;

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

  2582 				if (prop_is_being_updated(trans, sp)) {

  2583 					add_transaction_package(trans, NULL, pkg,

  2584 								RAZOR_PACKAGE_FORCED_UPDATE,

  2585 								removed_package, NULL);

  2586 				} else {

  2587 					add_transaction_package(trans, NULL, pkg,

  2588 								RAZOR_PACKAGE_REMOVE,

  2589 								removed_package, sr);

  2590 				}

  2591 			}

  2592 		}

  2593 	}

  2594 }

  2596 void

  2597 razor_transaction_install_package(struct razor_transaction *transaction,

  2598 				  struct razor_package *package)

  2599 {

  2600 	add_transaction_package(transaction, package, NULL,

  2601 				RAZOR_PACKAGE_INSTALL, NULL, NULL);

  2602 }

  2604 void

  2605 razor_transaction_remove_package(struct razor_transaction *transaction,

  2606 				 struct razor_package *package)

  2607 {

  2608 	add_transaction_package(transaction, NULL, package,

  2609 				RAZOR_PACKAGE_REMOVE, NULL, NULL);

  2610 }

  2612 void

  2613 razor_transaction_update_all(struct razor_transaction *trans)

  2614 {

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

  2616 	const char *spool, *upool;

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

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

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

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

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

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

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

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

  2627 			up++;

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

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

  2630 			add_transaction_package(trans, up, sp,

  2631 						RAZOR_PACKAGE_INSTALL,

  2632 						NULL, NULL);

  2633 		}

  2634 	}

  2635 }

  2637 struct razor_transaction *

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

  2639 {

  2640 	struct razor_transaction *trans;

  2641 	int count;

  2643 	trans = zalloc(sizeof *trans);

  2645 	trans->system = system;

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

  2647 	array_init(&trans->packages);

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

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

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

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

  2653 	return trans;

  2654 }

  2656 static void

  2657 resolve_transaction(struct razor_transaction *trans)

  2658 {

  2659 	int start, end;

  2661 	if (trans->package_count > 0)

  2662 		/* Already did this, return. */

  2663 		return;

  2665 	start = 0;

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

  2668 	while (start != end) {

  2669 		resolve_new_packages(trans, start, end);

  2670 		if (trans->errors)

  2671 			break;

  2673 		razor_transaction_satisfy(trans);

  2675 		start = end;

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

  2677 	}

  2679 	trans->package_count = end;

  2680 }

  2682 const char * const razor_version_relations[] = {

  2683 	/* same order as enum razor_version_relation */

  2684 	"<", "<=", "=", ">=", ">"

  2685 };

  2687 const char * const razor_property_types[] = {

  2688 	/* same order as enum razor_property_type */

  2689 	"requires", "provides", "conflicts with", "obsoletes"

  2690 };

  2692 static void

  2693 print_requirement(struct razor_transaction_package *p)

  2694 {

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

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

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

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

  2699 		if (*p->dep_version) {

  2700 			printf(" %s %s",

  2701 			       razor_version_relations[p->dep_relation],

  2702 			       p->dep_version);

  2703 		}

  2704 	} else {

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

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

  2707 		if (*p->dep_version) {

  2708 			printf(", which %s %s %s %s",

  2709 			       razor_property_types[p->dep_type],

  2710 			       p->dep_property,

  2711 			       razor_version_relations[p->dep_relation],

  2712 			       p->dep_version);

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

  2714 			printf(", which %s %s",

  2715 			       razor_property_types[p->dep_type],

  2716 			       p->dep_property);

  2717 		}

  2718 	}

  2719 }

  2721 int

  2722 razor_transaction_resolve(struct razor_transaction *trans)

  2723 {

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

  2725 	int errors_only = 0;

  2727 	resolve_transaction(trans);

  2729 	tps = trans->packages.data;

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

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

  2732 		switch (p->state) {

  2733 		case RAZOR_PACKAGE_INSTALL:

  2734 			if (errors_only)

  2735 				break;

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

  2738 			if (p->dep_package)

  2739 				print_requirement(p);

  2740 			printf("\n");

  2741 			break;

  2743 		case RAZOR_PACKAGE_FORCED_UPDATE:

  2744 			if (errors_only)

  2745 				break;

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

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

  2749 			break;

  2751 		case RAZOR_PACKAGE_REMOVE:

  2752 			if (errors_only)

  2753 				break;

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

  2755 			if (p->dep_package) {

  2756 				printf(" which required %s",

  2757 				       p->dep_package);

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

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

  2760 			}

  2761 			printf("\n");

  2762 			break;

  2764 		case RAZOR_PACKAGE_OBSOLETED:

  2765 			if (errors_only)

  2766 				break;

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

  2768 			if (p->dep_package) {

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

  2770 				       p->dep_package);

  2771 			}

  2772 			printf("\n");

  2773 			break;

  2775 		case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:

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

  2777 			if (p->dep_package) {

  2778 				printf(" (which is required");

  2779 				print_requirement(p);

  2780 				printf(")");

  2781 			}

  2782 			printf("\n");

  2783 			errors_only = 1;

  2784 			break;

  2786 		case RAZOR_PACKAGE_UPDATE_UNAVAILABLE:

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

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

  2789 			errors_only = 1;

  2790 			break;

  2792 		case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:

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

  2794 			errors_only = 1;

  2795 			break;

  2797 		case RAZOR_PACKAGE_UP_TO_DATE:

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

  2799 			if (p->dep_package)

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

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

  2802 			errors_only = 1;

  2803 			break;

  2805 		case RAZOR_PACKAGE_CONTRADICTION:

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

  2807 			errors_only = 1;

  2808 			break;

  2810 		case RAZOR_PACKAGE_OLD_CONFLICT:

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

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

  2813 			if (*p->dep_version) {

  2814 				printf("%s %s %s",

  2815 				       p->dep_property,

  2816 				       razor_version_relations[p->dep_relation],

  2817 				       p->dep_version);

  2818 			} else

  2819 				printf("it");

  2820 			printf("\n");

  2822 			errors_only = 1;

  2823 			break;

  2825 		case RAZOR_PACKAGE_NEW_CONFLICT:

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

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

  2828 			if (*p->dep_version) {

  2829 				printf(" %s %s",

  2830 				       razor_version_relations[p->dep_relation],

  2831 				       p->dep_version);

  2832 			}

  2833 			printf("\n");

  2835 			errors_only = 1;

  2836 			break;

  2838 		case RAZOR_PACKAGE_UNSATISFIABLE:

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

  2840 			if (*p->dep_version) {

  2841 				printf(" %s %s",

  2842 					razor_version_relations[p->dep_relation],

  2843 					p->dep_version);

  2844 			}

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

  2846 				p->dep_package);

  2847 			errors_only = 1;

  2848 			break;

  2850 		default:

  2851 			/* Shouldn't actually happen */

  2852 			break;

  2853 		}

  2854 	}

  2856 	return trans->errors;

  2857 }

  2859 int

  2860 razor_transaction_unsatisfied_property(struct razor_transaction *trans,

  2861 				       const char *name,

  2862 				       enum razor_version_relation rel,

  2863 				       const char *version)

  2864 {

  2865 	struct razor_transaction_package *p, *end;

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

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

  2869 		if (p->state != RAZOR_PACKAGE_UNSATISFIABLE)

  2870 			continue;

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

  2872 		    rel != p->dep_relation ||

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

  2874 			continue;

  2876 		return 1;

  2877 	}

  2879 	return 0;

  2880 }

  2882 struct razor_set *

  2883 razor_transaction_finish(struct razor_transaction *trans)

  2884 {

  2885 	struct array install_packages, remove_packages;

  2886 	struct razor_merger *merger;

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

  2888 	struct razor_set *set;

  2889 	struct source *source1, *source2;

  2890 	char *spool, *ipool, *rpool;

  2891 	uint32_t *map;

  2892 	struct razor_transaction_package *p, *end;

  2893 	int cmp;

  2895 	/* FIXME */

  2896 	if (trans->errors)

  2897 		return NULL;

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

  2900 	array_init(&install_packages);

  2901 	array_init(&remove_packages);

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

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

  2905 		if (p->new_package) {

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

  2907 			*pkg = *p->new_package;

  2908 		} else {

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

  2910 			*pkg = *p->old_package;

  2911 		}

  2912 	}

  2913 	map = razor_qsort_with_data(install_packages.data,

  2914 				    install_packages.size / sizeof *pkg,

  2915 				    sizeof *pkg,

  2916 				    compare_packages,

  2917 				    trans->upstream);

  2918 	free(map);

  2919 	map = razor_qsort_with_data(remove_packages.data,

  2920 				    remove_packages.size / sizeof *pkg,

  2921 				    sizeof *pkg,

  2922 				    compare_packages,

  2923 				    trans->system);

  2924 	free(map);

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

  2928 	source1 = &merger->source1;

  2929 	source2 = &merger->source2;

  2931 	i = install_packages.data;

  2932 	iend = install_packages.data + install_packages.size;

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

  2935 	r = remove_packages.data;

  2936 	rend = remove_packages.data + remove_packages.size;

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

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

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

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

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

  2944 		/* Check if s is being removed */

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

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

  2947 			s++;

  2948 			r++;

  2949 			continue;

  2950 		}

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

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

  2954 		else if (s < send)

  2955 			cmp = -1;

  2956 		else

  2957 			cmp = 1;

  2958 		if (cmp < 0) {

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

  2960 			s++;

  2961 		} else if (cmp == 0) {

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

  2963 			s++;

  2964 			i++;

  2965 		} else {

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

  2967 			i++;

  2968 		}

  2969 	}

  2971 	array_release(&install_packages);

  2972 	array_release(&remove_packages);

  2974 	set = razor_merger_finish(merger);

  2975 	razor_transaction_destroy(trans);

  2977 	return set;

  2978 }

  2980 void

  2981 razor_transaction_destroy(struct razor_transaction *trans)

  2982 {

  2983 	struct razor_transaction_package *p, *end;

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

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

  2987 		if (!p->dep_package &&

  2988 		    (p->state == RAZOR_PACKAGE_INSTALL_UNAVAILABLE ||

  2989 		     p->state == RAZOR_PACKAGE_REMOVE_NOT_INSTALLED))

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

  2991 	}

  2993 	array_release(&trans->packages);

  2994 	bitarray_release(&trans->syspkgs);

  2995 	bitarray_release(&trans->uppkgs);

  2996 	free(trans);

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

  2999 }

  3001 struct razor_package_query {

  3002 	struct razor_set *set;

  3003 	char *vector;

  3004 	int count;

  3005 };

  3007 struct razor_package_query *

  3008 razor_package_query_create(struct razor_set *set)

  3009 {

  3010 	struct razor_package_query *pq;

  3011 	int count;

  3013 	pq = zalloc(sizeof *pq);

  3014 	pq->set = set;

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

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

  3018 	return pq;

  3019 }

  3021 void

  3022 razor_package_query_add_package(struct razor_package_query *pq,

  3023 				struct razor_package *p)

  3024 {

  3025 	struct razor_package *packages;

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

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

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

  3030 }

  3032 void

  3033 razor_package_query_add_iterator(struct razor_package_query *pq,

  3034 				 struct razor_package_iterator *pi)

  3035 {

  3036 	struct razor_package *packages, *p;

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

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

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

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

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

  3043 	}

  3044 }

  3046 struct razor_package_iterator *

  3047 razor_package_query_finish(struct razor_package_query *pq)

  3048 {

  3049 	struct razor_package_iterator *pi;

  3050 	struct razor_set *set;

  3051 	struct list *index;

  3052 	int i, j, count;

  3054 	set = pq->set;

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

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

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

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

  3060 			continue;

  3062 		index[j].data = i;

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

  3064 			index[j].flags = 0x80;

  3065 		j++;

  3066 	}

  3068 	free(pq);

  3070 	pi = razor_package_iterator_create_with_index(set, index);

  3071 	pi->free_index = 1;

  3073 	return pi;

  3074 }

author	Kristian H?gsberg <krh@redhat.com>
	Wed Jun 04 21:28:26 2008 -0400 (2008-06-04)
changeset 222	052dce887a07
parent 216	b97c130460a5
child 224	5803b6151d02
child 230	c1e2aed8dd07
permissions	-rw-r--r--