Mercurialrazor / file revision
summary | shortlog | changelog | graph | tags | branches | files | changeset | file | revisions | annotate | diff | raw
librazor/transaction.c
author Kristian H?gsberg <krh@redhat.com>
Mon Jun 23 17:31:32 2008 -0400 (2008-06-23)
changeset 271 3980d1d9148e
parent 269 03fc85294bc9
child 284 6e19775d8930
permissions -rw-r--r--
Nuke ARRAY_SIZE and obsolete razor_set_list_unsatisfied from razor.h. 
     1 /*

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

     3  * Copyright (C) 2008  Red Hat, Inc

     4  *

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

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

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

     8  * (at your option) any later version.

     9  *

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

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

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

    13  * GNU General Public License for more details.

    14  *

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

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

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

    18  */

    19 

    20 #define _GNU_SOURCE

    21 

    22 #include <stdlib.h>

    23 #include <stddef.h>

    24 #include <stdint.h>

    25 #include <stdio.h>

    26 #include <string.h>

    27 #include <sys/types.h>

    28 #include <sys/stat.h>

    29 #include <sys/mman.h>

    30 #include <unistd.h>

    31 #include <fcntl.h>

    32 #include <errno.h>

    33 #include <ctype.h>

    34 #include <fnmatch.h>

    35 

    36 #include "razor-internal.h"

    37 #include "razor.h"

    38 

    39 static int

    40 provider_satisfies_requirement(struct razor_property *provider,

    41 			       const char *provider_strings,

    42 			       uint32_t flags,

    43 			       const char *required)

    44 {

    45 	int cmp, len;

    46 	const char *provided = &provider_strings[provider->version];

    47 

    48 	if (!*required)

    49 		return 1;

    50 	if (!*provided) {

    51 		if (flags & RAZOR_PROPERTY_LESS)

    52 			return 0;

    53 		else

    54 			return 1;

    55 	}

    56 

    57 	cmp = razor_versioncmp(provided, required);

    58 

    59 	switch (flags & RAZOR_PROPERTY_RELATION_MASK) {

    60 	case RAZOR_PROPERTY_LESS:

    61 		return cmp < 0;

    62 

    63 	case RAZOR_PROPERTY_LESS | RAZOR_PROPERTY_EQUAL:

    64 		if (cmp <= 0)

    65 			return 1;

    66 		/* fall through: FIXME, make sure this is correct */

    67 

    68 	case RAZOR_PROPERTY_EQUAL:

    69 		if (cmp == 0)

    70 			return 1;

    71 

    72 		/* "foo == 1.1" is satisfied by "foo 1.1-2" */

    73 		len = strlen(required);

    74 		if (!strncmp(required, provided, len) && provided[len] == '-')

    75 			return 1;

    76 		return 0;

    77 

    78 	case RAZOR_PROPERTY_GREATER | RAZOR_PROPERTY_EQUAL:

    79 		return cmp >= 0;

    80 

    81 	case RAZOR_PROPERTY_GREATER:

    82 		return cmp > 0;

    83 	}

    84 

    85 	/* shouldn't happen */

    86 	return 0;

    87 }

    88 

    89 #define TRANS_PACKAGE_PRESENT		1

    90 #define TRANS_PACKAGE_UPDATE		2

    91 #define TRANS_PROPERTY_SATISFIED	0x80000000

    92 

    93 struct transaction_set {

    94 	struct razor_set *set;

    95 	uint32_t *packages;

    96 	uint32_t *properties;

    97 };

    98 

    99 struct razor_transaction {

   100 	int package_count, errors;

   101 	struct transaction_set system, upstream;

   102 	int changes;

   103 };

   104 

   105 static void

   106 transaction_set_init(struct transaction_set *ts, struct razor_set *set)

   107 {

   108 	int count;

   109 

   110 	ts->set = set;

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

   112 	ts->packages = zalloc(count * sizeof *ts->packages);

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

   114 	ts->properties = zalloc(count * sizeof *ts->properties);

   115 }

   116 

   117 static void

   118 transaction_set_release(struct transaction_set *ts)

   119 {

   120 	free(ts->packages);

   121 	free(ts->properties);

   122 }

   123 

   124 static void

   125 transaction_set_install_package(struct transaction_set *ts,

   126 				struct razor_package *package)

   127 {

   128 	struct razor_package *pkgs;

   129 	struct list *prop;

   130 	int i;

   131 

   132 	pkgs = ts->set->packages.data;

   133 	i = package - pkgs;

   134 	if (ts->packages[i] == TRANS_PACKAGE_PRESENT)

   135 		return;

   136 

   137 	ts->packages[i] = TRANS_PACKAGE_PRESENT;

   138 

   139 	prop = list_first(&package->properties, &ts->set->property_pool);

   140 	while (prop) {

   141 		ts->properties[prop->data]++;

   142 		prop = list_next(prop);

   143 	}

   144 }

   145 

   146 static void

   147 transaction_set_remove_package(struct transaction_set *ts,

   148 			       struct razor_package *package)

   149 {

   150 	struct razor_package *pkgs;

   151 	struct list *prop;

   152 	int i;

   153 

   154 	pkgs = ts->set->packages.data;

   155 	i = package - pkgs;

   156 	if (ts->packages[i] == 0)

   157 		return;

   158 

   159 	ts->packages[i] = 0;

   160 

   161 	prop = list_first(&package->properties, &ts->set->property_pool);

   162 	while (prop) {

   163 		ts->properties[prop->data]--;

   164 		prop = list_next(prop);

   165 	}

   166 }

   167 

   168 RAZOR_EXPORT struct razor_transaction *

   169 razor_transaction_create(struct razor_set *system, struct razor_set *upstream)

   170 {

   171 	struct razor_transaction *trans;

   172 	struct razor_package *p, *spkgs, *pend;

   173 

   174 	trans = zalloc(sizeof *trans);

   175 	transaction_set_init(&trans->system, system);

   176 	transaction_set_init(&trans->upstream, upstream);

   177 

   178 	spkgs = trans->system.set->packages.data;

   179 	pend = trans->system.set->packages.data +

   180 		trans->system.set->packages.size;

   181 	for (p = spkgs; p < pend; p++)

   182 		transaction_set_install_package(&trans->system, p);

   183 

   184 	return trans;

   185 }

   186 

   187 RAZOR_EXPORT void

   188 razor_transaction_install_package(struct razor_transaction *trans,

   189 				  struct razor_package *package)

   190 {

   191 	transaction_set_install_package(&trans->upstream, package);

   192 	trans->changes++;

   193 }

   194 

   195 RAZOR_EXPORT void

   196 razor_transaction_remove_package(struct razor_transaction *trans,

   197 				 struct razor_package *package)

   198 {

   199 	transaction_set_remove_package(&trans->system, package);

   200 	trans->changes++;

   201 }

   202 

   203 RAZOR_EXPORT void

   204 razor_transaction_update_package(struct razor_transaction *trans,

   205 				  struct razor_package *package)

   206 {

   207 	struct razor_package *spkgs, *upkgs, *end;

   208 

   209 	spkgs = trans->system.set->packages.data;

   210 	upkgs = trans->upstream.set->packages.data;

   211 	end = trans->system.set->packages.data +

   212 		trans->system.set->packages.size;

   213 	if (spkgs <= package && package < end)

   214 		trans->system.packages[package - spkgs] |= TRANS_PACKAGE_UPDATE;

   215 	else

   216 		trans->upstream.packages[package - upkgs] |= TRANS_PACKAGE_UPDATE;

   217 }

   218 

   219 struct prop_iter {

   220 	struct razor_property *p, *start, *end;

   221 	const char *pool;

   222 	uint32_t *present;

   223 };

   224 

   225 static void

   226 prop_iter_init(struct prop_iter *pi, struct transaction_set *ts)

   227 {

   228 	pi->p = ts->set->properties.data;

   229 	pi->start = ts->set->properties.data;

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

   231 	pi->pool = ts->set->string_pool.data;

   232 	pi->present = ts->properties;

   233 }

   234 

   235 static int

   236 prop_iter_next(struct prop_iter *pi, uint32_t flags, struct razor_property **p)

   237 {

   238 	while (pi->p < pi->end) {

   239 		if ((pi->present[pi->p - pi->start] & ~TRANS_PROPERTY_SATISFIED) &&

   240 		    (pi->p->flags & RAZOR_PROPERTY_TYPE_MASK) == flags) {

   241 			*p = pi->p++;

   242 			return 1;

   243 		}

   244 		pi->p++;

   245 	}

   246 

   247 	return 0;

   248 }

   249 

   250 static struct razor_property *

   251 prop_iter_seek_to(struct prop_iter *pi,

   252 		  uint32_t flags, const char *match)

   253 {

   254 	uint32_t name;

   255 

   256 	while (pi->p < pi->end && strcmp(&pi->pool[pi->p->name], match) < 0)

   257 		pi->p++;

   258 

   259 	if (pi->p == pi->end || strcmp(&pi->pool[pi->p->name], match) > 0)

   260 		return NULL;

   261 

   262 	name = pi->p->name;

   263 	while (pi->p < pi->end &&

   264 	       pi->p->name == name &&

   265 	       (pi->p->flags & RAZOR_PROPERTY_TYPE_MASK) != flags)

   266 		pi->p++;

   267 

   268 	if (pi->p == pi->end || pi->p->name != name)

   269 		return NULL;

   270 

   271 	return pi->p;

   272 }

   273 

   274 /* Remove packages from set that provide any of the matching (same

   275  * name and type) providers from ppi onwards that match the

   276  * requirement that rpi points to. */

   277 static void

   278 remove_matching_providers(struct razor_transaction *trans,

   279 			  struct prop_iter *ppi,

   280 			  uint32_t flags,

   281 			  const char *version)

   282 {

   283 	struct razor_property *p;

   284 	struct razor_package *pkg, *pkgs;

   285 	struct razor_package_iterator pkg_iter;

   286 	struct razor_set *set;

   287 	const char *n, *v, *a;

   288 	uint32_t type;

   289 

   290 	if (ppi->present == trans->system.properties)

   291 		set = trans->system.set;

   292 	else

   293 		set = trans->upstream.set;

   294 

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

   296 	type = ppi->p->flags & RAZOR_PROPERTY_TYPE_MASK;

   297 	for (p = ppi->p;

   298 	     p < ppi->end &&

   299 	     p->name == ppi->p->name &&

   300 	     (p->flags & RAZOR_PROPERTY_TYPE_MASK) == type;

   301 	     p++) {

   302 		if (!ppi->present[p - ppi->start])

   303 			continue;

   304 		if (!provider_satisfies_requirement(p, ppi->pool,

   305 						    flags, version))

   306 			continue;

   307 

   308 		razor_package_iterator_init_for_property(&pkg_iter, set, p);

   309 		while (razor_package_iterator_next(&pkg_iter,

   310 						   &pkg, &n, &v, &a)) {

   311 			fprintf(stderr, "removing %s-%s\n", n, v);

   312 			razor_transaction_remove_package(trans, pkg);

   313 		}

   314 	}

   315 }

   316 

   317 static void

   318 flag_matching_providers(struct razor_transaction *trans,

   319 			struct prop_iter *ppi,

   320 			struct razor_property *r,

   321 			struct prop_iter *rpi,

   322 			unsigned int flag)

   323 {

   324 	struct razor_property *p;

   325 	struct razor_package *pkg, *pkgs;

   326 	struct razor_package_iterator pkg_iter;

   327 	struct razor_set *set;

   328 	const char *name, *version, *arch;

   329 	uint32_t *flags, type;

   330 

   331 	if (ppi->present == trans->system.properties) {

   332 		set = trans->system.set;

   333 		flags = trans->system.packages;

   334 	} else {

   335 		set = trans->upstream.set;

   336 		flags = trans->upstream.packages;

   337 	}

   338 

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

   340 	type = ppi->p->flags & RAZOR_PROPERTY_TYPE_MASK;

   341 	for (p = ppi->p;

   342 	     p < ppi->end &&

   343 		     p->name == ppi->p->name &&

   344 		     (p->flags & RAZOR_PROPERTY_TYPE_MASK) == type;

   345 	     p++) {

   346 		if (!ppi->present[p - ppi->start])

   347 			continue;

   348 		if (!provider_satisfies_requirement(p, ppi->pool,

   349 						    r->flags,

   350 						    &rpi->pool[r->version]))

   351 			continue;

   352 

   353 		razor_package_iterator_init_for_property(&pkg_iter, set, p);

   354 		while (razor_package_iterator_next(&pkg_iter, &pkg,

   355 						   &name, &version, &arch)) {

   356 

   357 			fprintf(stderr, "flagging %s-%s for providing %s matching %s %s\n",

   358 				name, version,

   359 				ppi->pool + p->name,

   360 				rpi->pool + r->name,

   361 				rpi->pool + r->version);

   362 			flags[pkg - pkgs] |= flag;

   363 		}

   364 	}

   365 }

   366 

   367 static struct razor_package *

   368 pick_matching_provider(struct razor_set *set,

   369 		       struct prop_iter *ppi,

   370 		       uint32_t flags,

   371 		       const char *version)

   372 {

   373 	struct razor_property *p;

   374 	struct razor_package *pkgs;

   375 	struct list *i;

   376 	uint32_t type;

   377 

   378 	/* This is where we decide which pkgs to pull in to satisfy a

   379 	 * requirement.  There may be several different providers

   380 	 * (different versions) and each version of a provider may

   381 	 * come from a number of packages.  We pick the first package

   382 	 * from the first provider that matches. */

   383 

   384 	pkgs = set->packages.data;

   385 	type = ppi->p->flags & RAZOR_PROPERTY_TYPE_MASK;

   386 	for (p = ppi->p;

   387 	     p < ppi->end &&

   388 		     p->name == ppi->p->name &&

   389 		     (p->flags & RAZOR_PROPERTY_TYPE_MASK) == type &&

   390 		     ppi->present[p - ppi->start] == 0;

   391 	     p++) {

   392 		if (!provider_satisfies_requirement(p, ppi->pool,

   393 						    flags, version))

   394 			continue;

   395 

   396 		i = list_first(&p->packages, &set->package_pool);

   397 

   398 		return &pkgs[i->data];

   399 	}

   400 

   401 	return NULL;

   402 }

   403 

   404 static void

   405 remove_obsoleted_packages(struct razor_transaction *trans)

   406 {

   407 	struct razor_property *up;

   408 	struct razor_package *spkgs;

   409 	struct prop_iter spi, upi;

   410 

   411 	spkgs = trans->system.set->packages.data;

   412 	prop_iter_init(&spi, &trans->system);

   413 	prop_iter_init(&upi, &trans->upstream);

   414 

   415 	while (prop_iter_next(&upi, RAZOR_PROPERTY_OBSOLETES, &up)) {

   416 		if (!prop_iter_seek_to(&spi, RAZOR_PROPERTY_PROVIDES,

   417 				       &upi.pool[up->name]))

   418 			continue;

   419 		remove_matching_providers(trans, &spi, up->flags,

   420 					  &upi.pool[up->version]);

   421 	}

   422 }

   423 

   424 static int

   425 any_provider_satisfies_requirement(struct prop_iter *ppi,

   426 				   uint32_t flags,

   427 				   const char *version)

   428 {

   429 	struct razor_property *p;

   430 	uint32_t type;

   431 

   432 	type = ppi->p->flags & RAZOR_PROPERTY_TYPE_MASK;

   433 	for (p = ppi->p;

   434 	     p < ppi->end &&

   435 		     p->name == ppi->p->name &&

   436 		     (p->flags & RAZOR_PROPERTY_TYPE_MASK) == type;

   437 	     p++) {

   438 		if (ppi->present[p - ppi->start] > 0 &&

   439 		    provider_satisfies_requirement(p, ppi->pool,

   440 						   flags, version))

   441 			return 1;

   442 	}

   443 

   444 	return 0;

   445 }

   446 

   447 static void

   448 clear_requires_flags(struct transaction_set *ts)

   449 {

   450 	struct razor_property *p;

   451 	const char *pool;

   452 	int i, count;

   453 

   454 	count = ts->set->properties.size / sizeof *p;

   455 	p = ts->set->properties.data;

   456 	pool = ts->set->string_pool.data;

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

   458 		ts->properties[i] &= ~TRANS_PROPERTY_SATISFIED;

   459 		if (strncmp(&pool[p[i].name], "rpmlib(", 7) == 0)

   460 			ts->properties[i] |= TRANS_PROPERTY_SATISFIED;

   461 	}

   462 }

   463 

   464 static void

   465 mark_satisfied_requires(struct razor_transaction *trans,

   466 			struct transaction_set *rts,

   467 			struct transaction_set *pts)

   468 {

   469 	struct prop_iter rpi, ppi;

   470 	struct razor_property *rp;

   471 

   472 	prop_iter_init(&rpi, rts);

   473 	prop_iter_init(&ppi, pts);

   474 

   475 	while (prop_iter_next(&rpi, RAZOR_PROPERTY_REQUIRES, &rp)) {

   476 		if (!prop_iter_seek_to(&ppi, RAZOR_PROPERTY_PROVIDES,

   477 				       &rpi.pool[rp->name]))

   478 			continue;

   479 

   480 		if (any_provider_satisfies_requirement(&ppi, rp->flags,

   481 						       &rpi.pool[rp->version]))

   482 			rpi.present[rp - rpi.start] |= TRANS_PROPERTY_SATISFIED;

   483 	}

   484 }

   485 

   486 static void

   487 mark_all_satisfied_requires(struct razor_transaction *trans)

   488 {

   489 	clear_requires_flags(&trans->system);

   490 	clear_requires_flags(&trans->upstream);

   491 	mark_satisfied_requires(trans, &trans->system, &trans->system);

   492 	mark_satisfied_requires(trans, &trans->system, &trans->upstream);

   493 	mark_satisfied_requires(trans, &trans->upstream, &trans->system);

   494 	mark_satisfied_requires(trans, &trans->upstream, &trans->upstream);

   495 }

   496 

   497 static void

   498 update_unsatisfied_packages(struct razor_transaction *trans)

   499 {

   500 	struct razor_package *spkgs, *pkg;

   501 	struct razor_property *sp;

   502 	struct prop_iter spi;

   503 	struct razor_package_iterator pkg_iter;

   504 	const char *name, *version, *arch;

   505 

   506 	spkgs = trans->system.set->packages.data;

   507 	prop_iter_init(&spi, &trans->system);

   508 

   509 	while (prop_iter_next(&spi, RAZOR_PROPERTY_REQUIRES, &sp)) {

   510 		if (spi.present[sp - spi.start] & TRANS_PROPERTY_SATISFIED)

   511 			continue;

   512 

   513 		razor_package_iterator_init_for_property(&pkg_iter,

   514 							 trans->system.set,

   515 							 sp);

   516 		while (razor_package_iterator_next(&pkg_iter, &pkg,

   517 						   &name, &version, &arch)) {

   518 			fprintf(stderr, "updating %s because %s %s %s "

   519 				"isn't satisfied\n",

   520 				name, spi.pool + sp->name,

   521 				razor_property_relation_to_string(sp),

   522 				spi.pool + sp->version);

   523 			trans->system.packages[pkg - spkgs] |=

   524 				TRANS_PACKAGE_UPDATE;

   525 		}

   526 	}

   527 }

   528 

   529 RAZOR_EXPORT void

   530 razor_transaction_update_all(struct razor_transaction *trans)

   531 {

   532 	struct razor_package *p;

   533 	int i, count;

   534 

   535 	count = trans->system.set->packages.size / sizeof *p;

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

   537 		trans->system.packages[i] |= TRANS_PACKAGE_UPDATE;

   538 }

   539 

   540 static void

   541 update_conflicted_packages(struct razor_transaction *trans)

   542 {

   543 	struct razor_package *pkg, *spkgs;

   544 	struct razor_property *up, *sp;

   545 	struct prop_iter spi, upi;

   546 	struct razor_package_iterator pkg_iter;

   547 	const char *name, *version, *arch;

   548 

   549 	spkgs = trans->system.set->packages.data;

   550 	prop_iter_init(&spi, &trans->system);

   551 	prop_iter_init(&upi, &trans->upstream);

   552 

   553 	while (prop_iter_next(&spi, RAZOR_PROPERTY_CONFLICTS, &sp)) {

   554 		if (!prop_iter_seek_to(&upi, RAZOR_PROPERTY_PROVIDES,

   555 				       &spi.pool[sp->name]))

   556 			continue;

   557 

   558 		if (!any_provider_satisfies_requirement(&upi, sp->flags,

   559 							&spi.pool[sp->version]))

   560 			continue;

   561 

   562 		razor_package_iterator_init_for_property(&pkg_iter,

   563 							 trans->system.set,

   564 							 sp);

   565 		while (razor_package_iterator_next(&pkg_iter, &pkg,

   566 						   &name, &version, &arch)) {

   567 			fprintf(stderr, "updating %s %s because it conflicts with %s",

   568 				name, version, spi.pool + sp->name);

   569 			trans->system.packages[pkg - spkgs] |=

   570 				TRANS_PACKAGE_UPDATE;

   571 		}

   572 	}

   573 

   574 	prop_iter_init(&spi, &trans->system);

   575 	prop_iter_init(&upi, &trans->upstream);

   576 

   577 	while (prop_iter_next(&upi, RAZOR_PROPERTY_CONFLICTS, &up)) {

   578 		sp = prop_iter_seek_to(&spi, RAZOR_PROPERTY_PROVIDES,

   579 				       &upi.pool[upi.p->name]);

   580 

   581 		if (sp)

   582 			flag_matching_providers(trans, &spi, up, &upi,

   583 						TRANS_PACKAGE_UPDATE);

   584 	}

   585 }

   586 

   587 static void

   588 pull_in_requirements(struct razor_transaction *trans,

   589 		     struct prop_iter *rpi, struct prop_iter *ppi)

   590 {

   591 	struct razor_property *rp, *pp;

   592 	struct razor_package *pkg, *upkgs;

   593 

   594 	upkgs = trans->upstream.set->packages.data;

   595 	while (prop_iter_next(rpi, RAZOR_PROPERTY_REQUIRES, &rp)) {

   596 		if (rpi->present[rp - rpi->start] & TRANS_PROPERTY_SATISFIED)

   597 			continue;

   598 

   599 		pp = prop_iter_seek_to(ppi, RAZOR_PROPERTY_PROVIDES,

   600 				       &rpi->pool[rp->name]);

   601 		if (pp == NULL)

   602 			continue;

   603 		pkg = pick_matching_provider(trans->upstream.set,

   604 					     ppi, rp->flags,

   605 					     &rpi->pool[rp->version]);

   606 		if (pkg == NULL)

   607 			continue;

   608 

   609 		rpi->present[rp - rpi->start] |= TRANS_PROPERTY_SATISFIED;

   610 

   611 		fprintf(stderr, "pulling in %s-%s.%s which provides %s %s %s "

   612 			"to satisfy %s %s %s\n",

   613 			ppi->pool + pkg->name,

   614 			ppi->pool + pkg->version,

   615 			ppi->pool + pkg->arch,

   616 			ppi->pool + pp->name,

   617 			razor_property_relation_to_string(pp),

   618 			ppi->pool + pp->version,

   619 			&rpi->pool[rp->name],

   620 			razor_property_relation_to_string(rp),

   621 			&rpi->pool[rp->version]);

   622 

   623 		trans->upstream.packages[pkg - upkgs] |= TRANS_PACKAGE_UPDATE;

   624 	}

   625 }

   626 

   627 static void

   628 pull_in_all_requirements(struct razor_transaction *trans)

   629 {

   630 	struct prop_iter rpi, ppi;

   631 

   632 	prop_iter_init(&rpi, &trans->system);

   633 	prop_iter_init(&ppi, &trans->upstream);

   634 	pull_in_requirements(trans, &rpi, &ppi);

   635 

   636 	prop_iter_init(&rpi, &trans->upstream);

   637 	prop_iter_init(&ppi, &trans->upstream);

   638 	pull_in_requirements(trans, &rpi, &ppi);

   639 }

   640 

   641 static void

   642 flush_scheduled_system_updates(struct razor_transaction *trans)

   643 {

   644  	struct razor_package_iterator *pi;

   645  	struct razor_package *p, *pkg, *spkgs;

   646 	struct prop_iter ppi;

   647 	const char *name, *version, *arch;

   648 

   649 	spkgs = trans->system.set->packages.data;

   650 	pi = razor_package_iterator_create(trans->system.set);

   651 	prop_iter_init(&ppi, &trans->upstream);

   652 

   653 	while (razor_package_iterator_next(pi, &p, &name, &version, &arch)) {

   654 		if (!(trans->system.packages[p - spkgs] & TRANS_PACKAGE_UPDATE))

   655 			continue;

   656 

   657 		if (!prop_iter_seek_to(&ppi, RAZOR_PROPERTY_PROVIDES, name))

   658 			continue;

   659 

   660 		pkg = pick_matching_provider(trans->upstream.set, &ppi,

   661 					     RAZOR_PROPERTY_GREATER, version);

   662 		if (pkg == NULL)

   663 			continue;

   664 

   665 		fprintf(stderr, "updating %s-%s to %s-%s\n",

   666 			name, version,

   667 			&ppi.pool[pkg->name], &ppi.pool[pkg->version]);

   668 

   669 		razor_transaction_remove_package(trans, p);

   670 		razor_transaction_install_package(trans, pkg);

   671 	}

   672 

   673 	razor_package_iterator_destroy(pi);

   674 }

   675 

   676 static void

   677 flush_scheduled_upstream_updates(struct razor_transaction *trans)

   678 {

   679  	struct razor_package_iterator *pi;

   680  	struct razor_package *p, *upkgs;

   681 	struct prop_iter spi;

   682 	const char *name, *version, *arch;

   683 

   684 	upkgs = trans->upstream.set->packages.data;

   685 	pi = razor_package_iterator_create(trans->upstream.set);

   686 	prop_iter_init(&spi, &trans->system);

   687 

   688 	while (razor_package_iterator_next(pi, &p, &name, &version, &arch)) {

   689 		if (!(trans->upstream.packages[p - upkgs] & TRANS_PACKAGE_UPDATE))

   690 			continue;

   691 

   692 		if (prop_iter_seek_to(&spi, RAZOR_PROPERTY_PROVIDES, name))

   693 			remove_matching_providers(trans,

   694 						  &spi,

   695 						  RAZOR_PROPERTY_LESS,

   696 						  version);

   697 		razor_transaction_install_package(trans, p);

   698 		fprintf(stderr, "installing %s-%s\n", name, version);

   699 	}

   700 }

   701 

   702 RAZOR_EXPORT int

   703 razor_transaction_resolve(struct razor_transaction *trans)

   704 {

   705 	int last = 0;

   706 

   707 	flush_scheduled_system_updates(trans);

   708 	flush_scheduled_upstream_updates(trans);

   709 

   710 	while (last < trans->changes) {

   711 		last = trans->changes;

   712 		remove_obsoleted_packages(trans);

   713 		mark_all_satisfied_requires(trans);

   714 		update_unsatisfied_packages(trans);

   715 		update_conflicted_packages(trans);

   716 		pull_in_all_requirements(trans);

   717 		flush_scheduled_system_updates(trans);

   718 		flush_scheduled_upstream_updates(trans);

   719 	}

   720 

   721 	return trans->changes;

   722 }

   723 

   724 static void

   725 describe_unsatisfied(struct razor_set *set, struct razor_property *rp)

   726 {

   727 	struct razor_package_iterator pi;

   728 	struct razor_package *pkg;

   729 	const char *name, *version, *arch, *pool;

   730 

   731 	pool = set->string_pool.data;

   732 	if (pool[rp->version] == '\0') {

   733 		razor_package_iterator_init_for_property(&pi, set, rp);

   734 		while (razor_package_iterator_next(&pi, &pkg,

   735 						   &name, &version, &arch))

   736 			fprintf(stderr, "%s is needed by %s-%s.%s\n",

   737 				&pool[rp->name],

   738 				name, version, arch);

   739 	} else {

   740 		razor_package_iterator_init_for_property(&pi, set, rp);

   741 		while (razor_package_iterator_next(&pi, &pkg,

   742 						   &name, &version, &arch))

   743 			fprintf(stderr, "%s %s %s is needed by %s-%s.%s\n",

   744 				&pool[rp->name],

   745 				razor_property_relation_to_string(rp),

   746 				&pool[rp->version],

   747 				name, version, arch);

   748 	}

   749 }

   750 

   751 RAZOR_EXPORT int

   752 razor_transaction_describe(struct razor_transaction *trans)

   753 {

   754 	struct prop_iter rpi;

   755 	struct razor_property *rp;

   756 	int unsatisfied;

   757 

   758 	flush_scheduled_system_updates(trans);

   759 	flush_scheduled_upstream_updates(trans);

   760 	mark_all_satisfied_requires(trans);

   761 

   762 	unsatisfied = 0;

   763 	prop_iter_init(&rpi, &trans->system);

   764 	while (prop_iter_next(&rpi, RAZOR_PROPERTY_REQUIRES, &rp)) {

   765 		if (!(rpi.present[rp - rpi.start] & TRANS_PROPERTY_SATISFIED)) {

   766 			describe_unsatisfied(trans->system.set, rp);

   767 		        unsatisfied++;

   768 		}

   769 	}

   770 

   771 	prop_iter_init(&rpi, &trans->upstream);

   772 	while (prop_iter_next(&rpi, RAZOR_PROPERTY_REQUIRES, &rp)) {

   773 		if (!(rpi.present[rp - rpi.start] & TRANS_PROPERTY_SATISFIED)) {

   774 			describe_unsatisfied(trans->upstream.set, rp);

   775 			unsatisfied++;

   776 		}

   777 	}

   778 

   779 	return unsatisfied;

   780 }

   781 

   782 RAZOR_EXPORT int

   783 razor_transaction_unsatisfied_property(struct razor_transaction *trans,

   784 				       const char *name,

   785 				       uint32_t flags,

   786 				       const char *version)

   787 {

   788 	struct prop_iter pi;

   789 	struct razor_property *p;

   790 

   791 	prop_iter_init(&pi, &trans->system);

   792 	while (prop_iter_next(&pi, flags, &p)) {

   793 		if (!(trans->system.properties[p - pi.start] & TRANS_PROPERTY_SATISFIED) &&

   794 		    p->flags == flags &&

   795 		    strcmp(&pi.pool[p->name], name) == 0 &&

   796 		    strcmp(&pi.pool[p->version], version) == 0)

   797 

   798 			return 1;

   799 	}

   800 

   801 	prop_iter_init(&pi, &trans->upstream);

   802 	while (prop_iter_next(&pi, flags, &p)) {

   803 		if (!(trans->upstream.properties[p - pi.start] & TRANS_PROPERTY_SATISFIED) &&

   804 		    p->flags == flags &&

   805 		    strcmp(&pi.pool[p->name], name) == 0 &&

   806 		    strcmp(&pi.pool[p->version], version) == 0)

   807 

   808 			return 1;

   809 	}

   810 

   811 	return 0;

   812 }

   813 

   814 RAZOR_EXPORT struct razor_set *

   815 razor_transaction_finish(struct razor_transaction *trans)

   816 {

   817 	struct razor_merger *merger;

   818 	struct razor_package *u, *uend, *upkgs, *s, *send, *spkgs;

   819 	char *upool, *spool;

   820 	int cmp;

   821 

   822 	s = trans->system.set->packages.data;

   823 	spkgs = trans->system.set->packages.data;

   824 	send = trans->system.set->packages.data +

   825 		trans->system.set->packages.size;

   826 	spool = trans->system.set->string_pool.data;

   827 

   828 	u = trans->upstream.set->packages.data;

   829 	upkgs = trans->upstream.set->packages.data;

   830 	uend = trans->upstream.set->packages.data +

   831 		trans->upstream.set->packages.size;

   832 	upool = trans->upstream.set->string_pool.data;

   833 

   834 	merger = razor_merger_create(trans->system.set, trans->upstream.set);

   835 	while (s < send || u < uend) {

   836 		if (s < send && u < uend)

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

   838 		else if (s < send)

   839 			cmp = -1;

   840 		else

   841 			cmp = 1;

   842 

   843 		if (cmp < 0) {

   844 			if (trans->system.packages[s - spkgs] & TRANS_PACKAGE_PRESENT)

   845 				razor_merger_add_package(merger, s);

   846 			s++;

   847 		} else if (cmp == 0) {

   848 			if (trans->system.packages[s - spkgs] & TRANS_PACKAGE_PRESENT)

   849 				razor_merger_add_package(merger, s);

   850 			if (trans->upstream.packages[u - upkgs] & TRANS_PACKAGE_PRESENT)

   851 				razor_merger_add_package(merger, u);

   852 

   853 			s++;

   854 			u++;

   855 		} else {

   856 			if (trans->upstream.packages[u - upkgs] & TRANS_PACKAGE_PRESENT)

   857 				razor_merger_add_package(merger, u);

   858 			u++;

   859 		}

   860 	}

   861 

   862 	razor_transaction_destroy(trans);

   863 

   864 	return razor_merger_finish(merger);

   865 }

   866 

   867 RAZOR_EXPORT void

   868 razor_transaction_destroy(struct razor_transaction *trans)

   869 {

   870 	transaction_set_release(&trans->system);

   871 	transaction_set_release(&trans->upstream);

   872 	free(trans);

   873 }
razor