razor: razor.c@3142795705a5

     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_importer_begin_package(struct razor_importer *importer,

   233 			     const char *name, const char *version)

   234 {

   235 	struct razor_package *p;

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

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

   239 	p->flags = 0;

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

   242 	importer->package = p;

   243 	array_init(&importer->properties);

   244 }

   246 void

   247 razor_importer_finish_package(struct razor_importer *importer)

   248 {

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

   250 		       &importer->set->property_pool,

   251 		       &importer->properties,

   252 		       1);

   254 	array_release(&importer->properties);

   255 }

   257 void

   258 razor_importer_add_property(struct razor_importer *importer,

   259 			    const char *name,

   260 			    enum razor_version_relation relation,

   261 			    const char *version,

   262 			    enum razor_property_type type)

   263 {

   264 	struct razor_property *p;

   265 	uint32_t *r;

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

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

   269 	p->flags = 0;

   270 	p->type = type;

   271 	p->relation = relation;

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

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

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

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

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

   278 }

   280 void

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

   282 {

   283 	struct import_entry *e;

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

   287 	e->package = importer->package -

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

   289 	e->name = strdup(name);

   290 }

   292 struct razor_importer *

   293 razor_importer_new(void)

   294 {

   295 	struct razor_importer *importer;

   297 	importer = zalloc(sizeof *importer);

   298 	importer->set = razor_set_create();

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

   301 	return importer;

   302 }

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

   305 void

   306 razor_importer_destroy(struct razor_importer *importer)

   307 {

   308 	/* FIXME: write this */

   309 }

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

   313 					const void *p,

   314 					void *data);

   316 struct qsort_context {

   317 	size_t size;

   318 	compare_with_data_func_t compare;

   319 	void *data;

   320 };

   322 static void

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

   324 {

   325 	char buffer[size];

   327 	memcpy(buffer, p1, size);

   328 	memcpy(p1, p2, size);

   329 	memcpy(p2, buffer, size);

   330 }

   332 static void

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

   334 		  struct qsort_context *ctx)

   335 {

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

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

   338 	int left, right, result;

   339 	size_t size = ctx->size;

   341 	p = base;

   342 	start = base;

   343 	end = base + nelem * size;

   344 	mp = map;

   345 	mstart = map;

   346 	mend = map + nelem;

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

   349 	while (p < end) {

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

   351 		if (result < 0) {

   352 			qsort_swap(p, start, size);

   353 			tmp = *mp;

   354 			*mp = *mstart;

   355 			*mstart = tmp;

   356 			if (start == pivot)

   357 				pivot = p;

   358 			start += size;

   359 			mstart++;

   360 			p += size;

   361 			mp++;

   362 		} else if (result == 0) {

   363 			p += size;

   364 			mp++;

   365 		} else {

   366  			end -= size;

   367 			mend--;

   368 			qsort_swap(p, end, size);

   369 			tmp = *mp;

   370 			*mp = *mend;

   371 			*mend = tmp;

   372 			if (end == pivot)

   373 				pivot = p;

   374 		}

   375 	}

   377 	left = (start - base) / size;

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

   379 	if (left > 1)

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

   381 	if (right > 1)

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

   383 }

   385 uint32_t *

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

   387 		compare_with_data_func_t compare, void *data)

   388 {

   389 	struct qsort_context ctx;

   390 	uint32_t *map;

   391 	int i;

   393 	if (nelem == 0)

   394 		return NULL;

   396 	ctx.size = size;

   397 	ctx.compare = compare;

   398 	ctx.data = data;

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

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

   402 		map[i] = i;

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

   406 	return map;

   407 }

   409 static int

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

   411 {

   412 	const char *p1, *p2;

   413 	long n1, n2;

   414 	int res;

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

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

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

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

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

   422 	if (res < 0) {

   423 		n1 = 0;

   424 		p1 = s1;

   425 		p2++;

   426 	} else if (res > 0) {

   427 		p1++;

   428 		n2 = 0;

   429 		p2 = s2;

   430 	}

   432 	if (n1 != n2)

   433 		return n1 - n2;

   434 	while (*p1 && *p2) {

   435 		if (*p1 != *p2)

   436 			return *p1 - *p2;

   437 		p1++;

   438 		p2++;

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

   440 			return versioncmp(p1, p2);

   441 	}

   443 	return *p1 - *p2;

   444 }

   446 static int

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

   448 {

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

   450 	struct razor_set *set = data;

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

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

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

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

   456 	else

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

   458 }

   460 static int

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

   462 {

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

   464 	struct razor_set *set = data;

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

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

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

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

   470 		return prop1->type - prop2->type;

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

   472 		return prop1->relation - prop2->relation;

   473 	else

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

   475 }

   477 static uint32_t *

   478 uniqueify_properties(struct razor_set *set)

   479 {

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

   481 	struct array *pkgs, *p;

   482 	struct list_head *r;

   483 	uint32_t *map, *rmap;

   484 	int i, count, unique;

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

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

   488 			      count,

   489 			      sizeof(struct razor_property),

   490 			      compare_properties,

   491 			      set);

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

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

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

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

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

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

   499 			up++;

   500 			up->name = rp->name;

   501 			up->flags = 0;

   502 			up->type = rp->type;

   503 			up->relation = rp->relation;

   504 			up->version = rp->version;

   505 		}

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

   508 		rmap[map[i]] = unique;

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

   510 		*r = rp->packages;

   511 	}

   512 	free(map);

   514 	if (up != rp)

   515 		up++;

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

   517 	rp_end = up;

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

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

   520 		array_release(p);

   521 	}

   523 	free(pkgs);

   525 	return rmap;

   526 }

   528 static int

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

   530 {

   531 	const struct import_entry *e1 = p1;

   532 	const struct import_entry *e2 = p2;

   533 	const char *n1 = e1->name;

   534 	const char *n2 = e2->name;

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

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

   538 	 * sort before "foo.conf"

   539 	 *

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

   541 	 */

   542 	while (*n1 && *n2) {

   543 		if (*n1 < *n2)

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

   545 		else if (*n1 > *n2)

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

   547 		n1++;

   548 		n2++;

   549 	}

   550 	if (*n1)

   551 		return 1;

   552 	else if (*n2)

   553 		return -1;

   554 	else

   555 		return 0;

   556 }

   558 static void

   559 count_entries(struct import_directory *d)

   560 {

   561 	struct import_directory *p, *end;

   563 	p = d->files.data;

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

   565 	d->count = 0;

   566 	while (p < end) {

   567 		count_entries(p);

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

   569 		p++;

   570 	}

   571 }

   573 static void

   574 serialize_files(struct razor_set *set,

   575 		struct import_directory *d, struct array *array)

   576 {

   577 	struct import_directory *p, *end;

   578 	struct razor_entry *e = NULL;

   579 	uint32_t s;

   581 	p = d->files.data;

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

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

   584 	while (p < end) {

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

   586 		e->name = p->name;

   587 		e->flags = 0;

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

   589 		s += p->count;

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

   592 		array_release(&p->packages);

   593 		p++;

   594 	}

   595 	if (e != NULL)

   596 		e->flags |= RAZOR_ENTRY_LAST;

   598 	p = d->files.data;

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

   600 	while (p < end) {

   601 		serialize_files(set, p, array);

   602 		p++;

   603 	}

   604 }

   606 static void

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

   608 {

   609 	struct razor_property *p, *end;

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

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

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

   614 }

   616 static void

   617 build_file_tree(struct razor_importer *importer)

   618 {

   619 	int count, i, length;

   620 	struct import_entry *filenames;

   621 	char *f, *end;

   622 	uint32_t name, *r;

   623 	char dirname[256];

   624 	struct import_directory *d, root;

   625 	struct razor_entry *e;

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

   628 	qsort_with_data(importer->files.data,

   629 			count,

   630 			sizeof (struct import_entry),

   631 			compare_filenames,

   632 			NULL);

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

   635 	array_init(&root.files);

   636 	array_init(&root.packages);

   637 	root.last = NULL;

   639 	filenames = importer->files.data;

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

   641 		f = filenames[i].name;

   642 		if (*f != '/')

   643 			continue;

   644 		f++;

   646 		d = &root;

   647 		while (*f) {

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

   649 			if (end == NULL)

   650 				end = f + strlen(f);

   651 			length = end - f;

   652 			memcpy(dirname, f, length);

   653 			dirname[length] ='\0';

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

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

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

   657 				d->last->name = name;

   658 				d->last->last = NULL;

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

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

   661 			}

   662 			d = d->last;

   663 			f = end + 1;

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

   665 				break;

   666 		}

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

   669 		*r = filenames[i].package;

   670 		free(filenames[i].name);

   671 	}

   673 	count_entries(&root);

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

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

   677 	e->name = root.name;

   678 	e->flags = RAZOR_ENTRY_LAST;

   679 	e->start = 1;

   680 	list_set_empty(&e->packages);

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

   684 	array_release(&importer->files);

   685 }

   687 static void

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

   689 {

   690 	struct razor_package *p, *packages;

   691 	struct array *pkgs;

   692 	struct razor_entry *e, *end;

   693 	struct list *r;

   694 	uint32_t *q;

   695 	int i, count;

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

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

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

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

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

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

   704 		while (r) {

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

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

   707 			r = list_next(r);

   708 		}

   709 	}

   711 	packages = set->packages.data;

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

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

   714 		array_release(&pkgs[i]);

   715 	}

   716 	free(pkgs);

   717 }

   719 struct razor_set *

   720 razor_importer_finish(struct razor_importer *importer)

   721 {

   722 	struct razor_set *set;

   723 	uint32_t *map, *rmap;

   724 	int i, count;

   726 	map = uniqueify_properties(importer->set);

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

   728 	free(map);

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

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

   732 			      count,

   733 			      sizeof(struct razor_package),

   734 			      compare_packages,

   735 			      importer->set);

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

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

   739 		rmap[map[i]] = i;

   740 	free(map);

   742 	build_file_tree(importer);

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

   744 	build_package_file_lists(importer->set, rmap);

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

   746 	free(rmap);

   748 	set = importer->set;

   749 	hashtable_release(&importer->table);

   750 	free(importer);

   752 	return set;

   753 }

   755 struct razor_package_iterator {

   756 	struct razor_set *set;

   757 	struct razor_package *package, *end;

   758 	struct list *index;

   759 };

   761 struct razor_package_iterator *

   762 razor_package_iterator_create_with_index(struct razor_set *set,

   763 					 struct list *index)

   764 {

   765 	struct razor_package_iterator *pi;

   767 	pi = zalloc(sizeof *pi);

   768 	pi->set = set;

   769 	pi->index = index;

   771 	return pi;

   772 }

   774 struct razor_package_iterator *

   775 razor_package_iterator_create(struct razor_set *set)

   776 {

   777 	struct razor_package_iterator *pi;

   779 	pi = zalloc(sizeof *pi);

   780 	pi->set = set;

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

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

   784 	return pi;

   785 }

   787 struct razor_package_iterator *

   788 razor_package_iterator_create_for_property(struct razor_set *set,

   789 					   struct razor_property *property)

   790 {

   791 	struct list *index;

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

   794 	return razor_package_iterator_create_with_index(set, index);

   795 }

   797 int

   798 razor_package_iterator_next(struct razor_package_iterator *pi,

   799 			    struct razor_package **package,

   800 			    const char **name, const char **version)

   801 {

   802 	char *pool;

   803 	int valid;

   804 	struct razor_package *p, *packages;

   806 	if (pi->package) {

   807 		p = pi->package++;

   808 		valid = p < pi->end;

   809 	} else if (pi->index) {

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

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

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

   813 		valid = 1;

   814 	} else

   815 		valid = 0;

   817 	if (valid) {

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

   819 		*package = p;

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

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

   822 	} else {

   823 		*package = NULL;

   824 	}

   826 	return valid;

   827 }

   829 void

   830 razor_package_iterator_destroy(struct razor_package_iterator *pi)

   831 {

   832 	free(pi);

   833 }

   835 struct razor_package *

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

   837 {

   838 	struct razor_package_iterator *pi;

   839 	struct razor_package *p;

   840 	const char *name, *version;

   842 	pi = razor_package_iterator_create(set);

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

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

   845 			break;

   846 	}

   847 	razor_package_iterator_destroy(pi);

   849 	return p;

   850 }

   852 struct razor_property_iterator {

   853 	struct razor_set *set;

   854 	struct razor_property *property, *end;

   855 	struct list *index;

   856 };

   858 struct razor_property_iterator *

   859 razor_property_iterator_create(struct razor_set *set,

   860 			       struct razor_package *package)

   861 {

   862 	struct razor_property_iterator *pi;

   864 	pi = zalloc(sizeof *pi);

   865 	pi->set = set;

   867 	if (package) {

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

   869 				       &set->property_pool);

   870 	} else {

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

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

   873 	}

   875 	return pi;

   876 }

   878 int

   879 razor_property_iterator_next(struct razor_property_iterator *pi,

   880 			     struct razor_property **property,

   881 			     const char **name,

   882 			     enum razor_version_relation *relation,

   883 			     const char **version,

   884 			     enum razor_property_type *type)

   885 {

   886 	char *pool;

   887 	int valid;

   888 	struct razor_property *p, *properties;

   890 	if (pi->property) {

   891 		p = pi->property++;

   892 		valid = p < pi->end;

   893 	} else if (pi->index) {

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

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

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

   897 		valid = 1;

   898 	} else

   899 		valid = 0;

   901 	if (valid) {

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

   903 		*property = p;

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

   905 		*relation = p->relation;

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

   907 		*type = p->type;

   908 	} else {

   909 		*property = NULL;

   910 	}

   912 	return valid;

   913 }

   915 void

   916 razor_property_iterator_destroy(struct razor_property_iterator *pi)

   917 {

   918 	free(pi);

   919 }

   921 static struct razor_entry *

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

   923 {

   924 	struct razor_entry *e;

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

   926 	int len;

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

   929 	do {

   930 		n = pool + e->name;

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

   932 			return e;

   933 		len = strlen(n);

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

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

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

   937 		}

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

   940 	return NULL;

   941 }

   943 static void

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

   945 	 const char *prefix, const char *pattern)

   946 {

   947 	struct razor_entry *e;

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

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

   951 	do {

   952 		n = pool + e->name;

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

   954 			continue;

   955 		printf("%s/%s%s\n", prefix, n, e->start > 0 ? "/" : "");

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

   957 }

   959 void

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

   961 {

   962 	struct razor_entry *e;

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

   965 	if (pattern == NULL)

   966 		pattern = "/";

   968 	strcpy(buffer, pattern);

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

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

   971 		base = NULL;

   972 	} else {

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

   974 		if (p) {

   975 			*p = '\0';

   976 			base = p + 1;

   977 		} else {

   978 			base = NULL;

   979 		}

   980 	}

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

   982 	if (e->start != 0)

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

   984 }

   986 struct razor_package_iterator *

   987 razor_package_iterator_create_for_file(struct razor_set *set,

   988 				       const char *filename)

   989 {

   990 	struct razor_entry *entry;

   991 	struct list *index;

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

   994 	if (entry == NULL)

   995 		return NULL;

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

   998 	return razor_package_iterator_create_with_index(set, index);

   999 }

  1001 static struct list *

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

  1003 		   struct razor_entry *dir, uint32_t end,

  1004 		   char *prefix)

  1005 {

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

  1007 	uint32_t next, file;

  1008 	char *pool;

  1009 	int len;

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

  1012 	pool = set->string_pool.data;

  1014 	e = entries + dir->start;

  1015 	do {

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

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

  1018 			r = list_next(r);

  1019 			if (!r)

  1020 				return NULL;

  1021 			if (r->data >= end)

  1022 				return r;

  1023 		}

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

  1026 	e = entries + dir->start;

  1027 	do {

  1028 		if (e->start == 0)

  1029 			continue;

  1031 		if (e->flags & RAZOR_ENTRY_LAST)

  1032 			next = end;

  1033 		else {

  1034 			f = e + 1;

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

  1036 				f++;

  1037 			if (f->start == 0)

  1038 				next = end;

  1039 			else

  1040 				next = f->start;

  1041 		}

  1043 		file = r->data;

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

  1045 			len = strlen(prefix);

  1046 			prefix[len] = '/';

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

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

  1049 			prefix[len] = '\0';

  1050 		}

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

  1053 	return r;

  1054 }

  1056 void

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

  1058 {

  1059 	struct razor_package *package;

  1060 	struct list *r;

  1061 	uint32_t end;

  1062 	char buffer[512];

  1064 	package = razor_set_get_package(set, name);

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

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

  1068 	buffer[0] = '\0';

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

  1070 }

  1072 static void

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

  1074 {

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

  1076 	uint32_t *u;

  1077 	char *pool;

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

  1080 	pool = set->string_pool.data;

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

  1083 		if (r->type != RAZOR_PROPERTY_REQUIRES)

  1084 			continue;

  1086 		if (r->name != p->name) {

  1087 			p = r;

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

  1089 			       p->type == r->type)

  1090 				p++;

  1091 		}

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

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

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

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

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

  1098 		 * does.*/

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

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

  1101 			p++;

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

  1104 		 * etc) to properly determine if a requires is

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

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

  1108 		if (p == end ||

  1109 		    p->type != RAZOR_PROPERTY_PROVIDES ||

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

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

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

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

  1114 				continue;

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

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

  1117 		}

  1118 	}

  1119 }

  1121 void

  1122 razor_set_list_unsatisfied(struct razor_set *set)

  1123 {

  1124 	struct array unsatisfied;

  1125 	struct razor_property *properties, *r;

  1126 	uint32_t *u, *end;

  1127 	char *pool;

  1129 	array_init(&unsatisfied);

  1130 	razor_set_validate(set, &unsatisfied);

  1132 	end = unsatisfied.data + unsatisfied.size;

  1133 	properties = set->properties.data;

  1134 	pool = set->string_pool.data;

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

  1137 		r = properties + *u;

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

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

  1140 			       &pool[r->name]);

  1141 		else

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

  1143 			       &pool[r->name],

  1144 			       &pool[r->version]);

  1145 	}

  1147 	array_release(&unsatisfied);

  1148 }

  1150 #define UPSTREAM_SOURCE 0x80

  1152 struct source {

  1153 	struct razor_set *set;

  1154 	uint32_t *property_map;

  1155 };

  1157 struct razor_merger {

  1158 	struct razor_set *set;

  1159 	struct hashtable table;

  1160 	struct source source1;

  1161 	struct source source2;

  1162 };

  1164 static struct razor_merger *

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

  1166 {

  1167 	struct razor_merger *merger;

  1168 	int count;

  1169 	size_t size;

  1171 	merger = zalloc(sizeof *merger);

  1172 	merger->set = razor_set_create();

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

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

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

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

  1178 	merger->source1.set = set1;

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

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

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

  1183 	merger->source2.set = set2;

  1185 	return merger;

  1186 }

  1188 static void

  1189 add_package(struct razor_merger *merger,

  1190 	    struct razor_package *package, struct source *source,

  1191 	    uint32_t flags)

  1192 {

  1193 	char *pool;

  1194 	struct list *r;

  1195 	struct razor_package *p;

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

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

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

  1200 	p->flags = flags;

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

  1202 					&pool[package->version]);

  1203 	p->properties = package->properties;

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

  1206 	while (r) {

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

  1208 		r = list_next(r);

  1209 	}

  1210 }

  1213 /* Build the new package list sorted by merging the two package lists.

  1214  * Build new string pool as we go. */

  1215 static void

  1216 merge_packages(struct razor_merger *merger, struct array *packages)

  1217 {

  1218 	struct razor_package *upstream_packages, *p, *s, *send;

  1219 	struct source *source1, *source2;

  1220 	char *spool, *upool;

  1221 	uint32_t *u, *uend;

  1222 	int cmp;

  1224 	source1 = &merger->source1;

  1225 	source2 = &merger->source2;

  1226 	upstream_packages = source2->set->packages.data;

  1228 	u = packages->data;

  1229 	uend = packages->data + packages->size;

  1230 	upool = source2->set->string_pool.data;

  1232 	s = source1->set->packages.data;

  1233 	send = source1->set->packages.data + source1->set->packages.size;

  1234 	spool = source1->set->string_pool.data;

  1236 	while (s < send || u < uend) {

  1237 		p = upstream_packages + *u;

  1239 		if (s < send && u < uend)

  1240 			cmp = strcmp(&spool[s->name], &upool[p->name]);

  1241 		else if (s < send)

  1242 			cmp = -1;

  1243 		else

  1244 			cmp = 1;

  1245 		if (cmp < 0) {

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

  1247 			s++;

  1248 		} else if (cmp == 0) {

  1249 			add_package(merger, p, source2, UPSTREAM_SOURCE);

  1250 			s++;

  1251 			u++;

  1252 		} else {

  1253 			add_package(merger, p, source2, UPSTREAM_SOURCE);

  1254 			u++;

  1255 		}

  1256 	}

  1257 }

  1259 static uint32_t

  1260 add_property(struct razor_merger *merger,

  1261 	     const char *name, enum razor_version_relation relation,

  1262 	     const char *version, int type)

  1263 {

  1264 	struct razor_property *p;

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

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

  1268 	p->flags = 0;

  1269 	p->type = type;

  1270 	p->relation = relation;

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

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

  1274 }

  1276 static void

  1277 merge_properties(struct razor_merger *merger)

  1278 {

  1279 	struct razor_property *p1, *p2;

  1280 	struct razor_set *set1, *set2;

  1281 	uint32_t *map1, *map2;

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

  1283 	char *pool1, *pool2;

  1285 	set1 = merger->source1.set;

  1286 	set2 = merger->source2.set;

  1287 	map1 = merger->source1.property_map;

  1288 	map2 = merger->source2.property_map;

  1290 	i = 0;

  1291 	j = 0;

  1292 	pool1 = set1->string_pool.data;

  1293 	pool2 = set2->string_pool.data;

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

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

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

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

  1299 			i++;

  1300 			continue;

  1301 		}

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

  1303 			j++;

  1304 			continue;

  1305 		}

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

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

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

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

  1310 		else if (i < count1)

  1311 			cmp = -1;

  1312 		else

  1313 			cmp = 1;

  1314 		if (cmp == 0)

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

  1316 		if (cmp == 0)

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

  1318 		if (cmp == 0)

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

  1320 					 &pool2[p2->version]);

  1321 		if (cmp < 0) {

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

  1323 						 &pool1[p1->name],

  1324 						 p1->relation,

  1325 						 &pool1[p1->version],

  1326 						 p1->type);

  1327 		} else if (cmp > 0) {

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

  1329 						 &pool2[p2->name],

  1330 						 p2->relation,

  1331 						 &pool2[p2->version],

  1332 						 p2->type);

  1333 		} else  {

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

  1335 							     &pool1[p1->name],

  1336 							     p1->relation,

  1337 							     &pool1[p1->version],

  1338 							     p1->type);

  1339 		}

  1340 	}

  1341 }

  1343 static void

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

  1345 		uint32_t *map, struct array *pool)

  1346 {

  1347 	uint32_t r;

  1348 	struct list *p, *q;

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

  1351 	p = list_first(properties, source_pool);

  1352 	while (p) {

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

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

  1355 		q->flags = p->flags;

  1356 		p = list_next(p);

  1357 	}

  1359 	list_set_ptr(properties, r);

  1360 }

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

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

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

  1365  * the arrays for their properties. */

  1366 static void

  1367 rebuild_package_lists(struct razor_set *set)

  1368 {

  1369 	struct array *pkgs, *a;

  1370 	struct razor_package *pkg, *pkg_end;

  1371 	struct razor_property *prop, *prop_end;

  1372 	struct array *pool;

  1373 	struct list *r;

  1374 	uint32_t *q;

  1375 	int count;

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

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

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

  1380 	pool = &set->property_pool;

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

  1383 		r = list_first(&pkg->properties, pool);

  1384 		while (r) {

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

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

  1387 			r = list_next(r);

  1388 		}

  1389 	}

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

  1392 	a = pkgs;

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

  1394 		list_set_array(&prop->packages, pool, a, 0);

  1395 		array_release(a);

  1396 	}

  1397 	free(pkgs);

  1398 }

  1400 struct razor_set *

  1401 razor_merger_finish(struct razor_merger *merger)

  1402 {

  1403 	struct razor_set *result;

  1405 	result = merger->set;

  1406 	hashtable_release(&merger->table);

  1407 	free(merger);

  1409 	return result;

  1410 }

  1412 /* Add packages from 'upstream' to 'set'.  The packages to add are

  1413  * specified by the 'packages' array, which is a sorted list of

  1414  * package indexes.  Returns a newly allocated package set.  Does not

  1415  * enforce validity of the resulting package set.

  1416  *

  1417  * This looks more complicated than it is.  An easy way to merge two

  1418  * package sets would be to just use a razor_importer, but that

  1419  * requires resorting, and is thus O(n log n).  We can do this in a

  1420  * linear sweep, but it gets a little more complicated.

  1421  */

  1422 struct razor_set *

  1423 razor_set_add(struct razor_set *set, struct razor_set *upstream,

  1424 	      struct array *packages)

  1425 {

  1426 	struct razor_merger *merger;

  1427 	struct razor_package *p, *pend;

  1429 	merger = razor_merger_create(set, upstream);

  1431 	merge_packages(merger, packages);

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

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

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

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

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

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

  1439 	 * property list for both sets. */

  1441 	merge_properties(merger);

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

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

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

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

  1448 		struct source *src;

  1450 		if (p->flags & UPSTREAM_SOURCE)

  1451 			src = &merger->source2;

  1452 		else

  1453 			src = &merger->source1;

  1455 		emit_properties(&p->properties,

  1456 				&src->set->property_pool,

  1457 				src->property_map,

  1458 				&merger->set->property_pool);

  1459 		p->flags &= ~UPSTREAM_SOURCE;

  1460 	}

  1462 	rebuild_package_lists(merger->set);

  1464 	return razor_merger_finish(merger);

  1465 }

  1467 void

  1468 razor_set_satisfy(struct razor_set *set, struct array *unsatisfied,

  1469 		  struct razor_set *upstream, struct array *list)

  1470 {

  1471 	struct razor_property *requires, *r;

  1472 	struct razor_property *p, *pend;

  1473 	uint32_t *u, *end, *pkg;

  1474 	struct array *package_pool;

  1475 	char *pool, *upool;

  1477 	end = unsatisfied->data + unsatisfied->size;

  1478 	requires = set->properties.data;

  1479 	pool = set->string_pool.data;

  1481 	p = upstream->properties.data;

  1482 	pend = upstream->properties.data + upstream->properties.size;

  1483 	upool = upstream->string_pool.data;

  1484 	package_pool = &upstream->package_pool;

  1486 	for (u = unsatisfied->data; u < end; u++) {

  1487 		r = requires + *u;

  1489 		while (p < pend &&

  1490 		       p->type != RAZOR_PROPERTY_PROVIDES &&

  1491 		       strcmp(&pool[r->name], &upool[p->name]) > 0)

  1492 			p++;

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

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

  1495 		while (p + 1 < pend && p->name == (p + 1)->name && p->type == (p + 1)->type)

  1496 			p++;

  1498 		if (p == pend ||

  1499 		    strcmp(&pool[r->name], &upool[p->name]) != 0 ||

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

  1501 			/* Do we need to track unsatisfiable requires

  1502 			 * as we go, or should we just do a

  1503 			 * razor_set_validate() at the end? */

  1504 		} else {

  1505 			pkg = array_add(list, sizeof *pkg);

  1506 			/* We just pull in the first package that provides */

  1507 			*pkg = list_first(&p->packages, package_pool)->data;

  1508 		}

  1509 	}

  1510 }

  1512 static void

  1513 find_packages(struct razor_set *set,

  1514 	      int count, const char **package_names, struct array *list)

  1515 {

  1516 	struct razor_package_iterator *pi;

  1517 	struct razor_package *p, *packages;

  1518 	const char *name, *version;

  1519 	uint32_t *r;

  1520 	int i;

  1522 	packages = (struct razor_package *) set->packages.data;

  1523 	pi = razor_package_iterator_create(set);

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

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

  1527 			if (strcmp(name, package_names[i]) == 0) {

  1528 				r = array_add(list, sizeof *r);

  1529 				*r = p - packages;

  1530 				break;

  1531 			}

  1532 		}

  1533 	}

  1535 	razor_package_iterator_destroy(pi);

  1536 }

  1538 static void

  1539 find_all_packages(struct razor_set *set,

  1540 		  struct razor_set *upstream, struct array *list)

  1541 {

  1542 	struct razor_package *p, *u, *pend, *uend;

  1543 	uint32_t *r;

  1544 	char *pool, *upool;

  1546 	pend = set->packages.data + set->packages.size;

  1547 	pool = set->string_pool.data;

  1548 	u = upstream->packages.data;

  1549 	uend = upstream->packages.data + upstream->packages.size;

  1550 	upool = upstream->string_pool.data;

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

  1553 		while (u < uend && strcmp(&pool[p->name], &upool[u->name]) > 0)

  1554 			u++;

  1555 		if (strcmp(&pool[p->name], &upool[u->name]) == 0) {

  1556 			r = array_add(list, sizeof *r);

  1557 			*r = u - (struct razor_package *) upstream->packages.data;

  1558 		}

  1559 	}

  1560 }

  1562 struct razor_set *

  1563 razor_set_update(struct razor_set *set, struct razor_set *upstream,

  1564 		 int count, const char **packages)

  1565 {

  1566 	struct razor_set *new;

  1567 	struct array list, unsatisfied;

  1569 	array_init(&list);

  1570 	if (count > 0)

  1571 		find_packages(upstream, count, packages, &list);

  1572 	else

  1573 		find_all_packages(set, upstream, &list);

  1575 	while (list.size > 0) {

  1576 		new = razor_set_add(set, upstream, &list);

  1577 		array_release(&list);

  1578 		razor_set_destroy(set);

  1579 		set = new;

  1581 		array_init(&unsatisfied);

  1582 		razor_set_validate(new, &unsatisfied);

  1583 		array_init(&list);

  1584 		razor_set_satisfy(new, &unsatisfied, upstream, &list);

  1585 		array_release(&unsatisfied);

  1586 	}

  1588 	array_release(&list);

  1590 	return set;

  1591 }

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

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

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

  1596  **/

  1598 void

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

  1600 	       razor_package_callback_t callback, void *data)

  1601 {

  1602 	struct razor_package_iterator *pi1, *pi2;

  1603 	struct razor_package *p1, *p2;

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

  1605 	int res;

  1607 	pi1 = razor_package_iterator_create(set);

  1608 	pi2 = razor_package_iterator_create(upstream);

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

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

  1613 	while (p1 || p2) {

  1614 		if (p1 && p2) {

  1615 			res = strcmp(name1, name2);

  1616 			if (res == 0)

  1617 				res = versioncmp(version1, version2);

  1618 		} else {

  1619 			res = 0;

  1620 		}

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

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

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

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

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

  1628 			razor_package_iterator_next(pi1, &p1,

  1629 						    &name1, &version1);

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

  1631 			razor_package_iterator_next(pi2, &p2,

  1632 						    &name2, &version2);

  1633 	}

  1635 	razor_package_iterator_destroy(pi1);

  1636 	razor_package_iterator_destroy(pi2);

  1637 }

author	Dan Winship <danw@gnome.org>
	Wed Feb 20 12:42:42 2008 -0500 (2008-02-20)
changeset 126	3142795705a5
parent 124	feef7736a439
child 127	4a12eceb0858
permissions	-rw-r--r--