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"
32 #define RULES_BLOCK 63
34 static void addpkgruleinfo(Solver *solv, Id p, Id p2, Id d, int type, Id dep);
35 static void solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded);
37 /*-------------------------------------------------------------------
38 * Check if dependency is possible
40 * mirrors solver_dep_fulfilled but uses map m instead of the decisionmap.
41 * used in solver_addpkgrulesforweak and solver_createcleandepsmap.
45 dep_possible(Solver *solv, Id dep, Map *m)
47 Pool *pool = solv->pool;
52 Reldep *rd = GETRELDEP(pool, dep);
55 if (rd->flags == REL_COND)
57 if (rd->flags == REL_AND)
59 if (!dep_possible(solv, rd->name, m))
61 return dep_possible(solv, rd->evr, m);
63 if (rd->flags == REL_OR)
65 if (dep_possible(solv, rd->name, m))
67 return dep_possible(solv, rd->evr, m);
69 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
70 return solver_splitprovides(solv, rd->evr, m);
73 FOR_PROVIDES(p, pp, dep)
82 is_otherproviders_dep(Pool *pool, Id dep)
86 Reldep *rd = GETRELDEP(pool, dep);
87 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
93 /********************************************************************
97 * - unify rules, remove duplicates
100 /*-------------------------------------------------------------------
102 * compare rules for unification sort
107 unifyrules_sortcmp(const void *ap, const void *bp, void *dp)
110 Rule *a = (Rule *)ap;
111 Rule *b = (Rule *)bp;
117 return x; /* p differs */
120 if (a->d == 0 && b->d == 0)
121 return a->w2 - b->w2; /* assertion: return w2 diff */
123 if (a->d == 0) /* a is assertion, b not */
125 x = a->w2 - pool->whatprovidesdata[b->d];
129 if (b->d == 0) /* b is assertion, a not */
131 x = pool->whatprovidesdata[a->d] - b->w2;
135 /* compare whatprovidesdata */
136 ad = pool->whatprovidesdata + a->d;
137 bd = pool->whatprovidesdata + b->d;
139 if ((x = *ad++ - *bd++) != 0)
145 solver_rulecmp(Solver *solv, Rule *r1, Rule *r2)
147 return unifyrules_sortcmp(r1, r2, solv->pool);
151 /*-------------------------------------------------------------------
154 * go over all rules and remove duplicates
158 solver_unifyrules(Solver *solv)
160 Pool *pool = solv->pool;
164 if (solv->nrules <= 2) /* nothing to unify */
167 /* sort rules first */
168 solv_sort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp, solv->pool);
175 for (i = j = 1, ir = solv->rules + i; i < solv->nrules; i++, ir++)
177 if (jr && !unifyrules_sortcmp(ir, jr, pool))
178 continue; /* prune! */
179 jr = solv->rules + j++; /* keep! */
184 /* reduced count from nrules to j rules */
185 POOL_DEBUG(SOLV_DEBUG_STATS, "pruned rules from %d to %d\n", solv->nrules, j);
187 /* adapt rule buffer */
189 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
192 * debug: log rule statistics
194 IF_POOLDEBUG (SOLV_DEBUG_STATS)
201 for (i = 1; i < solv->nrules; i++)
208 dp = solv->pool->whatprovidesdata + r->d;
213 POOL_DEBUG(SOLV_DEBUG_STATS, " binary: %d\n", binr);
214 POOL_DEBUG(SOLV_DEBUG_STATS, " normal: %d, %d literals\n", solv->nrules - 1 - binr, lits);
225 hashrule(Solver *solv, Id p, Id d, int n)
227 unsigned int x = (unsigned int)p;
231 return (x * 37) ^ (unsigned int)d;
232 dp = solv->pool->whatprovidesdata + d;
234 x = (x * 37) ^ (unsigned int)*dp++;
240 /*-------------------------------------------------------------------
247 * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
249 * p < 0 : pkg id of A
250 * d > 0 : Offset in whatprovidesdata (list of providers of b)
252 * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
253 * p < 0 : pkg id of A
254 * p2 < 0 : Id of solvable (e.g. B1)
256 * d == 0, p2 == 0: unary rule, assertion => (A) or (-A)
258 * Install: p > 0, d = 0 (A) user requested install
259 * Remove: p < 0, d = 0 (-A) user requested remove (also: uninstallable)
260 * Requires: p < 0, d > 0 (-A|B1|B2|...) d: <list of providers for requirement of p>
261 * Updates: p > 0, d > 0 (A|B1|B2|...) d: <list of updates for solvable p>
262 * Conflicts: p < 0, p2 < 0 (-A|-B) either p (conflict issuer) or d (conflict provider) (binary rule)
263 * also used for obsoletes
264 * No-op ?: p = 0, d = 0 (null) (used as placeholder in update/feature rules)
268 * Direct assertion (no watch needed) --> d = 0, w1 = p, w2 = 0
269 * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
270 * every other : w1 = p, w2 = whatprovidesdata[d];
272 * always returns a rule for non-pkg rules
276 solver_addrule(Solver *solv, Id p, Id p2, Id d)
278 Pool *pool = solv->pool;
283 assert(!p2 && d > 0);
284 if (!pool->whatprovidesdata[d])
286 else if (!pool->whatprovidesdata[d + 1])
288 p2 = pool->whatprovidesdata[d];
293 /* now we have two cases:
294 * 1 or 2 literals: d = 0, p, p2 contain the literals
295 * 3 or more literals: d > 0, p2 == 0, d is offset into whatprovidesdata
298 /* it often happenes that requires lead to adding the same pkg rule
299 * multiple times, so we prune those duplicates right away to make
300 * the work for unifyrules a bit easier */
301 if (!solv->pkgrules_end) /* we add pkg rules */
303 r = solv->rules + solv->nrules - 1;
307 /* check if rule is identical */
313 dp2 = pool->whatprovidesdata + r->d;
314 for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
320 /* check if rule is self-fulfilling */
321 for (dp = pool->whatprovidesdata + d; *dp; dp++)
323 return 0; /* rule is self-fulfilling */
329 Id o = p; /* switch p1 and p2 */
333 if (r->p == p && !r->d && r->w2 == p2)
336 return 0; /* rule is self-fulfilling */
340 solv->rules = solv_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
341 r = solv->rules + solv->nrules++; /* point to rule space */
345 r->w2 = d ? pool->whatprovidesdata[d] : p2;
348 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
350 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " Add rule: ");
351 solver_printrule(solv, SOLV_DEBUG_RULE_CREATION, r);
358 solver_shrinkrules(Solver *solv, int nrules)
360 solv->nrules = nrules;
361 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
364 /******************************************************************************
366 *** pkg rule part: create rules representing the package dependencies
371 * special multiversion patch conflict handling:
372 * a patch conflict is also satisfied if some other
373 * version with the same name/arch that doesn't conflict
374 * gets installed. The generated rule is thus:
375 * -patch|-cpack|opack1|opack2|...
378 makemultiversionconflict(Solver *solv, Id n, Id con)
380 Pool *pool = solv->pool;
385 sn = pool->solvables + n;
386 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
388 FOR_PROVIDES(p, pp, sn->name)
390 s = pool->solvables + p;
391 if (s->name != sn->name || s->arch != sn->arch)
393 if (!MAPTST(&solv->multiversion, p))
395 if (pool_match_nevr(pool, pool->solvables + p, con))
397 /* here we have a multiversion solvable that doesn't conflict */
398 /* thus we're not in conflict if it is installed */
402 n = 0; /* no other package found, normal conflict handling */
404 n = pool_queuetowhatprovides(pool, &q);
410 addpkgrule(Solver *solv, Id p, Id p2, Id d, int type, Id dep)
412 if (!solv->ruleinfoq)
413 solver_addrule(solv, p, p2, d);
415 addpkgruleinfo(solv, p, p2, d, type, dep);
418 #ifdef ENABLE_LINKED_PKGS
421 addlinks(Solver *solv, Solvable *s, Id req, Queue *qr, Id prv, Queue *qp, Map *m, Queue *workq)
423 Pool *pool = solv->pool;
428 printf("ADDLINKS %s\n -> %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
429 for (i = 0; i < qr->count; i++)
430 printf(" - %s\n", pool_solvid2str(pool, qr->elements[i]));
431 printf(" <- %s\n", pool_dep2str(pool, prv));
432 for (i = 0; i < qp->count; i++)
433 printf(" - %s\n", pool_solvid2str(pool, qp->elements[i]));
437 addpkgrule(solv, -(s - pool->solvables), qr->elements[0], 0, SOLVER_RULE_PKG_REQUIRES, req);
439 addpkgrule(solv, -(s - pool->solvables), 0, pool_queuetowhatprovides(pool, qr), SOLVER_RULE_PKG_REQUIRES, req);
442 Id d = pool_queuetowhatprovides(pool, qp);
443 for (i = 0; i < qr->count; i++)
444 addpkgrule(solv, -qr->elements[i], 0, d, SOLVER_RULE_PKG_REQUIRES, prv);
448 for (i = 0; i < qr->count; i++)
449 addpkgrule(solv, -qr->elements[i], qp->elements[0], 0, SOLVER_RULE_PKG_REQUIRES, prv);
452 return; /* nothing more to do if called from getpkgruleinfos() */
453 for (i = 0; i < qr->count; i++)
454 if (!MAPTST(m, qr->elements[i]))
455 queue_push(workq, qr->elements[i]);
456 for (i = 0; i < qp->count; i++)
457 if (!MAPTST(m, qp->elements[i]))
458 queue_push(workq, qp->elements[i]);
459 if (solv->installed && s->repo == solv->installed)
461 Repo *installed = solv->installed;
462 /* record installed buddies */
463 if (!solv->instbuddy)
464 solv->instbuddy = solv_calloc(installed->end - installed->start, sizeof(Id));
466 solv->instbuddy[s - pool->solvables - installed->start] = qr->elements[0];
467 for (i = 0; i < qr->count; i++)
469 Id p = qr->elements[i];
470 if (pool->solvables[p].repo != installed)
472 if (qp->count > 1 || (solv->instbuddy[p - installed->start] != 0 && solv->instbuddy[p - installed->start] != s - pool->solvables))
473 solv->instbuddy[p - installed->start] = 1; /* 1: ambiguous buddy */
475 solv->instbuddy[p - installed->start] = s - pool->solvables;
481 add_package_link(Solver *solv, Solvable *s, Map *m, Queue *workq)
487 find_package_link(solv->pool, s, &req, &qr, &prv, &qp);
489 addlinks(solv, s, req, &qr, prv, &qp, m, workq);
496 #ifdef ENABLE_COMPLEX_DEPS
499 add_complex_deprules(Solver *solv, Id p, Id dep, int type, int dontfix, Queue *workq, Map *m)
501 Pool *pool = solv->pool;
502 Repo *installed = solv->installed;
507 flags = dontfix ? CPLXDEPS_DONTFIX : 0;
508 /* CNF expansion for requires, DNF + INVERT expansion for conflicts */
509 if (type == SOLVER_RULE_PKG_CONFLICTS)
510 flags |= CPLXDEPS_TODNF | CPLXDEPS_EXPAND | CPLXDEPS_INVERT;
512 i = pool_normalize_complex_dep(pool, dep, &bq, flags);
513 /* handle special cases */
518 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken dependency %s of installed package %s\n", pool_dep2str(pool, dep), pool_solvid2str(pool, p));
522 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvid2str(pool, p), p, pool_dep2str(pool, dep));
523 addpkgrule(solv, -p, 0, 0, type == SOLVER_RULE_PKG_REQUIRES ? SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP : type, dep);
534 /* go through all blocks and add a rule for each block */
535 for (i = 0; i < bq.count; i++)
539 if (bq.elements[i] == pool->nsolvables)
541 /* conventional requires (cannot be a conflicts as they have been expanded) */
542 Id *dp = pool->whatprovidesdata + bq.elements[i + 1];
546 for (j = 0; dp[j] != 0; j++)
547 if (pool->solvables[dp[j]].repo == installed)
548 break; /* provider was installed */
552 /* check if the rule contains both p and -p */
553 for (j = 0; dp[j] != 0; j++)
558 addpkgrule(solv, -p, 0, dp - pool->whatprovidesdata, SOLVER_RULE_PKG_REQUIRES, dep);
559 /* push all non-visited providers on the work queue */
563 queue_push(workq, *dp);
566 if (!bq.elements[i + 1])
568 Id p2 = bq.elements[i++];
569 /* simple rule with just two literals, we'll add a (-p, p2) rule */
572 if (p2 < 0 && pool->solvables[-p2].repo == installed)
574 if (p2 > 0 && pool->solvables[p2].repo != installed)
579 if (type == SOLVER_RULE_PKG_CONFLICTS)
581 if (pool->forbidselfconflicts && !is_otherproviders_dep(pool, dep))
582 addpkgrule(solv, -p, 0, 0, SOLVER_RULE_PKG_SELF_CONFLICT, dep);
585 addpkgrule(solv, -p, 0, 0, type, dep);
588 /* check if the rule contains both p and -p */
591 addpkgrule(solv, -p, p2, 0, type, dep);
592 if (m && p2 > 0 && !MAPTST(m, p2))
593 queue_push(workq, p2);
600 qele = bq.elements + i;
602 while (bq.elements[i])
607 for (j = 0; j < qcnt; j++)
609 if (qele[j] > 0 && pool->solvables[qele[j]].repo == installed)
611 if (qele[j] < 0 && pool->solvables[-qele[j]].repo != installed)
617 /* add -p to (ordered) rule (overwriting the trailing zero) */
620 if (j == qcnt || qele[j] > -p)
623 memmove(qele + j + 1, qele + j, (qcnt - j) * sizeof(Id));
631 /* check if the rule contains both p and -p */
632 for (j = 0; j < qcnt; j++)
637 addpkgrule(solv, qele[0], 0, pool_ids2whatprovides(pool, qele + 1, qcnt - 1), type, dep);
639 for (j = 0; j < qcnt; j++)
640 if (qele[j] > 0 && !MAPTST(m, qele[j]))
641 queue_push(workq, qele[j]);
649 /*-------------------------------------------------------------------
651 * add (install) rules for solvable
653 * s: Solvable for which to add rules
654 * m: m[s] = 1 for solvables which have rules, prevent rule duplication
656 * Algorithm: 'visit all nodes of a graph'. The graph nodes are
657 * solvables, the edges their dependencies.
658 * Starting from an installed solvable, this will create all rules
659 * representing the graph created by the solvables dependencies.
661 * for unfulfilled requirements, conflicts, obsoletes,....
662 * add a negative assertion for solvables that are not installable
664 * It will also create rules for all solvables referenced by 's'
665 * i.e. descend to all providers of requirements of 's'
670 solver_addpkgrulesforsolvable(Solver *solv, Solvable *s, Map *m)
672 Pool *pool = solv->pool;
673 Repo *installed = solv->installed;
675 Queue workq; /* list of solvables we still have to work on */
679 int dontfix; /* ignore dependency errors for installed solvables */
685 Id p, pp; /* whatprovides loops */
686 Id *dp; /* ptr to 'whatprovides' */
687 Id n; /* Id for current solvable 's' */
689 queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
690 queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
692 /* loop until there's no more work left */
697 * s: Pointer to solvable
700 n = queue_shift(&workq); /* 'pop' next solvable to work on from queue */
703 if (MAPTST(m, n)) /* continue if already visited */
705 MAPSET(m, n); /* mark as visited */
708 s = pool->solvables + n;
711 if (installed /* Installed system available */
712 && s->repo == installed /* solvable is installed */
713 && !solv->fixmap_all /* NOT repair errors in dependency graph */
714 && !(solv->fixmap.size && MAPTST(&solv->fixmap, n - installed->start)))
716 dontfix = 1; /* dont care about broken deps */
721 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC
722 ? pool_disabled_solvable(pool, s)
723 : !pool_installable(pool, s))
725 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", pool_solvid2str(pool, n), n);
726 addpkgrule(solv, -n, 0, 0, SOLVER_RULE_PKG_NOT_INSTALLABLE, 0);
730 #ifdef ENABLE_LINKED_PKGS
731 /* add pseudo-package <-> real-package links */
732 if (has_package_link(pool, s))
733 add_package_link(solv, s, m, &workq);
736 /*-----------------------------------------
737 * check requires of s
742 reqp = s->repo->idarraydata + s->requires;
743 while ((req = *reqp++) != 0) /* go through all requires */
745 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
748 #ifdef ENABLE_COMPLEX_DEPS
749 if (pool_is_complex_dep(pool, req))
751 /* we have AND/COND deps, normalize */
752 add_complex_deprules(solv, n, req, SOLVER_RULE_PKG_REQUIRES, dontfix, &workq, m);
757 /* find list of solvables providing 'req' */
758 dp = pool_whatprovides_ptr(pool, req);
760 if (*dp == SYSTEMSOLVABLE) /* always installed */
765 /* the strategy here is to not insist on dependencies
766 * that are already broken. so if we find one provider
767 * that was already installed, we know that the
768 * dependency was not broken before so we enforce it */
769 for (i = 0; (p = dp[i]) != 0; i++)
770 if (pool->solvables[p].repo == installed)
771 break; /* found installed provider */
774 /* didn't find an installed provider: previously broken dependency */
775 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s));
782 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvid2str(pool, n), n, pool_dep2str(pool, req));
783 addpkgrule(solv, -n, 0, 0, SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP, req);
787 for (i = 0; dp[i] != 0; i++)
791 continue; /* provided by itself, no need to add rule */
793 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
795 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION," %s requires %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
796 for (i = 0; dp[i]; i++)
797 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " provided by %s\n", pool_solvid2str(pool, dp[i]));
800 /* add 'requires' dependency */
801 /* rule: (-requestor|provider1|provider2|...|providerN) */
802 addpkgrule(solv, -n, 0, dp - pool->whatprovidesdata, SOLVER_RULE_PKG_REQUIRES, req);
804 /* push all non-visited providers on the work queue */
808 queue_push(&workq, *dp);
812 /* that's all we check for src packages */
813 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
816 /*-----------------------------------------
817 * check conflicts of s
824 /* we treat conflicts in patches a bit differen:
826 * - multiversion handling
827 * XXX: we should really handle this different, looking
828 * at the name is a bad hack
830 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
832 conp = s->repo->idarraydata + s->conflicts;
833 /* foreach conflicts of 's' */
834 while ((con = *conp++) != 0)
836 #ifdef ENABLE_COMPLEX_DEPS
837 if (!ispatch && pool_is_complex_dep(pool, con))
839 /* we have AND/COND deps, normalize */
840 add_complex_deprules(solv, n, con, SOLVER_RULE_PKG_CONFLICTS, dontfix, &workq, m);
844 /* foreach providers of a conflict of 's' */
845 FOR_PROVIDES(p, pp, con)
847 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
849 /* dontfix: dont care about conflicts with already installed packs */
850 if (dontfix && pool->solvables[p].repo == installed)
852 if (p == n) /* p == n: self conflict */
854 if (!pool->forbidselfconflicts || is_otherproviders_dep(pool, con))
856 addpkgrule(solv, -n, 0, 0, SOLVER_RULE_PKG_SELF_CONFLICT, con);
859 if (ispatch && solv->multiversion.size && MAPTST(&solv->multiversion, p) && ISRELDEP(con))
861 /* our patch conflicts with a multiversion package */
862 Id d = makemultiversionconflict(solv, p, con);
865 addpkgrule(solv, -n, 0, d, SOLVER_RULE_PKG_CONFLICTS, con);
869 if (p == SYSTEMSOLVABLE)
871 /* rule: -n|-p: either solvable _or_ provider of conflict */
872 addpkgrule(solv, -n, -p, 0, SOLVER_RULE_PKG_CONFLICTS, con);
877 /*-----------------------------------------
878 * check obsoletes and implicit obsoletes of a package
879 * if ignoreinstalledsobsoletes is not set, we're also checking
880 * obsoletes of installed packages (like newer rpm versions)
882 if ((!installed || s->repo != installed) || !pool->noinstalledobsoletes)
884 int multi = solv->multiversion.size && MAPTST(&solv->multiversion, n);
885 int isinstalled = (installed && s->repo == installed);
886 if (s->obsoletes && (!multi || solv->keepexplicitobsoletes))
888 obsp = s->repo->idarraydata + s->obsoletes;
889 /* foreach obsoletes */
890 while ((obs = *obsp++) != 0)
892 /* foreach provider of an obsoletes of 's' */
893 FOR_PROVIDES(p, pp, obs)
895 Solvable *ps = pool->solvables + p;
898 if (isinstalled && dontfix && ps->repo == installed)
899 continue; /* don't repair installed/installed problems */
900 if (!pool->obsoleteusesprovides /* obsoletes are matched names, not provides */
901 && !pool_match_nevr(pool, ps, obs))
903 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
905 if (p == SYSTEMSOLVABLE)
908 addpkgrule(solv, -n, -p, 0, SOLVER_RULE_PKG_OBSOLETES, obs);
910 addpkgrule(solv, -n, -p, 0, SOLVER_RULE_PKG_INSTALLED_OBSOLETES, obs);
914 /* check implicit obsoletes
915 * for installed packages we only need to check installed/installed problems (and
916 * only when dontfix is not set), as the others are picked up when looking at the
917 * uninstalled package.
919 if (!isinstalled || !dontfix)
921 FOR_PROVIDES(p, pp, s->name)
923 Solvable *ps = pool->solvables + p;
926 if (isinstalled && ps->repo != installed)
928 /* we still obsolete packages with same nevra, like rpm does */
929 /* (actually, rpm mixes those packages. yuck...) */
930 if (multi && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
932 if (isinstalled || ps->repo != installed)
934 /* also check the installed package for multi-ness */
935 if (MAPTST(&solv->multiversion, p))
938 if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
940 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
942 if (p == SYSTEMSOLVABLE)
944 if (s->name == ps->name)
946 /* optimization: do not add the same-name conflict rule if it was
947 * already added when we looked at the other package.
948 * (this assumes pool_colormatch is symmetric) */
949 if (p && m && ps->repo != installed && MAPTST(m, p) &&
950 (ps->arch != ARCH_SRC && ps->arch != ARCH_NOSRC) &&
951 !(solv->multiversion.size && MAPTST(&solv->multiversion, p)))
953 addpkgrule(solv, -n, -p, 0, SOLVER_RULE_PKG_SAME_NAME, 0);
956 addpkgrule(solv, -n, -p, 0, SOLVER_RULE_PKG_IMPLICIT_OBSOLETES, s->name);
961 if (m && pool->implicitobsoleteusescolors && (s->arch > pool->lastarch || pool->id2arch[s->arch] != 1))
963 int a = pool->id2arch[s->arch];
964 /* check lock-step candidates */
965 FOR_PROVIDES(p, pp, s->name)
967 Solvable *ps = pool->solvables + p;
968 if (s->name != ps->name || s->evr != ps->evr || MAPTST(m, p))
970 if (ps->arch > pool->lastarch || pool->id2arch[ps->arch] == 1 || pool->id2arch[ps->arch] >= a)
972 queue_push(&workq, p);
976 /*-----------------------------------------
977 * add recommends/suggests to the work queue
979 if (s->recommends && m)
981 recp = s->repo->idarraydata + s->recommends;
982 while ((rec = *recp++) != 0)
984 #ifdef ENABLE_COMPLEX_DEPS
985 if (pool_is_complex_dep(pool, rec))
987 pool_add_pos_literals_complex_dep(pool, rec, &workq, m, 0);
991 FOR_PROVIDES(p, pp, rec)
993 queue_push(&workq, p);
996 if (s->suggests && m)
998 sugp = s->repo->idarraydata + s->suggests;
999 while ((sug = *sugp++) != 0)
1001 #ifdef ENABLE_COMPLEX_DEPS
1002 if (pool_is_complex_dep(pool, sug))
1004 pool_add_pos_literals_complex_dep(pool, sug, &workq, m, 0);
1008 FOR_PROVIDES(p, pp, sug)
1010 queue_push(&workq, p);
1017 #ifdef ENABLE_LINKED_PKGS
1019 solver_addpkgrulesforlinked(Solver *solv, Map *m)
1021 Pool *pool = solv->pool;
1027 for (i = 1; i < pool->nsolvables; i++)
1031 s = pool->solvables + i;
1032 if (!s->repo || s->repo == solv->installed)
1034 if (!strchr(pool_id2str(pool, s->name), ':'))
1036 if (!pool_installable(pool, s))
1038 find_package_link(pool, s, 0, &qr, 0, 0);
1041 for (j = 0; j < qr.count; j++)
1042 if (MAPTST(m, qr.elements[j]))
1044 solver_addpkgrulesforsolvable(solv, s, m);
1054 /*-------------------------------------------------------------------
1056 * Add rules for packages possibly selected in by weak dependencies
1058 * m: already added solvables
1062 solver_addpkgrulesforweak(Solver *solv, Map *m)
1064 Pool *pool = solv->pool;
1069 /* foreach solvable in pool */
1070 for (i = n = 1; n < pool->nsolvables; i++, n++)
1072 if (i == pool->nsolvables) /* wrap i */
1074 if (MAPTST(m, i)) /* already added that one */
1077 s = pool->solvables + i;
1080 if (s->repo != pool->installed && !pool_installable(pool, s))
1081 continue; /* only look at installable ones */
1086 /* find possible supplements */
1087 supp = s->repo->idarraydata + s->supplements;
1088 while ((sup = *supp++) != 0)
1089 if (dep_possible(solv, sup, m))
1093 /* if nothing found, check for enhances */
1094 if (!sup && s->enhances)
1096 supp = s->repo->idarraydata + s->enhances;
1097 while ((sup = *supp++) != 0)
1098 if (dep_possible(solv, sup, m))
1101 /* if nothing found, goto next solvables */
1104 solver_addpkgrulesforsolvable(solv, s, m);
1105 n = 0; /* check all solvables again because we added solvables to m */
1110 /*-------------------------------------------------------------------
1112 * add package rules for possible updates
1115 * m: map of already visited solvables
1116 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1120 solver_addpkgrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
1122 Pool *pool = solv->pool;
1124 /* queue and buffer for it */
1128 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1129 /* find update candidates for 's' */
1130 policy_findupdatepackages(solv, s, &qs, allow_all);
1131 /* add rule for 's' if not already done */
1132 if (!MAPTST(m, s - pool->solvables))
1133 solver_addpkgrulesforsolvable(solv, s, m);
1134 /* foreach update candidate, add rule if not already done */
1135 for (i = 0; i < qs.count; i++)
1136 if (!MAPTST(m, qs.elements[i]))
1137 solver_addpkgrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
1142 /***********************************************************************
1144 *** Update/Feature rule part
1146 *** Those rules make sure an installed package isn't silently deleted
1151 finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
1153 Pool *pool = solv->pool;
1156 policy_findupdatepackages(solv, s, qs, allow_all ? allow_all : 2);
1160 return 0; /* orphaned, don't create feature rule */
1161 /* check if this is an orphaned package */
1162 policy_findupdatepackages(solv, s, qs, 1);
1164 return 0; /* orphaned, don't create update rule */
1166 return -SYSTEMSOLVABLE; /* supported but not installable */
1169 return s - pool->solvables;
1170 /* check if it is ok to keep the installed package */
1171 if (solv->dupmap.size && MAPTST(&solv->dupmap, s - pool->solvables))
1172 return s - pool->solvables;
1173 for (i = 0; i < qs->count; i++)
1175 Solvable *ns = pool->solvables + qs->elements[i];
1176 if (s->evr == ns->evr && solvable_identical(s, ns))
1177 return s - pool->solvables;
1179 /* nope, it must be some other package */
1180 return -SYSTEMSOLVABLE;
1184 /* add packages from the dup repositories to the update candidates
1185 * this isn't needed for the global dup mode as all packages are
1186 * from dup repos in that case */
1188 addduppackages(Solver *solv, Solvable *s, Queue *qs)
1193 int oldnoupdateprovide = solv->noupdateprovide;
1195 queue_init_buffer(&dupqs, dupqsbuf, sizeof(dupqsbuf)/sizeof(*dupqsbuf));
1196 solv->noupdateprovide = 1;
1197 policy_findupdatepackages(solv, s, &dupqs, 2);
1198 solv->noupdateprovide = oldnoupdateprovide;
1199 for (i = 0; i < dupqs.count; i++)
1201 p = dupqs.elements[i];
1202 if (MAPTST(&solv->dupmap, p))
1203 queue_pushunique(qs, p);
1209 /*-------------------------------------------------------------------
1211 * add rule for update
1212 * (A|A1|A2|A3...) An = update candidates for A
1214 * s = (installed) solvable
1218 solver_addupdaterule(Solver *solv, Solvable *s, int allow_all)
1220 /* installed packages get a special upgrade allowed rule */
1221 Pool *pool = solv->pool;
1227 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1228 p = s - pool->solvables;
1229 /* find update candidates for 's' */
1230 if (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1231 p = finddistupgradepackages(solv, s, &qs, allow_all);
1233 policy_findupdatepackages(solv, s, &qs, allow_all);
1235 #ifdef ENABLE_LINKED_PKGS
1236 if (solv->instbuddy && solv->instbuddy[s - pool->solvables - solv->installed->start])
1238 const char *name = pool_id2str(pool, s->name);
1239 if (strncmp(name, "pattern:", 8) == 0 || strncmp(name, "application:", 12) == 0)
1241 /* a linked pseudo package. As it is linked, we do not need an update/feature rule */
1242 /* nevertheless we set specialupdaters so we can update */
1243 solver_addrule(solv, 0, 0, 0);
1244 if (!allow_all && qs.count)
1246 if (p != -SYSTEMSOLVABLE)
1247 queue_unshift(&qs, p);
1248 if (!solv->specialupdaters)
1249 solv->specialupdaters = solv_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
1250 solv->specialupdaters[s - pool->solvables - solv->installed->start] = pool_queuetowhatprovides(pool, &qs);
1258 if (!allow_all && !p) /* !p implies qs.count == 0 */
1260 queue_push(&solv->orphaned, s - pool->solvables); /* an orphaned package */
1261 if (solv->keep_orphans && !(solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, s - pool->solvables - solv->installed->start))))
1262 p = s - pool->solvables; /* keep this orphaned package installed */
1264 solver_addrule(solv, p, 0, 0);
1268 if (!allow_all && qs.count && solv->multiversion.size)
1272 for (i = 0; i < qs.count; i++)
1273 if (MAPTST(&solv->multiversion, qs.elements[i]))
1277 /* filter out all multiversion packages as they don't update */
1278 d = pool_queuetowhatprovides(pool, &qs); /* save qs away */
1279 for (j = i; i < qs.count; i++)
1281 if (MAPTST(&solv->multiversion, qs.elements[i]))
1283 Solvable *ps = pool->solvables + qs.elements[i];
1284 /* if keepexplicitobsoletes is set and the name is different,
1285 * we assume that there is an obsoletes. XXX: not 100% correct */
1286 if (solv->keepexplicitobsoletes && ps->name != s->name)
1288 qs.elements[j++] = qs.elements[i];
1291 /* it's ok if they have same nevra */
1292 if (ps->name != s->name || ps->evr != s->evr || ps->arch != s->arch)
1295 qs.elements[j++] = qs.elements[i];
1297 if (j < qs.count) /* filtered at least one package? */
1299 if (j == 0 && p == -SYSTEMSOLVABLE)
1301 /* this is a multiversion orphan */
1302 queue_push(&solv->orphaned, s - pool->solvables);
1303 if (!solv->specialupdaters)
1304 solv->specialupdaters = solv_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
1305 solv->specialupdaters[s - pool->solvables - solv->installed->start] = d;
1306 if (solv->keep_orphans && !(solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, s - pool->solvables - solv->installed->start))))
1308 /* we need to keep the orphan */
1310 solver_addrule(solv, s - pool->solvables, 0, 0);
1313 /* we can drop it as long as we update */
1315 j = qs.count; /* force the update */
1319 else if (p != -SYSTEMSOLVABLE)
1321 /* could fallthrough, but then we would do pool_queuetowhatprovides twice */
1323 solver_addrule(solv, s - pool->solvables, 0, d); /* allow update of s */
1328 if (!isorphaned && p == -SYSTEMSOLVABLE && solv->dupmap.size)
1329 p = s - pool->solvables; /* let the dup rules sort it out */
1330 if (qs.count && p == -SYSTEMSOLVABLE)
1331 p = queue_shift(&qs);
1334 d = pool_queuetowhatprovides(pool, &qs);
1336 solver_addrule(solv, p, 0, d); /* allow update of s */
1340 d = qs.count ? qs.elements[0] : 0;
1342 solver_addrule(solv, p, d, 0); /* allow update of s */
1347 disableupdaterule(Solver *solv, Id p)
1351 MAPSET(&solv->noupdate, p - solv->installed->start);
1352 r = solv->rules + solv->updaterules + (p - solv->installed->start);
1353 if (r->p && r->d >= 0)
1354 solver_disablerule(solv, r);
1355 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1356 if (r->p && r->d >= 0)
1357 solver_disablerule(solv, r);
1358 if (solv->bestrules_pkg)
1361 ni = solv->bestrules_end - solv->bestrules;
1362 for (i = 0; i < ni; i++)
1363 if (solv->bestrules_pkg[i] == p)
1364 solver_disablerule(solv, solv->rules + solv->bestrules + i);
1369 reenableupdaterule(Solver *solv, Id p)
1371 Pool *pool = solv->pool;
1374 MAPCLR(&solv->noupdate, p - solv->installed->start);
1375 r = solv->rules + solv->updaterules + (p - solv->installed->start);
1380 solver_enablerule(solv, r);
1381 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1383 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1384 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1390 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1391 if (r->p && r->d < 0)
1393 solver_enablerule(solv, r);
1394 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1396 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1397 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1401 if (solv->bestrules_pkg)
1404 ni = solv->bestrules_end - solv->bestrules;
1405 for (i = 0; i < ni; i++)
1406 if (solv->bestrules_pkg[i] == p)
1407 solver_enablerule(solv, solv->rules + solv->bestrules + i);
1412 /***********************************************************************
1414 *** Infarch rule part
1416 *** Infarch rules make sure the solver uses the best architecture of
1417 *** a package if multiple archetectures are available
1422 solver_addinfarchrules(Solver *solv, Map *addedmap)
1424 Pool *pool = solv->pool;
1425 Repo *installed = pool->installed;
1427 Id p, pp, a, aa, bestarch;
1428 Solvable *s, *ps, *bests;
1429 Queue badq, allowedarchs;
1433 queue_init(&allowedarchs);
1435 solv->infarchrules = solv->nrules;
1436 for (i = 1; i < pool->nsolvables; i++)
1438 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1440 s = pool->solvables + i;
1444 queue_empty(&allowedarchs);
1445 FOR_PROVIDES(p, pp, s->name)
1447 ps = pool->solvables + p;
1448 if (ps->name != s->name || !MAPTST(addedmap, p))
1455 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1456 if (a != 1 && installed && ps->repo == installed)
1458 if (!solv->dupmap_all && !(solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1459 queue_pushunique(&allowedarchs, ps->arch); /* also ok to keep this architecture */
1460 continue; /* ignore installed solvables when calculating the best arch */
1462 if (a && a != 1 && (!bestarch || a < bestarch))
1471 /* speed up common case where installed package already has best arch */
1472 if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch)
1473 allowedarchs.count--; /* installed arch is best */
1475 if (allowedarchs.count && pool->implicitobsoleteusescolors && installed && bestarch)
1477 /* need an extra pass for lockstep checking: we only allow to keep an inferior arch
1478 * if the corresponding installed package is not lock-stepped */
1479 queue_empty(&allowedarchs);
1480 FOR_PROVIDES(p, pp, s->name)
1483 ps = pool->solvables + p;
1484 if (ps->name != s->name || ps->repo != installed || !MAPTST(addedmap, p))
1486 if (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1489 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1492 queue_pushunique(&allowedarchs, ps->arch); /* strange arch, allow */
1495 if (a == 1 || ((a ^ bestarch) & 0xffff0000) == 0)
1497 /* have installed package with inferior arch, check if lock-stepped */
1498 FOR_PROVIDES(p2, pp2, s->name)
1500 Solvable *s2 = pool->solvables + p2;
1502 if (p2 == p || s2->name != s->name || s2->evr != pool->solvables[p].evr || s2->arch == pool->solvables[p].arch)
1505 a2 = (a2 <= pool->lastarch) ? pool->id2arch[a2] : 0;
1506 if (a2 && (a2 == 1 || ((a2 ^ bestarch) & 0xffff0000) == 0))
1510 queue_pushunique(&allowedarchs, ps->arch);
1514 /* find all bad packages */
1516 FOR_PROVIDES(p, pp, s->name)
1518 ps = pool->solvables + p;
1519 if (ps->name != s->name || !MAPTST(addedmap, p))
1522 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1523 if (a != 1 && bestarch && ((a ^ bestarch) & 0xffff0000) != 0)
1525 if (installed && ps->repo == installed)
1527 if (pool->implicitobsoleteusescolors)
1528 queue_push(&badq, p); /* special lock-step handling, see below */
1529 continue; /* always ok to keep an installed package */
1531 for (j = 0; j < allowedarchs.count; j++)
1533 aa = allowedarchs.elements[j];
1536 aa = (aa <= pool->lastarch) ? pool->id2arch[aa] : 0;
1537 if (aa && ((a ^ aa) & 0xffff0000) == 0)
1538 break; /* compatible */
1540 if (j == allowedarchs.count)
1541 queue_push(&badq, p);
1545 /* block all solvables in the badq! */
1546 for (j = 0; j < badq.count; j++)
1548 p = badq.elements[j];
1550 if (pool->implicitobsoleteusescolors)
1553 int haveinstalled = 0;
1555 FOR_PROVIDES(p2, pp, s->name)
1557 Solvable *s2 = pool->solvables + p2;
1558 if (p2 == p || s2->name != s->name || s2->evr != pool->solvables[p].evr || s2->arch == pool->solvables[p].arch)
1561 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1562 if (a && (a == 1 || ((a ^ bestarch) & 0xffff000) == 0))
1564 queue_push(&lsq, p2);
1565 if (installed && s2->repo == installed)
1569 if (installed && pool->solvables[p].repo == installed && !haveinstalled)
1570 continue; /* installed package not in lock-step */
1573 solver_addrule(solv, -p, lsq.count ? lsq.elements[0] : 0, 0);
1575 solver_addrule(solv, -p, 0, pool_queuetowhatprovides(pool, &lsq));
1580 queue_free(&allowedarchs);
1581 solv->infarchrules_end = solv->nrules;
1585 disableinfarchrule(Solver *solv, Id name)
1587 Pool *pool = solv->pool;
1590 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1592 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1593 solver_disablerule(solv, r);
1598 reenableinfarchrule(Solver *solv, Id name)
1600 Pool *pool = solv->pool;
1603 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1605 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1607 solver_enablerule(solv, r);
1608 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1610 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1611 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1618 /***********************************************************************
1622 *** Dup rules make sure a package is selected from the specified dup
1623 *** repositories if an update candidate is included in one of them.
1628 add_cleandeps_package(Solver *solv, Id p)
1630 if (!solv->cleandeps_updatepkgs)
1632 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
1633 queue_init(solv->cleandeps_updatepkgs);
1635 queue_pushunique(solv->cleandeps_updatepkgs, p);
1639 solver_addtodupmaps(Solver *solv, Id p, Id how, int targeted)
1641 Pool *pool = solv->pool;
1642 Solvable *ps, *s = pool->solvables + p;
1643 Repo *installed = solv->installed;
1644 Id pi, pip, obs, *obsp;
1646 MAPSET(&solv->dupinvolvedmap, p);
1648 MAPSET(&solv->dupmap, p);
1649 FOR_PROVIDES(pi, pip, s->name)
1651 ps = pool->solvables + pi;
1652 if (ps->name != s->name)
1654 MAPSET(&solv->dupinvolvedmap, pi);
1655 if (targeted && ps->repo == installed && solv->obsoletes && solv->obsoletes[pi - installed->start])
1658 for (opp = solv->obsoletes_data + solv->obsoletes[pi - installed->start]; (pi2 = *opp++) != 0;)
1659 if (pool->solvables[pi2].repo != installed)
1660 MAPSET(&solv->dupinvolvedmap, pi2);
1662 if (ps->repo == installed && (how & SOLVER_FORCEBEST) != 0)
1664 if (!solv->bestupdatemap.size)
1665 map_grow(&solv->bestupdatemap, installed->end - installed->start);
1666 MAPSET(&solv->bestupdatemap, pi - installed->start);
1668 if (ps->repo == installed && (how & SOLVER_CLEANDEPS) != 0)
1669 add_cleandeps_package(solv, pi);
1670 if (!targeted && ps->repo != installed)
1671 MAPSET(&solv->dupmap, pi);
1673 if (s->repo == installed && solv->obsoletes && solv->obsoletes[p - installed->start])
1676 for (opp = solv->obsoletes_data + solv->obsoletes[p - installed->start]; (pi = *opp++) != 0;)
1678 ps = pool->solvables + pi;
1679 if (ps->repo == installed)
1681 MAPSET(&solv->dupinvolvedmap, pi);
1683 MAPSET(&solv->dupmap, pi);
1686 if (targeted && s->repo != installed && s->obsoletes)
1688 /* XXX: check obsoletes/provides combination */
1689 obsp = s->repo->idarraydata + s->obsoletes;
1690 while ((obs = *obsp++) != 0)
1692 FOR_PROVIDES(pi, pip, obs)
1694 Solvable *ps = pool->solvables + pi;
1695 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1697 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1699 MAPSET(&solv->dupinvolvedmap, pi);
1700 if (targeted && ps->repo == installed && solv->obsoletes && solv->obsoletes[pi - installed->start])
1703 for (opp = solv->obsoletes_data + solv->obsoletes[pi - installed->start]; (pi2 = *opp++) != 0;)
1704 if (pool->solvables[pi2].repo != installed)
1705 MAPSET(&solv->dupinvolvedmap, pi2);
1707 if (ps->repo == installed && (how & SOLVER_FORCEBEST) != 0)
1709 if (!solv->bestupdatemap.size)
1710 map_grow(&solv->bestupdatemap, installed->end - installed->start);
1711 MAPSET(&solv->bestupdatemap, pi - installed->start);
1713 if (ps->repo == installed && (how & SOLVER_CLEANDEPS) != 0)
1714 add_cleandeps_package(solv, pi);
1721 solver_createdupmaps(Solver *solv)
1723 Queue *job = &solv->job;
1724 Pool *pool = solv->pool;
1725 Repo *installed = solv->installed;
1726 Id select, how, what, p, pp;
1730 map_init(&solv->dupmap, pool->nsolvables);
1731 map_init(&solv->dupinvolvedmap, pool->nsolvables);
1732 for (i = 0; i < job->count; i += 2)
1734 how = job->elements[i];
1735 select = job->elements[i] & SOLVER_SELECTMASK;
1736 what = job->elements[i + 1];
1737 switch (how & SOLVER_JOBMASK)
1739 case SOLVER_DISTUPGRADE:
1740 if (select == SOLVER_SOLVABLE_REPO)
1743 if (what <= 0 || what > pool->nrepos)
1745 repo = pool_id2repo(pool, what);
1748 if (repo != installed && !(how & SOLVER_TARGETED) && solv->noautotarget)
1750 targeted = repo != installed || (how & SOLVER_TARGETED) != 0;
1751 FOR_REPO_SOLVABLES(repo, p, s)
1753 if (repo != installed && !pool_installable(pool, s))
1755 solver_addtodupmaps(solv, p, how, targeted);
1758 else if (select == SOLVER_SOLVABLE_ALL)
1760 FOR_POOL_SOLVABLES(p)
1762 MAPSET(&solv->dupinvolvedmap, p);
1763 if (installed && pool->solvables[p].repo != installed)
1764 MAPSET(&solv->dupmap, p);
1769 targeted = how & SOLVER_TARGETED ? 1 : 0;
1770 if (installed && !targeted && !solv->noautotarget)
1772 FOR_JOB_SELECT(p, pp, select, what)
1773 if (pool->solvables[p].repo == installed)
1777 else if (!installed && !solv->noautotarget)
1779 FOR_JOB_SELECT(p, pp, select, what)
1781 Solvable *s = pool->solvables + p;
1784 if (s->repo != installed && !targeted)
1786 if (s->repo != installed && !pool_installable(pool, s))
1788 solver_addtodupmaps(solv, p, how, targeted);
1796 MAPCLR(&solv->dupinvolvedmap, SYSTEMSOLVABLE);
1800 solver_freedupmaps(Solver *solv)
1802 map_free(&solv->dupmap);
1803 /* we no longer free solv->dupinvolvedmap as we need it in
1804 * policy's priority pruning code. sigh. */
1808 solver_addduprules(Solver *solv, Map *addedmap)
1810 Pool *pool = solv->pool;
1811 Repo *installed = solv->installed;
1817 solv->duprules = solv->nrules;
1818 for (i = 1; i < pool->nsolvables; i++)
1820 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1822 s = pool->solvables + i;
1824 FOR_PROVIDES(p, pp, s->name)
1826 ps = pool->solvables + p;
1827 if (ps->name != s->name || !MAPTST(addedmap, p))
1833 if (!MAPTST(&solv->dupinvolvedmap, p))
1835 if (installed && ps->repo == installed)
1837 if (!solv->updatemap.size)
1838 map_grow(&solv->updatemap, installed->end - installed->start);
1839 MAPSET(&solv->updatemap, p - installed->start);
1840 if (!MAPTST(&solv->dupmap, p))
1843 /* is installed identical to a good one? */
1844 FOR_PROVIDES(ip, ipp, ps->name)
1846 Solvable *is = pool->solvables + ip;
1847 if (!MAPTST(&solv->dupmap, ip))
1849 if (is->evr == ps->evr && solvable_identical(ps, is))
1854 /* ok, found a good one. we may keep this package. */
1855 MAPSET(&solv->dupmap, p); /* for best rules processing */
1858 r = solv->rules + solv->updaterules + (p - installed->start);
1860 r = solv->rules + solv->featurerules + (p - installed->start);
1861 if (r->p && solv->specialupdaters && solv->specialupdaters[p - installed->start])
1863 /* this is a multiversion orphan, we're good if an update is installed */
1864 solver_addrule(solv, -p, 0, solv->specialupdaters[p - installed->start]);
1867 solver_addrule(solv, -p, 0, 0); /* no match, sorry */
1870 else if (!MAPTST(&solv->dupmap, p))
1871 solver_addrule(solv, -p, 0, 0);
1874 solv->duprules_end = solv->nrules;
1879 disableduprule(Solver *solv, Id name)
1881 Pool *pool = solv->pool;
1884 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1886 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1887 solver_disablerule(solv, r);
1892 reenableduprule(Solver *solv, Id name)
1894 Pool *pool = solv->pool;
1897 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1899 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1901 solver_enablerule(solv, r);
1902 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1904 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1905 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1912 /***********************************************************************
1914 *** Policy rule disabling/reenabling
1916 *** Disable all policy rules that conflict with our jobs. If a job
1917 *** gets disabled later on, reenable the involved policy rules again.
1921 #define DISABLE_UPDATE 1
1922 #define DISABLE_INFARCH 2
1923 #define DISABLE_DUP 3
1926 * add all installed packages that package p obsoletes to Queue q.
1927 * Package p is not installed. Also, we know that if
1928 * solv->keepexplicitobsoletes is not set, p is not in the multiversion map.
1929 * Entries may get added multiple times.
1932 add_obsoletes(Solver *solv, Id p, Queue *q)
1934 Pool *pool = solv->pool;
1935 Repo *installed = solv->installed;
1937 Solvable *s = pool->solvables + p;
1941 if (!solv->keepexplicitobsoletes || !(solv->multiversion.size && MAPTST(&solv->multiversion, p)))
1943 FOR_PROVIDES(p2, pp2, s->name)
1945 Solvable *ps = pool->solvables + p2;
1946 if (ps->repo != installed)
1948 if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
1950 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1958 obsp = s->repo->idarraydata + s->obsoletes;
1959 while ((obs = *obsp++) != 0)
1960 FOR_PROVIDES(p2, pp2, obs)
1962 Solvable *ps = pool->solvables + p2;
1963 if (ps->repo != installed)
1965 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1967 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1977 * Call add_obsoletes and intersect the result with the
1978 * elements in Queue q starting at qstart.
1979 * Assumes that it's the first call if qstart == q->count.
1980 * May use auxillary map m for the intersection process, all
1981 * elements of q starting at qstart must have their bit cleared.
1982 * (This is also true after the function returns.)
1985 intersect_obsoletes(Solver *solv, Id p, Queue *q, int qstart, Map *m)
1988 int qcount = q->count;
1990 add_obsoletes(solv, p, q);
1991 if (qcount == qstart)
1992 return; /* first call */
1993 if (qcount == q->count)
1995 else if (qcount == qstart + 1)
1997 /* easy if there's just one element */
1999 for (i = qcount; i < q->count; i++)
2000 if (q->elements[i] == q->elements[qstart])
2002 j++; /* keep the element */
2006 else if (!m->size && q->count - qstart <= 8)
2008 /* faster than a map most of the time */
2010 for (i = j = qstart; i < qcount; i++)
2012 Id ip = q->elements[i];
2013 for (k = qcount; k < q->count; k++)
2014 if (q->elements[k] == ip)
2016 q->elements[j++] = ip;
2023 /* for the really pathologic cases we use the map */
2024 Repo *installed = solv->installed;
2026 map_init(m, installed->end - installed->start);
2027 for (i = qcount; i < q->count; i++)
2028 MAPSET(m, q->elements[i] - installed->start);
2029 for (i = j = qstart; i < qcount; i++)
2030 if (MAPTST(m, q->elements[i] - installed->start))
2032 MAPCLR(m, q->elements[i] - installed->start);
2033 q->elements[j++] = q->elements[i];
2036 queue_truncate(q, j);
2040 jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
2042 Pool *pool = solv->pool;
2046 int i, j, set, qstart;
2049 installed = solv->installed;
2050 select = how & SOLVER_SELECTMASK;
2051 switch (how & SOLVER_JOBMASK)
2053 case SOLVER_INSTALL:
2054 set = how & SOLVER_SETMASK;
2055 if (!(set & SOLVER_NOAUTOSET))
2057 /* automatically add set bits by analysing the job */
2058 if (select == SOLVER_SOLVABLE_NAME)
2059 set |= SOLVER_SETNAME;
2060 if (select == SOLVER_SOLVABLE)
2061 set |= SOLVER_SETNAME | SOLVER_SETARCH | SOLVER_SETVENDOR | SOLVER_SETREPO | SOLVER_SETEVR;
2062 else if ((select == SOLVER_SOLVABLE_NAME || select == SOLVER_SOLVABLE_PROVIDES) && ISRELDEP(what))
2064 Reldep *rd = GETRELDEP(pool, what);
2065 if (rd->flags == REL_EQ && select == SOLVER_SOLVABLE_NAME)
2067 if (pool->disttype != DISTTYPE_DEB)
2069 const char *rel = strrchr(pool_id2str(pool, rd->evr), '-');
2070 set |= rel ? SOLVER_SETEVR : SOLVER_SETEV;
2073 set |= SOLVER_SETEVR;
2075 if (rd->flags <= 7 && ISRELDEP(rd->name))
2076 rd = GETRELDEP(pool, rd->name);
2077 if (rd->flags == REL_ARCH)
2078 set |= SOLVER_SETARCH;
2082 set &= ~SOLVER_NOAUTOSET;
2085 if ((set & SOLVER_SETARCH) != 0 && solv->infarchrules != solv->infarchrules_end)
2087 if (select == SOLVER_SOLVABLE)
2088 queue_push2(q, DISABLE_INFARCH, pool->solvables[what].name);
2091 int qcnt = q->count;
2092 /* does not work for SOLVER_SOLVABLE_ALL and SOLVER_SOLVABLE_REPO, but
2093 they are not useful for SOLVER_INSTALL jobs anyway */
2094 FOR_JOB_SELECT(p, pp, select, what)
2096 s = pool->solvables + p;
2098 for (i = qcnt; i < q->count; i += 2)
2099 if (q->elements[i + 1] == s->name)
2103 queue_push2(q, DISABLE_INFARCH, s->name);
2107 if ((set & SOLVER_SETREPO) != 0 && solv->duprules != solv->duprules_end)
2109 if (select == SOLVER_SOLVABLE)
2110 queue_push2(q, DISABLE_DUP, pool->solvables[what].name);
2113 int qcnt = q->count;
2114 FOR_JOB_SELECT(p, pp, select, what)
2116 s = pool->solvables + p;
2118 for (i = qcnt; i < q->count; i += 2)
2119 if (q->elements[i + 1] == s->name)
2123 queue_push2(q, DISABLE_DUP, s->name);
2127 if (!installed || installed->end == installed->start)
2129 /* now the hard part: disable some update rules */
2131 /* first check if we have multiversion or installed packages in the job */
2133 FOR_JOB_SELECT(p, pp, select, what)
2135 if (pool->solvables[p].repo == installed)
2137 else if (solv->multiversion.size && MAPTST(&solv->multiversion, p) && !solv->keepexplicitobsoletes)
2141 if (j) /* have installed packages */
2143 /* this is for dupmap_all jobs, it can go away if we create
2144 * duprules for them */
2145 if (i == 1 && (set & SOLVER_SETREPO) != 0)
2146 queue_push2(q, DISABLE_UPDATE, j);
2152 FOR_JOB_SELECT(p, pp, select, what)
2154 intersect_obsoletes(solv, p, q, qstart, &omap);
2155 if (q->count == qstart)
2161 if (qstart == q->count)
2162 return; /* nothing to prune */
2164 /* convert result to (DISABLE_UPDATE, p) pairs */
2166 for (j = qstart; j < i; j++)
2167 queue_push(q, q->elements[j]);
2168 for (j = qstart; j < q->count; j += 2)
2170 q->elements[j] = DISABLE_UPDATE;
2171 q->elements[j + 1] = q->elements[i++];
2174 /* now that we know which installed packages are obsoleted check each of them */
2175 if ((set & (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR)) == (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR))
2176 return; /* all is set, nothing to do */
2178 for (i = j = qstart; i < q->count; i += 2)
2180 Solvable *is = pool->solvables + q->elements[i + 1];
2181 FOR_JOB_SELECT(p, pp, select, what)
2184 s = pool->solvables + p;
2185 if ((set & SOLVER_SETEVR) != 0)
2186 illegal |= POLICY_ILLEGAL_DOWNGRADE; /* ignore */
2187 if ((set & SOLVER_SETNAME) != 0)
2188 illegal |= POLICY_ILLEGAL_NAMECHANGE; /* ignore */
2189 if ((set & SOLVER_SETARCH) != 0)
2190 illegal |= POLICY_ILLEGAL_ARCHCHANGE; /* ignore */
2191 if ((set & SOLVER_SETVENDOR) != 0)
2192 illegal |= POLICY_ILLEGAL_VENDORCHANGE; /* ignore */
2193 illegal = policy_is_illegal(solv, is, s, illegal);
2194 if (illegal && illegal == POLICY_ILLEGAL_DOWNGRADE && (set & SOLVER_SETEV) != 0)
2196 /* it's ok if the EV is different */
2197 if (pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE_EVONLY) != 0)
2205 /* no package conflicts with the update rule */
2206 /* thus keep the DISABLE_UPDATE */
2207 q->elements[j + 1] = q->elements[i + 1];
2211 queue_truncate(q, j);
2217 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
2218 FOR_REPO_SOLVABLES(installed, p, s)
2219 queue_push2(q, DISABLE_UPDATE, p);
2220 FOR_JOB_SELECT(p, pp, select, what)
2221 if (pool->solvables[p].repo == installed)
2223 queue_push2(q, DISABLE_UPDATE, p);
2224 #ifdef ENABLE_LINKED_PKGS
2225 if (solv->instbuddy && solv->instbuddy[p - installed->start] > 1)
2226 queue_push2(q, DISABLE_UPDATE, solv->instbuddy[p - installed->start]);
2235 /* disable all policy rules that are in conflict with our job list */
2237 solver_disablepolicyrules(Solver *solv)
2239 Queue *job = &solv->job;
2246 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
2248 for (i = solv->jobrules; i < solv->jobrules_end; i++)
2250 r = solv->rules + i;
2251 if (r->d < 0) /* disabled? */
2253 j = solv->ruletojob.elements[i - solv->jobrules];
2257 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2259 if (solv->cleandepsmap.size)
2261 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
2262 for (i = solv->installed->start; i < solv->installed->end; i++)
2263 if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
2264 queue_push2(&allq, DISABLE_UPDATE, i);
2266 MAPZERO(&solv->noupdate);
2267 for (i = 0; i < allq.count; i += 2)
2269 Id type = allq.elements[i], arg = allq.elements[i + 1];
2272 case DISABLE_UPDATE:
2273 disableupdaterule(solv, arg);
2275 case DISABLE_INFARCH:
2276 disableinfarchrule(solv, arg);
2279 disableduprule(solv, arg);
2288 /* we just disabled job #jobidx, now reenable all policy rules that were
2289 * disabled because of this job */
2291 solver_reenablepolicyrules(Solver *solv, int jobidx)
2293 Queue *job = &solv->job;
2298 Id qbuf[32], allqbuf[32];
2300 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
2301 jobtodisablelist(solv, job->elements[jobidx - 1], job->elements[jobidx], &q);
2307 /* now remove everything from q that is disabled by other jobs */
2309 /* first remove cleandeps packages, they count as DISABLE_UPDATE */
2310 if (solv->cleandepsmap.size)
2312 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
2313 for (j = k = 0; j < q.count; j += 2)
2315 if (q.elements[j] == DISABLE_UPDATE)
2317 Id p = q.elements[j + 1];
2318 if (p >= solv->installed->start && p < solv->installed->end && MAPTST(&solv->cleandepsmap, p - solv->installed->start))
2319 continue; /* remove element from q */
2321 q.elements[k++] = q.elements[j];
2322 q.elements[k++] = q.elements[j + 1];
2332 /* now go through the disable list of all other jobs */
2333 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
2334 for (i = solv->jobrules; i < solv->jobrules_end; i++)
2336 r = solv->rules + i;
2337 if (r->d < 0) /* disabled? */
2339 j = solv->ruletojob.elements[i - solv->jobrules];
2343 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2346 /* remove all elements in allq from q */
2347 for (j = k = 0; j < q.count; j += 2)
2349 Id type = q.elements[j], arg = q.elements[j + 1];
2350 for (ai = 0; ai < allq.count; ai += 2)
2351 if (allq.elements[ai] == type && allq.elements[ai + 1] == arg)
2353 if (ai < allq.count)
2354 continue; /* found it in allq, remove element from q */
2355 q.elements[k++] = q.elements[j];
2356 q.elements[k++] = q.elements[j + 1];
2369 /* now re-enable anything that's left in q */
2370 for (j = 0; j < q.count; j += 2)
2372 Id type = q.elements[j], arg = q.elements[j + 1];
2375 case DISABLE_UPDATE:
2376 reenableupdaterule(solv, arg);
2378 case DISABLE_INFARCH:
2379 reenableinfarchrule(solv, arg);
2382 reenableduprule(solv, arg);
2389 /* we just removed a package from the cleandeps map, now reenable all policy rules that were
2390 * disabled because of this */
2392 solver_reenablepolicyrules_cleandeps(Solver *solv, Id pkg)
2394 Queue *job = &solv->job;
2401 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
2402 for (i = solv->jobrules; i < solv->jobrules_end; i++)
2404 r = solv->rules + i;
2405 if (r->d < 0) /* disabled? */
2407 j = solv->ruletojob.elements[i - solv->jobrules];
2411 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2413 for (i = 0; i < allq.count; i += 2)
2414 if (allq.elements[i] == DISABLE_UPDATE && allq.elements[i + 1] == pkg)
2416 if (i == allq.count)
2417 reenableupdaterule(solv, pkg);
2422 /***********************************************************************
2424 *** Rule info part, tell the user what the rule is about.
2429 addpkgruleinfo(Solver *solv, Id p, Id p2, Id d, int type, Id dep)
2431 Pool *pool = solv->pool;
2436 assert(!p2 && d > 0);
2437 if (!pool->whatprovidesdata[d])
2439 else if (!pool->whatprovidesdata[d + 1])
2441 p2 = pool->whatprovidesdata[d];
2446 /* check if this creates the rule we're searching for */
2447 r = solv->rules + solv->ruleinfoq->elements[0];
2450 /* three or more literals */
2451 Id od = r->d < 0 ? -r->d - 1 : r->d;
2452 if (p != r->p && !od)
2456 Id *dp = pool->whatprovidesdata + d;
2457 Id *odp = pool->whatprovidesdata + od;
2459 if (*dp++ != *odp++)
2464 if (p < 0 && pool->whatprovidesdata[d] < 0 && type == SOLVER_RULE_PKG_CONFLICTS)
2465 p2 = pool->whatprovidesdata[d];
2469 /* one or two literals */
2470 Id op = p, op2 = p2;
2471 if (op2 && op > op2) /* normalize */
2477 if (r->p != op || r->w2 != op2 || (r->d && r->d != -1))
2479 if (type == SOLVER_RULE_PKG_CONFLICTS && !p2)
2480 p2 = -SYSTEMSOLVABLE;
2481 if (type == SOLVER_RULE_PKG_SAME_NAME)
2483 p = op; /* we normalize same name order */
2487 /* yep, rule matches. record info */
2488 queue_push(solv->ruleinfoq, type);
2489 queue_push(solv->ruleinfoq, p < 0 ? -p : 0);
2490 queue_push(solv->ruleinfoq, p2 < 0 ? -p2 : 0);
2491 queue_push(solv->ruleinfoq, dep);
2495 solver_allruleinfos_cmp(const void *ap, const void *bp, void *dp)
2497 const Id *a = ap, *b = bp;
2516 getpkgruleinfos(Solver *solv, Rule *r, Queue *rq)
2518 Pool *pool = solv->pool;
2522 queue_push(rq, r - solv->rules); /* push the rule we're interested in */
2523 solv->ruleinfoq = rq;
2524 FOR_RULELITERALS(l, pp, r)
2528 solver_addpkgrulesforsolvable(solv, pool->solvables - l, 0);
2530 #ifdef ENABLE_LINKED_PKGS
2531 FOR_RULELITERALS(l, pp, r)
2539 if (!strchr(pool_id2str(pool, pool->solvables[l].name), ':') || !has_package_link(pool, pool->solvables + l))
2541 add_package_link(solv, pool->solvables + l, 0, 0);
2544 solv->ruleinfoq = 0;
2549 solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
2551 Rule *r = solv->rules + rid;
2555 if (rid <= 0 || rid >= solv->pkgrules_end)
2557 Id type, from, to, dep;
2558 type = solver_ruleinfo(solv, rid, &from, &to, &dep);
2559 queue_push(rq, type);
2560 queue_push(rq, from);
2562 queue_push(rq, dep);
2565 getpkgruleinfos(solv, r, rq);
2566 /* now sort & unify em */
2569 solv_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
2570 /* throw out identical entries */
2571 for (i = j = 0; i < rq->count; i += 4)
2575 if (rq->elements[i] == rq->elements[j - 4] &&
2576 rq->elements[i + 1] == rq->elements[j - 3] &&
2577 rq->elements[i + 2] == rq->elements[j - 2] &&
2578 rq->elements[i + 3] == rq->elements[j - 1])
2581 rq->elements[j++] = rq->elements[i];
2582 rq->elements[j++] = rq->elements[i + 1];
2583 rq->elements[j++] = rq->elements[i + 2];
2584 rq->elements[j++] = rq->elements[i + 3];
2591 solver_ruleinfo(Solver *solv, Id rid, Id *fromp, Id *top, Id *depp)
2593 Pool *pool = solv->pool;
2594 Rule *r = solv->rules + rid;
2595 SolverRuleinfo type = SOLVER_RULE_UNKNOWN;
2603 if (rid > 0 && rid < solv->pkgrules_end)
2609 return SOLVER_RULE_PKG;
2613 getpkgruleinfos(solv, r, &rq);
2614 type = SOLVER_RULE_PKG;
2615 for (i = 0; i < rq.count; i += 4)
2618 qt = rq.elements[i];
2619 qp = rq.elements[i + 1];
2620 qo = rq.elements[i + 2];
2621 qd = rq.elements[i + 3];
2622 if (type == SOLVER_RULE_PKG || type > qt)
2636 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2638 Id jidx = solv->ruletojob.elements[rid - solv->jobrules];
2642 *top = solv->job.elements[jidx];
2644 *depp = solv->job.elements[jidx + 1];
2645 if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE)
2647 Id how = solv->job.elements[jidx];
2648 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLVABLE_NAME))
2649 return SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2650 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES))
2651 return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2652 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVABLE_NAME))
2653 return SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2654 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVABLE_PROVIDES))
2655 return SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2656 return SOLVER_RULE_JOB_UNSUPPORTED;
2658 return SOLVER_RULE_JOB;
2660 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2663 *fromp = solv->installed->start + (rid - solv->updaterules);
2664 return SOLVER_RULE_UPDATE;
2666 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2669 *fromp = solv->installed->start + (rid - solv->featurerules);
2670 return SOLVER_RULE_FEATURE;
2672 if (rid >= solv->duprules && rid < solv->duprules_end)
2677 *depp = pool->solvables[-r->p].name;
2678 return SOLVER_RULE_DISTUPGRADE;
2680 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2685 *depp = pool->solvables[-r->p].name;
2686 return SOLVER_RULE_INFARCH;
2688 if (rid >= solv->bestrules && rid < solv->bestrules_end)
2690 if (fromp && solv->bestrules_pkg[rid - solv->bestrules] > 0)
2691 *fromp = solv->bestrules_pkg[rid - solv->bestrules];
2692 return SOLVER_RULE_BEST;
2694 if (rid >= solv->yumobsrules && rid < solv->yumobsrules_end)
2700 /* first solvable is enough, we just need it for the name */
2701 if (!r->d || r->d == -1)
2704 *top = pool->whatprovidesdata[r->d < 0 ? -r->d : r->d];
2707 *depp = solv->yumobsrules_info[rid - solv->yumobsrules];
2708 return SOLVER_RULE_YUMOBS;
2710 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2712 return SOLVER_RULE_CHOICE;
2714 if (rid >= solv->learntrules)
2716 return SOLVER_RULE_LEARNT;
2718 return SOLVER_RULE_UNKNOWN;
2722 solver_ruleclass(Solver *solv, Id rid)
2725 return SOLVER_RULE_UNKNOWN;
2726 if (rid > 0 && rid < solv->pkgrules_end)
2727 return SOLVER_RULE_PKG;
2728 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2729 return SOLVER_RULE_JOB;
2730 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2731 return SOLVER_RULE_UPDATE;
2732 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2733 return SOLVER_RULE_FEATURE;
2734 if (rid >= solv->duprules && rid < solv->duprules_end)
2735 return SOLVER_RULE_DISTUPGRADE;
2736 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2737 return SOLVER_RULE_INFARCH;
2738 if (rid >= solv->bestrules && rid < solv->bestrules_end)
2739 return SOLVER_RULE_BEST;
2740 if (rid >= solv->yumobsrules && rid < solv->yumobsrules_end)
2741 return SOLVER_RULE_YUMOBS;
2742 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2743 return SOLVER_RULE_CHOICE;
2744 if (rid >= solv->learntrules && rid < solv->nrules)
2745 return SOLVER_RULE_LEARNT;
2746 return SOLVER_RULE_UNKNOWN;
2750 solver_ruleliterals(Solver *solv, Id rid, Queue *q)
2752 Pool *pool = solv->pool;
2757 r = solv->rules + rid;
2758 FOR_RULELITERALS(p, pp, r)
2759 if (p != -SYSTEMSOLVABLE)
2762 queue_push(q, -SYSTEMSOLVABLE); /* hmm, better to return an empty result? */
2766 solver_rule2jobidx(Solver *solv, Id rid)
2768 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2770 return solv->ruletojob.elements[rid - solv->jobrules] + 1;
2773 /* job rule introspection */
2775 solver_rule2job(Solver *solv, Id rid, Id *whatp)
2778 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2784 idx = solv->ruletojob.elements[rid - solv->jobrules];
2786 *whatp = solv->job.elements[idx + 1];
2787 return solv->job.elements[idx];
2790 /* update/feature rule introspection */
2792 solver_rule2solvable(Solver *solv, Id rid)
2794 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2795 return rid - solv->updaterules;
2796 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2797 return rid - solv->featurerules;
2802 solver_rule2pkgrule(Solver *solv, Id rid)
2804 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2805 return solv->choicerules_ref[rid - solv->choicerules];
2810 solver_rule2rules_rec(Solver *solv, Id rid, Queue *q, Map *seen)
2817 for (i = solv->learnt_why.elements[rid - solv->learntrules]; (rid2 = solv->learnt_pool.elements[i]) != 0; i++)
2821 if (MAPTST(seen, rid2))
2823 if (rid2 >= solv->learntrules)
2824 solver_rule2rules_rec(solv, rid2, q, seen);
2827 queue_push(q, rid2);
2831 /* learnt rule introspection */
2833 solver_rule2rules(Solver *solv, Id rid, Queue *q, int recursive)
2836 if (rid < solv->learntrules || rid >= solv->nrules)
2841 map_init(&seen, solv->nrules);
2842 solver_rule2rules_rec(solv, rid, q, &seen);
2846 solver_rule2rules_rec(solv, rid, q, 0);
2850 /* check if the newest versions of pi still provides the dependency we're looking for */
2852 solver_choicerulecheck(Solver *solv, Id pi, Rule *r, Map *m, Queue *q)
2854 Pool *pool = solv->pool;
2859 if (!q->count || q->elements[0] != pi)
2863 ur = solv->rules + solv->updaterules + (pi - pool->installed->start);
2865 ur = solv->rules + solv->featurerules + (pi - pool->installed->start);
2868 queue_push2(q, pi, 0);
2869 FOR_RULELITERALS(p, pp, ur)
2878 return MAPTST(m, p) ? 0 : 1;
2880 if (!q->elements[1])
2882 for (i = 2; i < q->count; i++)
2883 if (!MAPTST(m, q->elements[i]))
2886 return 0; /* all provide it, no need to filter */
2887 /* some don't provide it, have to filter */
2888 queue_deleten(q, 0, 2);
2889 policy_filter_unwanted(solv, q, POLICY_MODE_CHOOSE);
2890 queue_unshift(q, 1); /* filter mark */
2891 queue_unshift(q, pi);
2893 for (i = 2; i < q->count; i++)
2894 if (MAPTST(m, q->elements[i]))
2895 return 0; /* at least one provides it */
2896 return 1; /* none of the new packages provided it */
2900 queue_removeelement(Queue *q, Id el)
2903 for (i = 0; i < q->count; i++)
2904 if (q->elements[i] == el)
2908 for (j = i++; i < q->count; i++)
2909 if (q->elements[i] != el)
2910 q->elements[j++] = q->elements[i];
2911 queue_truncate(q, j);
2916 solver_addchoicerules(Solver *solv)
2918 Pool *pool = solv->pool;
2921 Queue q, qi, qcheck;
2922 int i, j, rid, havechoice;
2926 Id lastaddedp, lastaddedd;
2930 solv->choicerules = solv->nrules;
2931 if (!pool->installed)
2933 solv->choicerules_end = solv->nrules;
2936 now = solv_timems(0);
2937 solv->choicerules_ref = solv_calloc(solv->pkgrules_end, sizeof(Id));
2940 queue_init(&qcheck);
2941 map_init(&m, pool->nsolvables);
2942 map_init(&mneg, pool->nsolvables);
2943 /* set up negative assertion map from infarch and dup rules */
2944 for (rid = solv->infarchrules, r = solv->rules + rid; rid < solv->infarchrules_end; rid++, r++)
2945 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2946 MAPSET(&mneg, -r->p);
2947 for (rid = solv->duprules, r = solv->rules + rid; rid < solv->duprules_end; rid++, r++)
2948 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2949 MAPSET(&mneg, -r->p);
2953 for (rid = 1; rid < solv->pkgrules_end ; rid++)
2955 r = solv->rules + rid;
2956 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 <= 0))
2957 continue; /* only look at requires rules */
2958 /* solver_printrule(solv, SOLV_DEBUG_RESULT, r); */
2962 FOR_RULELITERALS(p, pp, r)
2966 s = pool->solvables + p;
2969 if (s->repo == pool->installed)
2974 /* check if this package is "blocked" by a installed package */
2976 FOR_PROVIDES(p2, pp2, s->name)
2978 s2 = pool->solvables + p2;
2979 if (s2->repo != pool->installed)
2981 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
2983 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, s2))
2989 /* found installed package p2 that we can update to p */
2990 if (MAPTST(&mneg, p))
2992 if (policy_is_illegal(solv, s2, s, 0))
2995 if (solver_choicerulecheck(solv, p2, r, &m))
2997 queue_push(&qi, p2);
2999 queue_push2(&qi, p2, p);
3006 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
3008 while ((obs = *obsp++) != 0)
3010 FOR_PROVIDES(p2, pp2, obs)
3012 s2 = pool->solvables + p2;
3013 if (s2->repo != pool->installed)
3015 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
3017 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
3026 /* found installed package p2 that we can update to p */
3027 if (MAPTST(&mneg, p))
3029 if (policy_is_illegal(solv, s2, s, 0))
3032 if (solver_choicerulecheck(solv, p2, r, &m))
3034 queue_push(&qi, p2);
3036 queue_push2(&qi, p2, p);
3042 /* package p is independent of the installed ones */
3045 if (!havechoice || !q.count || !qi.count)
3046 continue; /* no choice */
3048 FOR_RULELITERALS(p, pp, r)
3052 /* do extra checking */
3053 for (i = j = 0; i < qi.count; i += 2)
3055 p2 = qi.elements[i];
3058 if (solver_choicerulecheck(solv, p2, r, &m, &qcheck))
3060 /* oops, remove element p from q */
3061 queue_removeelement(&q, qi.elements[i + 1]);
3064 qi.elements[j++] = p2;
3066 queue_truncate(&qi, j);
3068 if (!q.count || !qi.count)
3070 FOR_RULELITERALS(p, pp, r)
3077 /* now check the update rules of the installed package.
3078 * if all packages of the update rules are contained in
3079 * the dependency rules, there's no need to set up the choice rule */
3080 for (i = 0; i < qi.count; i++)
3083 if (!qi.elements[i])
3085 ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
3087 ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
3090 FOR_RULELITERALS(p, pp, ur)
3095 for (j = i + 1; j < qi.count; j++)
3096 if (qi.elements[i] == qi.elements[j])
3099 /* empty map again */
3100 FOR_RULELITERALS(p, pp, r)
3106 printf("skipping choice ");
3107 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
3112 /* don't add identical rules */
3113 if (lastaddedp == r->p && lastaddedcnt == q.count)
3115 for (i = 0; i < q.count; i++)
3116 if (q.elements[i] != pool->whatprovidesdata[lastaddedd + i])
3119 continue; /* already added that one */
3121 d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
3125 lastaddedcnt = q.count;
3127 solver_addrule(solv, r->p, 0, d);
3128 queue_push(&solv->weakruleq, solv->nrules - 1);
3129 solv->choicerules_ref[solv->nrules - 1 - solv->choicerules] = rid;
3132 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
3133 printf("WEAK CHOICE ");
3134 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + solv->nrules - 1);
3139 queue_free(&qcheck);
3142 solv->choicerules_end = solv->nrules;
3143 /* shrink choicerules_ref */
3144 solv->choicerules_ref = solv_realloc2(solv->choicerules_ref, solv->choicerules_end - solv->choicerules, sizeof(Id));
3145 POOL_DEBUG(SOLV_DEBUG_STATS, "choice rule creation took %d ms\n", solv_timems(now));
3148 /* called when a choice rule is disabled by analyze_unsolvable. We also
3149 * have to disable all other choice rules so that the best packages get
3152 solver_disablechoicerules(Solver *solv, Rule *r)
3155 Pool *pool = solv->pool;
3159 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
3160 map_init(&m, pool->nsolvables);
3161 FOR_RULELITERALS(p, pp, or)
3164 FOR_RULELITERALS(p, pp, r)
3167 for (rid = solv->choicerules; rid < solv->choicerules_end; rid++)
3169 r = solv->rules + rid;
3172 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
3173 FOR_RULELITERALS(p, pp, or)
3174 if (p > 0 && MAPTST(&m, p))
3177 solver_disablerule(solv, r);
3182 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
3186 for (i = j = 0; i < q->count; i++)
3189 for (cp2 = cp; *cp2; cp2++)
3192 q->elements[j++] = p;
3196 queue_truncate(q, j);
3200 prune_to_dup_packages(Solver *solv, Id p, Queue *q)
3203 for (i = j = 0; i < q->count; i++)
3205 Id p = q->elements[i];
3206 if (MAPTST(&solv->dupmap, p))
3207 q->elements[j++] = p;
3209 queue_truncate(q, j);
3213 solver_addbestrules(Solver *solv, int havebestinstalljobs)
3215 Pool *pool = solv->pool;
3218 Repo *installed = solv->installed;
3224 solv->bestrules = solv->nrules;
3227 solv->bestrules_end = solv->nrules;
3234 if (havebestinstalljobs)
3236 for (i = 0; i < solv->job.count; i += 2)
3238 if ((solv->job.elements[i] & (SOLVER_JOBMASK | SOLVER_FORCEBEST)) == (SOLVER_INSTALL | SOLVER_FORCEBEST))
3242 for (j = 0; j < solv->ruletojob.count; j++)
3243 if (solv->ruletojob.elements[j] == i)
3245 if (j == solv->ruletojob.count)
3247 r = solv->rules + solv->jobrules + j;
3249 FOR_RULELITERALS(p2, pp2, r)
3253 continue; /* orphaned */
3254 /* select best packages, just look at prio and version */
3256 policy_filter_unwanted(solv, &q, POLICY_MODE_RECOMMEND);
3257 if (q.count == oldcnt)
3258 continue; /* nothing filtered */
3259 p2 = queue_shift(&q);
3261 solver_addrule(solv, p2, q.count ? q.elements[0] : 0, 0);
3263 solver_addrule(solv, p2, 0, pool_queuetowhatprovides(pool, &q));
3264 queue_push(&r2pkg, -(solv->jobrules + j));
3269 if (solv->bestupdatemap_all || solv->bestupdatemap.size)
3271 FOR_REPO_SOLVABLES(installed, p, s)
3274 if (!solv->updatemap_all && (!solv->updatemap.size || !MAPTST(&solv->updatemap, p - installed->start)))
3276 if (!solv->bestupdatemap_all && (!solv->bestupdatemap.size || !MAPTST(&solv->bestupdatemap, p - installed->start)))
3279 if (solv->bestobeypolicy)
3280 r = solv->rules + solv->updaterules + (p - installed->start);
3283 r = solv->rules + solv->featurerules + (p - installed->start);
3284 if (!r->p) /* identical to update rule? */
3285 r = solv->rules + solv->updaterules + (p - installed->start);
3287 if (solv->specialupdaters && (d = solv->specialupdaters[p - installed->start]) != 0 && r == solv->rules + solv->updaterules + (p - installed->start))
3289 /* need to check specialupdaters */
3290 if (r->p == p) /* be careful with the dup case */
3292 while ((p2 = pool->whatprovidesdata[d++]) != 0)
3297 FOR_RULELITERALS(p2, pp2, r)
3301 if (solv->update_targets && solv->update_targets->elements[p - installed->start])
3302 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q);
3303 if (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
3304 prune_to_dup_packages(solv, p, &q);
3305 /* select best packages, just look at prio and version */
3306 policy_filter_unwanted(solv, &q, POLICY_MODE_RECOMMEND);
3308 continue; /* orphaned */
3309 if (solv->bestobeypolicy)
3311 /* also filter the best of the feature rule packages and add them */
3312 r = solv->rules + solv->featurerules + (p - installed->start);
3317 FOR_RULELITERALS(p2, pp2, r)
3319 queue_push(&q2, p2);
3320 if (solv->update_targets && solv->update_targets->elements[p - installed->start])
3321 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q2);
3322 if (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
3323 prune_to_dup_packages(solv, p, &q2);
3324 policy_filter_unwanted(solv, &q2, POLICY_MODE_RECOMMEND);
3325 for (j = 0; j < q2.count; j++)
3326 queue_pushunique(&q, q2.elements[j]);
3329 p2 = queue_shift(&q);
3331 solver_addrule(solv, p2, q.count ? q.elements[0] : 0, 0);
3333 solver_addrule(solv, p2, 0, pool_queuetowhatprovides(pool, &q));
3334 queue_push(&r2pkg, p);
3338 solv->bestrules_pkg = solv_memdup2(r2pkg.elements, r2pkg.count, sizeof(Id));
3339 solv->bestrules_end = solv->nrules;
3348 /* yumobs rule handling */
3351 find_obsolete_group(Solver *solv, Id obs, Queue *q)
3353 Pool *pool = solv->pool;
3355 Id p2, pp2, op, *opp, opp2;
3356 int i, j, qnc, ncnt;
3359 FOR_PROVIDES(p2, pp2, obs)
3361 Solvable *s2 = pool->solvables + p2;
3362 if (s2->repo != pool->installed)
3364 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
3366 /* we obsolete installed package s2 with obs. now find all other packages that have the same dep */
3367 for (opp = solv->obsoletes_data + solv->obsoletes[p2 - solv->installed->start]; (op = *opp++) != 0;)
3369 Solvable *os = pool->solvables + op;
3373 if (pool->obsoleteusescolors && !pool_colormatch(pool, s2, os))
3375 obsp2 = os->repo->idarraydata + os->obsoletes;
3376 while ((obs2 = *obsp2++) != 0)
3380 queue_pushunique(q, op);
3382 /* also search packages with the same name */
3383 FOR_PROVIDES(op, opp2, s2->name)
3385 Solvable *os = pool->solvables + op;
3387 if (os->name != s2->name)
3391 if (pool->obsoleteusescolors && !pool_colormatch(pool, s2, os))
3393 obsp2 = os->repo->idarraydata + os->obsoletes;
3394 while ((obs2 = *obsp2++) != 0)
3398 queue_pushunique(q, op);
3401 /* find names so that we can build groups */
3402 queue_init_clone(&qn, q);
3403 prune_to_best_version(solv->pool, &qn);
3406 for (i = 0; i < qn.count; i++)
3407 printf(" + %s\n", pool_solvid2str(pool, qn.elements[i]));
3410 /* filter into name groups */
3419 for (i = 0; i < qnc; i++)
3421 Id n = pool->solvables[qn.elements[i]].name;
3423 for (j = 0; j < q->count; j++)
3425 Id p = q->elements[j];
3426 if (pool->solvables[p].name == n)
3445 queue_insertn(q, 0, qn.count - qnc, qn.elements + qnc);
3451 solver_addyumobsrules(Solver *solv)
3453 Pool *pool = solv->pool;
3454 Repo *installed = solv->installed;
3457 Queue qo, qq, yumobsinfoq;
3461 solv->yumobsrules = solv->nrules;
3462 if (!installed || !solv->obsoletes)
3464 solv->yumobsrules_end = solv->nrules;
3467 now = solv_timems(0);
3469 FOR_REPO_SOLVABLES(installed, p, s)
3471 if (!solv->obsoletes[p - installed->start])
3474 printf("checking yumobs for %s\n", pool_solvable2str(pool, s));
3477 for (opp = solv->obsoletes_data + solv->obsoletes[p - installed->start]; (op = *opp++) != 0;)
3479 Solvable *os = pool->solvables + op;
3480 Id obs, *obsp = os->repo->idarraydata + os->obsoletes;
3482 while ((obs = *obsp++) != 0)
3484 FOR_PROVIDES(p2, pp2, obs)
3486 Solvable *s2 = pool->solvables + p2;
3487 if (s2->repo != installed)
3489 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
3491 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
3493 queue_pushunique(&qo, obs);
3504 queue_init(&yumobsinfoq);
3506 for (i = 0; i < qo.count; i++)
3508 int group, groupk, groupstart;
3511 printf("investigating %s\n", pool_dep2str(pool, qo.elements[i]));
3513 find_obsolete_group(solv, qo.elements[i], &qq);
3515 printf("result:\n");
3516 for (j = 0; j < qq.count; j++)
3517 if (qq.elements[j] == 0)
3520 printf("%s\n", pool_solvid2str(pool, qq.elements[j]));
3525 /* at least two goups, build rules */
3527 for (j = 0; j < qq.count; j++)
3535 if (pool->solvables[p].repo == installed)
3539 for (k = 0; k < qq.count; k++)
3541 Id pk = qq.elements[k];
3544 if (group != groupk && k > groupstart)
3547 if (k - groupstart == 1)
3548 solver_addrule(solv, -p, qq.elements[groupstart], 0);
3550 solver_addrule(solv, -p, 0, pool_ids2whatprovides(pool, qq.elements + groupstart, k - groupstart));
3551 queue_push(&yumobsinfoq, qo.elements[i]);
3558 if (yumobsinfoq.count)
3559 solv->yumobsrules_info = solv_memdup2(yumobsinfoq.elements, yumobsinfoq.count, sizeof(Id));
3560 queue_free(&yumobsinfoq);
3563 solv->yumobsrules_end = solv->nrules;
3564 POOL_DEBUG(SOLV_DEBUG_STATS, "yumobs rule creation took %d ms\n", solv_timems(now));
3567 #undef CLEANDEPSDEBUG
3570 * This functions collects all packages that are looked at
3571 * when a dependency is checked. We need it to "pin" installed
3572 * packages when removing a supplemented package in createcleandepsmap.
3573 * Here's an not uncommon example:
3574 * A contains "Supplements: packageand(B, C)"
3575 * B contains "Requires: A"
3576 * Now if we remove C, the supplements is no longer true,
3577 * thus we also remove A. Without the dep_pkgcheck function, we
3578 * would now also remove B, but this is wrong, as adding back
3579 * C doesn't make the supplements true again. Thus we "pin" B
3581 * There's probably a better way to do this, but I haven't come
3585 dep_pkgcheck(Solver *solv, Id dep, Map *m, Queue *q)
3587 Pool *pool = solv->pool;
3592 Reldep *rd = GETRELDEP(pool, dep);
3595 if (rd->flags == REL_AND)
3597 dep_pkgcheck(solv, rd->name, m, q);
3598 dep_pkgcheck(solv, rd->evr, m, q);
3601 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
3605 FOR_PROVIDES(p, pp, dep)
3606 if (!m || MAPTST(m, p))
3611 check_xsupp(Solver *solv, Queue *depq, Id dep)
3613 Pool *pool = solv->pool;
3618 Reldep *rd = GETRELDEP(pool, dep);
3621 if (rd->flags == REL_AND)
3623 if (!check_xsupp(solv, depq, rd->name))
3625 return check_xsupp(solv, depq, rd->evr);
3627 if (rd->flags == REL_OR)
3629 if (check_xsupp(solv, depq, rd->name))
3631 return check_xsupp(solv, depq, rd->evr);
3633 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
3635 return solver_splitprovides(solv, rd->evr);
3640 if (depq && rd->flags == REL_NAMESPACE)
3643 for (i = 0; i < depq->count; i++)
3644 if (depq->elements[i] == dep || depq->elements[i] == rd->name)
3648 FOR_PROVIDES(p, pp, dep)
3649 if (p == SYSTEMSOLVABLE || pool->solvables[p].repo == solv->installed)
3655 queue_contains(Queue *q, Id id)
3658 for (i = 0; i < q->count; i++)
3659 if (q->elements[i] == id)
3664 #ifdef ENABLE_COMPLEX_DEPS
3666 complex_cleandeps_remove(Pool *pool, Id ip, Id req, Map *im, Map *installedm, Queue *iq)
3673 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
3674 if (i == 0 || i == 1)
3679 for (i = 0; i < dq.count; i++)
3681 for (; (p = dq.elements[i]) != 0; i++)
3685 if (!MAPTST(installedm, -p))
3689 if (p != SYSTEMSOLVABLE && MAPTST(im, p))
3691 #ifdef CLEANDEPSDEBUG
3692 printf("%s requires/recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3697 while (dq.elements[i])
3704 complex_cleandeps_addback(Pool *pool, Id ip, Id req, Map *im, Map *installedm, Queue *iq, Map *userinstalled)
3711 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
3712 if (i == 0 || i == 1)
3717 for (i = 0; i < dq.count; i++)
3720 for (; (p = dq.elements[i]) != 0; i++)
3724 if (!MAPTST(installedm, -p))
3733 for (i = blk; (p = dq.elements[i]) != 0; i++)
3737 if (!MAPTST(installedm, p))
3739 if (p == ip || MAPTST(userinstalled, p - pool->installed->start))
3741 #ifdef CLEANDEPSDEBUG
3742 printf("%s requires/recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3748 while (dq.elements[i])
3757 * Find all installed packages that are no longer
3758 * needed regarding the current solver job.
3761 * - remove pass: remove all packages that could have
3762 * been dragged in by the obsoleted packages.
3763 * i.e. if package A is obsolete and contains "Requires: B",
3764 * also remove B, as installing A will have pulled in B.
3765 * after this pass, we have a set of still installed packages
3766 * with broken dependencies.
3768 * now add back all packages that the still installed packages
3771 * The cleandeps packages are the packages removed in the first
3772 * pass and not added back in the second pass.
3774 * If we search for unneeded packages (unneeded is true), we
3775 * simply remove all packages except the userinstalled ones in
3779 solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded)
3781 Pool *pool = solv->pool;
3782 Repo *installed = solv->installed;
3783 Queue *job = &solv->job;
3788 Id rid, how, what, select;
3790 Id req, *reqp, sup, *supp;
3792 Queue iq, iqcopy, xsuppq;
3795 map_empty(cleandepsmap);
3796 if (!installed || installed->end == installed->start)
3798 map_init(&userinstalled, installed->end - installed->start);
3799 map_init(&im, pool->nsolvables);
3800 map_init(&installedm, pool->nsolvables);
3802 queue_init(&xsuppq);
3804 for (i = 0; i < job->count; i += 2)
3806 how = job->elements[i];
3807 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
3809 what = job->elements[i + 1];
3810 select = how & SOLVER_SELECTMASK;
3811 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
3812 FOR_REPO_SOLVABLES(installed, p, s)
3813 MAPSET(&userinstalled, p - installed->start);
3814 FOR_JOB_SELECT(p, pp, select, what)
3815 if (pool->solvables[p].repo == installed)
3816 MAPSET(&userinstalled, p - installed->start);
3818 if ((how & (SOLVER_JOBMASK | SOLVER_SELECTMASK)) == (SOLVER_ERASE | SOLVER_SOLVABLE_PROVIDES))
3820 what = job->elements[i + 1];
3823 Reldep *rd = GETRELDEP(pool, what);
3824 if (rd->flags != REL_NAMESPACE)
3828 queue_pushunique(&iq, rd->name);
3831 FOR_PROVIDES(p, pp, what)
3836 queue_pushunique(&iq, what);
3841 /* have special namespace cleandeps erases */
3844 for (ip = installed->start; ip < installed->end; ip++)
3846 s = pool->solvables + ip;
3847 if (s->repo != installed)
3849 if (!s->supplements)
3851 supp = s->repo->idarraydata + s->supplements;
3852 while ((sup = *supp++) != 0)
3853 if (ISRELDEP(sup) && check_xsupp(solv, &iq, sup) && !check_xsupp(solv, 0, sup))
3855 #ifdef CLEANDEPSDEBUG
3856 printf("xsupp %s from %s\n", pool_dep2str(pool, sup), pool_solvid2str(pool, ip));
3858 queue_pushunique(&xsuppq, sup);
3864 /* also add visible patterns to userinstalled for openSUSE */
3868 dataiterator_init(&di, pool, 0, 0, SOLVABLE_ISVISIBLE, 0, 0);
3869 while (dataiterator_step(&di))
3874 s = pool->solvables + di.solvid;
3875 if (!s->repo || !s->requires)
3877 if (s->repo != installed && !pool_installable(pool, s))
3879 if (strncmp(pool_id2str(pool, s->name), "pattern:", 8) != 0)
3881 dp = s->repo->idarraydata + s->requires;
3882 for (dp = s->repo->idarraydata + s->requires; *dp; dp++)
3883 FOR_PROVIDES(p, pp, *dp)
3884 if (pool->solvables[p].repo == installed)
3886 if (strncmp(pool_id2str(pool, pool->solvables[p].name), "pattern", 7) != 0)
3888 MAPSET(&userinstalled, p - installed->start);
3891 dataiterator_free(&di);
3895 /* all products and their buddies are userinstalled */
3896 for (p = installed->start; p < installed->end; p++)
3898 Solvable *s = pool->solvables + p;
3899 if (s->repo != installed)
3901 if (!strncmp("product:", pool_id2str(pool, s->name), 8))
3903 MAPSET(&userinstalled, p - installed->start);
3904 #ifdef ENABLE_LINKED_PKGS
3905 if (solv->instbuddy && solv->instbuddy[p - installed->start] > 1)
3907 Id buddy = solv->instbuddy[p - installed->start];
3908 if (buddy >= installed->start && buddy < installed->end)
3909 MAPSET(&userinstalled, buddy - installed->start);
3916 /* add all positive elements (e.g. locks) to "userinstalled" */
3917 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3919 r = solv->rules + rid;
3922 i = solv->ruletojob.elements[rid - solv->jobrules];
3923 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
3925 FOR_RULELITERALS(p, jp, r)
3926 if (p > 0 && pool->solvables[p].repo == installed)
3927 MAPSET(&userinstalled, p - installed->start);
3930 /* add all cleandeps candidates to iq */
3931 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3933 r = solv->rules + rid;
3934 if (r->d < 0) /* disabled? */
3936 if (r->d == 0 && r->p < 0 && r->w2 == 0) /* negative assertion (erase job)? */
3939 if (pool->solvables[p].repo != installed)
3941 MAPCLR(&userinstalled, p - installed->start);
3944 i = solv->ruletojob.elements[rid - solv->jobrules];
3945 how = job->elements[i];
3946 if ((how & (SOLVER_JOBMASK|SOLVER_CLEANDEPS)) == (SOLVER_ERASE|SOLVER_CLEANDEPS))
3949 else if (r->p > 0) /* install job */
3953 i = solv->ruletojob.elements[rid - solv->jobrules];
3954 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
3956 /* check if the literals all obsolete some installed package */
3960 /* just one installed literal */
3961 if (r->d == 0 && r->w2 == 0 && pool->solvables[r->p].repo == installed)
3963 /* multiversion is bad */
3964 if (solv->multiversion.size && !solv->keepexplicitobsoletes)
3966 FOR_RULELITERALS(p, jp, r)
3967 if (MAPTST(&solv->multiversion, p))
3975 FOR_RULELITERALS(p, jp, r)
3979 queue_truncate(&iq, iqstart); /* abort */
3982 if (pool->solvables[p].repo == installed)
3984 if (iq.count == iqstart)
3988 for (i = iqstart; i < iq.count; i++)
3989 if (iq.elements[i] == p)
3991 queue_truncate(&iq, iqstart);
3997 intersect_obsoletes(solv, p, &iq, iqstart, &om);
3998 if (iq.count == iqstart)
4006 queue_init_clone(&iqcopy, &iq);
4010 if (solv->cleandeps_updatepkgs)
4011 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
4012 queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]);
4016 queue_empty(&iq); /* just in case... */
4018 /* clear userinstalled bit for the packages we really want to delete/update */
4019 for (i = 0; i < iq.count; i++)
4022 if (pool->solvables[p].repo != installed)
4024 MAPCLR(&userinstalled, p - installed->start);
4027 for (p = installed->start; p < installed->end; p++)
4029 if (pool->solvables[p].repo != installed)
4031 MAPSET(&installedm, p);
4032 if (unneeded && !MAPTST(&userinstalled, p - installed->start))
4036 MAPSET(&installedm, SYSTEMSOLVABLE);
4037 MAPSET(&im, SYSTEMSOLVABLE);
4039 #ifdef CLEANDEPSDEBUG
4040 printf("REMOVE PASS\n");
4049 /* supplements pass */
4050 for (ip = installed->start; ip < installed->end; ip++)
4052 if (!MAPTST(&installedm, ip))
4054 s = pool->solvables + ip;
4055 if (!s->supplements)
4057 if (!MAPTST(&im, ip))
4059 if (MAPTST(&userinstalled, ip - installed->start))
4061 supp = s->repo->idarraydata + s->supplements;
4062 while ((sup = *supp++) != 0)
4063 if (dep_possible(solv, sup, &im))
4067 supp = s->repo->idarraydata + s->supplements;
4068 while ((sup = *supp++) != 0)
4069 if (dep_possible(solv, sup, &installedm) || (xsuppq.count && queue_contains(&xsuppq, sup)))
4071 /* no longer supplemented, also erase */
4072 int iqcount = iq.count;
4073 /* pin packages, see comment above dep_pkgcheck */
4074 dep_pkgcheck(solv, sup, &im, &iq);
4075 for (i = iqcount; i < iq.count; i++)
4077 Id pqp = iq.elements[i];
4078 if (pool->solvables[pqp].repo == installed)
4079 MAPSET(&userinstalled, pqp - installed->start);
4081 queue_truncate(&iq, iqcount);
4082 #ifdef CLEANDEPSDEBUG
4083 printf("%s supplemented [%s]\n", pool_solvid2str(pool, ip), pool_dep2str(pool, sup));
4085 queue_push(&iq, ip);
4090 break; /* no supplementing package found, we're done */
4092 ip = queue_shift(&iq);
4093 s = pool->solvables + ip;
4094 if (!MAPTST(&im, ip))
4096 if (!MAPTST(&installedm, ip))
4098 if (s->repo == installed && MAPTST(&userinstalled, ip - installed->start))
4101 #ifdef CLEANDEPSDEBUG
4102 printf("removing %s\n", pool_solvable2str(pool, s));
4106 reqp = s->repo->idarraydata + s->requires;
4107 while ((req = *reqp++) != 0)
4109 if (req == SOLVABLE_PREREQMARKER)
4111 #ifdef ENABLE_COMPLEX_DEPS
4112 if (pool_is_complex_dep(pool, req))
4114 complex_cleandeps_remove(pool, ip, req, &im, &installedm, &iq);
4118 FOR_PROVIDES(p, pp, req)
4120 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
4122 #ifdef CLEANDEPSDEBUG
4123 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4132 reqp = s->repo->idarraydata + s->recommends;
4133 while ((req = *reqp++) != 0)
4135 #ifdef ENABLE_COMPLEX_DEPS
4136 if (pool_is_complex_dep(pool, req))
4138 complex_cleandeps_remove(pool, ip, req, &im, &installedm, &iq);
4142 FOR_PROVIDES(p, pp, req)
4144 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
4146 #ifdef CLEANDEPSDEBUG
4147 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4156 /* turn userinstalled into remove set for pruning */
4157 map_empty(&userinstalled);
4158 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
4160 r = solv->rules + rid;
4161 if (r->p >= 0 || r->d != 0 || r->w2 != 0)
4162 continue; /* disabled or not erase */
4165 if (pool->solvables[p].repo == installed)
4166 MAPSET(&userinstalled, p - installed->start);
4168 if (!unneeded && solv->cleandeps_updatepkgs)
4170 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
4172 p = solv->cleandeps_updatepkgs->elements[i];
4173 if (pool->solvables[p].repo == installed)
4174 MAPSET(&userinstalled, p - installed->start);
4177 MAPSET(&im, SYSTEMSOLVABLE); /* in case we cleared it above */
4178 for (p = installed->start; p < installed->end; p++)
4181 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
4183 r = solv->rules + rid;
4186 FOR_RULELITERALS(p, jp, r)
4190 /* also put directly addressed packages on the install queue
4191 * so we can mark patterns as installed */
4192 for (i = 0; i < job->count; i += 2)
4194 how = job->elements[i];
4195 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
4197 what = job->elements[i + 1];
4198 select = how & SOLVER_SELECTMASK;
4199 if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
4200 queue_push(&iq, what);
4204 #ifdef CLEANDEPSDEBUG
4205 printf("ADDBACK PASS\n");
4211 /* supplements pass */
4212 for (ip = installed->start; ip < installed->end; ip++)
4214 if (!MAPTST(&installedm, ip))
4216 if (MAPTST(&userinstalled, ip - installed->start))
4218 s = pool->solvables + ip;
4219 if (!s->supplements)
4221 if (MAPTST(&im, ip))
4223 supp = s->repo->idarraydata + s->supplements;
4224 while ((sup = *supp++) != 0)
4225 if (dep_possible(solv, sup, &im))
4229 #ifdef CLEANDEPSDEBUG
4230 printf("%s supplemented\n", pool_solvid2str(pool, ip));
4233 queue_push(&iq, ip);
4239 ip = queue_shift(&iq);
4240 s = pool->solvables + ip;
4241 #ifdef CLEANDEPSDEBUG
4242 printf("adding back %s\n", pool_solvable2str(pool, s));
4246 reqp = s->repo->idarraydata + s->requires;
4247 while ((req = *reqp++) != 0)
4249 #ifdef ENABLE_COMPLEX_DEPS
4250 if (pool_is_complex_dep(pool, req))
4252 complex_cleandeps_addback(pool, ip, req, &im, &installedm, &iq, &userinstalled);
4256 FOR_PROVIDES(p, pp, req)
4261 FOR_PROVIDES(p, pp, req)
4263 if (MAPTST(&installedm, p))
4267 if (MAPTST(&userinstalled, p - installed->start))
4269 #ifdef CLEANDEPSDEBUG
4270 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4280 reqp = s->repo->idarraydata + s->recommends;
4281 while ((req = *reqp++) != 0)
4283 #ifdef ENABLE_COMPLEX_DEPS
4284 if (pool_is_complex_dep(pool, req))
4286 complex_cleandeps_addback(pool, ip, req, &im, &installedm, &iq, &userinstalled);
4290 FOR_PROVIDES(p, pp, req)
4295 FOR_PROVIDES(p, pp, req)
4297 if (MAPTST(&installedm, p))
4301 if (MAPTST(&userinstalled, p - installed->start))
4303 #ifdef CLEANDEPSDEBUG
4304 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4315 /* make sure the updatepkgs and mistakes are not in the cleandeps map */
4316 if (solv->cleandeps_updatepkgs)
4317 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
4318 MAPSET(&im, solv->cleandeps_updatepkgs->elements[i]);
4319 if (solv->cleandeps_mistakes)
4320 for (i = 0; i < solv->cleandeps_mistakes->count; i++)
4321 MAPSET(&im, solv->cleandeps_mistakes->elements[i]);
4322 /* also remove original iq packages */
4323 for (i = 0; i < iqcopy.count; i++)
4324 MAPSET(&im, iqcopy.elements[i]);
4325 queue_free(&iqcopy);
4326 for (p = installed->start; p < installed->end; p++)
4328 if (pool->solvables[p].repo != installed)
4330 if (!MAPTST(&im, p))
4331 MAPSET(cleandepsmap, p - installed->start);
4334 map_free(&installedm);
4335 map_free(&userinstalled);
4336 queue_free(&xsuppq);
4337 #ifdef CLEANDEPSDEBUG
4338 printf("=== final cleandeps map:\n");
4339 for (p = installed->start; p < installed->end; p++)
4340 if (MAPTST(cleandepsmap, p - installed->start))
4341 printf(" - %s\n", pool_solvid2str(pool, p));
4354 /* Tarjan's SCC algorithm, slightly modifed */
4356 trj_visit(struct trj_data *trj, Id node)
4359 Queue *edges = trj->edges;
4360 Id nnode, myidx, stackstart;
4363 low[node] = myidx = trj->idx++;
4364 low[(stackstart = trj->nstack++)] = node;
4365 for (i = edges->elements[node]; (nnode = edges->elements[i]) != 0; i++)
4370 if (!edges->elements[edges->elements[nnode]])
4376 trj_visit(trj, nnode);
4381 if (l < trj->firstidx)
4384 for (k = l; low[low[k]] == l; k++)
4387 else if (l < low[node])
4390 if (low[node] == myidx)
4392 if (myidx != trj->firstidx)
4394 for (i = stackstart; i < trj->nstack; i++)
4395 low[low[i]] = myidx;
4396 trj->nstack = stackstart;
4400 #ifdef ENABLE_COMPLEX_DEPS
4402 complex_unneeded(Pool *pool, Id ip, Id req, Queue *edges, Map *cleandepsmap, Queue *unneededq)
4409 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
4410 if (i == 0 || i == 1)
4415 for (i = 0; i < dq.count; i++)
4417 for (; (p = dq.elements[i]) != 0; i++)
4421 if (pool->solvables[-p].repo != pool->installed)
4425 if (p == ip || pool->solvables[p].repo != pool->installed || !MAPTST(cleandepsmap, p - pool->installed->start))
4427 for (j = 0; j < unneededq->count; j++)
4428 if (p == unneededq->elements[j])
4430 if (edges->elements[edges->count - 1] != j + 1)
4431 queue_push(edges, j + 1);
4435 while (dq.elements[i])
4443 solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered)
4445 Repo *installed = solv->installed;
4449 queue_empty(unneededq);
4450 if (!installed || installed->end == installed->start)
4453 map_init(&cleandepsmap, installed->end - installed->start);
4454 solver_createcleandepsmap(solv, &cleandepsmap, 1);
4455 for (i = installed->start; i < installed->end; i++)
4456 if (MAPTST(&cleandepsmap, i - installed->start))
4457 queue_push(unneededq, i);
4459 if (filtered && unneededq->count > 1)
4461 Pool *pool = solv->pool;
4465 int j, pass, count = unneededq->count;
4468 map_init(&installedm, pool->nsolvables);
4469 for (i = installed->start; i < installed->end; i++)
4470 if (pool->solvables[i].repo == installed)
4471 MAPSET(&installedm, i);
4473 nrequires = solv_calloc(count, sizeof(Id));
4475 queue_prealloc(&edges, count * 4 + 10); /* pre-size */
4478 * Go through the solvables in the nodes queue and create edges for
4479 * all requires/recommends/supplements between the nodes.
4480 * The edges are stored in the edges queue, we add 1 to the node
4481 * index so that nodes in the edges queue are != 0 and we can
4482 * terminate the edge list with 0.
4483 * Thus for node element 5, the edges are stored starting at
4484 * edges.elements[6] and are 0-terminated.
4486 /* leave first element zero to make things easier */
4487 /* also add trailing zero */
4488 queue_insertn(&edges, 0, 1 + count + 1, 0);
4490 /* first requires and recommends */
4491 for (i = 0; i < count; i++)
4493 Solvable *s = pool->solvables + unneededq->elements[i];
4494 int oldcount = edges.count;
4495 edges.elements[i + 1] = oldcount;
4496 for (pass = 0; pass < 2; pass++)
4498 unsigned int off = pass == 0 ? s->requires : s->recommends;
4501 for (dp = s->repo->idarraydata + off; (dep = *dp) != 0; dp++)
4503 #ifdef ENABLE_COMPLEX_DEPS
4504 if (pool_is_complex_dep(pool, dep))
4506 complex_unneeded(pool, s - pool->solvables, dep, &edges, &cleandepsmap, unneededq);
4510 FOR_PROVIDES(p, pp, dep)
4512 Solvable *sp = pool->solvables + p;
4513 if (s == sp || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
4515 for (j = 0; j < count; j++)
4516 if (p == unneededq->elements[j])
4518 if (edges.elements[edges.count - 1] != j + 1)
4519 queue_push(&edges, j + 1);
4524 nrequires[i] = edges.count - oldcount;
4526 queue_push(&edges, 0);
4529 printf("requires + recommends\n");
4530 for (i = 0; i < count; i++)
4533 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
4534 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
4535 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
4539 /* then add supplements */
4540 for (i = 0; i < count; i++)
4542 Solvable *s = pool->solvables + unneededq->elements[i];
4547 for (dp = s->repo->idarraydata + s->supplements; *dp; dp++)
4548 if (dep_possible(solv, *dp, &installedm))
4552 queue_init_buffer(&iq, iqbuf, sizeof(iqbuf)/sizeof(*iqbuf));
4553 dep_pkgcheck(solv, *dp, 0, &iq);
4554 for (k = 0; k < iq.count; k++)
4556 Id p = iq.elements[k];
4557 Solvable *sp = pool->solvables + p;
4558 if (p == unneededq->elements[i] || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
4560 for (j = 0; j < count; j++)
4561 if (p == unneededq->elements[j])
4563 /* now add edge from j + 1 to i + 1 */
4564 queue_insert(&edges, edges.elements[j + 1] + nrequires[j], i + 1);
4565 /* addapt following edge pointers */
4566 for (j = j + 2; j < count + 1; j++)
4567 edges.elements[j]++;
4575 printf("+ supplements\n");
4576 for (i = 0; i < count; i++)
4579 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
4580 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
4581 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
4584 map_free(&installedm);
4586 /* now run SCC algo two times, first with requires+recommends+supplements,
4587 * then again without the requires. We run it the second time to get rid
4588 * of packages that got dragged in via recommends/supplements */
4590 * low will contain the result of the SCC search.
4591 * it must be of at least size 2 * (count + 1) and
4592 * must be zero initialized.
4594 * 0 low low ... low stack stack ...stack 0
4597 low = solv_calloc(count + 1, 2 * sizeof(Id));
4598 for (pass = 0; pass < 2; pass++)
4600 struct trj_data trj;
4603 memset(low, 0, (count + 1) * (2 * sizeof(Id)));
4604 for (i = 0; i < count; i++)
4606 edges.elements[i + 1] += nrequires[i];
4607 if (!unneededq->elements[i])
4608 low[i + 1] = -1; /* ignore this node */
4613 trj.idx = count + 1; /* stack starts here */
4614 for (i = 1; i <= count; i++)
4618 if (edges.elements[edges.elements[i]])
4620 trj.firstidx = trj.nstack = trj.idx;
4625 Id myidx = trj.idx++;
4630 /* prune packages */
4631 for (i = 0; i < count; i++)
4632 if (low[i + 1] <= 0)
4633 unneededq->elements[i] = 0;
4636 solv_free(nrequires);
4639 /* finally remove all pruned entries from unneededq */
4640 for (i = j = 0; i < count; i++)
4641 if (unneededq->elements[i])
4642 unneededq->elements[j++] = unneededq->elements[i];
4643 queue_truncate(unneededq, j);
4645 map_free(&cleandepsmap);
4650 solver_breakorphans(Solver *solv)
4652 Pool *pool = solv->pool;
4653 Repo *installed = solv->installed;
4657 if (!installed || solv->droporphanedmap_all)
4659 solv->brokenorphanrules = solv_calloc(1, sizeof(Queue));
4660 queue_init(solv->brokenorphanrules);
4661 map_init(&m, installed->end - installed->start);
4662 for (i = 0; i < solv->orphaned.count; i++)
4664 Id p = solv->orphaned.elements[i];
4665 if (pool->solvables[p].repo != installed)
4667 if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - installed->start))
4669 MAPSET(&m, p - installed->start);
4671 for (rid = 1; rid < solv->pkgrules_end ; rid++)
4674 Rule *r = solv->rules + rid;
4675 /* ignore non-deps and simple conflicts */
4676 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 < 0))
4679 if (p < installed->start || p >= installed->end || !MAPTST(&m, p - installed->start))
4681 /* need to check other literals */
4682 if (r->d == 0 || r->d == -1)
4684 for (dp = pool->whatprovidesdata + (r->d < 0 ? -r->d - 1 : r->d); *dp < 0; dp++)
4687 if (p >= installed->start && p < installed->end && MAPTST(&m, p - installed->start))
4693 /* ok, disable this rule */
4694 queue_push(solv->brokenorphanrules, rid);
4696 solver_disablerule(solv, r);
4699 if (!solv->brokenorphanrules->count)
4701 queue_free(solv->brokenorphanrules);
4702 solv->brokenorphanrules = solv_free(solv->brokenorphanrules);
4707 solver_check_brokenorphanrules(Solver *solv, Queue *dq)
4709 Pool *pool = solv->pool;
4714 if (!solv->brokenorphanrules)
4716 for (i = 0; i < solv->brokenorphanrules->count; i++)
4718 int rid = solv->brokenorphanrules->elements[i];
4719 Rule *r = solv->rules + rid;
4720 FOR_RULELITERALS(l, pp, r)
4724 if (solv->decisionmap[-l] <= 0)
4729 if (solv->decisionmap[l] > 0 && pool->solvables[l].repo != solv->installed)
4735 FOR_RULELITERALS(l, pp, r)
4736 if (l > 0 && solv->decisionmap[l] == 0 && pool->solvables[l].repo != solv->installed)
4737 queue_pushunique(dq, l);