2 * Copyright (c) 2007-2009, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * SAT based dependency solver
21 #include "solver_private.h"
28 #include "solverdebug.h"
29 #include "linkedpkg.h"
31 #define RULES_BLOCK 63
33 static void addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep);
34 static void solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded);
36 /*-------------------------------------------------------------------
37 * Check if dependency is possible
39 * mirrors solver_dep_fulfilled but uses map m instead of the decisionmap.
40 * used in solver_addrpmrulesforweak and solver_createcleandepsmap.
44 dep_possible(Solver *solv, Id dep, Map *m)
46 Pool *pool = solv->pool;
51 Reldep *rd = GETRELDEP(pool, dep);
54 if (rd->flags == REL_AND)
56 if (!dep_possible(solv, rd->name, m))
58 return dep_possible(solv, rd->evr, m);
60 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
61 return solver_splitprovides(solv, rd->evr);
62 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
63 return solver_dep_installed(solv, rd->evr);
66 FOR_PROVIDES(p, pp, dep)
74 /********************************************************************
78 * - unify rules, remove duplicates
81 /*-------------------------------------------------------------------
83 * compare rules for unification sort
88 unifyrules_sortcmp(const void *ap, const void *bp, void *dp)
98 return x; /* p differs */
101 if (a->d == 0 && b->d == 0)
102 return a->w2 - b->w2; /* assertion: return w2 diff */
104 if (a->d == 0) /* a is assertion, b not */
106 x = a->w2 - pool->whatprovidesdata[b->d];
110 if (b->d == 0) /* b is assertion, a not */
112 x = pool->whatprovidesdata[a->d] - b->w2;
116 /* compare whatprovidesdata */
117 ad = pool->whatprovidesdata + a->d;
118 bd = pool->whatprovidesdata + b->d;
120 if ((x = *ad++ - *bd++) != 0)
126 solver_rulecmp(Solver *solv, Rule *r1, Rule *r2)
128 return unifyrules_sortcmp(r1, r2, solv->pool);
132 /*-------------------------------------------------------------------
135 * go over all rules and remove duplicates
139 solver_unifyrules(Solver *solv)
141 Pool *pool = solv->pool;
145 if (solv->nrules <= 2) /* nothing to unify */
148 /* sort rules first */
149 solv_sort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp, solv->pool);
156 for (i = j = 1, ir = solv->rules + i; i < solv->nrules; i++, ir++)
158 if (jr && !unifyrules_sortcmp(ir, jr, pool))
159 continue; /* prune! */
160 jr = solv->rules + j++; /* keep! */
165 /* reduced count from nrules to j rules */
166 POOL_DEBUG(SOLV_DEBUG_STATS, "pruned rules from %d to %d\n", solv->nrules, j);
168 /* adapt rule buffer */
170 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
173 * debug: log rule statistics
175 IF_POOLDEBUG (SOLV_DEBUG_STATS)
182 for (i = 1; i < solv->nrules; i++)
189 dp = solv->pool->whatprovidesdata + r->d;
194 POOL_DEBUG(SOLV_DEBUG_STATS, " binary: %d\n", binr);
195 POOL_DEBUG(SOLV_DEBUG_STATS, " normal: %d, %d literals\n", solv->nrules - 1 - binr, lits);
206 hashrule(Solver *solv, Id p, Id d, int n)
208 unsigned int x = (unsigned int)p;
212 return (x * 37) ^ (unsigned int)d;
213 dp = solv->pool->whatprovidesdata + d;
215 x = (x * 37) ^ (unsigned int)*dp++;
221 /*-------------------------------------------------------------------
227 * p = direct literal; always < 0 for installed rpm rules
228 * d, if < 0 direct literal, if > 0 offset into whatprovides, if == 0 rule is assertion (look at p only)
231 * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
233 * p < 0 : pkg id of A
234 * d > 0 : Offset in whatprovidesdata (list of providers of b)
236 * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
237 * p < 0 : pkg id of A
238 * d < 0 : Id of solvable (e.g. B1)
240 * d == 0: unary rule, assertion => (A) or (-A)
242 * Install: p > 0, d = 0 (A) user requested install
243 * Remove: p < 0, d = 0 (-A) user requested remove (also: uninstallable)
244 * Requires: p < 0, d > 0 (-A|B1|B2|...) d: <list of providers for requirement of p>
245 * Updates: p > 0, d > 0 (A|B1|B2|...) d: <list of updates for solvable p>
246 * Conflicts: p < 0, d < 0 (-A|-B) either p (conflict issuer) or d (conflict provider) (binary rule)
247 * also used for obsoletes
248 * ?: p > 0, d < 0 (A|-B)
249 * No-op ?: p = 0, d = 0 (null) (used as policy rule placeholder)
253 * Direct assertion (no watch needed) --> d = 0, w1 = p, w2 = 0
254 * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
255 * every other : w1 = p, w2 = whatprovidesdata[d];
256 * Disabled rule: w1 = 0
258 * always returns a rule for non-rpm rules
262 solver_addrule(Solver *solv, Id p, Id d)
264 Pool *pool = solv->pool;
268 int n = 0; /* number of literals in rule - 1
269 0 = direct assertion (single literal)
274 /* it often happenes that requires lead to adding the same rpm rule
275 * multiple times, so we prune those duplicates right away to make
276 * the work for unifyrules a bit easier */
278 if (!solv->rpmrules_end) /* we add rpm rules */
280 r = solv->rules + solv->nrules - 1; /* get the last added rule */
281 if (r->p == p && r->d == d && (d != 0 || !r->w2))
286 * compute number of literals (n) in rule
291 /* always a binary rule */
293 return 0; /* ignore self conflict */
298 for (dp = pool->whatprovidesdata + d; *dp; dp++, n++)
300 return 0; /* rule is self-fulfilling */
302 if (n == 1) /* convert to binary rule */
306 if (n == 1 && p > d && !solv->rpmrules_end)
308 /* smallest literal first so we can find dups */
309 n = p; p = d; d = n; /* p <-> d */
310 n = 1; /* re-set n, was used as temp var */
314 * check for duplicate
317 /* check if the last added rule (r) is exactly the same as what we're looking for. */
318 if (r && n == 1 && !r->d && r->p == p && r->w2 == d)
319 return r; /* binary rule */
321 /* have n-ary rule with same first literal, check other literals */
322 if (r && n > 1 && r->d && r->p == p)
324 /* Rule where d is an offset in whatprovidesdata */
328 dp2 = pool->whatprovidesdata + r->d;
329 for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
340 /* extend rule buffer */
341 solv->rules = solv_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
342 r = solv->rules + solv->nrules++; /* point to rule space */
351 /* direct assertion, no watch needed */
367 r->w2 = pool->whatprovidesdata[d];
372 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
374 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " Add rule: ");
375 solver_printrule(solv, SOLV_DEBUG_RULE_CREATION, r);
382 solver_shrinkrules(Solver *solv, int nrules)
384 solv->nrules = nrules;
385 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
388 /******************************************************************************
390 *** rpm rule part: create rules representing the package dependencies
395 * special multiversion patch conflict handling:
396 * a patch conflict is also satisfied if some other
397 * version with the same name/arch that doesn't conflict
398 * gets installed. The generated rule is thus:
399 * -patch|-cpack|opack1|opack2|...
402 makemultiversionconflict(Solver *solv, Id n, Id con)
404 Pool *pool = solv->pool;
409 sn = pool->solvables + n;
410 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
412 FOR_PROVIDES(p, pp, sn->name)
414 s = pool->solvables + p;
415 if (s->name != sn->name || s->arch != sn->arch)
417 if (!MAPTST(&solv->multiversion, p))
419 if (pool_match_nevr(pool, pool->solvables + p, con))
421 /* here we have a multiversion solvable that doesn't conflict */
422 /* thus we're not in conflict if it is installed */
426 return -n; /* no other package found, generate normal conflict */
427 return pool_queuetowhatprovides(pool, &q);
431 addrpmrule(Solver *solv, Id p, Id d, int type, Id dep)
433 if (!solv->ruleinfoq)
434 solver_addrule(solv, p, d);
436 addrpmruleinfo(solv, p, d, type, dep);
439 #ifdef ENABLE_LINKED_PKGS
442 addlinks(Solver *solv, Solvable *s, Id req, Queue *qr, Id prv, Queue *qp, Map *m, Queue *workq)
444 Pool *pool = solv->pool;
449 printf("ADDLINKS %s\n -> %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
450 for (i = 0; i < qr->count; i++)
451 printf(" - %s\n", pool_solvid2str(pool, qr->elements[i]));
452 printf(" <- %s\n", pool_dep2str(pool, prv));
453 for (i = 0; i < qp->count; i++)
454 printf(" - %s\n", pool_solvid2str(pool, qp->elements[i]));
458 addrpmrule(solv, qr->elements[0], -(s - pool->solvables), SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
460 addrpmrule(solv, -(s - pool->solvables), pool_queuetowhatprovides(pool, qr), SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
463 Id d = pool_queuetowhatprovides(pool, qp);
464 for (i = 0; i < qr->count; i++)
465 addrpmrule(solv, -qr->elements[i], d, SOLVER_RULE_RPM_PACKAGE_REQUIRES, prv);
469 for (i = 0; i < qr->count; i++)
470 addrpmrule(solv, qp->elements[0], -qr->elements[i], SOLVER_RULE_RPM_PACKAGE_REQUIRES, prv);
473 return; /* nothing more to do if called from getrpmruleinfos() */
474 for (i = 0; i < qr->count; i++)
475 if (!MAPTST(m, qr->elements[i]))
476 queue_push(workq, qr->elements[i]);
477 for (i = 0; i < qp->count; i++)
478 if (!MAPTST(m, qp->elements[i]))
479 queue_push(workq, qp->elements[i]);
480 if (solv->installed && s->repo == solv->installed)
482 Repo *installed = solv->installed;
483 /* record installed buddies */
484 if (!solv->instbuddy)
485 solv->instbuddy = solv_calloc(installed->end - installed->start, sizeof(Id));
487 solv->instbuddy[s - pool->solvables - installed->start] = qr->elements[0];
488 for (i = 0; i < qp->count; i++)
490 Id p = qp->elements[i];
491 if (pool->solvables[p].repo != installed)
493 if (qp->count > 1 || (solv->instbuddy[p - installed->start] != 0 && solv->instbuddy[p - installed->start] != s - pool->solvables))
494 solv->instbuddy[p - installed->start] = 1; /* 1: ambiguous buddy */
496 solv->instbuddy[p - installed->start] = s - pool->solvables;
502 add_package_link(Solver *solv, Solvable *s, Map *m, Queue *workq)
508 find_package_link(solv->pool, s, &req, &qr, &prv, &qp);
510 addlinks(solv, s, req, &qr, prv, &qp, m, workq);
517 /*-------------------------------------------------------------------
519 * add (install) rules for solvable
521 * s: Solvable for which to add rules
522 * m: m[s] = 1 for solvables which have rules, prevent rule duplication
524 * Algorithm: 'visit all nodes of a graph'. The graph nodes are
525 * solvables, the edges their dependencies.
526 * Starting from an installed solvable, this will create all rules
527 * representing the graph created by the solvables dependencies.
529 * for unfulfilled requirements, conflicts, obsoletes,....
530 * add a negative assertion for solvables that are not installable
532 * It will also create rules for all solvables referenced by 's'
533 * i.e. descend to all providers of requirements of 's'
538 solver_addrpmrulesforsolvable(Solver *solv, Solvable *s, Map *m)
540 Pool *pool = solv->pool;
541 Repo *installed = solv->installed;
543 /* 'work' queue. keeps Ids of solvables we still have to work on.
544 And buffer for it. */
549 /* if to add rules for broken deps ('rpm -V' functionality)
553 /* Id var and pointer for each dependency
554 * (not used in parallel)
561 Id p, pp; /* whatprovides loops */
562 Id *dp; /* ptr to 'whatprovides' */
563 Id n; /* Id for current solvable 's' */
565 queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
566 queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
568 /* loop until there's no more work left */
573 * s: Pointer to solvable
576 n = queue_shift(&workq); /* 'pop' next solvable to work on from queue */
579 if (MAPTST(m, n)) /* continue if already visited */
581 MAPSET(m, n); /* mark as visited */
584 s = pool->solvables + n; /* s = Solvable in question */
587 if (installed /* Installed system available */
588 && s->repo == installed /* solvable is installed */
589 && !solv->fixmap_all /* NOT repair errors in rpm dependency graph */
590 && !(solv->fixmap.size && MAPTST(&solv->fixmap, n - installed->start)))
592 dontfix = 1; /* dont care about broken rpm deps */
597 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC
598 ? pool_disabled_solvable(pool, s)
599 : !pool_installable(pool, s))
601 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables));
602 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOT_INSTALLABLE, 0);
606 #ifdef ENABLE_LINKED_PKGS
607 /* add pseudo-package <-> real-package links */
608 if (has_package_link(pool, s))
609 add_package_link(solv, s, m, &workq);
612 /*-----------------------------------------
613 * check requires of s
618 reqp = s->repo->idarraydata + s->requires;
619 while ((req = *reqp++) != 0) /* go through all requires */
621 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
624 /* find list of solvables providing 'req' */
625 dp = pool_whatprovides_ptr(pool, req);
627 if (*dp == SYSTEMSOLVABLE) /* always installed */
632 /* the strategy here is to not insist on dependencies
633 * that are already broken. so if we find one provider
634 * that was already installed, we know that the
635 * dependency was not broken before so we enforce it */
637 /* check if any of the providers for 'req' is installed */
638 for (i = 0; (p = dp[i]) != 0; i++)
640 if (pool->solvables[p].repo == installed)
641 break; /* provider was installed */
643 /* didn't find an installed provider: previously broken dependency */
646 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s));
653 /* nothing provides req! */
654 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables), pool_dep2str(pool, req));
655 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP, req);
659 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
661 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION," %s requires %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
662 for (i = 0; dp[i]; i++)
663 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " provided by %s\n", pool_solvid2str(pool, dp[i]));
666 /* add 'requires' dependency */
667 /* rule: (-requestor|provider1|provider2|...|providerN) */
668 addrpmrule(solv, -n, dp - pool->whatprovidesdata, SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
670 /* descend the dependency tree
671 push all non-visited providers on the work queue */
677 queue_push(&workq, *dp);
681 } /* while, requirements of n */
683 } /* if, requirements */
685 /* that's all we check for src packages */
686 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
689 /*-----------------------------------------
690 * check conflicts of s
697 /* we treat conflicts in patches a bit differen:
699 * - multiversion handling
700 * XXX: we should really handle this different, looking
701 * at the name is a bad hack
703 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
705 conp = s->repo->idarraydata + s->conflicts;
706 /* foreach conflicts of 's' */
707 while ((con = *conp++) != 0)
709 /* foreach providers of a conflict of 's' */
710 FOR_PROVIDES(p, pp, con)
712 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
714 /* dontfix: dont care about conflicts with already installed packs */
715 if (dontfix && pool->solvables[p].repo == installed)
717 /* p == n: self conflict */
718 if (p == n && pool->forbidselfconflicts)
722 Reldep *rd = GETRELDEP(pool, con);
723 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
726 p = 0; /* make it a negative assertion, aka 'uninstallable' */
728 if (p && ispatch && solv->multiversion.size && MAPTST(&solv->multiversion, p) && ISRELDEP(con))
730 /* our patch conflicts with a multiversion package */
731 p = -makemultiversionconflict(solv, p, con);
733 /* rule: -n|-p: either solvable _or_ provider of conflict */
734 addrpmrule(solv, -n, -p, p ? SOLVER_RULE_RPM_PACKAGE_CONFLICT : SOLVER_RULE_RPM_SELF_CONFLICT, con);
739 /*-----------------------------------------
740 * check obsoletes and implicit obsoletes of a package
741 * if ignoreinstalledsobsoletes is not set, we're also checking
742 * obsoletes of installed packages (like newer rpm versions)
744 if ((!installed || s->repo != installed) || !pool->noinstalledobsoletes)
746 int multi = solv->multiversion.size && MAPTST(&solv->multiversion, n);
747 int isinstalled = (installed && s->repo == installed);
748 if (s->obsoletes && (!multi || solv->keepexplicitobsoletes))
750 obsp = s->repo->idarraydata + s->obsoletes;
751 /* foreach obsoletes */
752 while ((obs = *obsp++) != 0)
754 /* foreach provider of an obsoletes of 's' */
755 FOR_PROVIDES(p, pp, obs)
757 Solvable *ps = pool->solvables + p;
760 if (isinstalled && dontfix && ps->repo == installed)
761 continue; /* don't repair installed/installed problems */
762 if (!pool->obsoleteusesprovides /* obsoletes are matched names, not provides */
763 && !pool_match_nevr(pool, ps, obs))
765 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
768 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_PACKAGE_OBSOLETES, obs);
770 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES, obs);
774 /* check implicit obsoletes
775 * for installed packages we only need to check installed/installed problems (and
776 * only when dontfix is not set), as the others are picked up when looking at the
777 * uninstalled package.
779 if (!isinstalled || !dontfix)
781 FOR_PROVIDES(p, pp, s->name)
783 Solvable *ps = pool->solvables + p;
786 if (isinstalled && ps->repo != installed)
788 /* we still obsolete packages with same nevra, like rpm does */
789 /* (actually, rpm mixes those packages. yuck...) */
790 if (multi && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
792 if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
794 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
796 if (s->name == ps->name)
797 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_SAME_NAME, 0);
799 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_IMPLICIT_OBSOLETES, s->name);
804 /*-----------------------------------------
805 * add recommends to the work queue
807 if (s->recommends && m)
809 recp = s->repo->idarraydata + s->recommends;
810 while ((rec = *recp++) != 0)
812 FOR_PROVIDES(p, pp, rec)
814 queue_push(&workq, p);
817 if (s->suggests && m)
819 sugp = s->repo->idarraydata + s->suggests;
820 while ((sug = *sugp++) != 0)
822 FOR_PROVIDES(p, pp, sug)
824 queue_push(&workq, p);
831 #ifdef ENABLE_LINKED_PKGS
833 solver_addrpmrulesforlinked(Solver *solv, Map *m)
835 Pool *pool = solv->pool;
841 for (i = 1; i < pool->nsolvables; i++)
845 s = pool->solvables + i;
846 if (!s->repo || s->repo == solv->installed)
848 if (!strchr(pool_id2str(pool, s->name), ':'))
850 if (!pool_installable(pool, s))
852 find_package_link(pool, s, 0, &qr, 0, 0);
855 for (j = 0; j < qr.count; j++)
856 if (MAPTST(m, qr.elements[j]))
858 solver_addrpmrulesforsolvable(solv, s, m);
868 /*-------------------------------------------------------------------
870 * Add rules for packages possibly selected in by weak dependencies
872 * m: already added solvables
876 solver_addrpmrulesforweak(Solver *solv, Map *m)
878 Pool *pool = solv->pool;
883 /* foreach solvable in pool */
884 for (i = n = 1; n < pool->nsolvables; i++, n++)
886 if (i == pool->nsolvables) /* wrap i */
888 if (MAPTST(m, i)) /* already added that one */
891 s = pool->solvables + i;
894 if (s->repo != pool->installed && !pool_installable(pool, s))
895 continue; /* only look at installable ones */
900 /* find possible supplements */
901 supp = s->repo->idarraydata + s->supplements;
902 while ((sup = *supp++) != 0)
903 if (dep_possible(solv, sup, m))
907 /* if nothing found, check for enhances */
908 if (!sup && s->enhances)
910 supp = s->repo->idarraydata + s->enhances;
911 while ((sup = *supp++) != 0)
912 if (dep_possible(solv, sup, m))
915 /* if nothing found, goto next solvables */
918 solver_addrpmrulesforsolvable(solv, s, m);
919 n = 0; /* check all solvables again because we added solvables to m */
924 /*-------------------------------------------------------------------
926 * add package rules for possible updates
929 * m: map of already visited solvables
930 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
934 solver_addrpmrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
936 Pool *pool = solv->pool;
938 /* queue and buffer for it */
942 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
943 /* find update candidates for 's' */
944 policy_findupdatepackages(solv, s, &qs, allow_all);
945 /* add rule for 's' if not already done */
946 if (!MAPTST(m, s - pool->solvables))
947 solver_addrpmrulesforsolvable(solv, s, m);
948 /* foreach update candidate, add rule if not already done */
949 for (i = 0; i < qs.count; i++)
950 if (!MAPTST(m, qs.elements[i]))
951 solver_addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
956 /***********************************************************************
958 *** Update/Feature rule part
960 *** Those rules make sure an installed package isn't silently deleted
965 finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
967 Pool *pool = solv->pool;
970 policy_findupdatepackages(solv, s, qs, allow_all ? allow_all : 2);
974 return 0; /* orphaned, don't create feature rule */
975 /* check if this is an orphaned package */
976 policy_findupdatepackages(solv, s, qs, 1);
978 return 0; /* orphaned, don't create update rule */
980 return -SYSTEMSOLVABLE; /* supported but not installable */
983 return s - pool->solvables;
984 /* check if it is ok to keep the installed package */
985 for (i = 0; i < qs->count; i++)
987 Solvable *ns = pool->solvables + qs->elements[i];
988 if (s->evr == ns->evr && solvable_identical(s, ns))
989 return s - pool->solvables;
991 /* nope, it must be some other package */
992 return -SYSTEMSOLVABLE;
995 /* add packages from the dup repositories to the update candidates
996 * this isn't needed for the global dup mode as all packages are
997 * from dup repos in that case */
999 addduppackages(Solver *solv, Solvable *s, Queue *qs)
1004 int oldnoupdateprovide = solv->noupdateprovide;
1006 queue_init_buffer(&dupqs, dupqsbuf, sizeof(dupqsbuf)/sizeof(*dupqsbuf));
1007 solv->noupdateprovide = 1;
1008 policy_findupdatepackages(solv, s, &dupqs, 2);
1009 solv->noupdateprovide = oldnoupdateprovide;
1010 for (i = 0; i < dupqs.count; i++)
1012 p = dupqs.elements[i];
1013 if (MAPTST(&solv->dupmap, p))
1014 queue_pushunique(qs, p);
1019 /*-------------------------------------------------------------------
1021 * add rule for update
1022 * (A|A1|A2|A3...) An = update candidates for A
1024 * s = (installed) solvable
1028 solver_addupdaterule(Solver *solv, Solvable *s, int allow_all)
1030 /* installed packages get a special upgrade allowed rule */
1031 Pool *pool = solv->pool;
1036 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1037 p = s - pool->solvables;
1038 /* find update candidates for 's' */
1039 if (solv->dupmap_all)
1040 p = finddistupgradepackages(solv, s, &qs, allow_all);
1042 policy_findupdatepackages(solv, s, &qs, allow_all);
1043 if (!allow_all && !solv->dupmap_all && solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
1044 addduppackages(solv, s, &qs);
1046 if (!allow_all && qs.count && solv->multiversion.size)
1050 d = pool_queuetowhatprovides(pool, &qs);
1051 /* filter out all multiversion packages as they don't update */
1052 for (i = j = 0; i < qs.count; i++)
1054 if (MAPTST(&solv->multiversion, qs.elements[i]))
1056 Solvable *ps = pool->solvables + qs.elements[i];
1057 /* if keepexplicitobsoletes is set and the name is different,
1058 * we assume that there is an obsoletes. XXX: not 100% correct */
1059 if (solv->keepexplicitobsoletes && ps->name != s->name)
1061 qs.elements[j++] = qs.elements[i];
1064 /* it's ok if they have same nevra */
1065 if (ps->name != s->name || ps->evr != s->evr || ps->arch != s->arch)
1068 qs.elements[j++] = qs.elements[i];
1072 if (d && solv->installed && s->repo == solv->installed &&
1073 (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, s - pool->solvables - solv->installed->start))))
1075 if (!solv->multiversionupdaters)
1076 solv->multiversionupdaters = solv_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
1077 solv->multiversionupdaters[s - pool->solvables - solv->installed->start] = d;
1079 if (j == 0 && p == -SYSTEMSOLVABLE && solv->dupmap_all)
1081 queue_push(&solv->orphaned, s - pool->solvables); /* treat as orphaned */
1086 else if (p != -SYSTEMSOLVABLE)
1088 /* could fallthrough, but then we would do pool_queuetowhatprovides twice */
1090 solver_addrule(solv, p, d); /* allow update of s */
1094 if (qs.count && p == -SYSTEMSOLVABLE)
1095 p = queue_shift(&qs);
1096 d = qs.count ? pool_queuetowhatprovides(pool, &qs) : 0;
1098 solver_addrule(solv, p, d); /* allow update of s */
1102 disableupdaterule(Solver *solv, Id p)
1106 MAPSET(&solv->noupdate, p - solv->installed->start);
1107 r = solv->rules + solv->updaterules + (p - solv->installed->start);
1108 if (r->p && r->d >= 0)
1109 solver_disablerule(solv, r);
1110 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1111 if (r->p && r->d >= 0)
1112 solver_disablerule(solv, r);
1113 if (solv->bestrules_pkg)
1116 ni = solv->bestrules_end - solv->bestrules;
1117 for (i = 0; i < ni; i++)
1118 if (solv->bestrules_pkg[i] == p)
1119 solver_disablerule(solv, solv->rules + solv->bestrules + i);
1124 reenableupdaterule(Solver *solv, Id p)
1126 Pool *pool = solv->pool;
1129 MAPCLR(&solv->noupdate, p - solv->installed->start);
1130 r = solv->rules + solv->updaterules + (p - solv->installed->start);
1135 solver_enablerule(solv, r);
1136 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1138 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1139 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1145 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1146 if (r->p && r->d < 0)
1148 solver_enablerule(solv, r);
1149 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1151 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1152 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1156 if (solv->bestrules_pkg)
1159 ni = solv->bestrules_end - solv->bestrules;
1160 for (i = 0; i < ni; i++)
1161 if (solv->bestrules_pkg[i] == p)
1162 solver_enablerule(solv, solv->rules + solv->bestrules + i);
1167 /***********************************************************************
1169 *** Infarch rule part
1171 *** Infarch rules make sure the solver uses the best architecture of
1172 *** a package if multiple archetectures are available
1177 solver_addinfarchrules(Solver *solv, Map *addedmap)
1179 Pool *pool = solv->pool;
1181 Id p, pp, a, aa, bestarch;
1182 Solvable *s, *ps, *bests;
1183 Queue badq, allowedarchs;
1186 queue_init(&allowedarchs);
1187 solv->infarchrules = solv->nrules;
1188 for (i = 1; i < pool->nsolvables; i++)
1190 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1192 s = pool->solvables + i;
1196 queue_empty(&allowedarchs);
1197 FOR_PROVIDES(p, pp, s->name)
1199 ps = pool->solvables + p;
1200 if (ps->name != s->name || !MAPTST(addedmap, p))
1207 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1208 if (a != 1 && pool->installed && ps->repo == pool->installed)
1210 if (!solv->dupmap_all && !(solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1211 queue_pushunique(&allowedarchs, ps->arch); /* also ok to keep this architecture */
1212 continue; /* ignore installed solvables when calculating the best arch */
1214 if (a && a != 1 && (!bestarch || a < bestarch))
1222 /* speed up common case where installed package already has best arch */
1223 if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch)
1224 allowedarchs.count--; /* installed arch is best */
1226 FOR_PROVIDES(p, pp, s->name)
1228 ps = pool->solvables + p;
1229 if (ps->name != s->name || !MAPTST(addedmap, p))
1232 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1233 if (a != 1 && bestarch && ((a ^ bestarch) & 0xffff0000) != 0)
1235 if (pool->installed && ps->repo == pool->installed)
1236 continue; /* always ok to keep an installed package */
1237 for (j = 0; j < allowedarchs.count; j++)
1239 aa = allowedarchs.elements[j];
1242 aa = (aa <= pool->lastarch) ? pool->id2arch[aa] : 0;
1243 if (aa && ((a ^ aa) & 0xffff0000) == 0)
1244 break; /* compatible */
1246 if (j == allowedarchs.count)
1247 queue_push(&badq, p);
1252 /* block all solvables in the badq! */
1253 for (j = 0; j < badq.count; j++)
1255 p = badq.elements[j];
1256 solver_addrule(solv, -p, 0);
1260 queue_free(&allowedarchs);
1261 solv->infarchrules_end = solv->nrules;
1265 disableinfarchrule(Solver *solv, Id name)
1267 Pool *pool = solv->pool;
1270 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1272 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1273 solver_disablerule(solv, r);
1278 reenableinfarchrule(Solver *solv, Id name)
1280 Pool *pool = solv->pool;
1283 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1285 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1287 solver_enablerule(solv, r);
1288 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1290 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1291 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1298 /***********************************************************************
1302 *** Dup rules make sure a package is selected from the specified dup
1303 *** repositories if an update candidate is included in one of them.
1308 add_cleandeps_package(Solver *solv, Id p)
1310 if (!solv->cleandeps_updatepkgs)
1312 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
1313 queue_init(solv->cleandeps_updatepkgs);
1315 queue_pushunique(solv->cleandeps_updatepkgs, p);
1319 solver_addtodupmaps(Solver *solv, Id p, Id how, int targeted)
1321 Pool *pool = solv->pool;
1322 Solvable *ps, *s = pool->solvables + p;
1323 Repo *installed = solv->installed;
1324 Id pi, pip, obs, *obsp;
1326 MAPSET(&solv->dupinvolvedmap, p);
1328 MAPSET(&solv->dupmap, p);
1329 FOR_PROVIDES(pi, pip, s->name)
1331 ps = pool->solvables + pi;
1332 if (ps->name != s->name)
1334 MAPSET(&solv->dupinvolvedmap, pi);
1335 if (targeted && ps->repo == installed && solv->obsoletes && solv->obsoletes[pi - installed->start])
1338 for (opp = solv->obsoletes_data + solv->obsoletes[pi - installed->start]; (pi2 = *opp++) != 0;)
1339 if (pool->solvables[pi2].repo != installed)
1340 MAPSET(&solv->dupinvolvedmap, pi2);
1342 if (ps->repo == installed && (how & SOLVER_FORCEBEST) != 0)
1344 if (!solv->bestupdatemap.size)
1345 map_grow(&solv->bestupdatemap, installed->end - installed->start);
1346 MAPSET(&solv->bestupdatemap, pi - installed->start);
1348 if (ps->repo == installed && (how & SOLVER_CLEANDEPS) != 0)
1349 add_cleandeps_package(solv, pi);
1350 if (!targeted && ps->repo != installed)
1351 MAPSET(&solv->dupmap, pi);
1353 if (s->repo == installed && solv->obsoletes && solv->obsoletes[p - installed->start])
1356 for (opp = solv->obsoletes_data + solv->obsoletes[p - installed->start]; (pi = *opp++) != 0;)
1358 ps = pool->solvables + pi;
1359 if (ps->repo == installed)
1361 MAPSET(&solv->dupinvolvedmap, pi);
1363 MAPSET(&solv->dupmap, pi);
1366 if (targeted && s->repo != installed && s->obsoletes)
1368 /* XXX: check obsoletes/provides combination */
1369 obsp = s->repo->idarraydata + s->obsoletes;
1370 while ((obs = *obsp++) != 0)
1372 FOR_PROVIDES(pi, pip, obs)
1374 Solvable *ps = pool->solvables + pi;
1375 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1377 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1379 MAPSET(&solv->dupinvolvedmap, pi);
1380 if (targeted && ps->repo == installed && solv->obsoletes && solv->obsoletes[pi - installed->start])
1383 for (opp = solv->obsoletes_data + solv->obsoletes[pi - installed->start]; (pi2 = *opp++) != 0;)
1384 if (pool->solvables[pi2].repo != installed)
1385 MAPSET(&solv->dupinvolvedmap, pi2);
1387 if (ps->repo == installed && (how & SOLVER_FORCEBEST) != 0)
1389 if (!solv->bestupdatemap.size)
1390 map_grow(&solv->bestupdatemap, installed->end - installed->start);
1391 MAPSET(&solv->bestupdatemap, pi - installed->start);
1393 if (ps->repo == installed && (how & SOLVER_CLEANDEPS) != 0)
1394 add_cleandeps_package(solv, pi);
1401 solver_createdupmaps(Solver *solv)
1403 Queue *job = &solv->job;
1404 Pool *pool = solv->pool;
1405 Repo *installed = solv->installed;
1406 Id select, how, what, p, pp;
1410 map_init(&solv->dupmap, pool->nsolvables);
1411 map_init(&solv->dupinvolvedmap, pool->nsolvables);
1412 for (i = 0; i < job->count; i += 2)
1414 how = job->elements[i];
1415 select = job->elements[i] & SOLVER_SELECTMASK;
1416 what = job->elements[i + 1];
1417 switch (how & SOLVER_JOBMASK)
1419 case SOLVER_DISTUPGRADE:
1420 if (select == SOLVER_SOLVABLE_REPO)
1423 if (what <= 0 || what > pool->nrepos)
1425 repo = pool_id2repo(pool, what);
1428 if (repo != installed && !(how & SOLVER_TARGETED) && solv->noautotarget)
1430 targeted = repo != installed || (how & SOLVER_TARGETED) != 0;
1431 FOR_REPO_SOLVABLES(repo, p, s)
1433 if (repo != installed && !pool_installable(pool, s))
1435 solver_addtodupmaps(solv, p, how, targeted);
1440 targeted = how & SOLVER_TARGETED ? 1 : 0;
1441 if (installed && !targeted && !solv->noautotarget)
1443 FOR_JOB_SELECT(p, pp, select, what)
1444 if (pool->solvables[p].repo == installed)
1448 else if (!installed && !solv->noautotarget)
1450 FOR_JOB_SELECT(p, pp, select, what)
1452 Solvable *s = pool->solvables + p;
1455 if (s->repo != installed && !targeted)
1457 if (s->repo != installed && !pool_installable(pool, s))
1459 solver_addtodupmaps(solv, p, how, targeted);
1467 MAPCLR(&solv->dupinvolvedmap, SYSTEMSOLVABLE);
1471 solver_freedupmaps(Solver *solv)
1473 map_free(&solv->dupmap);
1474 /* we no longer free solv->dupinvolvedmap as we need it in
1475 * policy's priority pruning code. sigh. */
1479 solver_addduprules(Solver *solv, Map *addedmap)
1481 Pool *pool = solv->pool;
1486 solv->duprules = solv->nrules;
1487 for (i = 1; i < pool->nsolvables; i++)
1489 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1491 s = pool->solvables + i;
1493 FOR_PROVIDES(p, pp, s->name)
1495 ps = pool->solvables + p;
1496 if (ps->name != s->name || !MAPTST(addedmap, p))
1502 if (!MAPTST(&solv->dupinvolvedmap, p))
1504 if (solv->installed && ps->repo == solv->installed)
1506 if (!solv->updatemap.size)
1507 map_grow(&solv->updatemap, solv->installed->end - solv->installed->start);
1508 MAPSET(&solv->updatemap, p - solv->installed->start);
1509 if (!MAPTST(&solv->dupmap, p))
1512 /* is installed identical to a good one? */
1513 FOR_PROVIDES(ip, ipp, ps->name)
1515 Solvable *is = pool->solvables + ip;
1516 if (!MAPTST(&solv->dupmap, ip))
1518 if (is->evr == ps->evr && solvable_identical(ps, is))
1522 solver_addrule(solv, -p, 0); /* no match, sorry */
1524 MAPSET(&solv->dupmap, p); /* for best rules processing */
1527 else if (!MAPTST(&solv->dupmap, p))
1528 solver_addrule(solv, -p, 0);
1531 solv->duprules_end = solv->nrules;
1536 disableduprule(Solver *solv, Id name)
1538 Pool *pool = solv->pool;
1541 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1543 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1544 solver_disablerule(solv, r);
1549 reenableduprule(Solver *solv, Id name)
1551 Pool *pool = solv->pool;
1554 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1556 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1558 solver_enablerule(solv, r);
1559 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1561 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1562 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1569 /***********************************************************************
1571 *** Policy rule disabling/reenabling
1573 *** Disable all policy rules that conflict with our jobs. If a job
1574 *** gets disabled later on, reenable the involved policy rules again.
1578 #define DISABLE_UPDATE 1
1579 #define DISABLE_INFARCH 2
1580 #define DISABLE_DUP 3
1583 * add all installed packages that package p obsoletes to Queue q.
1584 * Package p is not installed. Also, we know that if
1585 * solv->keepexplicitobsoletes is not set, p is not in the multiversion map.
1586 * Entries may get added multiple times.
1589 add_obsoletes(Solver *solv, Id p, Queue *q)
1591 Pool *pool = solv->pool;
1592 Repo *installed = solv->installed;
1594 Solvable *s = pool->solvables + p;
1598 if (!solv->keepexplicitobsoletes || !(solv->multiversion.size && MAPTST(&solv->multiversion, p)))
1600 FOR_PROVIDES(p2, pp2, s->name)
1602 Solvable *ps = pool->solvables + p2;
1603 if (ps->repo != installed)
1605 if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
1607 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1615 obsp = s->repo->idarraydata + s->obsoletes;
1616 while ((obs = *obsp++) != 0)
1617 FOR_PROVIDES(p2, pp2, obs)
1619 Solvable *ps = pool->solvables + p2;
1620 if (ps->repo != installed)
1622 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1624 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1634 * Call add_obsoletes and intersect the result with the
1635 * elements in Queue q starting at qstart.
1636 * Assumes that it's the first call if qstart == q->count.
1637 * May use auxillary map m for the intersection process, all
1638 * elements of q starting at qstart must have their bit cleared.
1639 * (This is also true after the function returns.)
1642 intersect_obsoletes(Solver *solv, Id p, Queue *q, int qstart, Map *m)
1645 int qcount = q->count;
1647 add_obsoletes(solv, p, q);
1648 if (qcount == qstart)
1649 return; /* first call */
1650 if (qcount == q->count)
1652 else if (qcount == qstart + 1)
1654 /* easy if there's just one element */
1656 for (i = qcount; i < q->count; i++)
1657 if (q->elements[i] == q->elements[qstart])
1659 j++; /* keep the element */
1663 else if (!m->size && q->count - qstart <= 8)
1665 /* faster than a map most of the time */
1667 for (i = j = qstart; i < qcount; i++)
1669 Id ip = q->elements[i];
1670 for (k = qcount; k < q->count; k++)
1671 if (q->elements[k] == ip)
1673 q->elements[j++] = ip;
1680 /* for the really pathologic cases we use the map */
1681 Repo *installed = solv->installed;
1683 map_init(m, installed->end - installed->start);
1684 for (i = qcount; i < q->count; i++)
1685 MAPSET(m, q->elements[i] - installed->start);
1686 for (i = j = qstart; i < qcount; i++)
1687 if (MAPTST(m, q->elements[i] - installed->start))
1689 MAPCLR(m, q->elements[i] - installed->start);
1690 q->elements[j++] = q->elements[i];
1693 queue_truncate(q, j);
1697 jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
1699 Pool *pool = solv->pool;
1703 int i, j, set, qstart;
1706 installed = solv->installed;
1707 select = how & SOLVER_SELECTMASK;
1708 switch (how & SOLVER_JOBMASK)
1710 case SOLVER_INSTALL:
1711 set = how & SOLVER_SETMASK;
1712 if (!(set & SOLVER_NOAUTOSET))
1714 /* automatically add set bits by analysing the job */
1715 if (select == SOLVER_SOLVABLE_NAME)
1716 set |= SOLVER_SETNAME;
1717 if (select == SOLVER_SOLVABLE)
1718 set |= SOLVER_SETNAME | SOLVER_SETARCH | SOLVER_SETVENDOR | SOLVER_SETREPO | SOLVER_SETEVR;
1719 else if ((select == SOLVER_SOLVABLE_NAME || select == SOLVER_SOLVABLE_PROVIDES) && ISRELDEP(what))
1721 Reldep *rd = GETRELDEP(pool, what);
1722 if (rd->flags == REL_EQ && select == SOLVER_SOLVABLE_NAME)
1724 if (pool->disttype != DISTTYPE_DEB)
1726 const char *rel = strrchr(pool_id2str(pool, rd->evr), '-');
1727 set |= rel ? SOLVER_SETEVR : SOLVER_SETEV;
1730 set |= SOLVER_SETEVR;
1732 if (rd->flags <= 7 && ISRELDEP(rd->name))
1733 rd = GETRELDEP(pool, rd->name);
1734 if (rd->flags == REL_ARCH)
1735 set |= SOLVER_SETARCH;
1739 set &= ~SOLVER_NOAUTOSET;
1742 if ((set & SOLVER_SETARCH) != 0 && solv->infarchrules != solv->infarchrules_end)
1744 if (select == SOLVER_SOLVABLE)
1745 queue_push2(q, DISABLE_INFARCH, pool->solvables[what].name);
1748 int qcnt = q->count;
1749 /* does not work for SOLVER_SOLVABLE_ALL and SOLVER_SOLVABLE_REPO, but
1750 they are not useful for SOLVER_INSTALL jobs anyway */
1751 FOR_JOB_SELECT(p, pp, select, what)
1753 s = pool->solvables + p;
1755 for (i = qcnt; i < q->count; i += 2)
1756 if (q->elements[i + 1] == s->name)
1760 queue_push2(q, DISABLE_INFARCH, s->name);
1764 if ((set & SOLVER_SETREPO) != 0 && solv->duprules != solv->duprules_end)
1766 if (select == SOLVER_SOLVABLE)
1767 queue_push2(q, DISABLE_DUP, pool->solvables[what].name);
1770 int qcnt = q->count;
1771 FOR_JOB_SELECT(p, pp, select, what)
1773 s = pool->solvables + p;
1775 for (i = qcnt; i < q->count; i += 2)
1776 if (q->elements[i + 1] == s->name)
1780 queue_push2(q, DISABLE_DUP, s->name);
1784 if (!installed || installed->end == installed->start)
1786 /* now the hard part: disable some update rules */
1788 /* first check if we have multiversion or installed packages in the job */
1790 FOR_JOB_SELECT(p, pp, select, what)
1792 if (pool->solvables[p].repo == installed)
1794 else if (solv->multiversion.size && MAPTST(&solv->multiversion, p) && !solv->keepexplicitobsoletes)
1798 if (j) /* have installed packages */
1800 /* this is for dupmap_all jobs, it can go away if we create
1801 * duprules for them */
1802 if (i == 1 && (set & SOLVER_SETREPO) != 0)
1803 queue_push2(q, DISABLE_UPDATE, j);
1809 FOR_JOB_SELECT(p, pp, select, what)
1811 intersect_obsoletes(solv, p, q, qstart, &omap);
1812 if (q->count == qstart)
1818 if (qstart == q->count)
1819 return; /* nothing to prune */
1821 /* convert result to (DISABLE_UPDATE, p) pairs */
1823 for (j = qstart; j < i; j++)
1824 queue_push(q, q->elements[j]);
1825 for (j = qstart; j < q->count; j += 2)
1827 q->elements[j] = DISABLE_UPDATE;
1828 q->elements[j + 1] = q->elements[i++];
1831 /* now that we know which installed packages are obsoleted check each of them */
1832 if ((set & (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR)) == (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR))
1833 return; /* all is set, nothing to do */
1835 for (i = j = qstart; i < q->count; i += 2)
1837 Solvable *is = pool->solvables + q->elements[i + 1];
1838 FOR_JOB_SELECT(p, pp, select, what)
1841 s = pool->solvables + p;
1842 if ((set & SOLVER_SETEVR) != 0)
1843 illegal |= POLICY_ILLEGAL_DOWNGRADE; /* ignore */
1844 if ((set & SOLVER_SETNAME) != 0)
1845 illegal |= POLICY_ILLEGAL_NAMECHANGE; /* ignore */
1846 if ((set & SOLVER_SETARCH) != 0)
1847 illegal |= POLICY_ILLEGAL_ARCHCHANGE; /* ignore */
1848 if ((set & SOLVER_SETVENDOR) != 0)
1849 illegal |= POLICY_ILLEGAL_VENDORCHANGE; /* ignore */
1850 illegal = policy_is_illegal(solv, is, s, illegal);
1851 if (illegal && illegal == POLICY_ILLEGAL_DOWNGRADE && (set & SOLVER_SETEV) != 0)
1853 /* it's ok if the EV is different */
1854 if (pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE_EVONLY) != 0)
1862 /* no package conflicts with the update rule */
1863 /* thus keep the DISABLE_UPDATE */
1864 q->elements[j + 1] = q->elements[i + 1];
1868 queue_truncate(q, j);
1874 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
1875 FOR_REPO_SOLVABLES(installed, p, s)
1876 queue_push2(q, DISABLE_UPDATE, p);
1877 FOR_JOB_SELECT(p, pp, select, what)
1878 if (pool->solvables[p].repo == installed)
1880 queue_push2(q, DISABLE_UPDATE, p);
1881 if (solv->instbuddy && solv->instbuddy[p - installed->start] > 1)
1882 queue_push2(q, DISABLE_UPDATE, solv->instbuddy[p - installed->start]);
1890 /* disable all policy rules that are in conflict with our job list */
1892 solver_disablepolicyrules(Solver *solv)
1894 Queue *job = &solv->job;
1901 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1903 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1905 r = solv->rules + i;
1906 if (r->d < 0) /* disabled? */
1908 j = solv->ruletojob.elements[i - solv->jobrules];
1912 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1914 if (solv->cleandepsmap.size)
1916 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
1917 for (i = solv->installed->start; i < solv->installed->end; i++)
1918 if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1919 queue_push2(&allq, DISABLE_UPDATE, i);
1921 MAPZERO(&solv->noupdate);
1922 for (i = 0; i < allq.count; i += 2)
1924 Id type = allq.elements[i], arg = allq.elements[i + 1];
1927 case DISABLE_UPDATE:
1928 disableupdaterule(solv, arg);
1930 case DISABLE_INFARCH:
1931 disableinfarchrule(solv, arg);
1934 disableduprule(solv, arg);
1943 /* we just disabled job #jobidx, now reenable all policy rules that were
1944 * disabled because of this job */
1946 solver_reenablepolicyrules(Solver *solv, int jobidx)
1948 Queue *job = &solv->job;
1953 Id qbuf[32], allqbuf[32];
1955 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
1956 jobtodisablelist(solv, job->elements[jobidx - 1], job->elements[jobidx], &q);
1962 /* now remove everything from q that is disabled by other jobs */
1964 /* first remove cleandeps packages, they count as DISABLE_UPDATE */
1965 if (solv->cleandepsmap.size)
1967 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
1968 for (j = k = 0; j < q.count; j += 2)
1970 if (q.elements[j] == DISABLE_UPDATE)
1972 Id p = q.elements[j + 1];
1973 if (p >= solv->installed->start && p < solv->installed->end && MAPTST(&solv->cleandepsmap, p - solv->installed->start))
1974 continue; /* remove element from q */
1976 q.elements[k++] = q.elements[j];
1977 q.elements[k++] = q.elements[j + 1];
1987 /* now go through the disable list of all other jobs */
1988 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1989 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1991 r = solv->rules + i;
1992 if (r->d < 0) /* disabled? */
1994 j = solv->ruletojob.elements[i - solv->jobrules];
1998 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2001 /* remove all elements in allq from q */
2002 for (j = k = 0; j < q.count; j += 2)
2004 Id type = q.elements[j], arg = q.elements[j + 1];
2005 for (ai = 0; ai < allq.count; ai += 2)
2006 if (allq.elements[ai] == type && allq.elements[ai + 1] == arg)
2008 if (ai < allq.count)
2009 continue; /* found it in allq, remove element from q */
2010 q.elements[k++] = q.elements[j];
2011 q.elements[k++] = q.elements[j + 1];
2024 /* now re-enable anything that's left in q */
2025 for (j = 0; j < q.count; j += 2)
2027 Id type = q.elements[j], arg = q.elements[j + 1];
2030 case DISABLE_UPDATE:
2031 reenableupdaterule(solv, arg);
2033 case DISABLE_INFARCH:
2034 reenableinfarchrule(solv, arg);
2037 reenableduprule(solv, arg);
2044 /* we just removed a package from the cleandeps map, now reenable all policy rules that were
2045 * disabled because of this */
2047 solver_reenablepolicyrules_cleandeps(Solver *solv, Id pkg)
2049 Queue *job = &solv->job;
2056 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
2057 for (i = solv->jobrules; i < solv->jobrules_end; i++)
2059 r = solv->rules + i;
2060 if (r->d < 0) /* disabled? */
2062 j = solv->ruletojob.elements[i - solv->jobrules];
2066 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2068 for (i = 0; i < allq.count; i += 2)
2069 if (allq.elements[i] == DISABLE_UPDATE && allq.elements[i + 1] == pkg)
2071 if (i == allq.count)
2072 reenableupdaterule(solv, pkg);
2077 /***********************************************************************
2079 *** Rule info part, tell the user what the rule is about.
2084 addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep)
2086 Pool *pool = solv->pool;
2090 /* check if this creates the rule we're searching for */
2091 r = solv->rules + solv->ruleinfoq->elements[0];
2093 od = r->d < 0 ? -r->d - 1 : r->d;
2098 if (p < 0 && d > 0 && (!pool->whatprovidesdata[d] || !pool->whatprovidesdata[d + 1]))
2100 w2 = pool->whatprovidesdata[d];
2103 if (p > 0 && d < 0) /* this hack is used for buddy deps */
2115 Id *dp = pool->whatprovidesdata + d;
2116 Id *odp = pool->whatprovidesdata + od;
2118 if (*dp++ != *odp++)
2124 /* handle multiversion conflict rules */
2125 if (p < 0 && pool->whatprovidesdata[d] < 0)
2127 w2 = pool->whatprovidesdata[d];
2128 /* XXX: free memory */
2138 if (w2 != op || p != ow2)
2143 if (p != op || w2 != ow2)
2147 /* yep, rule matches. record info */
2148 queue_push(solv->ruleinfoq, type);
2149 if (type == SOLVER_RULE_RPM_SAME_NAME)
2151 /* we normalize same name order */
2152 queue_push(solv->ruleinfoq, op < 0 ? -op : 0);
2153 queue_push(solv->ruleinfoq, ow2 < 0 ? -ow2 : 0);
2157 queue_push(solv->ruleinfoq, p < 0 ? -p : 0);
2158 queue_push(solv->ruleinfoq, w2 < 0 ? -w2 : 0);
2160 queue_push(solv->ruleinfoq, dep);
2164 solver_allruleinfos_cmp(const void *ap, const void *bp, void *dp)
2166 const Id *a = ap, *b = bp;
2185 getrpmruleinfos(Solver *solv, Rule *r, Queue *rq)
2187 Pool *pool = solv->pool;
2188 #ifdef ENABLE_LINKED_PKGS
2193 queue_push(rq, r - solv->rules); /* push the rule we're interested in */
2194 solv->ruleinfoq = rq;
2195 solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
2196 /* also try reverse direction for conflicts */
2197 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2198 solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
2199 #ifdef ENABLE_LINKED_PKGS
2200 /* check linked packages */
2202 if ((r->d == 0 || r->d == -1))
2206 d = r->d < 0 ? -r->d - 1 : r->d;
2207 l = pool->whatprovidesdata[d++];
2209 for (; l; l = (d ? pool->whatprovidesdata[d++] : 0))
2211 if (l <= 0 || !strchr(pool_id2str(pool, pool->solvables[l].name), ':'))
2213 if (has_package_link(pool, pool->solvables + l))
2214 add_package_link(solv, pool->solvables + l, 0, 0);
2217 solv->ruleinfoq = 0;
2222 solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
2224 Rule *r = solv->rules + rid;
2228 if (rid <= 0 || rid >= solv->rpmrules_end)
2230 Id type, from, to, dep;
2231 type = solver_ruleinfo(solv, rid, &from, &to, &dep);
2232 queue_push(rq, type);
2233 queue_push(rq, from);
2235 queue_push(rq, dep);
2238 getrpmruleinfos(solv, r, rq);
2239 /* now sort & unify em */
2242 solv_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
2243 /* throw out identical entries */
2244 for (i = j = 0; i < rq->count; i += 4)
2248 if (rq->elements[i] == rq->elements[j - 4] &&
2249 rq->elements[i + 1] == rq->elements[j - 3] &&
2250 rq->elements[i + 2] == rq->elements[j - 2] &&
2251 rq->elements[i + 3] == rq->elements[j - 1])
2254 rq->elements[j++] = rq->elements[i];
2255 rq->elements[j++] = rq->elements[i + 1];
2256 rq->elements[j++] = rq->elements[i + 2];
2257 rq->elements[j++] = rq->elements[i + 3];
2264 solver_ruleinfo(Solver *solv, Id rid, Id *fromp, Id *top, Id *depp)
2266 Pool *pool = solv->pool;
2267 Rule *r = solv->rules + rid;
2268 SolverRuleinfo type = SOLVER_RULE_UNKNOWN;
2276 if (rid > 0 && rid < solv->rpmrules_end)
2282 return SOLVER_RULE_RPM;
2286 getrpmruleinfos(solv, r, &rq);
2287 type = SOLVER_RULE_RPM;
2288 for (i = 0; i < rq.count; i += 4)
2291 qt = rq.elements[i];
2292 qp = rq.elements[i + 1];
2293 qo = rq.elements[i + 2];
2294 qd = rq.elements[i + 3];
2295 if (type == SOLVER_RULE_RPM || type > qt)
2309 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2311 Id jidx = solv->ruletojob.elements[rid - solv->jobrules];
2315 *top = solv->job.elements[jidx];
2317 *depp = solv->job.elements[jidx + 1];
2318 if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE)
2320 Id how = solv->job.elements[jidx];
2321 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLVABLE_NAME))
2322 return SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2323 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES))
2324 return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2325 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVABLE_NAME))
2326 return SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2327 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVABLE_PROVIDES))
2328 return SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2329 return SOLVER_RULE_JOB_UNSUPPORTED;
2331 return SOLVER_RULE_JOB;
2333 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2336 *fromp = solv->installed->start + (rid - solv->updaterules);
2337 return SOLVER_RULE_UPDATE;
2339 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2342 *fromp = solv->installed->start + (rid - solv->featurerules);
2343 return SOLVER_RULE_FEATURE;
2345 if (rid >= solv->duprules && rid < solv->duprules_end)
2350 *depp = pool->solvables[-r->p].name;
2351 return SOLVER_RULE_DISTUPGRADE;
2353 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2358 *depp = pool->solvables[-r->p].name;
2359 return SOLVER_RULE_INFARCH;
2361 if (rid >= solv->bestrules && rid < solv->bestrules_end)
2363 return SOLVER_RULE_BEST;
2365 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2367 return SOLVER_RULE_CHOICE;
2369 if (rid >= solv->learntrules)
2371 return SOLVER_RULE_LEARNT;
2373 return SOLVER_RULE_UNKNOWN;
2377 solver_ruleclass(Solver *solv, Id rid)
2380 return SOLVER_RULE_UNKNOWN;
2381 if (rid > 0 && rid < solv->rpmrules_end)
2382 return SOLVER_RULE_RPM;
2383 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2384 return SOLVER_RULE_JOB;
2385 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2386 return SOLVER_RULE_UPDATE;
2387 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2388 return SOLVER_RULE_FEATURE;
2389 if (rid >= solv->duprules && rid < solv->duprules_end)
2390 return SOLVER_RULE_DISTUPGRADE;
2391 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2392 return SOLVER_RULE_INFARCH;
2393 if (rid >= solv->bestrules && rid < solv->bestrules_end)
2394 return SOLVER_RULE_BEST;
2395 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2396 return SOLVER_RULE_CHOICE;
2397 if (rid >= solv->learntrules)
2398 return SOLVER_RULE_LEARNT;
2399 return SOLVER_RULE_UNKNOWN;
2403 solver_ruleliterals(Solver *solv, Id rid, Queue *q)
2405 Pool *pool = solv->pool;
2410 r = solv->rules + rid;
2411 FOR_RULELITERALS(p, pp, r)
2412 if (p != -SYSTEMSOLVABLE)
2415 queue_push(q, -SYSTEMSOLVABLE); /* hmm, better to return an empty result? */
2419 solver_rule2jobidx(Solver *solv, Id rid)
2421 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2423 return solv->ruletojob.elements[rid - solv->jobrules] + 1;
2426 /* job rule introspection */
2428 solver_rule2job(Solver *solv, Id rid, Id *whatp)
2431 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2437 idx = solv->ruletojob.elements[rid - solv->jobrules];
2439 *whatp = solv->job.elements[idx + 1];
2440 return solv->job.elements[idx];
2443 /* update/feature rule introspection */
2445 solver_rule2solvable(Solver *solv, Id rid)
2447 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2448 return rid - solv->updaterules;
2449 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2450 return rid - solv->featurerules;
2455 solver_rule2rules_rec(Solver *solv, Id rid, Queue *q, Map *seen)
2462 for (i = solv->learnt_why.elements[rid - solv->learntrules]; (rid2 = solv->learnt_pool.elements[i]) != 0; i++)
2466 if (MAPTST(seen, rid2))
2468 if (rid2 >= solv->learntrules)
2469 solver_rule2rules_rec(solv, rid2, q, seen);
2472 queue_push(q, rid2);
2476 /* learnt rule introspection */
2478 solver_rule2rules(Solver *solv, Id rid, Queue *q, int recursive)
2481 if (rid < solv->learntrules || rid >= solv->nrules)
2486 map_init(&seen, solv->nrules);
2487 solver_rule2rules_rec(solv, rid, q, &seen);
2491 solver_rule2rules_rec(solv, rid, q, 0);
2495 /* check if the newest versions of pi still provides the dependency we're looking for */
2497 solver_choicerulecheck(Solver *solv, Id pi, Rule *r, Map *m)
2499 Pool *pool = solv->pool;
2505 ur = solv->rules + solv->updaterules + (pi - pool->installed->start);
2507 ur = solv->rules + solv->featurerules + (pi - pool->installed->start);
2510 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
2511 FOR_RULELITERALS(p, pp, ur)
2515 policy_filter_unwanted(solv, &q, POLICY_MODE_CHOOSE);
2516 for (i = 0; i < q.count; i++)
2517 if (MAPTST(m, q.elements[i]))
2519 /* 1: none of the newest versions provide it */
2520 i = i == q.count ? 1 : 0;
2526 queue_removeelement(Queue *q, Id el)
2529 for (i = 0; i < q->count; i++)
2530 if (q->elements[i] == el)
2534 for (j = i++; i < q->count; i++)
2535 if (q->elements[i] != el)
2536 q->elements[j++] = q->elements[i];
2537 queue_truncate(q, j);
2542 solver_addchoicerules(Solver *solv)
2544 Pool *pool = solv->pool;
2548 int i, j, rid, havechoice;
2552 Id lastaddedp, lastaddedd;
2556 solv->choicerules = solv->nrules;
2557 if (!pool->installed)
2559 solv->choicerules_end = solv->nrules;
2562 now = solv_timems(0);
2563 solv->choicerules_ref = solv_calloc(solv->rpmrules_end, sizeof(Id));
2566 map_init(&m, pool->nsolvables);
2567 map_init(&mneg, pool->nsolvables);
2568 /* set up negative assertion map from infarch and dup rules */
2569 for (rid = solv->infarchrules, r = solv->rules + rid; rid < solv->infarchrules_end; rid++, r++)
2570 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2571 MAPSET(&mneg, -r->p);
2572 for (rid = solv->duprules, r = solv->rules + rid; rid < solv->duprules_end; rid++, r++)
2573 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2574 MAPSET(&mneg, -r->p);
2578 for (rid = 1; rid < solv->rpmrules_end ; rid++)
2580 r = solv->rules + rid;
2581 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 < 0))
2582 continue; /* only look at requires rules */
2583 /* solver_printrule(solv, SOLV_DEBUG_RESULT, r); */
2587 FOR_RULELITERALS(p, pp, r)
2591 s = pool->solvables + p;
2594 if (s->repo == pool->installed)
2599 /* check if this package is "blocked" by a installed package */
2601 FOR_PROVIDES(p2, pp2, s->name)
2603 s2 = pool->solvables + p2;
2604 if (s2->repo != pool->installed)
2606 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
2608 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, s2))
2614 /* found installed package p2 that we can update to p */
2615 if (MAPTST(&mneg, p))
2617 if (policy_is_illegal(solv, s2, s, 0))
2620 if (solver_choicerulecheck(solv, p2, r, &m))
2622 queue_push(&qi, p2);
2624 queue_push2(&qi, p2, p);
2631 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2633 while ((obs = *obsp++) != 0)
2635 FOR_PROVIDES(p2, pp2, obs)
2637 s2 = pool->solvables + p2;
2638 if (s2->repo != pool->installed)
2640 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
2642 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2651 /* found installed package p2 that we can update to p */
2652 if (MAPTST(&mneg, p))
2654 if (policy_is_illegal(solv, s2, s, 0))
2657 if (solver_choicerulecheck(solv, p2, r, &m))
2659 queue_push(&qi, p2);
2661 queue_push2(&qi, p2, p);
2667 /* package p is independent of the installed ones */
2670 if (!havechoice || !q.count || !qi.count)
2671 continue; /* no choice */
2673 FOR_RULELITERALS(p, pp, r)
2677 /* do extra checking */
2678 for (i = j = 0; i < qi.count; i += 2)
2680 p2 = qi.elements[i];
2683 if (solver_choicerulecheck(solv, p2, r, &m))
2685 /* oops, remove element p from q */
2686 queue_removeelement(&q, qi.elements[i + 1]);
2689 qi.elements[j++] = p2;
2691 queue_truncate(&qi, j);
2692 if (!q.count || !qi.count)
2694 FOR_RULELITERALS(p, pp, r)
2701 /* now check the update rules of the installed package.
2702 * if all packages of the update rules are contained in
2703 * the dependency rules, there's no need to set up the choice rule */
2704 for (i = 0; i < qi.count; i++)
2707 if (!qi.elements[i])
2709 ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
2711 ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
2714 FOR_RULELITERALS(p, pp, ur)
2719 for (j = i + 1; j < qi.count; j++)
2720 if (qi.elements[i] == qi.elements[j])
2723 /* empty map again */
2724 FOR_RULELITERALS(p, pp, r)
2730 printf("skipping choice ");
2731 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
2736 /* don't add identical rules */
2737 if (lastaddedp == r->p && lastaddedcnt == q.count)
2739 for (i = 0; i < q.count; i++)
2740 if (q.elements[i] != pool->whatprovidesdata[lastaddedd + i])
2743 continue; /* already added that one */
2745 d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
2749 lastaddedcnt = q.count;
2751 solver_addrule(solv, r->p, d);
2752 queue_push(&solv->weakruleq, solv->nrules - 1);
2753 solv->choicerules_ref[solv->nrules - 1 - solv->choicerules] = rid;
2756 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
2757 printf("WEAK CHOICE ");
2758 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + solv->nrules - 1);
2765 solv->choicerules_end = solv->nrules;
2766 /* shrink choicerules_ref */
2767 solv->choicerules_ref = solv_realloc2(solv->choicerules_ref, solv->choicerules_end - solv->choicerules, sizeof(Id));
2768 POOL_DEBUG(SOLV_DEBUG_STATS, "choice rule creation took %d ms\n", solv_timems(now));
2771 /* called when a choice rule is disabled by analyze_unsolvable. We also
2772 * have to disable all other choice rules so that the best packages get
2775 solver_disablechoicerules(Solver *solv, Rule *r)
2778 Pool *pool = solv->pool;
2782 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2783 map_init(&m, pool->nsolvables);
2784 FOR_RULELITERALS(p, pp, or)
2787 FOR_RULELITERALS(p, pp, r)
2790 for (rid = solv->choicerules; rid < solv->choicerules_end; rid++)
2792 r = solv->rules + rid;
2795 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2796 FOR_RULELITERALS(p, pp, or)
2797 if (p > 0 && MAPTST(&m, p))
2800 solver_disablerule(solv, r);
2805 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
2809 for (i = j = 0; i < q->count; i++)
2812 for (cp2 = cp; *cp2; cp2++)
2815 q->elements[j++] = p;
2819 queue_truncate(q, j);
2823 prune_to_dup_packages(Solver *solv, Id p, Queue *q)
2826 for (i = j = 0; i < q->count; i++)
2828 Id p = q->elements[i];
2829 if (MAPTST(&solv->dupmap, p))
2830 q->elements[j++] = p;
2832 queue_truncate(q, j);
2836 solver_addbestrules(Solver *solv, int havebestinstalljobs)
2838 Pool *pool = solv->pool;
2841 Repo *installed = solv->installed;
2847 solv->bestrules = solv->nrules;
2850 solv->bestrules_end = solv->nrules;
2857 if (havebestinstalljobs)
2859 for (i = 0; i < solv->job.count; i += 2)
2861 if ((solv->job.elements[i] & (SOLVER_JOBMASK | SOLVER_FORCEBEST)) == (SOLVER_INSTALL | SOLVER_FORCEBEST))
2865 for (j = 0; j < solv->ruletojob.count; j++)
2866 if (solv->ruletojob.elements[j] == i)
2868 if (j == solv->ruletojob.count)
2870 r = solv->rules + solv->jobrules + j;
2872 FOR_RULELITERALS(p2, pp2, r)
2876 continue; /* orphaned */
2877 /* select best packages, just look at prio and version */
2879 policy_filter_unwanted(solv, &q, POLICY_MODE_RECOMMEND);
2880 if (q.count == oldcnt)
2881 continue; /* nothing filtered */
2882 p2 = queue_shift(&q);
2883 solver_addrule(solv, p2, q.count ? pool_queuetowhatprovides(pool, &q) : 0);
2884 queue_push(&r2pkg, -(solv->jobrules + j));
2889 if (solv->bestupdatemap_all || solv->bestupdatemap.size)
2891 FOR_REPO_SOLVABLES(installed, p, s)
2894 if (!solv->updatemap_all && (!solv->updatemap.size || !MAPTST(&solv->updatemap, p - installed->start)))
2896 if (!solv->bestupdatemap_all && (!solv->bestupdatemap.size || !MAPTST(&solv->bestupdatemap, p - installed->start)))
2899 if (solv->bestobeypolicy)
2900 r = solv->rules + solv->updaterules + (p - installed->start);
2903 r = solv->rules + solv->featurerules + (p - installed->start);
2904 if (!r->p) /* identical to update rule? */
2905 r = solv->rules + solv->updaterules + (p - installed->start);
2907 if (solv->multiversionupdaters && (d = solv->multiversionupdaters[p - installed->start]) != 0 && r == solv->rules + solv->updaterules + (p - installed->start))
2909 /* need to check multiversionupdaters */
2910 if (r->p == p) /* be careful with the dup case */
2912 while ((p2 = pool->whatprovidesdata[d++]) != 0)
2917 FOR_RULELITERALS(p2, pp2, r)
2921 if (solv->update_targets && solv->update_targets->elements[p - installed->start])
2922 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q);
2923 if (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
2924 prune_to_dup_packages(solv, p, &q);
2925 /* select best packages, just look at prio and version */
2926 policy_filter_unwanted(solv, &q, POLICY_MODE_RECOMMEND);
2928 continue; /* orphaned */
2929 if (solv->bestobeypolicy)
2931 /* also filter the best of the feature rule packages and add them */
2932 r = solv->rules + solv->featurerules + (p - installed->start);
2937 FOR_RULELITERALS(p2, pp2, r)
2939 queue_push(&q2, p2);
2940 if (solv->update_targets && solv->update_targets->elements[p - installed->start])
2941 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q2);
2942 if (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
2943 prune_to_dup_packages(solv, p, &q);
2944 policy_filter_unwanted(solv, &q2, POLICY_MODE_RECOMMEND);
2945 for (j = 0; j < q2.count; j++)
2946 queue_pushunique(&q, q2.elements[j]);
2949 p2 = queue_shift(&q);
2950 solver_addrule(solv, p2, q.count ? pool_queuetowhatprovides(pool, &q) : 0);
2951 queue_push(&r2pkg, p);
2955 solv->bestrules_pkg = solv_memdup2(r2pkg.elements, r2pkg.count, sizeof(Id));
2956 solv->bestrules_end = solv->nrules;
2962 #undef CLEANDEPSDEBUG
2965 * This functions collects all packages that are looked at
2966 * when a dependency is checked. We need it to "pin" installed
2967 * packages when removing a supplemented package in createcleandepsmap.
2968 * Here's an not uncommon example:
2969 * A contains "Supplements: packageand(B, C)"
2970 * B contains "Requires: A"
2971 * Now if we remove C, the supplements is no longer true,
2972 * thus we also remove A. Without the dep_pkgcheck function, we
2973 * would now also remove B, but this is wrong, as adding back
2974 * C doesn't make the supplements true again. Thus we "pin" B
2976 * There's probably a better way to do this, but I haven't come
2980 dep_pkgcheck(Solver *solv, Id dep, Map *m, Queue *q)
2982 Pool *pool = solv->pool;
2987 Reldep *rd = GETRELDEP(pool, dep);
2990 if (rd->flags == REL_AND)
2992 dep_pkgcheck(solv, rd->name, m, q);
2993 dep_pkgcheck(solv, rd->evr, m, q);
2996 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
2998 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
3002 FOR_PROVIDES(p, pp, dep)
3003 if (!m || MAPTST(m, p))
3008 check_xsupp(Solver *solv, Queue *depq, Id dep)
3010 Pool *pool = solv->pool;
3015 Reldep *rd = GETRELDEP(pool, dep);
3018 if (rd->flags == REL_AND)
3020 if (!check_xsupp(solv, depq, rd->name))
3022 return check_xsupp(solv, depq, rd->evr);
3024 if (rd->flags == REL_OR)
3026 if (check_xsupp(solv, depq, rd->name))
3028 return check_xsupp(solv, depq, rd->evr);
3030 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
3031 return solver_splitprovides(solv, rd->evr);
3032 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
3033 return solver_dep_installed(solv, rd->evr);
3035 if (depq && rd->flags == REL_NAMESPACE)
3038 for (i = 0; i < depq->count; i++)
3039 if (depq->elements[i] == dep || depq->elements[i] == rd->name)
3043 FOR_PROVIDES(p, pp, dep)
3044 if (p == SYSTEMSOLVABLE || pool->solvables[p].repo == solv->installed)
3050 queue_contains(Queue *q, Id id)
3053 for (i = 0; i < q->count; i++)
3054 if (q->elements[i] == id)
3061 * Find all installed packages that are no longer
3062 * needed regarding the current solver job.
3065 * - remove pass: remove all packages that could have
3066 * been dragged in by the obsoleted packages.
3067 * i.e. if package A is obsolete and contains "Requires: B",
3068 * also remove B, as installing A will have pulled in B.
3069 * after this pass, we have a set of still installed packages
3070 * with broken dependencies.
3072 * now add back all packages that the still installed packages
3075 * The cleandeps packages are the packages removed in the first
3076 * pass and not added back in the second pass.
3078 * If we search for unneeded packages (unneeded is true), we
3079 * simply remove all packages except the userinstalled ones in
3083 solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded)
3085 Pool *pool = solv->pool;
3086 Repo *installed = solv->installed;
3087 Queue *job = &solv->job;
3092 Id rid, how, what, select;
3094 Id req, *reqp, sup, *supp;
3096 Queue iq, iqcopy, xsuppq;
3099 map_empty(cleandepsmap);
3100 if (!installed || installed->end == installed->start)
3102 map_init(&userinstalled, installed->end - installed->start);
3103 map_init(&im, pool->nsolvables);
3104 map_init(&installedm, pool->nsolvables);
3106 queue_init(&xsuppq);
3108 for (i = 0; i < job->count; i += 2)
3110 how = job->elements[i];
3111 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
3113 what = job->elements[i + 1];
3114 select = how & SOLVER_SELECTMASK;
3115 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
3116 FOR_REPO_SOLVABLES(installed, p, s)
3117 MAPSET(&userinstalled, p - installed->start);
3118 FOR_JOB_SELECT(p, pp, select, what)
3119 if (pool->solvables[p].repo == installed)
3120 MAPSET(&userinstalled, p - installed->start);
3122 if ((how & (SOLVER_JOBMASK | SOLVER_SELECTMASK)) == (SOLVER_ERASE | SOLVER_SOLVABLE_PROVIDES))
3124 what = job->elements[i + 1];
3127 Reldep *rd = GETRELDEP(pool, what);
3128 if (rd->flags != REL_NAMESPACE)
3132 queue_pushunique(&iq, rd->name);
3135 FOR_PROVIDES(p, pp, what)
3140 queue_pushunique(&iq, what);
3145 /* have special namespace cleandeps erases */
3148 for (ip = solv->installed->start; ip < solv->installed->end; ip++)
3150 s = pool->solvables + ip;
3151 if (s->repo != installed)
3153 if (!s->supplements)
3155 supp = s->repo->idarraydata + s->supplements;
3156 while ((sup = *supp++) != 0)
3157 if (check_xsupp(solv, &iq, sup) && !check_xsupp(solv, 0, sup))
3159 #ifdef CLEANDEPSDEBUG
3160 printf("xsupp %s from %s\n", pool_dep2str(pool, sup), pool_solvid2str(pool, ip));
3162 queue_pushunique(&xsuppq, sup);
3168 /* also add visible patterns to userinstalled for openSUSE */
3172 dataiterator_init(&di, pool, 0, 0, SOLVABLE_ISVISIBLE, 0, 0);
3173 while (dataiterator_step(&di))
3178 s = pool->solvables + di.solvid;
3179 if (!s->repo || !s->requires)
3181 if (s->repo != installed && !pool_installable(pool, s))
3183 if (strncmp(pool_id2str(pool, s->name), "pattern:", 8) != 0)
3185 dp = s->repo->idarraydata + s->requires;
3186 for (dp = s->repo->idarraydata + s->requires; *dp; dp++)
3187 FOR_PROVIDES(p, pp, *dp)
3188 if (pool->solvables[p].repo == installed)
3190 if (strncmp(pool_id2str(pool, pool->solvables[p].name), "pattern", 7) != 0)
3192 MAPSET(&userinstalled, p - installed->start);
3195 dataiterator_free(&di);
3199 /* all products and their buddies are userinstalled */
3200 for (p = installed->start; p < installed->end; p++)
3202 Solvable *s = pool->solvables + p;
3203 if (s->repo != installed)
3205 if (!strncmp("product:", pool_id2str(pool, s->name), 8))
3207 MAPSET(&userinstalled, p - installed->start);
3208 if (pool->nscallback)
3210 Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, p);
3211 if (buddy >= installed->start && buddy < installed->end && pool->solvables[buddy].repo == installed)
3212 MAPSET(&userinstalled, buddy - installed->start);
3218 /* add all positive elements (e.g. locks) to "userinstalled" */
3219 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3221 r = solv->rules + rid;
3224 i = solv->ruletojob.elements[rid - solv->jobrules];
3225 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
3227 FOR_RULELITERALS(p, jp, r)
3228 if (p > 0 && pool->solvables[p].repo == installed)
3229 MAPSET(&userinstalled, p - installed->start);
3232 /* add all cleandeps candidates to iq */
3233 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3235 r = solv->rules + rid;
3236 if (r->d < 0) /* disabled? */
3238 if (r->d == 0 && r->p < 0 && r->w2 == 0) /* negative assertion (erase job)? */
3241 if (pool->solvables[p].repo != installed)
3243 MAPCLR(&userinstalled, p - installed->start);
3246 i = solv->ruletojob.elements[rid - solv->jobrules];
3247 how = job->elements[i];
3248 if ((how & (SOLVER_JOBMASK|SOLVER_CLEANDEPS)) == (SOLVER_ERASE|SOLVER_CLEANDEPS))
3251 else if (r->p > 0) /* install job */
3255 i = solv->ruletojob.elements[rid - solv->jobrules];
3256 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
3258 /* check if the literals all obsolete some installed package */
3262 /* just one installed literal */
3263 if (r->d == 0 && r->w2 == 0 && pool->solvables[r->p].repo == installed)
3265 /* multiversion is bad */
3266 if (solv->multiversion.size && !solv->keepexplicitobsoletes)
3268 FOR_RULELITERALS(p, jp, r)
3269 if (MAPTST(&solv->multiversion, p))
3277 FOR_RULELITERALS(p, jp, r)
3281 queue_truncate(&iq, iqstart); /* abort */
3284 if (pool->solvables[p].repo == installed)
3286 if (iq.count == iqstart)
3290 for (i = iqstart; i < iq.count; i++)
3291 if (iq.elements[i] == p)
3293 queue_truncate(&iq, iqstart);
3299 intersect_obsoletes(solv, p, &iq, iqstart, &om);
3300 if (iq.count == iqstart)
3308 queue_init_clone(&iqcopy, &iq);
3312 if (solv->cleandeps_updatepkgs)
3313 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
3314 queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]);
3318 queue_empty(&iq); /* just in case... */
3320 /* clear userinstalled bit for the packages we really want to delete/update */
3321 for (i = 0; i < iq.count; i++)
3324 if (pool->solvables[p].repo != installed)
3326 MAPCLR(&userinstalled, p - installed->start);
3329 for (p = installed->start; p < installed->end; p++)
3331 if (pool->solvables[p].repo != installed)
3333 MAPSET(&installedm, p);
3334 if (unneeded && !MAPTST(&userinstalled, p - installed->start))
3338 MAPSET(&installedm, SYSTEMSOLVABLE);
3339 MAPSET(&im, SYSTEMSOLVABLE);
3341 #ifdef CLEANDEPSDEBUG
3342 printf("REMOVE PASS\n");
3351 /* supplements pass */
3352 for (ip = installed->start; ip < installed->end; ip++)
3354 if (!MAPTST(&installedm, ip))
3356 s = pool->solvables + ip;
3357 if (!s->supplements)
3359 if (!MAPTST(&im, ip))
3361 if (MAPTST(&userinstalled, ip - installed->start))
3363 supp = s->repo->idarraydata + s->supplements;
3364 while ((sup = *supp++) != 0)
3365 if (dep_possible(solv, sup, &im))
3369 supp = s->repo->idarraydata + s->supplements;
3370 while ((sup = *supp++) != 0)
3371 if (dep_possible(solv, sup, &installedm) || (xsuppq.count && queue_contains(&xsuppq, sup)))
3373 /* no longer supplemented, also erase */
3374 int iqcount = iq.count;
3375 /* pin packages, see comment above dep_pkgcheck */
3376 dep_pkgcheck(solv, sup, &im, &iq);
3377 for (i = iqcount; i < iq.count; i++)
3379 Id pqp = iq.elements[i];
3380 if (pool->solvables[pqp].repo == installed)
3381 MAPSET(&userinstalled, pqp - installed->start);
3383 queue_truncate(&iq, iqcount);
3384 #ifdef CLEANDEPSDEBUG
3385 printf("%s supplemented [%s]\n", pool_solvid2str(pool, ip), pool_dep2str(pool, sup));
3387 queue_push(&iq, ip);
3392 break; /* no supplementing package found, we're done */
3394 ip = queue_shift(&iq);
3395 s = pool->solvables + ip;
3396 if (!MAPTST(&im, ip))
3398 if (!MAPTST(&installedm, ip))
3400 if (s->repo == installed && MAPTST(&userinstalled, ip - installed->start))
3403 #ifdef CLEANDEPSDEBUG
3404 printf("removing %s\n", pool_solvable2str(pool, s));
3408 reqp = s->repo->idarraydata + s->requires;
3409 while ((req = *reqp++) != 0)
3411 if (req == SOLVABLE_PREREQMARKER)
3414 /* count number of installed packages that match */
3416 FOR_PROVIDES(p, pp, req)
3417 if (MAPTST(&installedm, p))
3422 FOR_PROVIDES(p, pp, req)
3424 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
3426 #ifdef CLEANDEPSDEBUG
3427 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3436 reqp = s->repo->idarraydata + s->recommends;
3437 while ((req = *reqp++) != 0)
3441 FOR_PROVIDES(p, pp, req)
3442 if (MAPTST(&installedm, p))
3447 FOR_PROVIDES(p, pp, req)
3449 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
3451 #ifdef CLEANDEPSDEBUG
3452 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3461 /* turn userinstalled into remove set for pruning */
3462 map_empty(&userinstalled);
3463 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3465 r = solv->rules + rid;
3466 if (r->p >= 0 || r->d != 0 || r->w2 != 0)
3467 continue; /* disabled or not erase */
3470 if (pool->solvables[p].repo == installed)
3471 MAPSET(&userinstalled, p - installed->start);
3473 if (!unneeded && solv->cleandeps_updatepkgs)
3475 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
3477 p = solv->cleandeps_updatepkgs->elements[i];
3478 if (pool->solvables[p].repo == installed)
3479 MAPSET(&userinstalled, p - installed->start);
3482 MAPSET(&im, SYSTEMSOLVABLE); /* in case we cleared it above */
3483 for (p = installed->start; p < installed->end; p++)
3486 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3488 r = solv->rules + rid;
3491 FOR_RULELITERALS(p, jp, r)
3495 /* also put directly addressed packages on the install queue
3496 * so we can mark patterns as installed */
3497 for (i = 0; i < job->count; i += 2)
3499 how = job->elements[i];
3500 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
3502 what = job->elements[i + 1];
3503 select = how & SOLVER_SELECTMASK;
3504 if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
3505 queue_push(&iq, what);
3509 #ifdef CLEANDEPSDEBUG
3510 printf("ADDBACK PASS\n");
3516 /* supplements pass */
3517 for (ip = installed->start; ip < installed->end; ip++)
3519 if (!MAPTST(&installedm, ip))
3521 if (MAPTST(&userinstalled, ip - installed->start))
3523 s = pool->solvables + ip;
3524 if (!s->supplements)
3526 if (MAPTST(&im, ip))
3528 supp = s->repo->idarraydata + s->supplements;
3529 while ((sup = *supp++) != 0)
3530 if (dep_possible(solv, sup, &im))
3534 #ifdef CLEANDEPSDEBUG
3535 printf("%s supplemented\n", pool_solvid2str(pool, ip));
3538 queue_push(&iq, ip);
3544 ip = queue_shift(&iq);
3545 s = pool->solvables + ip;
3546 #ifdef CLEANDEPSDEBUG
3547 printf("adding back %s\n", pool_solvable2str(pool, s));
3551 reqp = s->repo->idarraydata + s->requires;
3552 while ((req = *reqp++) != 0)
3554 FOR_PROVIDES(p, pp, req)
3559 FOR_PROVIDES(p, pp, req)
3561 if (!MAPTST(&im, p) && MAPTST(&installedm, p))
3565 if (MAPTST(&userinstalled, p - installed->start))
3567 #ifdef CLEANDEPSDEBUG
3568 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3578 reqp = s->repo->idarraydata + s->recommends;
3579 while ((req = *reqp++) != 0)
3581 FOR_PROVIDES(p, pp, req)
3586 FOR_PROVIDES(p, pp, req)
3588 if (!MAPTST(&im, p) && MAPTST(&installedm, p))
3592 if (MAPTST(&userinstalled, p - installed->start))
3594 #ifdef CLEANDEPSDEBUG
3595 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3606 /* make sure the updatepkgs and mistakes are not in the cleandeps map */
3607 if (solv->cleandeps_updatepkgs)
3608 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
3609 MAPSET(&im, solv->cleandeps_updatepkgs->elements[i]);
3610 if (solv->cleandeps_mistakes)
3611 for (i = 0; i < solv->cleandeps_mistakes->count; i++)
3612 MAPSET(&im, solv->cleandeps_mistakes->elements[i]);
3613 /* also remove original iq packages */
3614 for (i = 0; i < iqcopy.count; i++)
3615 MAPSET(&im, iqcopy.elements[i]);
3616 queue_free(&iqcopy);
3617 for (p = installed->start; p < installed->end; p++)
3619 if (pool->solvables[p].repo != installed)
3621 if (!MAPTST(&im, p))
3622 MAPSET(cleandepsmap, p - installed->start);
3625 map_free(&installedm);
3626 map_free(&userinstalled);
3627 queue_free(&xsuppq);
3628 #ifdef CLEANDEPSDEBUG
3629 printf("=== final cleandeps map:\n");
3630 for (p = installed->start; p < installed->end; p++)
3631 if (MAPTST(cleandepsmap, p - installed->start))
3632 printf(" - %s\n", pool_solvid2str(pool, p));
3645 /* Tarjan's SCC algorithm, slightly modifed */
3647 trj_visit(struct trj_data *trj, Id node)
3650 Queue *edges = trj->edges;
3651 Id nnode, myidx, stackstart;
3654 low[node] = myidx = trj->idx++;
3655 low[(stackstart = trj->nstack++)] = node;
3656 for (i = edges->elements[node]; (nnode = edges->elements[i]) != 0; i++)
3661 if (!edges->elements[edges->elements[nnode]])
3667 trj_visit(trj, nnode);
3672 if (l < trj->firstidx)
3675 for (k = l; low[low[k]] == l; k++)
3678 else if (l < low[node])
3681 if (low[node] == myidx)
3683 if (myidx != trj->firstidx)
3685 for (i = stackstart; i < trj->nstack; i++)
3686 low[low[i]] = myidx;
3687 trj->nstack = stackstart;
3693 solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered)
3695 Repo *installed = solv->installed;
3699 queue_empty(unneededq);
3700 if (!installed || installed->end == installed->start)
3703 map_init(&cleandepsmap, installed->end - installed->start);
3704 solver_createcleandepsmap(solv, &cleandepsmap, 1);
3705 for (i = installed->start; i < installed->end; i++)
3706 if (MAPTST(&cleandepsmap, i - installed->start))
3707 queue_push(unneededq, i);
3709 if (filtered && unneededq->count > 1)
3711 Pool *pool = solv->pool;
3715 int j, pass, count = unneededq->count;
3718 map_init(&installedm, pool->nsolvables);
3719 for (i = installed->start; i < installed->end; i++)
3720 if (pool->solvables[i].repo == installed)
3721 MAPSET(&installedm, i);
3723 nrequires = solv_calloc(count, sizeof(Id));
3725 queue_prealloc(&edges, count * 4 + 10); /* pre-size */
3728 * Go through the solvables in the nodes queue and create edges for
3729 * all requires/recommends/supplements between the nodes.
3730 * The edges are stored in the edges queue, we add 1 to the node
3731 * index so that nodes in the edges queue are != 0 and we can
3732 * terminate the edge list with 0.
3733 * Thus for node element 5, the edges are stored starting at
3734 * edges.elements[6] and are 0-terminated.
3736 /* leave first element zero to make things easier */
3737 /* also add trailing zero */
3738 queue_insertn(&edges, 0, 1 + count + 1, 0);
3740 /* first requires and recommends */
3741 for (i = 0; i < count; i++)
3743 Solvable *s = pool->solvables + unneededq->elements[i];
3744 edges.elements[i + 1] = edges.count;
3745 for (pass = 0; pass < 2; pass++)
3748 unsigned int off = pass == 0 ? s->requires : s->recommends;
3751 for (dp = s->repo->idarraydata + off; *dp; dp++)
3752 FOR_PROVIDES(p, pp, *dp)
3754 Solvable *sp = pool->solvables + p;
3755 if (s == sp || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
3757 for (j = 0; j < count; j++)
3758 if (p == unneededq->elements[j])
3762 if (num && edges.elements[edges.count - 1] == j + 1)
3764 queue_push(&edges, j + 1);
3770 queue_push(&edges, 0);
3773 printf("requires + recommends\n");
3774 for (i = 0; i < count; i++)
3777 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
3778 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
3779 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
3783 /* then add supplements */
3784 for (i = 0; i < count; i++)
3786 Solvable *s = pool->solvables + unneededq->elements[i];
3791 for (dp = s->repo->idarraydata + s->supplements; *dp; dp++)
3792 if (dep_possible(solv, *dp, &installedm))
3796 queue_init_buffer(&iq, iqbuf, sizeof(iqbuf)/sizeof(*iqbuf));
3797 dep_pkgcheck(solv, *dp, 0, &iq);
3798 for (k = 0; k < iq.count; k++)
3800 Id p = iq.elements[k];
3801 Solvable *sp = pool->solvables + p;
3802 if (p == unneededq->elements[i] || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
3804 for (j = 0; j < count; j++)
3805 if (p == unneededq->elements[j])
3807 /* now add edge from j + 1 to i + 1 */
3808 queue_insert(&edges, edges.elements[j + 1] + nrequires[j], i + 1);
3809 /* addapt following edge pointers */
3810 for (k = j + 2; k < count + 2; k++)
3811 edges.elements[k]++;
3819 printf("+ supplements\n");
3820 for (i = 0; i < count; i++)
3823 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
3824 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
3825 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
3828 map_free(&installedm);
3830 /* now run SCC algo two times, first with requires+recommends+supplements,
3831 * then again without the requires. We run it the second time to get rid
3832 * of packages that got dragged in via recommends/supplements */
3834 * low will contain the result of the SCC search.
3835 * it must be of at least size 2 * (count + 1) and
3836 * must be zero initialized.
3838 * 0 low low ... low stack stack ...stack 0
3841 low = solv_calloc(count + 1, 2 * sizeof(Id));
3842 for (pass = 0; pass < 2; pass++)
3844 struct trj_data trj;
3847 memset(low, 0, (count + 1) * (2 * sizeof(Id)));
3848 for (i = 0; i < count; i++)
3850 edges.elements[i + 1] += nrequires[i];
3851 if (!unneededq->elements[i])
3852 low[i + 1] = -1; /* ignore this node */
3857 trj.idx = count + 1; /* stack starts here */
3858 for (i = 1; i <= count; i++)
3862 if (edges.elements[edges.elements[i]])
3864 trj.firstidx = trj.nstack = trj.idx;
3869 Id myidx = trj.idx++;
3874 /* prune packages */
3875 for (i = 0; i < count; i++)
3876 if (low[i + 1] <= 0)
3877 unneededq->elements[i] = 0;
3880 solv_free(nrequires);
3883 /* finally remove all pruned entries from unneededq */
3884 for (i = j = 0; i < count; i++)
3885 if (unneededq->elements[i])
3886 unneededq->elements[j++] = unneededq->elements[i];
3887 queue_truncate(unneededq, j);
3889 map_free(&cleandepsmap);