2 * Copyright (c) 2007-2009, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * SAT based dependency solver
21 #include "solver_private.h"
28 #include "solverdebug.h"
29 #include "linkedpkg.h"
32 #define RULES_BLOCK 63
34 static void addpkgruleinfo(Solver *solv, Id p, Id p2, Id d, int type, Id dep);
35 static void solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded);
37 /*-------------------------------------------------------------------
38 * Check if dependency is possible
40 * mirrors solver_dep_fulfilled but uses map m instead of the decisionmap.
41 * used in solver_addpkgrulesforweak and solver_createcleandepsmap.
45 dep_possible(Solver *solv, Id dep, Map *m)
47 Pool *pool = solv->pool;
52 Reldep *rd = GETRELDEP(pool, dep);
55 if (rd->flags == REL_COND)
57 if (rd->flags == REL_AND)
59 if (!dep_possible(solv, rd->name, m))
61 return dep_possible(solv, rd->evr, m);
63 if (rd->flags == REL_OR)
65 if (dep_possible(solv, rd->name, m))
67 return dep_possible(solv, rd->evr, m);
69 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
70 return solver_splitprovides(solv, rd->evr, m);
73 FOR_PROVIDES(p, pp, dep)
82 is_otherproviders_dep(Pool *pool, Id dep)
86 Reldep *rd = GETRELDEP(pool, dep);
87 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
93 /********************************************************************
97 * - unify rules, remove duplicates
100 /*-------------------------------------------------------------------
102 * compare rules for unification sort
107 unifyrules_sortcmp(const void *ap, const void *bp, void *dp)
110 Rule *a = (Rule *)ap;
111 Rule *b = (Rule *)bp;
117 return x; /* p differs */
120 if (a->d == 0 && b->d == 0)
121 return a->w2 - b->w2; /* assertion: return w2 diff */
123 if (a->d == 0) /* a is assertion, b not */
125 x = a->w2 - pool->whatprovidesdata[b->d];
129 if (b->d == 0) /* b is assertion, a not */
131 x = pool->whatprovidesdata[a->d] - b->w2;
135 /* compare whatprovidesdata */
136 ad = pool->whatprovidesdata + a->d;
137 bd = pool->whatprovidesdata + b->d;
139 if ((x = *ad++ - *bd++) != 0)
145 solver_rulecmp(Solver *solv, Rule *r1, Rule *r2)
147 return unifyrules_sortcmp(r1, r2, solv->pool);
151 /*-------------------------------------------------------------------
154 * go over all rules and remove duplicates
158 solver_unifyrules(Solver *solv)
160 Pool *pool = solv->pool;
164 if (solv->nrules <= 2) /* nothing to unify */
167 /* sort rules first */
168 solv_sort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp, solv->pool);
175 for (i = j = 1, ir = solv->rules + i; i < solv->nrules; i++, ir++)
177 if (jr && !unifyrules_sortcmp(ir, jr, pool))
178 continue; /* prune! */
179 jr = solv->rules + j++; /* keep! */
184 /* reduced count from nrules to j rules */
185 POOL_DEBUG(SOLV_DEBUG_STATS, "pruned rules from %d to %d\n", solv->nrules, j);
187 /* adapt rule buffer */
189 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
192 * debug: log rule statistics
194 IF_POOLDEBUG (SOLV_DEBUG_STATS)
201 for (i = 1; i < solv->nrules; i++)
208 dp = solv->pool->whatprovidesdata + r->d;
213 POOL_DEBUG(SOLV_DEBUG_STATS, " binary: %d\n", binr);
214 POOL_DEBUG(SOLV_DEBUG_STATS, " normal: %d, %d literals\n", solv->nrules - 1 - binr, lits);
225 hashrule(Solver *solv, Id p, Id d, int n)
227 unsigned int x = (unsigned int)p;
231 return (x * 37) ^ (unsigned int)d;
232 dp = solv->pool->whatprovidesdata + d;
234 x = (x * 37) ^ (unsigned int)*dp++;
240 /*-------------------------------------------------------------------
247 * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
249 * p < 0 : pkg id of A
250 * d > 0 : Offset in whatprovidesdata (list of providers of b)
252 * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
253 * p < 0 : pkg id of A
254 * p2 < 0 : Id of solvable (e.g. B1)
256 * d == 0, p2 == 0: unary rule, assertion => (A) or (-A)
258 * Install: p > 0, d = 0 (A) user requested install
259 * Remove: p < 0, d = 0 (-A) user requested remove (also: uninstallable)
260 * Requires: p < 0, d > 0 (-A|B1|B2|...) d: <list of providers for requirement of p>
261 * Updates: p > 0, d > 0 (A|B1|B2|...) d: <list of updates for solvable p>
262 * Conflicts: p < 0, p2 < 0 (-A|-B) either p (conflict issuer) or d (conflict provider) (binary rule)
263 * also used for obsoletes
264 * No-op ?: p = 0, d = 0 (null) (used as placeholder in update/feature rules)
268 * Direct assertion (no watch needed) --> d = 0, w1 = p, w2 = 0
269 * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
270 * every other : w1 = p, w2 = whatprovidesdata[d];
272 * always returns a rule for non-pkg rules
276 solver_addrule(Solver *solv, Id p, Id p2, Id d)
278 Pool *pool = solv->pool;
283 assert(!p2 && d > 0);
284 if (!pool->whatprovidesdata[d])
286 else if (!pool->whatprovidesdata[d + 1])
288 p2 = pool->whatprovidesdata[d];
293 /* now we have two cases:
294 * 1 or 2 literals: d = 0, p, p2 contain the literals
295 * 3 or more literals: d > 0, p2 == 0, d is offset into whatprovidesdata
298 /* it often happenes that requires lead to adding the same pkg rule
299 * multiple times, so we prune those duplicates right away to make
300 * the work for unifyrules a bit easier */
301 if (!solv->pkgrules_end) /* we add pkg rules */
303 r = solv->rules + solv->nrules - 1;
307 /* check if rule is identical */
313 dp2 = pool->whatprovidesdata + r->d;
314 for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
320 /* check if rule is self-fulfilling */
321 for (dp = pool->whatprovidesdata + d; *dp; dp++)
323 return 0; /* rule is self-fulfilling */
329 Id o = p; /* switch p1 and p2 */
333 if (r->p == p && !r->d && r->w2 == p2)
336 return 0; /* rule is self-fulfilling */
340 solv->rules = solv_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
341 r = solv->rules + solv->nrules++; /* point to rule space */
345 r->w2 = d ? pool->whatprovidesdata[d] : p2;
348 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
350 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " Add rule: ");
351 solver_printrule(solv, SOLV_DEBUG_RULE_CREATION, r);
358 solver_shrinkrules(Solver *solv, int nrules)
360 solv->nrules = nrules;
361 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
364 /******************************************************************************
366 *** pkg rule part: create rules representing the package dependencies
371 * special multiversion patch conflict handling:
372 * a patch conflict is also satisfied if some other
373 * version with the same name/arch that doesn't conflict
374 * gets installed. The generated rule is thus:
375 * -patch|-cpack|opack1|opack2|...
378 makemultiversionconflict(Solver *solv, Id n, Id con)
380 Pool *pool = solv->pool;
385 sn = pool->solvables + n;
386 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
388 FOR_PROVIDES(p, pp, sn->name)
390 s = pool->solvables + p;
391 if (s->name != sn->name || s->arch != sn->arch)
393 if (!MAPTST(&solv->multiversion, p))
395 if (pool_match_nevr(pool, pool->solvables + p, con))
397 /* here we have a multiversion solvable that doesn't conflict */
398 /* thus we're not in conflict if it is installed */
402 n = 0; /* no other package found, normal conflict handling */
404 n = pool_queuetowhatprovides(pool, &q);
410 addpkgrule(Solver *solv, Id p, Id p2, Id d, int type, Id dep)
412 if (!solv->ruleinfoq)
413 solver_addrule(solv, p, p2, d);
415 addpkgruleinfo(solv, p, p2, d, type, dep);
418 #ifdef ENABLE_LINKED_PKGS
421 addlinks_cmp(const void *ap, const void *bp, void *dp)
426 Solvable *sa = pool->solvables + a;
427 Solvable *sb = pool->solvables + b;
428 if (sa->name != sb->name)
429 return sa->name - sb->name;
434 addlinks(Solver *solv, Solvable *s, Id req, Queue *qr, Id prv, Queue *qp, Map *m, Queue *workq)
436 Pool *pool = solv->pool;
441 solv_sort(qp->elements, qp->count, sizeof(Id), addlinks_cmp, pool);
443 printf("ADDLINKS %s\n -> %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
444 for (i = 0; i < qr->count; i++)
445 printf(" - %s\n", pool_solvid2str(pool, qr->elements[i]));
446 printf(" <- %s\n", pool_dep2str(pool, prv));
447 for (i = 0; i < qp->count; i++)
448 printf(" - %s\n", pool_solvid2str(pool, qp->elements[i]));
452 addpkgrule(solv, -(s - pool->solvables), qr->elements[0], 0, SOLVER_RULE_PKG_REQUIRES, req);
454 addpkgrule(solv, -(s - pool->solvables), 0, pool_queuetowhatprovides(pool, qr), SOLVER_RULE_PKG_REQUIRES, req);
458 for (i = j = 0; i < qp->count; i = j)
460 Id d = pool->solvables[qp->elements[i]].name;
461 for (j = i + 1; j < qp->count; j++)
462 if (d != pool->solvables[qp->elements[j]].name)
464 d = pool_ids2whatprovides(pool, qp->elements + i, j - i);
465 for (i = 0; i < qr->count; i++)
466 addpkgrule(solv, -qr->elements[i], 0, d, SOLVER_RULE_PKG_REQUIRES, prv);
471 for (i = 0; i < qr->count; i++)
472 addpkgrule(solv, -qr->elements[i], qp->elements[0], 0, SOLVER_RULE_PKG_REQUIRES, prv);
475 return; /* nothing more to do if called from getpkgruleinfos() */
476 for (i = 0; i < qr->count; i++)
477 if (!MAPTST(m, qr->elements[i]))
478 queue_push(workq, qr->elements[i]);
479 for (i = 0; i < qp->count; i++)
480 if (!MAPTST(m, qp->elements[i]))
481 queue_push(workq, qp->elements[i]);
482 if (solv->installed && s->repo == solv->installed)
484 Repo *installed = solv->installed;
485 /* record installed buddies */
486 if (!solv->instbuddy)
487 solv->instbuddy = solv_calloc(installed->end - installed->start, sizeof(Id));
489 solv->instbuddy[s - pool->solvables - installed->start] = qr->elements[0];
490 for (i = 0; i < qr->count; i++)
492 Id p = qr->elements[i];
493 if (pool->solvables[p].repo != installed)
495 if (qp->count > 1 || (solv->instbuddy[p - installed->start] != 0 && solv->instbuddy[p - installed->start] != s - pool->solvables))
496 solv->instbuddy[p - installed->start] = 1; /* 1: ambiguous buddy */
498 solv->instbuddy[p - installed->start] = s - pool->solvables;
504 add_package_link(Solver *solv, Solvable *s, Map *m, Queue *workq)
510 find_package_link(solv->pool, s, &req, &qr, &prv, &qp);
512 addlinks(solv, s, req, &qr, prv, &qp, m, workq);
519 #ifdef ENABLE_COMPLEX_DEPS
522 add_complex_deprules(Solver *solv, Id p, Id dep, int type, int dontfix, Queue *workq, Map *m)
524 Pool *pool = solv->pool;
525 Repo *installed = solv->installed;
530 flags = dontfix ? CPLXDEPS_DONTFIX : 0;
531 /* CNF expansion for requires, DNF + INVERT expansion for conflicts */
532 if (type == SOLVER_RULE_PKG_CONFLICTS)
533 flags |= CPLXDEPS_TODNF | CPLXDEPS_EXPAND | CPLXDEPS_INVERT;
535 i = pool_normalize_complex_dep(pool, dep, &bq, flags);
536 /* handle special cases */
541 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken dependency %s of installed package %s\n", pool_dep2str(pool, dep), pool_solvid2str(pool, p));
545 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvid2str(pool, p), p, pool_dep2str(pool, dep));
546 addpkgrule(solv, -p, 0, 0, type == SOLVER_RULE_PKG_REQUIRES ? SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP : type, dep);
557 /* go through all blocks and add a rule for each block */
558 for (i = 0; i < bq.count; i++)
562 if (bq.elements[i] == pool->nsolvables)
564 /* conventional requires (cannot be a conflicts as they have been expanded) */
565 Id *dp = pool->whatprovidesdata + bq.elements[i + 1];
569 for (j = 0; dp[j] != 0; j++)
570 if (pool->solvables[dp[j]].repo == installed)
571 break; /* provider was installed */
575 /* check if the rule contains both p and -p */
576 for (j = 0; dp[j] != 0; j++)
581 addpkgrule(solv, -p, 0, dp - pool->whatprovidesdata, SOLVER_RULE_PKG_REQUIRES, dep);
582 /* push all non-visited providers on the work queue */
586 queue_push(workq, *dp);
589 if (!bq.elements[i + 1])
591 Id p2 = bq.elements[i++];
592 /* simple rule with just two literals, we'll add a (-p, p2) rule */
595 if (p2 < 0 && pool->solvables[-p2].repo == installed)
597 if (p2 > 0 && pool->solvables[p2].repo != installed)
602 if (type == SOLVER_RULE_PKG_CONFLICTS)
604 if (pool->forbidselfconflicts && !is_otherproviders_dep(pool, dep))
605 addpkgrule(solv, -p, 0, 0, SOLVER_RULE_PKG_SELF_CONFLICT, dep);
608 addpkgrule(solv, -p, 0, 0, type, dep);
611 /* check if the rule contains both p and -p */
614 addpkgrule(solv, -p, p2, 0, type, dep);
615 if (m && p2 > 0 && !MAPTST(m, p2))
616 queue_push(workq, p2);
623 qele = bq.elements + i;
625 while (bq.elements[i])
630 for (j = 0; j < qcnt; j++)
632 if (qele[j] > 0 && pool->solvables[qele[j]].repo == installed)
634 if (qele[j] < 0 && pool->solvables[-qele[j]].repo != installed)
640 /* add -p to (ordered) rule (overwriting the trailing zero) */
643 if (j == qcnt || qele[j] > -p)
646 memmove(qele + j + 1, qele + j, (qcnt - j) * sizeof(Id));
654 /* check if the rule contains both p and -p */
655 for (j = 0; j < qcnt; j++)
660 addpkgrule(solv, qele[0], 0, pool_ids2whatprovides(pool, qele + 1, qcnt - 1), type, dep);
662 for (j = 0; j < qcnt; j++)
663 if (qele[j] > 0 && !MAPTST(m, qele[j]))
664 queue_push(workq, qele[j]);
672 /*-------------------------------------------------------------------
674 * add dependency rules for solvable
676 * s: Solvable for which to add rules
677 * m: m[s] = 1 for solvables which have rules, prevent rule duplication
679 * Algorithm: 'visit all nodes of a graph'. The graph nodes are
680 * solvables, the edges their dependencies.
681 * Starting from an installed solvable, this will create all rules
682 * representing the graph created by the solvables dependencies.
684 * for unfulfilled requirements, conflicts, obsoletes,....
685 * add a negative assertion for solvables that are not installable
687 * It will also create rules for all solvables referenced by 's'
688 * i.e. descend to all providers of requirements of 's'
693 solver_addpkgrulesforsolvable(Solver *solv, Solvable *s, Map *m)
695 Pool *pool = solv->pool;
696 Repo *installed = solv->installed;
698 Queue workq; /* list of solvables we still have to work on */
700 Queue prereqq; /* list of pre-req ids to ignore */
704 int dontfix; /* ignore dependency errors for installed solvables */
710 Id p, pp; /* whatprovides loops */
711 Id *dp; /* ptr to 'whatprovides' */
712 Id n; /* Id for current solvable 's' */
714 queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
715 queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
717 queue_init_buffer(&prereqq, prereqbuf, sizeof(prereqbuf)/sizeof(*prereqbuf));
719 /* loop until there's no more work left */
724 * s: Pointer to solvable
727 n = queue_shift(&workq); /* 'pop' next solvable to work on from queue */
730 if (MAPTST(m, n)) /* continue if already visited */
732 MAPSET(m, n); /* mark as visited */
735 s = pool->solvables + n;
738 if (installed /* Installed system available */
739 && s->repo == installed /* solvable is installed */
740 && !solv->fixmap_all /* NOT repair errors in dependency graph */
741 && !(solv->fixmap.size && MAPTST(&solv->fixmap, n - installed->start)))
743 dontfix = 1; /* dont care about broken deps */
748 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC
749 ? pool_disabled_solvable(pool, s)
750 : !pool_installable(pool, s))
752 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", pool_solvid2str(pool, n), n);
753 addpkgrule(solv, -n, 0, 0, SOLVER_RULE_PKG_NOT_INSTALLABLE, 0);
757 #ifdef ENABLE_LINKED_PKGS
758 /* add pseudo-package <-> real-package links */
759 if (has_package_link(pool, s))
760 add_package_link(solv, s, m, &workq);
763 /*-----------------------------------------
764 * check requires of s
770 reqp = s->repo->idarraydata + s->requires;
771 while ((req = *reqp++) != 0) /* go through all requires */
773 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
775 if (installed && s->repo == installed)
778 queue_empty(&prereqq);
779 solvable_lookup_idarray(s, SOLVABLE_PREREQ_IGNOREINST, &prereqq);
780 filterpre = prereqq.count;
786 /* check if this id is filtered. assumes that prereqq.count is small */
787 for (i = 0; i < prereqq.count; i++)
788 if (req == prereqq.elements[i])
790 if (i < prereqq.count)
792 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s: ignoring filtered pre-req dependency %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
797 #ifdef ENABLE_COMPLEX_DEPS
798 if (pool_is_complex_dep(pool, req))
800 /* we have AND/COND deps, normalize */
801 add_complex_deprules(solv, n, req, SOLVER_RULE_PKG_REQUIRES, dontfix, &workq, m);
806 /* find list of solvables providing 'req' */
807 dp = pool_whatprovides_ptr(pool, req);
809 if (*dp == SYSTEMSOLVABLE) /* always installed */
814 /* the strategy here is to not insist on dependencies
815 * that are already broken. so if we find one provider
816 * that was already installed, we know that the
817 * dependency was not broken before so we enforce it */
818 for (i = 0; (p = dp[i]) != 0; i++)
819 if (pool->solvables[p].repo == installed)
820 break; /* found installed provider */
823 /* didn't find an installed provider: previously broken dependency */
824 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s));
831 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvid2str(pool, n), n, pool_dep2str(pool, req));
832 addpkgrule(solv, -n, 0, 0, SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP, req);
836 for (i = 0; dp[i] != 0; i++)
840 continue; /* provided by itself, no need to add rule */
842 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
844 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION," %s requires %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
845 for (i = 0; dp[i]; i++)
846 POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, " provided by %s\n", pool_solvid2str(pool, dp[i]));
849 /* add 'requires' dependency */
850 /* rule: (-requestor|provider1|provider2|...|providerN) */
851 addpkgrule(solv, -n, 0, dp - pool->whatprovidesdata, SOLVER_RULE_PKG_REQUIRES, req);
853 /* push all non-visited providers on the work queue */
857 queue_push(&workq, *dp);
861 /* that's all we check for src packages */
862 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
865 /*-----------------------------------------
866 * check conflicts of s
873 /* we treat conflicts in patches a bit differen:
875 * - multiversion handling
876 * XXX: we should really handle this different, looking
877 * at the name is a bad hack
879 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
881 conp = s->repo->idarraydata + s->conflicts;
882 /* foreach conflicts of 's' */
883 while ((con = *conp++) != 0)
885 #ifdef ENABLE_COMPLEX_DEPS
886 if (!ispatch && pool_is_complex_dep(pool, con))
888 /* we have AND/COND deps, normalize */
889 add_complex_deprules(solv, n, con, SOLVER_RULE_PKG_CONFLICTS, dontfix, &workq, m);
893 /* foreach providers of a conflict of 's' */
894 FOR_PROVIDES(p, pp, con)
896 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
898 /* dontfix: dont care about conflicts with already installed packs */
899 if (dontfix && pool->solvables[p].repo == installed)
901 if (p == n) /* p == n: self conflict */
903 if (!pool->forbidselfconflicts || is_otherproviders_dep(pool, con))
905 addpkgrule(solv, -n, 0, 0, SOLVER_RULE_PKG_SELF_CONFLICT, con);
908 if (ispatch && solv->multiversion.size && MAPTST(&solv->multiversion, p) && ISRELDEP(con))
910 /* our patch conflicts with a multiversion package */
911 Id d = makemultiversionconflict(solv, p, con);
914 addpkgrule(solv, -n, 0, d, SOLVER_RULE_PKG_CONFLICTS, con);
918 if (p == SYSTEMSOLVABLE)
920 /* rule: -n|-p: either solvable _or_ provider of conflict */
921 addpkgrule(solv, -n, -p, 0, SOLVER_RULE_PKG_CONFLICTS, con);
926 /*-----------------------------------------
927 * check obsoletes and implicit obsoletes of a package
928 * if ignoreinstalledsobsoletes is not set, we're also checking
929 * obsoletes of installed packages (like newer rpm versions)
931 if ((!installed || s->repo != installed) || !pool->noinstalledobsoletes)
933 int multi = solv->multiversion.size && MAPTST(&solv->multiversion, n);
934 int isinstalled = (installed && s->repo == installed);
935 if (s->obsoletes && (!multi || solv->keepexplicitobsoletes))
937 obsp = s->repo->idarraydata + s->obsoletes;
938 /* foreach obsoletes */
939 while ((obs = *obsp++) != 0)
941 /* foreach provider of an obsoletes of 's' */
942 FOR_PROVIDES(p, pp, obs)
944 Solvable *ps = pool->solvables + p;
947 if (isinstalled && dontfix && ps->repo == installed)
948 continue; /* don't repair installed/installed problems */
949 if (!pool->obsoleteusesprovides /* obsoletes are matched names, not provides */
950 && !pool_match_nevr(pool, ps, obs))
952 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
954 if (p == SYSTEMSOLVABLE)
957 addpkgrule(solv, -n, -p, 0, SOLVER_RULE_PKG_OBSOLETES, obs);
959 addpkgrule(solv, -n, -p, 0, SOLVER_RULE_PKG_INSTALLED_OBSOLETES, obs);
963 /* check implicit obsoletes
964 * for installed packages we only need to check installed/installed problems (and
965 * only when dontfix is not set), as the others are picked up when looking at the
966 * uninstalled package.
968 if (!isinstalled || !dontfix)
970 FOR_PROVIDES(p, pp, s->name)
972 Solvable *ps = pool->solvables + p;
975 if (isinstalled && ps->repo != installed)
977 /* we still obsolete packages with same nevra, like rpm does */
978 /* (actually, rpm mixes those packages. yuck...) */
979 if (multi && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
981 if (isinstalled || ps->repo != installed)
983 /* also check the installed package for multi-ness */
984 if (MAPTST(&solv->multiversion, p))
987 if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
989 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
991 if (p == SYSTEMSOLVABLE)
993 if (s->name == ps->name)
995 /* optimization: do not add the same-name conflict rule if it was
996 * already added when we looked at the other package.
997 * (this assumes pool_colormatch is symmetric) */
998 if (p && m && ps->repo != installed && MAPTST(m, p) &&
999 (ps->arch != ARCH_SRC && ps->arch != ARCH_NOSRC) &&
1000 !(solv->multiversion.size && MAPTST(&solv->multiversion, p)))
1002 addpkgrule(solv, -n, -p, 0, SOLVER_RULE_PKG_SAME_NAME, 0);
1005 addpkgrule(solv, -n, -p, 0, SOLVER_RULE_PKG_IMPLICIT_OBSOLETES, s->name);
1010 if (m && pool->implicitobsoleteusescolors && (s->arch > pool->lastarch || pool->id2arch[s->arch] != 1))
1012 int a = pool->id2arch[s->arch];
1013 /* check lock-step candidates */
1014 FOR_PROVIDES(p, pp, s->name)
1016 Solvable *ps = pool->solvables + p;
1017 if (s->name != ps->name || s->evr != ps->evr || MAPTST(m, p))
1019 if (ps->arch > pool->lastarch || pool->id2arch[ps->arch] == 1 || pool->id2arch[ps->arch] >= a)
1021 queue_push(&workq, p);
1025 /*-----------------------------------------
1026 * add recommends/suggests to the work queue
1028 if (s->recommends && m)
1030 recp = s->repo->idarraydata + s->recommends;
1031 while ((rec = *recp++) != 0)
1033 #ifdef ENABLE_COMPLEX_DEPS
1034 if (pool_is_complex_dep(pool, rec))
1036 pool_add_pos_literals_complex_dep(pool, rec, &workq, m, 0);
1040 FOR_PROVIDES(p, pp, rec)
1042 queue_push(&workq, p);
1045 if (s->suggests && m)
1047 sugp = s->repo->idarraydata + s->suggests;
1048 while ((sug = *sugp++) != 0)
1050 #ifdef ENABLE_COMPLEX_DEPS
1051 if (pool_is_complex_dep(pool, sug))
1053 pool_add_pos_literals_complex_dep(pool, sug, &workq, m, 0);
1057 FOR_PROVIDES(p, pp, sug)
1059 queue_push(&workq, p);
1063 queue_free(&prereqq);
1067 #ifdef ENABLE_LINKED_PKGS
1069 solver_addpkgrulesforlinked(Solver *solv, Map *m)
1071 Pool *pool = solv->pool;
1077 for (i = 1; i < pool->nsolvables; i++)
1081 s = pool->solvables + i;
1082 if (!s->repo || s->repo == solv->installed)
1084 if (!strchr(pool_id2str(pool, s->name), ':'))
1086 if (!pool_installable(pool, s))
1088 find_package_link(pool, s, 0, &qr, 0, 0);
1091 for (j = 0; j < qr.count; j++)
1092 if (MAPTST(m, qr.elements[j]))
1094 solver_addpkgrulesforsolvable(solv, s, m);
1104 /*-------------------------------------------------------------------
1106 * Add rules for packages possibly selected in by weak dependencies
1108 * m: already added solvables
1112 solver_addpkgrulesforweak(Solver *solv, Map *m)
1114 Pool *pool = solv->pool;
1119 /* foreach solvable in pool */
1120 for (i = n = 1; n < pool->nsolvables; i++, n++)
1122 if (i == pool->nsolvables) /* wrap i */
1124 if (MAPTST(m, i)) /* already added that one */
1127 s = pool->solvables + i;
1130 if (s->repo != pool->installed && !pool_installable(pool, s))
1131 continue; /* only look at installable ones */
1136 /* find possible supplements */
1137 supp = s->repo->idarraydata + s->supplements;
1138 while ((sup = *supp++) != 0)
1139 if (dep_possible(solv, sup, m))
1143 /* if nothing found, check for enhances */
1144 if (!sup && s->enhances)
1146 supp = s->repo->idarraydata + s->enhances;
1147 while ((sup = *supp++) != 0)
1148 if (dep_possible(solv, sup, m))
1151 /* if nothing found, goto next solvables */
1154 solver_addpkgrulesforsolvable(solv, s, m);
1155 n = 0; /* check all solvables again because we added solvables to m */
1160 /*-------------------------------------------------------------------
1162 * add package rules for possible updates
1165 * m: map of already visited solvables
1166 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1170 solver_addpkgrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
1172 Pool *pool = solv->pool;
1174 /* queue and buffer for it */
1178 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1179 /* find update candidates for 's' */
1180 policy_findupdatepackages(solv, s, &qs, allow_all);
1181 /* add rule for 's' if not already done */
1182 if (!MAPTST(m, s - pool->solvables))
1183 solver_addpkgrulesforsolvable(solv, s, m);
1184 /* foreach update candidate, add rule if not already done */
1185 for (i = 0; i < qs.count; i++)
1186 if (!MAPTST(m, qs.elements[i]))
1187 solver_addpkgrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
1192 /***********************************************************************
1194 *** Update/Feature rule part
1196 *** Those rules make sure an installed package isn't silently deleted
1201 dup_maykeepinstalled(Solver *solv, Solvable *s)
1203 Pool *pool = solv->pool;
1206 if (solv->dupmap.size && MAPTST(&solv->dupmap, s - pool->solvables))
1208 /* is installed identical to a good one? */
1209 FOR_PROVIDES(ip, pp, s->name)
1211 Solvable *is = pool->solvables + ip;
1212 if (is->evr != s->evr)
1214 if (solv->dupmap.size)
1216 if (!MAPTST(&solv->dupmap, ip))
1219 else if (is->repo == pool->installed)
1221 if (solvable_identical(s, is))
1229 finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs)
1231 Pool *pool = solv->pool;
1234 policy_findupdatepackages(solv, s, qs, 2);
1237 /* remove installed packages we can't keep */
1238 for (i = j = 0; i < qs->count; i++)
1240 Solvable *ns = pool->solvables + qs->elements[i];
1241 if (ns->repo == pool->installed && !dup_maykeepinstalled(solv, ns))
1243 qs->elements[j++] = qs->elements[i];
1245 queue_truncate(qs, j);
1247 /* check if it is ok to keep the installed package */
1248 if (dup_maykeepinstalled(solv, s))
1249 return s - pool->solvables;
1250 /* nope, it must be some other package */
1251 return -SYSTEMSOLVABLE;
1255 /* add packages from the dup repositories to the update candidates
1256 * this isn't needed for the global dup mode as all packages are
1257 * from dup repos in that case */
1259 addduppackages(Solver *solv, Solvable *s, Queue *qs)
1264 int oldnoupdateprovide = solv->noupdateprovide;
1266 queue_init_buffer(&dupqs, dupqsbuf, sizeof(dupqsbuf)/sizeof(*dupqsbuf));
1267 solv->noupdateprovide = 1;
1268 policy_findupdatepackages(solv, s, &dupqs, 2);
1269 solv->noupdateprovide = oldnoupdateprovide;
1270 for (i = 0; i < dupqs.count; i++)
1272 p = dupqs.elements[i];
1273 if (MAPTST(&solv->dupmap, p))
1274 queue_pushunique(qs, p);
1280 /* stash away the original updaters for multiversion packages. We do this so that
1281 * we can update the package later */
1283 set_specialupdaters(Solver *solv, Solvable *s, Id d)
1285 Repo *installed = solv->installed;
1286 if (!solv->specialupdaters)
1287 solv->specialupdaters = solv_calloc(installed->end - installed->start, sizeof(Id));
1288 solv->specialupdaters[s - solv->pool->solvables - installed->start] = d;
1291 #ifdef ENABLE_LINKED_PKGS
1292 /* Check if this is a linked pseudo package. As it is linked, we do not need an update/feature rule */
1294 is_linked_pseudo_package(Solver *solv, Solvable *s)
1296 Pool *pool = solv->pool;
1297 if (solv->instbuddy && solv->instbuddy[s - pool->solvables - solv->installed->start])
1299 const char *name = pool_id2str(pool, s->name);
1300 if (strncmp(name, "pattern:", 8) == 0 || strncmp(name, "application:", 12) == 0)
1308 solver_addfeaturerule(Solver *solv, Solvable *s)
1310 Pool *pool = solv->pool;
1316 #ifdef ENABLE_LINKED_PKGS
1317 if (is_linked_pseudo_package(solv, s))
1319 solver_addrule(solv, 0, 0, 0); /* no feature rules for those */
1323 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1324 p = s - pool->solvables;
1325 policy_findupdatepackages(solv, s, &qs, 1);
1326 if (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1328 if (!dup_maykeepinstalled(solv, s))
1330 for (i = 0; i < qs.count; i++)
1332 Solvable *ns = pool->solvables + qs.elements[i];
1333 if (ns->repo != pool->installed || dup_maykeepinstalled(solv, ns))
1338 solver_addrule(solv, 0, 0, 0); /* this is an orphan */
1346 Id d = pool_queuetowhatprovides(pool, &qs);
1348 solver_addrule(solv, p, 0, d); /* allow update of s */
1352 Id d = qs.count ? qs.elements[0] : 0;
1354 solver_addrule(solv, p, d, 0); /* allow update of s */
1358 /*-------------------------------------------------------------------
1360 * add rule for update
1361 * (A|A1|A2|A3...) An = update candidates for A
1363 * s = (installed) solvable
1367 solver_addupdaterule(Solver *solv, Solvable *s)
1369 /* installed packages get a special upgrade allowed rule */
1370 Pool *pool = solv->pool;
1377 p = s - pool->solvables;
1378 /* Orphan detection. We cheat by looking at the feature rule, which
1379 * we already calculated */
1380 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1383 #ifdef ENABLE_LINKED_PKGS
1384 if (is_linked_pseudo_package(solv, s))
1386 solver_addrule(solv, 0, 0, 0);
1391 queue_push(&solv->orphaned, s - pool->solvables); /* an orphaned package */
1392 if (solv->keep_orphans && !(solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, s - pool->solvables - solv->installed->start))))
1393 p = s - pool->solvables; /* keep this orphaned package installed */
1394 solver_addrule(solv, p, 0, 0);
1398 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1399 /* find update candidates for 's' */
1400 if (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1401 p = finddistupgradepackages(solv, s, &qs);
1403 policy_findupdatepackages(solv, s, &qs, 0);
1405 if (qs.count && solv->multiversion.size)
1409 for (i = 0; i < qs.count; i++)
1410 if (MAPTST(&solv->multiversion, qs.elements[i]))
1414 /* filter out all multiversion packages as they don't update */
1415 d = pool_queuetowhatprovides(pool, &qs); /* save qs away */
1416 for (j = i; i < qs.count; i++)
1418 if (MAPTST(&solv->multiversion, qs.elements[i]))
1420 Solvable *ps = pool->solvables + qs.elements[i];
1421 /* if keepexplicitobsoletes is set and the name is different,
1422 * we assume that there is an obsoletes. XXX: not 100% correct */
1423 if (solv->keepexplicitobsoletes && ps->name != s->name)
1425 qs.elements[j++] = qs.elements[i];
1428 /* it's ok if they have same nevra */
1429 if (ps->name != s->name || ps->evr != s->evr || ps->arch != s->arch)
1432 qs.elements[j++] = qs.elements[i];
1434 if (j < qs.count) /* filtered at least one package? */
1436 if (j == 0 && p == -SYSTEMSOLVABLE)
1438 /* this is a multiversion orphan */
1439 queue_push(&solv->orphaned, s - pool->solvables);
1440 set_specialupdaters(solv, s, d);
1441 if (solv->keep_orphans && !(solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, s - pool->solvables - solv->installed->start))))
1443 /* we need to keep the orphan */
1445 solver_addrule(solv, s - pool->solvables, 0, 0);
1448 /* we can drop it as long as we update */
1450 j = qs.count; /* force the update */
1452 else if (d && (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, s - pool->solvables - solv->installed->start))))
1454 /* non-orphan multiversion package, set special updaters if we want an update */
1455 set_specialupdaters(solv, s, d);
1459 else if (p != -SYSTEMSOLVABLE)
1461 /* could fallthrough, but then we would do pool_queuetowhatprovides twice */
1463 solver_addrule(solv, s - pool->solvables, 0, d); /* allow update of s */
1468 if (!isorphaned && p == -SYSTEMSOLVABLE && qs.count && solv->dupmap.size)
1469 p = s - pool->solvables; /* let the dup rules sort it out */
1470 if (qs.count && p == -SYSTEMSOLVABLE)
1471 p = queue_shift(&qs);
1474 d = pool_queuetowhatprovides(pool, &qs);
1476 solver_addrule(solv, p, 0, d); /* allow update of s */
1480 d = qs.count ? qs.elements[0] : 0;
1482 solver_addrule(solv, p, d, 0); /* allow update of s */
1487 disableupdaterule(Solver *solv, Id p)
1491 MAPSET(&solv->noupdate, p - solv->installed->start);
1492 r = solv->rules + solv->updaterules + (p - solv->installed->start);
1493 if (r->p && r->d >= 0)
1494 solver_disablerule(solv, r);
1495 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1496 if (r->p && r->d >= 0)
1497 solver_disablerule(solv, r);
1498 if (solv->bestrules_pkg)
1501 ni = solv->bestrules_end - solv->bestrules;
1502 for (i = 0; i < ni; i++)
1503 if (solv->bestrules_pkg[i] == p)
1504 solver_disablerule(solv, solv->rules + solv->bestrules + i);
1509 reenableupdaterule(Solver *solv, Id p)
1511 Pool *pool = solv->pool;
1514 MAPCLR(&solv->noupdate, p - solv->installed->start);
1515 r = solv->rules + solv->updaterules + (p - solv->installed->start);
1520 solver_enablerule(solv, r);
1521 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1523 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1524 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1530 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1531 if (r->p && r->d < 0)
1533 solver_enablerule(solv, r);
1534 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1536 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1537 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1541 if (solv->bestrules_pkg)
1544 ni = solv->bestrules_end - solv->bestrules;
1545 for (i = 0; i < ni; i++)
1546 if (solv->bestrules_pkg[i] == p)
1547 solver_enablerule(solv, solv->rules + solv->bestrules + i);
1552 /***********************************************************************
1554 *** Infarch rule part
1556 *** Infarch rules make sure the solver uses the best architecture of
1557 *** a package if multiple archetectures are available
1562 solver_addinfarchrules(Solver *solv, Map *addedmap)
1564 Pool *pool = solv->pool;
1565 Repo *installed = pool->installed;
1567 Id p, pp, a, aa, bestarch;
1568 Solvable *s, *ps, *bests;
1569 Queue badq, allowedarchs;
1573 queue_init(&allowedarchs);
1575 solv->infarchrules = solv->nrules;
1576 for (i = 1; i < pool->nsolvables; i++)
1578 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1580 s = pool->solvables + i;
1584 queue_empty(&allowedarchs);
1585 FOR_PROVIDES(p, pp, s->name)
1587 ps = pool->solvables + p;
1588 if (ps->name != s->name || !MAPTST(addedmap, p))
1595 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1596 if (a != 1 && installed && ps->repo == installed)
1598 if (!solv->dupmap_all && !(solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1599 queue_pushunique(&allowedarchs, ps->arch); /* also ok to keep this architecture */
1600 continue; /* ignore installed solvables when calculating the best arch */
1602 if (a && a != 1 && (!bestarch || a < bestarch))
1611 /* speed up common case where installed package already has best arch */
1612 if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch)
1613 allowedarchs.count--; /* installed arch is best */
1615 if (allowedarchs.count && pool->implicitobsoleteusescolors && installed && bestarch)
1617 /* need an extra pass for lockstep checking: we only allow to keep an inferior arch
1618 * if the corresponding installed package is not lock-stepped */
1619 queue_empty(&allowedarchs);
1620 FOR_PROVIDES(p, pp, s->name)
1623 ps = pool->solvables + p;
1624 if (ps->name != s->name || ps->repo != installed || !MAPTST(addedmap, p))
1626 if (solv->dupmap_all || (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1629 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1632 queue_pushunique(&allowedarchs, ps->arch); /* strange arch, allow */
1635 if (a == 1 || ((a ^ bestarch) & 0xffff0000) == 0)
1637 /* have installed package with inferior arch, check if lock-stepped */
1638 FOR_PROVIDES(p2, pp2, s->name)
1640 Solvable *s2 = pool->solvables + p2;
1642 if (p2 == p || s2->name != s->name || s2->evr != pool->solvables[p].evr || s2->arch == pool->solvables[p].arch)
1645 a2 = (a2 <= pool->lastarch) ? pool->id2arch[a2] : 0;
1646 if (a2 && (a2 == 1 || ((a2 ^ bestarch) & 0xffff0000) == 0))
1650 queue_pushunique(&allowedarchs, ps->arch);
1654 /* find all bad packages */
1656 FOR_PROVIDES(p, pp, s->name)
1658 ps = pool->solvables + p;
1659 if (ps->name != s->name || !MAPTST(addedmap, p))
1662 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1663 if (a != 1 && bestarch && ((a ^ bestarch) & 0xffff0000) != 0)
1665 if (installed && ps->repo == installed)
1667 if (pool->implicitobsoleteusescolors)
1668 queue_push(&badq, p); /* special lock-step handling, see below */
1669 continue; /* always ok to keep an installed package */
1671 for (j = 0; j < allowedarchs.count; j++)
1673 aa = allowedarchs.elements[j];
1676 aa = (aa <= pool->lastarch) ? pool->id2arch[aa] : 0;
1677 if (aa && ((a ^ aa) & 0xffff0000) == 0)
1678 break; /* compatible */
1680 if (j == allowedarchs.count)
1681 queue_push(&badq, p);
1685 /* block all solvables in the badq! */
1686 for (j = 0; j < badq.count; j++)
1688 p = badq.elements[j];
1690 if (pool->implicitobsoleteusescolors)
1693 int haveinstalled = 0;
1695 FOR_PROVIDES(p2, pp, s->name)
1697 Solvable *s2 = pool->solvables + p2;
1698 if (p2 == p || s2->name != s->name || s2->evr != pool->solvables[p].evr || s2->arch == pool->solvables[p].arch)
1701 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1702 if (a && (a == 1 || ((a ^ bestarch) & 0xffff000) == 0))
1704 queue_push(&lsq, p2);
1705 if (installed && s2->repo == installed)
1709 if (installed && pool->solvables[p].repo == installed && !haveinstalled)
1710 continue; /* installed package not in lock-step */
1713 solver_addrule(solv, -p, lsq.count ? lsq.elements[0] : 0, 0);
1715 solver_addrule(solv, -p, 0, pool_queuetowhatprovides(pool, &lsq));
1720 queue_free(&allowedarchs);
1721 solv->infarchrules_end = solv->nrules;
1725 disableinfarchrule(Solver *solv, Id name)
1727 Pool *pool = solv->pool;
1730 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1732 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1733 solver_disablerule(solv, r);
1738 reenableinfarchrule(Solver *solv, Id name)
1740 Pool *pool = solv->pool;
1743 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1745 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1747 solver_enablerule(solv, r);
1748 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1750 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1751 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1758 /***********************************************************************
1762 *** Dup rules make sure a package is selected from the specified dup
1763 *** repositories if an update candidate is included in one of them.
1768 add_cleandeps_package(Solver *solv, Id p)
1770 if (!solv->cleandeps_updatepkgs)
1772 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
1773 queue_init(solv->cleandeps_updatepkgs);
1775 queue_pushunique(solv->cleandeps_updatepkgs, p);
1779 solver_addtodupmaps(Solver *solv, Id p, Id how, int targeted)
1781 Pool *pool = solv->pool;
1782 Solvable *ps, *s = pool->solvables + p;
1783 Repo *installed = solv->installed;
1784 Id pi, pip, obs, *obsp;
1786 MAPSET(&solv->dupinvolvedmap, p);
1788 MAPSET(&solv->dupmap, p);
1789 FOR_PROVIDES(pi, pip, s->name)
1791 ps = pool->solvables + pi;
1792 if (ps->name != s->name)
1794 MAPSET(&solv->dupinvolvedmap, pi);
1795 if (targeted && ps->repo == installed && solv->obsoletes && solv->obsoletes[pi - installed->start])
1798 for (opp = solv->obsoletes_data + solv->obsoletes[pi - installed->start]; (pi2 = *opp++) != 0;)
1799 if (pool->solvables[pi2].repo != installed)
1800 MAPSET(&solv->dupinvolvedmap, pi2);
1802 if (ps->repo == installed && (how & SOLVER_FORCEBEST) != 0)
1804 if (!solv->bestupdatemap.size)
1805 map_grow(&solv->bestupdatemap, installed->end - installed->start);
1806 MAPSET(&solv->bestupdatemap, pi - installed->start);
1808 if (ps->repo == installed && (how & SOLVER_CLEANDEPS) != 0)
1809 add_cleandeps_package(solv, pi);
1810 if (!targeted && ps->repo != installed)
1811 MAPSET(&solv->dupmap, pi);
1813 if (s->repo == installed && solv->obsoletes && solv->obsoletes[p - installed->start])
1816 for (opp = solv->obsoletes_data + solv->obsoletes[p - installed->start]; (pi = *opp++) != 0;)
1818 ps = pool->solvables + pi;
1819 if (ps->repo == installed)
1821 MAPSET(&solv->dupinvolvedmap, pi);
1823 MAPSET(&solv->dupmap, pi);
1826 if (targeted && s->repo != installed && s->obsoletes)
1828 /* XXX: check obsoletes/provides combination */
1829 obsp = s->repo->idarraydata + s->obsoletes;
1830 while ((obs = *obsp++) != 0)
1832 FOR_PROVIDES(pi, pip, obs)
1834 Solvable *ps = pool->solvables + pi;
1835 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1837 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1839 MAPSET(&solv->dupinvolvedmap, pi);
1840 if (targeted && ps->repo == installed && solv->obsoletes && solv->obsoletes[pi - installed->start])
1843 for (opp = solv->obsoletes_data + solv->obsoletes[pi - installed->start]; (pi2 = *opp++) != 0;)
1844 if (pool->solvables[pi2].repo != installed)
1845 MAPSET(&solv->dupinvolvedmap, pi2);
1847 if (ps->repo == installed && (how & SOLVER_FORCEBEST) != 0)
1849 if (!solv->bestupdatemap.size)
1850 map_grow(&solv->bestupdatemap, installed->end - installed->start);
1851 MAPSET(&solv->bestupdatemap, pi - installed->start);
1853 if (ps->repo == installed && (how & SOLVER_CLEANDEPS) != 0)
1854 add_cleandeps_package(solv, pi);
1861 solver_createdupmaps(Solver *solv)
1863 Queue *job = &solv->job;
1864 Pool *pool = solv->pool;
1865 Repo *installed = solv->installed;
1866 Id select, how, what, p, pp;
1870 map_init(&solv->dupmap, pool->nsolvables);
1871 map_init(&solv->dupinvolvedmap, pool->nsolvables);
1872 for (i = 0; i < job->count; i += 2)
1874 how = job->elements[i];
1875 select = job->elements[i] & SOLVER_SELECTMASK;
1876 what = job->elements[i + 1];
1877 switch (how & SOLVER_JOBMASK)
1879 case SOLVER_DISTUPGRADE:
1880 if (select == SOLVER_SOLVABLE_REPO)
1883 if (what <= 0 || what > pool->nrepos)
1885 repo = pool_id2repo(pool, what);
1888 if (repo != installed && !(how & SOLVER_TARGETED) && solv->noautotarget)
1890 targeted = repo != installed || (how & SOLVER_TARGETED) != 0;
1891 FOR_REPO_SOLVABLES(repo, p, s)
1893 if (repo != installed && !pool_installable(pool, s))
1895 solver_addtodupmaps(solv, p, how, targeted);
1898 else if (select == SOLVER_SOLVABLE_ALL)
1900 FOR_POOL_SOLVABLES(p)
1902 MAPSET(&solv->dupinvolvedmap, p);
1903 if (installed && pool->solvables[p].repo != installed)
1904 MAPSET(&solv->dupmap, p);
1909 targeted = how & SOLVER_TARGETED ? 1 : 0;
1910 if (installed && !targeted && !solv->noautotarget)
1912 FOR_JOB_SELECT(p, pp, select, what)
1913 if (pool->solvables[p].repo == installed)
1917 else if (!installed && !solv->noautotarget)
1919 FOR_JOB_SELECT(p, pp, select, what)
1921 Solvable *s = pool->solvables + p;
1924 if (s->repo != installed && !targeted)
1926 if (s->repo != installed && !pool_installable(pool, s))
1928 solver_addtodupmaps(solv, p, how, targeted);
1936 MAPCLR(&solv->dupinvolvedmap, SYSTEMSOLVABLE);
1940 solver_freedupmaps(Solver *solv)
1942 map_free(&solv->dupmap);
1943 /* we no longer free solv->dupinvolvedmap as we need it in
1944 * policy's priority pruning code. sigh. */
1948 solver_addduprules(Solver *solv, Map *addedmap)
1950 Pool *pool = solv->pool;
1951 Repo *installed = solv->installed;
1957 solv->duprules = solv->nrules;
1958 for (i = 1; i < pool->nsolvables; i++)
1960 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1962 s = pool->solvables + i;
1964 FOR_PROVIDES(p, pp, s->name)
1966 ps = pool->solvables + p;
1967 if (ps->name != s->name || !MAPTST(addedmap, p))
1973 if (!MAPTST(&solv->dupinvolvedmap, p))
1975 if (installed && ps->repo == installed)
1977 if (!solv->updatemap.size)
1978 map_grow(&solv->updatemap, installed->end - installed->start);
1979 MAPSET(&solv->updatemap, p - installed->start);
1980 if (!MAPTST(&solv->dupmap, p))
1983 /* is installed identical to a good one? */
1984 FOR_PROVIDES(ip, ipp, ps->name)
1986 Solvable *is = pool->solvables + ip;
1987 if (!MAPTST(&solv->dupmap, ip))
1989 if (is->evr == ps->evr && solvable_identical(ps, is))
1994 /* ok, found a good one. we may keep this package. */
1995 MAPSET(&solv->dupmap, p); /* for best rules processing */
1998 r = solv->rules + solv->updaterules + (p - installed->start);
2000 r = solv->rules + solv->featurerules + (p - installed->start);
2001 if (r->p && solv->specialupdaters && solv->specialupdaters[p - installed->start])
2003 /* this is a multiversion orphan, we're good if an update is installed */
2004 solver_addrule(solv, -p, 0, solv->specialupdaters[p - installed->start]);
2007 if (!r->p || (r->p == p && !r->d && !r->w2))
2009 /* this is an orphan */
2010 MAPSET(&solv->dupmap, p); /* for best rules processing */
2013 solver_addrule(solv, -p, 0, 0); /* no match, sorry */
2016 else if (!MAPTST(&solv->dupmap, p))
2017 solver_addrule(solv, -p, 0, 0);
2020 solv->duprules_end = solv->nrules;
2025 disableduprule(Solver *solv, Id name)
2027 Pool *pool = solv->pool;
2030 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
2032 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
2033 solver_disablerule(solv, r);
2038 reenableduprule(Solver *solv, Id name)
2040 Pool *pool = solv->pool;
2043 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
2045 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
2047 solver_enablerule(solv, r);
2048 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
2050 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
2051 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
2058 /***********************************************************************
2060 *** Policy rule disabling/reenabling
2062 *** Disable all policy rules that conflict with our jobs. If a job
2063 *** gets disabled later on, reenable the involved policy rules again.
2067 #define DISABLE_UPDATE 1
2068 #define DISABLE_INFARCH 2
2069 #define DISABLE_DUP 3
2072 * add all installed packages that package p obsoletes to Queue q.
2073 * Package p is not installed. Also, we know that if
2074 * solv->keepexplicitobsoletes is not set, p is not in the multiversion map.
2075 * Entries may get added multiple times.
2078 add_obsoletes(Solver *solv, Id p, Queue *q)
2080 Pool *pool = solv->pool;
2081 Repo *installed = solv->installed;
2083 Solvable *s = pool->solvables + p;
2087 if (!solv->keepexplicitobsoletes || !(solv->multiversion.size && MAPTST(&solv->multiversion, p)))
2089 FOR_PROVIDES(p2, pp2, s->name)
2091 Solvable *ps = pool->solvables + p2;
2092 if (ps->repo != installed)
2094 if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
2096 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
2104 obsp = s->repo->idarraydata + s->obsoletes;
2105 while ((obs = *obsp++) != 0)
2106 FOR_PROVIDES(p2, pp2, obs)
2108 Solvable *ps = pool->solvables + p2;
2109 if (ps->repo != installed)
2111 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
2113 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
2123 * Call add_obsoletes and intersect the result with the
2124 * elements in Queue q starting at qstart.
2125 * Assumes that it's the first call if qstart == q->count.
2126 * May use auxillary map m for the intersection process, all
2127 * elements of q starting at qstart must have their bit cleared.
2128 * (This is also true after the function returns.)
2131 intersect_obsoletes(Solver *solv, Id p, Queue *q, int qstart, Map *m)
2134 int qcount = q->count;
2136 add_obsoletes(solv, p, q);
2137 if (qcount == qstart)
2138 return; /* first call */
2139 if (qcount == q->count)
2141 else if (qcount == qstart + 1)
2143 /* easy if there's just one element */
2145 for (i = qcount; i < q->count; i++)
2146 if (q->elements[i] == q->elements[qstart])
2148 j++; /* keep the element */
2152 else if (!m->size && q->count - qstart <= 8)
2154 /* faster than a map most of the time */
2156 for (i = j = qstart; i < qcount; i++)
2158 Id ip = q->elements[i];
2159 for (k = qcount; k < q->count; k++)
2160 if (q->elements[k] == ip)
2162 q->elements[j++] = ip;
2169 /* for the really pathologic cases we use the map */
2170 Repo *installed = solv->installed;
2172 map_init(m, installed->end - installed->start);
2173 for (i = qcount; i < q->count; i++)
2174 MAPSET(m, q->elements[i] - installed->start);
2175 for (i = j = qstart; i < qcount; i++)
2176 if (MAPTST(m, q->elements[i] - installed->start))
2178 MAPCLR(m, q->elements[i] - installed->start);
2179 q->elements[j++] = q->elements[i];
2182 queue_truncate(q, j);
2186 jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
2188 Pool *pool = solv->pool;
2192 int i, j, set, qstart;
2195 installed = solv->installed;
2196 select = how & SOLVER_SELECTMASK;
2197 switch (how & SOLVER_JOBMASK)
2199 case SOLVER_INSTALL:
2200 set = how & SOLVER_SETMASK;
2201 if (!(set & SOLVER_NOAUTOSET))
2203 /* automatically add set bits by analysing the job */
2204 if (select == SOLVER_SOLVABLE_NAME)
2205 set |= SOLVER_SETNAME;
2206 if (select == SOLVER_SOLVABLE)
2207 set |= SOLVER_SETNAME | SOLVER_SETARCH | SOLVER_SETVENDOR | SOLVER_SETREPO | SOLVER_SETEVR;
2208 else if ((select == SOLVER_SOLVABLE_NAME || select == SOLVER_SOLVABLE_PROVIDES) && ISRELDEP(what))
2210 Reldep *rd = GETRELDEP(pool, what);
2211 if (rd->flags == REL_EQ && select == SOLVER_SOLVABLE_NAME)
2213 if (pool->disttype != DISTTYPE_DEB)
2215 const char *rel = strrchr(pool_id2str(pool, rd->evr), '-');
2216 set |= rel ? SOLVER_SETEVR : SOLVER_SETEV;
2219 set |= SOLVER_SETEVR;
2221 if (rd->flags <= 7 && ISRELDEP(rd->name))
2222 rd = GETRELDEP(pool, rd->name);
2223 if (rd->flags == REL_ARCH)
2224 set |= SOLVER_SETARCH;
2228 set &= ~SOLVER_NOAUTOSET;
2231 if ((set & SOLVER_SETARCH) != 0 && solv->infarchrules != solv->infarchrules_end)
2233 if (select == SOLVER_SOLVABLE)
2234 queue_push2(q, DISABLE_INFARCH, pool->solvables[what].name);
2237 int qcnt = q->count;
2238 /* does not work for SOLVER_SOLVABLE_ALL and SOLVER_SOLVABLE_REPO, but
2239 they are not useful for SOLVER_INSTALL jobs anyway */
2240 FOR_JOB_SELECT(p, pp, select, what)
2242 s = pool->solvables + p;
2244 for (i = qcnt; i < q->count; i += 2)
2245 if (q->elements[i + 1] == s->name)
2249 queue_push2(q, DISABLE_INFARCH, s->name);
2253 if ((set & SOLVER_SETREPO) != 0 && solv->duprules != solv->duprules_end)
2255 if (select == SOLVER_SOLVABLE)
2256 queue_push2(q, DISABLE_DUP, pool->solvables[what].name);
2259 int qcnt = q->count;
2260 FOR_JOB_SELECT(p, pp, select, what)
2262 s = pool->solvables + p;
2264 for (i = qcnt; i < q->count; i += 2)
2265 if (q->elements[i + 1] == s->name)
2269 queue_push2(q, DISABLE_DUP, s->name);
2273 if (!installed || installed->end == installed->start)
2275 /* now the hard part: disable some update rules */
2277 /* first check if we have multiversion or installed packages in the job */
2279 FOR_JOB_SELECT(p, pp, select, what)
2281 if (pool->solvables[p].repo == installed)
2283 else if (solv->multiversion.size && MAPTST(&solv->multiversion, p) && !solv->keepexplicitobsoletes)
2287 if (j) /* have installed packages */
2289 /* this is for dupmap_all jobs, it can go away if we create
2290 * duprules for them */
2291 if (i == 1 && (set & SOLVER_SETREPO) != 0)
2292 queue_push2(q, DISABLE_UPDATE, j);
2298 FOR_JOB_SELECT(p, pp, select, what)
2300 intersect_obsoletes(solv, p, q, qstart, &omap);
2301 if (q->count == qstart)
2307 if (qstart == q->count)
2308 return; /* nothing to prune */
2310 /* convert result to (DISABLE_UPDATE, p) pairs */
2312 for (j = qstart; j < i; j++)
2313 queue_push(q, q->elements[j]);
2314 for (j = qstart; j < q->count; j += 2)
2316 q->elements[j] = DISABLE_UPDATE;
2317 q->elements[j + 1] = q->elements[i++];
2320 /* now that we know which installed packages are obsoleted check each of them */
2321 if ((set & (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR)) == (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR))
2322 return; /* all is set, nothing to do */
2324 for (i = j = qstart; i < q->count; i += 2)
2326 Solvable *is = pool->solvables + q->elements[i + 1];
2327 FOR_JOB_SELECT(p, pp, select, what)
2330 s = pool->solvables + p;
2331 if ((set & SOLVER_SETEVR) != 0)
2332 illegal |= POLICY_ILLEGAL_DOWNGRADE; /* ignore */
2333 if ((set & SOLVER_SETNAME) != 0)
2334 illegal |= POLICY_ILLEGAL_NAMECHANGE; /* ignore */
2335 if ((set & SOLVER_SETARCH) != 0)
2336 illegal |= POLICY_ILLEGAL_ARCHCHANGE; /* ignore */
2337 if ((set & SOLVER_SETVENDOR) != 0)
2338 illegal |= POLICY_ILLEGAL_VENDORCHANGE; /* ignore */
2339 illegal = policy_is_illegal(solv, is, s, illegal);
2340 if (illegal && illegal == POLICY_ILLEGAL_DOWNGRADE && (set & SOLVER_SETEV) != 0)
2342 /* it's ok if the EV is different */
2343 if (pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE_EVONLY) != 0)
2351 /* no package conflicts with the update rule */
2352 /* thus keep the DISABLE_UPDATE */
2353 q->elements[j + 1] = q->elements[i + 1];
2357 queue_truncate(q, j);
2363 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
2364 FOR_REPO_SOLVABLES(installed, p, s)
2365 queue_push2(q, DISABLE_UPDATE, p);
2366 FOR_JOB_SELECT(p, pp, select, what)
2367 if (pool->solvables[p].repo == installed)
2369 queue_push2(q, DISABLE_UPDATE, p);
2370 #ifdef ENABLE_LINKED_PKGS
2371 if (solv->instbuddy && solv->instbuddy[p - installed->start] > 1)
2372 queue_push2(q, DISABLE_UPDATE, solv->instbuddy[p - installed->start]);
2381 /* disable all policy rules that are in conflict with our job list */
2383 solver_disablepolicyrules(Solver *solv)
2385 Queue *job = &solv->job;
2392 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
2394 for (i = solv->jobrules; i < solv->jobrules_end; i++)
2396 r = solv->rules + i;
2397 if (r->d < 0) /* disabled? */
2399 j = solv->ruletojob.elements[i - solv->jobrules];
2403 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2405 if (solv->cleandepsmap.size)
2407 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
2408 for (i = solv->installed->start; i < solv->installed->end; i++)
2409 if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
2410 queue_push2(&allq, DISABLE_UPDATE, i);
2412 MAPZERO(&solv->noupdate);
2413 for (i = 0; i < allq.count; i += 2)
2415 Id type = allq.elements[i], arg = allq.elements[i + 1];
2418 case DISABLE_UPDATE:
2419 disableupdaterule(solv, arg);
2421 case DISABLE_INFARCH:
2422 disableinfarchrule(solv, arg);
2425 disableduprule(solv, arg);
2434 /* we just disabled job #jobidx, now reenable all policy rules that were
2435 * disabled because of this job */
2437 solver_reenablepolicyrules(Solver *solv, int jobidx)
2439 Queue *job = &solv->job;
2444 Id qbuf[32], allqbuf[32];
2446 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
2447 jobtodisablelist(solv, job->elements[jobidx - 1], job->elements[jobidx], &q);
2453 /* now remove everything from q that is disabled by other jobs */
2455 /* first remove cleandeps packages, they count as DISABLE_UPDATE */
2456 if (solv->cleandepsmap.size)
2458 solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
2459 for (j = k = 0; j < q.count; j += 2)
2461 if (q.elements[j] == DISABLE_UPDATE)
2463 Id p = q.elements[j + 1];
2464 if (p >= solv->installed->start && p < solv->installed->end && MAPTST(&solv->cleandepsmap, p - solv->installed->start))
2465 continue; /* remove element from q */
2467 q.elements[k++] = q.elements[j];
2468 q.elements[k++] = q.elements[j + 1];
2478 /* now go through the disable list of all other jobs */
2479 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
2480 for (i = solv->jobrules; i < solv->jobrules_end; i++)
2482 r = solv->rules + i;
2483 if (r->d < 0) /* disabled? */
2485 j = solv->ruletojob.elements[i - solv->jobrules];
2489 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2492 /* remove all elements in allq from q */
2493 for (j = k = 0; j < q.count; j += 2)
2495 Id type = q.elements[j], arg = q.elements[j + 1];
2496 for (ai = 0; ai < allq.count; ai += 2)
2497 if (allq.elements[ai] == type && allq.elements[ai + 1] == arg)
2499 if (ai < allq.count)
2500 continue; /* found it in allq, remove element from q */
2501 q.elements[k++] = q.elements[j];
2502 q.elements[k++] = q.elements[j + 1];
2515 /* now re-enable anything that's left in q */
2516 for (j = 0; j < q.count; j += 2)
2518 Id type = q.elements[j], arg = q.elements[j + 1];
2521 case DISABLE_UPDATE:
2522 reenableupdaterule(solv, arg);
2524 case DISABLE_INFARCH:
2525 reenableinfarchrule(solv, arg);
2528 reenableduprule(solv, arg);
2535 /* we just removed a package from the cleandeps map, now reenable all policy rules that were
2536 * disabled because of this */
2538 solver_reenablepolicyrules_cleandeps(Solver *solv, Id pkg)
2540 Queue *job = &solv->job;
2547 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
2548 for (i = solv->jobrules; i < solv->jobrules_end; i++)
2550 r = solv->rules + i;
2551 if (r->d < 0) /* disabled? */
2553 j = solv->ruletojob.elements[i - solv->jobrules];
2557 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
2559 for (i = 0; i < allq.count; i += 2)
2560 if (allq.elements[i] == DISABLE_UPDATE && allq.elements[i + 1] == pkg)
2562 if (i == allq.count)
2563 reenableupdaterule(solv, pkg);
2568 /***********************************************************************
2570 *** Rule info part, tell the user what the rule is about.
2575 addpkgruleinfo(Solver *solv, Id p, Id p2, Id d, int type, Id dep)
2577 Pool *pool = solv->pool;
2582 assert(!p2 && d > 0);
2583 if (!pool->whatprovidesdata[d])
2585 else if (!pool->whatprovidesdata[d + 1])
2587 p2 = pool->whatprovidesdata[d];
2592 /* check if this creates the rule we're searching for */
2593 r = solv->rules + solv->ruleinfoq->elements[0];
2596 /* three or more literals */
2597 Id od = r->d < 0 ? -r->d - 1 : r->d;
2598 if (p != r->p && !od)
2602 Id *dp = pool->whatprovidesdata + d;
2603 Id *odp = pool->whatprovidesdata + od;
2605 if (*dp++ != *odp++)
2610 if (p < 0 && pool->whatprovidesdata[d] < 0 && type == SOLVER_RULE_PKG_CONFLICTS)
2611 p2 = pool->whatprovidesdata[d];
2615 /* one or two literals */
2616 Id op = p, op2 = p2;
2617 if (op2 && op > op2) /* normalize */
2623 if (r->p != op || r->w2 != op2 || (r->d && r->d != -1))
2625 if (type == SOLVER_RULE_PKG_CONFLICTS && !p2)
2626 p2 = -SYSTEMSOLVABLE;
2627 if (type == SOLVER_RULE_PKG_SAME_NAME)
2629 p = op; /* we normalize same name order */
2633 /* yep, rule matches. record info */
2634 queue_push(solv->ruleinfoq, type);
2635 queue_push(solv->ruleinfoq, p < 0 ? -p : 0);
2636 queue_push(solv->ruleinfoq, p2 < 0 ? -p2 : 0);
2637 queue_push(solv->ruleinfoq, dep);
2641 solver_allruleinfos_cmp(const void *ap, const void *bp, void *dp)
2643 const Id *a = ap, *b = bp;
2662 getpkgruleinfos(Solver *solv, Rule *r, Queue *rq)
2664 Pool *pool = solv->pool;
2668 queue_push(rq, r - solv->rules); /* push the rule we're interested in */
2669 solv->ruleinfoq = rq;
2670 FOR_RULELITERALS(l, pp, r)
2674 solver_addpkgrulesforsolvable(solv, pool->solvables - l, 0);
2676 #ifdef ENABLE_LINKED_PKGS
2677 FOR_RULELITERALS(l, pp, r)
2685 if (!strchr(pool_id2str(pool, pool->solvables[l].name), ':') || !has_package_link(pool, pool->solvables + l))
2687 add_package_link(solv, pool->solvables + l, 0, 0);
2690 solv->ruleinfoq = 0;
2695 solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
2697 Rule *r = solv->rules + rid;
2701 if (rid <= 0 || rid >= solv->pkgrules_end)
2703 Id type, from, to, dep;
2704 type = solver_ruleinfo(solv, rid, &from, &to, &dep);
2705 queue_push(rq, type);
2706 queue_push(rq, from);
2708 queue_push(rq, dep);
2711 getpkgruleinfos(solv, r, rq);
2712 /* now sort & unify em */
2715 solv_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
2716 /* throw out identical entries */
2717 for (i = j = 0; i < rq->count; i += 4)
2721 if (rq->elements[i] == rq->elements[j - 4] &&
2722 rq->elements[i + 1] == rq->elements[j - 3] &&
2723 rq->elements[i + 2] == rq->elements[j - 2] &&
2724 rq->elements[i + 3] == rq->elements[j - 1])
2727 rq->elements[j++] = rq->elements[i];
2728 rq->elements[j++] = rq->elements[i + 1];
2729 rq->elements[j++] = rq->elements[i + 2];
2730 rq->elements[j++] = rq->elements[i + 3];
2737 solver_ruleinfo(Solver *solv, Id rid, Id *fromp, Id *top, Id *depp)
2739 Pool *pool = solv->pool;
2740 Rule *r = solv->rules + rid;
2741 SolverRuleinfo type = SOLVER_RULE_UNKNOWN;
2749 if (rid > 0 && rid < solv->pkgrules_end)
2755 return SOLVER_RULE_PKG;
2759 getpkgruleinfos(solv, r, &rq);
2760 type = SOLVER_RULE_PKG;
2761 for (i = 0; i < rq.count; i += 4)
2764 qt = rq.elements[i];
2765 qp = rq.elements[i + 1];
2766 qo = rq.elements[i + 2];
2767 qd = rq.elements[i + 3];
2768 if (type == SOLVER_RULE_PKG || type > qt)
2782 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2784 Id jidx = solv->ruletojob.elements[rid - solv->jobrules];
2788 *top = solv->job.elements[jidx];
2790 *depp = solv->job.elements[jidx + 1];
2791 if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE)
2793 Id how = solv->job.elements[jidx];
2794 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLVABLE_NAME))
2795 return SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2796 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES))
2797 return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2798 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVABLE_NAME))
2799 return SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2800 if ((how & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVABLE_PROVIDES))
2801 return SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2802 return SOLVER_RULE_JOB_UNSUPPORTED;
2804 return SOLVER_RULE_JOB;
2806 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2809 *fromp = solv->installed->start + (rid - solv->updaterules);
2810 return SOLVER_RULE_UPDATE;
2812 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2815 *fromp = solv->installed->start + (rid - solv->featurerules);
2816 return SOLVER_RULE_FEATURE;
2818 if (rid >= solv->duprules && rid < solv->duprules_end)
2823 *depp = pool->solvables[-r->p].name;
2824 return SOLVER_RULE_DISTUPGRADE;
2826 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2831 *depp = pool->solvables[-r->p].name;
2832 return SOLVER_RULE_INFARCH;
2834 if (rid >= solv->bestrules && rid < solv->bestrules_end)
2836 if (fromp && solv->bestrules_pkg[rid - solv->bestrules] > 0)
2837 *fromp = solv->bestrules_pkg[rid - solv->bestrules];
2838 return SOLVER_RULE_BEST;
2840 if (rid >= solv->yumobsrules && rid < solv->yumobsrules_end)
2846 /* first solvable is enough, we just need it for the name */
2847 if (!r->d || r->d == -1)
2850 *top = pool->whatprovidesdata[r->d < 0 ? -r->d : r->d];
2853 *depp = solv->yumobsrules_info[rid - solv->yumobsrules];
2854 return SOLVER_RULE_YUMOBS;
2856 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2858 return SOLVER_RULE_CHOICE;
2860 if (rid >= solv->learntrules)
2862 return SOLVER_RULE_LEARNT;
2864 return SOLVER_RULE_UNKNOWN;
2868 solver_ruleclass(Solver *solv, Id rid)
2871 return SOLVER_RULE_UNKNOWN;
2872 if (rid > 0 && rid < solv->pkgrules_end)
2873 return SOLVER_RULE_PKG;
2874 if (rid >= solv->jobrules && rid < solv->jobrules_end)
2875 return SOLVER_RULE_JOB;
2876 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2877 return SOLVER_RULE_UPDATE;
2878 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2879 return SOLVER_RULE_FEATURE;
2880 if (rid >= solv->duprules && rid < solv->duprules_end)
2881 return SOLVER_RULE_DISTUPGRADE;
2882 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2883 return SOLVER_RULE_INFARCH;
2884 if (rid >= solv->bestrules && rid < solv->bestrules_end)
2885 return SOLVER_RULE_BEST;
2886 if (rid >= solv->yumobsrules && rid < solv->yumobsrules_end)
2887 return SOLVER_RULE_YUMOBS;
2888 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2889 return SOLVER_RULE_CHOICE;
2890 if (rid >= solv->learntrules && rid < solv->nrules)
2891 return SOLVER_RULE_LEARNT;
2892 return SOLVER_RULE_UNKNOWN;
2896 solver_ruleliterals(Solver *solv, Id rid, Queue *q)
2898 Pool *pool = solv->pool;
2903 r = solv->rules + rid;
2904 FOR_RULELITERALS(p, pp, r)
2905 if (p != -SYSTEMSOLVABLE)
2908 queue_push(q, -SYSTEMSOLVABLE); /* hmm, better to return an empty result? */
2912 solver_rule2jobidx(Solver *solv, Id rid)
2914 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2916 return solv->ruletojob.elements[rid - solv->jobrules] + 1;
2919 /* job rule introspection */
2921 solver_rule2job(Solver *solv, Id rid, Id *whatp)
2924 if (rid < solv->jobrules || rid >= solv->jobrules_end)
2930 idx = solv->ruletojob.elements[rid - solv->jobrules];
2932 *whatp = solv->job.elements[idx + 1];
2933 return solv->job.elements[idx];
2936 /* update/feature rule introspection */
2938 solver_rule2solvable(Solver *solv, Id rid)
2940 if (rid >= solv->updaterules && rid < solv->updaterules_end)
2941 return rid - solv->updaterules;
2942 if (rid >= solv->featurerules && rid < solv->featurerules_end)
2943 return rid - solv->featurerules;
2948 solver_rule2pkgrule(Solver *solv, Id rid)
2950 if (rid >= solv->choicerules && rid < solv->choicerules_end)
2951 return solv->choicerules_ref[rid - solv->choicerules];
2956 solver_rule2rules_rec(Solver *solv, Id rid, Queue *q, Map *seen)
2963 for (i = solv->learnt_why.elements[rid - solv->learntrules]; (rid2 = solv->learnt_pool.elements[i]) != 0; i++)
2967 if (MAPTST(seen, rid2))
2969 if (rid2 >= solv->learntrules)
2970 solver_rule2rules_rec(solv, rid2, q, seen);
2973 queue_push(q, rid2);
2977 /* learnt rule introspection */
2979 solver_rule2rules(Solver *solv, Id rid, Queue *q, int recursive)
2982 if (rid < solv->learntrules || rid >= solv->nrules)
2987 map_init(&seen, solv->nrules);
2988 solver_rule2rules_rec(solv, rid, q, &seen);
2992 solver_rule2rules_rec(solv, rid, q, 0);
2996 /* check if the newest versions of pi still provides the dependency we're looking for */
2998 solver_choicerulecheck(Solver *solv, Id pi, Rule *r, Map *m, Queue *q)
3000 Pool *pool = solv->pool;
3005 if (!q->count || q->elements[0] != pi)
3009 ur = solv->rules + solv->updaterules + (pi - pool->installed->start);
3011 ur = solv->rules + solv->featurerules + (pi - pool->installed->start);
3014 queue_push2(q, pi, 0);
3015 FOR_RULELITERALS(p, pp, ur)
3024 return MAPTST(m, p) ? 0 : 1;
3026 if (!q->elements[1])
3028 for (i = 2; i < q->count; i++)
3029 if (!MAPTST(m, q->elements[i]))
3032 return 0; /* all provide it, no need to filter */
3033 /* some don't provide it, have to filter */
3034 queue_deleten(q, 0, 2);
3035 policy_filter_unwanted(solv, q, POLICY_MODE_CHOOSE);
3036 queue_unshift(q, 1); /* filter mark */
3037 queue_unshift(q, pi);
3039 for (i = 2; i < q->count; i++)
3040 if (MAPTST(m, q->elements[i]))
3041 return 0; /* at least one provides it */
3042 return 1; /* none of the new packages provided it */
3046 queue_removeelement(Queue *q, Id el)
3049 for (i = 0; i < q->count; i++)
3050 if (q->elements[i] == el)
3054 for (j = i++; i < q->count; i++)
3055 if (q->elements[i] != el)
3056 q->elements[j++] = q->elements[i];
3057 queue_truncate(q, j);
3062 solver_addchoicerules(Solver *solv)
3064 Pool *pool = solv->pool;
3067 Queue q, qi, qcheck;
3068 int i, j, rid, havechoice;
3072 Id lastaddedp, lastaddedd;
3076 solv->choicerules = solv->nrules;
3077 if (!pool->installed)
3079 solv->choicerules_end = solv->nrules;
3082 now = solv_timems(0);
3083 solv->choicerules_ref = solv_calloc(solv->pkgrules_end, sizeof(Id));
3086 queue_init(&qcheck);
3087 map_init(&m, pool->nsolvables);
3088 map_init(&mneg, pool->nsolvables);
3089 /* set up negative assertion map from infarch and dup rules */
3090 for (rid = solv->infarchrules, r = solv->rules + rid; rid < solv->infarchrules_end; rid++, r++)
3091 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
3092 MAPSET(&mneg, -r->p);
3093 for (rid = solv->duprules, r = solv->rules + rid; rid < solv->duprules_end; rid++, r++)
3094 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
3095 MAPSET(&mneg, -r->p);
3099 for (rid = 1; rid < solv->pkgrules_end ; rid++)
3101 r = solv->rules + rid;
3102 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 <= 0))
3103 continue; /* only look at requires rules */
3104 /* solver_printrule(solv, SOLV_DEBUG_RESULT, r); */
3108 FOR_RULELITERALS(p, pp, r)
3112 s = pool->solvables + p;
3115 if (s->repo == pool->installed)
3120 /* check if this package is "blocked" by a installed package */
3122 FOR_PROVIDES(p2, pp2, s->name)
3124 s2 = pool->solvables + p2;
3125 if (s2->repo != pool->installed)
3127 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
3129 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, s2))
3135 /* found installed package p2 that we can update to p */
3136 if (MAPTST(&mneg, p))
3138 if (policy_is_illegal(solv, s2, s, 0))
3141 if (solver_choicerulecheck(solv, p2, r, &m))
3143 queue_push(&qi, p2);
3145 queue_push2(&qi, p2, p);
3152 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
3154 while ((obs = *obsp++) != 0)
3156 FOR_PROVIDES(p2, pp2, obs)
3158 s2 = pool->solvables + p2;
3159 if (s2->repo != pool->installed)
3161 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
3163 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
3172 /* found installed package p2 that we can update to p */
3173 if (MAPTST(&mneg, p))
3175 if (policy_is_illegal(solv, s2, s, 0))
3178 if (solver_choicerulecheck(solv, p2, r, &m))
3180 queue_push(&qi, p2);
3182 queue_push2(&qi, p2, p);
3188 /* package p is independent of the installed ones */
3191 if (!havechoice || !q.count || !qi.count)
3192 continue; /* no choice */
3194 FOR_RULELITERALS(p, pp, r)
3198 /* do extra checking */
3199 for (i = j = 0; i < qi.count; i += 2)
3201 p2 = qi.elements[i];
3204 if (solver_choicerulecheck(solv, p2, r, &m, &qcheck))
3206 /* oops, remove element p from q */
3207 queue_removeelement(&q, qi.elements[i + 1]);
3210 qi.elements[j++] = p2;
3212 queue_truncate(&qi, j);
3214 if (!q.count || !qi.count)
3216 FOR_RULELITERALS(p, pp, r)
3223 /* now check the update rules of the installed package.
3224 * if all packages of the update rules are contained in
3225 * the dependency rules, there's no need to set up the choice rule */
3226 for (i = 0; i < qi.count; i++)
3229 if (!qi.elements[i])
3231 ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
3233 ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
3236 FOR_RULELITERALS(p, pp, ur)
3241 for (j = i + 1; j < qi.count; j++)
3242 if (qi.elements[i] == qi.elements[j])
3245 /* empty map again */
3246 FOR_RULELITERALS(p, pp, r)
3252 printf("skipping choice ");
3253 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
3258 /* don't add identical rules */
3259 if (lastaddedp == r->p && lastaddedcnt == q.count)
3261 for (i = 0; i < q.count; i++)
3262 if (q.elements[i] != pool->whatprovidesdata[lastaddedd + i])
3265 continue; /* already added that one */
3267 d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
3271 lastaddedcnt = q.count;
3273 solver_addrule(solv, r->p, 0, d);
3274 queue_push(&solv->weakruleq, solv->nrules - 1);
3275 solv->choicerules_ref[solv->nrules - 1 - solv->choicerules] = rid;
3278 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
3279 printf("WEAK CHOICE ");
3280 solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + solv->nrules - 1);
3285 queue_free(&qcheck);
3288 solv->choicerules_end = solv->nrules;
3289 /* shrink choicerules_ref */
3290 solv->choicerules_ref = solv_realloc2(solv->choicerules_ref, solv->choicerules_end - solv->choicerules, sizeof(Id));
3291 POOL_DEBUG(SOLV_DEBUG_STATS, "choice rule creation took %d ms\n", solv_timems(now));
3294 /* called when a choice rule is disabled by analyze_unsolvable. We also
3295 * have to disable all other choice rules so that the best packages get
3298 solver_disablechoicerules(Solver *solv, Rule *r)
3301 Pool *pool = solv->pool;
3305 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
3306 map_init(&m, pool->nsolvables);
3307 FOR_RULELITERALS(p, pp, or)
3310 FOR_RULELITERALS(p, pp, r)
3313 for (rid = solv->choicerules; rid < solv->choicerules_end; rid++)
3315 r = solv->rules + rid;
3318 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
3319 FOR_RULELITERALS(p, pp, or)
3320 if (p > 0 && MAPTST(&m, p))
3323 solver_disablerule(solv, r);
3328 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
3332 for (i = j = 0; i < q->count; i++)
3335 for (cp2 = cp; *cp2; cp2++)
3338 q->elements[j++] = p;
3342 queue_truncate(q, j);
3346 prune_to_dup_packages(Solver *solv, Id p, Queue *q)
3349 for (i = j = 0; i < q->count; i++)
3351 Id p = q->elements[i];
3352 if (MAPTST(&solv->dupmap, p))
3353 q->elements[j++] = p;
3355 queue_truncate(q, j);
3359 solver_addbestrules(Solver *solv, int havebestinstalljobs)
3361 Pool *pool = solv->pool;
3364 Repo *installed = solv->installed;
3370 solv->bestrules = solv->nrules;
3373 solv->bestrules_end = solv->nrules;
3380 if (havebestinstalljobs)
3382 for (i = 0; i < solv->job.count; i += 2)
3384 if ((solv->job.elements[i] & (SOLVER_JOBMASK | SOLVER_FORCEBEST)) == (SOLVER_INSTALL | SOLVER_FORCEBEST))
3388 for (j = 0; j < solv->ruletojob.count; j++)
3389 if (solv->ruletojob.elements[j] == i)
3391 if (j == solv->ruletojob.count)
3393 r = solv->rules + solv->jobrules + j;
3395 FOR_RULELITERALS(p2, pp2, r)
3399 continue; /* orphaned */
3400 /* select best packages, just look at prio and version */
3402 policy_filter_unwanted(solv, &q, POLICY_MODE_RECOMMEND);
3403 if (q.count == oldcnt)
3404 continue; /* nothing filtered */
3405 p2 = queue_shift(&q);
3407 solver_addrule(solv, p2, q.count ? q.elements[0] : 0, 0);
3409 solver_addrule(solv, p2, 0, pool_queuetowhatprovides(pool, &q));
3410 queue_push(&r2pkg, -(solv->jobrules + j));
3415 if (solv->bestupdatemap_all || solv->bestupdatemap.size)
3417 FOR_REPO_SOLVABLES(installed, p, s)
3420 if (!solv->updatemap_all && (!solv->updatemap.size || !MAPTST(&solv->updatemap, p - installed->start)))
3422 if (!solv->bestupdatemap_all && (!solv->bestupdatemap.size || !MAPTST(&solv->bestupdatemap, p - installed->start)))
3425 if (solv->bestobeypolicy)
3426 r = solv->rules + solv->updaterules + (p - installed->start);
3429 r = solv->rules + solv->featurerules + (p - installed->start);
3430 if (!r->p) /* identical to update rule? */
3431 r = solv->rules + solv->updaterules + (p - installed->start);
3433 if (solv->specialupdaters && (d = solv->specialupdaters[p - installed->start]) != 0 && r == solv->rules + solv->updaterules + (p - installed->start))
3435 /* need to check specialupdaters */
3436 if (r->p == p) /* be careful with the dup case */
3438 while ((p2 = pool->whatprovidesdata[d++]) != 0)
3443 FOR_RULELITERALS(p2, pp2, r)
3447 if (solv->update_targets && solv->update_targets->elements[p - installed->start])
3448 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q);
3449 if (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
3450 prune_to_dup_packages(solv, p, &q);
3451 /* select best packages, just look at prio and version */
3452 policy_filter_unwanted(solv, &q, POLICY_MODE_RECOMMEND);
3454 continue; /* orphaned */
3455 if (solv->bestobeypolicy)
3457 /* also filter the best of the feature rule packages and add them */
3458 r = solv->rules + solv->featurerules + (p - installed->start);
3463 FOR_RULELITERALS(p2, pp2, r)
3465 queue_push(&q2, p2);
3466 if (solv->update_targets && solv->update_targets->elements[p - installed->start])
3467 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q2);
3468 if (solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
3469 prune_to_dup_packages(solv, p, &q2);
3470 policy_filter_unwanted(solv, &q2, POLICY_MODE_RECOMMEND);
3471 for (j = 0; j < q2.count; j++)
3472 queue_pushunique(&q, q2.elements[j]);
3475 p2 = queue_shift(&q);
3477 solver_addrule(solv, p2, q.count ? q.elements[0] : 0, 0);
3479 solver_addrule(solv, p2, 0, pool_queuetowhatprovides(pool, &q));
3480 queue_push(&r2pkg, p);
3484 solv->bestrules_pkg = solv_memdup2(r2pkg.elements, r2pkg.count, sizeof(Id));
3485 solv->bestrules_end = solv->nrules;
3494 /* yumobs rule handling */
3497 find_obsolete_group(Solver *solv, Id obs, Queue *q)
3499 Pool *pool = solv->pool;
3501 Id p2, pp2, op, *opp, opp2;
3502 int i, j, qnc, ncnt;
3505 FOR_PROVIDES(p2, pp2, obs)
3507 Solvable *s2 = pool->solvables + p2;
3508 if (s2->repo != pool->installed)
3510 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
3512 /* we obsolete installed package s2 with obs. now find all other packages that have the same dep */
3513 for (opp = solv->obsoletes_data + solv->obsoletes[p2 - solv->installed->start]; (op = *opp++) != 0;)
3515 Solvable *os = pool->solvables + op;
3519 if (pool->obsoleteusescolors && !pool_colormatch(pool, s2, os))
3521 obsp2 = os->repo->idarraydata + os->obsoletes;
3522 while ((obs2 = *obsp2++) != 0)
3526 queue_pushunique(q, op);
3528 /* also search packages with the same name */
3529 FOR_PROVIDES(op, opp2, s2->name)
3531 Solvable *os = pool->solvables + op;
3533 if (os->name != s2->name)
3537 if (pool->obsoleteusescolors && !pool_colormatch(pool, s2, os))
3539 obsp2 = os->repo->idarraydata + os->obsoletes;
3540 while ((obs2 = *obsp2++) != 0)
3544 queue_pushunique(q, op);
3547 /* find names so that we can build groups */
3548 queue_init_clone(&qn, q);
3549 prune_to_best_version(solv->pool, &qn);
3552 for (i = 0; i < qn.count; i++)
3553 printf(" + %s\n", pool_solvid2str(pool, qn.elements[i]));
3556 /* filter into name groups */
3565 for (i = 0; i < qnc; i++)
3567 Id n = pool->solvables[qn.elements[i]].name;
3569 for (j = 0; j < q->count; j++)
3571 Id p = q->elements[j];
3572 if (pool->solvables[p].name == n)
3591 queue_insertn(q, 0, qn.count - qnc, qn.elements + qnc);
3597 solver_addyumobsrules(Solver *solv)
3599 Pool *pool = solv->pool;
3600 Repo *installed = solv->installed;
3603 Queue qo, qq, yumobsinfoq;
3607 solv->yumobsrules = solv->nrules;
3608 if (!installed || !solv->obsoletes)
3610 solv->yumobsrules_end = solv->nrules;
3613 now = solv_timems(0);
3615 FOR_REPO_SOLVABLES(installed, p, s)
3617 if (!solv->obsoletes[p - installed->start])
3620 printf("checking yumobs for %s\n", pool_solvable2str(pool, s));
3623 for (opp = solv->obsoletes_data + solv->obsoletes[p - installed->start]; (op = *opp++) != 0;)
3625 Solvable *os = pool->solvables + op;
3626 Id obs, *obsp = os->repo->idarraydata + os->obsoletes;
3628 while ((obs = *obsp++) != 0)
3630 FOR_PROVIDES(p2, pp2, obs)
3632 Solvable *s2 = pool->solvables + p2;
3633 if (s2->repo != installed)
3635 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
3637 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
3639 queue_pushunique(&qo, obs);
3650 queue_init(&yumobsinfoq);
3652 for (i = 0; i < qo.count; i++)
3654 int group, groupk, groupstart;
3657 printf("investigating %s\n", pool_dep2str(pool, qo.elements[i]));
3659 find_obsolete_group(solv, qo.elements[i], &qq);
3661 printf("result:\n");
3662 for (j = 0; j < qq.count; j++)
3663 if (qq.elements[j] == 0)
3666 printf("%s\n", pool_solvid2str(pool, qq.elements[j]));
3671 /* at least two goups, build rules */
3673 for (j = 0; j < qq.count; j++)
3681 if (pool->solvables[p].repo == installed)
3685 for (k = 0; k < qq.count; k++)
3687 Id pk = qq.elements[k];
3690 if (group != groupk && k > groupstart)
3693 if (k - groupstart == 1)
3694 solver_addrule(solv, -p, qq.elements[groupstart], 0);
3696 solver_addrule(solv, -p, 0, pool_ids2whatprovides(pool, qq.elements + groupstart, k - groupstart));
3697 queue_push(&yumobsinfoq, qo.elements[i]);
3704 if (yumobsinfoq.count)
3705 solv->yumobsrules_info = solv_memdup2(yumobsinfoq.elements, yumobsinfoq.count, sizeof(Id));
3706 queue_free(&yumobsinfoq);
3709 solv->yumobsrules_end = solv->nrules;
3710 POOL_DEBUG(SOLV_DEBUG_STATS, "yumobs rule creation took %d ms\n", solv_timems(now));
3713 #undef CLEANDEPSDEBUG
3716 * This functions collects all packages that are looked at
3717 * when a dependency is checked. We need it to "pin" installed
3718 * packages when removing a supplemented package in createcleandepsmap.
3719 * Here's an not uncommon example:
3720 * A contains "Supplements: packageand(B, C)"
3721 * B contains "Requires: A"
3722 * Now if we remove C, the supplements is no longer true,
3723 * thus we also remove A. Without the dep_pkgcheck function, we
3724 * would now also remove B, but this is wrong, as adding back
3725 * C doesn't make the supplements true again. Thus we "pin" B
3727 * There's probably a better way to do this, but I haven't come
3731 dep_pkgcheck(Solver *solv, Id dep, Map *m, Queue *q)
3733 Pool *pool = solv->pool;
3738 Reldep *rd = GETRELDEP(pool, dep);
3741 if (rd->flags == REL_AND)
3743 dep_pkgcheck(solv, rd->name, m, q);
3744 dep_pkgcheck(solv, rd->evr, m, q);
3747 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
3751 FOR_PROVIDES(p, pp, dep)
3752 if (!m || MAPTST(m, p))
3757 check_xsupp(Solver *solv, Queue *depq, Id dep)
3759 Pool *pool = solv->pool;
3764 Reldep *rd = GETRELDEP(pool, dep);
3767 if (rd->flags == REL_AND)
3769 if (!check_xsupp(solv, depq, rd->name))
3771 return check_xsupp(solv, depq, rd->evr);
3773 if (rd->flags == REL_OR)
3775 if (check_xsupp(solv, depq, rd->name))
3777 return check_xsupp(solv, depq, rd->evr);
3779 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
3781 return solver_splitprovides(solv, rd->evr);
3786 if (depq && rd->flags == REL_NAMESPACE)
3789 for (i = 0; i < depq->count; i++)
3790 if (depq->elements[i] == dep || depq->elements[i] == rd->name)
3794 FOR_PROVIDES(p, pp, dep)
3795 if (p == SYSTEMSOLVABLE || pool->solvables[p].repo == solv->installed)
3801 queue_contains(Queue *q, Id id)
3804 for (i = 0; i < q->count; i++)
3805 if (q->elements[i] == id)
3810 #ifdef ENABLE_COMPLEX_DEPS
3812 complex_cleandeps_remove(Pool *pool, Id ip, Id req, Map *im, Map *installedm, Queue *iq)
3819 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
3820 if (i == 0 || i == 1)
3825 for (i = 0; i < dq.count; i++)
3827 for (; (p = dq.elements[i]) != 0; i++)
3831 if (!MAPTST(installedm, -p))
3835 if (p != SYSTEMSOLVABLE && MAPTST(im, p))
3837 #ifdef CLEANDEPSDEBUG
3838 printf("%s requires/recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3843 while (dq.elements[i])
3850 complex_cleandeps_addback(Pool *pool, Id ip, Id req, Map *im, Map *installedm, Queue *iq, Map *userinstalled)
3857 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
3858 if (i == 0 || i == 1)
3863 for (i = 0; i < dq.count; i++)
3866 for (; (p = dq.elements[i]) != 0; i++)
3870 if (!MAPTST(installedm, -p))
3878 for (i = blk; (p = dq.elements[i]) != 0; i++)
3884 if (!MAPTST(installedm, p))
3886 if (p == ip || MAPTST(userinstalled, p - pool->installed->start))
3888 #ifdef CLEANDEPSDEBUG
3889 printf("%s requires/recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
3895 while (dq.elements[i])
3904 * Find all installed packages that are no longer
3905 * needed regarding the current solver job.
3908 * - remove pass: remove all packages that could have
3909 * been dragged in by the obsoleted packages.
3910 * i.e. if package A is obsolete and contains "Requires: B",
3911 * also remove B, as installing A will have pulled in B.
3912 * after this pass, we have a set of still installed packages
3913 * with broken dependencies.
3915 * now add back all packages that the still installed packages
3918 * The cleandeps packages are the packages removed in the first
3919 * pass and not added back in the second pass.
3921 * If we search for unneeded packages (unneeded is true), we
3922 * simply remove all packages except the userinstalled ones in
3926 solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded)
3928 Pool *pool = solv->pool;
3929 Repo *installed = solv->installed;
3930 Queue *job = &solv->job;
3935 Id rid, how, what, select;
3937 Id req, *reqp, sup, *supp;
3939 Queue iq, iqcopy, xsuppq;
3942 map_empty(cleandepsmap);
3943 if (!installed || installed->end == installed->start)
3945 map_init(&userinstalled, installed->end - installed->start);
3946 map_init(&im, pool->nsolvables);
3947 map_init(&installedm, pool->nsolvables);
3949 queue_init(&xsuppq);
3951 for (i = 0; i < job->count; i += 2)
3953 how = job->elements[i];
3954 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
3956 what = job->elements[i + 1];
3957 select = how & SOLVER_SELECTMASK;
3958 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
3959 FOR_REPO_SOLVABLES(installed, p, s)
3960 MAPSET(&userinstalled, p - installed->start);
3961 FOR_JOB_SELECT(p, pp, select, what)
3962 if (pool->solvables[p].repo == installed)
3963 MAPSET(&userinstalled, p - installed->start);
3965 if ((how & (SOLVER_JOBMASK | SOLVER_SELECTMASK)) == (SOLVER_ERASE | SOLVER_SOLVABLE_PROVIDES))
3967 what = job->elements[i + 1];
3970 Reldep *rd = GETRELDEP(pool, what);
3971 if (rd->flags != REL_NAMESPACE)
3975 queue_pushunique(&iq, rd->name);
3978 FOR_PROVIDES(p, pp, what)
3983 queue_pushunique(&iq, what);
3988 /* have special namespace cleandeps erases */
3991 for (ip = installed->start; ip < installed->end; ip++)
3993 s = pool->solvables + ip;
3994 if (s->repo != installed)
3996 if (!s->supplements)
3998 supp = s->repo->idarraydata + s->supplements;
3999 while ((sup = *supp++) != 0)
4000 if (ISRELDEP(sup) && check_xsupp(solv, &iq, sup) && !check_xsupp(solv, 0, sup))
4002 #ifdef CLEANDEPSDEBUG
4003 printf("xsupp %s from %s\n", pool_dep2str(pool, sup), pool_solvid2str(pool, ip));
4005 queue_pushunique(&xsuppq, sup);
4011 /* also add visible patterns to userinstalled for openSUSE */
4015 dataiterator_init(&di, pool, 0, 0, SOLVABLE_ISVISIBLE, 0, 0);
4016 while (dataiterator_step(&di))
4021 s = pool->solvables + di.solvid;
4022 if (!s->repo || !s->requires)
4024 if (s->repo != installed && !pool_installable(pool, s))
4026 if (strncmp(pool_id2str(pool, s->name), "pattern:", 8) != 0)
4028 dp = s->repo->idarraydata + s->requires;
4029 for (dp = s->repo->idarraydata + s->requires; *dp; dp++)
4030 FOR_PROVIDES(p, pp, *dp)
4031 if (pool->solvables[p].repo == installed)
4033 if (strncmp(pool_id2str(pool, pool->solvables[p].name), "pattern", 7) != 0)
4035 MAPSET(&userinstalled, p - installed->start);
4038 dataiterator_free(&di);
4042 /* all products and their buddies are userinstalled */
4043 for (p = installed->start; p < installed->end; p++)
4045 Solvable *s = pool->solvables + p;
4046 if (s->repo != installed)
4048 if (!strncmp("product:", pool_id2str(pool, s->name), 8))
4050 MAPSET(&userinstalled, p - installed->start);
4051 #ifdef ENABLE_LINKED_PKGS
4052 if (solv->instbuddy && solv->instbuddy[p - installed->start] > 1)
4054 Id buddy = solv->instbuddy[p - installed->start];
4055 if (buddy >= installed->start && buddy < installed->end)
4056 MAPSET(&userinstalled, buddy - installed->start);
4063 /* add all positive elements (e.g. locks) to "userinstalled" */
4064 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
4066 r = solv->rules + rid;
4069 i = solv->ruletojob.elements[rid - solv->jobrules];
4070 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
4072 FOR_RULELITERALS(p, jp, r)
4073 if (p > 0 && pool->solvables[p].repo == installed)
4074 MAPSET(&userinstalled, p - installed->start);
4077 /* add all cleandeps candidates to iq */
4078 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
4080 r = solv->rules + rid;
4081 if (r->d < 0) /* disabled? */
4083 if (r->d == 0 && r->p < 0 && r->w2 == 0) /* negative assertion (erase job)? */
4086 if (pool->solvables[p].repo != installed)
4088 MAPCLR(&userinstalled, p - installed->start);
4091 i = solv->ruletojob.elements[rid - solv->jobrules];
4092 how = job->elements[i];
4093 if ((how & (SOLVER_JOBMASK|SOLVER_CLEANDEPS)) == (SOLVER_ERASE|SOLVER_CLEANDEPS))
4096 else if (r->p > 0) /* install job */
4100 i = solv->ruletojob.elements[rid - solv->jobrules];
4101 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
4103 /* check if the literals all obsolete some installed package */
4107 /* just one installed literal */
4108 if (r->d == 0 && r->w2 == 0 && pool->solvables[r->p].repo == installed)
4110 /* multiversion is bad */
4111 if (solv->multiversion.size && !solv->keepexplicitobsoletes)
4113 FOR_RULELITERALS(p, jp, r)
4114 if (MAPTST(&solv->multiversion, p))
4122 FOR_RULELITERALS(p, jp, r)
4126 queue_truncate(&iq, iqstart); /* abort */
4129 if (pool->solvables[p].repo == installed)
4131 if (iq.count == iqstart)
4135 for (i = iqstart; i < iq.count; i++)
4136 if (iq.elements[i] == p)
4138 queue_truncate(&iq, iqstart);
4144 intersect_obsoletes(solv, p, &iq, iqstart, &om);
4145 if (iq.count == iqstart)
4153 queue_init_clone(&iqcopy, &iq);
4157 if (solv->cleandeps_updatepkgs)
4158 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
4159 queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]);
4163 queue_empty(&iq); /* just in case... */
4165 /* clear userinstalled bit for the packages we really want to delete/update */
4166 for (i = 0; i < iq.count; i++)
4169 if (pool->solvables[p].repo != installed)
4171 MAPCLR(&userinstalled, p - installed->start);
4174 for (p = installed->start; p < installed->end; p++)
4176 if (pool->solvables[p].repo != installed)
4178 MAPSET(&installedm, p);
4179 if (unneeded && !MAPTST(&userinstalled, p - installed->start))
4183 MAPSET(&installedm, SYSTEMSOLVABLE);
4184 MAPSET(&im, SYSTEMSOLVABLE);
4186 #ifdef CLEANDEPSDEBUG
4187 printf("REMOVE PASS\n");
4196 /* supplements pass */
4197 for (ip = installed->start; ip < installed->end; ip++)
4199 if (!MAPTST(&installedm, ip))
4201 s = pool->solvables + ip;
4202 if (!s->supplements)
4204 if (!MAPTST(&im, ip))
4206 if (MAPTST(&userinstalled, ip - installed->start))
4208 supp = s->repo->idarraydata + s->supplements;
4209 while ((sup = *supp++) != 0)
4210 if (dep_possible(solv, sup, &im))
4214 supp = s->repo->idarraydata + s->supplements;
4215 while ((sup = *supp++) != 0)
4216 if (dep_possible(solv, sup, &installedm) || (xsuppq.count && queue_contains(&xsuppq, sup)))
4218 /* no longer supplemented, also erase */
4219 int iqcount = iq.count;
4220 /* pin packages, see comment above dep_pkgcheck */
4221 dep_pkgcheck(solv, sup, &im, &iq);
4222 for (i = iqcount; i < iq.count; i++)
4224 Id pqp = iq.elements[i];
4225 if (pool->solvables[pqp].repo == installed)
4226 MAPSET(&userinstalled, pqp - installed->start);
4228 queue_truncate(&iq, iqcount);
4229 #ifdef CLEANDEPSDEBUG
4230 printf("%s supplemented [%s]\n", pool_solvid2str(pool, ip), pool_dep2str(pool, sup));
4232 queue_push(&iq, ip);
4237 break; /* no supplementing package found, we're done */
4239 ip = queue_shift(&iq);
4240 s = pool->solvables + ip;
4241 if (!MAPTST(&im, ip))
4243 if (!MAPTST(&installedm, ip))
4245 if (s->repo == installed && MAPTST(&userinstalled, ip - installed->start))
4248 #ifdef CLEANDEPSDEBUG
4249 printf("removing %s\n", pool_solvable2str(pool, s));
4253 reqp = s->repo->idarraydata + s->requires;
4254 while ((req = *reqp++) != 0)
4256 if (req == SOLVABLE_PREREQMARKER)
4258 #ifdef ENABLE_COMPLEX_DEPS
4259 if (pool_is_complex_dep(pool, req))
4261 complex_cleandeps_remove(pool, ip, req, &im, &installedm, &iq);
4265 FOR_PROVIDES(p, pp, req)
4267 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
4269 #ifdef CLEANDEPSDEBUG
4270 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4279 reqp = s->repo->idarraydata + s->recommends;
4280 while ((req = *reqp++) != 0)
4282 #ifdef ENABLE_COMPLEX_DEPS
4283 if (pool_is_complex_dep(pool, req))
4285 complex_cleandeps_remove(pool, ip, req, &im, &installedm, &iq);
4289 FOR_PROVIDES(p, pp, req)
4291 if (p != SYSTEMSOLVABLE && MAPTST(&im, p))
4293 #ifdef CLEANDEPSDEBUG
4294 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4303 /* turn userinstalled into remove set for pruning */
4304 map_empty(&userinstalled);
4305 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
4307 r = solv->rules + rid;
4308 if (r->p >= 0 || r->d != 0 || r->w2 != 0)
4309 continue; /* disabled or not erase */
4312 if (pool->solvables[p].repo == installed)
4313 MAPSET(&userinstalled, p - installed->start);
4315 if (!unneeded && solv->cleandeps_updatepkgs)
4317 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
4319 p = solv->cleandeps_updatepkgs->elements[i];
4320 if (pool->solvables[p].repo == installed)
4321 MAPSET(&userinstalled, p - installed->start);
4324 MAPSET(&im, SYSTEMSOLVABLE); /* in case we cleared it above */
4325 for (p = installed->start; p < installed->end; p++)
4328 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
4330 r = solv->rules + rid;
4333 FOR_RULELITERALS(p, jp, r)
4337 /* also put directly addressed packages on the install queue
4338 * so we can mark patterns as installed */
4339 for (i = 0; i < job->count; i += 2)
4341 how = job->elements[i];
4342 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
4344 what = job->elements[i + 1];
4345 select = how & SOLVER_SELECTMASK;
4346 if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
4347 queue_push(&iq, what);
4351 #ifdef CLEANDEPSDEBUG
4352 printf("ADDBACK PASS\n");
4358 /* supplements pass */
4359 for (ip = installed->start; ip < installed->end; ip++)
4361 if (!MAPTST(&installedm, ip))
4363 if (MAPTST(&userinstalled, ip - installed->start))
4365 s = pool->solvables + ip;
4366 if (!s->supplements)
4368 if (MAPTST(&im, ip))
4370 supp = s->repo->idarraydata + s->supplements;
4371 while ((sup = *supp++) != 0)
4372 if (dep_possible(solv, sup, &im))
4376 #ifdef CLEANDEPSDEBUG
4377 printf("%s supplemented\n", pool_solvid2str(pool, ip));
4380 queue_push(&iq, ip);
4386 ip = queue_shift(&iq);
4387 s = pool->solvables + ip;
4388 #ifdef CLEANDEPSDEBUG
4389 printf("adding back %s\n", pool_solvable2str(pool, s));
4391 if (s->repo == installed && pool->implicitobsoleteusescolors)
4394 FOR_PROVIDES(p, pp, s->name)
4396 Solvable *ps = pool->solvables + p;
4397 if (ps->name != s->name || ps->repo == installed)
4400 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
4401 if (a && a != 1 && (!bestarch || a < bestarch))
4404 if (bestarch && (s->arch > pool->lastarch || pool->id2arch[s->arch] != bestarch))
4406 FOR_PROVIDES(p, pp, s->name)
4408 Solvable *ps = pool->solvables + p;
4409 if (ps->repo == installed && ps->name == s->name && ps->evr == s->evr && ps->arch != s->arch && ps->arch < pool->lastarch && pool->id2arch[ps->arch] == bestarch)
4410 if (!MAPTST(&im, p))
4412 #ifdef CLEANDEPSDEBUG
4413 printf("%s lockstep %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4423 reqp = s->repo->idarraydata + s->requires;
4424 while ((req = *reqp++) != 0)
4426 #ifdef ENABLE_COMPLEX_DEPS
4427 if (pool_is_complex_dep(pool, req))
4429 complex_cleandeps_addback(pool, ip, req, &im, &installedm, &iq, &userinstalled);
4433 FOR_PROVIDES(p, pp, req)
4438 FOR_PROVIDES(p, pp, req)
4442 if (MAPTST(&installedm, p))
4446 if (MAPTST(&userinstalled, p - installed->start))
4448 #ifdef CLEANDEPSDEBUG
4449 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4459 reqp = s->repo->idarraydata + s->recommends;
4460 while ((req = *reqp++) != 0)
4462 #ifdef ENABLE_COMPLEX_DEPS
4463 if (pool_is_complex_dep(pool, req))
4465 complex_cleandeps_addback(pool, ip, req, &im, &installedm, &iq, &userinstalled);
4469 FOR_PROVIDES(p, pp, req)
4474 FOR_PROVIDES(p, pp, req)
4478 if (MAPTST(&installedm, p))
4482 if (MAPTST(&userinstalled, p - installed->start))
4484 #ifdef CLEANDEPSDEBUG
4485 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
4496 /* make sure the updatepkgs and mistakes are not in the cleandeps map */
4497 if (solv->cleandeps_updatepkgs)
4498 for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
4499 MAPSET(&im, solv->cleandeps_updatepkgs->elements[i]);
4500 if (solv->cleandeps_mistakes)
4501 for (i = 0; i < solv->cleandeps_mistakes->count; i++)
4502 MAPSET(&im, solv->cleandeps_mistakes->elements[i]);
4503 /* also remove original iq packages */
4504 for (i = 0; i < iqcopy.count; i++)
4505 MAPSET(&im, iqcopy.elements[i]);
4506 queue_free(&iqcopy);
4507 for (p = installed->start; p < installed->end; p++)
4509 if (pool->solvables[p].repo != installed)
4511 if (!MAPTST(&im, p))
4512 MAPSET(cleandepsmap, p - installed->start);
4515 map_free(&installedm);
4516 map_free(&userinstalled);
4517 queue_free(&xsuppq);
4518 #ifdef CLEANDEPSDEBUG
4519 printf("=== final cleandeps map:\n");
4520 for (p = installed->start; p < installed->end; p++)
4521 if (MAPTST(cleandepsmap, p - installed->start))
4522 printf(" - %s\n", pool_solvid2str(pool, p));
4535 /* Tarjan's SCC algorithm, slightly modifed */
4537 trj_visit(struct trj_data *trj, Id node)
4540 Queue *edges = trj->edges;
4541 Id nnode, myidx, stackstart;
4544 low[node] = myidx = trj->idx++;
4545 low[(stackstart = trj->nstack++)] = node;
4546 for (i = edges->elements[node]; (nnode = edges->elements[i]) != 0; i++)
4551 if (!edges->elements[edges->elements[nnode]])
4557 trj_visit(trj, nnode);
4562 if (l < trj->firstidx)
4565 for (k = l; low[low[k]] == l; k++)
4568 else if (l < low[node])
4571 if (low[node] == myidx)
4573 if (myidx != trj->firstidx)
4575 for (i = stackstart; i < trj->nstack; i++)
4576 low[low[i]] = myidx;
4577 trj->nstack = stackstart;
4581 #ifdef ENABLE_COMPLEX_DEPS
4583 complex_unneeded(Pool *pool, Id ip, Id req, Queue *edges, Map *cleandepsmap, Queue *unneededq)
4590 i = pool_normalize_complex_dep(pool, req, &dq, CPLXDEPS_EXPAND);
4591 if (i == 0 || i == 1)
4596 for (i = 0; i < dq.count; i++)
4598 for (; (p = dq.elements[i]) != 0; i++)
4602 if (pool->solvables[-p].repo != pool->installed)
4606 if (p == ip || pool->solvables[p].repo != pool->installed || !MAPTST(cleandepsmap, p - pool->installed->start))
4608 for (j = 0; j < unneededq->count; j++)
4609 if (p == unneededq->elements[j])
4611 if (edges->elements[edges->count - 1] != j + 1)
4612 queue_push(edges, j + 1);
4616 while (dq.elements[i])
4624 solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered)
4626 Repo *installed = solv->installed;
4630 queue_empty(unneededq);
4631 if (!installed || installed->end == installed->start)
4634 map_init(&cleandepsmap, installed->end - installed->start);
4635 solver_createcleandepsmap(solv, &cleandepsmap, 1);
4636 for (i = installed->start; i < installed->end; i++)
4637 if (MAPTST(&cleandepsmap, i - installed->start))
4638 queue_push(unneededq, i);
4640 if (filtered && unneededq->count > 1)
4642 Pool *pool = solv->pool;
4646 int j, pass, count = unneededq->count;
4649 map_init(&installedm, pool->nsolvables);
4650 for (i = installed->start; i < installed->end; i++)
4651 if (pool->solvables[i].repo == installed)
4652 MAPSET(&installedm, i);
4654 nrequires = solv_calloc(count, sizeof(Id));
4656 queue_prealloc(&edges, count * 4 + 10); /* pre-size */
4659 * Go through the solvables in the nodes queue and create edges for
4660 * all requires/recommends/supplements between the nodes.
4661 * The edges are stored in the edges queue, we add 1 to the node
4662 * index so that nodes in the edges queue are != 0 and we can
4663 * terminate the edge list with 0.
4664 * Thus for node element 5, the edges are stored starting at
4665 * edges.elements[6] and are 0-terminated.
4667 /* leave first element zero to make things easier */
4668 /* also add trailing zero */
4669 queue_insertn(&edges, 0, 1 + count + 1, 0);
4671 /* first requires and recommends */
4672 for (i = 0; i < count; i++)
4674 Solvable *s = pool->solvables + unneededq->elements[i];
4675 int oldcount = edges.count;
4676 edges.elements[i + 1] = oldcount;
4677 for (pass = 0; pass < 2; pass++)
4679 unsigned int off = pass == 0 ? s->requires : s->recommends;
4682 for (dp = s->repo->idarraydata + off; (dep = *dp) != 0; dp++)
4684 #ifdef ENABLE_COMPLEX_DEPS
4685 if (pool_is_complex_dep(pool, dep))
4687 complex_unneeded(pool, s - pool->solvables, dep, &edges, &cleandepsmap, unneededq);
4691 FOR_PROVIDES(p, pp, dep)
4693 Solvable *sp = pool->solvables + p;
4694 if (s == sp || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
4696 for (j = 0; j < count; j++)
4697 if (p == unneededq->elements[j])
4699 if (edges.elements[edges.count - 1] != j + 1)
4700 queue_push(&edges, j + 1);
4705 nrequires[i] = edges.count - oldcount;
4707 queue_push(&edges, 0);
4710 printf("requires + recommends\n");
4711 for (i = 0; i < count; i++)
4714 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
4715 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
4716 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
4720 /* then add supplements */
4721 for (i = 0; i < count; i++)
4723 Solvable *s = pool->solvables + unneededq->elements[i];
4728 for (dp = s->repo->idarraydata + s->supplements; *dp; dp++)
4729 if (dep_possible(solv, *dp, &installedm))
4733 queue_init_buffer(&iq, iqbuf, sizeof(iqbuf)/sizeof(*iqbuf));
4734 dep_pkgcheck(solv, *dp, 0, &iq);
4735 for (k = 0; k < iq.count; k++)
4737 Id p = iq.elements[k];
4738 Solvable *sp = pool->solvables + p;
4739 if (p == unneededq->elements[i] || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
4741 for (j = 0; j < count; j++)
4742 if (p == unneededq->elements[j])
4744 /* now add edge from j + 1 to i + 1 */
4745 queue_insert(&edges, edges.elements[j + 1] + nrequires[j], i + 1);
4746 /* addapt following edge pointers */
4747 for (j = j + 2; j < count + 1; j++)
4748 edges.elements[j]++;
4756 printf("+ supplements\n");
4757 for (i = 0; i < count; i++)
4760 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
4761 for (j = edges.elements[i + 1]; edges.elements[j]; j++)
4762 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
4765 map_free(&installedm);
4767 /* now run SCC algo two times, first with requires+recommends+supplements,
4768 * then again without the requires. We run it the second time to get rid
4769 * of packages that got dragged in via recommends/supplements */
4771 * low will contain the result of the SCC search.
4772 * it must be of at least size 2 * (count + 1) and
4773 * must be zero initialized.
4775 * 0 low low ... low stack stack ...stack 0
4778 low = solv_calloc(count + 1, 2 * sizeof(Id));
4779 for (pass = 0; pass < 2; pass++)
4781 struct trj_data trj;
4784 memset(low, 0, (count + 1) * (2 * sizeof(Id)));
4785 for (i = 0; i < count; i++)
4787 edges.elements[i + 1] += nrequires[i];
4788 if (!unneededq->elements[i])
4789 low[i + 1] = -1; /* ignore this node */
4794 trj.idx = count + 1; /* stack starts here */
4795 for (i = 1; i <= count; i++)
4799 if (edges.elements[edges.elements[i]])
4801 trj.firstidx = trj.nstack = trj.idx;
4806 Id myidx = trj.idx++;
4811 /* prune packages */
4812 for (i = 0; i < count; i++)
4813 if (low[i + 1] <= 0)
4814 unneededq->elements[i] = 0;
4817 solv_free(nrequires);
4820 /* finally remove all pruned entries from unneededq */
4821 for (i = j = 0; i < count; i++)
4822 if (unneededq->elements[i])
4823 unneededq->elements[j++] = unneededq->elements[i];
4824 queue_truncate(unneededq, j);
4826 map_free(&cleandepsmap);
4831 solver_breakorphans(Solver *solv)
4833 Pool *pool = solv->pool;
4834 Repo *installed = solv->installed;
4838 if (!installed || solv->droporphanedmap_all)
4840 solv->brokenorphanrules = solv_calloc(1, sizeof(Queue));
4841 queue_init(solv->brokenorphanrules);
4842 map_init(&m, installed->end - installed->start);
4843 for (i = 0; i < solv->orphaned.count; i++)
4845 Id p = solv->orphaned.elements[i];
4846 if (pool->solvables[p].repo != installed)
4848 if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - installed->start))
4850 MAPSET(&m, p - installed->start);
4852 for (rid = 1; rid < solv->pkgrules_end ; rid++)
4855 Rule *r = solv->rules + rid;
4856 /* ignore non-deps and simple conflicts */
4857 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 < 0))
4860 if (p < installed->start || p >= installed->end || !MAPTST(&m, p - installed->start))
4862 /* need to check other literals */
4863 if (r->d == 0 || r->d == -1)
4865 for (dp = pool->whatprovidesdata + (r->d < 0 ? -r->d - 1 : r->d); *dp < 0; dp++)
4868 if (p >= installed->start && p < installed->end && MAPTST(&m, p - installed->start))
4874 /* ok, disable this rule */
4875 queue_push(solv->brokenorphanrules, rid);
4877 solver_disablerule(solv, r);
4880 if (!solv->brokenorphanrules->count)
4882 queue_free(solv->brokenorphanrules);
4883 solv->brokenorphanrules = solv_free(solv->brokenorphanrules);
4888 solver_check_brokenorphanrules(Solver *solv, Queue *dq)
4890 Pool *pool = solv->pool;
4895 if (!solv->brokenorphanrules)
4897 for (i = 0; i < solv->brokenorphanrules->count; i++)
4899 int rid = solv->brokenorphanrules->elements[i];
4900 Rule *r = solv->rules + rid;
4901 FOR_RULELITERALS(l, pp, r)
4905 if (solv->decisionmap[-l] <= 0)
4910 if (solv->decisionmap[l] > 0 && pool->solvables[l].repo != solv->installed)
4916 FOR_RULELITERALS(l, pp, r)
4917 if (l > 0 && solv->decisionmap[l] == 0 && pool->solvables[l].repo != solv->installed)
4918 queue_pushunique(dq, l);