razor: razor.c@9708f6d5db8c

     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"

    17 #include "razor-internal.h"

    19 struct array {

    20 	void *data;

    21 	int size, alloc;

    22 };

    24 struct razor_set_section {

    25 	unsigned int type;

    26 	unsigned int offset;

    27 	unsigned int size;

    28 };

    30 struct razor_set_header {

    31 	unsigned int magic;

    32 	unsigned int version;

    33 	struct razor_set_section sections[0];

    34 };

    36 #define RAZOR_MAGIC 0x7a7a7a7a

    37 #define RAZOR_VERSION 1

    39 #define RAZOR_ENTRY_LAST	0x80000000ul

    40 #define RAZOR_IMMEDIATE		0x80000000ul

    41 #define RAZOR_ENTRY_MASK	0x00fffffful

    43 #define RAZOR_STRING_POOL	0

    44 #define RAZOR_PACKAGES		1

    45 #define RAZOR_PROPERTIES	2

    46 #define RAZOR_FILES		3

    47 #define RAZOR_PACKAGE_POOL	4

    48 #define RAZOR_PROPERTY_POOL	5

    49 #define RAZOR_FILE_POOL		6

    51 struct razor_package {

    52 	unsigned long name;

    53 	unsigned long version;

    54 	unsigned long properties;

    55 	unsigned long files;

    56 };

    58 struct razor_property {

    59 	unsigned long name;

    60 	unsigned long version;

    61 	unsigned long packages;

    62 };

    64 struct razor_entry {

    65 	unsigned long name;

    66 	unsigned long start;

    67 	unsigned long packages;

    68 };

    70 struct razor_set {

    71 	struct array string_pool;

    72  	struct array packages;

    73  	struct array properties;

    74  	struct array files;

    75 	struct array package_pool;

    76  	struct array property_pool;

    77  	struct array file_pool;

    78 	struct razor_set_header *header;

    79 };

    81 struct import_entry {

    82 	unsigned long package;

    83 	char *name;

    84 };

    86 struct import_directory {

    87 	unsigned long name, count;

    88 	struct array files;

    89 	struct array packages;

    90 	struct import_directory *last;

    91 };

    93 struct hashtable {

    94 	struct array buckets;

    95 	struct array *pool;

    96 };

    98 struct razor_importer {

    99 	struct razor_set *set;

   100 	struct hashtable table;

   101 	struct razor_package *package;

   102 	struct array properties;

   103 	struct array files;

   104 };

   106 static void

   107 array_init(struct array *array)

   108 {

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

   110 }

   112 static void

   113 array_release(struct array *array)

   114 {

   115 	free(array->data);

   116 }

   118 static void *

   119 array_add(struct array *array, int size)

   120 {

   121 	int alloc;

   122 	void *data, *p;

   124 	if (array->alloc > 0)

   125 		alloc = array->alloc;

   126 	else

   127 		alloc = 16;

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

   130 		alloc *= 2;

   132 	if (array->alloc < alloc) {

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

   134 		if (data == NULL)

   135 			return 0;

   136 		array->data = data;

   137 		array->alloc = alloc;

   138 	}

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

   141 	array->size += size;

   143 	return p;

   144 }

   146 static void *

   147 zalloc(size_t size)

   148 {

   149 	void *p;

   151 	p = malloc(size);

   152 	memset(p, 0, size);

   154 	return p;

   155 }

   157 struct razor_set_section razor_sections[] = {

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

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

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

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

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

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

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

   165 };

   167 struct razor_set *

   168 razor_set_create(void)

   169 {

   170 	return zalloc(sizeof(struct razor_set));

   171 }

   173 struct razor_set *

   174 razor_set_open(const char *filename)

   175 {

   176 	struct razor_set *set;

   177 	struct razor_set_section *s;

   178 	struct stat stat;

   179 	struct array *array;

   180 	int fd;

   182 	set = zalloc(sizeof *set);

   183 	fd = open(filename, O_RDONLY);

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

   185 		return NULL;

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

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

   188 		free(set);

   189 		return NULL;

   190 	}

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

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

   194 			continue;

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

   196 			continue;

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

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

   199 		array->size = s->size;

   200 		array->alloc = s->size;

   201 	}

   202 	close(fd);

   204 	return set;

   205 }

   207 void

   208 razor_set_destroy(struct razor_set *set)

   209 {

   210 	unsigned int size;

   211 	struct array *a;

   212 	int i;

   214 	if (set->header) {

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

   216 			;

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

   218 		munmap(set->header, size);

   219 	} else {

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

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

   222 			free(a->data);

   223 		}

   224 	}

   226 	free(set);

   227 }

   229 int

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

   231 {

   232 	char data[4096];

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

   234 	struct array *a;

   235 	unsigned long offset;

   236 	int i, fd;

   238 	memset(data, 0, sizeof data);

   239 	header->magic = RAZOR_MAGIC;

   240 	header->version = RAZOR_VERSION;

   241 	offset = sizeof data;

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

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

   245 			continue;

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

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

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

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

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

   251 	}

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

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

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

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

   258 	if (fd < 0)

   259 		return -1;

   261 	razor_write(fd, data, sizeof data);

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

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

   264 			continue;

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

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

   267 	}

   269 	close(fd);

   271 	return 0;

   272 }

   274 static unsigned int

   275 hash_string(const char *key)

   276 {

   277 	const char *p;

   278 	unsigned int hash = 0;

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

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

   283 	return hash;

   284 }

   286 static unsigned long

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

   288 {

   289 	unsigned int mask, start, i;

   290 	unsigned long *b;

   291 	char *pool;

   293 	pool = table->pool->data;

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

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

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

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

   300 		if (*b == 0)

   301 			return 0;

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

   304 			return *b;

   305 	}

   307 	return 0;

   308 }

   310 static unsigned long

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

   312 {

   313 	int len;

   314 	char *p;

   316 	len = strlen(key) + 1;

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

   318 	memcpy(p, key, len);

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

   321 }

   323 static unsigned long

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

   325 {

   326 	unsigned long *p;

   328 	if (properties->size == 0)

   329 		return ~0;

   330 	else if (properties->size == sizeof *p)

   331 		return *(unsigned long *) properties->data | RAZOR_IMMEDIATE;

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

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

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

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

   338 }

   340 static void

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

   342 {

   343 	unsigned int mask, start, i;

   344 	unsigned long *b;

   345 	const char *key;

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

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

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

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

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

   353 		if (*b == 0) {

   354 			*b = value;

   355 			break;

   356 		}

   357 	}

   358 }

   360 static unsigned long

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

   362 {

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

   364 	int alloc;

   366 	alloc = table->buckets.alloc;

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

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

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

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

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

   372 			value = *b;

   373 			if (value != 0) {

   374 				*b = 0;

   375 				do_insert(table, value);

   376 			}

   377 		}

   378 	}

   380 	value = add_to_string_pool(table, key);

   381 	do_insert (table, value);

   383 	return value;

   384 }

   386 static void

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

   388 {

   389 	array_init(&table->buckets);

   390 	table->pool = pool;

   391 }

   393 static void

   394 hashtable_release(struct hashtable *table)

   395 {

   396 	array_release(&table->buckets);

   397 }

   399 static unsigned long

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

   401 {

   402 	unsigned long token;

   404 	if (string == NULL)

   405 		string = "";

   407 	token = hashtable_lookup(table, string);

   408 	if (token != 0)

   409 		return token;

   411 	return hashtable_insert(table, string);

   412 }

   414 void

   415 razor_importer_begin_package(struct razor_importer *importer,

   416 			     const char *name, const char *version)

   417 {

   418 	struct razor_package *p;

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

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

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

   424 	importer->package = p;

   425 	array_init(&importer->properties);

   426 }

   428 void

   429 razor_importer_finish_package(struct razor_importer *importer)

   430 {

   431 	struct razor_package *p;

   433 	p = importer->package;

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

   435 					     &importer->properties);

   437 	array_release(&importer->properties);

   438 }

   440 void

   441 razor_importer_add_property(struct razor_importer *importer,

   442 			    const char *name, const char *version,

   443 			    enum razor_property_type type)

   444 {

   445 	struct razor_property *p;

   446 	unsigned long *r;

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

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

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

   451 	p->packages = importer->package -

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

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

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

   456 }

   458 void

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

   460 {

   461 	struct import_entry *e;

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

   465 	e->package = importer->package -

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

   467 	e->name = strdup(name);

   468 }

   470 struct razor_importer *

   471 razor_importer_new(void)

   472 {

   473 	struct razor_importer *importer;

   475 	importer = zalloc(sizeof *importer);

   476 	importer->set = razor_set_create();

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

   479 	return importer;

   480 }

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

   483 void

   484 razor_importer_destroy(struct razor_importer *importer)

   485 {

   486 	/* FIXME: write this */

   487 }

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

   491 					const void *p,

   492 					void *data);

   494 struct qsort_context {

   495 	size_t size;

   496 	compare_with_data_func_t compare;

   497 	void *data;

   498 };

   500 static void

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

   502 {

   503 	char buffer[size];

   505 	memcpy(buffer, p1, size);

   506 	memcpy(p1, p2, size);

   507 	memcpy(p2, buffer, size);

   508 }

   510 static void

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

   512 		  struct qsort_context *ctx)

   513 {

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

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

   516 	int left, right, result;

   517 	size_t size = ctx->size;

   519 	p = base;

   520 	start = base;

   521 	end = base + nelem * size;

   522 	mp = map;

   523 	mstart = map;

   524 	mend = map + nelem;

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

   527 	while (p < end) {

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

   529 		if (result < 0) {

   530 			qsort_swap(p, start, size);

   531 			tmp = *mp;

   532 			*mp = *mstart;

   533 			*mstart = tmp;

   534 			if (start == pivot)

   535 				pivot = p;

   536 			start += size;

   537 			mstart++;

   538 			p += size;

   539 			mp++;

   540 		} else if (result == 0) {

   541 			p += size;

   542 			mp++;

   543 		} else {

   544  			end -= size;

   545 			mend--;

   546 			qsort_swap(p, end, size);

   547 			tmp = *mp;

   548 			*mp = *mend;

   549 			*mend = tmp;

   550 			if (end == pivot)

   551 				pivot = p;

   552 		}

   553 	}

   555 	left = (start - base) / size;

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

   557 	if (left > 1)

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

   559 	if (right > 1)

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

   561 }

   563 unsigned long *

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

   565 		compare_with_data_func_t compare, void *data)

   566 {

   567 	struct qsort_context ctx;

   568 	unsigned long *map;

   569 	int i;

   571 	if (nelem == 0)

   572 		return NULL;

   574 	ctx.size = size;

   575 	ctx.compare = compare;

   576 	ctx.data = data;

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

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

   580 		map[i] = i;

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

   584 	return map;

   585 }

   587 static int

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

   589 {

   590 	const char *p1, *p2;

   591 	long n1, n2;

   592 	int res;

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

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

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

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

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

   600 	if (res < 0) {

   601 		n1 = 0;

   602 		p1 = s1;

   603 		p2++;

   604 	} else if (res > 0) {

   605 		p1++;

   606 		n2 = 0;

   607 		p2 = s2;

   608 	}

   610 	if (n1 != n2)

   611 		return n1 - n2;

   612 	while (*p1 && *p2) {

   613 		if (*p1 != *p2)

   614 			return *p1 - *p2;

   615 		p1++;

   616 		p2++;

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

   618 			return versioncmp(p1, p2);

   619 	}

   621 	return *p1 - *p2;

   622 }

   624 static int

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

   626 {

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

   628 	struct razor_set *set = data;

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

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

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

   633 	else

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

   635 }

   637 static int

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

   639 {

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

   641 	struct razor_set *set = data;

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

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

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

   646 				  &pool[prop2->version]);

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

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

   649 	else

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

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

   652 }

   654 static unsigned long *

   655 uniqueify_properties(struct razor_set *set)

   656 {

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

   658 	struct array *pkgs, *p;

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

   660 	int i, count, unique;

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

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

   664 			      count,

   665 			      sizeof(struct razor_property),

   666 			      compare_properties,

   667 			      set);

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

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

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

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

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

   674 			up++;

   675 			up->name = rp->name;

   676 			up->version = rp->version;

   677 		}

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

   680 		rmap[map[i]] = unique;

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

   682 		*r = rp->packages;

   683 	}

   684 	free(map);

   686 	up++;

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

   688 	rp_end = up;

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

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

   691 			r = p->data;

   692 			rp->packages = *r | RAZOR_IMMEDIATE;

   693 		} else {

   694 			rp->packages =

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

   696 		}

   697 		array_release(p);

   698 	}

   700 	free(pkgs);

   702 	return rmap;

   703 }

   705 static void

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

   707 {

   708 	unsigned long *p, *end;

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

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

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

   713 }

   715 static int

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

   717 {

   718 	const struct import_entry *e1 = p1;

   719 	const struct import_entry *e2 = p2;

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

   722 }

   724 static void

   725 count_entries(struct import_directory *d)

   726 {

   727 	struct import_directory *p, *end;

   729 	p = d->files.data;

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

   731 	d->count = 0;

   732 	while (p < end) {

   733 		count_entries(p);

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

   735 		p++;

   736 	}

   737 }

   739 static void

   740 serialize_files(struct razor_set *set,

   741 		struct import_directory *d, struct array *array)

   742 {

   743 	struct import_directory *p, *end;

   744 	struct razor_entry *e = NULL;

   745 	unsigned long s, *r;

   747 	p = d->files.data;

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

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

   750 	while (p < end) {

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

   752 		e->name = p->name;

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

   754 		s += p->count;

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

   757 			e->packages = ~0;

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

   759 			r = p->packages.data;

   760 			e->packages = *r | RAZOR_IMMEDIATE;

   761 		} else {

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

   763 							   &p->packages);

   764 		}

   765 		array_release(&p->packages);

   766 		p++;

   767 	}

   768 	if (e != NULL)

   769 		e->name |= RAZOR_ENTRY_LAST;

   771 	p = d->files.data;

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

   773 	while (p < end) {

   774 		serialize_files(set, p, array);

   775 		p++;

   776 	}

   777 }

   779 static void

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

   781 {

   782 	struct razor_property *p, *end;

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

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

   786 		if (p->packages & RAZOR_IMMEDIATE)

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

   788 				RAZOR_IMMEDIATE;

   789 }

   791 static void

   792 build_file_tree(struct razor_importer *importer)

   793 {

   794 	int count, i, length;

   795 	struct import_entry *filenames;

   796 	char *f, *end;

   797 	unsigned long name, *r;

   798 	char dirname[256];

   799 	struct import_directory *d, root;

   800 	struct razor_entry *e;

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

   803 	qsort_with_data(importer->files.data,

   804 			count,

   805 			sizeof (struct import_entry),

   806 			compare_filenames,

   807 			NULL);

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

   810 	array_init(&root.files);

   811 	array_init(&root.packages);

   812 	root.last = NULL;

   814 	filenames = importer->files.data;

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

   816 		f = filenames[i].name;

   817 		if (*f != '/')

   818 			continue;

   819 		f++;

   821 		d = &root;

   822 		while (*f) {

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

   824 			if (end == NULL)

   825 				end = f + strlen(f);

   826 			length = end - f;

   827 			memcpy(dirname, f, length);

   828 			dirname[length] ='\0';

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

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

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

   832 				d->last->name = name;

   833 				d->last->last = NULL;

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

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

   836 			}

   837 			d = d->last;

   838 			f = end + 1;

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

   840 				break;

   841 		}

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

   844 		*r = filenames[i].package;

   845 		free(filenames[i].name);

   846 	}

   848 	count_entries(&root);

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

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

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

   853 	e->start = 1;

   854 	e->packages = ~0;

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

   858 	array_release(&importer->files);

   859 }

   861 static void

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

   863 {

   864 	struct razor_package *p, *packages;

   865 	struct array *pkgs;

   866 	struct razor_entry *e, *end;

   867 	unsigned long *r, *q;

   868 	int i, count;

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

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

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

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

   875 		if (e->packages == ~0) {

   876 			continue;

   877 		} else if (e->packages & RAZOR_IMMEDIATE) {

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

   879 				RAZOR_IMMEDIATE;

   880 			r = &e->packages;

   881 		} else {

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

   883 		}

   885 		while (1) {

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

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

   888 			if (*r++ & RAZOR_IMMEDIATE)

   889 				break;

   890 		}

   891 	}

   893 	packages = set->packages.data;

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

   895 		packages[i].files =

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

   897 		array_release(&pkgs[i]);

   898 	}

   899 	free(pkgs);

   900 }

   902 struct razor_set *

   903 razor_importer_finish(struct razor_importer *importer)

   904 {

   905 	struct razor_set *set;

   906 	unsigned long *map, *rmap;

   907 	int i, count;

   909 	map = uniqueify_properties(importer->set);

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

   911 	free(map);

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

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

   915 			      count,

   916 			      sizeof(struct razor_package),

   917 			      compare_packages,

   918 			      importer->set);

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

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

   922 		rmap[map[i]] = i;

   923 	free(map);

   925 	build_file_tree(importer);

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

   927 	build_package_file_lists(importer->set, rmap);

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

   929 	free(rmap);

   931 	set = importer->set;

   932 	hashtable_release(&importer->table);

   933 	free(importer);

   935 	return set;

   936 }

   938 struct razor_package_iterator {

   939 	struct razor_set *set;

   940 	struct razor_package *package, *end;

   941 	unsigned long *index;

   942 	int last;

   943 };

   945 struct razor_package_iterator *

   946 razor_package_iterator_create_with_index(struct razor_set *set,

   947 					 unsigned long *index)

   948 {

   949 	struct razor_package_iterator *pi;

   951 	pi = zalloc(sizeof *pi);

   952 	pi->set = set;

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

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

   955 	pi->index = index;

   957 	return pi;

   958 }

   960 struct razor_package_iterator *

   961 razor_package_iterator_create(struct razor_set *set)

   962 {

   963 	return razor_package_iterator_create_with_index(set, NULL);

   964 }

   966 struct razor_package_iterator *

   967 razor_package_iterator_create_for_property(struct razor_set *set,

   968 					   struct razor_property *property)

   969 {

   970 	unsigned long *index;

   972 	if (property->packages & RAZOR_IMMEDIATE)

   973 		index = &property->packages;

   974 	else

   975 		index = (unsigned long *)

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

   978 	return razor_package_iterator_create_with_index(set, index);

   979 }

   981 int

   982 razor_package_iterator_next(struct razor_package_iterator *pi,

   983 			    struct razor_package **package,

   984 			    const char **name, const char **version)

   985 {

   986 	char *pool;

   987 	int valid;

   988 	struct razor_package *p, *packages;

   990 	if (pi->index) {

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

   992 		p = &packages[*pi->index & RAZOR_ENTRY_MASK];

   993 		valid = !pi->last;

   994 		pi->last = (*pi->index++ & RAZOR_IMMEDIATE) != 0;

   995 	} else {

   996 		p = pi->package++;

   997 		valid = p < pi->end;

   998 	}

  1000 	if (valid) {

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

  1002 		*package = p;

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

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

  1005 	} else {

  1006 		*package = NULL;

  1007 	}

  1009 	return valid;

  1010 }

  1012 void

  1013 razor_package_iterator_destroy(struct razor_package_iterator *pi)

  1014 {

  1015 	free(pi);

  1016 }

  1018 struct razor_package *

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

  1020 {

  1021 	struct razor_package_iterator *pi;

  1022 	struct razor_package *p;

  1023 	const char *name, *version;

  1025 	pi = razor_package_iterator_create(set);

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

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

  1028 			break;

  1029 	}

  1030 	razor_package_iterator_destroy(pi);

  1032 	return p;

  1033 }

  1035 struct razor_property_iterator {

  1036 	struct razor_set *set;

  1037 	struct razor_property *property, *end;

  1038 	unsigned long *index;

  1039 	int last;

  1040 };

  1042 struct razor_property_iterator *

  1043 razor_property_iterator_create(struct razor_set *set,

  1044 			       struct razor_package *package)

  1045 {

  1046 	struct razor_property_iterator *pi;

  1048 	pi = zalloc(sizeof *pi);

  1049 	pi->set = set;

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

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

  1053 	if (package)

  1054 		pi->index = (unsigned long *)

  1055 			set->property_pool.data + package->properties;

  1057 	return pi;

  1058 }

  1060 int

  1061 razor_property_iterator_next(struct razor_property_iterator *pi,

  1062 			     struct razor_property **property,

  1063 			     const char **name, const char **version,

  1064 			     enum razor_property_type *type)

  1065 {

  1066 	char *pool;

  1067 	int valid;

  1068 	struct razor_property *p, *properties;

  1070 	if (pi->index) {

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

  1072 		p = &properties[*pi->index & RAZOR_ENTRY_MASK];

  1073 		valid = !pi->last;

  1074 		pi->last = (*pi->index++ & RAZOR_IMMEDIATE) != 0;

  1075 	} else {

  1076 		p = pi->property++;

  1077 		valid = p < pi->end;

  1078 	}

  1080 	if (valid) {

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

  1082 		*property = p;

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

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

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

  1086 	} else {

  1087 		*property = NULL;

  1088 	}

  1090 	return valid;

  1091 }

  1093 void

  1094 razor_property_iterator_destroy(struct razor_property_iterator *pi)

  1095 {

  1096 	free(pi);

  1097 }

  1099 static struct razor_entry *

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

  1101 {

  1102 	struct razor_entry *e;

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

  1104 	int len;

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

  1107 	do {

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

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

  1110 			return e;

  1111 		len = strlen(n);

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

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

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

  1115 		}

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

  1118 	return NULL;

  1119 }

  1121 static void

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

  1123 	 const char *prefix, const char *pattern)

  1124 {

  1125 	struct razor_entry *e;

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

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

  1129 	do {

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

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

  1132 			continue;

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

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

  1135 }

  1137 void

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

  1139 {

  1140 	struct razor_entry *e;

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

  1143 	if (pattern == NULL)

  1144 		pattern = "/";

  1146 	strcpy(buffer, pattern);

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

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

  1149 		base = NULL;

  1150 	} else {

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

  1152 		if (p) {

  1153 			*p = '\0';

  1154 			base = p + 1;

  1155 		} else {

  1156 			base = NULL;

  1157 		}

  1158 	}

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

  1160 	if (e->start != 0)

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

  1162 }

  1164 void

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

  1166 {

  1167 	struct razor_entry *e;

  1168 	struct razor_package *packages, *p;

  1169 	const char *pool;

  1170 	unsigned long *r;

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

  1173 	if (e == NULL)

  1174 		return;

  1176 	if (e->packages & RAZOR_IMMEDIATE)

  1177 		r = &e->packages;

  1178 	else

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

  1181 	packages = set->packages.data;

  1182 	pool = set->string_pool.data;

  1183 	while (1) {

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

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

  1186 		if (*r++ & RAZOR_IMMEDIATE)

  1187 			break;

  1188 	}

  1189 }

  1191 static unsigned long *

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

  1193 		   struct razor_entry *dir, unsigned long end,

  1194 		   char *prefix)

  1195 {

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

  1197 	unsigned long next, file;

  1198 	char *pool;

  1199 	int len;

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

  1202 	pool = set->string_pool.data;

  1204 	e = entries + dir->start;

  1205 	do {

  1206 		if (entries + (*r & RAZOR_ENTRY_MASK) == e) {

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

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

  1209 			if (*r & RAZOR_ENTRY_LAST)

  1210 				return NULL;

  1211 			r++;

  1212 			if ((*r & RAZOR_ENTRY_MASK) >= end)

  1213 				return r;

  1214 		}

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

  1217 	e = entries + dir->start;

  1218 	do {

  1219 		if (e->start == 0)

  1220 			continue;

  1222 		if (e->name & RAZOR_ENTRY_LAST)

  1223 			next = end;

  1224 		else {

  1225 			f = e + 1;

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

  1227 				f++;

  1228 			if (f->start == 0)

  1229 				next = end;

  1230 			else

  1231 				next = f->start;

  1232 		}

  1234 		file = *r & RAZOR_ENTRY_MASK;

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

  1236 			len = strlen(prefix);

  1237 			prefix[len] = '/';

  1238 			strcpy(prefix + len + 1,

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

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

  1241 			prefix[len] = '\0';

  1242 		}

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

  1245 	return r;

  1246 }

  1248 void

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

  1250 {

  1251 	struct razor_package *package;

  1252 	unsigned long *r, end;

  1253 	char buffer[512];

  1255 	package = razor_set_get_package(set, name);

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

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

  1259 	buffer[0] = '\0';

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

  1261 }

  1263 static void

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

  1265 {

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

  1267 	unsigned long *u;

  1268 	char *pool;

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

  1271 	pool = set->string_pool.data;

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

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

  1275 			continue;

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

  1278 			p = r;

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

  1280 				p++;

  1281 		}

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

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

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

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

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

  1288 		 * does.*/

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

  1290 			p++;

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

  1293 		 * etc) to properly determine if a requires is

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

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

  1297 		if (p == end ||

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

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

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

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

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

  1303 				continue;

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

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

  1306 		}

  1307 	}

  1308 }

  1310 void

  1311 razor_set_list_unsatisfied(struct razor_set *set)

  1312 {

  1313 	struct array unsatisfied;

  1314 	struct razor_property *properties, *r;

  1315 	unsigned long *u, *end;

  1316 	char *pool;

  1318 	array_init(&unsatisfied);

  1319 	razor_set_validate(set, &unsatisfied);

  1321 	end = unsatisfied.data + unsatisfied.size;

  1322 	properties = set->properties.data;

  1323 	pool = set->string_pool.data;

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

  1326 		r = properties + *u;

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

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

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

  1330 		else

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

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

  1333 			       &pool[r->version]);

  1334 	}

  1336 	array_release(&unsatisfied);

  1337 }

  1339 #define UPSTREAM_SOURCE 0x80000000ul

  1340 #define INDEX_MASK 0x00fffffful

  1342 struct source {

  1343 	struct razor_set *set;

  1344 	unsigned long *property_map;

  1345 };

  1347 struct razor_merger {

  1348 	struct razor_set *set;

  1349 	struct hashtable table;

  1350 	struct source source1;

  1351 	struct source source2;

  1352 };

  1354 static struct razor_merger *

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

  1356 {

  1357 	struct razor_merger *merger;

  1358 	int count;

  1359 	size_t size;

  1361 	merger = zalloc(sizeof *merger);

  1362 	merger->set = razor_set_create();

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

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

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

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

  1368 	merger->source1.set = set1;

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

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

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

  1373 	merger->source2.set = set2;

  1375 	return merger;

  1376 }

  1378 static void

  1379 add_package(struct razor_merger *merger,

  1380 	    struct razor_package *package, struct source *source,

  1381 	    unsigned long flags)

  1382 {

  1383 	char *pool;

  1384 	unsigned long *r;

  1385 	struct razor_package *p;

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

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

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

  1390 	p->name |= flags;

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

  1392 					&pool[package->version]);

  1393 	p->properties = package->properties;

  1395 	if (package->properties & RAZOR_IMMEDIATE)

  1396 		r = &package->properties;

  1397 	else

  1398 		r = (unsigned long *)

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

  1400 	while (1) {

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

  1402 		if (*r++ & RAZOR_IMMEDIATE)

  1403 			break;

  1404 	}

  1405 }

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

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

  1410 static void

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

  1412 {

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

  1414 	struct source *source1, *source2;

  1415 	char *spool, *upool;

  1416 	unsigned long *u, *uend;

  1417 	int cmp;

  1419 	source1 = &merger->source1;

  1420 	source2 = &merger->source2;

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

  1423 	u = packages->data;

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

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

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

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

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

  1431 	while (s < send) {

  1432 		p = upstream_packages + *u;

  1434 		if (u < uend)

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

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

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

  1438 			s++;

  1439 		} else if (cmp == 0) {

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

  1441 			s++;

  1442 			u++;

  1443 		} else {

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

  1445 			u++;

  1446 		}

  1447 	}

  1448 }

  1450 static unsigned long

  1451 add_property(struct razor_merger *merger,

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

  1453 {

  1454 	struct razor_property *p;

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

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

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

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

  1461 }

  1463 static void

  1464 merge_properties(struct razor_merger *merger)

  1465 {

  1466 	struct razor_property *p1, *p2;

  1467 	struct razor_set *set1, *set2;

  1468 	unsigned long *map1, *map2;

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

  1470 	char *pool1, *pool2;

  1472 	set1 = merger->source1.set;

  1473 	set2 = merger->source2.set;

  1474 	map1 = merger->source1.property_map;

  1475 	map2 = merger->source2.property_map;

  1477 	i = 0;

  1478 	j = 0;

  1479 	pool1 = set1->string_pool.data;

  1480 	pool2 = set2->string_pool.data;

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

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

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

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

  1486 			i++;

  1487 			continue;

  1488 		}

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

  1490 			j++;

  1491 			continue;

  1492 		}

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

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

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

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

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

  1498 		else if (i < count1)

  1499 			cmp = -1;

  1500 		else

  1501 			cmp = 1;

  1502 		if (cmp == 0)

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

  1504 					 &pool2[p2->version]);

  1505 		if (cmp < 0) {

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

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

  1508 						 &pool1[p1->version],

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

  1510 		} else if (cmp > 0) {

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

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

  1513 						 &pool2[p2->version],

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

  1515 		} else  {

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

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

  1518 							     &pool1[p1->version],

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

  1520 		}

  1521 	}

  1522 }

  1524 static unsigned long

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

  1526 		unsigned long *map, struct array *pool)

  1527 {

  1528 	unsigned long r, *p, *q;

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

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

  1532 	while (1) {

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

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

  1535 		if (*p++ & RAZOR_ENTRY_LAST)

  1536 			break;

  1537 	}

  1539 	return r;

  1540 }

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

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

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

  1545  * the arrays for their properties. */

  1546 static void

  1547 rebuild_package_lists(struct razor_set *set)

  1548 {

  1549 	struct array *pkgs, *a;

  1550 	struct razor_package *pkg, *pkg_end;

  1551 	struct razor_property *prop, *prop_end;

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

  1553 	int count;

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

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

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

  1558 	pool = set->property_pool.data;

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

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

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

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

  1564 			if (*r & RAZOR_IMMEDIATE)

  1565 				break;

  1566 		}

  1567 	}

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

  1570 	a = pkgs;

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

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

  1573 			r = a->data;

  1574 			prop->packages = *r | RAZOR_IMMEDIATE;

  1575 		} else {

  1576 			prop->packages =

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

  1578 		}

  1579 		array_release(a);

  1580 	}

  1581 	free(pkgs);

  1582 }

  1584 struct razor_set *

  1585 razor_merger_finish(struct razor_merger *merger)

  1586 {

  1587 	struct razor_set *result;

  1589 	result = merger->set;

  1590 	hashtable_release(&merger->table);

  1591 	free(merger);

  1593 	return result;

  1594 }

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

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

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

  1599  * enforce validity of the resulting package set.

  1600  *

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

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

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

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

  1605  */

  1606 struct razor_set *

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

  1608 	      struct array *packages)

  1609 {

  1610 	struct razor_merger *merger;

  1611 	struct razor_package *p, *pend;

  1613 	merger = razor_merger_create(set, upstream);

  1615 	merge_packages(merger, packages);

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

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

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

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

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

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

  1623 	 * property list for both sets. */

  1625 	merge_properties(merger);

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

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

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

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

  1632 		struct source *src;

  1634 		if (p->name & UPSTREAM_SOURCE)

  1635 			src = &merger->source2;

  1636 		else

  1637 			src = &merger->source1;

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

  1640 						p->properties,

  1641 						src->property_map,

  1642 						&merger->set->property_pool);

  1643 		p->name &= INDEX_MASK;

  1644 	}

  1646 	rebuild_package_lists(merger->set);

  1648 	return razor_merger_finish(merger);

  1649 }

  1651 void

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

  1653 		  struct razor_set *upstream, struct array *list)

  1654 {

  1655 	struct razor_property *requires, *r;

  1656 	struct razor_property *p, *pend;

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

  1658 	char *pool, *upool;

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

  1661 	requires = set->properties.data;

  1662 	pool = set->string_pool.data;

  1664 	p = upstream->properties.data;

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

  1666 	upool = upstream->string_pool.data;

  1667 	package_pool = upstream->package_pool.data;

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

  1670 		r = requires + *u;

  1672 		while (p < pend &&

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

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

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

  1676 			p++;

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

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

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

  1680 			p++;

  1682 		if (p == pend ||

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

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

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

  1686 			/* Do we need to track unsatisfiable requires

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

  1688 			 * razor_set_validate() at the end? */

  1689 		} else {

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

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

  1692 			if (p->packages & RAZOR_IMMEDIATE)

  1693 				*pkg = p->packages & RAZOR_ENTRY_MASK;

  1694 			else

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

  1696 		}

  1697 	}

  1698 }

  1700 static void

  1701 find_packages(struct razor_set *set,

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

  1703 {

  1704 	struct razor_package *p;

  1705 	unsigned long *r;

  1706 	int i;

  1708 	/* FIXME: Sort the packages. */

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

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

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

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

  1713 	}

  1714 }

  1716 static void

  1717 find_all_packages(struct razor_set *set,

  1718 		  struct razor_set *upstream, struct array *list)

  1719 {

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

  1721 	unsigned long *r;

  1722 	char *pool, *upool;

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

  1725 	pool = set->string_pool.data;

  1726 	u = upstream->packages.data;

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

  1728 	upool = upstream->string_pool.data;

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

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

  1732 			u++;

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

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

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

  1736 		}

  1737 	}

  1738 }

  1740 struct razor_set *

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

  1742 		 int count, const char **packages)

  1743 {

  1744 	struct razor_set *new;

  1745 	struct razor_package *upackages;

  1746 	struct array list, unsatisfied;

  1747 	char *pool;

  1748 	unsigned long *u, *end;

  1749 	int total = 0;

  1751 	array_init(&list);

  1752 	if (count > 0)

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

  1754 	else

  1755 		find_all_packages(set, upstream, &list);

  1757 	end = list.data + list.size;

  1758 	upackages = upstream->packages.data;

  1759 	pool = upstream->string_pool.data;

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

  1762 	while (list.size > 0) {

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

  1764 		array_release(&list);

  1765 		razor_set_destroy(set);

  1766 		set = new;

  1768 		array_init(&unsatisfied);

  1769 		razor_set_validate(new, &unsatisfied);

  1770 		array_init(&list);

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

  1772 		array_release(&unsatisfied);

  1774 		end = list.data + list.size;

  1775 		upackages = upstream->packages.data;

  1776 		pool = upstream->string_pool.data;

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

  1778 	}

  1780 	array_release(&list);

  1782 	return set;

  1783 }

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

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

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

  1788  **/

  1790 void

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

  1792 	       razor_package_callback_t callback, void *data)

  1793 {

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

  1795 	char *ppool, *upool;

  1796 	int res = 0;

  1798 	p = set->packages.data;

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

  1800 	ppool = set->string_pool.data;

  1802 	u = upstream->packages.data;

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

  1804 	upool = upstream->string_pool.data;

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

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

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

  1809 			if (res == 0)

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

  1811 						 &upool[u->version]);

  1812 		}

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

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

  1816 				 NULL, data);

  1817 			p++;

  1818 			continue;

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

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

  1821 				 data);

  1822 			u++;

  1823 			continue;

  1824 		} else {

  1825 			p++;

  1826 			u++;

  1827 		}

  1828 	}

  1829 }

author	Kristian H?gsberg <krh@redhat.com>
	Thu Jan 17 23:28:37 2008 -0500 (2008-01-17)
changeset 101	9708f6d5db8c
parent 100	27aada326858
child 102	337a7a55e2c6
permissions	-rw-r--r--