razor: razor.c@1d4043c9f869

     1 #define _GNU_SOURCE

     3 #include <stdlib.h>

     4 #include <stddef.h>

     5 #include <stdint.h>

     6 #include <stdio.h>

     7 #include <string.h>

     8 #include <sys/types.h>

     9 #include <sys/stat.h>

    10 #include <sys/mman.h>

    11 #include <unistd.h>

    12 #include <fcntl.h>

    13 #include <errno.h>

    14 #include <ctype.h>

    15 #include <fnmatch.h>

    17 #include "razor.h"

    18 #include "razor-internal.h"

    19 #include "types.h"

    21 struct razor_set_section {

    22 	uint32_t type;

    23 	uint32_t offset;

    24 	uint32_t size;

    25 };

    27 struct razor_set_header {

    28 	uint32_t magic;

    29 	uint32_t version;

    30 	struct razor_set_section sections[0];

    31 };

    33 #define RAZOR_MAGIC 0x7a7a7a7a

    34 #define RAZOR_VERSION 1

    36 #define RAZOR_STRING_POOL	0

    37 #define RAZOR_PACKAGES		1

    38 #define RAZOR_PROPERTIES	2

    39 #define RAZOR_FILES		3

    40 #define RAZOR_PACKAGE_POOL	4

    41 #define RAZOR_PROPERTY_POOL	5

    42 #define RAZOR_FILE_POOL		6

    44 struct razor_package {

    45 	uint name  : 24;

    46 	uint flags : 8;

    47 	uint32_t version;

    48 	struct list_head properties;

    49 	struct list_head files;

    50 };

    52 struct razor_property {

    53 	uint name  : 24;

    54 	uint flags : 6;

    55 	uint type  : 2;

    56 	uint32_t relation;

    57 	uint32_t version;

    58 	struct list_head packages;

    59 };

    61 struct razor_entry {

    62 	uint name  : 24;

    63 	uint flags : 8;

    64 	uint32_t start;

    65 	struct list_head packages;

    66 };

    68 #define RAZOR_ENTRY_LAST	0x80

    70 struct razor_set {

    71 	struct array string_pool;

    72  	struct array packages;

    73  	struct array properties;

    74  	struct array files;

    75 	struct array package_pool;

    76  	struct array property_pool;

    77  	struct array file_pool;

    78 	struct razor_set_header *header;

    79 };

    81 struct import_entry {

    82 	uint32_t package;

    83 	char *name;

    84 };

    86 struct import_directory {

    87 	uint32_t name, count;

    88 	struct array files;

    89 	struct array packages;

    90 	struct import_directory *last;

    91 };

    93 struct razor_importer {

    94 	struct razor_set *set;

    95 	struct hashtable table;

    96 	struct razor_package *package;

    97 	struct array properties;

    98 	struct array files;

    99 };

   101 static void *

   102 zalloc(size_t size)

   103 {

   104 	void *p;

   106 	p = malloc(size);

   107 	memset(p, 0, size);

   109 	return p;

   110 }

   112 struct razor_set_section razor_sections[] = {

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

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

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

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

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

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

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

   120 };

   122 struct razor_set *

   123 razor_set_create(void)

   124 {

   125 	return zalloc(sizeof(struct razor_set));

   126 }

   128 struct razor_set *

   129 razor_set_open(const char *filename)

   130 {

   131 	struct razor_set *set;

   132 	struct razor_set_section *s;

   133 	struct stat stat;

   134 	struct array *array;

   135 	int fd;

   137 	set = zalloc(sizeof *set);

   138 	fd = open(filename, O_RDONLY);

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

   140 		return NULL;

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

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

   143 		free(set);

   144 		return NULL;

   145 	}

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

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

   149 			continue;

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

   151 			continue;

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

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

   154 		array->size = s->size;

   155 		array->alloc = s->size;

   156 	}

   157 	close(fd);

   159 	return set;

   160 }

   162 void

   163 razor_set_destroy(struct razor_set *set)

   164 {

   165 	unsigned int size;

   166 	struct array *a;

   167 	int i;

   169 	if (set->header) {

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

   171 			;

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

   173 		munmap(set->header, size);

   174 	} else {

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

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

   177 			free(a->data);

   178 		}

   179 	}

   181 	free(set);

   182 }

   184 int

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

   186 {

   187 	char data[4096];

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

   189 	struct array *a;

   190 	uint32_t offset;

   191 	int i, fd;

   193 	memset(data, 0, sizeof data);

   194 	header->magic = RAZOR_MAGIC;

   195 	header->version = RAZOR_VERSION;

   196 	offset = sizeof data;

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

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

   200 			continue;

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

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

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

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

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

   206 	}

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

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

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

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

   213 	if (fd < 0)

   214 		return -1;

   216 	razor_write(fd, data, sizeof data);

   217 	memset(data, 0, sizeof data);

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

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

   220 			continue;

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

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

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

   224 	}

   226 	close(fd);

   228 	return 0;

   229 }

   231 void

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

   233 		const char *version, const char *release)

   234 {

   235 	int len;

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

   238 		*evr_buf = '\0';

   239 		return;

   240 	}

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

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

   244 		evr_buf += len;

   245 		size -= len;

   246 	}

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

   248 	evr_buf += len;

   249 	size -= len;

   250 	if (release && *release)

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

   252 }

   254 void

   255 razor_importer_begin_package(struct razor_importer *importer,

   256 			     const char *name, const char *version)

   257 {

   258 	struct razor_package *p;

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

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

   262 	p->flags = 0;

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

   265 	importer->package = p;

   266 	array_init(&importer->properties);

   267 }

   269 void

   270 razor_importer_finish_package(struct razor_importer *importer)

   271 {

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

   273 		       &importer->set->property_pool,

   274 		       &importer->properties,

   275 		       1);

   277 	array_release(&importer->properties);

   278 }

   280 void

   281 razor_importer_add_property(struct razor_importer *importer,

   282 			    const char *name,

   283 			    enum razor_version_relation relation,

   284 			    const char *version,

   285 			    enum razor_property_type type)

   286 {

   287 	struct razor_property *p;

   288 	uint32_t *r;

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

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

   292 	p->flags = 0;

   293 	p->type = type;

   294 	p->relation = relation;

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

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

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

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

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

   301 }

   303 void

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

   305 {

   306 	struct import_entry *e;

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

   310 	e->package = importer->package -

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

   312 	e->name = strdup(name);

   313 }

   315 struct razor_importer *

   316 razor_importer_new(void)

   317 {

   318 	struct razor_importer *importer;

   320 	importer = zalloc(sizeof *importer);

   321 	importer->set = razor_set_create();

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

   324 	return importer;

   325 }

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

   328 void

   329 razor_importer_destroy(struct razor_importer *importer)

   330 {

   331 	/* FIXME: write this */

   332 }

   335 typedef int (*compare_with_data_func_t)(const void *p1,

   336 					const void *p,

   337 					void *data);

   339 struct qsort_context {

   340 	size_t size;

   341 	compare_with_data_func_t compare;

   342 	void *data;

   343 };

   345 static void

   346 qsort_swap(void *p1, void *p2, size_t size)

   347 {

   348 	char buffer[size];

   350 	memcpy(buffer, p1, size);

   351 	memcpy(p1, p2, size);

   352 	memcpy(p2, buffer, size);

   353 }

   355 static void

   356 __qsort_with_data(void *base, size_t nelem, uint32_t *map,

   357 		  struct qsort_context *ctx)

   358 {

   359 	void *p, *start, *end, *pivot;

   360 	uint32_t *mp, *mstart, *mend, tmp;

   361 	int left, right, result;

   362 	size_t size = ctx->size;

   364 	p = base;

   365 	start = base;

   366 	end = base + nelem * size;

   367 	mp = map;

   368 	mstart = map;

   369 	mend = map + nelem;

   370 	pivot = base + (random() % nelem) * size;

   372 	while (p < end) {

   373 		result = ctx->compare(p, pivot, ctx->data);

   374 		if (result < 0) {

   375 			qsort_swap(p, start, size);

   376 			tmp = *mp;

   377 			*mp = *mstart;

   378 			*mstart = tmp;

   379 			if (start == pivot)

   380 				pivot = p;

   381 			start += size;

   382 			mstart++;

   383 			p += size;

   384 			mp++;

   385 		} else if (result == 0) {

   386 			p += size;

   387 			mp++;

   388 		} else {

   389  			end -= size;

   390 			mend--;

   391 			qsort_swap(p, end, size);

   392 			tmp = *mp;

   393 			*mp = *mend;

   394 			*mend = tmp;

   395 			if (end == pivot)

   396 				pivot = p;

   397 		}

   398 	}

   400 	left = (start - base) / size;

   401 	right = (base + nelem * size - end) / size;

   402 	if (left > 1)

   403 		__qsort_with_data(base, left, map, ctx);

   404 	if (right > 1)

   405 		__qsort_with_data(end, right, mend, ctx);

   406 }

   408 static uint32_t *

   409 qsort_with_data(void *base, size_t nelem, size_t size,

   410 		compare_with_data_func_t compare, void *data)

   411 {

   412 	struct qsort_context ctx;

   413 	uint32_t *map;

   414 	int i;

   416 	if (nelem == 0)

   417 		return NULL;

   419 	ctx.size = size;

   420 	ctx.compare = compare;

   421 	ctx.data = data;

   423 	map = malloc(nelem * sizeof (uint32_t));

   424 	for (i = 0; i < nelem; i++)

   425 		map[i] = i;

   427 	__qsort_with_data(base, nelem, map, &ctx);

   429 	return map;

   430 }

   432 static int

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

   434 {

   435 	const char *p1, *p2;

   436 	long n1, n2;

   437 	int res;

   439 	n1 = strtol(s1, (char **) &p1, 0);

   440 	n2 = strtol(s2, (char **) &p2, 0);

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

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

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

   445 	if (res < 0) {

   446 		n1 = 0;

   447 		p1 = s1;

   448 		p2++;

   449 	} else if (res > 0) {

   450 		p1++;

   451 		n2 = 0;

   452 		p2 = s2;

   453 	}

   455 	if (n1 != n2)

   456 		return n1 - n2;

   457 	while (*p1 && *p2) {

   458 		if (*p1 != *p2)

   459 			return *p1 - *p2;

   460 		p1++;

   461 		p2++;

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

   463 			return versioncmp(p1, p2);

   464 	}

   466 	return *p1 - *p2;

   467 }

   469 static int

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

   471 {

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

   473 	struct razor_set *set = data;

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

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

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

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

   479 	else

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

   481 }

   483 static int

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

   485 {

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

   487 	struct razor_set *set = data;

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

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

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

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

   493 		return prop1->type - prop2->type;

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

   495 		return prop1->relation - prop2->relation;

   496 	else

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

   498 }

   500 static uint32_t *

   501 uniqueify_properties(struct razor_set *set)

   502 {

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

   504 	struct array *pkgs, *p;

   505 	struct list_head *r;

   506 	uint32_t *map, *rmap;

   507 	int i, count, unique;

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

   510 	map = qsort_with_data(set->properties.data,

   511 			      count,

   512 			      sizeof(struct razor_property),

   513 			      compare_properties,

   514 			      set);

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

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

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

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

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

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

   522 			up++;

   523 			up->name = rp->name;

   524 			up->flags = 0;

   525 			up->type = rp->type;

   526 			up->relation = rp->relation;

   527 			up->version = rp->version;

   528 		}

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

   531 		rmap[map[i]] = unique;

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

   533 		*r = rp->packages;

   534 	}

   535 	free(map);

   537 	if (up != rp)

   538 		up++;

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

   540 	rp_end = up;

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

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

   543 		array_release(p);

   544 	}

   546 	free(pkgs);

   548 	return rmap;

   549 }

   551 static int

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

   553 {

   554 	const struct import_entry *e1 = p1;

   555 	const struct import_entry *e2 = p2;

   556 	const char *n1 = e1->name;

   557 	const char *n2 = e2->name;

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

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

   561 	 * sort before "foo.conf"

   562 	 *

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

   564 	 */

   565 	while (*n1 && *n2) {

   566 		if (*n1 < *n2)

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

   568 		else if (*n1 > *n2)

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

   570 		n1++;

   571 		n2++;

   572 	}

   573 	if (*n1)

   574 		return 1;

   575 	else if (*n2)

   576 		return -1;

   577 	else

   578 		return 0;

   579 }

   581 static void

   582 count_entries(struct import_directory *d)

   583 {

   584 	struct import_directory *p, *end;

   586 	p = d->files.data;

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

   588 	d->count = 0;

   589 	while (p < end) {

   590 		count_entries(p);

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

   592 		p++;

   593 	}

   594 }

   596 static void

   597 serialize_files(struct razor_set *set,

   598 		struct import_directory *d, struct array *array)

   599 {

   600 	struct import_directory *p, *end;

   601 	struct razor_entry *e = NULL;

   602 	uint32_t s;

   604 	p = d->files.data;

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

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

   607 	while (p < end) {

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

   609 		e->name = p->name;

   610 		e->flags = 0;

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

   612 		s += p->count;

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

   615 		array_release(&p->packages);

   616 		p++;

   617 	}

   618 	if (e != NULL)

   619 		e->flags |= RAZOR_ENTRY_LAST;

   621 	p = d->files.data;

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

   623 	while (p < end) {

   624 		serialize_files(set, p, array);

   625 		p++;

   626 	}

   627 }

   629 static void

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

   631 {

   632 	struct razor_property *p, *end;

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

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

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

   637 }

   639 static void

   640 build_file_tree(struct razor_importer *importer)

   641 {

   642 	int count, i, length;

   643 	struct import_entry *filenames;

   644 	char *f, *end;

   645 	uint32_t name, *r;

   646 	char dirname[256];

   647 	struct import_directory *d, root;

   648 	struct razor_entry *e;

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

   651 	qsort_with_data(importer->files.data,

   652 			count,

   653 			sizeof (struct import_entry),

   654 			compare_filenames,

   655 			NULL);

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

   658 	array_init(&root.files);

   659 	array_init(&root.packages);

   660 	root.last = NULL;

   662 	filenames = importer->files.data;

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

   664 		f = filenames[i].name;

   665 		if (*f != '/')

   666 			continue;

   667 		f++;

   669 		d = &root;

   670 		while (*f) {

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

   672 			if (end == NULL)

   673 				end = f + strlen(f);

   674 			length = end - f;

   675 			memcpy(dirname, f, length);

   676 			dirname[length] ='\0';

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

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

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

   680 				d->last->name = name;

   681 				d->last->last = NULL;

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

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

   684 			}

   685 			d = d->last;

   686 			f = end + 1;

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

   688 				break;

   689 		}

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

   692 		*r = filenames[i].package;

   693 		free(filenames[i].name);

   694 	}

   696 	count_entries(&root);

   697 	array_init(&importer->set->files);

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

   700 	e->name = root.name;

   701 	e->flags = RAZOR_ENTRY_LAST;

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

   703 	list_set_empty(&e->packages);

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

   707 	array_release(&importer->files);

   708 }

   710 static void

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

   712 {

   713 	struct razor_package *p, *packages;

   714 	struct array *pkgs;

   715 	struct razor_entry *e, *end;

   716 	struct list *r;

   717 	uint32_t *q;

   718 	int i, count;

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

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

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

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

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

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

   727 		while (r) {

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

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

   730 			r = list_next(r);

   731 		}

   732 	}

   734 	packages = set->packages.data;

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

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

   737 		array_release(&pkgs[i]);

   738 	}

   739 	free(pkgs);

   740 }

   742 struct razor_set *

   743 razor_importer_finish(struct razor_importer *importer)

   744 {

   745 	struct razor_set *set;

   746 	uint32_t *map, *rmap;

   747 	int i, count;

   749 	map = uniqueify_properties(importer->set);

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

   751 	free(map);

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

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

   755 			      count,

   756 			      sizeof(struct razor_package),

   757 			      compare_packages,

   758 			      importer->set);

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

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

   762 		rmap[map[i]] = i;

   763 	free(map);

   765 	build_file_tree(importer);

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

   767 	build_package_file_lists(importer->set, rmap);

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

   769 	free(rmap);

   771 	set = importer->set;

   772 	hashtable_release(&importer->table);

   773 	free(importer);

   775 	return set;

   776 }

   778 struct razor_package_iterator {

   779 	struct razor_set *set;

   780 	struct razor_package *package, *end;

   781 	struct list *index;

   782 };

   784 static struct razor_package_iterator *

   785 razor_package_iterator_create_with_index(struct razor_set *set,

   786 					 struct list *index)

   787 {

   788 	struct razor_package_iterator *pi;

   790 	pi = zalloc(sizeof *pi);

   791 	pi->set = set;

   792 	pi->index = index;

   794 	return pi;

   795 }

   797 struct razor_package_iterator *

   798 razor_package_iterator_create(struct razor_set *set)

   799 {

   800 	struct razor_package_iterator *pi;

   802 	pi = zalloc(sizeof *pi);

   803 	pi->set = set;

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

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

   807 	return pi;

   808 }

   810 struct razor_package_iterator *

   811 razor_package_iterator_create_for_property(struct razor_set *set,

   812 					   struct razor_property *property)

   813 {

   814 	struct list *index;

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

   817 	return razor_package_iterator_create_with_index(set, index);

   818 }

   820 int

   821 razor_package_iterator_next(struct razor_package_iterator *pi,

   822 			    struct razor_package **package,

   823 			    const char **name, const char **version)

   824 {

   825 	char *pool;

   826 	int valid;

   827 	struct razor_package *p, *packages;

   829 	if (pi->package) {

   830 		p = pi->package++;

   831 		valid = p < pi->end;

   832 	} else if (pi->index) {

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

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

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

   836 		valid = 1;

   837 	} else

   838 		valid = 0;

   840 	if (valid) {

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

   842 		*package = p;

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

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

   845 	} else {

   846 		*package = NULL;

   847 	}

   849 	return valid;

   850 }

   852 void

   853 razor_package_iterator_destroy(struct razor_package_iterator *pi)

   854 {

   855 	free(pi);

   856 }

   858 struct razor_package *

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

   860 {

   861 	struct razor_package_iterator *pi;

   862 	struct razor_package *p;

   863 	const char *name, *version;

   865 	pi = razor_package_iterator_create(set);

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

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

   868 			break;

   869 	}

   870 	razor_package_iterator_destroy(pi);

   872 	return p;

   873 }

   875 struct razor_property_iterator {

   876 	struct razor_set *set;

   877 	struct razor_property *property, *end;

   878 	struct list *index;

   879 };

   881 struct razor_property_iterator *

   882 razor_property_iterator_create(struct razor_set *set,

   883 			       struct razor_package *package)

   884 {

   885 	struct razor_property_iterator *pi;

   887 	pi = zalloc(sizeof *pi);

   888 	pi->set = set;

   890 	if (package) {

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

   892 				       &set->property_pool);

   893 	} else {

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

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

   896 	}

   898 	return pi;

   899 }

   901 int

   902 razor_property_iterator_next(struct razor_property_iterator *pi,

   903 			     struct razor_property **property,

   904 			     const char **name,

   905 			     enum razor_version_relation *relation,

   906 			     const char **version,

   907 			     enum razor_property_type *type)

   908 {

   909 	char *pool;

   910 	int valid;

   911 	struct razor_property *p, *properties;

   913 	if (pi->property) {

   914 		p = pi->property++;

   915 		valid = p < pi->end;

   916 	} else if (pi->index) {

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

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

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

   920 		valid = 1;

   921 	} else

   922 		valid = 0;

   924 	if (valid) {

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

   926 		*property = p;

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

   928 		*relation = p->relation;

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

   930 		*type = p->type;

   931 	} else {

   932 		*property = NULL;

   933 	}

   935 	return valid;

   936 }

   938 void

   939 razor_property_iterator_destroy(struct razor_property_iterator *pi)

   940 {

   941 	free(pi);

   942 }

   944 static struct razor_entry *

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

   946 {

   947 	struct razor_entry *e;

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

   949 	int len;

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

   952 	do {

   953 		n = pool + e->name;

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

   955 			return e;

   956 		len = strlen(n);

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

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

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

   960 		}

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

   963 	return NULL;

   964 }

   966 static void

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

   968 	 char *prefix, const char *pattern)

   969 {

   970 	struct razor_entry *e;

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

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

   974 	do {

   975 		n = pool + e->name;

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

   977 			continue;

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

   979 		if (e->start) {

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

   981 			*sub = '/';

   982 			strcpy (sub + 1, n);

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

   984 			*sub = '\0';

   985 		}

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

   987 }

   989 void

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

   991 {

   992 	struct razor_entry *e;

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

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

   996 		buffer[0] = '\0';

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

   998 		return;

   999 	}

  1001 	strcpy(buffer, pattern);

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

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

  1004 		base = NULL;

  1005 	} else {

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

  1007 		if (p) {

  1008 			*p = '\0';

  1009 			base = p + 1;

  1010 		} else {

  1011 			base = NULL;

  1012 		}

  1013 	}

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

  1015 	if (e->start != 0)

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

  1017 }

  1019 struct razor_package_iterator *

  1020 razor_package_iterator_create_for_file(struct razor_set *set,

  1021 				       const char *filename)

  1022 {

  1023 	struct razor_entry *entry;

  1024 	struct list *index;

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

  1027 	if (entry == NULL)

  1028 		return NULL;

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

  1031 	return razor_package_iterator_create_with_index(set, index);

  1032 }

  1034 static struct list *

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

  1036 		   struct razor_entry *dir, uint32_t end,

  1037 		   char *prefix)

  1038 {

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

  1040 	uint32_t next, file;

  1041 	char *pool;

  1042 	int len;

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

  1045 	pool = set->string_pool.data;

  1047 	e = entries + dir->start;

  1048 	do {

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

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

  1051 			r = list_next(r);

  1052 			if (!r)

  1053 				return NULL;

  1054 			if (r->data >= end)

  1055 				return r;

  1056 		}

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

  1059 	e = entries + dir->start;

  1060 	do {

  1061 		if (e->start == 0)

  1062 			continue;

  1064 		if (e->flags & RAZOR_ENTRY_LAST)

  1065 			next = end;

  1066 		else {

  1067 			f = e + 1;

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

  1069 				f++;

  1070 			if (f->start == 0)

  1071 				next = end;

  1072 			else

  1073 				next = f->start;

  1074 		}

  1076 		file = r->data;

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

  1078 			len = strlen(prefix);

  1079 			prefix[len] = '/';

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

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

  1082 			prefix[len] = '\0';

  1083 		}

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

  1086 	return r;

  1087 }

  1089 void

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

  1091 {

  1092 	struct razor_package *package;

  1093 	struct list *r;

  1094 	uint32_t end;

  1095 	char buffer[512];

  1097 	package = razor_set_get_package(set, name);

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

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

  1101 	buffer[0] = '\0';

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

  1103 }

  1105 static void

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

  1107 {

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

  1109 	uint32_t *u;

  1110 	char *pool;

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

  1113 	pool = set->string_pool.data;

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

  1116 		if (r->type != RAZOR_PROPERTY_REQUIRES)

  1117 			continue;

  1119 		p = r;

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

  1121 		       p->type == r->type)

  1122 			p++;

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

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

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

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

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

  1129 		 * does.*/

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

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

  1132 			p++;

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

  1135 		 * etc) to properly determine if a requires is

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

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

  1139 		if (p == end ||

  1140 		    p->type != RAZOR_PROPERTY_PROVIDES ||

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

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

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

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

  1145 				continue;

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

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

  1148 		}

  1149 	}

  1150 }

  1152 void

  1153 razor_set_list_unsatisfied(struct razor_set *set)

  1154 {

  1155 	struct array unsatisfied;

  1156 	struct razor_property *properties, *r;

  1157 	uint32_t *u, *end;

  1158 	char *pool;

  1160 	array_init(&unsatisfied);

  1161 	razor_set_validate(set, &unsatisfied);

  1163 	end = unsatisfied.data + unsatisfied.size;

  1164 	properties = set->properties.data;

  1165 	pool = set->string_pool.data;

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

  1168 		r = properties + *u;

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

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

  1171 			       &pool[r->name]);

  1172 		else

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

  1174 			       &pool[r->name],

  1175 			       &pool[r->version]);

  1176 	}

  1178 	array_release(&unsatisfied);

  1179 }

  1181 #define UPSTREAM_SOURCE 0x80

  1183 struct source {

  1184 	struct razor_set *set;

  1185 	uint32_t *property_map;

  1186 	uint32_t *file_map;

  1187 };

  1189 struct razor_merger {

  1190 	struct razor_set *set;

  1191 	struct hashtable table;

  1192 	struct source source1;

  1193 	struct source source2;

  1194 };

  1196 static struct razor_merger *

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

  1198 {

  1199 	struct razor_merger *merger;

  1200 	int count;

  1201 	size_t size;

  1203 	merger = zalloc(sizeof *merger);

  1204 	merger->set = razor_set_create();

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

  1207 	merger->source1.set = set1;

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

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

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

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

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

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

  1215 	merger->source2.set = set2;

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

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

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

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

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

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

  1223 	return merger;

  1224 }

  1226 static void

  1227 add_package(struct razor_merger *merger,

  1228 	    struct razor_package *package, struct source *source,

  1229 	    uint32_t flags)

  1230 {

  1231 	char *pool;

  1232 	struct list *r;

  1233 	struct razor_package *p;

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

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

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

  1238 	p->flags = flags;

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

  1240 					&pool[package->version]);

  1242 	p->properties = package->properties;

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

  1244 	while (r) {

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

  1246 		r = list_next(r);

  1247 	}

  1249 	p->files = package->files;

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

  1251 	while (r) {

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

  1253 		r = list_next(r);

  1254 	}

  1255 }

  1257 static uint32_t

  1258 add_property(struct razor_merger *merger,

  1259 	     const char *name, enum razor_version_relation relation,

  1260 	     const char *version, int type)

  1261 {

  1262 	struct razor_property *p;

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

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

  1266 	p->flags = 0;

  1267 	p->type = type;

  1268 	p->relation = relation;

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

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

  1272 }

  1274 static void

  1275 merge_properties(struct razor_merger *merger)

  1276 {

  1277 	struct razor_property *p1, *p2;

  1278 	struct razor_set *set1, *set2;

  1279 	uint32_t *map1, *map2;

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

  1281 	char *pool1, *pool2;

  1283 	set1 = merger->source1.set;

  1284 	set2 = merger->source2.set;

  1285 	map1 = merger->source1.property_map;

  1286 	map2 = merger->source2.property_map;

  1288 	i = 0;

  1289 	j = 0;

  1290 	pool1 = set1->string_pool.data;

  1291 	pool2 = set2->string_pool.data;

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

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

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

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

  1297 			i++;

  1298 			continue;

  1299 		}

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

  1301 			j++;

  1302 			continue;

  1303 		}

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

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

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

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

  1308 		else if (i < count1)

  1309 			cmp = -1;

  1310 		else

  1311 			cmp = 1;

  1312 		if (cmp == 0)

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

  1314 		if (cmp == 0)

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

  1316 		if (cmp == 0)

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

  1318 					 &pool2[p2->version]);

  1319 		if (cmp < 0) {

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

  1321 						 &pool1[p1->name],

  1322 						 p1->relation,

  1323 						 &pool1[p1->version],

  1324 						 p1->type);

  1325 		} else if (cmp > 0) {

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

  1327 						 &pool2[p2->name],

  1328 						 p2->relation,

  1329 						 &pool2[p2->version],

  1330 						 p2->type);

  1331 		} else  {

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

  1333 							     &pool1[p1->name],

  1334 							     p1->relation,

  1335 							     &pool1[p1->version],

  1336 							     p1->type);

  1337 		}

  1338 	}

  1339 }

  1341 static void

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

  1343 		uint32_t *map, struct array *pool)

  1344 {

  1345 	uint32_t r;

  1346 	struct list *p, *q;

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

  1349 	p = list_first(properties, source_pool);

  1350 	while (p) {

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

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

  1353 		q->flags = p->flags;

  1354 		p = list_next(p);

  1355 	}

  1357 	list_set_ptr(properties, r);

  1358 }

  1360 static uint32_t

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

  1362 {

  1363 	struct razor_entry *e;

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

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

  1367 	e->flags = 0;

  1368 	e->start = 0;

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

  1371 }

  1373 /* FIXME. Blah */

  1374 static int

  1375 fix_file_map(uint32_t *map,

  1376 	     struct razor_entry *files,

  1377 	     struct razor_entry *top)

  1378 {

  1379 	uint32_t e;

  1380 	int found_file = 0;

  1382 	e = top->start;

  1383 	do {

  1384 		if (files[e].start)

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

  1386 		if (map[e])

  1387 			found_file = 1;

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

  1390 	if (found_file)

  1391 		map[top - files] = 1;

  1392 	return found_file;

  1393 }

  1395 struct merge_directory {

  1396 	uint32_t merged, dir1, dir2;

  1397 };

  1399 static void

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

  1401 {

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

  1403 	struct razor_set *set1, *set2;

  1404 	struct array merge_stack;

  1405 	struct merge_directory *child_md, *end_md;

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

  1407 	int cmp;

  1408 	char *pool1, *pool2;

  1410 	set1 = merger->source1.set;

  1411 	set2 = merger->source2.set;

  1412 	map1 = merger->source1.file_map;

  1413 	map2 = merger->source2.file_map;

  1414 	pool1 = set1->string_pool.data;

  1415 	pool2 = set2->string_pool.data;

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

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

  1419 	array_init(&merge_stack);

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

  1422 	last = 0;

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

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

  1425 	while (e1 || e2) {

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

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

  1428 				e1 = NULL;

  1429 			continue;

  1430 		}

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

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

  1433 				e2 = NULL;

  1434 			continue;

  1435 		}

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

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

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

  1439 				e1 = NULL;

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

  1441 				e2 = NULL;

  1442 			continue;

  1443 		}

  1445 		if (!e1)

  1446 			cmp = 1;

  1447 		else if (!e2)

  1448 			cmp = -1;

  1449 		else {

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

  1451 				      &pool2[e2->name]);

  1452 		}

  1454 		if (cmp < 0) {

  1455 			if (map1[e1 - root1]) {

  1456 				map1[e1 - root1] = last =

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

  1458 				if (e1->start) {

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

  1460 					child_md->merged = last;

  1461 					child_md->dir1 = e1->start;

  1462 					child_md->dir2 = 0;

  1463 				}

  1464 			}

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

  1466 				e1 = NULL;

  1467 		} else if (cmp > 0) {

  1468 			if (map2[e2 - root2]) {

  1469 				map2[e2 - root2] = last =

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

  1471 				if (e2->start) {

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

  1473 					child_md->merged = last;

  1474 					child_md->dir1 = 0;

  1475 					child_md->dir2 = e2->start;

  1476 				}

  1477 			}

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

  1479 				e2 = NULL;

  1480 		} else {

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

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

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

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

  1485 				child_md->merged = last;

  1486 				child_md->dir1 = e1->start;

  1487 				child_md->dir2 = e2->start;

  1488 			}

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

  1490 				e1 = NULL;

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

  1492 				e2 = NULL;

  1493 		}

  1494 	}

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

  1497 	if (last) {

  1498 		mroot[last].flags = RAZOR_ENTRY_LAST;

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

  1500 	} else

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

  1503 	end_md = merge_stack.data + merge_stack.size;

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

  1505 		merge_one_directory(merger, child_md);

  1506 	array_release(&merge_stack);

  1507 }

  1509 static void

  1510 merge_files(struct razor_merger *merger)

  1511 {

  1512 	struct razor_entry *root;

  1513 	struct merge_directory md;

  1514 	uint32_t *map1, *map2;

  1516 	map1 = merger->source1.file_map;

  1517 	map2 = merger->source2.file_map;

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

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

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

  1523 		if (root->start)

  1524 			fix_file_map(map1, root, root);

  1525 		md.dir1 = root->start;

  1526 	} else

  1527 		md.dir1 = 0;

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

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

  1531 		if (root->start)

  1532 			fix_file_map(map2, root, root);

  1533 		md.dir2 = root->start;

  1534 	} else

  1535 		md.dir2 = 0;

  1537 	merge_one_directory(merger, &md);

  1538 }

  1540 static void

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

  1542 	   uint32_t *map, struct array *pool)

  1543 {

  1544 	uint32_t r;

  1545 	struct list *p, *q;

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

  1548 	p = list_first(files, source_pool);

  1549 	while (p) {

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

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

  1552 		q->flags = p->flags;

  1553 		p = list_next(p);

  1554 	}

  1556 	list_set_ptr(files, r);

  1557 }

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

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

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

  1562  * the arrays for their properties. */

  1563 static void

  1564 rebuild_property_package_lists(struct razor_set *set)

  1565 {

  1566 	struct array *pkgs, *a;

  1567 	struct razor_package *pkg, *pkg_end;

  1568 	struct razor_property *prop, *prop_end;

  1569 	struct list *r;

  1570 	uint32_t *q;

  1571 	int count;

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

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

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

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

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

  1579 		while (r) {

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

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

  1582 			r = list_next(r);

  1583 		}

  1584 	}

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

  1587 	a = pkgs;

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

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

  1590 		array_release(a);

  1591 	}

  1592 	free(pkgs);

  1593 }

  1595 static void

  1596 rebuild_file_package_lists(struct razor_set *set)

  1597 {

  1598 	struct array *pkgs, *a;

  1599 	struct razor_package *pkg, *pkg_end;

  1600 	struct razor_entry *entry, *entry_end;

  1601 	struct list *r;

  1602 	uint32_t *q;

  1603 	int count;

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

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

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

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

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

  1611 		while (r) {

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

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

  1614 			r = list_next(r);

  1615 		}

  1616 	}

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

  1619 	a = pkgs;

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

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

  1622 		array_release(a);

  1623 	}

  1624 	free(pkgs);

  1625 }

  1627 static struct razor_set *

  1628 razor_merger_finish(struct razor_merger *merger)

  1629 {

  1630 	struct razor_set *result;

  1631 	struct razor_package *p, *pend;

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

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

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

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

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

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

  1639 	 * property list for both sets. */

  1641 	merge_properties(merger);

  1642 	merge_files(merger);

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

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

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

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

  1649 		struct source *src;

  1651 		if (p->flags & UPSTREAM_SOURCE)

  1652 			src = &merger->source2;

  1653 		else

  1654 			src = &merger->source1;

  1656 		emit_properties(&p->properties,

  1657 				&src->set->property_pool,

  1658 				src->property_map,

  1659 				&merger->set->property_pool);

  1660 		emit_files(&p->files,

  1661 			   &src->set->file_pool,

  1662 			   src->file_map,

  1663 			   &merger->set->file_pool);

  1664 		p->flags &= ~UPSTREAM_SOURCE;

  1665 	}

  1667 	rebuild_property_package_lists(merger->set);

  1668 	rebuild_file_package_lists(merger->set);

  1670 	result = merger->set;

  1671 	hashtable_release(&merger->table);

  1672 	free(merger);

  1674 	return result;

  1675 }

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

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

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

  1680  **/

  1682 void

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

  1684 	       razor_package_callback_t callback, void *data)

  1685 {

  1686 	struct razor_package_iterator *pi1, *pi2;

  1687 	struct razor_package *p1, *p2;

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

  1689 	int res;

  1691 	pi1 = razor_package_iterator_create(set);

  1692 	pi2 = razor_package_iterator_create(upstream);

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

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

  1697 	while (p1 || p2) {

  1698 		if (p1 && p2) {

  1699 			res = strcmp(name1, name2);

  1700 			if (res == 0)

  1701 				res = versioncmp(version1, version2);

  1702 		} else {

  1703 			res = 0;

  1704 		}

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

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

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

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

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

  1712 			razor_package_iterator_next(pi1, &p1,

  1713 						    &name1, &version1);

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

  1715 			razor_package_iterator_next(pi2, &p2,

  1716 						    &name2, &version2);

  1717 	}

  1719 	razor_package_iterator_destroy(pi1);

  1720 	razor_package_iterator_destroy(pi2);

  1721 }

  1724 struct razor_transaction_resolver {

  1725 	struct razor_set *system, *upstream;

  1726 	struct bitarray syspkgs, uppkgs;

  1727 	struct array packages;

  1728 	int errors;

  1729 };

  1731 static int

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

  1733 {

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

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

  1736 }

  1738 static int

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

  1740 {

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

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

  1743 }

  1745 static int

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

  1747 {

  1748 	const struct razor_transaction_package *tp1 = one;

  1749 	const struct razor_transaction_package *tp2 = two;

  1751 	return strcmp(tp1->name, tp2->name);

  1752 }

  1754 static void

  1755 find_packages(struct razor_transaction_resolver *trans,

  1756 	      int update_count, const char **update_packages,

  1757 	      int remove_count, const char **remove_packages)

  1758 {

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

  1760 	struct razor_transaction_package *packages, *tp;

  1761 	const char *spool, *upool;

  1762 	int i;

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

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

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

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

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

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

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

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

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

  1774 		tp->name = update_packages[i];

  1775 		tp->state = RAZOR_PACKAGE_INSTALL;

  1776 	}

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

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

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

  1780 		tp->name = remove_packages[i];

  1781 		tp->state = RAZOR_PACKAGE_REMOVE;

  1782 	}

  1783 	qsort(trans->packages.data, update_count + remove_count,

  1784 	      sizeof *tp, compare_transaction_packages);

  1785 	packages = trans->packages.data;

  1787 	sp = spkgs;

  1788 	up = upkgs;

  1789 	for (i = 0; i < update_count + remove_count; i++) {

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

  1791 			sp++;

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

  1793 			up++;

  1795 		if (packages[i].state == RAZOR_PACKAGE_REMOVE) {

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

  1797 				packages[i].package = sp;

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

  1799 				packages[i].version = &spool[sp->version];

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

  1801 			} else {

  1802 				packages[i].name = strdup(packages[i].name);

  1803 				packages[i].state = RAZOR_PACKAGE_REMOVE_NOT_INSTALLED;

  1804 				trans->errors++;

  1805 			}

  1806 		} else {

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

  1808 				packages[i].package = up;

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

  1810 				packages[i].version = &upool[up->version];

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

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

  1813 						packages[i].state = RAZOR_PACKAGE_UP_TO_DATE;

  1814 						trans->errors++;

  1815 						continue;

  1816 					}

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

  1818 				}

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

  1820 			} else {

  1821 				packages[i].name = strdup(packages[i].name);

  1822 				packages[i].state = RAZOR_PACKAGE_INSTALL_UNAVAILABLE;

  1823 				trans->errors++;

  1824 			}

  1825 		}

  1826 	}

  1827 }

  1829 static void

  1830 find_all_packages(struct razor_transaction_resolver *trans)

  1831 {

  1832 	struct razor_transaction_package *tp;

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

  1834 	const char *spool, *upool;

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

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

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

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

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

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

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

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

  1845 			up++;

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

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

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

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

  1850 			tp->version = &upool[up->version];

  1851 			tp->state = RAZOR_PACKAGE_INSTALL;

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

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

  1854 		}

  1855 	}

  1856 }

  1858 static int

  1859 provider_satisfies_requirement(struct razor_property *provider,

  1860 			       const char *provider_strings,

  1861 			       struct razor_property *requirement,

  1862 			       const char *requirement_strings)

  1863 {

  1864 	int cmp, len;

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

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

  1868 	if (!*required)

  1869 		return 1;

  1871 	cmp = versioncmp(provided, required);

  1873 	switch (requirement->relation) {

  1874 	case RAZOR_VERSION_LESS:

  1875 		return cmp < 0;

  1877 	case RAZOR_VERSION_LESS_OR_EQUAL:

  1878 		if (cmp <= 0)

  1879 			return 1;

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

  1882 	case RAZOR_VERSION_EQUAL:

  1883 		if (cmp == 0)

  1884 			return 1;

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

  1887 		len = strlen(required);

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

  1889 			return 1;

  1890 		return 0;

  1892 	case RAZOR_VERSION_GREATER_OR_EQUAL:

  1893 		return cmp >= 0;

  1895 	case RAZOR_VERSION_GREATER:

  1896 		return cmp > 0;

  1897 	}

  1899 	/* shouldn't happen */

  1900 	return 0;

  1901 }

  1903 static struct razor_package *

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

  1905 		      const char *filename, int installed)

  1906 {

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

  1908 	struct razor_entry *entry;

  1909 	struct list *p;

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

  1912 		return 0;

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

  1915 	if (!entry)

  1916 		return 0;

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

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

  1920 			return &pkgs[p->data];

  1921 	}

  1922 	return NULL;

  1923 }

  1925 static struct razor_package *

  1926 find_installed_package_for_file(struct razor_transaction_resolver *trans,

  1927 				const char *filename)

  1928 {

  1929 	struct razor_package *pkg;

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

  1932 				    filename, 1);

  1933 	if (!pkg)

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

  1935 					    filename, 1);

  1936 	return pkg;

  1937 }

  1939 static struct razor_package *

  1940 find_uninstalled_package_for_file(struct razor_transaction_resolver *trans,

  1941 				  const char *filename)

  1942 {

  1943 	struct razor_package *pkg;

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

  1946 				    filename, 0);

  1947 	if (!pkg)

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

  1949 					    filename, 0);

  1950 	return pkg;

  1951 }

  1953 static struct razor_package *

  1954 find_package_matching(struct razor_transaction_resolver *trans, int installed,

  1955 		      struct razor_property **start_prop,

  1956 		      struct razor_property *req,

  1957 		      struct razor_set *req_set)

  1958 {

  1959 	struct razor_set *set;

  1960 	struct bitarray *pkgbits;

  1961 	struct razor_package *pkgs;

  1962 	struct razor_property *prop, *props, *prop_end;

  1963 	enum razor_property_type match_type;

  1964 	const char *pool;

  1965 	const char *rpool = req_set->string_pool.data;

  1966 	int match_name = (req->type == RAZOR_PROPERTY_OBSOLETES ||

  1967 			  req->type == RAZOR_PROPERTY_CONFLICTS);

  1968 	int match;

  1970 	prop = *start_prop;

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

  1972 		set = trans->system;

  1973 		pkgbits = &trans->syspkgs;

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

  1975 		set = trans->upstream;

  1976 		pkgbits = &trans->uppkgs;

  1977 	} else

  1978 		return NULL;

  1980 	if (req->type == RAZOR_PROPERTY_PROVIDES)

  1981 		match_type = RAZOR_PROPERTY_CONFLICTS;

  1982 	else

  1983 		match_type = RAZOR_PROPERTY_PROVIDES;

  1985 	pkgs = set->packages.data;

  1986 	props = set->properties.data;

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

  1988 	pool = set->string_pool.data;

  1990 	/* Find first matching property */

  1991 	while (prop < prop_end &&

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

  1993 		prop++;

  1994 	*start_prop = prop;

  1995 	if (prop == prop_end ||

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

  1997 		return NULL;

  1999 	if (prop->type < match_type) {

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

  2001 			prop++;

  2002 	} else {

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

  2004 			prop--;

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

  2006 			prop--;

  2007 	}

  2009 	/* Scan matching proeprties */

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

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

  2012 		if (match_type == RAZOR_PROPERTY_PROVIDES)

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

  2014 		else

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

  2016 		if (match) {

  2017 			struct list *pkg;

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

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

  2021 					continue;

  2022 				if (!match_name ||

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

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

  2025 					return &pkgs[pkg->data];

  2026 			}

  2027 		}

  2028 		prop++;

  2029 	}

  2031 	return NULL;

  2032 }

  2034 static struct razor_package *

  2035 find_installed_package_for_property(struct razor_transaction_resolver *trans,

  2036 				    struct razor_property **sys_sp,

  2037 				    struct razor_property *req)

  2038 {

  2039 	struct razor_package *pkg;

  2041 	pkg = find_package_matching(trans, 1, sys_sp, req, trans->upstream);

  2042 	if (!pkg)

  2043 		pkg = find_package_matching(trans, 1, &req, req, trans->upstream);

  2044 	return pkg;

  2045 }

  2047 static struct razor_package *

  2048 find_uninstalled_package_for_property(struct razor_transaction_resolver *trans,

  2049 				      struct razor_property **sys_sp,

  2050 				      struct razor_property *req)

  2051 {

  2052 	struct razor_package *pkg;

  2054 	pkg = find_package_matching(trans, 0, sys_sp, req, trans->upstream);

  2055 	if (!pkg)

  2056 		pkg = find_package_matching(trans, 0, &req, req, trans->upstream);

  2057 	return pkg;

  2058 }

  2060 static struct razor_package *

  2061 find_upgrade(struct razor_transaction_resolver *trans,

  2062 	     struct razor_property *sp, struct razor_property *up)

  2063 {

  2064 	struct razor_property *conflict, req;

  2065 	struct razor_set *set;

  2066 	const char *pool;

  2068 	if (sp->type == RAZOR_PROPERTY_CONFLICTS) {

  2069 		conflict = sp;

  2070 		set = trans->system;

  2071 	} else {

  2072 		conflict = up;

  2073 		set = trans->upstream;

  2074 	}

  2075 	pool = set->string_pool.data;

  2077 	if (conflict->relation > RAZOR_VERSION_EQUAL ||

  2078 	    !pool[conflict->version])

  2079 		return NULL;

  2081 	memcpy(&req, conflict, sizeof req);

  2082 	req.type = RAZOR_PROPERTY_REQUIRES;

  2083 	if (conflict->relation == RAZOR_VERSION_LESS)

  2084 		req.relation = RAZOR_VERSION_GREATER_OR_EQUAL;

  2085 	else

  2086 		req.relation = RAZOR_VERSION_GREATER;

  2088 	return find_package_matching(trans, 0, &up, &req, set);

  2089 }

  2091 /* FIXME */

  2092 static struct razor_package *

  2093 find_upgrade_for_installed_conflict(struct razor_transaction_resolver *trans,

  2094 				    struct razor_package *conflicting_pkg,

  2095 				    struct razor_property *provider)

  2096 {

  2097 	struct razor_package *upkgs, *up, *uend;

  2098 	struct razor_property *uprops;

  2099 	const char *spool, *upool;

  2100 	struct list *prop;

  2102 	if (!package_in_set(conflicting_pkg, trans->system))

  2103 		return NULL;

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

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

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

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

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

  2111 	while (up < uend &&

  2112 	       strcmp(&upool[up->name], &spool[conflicting_pkg->name]) < 0)

  2113 		up++;

  2114 	if (up == uend || strcmp(&upool[up->name], &spool[conflicting_pkg->name]) != 0)

  2115 		return NULL;

  2117 	for (prop = list_first(&up->properties, &trans->system->property_pool); prop; prop = list_next(prop)) {

  2118 		if (uprops[prop->data].type == RAZOR_PROPERTY_CONFLICTS &&

  2119 		    provider_satisfies_requirement(provider, upool, &uprops[prop->data], upool))

  2120 			return NULL;

  2121 	}

  2122 	return up;

  2123 }

  2125 /* FIXME */

  2126 static int

  2127 prop_is_being_installed(struct razor_transaction_resolver *trans,

  2128 			struct razor_property *prop)

  2129 {

  2130 	struct list *pkg;

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

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

  2134 			return 1;

  2135 	}

  2136 	return 0;

  2137 }

  2139 static void

  2140 add_transaction_package(struct razor_transaction_resolver *trans,

  2141 			struct razor_package *package,

  2142 			enum razor_transaction_package_state state,

  2143 			const char *req_package,

  2144 			struct razor_property *req_prop)

  2145 {

  2146 	struct razor_set *package_set, *req_set;

  2147 	struct bitarray *reqpkgbits;

  2148 	struct razor_transaction_package *tp, *packages;

  2149 	const char *pool;

  2150 	struct razor_package *pkgs;

  2151 	struct list *pkg;

  2153 	package_set = package_in_set(package, trans->system) ? trans->system : trans->upstream;

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

  2155 		req_set = trans->system;

  2156 		reqpkgbits = &trans->syspkgs;

  2157 	} else {

  2158 		req_set = trans->upstream;

  2159 		reqpkgbits = &trans->uppkgs;

  2160 	}

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

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

  2165 	if (package) {

  2166 		int i, count;

  2168 		/* Make sure we aren't already acting on this package */

  2169 		packages = trans->packages.data;

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

  2171 		pool = package_set->string_pool.data;

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

  2173 			if (packages[i].name &&

  2174 			    !strcmp(packages[i].name, &pool[package->name])) {

  2175 				if (state == packages[i].state) {

  2176 					/* Already taken care of */

  2177 					return;

  2178 				}

  2179 				/* Oops. We lose */

  2180 				if (state != RAZOR_PACKAGE_CONTRADICTION) {

  2181 					add_transaction_package(trans, package,

  2182 								RAZOR_PACKAGE_CONTRADICTION,

  2183 								NULL, NULL);

  2184 				}

  2185 				break;

  2186 			}

  2187 		}

  2189 		tp->package = package;

  2190 		tp->name = &pool[package->name];

  2191 		tp->version = &pool[package->version];

  2192 		tp->state = state;

  2194 		pkgs = package_set->packages.data;

  2195 		if (tp->state == RAZOR_PACKAGE_INSTALL)

  2196 			bitarray_set(&trans->uppkgs, package - pkgs, 1);

  2197 		else if (tp->state == RAZOR_PACKAGE_REMOVE)

  2198 			bitarray_set(&trans->syspkgs, package - pkgs, 0);

  2199 		else

  2200 			trans->errors++;

  2201 	} else {

  2202 		tp->state = RAZOR_PACKAGE_UNSATISFIABLE;

  2203 		trans->errors++;

  2204 	}

  2206 	if (req_package)

  2207 		tp->dep_package = req_package;

  2208 	if (!req_prop)

  2209 		return;

  2211 	pool = req_set->string_pool.data;

  2212 	pkgs = req_set->packages.data;

  2213 	if (!req_package) {

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

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

  2216 				break;

  2217 		}

  2218 		if (pkg)

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

  2220 	}

  2222 	tp->dep_type = req_prop->type;

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

  2224 	tp->dep_relation = req_prop->relation;

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

  2226 }

  2228 /* FIXME: make this more efficient */

  2229 static void

  2230 maybe_mark_upgraded(struct razor_transaction_resolver *trans,

  2231 		    struct razor_package *pkg)

  2232 {

  2233 	struct razor_package *spkgs, *sp, *send;

  2234 	const char *spool, *upool;

  2236 	sp = spkgs = trans->system->packages.data;

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

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

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

  2241 	while (sp < send &&

  2242 	       strcmp(&spool[sp->name], &upool[pkg->name]) < 0)

  2243 		sp++;

  2244 	if (sp < send && strcmp(&spool[sp->name], &upool[pkg->name]) == 0)

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

  2246 }

  2248 static void

  2249 razor_transaction_satisfy_installs(struct razor_transaction_resolver *trans)

  2250 {

  2251 	struct razor_package *spkgs, *upkgs, *pkg, *upgrade;

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

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

  2254 	const char *spool, *upool;

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

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

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

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

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

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

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

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

  2265 	sp = sprops;

  2266 	up = uprops;

  2267 	while (up < uprop_end) {

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

  2269 		 * to-be-installed.

  2270 		 */

  2271 		while (up < uprop_end &&

  2272 		       !prop_is_being_installed(trans, up))

  2273 			up++;

  2274 		if (up == uprop_end)

  2275 			break;

  2277 		switch (up->type) {

  2278 		case RAZOR_PROPERTY_REQUIRES:

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

  2280 				break;

  2282 			if (find_installed_package_for_property(trans, &sp, up) ||

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

  2284 				/* Requires something that is either installed

  2285 				 * or to-be-installed.

  2286 				 */

  2287 				break;

  2288 			}

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

  2291 			pkg = find_uninstalled_package_for_property(trans, &sp, up);

  2292 			if (!pkg) {

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

  2294 				if (pkg) {

  2295 					/* FIXME: find a way to do this more efficiently */

  2296 					maybe_mark_upgraded(trans, pkg);

  2297 				}

  2298 			}

  2299 			add_transaction_package(trans, pkg,

  2300 						RAZOR_PACKAGE_INSTALL,

  2301 						NULL, up);

  2302 			break;

  2304 		case RAZOR_PROPERTY_PROVIDES:

  2305 			/* find_installed_package_for_property works backwards

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

  2307 			 */

  2308 			pkg = find_installed_package_for_property(trans, &sp, up);

  2309 			if (!pkg)

  2310 				break;

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

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

  2314 				 * finding an upgrade

  2315 				 */

  2316 				upgrade = find_upgrade_for_installed_conflict(trans, pkg, up);

  2317 				if (upgrade) {

  2318 					bitarray_set(&trans->syspkgs, pkg - spkgs, 0);

  2319 					add_transaction_package(trans, upgrade,

  2320 								RAZOR_PACKAGE_INSTALL,

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

  2322 				}

  2323 				break;

  2324 			}

  2326 			add_transaction_package(trans, pkg,

  2327 						RAZOR_PACKAGE_OLD_CONFLICT,

  2328 						NULL, up);

  2329 			break;

  2331 		case RAZOR_PROPERTY_CONFLICTS:

  2332 			pkg = find_installed_package_for_property(trans, &sp, up);

  2333 			if (!pkg)

  2334 				break;

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

  2337 				/* Conflicts with something already installed.

  2338 				 * Try to upgrade out.

  2339 				 */

  2340 				upgrade = find_upgrade(trans, sp, up);

  2341 				if (upgrade) {

  2342 					bitarray_set(&trans->syspkgs, pkg - spkgs, 0);

  2343 					add_transaction_package(trans, upgrade,

  2344 								RAZOR_PACKAGE_INSTALL,

  2345 								NULL, up);

  2346 					break;

  2347 				}

  2348 			}

  2350 			add_transaction_package(trans, pkg,

  2351 						RAZOR_PACKAGE_NEW_CONFLICT,

  2352 						NULL, up);

  2353 			break;

  2355 		case RAZOR_PROPERTY_OBSOLETES:

  2356 			pkg = find_installed_package_for_property(trans, &sp, up);

  2357 			if (pkg) {

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

  2359 				 * will add a CONTRADICTION error as well.

  2360 				 */

  2361 				add_transaction_package(trans, pkg,

  2362 							RAZOR_PACKAGE_REMOVE,

  2363 							NULL, up);

  2364 			}

  2365 			break;

  2367 		default:

  2368 			/* can't happen */

  2369 			break;

  2370 		}

  2371 		up++;

  2372 	}

  2373 }

  2375 /* Look through pkg's PROVIDES, and for each one that no other package

  2376  * provides, add its property index to lost_provides.

  2377  */

  2378 static void

  2379 gather_lost_provides(struct razor_set *set, struct razor_package *pkg,

  2380 		     struct array *lost_provides)

  2381 {

  2382 	struct razor_property *props = set->properties.data, *prop;

  2383 	struct list *p, *providers;

  2384 	uint32_t *lost;

  2386 	for (p = list_first(&pkg->properties, &set->property_pool); p; p = list_next(p)) {

  2387 		prop = &props[p->data];

  2388 		if (prop->type != RAZOR_PROPERTY_PROVIDES)

  2389 			continue;

  2391 		providers = list_first(&prop->packages, &set->package_pool);

  2392 		if (providers && !list_next(providers)) {

  2393 			lost = array_add(lost_provides, sizeof *lost);

  2394 			*lost = p->data;

  2395 		}

  2396 	}

  2397 }

  2399 static void

  2400 gather_lost_files(struct razor_set *set, struct razor_package *pkg,

  2401 		  struct array *lost_files)

  2402 {

  2403 	struct razor_entry *entries = set->files.data, *entry, **lost;

  2404 	struct list *e, *providers;

  2406 	for (e = list_first(&pkg->files, &set->file_pool); e; e = list_next(e)) {

  2407 		entry = &entries[e->data];

  2408 		providers = list_first(&entry->packages, &set->package_pool);

  2409 		if (providers && !list_next(providers)) {

  2410 			lost = array_add(lost_files, sizeof *lost);

  2411 			*lost = entry;

  2412 		}

  2413 	}

  2414 }

  2416 static void

  2417 lose_required_package(struct razor_transaction_resolver *trans,

  2418 		      struct razor_property *req,

  2419 		      struct list_head *lost_package_list)

  2420 {

  2421 	struct razor_package *pkgs, *lost_package;

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

  2423 	struct list *p;

  2425 	pkgs = trans->system->packages.data;

  2426 	lost_package = &pkgs[list_first(lost_package_list, &trans->system->package_pool)->data];

  2428 	for (p = list_first(&req->packages, &trans->system->package_pool); p; p = list_next(p)) {

  2429 		add_transaction_package(trans, &pkgs[p->data],

  2430 					RAZOR_PACKAGE_REMOVE,

  2431 					&pool[lost_package->name], req);

  2432 	}

  2433 }

  2435 static void

  2436 lose_requirement(struct razor_transaction_resolver *trans,

  2437 		 struct razor_property *req,

  2438 		 struct razor_property *lost_provider,

  2439 		 struct razor_property *first_provider)

  2440 {

  2441 	struct razor_property *provider, *prop_end;

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

  2444 	prop_end = trans->system->properties.data + trans->system->properties.size;

  2446 	/* See if any other provider satisfies req */

  2447 	for (provider = first_provider;

  2448 	     provider < prop_end && provider->type == RAZOR_PROPERTY_PROVIDES && provider->name == lost_provider->name;

  2449 	     provider++) {

  2450 		if (provider == lost_provider)

  2451 			continue;

  2453 		if (provider_satisfies_requirement(provider, pool, req, pool))

  2454 			return;

  2455 	}

  2457 	lose_required_package(trans, req, &lost_provider->packages);

  2458 }

  2460 static void

  2461 razor_transaction_satisfy_removes(struct razor_transaction_resolver *trans,

  2462 				  int start, int end)

  2463 {

  2464 	struct razor_transaction_package *packages;

  2465 	struct razor_package *pkgs;

  2466 	int pkg_count, r;

  2467 	uint32_t *lost, *lost_end;

  2468 	struct razor_entry *entry, **lostf, **lostf_end;

  2469 	struct razor_property *props, *prop_end, *req, *first_provider;

  2470 	struct array lost_provides, lost_files;

  2471 	char *pool;

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

  2474 	pkg_count = trans->system->packages.size / sizeof (struct razor_package);

  2475 	props = trans->system->properties.data;

  2476 	prop_end = trans->system->properties.data + trans->system->properties.size;

  2477 	pool = trans->system->string_pool.data;

  2478 	packages = trans->packages.data;

  2480 	array_init(&lost_files);

  2481 	array_init(&lost_provides);

  2482 	for (r = start; r < end; r++) {

  2483 		if (packages[r].state != RAZOR_PACKAGE_REMOVE)

  2484 			continue;

  2486 		gather_lost_provides(trans->system, packages[r].package,

  2487 				     &lost_provides);

  2488 		gather_lost_files(trans->system, packages[r].package,

  2489 				  &lost_files);

  2490 	}

  2492 	/* Handle lost_provides */

  2493 	lost_end = lost_provides.data + lost_provides.size;

  2494 	for (lost = lost_provides.data; lost < lost_end; lost++) {

  2495 		/* Requires FOO will appear before Provides FOO */

  2496 		for (req = &props[*lost]; req > props && req->name == props[*lost].name && req->type != RAZOR_PROPERTY_REQUIRES; req--)

  2497 			;

  2498 		first_provider = req + 1;

  2500 		while (req > props && req->name == props[*lost].name) {

  2501 			lose_requirement(trans, req, &props[*lost],

  2502 					 first_provider);

  2503 			req--;

  2504 		}

  2505 	}

  2506 	array_release(&lost_provides);

  2508 	/* And now lost_files. FIXME, inefficient */

  2509 	lostf_end = lost_files.data + lost_files.size;

  2511 	req = props;

  2512 	/* Due to the sorting of props, this loop is likely a no-op */

  2513 	while (req < prop_end && pool[req->name] != '/')

  2514 		req++;

  2516 	for (; req < prop_end && pool[req->name] == '/'; req++) {

  2517 		if (req->type != RAZOR_PROPERTY_REQUIRES)

  2518 			continue;

  2520 		entry = find_entry(trans->system, trans->system->files.data,

  2521 				   &pool[req->name]);

  2522 		if (!entry)

  2523 			continue;

  2525 		for (lostf = lost_files.data; lostf < lostf_end; lostf++) {

  2526 			if (*lostf == entry)

  2527 				break;

  2528 		}

  2529 		if (lostf == lostf_end)

  2530 			continue;

  2532 		lose_required_package(trans, req, &entry->packages);

  2533 	}

  2534 	array_release(&lost_files);

  2535 }

  2537 struct razor_transaction *

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

  2539 			 int update_count, const char **update_packages,

  2540 			 int remove_count, const char **remove_packages)

  2541 {

  2542 	struct razor_transaction_resolver trans;

  2543 	struct razor_transaction *ret_trans;

  2544 	int start, end;

  2546 	trans.system = system;

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

  2548 	array_init(&trans.packages);

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

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

  2551 	trans.errors = 0;

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

  2554 		find_packages(&trans,

  2555 			      update_count, update_packages,

  2556 			      remove_count, remove_packages);

  2557 	} else

  2558 		find_all_packages(&trans);

  2560 	start = 0;

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

  2563 	while (!trans.errors && start != end) {

  2564 		razor_transaction_satisfy_installs(&trans);

  2565 		razor_transaction_satisfy_removes(&trans, start, end);

  2567 		start = end;

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

  2569 	}

  2571 	ret_trans = zalloc(sizeof *ret_trans);

  2572 	ret_trans->system = trans.system;

  2573 	ret_trans->upstream = trans.upstream;

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

  2575 	ret_trans->package_count = end;

  2576 	ret_trans->errors = trans.errors;

  2577 	return ret_trans;

  2578 }

  2580 const char * const razor_version_relations[] = {

  2581 	/* same order as enum razor_version_relation */

  2582 	"<", "<=", "=", ">=", ">"

  2583 };

  2585 const char * const razor_property_types[] = {

  2586 	/* same order as enum razor_property_type */

  2587 	"requires", "provides", "conflicts with", "obsoletes"

  2588 };

  2590 void

  2591 razor_transaction_describe(struct razor_transaction *trans)

  2592 {

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

  2594 	int errors_only = 0;

  2596 	tps = trans->packages;

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

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

  2599 		switch (p->state) {

  2600 		case RAZOR_PACKAGE_INSTALL:

  2601 			if (errors_only)

  2602 				break;

  2604 			printf("Installing %s %s", p->name, p->version);

  2605 			if (p->dep_package) {

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

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

  2608 					printf(" because installed %s conflicts with %s",

  2609 					       p->name, p->dep_property);

  2610 					if (*p->dep_version) {

  2611 						printf(" %s %s",

  2612 						       razor_version_relations[p->dep_relation],

  2613 						       p->dep_version);

  2614 					}

  2615 				} else {

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

  2617 					if (*p->dep_version) {

  2618 						printf(", which %s %s %s %s",

  2619 						       razor_property_types[p->dep_type],

  2620 						       p->dep_property,

  2621 						       razor_version_relations[p->dep_relation],

  2622 						       p->dep_version);

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

  2624 						printf(", which %s %s",

  2625 						       razor_property_types[p->dep_type],

  2626 						       p->dep_property);

  2627 					}

  2628 				}

  2629 			}

  2630 			printf("\n");

  2631 			break;

  2633 		case RAZOR_PACKAGE_REMOVE:

  2634 			if (errors_only)

  2635 				break;

  2636 			printf("Removing %s %s", p->name, p->version);

  2637 			if (p->dep_package) {

  2638 				if (p->dep_type == RAZOR_PROPERTY_OBSOLETES) {

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

  2640 					       p->dep_package);

  2641 				} else {

  2642 					printf(" which required %s",

  2643 					       p->dep_package);

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

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

  2646 				}

  2647 			}

  2648 			printf("\n");

  2649 			break;

  2651 		case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:

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

  2653 			errors_only = 1;

  2654 			break;

  2656 		case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:

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

  2658 			errors_only = 1;

  2659 			break;

  2661 		case RAZOR_PACKAGE_UP_TO_DATE:

  2662 			printf("Error: can't upgrade %s: no newer version is available", p->name);

  2663 			errors_only = 1;

  2664 			break;

  2666 		case RAZOR_PACKAGE_CONTRADICTION:

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

  2668 			errors_only = 1;

  2669 			break;

  2671 		case RAZOR_PACKAGE_OLD_CONFLICT:

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

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

  2674 			if (*p->dep_version) {

  2675 				printf("%s %s %s",

  2676 				       p->dep_property,

  2677 				       razor_version_relations[p->dep_relation],

  2678 				       p->dep_version);

  2679 			} else

  2680 				printf("it");

  2681 			printf("\n");

  2683 			errors_only = 1;

  2684 			break;

  2686 		case RAZOR_PACKAGE_NEW_CONFLICT:

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

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

  2689 			if (*p->dep_version) {

  2690 				printf(" %s %s",

  2691 				       razor_version_relations[p->dep_relation],

  2692 				       p->dep_version);

  2693 			}

  2694 			printf("\n");

  2696 			errors_only = 1;

  2697 			break;

  2699 		case RAZOR_PACKAGE_UNSATISFIABLE:

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

  2701 			if (*p->dep_version) {

  2702 				printf(" %s %s",

  2703 					razor_version_relations[p->dep_relation],

  2704 					p->dep_version);

  2705 			}

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

  2707 				p->dep_package);

  2708 			errors_only = 1;

  2709 			break;

  2711 		default:

  2712 			/* Shouldn't actually happen */

  2713 			break;

  2714 		}

  2715 	}

  2716 }

  2718 struct razor_set *

  2719 razor_transaction_run(struct razor_transaction *trans)

  2720 {

  2721 	struct array install_packages, remove_packages;

  2722 	struct razor_merger *merger;

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

  2724 	struct source *source1, *source2;

  2725 	char *spool, *ipool, *rpool;

  2726 	uint32_t *map;

  2727 	int p, cmp;

  2729 	/* FIXME */

  2730 	if (trans->errors)

  2731 		return NULL;

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

  2734 	array_init(&install_packages);

  2735 	array_init(&remove_packages);

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

  2737 		if (trans->packages[p].state == RAZOR_PACKAGE_INSTALL)

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

  2739 		else

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

  2741 		*pkg = *trans->packages[p].package;

  2742 	}

  2743 	map = qsort_with_data(install_packages.data,

  2744 			      install_packages.size / sizeof *pkg,

  2745 			      sizeof *pkg,

  2746 			      compare_packages,

  2747 			      trans->upstream);

  2748 	free(map);

  2749 	map = qsort_with_data(remove_packages.data,

  2750 			      remove_packages.size / sizeof *pkg,

  2751 			      sizeof *pkg,

  2752 			      compare_packages,

  2753 			      trans->system);

  2754 	free(map);

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

  2758 	source1 = &merger->source1;

  2759 	source2 = &merger->source2;

  2761 	i = install_packages.data;

  2762 	iend = install_packages.data + install_packages.size;

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

  2765 	r = remove_packages.data;

  2766 	rend = remove_packages.data + remove_packages.size;

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

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

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

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

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

  2774 		/* Check if s is being removed */

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

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

  2777 			s++;

  2778 			r++;

  2779 			continue;

  2780 		}

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

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

  2784 		else if (s < send)

  2785 			cmp = -1;

  2786 		else

  2787 			cmp = 1;

  2788 		if (cmp < 0) {

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

  2790 			s++;

  2791 		} else if (cmp == 0) {

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

  2793 			s++;

  2794 			i++;

  2795 		} else {

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

  2797 			i++;

  2798 		}

  2799 	}

  2801 	array_release(&install_packages);

  2802 	array_release(&remove_packages);

  2804 	return razor_merger_finish(merger);

  2805 }

  2807 void

  2808 razor_transaction_destroy(struct razor_transaction *trans)

  2809 {

  2810 	int p;

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

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

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

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

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

  2817 	}

  2818 	free(trans);

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

  2821 }

author	Dan Winship <danw@gnome.org>
	Wed Mar 05 19:01:51 2008 -0500 (2008-03-05)
changeset 146	1d4043c9f869
parent 145	097f7b60b97a
child 147	c3eab84160e5
permissions	-rw-r--r--