2 * Copyright (c) 2007-2009, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * Transaction handling
20 #include "transaction.h"
29 obsq_sortcmp(const void *ap, const void *bp, void *dp)
33 Solvable *s, *oas, *obs;
44 s = pool->solvables + a;
45 oas = pool->solvables + oa;
46 obs = pool->solvables + ob;
47 if (oas->name != obs->name)
49 /* bring "same name" obsoleters (i.e. upgraders) to front */
50 if (oas->name == s->name)
52 if (obs->name == s->name)
54 return strcmp(pool_id2str(pool, oas->name), pool_id2str(pool, obs->name));
56 r = pool_evrcmp(pool, oas->evr, obs->evr, EVRCMP_COMPARE);
58 return -r; /* highest version first */
63 transaction_all_obs_pkgs(Transaction *trans, Id p, Queue *pkgs)
65 Pool *pool = trans->pool;
66 Solvable *s = pool->solvables + p;
67 Queue *ti = &trans->transaction_info;
72 if (p <= 0 || !s->repo)
74 if (s->repo == pool->installed)
76 q = trans->transaction_installed[p - pool->installed->start];
81 /* only a single obsoleting package */
85 /* find which packages obsolete us */
86 for (i = 0; i < ti->count; i += 2)
87 if (ti->elements[i + 1] == p)
88 queue_push2(pkgs, p, ti->elements[i]);
91 solv_sort(pkgs->elements, pkgs->count / 2, 2 * sizeof(Id), obsq_sortcmp, pool);
92 for (i = 0; i < pkgs->count; i += 2)
93 pkgs->elements[i / 2] = pkgs->elements[i + 1];
94 queue_truncate(pkgs, pkgs->count / 2);
98 /* find the packages we obsolete */
99 for (i = 0; i < ti->count; i += 2)
101 if (ti->elements[i] == p)
102 queue_push(pkgs, ti->elements[i + 1]);
103 else if (pkgs->count)
110 transaction_obs_pkg(Transaction *trans, Id p)
112 Pool *pool = trans->pool;
113 Solvable *s = pool->solvables + p;
117 if (p <= 0 || !s->repo)
119 if (s->repo == pool->installed)
121 p = trans->transaction_installed[p - pool->installed->start];
122 return p < 0 ? -p : p;
124 ti = &trans->transaction_info;
125 for (i = 0; i < ti->count; i += 2)
126 if (ti->elements[i] == p)
127 return ti->elements[i + 1];
133 * calculate base type of transaction element
137 transaction_base_type(Transaction *trans, Id p)
139 Pool *pool = trans->pool;
144 if (!MAPTST(&trans->transactsmap, p))
145 return SOLVER_TRANSACTION_IGNORE;
146 p2 = transaction_obs_pkg(trans, p);
147 if (pool->installed && pool->solvables[p].repo == pool->installed)
151 return SOLVER_TRANSACTION_ERASE;
152 s = pool->solvables + p;
153 s2 = pool->solvables + p2;
154 if (s->name == s2->name)
156 if (s->evr == s2->evr && solvable_identical(s, s2))
157 return SOLVER_TRANSACTION_REINSTALLED;
158 r = pool_evrcmp(pool, s->evr, s2->evr, EVRCMP_COMPARE);
160 return SOLVER_TRANSACTION_UPGRADED;
162 return SOLVER_TRANSACTION_DOWNGRADED;
163 return SOLVER_TRANSACTION_CHANGED;
165 return SOLVER_TRANSACTION_OBSOLETED;
169 /* install or multiinstall */
170 int multi = trans->multiversionmap.size && MAPTST(&trans->multiversionmap, p);
175 s = pool->solvables + p;
176 s2 = pool->solvables + p2;
177 if (s->name == s2->name && s->arch == s2->arch && s->evr == s2->evr)
178 return SOLVER_TRANSACTION_MULTIREINSTALL;
180 return SOLVER_TRANSACTION_MULTIINSTALL;
183 return SOLVER_TRANSACTION_INSTALL;
184 s = pool->solvables + p;
185 s2 = pool->solvables + p2;
186 if (s->name == s2->name)
188 if (s->evr == s2->evr && solvable_identical(s, s2))
189 return SOLVER_TRANSACTION_REINSTALL;
190 r = pool_evrcmp(pool, s->evr, s2->evr, EVRCMP_COMPARE);
192 return SOLVER_TRANSACTION_UPGRADE;
194 return SOLVER_TRANSACTION_DOWNGRADE;
196 return SOLVER_TRANSACTION_CHANGE;
198 return SOLVER_TRANSACTION_OBSOLETES;
203 is_pseudo_package(Pool *pool, Solvable *s)
205 const char *n = pool_id2str(pool, s->name);
206 if (!strncmp(n, "patch:", 6))
208 if (!strncmp(n, "pattern:", 8))
214 obsoleted_by_pseudos_only(Transaction *trans, Id p)
216 Pool *pool = trans->pool;
221 op = transaction_obs_pkg(trans, p);
222 if (op && !is_pseudo_package(pool, pool->solvables + op))
225 transaction_all_obs_pkgs(trans, p, &q);
226 for (i = 0; i < q.count; i++)
227 if (!is_pseudo_package(pool, pool->solvables + q.elements[i]))
229 i = !q.count || i < q.count ? 0 : 1;
235 * return type of transaction element
237 * filtering is needed if either not all packages are shown
238 * or replaces are not shown, as otherwise parts of the
239 * transaction might not be shown to the user */
242 transaction_type(Transaction *trans, Id p, int mode)
244 Pool *pool = trans->pool;
245 Solvable *s = pool->solvables + p;
251 return SOLVER_TRANSACTION_IGNORE;
253 /* XXX: SUSE only? */
254 if (!(mode & SOLVER_TRANSACTION_KEEP_PSEUDO) && is_pseudo_package(pool, s))
255 return SOLVER_TRANSACTION_IGNORE;
257 type = transaction_base_type(trans, p);
259 if (type == SOLVER_TRANSACTION_IGNORE)
260 return SOLVER_TRANSACTION_IGNORE; /* not part of the transaction */
262 if ((mode & SOLVER_TRANSACTION_RPM_ONLY) != 0)
264 /* application wants to know what to feed to rpm */
265 if (type == SOLVER_TRANSACTION_ERASE || type == SOLVER_TRANSACTION_INSTALL || type == SOLVER_TRANSACTION_MULTIINSTALL)
267 if (s->repo == pool->installed)
269 /* check if we're obsoleted by pseudos only */
270 if (obsoleted_by_pseudos_only(trans, s - pool->solvables))
271 return SOLVER_TRANSACTION_ERASE;
272 return SOLVER_TRANSACTION_IGNORE; /* ignore as we're being obsoleted */
274 if (type == SOLVER_TRANSACTION_MULTIREINSTALL)
275 return SOLVER_TRANSACTION_MULTIINSTALL;
276 return SOLVER_TRANSACTION_INSTALL;
279 if ((mode & SOLVER_TRANSACTION_SHOW_MULTIINSTALL) == 0)
281 /* application wants to make no difference between install
282 * and multiinstall */
283 if (type == SOLVER_TRANSACTION_MULTIINSTALL)
284 type = SOLVER_TRANSACTION_INSTALL;
285 if (type == SOLVER_TRANSACTION_MULTIREINSTALL)
286 type = SOLVER_TRANSACTION_REINSTALL;
289 if ((mode & SOLVER_TRANSACTION_CHANGE_IS_REINSTALL) != 0)
291 /* application wants to make no difference between change
293 if (type == SOLVER_TRANSACTION_CHANGED)
294 type = SOLVER_TRANSACTION_REINSTALLED;
295 else if (type == SOLVER_TRANSACTION_CHANGE)
296 type = SOLVER_TRANSACTION_REINSTALL;
299 if (type == SOLVER_TRANSACTION_ERASE || type == SOLVER_TRANSACTION_INSTALL || type == SOLVER_TRANSACTION_MULTIINSTALL)
302 if (s->repo == pool->installed && (mode & SOLVER_TRANSACTION_SHOW_ACTIVE) == 0)
304 /* erase element and we're showing the passive side */
305 if (type == SOLVER_TRANSACTION_OBSOLETED && (mode & SOLVER_TRANSACTION_SHOW_OBSOLETES) == 0)
306 type = SOLVER_TRANSACTION_ERASE;
307 if (type == SOLVER_TRANSACTION_OBSOLETED && (mode & SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE) != 0)
308 type = SOLVER_TRANSACTION_UPGRADED;
311 if (s->repo != pool->installed && (mode & SOLVER_TRANSACTION_SHOW_ACTIVE) != 0)
313 /* install element and we're showing the active side */
314 if (type == SOLVER_TRANSACTION_OBSOLETES && (mode & SOLVER_TRANSACTION_SHOW_OBSOLETES) == 0)
315 type = SOLVER_TRANSACTION_INSTALL;
316 if (type == SOLVER_TRANSACTION_OBSOLETES && (mode & SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE) != 0)
317 type = SOLVER_TRANSACTION_UPGRADE;
321 /* the element doesn't match the show mode */
323 /* if we're showing all references, we can ignore this package */
324 if ((mode & (SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES)) == (SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES))
325 return SOLVER_TRANSACTION_IGNORE;
327 /* we're not showing all refs. check if some other package
328 * references us. If yes, it's safe to ignore this package,
329 * otherwise we need to map the type */
331 /* most of the time there's only one reference, so check it first */
332 q = transaction_obs_pkg(trans, p);
334 if ((mode & SOLVER_TRANSACTION_SHOW_OBSOLETES) == 0)
336 Solvable *sq = pool->solvables + q;
337 if (sq->name != s->name)
339 /* it's a replace but we're not showing replaces. map type. */
340 if (s->repo == pool->installed)
341 return SOLVER_TRANSACTION_ERASE;
342 else if (type == SOLVER_TRANSACTION_MULTIREINSTALL)
343 return SOLVER_TRANSACTION_MULTIINSTALL;
345 return SOLVER_TRANSACTION_INSTALL;
349 /* if there's a match, p will be shown when q
351 if (transaction_obs_pkg(trans, q) == p)
352 return SOLVER_TRANSACTION_IGNORE;
354 /* too bad, a miss. check em all */
357 transaction_all_obs_pkgs(trans, p, &oq);
358 for (i = 0; i < oq.count; i++)
361 if ((mode & SOLVER_TRANSACTION_SHOW_OBSOLETES) == 0)
363 Solvable *sq = pool->solvables + q;
364 if (sq->name != s->name)
367 /* check if we are referenced? */
368 if ((mode & SOLVER_TRANSACTION_SHOW_ALL) != 0)
370 transaction_all_obs_pkgs(trans, q, &rq);
371 for (j = 0; j < rq.count; j++)
372 if (rq.elements[j] == p)
380 else if (transaction_obs_pkg(trans, q) == p)
391 /* we're not referenced. map type */
392 if (s->repo == pool->installed)
393 return SOLVER_TRANSACTION_ERASE;
394 else if (type == SOLVER_TRANSACTION_MULTIREINSTALL)
395 return SOLVER_TRANSACTION_MULTIINSTALL;
397 return SOLVER_TRANSACTION_INSTALL;
399 /* there was a ref, so p is shown with some other package */
400 return SOLVER_TRANSACTION_IGNORE;
406 classify_cmp(const void *ap, const void *bp, void *dp)
408 Transaction *trans = dp;
409 Pool *pool = trans->pool;
419 return a[2] && b[2] ? strcmp(pool_id2str(pool, a[2]), pool_id2str(pool, b[2])) : r;
422 return a[3] && b[3] ? strcmp(pool_id2str(pool, a[3]), pool_id2str(pool, b[3])) : r;
427 classify_cmp_pkgs(const void *ap, const void *bp, void *dp)
429 Transaction *trans = dp;
430 Pool *pool = trans->pool;
435 sa = pool->solvables + a;
436 sb = pool->solvables + b;
437 if (sa->name != sb->name)
438 return strcmp(pool_id2str(pool, sa->name), pool_id2str(pool, sb->name));
439 if (sa->evr != sb->evr)
441 int r = pool_evrcmp(pool, sa->evr, sb->evr, EVRCMP_COMPARE);
449 transaction_classify(Transaction *trans, int mode, Queue *classes)
451 Pool *pool = trans->pool;
452 int ntypes[SOLVER_TRANSACTION_MAXTYPE + 1];
454 Id v, vq, type, p, q;
457 queue_empty(classes);
458 memset(ntypes, 0, sizeof(ntypes));
459 /* go through transaction and classify each step */
460 for (i = 0; i < trans->steps.count; i++)
462 p = trans->steps.elements[i];
463 s = pool->solvables + p;
464 type = transaction_type(trans, p, mode);
466 if (!pool->installed || s->repo != pool->installed)
468 /* don't report vendor/arch changes if we were mapped to erase. */
469 if (type == SOLVER_TRANSACTION_ERASE)
471 /* look at arch/vendor changes */
472 q = transaction_obs_pkg(trans, p);
475 sq = pool->solvables + q;
481 if ((mode & SOLVER_TRANSACTION_MERGE_ARCHCHANGES) != 0)
483 for (j = 0; j < classes->count; j += 4)
484 if (classes->elements[j] == SOLVER_TRANSACTION_ARCHCHANGE && classes->elements[j + 2] == v && classes->elements[j + 3] == vq)
486 if (j == classes->count)
488 queue_push(classes, SOLVER_TRANSACTION_ARCHCHANGE);
489 queue_push(classes, 1);
490 queue_push(classes, v);
491 queue_push(classes, vq);
494 classes->elements[j + 1]++;
497 v = s->vendor ? s->vendor : 1;
498 vq = sq->vendor ? sq->vendor : 1;
501 if ((mode & SOLVER_TRANSACTION_MERGE_VENDORCHANGES) != 0)
503 for (j = 0; j < classes->count; j += 4)
504 if (classes->elements[j] == SOLVER_TRANSACTION_VENDORCHANGE && classes->elements[j + 2] == v && classes->elements[j + 3] == vq)
506 if (j == classes->count)
508 queue_push(classes, SOLVER_TRANSACTION_VENDORCHANGE);
509 queue_push(classes, 1);
510 queue_push(classes, v);
511 queue_push(classes, vq);
514 classes->elements[j + 1]++;
517 /* now sort all vendor/arch changes */
518 if (classes->count > 4)
519 solv_sort(classes->elements, classes->count / 4, 4 * sizeof(Id), classify_cmp, trans);
520 /* finally add all classes. put erases last */
521 i = SOLVER_TRANSACTION_ERASE;
524 queue_unshift(classes, 0);
525 queue_unshift(classes, 0);
526 queue_unshift(classes, ntypes[i]);
527 queue_unshift(classes, i);
529 for (i = SOLVER_TRANSACTION_MAXTYPE; i > 0; i--)
533 if (i == SOLVER_TRANSACTION_ERASE)
535 queue_unshift(classes, 0);
536 queue_unshift(classes, 0);
537 queue_unshift(classes, ntypes[i]);
538 queue_unshift(classes, i);
543 transaction_classify_pkgs(Transaction *trans, int mode, Id class, Id from, Id to, Queue *pkgs)
545 Pool *pool = trans->pool;
551 for (i = 0; i < trans->steps.count; i++)
553 p = trans->steps.elements[i];
554 s = pool->solvables + p;
555 if (class <= SOLVER_TRANSACTION_MAXTYPE)
557 type = transaction_type(trans, p, mode);
562 if (!pool->installed || s->repo != pool->installed)
564 q = transaction_obs_pkg(trans, p);
567 sq = pool->solvables + q;
568 if (class == SOLVER_TRANSACTION_ARCHCHANGE)
570 if ((!from && !to) || (s->arch == from && sq->arch == to))
574 if (class == SOLVER_TRANSACTION_VENDORCHANGE)
576 Id v = s->vendor ? s->vendor : 1;
577 Id vq = sq->vendor ? sq->vendor : 1;
578 if ((!from && !to) || (v == from && vq == to))
584 solv_sort(pkgs->elements, pkgs->count, sizeof(Id), classify_cmp_pkgs, trans);
588 create_transaction_info(Transaction *trans, Queue *decisionq)
590 Pool *pool = trans->pool;
591 Queue *ti = &trans->transaction_info;
592 Repo *installed = pool->installed;
598 trans->transaction_installed = solv_free(trans->transaction_installed);
600 return; /* no info needed */
601 for (i = 0; i < decisionq->count; i++)
603 p = decisionq->elements[i];
604 if (p <= 0 || p == SYSTEMSOLVABLE)
606 s = pool->solvables + p;
607 if (!s->repo || s->repo == installed)
609 multi = trans->multiversionmap.size && MAPTST(&trans->multiversionmap, p);
610 FOR_PROVIDES(p2, pp2, s->name)
612 if (!MAPTST(&trans->transactsmap, p2))
614 s2 = pool->solvables + p2;
615 if (s2->repo != installed)
617 if (multi && (s->name != s2->name || s->evr != s2->evr || s->arch != s2->arch))
619 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
621 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, s2))
623 queue_push2(ti, p, p2);
625 if (s->obsoletes && (!multi || !pool->noobsoletesmultiversion))
627 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
628 while ((obs = *obsp++) != 0)
630 FOR_PROVIDES(p2, pp2, obs)
632 if (!MAPTST(&trans->transactsmap, p2))
634 s2 = pool->solvables + p2;
635 if (s2->repo != installed)
637 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
639 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
641 queue_push2(ti, p, p2);
649 solv_sort(ti->elements, ti->count / 2, 2 * sizeof(Id), obsq_sortcmp, pool);
650 for (i = j = 2; i < ti->count; i += 2)
652 if (ti->elements[i] == ti->elements[j - 2] && ti->elements[i + 1] == ti->elements[j - 1])
654 ti->elements[j++] = ti->elements[i];
655 ti->elements[j++] = ti->elements[i + 1];
657 queue_truncate(ti, j);
660 /* create transaction_installed helper */
661 /* entry > 0: exactly one obsoleter, entry < 0: multiple obsoleters, -entry is "best" */
662 trans->transaction_installed = solv_calloc(installed->end - installed->start, sizeof(Id));
663 for (i = 0; i < ti->count; i += 2)
665 j = ti->elements[i + 1] - installed->start;
666 if (!trans->transaction_installed[j])
667 trans->transaction_installed[j] = ti->elements[i];
670 /* more than one package obsoletes us. compare to find "best" */
672 if (trans->transaction_installed[j] > 0)
673 trans->transaction_installed[j] = -trans->transaction_installed[j];
674 q[0] = q[2] = ti->elements[i + 1];
675 q[1] = ti->elements[i];
676 q[3] = -trans->transaction_installed[j];
677 if (obsq_sortcmp(q, q + 2, pool) < 0)
678 trans->transaction_installed[j] = -ti->elements[i];
685 transaction_create_decisionq(Pool *pool, Queue *decisionq, Map *multiversionmap)
687 Repo *installed = pool->installed;
693 trans = transaction_create(pool);
694 if (multiversionmap && !multiversionmap->size)
695 multiversionmap = 0; /* ignore empty map */
696 queue_empty(&trans->steps);
697 map_init(&trans->transactsmap, pool->nsolvables);
699 for (i = 0; i < decisionq->count; i++)
701 p = decisionq->elements[i];
702 s = pool->solvables + (p > 0 ? p : -p);
705 if (installed && s->repo == installed && p < 0)
706 MAPSET(&trans->transactsmap, -p);
707 if ((!installed || s->repo != installed) && p > 0)
710 const char *n = pool_id2str(pool, s->name);
711 if (!strncmp(n, "patch:", 6))
713 if (!strncmp(n, "pattern:", 8))
716 MAPSET(&trans->transactsmap, p);
717 if (multiversionmap && MAPTST(multiversionmap, p))
721 MAPCLR(&trans->transactsmap, SYSTEMSOLVABLE);
723 map_init_clone(&trans->multiversionmap, multiversionmap);
725 create_transaction_info(trans, decisionq);
729 FOR_REPO_SOLVABLES(installed, p, s)
731 if (MAPTST(&trans->transactsmap, p))
732 queue_push(&trans->steps, p);
735 for (i = 0; i < decisionq->count; i++)
737 p = decisionq->elements[i];
738 if (p > 0 && MAPTST(&trans->transactsmap, p))
739 queue_push(&trans->steps, p);
745 transaction_installedresult(Transaction *trans, Queue *installedq)
747 Pool *pool = trans->pool;
748 Repo *installed = pool->installed;
753 queue_empty(installedq);
754 /* first the new installs, than the kept packages */
755 for (i = 0; i < trans->steps.count; i++)
757 p = trans->steps.elements[i];
758 s = pool->solvables + p;
759 if (installed && s->repo == installed)
761 queue_push(installedq, p);
763 cutoff = installedq->count;
766 FOR_REPO_SOLVABLES(installed, p, s)
767 if (!MAPTST(&trans->transactsmap, p))
768 queue_push(installedq, p);
774 transaction_create_installedmap(Transaction *trans, Map *installedmap)
776 Pool *pool = trans->pool;
777 Repo *installed = pool->installed;
782 map_init(installedmap, pool->nsolvables);
783 for (i = 0; i < trans->steps.count; i++)
785 p = trans->steps.elements[i];
786 s = pool->solvables + p;
787 if (!installed || s->repo != installed)
788 MAPSET(installedmap, p);
792 FOR_REPO_SOLVABLES(installed, p, s)
793 if (!MAPTST(&trans->transactsmap, p))
794 MAPSET(installedmap, p);
799 transaction_calc_installsizechange(Transaction *trans)
804 transaction_create_installedmap(trans, &installedmap);
805 change = pool_calc_installsizechange(trans->pool, &installedmap);
806 map_free(&installedmap);
811 transaction_calc_duchanges(Transaction *trans, DUChanges *mps, int nmps)
815 transaction_create_installedmap(trans, &installedmap);
816 pool_calc_duchanges(trans->pool, &installedmap, mps, nmps);
817 map_free(&installedmap);
820 struct _TransactionElement {
821 Id p; /* solvable id */
822 Id edges; /* pointer into edges data */
826 struct _TransactionOrderdata {
827 struct _TransactionElement *tes;
833 #define TYPE_BROKEN (1<<0)
834 #define TYPE_CON (1<<1)
836 #define TYPE_REQ_P (1<<2)
837 #define TYPE_PREREQ_P (1<<3)
839 #define TYPE_REQ (1<<4)
840 #define TYPE_PREREQ (1<<5)
842 #define TYPE_CYCLETAIL (1<<16)
843 #define TYPE_CYCLEHEAD (1<<17)
845 #define EDGEDATA_BLOCK 127
848 transaction_create(Pool *pool)
850 Transaction *trans = solv_calloc(1, sizeof(*trans));
856 transaction_create_clone(Transaction *srctrans)
858 Transaction *trans = transaction_create(srctrans->pool);
859 queue_init_clone(&trans->steps, &srctrans->steps);
860 queue_init_clone(&trans->transaction_info, &srctrans->transaction_info);
861 if (srctrans->transaction_installed)
863 Repo *installed = srctrans->pool->installed;
864 trans->transaction_installed = solv_calloc(installed->end - installed->start, sizeof(Id));
865 memcpy(trans->transaction_installed, srctrans->transaction_installed, (installed->end - installed->start) * sizeof(Id));
867 map_init_clone(&trans->transactsmap, &srctrans->transactsmap);
868 map_init_clone(&trans->multiversionmap, &srctrans->multiversionmap);
869 if (srctrans->orderdata)
871 struct _TransactionOrderdata *od = srctrans->orderdata;
872 trans->orderdata = solv_calloc(1, sizeof(*trans->orderdata));
873 trans->orderdata->tes = solv_malloc2(od->ntes, sizeof(*od->tes));
874 memcpy(trans->orderdata->tes, od->tes, od->ntes * sizeof(*od->tes));
875 trans->orderdata->ntes = od->ntes;
876 trans->orderdata->invedgedata = solv_malloc2(od->ninvedgedata, sizeof(Id));
877 memcpy(trans->orderdata->invedgedata, od->invedgedata, od->ninvedgedata * sizeof(Id));
878 trans->orderdata->ninvedgedata = od->ninvedgedata;
884 transaction_free(Transaction *trans)
886 queue_free(&trans->steps);
887 queue_free(&trans->transaction_info);
888 trans->transaction_installed = solv_free(trans->transaction_installed);
889 map_free(&trans->transactsmap);
890 map_free(&trans->multiversionmap);
891 transaction_free_orderdata(trans);
896 transaction_free_orderdata(Transaction *trans)
898 if (trans->orderdata)
900 struct _TransactionOrderdata *od = trans->orderdata;
901 od->tes = solv_free(od->tes);
902 od->invedgedata = solv_free(od->invedgedata);
903 trans->orderdata = solv_free(trans->orderdata);
909 struct _TransactionElement *tes;
921 addteedge(struct orderdata *od, int from, int to, int type)
924 struct _TransactionElement *te;
929 /* printf("edge %d(%s) -> %d(%s) type %x\n", from, pool_solvid2str(pool, od->tes[from].p), to, pool_solvid2str(pool, od->tes[to].p), type); */
932 for (i = te->edges; od->edgedata[i]; i += 2)
933 if (od->edgedata[i] == to)
935 /* test of brokenness */
936 if (type == TYPE_BROKEN)
937 return od->edgedata[i] && (od->edgedata[i + 1] & TYPE_BROKEN) != 0 ? 1 : 0;
940 od->edgedata[i + 1] |= type;
943 if (i + 1 == od->nedgedata)
945 /* printf("tail add %d\n", i - te->edges); */
948 od->edgedata = solv_extend(od->edgedata, od->nedgedata, 3, sizeof(Id), EDGEDATA_BLOCK);
952 /* printf("extend %d\n", i - te->edges); */
953 od->edgedata = solv_extend(od->edgedata, od->nedgedata, 3 + (i - te->edges), sizeof(Id), EDGEDATA_BLOCK);
955 memcpy(od->edgedata + od->nedgedata, od->edgedata + te->edges, sizeof(Id) * (i - te->edges));
956 i = od->nedgedata + (i - te->edges);
957 te->edges = od->nedgedata;
959 od->edgedata[i] = to;
960 od->edgedata[i + 1] = type;
961 od->edgedata[i + 2] = 0; /* end marker */
962 od->nedgedata = i + 3;
967 addedge(struct orderdata *od, Id from, Id to, int type)
969 Transaction *trans = od->trans;
970 Pool *pool = trans->pool;
972 struct _TransactionElement *te;
975 /* printf("addedge %d %d type %d\n", from, to, type); */
976 s = pool->solvables + from;
977 if (s->repo == pool->installed && trans->transaction_installed[from - pool->installed->start])
979 /* obsolete, map to install */
980 if (trans->transaction_installed[from - pool->installed->start] > 0)
981 from = trans->transaction_installed[from - pool->installed->start];
988 queue_init_buffer(&ti, tibuf, sizeof(tibuf)/sizeof(*tibuf));
989 transaction_all_obs_pkgs(trans, from, &ti);
990 for (i = 0; i < ti.count; i++)
991 ret |= addedge(od, ti.elements[i], to, type);
996 s = pool->solvables + to;
997 if (s->repo == pool->installed && trans->transaction_installed[to - pool->installed->start])
999 /* obsolete, map to install */
1000 if (trans->transaction_installed[to - pool->installed->start] > 0)
1001 to = trans->transaction_installed[to - pool->installed->start];
1008 queue_init_buffer(&ti, tibuf, sizeof(tibuf)/sizeof(*tibuf));
1009 transaction_all_obs_pkgs(trans, to, &ti);
1010 for (i = 0; i < ti.count; i++)
1011 ret |= addedge(od, from, ti.elements[i], type);
1017 /* map from/to to te numbers */
1018 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1025 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1031 return addteedge(od, i, to, type);
1036 havechoice(struct orderdata *od, Id p, Id q1, Id q2)
1038 Transaction *trans = od->trans;
1039 Pool *pool = trans->pool;
1040 Id ti1buf[5], ti2buf[5];
1044 /* both q1 and q2 are uninstalls. check if their TEs intersect */
1045 /* common case: just one TE for both packages */
1047 printf("havechoice %d %d %d\n", p, q1, q2);
1049 if (trans->transaction_installed[q1 - pool->installed->start] == 0)
1051 if (trans->transaction_installed[q2 - pool->installed->start] == 0)
1053 if (trans->transaction_installed[q1 - pool->installed->start] == trans->transaction_installed[q2 - pool->installed->start])
1055 if (trans->transaction_installed[q1 - pool->installed->start] > 0 && trans->transaction_installed[q2 - pool->installed->start] > 0)
1057 queue_init_buffer(&ti1, ti1buf, sizeof(ti1buf)/sizeof(*ti1buf));
1058 transaction_all_obs_pkgs(trans, q1, &ti1);
1059 queue_init_buffer(&ti2, ti2buf, sizeof(ti2buf)/sizeof(*ti2buf));
1060 transaction_all_obs_pkgs(trans, q2, &ti2);
1061 for (i = 0; i < ti1.count; i++)
1062 for (j = 0; j < ti2.count; j++)
1063 if (ti1.elements[i] == ti2.elements[j])
1065 /* found a common edge */
1077 havescripts(Pool *pool, Id solvid)
1079 Solvable *s = pool->solvables + solvid;
1085 reqp = s->repo->idarraydata + s->requires;
1086 while ((req = *reqp++) != 0)
1088 if (req == SOLVABLE_PREREQMARKER)
1095 dep = pool_id2str(pool, req);
1096 if (*dep == '/' && strcmp(dep, "/sbin/ldconfig") != 0)
1104 addsolvableedges(struct orderdata *od, Solvable *s)
1106 Transaction *trans = od->trans;
1107 Pool *pool = trans->pool;
1108 Id req, *reqp, con, *conp;
1110 int i, j, pre, numins;
1111 Repo *installed = pool->installed;
1117 printf("addsolvableedges %s\n", pool_solvable2str(pool, s));
1119 p = s - pool->solvables;
1123 reqp = s->repo->idarraydata + s->requires;
1125 while ((req = *reqp++) != 0)
1127 if (req == SOLVABLE_PREREQMARKER)
1133 if (pre != TYPE_PREREQ && installed && s->repo == installed)
1135 /* ignore normal requires if we're getting obsoleted */
1136 if (trans->transaction_installed[p - pool->installed->start])
1141 numins = 0; /* number of packages to be installed providing it */
1142 provbyinst = 0; /* provided by kept package */
1143 FOR_PROVIDES(p2, pp2, req)
1145 s2 = pool->solvables + p2;
1148 reqq.count = 0; /* self provides */
1151 if (s2->repo == installed && !MAPTST(&trans->transactsmap, p2))
1155 printf("IGNORE inst provides %s by %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s2));
1156 reqq.count = 0; /* provided by package that stays installed */
1162 if (s2->repo != installed && !MAPTST(&trans->transactsmap, p2))
1163 continue; /* package stays uninstalled */
1165 if (s->repo == installed)
1167 /* s gets uninstalled */
1168 queue_pushunique(&reqq, p2);
1169 if (s2->repo != installed)
1174 if (s2->repo == installed)
1175 continue; /* s2 gets uninstalled */
1176 queue_pushunique(&reqq, p2);
1181 /* prune to harmless ->inst edges */
1182 for (i = j = 0; i < reqq.count; i++)
1183 if (pool->solvables[reqq.elements[i]].repo != installed)
1184 reqq.elements[j++] = reqq.elements[i];
1188 if (numins && reqq.count)
1190 if (s->repo == installed)
1192 for (i = 0; i < reqq.count; i++)
1194 if (pool->solvables[reqq.elements[i]].repo == installed)
1196 for (j = 0; j < reqq.count; j++)
1198 if (pool->solvables[reqq.elements[j]].repo != installed)
1200 if (trans->transaction_installed[reqq.elements[i] - pool->installed->start] == reqq.elements[j])
1201 continue; /* no self edge */
1203 printf("add interrreq uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, reqq.elements[i]), pool_dep2str(pool, req), pool_solvid2str(pool, reqq.elements[j]));
1205 addedge(od, reqq.elements[i], reqq.elements[j], pre == TYPE_PREREQ ? TYPE_PREREQ_P : TYPE_REQ_P);
1211 /* no mixed types, remove all deps on uninstalls */
1212 for (i = j = 0; i < reqq.count; i++)
1213 if (pool->solvables[reqq.elements[i]].repo != installed)
1214 reqq.elements[j++] = reqq.elements[i];
1219 for (i = 0; i < reqq.count; i++)
1222 p2 = reqq.elements[i];
1223 if (pool->solvables[p2].repo != installed)
1225 /* all elements of reqq are installs, thus have different TEs */
1226 choice = reqq.count - 1;
1227 if (pool->solvables[p].repo != installed)
1230 printf("add inst->inst edge choice %d (%s -> %s -> %s)\n", choice, pool_solvid2str(pool, p), pool_dep2str(pool, req), pool_solvid2str(pool, p2));
1232 addedge(od, p, p2, pre);
1237 printf("add uninst->inst edge choice %d (%s -> %s -> %s)\n", choice, pool_solvid2str(pool, p), pool_dep2str(pool, req), pool_solvid2str(pool, p2));
1239 addedge(od, p, p2, pre == TYPE_PREREQ ? TYPE_PREREQ_P : TYPE_REQ_P);
1244 if (s->repo != installed)
1245 continue; /* no inst->uninst edges, please! */
1247 /* uninst -> uninst edge. Those make trouble. Only add if we must */
1248 if (trans->transaction_installed[p - installed->start] && !havescripts(pool, p))
1250 /* p is obsoleted by another package and has no scripts */
1251 /* we assume that the obsoletor is good enough to replace p */
1256 for (j = 0; j < reqq.count; j++)
1260 if (havechoice(od, p, reqq.elements[i], reqq.elements[j]))
1265 printf("add uninst->uninst edge choice %d (%s -> %s -> %s)\n", choice, pool_solvid2str(pool, p), pool_dep2str(pool, req), pool_solvid2str(pool, p2));
1267 addedge(od, p2, p, pre == TYPE_PREREQ ? TYPE_PREREQ_P : TYPE_REQ_P);
1274 conp = s->repo->idarraydata + s->conflicts;
1275 while ((con = *conp++) != 0)
1277 FOR_PROVIDES(p2, pp2, con)
1281 s2 = pool->solvables + p2;
1284 if (s->repo == installed)
1286 if (s2->repo != installed && MAPTST(&trans->transactsmap, p2))
1288 /* deinstall p before installing p2 */
1290 printf("add conflict uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p2), pool_dep2str(pool, con), pool_solvid2str(pool, p));
1292 addedge(od, p2, p, TYPE_CON);
1297 if (s2->repo == installed && MAPTST(&trans->transactsmap, p2))
1299 /* deinstall p2 before installing p */
1301 printf("add conflict uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p), pool_dep2str(pool, con), pool_solvid2str(pool, p2));
1303 addedge(od, p, p2, TYPE_CON);
1310 if (s->repo == installed && solvable_lookup_idarray(s, SOLVABLE_TRIGGERS, &reqq) && reqq.count)
1312 /* we're getting deinstalled/updated. Try to do this before our
1313 * triggers are hit */
1314 for (i = 0; i < reqq.count; i++)
1316 Id tri = reqq.elements[i];
1317 FOR_PROVIDES(p2, pp2, tri)
1321 s2 = pool->solvables + p2;
1324 if (s2->name == s->name)
1325 continue; /* obsoleted anyway */
1326 if (s2->repo != installed && MAPTST(&trans->transactsmap, p2))
1328 /* deinstall/update p before installing p2 */
1330 printf("add trigger uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p2), pool_dep2str(pool, tri), pool_solvid2str(pool, p));
1332 addedge(od, p2, p, TYPE_CON);
1341 /* break an edge in a cycle */
1343 breakcycle(struct orderdata *od, Id *cycle)
1345 Pool *pool = od->trans->pool;
1346 Id ddegmin, ddegmax, ddeg;
1348 struct _TransactionElement *te;
1351 ddegmin = ddegmax = 0;
1352 for (k = 0; cycle[k + 1]; k += 2)
1354 ddeg = od->edgedata[cycle[k + 1] + 1];
1357 if (!k || ddeg < ddegmin)
1363 if (ddeg == ddegmin)
1365 if (havescripts(pool, od->tes[cycle[l]].p) && !havescripts(pool, od->tes[cycle[k]].p))
1367 /* prefer k, as l comes from a package with contains scriptlets */
1372 /* same edge value, check for prereq */
1376 /* record brkoen cycle starting with the tail */
1377 queue_push(&od->cycles, od->cyclesdata.count); /* offset into data */
1378 queue_push(&od->cycles, k / 2); /* cycle elements */
1379 queue_push(&od->cycles, od->edgedata[cycle[l + 1] + 1]); /* broken edge */
1386 queue_push(&od->cyclesdata, cycle[k]);
1390 queue_push(&od->cyclesdata, 0); /* mark end */
1392 /* break that edge */
1393 od->edgedata[cycle[l + 1] + 1] |= TYPE_BROKEN;
1396 if (ddegmin < TYPE_REQ)
1400 /* cycle recorded, print it */
1401 if (ddegmin >= TYPE_REQ && (ddegmax & TYPE_PREREQ) != 0)
1402 POOL_DEBUG(SOLV_DEBUG_STATS, "CRITICAL ");
1403 POOL_DEBUG(SOLV_DEBUG_STATS, "cycle: --> ");
1404 for (k = 0; cycle[k + 1]; k += 2)
1406 te = od->tes + cycle[k];
1407 if ((od->edgedata[cycle[k + 1] + 1] & TYPE_BROKEN) != 0)
1408 POOL_DEBUG(SOLV_DEBUG_STATS, "%s ##%x##> ", pool_solvid2str(pool, te->p), od->edgedata[cycle[k + 1] + 1]);
1410 POOL_DEBUG(SOLV_DEBUG_STATS, "%s --%x--> ", pool_solvid2str(pool, te->p), od->edgedata[cycle[k + 1] + 1]);
1412 POOL_DEBUG(SOLV_DEBUG_STATS, "\n");
1416 dump_tes(struct orderdata *od)
1418 Pool *pool = od->trans->pool;
1421 struct _TransactionElement *te, *te2;
1424 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1426 Solvable *s = pool->solvables + te->p;
1427 POOL_DEBUG(SOLV_DEBUG_RESULT, "TE %4d: %c%s\n", i, s->repo == pool->installed ? '-' : '+', pool_solvable2str(pool, s));
1428 if (s->repo != pool->installed)
1431 transaction_all_obs_pkgs(od->trans, te->p, &obsq);
1432 for (j = 0; j < obsq.count; j++)
1433 POOL_DEBUG(SOLV_DEBUG_RESULT, " -%s\n", pool_solvid2str(pool, obsq.elements[j]));
1435 for (j = te->edges; od->edgedata[j]; j += 2)
1437 te2 = od->tes + od->edgedata[j];
1438 if ((od->edgedata[j + 1] & TYPE_BROKEN) == 0)
1439 POOL_DEBUG(SOLV_DEBUG_RESULT, " --%x--> TE %4d: %s\n", od->edgedata[j + 1], od->edgedata[j], pool_solvid2str(pool, te2->p));
1441 POOL_DEBUG(SOLV_DEBUG_RESULT, " ##%x##> TE %4d: %s\n", od->edgedata[j + 1], od->edgedata[j], pool_solvid2str(pool, te2->p));
1448 reachable(struct orderdata *od, Id i)
1450 struct _TransactionElement *te = od->tes + i;
1456 for (j = te->edges; (k = od->edgedata[j]) != 0; j += 2)
1458 if ((od->edgedata[j + 1] & TYPE_BROKEN) != 0)
1460 if (!od->tes[k].mark)
1462 if (od->tes[k].mark == 2)
1473 addcycleedges(struct orderdata *od, Id *cycle, Queue *todo)
1476 Transaction *trans = od->trans;
1477 Pool *pool = trans->pool;
1479 struct _TransactionElement *te;
1486 printf("addcycleedges\n");
1487 for (i = 0; (j = cycle[i]) != 0; i++)
1488 printf("cycle %s\n", pool_solvid2str(pool, od->tes[j].p));
1491 /* first add all the tail cycle edges */
1493 /* see what we can reach from the cycle */
1495 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1497 for (i = 0; (j = cycle[i]) != 0; i++)
1499 od->tes[j].mark = -1;
1500 queue_push(todo, j);
1504 i = queue_pop(todo);
1508 te->mark = te->mark < 0 ? 2 : 1;
1509 for (j = te->edges; (k = od->edgedata[j]) != 0; j += 2)
1511 if ((od->edgedata[j + 1] & TYPE_BROKEN) != 0)
1513 if (od->tes[k].mark > 0)
1514 continue; /* no need to visit again */
1515 queue_push(todo, k);
1518 /* now all cycle TEs are marked with 2, all TEs reachable
1519 * from the cycle are marked with 1 */
1521 od->tes[tail].mark = 1; /* no need to add edges */
1523 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1526 continue; /* reachable from cycle */
1527 for (j = te->edges; (k = od->edgedata[j]) != 0; j += 2)
1529 if ((od->edgedata[j + 1] & TYPE_BROKEN) != 0)
1531 if (od->tes[k].mark != 2)
1533 /* We found an edge to the cycle. Add an extra edge to the tail */
1534 /* the TE was not reachable, so we're not creating a new cycle! */
1536 printf("adding TO TAIL cycle edge %d->%d %s->%s!\n", i, tail, pool_solvid2str(pool, od->tes[i].p), pool_solvid2str(pool, od->tes[tail].p));
1538 j -= te->edges; /* in case we move */
1539 addteedge(od, i, tail, TYPE_CYCLETAIL);
1541 break; /* one edge is enough */
1546 /* now add all head cycle edges */
1549 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1552 for (i = 0; (j = cycle[i]) != 0; i++)
1555 od->tes[j].mark = 2;
1557 /* first the head to save some time */
1558 te = od->tes + head;
1559 for (j = te->edges; (k = od->edgedata[j]) != 0; j += 2)
1561 if ((od->edgedata[j + 1] & TYPE_BROKEN) != 0)
1563 if (!od->tes[k].mark)
1565 if (od->tes[k].mark == -1)
1566 od->tes[k].mark = -2; /* no need for another edge */
1568 for (i = 0; cycle[i] != 0; i++)
1570 if (cycle[i] == head)
1572 te = od->tes + cycle[i];
1573 for (j = te->edges; (k = od->edgedata[j]) != 0; j += 2)
1575 if ((od->edgedata[j + 1] & TYPE_BROKEN) != 0)
1577 /* see if we can reach a cycle TE from k */
1578 if (!od->tes[k].mark)
1580 if (od->tes[k].mark == -1)
1583 printf("adding FROM HEAD cycle edge %d->%d %s->%s [%s]!\n", head, k, pool_solvid2str(pool, od->tes[head].p), pool_solvid2str(pool, od->tes[k].p), pool_solvid2str(pool, od->tes[cycle[i]].p));
1585 addteedge(od, head, k, TYPE_CYCLEHEAD);
1586 od->tes[k].mark = -2; /* no need to add that one again */
1594 transaction_order(Transaction *trans, int flags)
1596 Pool *pool = trans->pool;
1597 Queue *tr = &trans->steps;
1598 Repo *installed = pool->installed;
1601 int i, j, k, numte, numedge;
1602 struct orderdata od;
1603 struct _TransactionElement *te;
1604 Queue todo, obsq, samerepoq, uninstq;
1605 int cycstart, cycel;
1613 start = now = solv_timems(0);
1614 POOL_DEBUG(SOLV_DEBUG_STATS, "ordering transaction\n");
1615 /* free old data if present */
1616 if (trans->orderdata)
1618 struct _TransactionOrderdata *od = trans->orderdata;
1619 od->tes = solv_free(od->tes);
1620 od->invedgedata = solv_free(od->invedgedata);
1621 trans->orderdata = solv_free(trans->orderdata);
1624 /* create a transaction element for every active component */
1626 for (i = 0; i < tr->count; i++)
1628 p = tr->elements[i];
1629 s = pool->solvables + p;
1630 if (installed && s->repo == installed && trans->transaction_installed[p - installed->start])
1634 POOL_DEBUG(SOLV_DEBUG_STATS, "transaction elements: %d\n", numte);
1636 return; /* nothing to do... */
1638 numte++; /* leave first one zero */
1639 memset(&od, 0, sizeof(od));
1642 od.tes = solv_calloc(numte, sizeof(*od.tes));
1643 od.edgedata = solv_extend(0, 0, 1, sizeof(Id), EDGEDATA_BLOCK);
1646 queue_init(&od.cycles);
1648 /* initialize TEs */
1649 for (i = 0, te = od.tes + 1; i < tr->count; i++)
1651 p = tr->elements[i];
1652 s = pool->solvables + p;
1653 if (installed && s->repo == installed && trans->transaction_installed[p - installed->start])
1659 /* create dependency graph */
1660 for (i = 0; i < tr->count; i++)
1661 addsolvableedges(&od, pool->solvables + tr->elements[i]);
1665 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1666 for (j = te->edges; od.edgedata[j]; j += 2)
1668 POOL_DEBUG(SOLV_DEBUG_STATS, "edges: %d, edge space: %d\n", numedge, od.nedgedata / 2);
1669 POOL_DEBUG(SOLV_DEBUG_STATS, "edge creation took %d ms\n", solv_timems(now));
1675 now = solv_timems(0);
1676 /* kill all cycles */
1678 for (i = numte - 1; i > 0; i--)
1679 queue_push(&todo, i);
1683 i = queue_pop(&todo);
1684 /* printf("- look at TE %d\n", i); */
1688 od.tes[i].mark = 2; /* done with that one */
1693 continue; /* already finished before */
1696 int edgestovisit = 0;
1697 /* new node, visit edges */
1698 for (j = te->edges; (k = od.edgedata[j]) != 0; j += 2)
1700 if ((od.edgedata[j + 1] & TYPE_BROKEN) != 0)
1702 if (od.tes[k].mark == 2)
1703 continue; /* no need to visit again */
1704 if (!edgestovisit++)
1705 queue_push(&todo, -i); /* end of edges marker */
1706 queue_push(&todo, k);
1709 te->mark = 2; /* no edges, done with that one */
1711 te->mark = 1; /* under investigation */
1714 /* oh no, we found a cycle */
1715 /* find start of cycle node (<0) */
1716 for (j = todo.count - 1; j >= 0; j--)
1717 if (todo.elements[j] == -i)
1721 /* build te/edge chain */
1723 for (j = k; j < todo.count; j++)
1724 if (todo.elements[j] < 0)
1725 todo.elements[k++] = -todo.elements[j];
1726 cycel = k - cycstart;
1728 /* make room for edges, two extra element for cycle loop + terminating 0 */
1729 while (todo.count < cycstart + 2 * cycel + 2)
1730 queue_push(&todo, 0);
1731 cycle = todo.elements + cycstart;
1732 cycle[cycel] = i; /* close the loop */
1733 cycle[2 * cycel + 1] = 0; /* terminator */
1734 for (k = cycel; k > 0; k--)
1736 cycle[k * 2] = cycle[k];
1737 te = od.tes + cycle[k - 1];
1738 assert(te->mark == 1);
1739 te->mark = 0; /* reset investigation marker */
1740 /* printf("searching for edge from %d to %d\n", cycle[k - 1], cycle[k]); */
1741 for (j = te->edges; od.edgedata[j]; j += 2)
1742 if (od.edgedata[j] == cycle[k])
1744 assert(od.edgedata[j]);
1745 cycle[k * 2 - 1] = j;
1747 /* now cycle looks like this: */
1748 /* te1 edge te2 edge te3 ... teN edge te1 0 */
1749 breakcycle(&od, cycle);
1750 /* restart with start of cycle */
1751 todo.count = cycstart + 1;
1753 POOL_DEBUG(SOLV_DEBUG_STATS, "cycles broken: %d\n", od.ncycles);
1754 POOL_DEBUG(SOLV_DEBUG_STATS, "cycle breaking took %d ms\n", solv_timems(now));
1756 now = solv_timems(0);
1757 /* now go through all broken cycles and create cycle edges to help
1759 for (i = od.cycles.count - 3; i >= 0; i -= 3)
1761 if (od.cycles.elements[i + 2] >= TYPE_REQ)
1762 addcycleedges(&od, od.cyclesdata.elements + od.cycles.elements[i], &todo);
1764 for (i = od.cycles.count - 3; i >= 0; i -= 3)
1766 if (od.cycles.elements[i + 2] < TYPE_REQ)
1767 addcycleedges(&od, od.cyclesdata.elements + od.cycles.elements[i], &todo);
1769 POOL_DEBUG(SOLV_DEBUG_STATS, "cycle edge creation took %d ms\n", solv_timems(now));
1774 /* all edges are finally set up and there are no cycles, now the easy part.
1775 * Create an ordered transaction */
1776 now = solv_timems(0);
1777 /* first invert all edges */
1778 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1779 te->mark = 1; /* term 0 */
1780 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1782 for (j = te->edges; od.edgedata[j]; j += 2)
1784 if ((od.edgedata[j + 1] & TYPE_BROKEN) != 0)
1786 od.tes[od.edgedata[j]].mark++;
1790 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1795 POOL_DEBUG(SOLV_DEBUG_STATS, "invedge space: %d\n", j + 1);
1796 od.invedgedata = solv_calloc(j + 1, sizeof(Id));
1797 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1799 for (j = te->edges; od.edgedata[j]; j += 2)
1801 if ((od.edgedata[j + 1] & TYPE_BROKEN) != 0)
1803 od.invedgedata[--od.tes[od.edgedata[j]].mark] = i;
1806 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1807 te->edges = te->mark; /* edges now points into invedgedata */
1808 od.edgedata = solv_free(od.edgedata);
1809 od.nedgedata = j + 1;
1811 /* now the final ordering */
1812 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1814 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1815 for (j = te->edges; od.invedgedata[j]; j++)
1816 od.tes[od.invedgedata[j]].mark++;
1818 queue_init(&samerepoq);
1819 queue_init(&uninstq);
1821 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1824 if (installed && pool->solvables[te->p].repo == installed)
1825 queue_push(&uninstq, i);
1827 queue_push(&todo, i);
1829 assert(todo.count > 0 || uninstq.count > 0);
1830 oldcount = tr->count;
1837 temedianr = solv_calloc(numte, sizeof(Id));
1838 for (i = 1; i < numte; i++)
1840 Solvable *s = pool->solvables + od.tes[i].p;
1841 if (installed && s->repo == installed)
1844 j = solvable_lookup_num(s, SOLVABLE_MEDIANR, 1);
1849 /* select an TE i */
1851 i = queue_shift(&uninstq);
1852 else if (samerepoq.count)
1853 i = queue_shift(&samerepoq);
1854 else if (todo.count)
1856 /* find next repo/media */
1857 for (j = 0; j < todo.count; j++)
1859 if (!j || temedianr[todo.elements[j]] < lastmedia)
1862 lastmedia = temedianr[todo.elements[j]];
1865 lastrepo = pool->solvables[od.tes[todo.elements[i]].p].repo;
1867 /* move all matching TEs to samerepoq */
1868 for (i = j = 0; j < todo.count; j++)
1870 int k = todo.elements[j];
1871 if (temedianr[k] == lastmedia && pool->solvables[od.tes[k].p].repo == lastrepo)
1872 queue_push(&samerepoq, k);
1874 todo.elements[i++] = k;
1878 assert(samerepoq.count);
1879 i = queue_shift(&samerepoq);
1885 queue_push(tr, te->p);
1887 printf("do %s [%d]\n", pool_solvid2str(pool, te->p), temedianr[i]);
1889 s = pool->solvables + te->p;
1890 for (j = te->edges; od.invedgedata[j]; j++)
1892 struct _TransactionElement *te2 = od.tes + od.invedgedata[j];
1893 assert(te2->mark > 0);
1894 if (--te2->mark == 0)
1896 Solvable *s = pool->solvables + te2->p;
1898 printf("free %s [%d]\n", pool_solvid2str(pool, te2->p), temedianr[od.invedgedata[j]]);
1900 if (installed && s->repo == installed)
1901 queue_push(&uninstq, od.invedgedata[j]);
1902 else if (s->repo == lastrepo && temedianr[od.invedgedata[j]] == lastmedia)
1903 queue_push(&samerepoq, od.invedgedata[j]);
1905 queue_push(&todo, od.invedgedata[j]);
1909 solv_free(temedianr);
1911 queue_free(&samerepoq);
1912 queue_free(&uninstq);
1914 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1915 assert(te->mark == 0);
1917 /* add back obsoleted packages */
1918 transaction_add_obsoleted(trans);
1919 assert(tr->count == oldcount);
1921 POOL_DEBUG(SOLV_DEBUG_STATS, "creating new transaction took %d ms\n", solv_timems(now));
1922 POOL_DEBUG(SOLV_DEBUG_STATS, "transaction ordering took %d ms\n", solv_timems(start));
1924 if ((flags & SOLVER_TRANSACTION_KEEP_ORDERDATA) != 0)
1926 trans->orderdata = solv_calloc(1, sizeof(*trans->orderdata));
1927 trans->orderdata->tes = od.tes;
1928 trans->orderdata->ntes = numte;
1929 trans->orderdata->invedgedata = od.invedgedata;
1930 trans->orderdata->ninvedgedata = od.nedgedata;
1935 solv_free(od.invedgedata);
1937 queue_free(&od.cycles);
1938 queue_free(&od.cyclesdata);
1943 transaction_order_add_choices(Transaction *trans, Id chosen, Queue *choices)
1946 struct _TransactionOrderdata *od = trans->orderdata;
1947 struct _TransactionElement *te;
1950 return choices->count;
1953 /* initialization step */
1954 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1956 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1958 for (j = te->edges; od->invedgedata[j]; j++)
1959 od->tes[od->invedgedata[j]].mark++;
1961 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1963 queue_push(choices, te->p);
1964 return choices->count;
1966 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1967 if (te->p == chosen)
1970 return choices->count;
1973 /* hey! out-of-order installation! */
1976 for (j = te->edges; od->invedgedata[j]; j++)
1978 te = od->tes + od->invedgedata[j];
1979 assert(te->mark > 0 || te->mark == -1);
1980 if (te->mark > 0 && --te->mark == 0)
1981 queue_push(choices, te->p);
1983 return choices->count;
1987 transaction_add_obsoleted(Transaction *trans)
1989 Pool *pool = trans->pool;
1990 Repo *installed = pool->installed;
1997 if (!installed || !trans->steps.count)
1999 /* calculate upper bound */
2001 FOR_REPO_SOLVABLES(installed, p, s)
2002 if (MAPTST(&trans->transactsmap, p))
2007 steps = &trans->steps;
2008 queue_insertn(steps, 0, max, 0);
2011 map_init(&done, installed->end - installed->start);
2013 for (j = 0, i = max; i < steps->count; i++)
2015 p = trans->steps.elements[i];
2016 if (pool->solvables[p].repo == installed)
2018 if (!trans->transaction_installed[p - pool->installed->start])
2019 trans->steps.elements[j++] = p;
2022 trans->steps.elements[j++] = p;
2024 transaction_all_obs_pkgs(trans, p, &obsq);
2025 for (k = 0; k < obsq.count; k++)
2027 p = obsq.elements[k];
2028 assert(p >= installed->start && p < installed->end);
2029 if (!MAPTST(&trans->transactsmap, p)) /* just in case */
2031 if (MAPTST(&done, p - installed->start))
2033 MAPSET(&done, p - installed->start);
2034 trans->steps.elements[j++] = p;
2038 /* free unneeded space */
2039 queue_truncate(steps, j);
2045 transaction_check_pkg(Transaction *trans, Id tepkg, Id pkg, Map *ins, Map *seen, int onlyprereq, Id noconfpkg, int depth)
2047 Pool *pool = trans->pool;
2052 if (MAPTST(seen, pkg))
2055 s = pool->solvables + pkg;
2057 printf("- %*s%c%s\n", depth * 2, "", s->repo == pool->installed ? '-' : '+', pool_solvable2str(pool, s));
2063 reqp = s->repo->idarraydata + s->requires;
2064 while ((req = *reqp++) != 0)
2066 if (req == SOLVABLE_PREREQMARKER)
2071 if (onlyprereq && !inpre)
2073 if (!strncmp(pool_id2str(pool, req), "rpmlib(", 7))
2076 /* first check kept packages, then freshly installed, then not yet uninstalled */
2077 FOR_PROVIDES(p, pp, req)
2079 if (!MAPTST(ins, p))
2081 if (MAPTST(&trans->transactsmap, p))
2084 transaction_check_pkg(trans, tepkg, p, ins, seen, 0, noconfpkg, depth + 1);
2088 FOR_PROVIDES(p, pp, req)
2090 if (!MAPTST(ins, p))
2092 if (pool->solvables[p].repo == pool->installed)
2095 transaction_check_pkg(trans, tepkg, p, ins, seen, 0, noconfpkg, depth + 1);
2100 FOR_PROVIDES(p, pp, req)
2102 if (!MAPTST(ins, p))
2105 transaction_check_pkg(trans, tepkg, p, ins, seen, 0, noconfpkg, depth + 1);
2110 POOL_DEBUG(SOLV_DEBUG_RESULT, " %c%s: nothing provides %s needed by %c%s\n", pool->solvables[tepkg].repo == pool->installed ? '-' : '+', pool_solvid2str(pool, tepkg), pool_dep2str(pool, req), s->repo == pool->installed ? '-' : '+', pool_solvable2str(pool, s));
2117 transaction_check_order(Transaction *trans)
2119 Pool *pool = trans->pool;
2125 POOL_DEBUG(SOLV_DEBUG_RESULT, "\nchecking transaction order...\n");
2126 map_init(&ins, pool->nsolvables);
2127 map_init(&seen, pool->nsolvables);
2128 if (pool->installed)
2129 FOR_REPO_SOLVABLES(pool->installed, p, s)
2132 for (i = 0; i < trans->steps.count; i++)
2134 p = trans->steps.elements[i];
2135 s = pool->solvables + p;
2136 if (s->repo != pool->installed)
2138 if (s->repo != pool->installed)
2140 if (havescripts(pool, p))
2143 transaction_check_pkg(trans, p, p, &ins, &seen, 1, lastins, 0);
2145 if (s->repo == pool->installed)
2150 POOL_DEBUG(SOLV_DEBUG_RESULT, "transaction order check done.\n");