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 addrpmruleinfo(Solver *solv, Id p, 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_addrpmrulesforweak 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_AND || rd->flags == REL_COND)
57 if (!dep_possible(solv, rd->name, m))
59 return dep_possible(solv, rd->evr, m);
61 if (rd->flags == REL_OR)
63 if (dep_possible(solv, rd->name, m))
65 return dep_possible(solv, rd->evr, m);
67 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
68 return solver_splitprovides(solv, rd->evr);
69 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
70 return solver_dep_installed(solv, rd->evr);
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 /*-------------------------------------------------------------------
246 * p = direct literal; always < 0 for installed rpm rules
247 * d, if < 0 direct literal, if > 0 offset into whatprovides, if == 0 rule is assertion (look at p only)
250 * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
252 * p < 0 : pkg id of A
253 * d > 0 : Offset in whatprovidesdata (list of providers of b)
255 * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
256 * p < 0 : pkg id of A
257 * d < 0 : Id of solvable (e.g. B1)
259 * d == 0: unary rule, assertion => (A) or (-A)
261 * Install: p > 0, d = 0 (A) user requested install
262 * Remove: p < 0, d = 0 (-A) user requested remove (also: uninstallable)
263 * Requires: p < 0, d > 0 (-A|B1|B2|...) d: <list of providers for requirement of p>
264 * Requires: p > 0, d < 0 (B|-A) hack to save a whatprovides allocation, gets converted into (-A|B)
265 * Updates: p > 0, d > 0 (A|B1|B2|...) d: <list of updates for solvable p>
266 * Conflicts: p < 0, d < 0 (-A|-B) either p (conflict issuer) or d (conflict provider) (binary rule)
267 * also used for obsoletes
268 * No-op ?: p = 0, d = 0 (null) (used as placeholder in update/feature rules)
272 * Direct assertion (no watch needed) --> d = 0, w1 = p, w2 = 0
273 * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
274 * every other : w1 = p, w2 = whatprovidesdata[d];
276 * always returns a rule for non-rpm rules
280 solver_addrule(Solver *solv, Id p, Id d)
282 Pool *pool = solv->pool;
286 int n = 0; /* number of literals in rule - 1
287 0 = direct assertion (single literal)
289 >1 = multi-literal rule
292 /* it often happenes that requires lead to adding the same rpm rule
293 * multiple times, so we prune those duplicates right away to make
294 * the work for unifyrules a bit easier */
296 if (!solv->rpmrules_end) /* we add rpm rules */
298 r = solv->rules + solv->nrules - 1; /* get the last added rule */
299 if (r->p == p && r->d == d && (d != 0 || !r->w2))
303 /* compute number of literals (n) in rule */
307 return 0; /* rule is self-fulfilling */
309 d = 0; /* normalize to assertion */
311 n = 1; /* binary rule */
315 for (dp = pool->whatprovidesdata + d; *dp; dp++, n++)
317 return 0; /* rule is self-fulfilling */
318 if (n == 1) /* convert to binary rule */
322 if (n == 1 && p > d && !solv->rpmrules_end)
324 /* put smallest literal first so we can find dups */
325 n = p; p = d; d = n; /* p <-> d */
326 n = 1; /* re-set n, was used as temp var */
330 * check for duplicate (r is only set if we're adding rpm rules)
334 /* check if the last added rule (r) is exactly the same as what we're looking for. */
335 if (n == 1 && !r->d && r->p == p && r->w2 == d)
337 /* have n-ary rule with same first literal, check other literals */
338 if (n > 1 && r->d && r->p == p)
340 /* Rule where d is an offset in whatprovidesdata */
344 dp2 = pool->whatprovidesdata + r->d;
345 for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
354 * allocate new rule r
356 solv->rules = solv_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
357 r = solv->rules + solv->nrules++; /* point to rule space */
362 /* direct assertion, no watch needed */
378 r->w2 = pool->whatprovidesdata[d];
383 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
385 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " Add rule: ");
386 solver_printrule(solv, SOLV_DEBUG_RULE_CREATION, r);
393 solver_shrinkrules(Solver *solv, int nrules)
395 solv->nrules = nrules;
396 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
399 /******************************************************************************
401 *** rpm rule part: create rules representing the package dependencies
406 * special multiversion patch conflict handling:
407 * a patch conflict is also satisfied if some other
408 * version with the same name/arch that doesn't conflict
409 * gets installed. The generated rule is thus:
410 * -patch|-cpack|opack1|opack2|...
413 makemultiversionconflict(Solver *solv, Id n, Id con)
415 Pool *pool = solv->pool;
420 sn = pool->solvables + n;
421 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
423 FOR_PROVIDES(p, pp, sn->name)
425 s = pool->solvables + p;
426 if (s->name != sn->name || s->arch != sn->arch)
428 if (!MAPTST(&solv->multiversion, p))
430 if (pool_match_nevr(pool, pool->solvables + p, con))
432 /* here we have a multiversion solvable that doesn't conflict */
433 /* thus we're not in conflict if it is installed */
437 n = -n; /* no other package found, generate normal conflict */
439 n = pool_queuetowhatprovides(pool, &q);
445 addrpmrule(Solver *solv, Id p, Id d, int type, Id dep)
447 if (!solv->ruleinfoq)
448 solver_addrule(solv, p, d);
450 addrpmruleinfo(solv, p, d, type, dep);
453 #ifdef ENABLE_LINKED_PKGS
456 addlinks(Solver *solv, Solvable *s, Id req, Queue *qr, Id prv, Queue *qp, Map *m, Queue *workq)
458 Pool *pool = solv->pool;
463 printf("ADDLINKS %s\n -> %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
464 for (i = 0; i < qr->count; i++)
465 printf(" - %s\n", pool_solvid2str(pool, qr->elements[i]));
466 printf(" <- %s\n", pool_dep2str(pool, prv));
467 for (i = 0; i < qp->count; i++)
468 printf(" - %s\n", pool_solvid2str(pool, qp->elements[i]));
472 addrpmrule(solv, qr->elements[0], -(s - pool->solvables), SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
474 addrpmrule(solv, -(s - pool->solvables), pool_queuetowhatprovides(pool, qr), SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
477 Id d = pool_queuetowhatprovides(pool, qp);
478 for (i = 0; i < qr->count; i++)
479 addrpmrule(solv, -qr->elements[i], d, SOLVER_RULE_RPM_PACKAGE_REQUIRES, prv);
483 for (i = 0; i < qr->count; i++)
484 addrpmrule(solv, qp->elements[0], -qr->elements[i], SOLVER_RULE_RPM_PACKAGE_REQUIRES, prv);
487 return; /* nothing more to do if called from getrpmruleinfos() */
488 for (i = 0; i < qr->count; i++)
489 if (!MAPTST(m, qr->elements[i]))
490 queue_push(workq, qr->elements[i]);
491 for (i = 0; i < qp->count; i++)
492 if (!MAPTST(m, qp->elements[i]))
493 queue_push(workq, qp->elements[i]);
494 if (solv->installed && s->repo == solv->installed)
496 Repo *installed = solv->installed;
497 /* record installed buddies */
498 if (!solv->instbuddy)
499 solv->instbuddy = solv_calloc(installed->end - installed->start, sizeof(Id));
501 solv->instbuddy[s - pool->solvables - installed->start] = qr->elements[0];
502 for (i = 0; i < qr->count; i++)
504 Id p = qr->elements[i];
505 if (pool->solvables[p].repo != installed)
507 if (qp->count > 1 || (solv->instbuddy[p - installed->start] != 0 && solv->instbuddy[p - installed->start] != s - pool->solvables))
508 solv->instbuddy[p - installed->start] = 1; /* 1: ambiguous buddy */
510 solv->instbuddy[p - installed->start] = s - pool->solvables;
516 add_package_link(Solver *solv, Solvable *s, Map *m, Queue *workq)
522 find_package_link(solv->pool, s, &req, &qr, &prv, &qp);
524 addlinks(solv, s, req, &qr, prv, &qp, m, workq);
531 #ifdef ENABLE_COMPLEX_DEPS
534 add_complex_deprules(Solver *solv, Id p, Id dep, int type, int dontfix, Queue *workq, Map *m)
536 Pool *pool = solv->pool;
537 Repo *installed = solv->installed;
543 /* CNF expansion for requires, DNF + INVERT expansion for conflicts */
544 i = pool_normalize_complex_dep(pool, dep, &bq, type == SOLVER_RULE_RPM_PACKAGE_REQUIRES ? 0 : (CPLXDEPS_TODNF | CPLXDEPS_EXPAND | CPLXDEPS_INVERT));
545 /* handle special cases */
550 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken dependency %s of installed package %s\n", pool_dep2str(pool, dep), pool_solvid2str(pool, p));
554 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvid2str(pool, p), p, pool_dep2str(pool, dep));
555 addrpmrule(solv, -p, 0, type == SOLVER_RULE_RPM_PACKAGE_REQUIRES ? SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP : type, dep);
566 /* go through all blocks and add a rule for each block */
567 for (i = 0; i < bq.count; i++)
571 if (bq.elements[i] == pool->nsolvables)
573 /* conventional requires (cannot be a conflicts as they have been expanded) */
574 Id *dp = pool->whatprovidesdata + bq.elements[i + 1];
578 for (j = 0; dp[j] != 0; j++)
579 if (pool->solvables[dp[j]].repo == installed)
580 break; /* provider was installed */
583 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", pool_dep2str(pool, dep), pool_solvid2str(pool, p));
589 /* nothing provides req! */
590 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvid2str(pool, p), p, pool_dep2str(pool, dep));
591 addrpmrule(solv, -p, 0, SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP, dep);
594 addrpmrule(solv, -p, dp - pool->whatprovidesdata, SOLVER_RULE_RPM_PACKAGE_REQUIRES, dep);
595 /* push all non-visited providers on the work queue */
599 queue_push(workq, *dp);
602 if (!bq.elements[i + 1])
604 Id p2 = bq.elements[i];
605 /* simple rule with just two literals */
606 if (dontfix && p2 < 0 && pool->solvables[-p2].repo == installed)
608 if (dontfix && p2 > 0 && pool->solvables[p2].repo != installed)
614 if (type == SOLVER_RULE_RPM_PACKAGE_CONFLICT)
616 if (pool->forbidselfconflicts && !is_otherproviders_dep(pool, dep))
617 addrpmrule(solv, -p, 0, SOLVER_RULE_RPM_SELF_CONFLICT, dep);
620 addrpmrule(solv, -p, 0, type, dep);
624 addrpmrule(solv, p2, -p, type, dep); /* hack so that we don't need pool_queuetowhatprovides */
626 addrpmrule(solv, -p, p2, type, dep);
627 if (m && p2 > 0 && !MAPTST(m, p2))
628 queue_push(workq, p2);
635 qele = bq.elements + i;
637 while (bq.elements[i])
642 for (j = 0; j < qcnt; j++)
644 if (qele[j] > 0 && pool->solvables[qele[j]].repo == installed)
646 if (qele[j] < 0 && pool->solvables[-qele[j]].repo != installed)
652 /* add -p to (ordered) rule (overwriting the trailing zero) */
655 if (j == qcnt || qele[j] > -p)
658 memmove(qele + j + 1, qele + j, (qcnt - j) * sizeof(Id));
666 /* check if the rule contains both p and -p */
667 for (j = 0; j < qcnt; j++)
672 /* hack: create fake queue 'q' so that we can call pool_queuetowhatprovides */
674 memset(&q, 0, sizeof(q));
676 q.elements = qele + 1;
677 addrpmrule(solv, qele[0], pool_queuetowhatprovides(pool, &q), type, dep);
679 for (j = 0; j < qcnt; j++)
680 if (qele[j] > 0 && !MAPTST(m, qele[j]))
681 queue_push(workq, qele[j]);
690 /*-------------------------------------------------------------------
692 * add (install) rules for solvable
694 * s: Solvable for which to add rules
695 * m: m[s] = 1 for solvables which have rules, prevent rule duplication
697 * Algorithm: 'visit all nodes of a graph'. The graph nodes are
698 * solvables, the edges their dependencies.
699 * Starting from an installed solvable, this will create all rules
700 * representing the graph created by the solvables dependencies.
702 * for unfulfilled requirements, conflicts, obsoletes,....
703 * add a negative assertion for solvables that are not installable
705 * It will also create rules for all solvables referenced by 's'
706 * i.e. descend to all providers of requirements of 's'
711 solver_addrpmrulesforsolvable(Solver *solv, Solvable *s, Map *m)
713 Pool *pool = solv->pool;
714 Repo *installed = solv->installed;
716 Queue workq; /* list of solvables we still have to work on */
720 int dontfix; /* ignore dependency errors for installed solvables */
726 Id p, pp; /* whatprovides loops */
727 Id *dp; /* ptr to 'whatprovides' */
728 Id n; /* Id for current solvable 's' */
730 queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
731 queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
733 /* loop until there's no more work left */
738 * s: Pointer to solvable
741 n = queue_shift(&workq); /* 'pop' next solvable to work on from queue */
744 if (MAPTST(m, n)) /* continue if already visited */
746 MAPSET(m, n); /* mark as visited */
749 s = pool->solvables + n;
752 if (installed /* Installed system available */
753 && s->repo == installed /* solvable is installed */
754 && !solv->fixmap_all /* NOT repair errors in rpm dependency graph */
755 && !(solv->fixmap.size && MAPTST(&solv->fixmap, n - installed->start)))
757 dontfix = 1; /* dont care about broken rpm deps */
762 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC
763 ? pool_disabled_solvable(pool, s)
764 : !pool_installable(pool, s))
766 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", pool_solvid2str(pool, n), n);
767 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOT_INSTALLABLE, 0);
771 #ifdef ENABLE_LINKED_PKGS
772 /* add pseudo-package <-> real-package links */
773 if (has_package_link(pool, s))
774 add_package_link(solv, s, m, &workq);
777 /*-----------------------------------------
778 * check requires of s
783 reqp = s->repo->idarraydata + s->requires;
784 while ((req = *reqp++) != 0) /* go through all requires */
786 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
789 #ifdef ENABLE_COMPLEX_DEPS
790 if (pool_is_complex_dep(pool, req))
792 /* we have AND/COND deps, normalize */
793 add_complex_deprules(solv, n, req, SOLVER_RULE_RPM_PACKAGE_REQUIRES, dontfix, &workq, m);
798 /* find list of solvables providing 'req' */
799 dp = pool_whatprovides_ptr(pool, req);
801 if (*dp == SYSTEMSOLVABLE) /* always installed */
806 /* the strategy here is to not insist on dependencies
807 * that are already broken. so if we find one provider
808 * that was already installed, we know that the
809 * dependency was not broken before so we enforce it */
810 for (i = 0; (p = dp[i]) != 0; i++)
811 if (pool->solvables[p].repo == installed)
812 break; /* found installed provider */
815 /* didn't find an installed provider: previously broken dependency */
816 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s));
823 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvid2str(pool, n), n, pool_dep2str(pool, req));
824 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP, req);
828 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
830 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION," %s requires %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
831 for (i = 0; dp[i]; i++)
832 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " provided by %s\n", pool_solvid2str(pool, dp[i]));
835 /* add 'requires' dependency */
836 /* rule: (-requestor|provider1|provider2|...|providerN) */
837 addrpmrule(solv, -n, dp - pool->whatprovidesdata, SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
839 /* push all non-visited providers on the work queue */
843 queue_push(&workq, *dp);
847 /* that's all we check for src packages */
848 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
851 /*-----------------------------------------
852 * check conflicts of s
859 /* we treat conflicts in patches a bit differen:
861 * - multiversion handling
862 * XXX: we should really handle this different, looking
863 * at the name is a bad hack
865 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
867 conp = s->repo->idarraydata + s->conflicts;
868 /* foreach conflicts of 's' */
869 while ((con = *conp++) != 0)
871 #ifdef ENABLE_COMPLEX_DEPS
872 if (!ispatch && pool_is_complex_dep(pool, con))
874 /* we have AND/COND deps, normalize */
875 add_complex_deprules(solv, n, con, SOLVER_RULE_RPM_PACKAGE_CONFLICT, dontfix, &workq, m);
879 /* foreach providers of a conflict of 's' */
880 FOR_PROVIDES(p, pp, con)
882 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
884 /* dontfix: dont care about conflicts with already installed packs */
885 if (dontfix && pool->solvables[p].repo == installed)
887 if (p == n) /* p == n: self conflict */
889 if (!pool->forbidselfconflicts || is_otherproviders_dep(pool, con))
891 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_SELF_CONFLICT, con);
894 if (ispatch && solv->multiversion.size && MAPTST(&solv->multiversion, p) && ISRELDEP(con))
896 /* our patch conflicts with a multiversion package */
897 p = -makemultiversionconflict(solv, p, con);
899 /* rule: -n|-p: either solvable _or_ provider of conflict */
900 addrpmrule(solv, -n, p == SYSTEMSOLVABLE ? 0 : -p, SOLVER_RULE_RPM_PACKAGE_CONFLICT, con);
905 /*-----------------------------------------
906 * check obsoletes and implicit obsoletes of a package
907 * if ignoreinstalledsobsoletes is not set, we're also checking
908 * obsoletes of installed packages (like newer rpm versions)
910 if ((!installed || s->repo != installed) || !pool->noinstalledobsoletes)
912 int multi = solv->multiversion.size && MAPTST(&solv->multiversion, n);
913 int isinstalled = (installed && s->repo == installed);
914 if (s->obsoletes && (!multi || solv->keepexplicitobsoletes))
916 obsp = s->repo->idarraydata + s->obsoletes;
917 /* foreach obsoletes */
918 while ((obs = *obsp++) != 0)
920 /* foreach provider of an obsoletes of 's' */
921 FOR_PROVIDES(p, pp, obs)
923 Solvable *ps = pool->solvables + p;
926 if (isinstalled && dontfix && ps->repo == installed)
927 continue; /* don't repair installed/installed problems */
928 if (!pool->obsoleteusesprovides /* obsoletes are matched names, not provides */
929 && !pool_match_nevr(pool, ps, obs))
931 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
934 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_PACKAGE_OBSOLETES, obs);
936 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES, obs);
940 /* check implicit obsoletes
941 * for installed packages we only need to check installed/installed problems (and
942 * only when dontfix is not set), as the others are picked up when looking at the
943 * uninstalled package.
945 if (!isinstalled || !dontfix)
947 FOR_PROVIDES(p, pp, s->name)
949 Solvable *ps = pool->solvables + p;
952 if (isinstalled && ps->repo != installed)
954 /* we still obsolete packages with same nevra, like rpm does */
955 /* (actually, rpm mixes those packages. yuck...) */
956 if (multi && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
958 if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
960 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
962 if (s->name == ps->name)
963 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_SAME_NAME, 0);
965 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_IMPLICIT_OBSOLETES, s->name);
970 if (m && pool->implicitobsoleteusescolors && (s->arch > pool->lastarch || pool->id2arch[s->arch] != 1))
972 int a = pool->id2arch[s->arch];
973 /* check lock-step candidates */
974 FOR_PROVIDES(p, pp, s->name)
976 Solvable *ps = pool->solvables + p;
977 if (s->name != ps->name || s->evr != ps->evr || MAPTST(m, p))
979 if (ps->arch > pool->lastarch || pool->id2arch[ps->arch] == 1 || pool->id2arch[ps->arch] >= a)
981 queue_push(&workq, p);
985 /*-----------------------------------------
986 * add recommends to the work queue
988 if (s->recommends && m)
990 recp = s->repo->idarraydata + s->recommends;
991 while ((rec = *recp++) != 0)
993 FOR_PROVIDES(p, pp, rec)
995 queue_push(&workq, p);
998 if (s->suggests && m)
1000 sugp = s->repo->idarraydata + s->suggests;
1001 while ((sug = *sugp++) != 0)
1003 FOR_PROVIDES(p, pp, sug)
1005 queue_push(&workq, p);
1012 #ifdef ENABLE_LINKED_PKGS
1014 solver_addrpmrulesforlinked(Solver *solv, Map *m)
1016 Pool *pool = solv->pool;
1022 for (i = 1; i < pool->nsolvables; i++)
1026 s = pool->solvables + i;
1027 if (!s->repo || s->repo == solv->installed)
1029 if (!strchr(pool_id2str(pool, s->name), ':'))
1031 if (!pool_installable(pool, s))
1033 find_package_link(pool, s, 0, &qr, 0, 0);
1036 for (j = 0; j < qr.count; j++)
1037 if (MAPTST(m, qr.elements[j]))
1039 solver_addrpmrulesforsolvable(solv, s, m);
1049 /*-------------------------------------------------------------------
1051 * Add rules for packages possibly selected in by weak dependencies
1053 * m: already added solvables
1057 solver_addrpmrulesforweak(Solver *solv, Map *m)
1059 Pool *pool = solv->pool;
1064 /* foreach solvable in pool */
1065 for (i = n = 1; n < pool->nsolvables; i++, n++)
1067 if (i == pool->nsolvables) /* wrap i */
1069 if (MAPTST(m, i)) /* already added that one */
1072 s = pool->solvables + i;
1075 if (s->repo != pool->installed && !pool_installable(pool, s))
1076 continue; /* only look at installable ones */
1081 /* find possible supplements */
1082 supp = s->repo->idarraydata + s->supplements;
1083 while ((sup = *supp++) != 0)
1084 if (dep_possible(solv, sup, m))
1088 /* if nothing found, check for enhances */
1089 if (!sup && s->enhances)
1091 supp = s->repo->idarraydata + s->enhances;
1092 while ((sup = *supp++) != 0)
1093 if (dep_possible(solv, sup, m))
1096 /* if nothing found, goto next solvables */
1099 solver_addrpmrulesforsolvable(solv, s, m);
1100 n = 0; /* check all solvables again because we added solvables to m */
1105 /*-------------------------------------------------------------------
1107 * add package rules for possible updates
1110 * m: map of already visited solvables
1111 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1115 solver_addrpmrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
1117 Pool *pool = solv->pool;
1119 /* queue and buffer for it */
1123 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1124 /* find update candidates for 's' */
1125 policy_findupdatepackages(solv, s, &qs, allow_all);
1126 /* add rule for 's' if not already done */
1127 if (!MAPTST(m, s - pool->solvables))
1128 solver_addrpmrulesforsolvable(solv, s, m);
1129 /* foreach update candidate, add rule if not already done */
1130 for (i = 0; i < qs.count; i++)
1131 if (!MAPTST(m, qs.elements[i]))
1132 solver_addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
1137 /***********************************************************************
1139 *** Update/Feature rule part
1141 *** Those rules make sure an installed package isn't silently deleted
1146 finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
1148 Pool *pool = solv->pool;
1151 policy_findupdatepackages(solv, s, qs, allow_all ? allow_all : 2);
1155 return 0; /* orphaned, don't create feature rule */
1156 /* check if this is an orphaned package */
1157 policy_findupdatepackages(solv, s, qs, 1);
1159 return 0; /* orphaned, don't create update rule */
1161 return -SYSTEMSOLVABLE; /* supported but not installable */
1164 return s - pool->solvables;
1165 /* check if it is ok to keep the installed package */
1166 for (i = 0; i < qs->count; i++)
1168 Solvable *ns = pool->solvables + qs->elements[i];
1169 if (s->evr == ns->evr && solvable_identical(s, ns))
1170 return s - pool->solvables;
1172 /* nope, it must be some other package */
1173 return -SYSTEMSOLVABLE;
1176 /* add packages from the dup repositories to the update candidates
1177 * this isn't needed for the global dup mode as all packages are
1178 * from dup repos in that case */
1180 addduppackages(Solver *solv, Solvable *s, Queue *qs)
1185 int oldnoupdateprovide = solv->noupdateprovide;
1187 queue_init_buffer(&dupqs, dupqsbuf, sizeof(dupqsbuf)/sizeof(*dupqsbuf));
1188 solv->noupdateprovide = 1;
1189 policy_findupdatepackages(solv, s, &dupqs, 2);
1190 solv->noupdateprovide = oldnoupdateprovide;
1191 for (i = 0; i < dupqs.count; i++)
1193 p = dupqs.elements[i];
1194 if (MAPTST(&solv->dupmap, p))
1195 queue_pushunique(qs, p);
1200 /*-------------------------------------------------------------------
1202 * add rule for update
1203 * (A|A1|A2|A3...) An = update candidates for A
1205 * s = (installed) solvable
1209 solver_addupdaterule(Solver *solv, Solvable *s, int allow_all)
1211 /* installed packages get a special upgrade allowed rule */
1212 Pool *pool = solv->pool;
1217 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1218 p = s - pool->solvables;
1219 /* find update candidates for 's' */
1220 if (solv->dupmap_all)
1221 p = finddistupgradepackages(solv, s, &qs, allow_all);
1224 policy_findupdatepackages(solv, s, &qs, allow_all);
1225 if (!allow_all && solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
1226 addduppackages(solv, s, &qs);
1229 #ifdef ENABLE_LINKED_PKGS
1230 if (solv->instbuddy && solv->instbuddy[s - pool->solvables - solv->installed->start])
1232 const char *name = pool_id2str(pool, s->name);
1233 if (strncmp(name, "pattern:", 8) == 0 || strncmp(name, "application:", 12) == 0)
1235 /* a linked pseudo package. As it is linked, we do not need an update rule */
1236 /* nevertheless we set specialupdaters so we can update */
1237 solver_addrule(solv, 0, 0);
1238 if (!allow_all && qs.count)
1240 if (p != -SYSTEMSOLVABLE)
1241 queue_unshift(&qs, p);
1242 if (!solv->specialupdaters)
1243 solv->specialupdaters = solv_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
1244 solv->specialupdaters[s - pool->solvables - solv->installed->start] = pool_queuetowhatprovides(pool, &qs);
1252 if (!allow_all && !p && solv->dupmap_all)
1254 queue_push(&solv->orphaned, s - pool->solvables); /* an orphaned package */
1255 if (solv->keep_orphans && !(solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, s - pool->solvables - solv->installed->start))))
1256 p = s - pool->solvables; /* keep this orphaned package installed */
1259 if (!allow_all && qs.count && solv->multiversion.size)
1263 for (i = 0; i < qs.count; i++)
1264 if (MAPTST(&solv->multiversion, qs.elements[i]))
1268 /* filter out all multiversion packages as they don't update */
1269 d = pool_queuetowhatprovides(pool, &qs);
1270 for (j = i; i < qs.count; i++)
1272 if (MAPTST(&solv->multiversion, qs.elements[i]))
1274 Solvable *ps = pool->solvables + qs.elements[i];
1275 /* if keepexplicitobsoletes is set and the name is different,
1276 * we assume that there is an obsoletes. XXX: not 100% correct */
1277 if (solv->keepexplicitobsoletes && ps->name != s->name)
1279 qs.elements[j++] = qs.elements[i];
1282 /* it's ok if they have same nevra */
1283 if (ps->name != s->name || ps->evr != s->evr || ps->arch != s->arch)
1286 qs.elements[j++] = qs.elements[i];
1290 if (d && solv->installed && s->repo == solv->installed &&
1291 (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, s - pool->solvables - solv->installed->start))))
1293 if (!solv->specialupdaters)
1294 solv->specialupdaters = solv_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
1295 solv->specialupdaters[s - pool->solvables - solv->installed->start] = d;
1297 if (j == 0 && p == -SYSTEMSOLVABLE && solv->dupmap_all)
1299 queue_push(&solv->orphaned, s - pool->solvables); /* also treat as orphaned */
1304 else if (p != -SYSTEMSOLVABLE)
1306 /* could fallthrough, but then we would do pool_queuetowhatprovides twice */
1308 solver_addrule(solv, p, d); /* allow update of s */
1313 if (qs.count && p == -SYSTEMSOLVABLE)
1314 p = queue_shift(&qs);
1315 d = qs.count ? pool_queuetowhatprovides(pool, &qs) : 0;
1317 solver_addrule(solv, p, d); /* allow update of s */
1321 disableupdaterule(Solver *solv, Id p)
1325 MAPSET(&solv->noupdate, p - solv->installed->start);
1326 r = solv->rules + solv->updaterules + (p - solv->installed->start);
1327 if (r->p && r->d >= 0)
1328 solver_disablerule(solv, r);
1329 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1330 if (r->p && r->d >= 0)
1331 solver_disablerule(solv, r);
1332 if (solv->bestrules_pkg)
1335 ni = solv->bestrules_end - solv->bestrules;
1336 for (i = 0; i < ni; i++)
1337 if (solv->bestrules_pkg[i] == p)
1338 solver_disablerule(solv, solv->rules + solv->bestrules + i);
1343 reenableupdaterule(Solver *solv, Id p)
1345 Pool *pool = solv->pool;
1348 MAPCLR(&solv->noupdate, p - solv->installed->start);
1349 r = solv->rules + solv->updaterules + (p - solv->installed->start);
1354 solver_enablerule(solv, r);
1355 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1357 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1358 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1364 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1365 if (r->p && r->d < 0)
1367 solver_enablerule(solv, r);
1368 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1370 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1371 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1375 if (solv->bestrules_pkg)
1378 ni = solv->bestrules_end - solv->bestrules;
1379 for (i = 0; i < ni; i++)
1380 if (solv->bestrules_pkg[i] == p)
1381 solver_enablerule(solv, solv->rules + solv->bestrules + i);
1386 /***********************************************************************
1388 *** Infarch rule part
1390 *** Infarch rules make sure the solver uses the best architecture of
1391 *** a package if multiple archetectures are available
1396 solver_addinfarchrules(Solver *solv, Map *addedmap)
1398 Pool *pool = solv->pool;
1399 Repo *installed = pool->installed;
1401 Id p, pp, a, aa, bestarch;
1402 Solvable *s, *ps, *bests;
1403 Queue badq, allowedarchs;
1407 queue_init(&allowedarchs);
1409 solv->infarchrules = solv->nrules;
1410 for (i = 1; i < pool->nsolvables; i++)
1412 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1414 s = pool->solvables + i;
1418 queue_empty(&allowedarchs);
1419 FOR_PROVIDES(p, pp, s->name)
1421 ps = pool->solvables + p;
1422 if (ps->name != s->name || !MAPTST(addedmap, p))
1429 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1430 if (a != 1 && installed && ps->repo == installed)
1432 if (!solv->dupmap_all && !(solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1433 queue_pushunique(&allowedarchs, ps->arch); /* also ok to keep this architecture */
1434 continue; /* ignore installed solvables when calculating the best arch */
1436 if (a && a != 1 && (!bestarch || a < bestarch))
1445 /* speed up common case where installed package already has best arch */
1446 if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch)
1447 allowedarchs.count--; /* installed arch is best */
1449 if (allowedarchs.count && pool->implicitobsoleteusescolors && installed && bestarch)
1451 /* need an extra pass for lockstep checking: we only allow to keep an inferior arch
1452 * if the corresponding installed package is not lock-stepped */
1453 queue_empty(&allowedarchs);
1454 FOR_PROVIDES(p, pp, s->name)
1457 ps = pool->solvables + p;
1458 if (ps->name != s->name || ps->repo != installed || !MAPTST(addedmap, p))
1460 if (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1463 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1466 queue_pushunique(&allowedarchs, ps->arch); /* strange arch, allow */
1469 if (a == 1 || ((a ^ bestarch) & 0xffff0000) == 0)
1471 /* have installed package with inferior arch, check if lock-stepped */
1472 FOR_PROVIDES(p2, pp2, s->name)
1474 Solvable *s2 = pool->solvables + p2;
1476 if (p2 == p || s2->name != s->name || s2->evr != pool->solvables[p].evr || s2->arch == pool->solvables[p].arch)
1479 a2 = (a2 <= pool->lastarch) ? pool->id2arch[a2] : 0;
1480 if (a2 && (a2 == 1 || ((a2 ^ bestarch) & 0xffff0000) == 0))
1484 queue_pushunique(&allowedarchs, ps->arch);
1488 /* find all bad packages */
1490 FOR_PROVIDES(p, pp, s->name)
1492 ps = pool->solvables + p;
1493 if (ps->name != s->name || !MAPTST(addedmap, p))
1496 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1497 if (a != 1 && bestarch && ((a ^ bestarch) & 0xffff0000) != 0)
1499 if (installed && ps->repo == installed)
1501 if (pool->implicitobsoleteusescolors)
1502 queue_push(&badq, p); /* special lock-step handling, see below */
1503 continue; /* always ok to keep an installed package */
1505 for (j = 0; j < allowedarchs.count; j++)
1507 aa = allowedarchs.elements[j];
1510 aa = (aa <= pool->lastarch) ? pool->id2arch[aa] : 0;
1511 if (aa && ((a ^ aa) & 0xffff0000) == 0)
1512 break; /* compatible */
1514 if (j == allowedarchs.count)
1515 queue_push(&badq, p);
1519 /* block all solvables in the badq! */
1520 for (j = 0; j < badq.count; j++)
1522 p = badq.elements[j];
1524 if (pool->implicitobsoleteusescolors)
1527 int haveinstalled = 0;
1529 FOR_PROVIDES(p2, pp, s->name)
1531 Solvable *s2 = pool->solvables + p2;
1532 if (p2 == p || s2->name != s->name || s2->evr != pool->solvables[p].evr || s2->arch == pool->solvables[p].arch)
1535 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1536 if (a && (a == 1 || ((a ^ bestarch) & 0xffff000) == 0))
1538 queue_push(&lsq, p2);
1539 if (installed && s2->repo == installed)
1543 if (installed && pool->solvables[p].repo == installed && !haveinstalled)
1544 continue; /* installed package not in lock-step */
1546 solver_addrule(solv, -p, lsq.count ? pool_queuetowhatprovides(pool, &lsq) : 0);
1551 queue_free(&allowedarchs);
1552 solv->infarchrules_end = solv->nrules;
1556 disableinfarchrule(Solver *solv, Id name)
1558 Pool *pool = solv->pool;
1561 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1563 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1564 solver_disablerule(solv, r);
1569 reenableinfarchrule(Solver *solv, Id name)
1571 Pool *pool = solv->pool;
1574 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1576 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1578 solver_enablerule(solv, r);
1579 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1581 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1582 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1589 /***********************************************************************
1593 *** Dup rules make sure a package is selected from the specified dup
1594 *** repositories if an update candidate is included in one of them.
1599 add_cleandeps_package(Solver *solv, Id p)
1601 if (!solv->cleandeps_updatepkgs)
1603 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
1604 queue_init(solv->cleandeps_updatepkgs);
1606 queue_pushunique(solv->cleandeps_updatepkgs, p);
1610 solver_addtodupmaps(Solver *solv, Id p, Id how, int targeted)
1612 Pool *pool = solv->pool;
1613 Solvable *ps, *s = pool->solvables + p;
1614 Repo *installed = solv->installed;
1615 Id pi, pip, obs, *obsp;
1617 MAPSET(&solv->dupinvolvedmap, p);
1619 MAPSET(&solv->dupmap, p);
1620 FOR_PROVIDES(pi, pip, s->name)
1622 ps = pool->solvables + pi;
1623 if (ps->name != s->name)
1625 MAPSET(&solv->dupinvolvedmap, pi);
1626 if (targeted && ps->repo == installed && solv->obsoletes && solv->obsoletes[pi - installed->start])
1629 for (opp = solv->obsoletes_data + solv->obsoletes[pi - installed->start]; (pi2 = *opp++) != 0;)
1630 if (pool->solvables[pi2].repo != installed)
1631 MAPSET(&solv->dupinvolvedmap, pi2);
1633 if (ps->repo == installed && (how & SOLVER_FORCEBEST) != 0)
1635 if (!solv->bestupdatemap.size)
1636 map_grow(&solv->bestupdatemap, installed->end - installed->start);
1637 MAPSET(&solv->bestupdatemap, pi - installed->start);
1639 if (ps->repo == installed && (how & SOLVER_CLEANDEPS) != 0)
1640 add_cleandeps_package(solv, pi);
1641 if (!targeted && ps->repo != installed)
1642 MAPSET(&solv->dupmap, pi);
1644 if (s->repo == installed && solv->obsoletes && solv->obsoletes[p - installed->start])
1647 for (opp = solv->obsoletes_data + solv->obsoletes[p - installed->start]; (pi = *opp++) != 0;)
1649 ps = pool->solvables + pi;
1650 if (ps->repo == installed)
1652 MAPSET(&solv->dupinvolvedmap, pi);
1654 MAPSET(&solv->dupmap, pi);
1657 if (targeted && s->repo != installed && s->obsoletes)
1659 /* XXX: check obsoletes/provides combination */
1660 obsp = s->repo->idarraydata + s->obsoletes;
1661 while ((obs = *obsp++) != 0)
1663 FOR_PROVIDES(pi, pip, obs)
1665 Solvable *ps = pool->solvables + pi;
1666 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1668 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1670 MAPSET(&solv->dupinvolvedmap, pi);
1671 if (targeted && ps->repo == installed && solv->obsoletes && solv->obsoletes[pi - installed->start])
1674 for (opp = solv->obsoletes_data + solv->obsoletes[pi - installed->start]; (pi2 = *opp++) != 0;)
1675 if (pool->solvables[pi2].repo != installed)
1676 MAPSET(&solv->dupinvolvedmap, pi2);
1678 if (ps->repo == installed && (how & SOLVER_FORCEBEST) != 0)
1680 if (!solv->bestupdatemap.size)
1681 map_grow(&solv->bestupdatemap, installed->end - installed->start);
1682 MAPSET(&solv->bestupdatemap, pi - installed->start);
1684 if (ps->repo == installed && (how & SOLVER_CLEANDEPS) != 0)
1685 add_cleandeps_package(solv, pi);
1692 solver_createdupmaps(Solver *solv)
1694 Queue *job = &solv->job;
1695 Pool *pool = solv->pool;
1696 Repo *installed = solv->installed;
1697 Id select, how, what, p, pp;
1701 map_init(&solv->dupmap, pool->nsolvables);
1702 map_init(&solv->dupinvolvedmap, pool->nsolvables);
1703 for (i = 0; i < job->count; i += 2)
1705 how = job->elements[i];
1706 select = job->elements[i] & SOLVER_SELECTMASK;
1707 what = job->elements[i + 1];
1708 switch (how & SOLVER_JOBMASK)
1710 case SOLVER_DISTUPGRADE:
1711 if (select == SOLVER_SOLVABLE_REPO)
1714 if (what <= 0 || what > pool->nrepos)
1716 repo = pool_id2repo(pool, what);
1719 if (repo != installed && !(how & SOLVER_TARGETED) && solv->noautotarget)
1721 targeted = repo != installed || (how & SOLVER_TARGETED) != 0;
1722 FOR_REPO_SOLVABLES(repo, p, s)
1724 if (repo != installed && !pool_installable(pool, s))
1726 solver_addtodupmaps(solv, p, how, targeted);
1731 targeted = how & SOLVER_TARGETED ? 1 : 0;
1732 if (installed && !targeted && !solv->noautotarget)
1734 FOR_JOB_SELECT(p, pp, select, what)
1735 if (pool->solvables[p].repo == installed)
1739 else if (!installed && !solv->noautotarget)
1741 FOR_JOB_SELECT(p, pp, select, what)
1743 Solvable *s = pool->solvables + p;
1746 if (s->repo != installed && !targeted)
1748 if (s->repo != installed && !pool_installable(pool, s))
1750 solver_addtodupmaps(solv, p, how, targeted);
1758 MAPCLR(&solv->dupinvolvedmap, SYSTEMSOLVABLE);
1762 solver_freedupmaps(Solver *solv)
1764 map_free(&solv->dupmap);
1765 /* we no longer free solv->dupinvolvedmap as we need it in
1766 * policy's priority pruning code. sigh. */
1770 solver_addduprules(Solver *solv, Map *addedmap)
1772 Pool *pool = solv->pool;
1777 solv->duprules = solv->nrules;
1778 for (i = 1; i < pool->nsolvables; i++)
1780 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1782 s = pool->solvables + i;
1784 FOR_PROVIDES(p, pp, s->name)
1786 ps = pool->solvables + p;
1787 if (ps->name != s->name || !MAPTST(addedmap, p))
1793 if (!MAPTST(&solv->dupinvolvedmap, p))
1795 if (solv->installed && ps->repo == solv->installed)
1797 if (!solv->updatemap.size)
1798 map_grow(&solv->updatemap, solv->installed->end - solv->installed->start);
1799 MAPSET(&solv->updatemap, p - solv->installed->start);
1800 if (!MAPTST(&solv->dupmap, p))
1803 /* is installed identical to a good one? */
1804 FOR_PROVIDES(ip, ipp, ps->name)
1806 Solvable *is = pool->solvables + ip;
1807 if (!MAPTST(&solv->dupmap, ip))
1809 if (is->evr == ps->evr && solvable_identical(ps, is))
1813 solver_addrule(solv, -p, 0); /* no match, sorry */
1815 MAPSET(&solv->dupmap, p); /* for best rules processing */
1818 else if (!MAPTST(&solv->dupmap, p))
1819 solver_addrule(solv, -p, 0);
1822 solv->duprules_end = solv->nrules;
1827 disableduprule(Solver *solv, Id name)
1829 Pool *pool = solv->pool;
1832 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1834 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1835 solver_disablerule(solv, r);
1840 reenableduprule(Solver *solv, Id name)
1842 Pool *pool = solv->pool;
1845 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1847 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1849 solver_enablerule(solv, r);
1850 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1852 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1853 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1860 /***********************************************************************
1862 *** Policy rule disabling/reenabling
1864 *** Disable all policy rules that conflict with our jobs. If a job
1865 *** gets disabled later on, reenable the involved policy rules again.
1869 #define DISABLE_UPDATE 1
1870 #define DISABLE_INFARCH 2
1871 #define DISABLE_DUP 3
1874 * add all installed packages that package p obsoletes to Queue q.
1875 * Package p is not installed. Also, we know that if
1876 * solv->keepexplicitobsoletes is not set, p is not in the multiversion map.
1877 * Entries may get added multiple times.
1880 add_obsoletes(Solver *solv, Id p, Queue *q)
1882 Pool *pool = solv->pool;
1883 Repo *installed = solv->installed;
1885 Solvable *s = pool->solvables + p;
1889 if (!solv->keepexplicitobsoletes || !(solv->multiversion.size && MAPTST(&solv->multiversion, p)))
1891 FOR_PROVIDES(p2, pp2, s->name)
1893 Solvable *ps = pool->solvables + p2;
1894 if (ps->repo != installed)
1896 if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
1898 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1906 obsp = s->repo->idarraydata + s->obsoletes;
1907 while ((obs = *obsp++) != 0)
1908 FOR_PROVIDES(p2, pp2, obs)
1910 Solvable *ps = pool->solvables + p2;
1911 if (ps->repo != installed)
1913 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1915 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1925 * Call add_obsoletes and intersect the result with the
1926 * elements in Queue q starting at qstart.
1927 * Assumes that it's the first call if qstart == q->count.
1928 * May use auxillary map m for the intersection process, all
1929 * elements of q starting at qstart must have their bit cleared.
1930 * (This is also true after the function returns.)
1933 intersect_obsoletes(Solver *solv, Id p, Queue *q, int qstart, Map *m)
1936 int qcount = q->count;
1938 add_obsoletes(solv, p, q);
1939 if (qcount == qstart)
1940 return; /* first call */
1941 if (qcount == q->count)
1943 else if (qcount == qstart + 1)
1945 /* easy if there's just one element */
1947 for (i = qcount; i < q->count; i++)
1948 if (q->elements[i] == q->elements[qstart])
1950 j++; /* keep the element */
1954 else if (!m->size && q->count - qstart <= 8)
1956 /* faster than a map most of the time */
1958 for (i = j = qstart; i < qcount; i++)
1960 Id ip = q->elements[i];
1961 for (k = qcount; k < q->count; k++)
1962 if (q->elements[k] == ip)
1964 q->elements[j++] = ip;
1971 /* for the really pathologic cases we use the map */
1972 Repo *installed = solv->installed;
1974 map_init(m, installed->end - installed->start);
1975 for (i = qcount; i < q->count; i++)
1976 MAPSET(m, q->elements[i] - installed->start);
1977 for (i = j = qstart; i < qcount; i++)
1978 if (MAPTST(m, q->elements[i] - installed->start))
1980 MAPCLR(m, q->elements[i] - installed->start);
1981 q->elements[j++] = q->elements[i];
1984 queue_truncate(q, j);
1988 jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
1990 Pool *pool = solv->pool;
1994 int i, j, set, qstart;
1997 installed = solv->installed;
1998 select = how & SOLVER_SELECTMASK;
1999 switch (how & SOLVER_JOBMASK)
2001 case SOLVER_INSTALL:
2002 set = how & SOLVER_SETMASK;
2003 if (!(set & SOLVER_NOAUTOSET))
2005 /* automatically add set bits by analysing the job */
2006 if (select == SOLVER_SOLVABLE_NAME)
2007 set |= SOLVER_SETNAME;
2008 if (select == SOLVER_SOLVABLE)
2009 set |= SOLVER_SETNAME | SOLVER_SETARCH | SOLVER_SETVENDOR | SOLVER_SETREPO | SOLVER_SETEVR;
2010 else if ((select == SOLVER_SOLVABLE_NAME || select == SOLVER_SOLVABLE_PROVIDES) && ISRELDEP(what))
2012 Reldep *rd = GETRELDEP(pool, what);
2013 if (rd->flags == REL_EQ && select == SOLVER_SOLVABLE_NAME)
2015 if (pool->disttype != DISTTYPE_DEB)
2017 const char *rel = strrchr(pool_id2str(pool, rd->evr), '-');
2018 set |= rel ? SOLVER_SETEVR : SOLVER_SETEV;
2021 set |= SOLVER_SETEVR;
2023 if (rd->flags <= 7 && ISRELDEP(rd->name))
2024 rd = GETRELDEP(pool, rd->name);
2025 if (rd->flags == REL_ARCH)
2026 set |= SOLVER_SETARCH;
2030 set &= ~SOLVER_NOAUTOSET;
2033 if ((set & SOLVER_SETARCH) != 0 && solv->infarchrules != solv->infarchrules_end)
2035 if (select == SOLVER_SOLVABLE)
2036 queue_push2(q, DISABLE_INFARCH, pool->solvables[what].name);
2039 int qcnt = q->count;
2040 /* does not work for SOLVER_SOLVABLE_ALL and SOLVER_SOLVABLE_REPO, but
2041 they are not useful for SOLVER_INSTALL jobs anyway */
2042 FOR_JOB_SELECT(p, pp, select, what)
2044 s = pool->solvables + p;
2046 for (i = qcnt; i < q->count; i += 2)
2047 if (q->elements[i + 1] == s->name)
2051 queue_push2(q, DISABLE_INFARCH, s->name);
2055 if ((set & SOLVER_SETREPO) != 0 && solv->duprules != solv->duprules_end)
2057 if (select == SOLVER_SOLVABLE)
2058 queue_push2(q, DISABLE_DUP, pool->solvables[what].name);
2061 int qcnt = q->count;
2062 FOR_JOB_SELECT(p, pp, select, what)
2064 s = pool->solvables + p;
2066 for (i = qcnt; i < q->count; i += 2)
2067 if (q->elements[i + 1] == s->name)
2071 queue_push2(q, DISABLE_DUP, s->name);
2075 if (!installed || installed->end == installed->start)
2077 /* now the hard part: disable some update rules */
2079 /* first check if we have multiversion or installed packages in the job */
2081 FOR_JOB_SELECT(p, pp, select, what)
2083 if (pool->solvables[p].repo == installed)
2085 else if (solv->multiversion.size && MAPTST(&solv->multiversion, p) && !solv->keepexplicitobsoletes)
2089 if (j) /* have installed packages */
2091 /* this is for dupmap_all jobs, it can go away if we create
2092 * duprules for them */
2093 if (i == 1 && (set & SOLVER_SETREPO) != 0)
2094 queue_push2(q, DISABLE_UPDATE, j);
2100 FOR_JOB_SELECT(p, pp, select, what)
2102 intersect_obsoletes(solv, p, q, qstart, &omap);
2103 if (q->count == qstart)
2109 if (qstart == q->count)
2110 return; /* nothing to prune */
2112 /* convert result to (DISABLE_UPDATE, p) pairs */
2114 for (j = qstart; j < i; j++)
2115 queue_push(q, q->elements[j]);
2116 for (j = qstart; j < q->count; j += 2)
2118 q->elements[j] = DISABLE_UPDATE;
2119 q->elements[j + 1] = q->elements[i++];
2122 /* now that we know which installed packages are obsoleted check each of them */
2123 if ((set & (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR)) == (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR))
2124 return; /* all is set, nothing to do */
2126 for (i = j = qstart; i < q->count; i += 2)
2128 Solvable *is = pool->solvables + q->elements[i + 1];
2129 FOR_JOB_SELECT(p, pp, select, what)
2132 s = pool->solvables + p;
2133 if ((set & SOLVER_SETEVR) != 0)
2134 illegal |= POLICY_ILLEGAL_DOWNGRADE; /* ignore */
2135 if ((set & SOLVER_SETNAME) != 0)
2136 illegal |= POLICY_ILLEGAL_NAMECHANGE; /* ignore */
2137 if ((set & SOLVER_SETARCH) != 0)
2138 illegal |= POLICY_ILLEGAL_ARCHCHANGE; /* ignore */
2139 if ((set & SOLVER_SETVENDOR) != 0)
2140 illegal |= POLICY_ILLEGAL_VENDORCHANGE; /* ignore */
2141 illegal = policy_is_illegal(solv, is, s, illegal);
2142 if (illegal && illegal == POLICY_ILLEGAL_DOWNGRADE && (set & SOLVER_SETEV) != 0)
2144 /* it's ok if the EV is different */
2145 if (pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE_EVONLY) != 0)
2153 /* no package conflicts with the update rule */
2154 /* thus keep the DISABLE_UPDATE */
2155 q->elements[j + 1] = q->elements[i + 1];
2159 queue_truncate(q, j);
2165 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
2166 FOR_REPO_SOLVABLES(installed, p, s)
2167 queue_push2(q, DISABLE_UPDATE, p);
2168 FOR_JOB_SELECT(p, pp, select, what)
2169 if (pool->solvables[p].repo == installed)
2171 queue_push2(q, DISABLE_UPDATE, p);
2172 #ifdef ENABLE_LINKED_PKGS
2173 if (solv->instbuddy && solv->instbuddy[p - installed->start] > 1)
2174 queue_push2(q, DISABLE_UPDATE, solv->instbuddy[p - installed->start]);
2183 /* disable all policy rules that are in conflict with our job list */
2185 solver_disablepolicyrules(Solver *solv)
2187 Queue *job = &solv->job;
2194 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
2196 for (i = solv->jobrules; i < solv->jobrules_end; i++)
2198 r = solv->rules + i;
2199 if (r->d < 0) /* disabled? */
2201 j = solv->ruletojob.elements[i - solv->jobrules];
2205 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2207 if (solv->cleandepsmap.size)
2209 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
2210 for (i = solv->installed->start; i < solv->installed->end; i++)
2211 if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
2212 queue_push2(&allq, DISABLE_UPDATE, i);
2214 MAPZERO(&solv->noupdate);
2215 for (i = 0; i < allq.count; i += 2)
2217 Id type = allq.elements[i], arg = allq.elements[i + 1];
2220 case DISABLE_UPDATE:
2221 disableupdaterule(solv, arg);
2223 case DISABLE_INFARCH:
2224 disableinfarchrule(solv, arg);
2227 disableduprule(solv, arg);
2236 /* we just disabled job #jobidx, now reenable all policy rules that were
2237 * disabled because of this job */
2239 solver_reenablepolicyrules(Solver *solv, int jobidx)
2241 Queue *job = &solv->job;
2246 Id qbuf[32], allqbuf[32];
2248 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
2249 jobtodisablelist(solv, job->elements[jobidx - 1], job->elements[jobidx], &q);
2255 /* now remove everything from q that is disabled by other jobs */
2257 /* first remove cleandeps packages, they count as DISABLE_UPDATE */
2258 if (solv->cleandepsmap.size)
2260 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
2261 for (j = k = 0; j < q.count; j += 2)
2263 if (q.elements[j] == DISABLE_UPDATE)
2265 Id p = q.elements[j + 1];
2266 if (p >= solv->installed->start && p < solv->installed->end && MAPTST(&solv->cleandepsmap, p - solv->installed->start))
2267 continue; /* remove element from q */
2269 q.elements[k++] = q.elements[j];
2270 q.elements[k++] = q.elements[j + 1];
2280 /* now go through the disable list of all other jobs */
2281 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
2282 for (i = solv->jobrules; i < solv->jobrules_end; i++)
2284 r = solv->rules + i;
2285 if (r->d < 0) /* disabled? */
2287 j = solv->ruletojob.elements[i - solv->jobrules];
2291 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2294 /* remove all elements in allq from q */
2295 for (j = k = 0; j < q.count; j += 2)
2297 Id type = q.elements[j], arg = q.elements[j + 1];
2298 for (ai = 0; ai < allq.count; ai += 2)
2299 if (allq.elements[ai] == type && allq.elements[ai + 1] == arg)
2301 if (ai < allq.count)
2302 continue; /* found it in allq, remove element from q */
2303 q.elements[k++] = q.elements[j];
2304 q.elements[k++] = q.elements[j + 1];
2317 /* now re-enable anything that's left in q */
2318 for (j = 0; j < q.count; j += 2)
2320 Id type = q.elements[j], arg = q.elements[j + 1];
2323 case DISABLE_UPDATE:
2324 reenableupdaterule(solv, arg);
2326 case DISABLE_INFARCH:
2327 reenableinfarchrule(solv, arg);
2330 reenableduprule(solv, arg);
2337 /* we just removed a package from the cleandeps map, now reenable all policy rules that were
2338 * disabled because of this */
2340 solver_reenablepolicyrules_cleandeps(Solver *solv, Id pkg)
2342 Queue *job = &solv->job;
2349 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
2350 for (i = solv->jobrules; i < solv->jobrules_end; i++)
2352 r = solv->rules + i;
2353 if (r->d < 0) /* disabled? */
2355 j = solv->ruletojob.elements[i - solv->jobrules];
2359 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2361 for (i = 0; i < allq.count; i += 2)
2362 if (allq.elements[i] == DISABLE_UPDATE && allq.elements[i + 1] == pkg)
2364 if (i == allq.count)
2365 reenableupdaterule(solv, pkg);
2370 /***********************************************************************
2372 *** Rule info part, tell the user what the rule is about.
2377 addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep)
2379 Pool *pool = solv->pool;
2383 /* check if this creates the rule we're searching for */
2384 r = solv->rules + solv->ruleinfoq->elements[0];
2386 od = r->d < 0 ? -r->d - 1 : r->d;
2391 if (p < 0 && d > 0 && (!pool->whatprovidesdata[d] || !pool->whatprovidesdata[d + 1]))
2393 w2 = pool->whatprovidesdata[d];
2396 if (p > 0 && d < 0) /* this hack is used for package links and complex deps */
2408 Id *dp = pool->whatprovidesdata + d;
2409 Id *odp = pool->whatprovidesdata + od;
2411 if (*dp++ != *odp++)
2417 /* handle multiversion conflict rules */
2418 if (p < 0 && pool->whatprovidesdata[d] < 0)
2420 w2 = pool->whatprovidesdata[d];
2421 /* XXX: free memory */
2431 if (w2 != op || p != ow2)
2436 if (p != op || w2 != ow2)
2439 /* should use a different type instead */
2440 if (type == SOLVER_RULE_RPM_PACKAGE_CONFLICT && !w2)
2441 w2 = -SYSTEMSOLVABLE;
2443 /* yep, rule matches. record info */
2444 queue_push(solv->ruleinfoq, type);
2445 if (type == SOLVER_RULE_RPM_SAME_NAME)
2447 /* we normalize same name order */
2448 queue_push(solv->ruleinfoq, op < 0 ? -op : 0);
2449 queue_push(solv->ruleinfoq, ow2 < 0 ? -ow2 : 0);
2453 queue_push(solv->ruleinfoq, p < 0 ? -p : 0);
2454 queue_push(solv->ruleinfoq, w2 < 0 ? -w2 : 0);
2456 queue_push(solv->ruleinfoq, dep);
2460 solver_allruleinfos_cmp(const void *ap, const void *bp, void *dp)
2462 const Id *a = ap, *b = bp;
2481 getrpmruleinfos(Solver *solv, Rule *r, Queue *rq)
2483 Pool *pool = solv->pool;
2487 queue_push(rq, r - solv->rules); /* push the rule we're interested in */
2488 solv->ruleinfoq = rq;
2489 FOR_RULELITERALS(l, pp, r)
2493 solver_addrpmrulesforsolvable(solv, pool->solvables - l, 0);
2495 #ifdef ENABLE_LINKED_PKGS
2496 FOR_RULELITERALS(l, pp, r)
2504 if (!strchr(pool_id2str(pool, pool->solvables[l].name), ':') || !has_package_link(pool, pool->solvables + l))
2506 add_package_link(solv, pool->solvables + l, 0, 0);
2509 solv->ruleinfoq = 0;
2514 solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
2516 Rule *r = solv->rules + rid;
2520 if (rid <= 0 || rid >= solv->rpmrules_end)
2522 Id type, from, to, dep;
2523 type = solver_ruleinfo(solv, rid, &from, &to, &dep);
2524 queue_push(rq, type);
2525 queue_push(rq, from);
2527 queue_push(rq, dep);
2530 getrpmruleinfos(solv, r, rq);
2531 /* now sort & unify em */
2534 solv_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
2535 /* throw out identical entries */
2536 for (i = j = 0; i < rq->count; i += 4)
2540 if (rq->elements[i] == rq->elements[j - 4] &&
2541 rq->elements[i + 1] == rq->elements[j - 3] &&
2542 rq->elements[i + 2] == rq->elements[j - 2] &&
2543 rq->elements[i + 3] == rq->elements[j - 1])
2546 rq->elements[j++] = rq->elements[i];
2547 rq->elements[j++] = rq->elements[i + 1];
2548 rq->elements[j++] = rq->elements[i + 2];
2549 rq->elements[j++] = rq->elements[i + 3];
2556 solver_ruleinfo(Solver *solv, Id rid, Id *fromp, Id *top, Id *depp)
2558 Pool *pool = solv->pool;
2559 Rule *r = solv->rules + rid;
2560 SolverRuleinfo type = SOLVER_RULE_UNKNOWN;
2568 if (rid > 0 && rid < solv->rpmrules_end)
2574 return SOLVER_RULE_RPM;
2578 getrpmruleinfos(solv, r, &rq);
2579 type = SOLVER_RULE_RPM;
2580 for (i = 0; i < rq.count; i += 4)
2583 qt = rq.elements[i];
2584 qp = rq.elements[i + 1];
2585 qo = rq.elements[i + 2];
2586 qd = rq.elements[i + 3];
2587 if (type == SOLVER_RULE_RPM || type > qt)
2601 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2603 Id jidx = solv->ruletojob.elements[rid - solv->jobrules];
2607 *top = solv->job.elements[jidx];
2609 *depp = solv->job.elements[jidx + 1];
2610 if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE)
2612 Id how = solv->job.elements[jidx];
2613 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLVABLE_NAME))
2614 return SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2615 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES))
2616 return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2617 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVABLE_NAME))
2618 return SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2619 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVABLE_PROVIDES))
2620 return SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2621 return SOLVER_RULE_JOB_UNSUPPORTED;
2623 return SOLVER_RULE_JOB;
2625 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2628 *fromp = solv->installed->start + (rid - solv->updaterules);
2629 return SOLVER_RULE_UPDATE;
2631 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2634 *fromp = solv->installed->start + (rid - solv->featurerules);
2635 return SOLVER_RULE_FEATURE;
2637 if (rid >= solv->duprules && rid < solv->duprules_end)
2642 *depp = pool->solvables[-r->p].name;
2643 return SOLVER_RULE_DISTUPGRADE;
2645 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2650 *depp = pool->solvables[-r->p].name;
2651 return SOLVER_RULE_INFARCH;
2653 if (rid >= solv->bestrules && rid < solv->bestrules_end)
2655 if (fromp && solv->bestrules_pkg[rid - solv->bestrules] > 0)
2656 *fromp = solv->bestrules_pkg[rid - solv->bestrules];
2657 return SOLVER_RULE_BEST;
2659 if (rid >= solv->yumobsrules && rid < solv->yumobsrules_end)
2665 /* first solvable is enough, we just need it for the name */
2666 if (!r->d || r->d == -1)
2669 *top = pool->whatprovidesdata[r->d < 0 ? -r->d : r->d];
2672 *depp = solv->yumobsrules_info[rid - solv->yumobsrules];
2673 return SOLVER_RULE_YUMOBS;
2675 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2677 return SOLVER_RULE_CHOICE;
2679 if (rid >= solv->learntrules)
2681 return SOLVER_RULE_LEARNT;
2683 return SOLVER_RULE_UNKNOWN;
2687 solver_ruleclass(Solver *solv, Id rid)
2690 return SOLVER_RULE_UNKNOWN;
2691 if (rid > 0 && rid < solv->rpmrules_end)
2692 return SOLVER_RULE_RPM;
2693 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2694 return SOLVER_RULE_JOB;
2695 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2696 return SOLVER_RULE_UPDATE;
2697 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2698 return SOLVER_RULE_FEATURE;
2699 if (rid >= solv->duprules && rid < solv->duprules_end)
2700 return SOLVER_RULE_DISTUPGRADE;
2701 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2702 return SOLVER_RULE_INFARCH;
2703 if (rid >= solv->bestrules && rid < solv->bestrules_end)
2704 return SOLVER_RULE_BEST;
2705 if (rid >= solv->yumobsrules && rid < solv->yumobsrules_end)
2706 return SOLVER_RULE_YUMOBS;
2707 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2708 return SOLVER_RULE_CHOICE;
2709 if (rid >= solv->learntrules)
2710 return SOLVER_RULE_LEARNT;
2711 return SOLVER_RULE_UNKNOWN;
2715 solver_ruleliterals(Solver *solv, Id rid, Queue *q)
2717 Pool *pool = solv->pool;
2722 r = solv->rules + rid;
2723 FOR_RULELITERALS(p, pp, r)
2724 if (p != -SYSTEMSOLVABLE)
2727 queue_push(q, -SYSTEMSOLVABLE); /* hmm, better to return an empty result? */
2731 solver_rule2jobidx(Solver *solv, Id rid)
2733 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2735 return solv->ruletojob.elements[rid - solv->jobrules] + 1;
2738 /* job rule introspection */
2740 solver_rule2job(Solver *solv, Id rid, Id *whatp)
2743 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2749 idx = solv->ruletojob.elements[rid - solv->jobrules];
2751 *whatp = solv->job.elements[idx + 1];
2752 return solv->job.elements[idx];
2755 /* update/feature rule introspection */
2757 solver_rule2solvable(Solver *solv, Id rid)
2759 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2760 return rid - solv->updaterules;
2761 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2762 return rid - solv->featurerules;
2767 solver_rule2rules_rec(Solver *solv, Id rid, Queue *q, Map *seen)
2774 for (i = solv->learnt_why.elements[rid - solv->learntrules]; (rid2 = solv->learnt_pool.elements[i]) != 0; i++)
2778 if (MAPTST(seen, rid2))
2780 if (rid2 >= solv->learntrules)
2781 solver_rule2rules_rec(solv, rid2, q, seen);
2784 queue_push(q, rid2);
2788 /* learnt rule introspection */
2790 solver_rule2rules(Solver *solv, Id rid, Queue *q, int recursive)
2793 if (rid < solv->learntrules || rid >= solv->nrules)
2798 map_init(&seen, solv->nrules);
2799 solver_rule2rules_rec(solv, rid, q, &seen);
2803 solver_rule2rules_rec(solv, rid, q, 0);
2807 /* check if the newest versions of pi still provides the dependency we're looking for */
2809 solver_choicerulecheck(Solver *solv, Id pi, Rule *r, Map *m)
2811 Pool *pool = solv->pool;
2817 ur = solv->rules + solv->updaterules + (pi - pool->installed->start);
2819 ur = solv->rules + solv->featurerules + (pi - pool->installed->start);
2822 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
2823 FOR_RULELITERALS(p, pp, ur)
2827 policy_filter_unwanted(solv, &q, POLICY_MODE_CHOOSE);
2828 for (i = 0; i < q.count; i++)
2829 if (MAPTST(m, q.elements[i]))
2831 /* 1: none of the newest versions provide it */
2832 i = i == q.count ? 1 : 0;
2838 queue_removeelement(Queue *q, Id el)
2841 for (i = 0; i < q->count; i++)
2842 if (q->elements[i] == el)
2846 for (j = i++; i < q->count; i++)
2847 if (q->elements[i] != el)
2848 q->elements[j++] = q->elements[i];
2849 queue_truncate(q, j);
2854 solver_addchoicerules(Solver *solv)
2856 Pool *pool = solv->pool;
2860 int i, j, rid, havechoice;
2864 Id lastaddedp, lastaddedd;
2868 solv->choicerules = solv->nrules;
2869 if (!pool->installed)
2871 solv->choicerules_end = solv->nrules;
2874 now = solv_timems(0);
2875 solv->choicerules_ref = solv_calloc(solv->rpmrules_end, sizeof(Id));
2878 map_init(&m, pool->nsolvables);
2879 map_init(&mneg, pool->nsolvables);
2880 /* set up negative assertion map from infarch and dup rules */
2881 for (rid = solv->infarchrules, r = solv->rules + rid; rid < solv->infarchrules_end; rid++, r++)
2882 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2883 MAPSET(&mneg, -r->p);
2884 for (rid = solv->duprules, r = solv->rules + rid; rid < solv->duprules_end; rid++, r++)
2885 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2886 MAPSET(&mneg, -r->p);
2890 for (rid = 1; rid < solv->rpmrules_end ; rid++)
2892 r = solv->rules + rid;
2893 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 <= 0))
2894 continue; /* only look at requires rules */
2895 /* solver_printrule(solv, SOLV_DEBUG_RESULT, r); */
2899 FOR_RULELITERALS(p, pp, r)
2903 s = pool->solvables + p;
2906 if (s->repo == pool->installed)
2911 /* check if this package is "blocked" by a installed package */
2913 FOR_PROVIDES(p2, pp2, s->name)
2915 s2 = pool->solvables + p2;
2916 if (s2->repo != pool->installed)
2918 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
2920 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, s2))
2926 /* found installed package p2 that we can update to p */
2927 if (MAPTST(&mneg, p))
2929 if (policy_is_illegal(solv, s2, s, 0))
2932 if (solver_choicerulecheck(solv, p2, r, &m))
2934 queue_push(&qi, p2);
2936 queue_push2(&qi, p2, p);
2943 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2945 while ((obs = *obsp++) != 0)
2947 FOR_PROVIDES(p2, pp2, obs)
2949 s2 = pool->solvables + p2;
2950 if (s2->repo != pool->installed)
2952 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
2954 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2963 /* found installed package p2 that we can update to p */
2964 if (MAPTST(&mneg, p))
2966 if (policy_is_illegal(solv, s2, s, 0))
2969 if (solver_choicerulecheck(solv, p2, r, &m))
2971 queue_push(&qi, p2);
2973 queue_push2(&qi, p2, p);
2979 /* package p is independent of the installed ones */
2982 if (!havechoice || !q.count || !qi.count)
2983 continue; /* no choice */
2985 FOR_RULELITERALS(p, pp, r)
2989 /* do extra checking */
2990 for (i = j = 0; i < qi.count; i += 2)
2992 p2 = qi.elements[i];
2995 if (solver_choicerulecheck(solv, p2, r, &m))
2997 /* oops, remove element p from q */
2998 queue_removeelement(&q, qi.elements[i + 1]);
3001 qi.elements[j++] = p2;
3003 queue_truncate(&qi, j);
3004 if (!q.count || !qi.count)
3006 FOR_RULELITERALS(p, pp, r)
3013 /* now check the update rules of the installed package.
3014 * if all packages of the update rules are contained in
3015 * the dependency rules, there's no need to set up the choice rule */
3016 for (i = 0; i < qi.count; i++)
3019 if (!qi.elements[i])
3021 ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
3023 ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
3026 FOR_RULELITERALS(p, pp, ur)
3031 for (j = i + 1; j < qi.count; j++)
3032 if (qi.elements[i] == qi.elements[j])
3035 /* empty map again */
3036 FOR_RULELITERALS(p, pp, r)
3042 printf("skipping choice ");
3043 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
3048 /* don't add identical rules */
3049 if (lastaddedp == r->p && lastaddedcnt == q.count)
3051 for (i = 0; i < q.count; i++)
3052 if (q.elements[i] != pool->whatprovidesdata[lastaddedd + i])
3055 continue; /* already added that one */
3057 d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
3061 lastaddedcnt = q.count;
3063 solver_addrule(solv, r->p, d);
3064 queue_push(&solv->weakruleq, solv->nrules - 1);
3065 solv->choicerules_ref[solv->nrules - 1 - solv->choicerules] = rid;
3068 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
3069 printf("WEAK CHOICE ");
3070 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + solv->nrules - 1);
3077 solv->choicerules_end = solv->nrules;
3078 /* shrink choicerules_ref */
3079 solv->choicerules_ref = solv_realloc2(solv->choicerules_ref, solv->choicerules_end - solv->choicerules, sizeof(Id));
3080 POOL_DEBUG(SOLV_DEBUG_STATS, "choice rule creation took %d ms\n", solv_timems(now));
3083 /* called when a choice rule is disabled by analyze_unsolvable. We also
3084 * have to disable all other choice rules so that the best packages get
3087 solver_disablechoicerules(Solver *solv, Rule *r)
3090 Pool *pool = solv->pool;
3094 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
3095 map_init(&m, pool->nsolvables);
3096 FOR_RULELITERALS(p, pp, or)
3099 FOR_RULELITERALS(p, pp, r)
3102 for (rid = solv->choicerules; rid < solv->choicerules_end; rid++)
3104 r = solv->rules + rid;
3107 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
3108 FOR_RULELITERALS(p, pp, or)
3109 if (p > 0 && MAPTST(&m, p))
3112 solver_disablerule(solv, r);
3117 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
3121 for (i = j = 0; i < q->count; i++)
3124 for (cp2 = cp; *cp2; cp2++)
3127 q->elements[j++] = p;
3131 queue_truncate(q, j);
3135 prune_to_dup_packages(Solver *solv, Id p, Queue *q)
3138 for (i = j = 0; i < q->count; i++)
3140 Id p = q->elements[i];
3141 if (MAPTST(&solv->dupmap, p))
3142 q->elements[j++] = p;
3144 queue_truncate(q, j);
3148 solver_addbestrules(Solver *solv, int havebestinstalljobs)
3150 Pool *pool = solv->pool;
3153 Repo *installed = solv->installed;
3159 solv->bestrules = solv->nrules;
3162 solv->bestrules_end = solv->nrules;
3169 if (havebestinstalljobs)
3171 for (i = 0; i < solv->job.count; i += 2)
3173 if ((solv->job.elements[i] & (SOLVER_JOBMASK | SOLVER_FORCEBEST)) == (SOLVER_INSTALL | SOLVER_FORCEBEST))
3177 for (j = 0; j < solv->ruletojob.count; j++)
3178 if (solv->ruletojob.elements[j] == i)
3180 if (j == solv->ruletojob.count)
3182 r = solv->rules + solv->jobrules + j;
3184 FOR_RULELITERALS(p2, pp2, r)
3188 continue; /* orphaned */
3189 /* select best packages, just look at prio and version */
3191 policy_filter_unwanted(solv, &q, POLICY_MODE_RECOMMEND);
3192 if (q.count == oldcnt)
3193 continue; /* nothing filtered */
3194 p2 = queue_shift(&q);
3195 solver_addrule(solv, p2, q.count ? pool_queuetowhatprovides(pool, &q) : 0);
3196 queue_push(&r2pkg, -(solv->jobrules + j));
3201 if (solv->bestupdatemap_all || solv->bestupdatemap.size)
3203 FOR_REPO_SOLVABLES(installed, p, s)
3206 if (!solv->updatemap_all && (!solv->updatemap.size || !MAPTST(&solv->updatemap, p - installed->start)))
3208 if (!solv->bestupdatemap_all && (!solv->bestupdatemap.size || !MAPTST(&solv->bestupdatemap, p - installed->start)))
3211 if (solv->bestobeypolicy)
3212 r = solv->rules + solv->updaterules + (p - installed->start);
3215 r = solv->rules + solv->featurerules + (p - installed->start);
3216 if (!r->p) /* identical to update rule? */
3217 r = solv->rules + solv->updaterules + (p - installed->start);
3219 if (solv->specialupdaters && (d = solv->specialupdaters[p - installed->start]) != 0 && r == solv->rules + solv->updaterules + (p - installed->start))
3221 /* need to check specialupdaters */
3222 if (r->p == p) /* be careful with the dup case */
3224 while ((p2 = pool->whatprovidesdata[d++]) != 0)
3229 FOR_RULELITERALS(p2, pp2, r)
3233 if (solv->update_targets && solv->update_targets->elements[p - installed->start])
3234 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q);
3235 if (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
3236 prune_to_dup_packages(solv, p, &q);
3237 /* select best packages, just look at prio and version */
3238 policy_filter_unwanted(solv, &q, POLICY_MODE_RECOMMEND);
3240 continue; /* orphaned */
3241 if (solv->bestobeypolicy)
3243 /* also filter the best of the feature rule packages and add them */
3244 r = solv->rules + solv->featurerules + (p - installed->start);
3249 FOR_RULELITERALS(p2, pp2, r)
3251 queue_push(&q2, p2);
3252 if (solv->update_targets && solv->update_targets->elements[p - installed->start])
3253 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q2);
3254 if (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
3255 prune_to_dup_packages(solv, p, &q2);
3256 policy_filter_unwanted(solv, &q2, POLICY_MODE_RECOMMEND);
3257 for (j = 0; j < q2.count; j++)
3258 queue_pushunique(&q, q2.elements[j]);
3261 p2 = queue_shift(&q);
3262 solver_addrule(solv, p2, q.count ? pool_queuetowhatprovides(pool, &q) : 0);
3263 queue_push(&r2pkg, p);
3267 solv->bestrules_pkg = solv_memdup2(r2pkg.elements, r2pkg.count, sizeof(Id));
3268 solv->bestrules_end = solv->nrules;
3277 /* yumobs rule handling */
3280 find_obsolete_group(Solver *solv, Id obs, Queue *q)
3282 Pool *pool = solv->pool;
3284 Id p2, pp2, op, *opp, opp2;
3285 int i, j, qnc, ncnt;
3288 FOR_PROVIDES(p2, pp2, obs)
3290 Solvable *s2 = pool->solvables + p2;
3291 if (s2->repo != pool->installed)
3293 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
3295 /* we obsolete installed package s2 with obs. now find all other packages that have the same dep */
3296 for (opp = solv->obsoletes_data + solv->obsoletes[p2 - solv->installed->start]; (op = *opp++) != 0;)
3298 Solvable *os = pool->solvables + op;
3302 if (pool->obsoleteusescolors && !pool_colormatch(pool, s2, os))
3304 obsp2 = os->repo->idarraydata + os->obsoletes;
3305 while ((obs2 = *obsp2++) != 0)
3309 queue_pushunique(q, op);
3311 /* also search packages with the same name */
3312 FOR_PROVIDES(op, opp2, s2->name)
3314 Solvable *os = pool->solvables + op;
3316 if (os->name != s2->name)
3320 if (pool->obsoleteusescolors && !pool_colormatch(pool, s2, os))
3322 obsp2 = os->repo->idarraydata + os->obsoletes;
3323 while ((obs2 = *obsp2++) != 0)
3327 queue_pushunique(q, op);
3330 /* find names so that we can build groups */
3331 queue_init_clone(&qn, q);
3332 prune_to_best_version(solv->pool, &qn);
3335 for (i = 0; i < qn.count; i++)
3336 printf(" + %s\n", pool_solvid2str(pool, qn.elements[i]));
3339 /* filter into name groups */
3348 for (i = 0; i < qnc; i++)
3350 Id n = pool->solvables[qn.elements[i]].name;
3352 for (j = 0; j < q->count; j++)
3354 Id p = q->elements[j];
3355 if (pool->solvables[p].name == n)
3374 queue_insertn(q, 0, qn.count - qnc, qn.elements + qnc);
3380 solver_addyumobsrules(Solver *solv)
3382 Pool *pool = solv->pool;
3383 Repo *installed = solv->installed;
3386 Queue qo, qq, yumobsinfoq;
3390 solv->yumobsrules = solv->nrules;
3391 if (!installed || !solv->obsoletes)
3393 solv->yumobsrules_end = solv->nrules;
3396 now = solv_timems(0);
3398 FOR_REPO_SOLVABLES(installed, p, s)
3400 if (!solv->obsoletes[p - installed->start])
3403 printf("checking yumobs for %s\n", pool_solvable2str(pool, s));
3406 for (opp = solv->obsoletes_data + solv->obsoletes[p - installed->start]; (op = *opp++) != 0;)
3408 Solvable *os = pool->solvables + op;
3409 Id obs, *obsp = os->repo->idarraydata + os->obsoletes;
3411 while ((obs = *obsp++) != 0)
3413 FOR_PROVIDES(p2, pp2, obs)
3415 Solvable *s2 = pool->solvables + p2;
3416 if (s2->repo != installed)
3418 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
3420 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
3422 queue_pushunique(&qo, obs);
3433 queue_init(&yumobsinfoq);
3435 for (i = 0; i < qo.count; i++)
3437 int group, groupk, groupstart;
3440 printf("investigating %s\n", pool_dep2str(pool, qo.elements[i]));
3442 find_obsolete_group(solv, qo.elements[i], &qq);
3444 printf("result:\n");
3445 for (j = 0; j < qq.count; j++)
3446 if (qq.elements[j] == 0)
3449 printf("%s\n", pool_solvid2str(pool, qq.elements[j]));
3454 /* at least two goups, build rules */
3456 for (j = 0; j < qq.count; j++)
3464 if (pool->solvables[p].repo == installed)
3468 for (k = 0; k < qq.count; k++)
3470 Id pk = qq.elements[k];
3473 if (group != groupk && k > groupstart)
3477 memset(&qhelper, 0, sizeof(qhelper));
3478 qhelper.count = k - groupstart;
3479 qhelper.elements = qq.elements + groupstart;
3480 solver_addrule(solv, -p, pool_queuetowhatprovides(pool, &qhelper));
3481 queue_push(&yumobsinfoq, qo.elements[i]);
3488 if (yumobsinfoq.count)
3489 solv->yumobsrules_info = solv_memdup2(yumobsinfoq.elements, yumobsinfoq.count, sizeof(Id));
3490 queue_free(&yumobsinfoq);
3493 solv->yumobsrules_end = solv->nrules;
3494 POOL_DEBUG(SOLV_DEBUG_STATS, "yumobs rule creation took %d ms\n", solv_timems(now));
3497 #undef CLEANDEPSDEBUG
3500 * This functions collects all packages that are looked at
3501 * when a dependency is checked. We need it to "pin" installed
3502 * packages when removing a supplemented package in createcleandepsmap.
3503 * Here's an not uncommon example:
3504 * A contains "Supplements: packageand(B, C)"
3505 * B contains "Requires: A"
3506 * Now if we remove C, the supplements is no longer true,
3507 * thus we also remove A. Without the dep_pkgcheck function, we
3508 * would now also remove B, but this is wrong, as adding back
3509 * C doesn't make the supplements true again. Thus we "pin" B
3511 * There's probably a better way to do this, but I haven't come
3515 dep_pkgcheck(Solver *solv, Id dep, Map *m, Queue *q)
3517 Pool *pool = solv->pool;
3522 Reldep *rd = GETRELDEP(pool, dep);
3525 if (rd->flags == REL_AND)
3527 dep_pkgcheck(solv, rd->name, m, q);
3528 dep_pkgcheck(solv, rd->evr, m, q);
3531 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
3533 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
3537 FOR_PROVIDES(p, pp, dep)
3538 if (!m || MAPTST(m, p))
3543 check_xsupp(Solver *solv, Queue *depq, Id dep)
3545 Pool *pool = solv->pool;
3550 Reldep *rd = GETRELDEP(pool, dep);
3553 if (rd->flags == REL_AND)
3555 if (!check_xsupp(solv, depq, rd->name))
3557 return check_xsupp(solv, depq, rd->evr);
3559 if (rd->flags == REL_OR)
3561 if (check_xsupp(solv, depq, rd->name))
3563 return check_xsupp(solv, depq, rd->evr);
3565 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
3566 return solver_splitprovides(solv, rd->evr);
3567 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
3568 return solver_dep_installed(solv, rd->evr);
3570 if (depq && rd->flags == REL_NAMESPACE)
3573 for (i = 0; i < depq->count; i++)
3574 if (depq->elements[i] == dep || depq->elements[i] == rd->name)
3578 FOR_PROVIDES(p, pp, dep)
3579 if (p == SYSTEMSOLVABLE || pool->solvables[p].repo == solv->installed)
3585 queue_contains(Queue *q, Id id)
3588 for (i = 0; i < q->count; i++)
3589 if (q->elements[i] == id)
3594 #ifdef ENABLE_COMPLEX_DEPS
3596 complex_cleandeps_remove(Pool *pool, Id ip, Id req, Map *im, Map *installedm, Queue *iq)
3603 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
3604 if (i == 0 || i == 1)
3609 for (i = 0; i < dq.count; i++)
3611 for (; (p = dq.elements[i]) != 0; i++)
3615 if (!MAPTST(installedm, -p))
3619 if (p != SYSTEMSOLVABLE && MAPTST(im, p))
3621 #ifdef CLEANDEPSDEBUG
3622 printf("%s requires/recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3627 while (dq.elements[i])
3634 complex_cleandeps_addback(Pool *pool, Id ip, Id req, Map *im, Map *installedm, Queue *iq, Map *userinstalled)
3641 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
3642 if (i == 0 || i == 1)
3647 for (i = 0; i < dq.count; i++)
3650 for (; (p = dq.elements[i]) != 0; i++)
3654 if (!MAPTST(installedm, -p))
3663 for (i = blk; (p = dq.elements[i]) != 0; i++)
3667 if (!MAPTST(installedm, p))
3669 if (p == ip || MAPTST(userinstalled, p - pool->installed->start))
3671 #ifdef CLEANDEPSDEBUG
3672 printf("%s requires/recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3678 while (dq.elements[i])
3687 * Find all installed packages that are no longer
3688 * needed regarding the current solver job.
3691 * - remove pass: remove all packages that could have
3692 * been dragged in by the obsoleted packages.
3693 * i.e. if package A is obsolete and contains "Requires: B",
3694 * also remove B, as installing A will have pulled in B.
3695 * after this pass, we have a set of still installed packages
3696 * with broken dependencies.
3698 * now add back all packages that the still installed packages
3701 * The cleandeps packages are the packages removed in the first
3702 * pass and not added back in the second pass.
3704 * If we search for unneeded packages (unneeded is true), we
3705 * simply remove all packages except the userinstalled ones in
3709 solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded)
3711 Pool *pool = solv->pool;
3712 Repo *installed = solv->installed;
3713 Queue *job = &solv->job;
3718 Id rid, how, what, select;
3720 Id req, *reqp, sup, *supp;
3722 Queue iq, iqcopy, xsuppq;
3725 map_empty(cleandepsmap);
3726 if (!installed || installed->end == installed->start)
3728 map_init(&userinstalled, installed->end - installed->start);
3729 map_init(&im, pool->nsolvables);
3730 map_init(&installedm, pool->nsolvables);
3732 queue_init(&xsuppq);
3734 for (i = 0; i < job->count; i += 2)
3736 how = job->elements[i];
3737 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
3739 what = job->elements[i + 1];
3740 select = how & SOLVER_SELECTMASK;
3741 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
3742 FOR_REPO_SOLVABLES(installed, p, s)
3743 MAPSET(&userinstalled, p - installed->start);
3744 FOR_JOB_SELECT(p, pp, select, what)
3745 if (pool->solvables[p].repo == installed)
3746 MAPSET(&userinstalled, p - installed->start);
3748 if ((how & (SOLVER_JOBMASK | SOLVER_SELECTMASK)) == (SOLVER_ERASE | SOLVER_SOLVABLE_PROVIDES))
3750 what = job->elements[i + 1];
3753 Reldep *rd = GETRELDEP(pool, what);
3754 if (rd->flags != REL_NAMESPACE)
3758 queue_pushunique(&iq, rd->name);
3761 FOR_PROVIDES(p, pp, what)
3766 queue_pushunique(&iq, what);
3771 /* have special namespace cleandeps erases */
3774 for (ip = solv->installed->start; ip < solv->installed->end; ip++)
3776 s = pool->solvables + ip;
3777 if (s->repo != installed)
3779 if (!s->supplements)
3781 supp = s->repo->idarraydata + s->supplements;
3782 while ((sup = *supp++) != 0)
3783 if (check_xsupp(solv, &iq, sup) && !check_xsupp(solv, 0, sup))
3785 #ifdef CLEANDEPSDEBUG
3786 printf("xsupp %s from %s\n", pool_dep2str(pool, sup), pool_solvid2str(pool, ip));
3788 queue_pushunique(&xsuppq, sup);
3794 /* also add visible patterns to userinstalled for openSUSE */
3798 dataiterator_init(&di, pool, 0, 0, SOLVABLE_ISVISIBLE, 0, 0);
3799 while (dataiterator_step(&di))
3804 s = pool->solvables + di.solvid;
3805 if (!s->repo || !s->requires)
3807 if (s->repo != installed && !pool_installable(pool, s))
3809 if (strncmp(pool_id2str(pool, s->name), "pattern:", 8) != 0)
3811 dp = s->repo->idarraydata + s->requires;
3812 for (dp = s->repo->idarraydata + s->requires; *dp; dp++)
3813 FOR_PROVIDES(p, pp, *dp)
3814 if (pool->solvables[p].repo == installed)
3816 if (strncmp(pool_id2str(pool, pool->solvables[p].name), "pattern", 7) != 0)
3818 MAPSET(&userinstalled, p - installed->start);
3821 dataiterator_free(&di);
3825 /* all products and their buddies are userinstalled */
3826 for (p = installed->start; p < installed->end; p++)
3828 Solvable *s = pool->solvables + p;
3829 if (s->repo != installed)
3831 if (!strncmp("product:", pool_id2str(pool, s->name), 8))
3833 MAPSET(&userinstalled, p - installed->start);
3834 #ifdef ENABLE_LINKED_PKGS
3835 if (solv->instbuddy && solv->instbuddy[p - installed->start] > 1)
3837 Id buddy = solv->instbuddy[p - installed->start];
3838 if (buddy >= installed->start && buddy < installed->end)
3839 MAPSET(&userinstalled, buddy - installed->start);
3846 /* add all positive elements (e.g. locks) to "userinstalled" */
3847 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3849 r = solv->rules + rid;
3852 i = solv->ruletojob.elements[rid - solv->jobrules];
3853 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
3855 FOR_RULELITERALS(p, jp, r)
3856 if (p > 0 && pool->solvables[p].repo == installed)
3857 MAPSET(&userinstalled, p - installed->start);
3860 /* add all cleandeps candidates to iq */
3861 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3863 r = solv->rules + rid;
3864 if (r->d < 0) /* disabled? */
3866 if (r->d == 0 && r->p < 0 && r->w2 == 0) /* negative assertion (erase job)? */
3869 if (pool->solvables[p].repo != installed)
3871 MAPCLR(&userinstalled, p - installed->start);
3874 i = solv->ruletojob.elements[rid - solv->jobrules];
3875 how = job->elements[i];
3876 if ((how & (SOLVER_JOBMASK|SOLVER_CLEANDEPS)) == (SOLVER_ERASE|SOLVER_CLEANDEPS))
3879 else if (r->p > 0) /* install job */
3883 i = solv->ruletojob.elements[rid - solv->jobrules];
3884 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
3886 /* check if the literals all obsolete some installed package */
3890 /* just one installed literal */
3891 if (r->d == 0 && r->w2 == 0 && pool->solvables[r->p].repo == installed)
3893 /* multiversion is bad */
3894 if (solv->multiversion.size && !solv->keepexplicitobsoletes)
3896 FOR_RULELITERALS(p, jp, r)
3897 if (MAPTST(&solv->multiversion, p))
3905 FOR_RULELITERALS(p, jp, r)
3909 queue_truncate(&iq, iqstart); /* abort */
3912 if (pool->solvables[p].repo == installed)
3914 if (iq.count == iqstart)
3918 for (i = iqstart; i < iq.count; i++)
3919 if (iq.elements[i] == p)
3921 queue_truncate(&iq, iqstart);
3927 intersect_obsoletes(solv, p, &iq, iqstart, &om);
3928 if (iq.count == iqstart)
3936 queue_init_clone(&iqcopy, &iq);
3940 if (solv->cleandeps_updatepkgs)
3941 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
3942 queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]);
3946 queue_empty(&iq); /* just in case... */
3948 /* clear userinstalled bit for the packages we really want to delete/update */
3949 for (i = 0; i < iq.count; i++)
3952 if (pool->solvables[p].repo != installed)
3954 MAPCLR(&userinstalled, p - installed->start);
3957 for (p = installed->start; p < installed->end; p++)
3959 if (pool->solvables[p].repo != installed)
3961 MAPSET(&installedm, p);
3962 if (unneeded && !MAPTST(&userinstalled, p - installed->start))
3966 MAPSET(&installedm, SYSTEMSOLVABLE);
3967 MAPSET(&im, SYSTEMSOLVABLE);
3969 #ifdef CLEANDEPSDEBUG
3970 printf("REMOVE PASS\n");
3979 /* supplements pass */
3980 for (ip = installed->start; ip < installed->end; ip++)
3982 if (!MAPTST(&installedm, ip))
3984 s = pool->solvables + ip;
3985 if (!s->supplements)
3987 if (!MAPTST(&im, ip))
3989 if (MAPTST(&userinstalled, ip - installed->start))
3991 supp = s->repo->idarraydata + s->supplements;
3992 while ((sup = *supp++) != 0)
3993 if (dep_possible(solv, sup, &im))
3997 supp = s->repo->idarraydata + s->supplements;
3998 while ((sup = *supp++) != 0)
3999 if (dep_possible(solv, sup, &installedm) || (xsuppq.count && queue_contains(&xsuppq, sup)))
4001 /* no longer supplemented, also erase */
4002 int iqcount = iq.count;
4003 /* pin packages, see comment above dep_pkgcheck */
4004 dep_pkgcheck(solv, sup, &im, &iq);
4005 for (i = iqcount; i < iq.count; i++)
4007 Id pqp = iq.elements[i];
4008 if (pool->solvables[pqp].repo == installed)
4009 MAPSET(&userinstalled, pqp - installed->start);
4011 queue_truncate(&iq, iqcount);
4012 #ifdef CLEANDEPSDEBUG
4013 printf("%s supplemented [%s]\n", pool_solvid2str(pool, ip), pool_dep2str(pool, sup));
4015 queue_push(&iq, ip);
4020 break; /* no supplementing package found, we're done */
4022 ip = queue_shift(&iq);
4023 s = pool->solvables + ip;
4024 if (!MAPTST(&im, ip))
4026 if (!MAPTST(&installedm, ip))
4028 if (s->repo == installed && MAPTST(&userinstalled, ip - installed->start))
4031 #ifdef CLEANDEPSDEBUG
4032 printf("removing %s\n", pool_solvable2str(pool, s));
4036 reqp = s->repo->idarraydata + s->requires;
4037 while ((req = *reqp++) != 0)
4039 if (req == SOLVABLE_PREREQMARKER)
4041 #ifdef ENABLE_COMPLEX_DEPS
4042 if (pool_is_complex_dep(pool, req))
4044 complex_cleandeps_remove(pool, ip, req, &im, &installedm, &iq);
4048 FOR_PROVIDES(p, pp, req)
4050 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
4052 #ifdef CLEANDEPSDEBUG
4053 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4062 reqp = s->repo->idarraydata + s->recommends;
4063 while ((req = *reqp++) != 0)
4065 #ifdef ENABLE_COMPLEX_DEPS
4066 if (pool_is_complex_dep(pool, req))
4068 complex_cleandeps_remove(pool, ip, req, &im, &installedm, &iq);
4072 FOR_PROVIDES(p, pp, req)
4074 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
4076 #ifdef CLEANDEPSDEBUG
4077 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4086 /* turn userinstalled into remove set for pruning */
4087 map_empty(&userinstalled);
4088 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
4090 r = solv->rules + rid;
4091 if (r->p >= 0 || r->d != 0 || r->w2 != 0)
4092 continue; /* disabled or not erase */
4095 if (pool->solvables[p].repo == installed)
4096 MAPSET(&userinstalled, p - installed->start);
4098 if (!unneeded && solv->cleandeps_updatepkgs)
4100 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
4102 p = solv->cleandeps_updatepkgs->elements[i];
4103 if (pool->solvables[p].repo == installed)
4104 MAPSET(&userinstalled, p - installed->start);
4107 MAPSET(&im, SYSTEMSOLVABLE); /* in case we cleared it above */
4108 for (p = installed->start; p < installed->end; p++)
4111 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
4113 r = solv->rules + rid;
4116 FOR_RULELITERALS(p, jp, r)
4120 /* also put directly addressed packages on the install queue
4121 * so we can mark patterns as installed */
4122 for (i = 0; i < job->count; i += 2)
4124 how = job->elements[i];
4125 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
4127 what = job->elements[i + 1];
4128 select = how & SOLVER_SELECTMASK;
4129 if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
4130 queue_push(&iq, what);
4134 #ifdef CLEANDEPSDEBUG
4135 printf("ADDBACK PASS\n");
4141 /* supplements pass */
4142 for (ip = installed->start; ip < installed->end; ip++)
4144 if (!MAPTST(&installedm, ip))
4146 if (MAPTST(&userinstalled, ip - installed->start))
4148 s = pool->solvables + ip;
4149 if (!s->supplements)
4151 if (MAPTST(&im, ip))
4153 supp = s->repo->idarraydata + s->supplements;
4154 while ((sup = *supp++) != 0)
4155 if (dep_possible(solv, sup, &im))
4159 #ifdef CLEANDEPSDEBUG
4160 printf("%s supplemented\n", pool_solvid2str(pool, ip));
4163 queue_push(&iq, ip);
4169 ip = queue_shift(&iq);
4170 s = pool->solvables + ip;
4171 #ifdef CLEANDEPSDEBUG
4172 printf("adding back %s\n", pool_solvable2str(pool, s));
4176 reqp = s->repo->idarraydata + s->requires;
4177 while ((req = *reqp++) != 0)
4179 #ifdef ENABLE_COMPLEX_DEPS
4180 if (pool_is_complex_dep(pool, req))
4182 complex_cleandeps_addback(pool, ip, req, &im, &installedm, &iq, &userinstalled);
4186 FOR_PROVIDES(p, pp, req)
4191 FOR_PROVIDES(p, pp, req)
4193 if (MAPTST(&installedm, p))
4197 if (MAPTST(&userinstalled, p - installed->start))
4199 #ifdef CLEANDEPSDEBUG
4200 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4210 reqp = s->repo->idarraydata + s->recommends;
4211 while ((req = *reqp++) != 0)
4213 #ifdef ENABLE_COMPLEX_DEPS
4214 if (pool_is_complex_dep(pool, req))
4216 complex_cleandeps_addback(pool, ip, req, &im, &installedm, &iq, &userinstalled);
4220 FOR_PROVIDES(p, pp, req)
4225 FOR_PROVIDES(p, pp, req)
4227 if (MAPTST(&installedm, p))
4231 if (MAPTST(&userinstalled, p - installed->start))
4233 #ifdef CLEANDEPSDEBUG
4234 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4245 /* make sure the updatepkgs and mistakes are not in the cleandeps map */
4246 if (solv->cleandeps_updatepkgs)
4247 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
4248 MAPSET(&im, solv->cleandeps_updatepkgs->elements[i]);
4249 if (solv->cleandeps_mistakes)
4250 for (i = 0; i < solv->cleandeps_mistakes->count; i++)
4251 MAPSET(&im, solv->cleandeps_mistakes->elements[i]);
4252 /* also remove original iq packages */
4253 for (i = 0; i < iqcopy.count; i++)
4254 MAPSET(&im, iqcopy.elements[i]);
4255 queue_free(&iqcopy);
4256 for (p = installed->start; p < installed->end; p++)
4258 if (pool->solvables[p].repo != installed)
4260 if (!MAPTST(&im, p))
4261 MAPSET(cleandepsmap, p - installed->start);
4264 map_free(&installedm);
4265 map_free(&userinstalled);
4266 queue_free(&xsuppq);
4267 #ifdef CLEANDEPSDEBUG
4268 printf("=== final cleandeps map:\n");
4269 for (p = installed->start; p < installed->end; p++)
4270 if (MAPTST(cleandepsmap, p - installed->start))
4271 printf(" - %s\n", pool_solvid2str(pool, p));
4284 /* Tarjan's SCC algorithm, slightly modifed */
4286 trj_visit(struct trj_data *trj, Id node)
4289 Queue *edges = trj->edges;
4290 Id nnode, myidx, stackstart;
4293 low[node] = myidx = trj->idx++;
4294 low[(stackstart = trj->nstack++)] = node;
4295 for (i = edges->elements[node]; (nnode = edges->elements[i]) != 0; i++)
4300 if (!edges->elements[edges->elements[nnode]])
4306 trj_visit(trj, nnode);
4311 if (l < trj->firstidx)
4314 for (k = l; low[low[k]] == l; k++)
4317 else if (l < low[node])
4320 if (low[node] == myidx)
4322 if (myidx != trj->firstidx)
4324 for (i = stackstart; i < trj->nstack; i++)
4325 low[low[i]] = myidx;
4326 trj->nstack = stackstart;
4330 #ifdef ENABLE_COMPLEX_DEPS
4332 complex_unneeded(Pool *pool, Id ip, Id req, Queue *edges, Map *cleandepsmap, Queue *unneededq)
4339 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
4340 if (i == 0 || i == 1)
4345 for (i = 0; i < dq.count; i++)
4347 for (; (p = dq.elements[i]) != 0; i++)
4351 if (pool->solvables[-p].repo != pool->installed)
4355 if (p == ip || pool->solvables[p].repo != pool->installed || !MAPTST(cleandepsmap, p - pool->installed->start))
4357 for (j = 0; j < unneededq->count; j++)
4358 if (p == unneededq->elements[j])
4360 if (edges->elements[edges->count - 1] != j + 1)
4361 queue_push(edges, j + 1);
4365 while (dq.elements[i])
4373 solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered)
4375 Repo *installed = solv->installed;
4379 queue_empty(unneededq);
4380 if (!installed || installed->end == installed->start)
4383 map_init(&cleandepsmap, installed->end - installed->start);
4384 solver_createcleandepsmap(solv, &cleandepsmap, 1);
4385 for (i = installed->start; i < installed->end; i++)
4386 if (MAPTST(&cleandepsmap, i - installed->start))
4387 queue_push(unneededq, i);
4389 if (filtered && unneededq->count > 1)
4391 Pool *pool = solv->pool;
4395 int j, pass, count = unneededq->count;
4398 map_init(&installedm, pool->nsolvables);
4399 for (i = installed->start; i < installed->end; i++)
4400 if (pool->solvables[i].repo == installed)
4401 MAPSET(&installedm, i);
4403 nrequires = solv_calloc(count, sizeof(Id));
4405 queue_prealloc(&edges, count * 4 + 10); /* pre-size */
4408 * Go through the solvables in the nodes queue and create edges for
4409 * all requires/recommends/supplements between the nodes.
4410 * The edges are stored in the edges queue, we add 1 to the node
4411 * index so that nodes in the edges queue are != 0 and we can
4412 * terminate the edge list with 0.
4413 * Thus for node element 5, the edges are stored starting at
4414 * edges.elements[6] and are 0-terminated.
4416 /* leave first element zero to make things easier */
4417 /* also add trailing zero */
4418 queue_insertn(&edges, 0, 1 + count + 1, 0);
4420 /* first requires and recommends */
4421 for (i = 0; i < count; i++)
4423 Solvable *s = pool->solvables + unneededq->elements[i];
4424 int oldcount = edges.count;
4425 edges.elements[i + 1] = oldcount;
4426 for (pass = 0; pass < 2; pass++)
4428 unsigned int off = pass == 0 ? s->requires : s->recommends;
4431 for (dp = s->repo->idarraydata + off; (dep = *dp) != 0; dp++)
4433 #ifdef ENABLE_COMPLEX_DEPS
4434 if (pool_is_complex_dep(pool, dep))
4436 complex_unneeded(pool, s - pool->solvables, dep, &edges, &cleandepsmap, unneededq);
4440 FOR_PROVIDES(p, pp, dep)
4442 Solvable *sp = pool->solvables + p;
4443 if (s == sp || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
4445 for (j = 0; j < count; j++)
4446 if (p == unneededq->elements[j])
4448 if (edges.elements[edges.count - 1] != j + 1)
4449 queue_push(&edges, j + 1);
4454 nrequires[i] = edges.count - oldcount;
4456 queue_push(&edges, 0);
4459 printf("requires + recommends\n");
4460 for (i = 0; i < count; i++)
4463 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
4464 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
4465 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
4469 /* then add supplements */
4470 for (i = 0; i < count; i++)
4472 Solvable *s = pool->solvables + unneededq->elements[i];
4477 for (dp = s->repo->idarraydata + s->supplements; *dp; dp++)
4478 if (dep_possible(solv, *dp, &installedm))
4482 queue_init_buffer(&iq, iqbuf, sizeof(iqbuf)/sizeof(*iqbuf));
4483 dep_pkgcheck(solv, *dp, 0, &iq);
4484 for (k = 0; k < iq.count; k++)
4486 Id p = iq.elements[k];
4487 Solvable *sp = pool->solvables + p;
4488 if (p == unneededq->elements[i] || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
4490 for (j = 0; j < count; j++)
4491 if (p == unneededq->elements[j])
4493 /* now add edge from j + 1 to i + 1 */
4494 queue_insert(&edges, edges.elements[j + 1] + nrequires[j], i + 1);
4495 /* addapt following edge pointers */
4496 for (j = j + 2; j < count + 1; j++)
4497 edges.elements[j]++;
4505 printf("+ supplements\n");
4506 for (i = 0; i < count; i++)
4509 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
4510 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
4511 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
4514 map_free(&installedm);
4516 /* now run SCC algo two times, first with requires+recommends+supplements,
4517 * then again without the requires. We run it the second time to get rid
4518 * of packages that got dragged in via recommends/supplements */
4520 * low will contain the result of the SCC search.
4521 * it must be of at least size 2 * (count + 1) and
4522 * must be zero initialized.
4524 * 0 low low ... low stack stack ...stack 0
4527 low = solv_calloc(count + 1, 2 * sizeof(Id));
4528 for (pass = 0; pass < 2; pass++)
4530 struct trj_data trj;
4533 memset(low, 0, (count + 1) * (2 * sizeof(Id)));
4534 for (i = 0; i < count; i++)
4536 edges.elements[i + 1] += nrequires[i];
4537 if (!unneededq->elements[i])
4538 low[i + 1] = -1; /* ignore this node */
4543 trj.idx = count + 1; /* stack starts here */
4544 for (i = 1; i <= count; i++)
4548 if (edges.elements[edges.elements[i]])
4550 trj.firstidx = trj.nstack = trj.idx;
4555 Id myidx = trj.idx++;
4560 /* prune packages */
4561 for (i = 0; i < count; i++)
4562 if (low[i + 1] <= 0)
4563 unneededq->elements[i] = 0;
4566 solv_free(nrequires);
4569 /* finally remove all pruned entries from unneededq */
4570 for (i = j = 0; i < count; i++)
4571 if (unneededq->elements[i])
4572 unneededq->elements[j++] = unneededq->elements[i];
4573 queue_truncate(unneededq, j);
4575 map_free(&cleandepsmap);
4580 solver_breakorphans(Solver *solv)
4582 Pool *pool = solv->pool;
4583 Repo *installed = solv->installed;
4587 if (!installed || solv->droporphanedmap_all)
4589 solv->brokenorphanrules = solv_calloc(1, sizeof(Queue));
4590 queue_init(solv->brokenorphanrules);
4591 map_init(&m, installed->end - installed->start);
4592 for (i = 0; i < solv->orphaned.count; i++)
4594 Id p = solv->orphaned.elements[i];
4595 if (pool->solvables[p].repo != installed)
4597 if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - installed->start))
4599 MAPSET(&m, p - installed->start);
4601 for (rid = 1; rid < solv->rpmrules_end ; rid++)
4604 Rule *r = solv->rules + rid;
4605 /* ignore non-deps and simple conflicts */
4606 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 < 0))
4609 if (p < installed->start || p >= installed->end || !MAPTST(&m, p - installed->start))
4611 /* need to check other literals */
4612 if (r->d == 0 || r->d == -1)
4614 for (dp = pool->whatprovidesdata + (r->d < 0 ? -r->d - 1 : r->d); *dp < 0; dp++)
4617 if (p >= installed->start && p < installed->end && MAPTST(&m, p - installed->start))
4623 /* ok, disable this rule */
4624 queue_push(solv->brokenorphanrules, rid);
4626 solver_disablerule(solv, r);
4629 if (!solv->brokenorphanrules->count)
4631 queue_free(solv->brokenorphanrules);
4632 solv->brokenorphanrules = solv_free(solv->brokenorphanrules);
4637 solver_check_brokenorphanrules(Solver *solv, Queue *dq)
4639 Pool *pool = solv->pool;
4644 if (!solv->brokenorphanrules)
4646 for (i = 0; i < solv->brokenorphanrules->count; i++)
4648 int rid = solv->brokenorphanrules->elements[i];
4649 Rule *r = solv->rules + rid;
4650 FOR_RULELITERALS(l, pp, r)
4654 if (solv->decisionmap[-l] <= 0)
4659 if (solv->decisionmap[l] > 0 && pool->solvables[l].repo != solv->installed)
4665 FOR_RULELITERALS(l, pp, r)
4666 if (l > 0 && solv->decisionmap[l] == 0 && pool->solvables[l].repo != solv->installed)
4667 queue_pushunique(dq, l);