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_rulecmp(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 solver_shrinkrules(Solver *solv, int nrules)
383 solv->nrules = nrules;
384 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
387 /******************************************************************************
389 *** rpm rule part: create rules representing the package dependencies
394 * special multiversion patch conflict handling:
395 * a patch conflict is also satisfied if some other
396 * version with the same name/arch that doesn't conflict
397 * gets installed. The generated rule is thus:
398 * -patch|-cpack|opack1|opack2|...
401 makemultiversionconflict(Solver *solv, Id n, Id con)
403 Pool *pool = solv->pool;
408 sn = pool->solvables + n;
409 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
411 FOR_PROVIDES(p, pp, sn->name)
413 s = pool->solvables + p;
414 if (s->name != sn->name || s->arch != sn->arch)
416 if (!MAPTST(&solv->multiversion, p))
418 if (pool_match_nevr(pool, pool->solvables + p, con))
420 /* here we have a multiversion solvable that doesn't conflict */
421 /* thus we're not in conflict if it is installed */
425 return -n; /* no other package found, generate normal conflict */
426 return pool_queuetowhatprovides(pool, &q);
430 addrpmrule(Solver *solv, Id p, Id d, int type, Id dep)
432 if (!solv->ruleinfoq)
433 solver_addrule(solv, p, d);
435 addrpmruleinfo(solv, p, d, type, dep);
438 /*-------------------------------------------------------------------
440 * add (install) rules for solvable
442 * s: Solvable for which to add rules
443 * m: m[s] = 1 for solvables which have rules, prevent rule duplication
445 * Algorithm: 'visit all nodes of a graph'. The graph nodes are
446 * solvables, the edges their dependencies.
447 * Starting from an installed solvable, this will create all rules
448 * representing the graph created by the solvables dependencies.
450 * for unfulfilled requirements, conflicts, obsoletes,....
451 * add a negative assertion for solvables that are not installable
453 * It will also create rules for all solvables referenced by 's'
454 * i.e. descend to all providers of requirements of 's'
459 solver_addrpmrulesforsolvable(Solver *solv, Solvable *s, Map *m)
461 Pool *pool = solv->pool;
462 Repo *installed = solv->installed;
464 /* 'work' queue. keeps Ids of solvables we still have to work on.
465 And buffer for it. */
470 /* if to add rules for broken deps ('rpm -V' functionality)
474 /* Id var and pointer for each dependency
475 * (not used in parallel)
482 Id p, pp; /* whatprovides loops */
483 Id *dp; /* ptr to 'whatprovides' */
484 Id n; /* Id for current solvable 's' */
486 queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
487 queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
489 /* loop until there's no more work left */
494 * s: Pointer to solvable
497 n = queue_shift(&workq); /* 'pop' next solvable to work on from queue */
500 if (MAPTST(m, n)) /* continue if already visited */
502 MAPSET(m, n); /* mark as visited */
505 s = pool->solvables + n; /* s = Solvable in question */
508 if (installed /* Installed system available */
509 && s->repo == installed /* solvable is installed */
510 && !solv->fixmap_all /* NOT repair errors in rpm dependency graph */
511 && !(solv->fixmap.size && MAPTST(&solv->fixmap, n - installed->start)))
513 dontfix = 1; /* dont care about broken rpm deps */
518 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC
519 ? pool_disabled_solvable(pool, s)
520 : !pool_installable(pool, s))
522 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables));
523 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOT_INSTALLABLE, 0);
527 /* yet another SUSE hack, sigh */
528 if (pool->nscallback && !strncmp("product:", pool_id2str(pool, s->name), 8))
530 Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, n);
531 if (buddy > 0 && buddy != SYSTEMSOLVABLE && buddy != n && buddy < pool->nsolvables)
533 addrpmrule(solv, n, -buddy, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + n));
534 addrpmrule(solv, buddy, -n, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + buddy));
535 if (m && !MAPTST(m, buddy))
536 queue_push(&workq, buddy);
540 /*-----------------------------------------
541 * check requires of s
546 reqp = s->repo->idarraydata + s->requires;
547 while ((req = *reqp++) != 0) /* go through all requires */
549 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
552 /* find list of solvables providing 'req' */
553 dp = pool_whatprovides_ptr(pool, req);
555 if (*dp == SYSTEMSOLVABLE) /* always installed */
560 /* the strategy here is to not insist on dependencies
561 * that are already broken. so if we find one provider
562 * that was already installed, we know that the
563 * dependency was not broken before so we enforce it */
565 /* check if any of the providers for 'req' is installed */
566 for (i = 0; (p = dp[i]) != 0; i++)
568 if (pool->solvables[p].repo == installed)
569 break; /* provider was installed */
571 /* didn't find an installed provider: previously broken dependency */
574 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s));
581 /* nothing provides req! */
582 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));
583 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP, req);
587 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
589 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION," %s requires %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
590 for (i = 0; dp[i]; i++)
591 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " provided by %s\n", pool_solvid2str(pool, dp[i]));
594 /* add 'requires' dependency */
595 /* rule: (-requestor|provider1|provider2|...|providerN) */
596 addrpmrule(solv, -n, dp - pool->whatprovidesdata, SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
598 /* descend the dependency tree
599 push all non-visited providers on the work queue */
605 queue_push(&workq, *dp);
609 } /* while, requirements of n */
611 } /* if, requirements */
613 /* that's all we check for src packages */
614 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
617 /*-----------------------------------------
618 * check conflicts of s
625 /* we treat conflicts in patches a bit differen:
627 * - multiversion handling
628 * XXX: we should really handle this different, looking
629 * at the name is a bad hack
631 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
633 conp = s->repo->idarraydata + s->conflicts;
634 /* foreach conflicts of 's' */
635 while ((con = *conp++) != 0)
637 /* foreach providers of a conflict of 's' */
638 FOR_PROVIDES(p, pp, con)
640 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
642 /* dontfix: dont care about conflicts with already installed packs */
643 if (dontfix && pool->solvables[p].repo == installed)
645 /* p == n: self conflict */
646 if (p == n && pool->forbidselfconflicts)
650 Reldep *rd = GETRELDEP(pool, con);
651 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
654 p = 0; /* make it a negative assertion, aka 'uninstallable' */
656 if (p && ispatch && solv->multiversion.size && MAPTST(&solv->multiversion, p) && ISRELDEP(con))
658 /* our patch conflicts with a multiversion package */
659 p = -makemultiversionconflict(solv, p, con);
661 /* rule: -n|-p: either solvable _or_ provider of conflict */
662 addrpmrule(solv, -n, -p, p ? SOLVER_RULE_RPM_PACKAGE_CONFLICT : SOLVER_RULE_RPM_SELF_CONFLICT, con);
667 /*-----------------------------------------
668 * check obsoletes and implicit obsoletes of a package
669 * if ignoreinstalledsobsoletes is not set, we're also checking
670 * obsoletes of installed packages (like newer rpm versions)
672 if ((!installed || s->repo != installed) || !pool->noinstalledobsoletes)
674 int multi = solv->multiversion.size && MAPTST(&solv->multiversion, n);
675 int isinstalled = (installed && s->repo == installed);
676 if (s->obsoletes && (!multi || solv->keepexplicitobsoletes))
678 obsp = s->repo->idarraydata + s->obsoletes;
679 /* foreach obsoletes */
680 while ((obs = *obsp++) != 0)
682 /* foreach provider of an obsoletes of 's' */
683 FOR_PROVIDES(p, pp, obs)
685 Solvable *ps = pool->solvables + p;
688 if (isinstalled && dontfix && ps->repo == installed)
689 continue; /* don't repair installed/installed problems */
690 if (!pool->obsoleteusesprovides /* obsoletes are matched names, not provides */
691 && !pool_match_nevr(pool, ps, obs))
693 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
696 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_PACKAGE_OBSOLETES, obs);
698 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES, obs);
702 /* check implicit obsoletes
703 * for installed packages we only need to check installed/installed problems (and
704 * only when dontfix is not set), as the others are picked up when looking at the
705 * uninstalled package.
707 if (!isinstalled || !dontfix)
709 FOR_PROVIDES(p, pp, s->name)
711 Solvable *ps = pool->solvables + p;
714 if (isinstalled && ps->repo != installed)
716 /* we still obsolete packages with same nevra, like rpm does */
717 /* (actually, rpm mixes those packages. yuck...) */
718 if (multi && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
720 if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
722 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
724 if (s->name == ps->name)
725 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_SAME_NAME, 0);
727 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_IMPLICIT_OBSOLETES, s->name);
732 /*-----------------------------------------
733 * add recommends to the work queue
735 if (s->recommends && m)
737 recp = s->repo->idarraydata + s->recommends;
738 while ((rec = *recp++) != 0)
740 FOR_PROVIDES(p, pp, rec)
742 queue_push(&workq, p);
745 if (s->suggests && m)
747 sugp = s->repo->idarraydata + s->suggests;
748 while ((sug = *sugp++) != 0)
750 FOR_PROVIDES(p, pp, sug)
752 queue_push(&workq, p);
760 /*-------------------------------------------------------------------
762 * Add rules for packages possibly selected in by weak dependencies
764 * m: already added solvables
768 solver_addrpmrulesforweak(Solver *solv, Map *m)
770 Pool *pool = solv->pool;
775 /* foreach solvable in pool */
776 for (i = n = 1; n < pool->nsolvables; i++, n++)
778 if (i == pool->nsolvables) /* wrap i */
780 if (MAPTST(m, i)) /* already added that one */
783 s = pool->solvables + i;
786 if (s->repo != pool->installed && !pool_installable(pool, s))
787 continue; /* only look at installable ones */
792 /* find possible supplements */
793 supp = s->repo->idarraydata + s->supplements;
794 while ((sup = *supp++) != 0)
795 if (dep_possible(solv, sup, m))
799 /* if nothing found, check for enhances */
800 if (!sup && s->enhances)
802 supp = s->repo->idarraydata + s->enhances;
803 while ((sup = *supp++) != 0)
804 if (dep_possible(solv, sup, m))
807 /* if nothing found, goto next solvables */
810 solver_addrpmrulesforsolvable(solv, s, m);
811 n = 0; /* check all solvables again because we added solvables to m */
816 /*-------------------------------------------------------------------
818 * add package rules for possible updates
821 * m: map of already visited solvables
822 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
826 solver_addrpmrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
828 Pool *pool = solv->pool;
830 /* queue and buffer for it */
834 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
835 /* find update candidates for 's' */
836 policy_findupdatepackages(solv, s, &qs, allow_all);
837 /* add rule for 's' if not already done */
838 if (!MAPTST(m, s - pool->solvables))
839 solver_addrpmrulesforsolvable(solv, s, m);
840 /* foreach update candidate, add rule if not already done */
841 for (i = 0; i < qs.count; i++)
842 if (!MAPTST(m, qs.elements[i]))
843 solver_addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
848 /***********************************************************************
850 *** Update/Feature rule part
852 *** Those rules make sure an installed package isn't silently deleted
857 finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
859 Pool *pool = solv->pool;
862 policy_findupdatepackages(solv, s, qs, allow_all ? allow_all : 2);
866 return 0; /* orphaned, don't create feature rule */
867 /* check if this is an orphaned package */
868 policy_findupdatepackages(solv, s, qs, 1);
870 return 0; /* orphaned, don't create update rule */
872 return -SYSTEMSOLVABLE; /* supported but not installable */
875 return s - pool->solvables;
876 /* check if it is ok to keep the installed package */
877 for (i = 0; i < qs->count; i++)
879 Solvable *ns = pool->solvables + qs->elements[i];
880 if (s->evr == ns->evr && solvable_identical(s, ns))
881 return s - pool->solvables;
883 /* nope, it must be some other package */
884 return -SYSTEMSOLVABLE;
887 /* add packages from the dup repositories to the update candidates
888 * this isn't needed for the global dup mode as all packages are
889 * from dup repos in that case */
891 addduppackages(Solver *solv, Solvable *s, Queue *qs)
896 int oldnoupdateprovide = solv->noupdateprovide;
898 queue_init_buffer(&dupqs, dupqsbuf, sizeof(dupqsbuf)/sizeof(*dupqsbuf));
899 solv->noupdateprovide = 1;
900 policy_findupdatepackages(solv, s, &dupqs, 2);
901 solv->noupdateprovide = oldnoupdateprovide;
902 for (i = 0; i < dupqs.count; i++)
904 p = dupqs.elements[i];
905 if (MAPTST(&solv->dupmap, p))
906 queue_pushunique(qs, p);
911 /*-------------------------------------------------------------------
913 * add rule for update
914 * (A|A1|A2|A3...) An = update candidates for A
916 * s = (installed) solvable
920 solver_addupdaterule(Solver *solv, Solvable *s, int allow_all)
922 /* installed packages get a special upgrade allowed rule */
923 Pool *pool = solv->pool;
928 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
929 p = s - pool->solvables;
930 /* find update candidates for 's' */
931 if (solv->dupmap_all)
932 p = finddistupgradepackages(solv, s, &qs, allow_all);
934 policy_findupdatepackages(solv, s, &qs, allow_all);
935 if (!allow_all && !solv->dupmap_all && solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
936 addduppackages(solv, s, &qs);
938 if (!allow_all && qs.count && solv->multiversion.size)
942 d = pool_queuetowhatprovides(pool, &qs);
943 /* filter out all multiversion packages as they don't update */
944 for (i = j = 0; i < qs.count; i++)
946 if (MAPTST(&solv->multiversion, qs.elements[i]))
948 Solvable *ps = pool->solvables + qs.elements[i];
949 /* if keepexplicitobsoletes is set and the name is different,
950 * we assume that there is an obsoletes. XXX: not 100% correct */
951 if (solv->keepexplicitobsoletes && ps->name != s->name)
953 qs.elements[j++] = qs.elements[i];
956 /* it's ok if they have same nevra */
957 if (ps->name != s->name || ps->evr != s->evr || ps->arch != s->arch)
960 qs.elements[j++] = qs.elements[i];
964 if (d && solv->installed && s->repo == solv->installed &&
965 (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, s - pool->solvables - solv->installed->start))))
967 if (!solv->multiversionupdaters)
968 solv->multiversionupdaters = solv_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
969 solv->multiversionupdaters[s - pool->solvables - solv->installed->start] = d;
971 if (j == 0 && p == -SYSTEMSOLVABLE && solv->dupmap_all)
973 queue_push(&solv->orphaned, s - pool->solvables); /* treat as orphaned */
978 else if (p != -SYSTEMSOLVABLE)
980 /* could fallthrough, but then we would do pool_queuetowhatprovides twice */
982 solver_addrule(solv, p, d); /* allow update of s */
986 if (qs.count && p == -SYSTEMSOLVABLE)
987 p = queue_shift(&qs);
988 d = qs.count ? pool_queuetowhatprovides(pool, &qs) : 0;
990 solver_addrule(solv, p, d); /* allow update of s */
994 disableupdaterule(Solver *solv, Id p)
998 MAPSET(&solv->noupdate, p - solv->installed->start);
999 r = solv->rules + solv->updaterules + (p - solv->installed->start);
1000 if (r->p && r->d >= 0)
1001 solver_disablerule(solv, r);
1002 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1003 if (r->p && r->d >= 0)
1004 solver_disablerule(solv, r);
1005 if (solv->bestrules_pkg)
1008 ni = solv->bestrules_end - solv->bestrules;
1009 for (i = 0; i < ni; i++)
1010 if (solv->bestrules_pkg[i] == p)
1011 solver_disablerule(solv, solv->rules + solv->bestrules + i);
1016 reenableupdaterule(Solver *solv, Id p)
1018 Pool *pool = solv->pool;
1021 MAPCLR(&solv->noupdate, p - solv->installed->start);
1022 r = solv->rules + solv->updaterules + (p - solv->installed->start);
1027 solver_enablerule(solv, r);
1028 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1030 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1031 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1037 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1038 if (r->p && r->d < 0)
1040 solver_enablerule(solv, r);
1041 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1043 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1044 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1048 if (solv->bestrules_pkg)
1051 ni = solv->bestrules_end - solv->bestrules;
1052 for (i = 0; i < ni; i++)
1053 if (solv->bestrules_pkg[i] == p)
1054 solver_enablerule(solv, solv->rules + solv->bestrules + i);
1059 /***********************************************************************
1061 *** Infarch rule part
1063 *** Infarch rules make sure the solver uses the best architecture of
1064 *** a package if multiple archetectures are available
1069 solver_addinfarchrules(Solver *solv, Map *addedmap)
1071 Pool *pool = solv->pool;
1073 Id p, pp, a, aa, bestarch;
1074 Solvable *s, *ps, *bests;
1075 Queue badq, allowedarchs;
1078 queue_init(&allowedarchs);
1079 solv->infarchrules = solv->nrules;
1080 for (i = 1; i < pool->nsolvables; i++)
1082 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1084 s = pool->solvables + i;
1088 queue_empty(&allowedarchs);
1089 FOR_PROVIDES(p, pp, s->name)
1091 ps = pool->solvables + p;
1092 if (ps->name != s->name || !MAPTST(addedmap, p))
1099 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1100 if (a != 1 && pool->installed && ps->repo == pool->installed)
1102 if (!solv->dupmap_all && !(solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1103 queue_pushunique(&allowedarchs, ps->arch); /* also ok to keep this architecture */
1104 continue; /* ignore installed solvables when calculating the best arch */
1106 if (a && a != 1 && (!bestarch || a < bestarch))
1114 /* speed up common case where installed package already has best arch */
1115 if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch)
1116 allowedarchs.count--; /* installed arch is best */
1118 FOR_PROVIDES(p, pp, s->name)
1120 ps = pool->solvables + p;
1121 if (ps->name != s->name || !MAPTST(addedmap, p))
1124 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1125 if (a != 1 && bestarch && ((a ^ bestarch) & 0xffff0000) != 0)
1127 if (pool->installed && ps->repo == pool->installed)
1128 continue; /* always ok to keep an installed package */
1129 for (j = 0; j < allowedarchs.count; j++)
1131 aa = allowedarchs.elements[j];
1134 aa = (aa <= pool->lastarch) ? pool->id2arch[aa] : 0;
1135 if (aa && ((a ^ aa) & 0xffff0000) == 0)
1136 break; /* compatible */
1138 if (j == allowedarchs.count)
1139 queue_push(&badq, p);
1144 /* block all solvables in the badq! */
1145 for (j = 0; j < badq.count; j++)
1147 p = badq.elements[j];
1148 solver_addrule(solv, -p, 0);
1152 queue_free(&allowedarchs);
1153 solv->infarchrules_end = solv->nrules;
1157 disableinfarchrule(Solver *solv, Id name)
1159 Pool *pool = solv->pool;
1162 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1164 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1165 solver_disablerule(solv, r);
1170 reenableinfarchrule(Solver *solv, Id name)
1172 Pool *pool = solv->pool;
1175 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1177 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1179 solver_enablerule(solv, r);
1180 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1182 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1183 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1190 /***********************************************************************
1194 *** Dup rules make sure a package is selected from the specified dup
1195 *** repositories if an update candidate is included in one of them.
1200 add_cleandeps_package(Solver *solv, Id p)
1202 if (!solv->cleandeps_updatepkgs)
1204 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
1205 queue_init(solv->cleandeps_updatepkgs);
1207 queue_pushunique(solv->cleandeps_updatepkgs, p);
1211 solver_addtodupmaps(Solver *solv, Id p, Id how, int targeted)
1213 Pool *pool = solv->pool;
1214 Solvable *ps, *s = pool->solvables + p;
1215 Repo *installed = solv->installed;
1216 Id pi, pip, obs, *obsp;
1218 MAPSET(&solv->dupinvolvedmap, p);
1220 MAPSET(&solv->dupmap, p);
1221 FOR_PROVIDES(pi, pip, s->name)
1223 ps = pool->solvables + pi;
1224 if (ps->name != s->name)
1226 MAPSET(&solv->dupinvolvedmap, pi);
1227 if (targeted && ps->repo == installed && solv->obsoletes && solv->obsoletes[pi - installed->start])
1230 for (opp = solv->obsoletes_data + solv->obsoletes[pi - installed->start]; (pi2 = *opp++) != 0;)
1231 if (pool->solvables[pi2].repo != installed)
1232 MAPSET(&solv->dupinvolvedmap, pi2);
1234 if (ps->repo == installed && (how & SOLVER_FORCEBEST) != 0)
1236 if (!solv->bestupdatemap.size)
1237 map_grow(&solv->bestupdatemap, installed->end - installed->start);
1238 MAPSET(&solv->bestupdatemap, pi - installed->start);
1240 if (ps->repo == installed && (how & SOLVER_CLEANDEPS) != 0)
1241 add_cleandeps_package(solv, pi);
1242 if (!targeted && ps->repo != installed)
1243 MAPSET(&solv->dupmap, pi);
1245 if (s->repo == installed && solv->obsoletes && solv->obsoletes[p - installed->start])
1248 for (opp = solv->obsoletes_data + solv->obsoletes[p - installed->start]; (pi = *opp++) != 0;)
1250 ps = pool->solvables + pi;
1251 if (ps->repo == installed)
1253 MAPSET(&solv->dupinvolvedmap, pi);
1255 MAPSET(&solv->dupmap, pi);
1258 if (targeted && s->repo != installed && s->obsoletes)
1260 /* XXX: check obsoletes/provides combination */
1261 obsp = s->repo->idarraydata + s->obsoletes;
1262 while ((obs = *obsp++) != 0)
1264 FOR_PROVIDES(pi, pip, obs)
1266 Solvable *ps = pool->solvables + pi;
1267 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1269 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1271 MAPSET(&solv->dupinvolvedmap, pi);
1272 if (targeted && ps->repo == installed && solv->obsoletes && solv->obsoletes[pi - installed->start])
1275 for (opp = solv->obsoletes_data + solv->obsoletes[pi - installed->start]; (pi2 = *opp++) != 0;)
1276 if (pool->solvables[pi2].repo != installed)
1277 MAPSET(&solv->dupinvolvedmap, pi2);
1279 if (ps->repo == installed && (how & SOLVER_FORCEBEST) != 0)
1281 if (!solv->bestupdatemap.size)
1282 map_grow(&solv->bestupdatemap, installed->end - installed->start);
1283 MAPSET(&solv->bestupdatemap, pi - installed->start);
1285 if (ps->repo == installed && (how & SOLVER_CLEANDEPS) != 0)
1286 add_cleandeps_package(solv, pi);
1293 solver_createdupmaps(Solver *solv)
1295 Queue *job = &solv->job;
1296 Pool *pool = solv->pool;
1297 Repo *installed = solv->installed;
1298 Id select, how, what, p, pp;
1302 map_init(&solv->dupmap, pool->nsolvables);
1303 map_init(&solv->dupinvolvedmap, pool->nsolvables);
1304 for (i = 0; i < job->count; i += 2)
1306 how = job->elements[i];
1307 select = job->elements[i] & SOLVER_SELECTMASK;
1308 what = job->elements[i + 1];
1309 switch (how & SOLVER_JOBMASK)
1311 case SOLVER_DISTUPGRADE:
1312 if (select == SOLVER_SOLVABLE_REPO)
1315 if (what <= 0 || what > pool->nrepos)
1317 repo = pool_id2repo(pool, what);
1320 if (repo != installed && !(how & SOLVER_TARGETED) && solv->noautotarget)
1322 targeted = repo != installed || (how & SOLVER_TARGETED) != 0;
1323 FOR_REPO_SOLVABLES(repo, p, s)
1325 if (repo != installed && !pool_installable(pool, s))
1327 solver_addtodupmaps(solv, p, how, targeted);
1332 targeted = how & SOLVER_TARGETED ? 1 : 0;
1333 if (installed && !targeted && !solv->noautotarget)
1335 FOR_JOB_SELECT(p, pp, select, what)
1336 if (pool->solvables[p].repo == installed)
1340 else if (!installed && !solv->noautotarget)
1342 FOR_JOB_SELECT(p, pp, select, what)
1344 Solvable *s = pool->solvables + p;
1347 if (s->repo != installed && !targeted)
1349 if (s->repo != installed && !pool_installable(pool, s))
1351 solver_addtodupmaps(solv, p, how, targeted);
1359 MAPCLR(&solv->dupinvolvedmap, SYSTEMSOLVABLE);
1363 solver_freedupmaps(Solver *solv)
1365 map_free(&solv->dupmap);
1366 /* we no longer free solv->dupinvolvedmap as we need it in
1367 * policy's priority pruning code. sigh. */
1371 solver_addduprules(Solver *solv, Map *addedmap)
1373 Pool *pool = solv->pool;
1378 solv->duprules = solv->nrules;
1379 for (i = 1; i < pool->nsolvables; i++)
1381 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1383 s = pool->solvables + i;
1385 FOR_PROVIDES(p, pp, s->name)
1387 ps = pool->solvables + p;
1388 if (ps->name != s->name || !MAPTST(addedmap, p))
1394 if (!MAPTST(&solv->dupinvolvedmap, p))
1396 if (solv->installed && ps->repo == solv->installed)
1398 if (!solv->updatemap.size)
1399 map_grow(&solv->updatemap, solv->installed->end - solv->installed->start);
1400 MAPSET(&solv->updatemap, p - solv->installed->start);
1401 if (!MAPTST(&solv->dupmap, p))
1404 /* is installed identical to a good one? */
1405 FOR_PROVIDES(ip, ipp, ps->name)
1407 Solvable *is = pool->solvables + ip;
1408 if (!MAPTST(&solv->dupmap, ip))
1410 if (is->evr == ps->evr && solvable_identical(ps, is))
1414 solver_addrule(solv, -p, 0); /* no match, sorry */
1416 MAPSET(&solv->dupmap, p); /* for best rules processing */
1419 else if (!MAPTST(&solv->dupmap, p))
1420 solver_addrule(solv, -p, 0);
1423 solv->duprules_end = solv->nrules;
1428 disableduprule(Solver *solv, Id name)
1430 Pool *pool = solv->pool;
1433 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1435 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1436 solver_disablerule(solv, r);
1441 reenableduprule(Solver *solv, Id name)
1443 Pool *pool = solv->pool;
1446 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1448 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1450 solver_enablerule(solv, r);
1451 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1453 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1454 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1461 /***********************************************************************
1463 *** Policy rule disabling/reenabling
1465 *** Disable all policy rules that conflict with our jobs. If a job
1466 *** gets disabled later on, reenable the involved policy rules again.
1470 #define DISABLE_UPDATE 1
1471 #define DISABLE_INFARCH 2
1472 #define DISABLE_DUP 3
1475 * add all installed packages that package p obsoletes to Queue q.
1476 * Package p is not installed. Also, we know that if
1477 * solv->keepexplicitobsoletes is not set, p is not in the multiversion map.
1478 * Entries may get added multiple times.
1481 add_obsoletes(Solver *solv, Id p, Queue *q)
1483 Pool *pool = solv->pool;
1484 Repo *installed = solv->installed;
1486 Solvable *s = pool->solvables + p;
1490 if (!solv->keepexplicitobsoletes || !(solv->multiversion.size && MAPTST(&solv->multiversion, p)))
1492 FOR_PROVIDES(p2, pp2, s->name)
1494 Solvable *ps = pool->solvables + p2;
1495 if (ps->repo != installed)
1497 if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
1499 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
1507 obsp = s->repo->idarraydata + s->obsoletes;
1508 while ((obs = *obsp++) != 0)
1509 FOR_PROVIDES(p2, pp2, obs)
1511 Solvable *ps = pool->solvables + p2;
1512 if (ps->repo != installed)
1514 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1516 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1526 * Call add_obsoletes and intersect the result with the
1527 * elements in Queue q starting at qstart.
1528 * Assumes that it's the first call if qstart == q->count.
1529 * May use auxillary map m for the intersection process, all
1530 * elements of q starting at qstart must have their bit cleared.
1531 * (This is also true after the function returns.)
1534 intersect_obsoletes(Solver *solv, Id p, Queue *q, int qstart, Map *m)
1537 int qcount = q->count;
1539 add_obsoletes(solv, p, q);
1540 if (qcount == qstart)
1541 return; /* first call */
1542 if (qcount == q->count)
1544 else if (qcount == qstart + 1)
1546 /* easy if there's just one element */
1548 for (i = qcount; i < q->count; i++)
1549 if (q->elements[i] == q->elements[qstart])
1551 j++; /* keep the element */
1555 else if (!m->size && q->count - qstart <= 8)
1557 /* faster than a map most of the time */
1559 for (i = j = qstart; i < qcount; i++)
1561 Id ip = q->elements[i];
1562 for (k = qcount; k < q->count; k++)
1563 if (q->elements[k] == ip)
1565 q->elements[j++] = ip;
1572 /* for the really pathologic cases we use the map */
1573 Repo *installed = solv->installed;
1575 map_init(m, installed->end - installed->start);
1576 for (i = qcount; i < q->count; i++)
1577 MAPSET(m, q->elements[i] - installed->start);
1578 for (i = j = qstart; i < qcount; i++)
1579 if (MAPTST(m, q->elements[i] - installed->start))
1581 MAPCLR(m, q->elements[i] - installed->start);
1582 q->elements[j++] = q->elements[i];
1585 queue_truncate(q, j);
1589 jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
1591 Pool *pool = solv->pool;
1595 int i, j, set, qstart;
1598 installed = solv->installed;
1599 select = how & SOLVER_SELECTMASK;
1600 switch (how & SOLVER_JOBMASK)
1602 case SOLVER_INSTALL:
1603 set = how & SOLVER_SETMASK;
1604 if (!(set & SOLVER_NOAUTOSET))
1606 /* automatically add set bits by analysing the job */
1607 if (select == SOLVER_SOLVABLE_NAME)
1608 set |= SOLVER_SETNAME;
1609 if (select == SOLVER_SOLVABLE)
1610 set |= SOLVER_SETNAME | SOLVER_SETARCH | SOLVER_SETVENDOR | SOLVER_SETREPO | SOLVER_SETEVR;
1611 else if ((select == SOLVER_SOLVABLE_NAME || select == SOLVER_SOLVABLE_PROVIDES) && ISRELDEP(what))
1613 Reldep *rd = GETRELDEP(pool, what);
1614 if (rd->flags == REL_EQ && select == SOLVER_SOLVABLE_NAME)
1616 if (pool->disttype != DISTTYPE_DEB)
1618 const char *rel = strrchr(pool_id2str(pool, rd->evr), '-');
1619 set |= rel ? SOLVER_SETEVR : SOLVER_SETEV;
1622 set |= SOLVER_SETEVR;
1624 if (rd->flags <= 7 && ISRELDEP(rd->name))
1625 rd = GETRELDEP(pool, rd->name);
1626 if (rd->flags == REL_ARCH)
1627 set |= SOLVER_SETARCH;
1631 set &= ~SOLVER_NOAUTOSET;
1634 if ((set & SOLVER_SETARCH) != 0 && solv->infarchrules != solv->infarchrules_end)
1636 if (select == SOLVER_SOLVABLE)
1637 queue_push2(q, DISABLE_INFARCH, pool->solvables[what].name);
1640 int qcnt = q->count;
1641 /* does not work for SOLVER_SOLVABLE_ALL and SOLVER_SOLVABLE_REPO, but
1642 they are not useful for SOLVER_INSTALL jobs anyway */
1643 FOR_JOB_SELECT(p, pp, select, what)
1645 s = pool->solvables + p;
1647 for (i = qcnt; i < q->count; i += 2)
1648 if (q->elements[i + 1] == s->name)
1652 queue_push2(q, DISABLE_INFARCH, s->name);
1656 if ((set & SOLVER_SETREPO) != 0 && solv->duprules != solv->duprules_end)
1658 if (select == SOLVER_SOLVABLE)
1659 queue_push2(q, DISABLE_DUP, pool->solvables[what].name);
1662 int qcnt = q->count;
1663 FOR_JOB_SELECT(p, pp, select, what)
1665 s = pool->solvables + p;
1667 for (i = qcnt; i < q->count; i += 2)
1668 if (q->elements[i + 1] == s->name)
1672 queue_push2(q, DISABLE_DUP, s->name);
1676 if (!installed || installed->end == installed->start)
1678 /* now the hard part: disable some update rules */
1680 /* first check if we have multiversion or installed packages in the job */
1682 FOR_JOB_SELECT(p, pp, select, what)
1684 if (pool->solvables[p].repo == installed)
1686 else if (solv->multiversion.size && MAPTST(&solv->multiversion, p) && !solv->keepexplicitobsoletes)
1690 if (j) /* have installed packages */
1692 /* this is for dupmap_all jobs, it can go away if we create
1693 * duprules for them */
1694 if (i == 1 && (set & SOLVER_SETREPO) != 0)
1695 queue_push2(q, DISABLE_UPDATE, j);
1701 FOR_JOB_SELECT(p, pp, select, what)
1703 intersect_obsoletes(solv, p, q, qstart, &omap);
1704 if (q->count == qstart)
1710 if (qstart == q->count)
1711 return; /* nothing to prune */
1713 /* convert result to (DISABLE_UPDATE, p) pairs */
1715 for (j = qstart; j < i; j++)
1716 queue_push(q, q->elements[j]);
1717 for (j = qstart; j < q->count; j += 2)
1719 q->elements[j] = DISABLE_UPDATE;
1720 q->elements[j + 1] = q->elements[i++];
1723 /* now that we know which installed packages are obsoleted check each of them */
1724 if ((set & (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR)) == (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR))
1725 return; /* all is set, nothing to do */
1727 for (i = j = qstart; i < q->count; i += 2)
1729 Solvable *is = pool->solvables + q->elements[i + 1];
1730 FOR_JOB_SELECT(p, pp, select, what)
1733 s = pool->solvables + p;
1734 if ((set & SOLVER_SETEVR) != 0)
1735 illegal |= POLICY_ILLEGAL_DOWNGRADE; /* ignore */
1736 if ((set & SOLVER_SETNAME) != 0)
1737 illegal |= POLICY_ILLEGAL_NAMECHANGE; /* ignore */
1738 if ((set & SOLVER_SETARCH) != 0)
1739 illegal |= POLICY_ILLEGAL_ARCHCHANGE; /* ignore */
1740 if ((set & SOLVER_SETVENDOR) != 0)
1741 illegal |= POLICY_ILLEGAL_VENDORCHANGE; /* ignore */
1742 illegal = policy_is_illegal(solv, is, s, illegal);
1743 if (illegal && illegal == POLICY_ILLEGAL_DOWNGRADE && (set & SOLVER_SETEV) != 0)
1745 /* it's ok if the EV is different */
1746 if (pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE_EVONLY) != 0)
1754 /* no package conflicts with the update rule */
1755 /* thus keep the DISABLE_UPDATE */
1756 q->elements[j + 1] = q->elements[i + 1];
1760 queue_truncate(q, j);
1766 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
1767 FOR_REPO_SOLVABLES(installed, p, s)
1768 queue_push2(q, DISABLE_UPDATE, p);
1769 FOR_JOB_SELECT(p, pp, select, what)
1770 if (pool->solvables[p].repo == installed)
1771 queue_push2(q, DISABLE_UPDATE, p);
1778 /* disable all policy rules that are in conflict with our job list */
1780 solver_disablepolicyrules(Solver *solv)
1782 Queue *job = &solv->job;
1789 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1791 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1793 r = solv->rules + i;
1794 if (r->d < 0) /* disabled? */
1796 j = solv->ruletojob.elements[i - solv->jobrules];
1800 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1802 if (solv->cleandepsmap.size)
1804 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
1805 for (i = solv->installed->start; i < solv->installed->end; i++)
1806 if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1807 queue_push2(&allq, DISABLE_UPDATE, i);
1809 MAPZERO(&solv->noupdate);
1810 for (i = 0; i < allq.count; i += 2)
1812 Id type = allq.elements[i], arg = allq.elements[i + 1];
1815 case DISABLE_UPDATE:
1816 disableupdaterule(solv, arg);
1818 case DISABLE_INFARCH:
1819 disableinfarchrule(solv, arg);
1822 disableduprule(solv, arg);
1831 /* we just disabled job #jobidx, now reenable all policy rules that were
1832 * disabled because of this job */
1834 solver_reenablepolicyrules(Solver *solv, int jobidx)
1836 Queue *job = &solv->job;
1841 Id qbuf[32], allqbuf[32];
1843 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
1844 jobtodisablelist(solv, job->elements[jobidx - 1], job->elements[jobidx], &q);
1850 /* now remove everything from q that is disabled by other jobs */
1852 /* first remove cleandeps packages, they count as DISABLE_UPDATE */
1853 if (solv->cleandepsmap.size)
1855 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
1856 for (j = k = 0; j < q.count; j += 2)
1858 if (q.elements[j] == DISABLE_UPDATE)
1860 Id p = q.elements[j + 1];
1861 if (p >= solv->installed->start && p < solv->installed->end && MAPTST(&solv->cleandepsmap, p - solv->installed->start))
1862 continue; /* remove element from q */
1864 q.elements[k++] = q.elements[j];
1865 q.elements[k++] = q.elements[j + 1];
1875 /* now go through the disable list of all other jobs */
1876 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1877 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1879 r = solv->rules + i;
1880 if (r->d < 0) /* disabled? */
1882 j = solv->ruletojob.elements[i - solv->jobrules];
1886 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1889 /* remove all elements in allq from q */
1890 for (j = k = 0; j < q.count; j += 2)
1892 Id type = q.elements[j], arg = q.elements[j + 1];
1893 for (ai = 0; ai < allq.count; ai += 2)
1894 if (allq.elements[ai] == type && allq.elements[ai + 1] == arg)
1896 if (ai < allq.count)
1897 continue; /* found it in allq, remove element from q */
1898 q.elements[k++] = q.elements[j];
1899 q.elements[k++] = q.elements[j + 1];
1912 /* now re-enable anything that's left in q */
1913 for (j = 0; j < q.count; j += 2)
1915 Id type = q.elements[j], arg = q.elements[j + 1];
1918 case DISABLE_UPDATE:
1919 reenableupdaterule(solv, arg);
1921 case DISABLE_INFARCH:
1922 reenableinfarchrule(solv, arg);
1925 reenableduprule(solv, arg);
1932 /* we just removed a package from the cleandeps map, now reenable all policy rules that were
1933 * disabled because of this */
1935 solver_reenablepolicyrules_cleandeps(Solver *solv, Id pkg)
1937 Queue *job = &solv->job;
1944 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1945 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1947 r = solv->rules + i;
1948 if (r->d < 0) /* disabled? */
1950 j = solv->ruletojob.elements[i - solv->jobrules];
1954 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1956 for (i = 0; i < allq.count; i += 2)
1957 if (allq.elements[i] == DISABLE_UPDATE && allq.elements[i + 1] == pkg)
1959 if (i == allq.count)
1960 reenableupdaterule(solv, pkg);
1965 /***********************************************************************
1967 *** Rule info part, tell the user what the rule is about.
1972 addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep)
1974 Pool *pool = solv->pool;
1978 /* check if this creates the rule we're searching for */
1979 r = solv->rules + solv->ruleinfoq->elements[0];
1981 od = r->d < 0 ? -r->d - 1 : r->d;
1986 if (p < 0 && d > 0 && (!pool->whatprovidesdata[d] || !pool->whatprovidesdata[d + 1]))
1988 w2 = pool->whatprovidesdata[d];
1992 if (p > 0 && d < 0) /* this hack is used for buddy deps */
2004 Id *dp = pool->whatprovidesdata + d;
2005 Id *odp = pool->whatprovidesdata + od;
2007 if (*dp++ != *odp++)
2013 /* handle multiversion conflict rules */
2014 if (p < 0 && pool->whatprovidesdata[d] < 0)
2016 w2 = pool->whatprovidesdata[d];
2017 /* XXX: free memory */
2027 if (w2 != op || p != ow2)
2032 if (p != op || w2 != ow2)
2036 /* yep, rule matches. record info */
2037 queue_push(solv->ruleinfoq, type);
2038 if (type == SOLVER_RULE_RPM_SAME_NAME)
2040 /* we normalize same name order */
2041 queue_push(solv->ruleinfoq, op < 0 ? -op : 0);
2042 queue_push(solv->ruleinfoq, ow2 < 0 ? -ow2 : 0);
2046 queue_push(solv->ruleinfoq, p < 0 ? -p : 0);
2047 queue_push(solv->ruleinfoq, w2 < 0 ? -w2 : 0);
2049 queue_push(solv->ruleinfoq, dep);
2053 solver_allruleinfos_cmp(const void *ap, const void *bp, void *dp)
2055 const Id *a = ap, *b = bp;
2074 solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
2076 Pool *pool = solv->pool;
2077 Rule *r = solv->rules + rid;
2081 if (rid <= 0 || rid >= solv->rpmrules_end)
2083 Id type, from, to, dep;
2084 type = solver_ruleinfo(solv, rid, &from, &to, &dep);
2085 queue_push(rq, type);
2086 queue_push(rq, from);
2088 queue_push(rq, dep);
2093 queue_push(rq, rid);
2094 solv->ruleinfoq = rq;
2095 solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
2096 /* also try reverse direction for conflicts */
2097 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2098 solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
2099 solv->ruleinfoq = 0;
2101 /* now sort & unify em */
2104 solv_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
2105 /* throw out identical entries */
2106 for (i = j = 0; i < rq->count; i += 4)
2110 if (rq->elements[i] == rq->elements[j - 4] &&
2111 rq->elements[i + 1] == rq->elements[j - 3] &&
2112 rq->elements[i + 2] == rq->elements[j - 2] &&
2113 rq->elements[i + 3] == rq->elements[j - 1])
2116 rq->elements[j++] = rq->elements[i];
2117 rq->elements[j++] = rq->elements[i + 1];
2118 rq->elements[j++] = rq->elements[i + 2];
2119 rq->elements[j++] = rq->elements[i + 3];
2126 solver_ruleinfo(Solver *solv, Id rid, Id *fromp, Id *top, Id *depp)
2128 Pool *pool = solv->pool;
2129 Rule *r = solv->rules + rid;
2130 SolverRuleinfo type = SOLVER_RULE_UNKNOWN;
2138 if (rid > 0 && rid < solv->rpmrules_end)
2144 return SOLVER_RULE_RPM;
2148 queue_push(&rq, rid);
2149 solv->ruleinfoq = &rq;
2150 solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
2151 /* also try reverse direction for conflicts */
2152 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2153 solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
2154 solv->ruleinfoq = 0;
2155 type = SOLVER_RULE_RPM;
2156 for (i = 1; i < rq.count; i += 4)
2159 qt = rq.elements[i];
2160 qp = rq.elements[i + 1];
2161 qo = rq.elements[i + 2];
2162 qd = rq.elements[i + 3];
2163 if (type == SOLVER_RULE_RPM || type > qt)
2177 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2179 Id jidx = solv->ruletojob.elements[rid - solv->jobrules];
2183 *top = solv->job.elements[jidx];
2185 *depp = solv->job.elements[jidx + 1];
2186 if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE)
2188 Id how = solv->job.elements[jidx];
2189 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLVABLE_NAME))
2190 return SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2191 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES))
2192 return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2193 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVABLE_NAME))
2194 return SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2195 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVABLE_PROVIDES))
2196 return SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2197 return SOLVER_RULE_JOB_UNSUPPORTED;
2199 return SOLVER_RULE_JOB;
2201 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2204 *fromp = solv->installed->start + (rid - solv->updaterules);
2205 return SOLVER_RULE_UPDATE;
2207 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2210 *fromp = solv->installed->start + (rid - solv->featurerules);
2211 return SOLVER_RULE_FEATURE;
2213 if (rid >= solv->duprules && rid < solv->duprules_end)
2218 *depp = pool->solvables[-r->p].name;
2219 return SOLVER_RULE_DISTUPGRADE;
2221 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2226 *depp = pool->solvables[-r->p].name;
2227 return SOLVER_RULE_INFARCH;
2229 if (rid >= solv->bestrules && rid < solv->bestrules_end)
2231 return SOLVER_RULE_BEST;
2233 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2235 return SOLVER_RULE_CHOICE;
2237 if (rid >= solv->learntrules)
2239 return SOLVER_RULE_LEARNT;
2241 return SOLVER_RULE_UNKNOWN;
2245 solver_ruleclass(Solver *solv, Id rid)
2248 return SOLVER_RULE_UNKNOWN;
2249 if (rid > 0 && rid < solv->rpmrules_end)
2250 return SOLVER_RULE_RPM;
2251 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2252 return SOLVER_RULE_JOB;
2253 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2254 return SOLVER_RULE_UPDATE;
2255 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2256 return SOLVER_RULE_FEATURE;
2257 if (rid >= solv->duprules && rid < solv->duprules_end)
2258 return SOLVER_RULE_DISTUPGRADE;
2259 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2260 return SOLVER_RULE_INFARCH;
2261 if (rid >= solv->bestrules && rid < solv->bestrules_end)
2262 return SOLVER_RULE_BEST;
2263 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2264 return SOLVER_RULE_CHOICE;
2265 if (rid >= solv->learntrules)
2266 return SOLVER_RULE_LEARNT;
2267 return SOLVER_RULE_UNKNOWN;
2271 solver_ruleliterals(Solver *solv, Id rid, Queue *q)
2273 Pool *pool = solv->pool;
2278 r = solv->rules + rid;
2279 FOR_RULELITERALS(p, pp, r)
2280 if (p != -SYSTEMSOLVABLE)
2283 queue_push(q, -SYSTEMSOLVABLE); /* hmm, better to return an empty result? */
2287 solver_rule2jobidx(Solver *solv, Id rid)
2289 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2291 return solv->ruletojob.elements[rid - solv->jobrules] + 1;
2295 solver_rule2job(Solver *solv, Id rid, Id *whatp)
2298 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2304 idx = solv->ruletojob.elements[rid - solv->jobrules];
2306 *whatp = solv->job.elements[idx + 1];
2307 return solv->job.elements[idx];
2311 solver_rule2solvable(Solver *solv, Id rid)
2313 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2314 return rid - solv->updaterules;
2315 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2316 return rid - solv->featurerules;
2320 /* check if the newest versions of pi still provides the dependency we're looking for */
2322 solver_choicerulecheck(Solver *solv, Id pi, Rule *r, Map *m)
2324 Pool *pool = solv->pool;
2330 ur = solv->rules + solv->updaterules + (pi - pool->installed->start);
2332 ur = solv->rules + solv->featurerules + (pi - pool->installed->start);
2335 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
2336 FOR_RULELITERALS(p, pp, ur)
2340 policy_filter_unwanted(solv, &q, POLICY_MODE_CHOOSE);
2341 for (i = 0; i < q.count; i++)
2342 if (MAPTST(m, q.elements[i]))
2344 /* 1: none of the newest versions provide it */
2345 i = i == q.count ? 1 : 0;
2351 queue_removeelement(Queue *q, Id el)
2354 for (i = 0; i < q->count; i++)
2355 if (q->elements[i] == el)
2359 for (j = i++; i < q->count; i++)
2360 if (q->elements[i] != el)
2361 q->elements[j++] = q->elements[i];
2362 queue_truncate(q, j);
2367 solver_addchoicerules(Solver *solv)
2369 Pool *pool = solv->pool;
2373 int i, j, rid, havechoice;
2377 Id lastaddedp, lastaddedd;
2381 solv->choicerules = solv->nrules;
2382 if (!pool->installed)
2384 solv->choicerules_end = solv->nrules;
2387 now = solv_timems(0);
2388 solv->choicerules_ref = solv_calloc(solv->rpmrules_end, sizeof(Id));
2391 map_init(&m, pool->nsolvables);
2392 map_init(&mneg, pool->nsolvables);
2393 /* set up negative assertion map from infarch and dup rules */
2394 for (rid = solv->infarchrules, r = solv->rules + rid; rid < solv->infarchrules_end; rid++, r++)
2395 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2396 MAPSET(&mneg, -r->p);
2397 for (rid = solv->duprules, r = solv->rules + rid; rid < solv->duprules_end; rid++, r++)
2398 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2399 MAPSET(&mneg, -r->p);
2403 for (rid = 1; rid < solv->rpmrules_end ; rid++)
2405 r = solv->rules + rid;
2406 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 < 0))
2407 continue; /* only look at requires rules */
2408 /* solver_printrule(solv, SOLV_DEBUG_RESULT, r); */
2412 FOR_RULELITERALS(p, pp, r)
2416 s = pool->solvables + p;
2419 if (s->repo == pool->installed)
2424 /* check if this package is "blocked" by a installed package */
2426 FOR_PROVIDES(p2, pp2, s->name)
2428 s2 = pool->solvables + p2;
2429 if (s2->repo != pool->installed)
2431 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
2433 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, s2))
2439 /* found installed package p2 that we can update to p */
2440 if (MAPTST(&mneg, p))
2442 if (policy_is_illegal(solv, s2, s, 0))
2445 if (solver_choicerulecheck(solv, p2, r, &m))
2447 queue_push(&qi, p2);
2449 queue_push2(&qi, p2, p);
2456 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2458 while ((obs = *obsp++) != 0)
2460 FOR_PROVIDES(p2, pp2, obs)
2462 s2 = pool->solvables + p2;
2463 if (s2->repo != pool->installed)
2465 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
2467 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2476 /* found installed package p2 that we can update to p */
2477 if (MAPTST(&mneg, p))
2479 if (policy_is_illegal(solv, s2, s, 0))
2482 if (solver_choicerulecheck(solv, p2, r, &m))
2484 queue_push(&qi, p2);
2486 queue_push2(&qi, p2, p);
2492 /* package p is independent of the installed ones */
2495 if (!havechoice || !q.count || !qi.count)
2496 continue; /* no choice */
2498 FOR_RULELITERALS(p, pp, r)
2502 /* do extra checking */
2503 for (i = j = 0; i < qi.count; i += 2)
2505 p2 = qi.elements[i];
2508 if (solver_choicerulecheck(solv, p2, r, &m))
2510 /* oops, remove element p from q */
2511 queue_removeelement(&q, qi.elements[i + 1]);
2514 qi.elements[j++] = p2;
2516 queue_truncate(&qi, j);
2517 if (!q.count || !qi.count)
2519 FOR_RULELITERALS(p, pp, r)
2526 /* now check the update rules of the installed package.
2527 * if all packages of the update rules are contained in
2528 * the dependency rules, there's no need to set up the choice rule */
2529 for (i = 0; i < qi.count; i++)
2532 if (!qi.elements[i])
2534 ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
2536 ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
2539 FOR_RULELITERALS(p, pp, ur)
2544 for (j = i + 1; j < qi.count; j++)
2545 if (qi.elements[i] == qi.elements[j])
2548 /* empty map again */
2549 FOR_RULELITERALS(p, pp, r)
2555 printf("skipping choice ");
2556 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
2561 /* don't add identical rules */
2562 if (lastaddedp == r->p && lastaddedcnt == q.count)
2564 for (i = 0; i < q.count; i++)
2565 if (q.elements[i] != pool->whatprovidesdata[lastaddedd + i])
2568 continue; /* already added that one */
2570 d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
2574 lastaddedcnt = q.count;
2576 solver_addrule(solv, r->p, d);
2577 queue_push(&solv->weakruleq, solv->nrules - 1);
2578 solv->choicerules_ref[solv->nrules - 1 - solv->choicerules] = rid;
2581 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
2582 printf("WEAK CHOICE ");
2583 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + solv->nrules - 1);
2590 solv->choicerules_end = solv->nrules;
2591 /* shrink choicerules_ref */
2592 solv->choicerules_ref = solv_realloc2(solv->choicerules_ref, solv->choicerules_end - solv->choicerules, sizeof(Id));
2593 POOL_DEBUG(SOLV_DEBUG_STATS, "choice rule creation took %d ms\n", solv_timems(now));
2596 /* called when a choice rule is disabled by analyze_unsolvable. We also
2597 * have to disable all other choice rules so that the best packages get
2600 solver_disablechoicerules(Solver *solv, Rule *r)
2603 Pool *pool = solv->pool;
2607 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2608 map_init(&m, pool->nsolvables);
2609 FOR_RULELITERALS(p, pp, or)
2612 FOR_RULELITERALS(p, pp, r)
2615 for (rid = solv->choicerules; rid < solv->choicerules_end; rid++)
2617 r = solv->rules + rid;
2620 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2621 FOR_RULELITERALS(p, pp, or)
2622 if (p > 0 && MAPTST(&m, p))
2625 solver_disablerule(solv, r);
2630 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
2634 for (i = j = 0; i < q->count; i++)
2637 for (cp2 = cp; *cp2; cp2++)
2640 q->elements[j++] = p;
2644 queue_truncate(q, j);
2648 prune_to_dup_packages(Solver *solv, Id p, Queue *q)
2651 for (i = j = 0; i < q->count; i++)
2653 Id p = q->elements[i];
2654 if (MAPTST(&solv->dupmap, p))
2655 q->elements[j++] = p;
2657 queue_truncate(q, j);
2661 solver_addbestrules(Solver *solv, int havebestinstalljobs)
2663 Pool *pool = solv->pool;
2666 Repo *installed = solv->installed;
2672 solv->bestrules = solv->nrules;
2675 solv->bestrules_end = solv->nrules;
2682 if (havebestinstalljobs)
2684 for (i = 0; i < solv->job.count; i += 2)
2686 if ((solv->job.elements[i] & (SOLVER_JOBMASK | SOLVER_FORCEBEST)) == (SOLVER_INSTALL | SOLVER_FORCEBEST))
2690 for (j = 0; j < solv->ruletojob.count; j++)
2691 if (solv->ruletojob.elements[j] == i)
2693 if (j == solv->ruletojob.count)
2695 r = solv->rules + solv->jobrules + j;
2697 FOR_RULELITERALS(p2, pp2, r)
2701 continue; /* orphaned */
2702 /* select best packages, just look at prio and version */
2704 policy_filter_unwanted(solv, &q, POLICY_MODE_RECOMMEND);
2705 if (q.count == oldcnt)
2706 continue; /* nothing filtered */
2707 p2 = queue_shift(&q);
2708 solver_addrule(solv, p2, q.count ? pool_queuetowhatprovides(pool, &q) : 0);
2709 queue_push(&r2pkg, -(solv->jobrules + j));
2714 if (solv->bestupdatemap_all || solv->bestupdatemap.size)
2716 FOR_REPO_SOLVABLES(installed, p, s)
2719 if (!solv->updatemap_all && (!solv->updatemap.size || !MAPTST(&solv->updatemap, p - installed->start)))
2721 if (!solv->bestupdatemap_all && (!solv->bestupdatemap.size || !MAPTST(&solv->bestupdatemap, p - installed->start)))
2724 if (solv->bestobeypolicy)
2725 r = solv->rules + solv->updaterules + (p - installed->start);
2728 r = solv->rules + solv->featurerules + (p - installed->start);
2729 if (!r->p) /* identical to update rule? */
2730 r = solv->rules + solv->updaterules + (p - installed->start);
2732 if (solv->multiversionupdaters && (d = solv->multiversionupdaters[p - installed->start]) != 0 && r == solv->rules + solv->updaterules + (p - installed->start))
2734 /* need to check multiversionupdaters */
2735 if (r->p == p) /* be careful with the dup case */
2737 while ((p2 = pool->whatprovidesdata[d++]) != 0)
2742 FOR_RULELITERALS(p2, pp2, r)
2746 if (solv->update_targets && solv->update_targets->elements[p - installed->start])
2747 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q);
2748 if (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
2749 prune_to_dup_packages(solv, p, &q);
2750 /* select best packages, just look at prio and version */
2751 policy_filter_unwanted(solv, &q, POLICY_MODE_RECOMMEND);
2753 continue; /* orphaned */
2754 if (solv->bestobeypolicy)
2756 /* also filter the best of the feature rule packages and add them */
2757 r = solv->rules + solv->featurerules + (p - installed->start);
2762 FOR_RULELITERALS(p2, pp2, r)
2764 queue_push(&q2, p2);
2765 if (solv->update_targets && solv->update_targets->elements[p - installed->start])
2766 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q2);
2767 if (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
2768 prune_to_dup_packages(solv, p, &q);
2769 policy_filter_unwanted(solv, &q2, POLICY_MODE_RECOMMEND);
2770 for (j = 0; j < q2.count; j++)
2771 queue_pushunique(&q, q2.elements[j]);
2774 p2 = queue_shift(&q);
2775 solver_addrule(solv, p2, q.count ? pool_queuetowhatprovides(pool, &q) : 0);
2776 queue_push(&r2pkg, p);
2781 solv->bestrules_pkg = solv_calloc(r2pkg.count, sizeof(Id));
2782 memcpy(solv->bestrules_pkg, r2pkg.elements, r2pkg.count * sizeof(Id));
2784 solv->bestrules_end = solv->nrules;
2790 #undef CLEANDEPSDEBUG
2793 * This functions collects all packages that are looked at
2794 * when a dependency is checked. We need it to "pin" installed
2795 * packages when removing a supplemented package in createcleandepsmap.
2796 * Here's an not uncommon example:
2797 * A contains "Supplements: packageand(B, C)"
2798 * B contains "Requires: A"
2799 * Now if we remove C, the supplements is no longer true,
2800 * thus we also remove A. Without the dep_pkgcheck function, we
2801 * would now also remove B, but this is wrong, as adding back
2802 * C doesn't make the supplements true again. Thus we "pin" B
2804 * There's probably a better way to do this, but I haven't come
2808 dep_pkgcheck(Solver *solv, Id dep, Map *m, Queue *q)
2810 Pool *pool = solv->pool;
2815 Reldep *rd = GETRELDEP(pool, dep);
2818 if (rd->flags == REL_AND)
2820 dep_pkgcheck(solv, rd->name, m, q);
2821 dep_pkgcheck(solv, rd->evr, m, q);
2824 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
2826 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
2830 FOR_PROVIDES(p, pp, dep)
2831 if (!m || MAPTST(m, p))
2836 check_xsupp(Solver *solv, Queue *depq, Id dep)
2838 Pool *pool = solv->pool;
2843 Reldep *rd = GETRELDEP(pool, dep);
2846 if (rd->flags == REL_AND)
2848 if (!check_xsupp(solv, depq, rd->name))
2850 return check_xsupp(solv, depq, rd->evr);
2852 if (rd->flags == REL_OR)
2854 if (check_xsupp(solv, depq, rd->name))
2856 return check_xsupp(solv, depq, rd->evr);
2858 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
2859 return solver_splitprovides(solv, rd->evr);
2860 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
2861 return solver_dep_installed(solv, rd->evr);
2863 if (depq && rd->flags == REL_NAMESPACE)
2866 for (i = 0; i < depq->count; i++)
2867 if (depq->elements[i] == dep || depq->elements[i] == rd->name)
2871 FOR_PROVIDES(p, pp, dep)
2872 if (p == SYSTEMSOLVABLE || pool->solvables[p].repo == solv->installed)
2878 queue_contains(Queue *q, Id id)
2881 for (i = 0; i < q->count; i++)
2882 if (q->elements[i] == id)
2889 * Find all installed packages that are no longer
2890 * needed regarding the current solver job.
2893 * - remove pass: remove all packages that could have
2894 * been dragged in by the obsoleted packages.
2895 * i.e. if package A is obsolete and contains "Requires: B",
2896 * also remove B, as installing A will have pulled in B.
2897 * after this pass, we have a set of still installed packages
2898 * with broken dependencies.
2900 * now add back all packages that the still installed packages
2903 * The cleandeps packages are the packages removed in the first
2904 * pass and not added back in the second pass.
2906 * If we search for unneeded packages (unneeded is true), we
2907 * simply remove all packages except the userinstalled ones in
2911 solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded)
2913 Pool *pool = solv->pool;
2914 Repo *installed = solv->installed;
2915 Queue *job = &solv->job;
2920 Id rid, how, what, select;
2922 Id req, *reqp, sup, *supp;
2924 Queue iq, iqcopy, xsuppq;
2927 map_empty(cleandepsmap);
2928 if (!installed || installed->end == installed->start)
2930 map_init(&userinstalled, installed->end - installed->start);
2931 map_init(&im, pool->nsolvables);
2932 map_init(&installedm, pool->nsolvables);
2934 queue_init(&xsuppq);
2936 for (i = 0; i < job->count; i += 2)
2938 how = job->elements[i];
2939 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
2941 what = job->elements[i + 1];
2942 select = how & SOLVER_SELECTMASK;
2943 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
2944 FOR_REPO_SOLVABLES(installed, p, s)
2945 MAPSET(&userinstalled, p - installed->start);
2946 FOR_JOB_SELECT(p, pp, select, what)
2947 if (pool->solvables[p].repo == installed)
2948 MAPSET(&userinstalled, p - installed->start);
2950 if ((how & (SOLVER_JOBMASK | SOLVER_SELECTMASK)) == (SOLVER_ERASE | SOLVER_SOLVABLE_PROVIDES))
2952 what = job->elements[i + 1];
2955 Reldep *rd = GETRELDEP(pool, what);
2956 if (rd->flags != REL_NAMESPACE)
2960 queue_pushunique(&iq, rd->name);
2963 FOR_PROVIDES(p, pp, what)
2968 queue_pushunique(&iq, what);
2973 /* have special namespace cleandeps erases */
2976 for (ip = solv->installed->start; ip < solv->installed->end; ip++)
2978 s = pool->solvables + ip;
2979 if (s->repo != installed)
2981 if (!s->supplements)
2983 supp = s->repo->idarraydata + s->supplements;
2984 while ((sup = *supp++) != 0)
2985 if (check_xsupp(solv, &iq, sup) && !check_xsupp(solv, 0, sup))
2987 #ifdef CLEANDEPSDEBUG
2988 printf("xsupp %s from %s\n", pool_dep2str(pool, sup), pool_solvid2str(pool, ip));
2990 queue_pushunique(&xsuppq, sup);
2996 /* also add visible patterns to userinstalled for openSUSE */
3000 dataiterator_init(&di, pool, 0, 0, SOLVABLE_ISVISIBLE, 0, 0);
3001 while (dataiterator_step(&di))
3006 s = pool->solvables + di.solvid;
3007 if (!s->repo || !s->requires)
3009 if (s->repo != installed && !pool_installable(pool, s))
3011 if (strncmp(pool_id2str(pool, s->name), "pattern:", 8) != 0)
3013 dp = s->repo->idarraydata + s->requires;
3014 for (dp = s->repo->idarraydata + s->requires; *dp; dp++)
3015 FOR_PROVIDES(p, pp, *dp)
3016 if (pool->solvables[p].repo == installed)
3018 if (strncmp(pool_id2str(pool, pool->solvables[p].name), "pattern", 7) != 0)
3020 MAPSET(&userinstalled, p - installed->start);
3023 dataiterator_free(&di);
3027 /* all products and their buddies are userinstalled */
3028 for (p = installed->start; p < installed->end; p++)
3030 Solvable *s = pool->solvables + p;
3031 if (s->repo != installed)
3033 if (!strncmp("product:", pool_id2str(pool, s->name), 8))
3035 MAPSET(&userinstalled, p - installed->start);
3036 if (pool->nscallback)
3038 Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, p);
3039 if (buddy >= installed->start && buddy < installed->end && pool->solvables[buddy].repo == installed)
3040 MAPSET(&userinstalled, buddy - installed->start);
3046 /* add all positive elements (e.g. locks) to "userinstalled" */
3047 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3049 r = solv->rules + rid;
3052 i = solv->ruletojob.elements[rid - solv->jobrules];
3053 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
3055 FOR_RULELITERALS(p, jp, r)
3056 if (p > 0 && pool->solvables[p].repo == installed)
3057 MAPSET(&userinstalled, p - installed->start);
3060 /* add all cleandeps candidates to iq */
3061 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3063 r = solv->rules + rid;
3064 if (r->d < 0) /* disabled? */
3066 if (r->d == 0 && r->p < 0 && r->w2 == 0) /* negative assertion (erase job)? */
3069 if (pool->solvables[p].repo != installed)
3071 MAPCLR(&userinstalled, p - installed->start);
3074 i = solv->ruletojob.elements[rid - solv->jobrules];
3075 how = job->elements[i];
3076 if ((how & (SOLVER_JOBMASK|SOLVER_CLEANDEPS)) == (SOLVER_ERASE|SOLVER_CLEANDEPS))
3079 else if (r->p > 0) /* install job */
3083 i = solv->ruletojob.elements[rid - solv->jobrules];
3084 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
3086 /* check if the literals all obsolete some installed package */
3090 /* just one installed literal */
3091 if (r->d == 0 && r->w2 == 0 && pool->solvables[r->p].repo == installed)
3093 /* multiversion is bad */
3094 if (solv->multiversion.size && !solv->keepexplicitobsoletes)
3096 FOR_RULELITERALS(p, jp, r)
3097 if (MAPTST(&solv->multiversion, p))
3105 FOR_RULELITERALS(p, jp, r)
3109 queue_truncate(&iq, iqstart); /* abort */
3112 if (pool->solvables[p].repo == installed)
3114 if (iq.count == iqstart)
3118 for (i = iqstart; i < iq.count; i++)
3119 if (iq.elements[i] == p)
3121 queue_truncate(&iq, iqstart);
3127 intersect_obsoletes(solv, p, &iq, iqstart, &om);
3128 if (iq.count == iqstart)
3136 queue_init_clone(&iqcopy, &iq);
3140 if (solv->cleandeps_updatepkgs)
3141 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
3142 queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]);
3146 queue_empty(&iq); /* just in case... */
3148 /* clear userinstalled bit for the packages we really want to delete/update */
3149 for (i = 0; i < iq.count; i++)
3152 if (pool->solvables[p].repo != installed)
3154 MAPCLR(&userinstalled, p - installed->start);
3157 for (p = installed->start; p < installed->end; p++)
3159 if (pool->solvables[p].repo != installed)
3161 MAPSET(&installedm, p);
3162 if (unneeded && !MAPTST(&userinstalled, p - installed->start))
3166 MAPSET(&installedm, SYSTEMSOLVABLE);
3167 MAPSET(&im, SYSTEMSOLVABLE);
3169 #ifdef CLEANDEPSDEBUG
3170 printf("REMOVE PASS\n");
3179 /* supplements pass */
3180 for (ip = installed->start; ip < installed->end; ip++)
3182 if (!MAPTST(&installedm, ip))
3184 s = pool->solvables + ip;
3185 if (!s->supplements)
3187 if (!MAPTST(&im, ip))
3189 if (MAPTST(&userinstalled, ip - installed->start))
3191 supp = s->repo->idarraydata + s->supplements;
3192 while ((sup = *supp++) != 0)
3193 if (dep_possible(solv, sup, &im))
3197 supp = s->repo->idarraydata + s->supplements;
3198 while ((sup = *supp++) != 0)
3199 if (dep_possible(solv, sup, &installedm) || (xsuppq.count && queue_contains(&xsuppq, sup)))
3201 /* no longer supplemented, also erase */
3202 int iqcount = iq.count;
3203 /* pin packages, see comment above dep_pkgcheck */
3204 dep_pkgcheck(solv, sup, &im, &iq);
3205 for (i = iqcount; i < iq.count; i++)
3207 Id pqp = iq.elements[i];
3208 if (pool->solvables[pqp].repo == installed)
3209 MAPSET(&userinstalled, pqp - installed->start);
3211 queue_truncate(&iq, iqcount);
3212 #ifdef CLEANDEPSDEBUG
3213 printf("%s supplemented [%s]\n", pool_solvid2str(pool, ip), pool_dep2str(pool, sup));
3215 queue_push(&iq, ip);
3220 break; /* no supplementing package found, we're done */
3222 ip = queue_shift(&iq);
3223 s = pool->solvables + ip;
3224 if (!MAPTST(&im, ip))
3226 if (!MAPTST(&installedm, ip))
3228 if (s->repo == installed && MAPTST(&userinstalled, ip - installed->start))
3231 #ifdef CLEANDEPSDEBUG
3232 printf("removing %s\n", pool_solvable2str(pool, s));
3236 reqp = s->repo->idarraydata + s->requires;
3237 while ((req = *reqp++) != 0)
3239 if (req == SOLVABLE_PREREQMARKER)
3242 /* count number of installed packages that match */
3244 FOR_PROVIDES(p, pp, req)
3245 if (MAPTST(&installedm, p))
3250 FOR_PROVIDES(p, pp, req)
3252 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
3254 #ifdef CLEANDEPSDEBUG
3255 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3264 reqp = s->repo->idarraydata + s->recommends;
3265 while ((req = *reqp++) != 0)
3269 FOR_PROVIDES(p, pp, req)
3270 if (MAPTST(&installedm, p))
3275 FOR_PROVIDES(p, pp, req)
3277 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
3279 #ifdef CLEANDEPSDEBUG
3280 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3289 /* turn userinstalled into remove set for pruning */
3290 map_empty(&userinstalled);
3291 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3293 r = solv->rules + rid;
3294 if (r->p >= 0 || r->d != 0 || r->w2 != 0)
3295 continue; /* disabled or not erase */
3298 if (pool->solvables[p].repo == installed)
3299 MAPSET(&userinstalled, p - installed->start);
3301 MAPSET(&im, SYSTEMSOLVABLE); /* in case we cleared it above */
3302 for (p = installed->start; p < installed->end; p++)
3305 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
3307 r = solv->rules + rid;
3310 FOR_RULELITERALS(p, jp, r)
3314 /* also put directly addressed packages on the install queue
3315 * so we can mark patterns as installed */
3316 for (i = 0; i < job->count; i += 2)
3318 how = job->elements[i];
3319 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
3321 what = job->elements[i + 1];
3322 select = how & SOLVER_SELECTMASK;
3323 if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
3324 queue_push(&iq, what);
3328 #ifdef CLEANDEPSDEBUG
3329 printf("ADDBACK PASS\n");
3335 /* supplements pass */
3336 for (ip = installed->start; ip < installed->end; ip++)
3338 if (!MAPTST(&installedm, ip))
3340 if (MAPTST(&userinstalled, ip - installed->start))
3342 s = pool->solvables + ip;
3343 if (!s->supplements)
3345 if (MAPTST(&im, ip))
3347 supp = s->repo->idarraydata + s->supplements;
3348 while ((sup = *supp++) != 0)
3349 if (dep_possible(solv, sup, &im))
3353 #ifdef CLEANDEPSDEBUG
3354 printf("%s supplemented\n", pool_solvid2str(pool, ip));
3357 queue_push(&iq, ip);
3363 ip = queue_shift(&iq);
3364 s = pool->solvables + ip;
3365 #ifdef CLEANDEPSDEBUG
3366 printf("adding back %s\n", pool_solvable2str(pool, s));
3370 reqp = s->repo->idarraydata + s->requires;
3371 while ((req = *reqp++) != 0)
3373 FOR_PROVIDES(p, pp, req)
3378 FOR_PROVIDES(p, pp, req)
3380 if (!MAPTST(&im, p) && MAPTST(&installedm, p))
3384 if (MAPTST(&userinstalled, p - installed->start))
3386 #ifdef CLEANDEPSDEBUG
3387 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3397 reqp = s->repo->idarraydata + s->recommends;
3398 while ((req = *reqp++) != 0)
3400 FOR_PROVIDES(p, pp, req)
3405 FOR_PROVIDES(p, pp, req)
3407 if (!MAPTST(&im, p) && MAPTST(&installedm, p))
3411 if (MAPTST(&userinstalled, p - installed->start))
3413 #ifdef CLEANDEPSDEBUG
3414 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3425 /* make sure the updatepkgs and mistakes are not in the cleandeps map */
3426 if (solv->cleandeps_updatepkgs)
3427 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
3428 MAPSET(&im, solv->cleandeps_updatepkgs->elements[i]);
3429 if (solv->cleandeps_mistakes)
3430 for (i = 0; i < solv->cleandeps_mistakes->count; i++)
3431 MAPSET(&im, solv->cleandeps_mistakes->elements[i]);
3432 /* also remove original iq packages */
3433 for (i = 0; i < iqcopy.count; i++)
3434 MAPSET(&im, iqcopy.elements[i]);
3435 queue_free(&iqcopy);
3436 for (p = installed->start; p < installed->end; p++)
3438 if (pool->solvables[p].repo != installed)
3440 if (!MAPTST(&im, p))
3441 MAPSET(cleandepsmap, p - installed->start);
3444 map_free(&installedm);
3445 map_free(&userinstalled);
3446 queue_free(&xsuppq);
3447 #ifdef CLEANDEPSDEBUG
3448 printf("=== final cleandeps map:\n");
3449 for (p = installed->start; p < installed->end; p++)
3450 if (MAPTST(cleandepsmap, p - installed->start))
3451 printf(" - %s\n", pool_solvid2str(pool, p));
3464 /* Tarjan's SCC algorithm, slightly modifed */
3466 trj_visit(struct trj_data *trj, Id node)
3469 Queue *edges = trj->edges;
3470 Id nnode, myidx, stackstart;
3473 low[node] = myidx = trj->idx++;
3474 low[(stackstart = trj->nstack++)] = node;
3475 for (i = edges->elements[node]; (nnode = edges->elements[i]) != 0; i++)
3480 if (!edges->elements[edges->elements[nnode]])
3486 trj_visit(trj, nnode);
3491 if (l < trj->firstidx)
3494 for (k = l; low[low[k]] == l; k++)
3497 else if (l < low[node])
3500 if (low[node] == myidx)
3502 if (myidx != trj->firstidx)
3504 for (i = stackstart; i < trj->nstack; i++)
3505 low[low[i]] = myidx;
3506 trj->nstack = stackstart;
3512 solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered)
3514 Repo *installed = solv->installed;
3518 queue_empty(unneededq);
3519 if (!installed || installed->end == installed->start)
3522 map_init(&cleandepsmap, installed->end - installed->start);
3523 solver_createcleandepsmap(solv, &cleandepsmap, 1);
3524 for (i = installed->start; i < installed->end; i++)
3525 if (MAPTST(&cleandepsmap, i - installed->start))
3526 queue_push(unneededq, i);
3528 if (filtered && unneededq->count > 1)
3530 Pool *pool = solv->pool;
3534 int j, pass, count = unneededq->count;
3537 map_init(&installedm, pool->nsolvables);
3538 for (i = installed->start; i < installed->end; i++)
3539 if (pool->solvables[i].repo == installed)
3540 MAPSET(&installedm, i);
3542 nrequires = solv_calloc(count, sizeof(Id));
3544 queue_prealloc(&edges, count * 4 + 10); /* pre-size */
3547 * Go through the solvables in the nodes queue and create edges for
3548 * all requires/recommends/supplements between the nodes.
3549 * The edges are stored in the edges queue, we add 1 to the node
3550 * index so that nodes in the edges queue are != 0 and we can
3551 * terminate the edge list with 0.
3552 * Thus for node element 5, the edges are stored starting at
3553 * edges.elements[6] and are 0-terminated.
3555 /* leave first element zero to make things easier */
3556 /* also add trailing zero */
3557 queue_insertn(&edges, 0, 1 + count + 1, 0);
3559 /* first requires and recommends */
3560 for (i = 0; i < count; i++)
3562 Solvable *s = pool->solvables + unneededq->elements[i];
3563 edges.elements[i + 1] = edges.count;
3564 for (pass = 0; pass < 2; pass++)
3567 unsigned int off = pass == 0 ? s->requires : s->recommends;
3570 for (dp = s->repo->idarraydata + off; *dp; dp++)
3571 FOR_PROVIDES(p, pp, *dp)
3573 Solvable *sp = pool->solvables + p;
3574 if (s == sp || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
3576 for (j = 0; j < count; j++)
3577 if (p == unneededq->elements[j])
3581 if (num && edges.elements[edges.count - 1] == j + 1)
3583 queue_push(&edges, j + 1);
3589 queue_push(&edges, 0);
3592 printf("requires + recommends\n");
3593 for (i = 0; i < count; i++)
3596 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
3597 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
3598 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
3602 /* then add supplements */
3603 for (i = 0; i < count; i++)
3605 Solvable *s = pool->solvables + unneededq->elements[i];
3610 for (dp = s->repo->idarraydata + s->supplements; *dp; dp++)
3611 if (dep_possible(solv, *dp, &installedm))
3615 queue_init_buffer(&iq, iqbuf, sizeof(iqbuf)/sizeof(*iqbuf));
3616 dep_pkgcheck(solv, *dp, 0, &iq);
3617 for (k = 0; k < iq.count; k++)
3619 Id p = iq.elements[k];
3620 Solvable *sp = pool->solvables + p;
3621 if (p == unneededq->elements[i] || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
3623 for (j = 0; j < count; j++)
3624 if (p == unneededq->elements[j])
3626 /* now add edge from j + 1 to i + 1 */
3627 queue_insert(&edges, edges.elements[j + 1] + nrequires[j], i + 1);
3628 /* addapt following edge pointers */
3629 for (k = j + 2; k < count + 2; k++)
3630 edges.elements[k]++;
3638 printf("+ supplements\n");
3639 for (i = 0; i < count; i++)
3642 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
3643 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
3644 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
3647 map_free(&installedm);
3649 /* now run SCC algo two times, first with requires+recommends+supplements,
3650 * then again without the requires. We run it the second time to get rid
3651 * of packages that got dragged in via recommends/supplements */
3653 * low will contain the result of the SCC search.
3654 * it must be of at least size 2 * (count + 1) and
3655 * must be zero initialized.
3657 * 0 low low ... low stack stack ...stack 0
3660 low = solv_calloc(count + 1, 2 * sizeof(Id));
3661 for (pass = 0; pass < 2; pass++)
3663 struct trj_data trj;
3666 memset(low, 0, (count + 1) * (2 * sizeof(Id)));
3667 for (i = 0; i < count; i++)
3669 edges.elements[i + 1] += nrequires[i];
3670 if (!unneededq->elements[i])
3671 low[i + 1] = -1; /* ignore this node */
3676 trj.idx = count + 1; /* stack starts here */
3677 for (i = 1; i <= count; i++)
3681 if (edges.elements[edges.elements[i]])
3683 trj.firstidx = trj.nstack = trj.idx;
3688 Id myidx = trj.idx++;
3693 /* prune packages */
3694 for (i = 0; i < count; i++)
3695 if (low[i + 1] <= 0)
3696 unneededq->elements[i] = 0;
3699 solv_free(nrequires);
3702 /* finally remove all pruned entries from unneededq */
3703 for (i = j = 0; i < count; i++)
3704 if (unneededq->elements[i])
3705 unneededq->elements[j++] = unneededq->elements[i];
3706 queue_truncate(unneededq, j);
3708 map_free(&cleandepsmap);