razor: razor.c@832743d47157

     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_ENTRY_LAST	0x80000000ul

    37 #define RAZOR_ENTRY_MASK	0x00fffffful

    39 #define RAZOR_STRING_POOL	0

    40 #define RAZOR_PACKAGES		1

    41 #define RAZOR_PROPERTIES	2

    42 #define RAZOR_FILES		3

    43 #define RAZOR_PACKAGE_POOL	4

    44 #define RAZOR_PROPERTY_POOL	5

    45 #define RAZOR_FILE_POOL		6

    47 struct razor_package {

    48 	uint32_t name;

    49 	uint32_t version;

    50 	struct list_head properties;

    51 	struct list_head files;

    52 };

    54 struct razor_property {

    55 	uint32_t name;

    56 	uint32_t relation;

    57 	uint32_t version;

    58 	struct list_head packages;

    59 };

    61 struct razor_entry {

    62 	uint32_t name;

    63 	uint32_t start;

    64 	struct list_head packages;

    65 };

    67 struct razor_set {

    68 	struct array string_pool;

    69  	struct array packages;

    70  	struct array properties;

    71  	struct array files;

    72 	struct array package_pool;

    73  	struct array property_pool;

    74  	struct array file_pool;

    75 	struct razor_set_header *header;

    76 };

    78 struct import_entry {

    79 	uint32_t package;

    80 	char *name;

    81 };

    83 struct import_directory {

    84 	uint32_t name, count;

    85 	struct array files;

    86 	struct array packages;

    87 	struct import_directory *last;

    88 };

    90 struct razor_importer {

    91 	struct razor_set *set;

    92 	struct hashtable table;

    93 	struct razor_package *package;

    94 	struct array properties;

    95 	struct array files;

    96 };

    98 static void *

    99 zalloc(size_t size)

   100 {

   101 	void *p;

   103 	p = malloc(size);

   104 	memset(p, 0, size);

   106 	return p;

   107 }

   109 struct razor_set_section razor_sections[] = {

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

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

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

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

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

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

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

   117 };

   119 struct razor_set *

   120 razor_set_create(void)

   121 {

   122 	return zalloc(sizeof(struct razor_set));

   123 }

   125 struct razor_set *

   126 razor_set_open(const char *filename)

   127 {

   128 	struct razor_set *set;

   129 	struct razor_set_section *s;

   130 	struct stat stat;

   131 	struct array *array;

   132 	int fd;

   134 	set = zalloc(sizeof *set);

   135 	fd = open(filename, O_RDONLY);

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

   137 		return NULL;

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

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

   140 		free(set);

   141 		return NULL;

   142 	}

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

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

   146 			continue;

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

   148 			continue;

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

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

   151 		array->size = s->size;

   152 		array->alloc = s->size;

   153 	}

   154 	close(fd);

   156 	return set;

   157 }

   159 void

   160 razor_set_destroy(struct razor_set *set)

   161 {

   162 	unsigned int size;

   163 	struct array *a;

   164 	int i;

   166 	if (set->header) {

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

   168 			;

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

   170 		munmap(set->header, size);

   171 	} else {

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

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

   174 			free(a->data);

   175 		}

   176 	}

   178 	free(set);

   179 }

   181 int

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

   183 {

   184 	char data[4096];

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

   186 	struct array *a;

   187 	uint32_t offset;

   188 	int i, fd;

   190 	memset(data, 0, sizeof data);

   191 	header->magic = RAZOR_MAGIC;

   192 	header->version = RAZOR_VERSION;

   193 	offset = sizeof data;

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

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

   197 			continue;

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

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

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

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

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

   203 	}

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

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

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

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

   210 	if (fd < 0)

   211 		return -1;

   213 	razor_write(fd, data, sizeof data);

   214 	memset(data, 0, sizeof data);

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

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

   217 			continue;

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

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

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

   221 	}

   223 	close(fd);

   225 	return 0;

   226 }

   228 void

   229 razor_importer_begin_package(struct razor_importer *importer,

   230 			     const char *name, const char *version)

   231 {

   232 	struct razor_package *p;

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

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

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

   238 	importer->package = p;

   239 	array_init(&importer->properties);

   240 }

   242 void

   243 razor_importer_finish_package(struct razor_importer *importer)

   244 {

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

   246 		       &importer->set->property_pool,

   247 		       &importer->properties);

   249 	array_release(&importer->properties);

   250 }

   252 void

   253 razor_importer_add_property(struct razor_importer *importer,

   254 			    const char *name,

   255 			    enum razor_version_relation relation,

   256 			    const char *version,

   257 			    enum razor_property_type type)

   258 {

   259 	struct razor_property *p;

   260 	uint32_t *r;

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

   263 	p->name = hashtable_tokenize(&importer->table, name) | (type << 30);

   264 	p->relation = relation;

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

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

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

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

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

   271 }

   273 void

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

   275 {

   276 	struct import_entry *e;

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

   280 	e->package = importer->package -

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

   282 	e->name = strdup(name);

   283 }

   285 struct razor_importer *

   286 razor_importer_new(void)

   287 {

   288 	struct razor_importer *importer;

   290 	importer = zalloc(sizeof *importer);

   291 	importer->set = razor_set_create();

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

   294 	return importer;

   295 }

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

   298 void

   299 razor_importer_destroy(struct razor_importer *importer)

   300 {

   301 	/* FIXME: write this */

   302 }

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

   306 					const void *p,

   307 					void *data);

   309 struct qsort_context {

   310 	size_t size;

   311 	compare_with_data_func_t compare;

   312 	void *data;

   313 };

   315 static void

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

   317 {

   318 	char buffer[size];

   320 	memcpy(buffer, p1, size);

   321 	memcpy(p1, p2, size);

   322 	memcpy(p2, buffer, size);

   323 }

   325 static void

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

   327 		  struct qsort_context *ctx)

   328 {

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

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

   331 	int left, right, result;

   332 	size_t size = ctx->size;

   334 	p = base;

   335 	start = base;

   336 	end = base + nelem * size;

   337 	mp = map;

   338 	mstart = map;

   339 	mend = map + nelem;

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

   342 	while (p < end) {

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

   344 		if (result < 0) {

   345 			qsort_swap(p, start, size);

   346 			tmp = *mp;

   347 			*mp = *mstart;

   348 			*mstart = tmp;

   349 			if (start == pivot)

   350 				pivot = p;

   351 			start += size;

   352 			mstart++;

   353 			p += size;

   354 			mp++;

   355 		} else if (result == 0) {

   356 			p += size;

   357 			mp++;

   358 		} else {

   359  			end -= size;

   360 			mend--;

   361 			qsort_swap(p, end, size);

   362 			tmp = *mp;

   363 			*mp = *mend;

   364 			*mend = tmp;

   365 			if (end == pivot)

   366 				pivot = p;

   367 		}

   368 	}

   370 	left = (start - base) / size;

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

   372 	if (left > 1)

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

   374 	if (right > 1)

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

   376 }

   378 uint32_t *

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

   380 		compare_with_data_func_t compare, void *data)

   381 {

   382 	struct qsort_context ctx;

   383 	uint32_t *map;

   384 	int i;

   386 	if (nelem == 0)

   387 		return NULL;

   389 	ctx.size = size;

   390 	ctx.compare = compare;

   391 	ctx.data = data;

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

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

   395 		map[i] = i;

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

   399 	return map;

   400 }

   402 static int

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

   404 {

   405 	const char *p1, *p2;

   406 	long n1, n2;

   407 	int res;

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

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

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

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

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

   415 	if (res < 0) {

   416 		n1 = 0;

   417 		p1 = s1;

   418 		p2++;

   419 	} else if (res > 0) {

   420 		p1++;

   421 		n2 = 0;

   422 		p2 = s2;

   423 	}

   425 	if (n1 != n2)

   426 		return n1 - n2;

   427 	while (*p1 && *p2) {

   428 		if (*p1 != *p2)

   429 			return *p1 - *p2;

   430 		p1++;

   431 		p2++;

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

   433 			return versioncmp(p1, p2);

   434 	}

   436 	return *p1 - *p2;

   437 }

   439 static int

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

   441 {

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

   443 	struct razor_set *set = data;

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

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

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

   448 	else

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

   450 }

   452 static int

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

   454 {

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

   456 	struct razor_set *set = data;

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

   459 	if (prop1->name == prop2->name) {

   460 		if (prop1->relation == prop2->relation)

   461 			return versioncmp(&pool[prop1->version],

   462 					  &pool[prop2->version]);

   463 		else

   464 			return prop1->relation - prop2->relation;

   465 	} else if ((prop1->name & RAZOR_ENTRY_MASK) == (prop2->name & RAZOR_ENTRY_MASK))

   466 		return (prop1->name >> 30) - (prop2->name >> 30);

   467 	else

   468 		return strcmp(&pool[prop1->name & RAZOR_ENTRY_MASK],

   469 			      &pool[prop2->name & RAZOR_ENTRY_MASK]);

   470 }

   472 static uint32_t *

   473 uniqueify_properties(struct razor_set *set)

   474 {

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

   476 	struct array *pkgs, *p;

   477 	struct list_head *r;

   478 	uint32_t *map, *rmap;

   479 	int i, count, unique;

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

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

   483 			      count,

   484 			      sizeof(struct razor_property),

   485 			      compare_properties,

   486 			      set);

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

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

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

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

   492 		if (rp->name != up->name || rp->relation != up->relation ||

   493 		    rp->version != up->version) {

   494 			up++;

   495 			up->name = rp->name;

   496 			up->relation = rp->relation;

   497 			up->version = rp->version;

   498 		}

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

   501 		rmap[map[i]] = unique;

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

   503 		*r = rp->packages;

   504 	}

   505 	free(map);

   507 	up++;

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

   509 	rp_end = up;

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

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

   512 		array_release(p);

   513 	}

   515 	free(pkgs);

   517 	return rmap;

   518 }

   520 static int

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

   522 {

   523 	const struct import_entry *e1 = p1;

   524 	const struct import_entry *e2 = p2;

   526 	return strcmp(e1->name, e2->name);

   527 }

   529 static void

   530 count_entries(struct import_directory *d)

   531 {

   532 	struct import_directory *p, *end;

   534 	p = d->files.data;

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

   536 	d->count = 0;

   537 	while (p < end) {

   538 		count_entries(p);

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

   540 		p++;

   541 	}

   542 }

   544 static void

   545 serialize_files(struct razor_set *set,

   546 		struct import_directory *d, struct array *array)

   547 {

   548 	struct import_directory *p, *end;

   549 	struct razor_entry *e = NULL;

   550 	uint32_t s;

   552 	p = d->files.data;

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

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

   555 	while (p < end) {

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

   557 		e->name = p->name;

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

   559 		s += p->count;

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

   562 		array_release(&p->packages);

   563 		p++;

   564 	}

   565 	if (e != NULL)

   566 		e->name |= RAZOR_ENTRY_LAST;

   568 	p = d->files.data;

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

   570 	while (p < end) {

   571 		serialize_files(set, p, array);

   572 		p++;

   573 	}

   574 }

   576 static void

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

   578 {

   579 	struct razor_property *p, *end;

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

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

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

   584 }

   586 static void

   587 build_file_tree(struct razor_importer *importer)

   588 {

   589 	int count, i, length;

   590 	struct import_entry *filenames;

   591 	char *f, *end;

   592 	uint32_t name, *r;

   593 	char dirname[256];

   594 	struct import_directory *d, root;

   595 	struct razor_entry *e;

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

   598 	qsort_with_data(importer->files.data,

   599 			count,

   600 			sizeof (struct import_entry),

   601 			compare_filenames,

   602 			NULL);

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

   605 	array_init(&root.files);

   606 	array_init(&root.packages);

   607 	root.last = NULL;

   609 	filenames = importer->files.data;

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

   611 		f = filenames[i].name;

   612 		if (*f != '/')

   613 			continue;

   614 		f++;

   616 		d = &root;

   617 		while (*f) {

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

   619 			if (end == NULL)

   620 				end = f + strlen(f);

   621 			length = end - f;

   622 			memcpy(dirname, f, length);

   623 			dirname[length] ='\0';

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

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

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

   627 				d->last->name = name;

   628 				d->last->last = NULL;

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

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

   631 			}

   632 			d = d->last;

   633 			f = end + 1;

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

   635 				break;

   636 		}

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

   639 		*r = filenames[i].package;

   640 		free(filenames[i].name);

   641 	}

   643 	count_entries(&root);

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

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

   647 	e->name = root.name | RAZOR_ENTRY_LAST;

   648 	e->start = 1;

   649 	list_set_empty(&e->packages);

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

   653 	array_release(&importer->files);

   654 }

   656 static void

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

   658 {

   659 	struct razor_package *p, *packages;

   660 	struct array *pkgs;

   661 	struct razor_entry *e, *end;

   662 	struct list *r;

   663 	uint32_t *q;

   664 	int i, count;

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

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

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

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

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

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

   673 		while (r) {

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

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

   676 			r = list_next(r);

   677 		}

   678 	}

   680 	packages = set->packages.data;

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

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

   683 		array_release(&pkgs[i]);

   684 	}

   685 	free(pkgs);

   686 }

   688 struct razor_set *

   689 razor_importer_finish(struct razor_importer *importer)

   690 {

   691 	struct razor_set *set;

   692 	uint32_t *map, *rmap;

   693 	int i, count;

   695 	map = uniqueify_properties(importer->set);

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

   697 	free(map);

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

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

   701 			      count,

   702 			      sizeof(struct razor_package),

   703 			      compare_packages,

   704 			      importer->set);

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

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

   708 		rmap[map[i]] = i;

   709 	free(map);

   711 	build_file_tree(importer);

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

   713 	build_package_file_lists(importer->set, rmap);

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

   715 	free(rmap);

   717 	set = importer->set;

   718 	hashtable_release(&importer->table);

   719 	free(importer);

   721 	return set;

   722 }

   724 struct razor_package_iterator {

   725 	struct razor_set *set;

   726 	struct razor_package *package, *end;

   727 	struct list *index;

   728 };

   730 struct razor_package_iterator *

   731 razor_package_iterator_create_with_index(struct razor_set *set,

   732 					 struct list *index)

   733 {

   734 	struct razor_package_iterator *pi;

   736 	pi = zalloc(sizeof *pi);

   737 	pi->set = set;

   738 	pi->index = index;

   740 	return pi;

   741 }

   743 struct razor_package_iterator *

   744 razor_package_iterator_create(struct razor_set *set)

   745 {

   746 	struct razor_package_iterator *pi;

   748 	pi = zalloc(sizeof *pi);

   749 	pi->set = set;

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

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

   753 	return pi;

   754 }

   756 struct razor_package_iterator *

   757 razor_package_iterator_create_for_property(struct razor_set *set,

   758 					   struct razor_property *property)

   759 {

   760 	struct list *index;

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

   763 	return razor_package_iterator_create_with_index(set, index);

   764 }

   766 int

   767 razor_package_iterator_next(struct razor_package_iterator *pi,

   768 			    struct razor_package **package,

   769 			    const char **name, const char **version)

   770 {

   771 	char *pool;

   772 	int valid;

   773 	struct razor_package *p, *packages;

   775 	if (pi->package) {

   776 		p = pi->package++;

   777 		valid = p < pi->end;

   778 	} else if (pi->index) {

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

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

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

   782 		valid = 1;

   783 	} else

   784 		valid = 0;

   786 	if (valid) {

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

   788 		*package = p;

   789 		*name = &pool[p->name & RAZOR_ENTRY_MASK];

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

   791 	} else {

   792 		*package = NULL;

   793 	}

   795 	return valid;

   796 }

   798 void

   799 razor_package_iterator_destroy(struct razor_package_iterator *pi)

   800 {

   801 	free(pi);

   802 }

   804 struct razor_package *

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

   806 {

   807 	struct razor_package_iterator *pi;

   808 	struct razor_package *p;

   809 	const char *name, *version;

   811 	pi = razor_package_iterator_create(set);

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

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

   814 			break;

   815 	}

   816 	razor_package_iterator_destroy(pi);

   818 	return p;

   819 }

   821 struct razor_property_iterator {

   822 	struct razor_set *set;

   823 	struct razor_property *property, *end;

   824 	struct list *index;

   825 };

   827 struct razor_property_iterator *

   828 razor_property_iterator_create(struct razor_set *set,

   829 			       struct razor_package *package)

   830 {

   831 	struct razor_property_iterator *pi;

   833 	pi = zalloc(sizeof *pi);

   834 	pi->set = set;

   836 	if (package) {

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

   838 				       &set->property_pool);

   839 	} else {

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

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

   842 	}

   844 	return pi;

   845 }

   847 int

   848 razor_property_iterator_next(struct razor_property_iterator *pi,

   849 			     struct razor_property **property,

   850 			     const char **name,

   851 			     enum razor_version_relation *relation,

   852 			     const char **version,

   853 			     enum razor_property_type *type)

   854 {

   855 	char *pool;

   856 	int valid;

   857 	struct razor_property *p, *properties;

   859 	if (pi->property) {

   860 		p = pi->property++;

   861 		valid = p < pi->end;

   862 	} else if (pi->index) {

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

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

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

   866 		valid = 1;

   867 	} else

   868 		valid = 0;

   870 	if (valid) {

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

   872 		*property = p;

   873 		*name = &pool[p->name & RAZOR_ENTRY_MASK];

   874 		*relation = p->relation;

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

   876 		*type = p->name >> 30;

   877 	} else {

   878 		*property = NULL;

   879 	}

   881 	return valid;

   882 }

   884 void

   885 razor_property_iterator_destroy(struct razor_property_iterator *pi)

   886 {

   887 	free(pi);

   888 }

   890 static struct razor_entry *

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

   892 {

   893 	struct razor_entry *e;

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

   895 	int len;

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

   898 	do {

   899 		n = pool + (e->name & RAZOR_ENTRY_MASK);

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

   901 			return e;

   902 		len = strlen(n);

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

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

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

   906 		}

   907 	} while (((e++)->name & RAZOR_ENTRY_LAST) == 0);

   909 	return NULL;

   910 }

   912 static void

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

   914 	 const char *prefix, const char *pattern)

   915 {

   916 	struct razor_entry *e;

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

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

   920 	do {

   921 		n = pool + (e->name & RAZOR_ENTRY_MASK);

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

   923 			continue;

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

   925 	} while (((e++)->name & RAZOR_ENTRY_LAST) == 0);

   926 }

   928 void

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

   930 {

   931 	struct razor_entry *e;

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

   934 	if (pattern == NULL)

   935 		pattern = "/";

   937 	strcpy(buffer, pattern);

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

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

   940 		base = NULL;

   941 	} else {

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

   943 		if (p) {

   944 			*p = '\0';

   945 			base = p + 1;

   946 		} else {

   947 			base = NULL;

   948 		}

   949 	}

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

   951 	if (e->start != 0)

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

   953 }

   955 struct razor_package_iterator *

   956 razor_package_iterator_create_for_file(struct razor_set *set,

   957 				       const char *filename)

   958 {

   959 	struct razor_entry *entry;

   960 	struct list *index;

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

   963 	if (entry == NULL)

   964 		return NULL;

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

   967 	return razor_package_iterator_create_with_index(set, index);

   968 }

   970 static struct list *

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

   972 		   struct razor_entry *dir, uint32_t end,

   973 		   char *prefix)

   974 {

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

   976 	uint32_t next, file;

   977 	char *pool;

   978 	int len;

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

   981 	pool = set->string_pool.data;

   983 	e = entries + dir->start;

   984 	do {

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

   986 			printf("%s/%s\n", prefix,

   987 			       pool + (e->name & RAZOR_ENTRY_MASK));

   988 			r = list_next(r);

   989 			if (!r)

   990 				return NULL;

   991 			if (r->data >= end)

   992 				return r;

   993 		}

   994 	} while (!((e++)->name & RAZOR_ENTRY_LAST));

   996 	e = entries + dir->start;

   997 	do {

   998 		if (e->start == 0)

   999 			continue;

  1001 		if (e->name & RAZOR_ENTRY_LAST)

  1002 			next = end;

  1003 		else {

  1004 			f = e + 1;

  1005 			while (f->start == 0 && !(f->name & RAZOR_ENTRY_LAST))

  1006 				f++;

  1007 			if (f->start == 0)

  1008 				next = end;

  1009 			else

  1010 				next = f->start;

  1011 		}

  1013 		file = r->data;

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

  1015 			len = strlen(prefix);

  1016 			prefix[len] = '/';

  1017 			strcpy(prefix + len + 1,

  1018 			       pool + (e->name & RAZOR_ENTRY_MASK));

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

  1020 			prefix[len] = '\0';

  1021 		}

  1022 	} while (!((e++)->name & RAZOR_ENTRY_LAST) && r != NULL);

  1024 	return r;

  1025 }

  1027 void

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

  1029 {

  1030 	struct razor_package *package;

  1031 	struct list *r;

  1032 	uint32_t end;

  1033 	char buffer[512];

  1035 	package = razor_set_get_package(set, name);

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

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

  1039 	buffer[0] = '\0';

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

  1041 }

  1043 static void

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

  1045 {

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

  1047 	uint32_t *u;

  1048 	char *pool;

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

  1051 	pool = set->string_pool.data;

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

  1054 		if (r->name >> 30 != RAZOR_PROPERTY_REQUIRES)

  1055 			continue;

  1057 		if ((r->name & RAZOR_ENTRY_MASK) != (p->name & RAZOR_ENTRY_MASK)) {

  1058 			p = r;

  1059 			while (p < end && p->name == r->name)

  1060 				p++;

  1061 		}

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

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

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

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

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

  1068 		 * does.*/

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

  1070 			p++;

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

  1073 		 * etc) to properly determine if a requires is

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

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

  1077 		if (p == end ||

  1078 		    (p->name >> 30) != RAZOR_PROPERTY_PROVIDES ||

  1079 		    (r->name & RAZOR_ENTRY_MASK) != (p->name & RAZOR_ENTRY_MASK) ||

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

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

  1082 			if (pool[r->name & RAZOR_ENTRY_MASK] == '/')

  1083 				continue;

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

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

  1086 		}

  1087 	}

  1088 }

  1090 void

  1091 razor_set_list_unsatisfied(struct razor_set *set)

  1092 {

  1093 	struct array unsatisfied;

  1094 	struct razor_property *properties, *r;

  1095 	uint32_t *u, *end;

  1096 	char *pool;

  1098 	array_init(&unsatisfied);

  1099 	razor_set_validate(set, &unsatisfied);

  1101 	end = unsatisfied.data + unsatisfied.size;

  1102 	properties = set->properties.data;

  1103 	pool = set->string_pool.data;

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

  1106 		r = properties + *u;

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

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

  1109 			       &pool[r->name & RAZOR_ENTRY_MASK]);

  1110 		else

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

  1112 			       &pool[r->name & RAZOR_ENTRY_MASK],

  1113 			       &pool[r->version]);

  1114 	}

  1116 	array_release(&unsatisfied);

  1117 }

  1119 #define UPSTREAM_SOURCE 0x80000000ul

  1120 #define INDEX_MASK 0x00fffffful

  1122 struct source {

  1123 	struct razor_set *set;

  1124 	uint32_t *property_map;

  1125 };

  1127 struct razor_merger {

  1128 	struct razor_set *set;

  1129 	struct hashtable table;

  1130 	struct source source1;

  1131 	struct source source2;

  1132 };

  1134 static struct razor_merger *

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

  1136 {

  1137 	struct razor_merger *merger;

  1138 	int count;

  1139 	size_t size;

  1141 	merger = zalloc(sizeof *merger);

  1142 	merger->set = razor_set_create();

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

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

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

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

  1148 	merger->source1.set = set1;

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

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

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

  1153 	merger->source2.set = set2;

  1155 	return merger;

  1156 }

  1158 static void

  1159 add_package(struct razor_merger *merger,

  1160 	    struct razor_package *package, struct source *source,

  1161 	    uint32_t flags)

  1162 {

  1163 	char *pool;

  1164 	struct list *r;

  1165 	struct razor_package *p;

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

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

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

  1170 	p->name |= flags;

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

  1172 					&pool[package->version]);

  1173 	p->properties = package->properties;

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

  1176 	while (r) {

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

  1178 		r = list_next(r);

  1179 	}

  1180 }

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

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

  1185 static void

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

  1187 {

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

  1189 	struct source *source1, *source2;

  1190 	char *spool, *upool;

  1191 	uint32_t *u, *uend;

  1192 	int cmp;

  1194 	source1 = &merger->source1;

  1195 	source2 = &merger->source2;

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

  1198 	u = packages->data;

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

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

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

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

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

  1206 	while (s < send) {

  1207 		p = upstream_packages + *u;

  1209 		if (u < uend)

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

  1211 		if (u >= uend || cmp < 0) {

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

  1213 			s++;

  1214 		} else if (cmp == 0) {

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

  1216 			s++;

  1217 			u++;

  1218 		} else {

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

  1220 			u++;

  1221 		}

  1222 	}

  1223 }

  1225 static uint32_t

  1226 add_property(struct razor_merger *merger,

  1227 	     const char *name, enum razor_version_relation relation,

  1228 	     const char *version, int type)

  1229 {

  1230 	struct razor_property *p;

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

  1233 	p->name = hashtable_tokenize(&merger->table, name) | (type << 30);

  1234 	p->relation = relation;

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

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

  1238 }

  1240 static void

  1241 merge_properties(struct razor_merger *merger)

  1242 {

  1243 	struct razor_property *p1, *p2;

  1244 	struct razor_set *set1, *set2;

  1245 	uint32_t *map1, *map2;

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

  1247 	char *pool1, *pool2;

  1249 	set1 = merger->source1.set;

  1250 	set2 = merger->source2.set;

  1251 	map1 = merger->source1.property_map;

  1252 	map2 = merger->source2.property_map;

  1254 	i = 0;

  1255 	j = 0;

  1256 	pool1 = set1->string_pool.data;

  1257 	pool2 = set2->string_pool.data;

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

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

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

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

  1263 			i++;

  1264 			continue;

  1265 		}

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

  1267 			j++;

  1268 			continue;

  1269 		}

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

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

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

  1273 			cmp = strcmp(&pool1[p1->name & RAZOR_ENTRY_MASK],

  1274 				     &pool2[p2->name & RAZOR_ENTRY_MASK]);

  1275 		else if (i < count1)

  1276 			cmp = -1;

  1277 		else

  1278 			cmp = 1;

  1279 		if (cmp == 0)

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

  1281 		if (cmp == 0)

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

  1283 					 &pool2[p2->version]);

  1284 		if (cmp < 0) {

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

  1286 						 &pool1[p1->name & RAZOR_ENTRY_MASK],

  1287 						 p1->relation,

  1288 						 &pool1[p1->version],

  1289 						 (p1->name >> 30));

  1290 		} else if (cmp > 0) {

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

  1292 						 &pool2[p2->name & RAZOR_ENTRY_MASK],

  1293 						 p2->relation,

  1294 						 &pool2[p2->version],

  1295 						 (p2->name >> 30));

  1296 		} else  {

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

  1298 							     &pool1[p1->name & RAZOR_ENTRY_MASK],

  1299 							     p1->relation,

  1300 							     &pool1[p1->version],

  1301 							     (p1->name >> 30));

  1302 		}

  1303 	}

  1304 }

  1306 static void

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

  1308 		uint32_t *map, struct array *pool)

  1309 {

  1310 	uint32_t r;

  1311 	struct list *p, *q;

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

  1314 	p = list_first(properties, source_pool);

  1315 	while (p) {

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

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

  1318 		q->flags = p->flags;

  1319 		p = list_next(p);

  1320 	}

  1322 	list_set_ptr(properties, r);

  1323 }

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

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

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

  1328  * the arrays for their properties. */

  1329 static void

  1330 rebuild_package_lists(struct razor_set *set)

  1331 {

  1332 	struct array *pkgs, *a;

  1333 	struct razor_package *pkg, *pkg_end;

  1334 	struct razor_property *prop, *prop_end;

  1335 	struct array *pool;

  1336 	struct list *r;

  1337 	uint32_t *q;

  1338 	int count;

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

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

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

  1343 	pool = &set->property_pool;

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

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

  1347 		while (r) {

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

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

  1350 			r = list_next(r);

  1351 		}

  1352 	}

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

  1355 	a = pkgs;

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

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

  1358 		array_release(a);

  1359 	}

  1360 	free(pkgs);

  1361 }

  1363 struct razor_set *

  1364 razor_merger_finish(struct razor_merger *merger)

  1365 {

  1366 	struct razor_set *result;

  1368 	result = merger->set;

  1369 	hashtable_release(&merger->table);

  1370 	free(merger);

  1372 	return result;

  1373 }

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

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

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

  1378  * enforce validity of the resulting package set.

  1379  *

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

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

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

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

  1384  */

  1385 struct razor_set *

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

  1387 	      struct array *packages)

  1388 {

  1389 	struct razor_merger *merger;

  1390 	struct razor_package *p, *pend;

  1392 	merger = razor_merger_create(set, upstream);

  1394 	merge_packages(merger, packages);

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

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

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

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

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

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

  1402 	 * property list for both sets. */

  1404 	merge_properties(merger);

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

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

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

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

  1411 		struct source *src;

  1413 		if (p->name & UPSTREAM_SOURCE)

  1414 			src = &merger->source2;

  1415 		else

  1416 			src = &merger->source1;

  1418 		emit_properties(&p->properties,

  1419 				&src->set->property_pool,

  1420 				src->property_map,

  1421 				&merger->set->property_pool);

  1422 		p->name &= INDEX_MASK;

  1423 	}

  1425 	rebuild_package_lists(merger->set);

  1427 	return razor_merger_finish(merger);

  1428 }

  1430 void

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

  1432 		  struct razor_set *upstream, struct array *list)

  1433 {

  1434 	struct razor_property *requires, *r;

  1435 	struct razor_property *p, *pend;

  1436 	uint32_t *u, *end, *pkg;

  1437 	struct array *package_pool;

  1438 	char *pool, *upool;

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

  1441 	requires = set->properties.data;

  1442 	pool = set->string_pool.data;

  1444 	p = upstream->properties.data;

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

  1446 	upool = upstream->string_pool.data;

  1447 	package_pool = &upstream->package_pool;

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

  1450 		r = requires + *u;

  1452 		while (p < pend &&

  1453 		       strcmp(&pool[r->name & RAZOR_ENTRY_MASK],

  1454 			      &upool[p->name & RAZOR_ENTRY_MASK]) > 0 &&

  1455 		       (p->name >> 30) != RAZOR_PROPERTY_PROVIDES)

  1456 			p++;

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

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

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

  1460 			p++;

  1462 		if (p == pend ||

  1463 		    strcmp(&pool[r->name & RAZOR_ENTRY_MASK],

  1464 			   &upool[p->name & RAZOR_ENTRY_MASK]) != 0 ||

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

  1466 			/* Do we need to track unsatisfiable requires

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

  1468 			 * razor_set_validate() at the end? */

  1469 		} else {

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

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

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

  1473 		}

  1474 	}

  1475 }

  1477 static void

  1478 find_packages(struct razor_set *set,

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

  1480 {

  1481 	struct razor_package_iterator *pi;

  1482 	struct razor_package *p, *packages;

  1483 	const char *name, *version;

  1484 	uint32_t *r;

  1485 	int i;

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

  1488 	pi = razor_package_iterator_create(set);

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

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

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

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

  1494 				*r = p - packages;

  1495 				break;

  1496 			}

  1497 		}

  1498 	}

  1500 	razor_package_iterator_destroy(pi);

  1501 }

  1503 static void

  1504 find_all_packages(struct razor_set *set,

  1505 		  struct razor_set *upstream, struct array *list)

  1506 {

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

  1508 	uint32_t *r;

  1509 	char *pool, *upool;

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

  1512 	pool = set->string_pool.data;

  1513 	u = upstream->packages.data;

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

  1515 	upool = upstream->string_pool.data;

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

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

  1519 			u++;

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

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

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

  1523 		}

  1524 	}

  1525 }

  1527 struct razor_set *

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

  1529 		 int count, const char **packages)

  1530 {

  1531 	struct razor_set *new;

  1532 	struct razor_package *upackages;

  1533 	struct array list, unsatisfied;

  1534 	char *pool;

  1535 	uint32_t *u, *end;

  1536 	int total = 0;

  1538 	array_init(&list);

  1539 	if (count > 0)

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

  1541 	else

  1542 		find_all_packages(set, upstream, &list);

  1544 	end = list.data + list.size;

  1545 	upackages = upstream->packages.data;

  1546 	pool = upstream->string_pool.data;

  1547 	total += list.size / sizeof *u;

  1549 	while (list.size > 0) {

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

  1551 		array_release(&list);

  1552 		razor_set_destroy(set);

  1553 		set = new;

  1555 		array_init(&unsatisfied);

  1556 		razor_set_validate(new, &unsatisfied);

  1557 		array_init(&list);

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

  1559 		array_release(&unsatisfied);

  1561 		end = list.data + list.size;

  1562 		upackages = upstream->packages.data;

  1563 		pool = upstream->string_pool.data;

  1564 		total += list.size / sizeof *u;

  1565 	}

  1567 	array_release(&list);

  1569 	return set;

  1570 }

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

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

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

  1575  **/

  1577 void

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

  1579 	       razor_package_callback_t callback, void *data)

  1580 {

  1581 	struct razor_package_iterator *pi1, *pi2;

  1582 	struct razor_package *p1, *p2;

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

  1584 	int res;

  1586 	pi1 = razor_package_iterator_create(set);

  1587 	pi2 = razor_package_iterator_create(upstream);

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

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

  1592 	while (p1 || p2) {

  1593 		if (p1 && p2) {

  1594 			res = strcmp(name1, name2);

  1595 			if (res == 0)

  1596 				res = versioncmp(version1, version2);

  1597 		} else {

  1598 			res = 0;

  1599 		}

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

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

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

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

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

  1607 			razor_package_iterator_next(pi1, &p1,

  1608 						    &name1, &version1);

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

  1610 			razor_package_iterator_next(pi2, &p2,

  1611 						    &name2, &version2);

  1612 	}

  1614 	razor_package_iterator_destroy(pi1);

  1615 	razor_package_iterator_destroy(pi2);

  1616 }

author	Dan Winship <danw@gnome.org>
	Mon Feb 11 09:50:17 2008 -0500 (2008-02-11)
changeset 118	832743d47157
parent 116	4ec6e2a55c34
child 119	66998d6a1765
permissions	-rw-r--r--