Mercurialrazor / file revision
summary | shortlog | changelog | graph | tags | branches | files | changeset | file | revisions | annotate | diff | raw
librazor/razor.c
author J. Ali Harlow <ali@juiblex.co.uk>
Thu Oct 01 20:02:23 2009 +0100 (2009-10-01)
changeset 389 4aac72ec4537
parent 387 ef9237601f24
child 390 297c6c8be2d1
permissions -rw-r--r--
Fix bug causing razor update foo to always install foo 
     1 /*

     2  * Copyright (C) 2008  Kristian Høgsberg <krh@redhat.com>

     3  * Copyright (C) 2008  Red Hat, Inc

     4  * Copyright (C) 2009  J. Ali Harlow <ali@juiblex.co.uk>

     5  *

     6  * This program is free software; you can redistribute it and/or modify

     7  * it under the terms of the GNU General Public License as published by

     8  * the Free Software Foundation; either version 2 of the License, or

     9  * (at your option) any later version.

    10  *

    11  * This program is distributed in the hope that it will be useful,

    12  * but WITHOUT ANY WARRANTY; without even the implied warranty of

    13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    14  * GNU General Public License for more details.

    15  *

    16  * You should have received a copy of the GNU General Public License along

    17  * with this program; if not, write to the Free Software Foundation, Inc.,

    18  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.

    19  */

    20 

    21 #define _GNU_SOURCE

    22 

    23 #include "config.h"

    24 

    25 #include <stdlib.h>

    26 #include <stddef.h>

    27 #include <stdint.h>

    28 #include <stdio.h>

    29 #include <stdarg.h>

    30 #include <string.h>

    31 #include <sys/types.h>

    32 #include <sys/stat.h>

    33 #include <unistd.h>

    34 #include <fcntl.h>

    35 #include <errno.h>

    36 #include <ctype.h>

    37 #include <fnmatch.h>

    38 #include <limits.h>

    39 #include <assert.h>

    40 #ifdef MSWIN_API

    41 #include <windows.h>

    42 #endif

    43 

    44 #include "razor-internal.h"

    45 #include "razor.h"

    46 

    47 #ifndef O_BINARY

    48 #define O_BINARY	0

    49 #endif

    50 

    51 void *

    52 zalloc(size_t size)

    53 {

    54 	void *p;

    55 

    56 	p = malloc(size);

    57 	memset(p, 0, size);

    58 

    59 	return p;

    60 }

    61 

    62 struct razor_set_section_index {

    63 	const char *name;

    64 	uint32_t offset;

    65 	uint32_t flags;

    66 };

    67 

    68 #define MAIN(type, field) \

    69 	{ type, offsetof(struct razor_set, field), RAZOR_SECTION_MAIN }

    70 #define FILES(type, field) \

    71 	{ type, offsetof(struct razor_set, field), RAZOR_SECTION_FILES }

    72 #define DETAILS(type, field) \

    73 	{ type, offsetof(struct razor_set, field), RAZOR_SECTION_DETAILS }

    74 

    75 struct razor_set_section_index razor_sections[] = {

    76 	MAIN(RAZOR_STRING_POOL, string_pool),

    77 	MAIN(RAZOR_PACKAGES, packages),

    78 	MAIN(RAZOR_PROPERTIES, properties),

    79 	MAIN(RAZOR_PACKAGE_POOL, package_pool),

    80 	MAIN(RAZOR_PROPERTY_POOL, property_pool),

    81 	MAIN(RAZOR_PREFIX_POOL, prefix_pool),

    82 	FILES(RAZOR_FILES, files),

    83 	FILES(RAZOR_FILE_POOL, file_pool),

    84 	FILES(RAZOR_FILE_STRING_POOL, file_string_pool),

    85 	DETAILS(RAZOR_DETAILS_STRING_POOL, details_string_pool)

    86 };

    87 

    88 RAZOR_EXPORT struct razor_set *

    89 razor_set_create_without_root(void)

    90 {

    91 	struct razor_set *set;

    92 	char *empty;

    93 

    94 	set = zalloc(sizeof *set);

    95 

    96 	empty = array_add(&set->string_pool, 1);

    97 	*empty = '\0';

    98 

    99 	set->lock_fd = -1;

   100 

   101 	return set;

   102 }

   103 

   104 RAZOR_EXPORT struct razor_set *

   105 razor_set_create(void)

   106 {

   107 	struct razor_set *set;

   108 	struct razor_entry *e;

   109 

   110 	set = razor_set_create_without_root();

   111 

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

   113 	e->name = 0;

   114 	e->flags = RAZOR_ENTRY_LAST;

   115 	e->start = 0;

   116 	list_set_empty(&e->packages);

   117 

   118 	return set;

   119 }

   120 

   121 struct razor_mapped_file {

   122 	struct razor_set_header *header;

   123 	size_t size;

   124 	struct razor_mapped_file *next;

   125 };

   126 

   127 RAZOR_EXPORT int

   128 razor_set_bind_sections(struct razor_set *set, const char *filename)

   129 {

   130 	struct razor_set_section *s, *sections;

   131 	struct razor_mapped_file *file;

   132 	const char *pool;

   133 	struct array *array;

   134 	int i, j;

   135 

   136 	file = zalloc(sizeof *file);

   137 	if (file == NULL)

   138 		return -1;

   139 

   140 	file->header = razor_file_get_contents(filename, &file->size);

   141 	if (!file->header) {

   142 		free(file);

   143 		return -1;

   144 	}

   145 

   146 	if (set->mapped_files == NULL) {

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

   148 			array = (void *) set + razor_sections[i].offset;

   149 			array_release(array);

   150 		}

   151 	}

   152 

   153 	file->next = set->mapped_files;

   154 	set->mapped_files = file;

   155 

   156 	sections = (void *) file->header + sizeof *file->header;

   157 	pool = (void *) sections +

   158 		file->header->num_sections * sizeof *sections;

   159 

   160 	for (i = 0; i < file->header->num_sections; i++) {

   161 		s = sections + i;

   162 		for (j = 0; j < ARRAY_SIZE(razor_sections); j++)

   163 			if (!strcmp(razor_sections[j].name, &pool[s->name]))

   164 				break;

   165 		if (j == ARRAY_SIZE(razor_sections))

   166 			continue;

   167 		array = (void *) set + razor_sections[j].offset;

   168 		array->data = (void *) file->header + s->offset;

   169 		array->size = s->size;

   170 		array->alloc = s->size;

   171 	}

   172 

   173 	return 0;

   174 }

   175 

   176 RAZOR_EXPORT struct razor_set *

   177 razor_set_open(const char *filename)

   178 {

   179 	struct razor_set *set;

   180 

   181 	set = zalloc(sizeof *set);

   182 	set->lock_fd = -1;

   183 	if (razor_set_bind_sections(set, filename)){

   184 		free(set);

   185 		return NULL;

   186 	}

   187 	return set;

   188 }

   189 

   190 int

   191 razor_set_aquire_lock(struct razor_set *set, const char *path, int exclusive)

   192 {

   193 	int fd;

   194 	assert(set != NULL);

   195 

   196 	if (path) {

   197 		fd = open(path, O_CREAT | O_RDWR | O_TRUNC | O_BINARY, 0666);

   198 		if (fd < 0)

   199 			return -1;

   200 	} else {

   201 		fd = -1;

   202 	}

   203 

   204 #ifdef MSWIN_API

   205 	DWORD flags = LOCKFILE_FAIL_IMMEDIATELY;

   206 	OVERLAPPED lock = {0};

   207 

   208 	if (exclusive)

   209 		flags |= LOCKFILE_EXCLUSIVE_LOCK;

   210 	if (fd >= 0 && !LockFileEx(_get_osfhandle(fd), flags, 0, 1, 0, &lock)) {

   211 		close(fd);

   212 		return -1;

   213 	}

   214 	if (set->lock_fd >= 0)

   215 		(void)UnlockFile(_get_osfhandle(set->lock_fd), 0, 0, 1, 0);

   216 #else

   217 	struct flock lock = {0};

   218 

   219 	lock.l_type = exclusive ? F_WRLCK : F_RDLCK;

   220 	lock.l_whence = SEEK_SET;

   221 	lock.l_start = 0;

   222 	lock.l_len = 0;

   223 	if (fd >= 0 && fcntl(fd, F_SETLK, &lock) < 0) {

   224 		close(fd);

   225 		return -1;

   226 	}

   227 	if (set->lock_fd >= 0) {

   228 		lock.l_type = F_UNLCK;

   229 		(void)fcntl(set->lock_fd, F_SETLK, &lock);

   230 	}

   231 #endif

   232 

   233 	if (set->lock_fd >= 0)

   234 		close(set->lock_fd);

   235 	set->lock_fd = fd;

   236 

   237 	return 0;

   238 }

   239 

   240 RAZOR_EXPORT void

   241 razor_set_destroy(struct razor_set *set)

   242 {

   243 	struct razor_mapped_file *file, *next;

   244 	struct array *array;

   245 	int i;

   246 

   247 	assert (set != NULL);

   248 

   249 	if (set->mapped_files == NULL) {

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

   251 			array = (void *) set + razor_sections[i].offset;

   252 			array_release(array);

   253 		}

   254 	} else {

   255 		for (file = set->mapped_files; file != NULL; file = next) {

   256 			next = file->next;

   257 			razor_file_free_contents(file->header, file->size);

   258 			free(file);

   259 		}

   260 	}

   261 

   262 	razor_set_aquire_lock(set, NULL, 0);

   263 	free(set);

   264 }

   265 

   266 RAZOR_EXPORT int

   267 razor_set_write_to_fd(struct razor_set *set, int fd, uint32_t section_mask)

   268 {

   269 	struct razor_set_header header;

   270 	struct razor_set_section sections[ARRAY_SIZE(razor_sections)];

   271 	struct hashtable table;

   272 	struct array pool, *arrays[ARRAY_SIZE(razor_sections)];

   273 	uint32_t offset;

   274 	int count, i, j;

   275 	static const char padding[4];

   276 

   277 	array_init(&pool);

   278 	hashtable_init(&table, &pool);

   279 

   280 	j = 0;

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

   282 		if ((razor_sections[i].flags & section_mask) == 0)

   283 			continue;

   284 

   285 		arrays[j] = (void *) set + razor_sections[i].offset;

   286 		sections[j].name =

   287 			hashtable_tokenize(&table, razor_sections[i].name);

   288 		j++;

   289 	}

   290 

   291 	count = j;

   292 	header.magic = RAZOR_MAGIC;

   293 	header.version = RAZOR_VERSION;

   294 	header.num_sections = count;

   295 	offset = sizeof header + count * sizeof *sections + ALIGN(pool.size, 4);

   296 

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

   298 		sections[i].offset = offset;

   299 		sections[i].size = arrays[i]->size;

   300 		offset += ALIGN(arrays[i]->size, 4);

   301 	}

   302 

   303 	razor_write(fd, &header, sizeof header);

   304 	razor_write(fd, sections, count * sizeof *sections);

   305 	razor_write(fd, pool.data, pool.size);

   306 	razor_write(fd, padding, PADDING(pool.size, 4));

   307 

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

   309 		razor_write(fd, arrays[i]->data, arrays[i]->size);

   310 		razor_write(fd, padding, PADDING(arrays[i]->size, 4));

   311 	}

   312 

   313 	array_release(&pool);

   314 	hashtable_release(&table);

   315 

   316 	return 0;

   317 }

   318 

   319 RAZOR_EXPORT int

   320 razor_set_write(struct razor_set *set, const char *filename, uint32_t sections)

   321 {

   322 	int fd, status;

   323 

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

   325 	if (fd < 0)

   326 		return -1;

   327 

   328 	status = razor_set_write_to_fd(set, fd, sections);

   329 	if (status) {

   330 	    close(fd);

   331 	    return status;

   332 	}

   333 

   334 	return close(fd);

   335 }

   336 

   337 RAZOR_EXPORT void

   338 razor_build_evr(char *evr_buf, int size, const char *epoch,

   339 		const char *version, const char *release)

   340 {

   341 	int len;

   342 

   343 	if (!version || !*version) {

   344 		*evr_buf = '\0';

   345 		return;

   346 	}

   347 

   348 	if (epoch && *epoch && strcmp(epoch, "0") != 0) {

   349 		len = snprintf(evr_buf, size, "%s:", epoch);

   350 		evr_buf += len;

   351 		size -= len;

   352 	}

   353 	len = snprintf(evr_buf, size, "%s", version);

   354 	evr_buf += len;

   355 	size -= len;

   356 	if (release && *release)

   357 		snprintf(evr_buf, size, "-%s", release);

   358 }

   359 

   360 RAZOR_EXPORT int

   361 razor_versioncmp(const char *s1, const char *s2)

   362 {

   363 	const char *p1, *p2;

   364 	long n1, n2;

   365 	int res;

   366 

   367 	assert (s1 != NULL);

   368 	assert (s2 != NULL);

   369 

   370 	n1 = strtol(s1, (char **) &p1, 10);

   371 	n2 = strtol(s2, (char **) &p2, 10);

   372 

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

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

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

   376 	if (res < 0) {

   377 		n1 = 0;

   378 		p1 = s1;

   379 		p2++;

   380 	} else if (res > 0) {

   381 		p1++;

   382 		n2 = 0;

   383 		p2 = s2;

   384 	}

   385 

   386 	if (n1 != n2)

   387 		return n1 - n2;

   388 	while (*p1 && *p2) {

   389 		if (*p1 != *p2)

   390 			return *p1 - *p2;

   391 		p1++;

   392 		p2++;

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

   394 			return razor_versioncmp(p1, p2);

   395 	}

   396 

   397 	return *p1 - *p2;

   398 }

   399 

   400 static const char *

   401 razor_package_get_details_string(struct razor_set *set,

   402 				 struct razor_package *package,

   403 				 enum razor_detail_type type)

   404 {

   405 	const char *pool;

   406 

   407 	switch (type) {

   408 	case RAZOR_DETAIL_NAME:

   409 		pool = set->string_pool.data;

   410 		return &pool[package->name];

   411 

   412 	case RAZOR_DETAIL_VERSION:

   413 		pool = set->string_pool.data;

   414 		return &pool[package->version];

   415 

   416 	case RAZOR_DETAIL_ARCH:

   417 		pool = set->string_pool.data;

   418 		return &pool[package->arch];

   419 

   420 	case RAZOR_DETAIL_SUMMARY:

   421 		pool = set->details_string_pool.data;

   422 		return &pool[package->summary];

   423 

   424 	case RAZOR_DETAIL_DESCRIPTION:

   425 		pool = set->details_string_pool.data;

   426 		return &pool[package->description];

   427 

   428 	case RAZOR_DETAIL_URL:

   429 		pool = set->details_string_pool.data;

   430 		return &pool[package->url];

   431 

   432 	case RAZOR_DETAIL_LICENSE:

   433 		pool = set->details_string_pool.data;

   434 		return &pool[package->license];

   435 

   436 	case RAZOR_DETAIL_PREUNPROG:

   437 		pool = set->string_pool.data;

   438 		return &pool[package->preun.program];

   439 

   440 	case RAZOR_DETAIL_PREUN:

   441 		pool = set->string_pool.data;

   442 		return &pool[package->preun.body];

   443 

   444 	case RAZOR_DETAIL_POSTUNPROG:

   445 		pool = set->string_pool.data;

   446 		return &pool[package->postun.program];

   447 

   448 	case RAZOR_DETAIL_POSTUN:

   449 		pool = set->string_pool.data;

   450 		return &pool[package->postun.body];

   451 

   452 	default:

   453 		fprintf(stderr, "type %u not found\n", type);

   454 		return NULL;

   455 	}

   456 }

   457 

   458 static const char *const *

   459 razor_package_get_details_array(struct razor_set *set,

   460 				struct razor_package *package,

   461 				enum razor_detail_type type)

   462 {

   463 	switch (type) {

   464 	case RAZOR_DETAIL_PREFIXES:

   465 		/* We don't track prefixes in packages. Install prefixes

   466 		 * are tracked, but we don't provide an API to get them.

   467 		 */

   468 		return NULL;

   469 

   470 	default:

   471 		fprintf(stderr, "type %u not found\n", type);

   472 		return NULL;

   473 	}

   474 }

   475 

   476 /**

   477  * razor_package_get_details_varg:

   478  * @set: a %razor_set

   479  * @package: a %razor_package

   480  * @args: a va_list of arguments to set

   481  **/

   482 void

   483 razor_package_get_details_varg(struct razor_set *set,

   484 			       struct razor_package *package,

   485 			       va_list args)

   486 {

   487 	int i;

   488 	enum razor_detail_type type;

   489 	const char **string;

   490 	const char *const **array;

   491 

   492 	for (i = 0;; i += 2) {

   493 		type = va_arg(args, enum razor_detail_type);

   494 		if (type == RAZOR_DETAIL_LAST)

   495 			break;

   496 		if (type == RAZOR_DETAIL_PREFIXES) {

   497 			array = va_arg(args, const char *const **);

   498 			*array = razor_package_get_details_array(set, package,

   499 								 type);

   500 		} else {

   501 			string = va_arg(args, const char **);

   502 			*string = razor_package_get_details_string(set, package,

   503 								   type);

   504 		}

   505 	}

   506 

   507 }

   508 

   509 /**

   510  * razor_package_get_details:

   511  * @set: a %razor_set

   512  * @package: a %razor_package

   513  *

   514  * Gets details about a package using a varg interface

   515  * The vararg must be terminated with %RAZOR_DETAIL_LAST.

   516  *

   517  * Example: razor_package_get_details (set, package,

   518  *				       RAZOR_DETAIL_URL, &url,

   519  *				       RAZOR_DETAIL_LAST);

   520  **/

   521 RAZOR_EXPORT void

   522 razor_package_get_details(struct razor_set *set, struct razor_package *package, ...)

   523 {

   524 	va_list args;

   525 

   526 	assert (set != NULL);

   527 	assert (package != NULL);

   528 

   529 	va_start(args, NULL);

   530 	razor_package_get_details_varg (set, package, args);

   531 	va_end (args);

   532 }

   533 

   534 /**

   535  * razor_package_remove:

   536  * @prev: The %razor_set before the current transaction

   537  * @next: The %razor_set after the current transaction is applied

   538  * @package: a %razor_package

   539  * @root: the root into which the package is currently installed

   540  * @install_count: the value to pass to uninstall scripts

   541  *

   542  * Removes an installed package.

   543  **/

   544 RAZOR_EXPORT int

   545 razor_package_remove(struct razor_set *prev, struct razor_set *next,

   546 		     struct razor_package *package, const char *root,

   547 		     int install_count)

   548 {

   549 	struct razor_file_iterator *fi;

   550 	struct razor_package_iterator *pi;

   551 	struct razor_package *p;

   552 	char buffer[PATH_MAX];

   553 	const char *name, *program, *script;

   554 	int retval = 0, i, count;

   555 	struct environment env;

   556 	struct list *link;

   557 	const char *prefix;

   558 

   559 	environment_init(&env);

   560 	link = list_first(&package->install_prefixes, &prev->prefix_pool);

   561 	for (i = 0; link; i++) {

   562 		prefix = (const char *)prev->string_pool.data + link->data;

   563 		sprintf(buffer, "RPM_INSTALL_PREFIX%d", i);

   564 		environment_add_variable(&env, buffer, prefix);

   565 		link = list_next(link);

   566 	}

   567 	environment_set(&env);

   568 

   569 	razor_package_get_details(prev, package,

   570 				  RAZOR_DETAIL_PREUNPROG, &program,

   571 				  RAZOR_DETAIL_PREUN, &script,

   572 				  RAZOR_DETAIL_LAST);

   573 

   574 	retval = razor_run_script(root, RAZOR_PROPERTY_PREUN, program, script,

   575 				  install_count);

   576 

   577 	fi = razor_file_iterator_create(prev, package, 1);

   578 

   579 	while (razor_file_iterator_next(fi, &name)) {

   580 		pi = razor_package_iterator_create_for_file(next, name);

   581 		count = 0;

   582 		while (razor_package_iterator_next(pi, &p, RAZOR_DETAIL_LAST))

   583 			count++;

   584 		razor_package_iterator_destroy(pi);

   585 		if (count <= 0) {

   586 			snprintf(buffer, sizeof buffer, "%s%s", root, name);

   587 			if (razor_remove(buffer) && errno != ENOENT) {

   588 				perror(name);

   589 				retval = -1;

   590 			}

   591 		}

   592 	}

   593 

   594 	razor_file_iterator_destroy(fi);

   595 

   596 	razor_package_get_details(prev, package,

   597 				  RAZOR_DETAIL_POSTUNPROG, &program,

   598 				  RAZOR_DETAIL_POSTUN, &script,

   599 				  RAZOR_DETAIL_LAST);

   600 

   601 	if (razor_run_script(root, RAZOR_PROPERTY_POSTUN, program, script,

   602 			     install_count))

   603 		retval = -1;

   604 

   605 	environment_unset(&env);

   606 	environment_release(&env);

   607 

   608 	return retval;

   609 }

   610 

   611 RAZOR_EXPORT const char *

   612 razor_property_relation_to_string(struct razor_property *p)

   613 {

   614 	assert (p != NULL);

   615 

   616 	switch (p->flags & RAZOR_PROPERTY_RELATION_MASK) {

   617 	case RAZOR_PROPERTY_LESS:

   618 		return "<";

   619 

   620 	case RAZOR_PROPERTY_LESS | RAZOR_PROPERTY_EQUAL:

   621 		return "<=";

   622 

   623 	case RAZOR_PROPERTY_EQUAL:

   624 		return "=";

   625 

   626 	case RAZOR_PROPERTY_GREATER | RAZOR_PROPERTY_EQUAL:

   627 		return ">=";

   628 

   629 	case RAZOR_PROPERTY_GREATER:

   630 		return ">";

   631 

   632 	default:

   633 		return "?";

   634 	}

   635 }

   636 

   637 RAZOR_EXPORT const char *

   638 razor_property_type_to_string(struct razor_property *p)

   639 {

   640 	assert (p != NULL);

   641 

   642 	switch (p->flags & RAZOR_PROPERTY_TYPE_MASK) {

   643 	case RAZOR_PROPERTY_REQUIRES:

   644 		return "requires";

   645 	case RAZOR_PROPERTY_PROVIDES:

   646 		return "provides";

   647 	case RAZOR_PROPERTY_CONFLICTS:

   648 		return "conflicts";

   649 	case RAZOR_PROPERTY_OBSOLETES:

   650 		return "obsoletes";

   651 	default:

   652 		return NULL;

   653 	}

   654 }

   655 

   656 RAZOR_EXPORT struct razor_entry *

   657 razor_set_find_entry(struct razor_set *set,

   658 		     struct razor_entry *dir, const char *pattern)

   659 {

   660 	struct razor_entry *e, *subdir;

   661 	const char *n, *pool = set->file_string_pool.data;

   662 	int len;

   663 

   664 	assert (set != NULL);

   665 	assert (pattern != NULL);

   666 

   667 	if (dir == NULL)

   668 		return NULL;

   669 

   670 	e = dir;

   671 	do {

   672 		n = pool + e->name;

   673 		if (strcmp(pattern, n) == 0)

   674 			return e;

   675 		len = strlen(n);

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

   677 		    pattern[len] == '/') {

   678 			subdir = (struct razor_entry *) set->files.data +

   679 				 e->start;

   680 			return razor_set_find_entry(set, subdir,

   681 						    pattern + len + 1);

   682 		}

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

   684 

   685 	return NULL;

   686 }

   687 

   688 static void

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

   690 	 char *prefix, const char *pattern)

   691 {

   692 	struct razor_entry *e, *subdir;

   693 	const char *n, *pool = set->file_string_pool.data;

   694 

   695 	e = dir;

   696 	do {

   697 		n = pool + e->name;

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

   699 			continue;

   700 		printf("%s/%s\n", prefix, n);

   701 		if (e->start) {

   702 			char *sub = prefix + strlen (prefix);

   703 			*sub = '/';

   704 			strcpy (sub + 1, n);

   705 			subdir = (struct razor_entry *) set->files.data +

   706 				 e->start;

   707 			list_dir(set, subdir, prefix, pattern);

   708 			*sub = '\0';

   709 		}

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

   711 }

   712 

   713 RAZOR_EXPORT void

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

   715 {

   716 	struct razor_entry *root, *e;

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

   718 

   719 	assert (set != NULL);

   720 

   721 	root = (struct razor_entry *) set->files.data;

   722 

   723 	if (pattern == NULL) {

   724 		p = set->file_string_pool.data;

   725 		e = root;

   726 		do {

   727 			if (e->start) {

   728 				strcpy(buffer, p + e->name);

   729 				list_dir(set, root + e->start, buffer, NULL);

   730 			}

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

   732 		return;

   733 	}

   734 

   735 	strcpy(buffer, pattern);

   736 	e = razor_set_find_entry(set, root, buffer);

   737 	if (e && e->start) {

   738 		base = NULL;

   739 	} else {

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

   741 		if (p) {

   742 			*p = '\0';

   743 			base = p + 1;

   744 		} else {

   745 			base = NULL;

   746 		}

   747 	}

   748 	e = razor_set_find_entry(set, root, buffer);

   749 	if (e && e->start)

   750 		list_dir(set, root + e->start, buffer, base);

   751 }

   752 

   753 RAZOR_EXPORT void

   754 razor_set_list_package_files(struct razor_set *set,

   755 			     struct razor_package *package)

   756 {

   757 	struct razor_file_iterator *fi;

   758 	const char *name;

   759 

   760 	assert (set != NULL);

   761 	assert (package != NULL);

   762 

   763 	fi = razor_file_iterator_create(set, package, 0);

   764 

   765 	while (razor_file_iterator_next(fi, &name))

   766 		printf("%s\n", name);

   767 

   768 	razor_file_iterator_destroy(fi);

   769 }

   770 

   771 /*

   772  * Package data can potentially come from two places. The so-called

   773  * metadata (eg., from comps.xml) and from an RPM file. We consider

   774  * a package which has additional data from an RPM file as "fixed".

   775  * If a package needs fixing, then razor_transaction_fixup_package()

   776  * will do so. When considering what packages to add and to remove

   777  * we need to take this into account since we always want to add

   778  * unfixed packages (otherwise we have a potential conflict between

   779  * the existing package data and that present in the RPM).

   780  */

   781 static int

   782 razor_package_is_fixed(struct razor_set *set, struct razor_package *p)

   783 {

   784 	const char *preunprog, *preun, *postunprog, *postun;

   785 

   786 	if (!p)

   787 		return 0;

   788 	razor_package_get_details(set, p,

   789 				  RAZOR_DETAIL_PREUNPROG, &preunprog,

   790 				  RAZOR_DETAIL_PREUN, &preun,

   791 				  RAZOR_DETAIL_POSTUNPROG, &postunprog,

   792 				  RAZOR_DETAIL_POSTUN, &postun,

   793 				  RAZOR_DETAIL_LAST);

   794 	return *preunprog || *preun || *postunprog || *postun;

   795 }

   796 

   797 RAZOR_EXPORT void

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

   799 	       razor_diff_callback_t callback, void *data)

   800 {

   801  	struct razor_package_iterator *pi1, *pi2;

   802  	struct razor_package *p1, *p2;

   803 	const char *name1, *name2, *version1, *version2, *arch1, *arch2;

   804 	int res, is_fixed1, is_fixed2;

   805 

   806 	assert (set != NULL);

   807 	assert (upstream != NULL);

   808 

   809 	pi1 = razor_package_iterator_create(set);

   810 	pi2 = razor_package_iterator_create(upstream);

   811 

   812 	razor_package_iterator_next(pi1, &p1,

   813 				    RAZOR_DETAIL_NAME, &name1,

   814 				    RAZOR_DETAIL_VERSION, &version1,

   815 				    RAZOR_DETAIL_ARCH, &arch1,

   816 				    RAZOR_DETAIL_LAST);

   817 	is_fixed1 = razor_package_is_fixed(set, p1);

   818 	razor_package_iterator_next(pi2, &p2,

   819 				    RAZOR_DETAIL_NAME, &name2,

   820 				    RAZOR_DETAIL_VERSION, &version2,

   821 				    RAZOR_DETAIL_ARCH, &arch2,

   822 				    RAZOR_DETAIL_LAST);

   823 	is_fixed2 = razor_package_is_fixed(upstream, p2);

   824 

   825 	while (p1 || p2) {

   826 		if (p1 && p2) {

   827 			res = strcmp(name1, name2);

   828 			if (res == 0)

   829 				res = razor_versioncmp(version1, version2);

   830 			if (res == 0)

   831 				res = is_fixed1 - is_fixed2;

   832 		} else {

   833 			res = 0;

   834 		}

   835 

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

   837 			callback(RAZOR_DIFF_ACTION_REMOVE,

   838 				 p1, name1, version1, arch1, data);

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

   840 			callback(RAZOR_DIFF_ACTION_ADD,

   841 				 p2, name2, version2, arch2, data);

   842 

   843 		if (p1 != NULL && res <= 0) {

   844 			razor_package_iterator_next(pi1, &p1,

   845 						    RAZOR_DETAIL_NAME, &name1,

   846 						    RAZOR_DETAIL_VERSION, &version1,

   847 						    RAZOR_DETAIL_ARCH, &arch1,

   848 						    RAZOR_DETAIL_LAST);

   849 			is_fixed1 = razor_package_is_fixed(set, p1);

   850 		}

   851 		if (p2 != NULL && res >= 0) {

   852 			razor_package_iterator_next(pi2, &p2,

   853 						    RAZOR_DETAIL_NAME, &name2,

   854 						    RAZOR_DETAIL_VERSION, &version2,

   855 						    RAZOR_DETAIL_ARCH, &arch2,

   856 						    RAZOR_DETAIL_LAST);

   857 			is_fixed2 = razor_package_is_fixed(upstream, p2);

   858 		}

   859 	}

   860 

   861 	razor_package_iterator_destroy(pi1);

   862 	razor_package_iterator_destroy(pi2);

   863 }

   864 

   865 struct install_action {

   866 	enum razor_install_action action;

   867 	struct razor_package *package;

   868 };

   869 

   870 struct razor_install_iterator {

   871 	struct razor_set *set;

   872 	struct razor_set *next;

   873 	struct array actions;

   874 	struct deque *order;

   875 };

   876 

   877 static void

   878 add_action(enum razor_diff_action action,

   879 	   struct razor_package *package,

   880 	   const char *name,

   881 	   const char *version,

   882 	   const char *arch,

   883 	   void *data)

   884 {

   885 	struct razor_install_iterator *ii = data;

   886 	struct install_action *a;

   887 

   888 	a = array_add(&ii->actions, sizeof *a);

   889 	a->package = package;

   890 

   891 	switch (action) {

   892 	case RAZOR_DIFF_ACTION_ADD:

   893 		a->action = RAZOR_INSTALL_ACTION_ADD;

   894 		break;

   895 	case RAZOR_DIFF_ACTION_REMOVE:

   896 		a->action = RAZOR_INSTALL_ACTION_REMOVE;

   897 		break;

   898 	}

   899 }

   900 

   901 RAZOR_EXPORT struct razor_install_iterator *

   902 razor_set_create_install_iterator(struct razor_set *set,

   903 				  struct razor_set *next)

   904 {

   905 	struct razor_install_iterator *ii;

   906 	struct razor_property *prop;

   907 	/* A graph of the actions to be perfomed where

   908 	 * A->B means action A should follow action B.

   909 	 */

   910 	struct graph follows;

   911 	struct install_action *actions, *ai, *aj;

   912 	int i, j, count, vertex_added;

   913 	struct list *link;

   914 	struct razor_set *rs;

   915 

   916 	assert (set != NULL);

   917 	assert (next != NULL);

   918 

   919 	ii = zalloc(sizeof *ii);

   920 	ii->set = set;

   921 	ii->next = next;

   922 	

   923 	razor_set_diff(set, next, add_action, ii);

   924 

   925 	actions = ii->actions.data;

   926 	count = ii->actions.size / sizeof (struct install_action);

   927 

   928 	graph_init(&follows);

   929 

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

   931 		ai = actions + i;

   932 		rs = ai->action == RAZOR_INSTALL_ACTION_ADD ? next : set;

   933 		vertex_added = 0;

   934 		link = list_first(&ai->package->properties, &rs->property_pool);

   935 		for(; link; link = list_next(link)) {

   936 			prop = rs->properties.data;

   937 			prop += link->data;

   938 			switch(prop->flags & RAZOR_PROPERTY_TYPE_MASK) {

   939 			case RAZOR_PROPERTY_REQUIRES:

   940 			case RAZOR_PROPERTY_CONFLICTS:

   941 				for(j = 0; j < count; j++) {

   942 					if (j == i)

   943 						continue;

   944 					aj = actions + j;

   945 					if (aj->package->name == prop->name) {

   946 						if (ai->action ==

   947 						    RAZOR_INSTALL_ACTION_ADD)

   948 							graph_add_edge(&follows,

   949 								       i, j);

   950 						else

   951 							graph_add_edge(&follows,

   952 								       j, i);

   953 						vertex_added++;

   954 					}

   955 				}

   956 				break;

   957 			}

   958 		}

   959 		if (ai->action == RAZOR_INSTALL_ACTION_ADD) {

   960 			for(j = 0; j < count; j++) {

   961 				if (j == i)

   962 					continue;

   963 				aj = actions + j;

   964 				if (aj->package == ai->package &&

   965 				    aj->action == RAZOR_INSTALL_ACTION_REMOVE) {

   966 					graph_add_edge(&follows, i, j);

   967 					vertex_added++;

   968 				}

   969 			}

   970 		}

   971 		if (!vertex_added)

   972 			graph_add_edge(&follows, i, i);

   973 	}

   974 

   975 	ii->order = graph_sort(&follows);

   976 	graph_release(&follows);

   977 

   978 	return ii;

   979 }

   980 

   981 RAZOR_EXPORT int

   982 razor_install_iterator_next(struct razor_install_iterator *ii,

   983 			    struct razor_package **package,

   984 			    enum razor_install_action *action,

   985 			    int *count)

   986 {

   987 	struct install_action *a;

   988 	struct razor_package_iterator *pi;

   989 	struct razor_package *pkg;

   990 	const char *removing, *name;

   991 

   992 	if (deque_empty(ii->order))

   993 		return 0;

   994 

   995 	a = (struct install_action *)ii->actions.data + deque_pop(ii->order);

   996 	*package = a->package;

   997 	*action = a->action;

   998 	*count = 0;

   999 

  1000 	if (a->action == RAZOR_INSTALL_ACTION_REMOVE) {

  1001 		razor_package_get_details(ii->set, a->package,

  1002 					  RAZOR_DETAIL_NAME, &removing,

  1003 					  RAZOR_DETAIL_LAST);

  1004 

  1005 		pi = razor_package_iterator_create(ii->next);

  1006 		while (razor_package_iterator_next(pi, &pkg,

  1007 						   RAZOR_DETAIL_NAME, &name,

  1008 						   RAZOR_DETAIL_LAST)) {

  1009 			if (!strcmp(name, removing))

  1010 				(*count)++;

  1011 		}

  1012 		razor_package_iterator_destroy(pi);

  1013 	}

  1014 

  1015 	return 1;

  1016 }

  1017 

  1018 RAZOR_EXPORT void

  1019 razor_install_iterator_destroy(struct razor_install_iterator *ii)

  1020 {

  1021 	array_release(&ii->actions);

  1022 	deque_free(ii->order);

  1023 	free(ii);

  1024 }
razor