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
27 #include "solverdebug.h"
29 #define RULES_BLOCK 63
31 static void addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep);
32 static void solver_createcleandepsmap(Solver *solv);
34 /*-------------------------------------------------------------------
35 * Check if dependency is possible
37 * mirrors solver_dep_fulfilled but uses map m instead of the decisionmap
38 * used in solver_addrpmrulesforweak and solver_createcleandepsmap
42 dep_possible(Solver *solv, Id dep, Map *m)
44 Pool *pool = solv->pool;
49 Reldep *rd = GETRELDEP(pool, dep);
52 if (rd->flags == REL_AND)
54 if (!dep_possible(solv, rd->name, m))
56 return dep_possible(solv, rd->evr, m);
58 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
59 return solver_splitprovides(solv, rd->evr);
60 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
61 return solver_dep_installed(solv, rd->evr);
64 FOR_PROVIDES(p, pp, dep)
72 /********************************************************************
76 * - unify rules, remove duplicates
79 /*-------------------------------------------------------------------
81 * compare rules for unification sort
86 unifyrules_sortcmp(const void *ap, const void *bp, void *dp)
96 return x; /* p differs */
99 if (a->d == 0 && b->d == 0)
100 return a->w2 - b->w2; /* assertion: return w2 diff */
102 if (a->d == 0) /* a is assertion, b not */
104 x = a->w2 - pool->whatprovidesdata[b->d];
108 if (b->d == 0) /* b is assertion, a not */
110 x = pool->whatprovidesdata[a->d] - b->w2;
114 /* compare whatprovidesdata */
115 ad = pool->whatprovidesdata + a->d;
116 bd = pool->whatprovidesdata + b->d;
118 if ((x = *ad++ - *bd++) != 0)
124 solver_samerule(Solver *solv, Rule *r1, Rule *r2)
126 return unifyrules_sortcmp(r1, r2, solv->pool);
130 /*-------------------------------------------------------------------
133 * go over all rules and remove duplicates
137 solver_unifyrules(Solver *solv)
139 Pool *pool = solv->pool;
143 if (solv->nrules <= 2) /* nothing to unify */
146 /* sort rules first */
147 sat_sort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp, solv->pool);
154 for (i = j = 1, ir = solv->rules + i; i < solv->nrules; i++, ir++)
156 if (jr && !unifyrules_sortcmp(ir, jr, pool))
157 continue; /* prune! */
158 jr = solv->rules + j++; /* keep! */
163 /* reduced count from nrules to j rules */
164 POOL_DEBUG(SAT_DEBUG_STATS, "pruned rules from %d to %d\n", solv->nrules, j);
166 /* adapt rule buffer */
168 solv->rules = sat_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
171 * debug: log rule statistics
173 IF_POOLDEBUG (SAT_DEBUG_STATS)
180 for (i = 1; i < solv->nrules; i++)
187 dp = solv->pool->whatprovidesdata + r->d;
192 POOL_DEBUG(SAT_DEBUG_STATS, " binary: %d\n", binr);
193 POOL_DEBUG(SAT_DEBUG_STATS, " normal: %d, %d literals\n", solv->nrules - 1 - binr, lits);
204 hashrule(Solver *solv, Id p, Id d, int n)
206 unsigned int x = (unsigned int)p;
210 return (x * 37) ^ (unsigned int)d;
211 dp = solv->pool->whatprovidesdata + d;
213 x = (x * 37) ^ (unsigned int)*dp++;
219 /*-------------------------------------------------------------------
225 * p = direct literal; always < 0 for installed rpm rules
226 * d, if < 0 direct literal, if > 0 offset into whatprovides, if == 0 rule is assertion (look at p only)
229 * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
231 * p < 0 : pkg id of A
232 * d > 0 : Offset in whatprovidesdata (list of providers of b)
234 * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
235 * p < 0 : pkg id of A
236 * d < 0 : Id of solvable (e.g. B1)
238 * d == 0: unary rule, assertion => (A) or (-A)
240 * Install: p > 0, d = 0 (A) user requested install
241 * Remove: p < 0, d = 0 (-A) user requested remove (also: uninstallable)
242 * Requires: p < 0, d > 0 (-A|B1|B2|...) d: <list of providers for requirement of p>
243 * Updates: p > 0, d > 0 (A|B1|B2|...) d: <list of updates for solvable p>
244 * Conflicts: p < 0, d < 0 (-A|-B) either p (conflict issuer) or d (conflict provider) (binary rule)
245 * also used for obsoletes
246 * ?: p > 0, d < 0 (A|-B)
247 * No-op ?: p = 0, d = 0 (null) (used as policy rule placeholder)
251 * Direct assertion (no watch needed) --> d = 0, w1 = p, w2 = 0
252 * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
253 * every other : w1 = p, w2 = whatprovidesdata[d];
254 * Disabled rule: w1 = 0
256 * always returns a rule for non-rpm rules
260 solver_addrule(Solver *solv, Id p, Id d)
262 Pool *pool = solv->pool;
266 int n = 0; /* number of literals in rule - 1
267 0 = direct assertion (single literal)
272 /* it often happenes that requires lead to adding the same rpm rule
273 * multiple times, so we prune those duplicates right away to make
274 * the work for unifyrules a bit easier */
276 if (!solv->rpmrules_end) /* we add rpm rules */
278 r = solv->rules + solv->nrules - 1; /* get the last added rule */
279 if (r->p == p && r->d == d && (d != 0 || !r->w2))
284 * compute number of literals (n) in rule
289 /* always a binary rule */
291 return 0; /* ignore self conflict */
296 for (dp = pool->whatprovidesdata + d; *dp; dp++, n++)
298 return 0; /* rule is self-fulfilling */
300 if (n == 1) /* convert to binary rule */
304 if (n == 1 && p > d && !solv->rpmrules_end)
306 /* smallest literal first so we can find dups */
307 n = p; p = d; d = n; /* p <-> d */
308 n = 1; /* re-set n, was used as temp var */
312 * check for duplicate
315 /* check if the last added rule (r) is exactly the same as what we're looking for. */
316 if (r && n == 1 && !r->d && r->p == p && r->w2 == d)
317 return r; /* binary rule */
319 /* have n-ary rule with same first literal, check other literals */
320 if (r && n > 1 && r->d && r->p == p)
322 /* Rule where d is an offset in whatprovidesdata */
326 dp2 = pool->whatprovidesdata + r->d;
327 for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
338 /* extend rule buffer */
339 solv->rules = sat_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
340 r = solv->rules + solv->nrules++; /* point to rule space */
349 /* direct assertion, no watch needed */
365 r->w2 = pool->whatprovidesdata[d];
370 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
372 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, " Add rule: ");
373 solver_printrule(solv, SAT_DEBUG_RULE_CREATION, r);
380 /******************************************************************************
382 *** rpm rule part: create rules representing the package dependencies
387 * special multiversion patch conflict handling:
388 * a patch conflict is also satisfied if some other
389 * version with the same name/arch that doesn't conflict
390 * gets installed. The generated rule is thus:
391 * -patch|-cpack|opack1|opack2|...
394 makemultiversionconflict(Solver *solv, Id n, Id con)
396 Pool *pool = solv->pool;
401 sn = pool->solvables + n;
402 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
404 FOR_PROVIDES(p, pp, sn->name)
406 s = pool->solvables + p;
407 if (s->name != sn->name || s->arch != sn->arch)
409 if (!MAPTST(&solv->noobsoletes, p))
411 if (pool_match_nevr(pool, pool->solvables + p, con))
413 /* here we have a multiversion solvable that doesn't conflict */
414 /* thus we're not in conflict if it is installed */
418 return -n; /* no other package found, generate normal conflict */
419 return pool_queuetowhatprovides(pool, &q);
423 addrpmrule(Solver *solv, Id p, Id d, int type, Id dep)
425 if (!solv->ruleinfoq)
426 solver_addrule(solv, p, d);
428 addrpmruleinfo(solv, p, d, type, dep);
431 /*-------------------------------------------------------------------
433 * add (install) rules for solvable
435 * s: Solvable for which to add rules
436 * m: m[s] = 1 for solvables which have rules, prevent rule duplication
438 * Algorithm: 'visit all nodes of a graph'. The graph nodes are
439 * solvables, the edges their dependencies.
440 * Starting from an installed solvable, this will create all rules
441 * representing the graph created by the solvables dependencies.
443 * for unfulfilled requirements, conflicts, obsoletes,....
444 * add a negative assertion for solvables that are not installable
446 * It will also create rules for all solvables referenced by 's'
447 * i.e. descend to all providers of requirements of 's'
452 solver_addrpmrulesforsolvable(Solver *solv, Solvable *s, Map *m)
454 Pool *pool = solv->pool;
455 Repo *installed = solv->installed;
457 /* 'work' queue. keeps Ids of solvables we still have to work on.
458 And buffer for it. */
463 /* if to add rules for broken deps ('rpm -V' functionality)
467 /* Id var and pointer for each dependency
468 * (not used in parallel)
475 Id p, pp; /* whatprovides loops */
476 Id *dp; /* ptr to 'whatprovides' */
477 Id n; /* Id for current solvable 's' */
479 queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
480 queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
482 /* loop until there's no more work left */
487 * s: Pointer to solvable
490 n = queue_shift(&workq); /* 'pop' next solvable to work on from queue */
493 if (MAPTST(m, n)) /* continue if already visited */
495 MAPSET(m, n); /* mark as visited */
498 s = pool->solvables + n; /* s = Solvable in question */
501 if (installed /* Installed system available */
502 && s->repo == installed /* solvable is installed */
503 && !solv->fixmap_all /* NOT repair errors in rpm dependency graph */
504 && !(solv->fixmap.size && MAPTST(&solv->fixmap, n - installed->start)))
506 dontfix = 1; /* dont care about broken rpm deps */
510 && s->arch != ARCH_SRC
511 && s->arch != ARCH_NOSRC
512 && !pool_installable(pool, s))
514 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables));
515 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOT_INSTALLABLE, 0);
518 /* yet another SUSE hack, sigh */
519 if (pool->nscallback && !strncmp("product:", pool_id2str(pool, s->name), 8))
521 Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, n);
522 if (buddy > 0 && buddy != SYSTEMSOLVABLE && buddy != n && buddy < pool->nsolvables)
524 addrpmrule(solv, n, -buddy, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + n));
525 addrpmrule(solv, buddy, -n, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + buddy));
526 if (m && !MAPTST(m, buddy))
527 queue_push(&workq, buddy);
531 /*-----------------------------------------
532 * check requires of s
537 reqp = s->repo->idarraydata + s->requires;
538 while ((req = *reqp++) != 0) /* go through all requires */
540 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
543 /* find list of solvables providing 'req' */
544 dp = pool_whatprovides_ptr(pool, req);
546 if (*dp == SYSTEMSOLVABLE) /* always installed */
551 /* the strategy here is to not insist on dependencies
552 * that are already broken. so if we find one provider
553 * that was already installed, we know that the
554 * dependency was not broken before so we enforce it */
556 /* check if any of the providers for 'req' is installed */
557 for (i = 0; (p = dp[i]) != 0; i++)
559 if (pool->solvables[p].repo == installed)
560 break; /* provider was installed */
562 /* didn't find an installed provider: previously broken dependency */
565 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s));
572 /* nothing provides req! */
573 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables), pool_dep2str(pool, req));
574 addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP, req);
578 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
580 POOL_DEBUG(SAT_DEBUG_RULE_CREATION," %s requires %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
581 for (i = 0; dp[i]; i++)
582 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, " provided by %s\n", pool_solvid2str(pool, dp[i]));
585 /* add 'requires' dependency */
586 /* rule: (-requestor|provider1|provider2|...|providerN) */
587 addrpmrule(solv, -n, dp - pool->whatprovidesdata, SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
589 /* descend the dependency tree
590 push all non-visited providers on the work queue */
596 queue_push(&workq, *dp);
600 } /* while, requirements of n */
602 } /* if, requirements */
604 /* that's all we check for src packages */
605 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
608 /*-----------------------------------------
609 * check conflicts of s
616 /* we treat conflicts in patches a bit differen:
618 * - multiversion handling
619 * XXX: we should really handle this different, looking
620 * at the name is a bad hack
622 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
624 conp = s->repo->idarraydata + s->conflicts;
625 /* foreach conflicts of 's' */
626 while ((con = *conp++) != 0)
628 /* foreach providers of a conflict of 's' */
629 FOR_PROVIDES(p, pp, con)
631 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
633 /* dontfix: dont care about conflicts with already installed packs */
634 if (dontfix && pool->solvables[p].repo == installed)
636 /* p == n: self conflict */
637 if (p == n && !pool->allowselfconflicts)
641 Reldep *rd = GETRELDEP(pool, con);
642 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
645 p = 0; /* make it a negative assertion, aka 'uninstallable' */
647 if (p && ispatch && solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p) && ISRELDEP(con))
649 /* our patch conflicts with a noobsoletes (aka multiversion) package */
650 p = -makemultiversionconflict(solv, p, con);
652 /* rule: -n|-p: either solvable _or_ provider of conflict */
653 addrpmrule(solv, -n, -p, p ? SOLVER_RULE_RPM_PACKAGE_CONFLICT : SOLVER_RULE_RPM_SELF_CONFLICT, con);
658 /*-----------------------------------------
659 * check obsoletes and implicit obsoletes of a package
660 * if ignoreinstalledsobsoletes is not set, we're also checking
661 * obsoletes of installed packages (like newer rpm versions)
663 if ((!installed || s->repo != installed) || !pool->noinstalledobsoletes)
665 int noobs = solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n);
666 int isinstalled = (installed && s->repo == installed);
667 if (s->obsoletes && !noobs)
669 obsp = s->repo->idarraydata + s->obsoletes;
670 /* foreach obsoletes */
671 while ((obs = *obsp++) != 0)
673 /* foreach provider of an obsoletes of 's' */
674 FOR_PROVIDES(p, pp, obs)
676 Solvable *ps = pool->solvables + p;
679 if (isinstalled && dontfix && ps->repo == installed)
680 continue; /* don't repair installed/installed problems */
681 if (!pool->obsoleteusesprovides /* obsoletes are matched names, not provides */
682 && !pool_match_nevr(pool, ps, obs))
684 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
687 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_PACKAGE_OBSOLETES, obs);
689 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES, obs);
693 /* check implicit obsoletes
694 * for installed packages we only need to check installed/installed problems (and
695 * only when dontfix is not set), as the others are picked up when looking at the
696 * uninstalled package.
698 if (!isinstalled || !dontfix)
700 FOR_PROVIDES(p, pp, s->name)
702 Solvable *ps = pool->solvables + p;
705 if (isinstalled && ps->repo != installed)
707 /* we still obsolete packages with same nevra, like rpm does */
708 /* (actually, rpm mixes those packages. yuck...) */
709 if (noobs && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
711 if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
713 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
715 if (s->name == ps->name)
716 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_SAME_NAME, 0);
718 addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_IMPLICIT_OBSOLETES, s->name);
723 /*-----------------------------------------
724 * add recommends to the work queue
726 if (s->recommends && m)
728 recp = s->repo->idarraydata + s->recommends;
729 while ((rec = *recp++) != 0)
731 FOR_PROVIDES(p, pp, rec)
733 queue_push(&workq, p);
736 if (s->suggests && m)
738 sugp = s->repo->idarraydata + s->suggests;
739 while ((sug = *sugp++) != 0)
741 FOR_PROVIDES(p, pp, sug)
743 queue_push(&workq, p);
751 /*-------------------------------------------------------------------
753 * Add rules for packages possibly selected in by weak dependencies
755 * m: already added solvables
759 solver_addrpmrulesforweak(Solver *solv, Map *m)
761 Pool *pool = solv->pool;
766 /* foreach solvable in pool */
767 for (i = n = 1; n < pool->nsolvables; i++, n++)
769 if (i == pool->nsolvables) /* wrap i */
771 if (MAPTST(m, i)) /* already added that one */
774 s = pool->solvables + i;
775 if (!pool_installable(pool, s)) /* only look at installable ones */
781 /* find possible supplements */
782 supp = s->repo->idarraydata + s->supplements;
783 while ((sup = *supp++) != 0)
784 if (dep_possible(solv, sup, m))
788 /* if nothing found, check for enhances */
789 if (!sup && s->enhances)
791 supp = s->repo->idarraydata + s->enhances;
792 while ((sup = *supp++) != 0)
793 if (dep_possible(solv, sup, m))
796 /* if nothing found, goto next solvables */
799 solver_addrpmrulesforsolvable(solv, s, m);
800 n = 0; /* check all solvables again because we added solvables to m */
805 /*-------------------------------------------------------------------
807 * add package rules for possible updates
810 * m: map of already visited solvables
811 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
815 solver_addrpmrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
817 Pool *pool = solv->pool;
819 /* queue and buffer for it */
823 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
824 /* find update candidates for 's' */
825 policy_findupdatepackages(solv, s, &qs, allow_all);
826 /* add rule for 's' if not already done */
827 if (!MAPTST(m, s - pool->solvables))
828 solver_addrpmrulesforsolvable(solv, s, m);
829 /* foreach update candidate, add rule if not already done */
830 for (i = 0; i < qs.count; i++)
831 if (!MAPTST(m, qs.elements[i]))
832 solver_addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
837 /***********************************************************************
839 *** Update/Feature rule part
841 *** Those rules make sure an installed package isn't silently deleted
846 finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
848 Pool *pool = solv->pool;
851 policy_findupdatepackages(solv, s, qs, allow_all);
855 return 0; /* orphaned, don't create feature rule */
856 /* check if this is an orphaned package */
857 policy_findupdatepackages(solv, s, qs, 1);
859 return 0; /* orphaned, don't create update rule */
861 return -SYSTEMSOLVABLE; /* supported but not installable */
864 return s - pool->solvables;
865 /* check if it is ok to keep the installed package */
866 for (i = 0; i < qs->count; i++)
868 Solvable *ns = pool->solvables + qs->elements[i];
869 if (s->evr == ns->evr && solvable_identical(s, ns))
870 return s - pool->solvables;
872 /* nope, it must be some other package */
873 return -SYSTEMSOLVABLE;
876 /* add packages from the dup repositories to the update candidates
877 * this isn't needed for the global dup mode as all packages are
878 * from dup repos in that case */
880 addduppackages(Solver *solv, Solvable *s, Queue *qs)
885 int oldnoupdateprovide = solv->noupdateprovide;
887 queue_init_buffer(&dupqs, dupqsbuf, sizeof(dupqsbuf)/sizeof(*dupqsbuf));
888 solv->noupdateprovide = 1;
889 policy_findupdatepackages(solv, s, &dupqs, 2);
890 solv->noupdateprovide = oldnoupdateprovide;
891 for (i = 0; i < dupqs.count; i++)
893 p = dupqs.elements[i];
894 if (MAPTST(&solv->dupmap, p))
895 queue_pushunique(qs, p);
900 /*-------------------------------------------------------------------
902 * add rule for update
903 * (A|A1|A2|A3...) An = update candidates for A
905 * s = (installed) solvable
909 solver_addupdaterule(Solver *solv, Solvable *s, int allow_all)
911 /* installed packages get a special upgrade allowed rule */
912 Pool *pool = solv->pool;
917 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
918 p = s - pool->solvables;
919 /* find update candidates for 's' */
920 if (solv->dupmap_all)
921 p = finddistupgradepackages(solv, s, &qs, allow_all);
923 policy_findupdatepackages(solv, s, &qs, allow_all);
924 if (!allow_all && !solv->dupmap_all && solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
925 addduppackages(solv, s, &qs);
927 if (!allow_all && qs.count && solv->noobsoletes.size)
931 d = pool_queuetowhatprovides(pool, &qs);
932 /* filter out all noobsoletes packages as they don't update */
933 for (i = j = 0; i < qs.count; i++)
935 if (MAPTST(&solv->noobsoletes, qs.elements[i]))
937 /* it's ok if they have same nevra */
938 Solvable *ps = pool->solvables + qs.elements[i];
939 if (ps->name != s->name || ps->evr != s->evr || ps->arch != s->arch)
942 qs.elements[j++] = qs.elements[i];
946 if (d && solv->installed && s->repo == solv->installed &&
947 (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, s - pool->solvables - solv->installed->start))))
949 if (!solv->multiversionupdaters)
950 solv->multiversionupdaters = sat_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
951 solv->multiversionupdaters[s - pool->solvables - solv->installed->start] = d;
953 if (j == 0 && p == -SYSTEMSOLVABLE && solv->dupmap_all)
955 queue_push(&solv->orphaned, s - pool->solvables); /* treat as orphaned */
961 if (qs.count && p == -SYSTEMSOLVABLE)
962 p = queue_shift(&qs);
963 d = qs.count ? pool_queuetowhatprovides(pool, &qs) : 0;
965 solver_addrule(solv, p, d); /* allow update of s */
969 disableupdaterule(Solver *solv, Id p)
973 MAPSET(&solv->noupdate, p - solv->installed->start);
974 r = solv->rules + solv->updaterules + (p - solv->installed->start);
975 if (r->p && r->d >= 0)
976 solver_disablerule(solv, r);
977 r = solv->rules + solv->featurerules + (p - solv->installed->start);
978 if (r->p && r->d >= 0)
979 solver_disablerule(solv, r);
983 reenableupdaterule(Solver *solv, Id p)
985 Pool *pool = solv->pool;
988 MAPCLR(&solv->noupdate, p - solv->installed->start);
989 r = solv->rules + solv->updaterules + (p - solv->installed->start);
994 solver_enablerule(solv, r);
995 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
997 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
998 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
1002 r = solv->rules + solv->featurerules + (p - solv->installed->start);
1003 if (r->p && r->d < 0)
1005 solver_enablerule(solv, r);
1006 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
1008 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1009 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
1015 /***********************************************************************
1017 *** Infarch rule part
1019 *** Infarch rules make sure the solver uses the best architecture of
1020 *** a package if multiple archetectures are available
1025 solver_addinfarchrules(Solver *solv, Map *addedmap)
1027 Pool *pool = solv->pool;
1029 Id p, pp, a, aa, bestarch;
1030 Solvable *s, *ps, *bests;
1031 Queue badq, allowedarchs;
1034 queue_init(&allowedarchs);
1035 solv->infarchrules = solv->nrules;
1036 for (i = 1; i < pool->nsolvables; i++)
1038 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1040 s = pool->solvables + i;
1044 queue_empty(&allowedarchs);
1045 FOR_PROVIDES(p, pp, s->name)
1047 ps = pool->solvables + p;
1048 if (ps->name != s->name || !MAPTST(addedmap, p))
1055 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1056 if (a != 1 && pool->installed && ps->repo == pool->installed)
1058 if (!solv->dupmap_all && !(solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1059 queue_pushunique(&allowedarchs, ps->arch); /* also ok to keep this architecture */
1060 continue; /* ignore installed solvables when calculating the best arch */
1062 if (a && a != 1 && (!bestarch || a < bestarch))
1070 /* speed up common case where installed package already has best arch */
1071 if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch)
1072 allowedarchs.count--; /* installed arch is best */
1074 FOR_PROVIDES(p, pp, s->name)
1076 ps = pool->solvables + p;
1077 if (ps->name != s->name || !MAPTST(addedmap, p))
1080 a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1081 if (a != 1 && bestarch && ((a ^ bestarch) & 0xffff0000) != 0)
1083 if (pool->installed && ps->repo == pool->installed)
1084 continue; /* always ok to keep an installed package */
1085 for (j = 0; j < allowedarchs.count; j++)
1087 aa = allowedarchs.elements[j];
1090 aa = (aa <= pool->lastarch) ? pool->id2arch[aa] : 0;
1091 if (aa && ((a ^ aa) & 0xffff0000) == 0)
1092 break; /* compatible */
1094 if (j == allowedarchs.count)
1095 queue_push(&badq, p);
1100 /* block all solvables in the badq! */
1101 for (j = 0; j < badq.count; j++)
1103 p = badq.elements[j];
1104 solver_addrule(solv, -p, 0);
1108 queue_free(&allowedarchs);
1109 solv->infarchrules_end = solv->nrules;
1113 disableinfarchrule(Solver *solv, Id name)
1115 Pool *pool = solv->pool;
1118 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1120 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1121 solver_disablerule(solv, r);
1126 reenableinfarchrule(Solver *solv, Id name)
1128 Pool *pool = solv->pool;
1131 for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1133 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1135 solver_enablerule(solv, r);
1136 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
1138 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1139 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
1146 /***********************************************************************
1150 *** Dup rules make sure a package is selected from the specified dup
1151 *** repositories if an update candidate is included in one of them.
1156 solver_createdupmaps(Solver *solv)
1158 Queue *job = &solv->job;
1159 Pool *pool = solv->pool;
1161 Id how, what, p, pi, pp, obs, *obsp;
1165 map_init(&solv->dupmap, pool->nsolvables);
1166 map_init(&solv->dupinvolvedmap, pool->nsolvables);
1167 for (i = 0; i < job->count; i += 2)
1169 how = job->elements[i];
1170 what = job->elements[i + 1];
1171 switch (how & SOLVER_JOBMASK)
1173 case SOLVER_DISTUPGRADE:
1174 if ((how & SOLVER_SELECTMASK) != SOLVER_SOLVABLE_REPO)
1176 if (what <= 0 || what > pool->nrepos)
1178 repo = pool_id2repo(pool, what);
1179 FOR_REPO_SOLVABLES(repo, p, s)
1181 MAPSET(&solv->dupmap, p);
1182 FOR_PROVIDES(pi, pp, s->name)
1184 ps = pool->solvables + pi;
1185 if (ps->name != s->name)
1187 MAPSET(&solv->dupinvolvedmap, pi);
1191 /* FIXME: check obsoletes/provides combination */
1192 obsp = s->repo->idarraydata + s->obsoletes;
1193 while ((obs = *obsp++) != 0)
1195 FOR_PROVIDES(pi, pp, obs)
1197 Solvable *pis = pool->solvables + pi;
1198 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pis, obs))
1200 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, pis))
1202 MAPSET(&solv->dupinvolvedmap, pi);
1212 MAPCLR(&solv->dupinvolvedmap, SYSTEMSOLVABLE);
1216 solver_freedupmaps(Solver *solv)
1218 map_free(&solv->dupmap);
1219 /* we no longer free solv->dupinvolvedmap as we need it in
1220 * policy's priority pruning code. sigh. */
1224 solver_addduprules(Solver *solv, Map *addedmap)
1226 Pool *pool = solv->pool;
1231 solv->duprules = solv->nrules;
1232 for (i = 1; i < pool->nsolvables; i++)
1234 if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1236 s = pool->solvables + i;
1238 FOR_PROVIDES(p, pp, s->name)
1240 ps = pool->solvables + p;
1241 if (ps->name != s->name || !MAPTST(addedmap, p))
1247 if (!MAPTST(&solv->dupinvolvedmap, p))
1249 if (solv->installed && ps->repo == solv->installed)
1251 if (!solv->updatemap.size)
1252 map_grow(&solv->updatemap, solv->installed->end - solv->installed->start);
1253 MAPSET(&solv->updatemap, p - solv->installed->start);
1254 if (!MAPTST(&solv->dupmap, p))
1257 /* is installed identical to a good one? */
1258 FOR_PROVIDES(ip, ipp, ps->name)
1260 Solvable *is = pool->solvables + ip;
1261 if (!MAPTST(&solv->dupmap, ip))
1263 if (is->evr == ps->evr && solvable_identical(ps, is))
1267 solver_addrule(solv, -p, 0); /* no match, sorry */
1270 else if (!MAPTST(&solv->dupmap, p))
1271 solver_addrule(solv, -p, 0);
1274 solv->duprules_end = solv->nrules;
1279 disableduprule(Solver *solv, Id name)
1281 Pool *pool = solv->pool;
1284 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1286 if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1287 solver_disablerule(solv, r);
1292 reenableduprule(Solver *solv, Id name)
1294 Pool *pool = solv->pool;
1297 for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1299 if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1301 solver_enablerule(solv, r);
1302 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
1304 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1305 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
1312 /***********************************************************************
1314 *** Policy rule disabling/reenabling
1316 *** Disable all policy rules that conflict with our jobs. If a job
1317 *** gets disabled later on, reenable the involved policy rules again.
1321 #define DISABLE_UPDATE 1
1322 #define DISABLE_INFARCH 2
1323 #define DISABLE_DUP 3
1326 jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
1328 Pool *pool = solv->pool;
1332 int i, j, set, qstart, pass;
1335 installed = solv->installed;
1336 select = how & SOLVER_SELECTMASK;
1337 switch (how & SOLVER_JOBMASK)
1339 case SOLVER_INSTALL:
1340 set = how & SOLVER_SETMASK;
1341 if (!(set & SOLVER_NOAUTOSET))
1343 /* automatically add set bits by analysing the job */
1344 if (select == SOLVER_SOLVABLE)
1345 set |= SOLVER_SETARCH | SOLVER_SETVENDOR | SOLVER_SETREPO | SOLVER_SETEVR;
1346 else if ((select == SOLVER_SOLVABLE_NAME || select == SOLVER_SOLVABLE_PROVIDES) && ISRELDEP(what))
1348 Reldep *rd = GETRELDEP(pool, what);
1349 if (rd->flags == REL_EQ && select == SOLVER_SOLVABLE_NAME)
1351 #if !defined(DEBIAN_SEMANTICS)
1352 const char *evr = pool_id2str(pool, rd->evr);
1353 if (strchr(evr, '-'))
1354 set |= SOLVER_SETEVR;
1356 set |= SOLVER_SETEV;
1358 set |= SOLVER_SETEVR;
1361 if (rd->flags <= 7 && ISRELDEP(rd->name))
1362 rd = GETRELDEP(pool, rd->name);
1363 if (rd->flags == REL_ARCH)
1364 set |= SOLVER_SETARCH;
1368 set &= ~SOLVER_NOAUTOSET;
1371 if ((set & SOLVER_SETARCH) != 0 && solv->infarchrules != solv->infarchrules_end)
1373 if (select == SOLVER_SOLVABLE)
1374 queue_push2(q, DISABLE_INFARCH, pool->solvables[what].name);
1377 int qcnt = q->count;
1378 FOR_JOB_SELECT(p, pp, select, what)
1380 s = pool->solvables + p;
1382 for (i = qcnt; i < q->count; i += 2)
1383 if (q->elements[i + 1] == s->name)
1387 queue_push2(q, DISABLE_INFARCH, s->name);
1391 if ((set & SOLVER_SETREPO) != 0 && solv->duprules != solv->duprules_end)
1393 if (select == SOLVER_SOLVABLE)
1394 queue_push2(q, DISABLE_DUP, pool->solvables[what].name);
1397 int qcnt = q->count;
1398 FOR_JOB_SELECT(p, pp, select, what)
1400 s = pool->solvables + p;
1402 for (i = qcnt; i < q->count; i += 2)
1403 if (q->elements[i + 1] == s->name)
1407 queue_push2(q, DISABLE_DUP, s->name);
1413 /* now the hard part: disable some update rules */
1415 /* first check if we have noobs or installed packages in the job */
1416 FOR_JOB_SELECT(p, pp, select, what)
1418 if (pool->solvables[p].repo == installed)
1420 if (select == SOLVER_SOLVABLE)
1421 queue_push2(q, DISABLE_UPDATE, what);
1424 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
1428 /* all job packages obsolete */
1431 memset(&omap, 0, sizeof(omap));
1432 FOR_JOB_SELECT(p, pp, select, what)
1437 map_grow(&omap, installed->end - installed->start);
1438 s = pool->solvables + p;
1442 obsp = s->repo->idarraydata + s->obsoletes;
1443 while ((obs = *obsp++) != 0)
1444 FOR_PROVIDES(p2, pp2, obs)
1446 Solvable *ps = pool->solvables + p2;
1447 if (ps->repo != installed)
1449 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1451 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1454 MAPSET(&omap, p2 - installed->start);
1456 queue_push2(q, DISABLE_UPDATE, p2);
1459 FOR_PROVIDES(p2, pp2, s->name)
1461 Solvable *ps = pool->solvables + p2;
1462 if (ps->repo != installed)
1464 if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
1466 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1469 MAPSET(&omap, p2 - installed->start);
1471 queue_push2(q, DISABLE_UPDATE, p2);
1475 for (i = j = qstart; i < q->count; i += 2)
1477 if (MAPTST(&omap, q->elements[i + 1] - installed->start))
1479 MAPCLR(&omap, q->elements[i + 1] - installed->start);
1480 q->elements[j + 1] = q->elements[i + 1];
1484 queue_truncate(q, j);
1486 if (q->count == qstart)
1493 if (qstart == q->count)
1494 return; /* nothing to prune */
1495 if ((set & (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR)) == (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR))
1496 return; /* all is set */
1498 /* now that we know which installed packages are obsoleted check each of them */
1499 for (i = j = qstart; i < q->count; i += 2)
1501 Solvable *is = pool->solvables + q->elements[i + 1];
1502 FOR_JOB_SELECT(p, pp, select, what)
1505 s = pool->solvables + p;
1506 if ((set & SOLVER_SETEVR) != 0)
1507 illegal |= POLICY_ILLEGAL_DOWNGRADE; /* ignore */
1508 if ((set & SOLVER_SETARCH) != 0)
1509 illegal |= POLICY_ILLEGAL_ARCHCHANGE; /* ignore */
1510 if ((set & SOLVER_SETVENDOR) != 0)
1511 illegal |= POLICY_ILLEGAL_VENDORCHANGE; /* ignore */
1512 illegal = policy_is_illegal(solv, is, s, illegal);
1513 if (illegal && illegal == POLICY_ILLEGAL_DOWNGRADE && (set & SOLVER_SETEV) != 0)
1515 /* it's ok if the EV is different */
1516 if (pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE_EVONLY) != 0)
1524 /* no package conflicts with the update rule */
1525 /* thus keep the DISABLE_UPDATE */
1526 q->elements[j + 1] = q->elements[i + 1];
1530 queue_truncate(q, j);
1536 FOR_JOB_SELECT(p, pp, select, what)
1537 if (pool->solvables[p].repo == installed)
1538 queue_push2(q, DISABLE_UPDATE, p);
1545 /* disable all policy rules that are in conflict with our job list */
1547 solver_disablepolicyrules(Solver *solv)
1549 Queue *job = &solv->job;
1556 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1558 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1560 r = solv->rules + i;
1561 if (r->d < 0) /* disabled? */
1563 j = solv->ruletojob.elements[i - solv->jobrules];
1567 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1569 if (solv->cleandepsmap.size)
1571 solver_createcleandepsmap(solv);
1572 for (i = solv->installed->start; i < solv->installed->end; i++)
1573 if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1574 queue_push2(&allq, DISABLE_UPDATE, i);
1576 MAPZERO(&solv->noupdate);
1577 for (i = 0; i < allq.count; i += 2)
1579 Id type = allq.elements[i], arg = allq.elements[i + 1];
1582 case DISABLE_UPDATE:
1583 disableupdaterule(solv, arg);
1585 case DISABLE_INFARCH:
1586 disableinfarchrule(solv, arg);
1589 disableduprule(solv, arg);
1598 /* we just disabled job #jobidx, now reenable all policy rules that were
1599 * disabled because of this job */
1601 solver_reenablepolicyrules(Solver *solv, int jobidx)
1603 Queue *job = &solv->job;
1608 Id qbuf[32], allqbuf[128];
1610 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
1611 queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1612 jobtodisablelist(solv, job->elements[jobidx], job->elements[jobidx + 1], &q);
1615 for (i = solv->jobrules; i < solv->jobrules_end; i++)
1617 r = solv->rules + i;
1618 if (r->d < 0) /* disabled? */
1620 j = solv->ruletojob.elements[i - solv->jobrules];
1624 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1626 if (solv->cleandepsmap.size)
1628 solver_createcleandepsmap(solv);
1629 for (i = solv->installed->start; i < solv->installed->end; i++)
1630 if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1631 queue_push2(&allq, DISABLE_UPDATE, i);
1633 for (j = 0; j < q.count; j += 2)
1635 Id type = q.elements[j], arg = q.elements[j + 1];
1636 for (i = 0; i < allq.count; i += 2)
1637 if (allq.elements[i] == type && allq.elements[i + 1] == arg)
1640 continue; /* still disabled */
1643 case DISABLE_UPDATE:
1644 reenableupdaterule(solv, arg);
1646 case DISABLE_INFARCH:
1647 reenableinfarchrule(solv, arg);
1650 reenableduprule(solv, arg);
1659 /***********************************************************************
1661 *** Rule info part, tell the user what the rule is about.
1666 addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep)
1668 Pool *pool = solv->pool;
1672 /* check if this creates the rule we're searching for */
1673 r = solv->rules + solv->ruleinfoq->elements[0];
1675 od = r->d < 0 ? -r->d - 1 : r->d;
1680 if (p < 0 && d > 0 && (!pool->whatprovidesdata[d] || !pool->whatprovidesdata[d + 1]))
1682 w2 = pool->whatprovidesdata[d];
1686 if (p > 0 && d < 0) /* this hack is used for buddy deps */
1698 Id *dp = pool->whatprovidesdata + d;
1699 Id *odp = pool->whatprovidesdata + od;
1701 if (*dp++ != *odp++)
1707 /* handle multiversion conflict rules */
1708 if (p < 0 && pool->whatprovidesdata[d] < 0)
1710 w2 = pool->whatprovidesdata[d];
1711 /* XXX: free memory */
1721 if (w2 != op || p != ow2)
1726 if (p != op || w2 != ow2)
1730 /* yep, rule matches. record info */
1731 queue_push(solv->ruleinfoq, type);
1732 if (type == SOLVER_RULE_RPM_SAME_NAME)
1734 /* we normalize same name order */
1735 queue_push(solv->ruleinfoq, op < 0 ? -op : 0);
1736 queue_push(solv->ruleinfoq, ow2 < 0 ? -ow2 : 0);
1740 queue_push(solv->ruleinfoq, p < 0 ? -p : 0);
1741 queue_push(solv->ruleinfoq, w2 < 0 ? -w2 : 0);
1743 queue_push(solv->ruleinfoq, dep);
1747 solver_allruleinfos_cmp(const void *ap, const void *bp, void *dp)
1749 const Id *a = ap, *b = bp;
1768 solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
1770 Pool *pool = solv->pool;
1771 Rule *r = solv->rules + rid;
1775 if (rid <= 0 || rid >= solv->rpmrules_end)
1777 Id type, from, to, dep;
1778 type = solver_ruleinfo(solv, rid, &from, &to, &dep);
1779 queue_push(rq, type);
1780 queue_push(rq, from);
1782 queue_push(rq, dep);
1787 queue_push(rq, rid);
1788 solv->ruleinfoq = rq;
1789 solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
1790 /* also try reverse direction for conflicts */
1791 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
1792 solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
1793 solv->ruleinfoq = 0;
1795 /* now sort & unify em */
1798 sat_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
1799 /* throw out identical entries */
1800 for (i = j = 0; i < rq->count; i += 4)
1804 if (rq->elements[i] == rq->elements[j - 4] &&
1805 rq->elements[i + 1] == rq->elements[j - 3] &&
1806 rq->elements[i + 2] == rq->elements[j - 2] &&
1807 rq->elements[i + 3] == rq->elements[j - 1])
1810 rq->elements[j++] = rq->elements[i];
1811 rq->elements[j++] = rq->elements[i + 1];
1812 rq->elements[j++] = rq->elements[i + 2];
1813 rq->elements[j++] = rq->elements[i + 3];
1820 solver_ruleinfo(Solver *solv, Id rid, Id *fromp, Id *top, Id *depp)
1822 Pool *pool = solv->pool;
1823 Rule *r = solv->rules + rid;
1824 SolverRuleinfo type = SOLVER_RULE_UNKNOWN;
1832 if (rid > 0 && rid < solv->rpmrules_end)
1838 return SOLVER_RULE_RPM;
1842 queue_push(&rq, rid);
1843 solv->ruleinfoq = &rq;
1844 solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
1845 /* also try reverse direction for conflicts */
1846 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
1847 solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
1848 solv->ruleinfoq = 0;
1849 type = SOLVER_RULE_RPM;
1850 for (i = 1; i < rq.count; i += 4)
1853 qt = rq.elements[i];
1854 qp = rq.elements[i + 1];
1855 qo = rq.elements[i + 2];
1856 qd = rq.elements[i + 3];
1857 if (type == SOLVER_RULE_RPM || type > qt)
1871 if (rid >= solv->jobrules && rid < solv->jobrules_end)
1873 Id jidx = solv->ruletojob.elements[rid - solv->jobrules];
1877 *top = solv->job.elements[jidx];
1879 *depp = solv->job.elements[jidx + 1];
1880 if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE && (solv->job.elements[jidx] & SOLVER_SELECTMASK) != SOLVER_SOLVABLE_ONE_OF)
1881 return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
1882 return SOLVER_RULE_JOB;
1884 if (rid >= solv->updaterules && rid < solv->updaterules_end)
1887 *fromp = solv->installed->start + (rid - solv->updaterules);
1888 return SOLVER_RULE_UPDATE;
1890 if (rid >= solv->featurerules && rid < solv->featurerules_end)
1893 *fromp = solv->installed->start + (rid - solv->featurerules);
1894 return SOLVER_RULE_FEATURE;
1896 if (rid >= solv->duprules && rid < solv->duprules_end)
1901 *depp = pool->solvables[-r->p].name;
1902 return SOLVER_RULE_DISTUPGRADE;
1904 if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
1909 *depp = pool->solvables[-r->p].name;
1910 return SOLVER_RULE_INFARCH;
1912 if (rid >= solv->choicerules && rid < solv->choicerules_end)
1914 return SOLVER_RULE_CHOICE;
1916 if (rid >= solv->learntrules)
1918 return SOLVER_RULE_LEARNT;
1920 return SOLVER_RULE_UNKNOWN;
1924 solver_addchoicerules(Solver *solv)
1926 Pool *pool = solv->pool;
1930 int i, j, rid, havechoice;
1935 solv->choicerules = solv->nrules;
1936 if (!pool->installed)
1938 solv->choicerules_end = solv->nrules;
1941 solv->choicerules_ref = sat_calloc(solv->rpmrules_end, sizeof(Id));
1944 map_init(&m, pool->nsolvables);
1945 map_init(&mneg, pool->nsolvables);
1946 /* set up negative assertion map from infarch and dup rules */
1947 for (rid = solv->infarchrules, r = solv->rules + rid; rid < solv->infarchrules_end; rid++, r++)
1948 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
1949 MAPSET(&mneg, -r->p);
1950 for (rid = solv->duprules, r = solv->rules + rid; rid < solv->duprules_end; rid++, r++)
1951 if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
1952 MAPSET(&mneg, -r->p);
1953 for (rid = 1; rid < solv->rpmrules_end ; rid++)
1955 r = solv->rules + rid;
1956 if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 < 0))
1957 continue; /* only look at requires rules */
1958 // solver_printrule(solv, SAT_DEBUG_RESULT, r);
1962 FOR_RULELITERALS(p, pp, r)
1966 s = pool->solvables + p;
1969 if (s->repo == pool->installed)
1974 /* check if this package is "blocked" by a installed package */
1976 FOR_PROVIDES(p2, pp2, s->name)
1978 s2 = pool->solvables + p2;
1979 if (s2->repo != pool->installed)
1981 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
1983 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
1989 /* found installed package p2 that we can update to p */
1990 if (MAPTST(&mneg, p))
1992 if (policy_is_illegal(solv, s2, s, 0))
1994 queue_push(&qi, p2);
2000 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2002 while ((obs = *obsp++) != 0)
2004 FOR_PROVIDES(p2, pp2, obs)
2006 s2 = pool->solvables + p2;
2007 if (s2->repo != pool->installed)
2009 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
2011 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2020 /* found installed package p2 that we can update to p */
2021 if (MAPTST(&mneg, p))
2023 if (policy_is_illegal(solv, s2, s, 0))
2025 queue_push(&qi, p2);
2030 /* package p is independent of the installed ones */
2033 if (!havechoice || !q.count)
2034 continue; /* no choice */
2036 /* now check the update rules of the installed package.
2037 * if all packages of the update rules are contained in
2038 * the dependency rules, there's no need to set up the choice rule */
2040 FOR_RULELITERALS(p, pp, r)
2043 for (i = 0; i < qi.count; i++)
2045 if (!qi.elements[i])
2047 Rule *ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
2049 ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
2052 FOR_RULELITERALS(p, pp, ur)
2057 for (j = i + 1; j < qi.count; j++)
2058 if (qi.elements[i] == qi.elements[j])
2064 printf("skipping choice ");
2065 solver_printrule(solv, SAT_DEBUG_RESULT, solv->rules + rid);
2069 d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
2070 solver_addrule(solv, r->p, d);
2071 queue_push(&solv->weakruleq, solv->nrules - 1);
2072 solv->choicerules_ref[solv->nrules - 1 - solv->choicerules] = rid;
2075 solver_printrule(solv, SAT_DEBUG_RESULT, solv->rules + rid);
2076 printf("WEAK CHOICE ");
2077 solver_printrule(solv, SAT_DEBUG_RESULT, solv->rules + solv->nrules - 1);
2084 solv->choicerules_end = solv->nrules;
2087 /* called when a choice rule is disabled by analyze_unsolvable. We also
2088 * have to disable all other choice rules so that the best packages get
2091 solver_disablechoicerules(Solver *solv, Rule *r)
2094 Pool *pool = solv->pool;
2098 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2099 map_init(&m, pool->nsolvables);
2100 FOR_RULELITERALS(p, pp, or)
2103 FOR_RULELITERALS(p, pp, r)
2106 for (rid = solv->choicerules; rid < solv->choicerules_end; rid++)
2108 r = solv->rules + rid;
2111 or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2112 FOR_RULELITERALS(p, pp, or)
2113 if (p > 0 && MAPTST(&m, p))
2116 solver_disablerule(solv, r);
2120 static void solver_createcleandepsmap(Solver *solv)
2122 Pool *pool = solv->pool;
2123 Repo *installed = solv->installed;
2124 Queue *job = &solv->job;
2129 Id rid, how, what, select;
2131 Id req, *reqp, sup, *supp;
2136 map_init(&userinstalled, installed->end - installed->start);
2137 map_init(&im, pool->nsolvables);
2138 map_init(&installedm, pool->nsolvables);
2139 map_empty(&solv->cleandepsmap);
2142 for (i = 0; i < job->count; i += 2)
2144 how = job->elements[i];
2145 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
2147 what = job->elements[i + 1];
2148 select = how & SOLVER_SELECTMASK;
2149 FOR_JOB_SELECT(p, pp, select, what)
2150 if (pool->solvables[p].repo == installed)
2151 MAPSET(&userinstalled, p - installed->start);
2154 /* add all positive elements (e.g. locks) to "userinstalled" */
2155 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2157 r = solv->rules + rid;
2160 FOR_RULELITERALS(p, jp, r)
2161 if (p > 0 && pool->solvables[p].repo == installed)
2162 MAPSET(&userinstalled, p - installed->start);
2164 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2166 r = solv->rules + rid;
2167 if (r->p >= 0 || r->d != 0)
2168 continue; /* disabled or not erase */
2170 if (pool->solvables[p].repo != installed)
2172 MAPCLR(&userinstalled, p - installed->start);
2173 i = solv->ruletojob.elements[rid - solv->jobrules];
2174 how = job->elements[i];
2175 if ((how & (SOLVER_JOBMASK|SOLVER_CLEANDEPS)) == (SOLVER_ERASE|SOLVER_CLEANDEPS))
2178 for (p = installed->start; p < installed->end; p++)
2180 if (pool->solvables[p].repo != installed)
2182 MAPSET(&installedm, p);
2188 ip = queue_shift(&iq);
2189 s = pool->solvables + ip;
2190 if (!MAPTST(&im, ip))
2192 if (!MAPTST(&installedm, ip))
2194 if (s->repo == installed && MAPTST(&userinstalled, ip - installed->start))
2197 #ifdef CLEANDEPSDEBUG
2198 printf("hello %s\n", pool_solvable2str(pool, s));
2202 reqp = s->repo->idarraydata + s->requires;
2203 while ((req = *reqp++) != 0)
2205 if (req == SOLVABLE_PREREQMARKER)
2208 /* count number of installed packages that match */
2210 FOR_PROVIDES(p, pp, req)
2211 if (MAPTST(&installedm, p))
2216 FOR_PROVIDES(p, pp, req)
2220 #ifdef CLEANDEPSDEBUG
2221 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2230 reqp = s->repo->idarraydata + s->recommends;
2231 while ((req = *reqp++) != 0)
2235 FOR_PROVIDES(p, pp, req)
2236 if (MAPTST(&installedm, p))
2241 FOR_PROVIDES(p, pp, req)
2245 #ifdef CLEANDEPSDEBUG
2246 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2255 /* supplements pass */
2256 for (ip = solv->installed->start; ip < solv->installed->end; ip++)
2258 if (!MAPTST(&installedm, ip))
2260 s = pool->solvables + ip;
2261 if (!s->supplements)
2263 if (!MAPTST(&im, ip))
2265 supp = s->repo->idarraydata + s->supplements;
2266 while ((sup = *supp++) != 0)
2267 if (!dep_possible(solv, sup, &im) && dep_possible(solv, sup, &installedm))
2269 /* no longer supplemented, also erase */
2272 #ifdef CLEANDEPSDEBUG
2273 printf("%s supplemented\n", pool_solvid2str(pool, ip));
2275 queue_push(&iq, ip);
2281 /* turn userinstalled into remove set for pruning */
2282 map_empty(&userinstalled);
2283 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2285 r = solv->rules + rid;
2286 if (r->p >= 0 || r->d != 0)
2287 continue; /* disabled or not erase */
2290 if (pool->solvables[p].repo == installed)
2291 MAPSET(&userinstalled, p - installed->start);
2293 for (p = installed->start; p < installed->end; p++)
2296 for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2298 r = solv->rules + rid;
2301 FOR_RULELITERALS(p, jp, r)
2305 /* also put directly addressed packages on the install queue
2306 * so we can mark patterns as installed */
2307 for (i = 0; i < job->count; i += 2)
2309 how = job->elements[i];
2310 if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
2312 what = job->elements[i + 1];
2313 select = how & SOLVER_SELECTMASK;
2314 if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
2315 queue_push(&iq, what);
2320 ip = queue_shift(&iq);
2321 s = pool->solvables + ip;
2322 #ifdef CLEANDEPSDEBUG
2323 printf("bye %s\n", pool_solvable2str(pool, s));
2327 reqp = s->repo->idarraydata + s->requires;
2328 while ((req = *reqp++) != 0)
2330 FOR_PROVIDES(p, pp, req)
2332 if (!MAPTST(&im, p) && MAPTST(&installedm, p))
2336 if (MAPTST(&userinstalled, p - installed->start))
2338 #ifdef CLEANDEPSDEBUG
2339 printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2349 reqp = s->repo->idarraydata + s->recommends;
2350 while ((req = *reqp++) != 0)
2352 FOR_PROVIDES(p, pp, req)
2354 if (!MAPTST(&im, p) && MAPTST(&installedm, p))
2358 if (MAPTST(&userinstalled, p - installed->start))
2360 #ifdef CLEANDEPSDEBUG
2361 printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2371 /* supplements pass */
2372 for (ip = installed->start; ip < installed->end; ip++)
2374 if (!MAPTST(&installedm, ip))
2376 if (MAPTST(&userinstalled, ip - installed->start))
2378 s = pool->solvables + ip;
2379 if (!s->supplements)
2381 if (MAPTST(&im, ip) || !MAPTST(&installedm, ip))
2383 supp = s->repo->idarraydata + s->supplements;
2384 while ((sup = *supp++) != 0)
2385 if (dep_possible(solv, sup, &im))
2389 #ifdef CLEANDEPSDEBUG
2390 printf("%s supplemented\n", pool_solvid2str(pool, ip));
2393 queue_push(&iq, ip);
2400 for (p = installed->start; p < installed->end; p++)
2402 if (pool->solvables[p].repo != installed)
2404 if (!MAPTST(&im, p))
2405 MAPSET(&solv->cleandepsmap, p - installed->start);
2408 map_free(&installedm);
2409 map_free(&userinstalled);