razor: razor.c@6b5f03f1c084

     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>

    15 #include "razor.h"

    17 struct array {

    18 	void *data;

    19 	int size, alloc;

    20 };

    22 struct razor_set_section {

    23 	unsigned int type;

    24 	unsigned int offset;

    25 	unsigned int size;

    26 };

    28 struct razor_set_header {

    29 	unsigned int magic;

    30 	unsigned int version;

    31 	struct razor_set_section sections[0];

    32 };

    34 #define RAZOR_MAGIC 0x7a7a7a7a

    35 #define RAZOR_VERSION 1

    37 #define RAZOR_PACKAGES 0

    38 #define RAZOR_REQUIRES 1

    39 #define RAZOR_PROVIDES 2

    40 #define RAZOR_STRING_POOL 3

    41 #define RAZOR_PACKAGE_POOL 4

    42 #define RAZOR_REQUIRES_POOL 5

    43 #define RAZOR_PROVIDES_POOL 6

    45 struct razor_package {

    46 	unsigned long name;

    47 	unsigned long version;

    48 	unsigned long requires;

    49 	unsigned long provides;

    50 };

    52 struct razor_property {

    53 	unsigned long name;

    54 	unsigned long version;

    55 	unsigned long packages;

    56 };

    58 struct razor_set {

    59 	struct array string_pool;

    60  	struct array packages;

    61 	struct array package_pool;

    62  	struct array requires;

    63  	struct array provides;

    64  	struct array requires_pool;

    65  	struct array provides_pool;

    66 	struct razor_set_header *header;

    67 };

    69 struct import_property_context {

    70 	struct array *all;

    71 	struct array package;

    72 };

    74 struct razor_importer {

    75 	struct razor_set *set;

    76 	struct array buckets;

    77 	struct import_property_context requires;

    78 	struct import_property_context provides;

    79 	struct razor_package *package;

    80 };

    82 static void

    83 array_init(struct array *array)

    84 {

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

    86 }

    88 static void

    89 array_release(struct array *array)

    90 {

    91 	free(array->data);

    92 }

    94 static void *

    95 array_add(struct array *array, int size)

    96 {

    97 	int alloc;

    98 	void *data, *p;

   100 	if (array->alloc > 0)

   101 		alloc = array->alloc;

   102 	else

   103 		alloc = 16;

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

   106 		alloc *= 2;

   108 	if (array->alloc < alloc) {

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

   110 		if (data == NULL)

   111 			return 0;

   112 		array->data = data;

   113 		array->alloc = alloc;

   114 	}

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

   117 	array->size += size;

   119 	return p;

   120 }

   122 static int

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

   124 {

   125 	int rest, len;

   127 	rest = size;

   128 	while (rest > 0) {

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

   130 		if (len < 0)

   131 			return -1;

   132 		rest -= len;

   133 	}

   135 	return 0;

   136 }

   138 static void *

   139 zalloc(size_t size)

   140 {

   141 	void *p;

   143 	p = malloc(size);

   144 	memset(p, 0, size);

   146 	return p;

   147 }

   149 struct razor_set_section razor_sections[] = {

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

   151 	{ RAZOR_REQUIRES,	offsetof(struct razor_set, requires) },

   152 	{ RAZOR_PROVIDES,	offsetof(struct razor_set, provides) },

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

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

   155 	{ RAZOR_REQUIRES_POOL,	offsetof(struct razor_set, requires_pool) },

   156 	{ RAZOR_PROVIDES_POOL,	offsetof(struct razor_set, provides_pool) },

   157 };

   159 struct razor_set *

   160 razor_set_create(void)

   161 {

   162 	return zalloc(sizeof(struct razor_set));

   163 }

   165 struct razor_set *

   166 razor_set_open(const char *filename)

   167 {

   168 	struct razor_set *set;

   169 	struct razor_set_section *s;

   170 	struct stat stat;

   171 	struct array *array;

   172 	int fd;

   174 	set = zalloc(sizeof *set);

   175 	fd = open(filename, O_RDONLY);

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

   177 		return NULL;

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

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

   180 		free(set);

   181 		return NULL;

   182 	}

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

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

   186 			continue;

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

   188 			continue;

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

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

   191 		array->size = s->size;

   192 		array->alloc = s->size;

   193 	}

   194 	close(fd);

   196 	return set;

   197 }

   199 void

   200 razor_set_destroy(struct razor_set *set)

   201 {

   202 	unsigned int size;

   203 	struct array *a;

   204 	int i;

   206 	if (set->header) {

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

   208 			;

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

   210 		munmap(set->header, size);

   211 	} else {

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

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

   214 			free(a->data);

   215 		}

   216 	}

   218 	free(set);

   219 }

   221 int

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

   223 {

   224 	char data[4096];

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

   226 	struct array *a;

   227 	unsigned long offset;

   228 	int i, fd;

   230 	memset(data, 0, sizeof data);

   231 	header->magic = RAZOR_MAGIC;

   232 	header->version = RAZOR_VERSION;

   233 	offset = sizeof data;

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

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

   237 			continue;

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

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

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

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

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

   243 	}

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

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

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

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

   250 	if (fd < 0)

   251 		return -1;

   253 	write_to_fd(fd, data, sizeof data);

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

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

   256 			continue;

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

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

   259 	}

   261 	close(fd);

   263 	return 0;

   264 }

   266 static unsigned int

   267 hash_string(const char *key)

   268 {

   269 	const char *p;

   270 	unsigned int hash = 0;

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

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

   275 	return hash;

   276 }

   278 static unsigned long

   279 razor_importer_lookup(struct razor_importer *importer, const char *key)

   280 {

   281 	unsigned int mask, start, i;

   282 	unsigned long *b;

   283 	char *pool;

   285 	pool = importer->set->string_pool.data;

   286 	mask = importer->buckets.alloc - 1;

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

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

   290 		b = importer->buckets.data + ((start + i) & mask);

   292 		if (*b == 0)

   293 			return 0;

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

   296 			return *b;

   297 	}

   299 	return 0;

   300 }

   302 static unsigned long

   303 add_to_string_pool(struct razor_set *set, const char *key)

   304 {

   305 	int len;

   306 	char *p;

   308 	len = strlen(key) + 1;

   309 	p = array_add(&set->string_pool, len);

   310 	memcpy(p, key, len);

   312 	return p - (char *) set->string_pool.data;

   313 }

   315 static unsigned long

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

   317 {

   318 	unsigned long  *p;

   320 	p = array_add(properties, sizeof *p);

   321 	*p = ~0ul;

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

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

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

   326 }

   328 static void

   329 do_insert(struct razor_importer *importer, unsigned long value)

   330 {

   331 	unsigned int mask, start, i;

   332 	unsigned long *b;

   333 	const char *key;

   335 	key = (char *) importer->set->string_pool.data + value;

   336 	mask = importer->buckets.alloc - 1;

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

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

   340 		b = importer->buckets.data + ((start + i) & mask);

   341 		if (*b == 0) {

   342 			*b = value;

   343 			break;

   344 		}

   345 	}

   346 }

   348 static unsigned long

   349 razor_importer_insert(struct razor_importer *importer, const char *key)

   350 {

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

   352 	int alloc;

   354 	alloc = importer->buckets.alloc;

   355 	array_add(&importer->buckets, 4 * sizeof *buckets);

   356 	if (alloc != importer->buckets.alloc) {

   357 		end = importer->buckets.data + alloc;

   358 		memset(end, 0, importer->buckets.alloc - alloc);

   359 		for (b = importer->buckets.data; b < end; b++) {

   360 			value = *b;

   361 			if (value != 0) {

   362 				*b = 0;

   363 				do_insert(importer, value);

   364 			}

   365 		}

   366 	}

   368 	value = add_to_string_pool(importer->set, key);

   369 	do_insert (importer, value);

   371 	return value;

   372 }

   374 static unsigned long

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

   376 {

   377 	unsigned long token;

   379 	if (string == NULL)

   380 		return razor_importer_tokenize(importer, "");

   382 	token = razor_importer_lookup(importer, string);

   383 	if (token != 0)

   384 		return token;

   386 	return razor_importer_insert(importer, string);

   387 }

   389 void

   390 razor_importer_begin_package(struct razor_importer *importer,

   391 			     const char *name, const char *version)

   392 {

   393 	struct razor_package *p;

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

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

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

   399 	importer->package = p;

   400 	array_init(&importer->requires.package);

   401 	array_init(&importer->provides.package);

   402 }

   404 void

   405 razor_importer_finish_package(struct razor_importer *importer)

   406 {

   407 	struct razor_package *p;

   409 	p = importer->package;

   410 	p->requires = add_to_property_pool(&importer->set->requires_pool,

   411 					   &importer->requires.package);

   412 	p->provides = add_to_property_pool(&importer->set->provides_pool,

   413 					   &importer->provides.package);

   415 	array_release(&importer->requires.package);

   416 	array_release(&importer->provides.package);

   417 }

   419 static void

   420 razor_importer_add_property(struct razor_importer *importer,

   421 			    struct import_property_context *pctx,

   422 			    const char *name, const char *version)

   423 {

   424 	struct razor_property *p;

   425 	unsigned long *r;

   427 	p = array_add(pctx->all, sizeof *p);

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

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

   430 	p->packages = importer->package -

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

   433 	r = array_add(&pctx->package, sizeof *r);

   434 	*r = p - (struct razor_property *) pctx->all->data;

   435 }

   437 void

   438 razor_importer_add_requires(struct razor_importer *importer,

   439 			    const char *name, const char *version)

   440 {

   441 	razor_importer_add_property(importer,

   442 				    &importer->requires, name, version);

   443 }

   445 void

   446 razor_importer_add_provides(struct razor_importer *importer,

   447 			    const char *name, const char *version)

   448 {

   449 	razor_importer_add_property(importer,

   450 				    &importer->provides, name, version);

   451 }

   453 struct razor_importer *

   454 razor_importer_new(void)

   455 {

   456 	struct razor_importer *importer;

   458 	importer = zalloc(sizeof *importer);

   459 	importer->set = razor_set_create();

   460 	importer->requires.all = &importer->set->requires;

   461 	importer->provides.all = &importer->set->provides;

   463 	return importer;

   464 }

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

   467 					const void *p,

   468 					void *data);

   470 struct qsort_context {

   471 	size_t size;

   472 	compare_with_data_func_t compare;

   473 	void *data;

   474 };

   476 static void

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

   478 {

   479 	char buffer[size];

   481 	memcpy(buffer, p1, size);

   482 	memcpy(p1, p2, size);

   483 	memcpy(p2, buffer, size);

   484 }

   486 static void

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

   488 		  struct qsort_context *ctx)

   489 {

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

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

   492 	int left, right, result;

   493 	size_t size = ctx->size;

   495 	p = base;

   496 	start = base;

   497 	end = base + nelem * size;

   498 	mp = map;

   499 	mstart = map;

   500 	mend = map + nelem;

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

   503 	while (p < end) {

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

   505 		if (result < 0) {

   506 			qsort_swap(p, start, size);

   507 			tmp = *mp;

   508 			*mp = *mstart;

   509 			*mstart = tmp;

   510 			if (start == pivot)

   511 				pivot = p;

   512 			start += size;

   513 			mstart++;

   514 			p += size;

   515 			mp++;

   516 		} else if (result == 0) {

   517 			p += size;

   518 			mp++;

   519 		} else {

   520  			end -= size;

   521 			mend--;

   522 			qsort_swap(p, end, size);

   523 			tmp = *mp;

   524 			*mp = *mend;

   525 			*mend = tmp;

   526 			if (end == pivot)

   527 				pivot = p;

   528 		}

   529 	}

   531 	left = (start - base) / size;

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

   533 	if (left > 1)

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

   535 	if (right > 1)

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

   537 }

   539 unsigned long *

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

   541 		compare_with_data_func_t compare, void *data)

   542 {

   543 	struct qsort_context ctx;

   544 	unsigned long *map;

   545 	int i;

   547 	ctx.size = size;

   548 	ctx.compare = compare;

   549 	ctx.data = data;

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

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

   553 		map[i] = i;

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

   557 	return map;

   558 }

   560 static int

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

   562 {

   563 	const char *p1, *p2;

   564 	long n1, n2;

   565 	int res;

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

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

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

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

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

   573 	if (res < 0) {

   574 		n1 = 0;

   575 		p1 = s1;

   576 		p2++;

   577 	} else if (res > 0) {

   578 		p1++;

   579 		n2 = 0;

   580 		p2 = s2;

   581 	}

   583 	if (n1 != n2)

   584 		return n1 - n2;

   585 	while (*p1 && *p2) {

   586 		if (*p1 != *p2)

   587 			return *p1 - *p2;

   588 		p1++;

   589 		p2++;

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

   591 			return versioncmp(p1, p2);

   592 	}

   594 	return *p1 - *p2;

   595 }

   598 static int

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

   600 {

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

   602 	struct razor_set *set = data;

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

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

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

   607 	else

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

   609 }

   611 static int

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

   613 {

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

   615 	struct razor_set *set = data;

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

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

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

   620 	else

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

   622 }

   624 static unsigned long *

   625 uniqueify_properties(struct razor_set *set, struct array *properties)

   626 {

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

   628 	struct array *pkgs, *p;

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

   630 	int i, count, unique;

   632 	count = properties->size / sizeof(struct razor_property);

   633 	map = qsort_with_data(properties->data,

   634 			      count,

   635 			      sizeof(struct razor_property),

   636 			      compare_properties,

   637 			      set);

   639 	rp_end = properties->data + properties->size;

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

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

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

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

   644 			up++;

   645 			up->name = rp->name;

   646 			up->version = rp->version;

   647 		}

   649 		unique = up - (struct razor_property *) properties->data;

   650 		rmap[map[i]] = unique;

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

   652 		*r = rp->packages;

   653 	}

   654 	free(map);

   656 	up++;

   657 	properties->size = (void *) up - properties->data;

   658 	rp_end = up;

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

   660 		rp->packages = add_to_property_pool(&set->package_pool, p);

   661 		array_release(p);

   662 	}

   664 	free(pkgs);

   666 	return rmap;

   667 }

   669 static void

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

   671 {

   672 	unsigned long *p, *end;

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

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

   676 		if (*p != ~0)

   677 			*p = map[*p];

   678 }

   680 struct razor_set *

   681 razor_importer_finish(struct razor_importer *importer)

   682 {

   683 	struct razor_set *set;

   684 	unsigned long *map, *rmap;

   685 	int i, count;

   687 	map = uniqueify_properties(importer->set, &importer->set->requires);

   688 	remap_links(&importer->set->requires_pool, map);

   689 	free(map);

   691 	map = uniqueify_properties(importer->set, &importer->set->provides);

   692 	remap_links(&importer->set->provides_pool, map);

   693 	free(map);

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

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

   697 			      count,

   698 			      sizeof(struct razor_package),

   699 			      compare_packages,

   700 			      importer->set);

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

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

   704 		rmap[map[i]] = i;

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

   707 	free(map);

   708 	free(rmap);

   710 	set = importer->set;

   711 	array_release(&importer->buckets);

   712 	free(importer);

   714 	return set;

   715 }

   717 void

   718 razor_set_list(struct razor_set *set)

   719 {

   720 	struct razor_package *p, *end;

   721 	char *pool;

   723 	pool = set->string_pool.data;

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

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

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

   727 }

   729 struct razor_set *bsearch_set;

   731 static int

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

   733 {

   734 	const struct razor_package *p = data;

   735 	char *pool;

   737 	pool = bsearch_set->string_pool.data;

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

   740 }

   742 struct razor_package *

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

   744 {

   745 	bsearch_set = set;

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

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

   748 		       sizeof(struct razor_package), compare_package_name);

   749 }

   751 static int

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

   753 {

   754 	const struct razor_property *p = data;

   755 	char *pool;

   757 	pool = bsearch_set->string_pool.data;

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

   760 }

   762 struct razor_property *

   763 razor_set_get_property(struct razor_set *set,

   764 		       struct array *properties,

   765 		       const char *property)

   766 {

   767 	struct razor_property *p, *start;

   769 	bsearch_set = set;

   770 	p = bsearch(property, properties->data,

   771 		    properties->size / sizeof(struct razor_property),

   772 		    sizeof(struct razor_property), compare_property_name);

   774 	start = properties->data;

   775 	while (p > start && (p - 1)->name == p->name)

   776 		p--;

   778 	return p;

   779 }

   781 static void

   782 razor_set_list_all_properties(struct razor_set *set, struct array *properties)

   783 {

   784 	struct razor_property *p, *end;

   785 	char *pool;

   787 	pool = set->string_pool.data;

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

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

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

   791 }

   793 void

   794 razor_set_list_requires(struct razor_set *set, const char *name)

   795 {

   796 	struct razor_property *p, *requires;

   797 	struct razor_package *package;

   798 	unsigned long *r;

   799 	char *pool;

   801 	if (name) {

   802 		package = razor_set_get_package(set, name);

   803 		r = (unsigned long *) set->requires_pool.data +

   804 			package->requires;

   805 		requires = set->requires.data;

   806 		pool = set->string_pool.data;

   807 		while (~*r) {

   808 			p = &requires[*r++];

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

   810 		}

   811 	} else

   812 		razor_set_list_all_properties(set, &set->requires);

   813 }

   815 void

   816 razor_set_list_provides(struct razor_set *set, const char *name)

   817 {

   818 	struct razor_property *p, *provides;

   819 	struct razor_package *package;

   820 	unsigned long *r;

   821 	char *pool;

   823 	if (name) {

   824 		package = razor_set_get_package(set, name);

   825 		r = (unsigned long *) set->provides_pool.data +

   826 			package->provides;

   827 		provides = set->provides.data;

   828 		pool = set->string_pool.data;

   829 		while (~*r) {

   830 			p = &provides[*r++];

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

   832 		}

   833 	} else

   834 		razor_set_list_all_properties(set, &set->provides);

   835 }

   837 static void

   838 razor_set_list_property_packages(struct razor_set *set,

   839 				 struct array *properties,

   840 				 const char *name,

   841 				 const char *version)

   842 {

   843 	struct razor_property *property, *end;

   844 	struct razor_package *p, *packages;

   845 	unsigned long *r;

   846 	char *pool;

   848 	if (name == NULL)

   849 		return;

   851 	property = razor_set_get_property(set, properties, name);

   852 	packages = set->packages.data;

   853 	pool = set->string_pool.data;

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

   855 	while (property < end && strcmp(name, &pool[property->name]) == 0) {

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

   857 			goto next;

   858 		r = (unsigned long *)

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

   860 		while (~*r) {

   861 			p = &packages[*r++];

   862 			printf("%s %s\n",

   863 			       &pool[p->name], &pool[p->version]);

   864 		}

   865 	next:

   866 		property++;

   867 	}

   868 }

   870 void

   871 razor_set_list_requires_packages(struct razor_set *set,

   872 				 const char *name,

   873 				 const char *version)

   874 {

   875 	razor_set_list_property_packages(set, &set->requires, name, version);

   876 }

   878 void

   879 razor_set_list_provides_packages(struct razor_set *set,

   880 				 const char *name,

   881 				 const char *version)

   882 {

   883 	razor_set_list_property_packages(set, &set->provides, name, version);

   884 }

   886 static void

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

   888 {

   889 	struct razor_property *r, *p, *rend, *pend;

   890 	unsigned long *u;

   891 	char *pool;

   893 	p = set->provides.data;

   894 	rend = set->requires.data + set->requires.size;

   895 	pend = set->provides.data + set->provides.size;

   896 	pool = set->string_pool.data;

   898 	for (r = set->requires.data; r < rend; r++) {

   899 		while (p < pend && strcmp(&pool[r->name], &pool[p->name]) > 0)

   900 			p++;

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

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

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

   905 			p++;

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

   908 		 * etc) to properly determine if a requires is

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

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

   912 		if (p == pend || strcmp(&pool[r->name], &pool[p->name]) != 0 ||

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

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

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

   916 				continue;

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

   918 			*u = r - (struct razor_property *) set->requires.data;

   919 		}

   920 	}

   921 }

   923 void

   924 razor_set_list_unsatisfied(struct razor_set *set)

   925 {

   926 	struct array unsatisfied;

   927 	struct razor_property *requires, *r;

   928 	unsigned long *u, *end;

   929 	char *pool;

   931 	array_init(&unsatisfied);

   932 	razor_set_validate(set, &unsatisfied);

   934 	end = unsatisfied.data + unsatisfied.size;

   935 	requires = set->requires.data;

   936 	pool = set->string_pool.data;

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

   939 		r = requires + *u;

   940 		printf("%s %s not satisfied\n",

   941 		       &pool[r->name], &pool[r->version]);

   942 	}

   944 	array_release(&unsatisfied);

   945 }

   947 #define UPSTREAM_SOURCE 0x80000000ul

   948 #define INDEX_MASK 0x00fffffful

   950 struct source {

   951 	struct razor_set *set;

   952 	unsigned long *requires_map;

   953 	unsigned long *provides_map;

   954 };

   956 static void

   957 prepare_source(struct source *source, struct razor_set *set)

   958 {

   959 	int count;

   960 	size_t size;

   962 	source->set = set;

   964 	count = set->requires.size / sizeof (struct razor_property);

   965 	size = count * sizeof *source->requires_map;

   966 	source->requires_map = zalloc(size);

   968 	count = set->provides.size / sizeof (struct razor_property);

   969 	size = count * sizeof *source->provides_map;

   970 	source->provides_map = zalloc(size);

   971 }

   973 static void

   974 add_package(struct razor_importer *importer,

   975 	    struct razor_package *package, struct source *source,

   976 	    unsigned long flags)

   977 {

   978 	char *pool;

   979 	unsigned long *r;

   980 	struct razor_package *p;

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

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

   984 	p->name = razor_importer_tokenize(importer, &pool[package->name]);

   985 	p->name |= flags;

   986 	p->version = razor_importer_tokenize(importer,

   987 					     &pool[package->version]);

   988 	p->requires = package->requires;

   989 	p->provides = package->provides;

   991 	r = (unsigned long *)

   992 		source->set->requires_pool.data + package->requires;

   993 	while (*r != ~0)

   994 		source->requires_map[*r++] = 1;

   996 	r = (unsigned long *)

   997 		source->set->provides_pool.data + package->provides;

   998 	while (*r != ~0)

   999 		source->provides_map[*r++] = 1;

  1000 }

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

  1004  * Build new string pool as we go. (for now we just re-use that part of

  1005  * the importer). */

  1006 static void

  1007 merge_packages(struct razor_importer *importer,

  1008 	       struct source *source1, struct source *source2,

  1009 	       struct array *packages)

  1010 {

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

  1012 	char *spool, *upool;

  1013 	unsigned long *u, *uend;

  1014 	int cmp;

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

  1018 	u = packages->data;

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

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

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

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

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

  1026 	while (s < send) {

  1027 		p = upstream_packages + *u;

  1029 		if (u < uend)

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

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

  1032 			add_package(importer, s, source1, 0);

  1033 			s++;

  1034 		} else if (cmp == 0) {

  1035 			add_package(importer, p, source2, UPSTREAM_SOURCE);

  1036 			s++;

  1037 			u++;

  1038 		} else {

  1039 			add_package(importer, p, source2, UPSTREAM_SOURCE);

  1040 			u++;

  1041 		}

  1042 	}

  1043 }

  1045 static unsigned long

  1046 add_property(struct razor_importer *importer, struct array *properties,

  1047 	     const char *name, const char *version)

  1048 {

  1049 	struct razor_property *p;

  1051 	p = array_add(properties, sizeof *p);

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

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

  1055 	return p - (struct razor_property *) properties->data;

  1056 }

  1058 static void

  1059 merge_properties(struct array *properties,

  1060 		 struct razor_importer *importer,

  1061 		 struct razor_set *set1,

  1062 		 struct array *properties1,

  1063 		 unsigned long *map1,

  1064 		 struct razor_set *set2,

  1065 		 struct array *properties2,

  1066 		 unsigned long *map2)

  1067 {

  1068 	struct razor_property *p1, *p2;

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

  1070 	char *pool1, *pool2;

  1072 	i = 0;

  1073 	j = 0;

  1074 	pool1 = set1->string_pool.data;

  1075 	pool2 = set2->string_pool.data;

  1077 	count1 = properties1->size / sizeof *p1;

  1078 	count2 = properties2->size / sizeof *p2;

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

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

  1081 			i++;

  1082 			continue;

  1083 		}

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

  1085 			j++;

  1086 			continue;

  1087 		}

  1088 		p1 = (struct razor_property *) properties1->data + i;

  1089 		p2 = (struct razor_property *) properties2->data + j;

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

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

  1092 		else if (i < count1)

  1093 			cmp = -1;

  1094 		else

  1095 			cmp = 1;

  1096 		if (cmp == 0)

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

  1098 					 &pool2[p2->version]);

  1099 		if (cmp < 0) {

  1100 			map1[i++] = add_property(importer,

  1101 						 properties,

  1102 						 &pool1[p1->name],

  1103 						 &pool1[p1->version]);

  1104 		} else if (cmp > 0) {

  1105 			map2[j++] = add_property(importer,

  1106 						 properties,

  1107 						 &pool2[p2->name],

  1108 						 &pool2[p2->version]);

  1109 		} else  {

  1110 			map1[i++] = map2[j++] = add_property(importer,

  1111 							     properties,

  1112 							     &pool1[p1->name],

  1113 							     &pool1[p1->version]);

  1114 		}

  1115 	}

  1116 }

  1118 static unsigned long

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

  1120 		unsigned long *map, struct array *pool)

  1121 {

  1122 	unsigned long r, *p, *q;

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

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

  1126 	while (*p != ~0) {

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

  1128 		*q = map[*p++];

  1129 	}

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

  1132 	*q = ~0;

  1134 	return r;

  1135 }

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

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

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

  1140  * the arrays for their properties. */

  1141 static void

  1142 rebuild_package_lists(struct razor_set *set)

  1143 {

  1144 	int requires_count, provides_count;

  1145 	struct array *requires_pkgs, *provides_pkgs, *a;

  1146 	struct razor_package *pkg, *pkg_end;

  1147 	struct razor_property *prop, *prop_end;

  1148 	unsigned long *r, *q, *rpool, *ppool;

  1150 	requires_count = set->requires.size / sizeof (struct razor_property);

  1151 	provides_count = set->provides.size / sizeof (struct razor_property);

  1152 	requires_pkgs = zalloc(requires_count * sizeof *requires_pkgs);

  1153 	provides_pkgs = zalloc(provides_count * sizeof *provides_pkgs);

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

  1155 	rpool = set->requires_pool.data;

  1156 	ppool = set->provides_pool.data;

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

  1159 		for (r = &rpool[pkg->requires]; *r != ~0; r++) {

  1160 			q = array_add(&requires_pkgs[*r], sizeof *q);

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

  1162 		}

  1163 		for (r = &ppool[pkg->provides]; *r != ~0; r++) {

  1164 			q = array_add(&provides_pkgs[*r], sizeof *q);

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

  1166 		}

  1167 	}

  1169 	prop_end = set->requires.data + set->requires.size;

  1170 	a = requires_pkgs;

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

  1172 		prop->packages = add_to_property_pool(&set->requires_pool, a);

  1173 		array_release(a);

  1174 	}

  1175 	free(requires_pkgs);

  1177 	prop_end = set->provides.data + set->provides.size;

  1178 	a = provides_pkgs;

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

  1180 		prop->packages = add_to_property_pool(&set->provides_pool, a);

  1181 		array_release(a);

  1182 	}

  1183 	free(provides_pkgs);

  1184 }

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

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

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

  1189  * enforce validity of the resulting package set.

  1190  *

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

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

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

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

  1195  */

  1196 struct razor_set *

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

  1198 	      struct array *packages)

  1199 {

  1200 	struct razor_set *result;

  1201 	struct razor_importer *importer;

  1202 	struct razor_package *p, *pend;

  1203 	struct source source, upstream_source;

  1205 	importer = razor_importer_new();

  1207 	prepare_source(&upstream_source, upstream);

  1208 	prepare_source(&source, set);

  1210 	merge_packages(importer, &source, &upstream_source, packages);

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

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

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

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

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

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

  1218 	 * property list for both sets. */

  1220 	merge_properties(&importer->set->requires, importer,

  1221 			 set, &set->requires, source.requires_map,

  1222 			 upstream, &upstream->requires,

  1223 			 upstream_source.requires_map);

  1224 	merge_properties(&importer->set->provides, importer,

  1225 			 set, &set->provides, source.provides_map,

  1226 			 upstream, &upstream->provides,

  1227 			 upstream_source.provides_map);

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

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

  1232 	pend = importer->set->packages.data + importer->set->packages.size;

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

  1234 		struct source *src;

  1236 		if (p->name & UPSTREAM_SOURCE)

  1237 			src = &upstream_source;

  1238 		else

  1239 			src = &source;

  1241 		p->requires = emit_properties(&src->set->requires_pool,

  1242 					      p->requires,

  1243 					      src->requires_map,

  1244 					      &importer->set->requires_pool);

  1245 		p->provides = emit_properties(&src->set->provides_pool,

  1246 					      p->provides,

  1247 					      src->provides_map,

  1248 					      &importer->set->provides_pool);

  1249 		p->name &= INDEX_MASK;

  1250 	}

  1252 	rebuild_package_lists(importer->set);

  1254 	result = importer->set;

  1255 	array_release(&importer->buckets);

  1256 	free(importer);

  1258 	return result;

  1259 }

  1261 void

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

  1263 		  struct razor_set *upstream, struct array *list)

  1264 {

  1265 	struct razor_property *requires, *r;

  1266 	struct razor_property *p, *pend;

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

  1268 	char *pool, *upool;

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

  1271 	requires = set->requires.data;

  1272 	pool = set->string_pool.data;

  1274 	p = upstream->provides.data;

  1275 	pend = upstream->provides.data + upstream->provides.size;

  1276 	upool = upstream->string_pool.data;

  1277 	package_pool = upstream->package_pool.data;

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

  1280 		r = requires + *u;

  1282 		while (p < pend && strcmp(&pool[r->name], &upool[p->name]) > 0)

  1283 			p++;

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

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

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

  1287 			p++;

  1289 		if (p == pend ||

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

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

  1292 			/* Do we need to track unsatisfiable requires

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

  1294 			 * razor_set_validate() at the end? */

  1295 		} else {

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

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

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

  1299 		}

  1300 	}

  1301 }

  1303 static void

  1304 find_packages(struct razor_set *set,

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

  1306 {

  1307 	struct razor_package *p;

  1308 	unsigned long *r;

  1309 	int i;

  1311 	/* FIXME: Sort the packages. */

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

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

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

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

  1316 	}

  1317 }

  1319 static void

  1320 find_all_packages(struct razor_set *set,

  1321 		  struct razor_set *upstream, struct array *list)

  1322 {

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

  1324 	unsigned long *r;

  1325 	char *pool, *upool;

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

  1328 	pool = set->string_pool.data;

  1329 	u = upstream->packages.data;

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

  1331 	upool = upstream->string_pool.data;

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

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

  1335 			u++;

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

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

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

  1339 		}

  1340 	}

  1341 }

  1343 struct razor_set *

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

  1345 		 int count, const char **packages)

  1346 {

  1347 	struct razor_set *new;

  1348 	struct razor_package *upackages;

  1349 	struct array list, unsatisfied;

  1350 	char *pool;

  1351 	unsigned long *u, *end;

  1352 	int total = 0;

  1354 	array_init(&list);

  1355 	if (count > 0)

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

  1357 	else

  1358 		find_all_packages(set, upstream, &list);

  1360 	end = list.data + list.size;

  1361 	upackages = upstream->packages.data;

  1362 	pool = upstream->string_pool.data;

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

  1365 	while (list.size > 0) {

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

  1367 		array_release(&list);

  1368 		razor_set_destroy(set);

  1369 		set = new;

  1371 		array_init(&unsatisfied);

  1372 		razor_set_validate(new, &unsatisfied);

  1373 		array_init(&list);

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

  1375 		array_release(&unsatisfied);

  1377 		end = list.data + list.size;

  1378 		upackages = upstream->packages.data;

  1379 		pool = upstream->string_pool.data;

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

  1381 	}

  1383 	array_release(&list);

  1385 	return set;

  1386 }

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

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

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

  1391  **/

  1393 void

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

  1395 	       razor_package_callback_t callback, void *data)

  1396 {

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

  1398 	char *ppool, *upool;

  1399 	int res = 0;

  1401 	p = set->packages.data;

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

  1403 	ppool = set->string_pool.data;

  1405 	u = upstream->packages.data;

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

  1407 	upool = upstream->string_pool.data;

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

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

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

  1412 			if (res == 0)

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

  1414 						 &upool[u->version]);

  1415 		}

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

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

  1419 				 NULL, data);

  1420 			p++;

  1421 			continue;

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

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

  1424 				 data);

  1425 			u++;

  1426 			continue;

  1427 		} else {

  1428 			p++;

  1429 			u++;

  1430 		}

  1431 	}

  1432 }

author	Kristian H?gsberg <krh@redhat.com>
	Fri Oct 05 16:38:59 2007 -0400 (2007-10-05)
changeset 45	6b5f03f1c084
parent 43	d37d57c99cac
child 46	8de578466ece
permissions	-rw-r--r--