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"
30 #define RULES_BLOCK 63
32 static void addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep);
33 static void solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded);
35 /*-------------------------------------------------------------------
36 * Check if dependency is possible
38 * mirrors solver_dep_fulfilled but uses map m instead of the decisionmap
39 * used in solver_addrpmrulesforweak and solver_createcleandepsmap
43 dep_possible(Solver *solv, Id dep, Map *m)
45 Pool *pool = solv->pool;
50 Reldep *rd = GETRELDEP(pool, dep);
53 if (rd->flags == REL_AND)
55 if (!dep_possible(solv, rd->name, m))
57 return dep_possible(solv, rd->evr, m);
59 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
60 return solver_splitprovides(solv, rd->evr);
61 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
62 return solver_dep_installed(solv, rd->evr);
65 FOR_PROVIDES(p, pp, dep)
73 /********************************************************************
77 * - unify rules, remove duplicates
80 /*-------------------------------------------------------------------
82 * compare rules for unification sort
87 unifyrules_sortcmp(const void *ap, const void *bp, void *dp)
97 return x; /* p differs */
100 if (a->d == 0 && b->d == 0)
101 return a->w2 - b->w2; /* assertion: return w2 diff */
103 if (a->d == 0) /* a is assertion, b not */
105 x = a->w2 - pool->whatprovidesdata[b->d];
109 if (b->d == 0) /* b is assertion, a not */
111 x = pool->whatprovidesdata[a->d] - b->w2;
115 /* compare whatprovidesdata */
116 ad = pool->whatprovidesdata + a->d;
117 bd = pool->whatprovidesdata + b->d;
119 if ((x = *ad++ - *bd++) != 0)
125 solver_samerule(Solver *solv, Rule *r1, Rule *r2)
127 return unifyrules_sortcmp(r1, r2, solv->pool);
131 /*-------------------------------------------------------------------
134 * go over all rules and remove duplicates
138 solver_unifyrules(Solver *solv)
140 Pool *pool = solv->pool;
144 if (solv->nrules <= 2) /* nothing to unify */
147 /* sort rules first */
148 solv_sort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp, solv->pool);
155 for (i = j = 1, ir = solv->rules + i; i < solv->nrules; i++, ir++)
157 if (jr && !unifyrules_sortcmp(ir, jr, pool))
158 continue; /* prune! */
159 jr = solv->rules + j++; /* keep! */
164 /* reduced count from nrules to j rules */
165 POOL_DEBUG(SOLV_DEBUG_STATS, "pruned rules from %d to %d\n", solv->nrules, j);
167 /* adapt rule buffer */
169 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
172 * debug: log rule statistics
174 IF_POOLDEBUG (SOLV_DEBUG_STATS)
181 for (i = 1; i < solv->nrules; i++)
188 dp = solv->pool->whatprovidesdata + r->d;
193 POOL_DEBUG(SOLV_DEBUG_STATS, " binary: %d\n", binr);
194 POOL_DEBUG(SOLV_DEBUG_STATS, " normal: %d, %d literals\n", solv->nrules - 1 - binr, lits);
205 hashrule(Solver *solv, Id p, Id d, int n)
207 unsigned int x = (unsigned int)p;
211 return (x * 37) ^ (unsigned int)d;
212 dp = solv->pool->whatprovidesdata + d;
214 x = (x * 37) ^ (unsigned int)*dp++;
220 /*-------------------------------------------------------------------
226 * p = direct literal; always < 0 for installed rpm rules
227 * d, if < 0 direct literal, if > 0 offset into whatprovides, if == 0 rule is assertion (look at p only)
230 * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
232 * p < 0 : pkg id of A
233 * d > 0 : Offset in whatprovidesdata (list of providers of b)
235 * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
236 * p < 0 : pkg id of A
237 * d < 0 : Id of solvable (e.g. B1)
239 * d == 0: unary rule, assertion => (A) or (-A)
241 * Install: p > 0, d = 0 (A) user requested install
242 * Remove: p < 0, d = 0 (-A) user requested remove (also: uninstallable)
243 * Requires: p < 0, d > 0 (-A|B1|B2|...) d: <list of providers for requirement of p>
244 * Updates: p > 0, d > 0 (A|B1|B2|...) d: <list of updates for solvable p>
245 * Conflicts: p < 0, d < 0 (-A|-B) either p (conflict issuer) or d (conflict provider) (binary rule)
246 * also used for obsoletes
247 * ?: p > 0, d < 0 (A|-B)
248 * No-op ?: p = 0, d = 0 (null) (used as policy rule placeholder)
252 * Direct assertion (no watch needed) --> d = 0, w1 = p, w2 = 0
253 * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
254 * every other : w1 = p, w2 = whatprovidesdata[d];
255 * Disabled rule: w1 = 0
257 * always returns a rule for non-rpm rules
261 solver_addrule(Solver *solv, Id p, Id d)
263 Pool *pool = solv->pool;
267 int n = 0; /* number of literals in rule - 1
268 0 = direct assertion (single literal)
273 /* it often happenes that requires lead to adding the same rpm rule
274 * multiple times, so we prune those duplicates right away to make
275 * the work for unifyrules a bit easier */
277 if (!solv->rpmrules_end) /* we add rpm rules */
279 r = solv->rules + solv->nrules - 1; /* get the last added rule */
280 if (r->p == p && r->d == d && (d != 0 || !r->w2))
285 * compute number of literals (n) in rule
290 /* always a binary rule */
292 return 0; /* ignore self conflict */
297 for (dp = pool->whatprovidesdata + d; *dp; dp++, n++)
299 return 0; /* rule is self-fulfilling */
301 if (n == 1) /* convert to binary rule */
305 if (n == 1 && p > d && !solv->rpmrules_end)
307 /* smallest literal first so we can find dups */
308 n = p; p = d; d = n; /* p <-> d */
309 n = 1; /* re-set n, was used as temp var */
313 * check for duplicate
316 /* check if the last added rule (r) is exactly the same as what we're looking for. */
317 if (r && n == 1 && !r->d && r->p == p && r->w2 == d)
318 return r; /* binary rule */
320 /* have n-ary rule with same first literal, check other literals */
321 if (r && n > 1 && r->d && r->p == p)
323 /* Rule where d is an offset in whatprovidesdata */
327 dp2 = pool->whatprovidesdata + r->d;
328 for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
339 /* extend rule buffer */
340 solv->rules = solv_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
341 r = solv->rules + solv->nrules++; /* point to rule space */
350 /* direct assertion, no watch needed */
366 r->w2 = pool->whatprovidesdata[d];
371 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
373 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " Add rule: ");
374 solver_printrule(solv, SOLV_DEBUG_RULE_CREATION, r);
381 /******************************************************************************
383 *** rpm rule part: create rules representing the package dependencies
388 * special multiversion patch conflict handling:
389 * a patch conflict is also satisfied if some other
390 * version with the same name/arch that doesn't conflict
391 * gets installed. The generated rule is thus:
392 * -patch|-cpack|opack1|opack2|...
395 makemultiversionconflict(Solver *solv, Id n, Id con)
397 Pool *pool = solv->pool;
402 sn = pool->solvables + n;
403 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
405 FOR_PROVIDES(p, pp, sn->name)
407 s = pool->solvables + p;
408 if (s->name != sn->name || s->arch != sn->arch)
410 if (!MAPTST(&solv->noobsoletes, p))
412 if (pool_match_nevr(pool, pool->solvables + p, con))
414 /* here we have a multiversion solvable that doesn't conflict */
415 /* thus we're not in conflict if it is installed */
419 return -n; /* no other package found, generate normal conflict */
420 return pool_queuetowhatprovides(pool, &q);
424 addrpmrule(Solver *solv, Id p, Id d, int type, Id dep)
426 if (!solv->ruleinfoq)
427 solver_addrule(solv, p, d);
429 addrpmruleinfo(solv, p, d, type, dep);
432 /*-------------------------------------------------------------------
434 * add (install) rules for solvable
436 * s: Solvable for which to add rules
437 * m: m[s] = 1 for solvables which have rules, prevent rule duplication
439 * Algorithm: 'visit all nodes of a graph'. The graph nodes are
440 * solvables, the edges their dependencies.
441 * Starting from an installed solvable, this will create all rules
442 * representing the graph created by the solvables dependencies.
444 * for unfulfilled requirements, conflicts, obsoletes,....
445 * add a negative assertion for solvables that are not installable
447 * It will also create rules for all solvables referenced by 's'
448 * i.e. descend to all providers of requirements of 's'
453 solver_addrpmrulesforsolvable(Solver *solv, Solvable *s, Map *m)
455 Pool *pool = solv->pool;
456 Repo *installed = solv->installed;
458 /* 'work' queue. keeps Ids of solvables we still have to work on.
459 And buffer for it. */
464 /* if to add rules for broken deps ('rpm -V' functionality)
468 /* Id var and pointer for each dependency
469 * (not used in parallel)
476 Id p, pp; /* whatprovides loops */
477 Id *dp; /* ptr to 'whatprovides' */
478 Id n; /* Id for current solvable 's' */
480 queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
481 queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
483 /* loop until there's no more work left */
488 * s: Pointer to solvable
491 n = queue_shift(&workq); /* 'pop' next solvable to work on from queue */
494 if (MAPTST(m, n)) /* continue if already visited */
496 MAPSET(m, n); /* mark as visited */
499 s = pool->solvables + n; /* s = Solvable in question */
502 if (installed /* Installed system available */
503 && s->repo == installed /* solvable is installed */
504 && !solv->fixmap_all /* NOT repair errors in rpm dependency graph */
505 && !(solv->fixmap.size && MAPTST(&solv->fixmap, n - installed->start)))
507 dontfix = 1; /* dont care about broken rpm deps */
511 && s->arch != ARCH_SRC
512 && s->arch != ARCH_NOSRC
513 && !pool_installable(pool, s))
515 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables));
516 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOT_INSTALLABLE, 0);
519 /* yet another SUSE hack, sigh */
520 if (pool->nscallback && !strncmp("product:", pool_id2str(pool, s->name), 8))
522 Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, n);
523 if (buddy > 0 && buddy != SYSTEMSOLVABLE && buddy != n && buddy < pool->nsolvables)
525 addrpmrule(solv, n, -buddy, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + n));
526 addrpmrule(solv, buddy, -n, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + buddy));
527 if (m && !MAPTST(m, buddy))
528 queue_push(&workq, buddy);
532 /*-----------------------------------------
533 * check requires of s
538 reqp = s->repo->idarraydata + s->requires;
539 while ((req = *reqp++) != 0) /* go through all requires */
541 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
544 /* find list of solvables providing 'req' */
545 dp = pool_whatprovides_ptr(pool, req);
547 if (*dp == SYSTEMSOLVABLE) /* always installed */
552 /* the strategy here is to not insist on dependencies
553 * that are already broken. so if we find one provider
554 * that was already installed, we know that the
555 * dependency was not broken before so we enforce it */
557 /* check if any of the providers for 'req' is installed */
558 for (i = 0; (p = dp[i]) != 0; i++)
560 if (pool->solvables[p].repo == installed)
561 break; /* provider was installed */
563 /* didn't find an installed provider: previously broken dependency */
566 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s));
573 /* nothing provides req! */
574 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables), pool_dep2str(pool, req));
575 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP, req);
579 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
581 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION," %s requires %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
582 for (i = 0; dp[i]; i++)
583 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " provided by %s\n", pool_solvid2str(pool, dp[i]));
586 /* add 'requires' dependency */
587 /* rule: (-requestor|provider1|provider2|...|providerN) */
588 addrpmrule(solv, -n, dp - pool->whatprovidesdata, SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
590 /* descend the dependency tree
591 push all non-visited providers on the work queue */
597 queue_push(&workq, *dp);
601 } /* while, requirements of n */
603 } /* if, requirements */
605 /* that's all we check for src packages */
606 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
609 /*-----------------------------------------
610 * check conflicts of s
617 /* we treat conflicts in patches a bit differen:
619 * - multiversion handling
620 * XXX: we should really handle this different, looking
621 * at the name is a bad hack
623 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
625 conp = s->repo->idarraydata + s->conflicts;
626 /* foreach conflicts of 's' */
627 while ((con = *conp++) != 0)
629 /* foreach providers of a conflict of 's' */
630 FOR_PROVIDES(p, pp, con)
632 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
634 /* dontfix: dont care about conflicts with already installed packs */
635 if (dontfix && pool->solvables[p].repo == installed)
637 /* p == n: self conflict */
638 if (p == n && pool->forbidselfconflicts)
642 Reldep *rd = GETRELDEP(pool, con);
643 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
646 p = 0; /* make it a negative assertion, aka 'uninstallable' */
648 if (p && ispatch && solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p) && ISRELDEP(con))
650 /* our patch conflicts with a noobsoletes (aka multiversion) package */
651 p = -makemultiversionconflict(solv, p, con);
653 /* rule: -n|-p: either solvable _or_ provider of conflict */
654 addrpmrule(solv, -n, -p, p ? SOLVER_RULE_RPM_PACKAGE_CONFLICT : SOLVER_RULE_RPM_SELF_CONFLICT, con);
659 /*-----------------------------------------
660 * check obsoletes and implicit obsoletes of a package
661 * if ignoreinstalledsobsoletes is not set, we're also checking
662 * obsoletes of installed packages (like newer rpm versions)
664 if ((!installed || s->repo != installed) || !pool->noinstalledobsoletes)
666 int noobs = solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n);
667 int isinstalled = (installed && s->repo == installed);
668 if (s->obsoletes && !noobs)
670 obsp = s->repo->idarraydata + s->obsoletes;
671 /* foreach obsoletes */
672 while ((obs = *obsp++) != 0)
674 /* foreach provider of an obsoletes of 's' */
675 FOR_PROVIDES(p, pp, obs)
677 Solvable *ps = pool->solvables + p;
680 if (isinstalled && dontfix && ps->repo == installed)
681 continue; /* don't repair installed/installed problems */
682 if (!pool->obsoleteusesprovides /* obsoletes are matched names, not provides */
683 && !pool_match_nevr(pool, ps, obs))
685 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
688 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_PACKAGE_OBSOLETES, obs);
690 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES, obs);
694 /* check implicit obsoletes
695 * for installed packages we only need to check installed/installed problems (and
696 * only when dontfix is not set), as the others are picked up when looking at the
697 * uninstalled package.
699 if (!isinstalled || !dontfix)
701 FOR_PROVIDES(p, pp, s->name)
703 Solvable *ps = pool->solvables + p;
706 if (isinstalled && ps->repo != installed)
708 /* we still obsolete packages with same nevra, like rpm does */
709 /* (actually, rpm mixes those packages. yuck...) */
710 if (noobs && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
712 if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
714 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
716 if (s->name == ps->name)
717 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_SAME_NAME, 0);
719 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_IMPLICIT_OBSOLETES, s->name);
724 /*-----------------------------------------
725 * add recommends to the work queue
727 if (s->recommends && m)
729 recp = s->repo->idarraydata + s->recommends;
730 while ((rec = *recp++) != 0)
732 FOR_PROVIDES(p, pp, rec)
734 queue_push(&workq, p);
737 if (s->suggests && m)
739 sugp = s->repo->idarraydata + s->suggests;
740 while ((sug = *sugp++) != 0)
742 FOR_PROVIDES(p, pp, sug)
744 queue_push(&workq, p);
752 /*-------------------------------------------------------------------
754 * Add rules for packages possibly selected in by weak dependencies
756 * m: already added solvables
760 solver_addrpmrulesforweak(Solver *solv, Map *m)
762 Pool *pool = solv->pool;
767 /* foreach solvable in pool */
768 for (i = n = 1; n < pool->nsolvables; i++, n++)
770 if (i == pool->nsolvables) /* wrap i */
772 if (MAPTST(m, i)) /* already added that one */
775 s = pool->solvables + i;
776 if (!pool_installable(pool, s)) /* only look at installable ones */
782 /* find possible supplements */
783 supp = s->repo->idarraydata + s->supplements;
784 while ((sup = *supp++) != 0)
785 if (dep_possible(solv, sup, m))
789 /* if nothing found, check for enhances */
790 if (!sup && s->enhances)
792 supp = s->repo->idarraydata + s->enhances;
793 while ((sup = *supp++) != 0)
794 if (dep_possible(solv, sup, m))
797 /* if nothing found, goto next solvables */
800 solver_addrpmrulesforsolvable(solv, s, m);
801 n = 0; /* check all solvables again because we added solvables to m */
806 /*-------------------------------------------------------------------
808 * add package rules for possible updates
811 * m: map of already visited solvables
812 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
816 solver_addrpmrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
818 Pool *pool = solv->pool;
820 /* queue and buffer for it */
824 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
825 /* find update candidates for 's' */
826 policy_findupdatepackages(solv, s, &qs, allow_all);
827 /* add rule for 's' if not already done */
828 if (!MAPTST(m, s - pool->solvables))
829 solver_addrpmrulesforsolvable(solv, s, m);
830 /* foreach update candidate, add rule if not already done */
831 for (i = 0; i < qs.count; i++)
832 if (!MAPTST(m, qs.elements[i]))
833 solver_addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
838 /***********************************************************************
840 *** Update/Feature rule part
842 *** Those rules make sure an installed package isn't silently deleted
847 finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
849 Pool *pool = solv->pool;
852 policy_findupdatepackages(solv, s, qs, allow_all ? allow_all : 2);
856 return 0; /* orphaned, don't create feature rule */
857 /* check if this is an orphaned package */
858 policy_findupdatepackages(solv, s, qs, 1);
860 return 0; /* orphaned, don't create update rule */
862 return -SYSTEMSOLVABLE; /* supported but not installable */
865 return s - pool->solvables;
866 /* check if it is ok to keep the installed package */
867 for (i = 0; i < qs->count; i++)
869 Solvable *ns = pool->solvables + qs->elements[i];
870 if (s->evr == ns->evr && solvable_identical(s, ns))
871 return s - pool->solvables;
873 /* nope, it must be some other package */
874 return -SYSTEMSOLVABLE;
877 /* add packages from the dup repositories to the update candidates
878 * this isn't needed for the global dup mode as all packages are
879 * from dup repos in that case */
881 addduppackages(Solver *solv, Solvable *s, Queue *qs)
886 int oldnoupdateprovide = solv->noupdateprovide;
888 queue_init_buffer(&dupqs, dupqsbuf, sizeof(dupqsbuf)/sizeof(*dupqsbuf));
889 solv->noupdateprovide = 1;
890 policy_findupdatepackages(solv, s, &dupqs, 2);
891 solv->noupdateprovide = oldnoupdateprovide;
892 for (i = 0; i < dupqs.count; i++)
894 p = dupqs.elements[i];
895 if (MAPTST(&solv->dupmap, p))
896 queue_pushunique(qs, p);
901 /*-------------------------------------------------------------------
903 * add rule for update
904 * (A|A1|A2|A3...) An = update candidates for A
906 * s = (installed) solvable
910 solver_addupdaterule(Solver *solv, Solvable *s, int allow_all)
912 /* installed packages get a special upgrade allowed rule */
913 Pool *pool = solv->pool;
918 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
919 p = s - pool->solvables;
920 /* find update candidates for 's' */
921 if (solv->dupmap_all)
922 p = finddistupgradepackages(solv, s, &qs, allow_all);
924 policy_findupdatepackages(solv, s, &qs, allow_all);
925 if (!allow_all && !solv->dupmap_all && solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
926 addduppackages(solv, s, &qs);
928 if (!allow_all && qs.count && solv->noobsoletes.size)
932 d = pool_queuetowhatprovides(pool, &qs);
933 /* filter out all noobsoletes packages as they don't update */
934 for (i = j = 0; i < qs.count; i++)
936 if (MAPTST(&solv->noobsoletes, qs.elements[i]))
938 /* it's ok if they have same nevra */
939 Solvable *ps = pool->solvables + qs.elements[i];
940 if (ps->name != s->name || ps->evr != s->evr || ps->arch != s->arch)
943 qs.elements[j++] = qs.elements[i];
947 if (d && solv->installed && s->repo == solv->installed &&
948 (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, s - pool->solvables - solv->installed->start))))
950 if (!solv->multiversionupdaters)
951 solv->multiversionupdaters = solv_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
952 solv->multiversionupdaters[s - pool->solvables - solv->installed->start] = d;
954 if (j == 0 && p == -SYSTEMSOLVABLE && solv->dupmap_all)
956 queue_push(&solv->orphaned, s - pool->solvables); /* treat as orphaned */
962 if (qs.count && p == -SYSTEMSOLVABLE)
963 p = queue_shift(&qs);
964 d = qs.count ? pool_queuetowhatprovides(pool, &qs) : 0;
966 solver_addrule(solv, p, d); /* allow update of s */
970 disableupdaterule(Solver *solv, Id p)
974 MAPSET(&solv->noupdate, p - solv->installed->start);
975 r = solv->rules + solv->updaterules + (p - solv->installed->start);
976 if (r->p && r->d >= 0)
977 solver_disablerule(solv, r);
978 r = solv->rules + solv->featurerules + (p - solv->installed->start);
979 if (r->p && r->d >= 0)
980 solver_disablerule(solv, r);
984 reenableupdaterule(Solver *solv, Id p)
986 Pool *pool = solv->pool;
989 MAPCLR(&solv->noupdate, p - solv->installed->start);
990 r = solv->rules + solv->updaterules + (p - solv->installed->start);
995 solver_enablerule(solv, r);
996 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
998 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
999 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1003 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1004 if (r->p && r->d < 0)
1006 solver_enablerule(solv, r);
1007 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1009 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1010 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1016 /***********************************************************************
1018 *** Infarch rule part
1020 *** Infarch rules make sure the solver uses the best architecture of
1021 *** a package if multiple archetectures are available
1026 solver_addinfarchrules(Solver *solv, Map *addedmap)
1028 Pool *pool = solv->pool;
1030 Id p, pp, a, aa, bestarch;
1031 Solvable *s, *ps, *bests;
1032 Queue badq, allowedarchs;
1035 queue_init(&allowedarchs);
1036 solv->infarchrules = solv->nrules;
1037 for (i = 1; i < pool->nsolvables; i++)
1039 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1041 s = pool->solvables + i;
1045 queue_empty(&allowedarchs);
1046 FOR_PROVIDES(p, pp, s->name)
1048 ps = pool->solvables + p;
1049 if (ps->name != s->name || !MAPTST(addedmap, p))
1056 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1057 if (a != 1 && pool->installed && ps->repo == pool->installed)
1059 if (!solv->dupmap_all && !(solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1060 queue_pushunique(&allowedarchs, ps->arch); /* also ok to keep this architecture */
1061 continue; /* ignore installed solvables when calculating the best arch */
1063 if (a && a != 1 && (!bestarch || a < bestarch))
1071 /* speed up common case where installed package already has best arch */
1072 if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch)
1073 allowedarchs.count--; /* installed arch is best */
1075 FOR_PROVIDES(p, pp, s->name)
1077 ps = pool->solvables + p;
1078 if (ps->name != s->name || !MAPTST(addedmap, p))
1081 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1082 if (a != 1 && bestarch && ((a ^ bestarch) & 0xffff0000) != 0)
1084 if (pool->installed && ps->repo == pool->installed)
1085 continue; /* always ok to keep an installed package */
1086 for (j = 0; j < allowedarchs.count; j++)
1088 aa = allowedarchs.elements[j];
1091 aa = (aa <= pool->lastarch) ? pool->id2arch[aa] : 0;
1092 if (aa && ((a ^ aa) & 0xffff0000) == 0)
1093 break; /* compatible */
1095 if (j == allowedarchs.count)
1096 queue_push(&badq, p);
1101 /* block all solvables in the badq! */
1102 for (j = 0; j < badq.count; j++)
1104 p = badq.elements[j];
1105 solver_addrule(solv, -p, 0);
1109 queue_free(&allowedarchs);
1110 solv->infarchrules_end = solv->nrules;
1114 disableinfarchrule(Solver *solv, Id name)
1116 Pool *pool = solv->pool;
1119 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1121 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1122 solver_disablerule(solv, r);
1127 reenableinfarchrule(Solver *solv, Id name)
1129 Pool *pool = solv->pool;
1132 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1134 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1136 solver_enablerule(solv, r);
1137 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1139 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1140 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1147 /***********************************************************************
1151 *** Dup rules make sure a package is selected from the specified dup
1152 *** repositories if an update candidate is included in one of them.
1157 solver_createdupmaps(Solver *solv)
1159 Queue *job = &solv->job;
1160 Pool *pool = solv->pool;
1162 Id how, what, p, pi, pp, obs, *obsp;
1166 map_init(&solv->dupmap, pool->nsolvables);
1167 map_init(&solv->dupinvolvedmap, pool->nsolvables);
1168 for (i = 0; i < job->count; i += 2)
1170 how = job->elements[i];
1171 what = job->elements[i + 1];
1172 switch (how & SOLVER_JOBMASK)
1174 case SOLVER_DISTUPGRADE:
1175 if ((how & SOLVER_SELECTMASK) != SOLVER_SOLVABLE_REPO)
1177 if (what <= 0 || what > pool->nrepos)
1179 repo = pool_id2repo(pool, what);
1180 FOR_REPO_SOLVABLES(repo, p, s)
1182 MAPSET(&solv->dupmap, p);
1183 FOR_PROVIDES(pi, pp, s->name)
1185 ps = pool->solvables + pi;
1186 if (ps->name != s->name)
1188 MAPSET(&solv->dupinvolvedmap, pi);
1192 /* FIXME: check obsoletes/provides combination */
1193 obsp = s->repo->idarraydata + s->obsoletes;
1194 while ((obs = *obsp++) != 0)
1196 FOR_PROVIDES(pi, pp, obs)
1198 Solvable *pis = pool->solvables + pi;
1199 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pis, obs))
1201 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, pis))
1203 MAPSET(&solv->dupinvolvedmap, pi);
1213 MAPCLR(&solv->dupinvolvedmap, SYSTEMSOLVABLE);
1217 solver_freedupmaps(Solver *solv)
1219 map_free(&solv->dupmap);
1220 /* we no longer free solv->dupinvolvedmap as we need it in
1221 * policy's priority pruning code. sigh. */
1225 solver_addduprules(Solver *solv, Map *addedmap)
1227 Pool *pool = solv->pool;
1232 solv->duprules = solv->nrules;
1233 for (i = 1; i < pool->nsolvables; i++)
1235 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1237 s = pool->solvables + i;
1239 FOR_PROVIDES(p, pp, s->name)
1241 ps = pool->solvables + p;
1242 if (ps->name != s->name || !MAPTST(addedmap, p))
1248 if (!MAPTST(&solv->dupinvolvedmap, p))
1250 if (solv->installed && ps->repo == solv->installed)
1252 if (!solv->updatemap.size)
1253 map_grow(&solv->updatemap, solv->installed->end - solv->installed->start);
1254 MAPSET(&solv->updatemap, p - solv->installed->start);
1255 if (!MAPTST(&solv->dupmap, p))
1258 /* is installed identical to a good one? */
1259 FOR_PROVIDES(ip, ipp, ps->name)
1261 Solvable *is = pool->solvables + ip;
1262 if (!MAPTST(&solv->dupmap, ip))
1264 if (is->evr == ps->evr && solvable_identical(ps, is))
1268 solver_addrule(solv, -p, 0); /* no match, sorry */
1271 else if (!MAPTST(&solv->dupmap, p))
1272 solver_addrule(solv, -p, 0);
1275 solv->duprules_end = solv->nrules;
1280 disableduprule(Solver *solv, Id name)
1282 Pool *pool = solv->pool;
1285 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1287 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1288 solver_disablerule(solv, r);
1293 reenableduprule(Solver *solv, Id name)
1295 Pool *pool = solv->pool;
1298 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1300 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1302 solver_enablerule(solv, r);
1303 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1305 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1306 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1313 /***********************************************************************
1315 *** Policy rule disabling/reenabling
1317 *** Disable all policy rules that conflict with our jobs. If a job
1318 *** gets disabled later on, reenable the involved policy rules again.
1322 #define DISABLE_UPDATE 1
1323 #define DISABLE_INFARCH 2
1324 #define DISABLE_DUP 3
1327 * add all installed packages that package p obsoletes to Queue q.
1328 * Package p is not installed and not in oobs map.
1329 * Entries may get added multiple times.
1332 add_obsoletes(Solver *solv, Id p, Queue *q)
1334 Pool *pool = solv->pool;
1335 Repo *installed = solv->installed;
1337 Solvable *s = pool->solvables + p;
1341 /* we already know: p is not installed, p is not noobs */
1342 FOR_PROVIDES(p2, pp2, s->name)
1344 Solvable *ps = pool->solvables + p2;
1345 if (ps->repo != installed)
1347 if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
1349 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1356 obsp = s->repo->idarraydata + s->obsoletes;
1357 while ((obs = *obsp++) != 0)
1358 FOR_PROVIDES(p2, pp2, obs)
1360 Solvable *ps = pool->solvables + p2;
1361 if (ps->repo != installed)
1363 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1365 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1375 * Call add_obsoletes and intersect the result with the
1376 * elements in Queue q starting at qstart.
1377 * Assumes that it's the first call if qstart == q->count.
1378 * May use auxillary map m for the intersection process, all
1379 * elements of q starting at qstart must have their bit cleared.
1380 * (This is also true after the function returns.)
1383 intersect_obsoletes(Solver *solv, Id p, Queue *q, int qstart, Map *m)
1386 int qcount = q->count;
1388 add_obsoletes(solv, p, q);
1389 if (qcount == qstart)
1390 return; /* first call */
1391 if (qcount == q->count)
1393 else if (qcount == qstart + 1)
1395 /* easy if there's just one element */
1397 for (i = qcount; i < q->count; i++)
1398 if (q->elements[i] == q->elements[qstart])
1400 j++; /* keep the element */
1404 else if (!m->size && q->count - qstart <= 8)
1406 /* faster than a map most of the time */
1408 for (i = j = qstart; i < qcount; i++)
1410 Id ip = q->elements[i];
1411 for (k = qcount; k < q->count; k++)
1412 if (q->elements[k] == ip)
1414 q->elements[j++] = ip;
1421 /* for the really pathologic cases we use the map */
1422 Repo *installed = solv->installed;
1424 map_init(m, installed->end - installed->start);
1425 for (i = qcount; i < q->count; i++)
1426 MAPSET(m, q->elements[i] - installed->start);
1427 for (i = j = qstart; i < qcount; i++)
1428 if (MAPTST(m, q->elements[i] - installed->start))
1430 MAPCLR(m, q->elements[i] - installed->start);
1431 q->elements[j++] = q->elements[i];
1434 queue_truncate(q, j);
1438 jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
1440 Pool *pool = solv->pool;
1444 int i, j, set, qstart;
1447 installed = solv->installed;
1448 select = how & SOLVER_SELECTMASK;
1449 switch (how & SOLVER_JOBMASK)
1451 case SOLVER_INSTALL:
1452 set = how & SOLVER_SETMASK;
1453 if (!(set & SOLVER_NOAUTOSET))
1455 /* automatically add set bits by analysing the job */
1456 if (select == SOLVER_SOLVABLE)
1457 set |= SOLVER_SETARCH | SOLVER_SETVENDOR | SOLVER_SETREPO | SOLVER_SETEVR;
1458 else if ((select == SOLVER_SOLVABLE_NAME || select == SOLVER_SOLVABLE_PROVIDES) && ISRELDEP(what))
1460 Reldep *rd = GETRELDEP(pool, what);
1461 if (rd->flags == REL_EQ && select == SOLVER_SOLVABLE_NAME)
1463 #if !defined(DEBIAN_SEMANTICS)
1464 const char *evr = pool_id2str(pool, rd->evr);
1465 if (strchr(evr, '-'))
1466 set |= SOLVER_SETEVR;
1468 set |= SOLVER_SETEV;
1470 set |= SOLVER_SETEVR;
1473 if (rd->flags <= 7 && ISRELDEP(rd->name))
1474 rd = GETRELDEP(pool, rd->name);
1475 if (rd->flags == REL_ARCH)
1476 set |= SOLVER_SETARCH;
1480 set &= ~SOLVER_NOAUTOSET;
1483 if ((set & SOLVER_SETARCH) != 0 && solv->infarchrules != solv->infarchrules_end)
1485 if (select == SOLVER_SOLVABLE)
1486 queue_push2(q, DISABLE_INFARCH, pool->solvables[what].name);
1489 int qcnt = q->count;
1490 FOR_JOB_SELECT(p, pp, select, what)
1492 s = pool->solvables + p;
1494 for (i = qcnt; i < q->count; i += 2)
1495 if (q->elements[i + 1] == s->name)
1499 queue_push2(q, DISABLE_INFARCH, s->name);
1503 if ((set & SOLVER_SETREPO) != 0 && solv->duprules != solv->duprules_end)
1505 if (select == SOLVER_SOLVABLE)
1506 queue_push2(q, DISABLE_DUP, pool->solvables[what].name);
1509 int qcnt = q->count;
1510 FOR_JOB_SELECT(p, pp, select, what)
1512 s = pool->solvables + p;
1514 for (i = qcnt; i < q->count; i += 2)
1515 if (q->elements[i + 1] == s->name)
1519 queue_push2(q, DISABLE_DUP, s->name);
1523 if (!installed || installed->end == installed->start)
1525 /* now the hard part: disable some update rules */
1527 /* first check if we have noobs or installed packages in the job */
1529 FOR_JOB_SELECT(p, pp, select, what)
1531 if (pool->solvables[p].repo == installed)
1533 else if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
1537 if (j) /* have installed packages */
1539 /* this is for dupmap_all jobs, it can go away if we create
1540 * duprules for them */
1541 if (i == 1 && (set & SOLVER_SETREPO) != 0)
1542 queue_push2(q, DISABLE_UPDATE, j);
1548 FOR_JOB_SELECT(p, pp, select, what)
1550 intersect_obsoletes(solv, p, q, qstart, &omap);
1551 if (q->count == qstart)
1557 if (qstart == q->count)
1558 return; /* nothing to prune */
1560 /* convert result to (DISABLE_UPDATE, p) pairs */
1562 for (j = qstart; j < i; j++)
1563 queue_push(q, q->elements[j]);
1564 for (j = qstart; j < q->count; j += 2)
1566 q->elements[j] = DISABLE_UPDATE;
1567 q->elements[j + 1] = q->elements[i++];
1570 /* now that we know which installed packages are obsoleted check each of them */
1571 if ((set & (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR)) == (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR))
1572 return; /* all is set, nothing to do */
1574 for (i = j = qstart; i < q->count; i += 2)
1576 Solvable *is = pool->solvables + q->elements[i + 1];
1577 FOR_JOB_SELECT(p, pp, select, what)
1580 s = pool->solvables + p;
1581 if ((set & SOLVER_SETEVR) != 0)
1582 illegal |= POLICY_ILLEGAL_DOWNGRADE; /* ignore */
1583 if ((set & SOLVER_SETARCH) != 0)
1584 illegal |= POLICY_ILLEGAL_ARCHCHANGE; /* ignore */
1585 if ((set & SOLVER_SETVENDOR) != 0)
1586 illegal |= POLICY_ILLEGAL_VENDORCHANGE; /* ignore */
1587 illegal = policy_is_illegal(solv, is, s, illegal);
1588 if (illegal && illegal == POLICY_ILLEGAL_DOWNGRADE && (set & SOLVER_SETEV) != 0)
1590 /* it's ok if the EV is different */
1591 if (pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE_EVONLY) != 0)
1599 /* no package conflicts with the update rule */
1600 /* thus keep the DISABLE_UPDATE */
1601 q->elements[j + 1] = q->elements[i + 1];
1605 queue_truncate(q, j);
1611 FOR_JOB_SELECT(p, pp, select, what)
1612 if (pool->solvables[p].repo == installed)
1613 queue_push2(q, DISABLE_UPDATE, p);
1620 /* disable all policy rules that are in conflict with our job list */
1622 solver_disablepolicyrules(Solver *solv)
1624 Queue *job = &solv->job;
1631 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1633 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1635 r = solv->rules + i;
1636 if (r->d < 0) /* disabled? */
1638 j = solv->ruletojob.elements[i - solv->jobrules];
1642 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1644 if (solv->cleandepsmap.size)
1646 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
1647 for (i = solv->installed->start; i < solv->installed->end; i++)
1648 if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1649 queue_push2(&allq, DISABLE_UPDATE, i);
1651 MAPZERO(&solv->noupdate);
1652 for (i = 0; i < allq.count; i += 2)
1654 Id type = allq.elements[i], arg = allq.elements[i + 1];
1657 case DISABLE_UPDATE:
1658 disableupdaterule(solv, arg);
1660 case DISABLE_INFARCH:
1661 disableinfarchrule(solv, arg);
1664 disableduprule(solv, arg);
1673 /* we just disabled job #jobidx, now reenable all policy rules that were
1674 * disabled because of this job */
1676 solver_reenablepolicyrules(Solver *solv, int jobidx)
1678 Queue *job = &solv->job;
1683 Id qbuf[32], allqbuf[128];
1685 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
1686 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1687 jobtodisablelist(solv, job->elements[jobidx - 1], job->elements[jobidx], &q);
1690 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1692 r = solv->rules + i;
1693 if (r->d < 0) /* disabled? */
1695 j = solv->ruletojob.elements[i - solv->jobrules];
1699 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1701 if (solv->cleandepsmap.size)
1703 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
1704 for (i = solv->installed->start; i < solv->installed->end; i++)
1705 if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1706 queue_push2(&allq, DISABLE_UPDATE, i);
1708 for (j = 0; j < q.count; j += 2)
1710 Id type = q.elements[j], arg = q.elements[j + 1];
1711 for (i = 0; i < allq.count; i += 2)
1712 if (allq.elements[i] == type && allq.elements[i + 1] == arg)
1715 continue; /* still disabled */
1718 case DISABLE_UPDATE:
1719 reenableupdaterule(solv, arg);
1721 case DISABLE_INFARCH:
1722 reenableinfarchrule(solv, arg);
1725 reenableduprule(solv, arg);
1733 /* we just removed a package from the cleandeps map, now reenable all policy rules that were
1734 * disabled because of this */
1736 solver_reenablepolicyrules_cleandeps(Solver *solv, Id pkg)
1738 Queue *job = &solv->job;
1745 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1746 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1748 r = solv->rules + i;
1749 if (r->d < 0) /* disabled? */
1751 j = solv->ruletojob.elements[i - solv->jobrules];
1755 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1757 for (i = 0; i < allq.count; i += 2)
1758 if (allq.elements[i] == DISABLE_UPDATE && allq.elements[i + 1] == pkg)
1760 if (i == allq.count)
1761 reenableupdaterule(solv, pkg);
1766 /***********************************************************************
1768 *** Rule info part, tell the user what the rule is about.
1773 addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep)
1775 Pool *pool = solv->pool;
1779 /* check if this creates the rule we're searching for */
1780 r = solv->rules + solv->ruleinfoq->elements[0];
1782 od = r->d < 0 ? -r->d - 1 : r->d;
1787 if (p < 0 && d > 0 && (!pool->whatprovidesdata[d] || !pool->whatprovidesdata[d + 1]))
1789 w2 = pool->whatprovidesdata[d];
1793 if (p > 0 && d < 0) /* this hack is used for buddy deps */
1805 Id *dp = pool->whatprovidesdata + d;
1806 Id *odp = pool->whatprovidesdata + od;
1808 if (*dp++ != *odp++)
1814 /* handle multiversion conflict rules */
1815 if (p < 0 && pool->whatprovidesdata[d] < 0)
1817 w2 = pool->whatprovidesdata[d];
1818 /* XXX: free memory */
1828 if (w2 != op || p != ow2)
1833 if (p != op || w2 != ow2)
1837 /* yep, rule matches. record info */
1838 queue_push(solv->ruleinfoq, type);
1839 if (type == SOLVER_RULE_RPM_SAME_NAME)
1841 /* we normalize same name order */
1842 queue_push(solv->ruleinfoq, op < 0 ? -op : 0);
1843 queue_push(solv->ruleinfoq, ow2 < 0 ? -ow2 : 0);
1847 queue_push(solv->ruleinfoq, p < 0 ? -p : 0);
1848 queue_push(solv->ruleinfoq, w2 < 0 ? -w2 : 0);
1850 queue_push(solv->ruleinfoq, dep);
1854 solver_allruleinfos_cmp(const void *ap, const void *bp, void *dp)
1856 const Id *a = ap, *b = bp;
1875 solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
1877 Pool *pool = solv->pool;
1878 Rule *r = solv->rules + rid;
1882 if (rid <= 0 || rid >= solv->rpmrules_end)
1884 Id type, from, to, dep;
1885 type = solver_ruleinfo(solv, rid, &from, &to, &dep);
1886 queue_push(rq, type);
1887 queue_push(rq, from);
1889 queue_push(rq, dep);
1894 queue_push(rq, rid);
1895 solv->ruleinfoq = rq;
1896 solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
1897 /* also try reverse direction for conflicts */
1898 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
1899 solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
1900 solv->ruleinfoq = 0;
1902 /* now sort & unify em */
1905 solv_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
1906 /* throw out identical entries */
1907 for (i = j = 0; i < rq->count; i += 4)
1911 if (rq->elements[i] == rq->elements[j - 4] &&
1912 rq->elements[i + 1] == rq->elements[j - 3] &&
1913 rq->elements[i + 2] == rq->elements[j - 2] &&
1914 rq->elements[i + 3] == rq->elements[j - 1])
1917 rq->elements[j++] = rq->elements[i];
1918 rq->elements[j++] = rq->elements[i + 1];
1919 rq->elements[j++] = rq->elements[i + 2];
1920 rq->elements[j++] = rq->elements[i + 3];
1927 solver_ruleinfo(Solver *solv, Id rid, Id *fromp, Id *top, Id *depp)
1929 Pool *pool = solv->pool;
1930 Rule *r = solv->rules + rid;
1931 SolverRuleinfo type = SOLVER_RULE_UNKNOWN;
1939 if (rid > 0 && rid < solv->rpmrules_end)
1945 return SOLVER_RULE_RPM;
1949 queue_push(&rq, rid);
1950 solv->ruleinfoq = &rq;
1951 solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
1952 /* also try reverse direction for conflicts */
1953 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
1954 solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
1955 solv->ruleinfoq = 0;
1956 type = SOLVER_RULE_RPM;
1957 for (i = 1; i < rq.count; i += 4)
1960 qt = rq.elements[i];
1961 qp = rq.elements[i + 1];
1962 qo = rq.elements[i + 2];
1963 qd = rq.elements[i + 3];
1964 if (type == SOLVER_RULE_RPM || type > qt)
1978 if (rid >= solv->jobrules && rid < solv->jobrules_end)
1980 Id jidx = solv->ruletojob.elements[rid - solv->jobrules];
1984 *top = solv->job.elements[jidx];
1986 *depp = solv->job.elements[jidx + 1];
1987 if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE && (solv->job.elements[jidx] & SOLVER_SELECTMASK) != SOLVER_SOLVABLE_ONE_OF)
1988 return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
1989 return SOLVER_RULE_JOB;
1991 if (rid >= solv->updaterules && rid < solv->updaterules_end)
1994 *fromp = solv->installed->start + (rid - solv->updaterules);
1995 return SOLVER_RULE_UPDATE;
1997 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2000 *fromp = solv->installed->start + (rid - solv->featurerules);
2001 return SOLVER_RULE_FEATURE;
2003 if (rid >= solv->duprules && rid < solv->duprules_end)
2008 *depp = pool->solvables[-r->p].name;
2009 return SOLVER_RULE_DISTUPGRADE;
2011 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2016 *depp = pool->solvables[-r->p].name;
2017 return SOLVER_RULE_INFARCH;
2019 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2021 return SOLVER_RULE_CHOICE;
2023 if (rid >= solv->learntrules)
2025 return SOLVER_RULE_LEARNT;
2027 return SOLVER_RULE_UNKNOWN;
2031 solver_ruleclass(Solver *solv, Id rid)
2034 return SOLVER_RULE_UNKNOWN;
2035 if (rid > 0 && rid < solv->rpmrules_end)
2036 return SOLVER_RULE_RPM;
2037 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2038 return SOLVER_RULE_JOB;
2039 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2040 return SOLVER_RULE_UPDATE;
2041 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2042 return SOLVER_RULE_FEATURE;
2043 if (rid >= solv->duprules && rid < solv->duprules_end)
2044 return SOLVER_RULE_DISTUPGRADE;
2045 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2046 return SOLVER_RULE_INFARCH;
2047 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2048 return SOLVER_RULE_CHOICE;
2049 if (rid >= solv->learntrules)
2050 return SOLVER_RULE_LEARNT;
2051 return SOLVER_RULE_UNKNOWN;
2055 solver_ruleliterals(Solver *solv, Id rid, Queue *q)
2057 Pool *pool = solv->pool;
2062 r = solv->rules + rid;
2063 FOR_RULELITERALS(p, pp, r)
2064 if (p != -SYSTEMSOLVABLE)
2067 queue_push(q, -SYSTEMSOLVABLE); /* hmm, better to return an empty result? */
2071 solver_rule2jobidx(Solver *solv, Id rid)
2073 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2075 return solv->ruletojob.elements[rid - solv->jobrules] + 1;
2079 solver_rule2job(Solver *solv, Id rid, Id *whatp)
2082 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2088 idx = solv->ruletojob.elements[rid - solv->jobrules];
2090 *whatp = solv->job.elements[idx + 1];
2091 return solv->job.elements[idx];
2095 solver_addchoicerules(Solver *solv)
2097 Pool *pool = solv->pool;
2101 int i, j, rid, havechoice;
2106 solv->choicerules = solv->nrules;
2107 if (!pool->installed)
2109 solv->choicerules_end = solv->nrules;
2112 solv->choicerules_ref = solv_calloc(solv->rpmrules_end, sizeof(Id));
2115 map_init(&m, pool->nsolvables);
2116 map_init(&mneg, pool->nsolvables);
2117 /* set up negative assertion map from infarch and dup rules */
2118 for (rid = solv->infarchrules, r = solv->rules + rid; rid < solv->infarchrules_end; rid++, r++)
2119 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2120 MAPSET(&mneg, -r->p);
2121 for (rid = solv->duprules, r = solv->rules + rid; rid < solv->duprules_end; rid++, r++)
2122 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2123 MAPSET(&mneg, -r->p);
2124 for (rid = 1; rid < solv->rpmrules_end ; rid++)
2126 r = solv->rules + rid;
2127 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 < 0))
2128 continue; /* only look at requires rules */
2129 /* solver_printrule(solv, SOLV_DEBUG_RESULT, r); */
2133 FOR_RULELITERALS(p, pp, r)
2137 s = pool->solvables + p;
2140 if (s->repo == pool->installed)
2145 /* check if this package is "blocked" by a installed package */
2147 FOR_PROVIDES(p2, pp2, s->name)
2149 s2 = pool->solvables + p2;
2150 if (s2->repo != pool->installed)
2152 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
2154 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2160 /* found installed package p2 that we can update to p */
2161 if (MAPTST(&mneg, p))
2163 if (policy_is_illegal(solv, s2, s, 0))
2165 queue_push(&qi, p2);
2171 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2173 while ((obs = *obsp++) != 0)
2175 FOR_PROVIDES(p2, pp2, obs)
2177 s2 = pool->solvables + p2;
2178 if (s2->repo != pool->installed)
2180 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
2182 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2191 /* found installed package p2 that we can update to p */
2192 if (MAPTST(&mneg, p))
2194 if (policy_is_illegal(solv, s2, s, 0))
2196 queue_push(&qi, p2);
2201 /* package p is independent of the installed ones */
2204 if (!havechoice || !q.count)
2205 continue; /* no choice */
2207 /* now check the update rules of the installed package.
2208 * if all packages of the update rules are contained in
2209 * the dependency rules, there's no need to set up the choice rule */
2211 FOR_RULELITERALS(p, pp, r)
2214 for (i = 0; i < qi.count; i++)
2217 if (!qi.elements[i])
2219 ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
2221 ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
2224 FOR_RULELITERALS(p, pp, ur)
2229 for (j = i + 1; j < qi.count; j++)
2230 if (qi.elements[i] == qi.elements[j])
2236 printf("skipping choice ");
2237 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
2241 d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
2242 solver_addrule(solv, r->p, d);
2243 queue_push(&solv->weakruleq, solv->nrules - 1);
2244 solv->choicerules_ref[solv->nrules - 1 - solv->choicerules] = rid;
2247 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
2248 printf("WEAK CHOICE ");
2249 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + solv->nrules - 1);
2256 solv->choicerules_end = solv->nrules;
2259 /* called when a choice rule is disabled by analyze_unsolvable. We also
2260 * have to disable all other choice rules so that the best packages get
2263 solver_disablechoicerules(Solver *solv, Rule *r)
2266 Pool *pool = solv->pool;
2270 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2271 map_init(&m, pool->nsolvables);
2272 FOR_RULELITERALS(p, pp, or)
2275 FOR_RULELITERALS(p, pp, r)
2278 for (rid = solv->choicerules; rid < solv->choicerules_end; rid++)
2280 r = solv->rules + rid;
2283 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2284 FOR_RULELITERALS(p, pp, or)
2285 if (p > 0 && MAPTST(&m, p))
2288 solver_disablerule(solv, r);
2292 #undef CLEANDEPSDEBUG
2295 * This functions collects all packages that are looked at
2296 * when a dependency is checked. We need it to "pin" installed
2297 * packages when removing a supplemented package in createcleandepsmap.
2298 * Here's an not uncommon example:
2299 * A contains "Supplements: packageand(B, C)"
2300 * B contains "Requires: A"
2301 * Now if we remove C, the supplements is no longer true,
2302 * thus we also remove A. Without the dep_pkgcheck function, we
2303 * would now also remove B, but this is wrong, as adding back
2304 * C doesn't make the supplements true again. Thus we "pin" B
2306 * There's probably a better way to do this, but I haven't come
2310 dep_pkgcheck(Solver *solv, Id dep, Map *m, Queue *q)
2312 Pool *pool = solv->pool;
2317 Reldep *rd = GETRELDEP(pool, dep);
2320 if (rd->flags == REL_AND)
2322 dep_pkgcheck(solv, rd->name, m, q);
2323 dep_pkgcheck(solv, rd->evr, m, q);
2326 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
2328 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
2332 FOR_PROVIDES(p, pp, dep)
2333 if (!m || MAPTST(m, p))
2338 * Find all installed packages that are no longer
2339 * needed regarding the current solver job.
2342 * - remove pass: remove all packages that could have
2343 * been dragged in by the obsoleted packages.
2344 * i.e. if package A is obsolete and contains "Requires: B",
2345 * also remove B, as installing A will have pulled in B.
2346 * after this pass, we have a set of still installed packages
2347 * with broken dependencies.
2349 * now add back all packages that the still installed packages
2352 * The cleandeps packages are the packages removed in the first
2353 * pass and not added back in the second pass.
2355 * If we search for unneeded packages (unneeded is true), we
2356 * simply remove all packages except the userinstalled ones in
2360 solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded)
2362 Pool *pool = solv->pool;
2363 Repo *installed = solv->installed;
2364 Queue *job = &solv->job;
2369 Id rid, how, what, select;
2371 Id req, *reqp, sup, *supp;
2376 map_empty(cleandepsmap);
2377 if (!installed || installed->end == installed->start)
2379 map_init(&userinstalled, installed->end - installed->start);
2380 map_init(&im, pool->nsolvables);
2381 map_init(&installedm, pool->nsolvables);
2384 for (i = 0; i < job->count; i += 2)
2386 how = job->elements[i];
2387 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
2389 what = job->elements[i + 1];
2390 select = how & SOLVER_SELECTMASK;
2391 FOR_JOB_SELECT(p, pp, select, what)
2392 if (pool->solvables[p].repo == installed)
2393 MAPSET(&userinstalled, p - installed->start);
2397 /* also add visible patterns to userinstalled for openSUSE */
2401 dataiterator_init(&di, pool, 0, 0, SOLVABLE_ISVISIBLE, 0, 0);
2402 while (dataiterator_step(&di))
2407 s = pool->solvables + di.solvid;
2410 if (!pool_installable(pool, s))
2412 if (strncmp(pool_id2str(pool, s->name), "pattern:", 8) != 0)
2414 dp = s->repo->idarraydata + s->requires;
2415 for (dp = s->repo->idarraydata + s->requires; *dp; dp++)
2416 FOR_PROVIDES(p, pp, *dp)
2417 if (pool->solvables[p].repo == installed)
2419 if (strncmp(pool_id2str(pool, pool->solvables[p].name), "pattern", 7) != 0)
2421 MAPSET(&userinstalled, p - installed->start);
2424 dataiterator_free(&di);
2428 /* all products and their buddies are userinstalled */
2429 for (p = installed->start; p < installed->end; p++)
2431 Solvable *s = pool->solvables + p;
2432 if (s->repo != installed)
2434 if (!strncmp("product:", pool_id2str(pool, s->name), 8))
2436 MAPSET(&userinstalled, p - installed->start);
2437 if (pool->nscallback)
2439 Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, p);
2440 if (buddy >= installed->start && buddy < installed->end && pool->solvables[buddy].repo == installed)
2441 MAPSET(&userinstalled, buddy);
2447 /* add all positive elements (e.g. locks) to "userinstalled" */
2448 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2450 r = solv->rules + rid;
2453 i = solv->ruletojob.elements[rid - solv->jobrules];
2454 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
2456 FOR_RULELITERALS(p, jp, r)
2457 if (p > 0 && pool->solvables[p].repo == installed)
2458 MAPSET(&userinstalled, p - installed->start);
2461 /* add all cleandeps candidates to iq */
2462 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2464 r = solv->rules + rid;
2467 if (r->d == 0 && r->p < 0 && r->w2 == 0)
2470 if (pool->solvables[p].repo != installed)
2472 MAPCLR(&userinstalled, p - installed->start);
2475 i = solv->ruletojob.elements[rid - solv->jobrules];
2476 how = job->elements[i];
2477 if ((how & (SOLVER_JOBMASK|SOLVER_CLEANDEPS)) == (SOLVER_ERASE|SOLVER_CLEANDEPS))
2484 i = solv->ruletojob.elements[rid - solv->jobrules];
2485 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
2487 /* check if the literals all obsolete some installed package */
2491 /* just one installed literal */
2492 if (r->d == 0 && r->w2 == 0 && pool->solvables[r->p].repo == installed)
2495 if (solv->noobsoletes.size)
2497 FOR_RULELITERALS(p, jp, r)
2498 if (MAPTST(&solv->noobsoletes, p))
2506 FOR_RULELITERALS(p, jp, r)
2510 queue_truncate(&iq, iqstart); /* abort */
2513 if (pool->solvables[p].repo == installed)
2515 if (iq.count == iqstart)
2519 for (i = iqstart; i < iq.count; i++)
2520 if (iq.elements[i] == p)
2522 queue_truncate(&iq, iqstart);
2528 intersect_obsoletes(solv, p, &iq, iqstart, &om);
2529 if (iq.count == iqstart)
2540 if (solv->cleandeps_updatepkgs)
2541 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
2542 queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]);
2546 queue_empty(&iq); /* just in case... */
2548 /* clear userinstalled bit for the packages we really want to delete/update */
2549 for (i = 0; i < iq.count; i++)
2552 if (pool->solvables[p].repo != installed)
2554 MAPCLR(&userinstalled, p - installed->start);
2557 for (p = installed->start; p < installed->end; p++)
2559 if (pool->solvables[p].repo != installed)
2561 MAPSET(&installedm, p);
2562 if (unneeded && !MAPTST(&userinstalled, p - installed->start))
2567 #ifdef CLEANDEPSDEBUG
2568 printf("REMOVE PASS\n");
2577 /* supplements pass */
2578 for (ip = solv->installed->start; ip < solv->installed->end; ip++)
2580 if (!MAPTST(&installedm, ip))
2582 s = pool->solvables + ip;
2583 if (!s->supplements)
2585 if (!MAPTST(&im, ip))
2587 if (MAPTST(&userinstalled, ip - installed->start))
2589 supp = s->repo->idarraydata + s->supplements;
2590 while ((sup = *supp++) != 0)
2591 if (dep_possible(solv, sup, &im))
2595 supp = s->repo->idarraydata + s->supplements;
2596 while ((sup = *supp++) != 0)
2597 if (dep_possible(solv, sup, &installedm))
2599 /* no longer supplemented, also erase */
2600 int iqcount = iq.count;
2601 /* pin packages, see comment above dep_pkgcheck */
2602 dep_pkgcheck(solv, sup, &im, &iq);
2603 for (i = iqcount; i < iq.count; i++)
2605 Id pqp = iq.elements[i];
2606 if (pool->solvables[pqp].repo == installed)
2607 MAPSET(&userinstalled, pqp - installed->start);
2609 queue_truncate(&iq, iqcount);
2610 #ifdef CLEANDEPSDEBUG
2611 printf("%s supplemented\n", pool_solvid2str(pool, ip));
2613 queue_push(&iq, ip);
2620 ip = queue_shift(&iq);
2621 s = pool->solvables + ip;
2622 if (!MAPTST(&im, ip))
2624 if (!MAPTST(&installedm, ip))
2626 if (s->repo == installed && MAPTST(&userinstalled, ip - installed->start))
2629 #ifdef CLEANDEPSDEBUG
2630 printf("removing %s\n", pool_solvable2str(pool, s));
2634 reqp = s->repo->idarraydata + s->requires;
2635 while ((req = *reqp++) != 0)
2637 if (req == SOLVABLE_PREREQMARKER)
2640 /* count number of installed packages that match */
2642 FOR_PROVIDES(p, pp, req)
2643 if (MAPTST(&installedm, p))
2648 FOR_PROVIDES(p, pp, req)
2652 #ifdef CLEANDEPSDEBUG
2653 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2662 reqp = s->repo->idarraydata + s->recommends;
2663 while ((req = *reqp++) != 0)
2667 FOR_PROVIDES(p, pp, req)
2668 if (MAPTST(&installedm, p))
2673 FOR_PROVIDES(p, pp, req)
2677 #ifdef CLEANDEPSDEBUG
2678 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2687 /* turn userinstalled into remove set for pruning */
2688 map_empty(&userinstalled);
2689 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2691 r = solv->rules + rid;
2692 if (r->p >= 0 || r->d != 0 || r->w2 != 0)
2693 continue; /* disabled or not erase */
2696 if (pool->solvables[p].repo == installed)
2697 MAPSET(&userinstalled, p - installed->start);
2699 for (p = installed->start; p < installed->end; p++)
2702 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2704 r = solv->rules + rid;
2707 FOR_RULELITERALS(p, jp, r)
2711 /* also put directly addressed packages on the install queue
2712 * so we can mark patterns as installed */
2713 for (i = 0; i < job->count; i += 2)
2715 how = job->elements[i];
2716 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
2718 what = job->elements[i + 1];
2719 select = how & SOLVER_SELECTMASK;
2720 if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
2721 queue_push(&iq, what);
2725 #ifdef CLEANDEPSDEBUG
2726 printf("ADDBACK PASS\n");
2732 /* supplements pass */
2733 for (ip = installed->start; ip < installed->end; ip++)
2735 if (!MAPTST(&installedm, ip))
2737 if (MAPTST(&userinstalled, ip - installed->start))
2739 s = pool->solvables + ip;
2740 if (!s->supplements)
2742 if (MAPTST(&im, ip))
2744 supp = s->repo->idarraydata + s->supplements;
2745 while ((sup = *supp++) != 0)
2746 if (dep_possible(solv, sup, &im))
2750 #ifdef CLEANDEPSDEBUG
2751 printf("%s supplemented\n", pool_solvid2str(pool, ip));
2754 queue_push(&iq, ip);
2760 ip = queue_shift(&iq);
2761 s = pool->solvables + ip;
2762 #ifdef CLEANDEPSDEBUG
2763 printf("adding back %s\n", pool_solvable2str(pool, s));
2767 reqp = s->repo->idarraydata + s->requires;
2768 while ((req = *reqp++) != 0)
2770 FOR_PROVIDES(p, pp, req)
2772 if (!MAPTST(&im, p) && MAPTST(&installedm, p))
2776 if (MAPTST(&userinstalled, p - installed->start))
2778 #ifdef CLEANDEPSDEBUG
2779 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2789 reqp = s->repo->idarraydata + s->recommends;
2790 while ((req = *reqp++) != 0)
2792 FOR_PROVIDES(p, pp, req)
2794 if (!MAPTST(&im, p) && MAPTST(&installedm, p))
2798 if (MAPTST(&userinstalled, p - installed->start))
2800 #ifdef CLEANDEPSDEBUG
2801 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2812 if (solv->cleandeps_updatepkgs)
2813 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
2814 MAPSET(&im, solv->cleandeps_updatepkgs->elements[i]);
2815 if (solv->cleandeps_mistakes)
2816 for (i = 0; i < solv->cleandeps_mistakes->count; i++)
2817 MAPSET(&im, solv->cleandeps_mistakes->elements[i]);
2818 for (p = installed->start; p < installed->end; p++)
2820 if (pool->solvables[p].repo != installed)
2822 if (!MAPTST(&im, p))
2823 MAPSET(cleandepsmap, p - installed->start);
2826 map_free(&installedm);
2827 map_free(&userinstalled);
2839 /* Tarjan's SCC algorithm, slightly modifed */
2841 trj_visit(struct trj_data *trj, Id node)
2844 Queue *edges = trj->edges;
2845 Id nnode, myidx, stackstart;
2848 low[node] = myidx = trj->idx++;
2849 low[(stackstart = trj->nstack++)] = node;
2850 for (i = edges->elements[node]; (nnode = edges->elements[i]) != 0; i++)
2855 if (!edges->elements[edges->elements[nnode]])
2861 trj_visit(trj, nnode);
2866 if (l < trj->firstidx)
2869 for (k = l; low[low[k]] == l; k++)
2872 else if (l < low[node])
2875 if (low[node] == myidx)
2877 if (myidx != trj->firstidx)
2879 for (i = stackstart; i < trj->nstack; i++)
2880 low[low[i]] = myidx;
2881 trj->nstack = stackstart;
2887 solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered)
2889 Repo *installed = solv->installed;
2893 queue_empty(unneededq);
2894 if (!installed || installed->end == installed->start)
2897 map_init(&cleandepsmap, installed->end - installed->start);
2898 solver_createcleandepsmap(solv, &cleandepsmap, 1);
2899 for (i = installed->start; i < installed->end; i++)
2900 if (MAPTST(&cleandepsmap, i - installed->start))
2901 queue_push(unneededq, i);
2903 if (filtered && unneededq->count > 1)
2905 Pool *pool = solv->pool;
2909 int j, pass, count = unneededq->count;
2912 map_init(&installedm, pool->nsolvables);
2913 for (i = installed->start; i < installed->end; i++)
2914 if (pool->solvables[i].repo == installed)
2915 MAPSET(&installedm, i);
2917 nrequires = solv_calloc(count, sizeof(Id));
2920 queue_insertn(&edges, 0, count * 4 + 10);
2921 queue_empty(&edges);
2924 * Go through the solvables in the nodes queue and create edges for
2925 * all requires/recommends/supplements between the nodes.
2926 * The edges are stored in the edges queue, we add 1 to the node
2927 * index so that nodes in the edges queue are != 0 and we can
2928 * terminate the edge list with 0.
2929 * Thus for node element 5, the edges are stored starting at
2930 * edges.elements[6] and are 0-terminated.
2932 /* leave first element zero to make things easier */
2933 /* also add trailing zero */
2934 queue_insertn(&edges, 0, 1 + count + 1);
2936 /* first requires and recommends */
2937 for (i = 0; i < count; i++)
2939 Solvable *s = pool->solvables + unneededq->elements[i];
2940 edges.elements[i + 1] = edges.count;
2941 for (pass = 0; pass < 2; pass++)
2944 unsigned int off = pass == 0 ? s->requires : s->recommends;
2947 for (dp = s->repo->idarraydata + off; *dp; dp++)
2948 FOR_PROVIDES(p, pp, *dp)
2950 Solvable *sp = pool->solvables + p;
2951 if (s == sp || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
2953 for (j = 0; j < count; j++)
2954 if (p == unneededq->elements[j])
2958 if (num && edges.elements[edges.count - 1] == j + 1)
2960 queue_push(&edges, j + 1);
2966 queue_push(&edges, 0);
2969 printf("requires + recommends\n");
2970 for (i = 0; i < count; i++)
2973 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
2974 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
2975 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
2979 /* then add supplements */
2980 for (i = 0; i < count; i++)
2982 Solvable *s = pool->solvables + unneededq->elements[i];
2987 for (dp = s->repo->idarraydata + s->supplements; *dp; dp++)
2988 if (dep_possible(solv, *dp, &installedm))
2992 queue_init_buffer(&iq, iqbuf, sizeof(iqbuf)/sizeof(*iqbuf));
2993 dep_pkgcheck(solv, *dp, 0, &iq);
2994 for (k = 0; k < iq.count; k++)
2996 Id p = iq.elements[k];
2997 Solvable *sp = pool->solvables + p;
2998 if (p == unneededq->elements[i] || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
3000 for (j = 0; j < count; j++)
3001 if (p == unneededq->elements[j])
3003 /* now add edge from j + 1 to i + 1 */
3004 queue_insert(&edges, edges.elements[j + 1] + nrequires[j], i + 1);
3005 /* addapt following edge pointers */
3006 for (k = j + 2; k < count + 2; k++)
3007 edges.elements[k]++;
3015 printf("+ supplements\n");
3016 for (i = 0; i < count; i++)
3019 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
3020 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
3021 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
3024 map_free(&installedm);
3026 /* now run SCC algo two times, first with requires+recommends+supplements,
3027 * then again without the requires. We run it the second time to get rid
3028 * of packages that got dragged in via recommends/supplements */
3030 * low will contain the result of the SCC search.
3031 * it must be of at least size 2 * (count + 1) and
3032 * must be zero initialized.
3034 * 0 low low ... low stack stack ...stack 0
3037 low = solv_calloc(count + 1, 2 * sizeof(Id));
3038 for (pass = 0; pass < 2; pass++)
3040 struct trj_data trj;
3043 memset(low, 0, (count + 1) * (2 * sizeof(Id)));
3044 for (i = 0; i < count; i++)
3046 edges.elements[i + 1] += nrequires[i];
3047 if (!unneededq->elements[i])
3048 low[i + 1] = -1; /* ignore this node */
3053 trj.idx = count + 1; /* stack starts here */
3054 for (i = 1; i <= count; i++)
3058 if (edges.elements[edges.elements[i]])
3060 trj.firstidx = trj.nstack = trj.idx;
3065 Id myidx = trj.idx++;
3070 /* prune packages */
3071 for (i = 0; i < count; i++)
3072 if (low[i + 1] <= 0)
3073 unneededq->elements[i] = 0;
3076 solv_free(nrequires);
3079 /* finally remove all pruned entries from unneededq */
3080 for (i = j = 0; i < count; i++)
3081 if (unneededq->elements[i])
3082 unneededq->elements[j++] = unneededq->elements[i];
3083 queue_truncate(unneededq, j);
3085 map_free(&cleandepsmap);