razor: razor.c@7bc11dfb4bbd

     1 #define _GNU_SOURCE

     3 #include <stdlib.h>

     4 #include <stddef.h>

     5 #include <stdio.h>

     6 #include <string.h>

     7 #include <sys/types.h>

     8 #include <sys/stat.h>

     9 #include <sys/mman.h>

    10 #include <unistd.h>

    11 #include <fcntl.h>

    12 #include <errno.h>

    13 #include <ctype.h>

    14 #include <fnmatch.h>

    16 #include "razor.h"

    18 struct array {

    19 	void *data;

    20 	int size, alloc;

    21 };

    23 struct razor_set_section {

    24 	unsigned int type;

    25 	unsigned int offset;

    26 	unsigned int size;

    27 };

    29 struct razor_set_header {

    30 	unsigned int magic;

    31 	unsigned int version;

    32 	struct razor_set_section sections[0];

    33 };

    35 #define RAZOR_MAGIC 0x7a7a7a7a

    36 #define RAZOR_VERSION 1

    38 #define RAZOR_ENTRY_LAST	0x80000000ul

    39 #define RAZOR_IMMEDIATE		0x80000000ul

    40 #define RAZOR_ENTRY_MASK	0x00fffffful

    42 #define RAZOR_STRING_POOL	0

    43 #define RAZOR_PACKAGES		1

    44 #define RAZOR_PROPERTIES	2

    45 #define RAZOR_FILES		3

    46 #define RAZOR_PACKAGE_POOL	4

    47 #define RAZOR_PROPERTY_POOL	5

    48 #define RAZOR_FILE_POOL		6

    50 struct razor_package {

    51 	unsigned long name;

    52 	unsigned long version;

    53 	unsigned long properties;

    54 	unsigned long files;

    55 };

    57 struct razor_property {

    58 	unsigned long name;

    59 	unsigned long version;

    60 	unsigned long packages;

    61 };

    63 struct razor_entry {

    64 	unsigned long name;

    65 	unsigned long start;

    66 	unsigned long packages;

    67 };

    69 struct razor_set {

    70 	struct array string_pool;

    71  	struct array packages;

    72  	struct array properties;

    73  	struct array files;

    74 	struct array package_pool;

    75  	struct array property_pool;

    76  	struct array file_pool;

    77 	struct razor_set_header *header;

    78 };

    80 struct import_entry {

    81 	unsigned long package;

    82 	char *name;

    83 };

    85 struct import_directory {

    86 	unsigned long name, count;

    87 	struct array files;

    88 	struct array packages;

    89 	struct import_directory *last;

    90 };

    92 struct hashtable {

    93 	struct array buckets;

    94 	struct array *pool;

    95 };

    97 struct razor_importer {

    98 	struct razor_set *set;

    99 	struct hashtable table;

   100 	struct razor_package *package;

   101 	struct array properties;

   102 	struct array files;

   103 };

   105 static void

   106 array_init(struct array *array)

   107 {

   108 	memset(array, 0, sizeof *array);

   109 }

   111 static void

   112 array_release(struct array *array)

   113 {

   114 	free(array->data);

   115 }

   117 static void *

   118 array_add(struct array *array, int size)

   119 {

   120 	int alloc;

   121 	void *data, *p;

   123 	if (array->alloc > 0)

   124 		alloc = array->alloc;

   125 	else

   126 		alloc = 16;

   128 	while (alloc < array->size + size)

   129 		alloc *= 2;

   131 	if (array->alloc < alloc) {

   132 		data = realloc(array->data, alloc);

   133 		if (data == NULL)

   134 			return 0;

   135 		array->data = data;

   136 		array->alloc = alloc;

   137 	}

   139 	p = array->data + array->size;

   140 	array->size += size;

   142 	return p;

   143 }

   145 static int

   146 write_to_fd(int fd, void *p, size_t size)

   147 {

   148 	int rest, len;

   150 	rest = size;

   151 	while (rest > 0) {

   152 		len = write(fd, p, rest);

   153 		if (len < 0)

   154 			return -1;

   155 		rest -= len;

   156 	}

   158 	return 0;

   159 }

   161 static void *

   162 zalloc(size_t size)

   163 {

   164 	void *p;

   166 	p = malloc(size);

   167 	memset(p, 0, size);

   169 	return p;

   170 }

   172 struct razor_set_section razor_sections[] = {

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

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

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

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

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

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

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

   180 };

   182 struct razor_set *

   183 razor_set_create(void)

   184 {

   185 	return zalloc(sizeof(struct razor_set));

   186 }

   188 struct razor_set *

   189 razor_set_open(const char *filename)

   190 {

   191 	struct razor_set *set;

   192 	struct razor_set_section *s;

   193 	struct stat stat;

   194 	struct array *array;

   195 	int fd;

   197 	set = zalloc(sizeof *set);

   198 	fd = open(filename, O_RDONLY);

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

   200 		return NULL;

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

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

   203 		free(set);

   204 		return NULL;

   205 	}

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

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

   209 			continue;

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

   211 			continue;

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

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

   214 		array->size = s->size;

   215 		array->alloc = s->size;

   216 	}

   217 	close(fd);

   219 	return set;

   220 }

   222 void

   223 razor_set_destroy(struct razor_set *set)

   224 {

   225 	unsigned int size;

   226 	struct array *a;

   227 	int i;

   229 	if (set->header) {

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

   231 			;

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

   233 		munmap(set->header, size);

   234 	} else {

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

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

   237 			free(a->data);

   238 		}

   239 	}

   241 	free(set);

   242 }

   244 int

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

   246 {

   247 	char data[4096];

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

   249 	struct array *a;

   250 	unsigned long offset;

   251 	int i, fd;

   253 	memset(data, 0, sizeof data);

   254 	header->magic = RAZOR_MAGIC;

   255 	header->version = RAZOR_VERSION;

   256 	offset = sizeof data;

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

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

   260 			continue;

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

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

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

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

   265 		offset += (a->size + 4095) & ~4095;

   266 	}

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

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

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

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

   273 	if (fd < 0)

   274 		return -1;

   276 	write_to_fd(fd, data, sizeof data);

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

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

   279 			continue;

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

   281 		write_to_fd(fd, a->data, (a->size + 4095) & ~4095);

   282 	}

   284 	close(fd);

   286 	return 0;

   287 }

   289 static unsigned int

   290 hash_string(const char *key)

   291 {

   292 	const char *p;

   293 	unsigned int hash = 0;

   295 	for (p = key; *p; p++)

   296 		hash = (hash * 617) ^ *p;

   298 	return hash;

   299 }

   301 static unsigned long

   302 hashtable_lookup(struct hashtable *table, const char *key)

   303 {

   304 	unsigned int mask, start, i;

   305 	unsigned long *b;

   306 	char *pool;

   308 	pool = table->pool->data;

   309 	mask = table->buckets.alloc - 1;

   310 	start = hash_string(key) * sizeof(unsigned long);

   312 	for (i = 0; i < table->buckets.alloc; i += sizeof *b) {

   313 		b = table->buckets.data + ((start + i) & mask);

   315 		if (*b == 0)

   316 			return 0;

   318 		if (strcmp(key, &pool[*b]) == 0)

   319 			return *b;

   320 	}

   322 	return 0;

   323 }

   325 static unsigned long

   326 add_to_string_pool(struct hashtable *table, const char *key)

   327 {

   328 	int len;

   329 	char *p;

   331 	len = strlen(key) + 1;

   332 	p = array_add(table->pool, len);

   333 	memcpy(p, key, len);

   335 	return p - (char *) table->pool->data;

   336 }

   338 static unsigned long

   339 add_to_property_pool(struct array *pool, struct array *properties)

   340 {

   341 	unsigned long  *p;

   343 	p = array_add(pool, properties->size);

   344 	memcpy(p, properties->data, properties->size);

   345 	p[properties->size / sizeof *p - 1] |= RAZOR_IMMEDIATE;

   347 	return p - (unsigned long *) pool->data;

   348 }

   350 static void

   351 do_insert(struct hashtable *table, unsigned long value)

   352 {

   353 	unsigned int mask, start, i;

   354 	unsigned long *b;

   355 	const char *key;

   357 	key = (char *) table->pool->data + value;

   358 	mask = table->buckets.alloc - 1;

   359 	start = hash_string(key) * sizeof(unsigned long);

   361 	for (i = 0; i < table->buckets.alloc; i += sizeof *b) {

   362 		b = table->buckets.data + ((start + i) & mask);

   363 		if (*b == 0) {

   364 			*b = value;

   365 			break;

   366 		}

   367 	}

   368 }

   370 static unsigned long

   371 hashtable_insert(struct hashtable *table, const char *key)

   372 {

   373 	unsigned long value, *buckets, *b, *end;

   374 	int alloc;

   376 	alloc = table->buckets.alloc;

   377 	array_add(&table->buckets, 4 * sizeof *buckets);

   378 	if (alloc != table->buckets.alloc) {

   379 		end = table->buckets.data + alloc;

   380 		memset(end, 0, table->buckets.alloc - alloc);

   381 		for (b = table->buckets.data; b < end; b++) {

   382 			value = *b;

   383 			if (value != 0) {

   384 				*b = 0;

   385 				do_insert(table, value);

   386 			}

   387 		}

   388 	}

   390 	value = add_to_string_pool(table, key);

   391 	do_insert (table, value);

   393 	return value;

   394 }

   396 static void

   397 hashtable_init(struct hashtable *table, struct array *pool)

   398 {

   399 	array_init(&table->buckets);

   400 	table->pool = pool;

   401 }

   403 static void

   404 hashtable_release(struct hashtable *table)

   405 {

   406 	array_release(&table->buckets);

   407 }

   409 static unsigned long

   410 hashtable_tokenize(struct hashtable *table, const char *string)

   411 {

   412 	unsigned long token;

   414 	if (string == NULL)

   415 		string = "";

   417 	token = hashtable_lookup(table, string);

   418 	if (token != 0)

   419 		return token;

   421 	return hashtable_insert(table, string);

   422 }

   424 static unsigned long

   425 razor_importer_tokenize(struct razor_importer *importer, const char *string)

   426 {

   427 	return hashtable_tokenize(&importer->table, string);

   428 }

   430 void

   431 razor_importer_begin_package(struct razor_importer *importer,

   432 			     const char *name, const char *version)

   433 {

   434 	struct razor_package *p;

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

   437 	p->name = razor_importer_tokenize(importer, name);

   438 	p->version = razor_importer_tokenize(importer, version);

   440 	importer->package = p;

   441 	array_init(&importer->properties);

   442 }

   444 void

   445 razor_importer_finish_package(struct razor_importer *importer)

   446 {

   447 	struct razor_package *p;

   449 	p = importer->package;

   450 	p->properties = add_to_property_pool(&importer->set->property_pool,

   451 					     &importer->properties);

   453 	array_release(&importer->properties);

   454 }

   456 void

   457 razor_importer_add_property(struct razor_importer *importer,

   458 			    const char *name, const char *version,

   459 			    enum razor_property_type type)

   460 {

   461 	struct razor_property *p;

   462 	unsigned long *r;

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

   465 	p->name = razor_importer_tokenize(importer, name) | (type << 30);

   466 	p->version = razor_importer_tokenize(importer, version);

   467 	p->packages = importer->package -

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

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

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

   472 }

   474 void

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

   476 {

   477 	struct import_entry *e;

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

   481 	e->package = importer->package -

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

   483 	e->name = strdup(name);

   484 }

   486 struct razor_importer *

   487 razor_importer_new(void)

   488 {

   489 	struct razor_importer *importer;

   491 	importer = zalloc(sizeof *importer);

   492 	importer->set = razor_set_create();

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

   495 	return importer;

   496 }

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

   499 void

   500 razor_importer_destroy(struct razor_importer *importer)

   501 {

   502 	/* FIXME: write this */

   503 }

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

   507 					const void *p,

   508 					void *data);

   510 struct qsort_context {

   511 	size_t size;

   512 	compare_with_data_func_t compare;

   513 	void *data;

   514 };

   516 static void

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

   518 {

   519 	char buffer[size];

   521 	memcpy(buffer, p1, size);

   522 	memcpy(p1, p2, size);

   523 	memcpy(p2, buffer, size);

   524 }

   526 static void

   527 __qsort_with_data(void *base, size_t nelem, unsigned long *map,

   528 		  struct qsort_context *ctx)

   529 {

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

   531 	unsigned long *mp, *mstart, *mend, tmp;

   532 	int left, right, result;

   533 	size_t size = ctx->size;

   535 	p = base;

   536 	start = base;

   537 	end = base + nelem * size;

   538 	mp = map;

   539 	mstart = map;

   540 	mend = map + nelem;

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

   543 	while (p < end) {

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

   545 		if (result < 0) {

   546 			qsort_swap(p, start, size);

   547 			tmp = *mp;

   548 			*mp = *mstart;

   549 			*mstart = tmp;

   550 			if (start == pivot)

   551 				pivot = p;

   552 			start += size;

   553 			mstart++;

   554 			p += size;

   555 			mp++;

   556 		} else if (result == 0) {

   557 			p += size;

   558 			mp++;

   559 		} else {

   560  			end -= size;

   561 			mend--;

   562 			qsort_swap(p, end, size);

   563 			tmp = *mp;

   564 			*mp = *mend;

   565 			*mend = tmp;

   566 			if (end == pivot)

   567 				pivot = p;

   568 		}

   569 	}

   571 	left = (start - base) / size;

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

   573 	if (left > 1)

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

   575 	if (right > 1)

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

   577 }

   579 unsigned long *

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

   581 		compare_with_data_func_t compare, void *data)

   582 {

   583 	struct qsort_context ctx;

   584 	unsigned long *map;

   585 	int i;

   587 	if (nelem == 0)

   588 		return NULL;

   590 	ctx.size = size;

   591 	ctx.compare = compare;

   592 	ctx.data = data;

   594 	map = malloc(nelem * sizeof (unsigned long));

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

   596 		map[i] = i;

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

   600 	return map;

   601 }

   603 static int

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

   605 {

   606 	const char *p1, *p2;

   607 	long n1, n2;

   608 	int res;

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

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

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

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

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

   616 	if (res < 0) {

   617 		n1 = 0;

   618 		p1 = s1;

   619 		p2++;

   620 	} else if (res > 0) {

   621 		p1++;

   622 		n2 = 0;

   623 		p2 = s2;

   624 	}

   626 	if (n1 != n2)

   627 		return n1 - n2;

   628 	while (*p1 && *p2) {

   629 		if (*p1 != *p2)

   630 			return *p1 - *p2;

   631 		p1++;

   632 		p2++;

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

   634 			return versioncmp(p1, p2);

   635 	}

   637 	return *p1 - *p2;

   638 }

   641 static int

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

   643 {

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

   645 	struct razor_set *set = data;

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

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

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

   650 	else

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

   652 }

   654 static int

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

   656 {

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

   658 	struct razor_set *set = data;

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

   661 	if (prop1->name == prop2->name)

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

   663 				  &pool[prop2->version]);

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

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

   666 	else

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

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

   669 }

   671 static unsigned long *

   672 uniqueify_properties(struct razor_set *set)

   673 {

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

   675 	struct array *pkgs, *p;

   676 	unsigned long *map, *rmap, *r;

   677 	int i, count, unique;

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

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

   681 			      count,

   682 			      sizeof(struct razor_property),

   683 			      compare_properties,

   684 			      set);

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

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

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

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

   690 		if (rp->name != up->name || rp->version != up->version) {

   691 			up++;

   692 			up->name = rp->name;

   693 			up->version = rp->version;

   694 		}

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

   697 		rmap[map[i]] = unique;

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

   699 		*r = rp->packages;

   700 	}

   701 	free(map);

   703 	up++;

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

   705 	rp_end = up;

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

   707 		if (p->size / sizeof *r == 1) {

   708 			r = p->data;

   709 			rp->packages = *r | RAZOR_IMMEDIATE;

   710 		} else {

   711 			rp->packages =

   712 				add_to_property_pool(&set->package_pool, p);

   713 		}

   714 		array_release(p);

   715 	}

   717 	free(pkgs);

   719 	return rmap;

   720 }

   722 static void

   723 remap_links(struct array *links, unsigned long *map)

   724 {

   725 	unsigned long *p, *end;

   727 	end = links->data + links->size;

   728 	for (p = links->data; p < end; p++)

   729 		*p = map[*p & RAZOR_ENTRY_MASK] | (*p & ~RAZOR_ENTRY_MASK);

   730 }

   732 static int

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

   734 {

   735 	const struct import_entry *e1 = p1;

   736 	const struct import_entry *e2 = p2;

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

   739 }

   741 static void

   742 count_entries(struct import_directory *d)

   743 {

   744 	struct import_directory *p, *end;

   746 	p = d->files.data;

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

   748 	d->count = 0;

   749 	while (p < end) {

   750 		count_entries(p);

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

   752 		p++;

   753 	}

   754 }

   756 static void

   757 serialize_files(struct razor_set *set,

   758 		struct import_directory *d, struct array *array)

   759 {

   760 	struct import_directory *p, *end;

   761 	struct razor_entry *e = NULL;

   762 	unsigned long s, *r;

   764 	p = d->files.data;

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

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

   767 	while (p < end) {

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

   769 		e->name = p->name;

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

   771 		s += p->count;

   773 		if (p->packages.size == 0) {

   774 			/* FIXME: We need to make sure this is handled

   775 			 * correctly as the empty list. */

   776 			e->packages = 0 | RAZOR_IMMEDIATE;

   777 		} else if (p->packages.size / sizeof *r == 1) {

   778 			r = p->packages.data;

   779 			e->packages = *r | RAZOR_IMMEDIATE;

   780 		} else {

   781 			e->packages = add_to_property_pool(&set->package_pool,

   782 							   &p->packages);

   783 		}

   784 		array_release(&p->packages);

   785 		p++;

   786 	}

   787 	if (e != NULL)

   788 		e->name |= RAZOR_ENTRY_LAST;

   790 	p = d->files.data;

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

   792 	while (p < end) {

   793 		serialize_files(set, p, array);

   794 		p++;

   795 	}

   796 }

   798 static void

   799 remap_property_package_links(struct array *properties, unsigned long *rmap)

   800 {

   801 	struct razor_property *p, *end;

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

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

   805 		if (p->packages & RAZOR_IMMEDIATE)

   806 			p->packages = rmap[p->packages & RAZOR_ENTRY_MASK] |

   807 				RAZOR_IMMEDIATE;

   808 }

   810 static void

   811 build_file_tree(struct razor_importer *importer)

   812 {

   813 	int count, i, length;

   814 	struct import_entry *filenames;

   815 	char *f, *end;

   816 	unsigned long name, *r;

   817 	char dirname[256];

   818 	struct import_directory *d, root;

   819 	struct razor_entry *e;

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

   822 	qsort_with_data(importer->files.data,

   823 			count,

   824 			sizeof (struct import_entry),

   825 			compare_filenames,

   826 			NULL);

   828 	root.name = razor_importer_tokenize(importer, "");

   829 	array_init(&root.files);

   830 	array_init(&root.packages);

   831 	root.last = NULL;

   833 	filenames = importer->files.data;

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

   835 		f = filenames[i].name;

   836 		if (*f != '/')

   837 			continue;

   838 		f++;

   840 		d = &root;

   841 		while (*f) {

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

   843 			if (end == NULL)

   844 				end = f + strlen(f);

   845 			length = end - f;

   846 			memcpy(dirname, f, length);

   847 			dirname[length] ='\0';

   848 			name = razor_importer_tokenize(importer, dirname);

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

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

   851 				d->last->name = name;

   852 				d->last->last = NULL;

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

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

   855 			}

   856 			d = d->last;

   857 			f = end + 1;

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

   859 				break;

   860 		}

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

   863 		*r = filenames[i].package;

   864 		free(filenames[i].name);

   865 	}

   867 	count_entries(&root);

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

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

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

   872 	e->start = 1;

   873 	e->packages = 0;

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

   877 	array_release(&importer->files);

   878 }

   880 static void

   881 build_package_file_lists(struct razor_set *set, unsigned long *rmap)

   882 {

   883 	struct razor_package *p, *packages;

   884 	struct array *pkgs;

   885 	struct razor_entry *e, *end;

   886 	unsigned long *r, *q;

   887 	int i, count;

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

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

   892 	e = set->files.data;

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

   894 	while (e < end) {

   895 		if (e->packages & RAZOR_IMMEDIATE) {

   896 			e->packages = rmap[e->packages & RAZOR_ENTRY_MASK] |

   897 				RAZOR_IMMEDIATE;

   898 			r = &e->packages;

   899 		} else {

   900 			r = (unsigned long *) set->package_pool.data + e->packages;

   901 		}

   903 		while (1) {

   904 			q = array_add(&pkgs[*r & RAZOR_ENTRY_MASK], sizeof *q);

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

   906 			if (*r++ & RAZOR_IMMEDIATE)

   907 				break;

   908 		}

   909 		e++;

   910 	}

   912 	packages = set->packages.data;

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

   914 		packages[i].files =

   915 			add_to_property_pool(&set->file_pool, &pkgs[i]);

   916 		array_release(&pkgs[i]);

   917 	}

   918 	free(pkgs);

   919 }

   921 struct razor_set *

   922 razor_importer_finish(struct razor_importer *importer)

   923 {

   924 	struct razor_set *set;

   925 	unsigned long *map, *rmap;

   926 	int i, count;

   928 	map = uniqueify_properties(importer->set);

   929 	remap_links(&importer->set->property_pool, map);

   930 	free(map);

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

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

   934 			      count,

   935 			      sizeof(struct razor_package),

   936 			      compare_packages,

   937 			      importer->set);

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

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

   941 		rmap[map[i]] = i;

   942 	free(map);

   944 	build_file_tree(importer);

   945 	remap_links(&importer->set->package_pool, rmap);

   946 	build_package_file_lists(importer->set, rmap);

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

   948 	free(rmap);

   950 	set = importer->set;

   951 	hashtable_release(&importer->table);

   952 	free(importer);

   954 	return set;

   955 }

   957 void

   958 razor_set_list(struct razor_set *set, const char *pattern)

   959 {

   960 	struct razor_package *p, *end;

   961 	int with_version = 0;

   962 	char *pool;

   964 	pool = set->string_pool.data;

   965 	end = set->packages.data + set->packages.size;

   966 	for (p = set->packages.data; p < end; p++) {

   967 		if (pattern && fnmatch(pattern, &pool[p->name], 0) != 0)

   968 		    continue;

   969 		if (with_version)

   970 			printf("%s-%s\n", &pool[p->name], &pool[p->version]);

   971 		else

   972 			printf("%s\n", &pool[p->name]);

   973 	}

   974 }

   976 struct razor_set *bsearch_set;

   978 static int

   979 compare_package_name(const void *key, const void *data)

   980 {

   981 	const struct razor_package *p = data;

   982 	char *pool;

   984 	pool = bsearch_set->string_pool.data;

   986 	return strcmp(key, &pool[p->name]);

   987 }

   989 struct razor_package *

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

   991 {

   992 	bsearch_set = set;

   993 	return bsearch(package, set->packages.data,

   994 		       set->packages.size / sizeof(struct razor_package),

   995 		       sizeof(struct razor_package), compare_package_name);

   996 }

   998 static int

   999 compare_property_name(const void *key, const void *data)

  1000 {

  1001 	const struct razor_property *p = data;

  1002 	char *pool;

  1004 	pool = bsearch_set->string_pool.data;

  1006 	return strcmp(key, &pool[p->name & RAZOR_ENTRY_MASK]);

  1007 }

  1009 struct razor_property *

  1010 razor_set_get_property(struct razor_set *set, const char *property)

  1011 {

  1012 	struct razor_property *p, *start;

  1014 	bsearch_set = set;

  1015 	p = bsearch(property, set->properties.data,

  1016 		    set->properties.size / sizeof(struct razor_property),

  1017 		    sizeof(struct razor_property), compare_property_name);

  1019 	start = set->properties.data;

  1020 	while (p > start &&

  1021 	       ((p - 1)->name & RAZOR_ENTRY_MASK) ==

  1022 	       (p->name & RAZOR_ENTRY_MASK))

  1023 		p--;

  1025 	return p;

  1026 }

  1028 void

  1029 razor_set_list_properties(struct razor_set *set, const char *name,

  1030 			  enum razor_property_type type)

  1031 {

  1032 	struct razor_property *p, *properties, *end;

  1033 	struct razor_package *package;

  1034 	unsigned long *r;

  1035 	char *pool;

  1037 	pool = set->string_pool.data;

  1039 	if (name) {

  1040 		package = razor_set_get_package(set, name);

  1041 		r = (unsigned long *) set->property_pool.data +

  1042 			package->properties;

  1043 		properties = set->properties.data;

  1044 		while (1) {

  1045 			p = &properties[*r & RAZOR_ENTRY_MASK];

  1046 			if ((p->name >> 30) != type)

  1047 				goto next;

  1048 			if (pool[p->version] == '\0')

  1049 				printf("%s\n",

  1050 				       &pool[p->name & RAZOR_ENTRY_MASK]);

  1051 			else

  1052 				printf("%s-%s\n",

  1053 				       &pool[p->name & RAZOR_ENTRY_MASK],

  1054 				       &pool[p->version]);

  1055 		next:

  1056 			if (*r++ & RAZOR_IMMEDIATE)

  1057 				break;

  1058 		}

  1059 	} else {

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

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

  1062 			if ((p->name >> 30) != type)

  1063 				continue;

  1064 			if (pool[p->version] == '\0')

  1065 				printf("%s\n",

  1066 				       &pool[p->name & RAZOR_ENTRY_MASK]);

  1067 			else

  1068 				printf("%s-%s\n",

  1069 				       &pool[p->name & RAZOR_ENTRY_MASK],

  1070 				       &pool[p->version]);

  1071 		}

  1072 	}

  1073 }

  1075 void

  1076 razor_set_list_property_packages(struct razor_set *set,

  1077 				 const char *name,

  1078 				 const char *version,

  1079 				 enum razor_property_type type)

  1080 {

  1081 	struct razor_property *property, *end;

  1082 	struct razor_package *p, *packages;

  1083 	unsigned long *r;

  1084 	char *pool;

  1086 	if (name == NULL)

  1087 		return;

  1089 	property = razor_set_get_property(set, name);

  1090 	packages = set->packages.data;

  1091 	pool = set->string_pool.data;

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

  1093 	while (property < end &&

  1094 	       strcmp(name, &pool[property->name & RAZOR_ENTRY_MASK]) == 0) {

  1095 		if (version &&

  1096 		    versioncmp(version, &pool[property->version]) != 0)

  1097 			goto next;

  1098 		if (type != (property->name >> 30))

  1099 			goto next;

  1101 		if (property->packages & RAZOR_IMMEDIATE)

  1102 			r = &property->packages;

  1103 		else

  1104 			r = (unsigned long *)

  1105 				set->package_pool.data + property->packages;

  1106 		while (1) {

  1107 			p = &packages[*r & RAZOR_ENTRY_MASK];

  1108 			printf("%s-%s\n",

  1109 			       &pool[p->name & RAZOR_ENTRY_MASK],

  1110 			       &pool[p->version]);

  1111 			if (*r++ & RAZOR_IMMEDIATE)

  1112 				break;

  1113 		}

  1114 	next:

  1115 		property++;

  1116 	}

  1117 }

  1119 static struct razor_entry *

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

  1121 {

  1122 	struct razor_entry *e;

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

  1124 	int len;

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

  1127 	do {

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

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

  1130 			return e;

  1131 		len = strlen(n);

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

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

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

  1135 		}

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

  1138 	return NULL;

  1139 }

  1141 static void

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

  1143 	 const char *prefix, const char *pattern)

  1144 {

  1145 	struct razor_entry *e;

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

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

  1149 	do {

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

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

  1152 			continue;

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

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

  1155 }

  1157 void

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

  1159 {

  1160 	struct razor_entry *e;

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

  1163 	if (pattern == NULL)

  1164 		pattern = "/";

  1166 	strcpy(buffer, pattern);

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

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

  1169 		base = NULL;

  1170 	} else {

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

  1172 		if (p) {

  1173 			*p = '\0';

  1174 			base = p + 1;

  1175 		} else {

  1176 			base = NULL;

  1177 		}

  1178 	}

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

  1180 	if (e->start != 0)

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

  1182 }

  1184 void

  1185 razor_set_list_file_packages(struct razor_set *set, const char *filename)

  1186 {

  1187 	struct razor_entry *e;

  1188 	struct razor_package *packages, *p;

  1189 	const char *pool;

  1190 	unsigned long *r;

  1192 	e = find_entry(set, set->files.data, filename);

  1193 	if (e == NULL)

  1194 		return;

  1196 	if (e->packages & RAZOR_IMMEDIATE)

  1197 		r = &e->packages;

  1198 	else

  1199 		r = (unsigned long *) set->package_pool.data + e->packages;

  1201 	packages = set->packages.data;

  1202 	pool = set->string_pool.data;

  1203 	while (1) {

  1204 		p = &packages[*r & RAZOR_ENTRY_MASK];

  1205 		printf("%s-%s\n", &pool[p->name], &pool[p->version]);

  1206 		if (*r++ & RAZOR_IMMEDIATE)

  1207 			break;

  1208 	}

  1209 }

  1211 static unsigned long *

  1212 list_package_files(struct razor_set *set, unsigned long *r,

  1213 		   struct razor_entry *dir, unsigned long end,

  1214 		   char *prefix)

  1215 {

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

  1217 	unsigned long next;

  1218 	char *pool;

  1219 	int len;

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

  1222 	pool = set->string_pool.data;

  1224 	e = entries + dir->start;

  1225 	do {

  1226 		if (entries + *r == e) {

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

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

  1229 			r++;

  1230 			if (*r >= end)

  1231 				break;

  1232 		}

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

  1235 	e = entries + dir->start;

  1236 	do {

  1237 		if (e->start == 0)

  1238 			continue;

  1240 		if (e->name & RAZOR_ENTRY_LAST)

  1241 			next = end;

  1242 		else {

  1243 			f = e + 1;

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

  1245 				f++;

  1246 			if (f->start == 0)

  1247 				next = end;

  1248 			else

  1249 				next = f->start;

  1250 		}

  1252 		if (e->start <= *r && *r < next) {

  1253 			len = strlen(prefix);

  1254 			prefix[len] = '/';

  1255 			strcpy(prefix + len + 1,

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

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

  1258 			prefix[len] = '\0';

  1259 			if (*r >= end)

  1260 				break;

  1261 		}

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

  1264 	return r;

  1265 }

  1267 void

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

  1269 {

  1270 	struct razor_package *package;

  1271 	unsigned long *r, end;

  1272 	char buffer[512];

  1274 	package = razor_set_get_package(set, name);

  1276 	r = (unsigned long *) set->file_pool.data + package->files;

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

  1278 	buffer[0] = '\0';

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

  1280 }

  1282 static void

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

  1284 {

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

  1286 	unsigned long *u;

  1287 	char *pool;

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

  1290 	pool = set->string_pool.data;

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

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

  1294 			continue;

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

  1297 			p = r;

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

  1299 				p++;

  1300 		}

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

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

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

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

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

  1307 		 * does.*/

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

  1309 			p++;

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

  1312 		 * etc) to properly determine if a requires is

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

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

  1316 		if (p == end ||

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

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

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

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

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

  1322 				continue;

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

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

  1325 		}

  1326 	}

  1327 }

  1329 void

  1330 razor_set_list_unsatisfied(struct razor_set *set)

  1331 {

  1332 	struct array unsatisfied;

  1333 	struct razor_property *properties, *r;

  1334 	unsigned long *u, *end;

  1335 	char *pool;

  1337 	array_init(&unsatisfied);

  1338 	razor_set_validate(set, &unsatisfied);

  1340 	end = unsatisfied.data + unsatisfied.size;

  1341 	properties = set->properties.data;

  1342 	pool = set->string_pool.data;

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

  1345 		r = properties + *u;

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

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

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

  1349 		else

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

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

  1352 			       &pool[r->version]);

  1353 	}

  1355 	array_release(&unsatisfied);

  1356 }

  1358 #define UPSTREAM_SOURCE 0x80000000ul

  1359 #define INDEX_MASK 0x00fffffful

  1361 struct source {

  1362 	struct razor_set *set;

  1363 	unsigned long *property_map;

  1364 };

  1366 struct razor_merger {

  1367 	struct razor_set *set;

  1368 	struct hashtable table;

  1369 	struct source source1;

  1370 	struct source source2;

  1371 };

  1373 static struct razor_merger *

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

  1375 {

  1376 	struct razor_merger *merger;

  1377 	int count;

  1378 	size_t size;

  1380 	merger = zalloc(sizeof *merger);

  1381 	merger->set = razor_set_create();

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

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

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

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

  1387 	merger->source1.set = set1;

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

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

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

  1392 	merger->source2.set = set2;

  1394 	return merger;

  1395 }

  1397 static void

  1398 add_package(struct razor_merger *merger,

  1399 	    struct razor_package *package, struct source *source,

  1400 	    unsigned long flags)

  1401 {

  1402 	char *pool;

  1403 	unsigned long *r;

  1404 	struct razor_package *p;

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

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

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

  1409 	p->name |= flags;

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

  1411 					&pool[package->version]);

  1412 	p->properties = package->properties;

  1414 	if (package->properties & RAZOR_IMMEDIATE)

  1415 		r = &package->properties;

  1416 	else

  1417 		r = (unsigned long *)

  1418 			source->set->property_pool.data + package->properties;

  1419 	while (1) {

  1420 		source->property_map[*r & RAZOR_ENTRY_MASK] = 1;

  1421 		if (*r++ & RAZOR_IMMEDIATE)

  1422 			break;

  1423 	}

  1424 }

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

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

  1429 static void

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

  1431 {

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

  1433 	struct source *source1, *source2;

  1434 	char *spool, *upool;

  1435 	unsigned long *u, *uend;

  1436 	int cmp;

  1438 	source1 = &merger->source1;

  1439 	source2 = &merger->source2;

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

  1442 	u = packages->data;

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

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

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

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

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

  1450 	while (s < send) {

  1451 		p = upstream_packages + *u;

  1453 		if (u < uend)

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

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

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

  1457 			s++;

  1458 		} else if (cmp == 0) {

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

  1460 			s++;

  1461 			u++;

  1462 		} else {

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

  1464 			u++;

  1465 		}

  1466 	}

  1467 }

  1469 static unsigned long

  1470 add_property(struct razor_merger *merger,

  1471 	     const char *name, const char *version, int type)

  1472 {

  1473 	struct razor_property *p;

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

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

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

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

  1480 }

  1482 static void

  1483 merge_properties(struct razor_merger *merger)

  1484 {

  1485 	struct razor_property *p1, *p2;

  1486 	struct razor_set *set1, *set2;

  1487 	unsigned long *map1, *map2;

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

  1489 	char *pool1, *pool2;

  1491 	set1 = merger->source1.set;

  1492 	set2 = merger->source2.set;

  1493 	map1 = merger->source1.property_map;

  1494 	map2 = merger->source2.property_map;

  1496 	i = 0;

  1497 	j = 0;

  1498 	pool1 = set1->string_pool.data;

  1499 	pool2 = set2->string_pool.data;

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

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

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

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

  1505 			i++;

  1506 			continue;

  1507 		}

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

  1509 			j++;

  1510 			continue;

  1511 		}

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

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

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

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

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

  1517 		else if (i < count1)

  1518 			cmp = -1;

  1519 		else

  1520 			cmp = 1;

  1521 		if (cmp == 0)

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

  1523 					 &pool2[p2->version]);

  1524 		if (cmp < 0) {

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

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

  1527 						 &pool1[p1->version],

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

  1529 		} else if (cmp > 0) {

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

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

  1532 						 &pool2[p2->version],

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

  1534 		} else  {

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

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

  1537 							     &pool1[p1->version],

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

  1539 		}

  1540 	}

  1541 }

  1543 static unsigned long

  1544 emit_properties(struct array *source_pool, unsigned long index,

  1545 		unsigned long *map, struct array *pool)

  1546 {

  1547 	unsigned long r, *p, *q;

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

  1550 	p = (unsigned long *) source_pool->data + index;

  1551 	while (1) {

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

  1553 		*q = map[*p & RAZOR_ENTRY_MASK] | (*p & ~RAZOR_ENTRY_MASK);

  1554 		if (*p++ & RAZOR_ENTRY_LAST)

  1555 			break;

  1556 	}

  1558 	return r;

  1559 }

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

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

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

  1564  * the arrays for their properties. */

  1565 static void

  1566 rebuild_package_lists(struct razor_set *set)

  1567 {

  1568 	struct array *pkgs, *a;

  1569 	struct razor_package *pkg, *pkg_end;

  1570 	struct razor_property *prop, *prop_end;

  1571 	unsigned long *r, *q, *pool;

  1572 	int count;

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

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

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

  1577 	pool = set->property_pool.data;

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

  1580 		for (r = &pool[pkg->properties]; ; r++) {

  1581 			q = array_add(&pkgs[*r & RAZOR_ENTRY_MASK], sizeof *q);

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

  1583 			if (*r & RAZOR_IMMEDIATE)

  1584 				break;

  1585 		}

  1586 	}

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

  1589 	a = pkgs;

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

  1591 		if (a->size / sizeof *r == 1) {

  1592 			r = a->data;

  1593 			prop->packages = *r | RAZOR_IMMEDIATE;

  1594 		} else {

  1595 			prop->packages =

  1596 				add_to_property_pool(&set->property_pool, a);

  1597 		}

  1598 		array_release(a);

  1599 	}

  1600 	free(pkgs);

  1601 }

  1603 struct razor_set *

  1604 razor_merger_finish(struct razor_merger *merger)

  1605 {

  1606 	struct razor_set *result;

  1608 	result = merger->set;

  1609 	hashtable_release(&merger->table);

  1610 	free(merger);

  1612 	return result;

  1613 }

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

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

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

  1618  * enforce validity of the resulting package set.

  1619  *

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

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

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

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

  1624  */

  1625 struct razor_set *

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

  1627 	      struct array *packages)

  1628 {

  1629 	struct razor_merger *merger;

  1630 	struct razor_package *p, *pend;

  1632 	merger = razor_merger_create(set, upstream);

  1634 	merge_packages(merger, packages);

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

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

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

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

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

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

  1642 	 * property list for both sets. */

  1644 	merge_properties(merger);

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

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

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

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

  1651 		struct source *src;

  1653 		if (p->name & UPSTREAM_SOURCE)

  1654 			src = &merger->source2;

  1655 		else

  1656 			src = &merger->source1;

  1658 		p->properties = emit_properties(&src->set->property_pool,

  1659 						p->properties,

  1660 						src->property_map,

  1661 						&merger->set->property_pool);

  1662 		p->name &= INDEX_MASK;

  1663 	}

  1665 	rebuild_package_lists(merger->set);

  1667 	return razor_merger_finish(merger);

  1668 }

  1670 void

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

  1672 		  struct razor_set *upstream, struct array *list)

  1673 {

  1674 	struct razor_property *requires, *r;

  1675 	struct razor_property *p, *pend;

  1676 	unsigned long *u, *end, *pkg, *package_pool;

  1677 	char *pool, *upool;

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

  1680 	requires = set->properties.data;

  1681 	pool = set->string_pool.data;

  1683 	p = upstream->properties.data;

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

  1685 	upool = upstream->string_pool.data;

  1686 	package_pool = upstream->package_pool.data;

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

  1689 		r = requires + *u;

  1691 		while (p < pend &&

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

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

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

  1695 			p++;

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

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

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

  1699 			p++;

  1701 		if (p == pend ||

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

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

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

  1705 			/* Do we need to track unsatisfiable requires

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

  1707 			 * razor_set_validate() at the end? */

  1708 		} else {

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

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

  1711 			if (p->packages & RAZOR_IMMEDIATE)

  1712 				*pkg = p->packages & RAZOR_ENTRY_MASK;

  1713 			else

  1714 				*pkg = package_pool[p->packages];

  1715 		}

  1716 	}

  1717 }

  1719 static void

  1720 find_packages(struct razor_set *set,

  1721 	      int count, const char **packages, struct array *list)

  1722 {

  1723 	struct razor_package *p;

  1724 	unsigned long *r;

  1725 	int i;

  1727 	/* FIXME: Sort the packages. */

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

  1729 		p = razor_set_get_package(set, packages[i]);

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

  1731 		*r = p - (struct razor_package *) set->packages.data;

  1732 	}

  1733 }

  1735 static void

  1736 find_all_packages(struct razor_set *set,

  1737 		  struct razor_set *upstream, struct array *list)

  1738 {

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

  1740 	unsigned long *r;

  1741 	char *pool, *upool;

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

  1744 	pool = set->string_pool.data;

  1745 	u = upstream->packages.data;

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

  1747 	upool = upstream->string_pool.data;

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

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

  1751 			u++;

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

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

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

  1755 		}

  1756 	}

  1757 }

  1759 struct razor_set *

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

  1761 		 int count, const char **packages)

  1762 {

  1763 	struct razor_set *new;

  1764 	struct razor_package *upackages;

  1765 	struct array list, unsatisfied;

  1766 	char *pool;

  1767 	unsigned long *u, *end;

  1768 	int total = 0;

  1770 	array_init(&list);

  1771 	if (count > 0)

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

  1773 	else

  1774 		find_all_packages(set, upstream, &list);

  1776 	end = list.data + list.size;

  1777 	upackages = upstream->packages.data;

  1778 	pool = upstream->string_pool.data;

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

  1781 	while (list.size > 0) {

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

  1783 		array_release(&list);

  1784 		razor_set_destroy(set);

  1785 		set = new;

  1787 		array_init(&unsatisfied);

  1788 		razor_set_validate(new, &unsatisfied);

  1789 		array_init(&list);

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

  1791 		array_release(&unsatisfied);

  1793 		end = list.data + list.size;

  1794 		upackages = upstream->packages.data;

  1795 		pool = upstream->string_pool.data;

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

  1797 	}

  1799 	array_release(&list);

  1801 	return set;

  1802 }

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

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

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

  1807  **/

  1809 void

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

  1811 	       razor_package_callback_t callback, void *data)

  1812 {

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

  1814 	char *ppool, *upool;

  1815 	int res = 0;

  1817 	p = set->packages.data;

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

  1819 	ppool = set->string_pool.data;

  1821 	u = upstream->packages.data;

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

  1823 	upool = upstream->string_pool.data;

  1825 	while (p < pend || u < uend) {

  1826 		if (p < pend && u < uend) {

  1827 			res = strcmp(&ppool[p->name], &upool[u->name]);

  1828 			if (res == 0)

  1829 				res = versioncmp(&ppool[p->version],

  1830 						 &upool[u->version]);

  1831 		}

  1833 		if (u == uend || res < 0) {

  1834 			callback(&ppool[p->name], &ppool[p->version],

  1835 				 NULL, data);

  1836 			p++;

  1837 			continue;

  1838 		} else if (p == pend || res > 0) {

  1839 			callback(&upool[u->name], NULL, &upool[u->version],

  1840 				 data);

  1841 			u++;

  1842 			continue;

  1843 		} else {

  1844 			p++;

  1845 			u++;

  1846 		}

  1847 	}

  1848 }

author	Kristian H?gsberg <krh@redhat.com>
	Tue Nov 13 01:08:08 2007 -0500 (2007-11-13)
changeset 81	7bc11dfb4bbd
parent 78	89c06e68824a
child 83	43ef0eb1b603
permissions	-rw-r--r--