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;
202 /* these packages do not get installed by the package manager */
204 is_pseudo_package(Pool *pool, Solvable *s)
206 const char *n = pool_id2str(pool, s->name);
207 if (*n == 'p' && !strncmp(n, "patch:", 6))
209 if (*n == 'p' && !strncmp(n, "pattern:", 8))
211 if (*n == 'p' && !strncmp(n, "product:", 8))
213 if (*n == 'a' && !strncmp(n, "application:", 12))
218 /* these packages will never show up installed */
220 is_noinst_pseudo_package(Pool *pool, Solvable *s)
222 const char *n = pool_id2str(pool, s->name);
223 if (!strncmp(n, "patch:", 6))
225 if (!strncmp(n, "pattern:", 8))
227 #if defined(SUSE) && defined(ENABLE_LINKED_PKGS)
228 /* unlike normal patterns, autopatterns *can* be installed (via the package link),
229 so do not filter them */
232 Id prv, *prvp = s->repo->idarraydata + s->provides;
233 while ((prv = *prvp++) != 0)
234 if (ISRELDEP(prv) && !strcmp(pool_id2str(pool, prv), "autopattern()"))
244 obsoleted_by_pseudos_only(Transaction *trans, Id p)
246 Pool *pool = trans->pool;
251 op = transaction_obs_pkg(trans, p);
252 if (op && !is_pseudo_package(pool, pool->solvables + op))
255 transaction_all_obs_pkgs(trans, p, &q);
256 for (i = 0; i < q.count; i++)
257 if (!is_pseudo_package(pool, pool->solvables + q.elements[i]))
259 i = !q.count || i < q.count ? 0 : 1;
265 * return type of transaction element
267 * filtering is needed if either not all packages are shown
268 * or replaces are not shown, as otherwise parts of the
269 * transaction might not be shown to the user */
272 transaction_type(Transaction *trans, Id p, int mode)
274 Pool *pool = trans->pool;
275 Solvable *s = pool->solvables + p;
281 return SOLVER_TRANSACTION_IGNORE;
283 /* XXX: SUSE only? */
284 if (!(mode & SOLVER_TRANSACTION_KEEP_PSEUDO) && is_noinst_pseudo_package(pool, s))
285 return SOLVER_TRANSACTION_IGNORE;
287 type = transaction_base_type(trans, p);
289 if (type == SOLVER_TRANSACTION_IGNORE)
290 return SOLVER_TRANSACTION_IGNORE; /* not part of the transaction */
292 if ((mode & SOLVER_TRANSACTION_RPM_ONLY) != 0)
294 /* application wants to know what to feed to rpm */
295 if (type == SOLVER_TRANSACTION_ERASE || type == SOLVER_TRANSACTION_INSTALL || type == SOLVER_TRANSACTION_MULTIINSTALL)
297 if (s->repo == pool->installed)
299 /* check if we're obsoleted by pseudos only */
300 if (obsoleted_by_pseudos_only(trans, s - pool->solvables))
301 return SOLVER_TRANSACTION_ERASE;
302 return SOLVER_TRANSACTION_IGNORE; /* ignore as we're being obsoleted */
304 if (type == SOLVER_TRANSACTION_MULTIREINSTALL)
305 return SOLVER_TRANSACTION_MULTIINSTALL;
306 return SOLVER_TRANSACTION_INSTALL;
309 if ((mode & SOLVER_TRANSACTION_SHOW_MULTIINSTALL) == 0)
311 /* application wants to make no difference between install
312 * and multiinstall */
313 if (type == SOLVER_TRANSACTION_MULTIINSTALL)
314 type = SOLVER_TRANSACTION_INSTALL;
315 if (type == SOLVER_TRANSACTION_MULTIREINSTALL)
316 type = SOLVER_TRANSACTION_REINSTALL;
319 if ((mode & SOLVER_TRANSACTION_CHANGE_IS_REINSTALL) != 0)
321 /* application wants to make no difference between change
323 if (type == SOLVER_TRANSACTION_CHANGED)
324 type = SOLVER_TRANSACTION_REINSTALLED;
325 else if (type == SOLVER_TRANSACTION_CHANGE)
326 type = SOLVER_TRANSACTION_REINSTALL;
329 if (type == SOLVER_TRANSACTION_ERASE || type == SOLVER_TRANSACTION_INSTALL || type == SOLVER_TRANSACTION_MULTIINSTALL)
332 if (s->repo == pool->installed && (mode & SOLVER_TRANSACTION_SHOW_ACTIVE) == 0)
334 /* erase element and we're showing the passive side */
335 if (type == SOLVER_TRANSACTION_OBSOLETED && (mode & SOLVER_TRANSACTION_SHOW_OBSOLETES) == 0)
336 type = SOLVER_TRANSACTION_ERASE;
337 if (type == SOLVER_TRANSACTION_OBSOLETED && (mode & SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE) != 0)
338 type = SOLVER_TRANSACTION_UPGRADED;
341 if (s->repo != pool->installed && (mode & SOLVER_TRANSACTION_SHOW_ACTIVE) != 0)
343 /* install element and we're showing the active side */
344 if (type == SOLVER_TRANSACTION_OBSOLETES && (mode & SOLVER_TRANSACTION_SHOW_OBSOLETES) == 0)
345 type = SOLVER_TRANSACTION_INSTALL;
346 if (type == SOLVER_TRANSACTION_OBSOLETES && (mode & SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE) != 0)
347 type = SOLVER_TRANSACTION_UPGRADE;
351 /* the element doesn't match the show mode */
353 /* if we're showing all references, we can ignore this package */
354 if ((mode & (SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES)) == (SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES))
355 return SOLVER_TRANSACTION_IGNORE;
357 /* we're not showing all refs. check if some other package
358 * references us. If yes, it's safe to ignore this package,
359 * otherwise we need to map the type */
361 /* most of the time there's only one reference, so check it first */
362 q = transaction_obs_pkg(trans, p);
364 if ((mode & SOLVER_TRANSACTION_SHOW_OBSOLETES) == 0)
366 Solvable *sq = pool->solvables + q;
367 if (sq->name != s->name)
369 /* it's a replace but we're not showing replaces. map type. */
370 if (s->repo == pool->installed)
371 return SOLVER_TRANSACTION_ERASE;
372 else if (type == SOLVER_TRANSACTION_MULTIREINSTALL)
373 return SOLVER_TRANSACTION_MULTIINSTALL;
375 return SOLVER_TRANSACTION_INSTALL;
379 /* if there's a match, p will be shown when q
381 if (transaction_obs_pkg(trans, q) == p)
382 return SOLVER_TRANSACTION_IGNORE;
384 /* too bad, a miss. check em all */
387 transaction_all_obs_pkgs(trans, p, &oq);
388 for (i = 0; i < oq.count; i++)
391 if ((mode & SOLVER_TRANSACTION_SHOW_OBSOLETES) == 0)
393 Solvable *sq = pool->solvables + q;
394 if (sq->name != s->name)
397 /* check if we are referenced? */
398 if ((mode & SOLVER_TRANSACTION_SHOW_ALL) != 0)
400 transaction_all_obs_pkgs(trans, q, &rq);
401 for (j = 0; j < rq.count; j++)
402 if (rq.elements[j] == p)
410 else if (transaction_obs_pkg(trans, q) == p)
421 /* we're not referenced. map type */
422 if (s->repo == pool->installed)
423 return SOLVER_TRANSACTION_ERASE;
424 else if (type == SOLVER_TRANSACTION_MULTIREINSTALL)
425 return SOLVER_TRANSACTION_MULTIINSTALL;
427 return SOLVER_TRANSACTION_INSTALL;
429 /* there was a ref, so p is shown with some other package */
430 return SOLVER_TRANSACTION_IGNORE;
436 classify_cmp(const void *ap, const void *bp, void *dp)
438 Transaction *trans = dp;
439 Pool *pool = trans->pool;
449 return a[2] && b[2] ? strcmp(pool_id2str(pool, a[2]), pool_id2str(pool, b[2])) : r;
452 return a[3] && b[3] ? strcmp(pool_id2str(pool, a[3]), pool_id2str(pool, b[3])) : r;
457 classify_cmp_pkgs(const void *ap, const void *bp, void *dp)
459 Transaction *trans = dp;
460 Pool *pool = trans->pool;
465 sa = pool->solvables + a;
466 sb = pool->solvables + b;
467 if (sa->name != sb->name)
468 return strcmp(pool_id2str(pool, sa->name), pool_id2str(pool, sb->name));
469 if (sa->evr != sb->evr)
471 int r = pool_evrcmp(pool, sa->evr, sb->evr, EVRCMP_COMPARE);
479 queue_push4(Queue *q, Id id1, Id id2, Id id3, Id id4)
488 queue_unshift4(Queue *q, Id id1, Id id2, Id id3, Id id4)
490 queue_unshift(q, id4);
491 queue_unshift(q, id3);
492 queue_unshift(q, id2);
493 queue_unshift(q, id1);
497 transaction_classify(Transaction *trans, int mode, Queue *classes)
499 Pool *pool = trans->pool;
500 int ntypes[SOLVER_TRANSACTION_MAXTYPE + 1];
502 Id v, vq, type, p, q;
505 queue_empty(classes);
506 memset(ntypes, 0, sizeof(ntypes));
507 /* go through transaction and classify each step */
508 for (i = 0; i < trans->steps.count; i++)
510 p = trans->steps.elements[i];
511 s = pool->solvables + p;
512 type = transaction_type(trans, p, mode);
514 if (!pool->installed || s->repo != pool->installed)
516 /* don't report vendor/arch changes if we were mapped to erase. */
517 if (type == SOLVER_TRANSACTION_ERASE)
519 /* look at arch/vendor changes */
520 q = transaction_obs_pkg(trans, p);
523 sq = pool->solvables + q;
529 if ((mode & SOLVER_TRANSACTION_MERGE_ARCHCHANGES) != 0)
531 for (j = 0; j < classes->count; j += 4)
532 if (classes->elements[j] == SOLVER_TRANSACTION_ARCHCHANGE && classes->elements[j + 2] == v && classes->elements[j + 3] == vq)
534 if (j == classes->count)
535 queue_push4(classes, SOLVER_TRANSACTION_ARCHCHANGE, 1, v, vq);
537 classes->elements[j + 1]++;
540 v = s->vendor ? s->vendor : 1;
541 vq = sq->vendor ? sq->vendor : 1;
544 if ((mode & SOLVER_TRANSACTION_MERGE_VENDORCHANGES) != 0)
546 for (j = 0; j < classes->count; j += 4)
547 if (classes->elements[j] == SOLVER_TRANSACTION_VENDORCHANGE && classes->elements[j + 2] == v && classes->elements[j + 3] == vq)
549 if (j == classes->count)
550 queue_push4(classes, SOLVER_TRANSACTION_VENDORCHANGE, 1, v, vq);
552 classes->elements[j + 1]++;
555 /* now sort all vendor/arch changes */
556 if (classes->count > 4)
557 solv_sort(classes->elements, classes->count / 4, 4 * sizeof(Id), classify_cmp, trans);
558 /* finally add all classes. put erases last */
559 i = SOLVER_TRANSACTION_ERASE;
561 queue_unshift4(classes, i, ntypes[i], 0, 0);
562 for (i = SOLVER_TRANSACTION_MAXTYPE; i > 0; i--)
566 if (i == SOLVER_TRANSACTION_ERASE)
568 queue_unshift4(classes, i, ntypes[i], 0, 0);
573 transaction_classify_pkgs(Transaction *trans, int mode, Id class, Id from, Id to, Queue *pkgs)
575 Pool *pool = trans->pool;
581 for (i = 0; i < trans->steps.count; i++)
583 p = trans->steps.elements[i];
584 s = pool->solvables + p;
585 if (class <= SOLVER_TRANSACTION_MAXTYPE)
587 type = transaction_type(trans, p, mode);
592 if (!pool->installed || s->repo != pool->installed)
594 q = transaction_obs_pkg(trans, p);
597 sq = pool->solvables + q;
598 if (class == SOLVER_TRANSACTION_ARCHCHANGE)
600 if ((!from && !to) || (s->arch == from && sq->arch == to))
604 if (class == SOLVER_TRANSACTION_VENDORCHANGE)
606 Id v = s->vendor ? s->vendor : 1;
607 Id vq = sq->vendor ? sq->vendor : 1;
608 if ((!from && !to) || (v == from && vq == to))
614 solv_sort(pkgs->elements, pkgs->count, sizeof(Id), classify_cmp_pkgs, trans);
618 create_transaction_info(Transaction *trans, Queue *decisionq)
620 Pool *pool = trans->pool;
621 Queue *ti = &trans->transaction_info;
622 Repo *installed = pool->installed;
628 trans->transaction_installed = solv_free(trans->transaction_installed);
630 return; /* no info needed */
631 for (i = 0; i < decisionq->count; i++)
633 p = decisionq->elements[i];
634 if (p <= 0 || p == SYSTEMSOLVABLE)
636 s = pool->solvables + p;
637 if (!s->repo || s->repo == installed)
639 multi = trans->multiversionmap.size && MAPTST(&trans->multiversionmap, p);
640 FOR_PROVIDES(p2, pp2, s->name)
642 if (!MAPTST(&trans->transactsmap, p2))
644 s2 = pool->solvables + p2;
645 if (s2->repo != installed)
647 if (multi && (s->name != s2->name || s->evr != s2->evr || s->arch != s2->arch))
649 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
651 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, s2))
653 queue_push2(ti, p, p2);
655 if (s->obsoletes && !multi)
657 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
658 while ((obs = *obsp++) != 0)
660 FOR_PROVIDES(p2, pp2, obs)
662 if (!MAPTST(&trans->transactsmap, p2))
664 s2 = pool->solvables + p2;
665 if (s2->repo != installed)
667 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
669 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
671 queue_push2(ti, p, p2);
679 solv_sort(ti->elements, ti->count / 2, 2 * sizeof(Id), obsq_sortcmp, pool);
680 for (i = j = 2; i < ti->count; i += 2)
682 if (ti->elements[i] == ti->elements[j - 2] && ti->elements[i + 1] == ti->elements[j - 1])
684 ti->elements[j++] = ti->elements[i];
685 ti->elements[j++] = ti->elements[i + 1];
687 queue_truncate(ti, j);
690 /* create transaction_installed helper */
691 /* entry > 0: exactly one obsoleter, entry < 0: multiple obsoleters, -entry is "best" */
692 trans->transaction_installed = solv_calloc(installed->end - installed->start, sizeof(Id));
693 for (i = 0; i < ti->count; i += 2)
695 j = ti->elements[i + 1] - installed->start;
696 if (!trans->transaction_installed[j])
697 trans->transaction_installed[j] = ti->elements[i];
700 /* more than one package obsoletes us. compare to find "best" */
702 if (trans->transaction_installed[j] > 0)
703 trans->transaction_installed[j] = -trans->transaction_installed[j];
704 q[0] = q[2] = ti->elements[i + 1];
705 q[1] = ti->elements[i];
706 q[3] = -trans->transaction_installed[j];
707 if (obsq_sortcmp(q, q + 2, pool) < 0)
708 trans->transaction_installed[j] = -ti->elements[i];
713 /* create a transaction from the decisionq */
715 transaction_create_decisionq(Pool *pool, Queue *decisionq, Map *multiversionmap)
717 Repo *installed = pool->installed;
723 trans = transaction_create(pool);
724 if (multiversionmap && !multiversionmap->size)
725 multiversionmap = 0; /* ignore empty map */
726 queue_empty(&trans->steps);
727 map_init(&trans->transactsmap, pool->nsolvables);
729 for (i = 0; i < decisionq->count; i++)
731 p = decisionq->elements[i];
732 s = pool->solvables + (p > 0 ? p : -p);
735 if (installed && s->repo == installed && p < 0)
736 MAPSET(&trans->transactsmap, -p);
737 if (!(installed && s->repo == installed) && p > 0)
739 MAPSET(&trans->transactsmap, p);
740 if (multiversionmap && MAPTST(multiversionmap, p))
744 MAPCLR(&trans->transactsmap, SYSTEMSOLVABLE);
746 map_init_clone(&trans->multiversionmap, multiversionmap);
748 create_transaction_info(trans, decisionq);
752 FOR_REPO_SOLVABLES(installed, p, s)
754 if (MAPTST(&trans->transactsmap, p))
755 queue_push(&trans->steps, p);
758 for (i = 0; i < decisionq->count; i++)
760 p = decisionq->elements[i];
761 if (p > 0 && MAPTST(&trans->transactsmap, p))
762 queue_push(&trans->steps, p);
768 transaction_installedresult(Transaction *trans, Queue *installedq)
770 Pool *pool = trans->pool;
771 Repo *installed = pool->installed;
776 queue_empty(installedq);
777 /* first the new installs, than the kept packages */
778 for (i = 0; i < trans->steps.count; i++)
780 p = trans->steps.elements[i];
781 s = pool->solvables + p;
782 if (installed && s->repo == installed)
784 queue_push(installedq, p);
786 cutoff = installedq->count;
789 FOR_REPO_SOLVABLES(installed, p, s)
790 if (!MAPTST(&trans->transactsmap, p))
791 queue_push(installedq, p);
797 transaction_make_installedmap(Transaction *trans, Map *installedmap)
799 Pool *pool = trans->pool;
800 Repo *installed = pool->installed;
805 map_init(installedmap, pool->nsolvables);
806 for (i = 0; i < trans->steps.count; i++)
808 p = trans->steps.elements[i];
809 s = pool->solvables + p;
810 if (!installed || s->repo != installed)
811 MAPSET(installedmap, p);
815 FOR_REPO_SOLVABLES(installed, p, s)
816 if (!MAPTST(&trans->transactsmap, p))
817 MAPSET(installedmap, p);
822 transaction_calc_installsizechange(Transaction *trans)
827 transaction_make_installedmap(trans, &installedmap);
828 change = pool_calc_installsizechange(trans->pool, &installedmap);
829 map_free(&installedmap);
834 transaction_calc_duchanges(Transaction *trans, DUChanges *mps, int nmps)
838 transaction_make_installedmap(trans, &installedmap);
839 pool_calc_duchanges(trans->pool, &installedmap, mps, nmps);
840 map_free(&installedmap);
843 struct _TransactionElement {
844 Id p; /* solvable id */
845 Id edges; /* pointer into edges data */
849 struct _TransactionOrderdata {
850 struct _TransactionElement *tes;
856 #define TYPE_BROKEN (1<<0)
857 #define TYPE_CON (1<<1)
859 #define TYPE_REQ_P (1<<2)
860 #define TYPE_PREREQ_P (1<<3)
862 #define TYPE_REQ (1<<4)
863 #define TYPE_PREREQ (1<<5)
865 #define TYPE_CYCLETAIL (1<<16)
866 #define TYPE_CYCLEHEAD (1<<17)
868 #define EDGEDATA_BLOCK 127
871 transaction_create(Pool *pool)
873 Transaction *trans = solv_calloc(1, sizeof(*trans));
879 transaction_create_clone(Transaction *srctrans)
881 Transaction *trans = transaction_create(srctrans->pool);
882 queue_init_clone(&trans->steps, &srctrans->steps);
883 queue_init_clone(&trans->transaction_info, &srctrans->transaction_info);
884 if (srctrans->transaction_installed)
886 Repo *installed = srctrans->pool->installed;
887 trans->transaction_installed = solv_memdup2(srctrans->transaction_installed, installed->end - installed->start, sizeof(Id));
889 map_init_clone(&trans->transactsmap, &srctrans->transactsmap);
890 map_init_clone(&trans->multiversionmap, &srctrans->multiversionmap);
891 if (srctrans->orderdata)
893 struct _TransactionOrderdata *od = srctrans->orderdata;
894 trans->orderdata = solv_calloc(1, sizeof(*trans->orderdata));
895 trans->orderdata->tes = solv_memdup2(od->tes, od->ntes, sizeof(*od->tes));
896 trans->orderdata->ntes = od->ntes;
897 trans->orderdata->invedgedata = solv_memdup2(od->invedgedata, od->ninvedgedata, sizeof(Id));
898 trans->orderdata->ninvedgedata = od->ninvedgedata;
904 transaction_free(Transaction *trans)
906 queue_free(&trans->steps);
907 queue_free(&trans->transaction_info);
908 trans->transaction_installed = solv_free(trans->transaction_installed);
909 map_free(&trans->transactsmap);
910 map_free(&trans->multiversionmap);
911 transaction_free_orderdata(trans);
916 transaction_free_orderdata(Transaction *trans)
918 if (trans->orderdata)
920 struct _TransactionOrderdata *od = trans->orderdata;
921 od->tes = solv_free(od->tes);
922 od->invedgedata = solv_free(od->invedgedata);
923 trans->orderdata = solv_free(trans->orderdata);
929 struct _TransactionElement *tes;
941 addteedge(struct orderdata *od, int from, int to, int type)
944 struct _TransactionElement *te;
949 /* 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); */
952 for (i = te->edges; od->edgedata[i]; i += 2)
953 if (od->edgedata[i] == to)
955 /* test of brokenness */
956 if (type == TYPE_BROKEN)
957 return od->edgedata[i] && (od->edgedata[i + 1] & TYPE_BROKEN) != 0 ? 1 : 0;
960 od->edgedata[i + 1] |= type;
963 if (i + 1 == od->nedgedata)
965 /* printf("tail add %d\n", i - te->edges); */
968 od->edgedata = solv_extend(od->edgedata, od->nedgedata, 3, sizeof(Id), EDGEDATA_BLOCK);
972 /* printf("extend %d\n", i - te->edges); */
973 od->edgedata = solv_extend(od->edgedata, od->nedgedata, 3 + (i - te->edges), sizeof(Id), EDGEDATA_BLOCK);
975 memcpy(od->edgedata + od->nedgedata, od->edgedata + te->edges, sizeof(Id) * (i - te->edges));
976 i = od->nedgedata + (i - te->edges);
977 te->edges = od->nedgedata;
979 od->edgedata[i] = to;
980 od->edgedata[i + 1] = type;
981 od->edgedata[i + 2] = 0; /* end marker */
982 od->nedgedata = i + 3;
987 addedge(struct orderdata *od, Id from, Id to, int type)
989 Transaction *trans = od->trans;
990 Pool *pool = trans->pool;
992 struct _TransactionElement *te;
995 /* printf("addedge %d %d type %d\n", from, to, type); */
996 s = pool->solvables + from;
997 if (s->repo == pool->installed && trans->transaction_installed[from - pool->installed->start])
999 /* obsolete, map to install */
1000 if (trans->transaction_installed[from - pool->installed->start] > 0)
1001 from = trans->transaction_installed[from - pool->installed->start];
1008 queue_init_buffer(&ti, tibuf, sizeof(tibuf)/sizeof(*tibuf));
1009 transaction_all_obs_pkgs(trans, from, &ti);
1010 for (i = 0; i < ti.count; i++)
1011 ret |= addedge(od, ti.elements[i], to, type);
1016 s = pool->solvables + to;
1017 if (s->repo == pool->installed && trans->transaction_installed[to - pool->installed->start])
1019 /* obsolete, map to install */
1020 if (trans->transaction_installed[to - pool->installed->start] > 0)
1021 to = trans->transaction_installed[to - pool->installed->start];
1028 queue_init_buffer(&ti, tibuf, sizeof(tibuf)/sizeof(*tibuf));
1029 transaction_all_obs_pkgs(trans, to, &ti);
1030 for (i = 0; i < ti.count; i++)
1031 ret |= addedge(od, from, ti.elements[i], type);
1037 /* map from/to to te numbers */
1038 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1045 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1051 return addteedge(od, i, to, type);
1055 havescripts(Pool *pool, Id solvid)
1057 Solvable *s = pool->solvables + solvid;
1063 reqp = s->repo->idarraydata + s->requires;
1064 while ((req = *reqp++) != 0)
1066 if (req == SOLVABLE_PREREQMARKER)
1073 dep = pool_id2str(pool, req);
1074 if (*dep == '/' && strcmp(dep, "/sbin/ldconfig") != 0)
1082 addsolvableedges(struct orderdata *od, Solvable *s)
1084 Transaction *trans = od->trans;
1085 Pool *pool = trans->pool;
1086 Id req, *reqp, con, *conp;
1088 int i, j, pre, numins;
1089 Repo *installed = pool->installed;
1095 printf("addsolvableedges %s\n", pool_solvable2str(pool, s));
1097 p = s - pool->solvables;
1101 reqp = s->repo->idarraydata + s->requires;
1103 while ((req = *reqp++) != 0)
1105 if (req == SOLVABLE_PREREQMARKER)
1111 if (pre != TYPE_PREREQ && installed && s->repo == installed)
1113 /* ignore normal requires if we're getting obsoleted */
1114 if (trans->transaction_installed[p - pool->installed->start])
1119 numins = 0; /* number of packages to be installed providing it */
1120 provbyinst = 0; /* provided by kept package */
1121 FOR_PROVIDES(p2, pp2, req)
1123 s2 = pool->solvables + p2;
1126 reqq.count = 0; /* self provides */
1129 if (s2->repo == installed && !MAPTST(&trans->transactsmap, p2))
1133 printf("IGNORE inst provides %s by %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s2));
1134 reqq.count = 0; /* provided by package that stays installed */
1140 if (s2->repo != installed && !MAPTST(&trans->transactsmap, p2))
1141 continue; /* package stays uninstalled */
1143 if (s->repo == installed)
1145 /* s gets uninstalled */
1146 queue_pushunique(&reqq, p2);
1147 if (s2->repo != installed)
1152 if (s2->repo == installed)
1153 continue; /* s2 gets uninstalled */
1154 queue_pushunique(&reqq, p2);
1159 /* prune to harmless ->inst edges */
1160 for (i = j = 0; i < reqq.count; i++)
1161 if (pool->solvables[reqq.elements[i]].repo != installed)
1162 reqq.elements[j++] = reqq.elements[i];
1166 if (numins && reqq.count)
1168 if (s->repo == installed)
1170 for (i = 0; i < reqq.count; i++)
1172 if (pool->solvables[reqq.elements[i]].repo == installed)
1174 for (j = 0; j < reqq.count; j++)
1176 if (pool->solvables[reqq.elements[j]].repo != installed)
1178 if (trans->transaction_installed[reqq.elements[i] - pool->installed->start] == reqq.elements[j])
1179 continue; /* no self edge */
1181 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]));
1183 addedge(od, reqq.elements[i], reqq.elements[j], pre == TYPE_PREREQ ? TYPE_PREREQ_P : TYPE_REQ_P);
1189 /* no mixed types, remove all deps on uninstalls */
1190 for (i = j = 0; i < reqq.count; i++)
1191 if (pool->solvables[reqq.elements[i]].repo != installed)
1192 reqq.elements[j++] = reqq.elements[i];
1197 for (i = 0; i < reqq.count; i++)
1199 p2 = reqq.elements[i];
1200 if (pool->solvables[p2].repo != installed)
1202 /* all elements of reqq are installs, thus have different TEs */
1203 if (pool->solvables[p].repo != installed)
1206 printf("add inst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p), pool_dep2str(pool, req), pool_solvid2str(pool, p2));
1208 addedge(od, p, p2, pre);
1213 printf("add uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p), pool_dep2str(pool, req), pool_solvid2str(pool, p2));
1215 addedge(od, p, p2, pre == TYPE_PREREQ ? TYPE_PREREQ_P : TYPE_REQ_P);
1220 if (s->repo != installed)
1221 continue; /* no inst->uninst edges, please! */
1223 /* uninst -> uninst edge. Those make trouble. Only add if we must */
1224 if (trans->transaction_installed[p - installed->start] && !havescripts(pool, p))
1226 /* p is obsoleted by another package and has no scripts */
1227 /* we assume that the obsoletor is good enough to replace p */
1231 printf("add uninst->uninst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p), pool_dep2str(pool, req), pool_solvid2str(pool, p2));
1233 addedge(od, p2, p, pre == TYPE_PREREQ ? TYPE_PREREQ_P : TYPE_REQ_P);
1240 conp = s->repo->idarraydata + s->conflicts;
1241 while ((con = *conp++) != 0)
1243 FOR_PROVIDES(p2, pp2, con)
1247 s2 = pool->solvables + p2;
1250 if (s->repo == installed)
1252 if (s2->repo != installed && MAPTST(&trans->transactsmap, p2))
1254 /* deinstall p before installing p2 */
1256 printf("add conflict uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p2), pool_dep2str(pool, con), pool_solvid2str(pool, p));
1258 addedge(od, p2, p, TYPE_CON);
1263 if (s2->repo == installed && MAPTST(&trans->transactsmap, p2))
1265 /* deinstall p2 before installing p */
1267 printf("add conflict uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p), pool_dep2str(pool, con), pool_solvid2str(pool, p2));
1269 addedge(od, p, p2, TYPE_CON);
1276 if (s->repo == installed && solvable_lookup_idarray(s, SOLVABLE_TRIGGERS, &reqq) && reqq.count)
1278 /* we're getting deinstalled/updated. Try to do this before our
1279 * triggers are hit */
1280 for (i = 0; i < reqq.count; i++)
1282 Id tri = reqq.elements[i];
1283 FOR_PROVIDES(p2, pp2, tri)
1287 s2 = pool->solvables + p2;
1290 if (s2->name == s->name)
1291 continue; /* obsoleted anyway */
1292 if (s2->repo != installed && MAPTST(&trans->transactsmap, p2))
1294 /* deinstall/update p before installing p2 */
1296 printf("add trigger uninst->inst edge (%s -> %s -> %s)\n", pool_solvid2str(pool, p2), pool_dep2str(pool, tri), pool_solvid2str(pool, p));
1298 addedge(od, p2, p, TYPE_CON);
1307 /* break an edge in a cycle */
1309 breakcycle(struct orderdata *od, Id *cycle)
1311 Pool *pool = od->trans->pool;
1312 Id ddegmin, ddegmax, ddeg;
1314 struct _TransactionElement *te;
1317 ddegmin = ddegmax = 0;
1318 for (k = 0; cycle[k + 1]; k += 2)
1320 ddeg = od->edgedata[cycle[k + 1] + 1];
1323 if (!k || ddeg < ddegmin)
1329 if (ddeg == ddegmin)
1331 if (havescripts(pool, od->tes[cycle[l]].p) && !havescripts(pool, od->tes[cycle[k]].p))
1333 /* prefer k, as l comes from a package with contains scriptlets */
1338 /* same edge value, check for prereq */
1342 /* record brkoen cycle starting with the tail */
1343 queue_push(&od->cycles, od->cyclesdata.count); /* offset into data */
1344 queue_push(&od->cycles, k / 2); /* cycle elements */
1345 queue_push(&od->cycles, od->edgedata[cycle[l + 1] + 1]); /* broken edge */
1352 queue_push(&od->cyclesdata, cycle[k]);
1356 queue_push(&od->cyclesdata, 0); /* mark end */
1358 /* break that edge */
1359 od->edgedata[cycle[l + 1] + 1] |= TYPE_BROKEN;
1362 if (ddegmin < TYPE_REQ)
1366 /* cycle recorded, print it */
1367 if (ddegmin >= TYPE_REQ && (ddegmax & TYPE_PREREQ) != 0)
1368 POOL_DEBUG(SOLV_DEBUG_STATS, "CRITICAL ");
1369 POOL_DEBUG(SOLV_DEBUG_STATS, "cycle: --> ");
1370 for (k = 0; cycle[k + 1]; k += 2)
1372 te = od->tes + cycle[k];
1373 if ((od->edgedata[cycle[k + 1] + 1] & TYPE_BROKEN) != 0)
1374 POOL_DEBUG(SOLV_DEBUG_STATS, "%s ##%x##> ", pool_solvid2str(pool, te->p), od->edgedata[cycle[k + 1] + 1]);
1376 POOL_DEBUG(SOLV_DEBUG_STATS, "%s --%x--> ", pool_solvid2str(pool, te->p), od->edgedata[cycle[k + 1] + 1]);
1378 POOL_DEBUG(SOLV_DEBUG_STATS, "\n");
1382 dump_tes(struct orderdata *od)
1384 Pool *pool = od->trans->pool;
1387 struct _TransactionElement *te, *te2;
1390 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1392 Solvable *s = pool->solvables + te->p;
1393 POOL_DEBUG(SOLV_DEBUG_RESULT, "TE %4d: %c%s\n", i, s->repo == pool->installed ? '-' : '+', pool_solvable2str(pool, s));
1394 if (s->repo != pool->installed)
1397 transaction_all_obs_pkgs(od->trans, te->p, &obsq);
1398 for (j = 0; j < obsq.count; j++)
1399 POOL_DEBUG(SOLV_DEBUG_RESULT, " -%s\n", pool_solvid2str(pool, obsq.elements[j]));
1401 for (j = te->edges; od->edgedata[j]; j += 2)
1403 te2 = od->tes + od->edgedata[j];
1404 if ((od->edgedata[j + 1] & TYPE_BROKEN) == 0)
1405 POOL_DEBUG(SOLV_DEBUG_RESULT, " --%x--> TE %4d: %s\n", od->edgedata[j + 1], od->edgedata[j], pool_solvid2str(pool, te2->p));
1407 POOL_DEBUG(SOLV_DEBUG_RESULT, " ##%x##> TE %4d: %s\n", od->edgedata[j + 1], od->edgedata[j], pool_solvid2str(pool, te2->p));
1414 reachable(struct orderdata *od, Id i)
1416 struct _TransactionElement *te = od->tes + i;
1422 for (j = te->edges; (k = od->edgedata[j]) != 0; j += 2)
1424 if ((od->edgedata[j + 1] & TYPE_BROKEN) != 0)
1426 if (!od->tes[k].mark)
1428 if (od->tes[k].mark == 2)
1439 addcycleedges(struct orderdata *od, Id *cycle, Queue *todo)
1442 Transaction *trans = od->trans;
1443 Pool *pool = trans->pool;
1445 struct _TransactionElement *te;
1452 printf("addcycleedges\n");
1453 for (i = 0; (j = cycle[i]) != 0; i++)
1454 printf("cycle %s\n", pool_solvid2str(pool, od->tes[j].p));
1457 /* first add all the tail cycle edges */
1459 /* see what we can reach from the cycle */
1461 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1463 for (i = 0; (j = cycle[i]) != 0; i++)
1465 od->tes[j].mark = -1;
1466 queue_push(todo, j);
1470 i = queue_pop(todo);
1474 te->mark = te->mark < 0 ? 2 : 1;
1475 for (j = te->edges; (k = od->edgedata[j]) != 0; j += 2)
1477 if ((od->edgedata[j + 1] & TYPE_BROKEN) != 0)
1479 if (od->tes[k].mark > 0)
1480 continue; /* no need to visit again */
1481 queue_push(todo, k);
1484 /* now all cycle TEs are marked with 2, all TEs reachable
1485 * from the cycle are marked with 1 */
1487 od->tes[tail].mark = 1; /* no need to add edges */
1489 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1492 continue; /* reachable from cycle */
1493 for (j = te->edges; (k = od->edgedata[j]) != 0; j += 2)
1495 if ((od->edgedata[j + 1] & TYPE_BROKEN) != 0)
1497 if (od->tes[k].mark != 2)
1499 /* We found an edge to the cycle. Add an extra edge to the tail */
1500 /* the TE was not reachable, so we're not creating a new cycle! */
1502 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));
1504 j -= te->edges; /* in case we move */
1505 addteedge(od, i, tail, TYPE_CYCLETAIL);
1507 break; /* one edge is enough */
1512 /* now add all head cycle edges */
1515 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1518 for (i = 0; (j = cycle[i]) != 0; i++)
1521 od->tes[j].mark = 2;
1523 /* first the head to save some time */
1524 te = od->tes + head;
1525 for (j = te->edges; (k = od->edgedata[j]) != 0; j += 2)
1527 if ((od->edgedata[j + 1] & TYPE_BROKEN) != 0)
1529 if (!od->tes[k].mark)
1531 if (od->tes[k].mark == -1)
1532 od->tes[k].mark = -2; /* no need for another edge */
1534 for (i = 0; cycle[i] != 0; i++)
1536 if (cycle[i] == head)
1538 te = od->tes + cycle[i];
1539 for (j = te->edges; (k = od->edgedata[j]) != 0; j += 2)
1541 if ((od->edgedata[j + 1] & TYPE_BROKEN) != 0)
1543 /* see if we can reach a cycle TE from k */
1544 if (!od->tes[k].mark)
1546 if (od->tes[k].mark == -1)
1549 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));
1551 addteedge(od, head, k, TYPE_CYCLEHEAD);
1552 od->tes[k].mark = -2; /* no need to add that one again */
1560 transaction_order(Transaction *trans, int flags)
1562 Pool *pool = trans->pool;
1563 Queue *tr = &trans->steps;
1564 Repo *installed = pool->installed;
1567 int i, j, k, numte, numedge;
1568 struct orderdata od;
1569 struct _TransactionElement *te;
1570 Queue todo, obsq, samerepoq, uninstq;
1571 int cycstart, cycel;
1579 start = now = solv_timems(0);
1580 POOL_DEBUG(SOLV_DEBUG_STATS, "ordering transaction\n");
1581 /* free old data if present */
1582 if (trans->orderdata)
1584 struct _TransactionOrderdata *od = trans->orderdata;
1585 od->tes = solv_free(od->tes);
1586 od->invedgedata = solv_free(od->invedgedata);
1587 trans->orderdata = solv_free(trans->orderdata);
1590 /* create a transaction element for every active component */
1592 for (i = 0; i < tr->count; i++)
1594 p = tr->elements[i];
1595 s = pool->solvables + p;
1596 if (installed && s->repo == installed && trans->transaction_installed[p - installed->start])
1600 POOL_DEBUG(SOLV_DEBUG_STATS, "transaction elements: %d\n", numte);
1602 return; /* nothing to do... */
1604 numte++; /* leave first one zero */
1605 memset(&od, 0, sizeof(od));
1608 od.tes = solv_calloc(numte, sizeof(*od.tes));
1609 od.edgedata = solv_extend(0, 0, 1, sizeof(Id), EDGEDATA_BLOCK);
1612 queue_init(&od.cycles);
1614 /* initialize TEs */
1615 for (i = 0, te = od.tes + 1; i < tr->count; i++)
1617 p = tr->elements[i];
1618 s = pool->solvables + p;
1619 if (installed && s->repo == installed && trans->transaction_installed[p - installed->start])
1625 /* create dependency graph */
1626 for (i = 0; i < tr->count; i++)
1627 addsolvableedges(&od, pool->solvables + tr->elements[i]);
1631 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1632 for (j = te->edges; od.edgedata[j]; j += 2)
1634 POOL_DEBUG(SOLV_DEBUG_STATS, "edges: %d, edge space: %d\n", numedge, od.nedgedata / 2);
1635 POOL_DEBUG(SOLV_DEBUG_STATS, "edge creation took %d ms\n", solv_timems(now));
1641 now = solv_timems(0);
1642 /* kill all cycles */
1644 for (i = numte - 1; i > 0; i--)
1645 queue_push(&todo, i);
1649 i = queue_pop(&todo);
1650 /* printf("- look at TE %d\n", i); */
1654 od.tes[i].mark = 2; /* done with that one */
1659 continue; /* already finished before */
1662 int edgestovisit = 0;
1663 /* new node, visit edges */
1664 for (j = te->edges; (k = od.edgedata[j]) != 0; j += 2)
1666 if ((od.edgedata[j + 1] & TYPE_BROKEN) != 0)
1668 if (od.tes[k].mark == 2)
1669 continue; /* no need to visit again */
1670 if (!edgestovisit++)
1671 queue_push(&todo, -i); /* end of edges marker */
1672 queue_push(&todo, k);
1675 te->mark = 2; /* no edges, done with that one */
1677 te->mark = 1; /* under investigation */
1680 /* oh no, we found a cycle */
1681 /* find start of cycle node (<0) */
1682 for (j = todo.count - 1; j >= 0; j--)
1683 if (todo.elements[j] == -i)
1687 /* build te/edge chain */
1689 for (j = k; j < todo.count; j++)
1690 if (todo.elements[j] < 0)
1691 todo.elements[k++] = -todo.elements[j];
1692 cycel = k - cycstart;
1694 /* make room for edges, two extra element for cycle loop + terminating 0 */
1695 while (todo.count < cycstart + 2 * cycel + 2)
1696 queue_push(&todo, 0);
1697 cycle = todo.elements + cycstart;
1698 cycle[cycel] = i; /* close the loop */
1699 cycle[2 * cycel + 1] = 0; /* terminator */
1700 for (k = cycel; k > 0; k--)
1702 cycle[k * 2] = cycle[k];
1703 te = od.tes + cycle[k - 1];
1704 assert(te->mark == 1);
1705 te->mark = 0; /* reset investigation marker */
1706 /* printf("searching for edge from %d to %d\n", cycle[k - 1], cycle[k]); */
1707 for (j = te->edges; od.edgedata[j]; j += 2)
1708 if (od.edgedata[j] == cycle[k])
1710 assert(od.edgedata[j]);
1711 cycle[k * 2 - 1] = j;
1713 /* now cycle looks like this: */
1714 /* te1 edge te2 edge te3 ... teN edge te1 0 */
1715 breakcycle(&od, cycle);
1716 /* restart with start of cycle */
1717 todo.count = cycstart + 1;
1719 POOL_DEBUG(SOLV_DEBUG_STATS, "cycles broken: %d\n", od.ncycles);
1720 POOL_DEBUG(SOLV_DEBUG_STATS, "cycle breaking took %d ms\n", solv_timems(now));
1722 now = solv_timems(0);
1723 /* now go through all broken cycles and create cycle edges to help
1725 for (i = od.cycles.count - 3; i >= 0; i -= 3)
1727 if (od.cycles.elements[i + 2] >= TYPE_REQ)
1728 addcycleedges(&od, od.cyclesdata.elements + od.cycles.elements[i], &todo);
1730 for (i = od.cycles.count - 3; i >= 0; i -= 3)
1732 if (od.cycles.elements[i + 2] < TYPE_REQ)
1733 addcycleedges(&od, od.cyclesdata.elements + od.cycles.elements[i], &todo);
1735 POOL_DEBUG(SOLV_DEBUG_STATS, "cycle edge creation took %d ms\n", solv_timems(now));
1740 /* all edges are finally set up and there are no cycles, now the easy part.
1741 * Create an ordered transaction */
1742 now = solv_timems(0);
1743 /* first invert all edges */
1744 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1745 te->mark = 1; /* term 0 */
1746 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1748 for (j = te->edges; od.edgedata[j]; j += 2)
1750 if ((od.edgedata[j + 1] & TYPE_BROKEN) != 0)
1752 od.tes[od.edgedata[j]].mark++;
1756 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1761 POOL_DEBUG(SOLV_DEBUG_STATS, "invedge space: %d\n", j + 1);
1762 od.invedgedata = solv_calloc(j + 1, sizeof(Id));
1763 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1765 for (j = te->edges; od.edgedata[j]; j += 2)
1767 if ((od.edgedata[j + 1] & TYPE_BROKEN) != 0)
1769 od.invedgedata[--od.tes[od.edgedata[j]].mark] = i;
1772 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1773 te->edges = te->mark; /* edges now points into invedgedata */
1774 od.edgedata = solv_free(od.edgedata);
1775 od.nedgedata = j + 1;
1777 /* now the final ordering */
1778 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1780 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1781 for (j = te->edges; od.invedgedata[j]; j++)
1782 od.tes[od.invedgedata[j]].mark++;
1784 queue_init(&samerepoq);
1785 queue_init(&uninstq);
1787 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1790 if (installed && pool->solvables[te->p].repo == installed)
1791 queue_push(&uninstq, i);
1793 queue_push(&todo, i);
1795 assert(todo.count > 0 || uninstq.count > 0);
1796 oldcount = tr->count;
1803 temedianr = solv_calloc(numte, sizeof(Id));
1804 for (i = 1; i < numte; i++)
1806 Solvable *s = pool->solvables + od.tes[i].p;
1807 if (installed && s->repo == installed)
1810 j = solvable_lookup_num(s, SOLVABLE_MEDIANR, 1);
1815 /* select an TE i */
1817 i = queue_shift(&uninstq);
1818 else if (samerepoq.count)
1819 i = queue_shift(&samerepoq);
1820 else if (todo.count)
1822 /* find next repo/media */
1823 for (j = 0; j < todo.count; j++)
1825 if (!j || temedianr[todo.elements[j]] < lastmedia)
1828 lastmedia = temedianr[todo.elements[j]];
1831 lastrepo = pool->solvables[od.tes[todo.elements[i]].p].repo;
1833 /* move all matching TEs to samerepoq */
1834 for (i = j = 0; j < todo.count; j++)
1836 int k = todo.elements[j];
1837 if (temedianr[k] == lastmedia && pool->solvables[od.tes[k].p].repo == lastrepo)
1838 queue_push(&samerepoq, k);
1840 todo.elements[i++] = k;
1844 assert(samerepoq.count);
1845 i = queue_shift(&samerepoq);
1851 queue_push(tr, te->p);
1853 printf("do %s [%d]\n", pool_solvid2str(pool, te->p), temedianr[i]);
1855 s = pool->solvables + te->p;
1856 for (j = te->edges; od.invedgedata[j]; j++)
1858 struct _TransactionElement *te2 = od.tes + od.invedgedata[j];
1859 assert(te2->mark > 0);
1860 if (--te2->mark == 0)
1862 Solvable *s = pool->solvables + te2->p;
1864 printf("free %s [%d]\n", pool_solvid2str(pool, te2->p), temedianr[od.invedgedata[j]]);
1866 if (installed && s->repo == installed)
1867 queue_push(&uninstq, od.invedgedata[j]);
1868 else if (s->repo == lastrepo && temedianr[od.invedgedata[j]] == lastmedia)
1869 queue_push(&samerepoq, od.invedgedata[j]);
1871 queue_push(&todo, od.invedgedata[j]);
1875 solv_free(temedianr);
1877 queue_free(&samerepoq);
1878 queue_free(&uninstq);
1880 for (i = 1, te = od.tes + i; i < numte; i++, te++)
1881 assert(te->mark == 0);
1883 /* add back obsoleted packages */
1884 transaction_add_obsoleted(trans);
1885 assert(tr->count == oldcount);
1887 POOL_DEBUG(SOLV_DEBUG_STATS, "creating new transaction took %d ms\n", solv_timems(now));
1888 POOL_DEBUG(SOLV_DEBUG_STATS, "transaction ordering took %d ms\n", solv_timems(start));
1890 if ((flags & SOLVER_TRANSACTION_KEEP_ORDERDATA) != 0)
1892 trans->orderdata = solv_calloc(1, sizeof(*trans->orderdata));
1893 trans->orderdata->tes = od.tes;
1894 trans->orderdata->ntes = numte;
1895 trans->orderdata->invedgedata = od.invedgedata;
1896 trans->orderdata->ninvedgedata = od.nedgedata;
1901 solv_free(od.invedgedata);
1903 queue_free(&od.cycles);
1904 queue_free(&od.cyclesdata);
1909 transaction_order_add_choices(Transaction *trans, Id chosen, Queue *choices)
1912 struct _TransactionOrderdata *od = trans->orderdata;
1913 struct _TransactionElement *te;
1916 return choices->count;
1919 /* initialization step */
1920 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1922 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1924 for (j = te->edges; od->invedgedata[j]; j++)
1925 od->tes[od->invedgedata[j]].mark++;
1927 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1929 queue_push(choices, te->p);
1930 return choices->count;
1932 for (i = 1, te = od->tes + i; i < od->ntes; i++, te++)
1933 if (te->p == chosen)
1936 return choices->count;
1939 /* hey! out-of-order installation! */
1942 for (j = te->edges; od->invedgedata[j]; j++)
1944 te = od->tes + od->invedgedata[j];
1945 assert(te->mark > 0 || te->mark == -1);
1946 if (te->mark > 0 && --te->mark == 0)
1947 queue_push(choices, te->p);
1949 return choices->count;
1953 transaction_add_obsoleted(Transaction *trans)
1955 Pool *pool = trans->pool;
1956 Repo *installed = pool->installed;
1963 if (!installed || !trans->steps.count)
1965 /* calculate upper bound */
1967 FOR_REPO_SOLVABLES(installed, p, s)
1968 if (MAPTST(&trans->transactsmap, p))
1973 steps = &trans->steps;
1974 queue_insertn(steps, 0, max, 0);
1977 map_init(&done, installed->end - installed->start);
1979 for (j = 0, i = max; i < steps->count; i++)
1981 p = trans->steps.elements[i];
1982 if (pool->solvables[p].repo == installed)
1984 if (!trans->transaction_installed[p - pool->installed->start])
1985 trans->steps.elements[j++] = p;
1988 trans->steps.elements[j++] = p;
1990 transaction_all_obs_pkgs(trans, p, &obsq);
1991 for (k = 0; k < obsq.count; k++)
1993 p = obsq.elements[k];
1994 assert(p >= installed->start && p < installed->end);
1995 if (!MAPTST(&trans->transactsmap, p)) /* just in case */
1997 if (MAPTST(&done, p - installed->start))
1999 MAPSET(&done, p - installed->start);
2000 trans->steps.elements[j++] = p;
2004 /* free unneeded space */
2005 queue_truncate(steps, j);
2011 transaction_check_pkg(Transaction *trans, Id tepkg, Id pkg, Map *ins, Map *seen, int onlyprereq, Id noconfpkg, int depth)
2013 Pool *pool = trans->pool;
2018 if (MAPTST(seen, pkg))
2021 s = pool->solvables + pkg;
2023 printf("- %*s%c%s\n", depth * 2, "", s->repo == pool->installed ? '-' : '+', pool_solvable2str(pool, s));
2029 reqp = s->repo->idarraydata + s->requires;
2030 while ((req = *reqp++) != 0)
2032 if (req == SOLVABLE_PREREQMARKER)
2037 if (onlyprereq && !inpre)
2039 if (!strncmp(pool_id2str(pool, req), "rpmlib(", 7))
2042 /* first check kept packages, then freshly installed, then not yet uninstalled */
2043 FOR_PROVIDES(p, pp, req)
2045 if (!MAPTST(ins, p))
2047 if (MAPTST(&trans->transactsmap, p))
2050 transaction_check_pkg(trans, tepkg, p, ins, seen, 0, noconfpkg, depth + 1);
2054 FOR_PROVIDES(p, pp, req)
2056 if (!MAPTST(ins, p))
2058 if (pool->solvables[p].repo == pool->installed)
2061 transaction_check_pkg(trans, tepkg, p, ins, seen, 0, noconfpkg, depth + 1);
2066 FOR_PROVIDES(p, pp, req)
2068 if (!MAPTST(ins, p))
2071 transaction_check_pkg(trans, tepkg, p, ins, seen, 0, noconfpkg, depth + 1);
2076 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));
2083 transaction_check_order(Transaction *trans)
2085 Pool *pool = trans->pool;
2091 POOL_DEBUG(SOLV_DEBUG_RESULT, "\nchecking transaction order...\n");
2092 map_init(&ins, pool->nsolvables);
2093 map_init(&seen, pool->nsolvables);
2094 if (pool->installed)
2095 FOR_REPO_SOLVABLES(pool->installed, p, s)
2098 for (i = 0; i < trans->steps.count; i++)
2100 p = trans->steps.elements[i];
2101 s = pool->solvables + p;
2102 if (s->repo != pool->installed)
2104 if (s->repo != pool->installed)
2106 if (havescripts(pool, p))
2109 transaction_check_pkg(trans, p, p, &ins, &seen, 1, lastins, 0);
2111 if (s->repo == pool->installed)
2116 POOL_DEBUG(SOLV_DEBUG_RESULT, "transaction order check done.\n");