razor: razor.c@cae6308aa5b1

     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_DETAILS_MAGIC 	0x7a7a7a7b

    54 #define RAZOR_FILES_MAGIC 	0x7a7a7a7c

    55 #define RAZOR_VERSION 1

    57 #define RAZOR_STRING_POOL		0

    58 #define RAZOR_PACKAGES			1

    59 #define RAZOR_PROPERTIES		2

    60 #define RAZOR_PACKAGE_POOL		3

    61 #define RAZOR_PROPERTY_POOL		4

    63 #define RAZOR_DETAILS_STRING_POOL	0

    65 #define RAZOR_FILES			0

    66 #define RAZOR_FILE_POOL			1

    67 #define RAZOR_FILE_STRING_POOL		2

    69 struct razor_package {

    70 	uint name  : 24;

    71 	uint flags : 8;

    72 	uint32_t version;

    73 	uint32_t arch;

    74 	uint32_t summary;

    75 	uint32_t description;

    76 	uint32_t url;

    77 	uint32_t license;

    78 	struct list_head properties;

    79 	struct list_head files;

    80 };

    82 struct razor_property {

    83 	uint name  : 24;

    84 	uint flags : 6;

    85 	enum razor_property_type type : 2;

    86 	enum razor_version_relation relation : 32;

    87 	uint32_t version;

    88 	struct list_head packages;

    89 };

    91 struct razor_entry {

    92 	uint name  : 24;

    93 	uint flags : 8;

    94 	uint32_t start;

    95 	struct list_head packages;

    96 };

    98 #define RAZOR_ENTRY_LAST	0x80

   100 struct razor_set {

   101 	struct array string_pool;

   102  	struct array packages;

   103  	struct array properties;

   104  	struct array files;

   105 	struct array package_pool;

   106  	struct array property_pool;

   107  	struct array file_pool;

   108 	struct array file_string_pool;

   109 	struct array details_string_pool;

   110 	struct razor_set_header *header;

   111 	struct razor_set_header *details_header;

   112 	struct razor_set_header *files_header;

   113 };

   115 struct import_entry {

   116 	uint32_t package;

   117 	char *name;

   118 };

   120 struct import_directory {

   121 	uint32_t name, count;

   122 	struct array files;

   123 	struct array packages;

   124 	struct import_directory *last;

   125 };

   127 struct razor_importer {

   128 	struct razor_set *set;

   129 	struct hashtable table;

   130 	struct hashtable file_table;

   131 	struct hashtable details_table;

   132 	struct razor_package *package;

   133 	struct array properties;

   134 	struct array files;

   135 	struct array file_requires;

   136 };

   138 static void *

   139 zalloc(size_t size)

   140 {

   141 	void *p;

   143 	p = malloc(size);

   144 	memset(p, 0, size);

   146 	return p;

   147 }

   149 struct razor_set_section razor_sections[] = {

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

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

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

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

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

   155 };

   157 struct razor_set_section razor_files_sections[] = {

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

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

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

   161 };

   163 struct razor_set_section razor_details_sections[] = {

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

   165 };

   167 struct razor_set *

   168 razor_set_create(void)

   169 {

   170 	struct razor_set *set;

   171 	struct razor_entry *e;

   172 	char *empty;

   174 	set = zalloc(sizeof *set);

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

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

   178 	*empty = '\0';

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

   180 	*empty = '\0';

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

   182 	*empty = '\0';

   183 	e->name = 0;

   184 	e->flags = RAZOR_ENTRY_LAST;

   185 	e->start = 0;

   186 	list_set_empty(&e->packages);

   188 	return set;

   189 }

   191 struct razor_set *

   192 razor_set_open(const char *filename)

   193 {

   194 	struct razor_set *set;

   195 	struct razor_set_section *s;

   196 	struct stat stat;

   197 	struct array *array;

   198 	int fd;

   200 	set = zalloc(sizeof *set);

   201 	fd = open(filename, O_RDONLY);

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

   203 		return NULL;

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

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

   206 		free(set);

   207 		return NULL;

   208 	}

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

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

   212 			continue;

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

   214 			continue;

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

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

   217 		array->size = s->size;

   218 		array->alloc = s->size;

   219 	}

   220 	close(fd);

   222 	return set;

   223 }

   225 void

   226 razor_set_destroy(struct razor_set *set)

   227 {

   228 	unsigned int size;

   229 	struct array *a;

   230 	int i;

   232 	if (set->header) {

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

   234 			;

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

   236 		munmap(set->header, size);

   237 	} else {

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

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

   240 			free(a->data);

   241 		}

   242 	}

   244 	if (set->details_header) {

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

   246 			;

   247 		size = set->details_header->sections[i].type;

   248 		munmap(set->details_header, size);

   249 	} else {

   250 		for (i = 0; i < ARRAY_SIZE(razor_details_sections); i++) {

   251 			a = (void *) set + razor_details_sections[i].offset;

   252 			free(a->data);

   253 		}

   254 	}

   256 	if (set->files_header) {

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

   258 			;

   259 		size = set->files_header->sections[i].type;

   260 		munmap(set->files_header, size);

   261 	} else {

   262 		for (i = 0; i < ARRAY_SIZE(razor_files_sections); i++) {

   263 			a = (void *) set + razor_files_sections[i].offset;

   264 			free(a->data);

   265 		}

   266 	}

   268 	free(set);

   269 }

   271 void

   272 razor_set_open_details(struct razor_set *set, const char *filename)

   273 {

   274 	struct razor_set_section *s;

   275 	struct stat stat;

   276 	struct array *array;

   277 	int fd;

   279 	fd = open(filename, O_RDONLY);

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

   281 		return;

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

   283 	if (set->details_header == MAP_FAILED)

   284 		return;

   286 	for (s = set->details_header->sections; ~s->type; s++) {

   287 		if (s->type >= ARRAY_SIZE(razor_details_sections))

   288 			continue;

   289 		if (s->type != razor_details_sections[s->type].type)

   290 			continue;

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

   292 		array->data = (void *) set->details_header + s->offset;

   293 		array->size = s->size;

   294 		array->alloc = s->size;

   295 	}

   296 	close(fd);

   297 }

   299 void

   300 razor_set_open_files(struct razor_set *set, const char *filename)

   301 {

   302 	struct razor_set_section *s;

   303 	struct stat stat;

   304 	struct array *array;

   305 	int fd;

   307 	fd = open(filename, O_RDONLY);

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

   309 		return;

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

   311 	if (set->files_header == MAP_FAILED)

   312 		return;

   314 	for (s = set->files_header->sections; ~s->type; s++) {

   315 		if (s->type >= ARRAY_SIZE(razor_files_sections))

   316 			continue;

   317 		if (s->type != razor_files_sections[s->type].type)

   318 			continue;

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

   320 		array->data = (void *) set->files_header + s->offset;

   321 		array->size = s->size;

   322 		array->alloc = s->size;

   323 	}

   324 	close(fd);

   325 }

   327 static int

   328 razor_set_write_sections_to_fd(struct razor_set *set, int fd, int magic,

   329 			       struct razor_set_section *sections,

   330 			       size_t array_size)

   331 {

   332 	char data[4096];

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

   334 	struct array *a;

   335 	uint32_t offset;

   336 	int i;

   338 	memset(data, 0, sizeof data);

   339 	header->magic = magic;

   340 	header->version = RAZOR_VERSION;

   341 	offset = sizeof data;

   343 	for (i = 0; i < array_size; i++) {

   344 		if (sections[i].type != i)

   345 			continue;

   346 		a = (void *) set + sections[i].offset;

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

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

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

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

   351 	}

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

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

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

   357 	razor_write(fd, data, sizeof data);

   358 	memset(data, 0, sizeof data);

   359 	for (i = 0; i < array_size; i++) {

   360 		if (sections[i].type != i)

   361 			continue;

   362 		a = (void *) set + sections[i].offset;

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

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

   365 	}

   367 	return 0;

   368 }

   370 int

   371 razor_set_write_to_fd(struct razor_set *set, int fd,

   372 		      enum razor_repo_file_type type)

   373 {

   374 	switch (type) {

   375 	case RAZOR_REPO_FILE_MAIN:

   376 		return razor_set_write_sections_to_fd(set, fd, RAZOR_MAGIC,

   377 						      razor_sections,

   378 						      ARRAY_SIZE(razor_sections));

   380 	case RAZOR_REPO_FILE_DETAILS:

   381 		return razor_set_write_sections_to_fd(set, fd, RAZOR_DETAILS_MAGIC,

   382 						      razor_details_sections,

   383 						      ARRAY_SIZE(razor_details_sections));

   384 	case RAZOR_REPO_FILE_FILES:

   385 		return razor_set_write_sections_to_fd(set, fd, RAZOR_FILES_MAGIC,

   386 						      razor_files_sections,

   387 						      ARRAY_SIZE(razor_files_sections));

   388 	default:

   389 		return -1;

   390 	}

   391 }

   393 int

   394 razor_set_write(struct razor_set *set, const char *filename,

   395 		enum razor_repo_file_type type)

   396 {

   397 	int fd, status;

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

   400 	if (fd < 0)

   401 		return -1;

   403 	status = razor_set_write_to_fd(set, fd, type);

   404 	if (status) {

   405 	    close(fd);

   406 	    return status;

   407 	}

   409 	return close(fd);

   410 }

   412 void

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

   414 		const char *version, const char *release)

   415 {

   416 	int len;

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

   419 		*evr_buf = '\0';

   420 		return;

   421 	}

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

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

   425 		evr_buf += len;

   426 		size -= len;

   427 	}

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

   429 	evr_buf += len;

   430 	size -= len;

   431 	if (release && *release)

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

   433 }

   435 void

   436 razor_importer_begin_package(struct razor_importer *importer,

   437 			     const char *name,

   438 			     const char *version,

   439 			     const char *arch)

   440 {

   441 	struct razor_package *p;

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

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

   445 	p->flags = 0;

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

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

   449 	importer->package = p;

   450 	array_init(&importer->properties);

   451 }

   453 void

   454 razor_importer_finish_package(struct razor_importer *importer)

   455 {

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

   457 		       &importer->set->property_pool,

   458 		       &importer->properties,

   459 		       1);

   461 	array_release(&importer->properties);

   462 }

   464 void

   465 razor_importer_add_details(struct razor_importer *importer,

   466 			   const char *summary,

   467 			   const char *description,

   468 			   const char *url,

   469 			   const char *license)

   470 {

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

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

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

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

   475 }

   477 void

   478 razor_importer_add_property(struct razor_importer *importer,

   479 			    const char *name,

   480 			    enum razor_version_relation relation,

   481 			    const char *version,

   482 			    enum razor_property_type type)

   483 {

   484 	struct razor_property *p;

   485 	uint32_t *r;

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

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

   489 	p->flags = 0;

   490 	p->type = type;

   491 	p->relation = relation;

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

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

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

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

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

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

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

   501 		*r = p->name;

   502 	}

   503 }

   505 void

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

   507 {

   508 	struct import_entry *e;

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

   512 	e->package = importer->package -

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

   514 	e->name = strdup(name);

   515 }

   517 struct razor_importer *

   518 razor_importer_new(void)

   519 {

   520 	struct razor_importer *importer;

   522 	importer = zalloc(sizeof *importer);

   523 	importer->set = razor_set_create();

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

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

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

   528 	return importer;

   529 }

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

   532 void

   533 razor_importer_destroy(struct razor_importer *importer)

   534 {

   535 	/* FIXME: write this */

   536 }

   538 static int

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

   540 {

   541 	const char *p1, *p2;

   542 	long n1, n2;

   543 	int res;

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

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

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

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

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

   551 	if (res < 0) {

   552 		n1 = 0;

   553 		p1 = s1;

   554 		p2++;

   555 	} else if (res > 0) {

   556 		p1++;

   557 		n2 = 0;

   558 		p2 = s2;

   559 	}

   561 	if (n1 != n2)

   562 		return n1 - n2;

   563 	while (*p1 && *p2) {

   564 		if (*p1 != *p2)

   565 			return *p1 - *p2;

   566 		p1++;

   567 		p2++;

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

   569 			return versioncmp(p1, p2);

   570 	}

   572 	return *p1 - *p2;

   573 }

   575 static int

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

   577 {

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

   579 	struct razor_set *set = data;

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

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

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

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

   585 	else

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

   587 }

   589 static int

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

   591 {

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

   593 	struct razor_set *set = data;

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

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

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

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

   599 		return prop1->type - prop2->type;

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

   601 		return prop1->relation - prop2->relation;

   602 	else

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

   604 }

   606 static uint32_t *

   607 uniqueify_properties(struct razor_set *set)

   608 {

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

   610 	struct array *pkgs, *p;

   611 	struct list_head *r;

   612 	uint32_t *map, *rmap;

   613 	int i, count, unique;

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

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

   617 				    count,

   618 				    sizeof(struct razor_property),

   619 				    compare_properties,

   620 				    set);

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

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

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

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

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

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

   628 			up++;

   629 			up->name = rp->name;

   630 			up->flags = 0;

   631 			up->type = rp->type;

   632 			up->relation = rp->relation;

   633 			up->version = rp->version;

   634 		}

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

   637 		rmap[map[i]] = unique;

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

   639 		*r = rp->packages;

   640 	}

   641 	free(map);

   643 	if (up != rp)

   644 		up++;

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

   646 	rp_end = up;

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

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

   649 		array_release(p);

   650 	}

   652 	free(pkgs);

   654 	return rmap;

   655 }

   657 static int

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

   659 {

   660 	const struct import_entry *e1 = p1;

   661 	const struct import_entry *e2 = p2;

   662 	const char *n1 = e1->name;

   663 	const char *n2 = e2->name;

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

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

   667 	 * sort before "foo.conf"

   668 	 *

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

   670 	 */

   671 	while (*n1 && *n2) {

   672 		if (*n1 < *n2)

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

   674 		else if (*n1 > *n2)

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

   676 		n1++;

   677 		n2++;

   678 	}

   679 	if (*n1)

   680 		return 1;

   681 	else if (*n2)

   682 		return -1;

   683 	else

   684 		return 0;

   685 }

   687 static void

   688 count_entries(struct import_directory *d)

   689 {

   690 	struct import_directory *p, *end;

   692 	p = d->files.data;

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

   694 	d->count = 0;

   695 	while (p < end) {

   696 		count_entries(p);

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

   698 		p++;

   699 	}

   700 }

   702 static void

   703 serialize_files(struct razor_set *set,

   704 		struct import_directory *d, struct array *array)

   705 {

   706 	struct import_directory *p, *end;

   707 	struct razor_entry *e = NULL;

   708 	uint32_t s;

   710 	p = d->files.data;

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

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

   713 	while (p < end) {

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

   715 		e->name = p->name;

   716 		e->flags = 0;

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

   718 		s += p->count;

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

   721 		array_release(&p->packages);

   722 		p++;

   723 	}

   724 	if (e != NULL)

   725 		e->flags |= RAZOR_ENTRY_LAST;

   727 	p = d->files.data;

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

   729 	while (p < end) {

   730 		serialize_files(set, p, array);

   731 		p++;

   732 	}

   733 }

   735 static void

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

   737 {

   738 	struct razor_property *p, *end;

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

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

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

   743 }

   745 static void

   746 build_file_tree(struct razor_importer *importer)

   747 {

   748 	int count, i, length;

   749 	struct import_entry *filenames;

   750 	char *f, *end;

   751 	uint32_t name, *r;

   752 	char dirname[256];

   753 	struct import_directory *d, root;

   754 	struct razor_entry *e;

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

   757 	razor_qsort_with_data(importer->files.data,

   758 			      count,

   759 			      sizeof (struct import_entry),

   760 			      compare_filenames,

   761 			      NULL);

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

   764 	array_init(&root.files);

   765 	array_init(&root.packages);

   766 	root.last = NULL;

   768 	filenames = importer->files.data;

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

   770 		f = filenames[i].name;

   771 		if (*f != '/')

   772 			continue;

   773 		f++;

   775 		d = &root;

   776 		while (*f) {

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

   778 			if (end == NULL)

   779 				end = f + strlen(f);

   780 			length = end - f;

   781 			memcpy(dirname, f, length);

   782 			dirname[length] ='\0';

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

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

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

   786 				d->last->name = name;

   787 				d->last->last = NULL;

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

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

   790 			}

   791 			d = d->last;

   792 			f = end + 1;

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

   794 				break;

   795 		}

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

   798 		*r = filenames[i].package;

   799 		free(filenames[i].name);

   800 	}

   802 	count_entries(&root);

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

   804 	e->name = root.name;

   805 	e->flags = RAZOR_ENTRY_LAST;

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

   807 	list_set_empty(&e->packages);

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

   811 	array_release(&importer->files);

   812 }

   814 static struct razor_entry *

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

   817 static void

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

   819 {

   820 	uint32_t *item;

   822 	while (list) {

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

   824 		 *item = list->data;

   825 		 list = list_next(list);

   826 	}

   827 }

   829 static int

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

   831 {

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

   833 	const char *pool = data;

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

   836 }

   838 static void

   839 find_file_provides(struct razor_importer *importer)

   840 {

   841 	struct razor_property *prop;

   842 	struct razor_entry *top, *entry;

   843 	struct razor_package *packages;

   844 	struct array pkgprops;

   845 	struct list *pkg;

   846 	uint32_t *req, *req_start, *req_end;

   847 	uint32_t *map, *newprop;

   848 	char *pool;

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

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

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

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

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

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

   857 				    compare_file_requires, pool);

   858 	free(map);

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

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

   862 			continue;

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

   864 		if (!entry)

   865 			continue;

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

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

   869 			prop->name = *req;

   870 			prop->type = RAZOR_PROPERTY_PROVIDES;

   871 			prop->relation = RAZOR_VERSION_EQUAL;

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

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

   875 			/* Update property list of pkg */

   876 			array_init(&pkgprops);

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

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

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

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

   881 			array_release(&pkgprops);

   882 		}

   883 	}

   885 	array_release(&importer->file_requires);

   886 }

   888 static void

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

   890 {

   891 	struct razor_package *p, *packages;

   892 	struct array *pkgs;

   893 	struct razor_entry *e, *end;

   894 	struct list *r;

   895 	uint32_t *q;

   896 	int i, count;

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

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

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

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

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

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

   905 		while (r) {

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

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

   908 			r = list_next(r);

   909 		}

   910 	}

   912 	packages = set->packages.data;

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

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

   915 		array_release(&pkgs[i]);

   916 	}

   917 	free(pkgs);

   918 }

   920 struct razor_set *

   921 razor_importer_finish(struct razor_importer *importer)

   922 {

   923 	struct razor_set *set;

   924 	uint32_t *map, *rmap;

   925 	int i, count;

   927 	build_file_tree(importer);

   928 	find_file_provides(importer);

   930 	map = uniqueify_properties(importer->set);

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

   932 	free(map);

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

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

   936 				    count,

   937 				    sizeof(struct razor_package),

   938 				    compare_packages,

   939 				    importer->set);

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

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

   943 		rmap[map[i]] = i;

   944 	free(map);

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

   947 	build_package_file_lists(importer->set, rmap);

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

   949 	free(rmap);

   951 	set = importer->set;

   952 	hashtable_release(&importer->table);

   953 	hashtable_release(&importer->file_table);

   954 	hashtable_release(&importer->details_table);

   955 	free(importer);

   957 	return set;

   958 }

   960 struct razor_package_iterator {

   961 	struct razor_set *set;

   962 	struct razor_package *package, *end;

   963 	struct list *index;

   964 	int free_index;

   965 };

   967 static struct razor_package_iterator *

   968 razor_package_iterator_create_with_index(struct razor_set *set,

   969 					 struct list *index)

   970 {

   971 	struct razor_package_iterator *pi;

   973 	pi = zalloc(sizeof *pi);

   974 	pi->set = set;

   975 	pi->index = index;

   977 	return pi;

   978 }

   980 struct razor_package_iterator *

   981 razor_package_iterator_create(struct razor_set *set)

   982 {

   983 	struct razor_package_iterator *pi;

   985 	pi = zalloc(sizeof *pi);

   986 	pi->set = set;

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

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

   990 	return pi;

   991 }

   993 struct razor_package_iterator *

   994 razor_package_iterator_create_for_property(struct razor_set *set,

   995 					   struct razor_property *property)

   996 {

   997 	struct list *index;

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

  1000 	return razor_package_iterator_create_with_index(set, index);

  1001 }

  1003 int

  1004 razor_package_iterator_next(struct razor_package_iterator *pi,

  1005 			    struct razor_package **package,

  1006 			    const char **name,

  1007 			    const char **version,

  1008 			    const char **arch)

  1009 {

  1010 	char *pool;

  1011 	int valid;

  1012 	struct razor_package *p, *packages;

  1014 	if (pi->package) {

  1015 		p = pi->package++;

  1016 		valid = p < pi->end;

  1017 	} else if (pi->index) {

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

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

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

  1021 		valid = 1;

  1022 	} else

  1023 		valid = 0;

  1025 	if (valid) {

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

  1027 		*package = p;

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

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

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

  1031 	} else {

  1032 		*package = NULL;

  1033 	}

  1035 	return valid;

  1036 }

  1038 void

  1039 razor_package_iterator_destroy(struct razor_package_iterator *pi)

  1040 {

  1041 	if (pi->free_index)

  1042 		free(pi->index);

  1044 	free(pi);

  1045 }

  1047 struct razor_package *

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

  1049 {

  1050 	struct razor_package_iterator *pi;

  1051 	struct razor_package *p;

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

  1054 	pi = razor_package_iterator_create(set);

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

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

  1057 			break;

  1058 	}

  1059 	razor_package_iterator_destroy(pi);

  1061 	return p;

  1062 }

  1064 void

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

  1066 			  const char **summary, const char **description,

  1067 			  const char **url, const char **license)

  1068 {

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

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

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

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

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

  1075 }

  1077 struct razor_property_iterator {

  1078 	struct razor_set *set;

  1079 	struct razor_property *property, *end;

  1080 	struct list *index;

  1081 };

  1083 struct razor_property_iterator *

  1084 razor_property_iterator_create(struct razor_set *set,

  1085 			       struct razor_package *package)

  1086 {

  1087 	struct razor_property_iterator *pi;

  1089 	pi = zalloc(sizeof *pi);

  1090 	pi->set = set;

  1092 	if (package) {

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

  1094 				       &set->property_pool);

  1095 	} else {

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

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

  1098 	}

  1100 	return pi;

  1101 }

  1103 int

  1104 razor_property_iterator_next(struct razor_property_iterator *pi,

  1105 			     struct razor_property **property,

  1106 			     const char **name,

  1107 			     enum razor_version_relation *relation,

  1108 			     const char **version,

  1109 			     enum razor_property_type *type)

  1110 {

  1111 	char *pool;

  1112 	int valid;

  1113 	struct razor_property *p, *properties;

  1115 	if (pi->property) {

  1116 		p = pi->property++;

  1117 		valid = p < pi->end;

  1118 	} else if (pi->index) {

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

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

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

  1122 		valid = 1;

  1123 	} else

  1124 		valid = 0;

  1126 	if (valid) {

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

  1128 		*property = p;

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

  1130 		*relation = p->relation;

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

  1132 		*type = p->type;

  1133 	} else {

  1134 		*property = NULL;

  1135 	}

  1137 	return valid;

  1138 }

  1140 void

  1141 razor_property_iterator_destroy(struct razor_property_iterator *pi)

  1142 {

  1143 	free(pi);

  1144 }

  1146 static struct razor_entry *

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

  1148 {

  1149 	struct razor_entry *e;

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

  1151 	int len;

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

  1154 	do {

  1155 		n = pool + e->name;

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

  1157 			return e;

  1158 		len = strlen(n);

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

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

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

  1162 		}

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

  1165 	return NULL;

  1166 }

  1168 static void

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

  1170 	 char *prefix, const char *pattern)

  1171 {

  1172 	struct razor_entry *e;

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

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

  1176 	do {

  1177 		n = pool + e->name;

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

  1179 			continue;

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

  1181 		if (e->start) {

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

  1183 			*sub = '/';

  1184 			strcpy (sub + 1, n);

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

  1186 			*sub = '\0';

  1187 		}

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

  1189 }

  1191 void

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

  1193 {

  1194 	struct razor_entry *e;

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

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

  1198 		buffer[0] = '\0';

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

  1200 		return;

  1201 	}

  1203 	strcpy(buffer, pattern);

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

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

  1206 		base = NULL;

  1207 	} else {

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

  1209 		if (p) {

  1210 			*p = '\0';

  1211 			base = p + 1;

  1212 		} else {

  1213 			base = NULL;

  1214 		}

  1215 	}

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

  1217 	if (e->start != 0)

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

  1219 }

  1221 struct razor_package_iterator *

  1222 razor_package_iterator_create_for_file(struct razor_set *set,

  1223 				       const char *filename)

  1224 {

  1225 	struct razor_entry *entry;

  1226 	struct list *index;

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

  1229 	if (entry == NULL)

  1230 		return NULL;

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

  1233 	return razor_package_iterator_create_with_index(set, index);

  1234 }

  1236 static struct list *

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

  1238 		   struct razor_entry *dir, uint32_t end,

  1239 		   char *prefix)

  1240 {

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

  1242 	uint32_t next, file;

  1243 	char *pool;

  1244 	int len;

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

  1247 	pool = set->file_string_pool.data;

  1249 	e = entries + dir->start;

  1250 	do {

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

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

  1253 			r = list_next(r);

  1254 			if (!r)

  1255 				return NULL;

  1256 			if (r->data >= end)

  1257 				return r;

  1258 		}

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

  1261 	e = entries + dir->start;

  1262 	do {

  1263 		if (e->start == 0)

  1264 			continue;

  1266 		if (e->flags & RAZOR_ENTRY_LAST)

  1267 			next = end;

  1268 		else {

  1269 			f = e + 1;

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

  1271 				f++;

  1272 			if (f->start == 0)

  1273 				next = end;

  1274 			else

  1275 				next = f->start;

  1276 		}

  1278 		file = r->data;

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

  1280 			len = strlen(prefix);

  1281 			prefix[len] = '/';

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

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

  1284 			prefix[len] = '\0';

  1285 		}

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

  1288 	return r;

  1289 }

  1291 void

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

  1293 {

  1294 	struct razor_package *package;

  1295 	struct list *r;

  1296 	uint32_t end;

  1297 	char buffer[512];

  1299 	package = razor_set_get_package(set, name);

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

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

  1303 	buffer[0] = '\0';

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

  1305 }

  1307 static void

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

  1309 {

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

  1311 	uint32_t *u;

  1312 	char *pool;

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

  1315 	pool = set->string_pool.data;

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

  1318 		if (r->type != RAZOR_PROPERTY_REQUIRES)

  1319 			continue;

  1321 		p = r;

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

  1323 		       p->type == r->type)

  1324 			p++;

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

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

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

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

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

  1331 		 * does.*/

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

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

  1334 			p++;

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

  1337 		 * etc) to properly determine if a requires is

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

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

  1341 		if (p == end ||

  1342 		    p->type != RAZOR_PROPERTY_PROVIDES ||

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

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

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

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

  1347 				continue;

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

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

  1350 		}

  1351 	}

  1352 }

  1354 void

  1355 razor_set_list_unsatisfied(struct razor_set *set)

  1356 {

  1357 	struct array unsatisfied;

  1358 	struct razor_property *properties, *r;

  1359 	uint32_t *u, *end;

  1360 	char *pool;

  1362 	array_init(&unsatisfied);

  1363 	razor_set_validate(set, &unsatisfied);

  1365 	end = unsatisfied.data + unsatisfied.size;

  1366 	properties = set->properties.data;

  1367 	pool = set->string_pool.data;

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

  1370 		r = properties + *u;

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

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

  1373 			       &pool[r->name]);

  1374 		else

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

  1376 			       &pool[r->name],

  1377 			       &pool[r->version]);

  1378 	}

  1380 	array_release(&unsatisfied);

  1381 }

  1383 #define UPSTREAM_SOURCE 0x80

  1385 struct source {

  1386 	struct razor_set *set;

  1387 	uint32_t *property_map;

  1388 	uint32_t *file_map;

  1389 };

  1391 struct razor_merger {

  1392 	struct razor_set *set;

  1393 	struct hashtable table;

  1394 	struct hashtable file_table;

  1395 	struct hashtable details_table;

  1396 	struct source source1;

  1397 	struct source source2;

  1398 };

  1400 static struct razor_merger *

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

  1402 {

  1403 	struct razor_merger *merger;

  1404 	int count;

  1405 	size_t size;

  1407 	merger = zalloc(sizeof *merger);

  1408 	merger->set = razor_set_create();

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

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

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

  1413 	merger->source1.set = set1;

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

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

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

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

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

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

  1421 	merger->source2.set = set2;

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

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

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

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

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

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

  1429 	return merger;

  1430 }

  1432 static void

  1433 add_package(struct razor_merger *merger,

  1434 	    struct razor_package *package, struct source *source,

  1435 	    uint32_t flags)

  1436 {

  1437 	char *pool;

  1438 	struct list *r;

  1439 	struct razor_package *p;

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

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

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

  1444 	p->flags = flags;

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

  1446 					&pool[package->version]);

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

  1448 				     &pool[package->arch]);

  1450 	p->properties = package->properties;

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

  1452 	while (r) {

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

  1454 		r = list_next(r);

  1455 	}

  1457 	p->files = package->files;

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

  1459 	while (r) {

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

  1461 		r = list_next(r);

  1462 	}

  1463 }

  1465 static uint32_t

  1466 add_property(struct razor_merger *merger,

  1467 	     const char *name, enum razor_version_relation relation,

  1468 	     const char *version, int type)

  1469 {

  1470 	struct razor_property *p;

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

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

  1474 	p->flags = 0;

  1475 	p->type = type;

  1476 	p->relation = relation;

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

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

  1480 }

  1482 static void

  1483 merge_properties(struct razor_merger *merger)

  1484 {

  1485 	struct razor_property *p1, *p2;

  1486 	struct razor_set *set1, *set2;

  1487 	uint32_t *map1, *map2;

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

  1489 	char *pool1, *pool2;

  1491 	set1 = merger->source1.set;

  1492 	set2 = merger->source2.set;

  1493 	map1 = merger->source1.property_map;

  1494 	map2 = merger->source2.property_map;

  1496 	i = 0;

  1497 	j = 0;

  1498 	pool1 = set1->string_pool.data;

  1499 	pool2 = set2->string_pool.data;

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

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

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

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

  1505 			i++;

  1506 			continue;

  1507 		}

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

  1509 			j++;

  1510 			continue;

  1511 		}

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

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

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

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

  1516 		else if (i < count1)

  1517 			cmp = -1;

  1518 		else

  1519 			cmp = 1;

  1520 		if (cmp == 0)

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

  1522 		if (cmp == 0)

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

  1524 		if (cmp == 0)

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

  1526 					 &pool2[p2->version]);

  1527 		if (cmp < 0) {

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

  1529 						 &pool1[p1->name],

  1530 						 p1->relation,

  1531 						 &pool1[p1->version],

  1532 						 p1->type);

  1533 		} else if (cmp > 0) {

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

  1535 						 &pool2[p2->name],

  1536 						 p2->relation,

  1537 						 &pool2[p2->version],

  1538 						 p2->type);

  1539 		} else  {

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

  1541 							     &pool1[p1->name],

  1542 							     p1->relation,

  1543 							     &pool1[p1->version],

  1544 							     p1->type);

  1545 		}

  1546 	}

  1547 }

  1549 static void

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

  1551 		uint32_t *map, struct array *pool)

  1552 {

  1553 	uint32_t r;

  1554 	struct list *p, *q;

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

  1557 	p = list_first(properties, source_pool);

  1558 	while (p) {

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

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

  1561 		q->flags = p->flags;

  1562 		p = list_next(p);

  1563 	}

  1565 	list_set_ptr(properties, r);

  1566 }

  1568 static uint32_t

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

  1570 {

  1571 	struct razor_entry *e;

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

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

  1575 	e->flags = 0;

  1576 	e->start = 0;

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

  1579 }

  1581 /* FIXME. Blah */

  1582 static int

  1583 fix_file_map(uint32_t *map,

  1584 	     struct razor_entry *files,

  1585 	     struct razor_entry *top)

  1586 {

  1587 	uint32_t e;

  1588 	int found_file = 0;

  1590 	e = top->start;

  1591 	do {

  1592 		if (files[e].start)

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

  1594 		if (map[e])

  1595 			found_file = 1;

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

  1598 	if (found_file)

  1599 		map[top - files] = 1;

  1600 	return found_file;

  1601 }

  1603 struct merge_directory {

  1604 	uint32_t merged, dir1, dir2;

  1605 };

  1607 static void

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

  1609 {

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

  1611 	struct razor_set *set1, *set2;

  1612 	struct array merge_stack;

  1613 	struct merge_directory *child_md, *end_md;

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

  1615 	int cmp;

  1616 	char *pool1, *pool2;

  1618 	set1 = merger->source1.set;

  1619 	set2 = merger->source2.set;

  1620 	map1 = merger->source1.file_map;

  1621 	map2 = merger->source2.file_map;

  1622 	pool1 = set1->string_pool.data;

  1623 	pool2 = set2->string_pool.data;

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

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

  1627 	array_init(&merge_stack);

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

  1630 	last = 0;

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

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

  1633 	while (e1 || e2) {

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

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

  1636 				e1 = NULL;

  1637 			continue;

  1638 		}

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

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

  1641 				e2 = NULL;

  1642 			continue;

  1643 		}

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

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

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

  1647 				e1 = NULL;

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

  1649 				e2 = NULL;

  1650 			continue;

  1651 		}

  1653 		if (!e1)

  1654 			cmp = 1;

  1655 		else if (!e2)

  1656 			cmp = -1;

  1657 		else {

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

  1659 				      &pool2[e2->name]);

  1660 		}

  1662 		if (cmp < 0) {

  1663 			if (map1[e1 - root1]) {

  1664 				map1[e1 - root1] = last =

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

  1666 				if (e1->start) {

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

  1668 					child_md->merged = last;

  1669 					child_md->dir1 = e1->start;

  1670 					child_md->dir2 = 0;

  1671 				}

  1672 			}

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

  1674 				e1 = NULL;

  1675 		} else if (cmp > 0) {

  1676 			if (map2[e2 - root2]) {

  1677 				map2[e2 - root2] = last =

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

  1679 				if (e2->start) {

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

  1681 					child_md->merged = last;

  1682 					child_md->dir1 = 0;

  1683 					child_md->dir2 = e2->start;

  1684 				}

  1685 			}

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

  1687 				e2 = NULL;

  1688 		} else {

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

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

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

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

  1693 				child_md->merged = last;

  1694 				child_md->dir1 = e1->start;

  1695 				child_md->dir2 = e2->start;

  1696 			}

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

  1698 				e1 = NULL;

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

  1700 				e2 = NULL;

  1701 		}

  1702 	}

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

  1705 	if (last) {

  1706 		mroot[last].flags = RAZOR_ENTRY_LAST;

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

  1708 	} else

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

  1711 	end_md = merge_stack.data + merge_stack.size;

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

  1713 		merge_one_directory(merger, child_md);

  1714 	array_release(&merge_stack);

  1715 }

  1717 static void

  1718 merge_files(struct razor_merger *merger)

  1719 {

  1720 	struct razor_entry *root;

  1721 	struct merge_directory md;

  1722 	uint32_t *map1, *map2;

  1724 	map1 = merger->source1.file_map;

  1725 	map2 = merger->source2.file_map;

  1727 	md.merged = 0;

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

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

  1731 		if (root->start)

  1732 			fix_file_map(map1, root, root);

  1733 		md.dir1 = root->start;

  1734 	} else

  1735 		md.dir1 = 0;

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

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

  1739 		if (root->start)

  1740 			fix_file_map(map2, root, root);

  1741 		md.dir2 = root->start;

  1742 	} else

  1743 		md.dir2 = 0;

  1745 	merge_one_directory(merger, &md);

  1746 }

  1748 static void

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

  1750 	   uint32_t *map, struct array *pool)

  1751 {

  1752 	uint32_t r;

  1753 	struct list *p, *q;

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

  1756 	p = list_first(files, source_pool);

  1757 	while (p) {

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

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

  1760 		q->flags = p->flags;

  1761 		p = list_next(p);

  1762 	}

  1764 	list_set_ptr(files, r);

  1765 }

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

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

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

  1770  * the arrays for their properties. */

  1771 static void

  1772 rebuild_property_package_lists(struct razor_set *set)

  1773 {

  1774 	struct array *pkgs, *a;

  1775 	struct razor_package *pkg, *pkg_end;

  1776 	struct razor_property *prop, *prop_end;

  1777 	struct list *r;

  1778 	uint32_t *q;

  1779 	int count;

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

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

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

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

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

  1787 		while (r) {

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

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

  1790 			r = list_next(r);

  1791 		}

  1792 	}

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

  1795 	a = pkgs;

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

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

  1798 		array_release(a);

  1799 	}

  1800 	free(pkgs);

  1801 }

  1803 static void

  1804 rebuild_file_package_lists(struct razor_set *set)

  1805 {

  1806 	struct array *pkgs, *a;

  1807 	struct razor_package *pkg, *pkg_end;

  1808 	struct razor_entry *entry, *entry_end;

  1809 	struct list *r;

  1810 	uint32_t *q;

  1811 	int count;

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

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

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

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

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

  1819 		while (r) {

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

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

  1822 			r = list_next(r);

  1823 		}

  1824 	}

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

  1827 	a = pkgs;

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

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

  1830 		array_release(a);

  1831 	}

  1832 	free(pkgs);

  1833 }

  1835 static struct razor_set *

  1836 razor_merger_finish(struct razor_merger *merger)

  1837 {

  1838 	struct razor_set *result;

  1839 	struct razor_package *p, *pend;

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

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

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

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

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

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

  1847 	 * property list for both sets. */

  1849 	merge_properties(merger);

  1850 	merge_files(merger);

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

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

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

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

  1857 		struct source *src;

  1859 		if (p->flags & UPSTREAM_SOURCE)

  1860 			src = &merger->source2;

  1861 		else

  1862 			src = &merger->source1;

  1864 		emit_properties(&p->properties,

  1865 				&src->set->property_pool,

  1866 				src->property_map,

  1867 				&merger->set->property_pool);

  1868 		emit_files(&p->files,

  1869 			   &src->set->file_pool,

  1870 			   src->file_map,

  1871 			   &merger->set->file_pool);

  1872 		p->flags &= ~UPSTREAM_SOURCE;

  1873 	}

  1875 	rebuild_property_package_lists(merger->set);

  1876 	rebuild_file_package_lists(merger->set);

  1878 	result = merger->set;

  1879 	hashtable_release(&merger->table);

  1880 	hashtable_release(&merger->file_table);

  1881 	hashtable_release(&merger->details_table);

  1882 	free(merger);

  1884 	return result;

  1885 }

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

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

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

  1890  **/

  1892 void

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

  1894 	       razor_package_callback_t callback, void *data)

  1895 {

  1896 	struct razor_package_iterator *pi1, *pi2;

  1897 	struct razor_package *p1, *p2;

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

  1899 	int res;

  1901 	pi1 = razor_package_iterator_create(set);

  1902 	pi2 = razor_package_iterator_create(upstream);

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

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

  1907 	while (p1 || p2) {

  1908 		if (p1 && p2) {

  1909 			res = strcmp(name1, name2);

  1910 			if (res == 0)

  1911 				res = versioncmp(version1, version2);

  1912 		} else {

  1913 			res = 0;

  1914 		}

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

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

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

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

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

  1922 			razor_package_iterator_next(pi1, &p1,

  1923 						    &name1, &version1, &arch1);

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

  1925 			razor_package_iterator_next(pi2, &p2,

  1926 						    &name2, &version2, &arch2);

  1927 	}

  1929 	razor_package_iterator_destroy(pi1);

  1930 	razor_package_iterator_destroy(pi2);

  1931 }

  1933 struct razor_transaction;

  1934 struct razor_transaction_package;

  1935 struct razor_transaction_resolver;

  1937 struct razor_transaction {

  1938 	int package_count, errors;

  1939 	struct razor_set *system, *upstream;

  1941 	struct bitarray syspkgs, uppkgs;

  1942 	struct array packages;

  1943 };

  1945 struct razor_transaction_package {

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

  1947 	struct razor_package *old_package, *new_package;

  1948 	enum razor_transaction_package_state state;

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

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

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

  1953 	 * additional information.

  1954 	 *

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

  1956 	 * required something that this package provides. If dep_type

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

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

  1959 	 *

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

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

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

  1963 	 *

  1964 	 * For OLD_CONFLICT or NEW_CONFLICT, dep_package is an

  1965 	 * existing package that conflicts with this one. The

  1966 	 * conflicting property comes from the already-installed

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

  1968 	 * for NEW_CONFLICT.

  1969 	 *

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

  1971 	 * but the name field will be NULL.

  1972 	 */

  1973 	const char *dep_package;

  1974 	enum razor_property_type dep_type;

  1975 	const char *dep_property;

  1976 	enum razor_version_relation dep_relation;

  1977 	const char *dep_version;

  1978 };

  1980 static int

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

  1982 {

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

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

  1985 }

  1987 static int

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

  1989 {

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

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

  1992 }

  1994 static struct razor_package *

  1995 property_provider_package(struct razor_transaction *trans,

  1996 			  struct razor_property *prop,

  1997 			  int installed)

  1998 {

  1999 	struct razor_set *set;

  2000 	struct bitarray *pkgbits;

  2001 	struct razor_package *pkgs;

  2002 	struct list *p;

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

  2005 		return NULL;

  2006 	else if (!installed &&

  2007 		 prop->type != RAZOR_PROPERTY_PROVIDES &&

  2008 		 prop->type != RAZOR_PROPERTY_OBSOLETES)

  2009 		return NULL;

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

  2012 		set = trans->system;

  2013 		pkgbits = &trans->syspkgs;

  2014 	} else {

  2015 		set = trans->upstream;

  2016 		pkgbits = &trans->uppkgs;

  2017 	}

  2018 	pkgs = set->packages.data;

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

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

  2022 			continue;

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

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

  2025 			return &pkgs[p->data];

  2026 	}

  2027 	return NULL;

  2028 }

  2030 static int

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

  2032 {

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

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

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

  2037 		return 1;

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

  2039 		return -1;

  2040 	else

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

  2042 }

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

  2045 static void

  2046 resolve_new_packages(struct razor_transaction *trans,

  2047 		     int start, int end)

  2048 {

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

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

  2051 	struct razor_transaction_package **packages;

  2052 	const char *spool, *upool;

  2053 	int i;

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

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

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

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

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

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

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

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

  2064 	 * descriptions.

  2065 	 */

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

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

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

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

  2070 	      compare_transaction_packages);

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

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

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

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

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

  2077 			continue;

  2079 		spkg = NULL;

  2080 		while (sp < sp_end &&

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

  2082 			sp++;

  2083 		while (sp < sp_end &&

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

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

  2086 			sp++;

  2088 		upkg = NULL;

  2089 		while (up < up_end &&

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

  2091 			up++;

  2092 		while (up < up_end &&

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

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

  2095 			up++;

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

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

  2099 			if (spkg) {

  2100 				packages[i]->old_package = spkg;

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

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

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

  2104 			}

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

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

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

  2108 				trans->errors++;

  2109 			}

  2110 		} else {

  2111 			if (upkg) {

  2112 				packages[i]->new_package = upkg;

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

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

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

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

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

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

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

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

  2122 				}

  2124 				if (spkg) {

  2125 					packages[i]->old_package = spkg;

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

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

  2128 						packages[i]->state = RAZOR_PACKAGE_UP_TO_DATE;

  2129 						trans->errors++;

  2130 						continue;

  2131 					}

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

  2133 				}

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

  2135 			}

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

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

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

  2139 				trans->errors++;

  2140 			}

  2141 		}

  2142 	}

  2143 }

  2145 static int

  2146 provider_satisfies_requirement(struct razor_property *provider,

  2147 			       const char *provider_strings,

  2148 			       struct razor_property *requirement,

  2149 			       const char *requirement_strings)

  2150 {

  2151 	int cmp, len;

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

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

  2155 	if (!*required)

  2156 		return 1;

  2157 	if (!*provided) {

  2158 		if (requirement->relation >= RAZOR_VERSION_EQUAL)

  2159 			return 1;

  2160 		else

  2161 			return 0;

  2162 	}

  2164 	cmp = versioncmp(provided, required);

  2166 	switch (requirement->relation) {

  2167 	case RAZOR_VERSION_LESS:

  2168 		return cmp < 0;

  2170 	case RAZOR_VERSION_LESS_OR_EQUAL:

  2171 		if (cmp <= 0)

  2172 			return 1;

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

  2175 	case RAZOR_VERSION_EQUAL:

  2176 		if (cmp == 0)

  2177 			return 1;

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

  2180 		len = strlen(required);

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

  2182 			return 1;

  2183 		return 0;

  2185 	case RAZOR_VERSION_GREATER_OR_EQUAL:

  2186 		return cmp >= 0;

  2188 	case RAZOR_VERSION_GREATER:

  2189 		return cmp > 0;

  2190 	}

  2192 	/* shouldn't happen */

  2193 	return 0;

  2194 }

  2196 static struct razor_package *

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

  2198 		      const char *filename, int installed)

  2199 {

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

  2201 	struct razor_entry *entry;

  2202 	struct list *p;

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

  2205 		return 0;

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

  2208 	if (!entry)

  2209 		return 0;

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

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

  2213 			return &pkgs[p->data];

  2214 	}

  2215 	return NULL;

  2216 }

  2218 static struct razor_package *

  2219 find_installed_package_for_file(struct razor_transaction *trans,

  2220 				const char *filename)

  2221 {

  2222 	struct razor_package *pkg;

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

  2225 				    filename, 1);

  2226 	if (!pkg)

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

  2228 					    filename, 1);

  2229 	return pkg;

  2230 }

  2232 static struct razor_package *

  2233 find_uninstalled_package_for_file(struct razor_transaction *trans,

  2234 				  const char *filename)

  2235 {

  2236 	struct razor_package *pkg;

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

  2239 				    filename, 0);

  2240 	if (!pkg)

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

  2242 					    filename, 0);

  2243 	return pkg;

  2244 }

  2246 static struct razor_property *

  2247 skip_to_matching_property(struct razor_transaction *trans,

  2248 			  struct razor_property *match,

  2249 			  struct razor_property *prop)

  2250 {

  2251 	struct razor_set *mset, *pset;

  2252 	const char *ppool, *mpool;

  2253 	struct razor_property *prop_end;

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

  2256 		mset = trans->system;

  2257 	else

  2258 		mset = trans->upstream;

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

  2261 		pset = trans->system;

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

  2263 		pset = trans->upstream;

  2264 	else

  2265 		return prop;

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

  2268 	ppool = pset->string_pool.data;

  2269 	mpool = mset->string_pool.data;

  2271 	while (prop < prop_end &&

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

  2273 		prop++;

  2274 	return prop;

  2275 }

  2277 static struct razor_package *

  2278 find_package_matching(struct razor_transaction *trans, int installed,

  2279 		      struct razor_property *prop,

  2280 		      struct razor_property *req,

  2281 		      struct razor_set *req_set)

  2282 {

  2283 	struct razor_set *set;

  2284 	struct bitarray *pkgbits;

  2285 	struct razor_package *pkgs;

  2286 	struct razor_property *props, *prop_end;

  2287 	enum razor_property_type match_type;

  2288 	const char *pool;

  2289 	const char *rpool;

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

  2291 	int match;

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

  2294 		set = trans->system;

  2295 		pkgbits = &trans->syspkgs;

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

  2297 		set = trans->upstream;

  2298 		pkgbits = &trans->uppkgs;

  2299 	} else

  2300 		return NULL;

  2302 	if (!req_set) {

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

  2304 			req_set = trans->system;

  2305 		else

  2306 			req_set = trans->upstream;

  2307 	}

  2308 	rpool = req_set->string_pool.data;

  2310 	if (req->type == RAZOR_PROPERTY_PROVIDES)

  2311 		match_type = RAZOR_PROPERTY_CONFLICTS;

  2312 	else

  2313 		match_type = RAZOR_PROPERTY_PROVIDES;

  2315 	pkgs = set->packages.data;

  2316 	props = set->properties.data;

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

  2318 	pool = set->string_pool.data;

  2320 	/* Find first matching property */

  2321 	while (prop < prop_end &&

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

  2323 		prop++;

  2324 	if (prop == prop_end ||

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

  2326 		return NULL;

  2328 	if (prop->type < match_type) {

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

  2330 			prop++;

  2331 	} else {

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

  2333 			prop--;

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

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

  2336 			prop--;

  2337 	}

  2339 	/* Scan matching properties */

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

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

  2342 		if (match_type == RAZOR_PROPERTY_PROVIDES)

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

  2344 		else

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

  2346 		if (match) {

  2347 			struct list *pkg;

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

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

  2351 					continue;

  2352 				if (!match_name ||

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

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

  2355 					return &pkgs[pkg->data];

  2356 			}

  2357 		}

  2358 		prop++;

  2359 	}

  2361 	return NULL;

  2362 }

  2364 static struct razor_package *

  2365 find_installed_package_for_property(struct razor_transaction *trans,

  2366 				    struct razor_property *sys_start,

  2367 				    struct razor_property *up_start,

  2368 				    struct razor_property *req)

  2369 {

  2370 	struct razor_package *pkg;

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

  2373 	if (!pkg)

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

  2375 	return pkg;

  2376 }

  2378 static struct razor_package *

  2379 find_uninstalled_package_for_property(struct razor_transaction *trans,

  2380 				      struct razor_property *sys_start,

  2381 				      struct razor_property *up_start,

  2382 				      struct razor_property *req)

  2383 {

  2384 	struct razor_package *pkg;

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

  2387 	if (!pkg)

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

  2389 	return pkg;

  2390 }

  2392 static struct razor_transaction_package *

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

  2394 {

  2395 	struct razor_transaction_package *packages;

  2396 	int count, i;

  2398 	packages = trans->packages.data;

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

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

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

  2402 			return &packages[i];

  2403 	}

  2404 	return NULL;

  2405 }

  2407 /* FIXME? */

  2408 static int

  2409 prop_is_being_installed(struct razor_transaction *trans,

  2410 			struct razor_property *prop)

  2411 {

  2412 	struct list *pkg;

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

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

  2416 			return 1;

  2417 	}

  2418 	return 0;

  2419 }

  2421 static int

  2422 prop_is_being_removed(struct razor_transaction *trans,

  2423 		      struct razor_property *prop)

  2424 {

  2425 	struct list *pkg;

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

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

  2429 			return 0;

  2430 	}

  2431 	return 1;

  2432 }

  2434 static int

  2435 prop_is_being_updated(struct razor_transaction *trans,

  2436 		      struct razor_property *prop)

  2437 {

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

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

  2440 	struct razor_transaction_package *tp;

  2441 	struct list *pkg;

  2443 	/* Assumes prop_is_being_removed returns true */

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

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

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

  2448 			return 0;

  2449 	}

  2450 	return 1;

  2451 }

  2453 static void

  2454 add_transaction_package(struct razor_transaction *trans,

  2455 			struct razor_package *new_package,

  2456 			struct razor_package *old_package,

  2457 			enum razor_transaction_package_state state,

  2458 			const char *req_package,

  2459 			struct razor_property *req_prop)

  2460 {

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

  2462 	struct bitarray *reqpkgbits;

  2463 	struct razor_transaction_package *tp, *already;

  2464 	const char *pool;

  2465 	struct razor_package *pkgs;

  2466 	struct list *pkg;

  2467 	int contradiction = 0;

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

  2470 		new_package_set = trans->system;

  2471 	else

  2472 		new_package_set = trans->upstream;

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

  2474 		old_package_set = trans->system;

  2475 	else

  2476 		old_package_set = trans->upstream;

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

  2478 		req_set = trans->system;

  2479 		reqpkgbits = &trans->syspkgs;

  2480 	} else {

  2481 		req_set = trans->upstream;

  2482 		reqpkgbits = &trans->uppkgs;

  2483 	}

  2485 	if (new_package) {

  2486 		pool = new_package_set->string_pool.data;

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

  2488 		if (already) {

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

  2490 				/* Already taken care of */

  2491 				return;

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

  2493 				   already->state == RAZOR_PACKAGE_FORCED_UPDATE) {

  2494 				already->new_package = new_package;

  2495 				return;

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

  2497 				return;

  2498 			}

  2500 			/* Oops. We lose */

  2501 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2502 				contradiction = 1;

  2503 		}

  2504 	} else if (old_package) {

  2505 		pool = old_package_set->string_pool.data;

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

  2507 		if (already) {

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

  2509 				/* Already taken care of */

  2510 				return;

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

  2512 				already->old_package = old_package;

  2513 				return;

  2514 			}

  2516 			/* Oops. We lose */

  2517 			if (state != RAZOR_PACKAGE_CONTRADICTION)

  2518 				contradiction = 1;

  2519 		}

  2520 	} else

  2521 		state = RAZOR_PACKAGE_UNSATISFIABLE;

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

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

  2526 	if (new_package) {

  2527 		pool = new_package_set->string_pool.data;

  2528 		tp->new_package = new_package;

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

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

  2532 		pkgs = new_package_set->packages.data;

  2533 	}

  2534 	if (old_package) {

  2535 		pool = old_package_set->string_pool.data;

  2536 		tp->old_package = old_package;

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

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

  2540 		pkgs = old_package_set->packages.data;

  2541 	}

  2543 	tp->state = state;

  2544 	if (state != RAZOR_PACKAGE_INSTALL &&

  2545 	    state != RAZOR_PACKAGE_FORCED_UPDATE &&

  2546 	    state != RAZOR_PACKAGE_REMOVE &&

  2547 	    state != RAZOR_PACKAGE_OBSOLETED)

  2548 		trans->errors++;

  2550 	if (contradiction) {

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

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

  2553 		 */

  2554 		add_transaction_package(trans, new_package, old_package,

  2555 					RAZOR_PACKAGE_CONTRADICTION,

  2556 					NULL, NULL);

  2557 	}

  2559 	if (req_package)

  2560 		tp->dep_package = req_package;

  2561 	if (!req_prop)

  2562 		return;

  2564 	pool = req_set->string_pool.data;

  2565 	pkgs = req_set->packages.data;

  2566 	if (!req_package) {

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

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

  2569 				break;

  2570 		}

  2571 		if (pkg)

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

  2573 	}

  2575 	tp->dep_type = req_prop->type;

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

  2577 	tp->dep_relation = req_prop->relation;

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

  2579 }

  2581 static void

  2582 razor_transaction_satisfy(struct razor_transaction *trans)

  2583 {

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

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

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

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

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

  2589 	struct list *reqpkg;

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

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

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

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

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

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

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

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

  2600 	sp = sprops;

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

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

  2603 		 * to-be-installed.

  2604 		 */

  2605 		while (up < uprop_end &&

  2606 		       !prop_is_being_installed(trans, up))

  2607 			up++;

  2608 		if (up == uprop_end)

  2609 			break;

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

  2612 		switch (up->type) {

  2613 		case RAZOR_PROPERTY_REQUIRES:

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

  2615 				break;

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

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

  2619 				/* Requires something that is either installed

  2620 				 * or to-be-installed.

  2621 				 */

  2622 				break;

  2623 			}

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

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

  2627 			if (!pkg)

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

  2629 			add_transaction_package(trans, pkg, NULL,

  2630 						RAZOR_PACKAGE_INSTALL,

  2631 						NULL, up);

  2632 			break;

  2634 		case RAZOR_PROPERTY_PROVIDES:

  2635 			/* find_installed_package_for_property works backwards

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

  2637 			 */

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

  2639 			if (!pkg)

  2640 				break;

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

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

  2644 				 * finding an upgrade

  2645 				 */

  2646 				add_transaction_package(trans, NULL, pkg,

  2647 							RAZOR_PACKAGE_FORCED_UPDATE,

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

  2649 			} else {

  2650 				add_transaction_package(trans, NULL, pkg,

  2651 							RAZOR_PACKAGE_CONTRADICTION,

  2652 							NULL, up);

  2653 			}

  2654 			break;

  2656 		case RAZOR_PROPERTY_CONFLICTS:

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

  2658 			if (!pkg)

  2659 				break;

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

  2662 				/* Conflicts with something already installed.

  2663 				 * Try to upgrade out.

  2664 				 */

  2665 				add_transaction_package(trans, NULL, pkg,

  2666 							RAZOR_PACKAGE_FORCED_UPDATE,

  2667 							NULL, up);

  2668 			} else {

  2669 				add_transaction_package(trans, pkg, NULL,

  2670 							RAZOR_PACKAGE_CONTRADICTION,

  2671 							NULL, up);

  2672 			}

  2673 			break;

  2675 		case RAZOR_PROPERTY_OBSOLETES:

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

  2677 			if (pkg) {

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

  2679 				 * will add a CONTRADICTION error as well.

  2680 				 */

  2681 				add_transaction_package(trans, NULL, pkg,

  2682 							RAZOR_PACKAGE_OBSOLETED,

  2683 							NULL, up);

  2684 			}

  2685 			break;

  2687 		default:

  2688 			/* can't happen */

  2689 			break;

  2690 		}

  2691 	}

  2693 	up = uprops;

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

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

  2696 		 * to-be-removed.

  2697 		 */

  2698 		while (sp < sprop_end &&

  2699 		       (sp->type != RAZOR_PROPERTY_PROVIDES ||

  2700 			!prop_is_being_removed(trans, sp)))

  2701 			sp++;

  2702 		if (sp == sprop_end)

  2703 			break;

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

  2707 		/* Skip 'up' to match */

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

  2709 		ur = first_up = up;

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

  2712 		 * already be installing an identical PROVIDES, so

  2713 		 * check for that.

  2714 		 */

  2715 		while (up < uprop_end &&

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

  2717 		       (up->type != RAZOR_PROPERTY_PROVIDES ||

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

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

  2720 			up++;

  2721 		if (up < uprop_end &&

  2722 		    up->type == RAZOR_PROPERTY_PROVIDES &&

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

  2724 		    sp->relation == up->relation &&

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

  2726 		    prop_is_being_installed(trans, up)) {

  2727 			up = first_up;

  2728 			continue;

  2729 		}

  2730 		up = first_up;

  2732 		/* For all still-installed packages that require

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

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

  2735 		 * not, either remove or attempt to update the

  2736 		 * package, depending on why the required property has

  2737 		 * disappeared

  2738 		 */

  2739 		sr = sp;

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

  2741 			sr--;

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

  2743 			if (prop_is_being_removed(trans, sr))

  2744 				continue;

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

  2746 				continue;

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

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

  2750 					continue;

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

  2752 				if (prop_is_being_updated(trans, sp)) {

  2753 					add_transaction_package(trans, NULL, pkg,

  2754 								RAZOR_PACKAGE_FORCED_UPDATE,

  2755 								removed_package, NULL);

  2756 				} else {

  2757 					add_transaction_package(trans, NULL, pkg,

  2758 								RAZOR_PACKAGE_REMOVE,

  2759 								removed_package, sr);

  2760 				}

  2761 			}

  2762 		}

  2763 	}

  2764 }

  2766 void

  2767 razor_transaction_install_package(struct razor_transaction *transaction,

  2768 				  struct razor_package *package)

  2769 {

  2770 	add_transaction_package(transaction, package, NULL,

  2771 				RAZOR_PACKAGE_INSTALL, NULL, NULL);

  2772 }

  2774 void

  2775 razor_transaction_remove_package(struct razor_transaction *transaction,

  2776 				 struct razor_package *package)

  2777 {

  2778 	add_transaction_package(transaction, NULL, package,

  2779 				RAZOR_PACKAGE_REMOVE, NULL, NULL);

  2780 }

  2782 void

  2783 razor_transaction_update_all(struct razor_transaction *trans)

  2784 {

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

  2786 	const char *spool, *upool;

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

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

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

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

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

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

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

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

  2797 			up++;

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

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

  2800 			add_transaction_package(trans, up, sp,

  2801 						RAZOR_PACKAGE_INSTALL,

  2802 						NULL, NULL);

  2803 		}

  2804 	}

  2805 }

  2807 struct razor_transaction *

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

  2809 {

  2810 	struct razor_transaction *trans;

  2811 	int count;

  2813 	trans = zalloc(sizeof *trans);

  2815 	trans->system = system;

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

  2817 	array_init(&trans->packages);

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

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

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

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

  2823 	return trans;

  2824 }

  2826 static void

  2827 resolve_transaction(struct razor_transaction *trans)

  2828 {

  2829 	int start, end;

  2831 	if (trans->package_count > 0)

  2832 		/* Already did this, return. */

  2833 		return;

  2835 	start = 0;

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

  2838 	while (start != end) {

  2839 		resolve_new_packages(trans, start, end);

  2840 		if (trans->errors)

  2841 			break;

  2843 		razor_transaction_satisfy(trans);

  2845 		start = end;

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

  2847 	}

  2849 	trans->package_count = end;

  2850 }

  2852 const char * const razor_version_relations[] = {

  2853 	/* same order as enum razor_version_relation */

  2854 	"<", "<=", "=", ">=", ">"

  2855 };

  2857 const char * const razor_property_types[] = {

  2858 	/* same order as enum razor_property_type */

  2859 	"requires", "provides", "conflicts with", "obsoletes"

  2860 };

  2862 static void

  2863 print_requirement(struct razor_transaction_package *p)

  2864 {

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

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

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

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

  2869 		if (*p->dep_version) {

  2870 			printf(" %s %s",

  2871 			       razor_version_relations[p->dep_relation],

  2872 			       p->dep_version);

  2873 		}

  2874 	} else {

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

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

  2877 		if (*p->dep_version) {

  2878 			printf(", which %s %s %s %s",

  2879 			       razor_property_types[p->dep_type],

  2880 			       p->dep_property,

  2881 			       razor_version_relations[p->dep_relation],

  2882 			       p->dep_version);

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

  2884 			printf(", which %s %s",

  2885 			       razor_property_types[p->dep_type],

  2886 			       p->dep_property);

  2887 		}

  2888 	}

  2889 }

  2891 int

  2892 razor_transaction_resolve(struct razor_transaction *trans)

  2893 {

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

  2895 	int errors_only = 0;

  2897 	resolve_transaction(trans);

  2899 	tps = trans->packages.data;

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

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

  2902 		switch (p->state) {

  2903 		case RAZOR_PACKAGE_INSTALL:

  2904 			if (errors_only)

  2905 				break;

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

  2908 			if (p->dep_package)

  2909 				print_requirement(p);

  2910 			printf("\n");

  2911 			break;

  2913 		case RAZOR_PACKAGE_FORCED_UPDATE:

  2914 			if (errors_only)

  2915 				break;

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

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

  2919 			break;

  2921 		case RAZOR_PACKAGE_REMOVE:

  2922 			if (errors_only)

  2923 				break;

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

  2925 			if (p->dep_package) {

  2926 				printf(" which required %s",

  2927 				       p->dep_package);

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

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

  2930 			}

  2931 			printf("\n");

  2932 			break;

  2934 		case RAZOR_PACKAGE_OBSOLETED:

  2935 			if (errors_only)

  2936 				break;

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

  2938 			if (p->dep_package) {

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

  2940 				       p->dep_package);

  2941 			}

  2942 			printf("\n");

  2943 			break;

  2945 		case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:

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

  2947 			if (p->dep_package) {

  2948 				printf(" (which is required");

  2949 				print_requirement(p);

  2950 				printf(")");

  2951 			}

  2952 			printf("\n");

  2953 			errors_only = 1;

  2954 			break;

  2956 		case RAZOR_PACKAGE_UPDATE_UNAVAILABLE:

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

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

  2959 			errors_only = 1;

  2960 			break;

  2962 		case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:

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

  2964 			errors_only = 1;

  2965 			break;

  2967 		case RAZOR_PACKAGE_UP_TO_DATE:

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

  2969 			if (p->dep_package)

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

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

  2972 			errors_only = 1;

  2973 			break;

  2975 		case RAZOR_PACKAGE_CONTRADICTION:

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

  2977 			errors_only = 1;

  2978 			break;

  2980 		case RAZOR_PACKAGE_OLD_CONFLICT:

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

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

  2983 			if (*p->dep_version) {

  2984 				printf("%s %s %s",

  2985 				       p->dep_property,

  2986 				       razor_version_relations[p->dep_relation],

  2987 				       p->dep_version);

  2988 			} else

  2989 				printf("it");

  2990 			printf("\n");

  2992 			errors_only = 1;

  2993 			break;

  2995 		case RAZOR_PACKAGE_NEW_CONFLICT:

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

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

  2998 			if (*p->dep_version) {

  2999 				printf(" %s %s",

  3000 				       razor_version_relations[p->dep_relation],

  3001 				       p->dep_version);

  3002 			}

  3003 			printf("\n");

  3005 			errors_only = 1;

  3006 			break;

  3008 		case RAZOR_PACKAGE_UNSATISFIABLE:

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

  3010 			if (*p->dep_version) {

  3011 				printf(" %s %s",

  3012 					razor_version_relations[p->dep_relation],

  3013 					p->dep_version);

  3014 			}

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

  3016 				p->dep_package);

  3017 			errors_only = 1;

  3018 			break;

  3020 		default:

  3021 			/* Shouldn't actually happen */

  3022 			break;

  3023 		}

  3024 	}

  3026 	return trans->errors;

  3027 }

  3029 int

  3030 razor_transaction_unsatisfied_property(struct razor_transaction *trans,

  3031 				       const char *name,

  3032 				       enum razor_version_relation rel,

  3033 				       const char *version)

  3034 {

  3035 	struct razor_transaction_package *p, *end;

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

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

  3039 		if (p->state != RAZOR_PACKAGE_UNSATISFIABLE)

  3040 			continue;

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

  3042 		    rel != p->dep_relation ||

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

  3044 			continue;

  3046 		return 1;

  3047 	}

  3049 	return 0;

  3050 }

  3052 struct razor_set *

  3053 razor_transaction_finish(struct razor_transaction *trans)

  3054 {

  3055 	struct array install_packages, remove_packages;

  3056 	struct razor_merger *merger;

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

  3058 	struct razor_set *set;

  3059 	struct source *source1, *source2;

  3060 	char *spool, *ipool, *rpool;

  3061 	uint32_t *map;

  3062 	struct razor_transaction_package *p, *end;

  3063 	int cmp;

  3065 	/* FIXME */

  3066 	if (trans->errors)

  3067 		return NULL;

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

  3070 	array_init(&install_packages);

  3071 	array_init(&remove_packages);

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

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

  3075 		if (p->new_package) {

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

  3077 			*pkg = *p->new_package;

  3078 		} else {

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

  3080 			*pkg = *p->old_package;

  3081 		}

  3082 	}

  3083 	map = razor_qsort_with_data(install_packages.data,

  3084 				    install_packages.size / sizeof *pkg,

  3085 				    sizeof *pkg,

  3086 				    compare_packages,

  3087 				    trans->upstream);

  3088 	free(map);

  3089 	map = razor_qsort_with_data(remove_packages.data,

  3090 				    remove_packages.size / sizeof *pkg,

  3091 				    sizeof *pkg,

  3092 				    compare_packages,

  3093 				    trans->system);

  3094 	free(map);

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

  3098 	source1 = &merger->source1;

  3099 	source2 = &merger->source2;

  3101 	i = install_packages.data;

  3102 	iend = install_packages.data + install_packages.size;

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

  3105 	r = remove_packages.data;

  3106 	rend = remove_packages.data + remove_packages.size;

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

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

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

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

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

  3114 		/* Check if s is being removed */

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

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

  3117 			s++;

  3118 			r++;

  3119 			continue;

  3120 		}

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

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

  3124 		else if (s < send)

  3125 			cmp = -1;

  3126 		else

  3127 			cmp = 1;

  3128 		if (cmp < 0) {

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

  3130 			s++;

  3131 		} else if (cmp == 0) {

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

  3133 			s++;

  3134 			i++;

  3135 		} else {

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

  3137 			i++;

  3138 		}

  3139 	}

  3141 	array_release(&install_packages);

  3142 	array_release(&remove_packages);

  3144 	set = razor_merger_finish(merger);

  3145 	razor_transaction_destroy(trans);

  3147 	return set;

  3148 }

  3150 void

  3151 razor_transaction_destroy(struct razor_transaction *trans)

  3152 {

  3153 	struct razor_transaction_package *p, *end;

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

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

  3157 		if (!p->dep_package &&

  3158 		    (p->state == RAZOR_PACKAGE_INSTALL_UNAVAILABLE ||

  3159 		     p->state == RAZOR_PACKAGE_REMOVE_NOT_INSTALLED))

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

  3161 	}

  3163 	array_release(&trans->packages);

  3164 	bitarray_release(&trans->syspkgs);

  3165 	bitarray_release(&trans->uppkgs);

  3166 	free(trans);

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

  3169 }

  3171 struct razor_package_query {

  3172 	struct razor_set *set;

  3173 	char *vector;

  3174 	int count;

  3175 };

  3177 struct razor_package_query *

  3178 razor_package_query_create(struct razor_set *set)

  3179 {

  3180 	struct razor_package_query *pq;

  3181 	int count;

  3183 	pq = zalloc(sizeof *pq);

  3184 	pq->set = set;

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

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

  3188 	return pq;

  3189 }

  3191 void

  3192 razor_package_query_add_package(struct razor_package_query *pq,

  3193 				struct razor_package *p)

  3194 {

  3195 	struct razor_package *packages;

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

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

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

  3200 }

  3202 void

  3203 razor_package_query_add_iterator(struct razor_package_query *pq,

  3204 				 struct razor_package_iterator *pi)

  3205 {

  3206 	struct razor_package *packages, *p;

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

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

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

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

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

  3213 	}

  3214 }

  3216 struct razor_package_iterator *

  3217 razor_package_query_finish(struct razor_package_query *pq)

  3218 {

  3219 	struct razor_package_iterator *pi;

  3220 	struct razor_set *set;

  3221 	struct list *index;

  3222 	int i, j, count;

  3224 	set = pq->set;

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

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

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

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

  3230 			continue;

  3232 		index[j].data = i;

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

  3234 			index[j].flags = 0x80;

  3235 		j++;

  3236 	}

  3238 	free(pq);

  3240 	pi = razor_package_iterator_create_with_index(set, index);

  3241 	pi->free_index = 1;

  3243 	return pi;

  3244 }

author	James Bowes <jbowes@redhat.com>
	Sun Jun 15 18:16:20 2008 -0400 (2008-06-15)
changeset 229	cae6308aa5b1
parent 228	8b9849d1e5b0
permissions	-rw-r--r--