2 * Copyright (c) 2007-2008, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * SAT based dependency solver
26 #include "solverdebug.h"
28 #define RULES_BLOCK 63
30 /********************************************************************
32 * dependency check helpers
36 /*-------------------------------------------------------------------
37 * handle split provides
41 solver_splitprovides(Solver *solv, Id dep)
43 Pool *pool = solv->pool;
48 if (!solv->dosplitprovides || !solv->installed)
52 rd = GETRELDEP(pool, dep);
53 if (rd->flags != REL_WITH)
55 FOR_PROVIDES(p, pp, dep)
57 s = pool->solvables + p;
58 if (s->repo == solv->installed && s->name == rd->name)
65 /*-------------------------------------------------------------------
66 * solver_dep_installed
70 solver_dep_installed(Solver *solv, Id dep)
73 Pool *pool = solv->pool;
78 Reldep *rd = GETRELDEP(pool, dep);
79 if (rd->flags == REL_AND)
81 if (!solver_dep_installed(solv, rd->name))
83 return solver_dep_installed(solv, rd->evr);
85 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
86 return solver_dep_installed(solv, rd->evr);
88 FOR_PROVIDES(p, pp, dep)
90 if (p == SYSTEMSOLVABLE || (solv->installed && pool->solvables[p].repo == solv->installed))
98 /*-------------------------------------------------------------------
99 * Check if dependenc is possible
101 * this mirrors solver_dep_fulfilled
102 * but uses map m instead of the decisionmap
106 dep_possible(Solver *solv, Id dep, Map *m)
108 Pool *pool = solv->pool;
113 Reldep *rd = GETRELDEP(pool, dep);
114 if (rd->flags == REL_AND)
116 if (!dep_possible(solv, rd->name, m))
118 return dep_possible(solv, rd->evr, m);
120 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
121 return solver_splitprovides(solv, rd->evr);
122 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
123 return solver_dep_installed(solv, rd->evr);
125 FOR_PROVIDES(p, pp, dep)
133 /********************************************************************
137 * - unify rules, remove duplicates
140 static Pool *unifyrules_sortcmp_data;
142 /*-------------------------------------------------------------------
144 * compare rules for unification sort
149 unifyrules_sortcmp(const void *ap, const void *bp)
151 Pool *pool = unifyrules_sortcmp_data;
152 Rule *a = (Rule *)ap;
153 Rule *b = (Rule *)bp;
159 return x; /* p differs */
162 if (a->d == 0 && b->d == 0)
163 return a->w2 - b->w2; /* assertion: return w2 diff */
165 if (a->d == 0) /* a is assertion, b not */
167 x = a->w2 - pool->whatprovidesdata[b->d];
171 if (b->d == 0) /* b is assertion, a not */
173 x = pool->whatprovidesdata[a->d] - b->w2;
177 /* compare whatprovidesdata */
178 ad = pool->whatprovidesdata + a->d;
179 bd = pool->whatprovidesdata + b->d;
181 if ((x = *ad++ - *bd++) != 0)
187 /*-------------------------------------------------------------------
190 * go over all rules and remove duplicates
194 unifyrules(Solver *solv)
196 Pool *pool = solv->pool;
200 if (solv->nrules <= 1) /* nothing to unify */
203 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- unifyrules -----\n");
205 /* sort rules first */
206 unifyrules_sortcmp_data = solv->pool;
207 qsort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp);
214 for (i = j = 1, ir = solv->rules + i; i < solv->nrules; i++, ir++)
216 if (jr && !unifyrules_sortcmp(ir, jr))
217 continue; /* prune! */
218 jr = solv->rules + j++; /* keep! */
223 /* reduced count from nrules to j rules */
224 POOL_DEBUG(SAT_DEBUG_STATS, "pruned rules from %d to %d\n", solv->nrules, j);
226 /* adapt rule buffer */
228 solv->rules = sat_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
232 IF_POOLDEBUG (SAT_DEBUG_STATS)
239 for (i = 1; i < solv->nrules; i++)
246 dp = solv->pool->whatprovidesdata + r->d;
251 POOL_DEBUG(SAT_DEBUG_STATS, " binary: %d\n", binr);
252 POOL_DEBUG(SAT_DEBUG_STATS, " normal: %d, %d literals\n", solv->nrules - 1 - binr, lits);
254 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- unifyrules end -----\n");
264 hashrule(Solver *solv, Id p, Id d, int n)
266 unsigned int x = (unsigned int)p;
270 return (x * 37) ^ (unsigned int)d;
271 dp = solv->pool->whatprovidesdata + d;
273 x = (x * 37) ^ (unsigned int)*dp++;
279 /*-------------------------------------------------------------------
285 * p = direct literal; always < 0 for installed rpm rules
286 * d, if < 0 direct literal, if > 0 offset into whatprovides, if == 0 rule is assertion (look at p only)
289 * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
291 * p < 0 : pkg id of A
292 * d > 0 : Offset in whatprovidesdata (list of providers of b)
294 * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
295 * p < 0 : pkg id of A
296 * d < 0 : Id of solvable (e.g. B1)
298 * d == 0: unary rule, assertion => (A) or (-A)
300 * Install: p > 0, d = 0 (A) user requested install
301 * Remove: p < 0, d = 0 (-A) user requested remove
302 * Requires: p < 0, d > 0 (-A|B1|B2|...) d: <list of providers for requirement of p>
303 * Updates: p > 0, d > 0 (A|B1|B2|...) d: <list of updates for solvable p>
304 * Conflicts: p < 0, d < 0 (-A|-B) either p (conflict issuer) or d (conflict provider) (binary rule)
305 * ? p > 0, d < 0 (A|-B)
306 * No-op ?: p = 0, d = 0 (null) (used as policy rule placeholder)
310 * Direct assertion (no watch needed)( if d <0 ) --> d = 0, w1 = p, w2 = 0
311 * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
312 * every other : w1 = p, w2 = whatprovidesdata[d];
313 * Disabled rule: w1 = 0
315 * always returns a rule for non-rpm rules
319 addrule(Solver *solv, Id p, Id d)
321 Pool *pool = solv->pool;
325 int n = 0; /* number of literals in rule - 1
326 0 = direct assertion (single literal)
331 /* it often happenes that requires lead to adding the same rpm rule
332 * multiple times, so we prune those duplicates right away to make
333 * the work for unifyrules a bit easier */
335 if (solv->nrules /* we already have rules */
336 && !solv->rpmrules_end) /* but are not done with rpm rules */
338 r = solv->rules + solv->nrules - 1; /* get the last added rule */
339 if (r->p == p && r->d == d && d != 0) /* identical and not user requested */
344 * compute number of literals (n) in rule
349 /* always a binary rule */
351 return 0; /* ignore self conflict */
356 for (dp = pool->whatprovidesdata + d; *dp; dp++, n++)
358 return 0; /* rule is self-fulfilling */
360 if (n == 1) /* have single provider */
361 d = dp[-1]; /* take single literal */
365 if (n == 0 && !solv->rpmrules_end)
367 /* this is a rpm rule assertion, we do not have to allocate it */
368 /* it can be identified by a level of 1 and a zero reason */
369 /* we must not drop those rules from the decisionq when rewinding! */
371 assert(solv->decisionmap[-p] == 0 || solv->decisionmap[-p] == -1);
372 if (solv->decisionmap[-p])
373 return 0; /* already got that one */
374 queue_push(&solv->decisionq, p);
375 queue_push(&solv->decisionq_why, 0);
376 solv->decisionmap[-p] = -1;
381 if (n == 1 && p > d && !solv->rpmrules_end)
383 /* smallest literal first so we can find dups */
384 n = p; p = d; d = n; /* p <-> d */
385 n = 1; /* re-set n, was used as temp var */
389 * check for duplicate
392 /* check if the last added rule (r) is exactly the same as what we're looking for. */
393 if (r && n == 1 && !r->d && r->p == p && r->w2 == d)
394 return r; /* binary rule */
396 /* have n-ary rule with same first literal, check other literals */
397 if (r && n > 1 && r->d && r->p == p)
399 /* Rule where d is an offset in whatprovidesdata */
403 dp2 = pool->whatprovidesdata + r->d;
404 for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
415 /* extend rule buffer */
416 solv->rules = sat_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
417 r = solv->rules + solv->nrules++; /* point to rule space */
426 /* direct assertion, no watch needed */
442 r->w2 = pool->whatprovidesdata[d];
447 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
449 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, " Add rule: ");
450 solver_printrule(solv, SAT_DEBUG_RULE_CREATION, r);
456 /*-------------------------------------------------------------------
461 disablerule(Solver *solv, Rule *r)
467 /*-------------------------------------------------------------------
472 enablerule(Solver *solv, Rule *r)
479 /**********************************************************************************/
481 /* a problem is an item on the solver's problem list. It can either be >0, in that
482 * case it is a update rule, or it can be <0, which makes it refer to a job
483 * consisting of multiple job rules.
487 disableproblem(Solver *solv, Id v)
495 disablerule(solv, solv->rules + v);
499 jp = solv->ruletojob.elements;
500 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
502 disablerule(solv, r);
505 /*-------------------------------------------------------------------
510 enableproblem(Solver *solv, Id v)
518 if (v >= solv->featurerules && v < solv->featurerules_end)
520 /* do not enable feature rule if update rule is enabled */
521 r = solv->rules + (v - solv->featurerules + solv->updaterules);
525 enablerule(solv, solv->rules + v);
526 if (v >= solv->updaterules && v < solv->updaterules_end)
528 /* disable feature rule when enabling update rule */
529 r = solv->rules + (v - solv->updaterules + solv->featurerules);
531 disablerule(solv, r);
536 jp = solv->ruletojob.elements;
537 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
543 /************************************************************************/
546 * make assertion rules into decisions
548 * go through update and job rules and add direct assertions
549 * to the decisionqueue. If we find a conflict, disable rules and
550 * add them to problem queue.
554 makeruledecisions(Solver *solv)
556 Pool *pool = solv->pool;
562 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- makeruledecisions ; size decisionq: %d -----\n",solv->decisionq.count);
564 decisionstart = solv->decisionq.count;
565 for (ii = 0; ii < solv->ruleassertions.count; ii++)
567 ri = solv->ruleassertions.elements[ii];
568 r = solv->rules + ri;
570 if (r->d < 0 || !r->p || r->w2) /* disabled, dummy or no assertion */
572 /* do weak rules in phase 2 */
573 if (ri < solv->learntrules && MAPTST(&solv->weakrulemap, ri))
579 if (!solv->decisionmap[vv]) /* if not yet decided */
584 queue_push(&solv->decisionq, v);
585 queue_push(&solv->decisionq_why, r - solv->rules);
586 solv->decisionmap[vv] = v > 0 ? 1 : -1;
587 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
589 Solvable *s = solv->pool->solvables + vv;
591 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", solvable2str(solv->pool, s));
593 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "installing %s (assertion)\n", solvable2str(solv->pool, s));
598 * check previous decision: is it sane ?
601 if (v > 0 && solv->decisionmap[vv] > 0) /* ok to install */
603 if (v < 0 && solv->decisionmap[vv] < 0) /* ok to remove */
609 * The rule (r) we're currently processing says something
610 * different (v = r->p) than a previous decision (decisionmap[abs(v)])
614 if (ri >= solv->learntrules)
616 /* conflict with a learnt rule */
617 /* can happen when packages cannot be installed for
618 * multiple reasons. */
619 /* we disable the learnt rule in this case */
620 disablerule(solv, r);
625 * find the decision which is the "opposite" of the rule
628 for (i = 0; i < solv->decisionq.count; i++)
629 if (solv->decisionq.elements[i] == -v)
631 assert(i < solv->decisionq.count); /* assert that we found it */
634 * conflict with system solvable ?
637 if (v == -SYSTEMSOLVABLE) {
638 /* conflict with system solvable */
639 queue_push(&solv->problems, solv->learnt_pool.count);
640 queue_push(&solv->learnt_pool, ri);
641 queue_push(&solv->learnt_pool, 0);
642 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "conflict with system solvable, disabling rule #%d\n", ri);
643 if (ri >= solv->jobrules && ri < solv->jobrules_end)
644 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
647 queue_push(&solv->problems, v);
648 queue_push(&solv->problems, 0);
649 disableproblem(solv, v);
653 assert(solv->decisionq_why.elements[i]);
656 * conflict with an rpm rule ?
659 if (solv->decisionq_why.elements[i] < solv->rpmrules_end)
661 /* conflict with rpm rule assertion */
662 queue_push(&solv->problems, solv->learnt_pool.count);
663 queue_push(&solv->learnt_pool, ri);
664 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
665 queue_push(&solv->learnt_pool, 0);
666 assert(v > 0 || v == -SYSTEMSOLVABLE);
667 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "conflict with rpm rule, disabling rule #%d\n", ri);
668 if (ri >= solv->jobrules && ri < solv->jobrules_end)
669 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
672 queue_push(&solv->problems, v);
673 queue_push(&solv->problems, 0);
674 disableproblem(solv, v);
679 * conflict with another job or update/feature rule
683 queue_push(&solv->problems, solv->learnt_pool.count);
684 queue_push(&solv->learnt_pool, ri);
685 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
686 queue_push(&solv->learnt_pool, 0);
688 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "conflicting update/job assertions over literal %d\n", vv);
691 * push all of our rules (can only be feature or job rules)
692 * asserting this literal on the problem stack
695 for (i = solv->featurerules, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
697 if (rr->d < 0 /* disabled */
698 || rr->w2) /* or no assertion */
700 if (rr->p != vv /* not affecting the literal */
703 if (MAPTST(&solv->weakrulemap, i)) /* weak: silently ignore */
706 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, " - disabling rule #%d\n", i);
708 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, solv->rules + i);
711 /* is is a job rule ? */
712 if (i >= solv->jobrules && i < solv->jobrules_end)
713 v = -(solv->ruletojob.elements[i - solv->jobrules] + 1);
715 queue_push(&solv->problems, v);
716 disableproblem(solv, v);
718 queue_push(&solv->problems, 0);
722 * (back up from decisions)
724 while (solv->decisionq.count > decisionstart)
726 v = solv->decisionq.elements[--solv->decisionq.count];
727 --solv->decisionq_why.count;
729 solv->decisionmap[vv] = 0;
731 ii = -1; /* restarts loop at 0 */
735 * phase 2: now do the weak assertions
737 for (ii = 0; ii < solv->ruleassertions.count; ii++)
739 ri = solv->ruleassertions.elements[ii];
740 r = solv->rules + ri;
741 if (r->d < 0 || r->w2) /* disabled or no assertion */
743 if (!MAPTST(&solv->weakrulemap, ri)) /* skip non-weak */
749 * (if not yet decided)
751 if (!solv->decisionmap[vv])
753 queue_push(&solv->decisionq, v);
754 queue_push(&solv->decisionq_why, r - solv->rules);
755 solv->decisionmap[vv] = v > 0 ? 1 : -1;
756 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
758 Solvable *s = solv->pool->solvables + vv;
760 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", solvable2str(solv->pool, s));
762 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "installing %s (weak assertion)\n", solvable2str(solv->pool, s));
767 * previously decided, sane ?
769 if (v > 0 && solv->decisionmap[vv] > 0)
771 if (v < 0 && solv->decisionmap[vv] < 0)
774 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "assertion conflict, but I am weak, disabling ");
775 solver_printrule(solv, SAT_DEBUG_UNSOLVABLE, r);
776 disablerule(solv, r);
779 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- makeruledecisions end; size decisionq: %d -----\n",solv->decisionq.count);
783 /*-------------------------------------------------------------------
784 * enable/disable learnt rules
786 * we have enabled or disabled some of our rules. We now reenable all
787 * of our learnt rules but the ones that were learnt from rules that
791 enabledisablelearntrules(Solver *solv)
793 Pool *pool = solv->pool;
798 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "enabledisablelearntrules called\n");
799 for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
801 whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules];
802 while ((why = *whyp++) != 0)
804 assert(why > 0 && why < i);
805 if (solv->rules[why].d < 0)
808 /* why != 0: we found a disabled rule, disable the learnt rule */
809 if (why && r->d >= 0)
811 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
813 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "disabling ");
814 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
816 disablerule(solv, r);
818 else if (!why && r->d < 0)
820 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
822 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "re-enabling ");
823 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
831 /*-------------------------------------------------------------------
834 * Enable all rules, except learnt rules, which are
835 * - disabled and weak (set in weakrulemap)
840 enableweakrules(Solver *solv)
845 for (i = 1, r = solv->rules + i; i < solv->learntrules; i++, r++)
847 if (r->d >= 0) /* skip non-direct literals */
849 if (!MAPTST(&solv->weakrulemap, i))
856 /* FIXME: bad code ahead, replace as soon as possible */
857 /* FIXME: should probably look at SOLVER_INSTALL|SOLVABLE_ONE_OF */
859 /*-------------------------------------------------------------------
860 * disable update rules
864 disableupdaterules(Solver *solv, Queue *job, int jobidx)
866 Pool *pool = solv->pool;
868 Id how, select, what, p, pp;
874 installed = solv->installed;
880 how = job->elements[jobidx];
881 select = how & SOLVER_SELECTMASK;
882 switch (how & SOLVER_JOBMASK)
887 if (select != SOLVER_SOLVABLE)
894 /* go through all enabled job rules */
895 MAPZERO(&solv->noupdate);
896 for (i = solv->jobrules; i < solv->jobrules_end; i++)
899 if (r->d < 0) /* disabled? */
901 j = solv->ruletojob.elements[i - solv->jobrules];
905 how = job->elements[j];
906 what = job->elements[j + 1];
907 select = how & SOLVER_SELECTMASK;
908 switch (how & SOLVER_JOBMASK)
911 if (select != SOLVER_SOLVABLE)
913 s = pool->solvables + what;
914 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, what))
916 if (s->repo == installed)
918 MAPSET(&solv->noupdate, what - installed->start);
924 obsp = s->repo->idarraydata + s->obsoletes;
925 while ((obs = *obsp++) != 0)
926 FOR_PROVIDES(p, pp, obs)
928 if (pool->solvables[p].repo != installed)
930 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
932 MAPSET(&solv->noupdate, p - installed->start);
935 FOR_PROVIDES(p, pp, s->name)
937 if (!solv->implicitobsoleteusesprovides && pool->solvables[p].name != s->name)
939 if (pool->solvables[p].repo == installed)
940 MAPSET(&solv->noupdate, p - installed->start);
944 FOR_JOB_SELECT(p, pp, select, what)
945 if (pool->solvables[p].repo == installed)
946 MAPSET(&solv->noupdate, p - installed->start);
953 /* fixup update rule status */
956 /* we just disabled job #jobidx. enable all update rules
957 * that aren't disabled by the remaining job rules */
958 how = job->elements[jobidx];
959 what = job->elements[jobidx + 1];
960 select = how & SOLVER_SELECTMASK;
961 switch (how & SOLVER_JOBMASK)
964 if (select != SOLVER_SOLVABLE)
966 s = pool->solvables + what;
967 if (s->repo == installed)
969 r = solv->rules + solv->updaterules + (what - installed->start);
973 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
975 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
976 solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
983 obsp = s->repo->idarraydata + s->obsoletes;
984 while ((obs = *obsp++) != 0)
985 FOR_PROVIDES(p, pp, obs)
987 if (pool->solvables[p].repo != installed)
989 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
991 if (MAPTST(&solv->noupdate, p - installed->start))
993 r = solv->rules + solv->updaterules + (p - installed->start);
997 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
999 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1000 solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
1004 FOR_PROVIDES(p, pp, s->name)
1006 if (!solv->implicitobsoleteusesprovides && pool->solvables[p].name != s->name)
1008 if (pool->solvables[p].repo != installed)
1010 if (MAPTST(&solv->noupdate, p - installed->start))
1012 r = solv->rules + solv->updaterules + (p - installed->start);
1015 enablerule(solv, r);
1016 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
1018 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1019 solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
1024 FOR_JOB_SELECT(p, pp, select, what)
1026 if (pool->solvables[p].repo != installed)
1028 if (MAPTST(&solv->noupdate, p - installed->start))
1030 r = solv->rules + solv->updaterules + (p - installed->start);
1033 enablerule(solv, r);
1034 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
1036 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1037 solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
1047 for (i = 0; i < installed->nsolvables; i++)
1049 r = solv->rules + solv->updaterules + i;
1050 if (r->d >= 0 && MAPTST(&solv->noupdate, i))
1051 disablerule(solv, r); /* was enabled, need to disable */
1052 r = solv->rules + solv->featurerules + i;
1053 if (r->d >= 0 && MAPTST(&solv->noupdate, i))
1054 disablerule(solv, r); /* was enabled, need to disable */
1060 * special multiversion patch conflict handling:
1061 * a patch conflict is also satisfied, if some other
1062 * version with the same name/arch that doesn't conflict
1063 * get's installed. The generated rule is thus:
1064 * -patch|-cpack|opack1|opack2|...
1067 makemultiversionconflict(Solver *solv, Id n, Id con)
1069 Pool *pool = solv->pool;
1074 sn = pool->solvables + n;
1075 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
1077 FOR_PROVIDES(p, pp, sn->name)
1079 s = pool->solvables + p;
1080 if (s->name != sn->name || s->arch != sn->arch)
1082 if (!MAPTST(&solv->noobsoletes, p))
1084 if (pool_match_nevr(pool, pool->solvables + p, con))
1086 /* here we have a multiversion solvable that doesn't conflict */
1087 /* thus we're not in conflict if it is installed */
1091 return -n; /* no other package found, generate normal conflict */
1092 return pool_queuetowhatprovides(pool, &q);
1096 /*-------------------------------------------------------------------
1098 * add (install) rules for solvable
1100 * s: Solvable for which to add rules
1101 * m: m[s] = 1 for solvables which have rules, prevent rule duplication
1103 * Algorithm: 'visit all nodes of a graph'. The graph nodes are
1104 * solvables, the edges their dependencies.
1105 * Starting from an installed solvable, this will create all rules
1106 * representing the graph created by the solvables dependencies.
1108 * for unfulfilled requirements, conflicts, obsoletes,....
1109 * add a negative assertion for solvables that are not installable
1111 * It will also create rules for all solvables referenced by 's'
1112 * i.e. descend to all providers of requirements of 's'
1117 addrpmrulesforsolvable(Solver *solv, Solvable *s, Map *m)
1119 Pool *pool = solv->pool;
1120 Repo *installed = solv->installed;
1122 /* 'work' queue. keeps Ids of solvables we still have to work on.
1123 And buffer for it. */
1128 /* if to add rules for broken deps ('rpm -V' functionality)
1132 /* Id var and pointer for each dependency
1133 * (not used in parallel)
1140 /* var and ptr for loops */
1142 /* ptr to 'whatprovides' */
1144 /* Id for current solvable 's' */
1147 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforsolvable -----\n");
1149 queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
1150 queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
1152 /* loop until there's no more work left */
1157 * s: Pointer to solvable
1160 n = queue_shift(&workq); /* 'pop' next solvable to work on from queue */
1161 if (MAPTST(m, n)) /* continue if already visited */
1164 MAPSET(m, n); /* mark as visited */
1165 s = pool->solvables + n; /* s = Solvable in question */
1168 if (installed /* Installed system available */
1169 && !solv->fixsystem /* NOT repair errors in rpm dependency graph */
1170 && s->repo == installed) /* solvable is installed? */
1172 dontfix = 1; /* dont care about broken rpm deps */
1176 && s->arch != ARCH_SRC
1177 && s->arch != ARCH_NOSRC
1178 && !pool_installable(pool, s))
1180 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", solvable2str(pool, s), (Id)(s - pool->solvables));
1181 addrule(solv, -n, 0); /* uninstallable */
1184 /*-----------------------------------------
1185 * check requires of s
1190 reqp = s->repo->idarraydata + s->requires;
1191 while ((req = *reqp++) != 0) /* go through all requires */
1193 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
1196 /* find list of solvables providing 'req' */
1197 dp = pool->whatprovidesdata + pool_whatprovides(pool, req);
1199 if (*dp == SYSTEMSOLVABLE) /* always installed */
1204 /* the strategy here is to not insist on dependencies
1205 * that are already broken. so if we find one provider
1206 * that was already installed, we know that the
1207 * dependency was not broken before so we enforce it */
1209 /* check if any of the providers for 'req' is installed */
1210 for (i = 0; (p = dp[i]) != 0; i++)
1212 if (pool->solvables[p].repo == installed)
1213 break; /* provider was installed */
1215 /* didn't find an installed provider: previously broken dependency */
1218 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", dep2str(pool, req), solvable2str(pool, s));
1225 /* nothing provides req! */
1226 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", solvable2str(pool, s), (Id)(s - pool->solvables), dep2str(pool, req));
1227 addrule(solv, -n, 0); /* mark requestor as uninstallable */
1231 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
1233 POOL_DEBUG(SAT_DEBUG_RULE_CREATION," %s requires %s\n", solvable2str(pool, s), dep2str(pool, req));
1234 for (i = 0; dp[i]; i++)
1235 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, " provided by %s\n", solvable2str(pool, pool->solvables + dp[i]));
1238 /* add 'requires' dependency */
1239 /* rule: (-requestor|provider1|provider2|...|providerN) */
1240 addrule(solv, -n, dp - pool->whatprovidesdata);
1242 /* descend the dependency tree
1243 push all non-visited providers on the work queue */
1246 if (!MAPTST(m, *dp))
1247 queue_push(&workq, *dp);
1250 } /* while, requirements of n */
1252 } /* if, requirements */
1254 /* that's all we check for src packages */
1255 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
1258 /*-----------------------------------------
1259 * check conflicts of s
1266 /* we treat conflicts in patches a bit differen:
1268 * - multiversion handling
1269 * XXX: we should really handle this different, looking
1270 * at the name is a bad hack
1272 if (!strncmp("patch:", id2str(pool, s->name), 6))
1274 conp = s->repo->idarraydata + s->conflicts;
1275 /* foreach conflicts of 's' */
1276 while ((con = *conp++) != 0)
1278 /* foreach providers of a conflict of 's' */
1279 FOR_PROVIDES(p, pp, con)
1281 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
1283 /* dontfix: dont care about conflicts with already installed packs */
1284 if (dontfix && pool->solvables[p].repo == installed)
1286 /* p == n: self conflict */
1287 if (p == n && !solv->allowselfconflicts)
1291 Reldep *rd = GETRELDEP(pool, con);
1292 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
1295 p = 0; /* make it a negative assertion, aka 'uninstallable' */
1297 if (p && ispatch && solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p) && ISRELDEP(con))
1299 /* our patch conflicts with a noobsoletes (aka multiversion) package */
1300 p = -makemultiversionconflict(solv, p, con);
1302 /* rule: -n|-p: either solvable _or_ provider of conflict */
1303 addrule(solv, -n, -p);
1308 /*-----------------------------------------
1309 * check obsoletes if not installed
1310 * (only installation will trigger the obsoletes in rpm)
1312 if (!installed || pool->solvables[n].repo != installed)
1313 { /* not installed */
1314 int noobs = solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n);
1315 if (s->obsoletes && !noobs)
1317 obsp = s->repo->idarraydata + s->obsoletes;
1318 /* foreach obsoletes */
1319 while ((obs = *obsp++) != 0)
1321 /* foreach provider of an obsoletes of 's' */
1322 FOR_PROVIDES(p, pp, obs)
1324 if (!solv->obsoleteusesprovides /* obsoletes are matched names, not provides */
1325 && !pool_match_nevr(pool, pool->solvables + p, obs))
1327 addrule(solv, -n, -p);
1331 FOR_PROVIDES(p, pp, s->name)
1333 Solvable *ps = pool->solvables + p;
1334 /* we still obsolete packages with same nevra, like rpm does */
1335 /* (actually, rpm mixes those packages. yuck...) */
1336 if (noobs && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
1338 if (!solv->implicitobsoleteusesprovides && s->name != ps->name)
1340 addrule(solv, -n, -p);
1344 /*-----------------------------------------
1345 * add recommends to the work queue
1349 recp = s->repo->idarraydata + s->recommends;
1350 while ((rec = *recp++) != 0)
1352 FOR_PROVIDES(p, pp, rec)
1354 queue_push(&workq, p);
1359 sugp = s->repo->idarraydata + s->suggests;
1360 while ((sug = *sugp++) != 0)
1362 FOR_PROVIDES(p, pp, sug)
1364 queue_push(&workq, p);
1369 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforsolvable end -----\n");
1373 /*-------------------------------------------------------------------
1375 * Add package rules for weak rules
1377 * m: visited solvables
1381 addrpmrulesforweak(Solver *solv, Map *m)
1383 Pool *pool = solv->pool;
1388 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforweak -----\n");
1389 /* foreach solvable in pool */
1390 for (i = n = 1; n < pool->nsolvables; i++, n++)
1392 if (i == pool->nsolvables) /* wrap i */
1394 if (MAPTST(m, i)) /* been there */
1397 s = pool->solvables + i;
1398 if (!pool_installable(pool, s)) /* only look at installable ones */
1404 /* find possible supplements */
1405 supp = s->repo->idarraydata + s->supplements;
1406 while ((sup = *supp++) != ID_NULL)
1407 if (dep_possible(solv, sup, m))
1411 /* if nothing found, check for enhances */
1412 if (!sup && s->enhances)
1414 supp = s->repo->idarraydata + s->enhances;
1415 while ((sup = *supp++) != ID_NULL)
1416 if (dep_possible(solv, sup, m))
1419 /* if nothing found, goto next solvables */
1422 addrpmrulesforsolvable(solv, s, m);
1425 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforweak end -----\n");
1429 /*-------------------------------------------------------------------
1431 * add package rules for possible updates
1434 * m: map of already visited solvables
1435 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1439 addrpmrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
1441 Pool *pool = solv->pool;
1443 /* queue and buffer for it */
1447 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforupdaters -----\n");
1449 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1450 /* find update candidates for 's' */
1451 policy_findupdatepackages(solv, s, &qs, allow_all);
1452 /* add rule for 's' if not already done */
1453 if (!MAPTST(m, s - pool->solvables))
1454 addrpmrulesforsolvable(solv, s, m);
1455 /* foreach update candidate, add rule if not already done */
1456 for (i = 0; i < qs.count; i++)
1457 if (!MAPTST(m, qs.elements[i]))
1458 addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
1461 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforupdaters -----\n");
1465 finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
1467 Pool *pool = solv->pool;
1470 policy_findupdatepackages(solv, s, qs, allow_all);
1475 policy_findupdatepackages(solv, s, qs, 1);
1477 return 0; /* orphaned */
1479 return -SYSTEMSOLVABLE;
1482 return s - pool->solvables;
1483 /* check if it is ok to keep the installed package */
1484 for (i = 0; i < qs->count; i++)
1486 Solvable *ns = pool->solvables + qs->elements[i];
1487 if (s->evr == ns->evr && solvable_identical(pool, s, ns))
1488 return s - pool->solvables;
1490 /* nope, it must be some other package */
1491 return -SYSTEMSOLVABLE;
1494 /*-------------------------------------------------------------------
1496 * add rule for update
1497 * (A|A1|A2|A3...) An = update candidates for A
1499 * s = (installed) solvable
1503 addupdaterule(Solver *solv, Solvable *s, int allow_all)
1505 /* installed packages get a special upgrade allowed rule */
1506 Pool *pool = solv->pool;
1511 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addupdaterule -----\n");
1512 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1513 p = s - pool->solvables;
1514 /* find update candidates for 's' */
1515 if (solv->distupgrade)
1516 p = finddistupgradepackages(solv, s, &qs, allow_all);
1518 policy_findupdatepackages(solv, s, &qs, allow_all);
1519 if (!allow_all && qs.count && solv->noobsoletes.size)
1523 d = pool_queuetowhatprovides(pool, &qs);
1524 /* filter out all noobsoletes packages as they don't update */
1525 for (i = j = 0; i < qs.count; i++)
1527 if (MAPTST(&solv->noobsoletes, qs.elements[i]))
1529 /* it's ok if they have same nevra */
1530 Solvable *ps = pool->solvables + qs.elements[i];
1531 if (ps->name != s->name || ps->evr != s->evr || ps->arch != s->arch)
1534 qs.elements[j++] = qs.elements[i];
1536 if (j == 0 && p == -SYSTEMSOLVABLE && solv->distupgrade)
1538 queue_push(&solv->orphaned, s - pool->solvables); /* treat as orphaned */
1543 if (d && solv->updatesystem && solv->installed && s->repo == solv->installed)
1545 if (!solv->multiversionupdaters)
1546 solv->multiversionupdaters = sat_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
1547 solv->multiversionupdaters[s - pool->solvables - solv->installed->start] = d;
1552 if (qs.count && p == -SYSTEMSOLVABLE)
1553 p = queue_shift(&qs);
1554 d = qs.count ? pool_queuetowhatprovides(pool, &qs) : 0;
1556 addrule(solv, p, d); /* allow update of s */
1557 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addupdaterule end -----\n");
1561 /********************************************************************/
1565 /*-------------------------------------------------------------------
1568 * initial setup for all watches
1572 makewatches(Solver *solv)
1576 int nsolvables = solv->pool->nsolvables;
1578 sat_free(solv->watches);
1579 /* lower half for removals, upper half for installs */
1580 solv->watches = sat_calloc(2 * nsolvables, sizeof(Id));
1582 /* do it reverse so rpm rules get triggered first (XXX: obsolete?) */
1583 for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
1585 for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
1588 if (!r->w2) /* assertions do not need watches */
1591 /* see addwatches_rule(solv, r) */
1592 r->n1 = solv->watches[nsolvables + r->w1];
1593 solv->watches[nsolvables + r->w1] = r - solv->rules;
1595 r->n2 = solv->watches[nsolvables + r->w2];
1596 solv->watches[nsolvables + r->w2] = r - solv->rules;
1601 /*-------------------------------------------------------------------
1603 * add watches (for rule)
1604 * sets up watches for a single rule
1606 * see also makewatches()
1610 addwatches_rule(Solver *solv, Rule *r)
1612 int nsolvables = solv->pool->nsolvables;
1614 r->n1 = solv->watches[nsolvables + r->w1];
1615 solv->watches[nsolvables + r->w1] = r - solv->rules;
1617 r->n2 = solv->watches[nsolvables + r->w2];
1618 solv->watches[nsolvables + r->w2] = r - solv->rules;
1622 /********************************************************************/
1628 /* shortcuts to check if a literal (positive or negative) assignment
1629 * evaluates to 'true' or 'false'
1631 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
1632 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
1633 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
1635 /*-------------------------------------------------------------------
1639 * make decision and propagate to all rules
1641 * Evaluate each term affected by the decision (linked through watches)
1642 * If we find unit rules we make new decisions based on them
1644 * Everything's fixed there, it's just finding rules that are
1647 * return : 0 = everything is OK
1648 * rule = conflict found in this rule
1652 propagate(Solver *solv, int level)
1654 Pool *pool = solv->pool;
1655 Id *rp, *next_rp; /* rule pointer, next rule pointer in linked list */
1657 Id p, pkg, other_watch;
1659 Id *decisionmap = solv->decisionmap;
1661 Id *watches = solv->watches + pool->nsolvables; /* place ptr in middle */
1663 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "----- propagate -----\n");
1665 /* foreach non-propagated decision */
1666 while (solv->propagate_index < solv->decisionq.count)
1669 * 'pkg' was just decided
1670 * negate because our watches trigger if literal goes FALSE
1672 pkg = -solv->decisionq.elements[solv->propagate_index++];
1674 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1676 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "propagate for decision %d level %d\n", -pkg, level);
1677 solver_printruleelement(solv, SAT_DEBUG_PROPAGATE, 0, -pkg);
1680 /* foreach rule where 'pkg' is now FALSE */
1681 for (rp = watches + pkg; *rp; rp = next_rp)
1683 r = solv->rules + *rp;
1686 /* rule is disabled, goto next */
1694 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1696 POOL_DEBUG(SAT_DEBUG_PROPAGATE," watch triggered ");
1697 solver_printrule(solv, SAT_DEBUG_PROPAGATE, r);
1700 /* 'pkg' was just decided (was set to FALSE)
1702 * now find other literal watch, check clause
1703 * and advance on linked list
1707 other_watch = r->w2;
1712 other_watch = r->w1;
1717 * This term is already true (through the other literal)
1718 * so we have nothing to do
1720 if (DECISIONMAP_TRUE(other_watch))
1724 * The other literal is FALSE or UNDEF
1730 /* Not a binary clause, try to move our watch.
1732 * Go over all literals and find one that is
1736 * (TRUE is also ok, in that case the rule is fulfilled)
1738 if (r->p /* we have a 'p' */
1739 && r->p != other_watch /* which is not watched */
1740 && !DECISIONMAP_FALSE(r->p)) /* and not FALSE */
1744 else /* go find a 'd' to make 'true' */
1747 we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
1749 for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
1751 if (p != other_watch /* which is not watched */
1752 && !DECISIONMAP_FALSE(p)) /* and not FALSE */
1760 * if we found some p that is UNDEF or TRUE, move
1763 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1766 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), solvable2str(pool, pool->solvables + p));
1768 POOL_DEBUG(SAT_DEBUG_PROPAGATE," -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), solvable2str(pool, pool->solvables - p));
1784 watches[p] = r - solv->rules;
1787 /* search failed, thus all unwatched literals are FALSE */
1792 * unit clause found, set literal other_watch to TRUE
1795 if (DECISIONMAP_FALSE(other_watch)) /* check if literal is FALSE */
1796 return r; /* eek, a conflict! */
1798 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1800 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " unit ");
1801 solver_printrule(solv, SAT_DEBUG_PROPAGATE, r);
1804 if (other_watch > 0)
1805 decisionmap[other_watch] = level; /* install! */
1807 decisionmap[-other_watch] = -level; /* remove! */
1809 queue_push(&solv->decisionq, other_watch);
1810 queue_push(&solv->decisionq_why, r - solv->rules);
1812 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1814 Solvable *s = pool->solvables + (other_watch > 0 ? other_watch : -other_watch);
1815 if (other_watch > 0)
1816 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> decided to install %s\n", solvable2str(pool, s));
1818 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> decided to conflict %s\n", solvable2str(pool, s));
1821 } /* foreach rule involving 'pkg' */
1823 } /* while we have non-decided decisions */
1825 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "----- propagate end-----\n");
1827 return 0; /* all is well */
1831 /********************************************************************/
1834 /*-------------------------------------------------------------------
1841 analyze(Solver *solv, int level, Rule *c, int *pr, int *dr, int *whyp)
1843 Pool *pool = solv->pool;
1846 Map seen; /* global? */
1847 Id d, v, vv, *dp, why;
1849 int num = 0, l1num = 0;
1850 int learnt_why = solv->learnt_pool.count;
1851 Id *decisionmap = solv->decisionmap;
1855 POOL_DEBUG(SAT_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
1856 map_init(&seen, pool->nsolvables);
1857 idx = solv->decisionq.count;
1860 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
1861 solver_printruleclass(solv, SAT_DEBUG_ANALYZE, c);
1862 queue_push(&solv->learnt_pool, c - solv->rules);
1863 d = c->d < 0 ? -c->d - 1 : c->d;
1864 dp = d ? pool->whatprovidesdata + d : 0;
1865 /* go through all literals of the rule */
1877 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1879 vv = v > 0 ? v : -v;
1880 if (MAPTST(&seen, vv))
1882 l = solv->decisionmap[vv];
1887 l1num++; /* need to do this one in level1 pass */
1888 else if (l == level)
1889 num++; /* need to do this one as well */
1892 queue_push(&r, v); /* not level1 or conflict level, add to new rule */
1898 if (!num && !--l1num)
1899 break; /* all level 1 literals done */
1903 v = solv->decisionq.elements[--idx];
1904 vv = v > 0 ? v : -v;
1905 if (MAPTST(&seen, vv))
1909 if (num && --num == 0)
1911 *pr = -v; /* so that v doesn't get lost */
1914 POOL_DEBUG(SAT_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
1915 for (i = 0; i < r.count; i++)
1918 MAPCLR(&seen, v > 0 ? v : -v);
1920 /* only level 1 marks left */
1924 why = solv->decisionq_why.elements[idx];
1925 if (!why) /* just in case, maybe for SYSTEMSOLVABLE */
1927 c = solv->rules + why;
1933 else if (r.count == 1 && r.elements[0] < 0)
1934 *dr = r.elements[0];
1936 *dr = pool_queuetowhatprovides(pool, &r);
1937 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
1939 POOL_DEBUG(SAT_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
1940 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, *pr);
1941 for (i = 0; i < r.count; i++)
1942 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, r.elements[i]);
1944 /* push end marker on learnt reasons stack */
1945 queue_push(&solv->learnt_pool, 0);
1948 solv->stats_learned++;
1953 /*-------------------------------------------------------------------
1957 * reset the solver decisions to right after the rpm rules.
1958 * called after rules have been enabled/disabled
1962 reset_solver(Solver *solv)
1964 Pool *pool = solv->pool;
1968 /* rewind decisions to direct rpm rule assertions */
1969 for (i = solv->decisionq.count - 1; i >= solv->directdecisions; i--)
1971 v = solv->decisionq.elements[i];
1972 solv->decisionmap[v > 0 ? v : -v] = 0;
1975 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "decisions done reduced from %d to %d\n", solv->decisionq.count, solv->directdecisions);
1977 solv->decisionq_why.count = solv->directdecisions;
1978 solv->decisionq.count = solv->directdecisions;
1979 solv->recommends_index = -1;
1980 solv->propagate_index = 0;
1982 /* adapt learnt rule status to new set of enabled/disabled rules */
1983 enabledisablelearntrules(solv);
1985 /* redo all job/update decisions */
1986 makeruledecisions(solv);
1987 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "decisions so far: %d\n", solv->decisionq.count);
1991 /*-------------------------------------------------------------------
1993 * analyze_unsolvable_rule
1997 analyze_unsolvable_rule(Solver *solv, Rule *r, Id *lastweakp)
1999 Pool *pool = solv->pool;
2001 Id why = r - solv->rules;
2003 IF_POOLDEBUG (SAT_DEBUG_UNSOLVABLE)
2004 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, r);
2005 if (solv->learntrules && why >= solv->learntrules)
2007 for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
2008 if (solv->learnt_pool.elements[i] > 0)
2009 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp);
2012 if (MAPTST(&solv->weakrulemap, why))
2013 if (!*lastweakp || why > *lastweakp)
2015 /* do not add rpm rules to problem */
2016 if (why < solv->rpmrules_end)
2018 /* turn rule into problem */
2019 if (why >= solv->jobrules && why < solv->jobrules_end)
2020 why = -(solv->ruletojob.elements[why - solv->jobrules] + 1);
2021 /* return if problem already countains our rule */
2022 if (solv->problems.count)
2024 for (i = solv->problems.count - 1; i >= 0; i--)
2025 if (solv->problems.elements[i] == 0) /* end of last problem reached? */
2027 else if (solv->problems.elements[i] == why)
2030 queue_push(&solv->problems, why);
2034 /*-------------------------------------------------------------------
2036 * analyze_unsolvable
2038 * return: 1 - disabled some rules, try again
2043 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
2045 Pool *pool = solv->pool;
2047 Map seen; /* global to speed things up? */
2048 Id d, v, vv, *dp, why;
2050 Id *decisionmap = solv->decisionmap;
2051 int oldproblemcount;
2052 int oldlearntpoolcount;
2055 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
2056 solv->stats_unsolvable++;
2057 oldproblemcount = solv->problems.count;
2058 oldlearntpoolcount = solv->learnt_pool.count;
2060 /* make room for proof index */
2061 /* must update it later, as analyze_unsolvable_rule would confuse
2062 * it with a rule index if we put the real value in already */
2063 queue_push(&solv->problems, 0);
2066 map_init(&seen, pool->nsolvables);
2067 queue_push(&solv->learnt_pool, r - solv->rules);
2069 analyze_unsolvable_rule(solv, r, &lastweak);
2070 d = r->d < 0 ? -r->d - 1 : r->d;
2071 dp = d ? pool->whatprovidesdata + d : 0;
2082 if (DECISIONMAP_TRUE(v)) /* the one true literal */
2084 vv = v > 0 ? v : -v;
2085 l = solv->decisionmap[vv];
2090 idx = solv->decisionq.count;
2093 v = solv->decisionq.elements[--idx];
2094 vv = v > 0 ? v : -v;
2095 if (!MAPTST(&seen, vv))
2097 why = solv->decisionq_why.elements[idx];
2098 queue_push(&solv->learnt_pool, why);
2099 r = solv->rules + why;
2100 analyze_unsolvable_rule(solv, r, &lastweak);
2101 d = r->d < 0 ? -r->d - 1 : r->d;
2102 dp = d ? pool->whatprovidesdata + d : 0;
2113 if (DECISIONMAP_TRUE(v)) /* the one true literal */
2115 vv = v > 0 ? v : -v;
2116 l = solv->decisionmap[vv];
2123 queue_push(&solv->problems, 0); /* mark end of this problem */
2127 /* disable last weak rule */
2128 solv->problems.count = oldproblemcount;
2129 solv->learnt_pool.count = oldlearntpoolcount;
2130 r = solv->rules + lastweak;
2131 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "disabling ");
2132 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, r);
2133 disablerule(solv, r);
2139 queue_push(&solv->learnt_pool, 0);
2140 solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
2144 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
2145 disableproblem(solv, solv->problems.elements[i]);
2146 /* XXX: might want to enable all weak rules again */
2150 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
2155 /********************************************************************/
2156 /* Decision revert */
2158 /*-------------------------------------------------------------------
2161 * revert decision at level
2165 revert(Solver *solv, int level)
2167 Pool *pool = solv->pool;
2169 while (solv->decisionq.count)
2171 v = solv->decisionq.elements[solv->decisionq.count - 1];
2172 vv = v > 0 ? v : -v;
2173 if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
2175 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
2176 if (v > 0 && solv->recommendations.count && v == solv->recommendations.elements[solv->recommendations.count - 1])
2177 solv->recommendations.count--;
2178 solv->decisionmap[vv] = 0;
2179 solv->decisionq.count--;
2180 solv->decisionq_why.count--;
2181 solv->propagate_index = solv->decisionq.count;
2183 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
2185 solv->branches.count--;
2186 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
2187 solv->branches.count--;
2189 solv->recommends_index = -1;
2193 /*-------------------------------------------------------------------
2195 * watch2onhighest - put watch2 on literal with highest level
2199 watch2onhighest(Solver *solv, Rule *r)
2204 d = r->d < 0 ? -r->d - 1 : r->d;
2206 return; /* binary rule, both watches are set */
2207 dp = solv->pool->whatprovidesdata + d;
2208 while ((v = *dp++) != 0)
2210 l = solv->decisionmap[v < 0 ? -v : v];
2222 /*-------------------------------------------------------------------
2226 * add free decision (solvable to install) to decisionq
2227 * increase level and propagate decision
2228 * return if no conflict.
2230 * in conflict case, analyze conflict rule, add resulting
2231 * rule to learnt rule set, make decision from learnt
2232 * rule (always unit) and re-propagate.
2234 * returns the new solver level or 0 if unsolvable
2239 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules)
2241 Pool *pool = solv->pool;
2250 solv->decisionmap[decision] = level;
2252 solv->decisionmap[-decision] = -level;
2253 queue_push(&solv->decisionq, decision);
2254 queue_push(&solv->decisionq_why, 0);
2258 r = propagate(solv, level);
2262 return analyze_unsolvable(solv, r, disablerules);
2263 POOL_DEBUG(SAT_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
2264 l = analyze(solv, level, r, &p, &d, &why); /* learnt rule in p and d */
2265 assert(l > 0 && l < level);
2266 POOL_DEBUG(SAT_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, l);
2268 revert(solv, level);
2269 r = addrule(solv, p, d); /* p requires d */
2271 assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
2272 queue_push(&solv->learnt_why, why);
2275 /* at least 2 literals, needs watches */
2276 watch2onhighest(solv, r);
2277 addwatches_rule(solv, r);
2281 /* learnt rule is an assertion */
2282 queue_push(&solv->ruleassertions, r - solv->rules);
2284 solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
2285 queue_push(&solv->decisionq, p);
2286 queue_push(&solv->decisionq_why, r - solv->rules);
2287 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
2289 POOL_DEBUG(SAT_DEBUG_ANALYZE, "decision: ");
2290 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, p);
2291 POOL_DEBUG(SAT_DEBUG_ANALYZE, "new rule: ");
2292 solver_printrule(solv, SAT_DEBUG_ANALYZE, r);
2299 /*-------------------------------------------------------------------
2301 * select and install
2303 * install best package from the queue. We add an extra package, inst, if
2304 * provided. See comment in weak install section.
2306 * returns the new solver level or 0 if unsolvable
2311 selectandinstall(Solver *solv, int level, Queue *dq, int disablerules)
2313 Pool *pool = solv->pool;
2318 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
2321 /* XXX: didn't we already do that? */
2322 /* XXX: shouldn't we prefer installed packages? */
2323 /* XXX: move to policy.c? */
2324 /* choose the supplemented one */
2325 for (i = 0; i < dq->count; i++)
2326 if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
2328 dq->elements[0] = dq->elements[i];
2335 /* multiple candidates, open a branch */
2336 for (i = 1; i < dq->count; i++)
2337 queue_push(&solv->branches, dq->elements[i]);
2338 queue_push(&solv->branches, -level);
2340 p = dq->elements[0];
2342 POOL_DEBUG(SAT_DEBUG_POLICY, "installing %s\n", solvable2str(pool, pool->solvables + p));
2344 return setpropagatelearn(solv, level, p, disablerules);
2348 /********************************************************************/
2349 /* Main solver interface */
2352 /*-------------------------------------------------------------------
2355 * create solver structure
2357 * pool: all available solvables
2358 * installed: installed Solvables
2361 * Upon solving, rules are created to flag the Solvables
2362 * of the 'installed' Repo as installed.
2366 solver_create(Pool *pool)
2369 solv = (Solver *)sat_calloc(1, sizeof(Solver));
2371 solv->installed = pool->installed;
2373 queue_init(&solv->ruletojob);
2374 queue_init(&solv->decisionq);
2375 queue_init(&solv->decisionq_why);
2376 queue_init(&solv->problems);
2377 queue_init(&solv->suggestions);
2378 queue_init(&solv->recommendations);
2379 queue_init(&solv->orphaned);
2380 queue_init(&solv->learnt_why);
2381 queue_init(&solv->learnt_pool);
2382 queue_init(&solv->branches);
2383 queue_init(&solv->covenantq);
2384 queue_init(&solv->weakruleq);
2385 queue_init(&solv->ruleassertions);
2387 map_init(&solv->recommendsmap, pool->nsolvables);
2388 map_init(&solv->suggestsmap, pool->nsolvables);
2389 map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
2390 solv->recommends_index = 0;
2392 solv->decisionmap = (Id *)sat_calloc(pool->nsolvables, sizeof(Id));
2394 solv->rules = sat_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
2395 memset(solv->rules, 0, sizeof(Rule));
2401 /*-------------------------------------------------------------------
2407 solver_free(Solver *solv)
2409 queue_free(&solv->ruletojob);
2410 queue_free(&solv->decisionq);
2411 queue_free(&solv->decisionq_why);
2412 queue_free(&solv->learnt_why);
2413 queue_free(&solv->learnt_pool);
2414 queue_free(&solv->problems);
2415 queue_free(&solv->suggestions);
2416 queue_free(&solv->recommendations);
2417 queue_free(&solv->orphaned);
2418 queue_free(&solv->branches);
2419 queue_free(&solv->covenantq);
2420 queue_free(&solv->weakruleq);
2421 queue_free(&solv->ruleassertions);
2423 map_free(&solv->recommendsmap);
2424 map_free(&solv->suggestsmap);
2425 map_free(&solv->noupdate);
2426 map_free(&solv->weakrulemap);
2427 map_free(&solv->noobsoletes);
2429 sat_free(solv->decisionmap);
2430 sat_free(solv->rules);
2431 sat_free(solv->watches);
2432 sat_free(solv->obsoletes);
2433 sat_free(solv->obsoletes_data);
2434 sat_free(solv->multiversionupdaters);
2439 /*-------------------------------------------------------------------
2443 * all rules have been set up, now actually run the solver
2448 run_solver(Solver *solv, int disablerules, int doweak)
2450 Queue dq; /* local decisionqueue */
2451 Queue dqs; /* local decisionqueue for supplements */
2457 Pool *pool = solv->pool;
2460 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
2462 POOL_DEBUG (SAT_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
2463 for (i = 1; i < solv->nrules; i++)
2464 solver_printruleclass(solv, SAT_DEBUG_RULE_CREATION, solv->rules + i);
2467 POOL_DEBUG(SAT_DEBUG_STATS, "initial decisions: %d\n", solv->decisionq.count);
2469 IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
2470 solver_printdecisions(solv);
2472 /* start SAT algorithm */
2474 systemlevel = level + 1;
2475 POOL_DEBUG(SAT_DEBUG_STATS, "solving...\n");
2481 * here's the main loop:
2482 * 1) propagate new decisions (only needed for level 1)
2483 * 2) try to keep installed packages
2484 * 3) fulfill all unresolved rules
2485 * 4) install recommended packages
2486 * 5) minimalize solution if we had choices
2487 * if we encounter a problem, we rewind to a safe level and restart
2499 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "propagating (propagate_index: %d; size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
2500 if ((r = propagate(solv, level)) != 0)
2502 if (analyze_unsolvable(solv, r, disablerules))
2510 if (level < systemlevel)
2512 POOL_DEBUG(SAT_DEBUG_STATS, "resolving job rules\n");
2513 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
2516 if (r->d < 0) /* ignore disabled rules */
2519 FOR_RULELITERALS(l, dp, r)
2523 if (solv->decisionmap[-l] <= 0)
2528 if (solv->decisionmap[l] > 0)
2530 if (solv->decisionmap[l] == 0)
2536 /* prune to installed if not updating */
2537 if (!solv->updatesystem && solv->installed && dq.count > 1)
2540 for (j = k = 0; j < dq.count; j++)
2542 Solvable *s = pool->solvables + dq.elements[j];
2543 if (s->repo == solv->installed)
2544 dq.elements[k++] = dq.elements[j];
2550 level = selectandinstall(solv, level, &dq, disablerules);
2557 if (level <= olevel)
2560 systemlevel = level + 1;
2561 if (i < solv->jobrules_end)
2567 * installed packages
2570 if (level < systemlevel && solv->installed && solv->installed->nsolvables)
2572 if (!solv->updatesystem)
2575 * Normal run (non-updating)
2576 * Keep as many packages installed as possible
2578 POOL_DEBUG(SAT_DEBUG_STATS, "installing old packages\n");
2580 for (i = solv->installed->start; i < solv->installed->end; i++)
2582 s = pool->solvables + i;
2584 /* skip if not installed */
2585 if (s->repo != solv->installed)
2588 /* skip if already decided */
2589 if (solv->decisionmap[i] != 0)
2592 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "keeping %s\n", solvable2str(pool, s));
2595 level = setpropagatelearn(solv, level, i, disablerules);
2597 if (level == 0) /* unsolvable */
2603 if (level <= olevel)
2606 systemlevel = level + 1;
2607 if (i < solv->installed->end)
2610 else if (solv->noobsoletes.size && solv->multiversionupdaters)
2612 /* see if we can multi-version install the newest package */
2613 for (i = solv->installed->start; i < solv->installed->end; i++)
2616 s = pool->solvables + i;
2617 if (s->repo != solv->installed)
2619 if (MAPTST(&solv->noupdate, i - solv->installed->start))
2621 d = solv->multiversionupdaters[i - solv->installed->start];
2626 while ((p = pool->whatprovidesdata[d++]) != 0)
2627 if (solv->decisionmap[p] >= 0)
2629 policy_filter_unwanted(solv, &dq, POLICY_MODE_CHOOSE);
2631 if (p != i && solv->decisionmap[p] == 0)
2634 POOL_DEBUG(SAT_DEBUG_POLICY, "installing (multi-version) %s\n", solvable2str(pool, pool->solvables + p));
2635 level = setpropagatelearn(solv, level, p, disablerules);
2642 if (level <= olevel)
2646 /* now that the best version is installed, try to
2647 * keep the original one */
2648 if (solv->decisionmap[p]) /* already decided? */
2650 r = solv->rules + solv->updaterules + (i - solv->installed->start);
2651 if (!r->p) /* update rule == feature rule? */
2652 r = r - solv->updaterules + solv->featurerules;
2653 if (r->p == p) /* allowed to keep package? */
2656 POOL_DEBUG(SAT_DEBUG_POLICY, "keeping (multi-version) %s\n", solvable2str(pool, pool->solvables + p));
2657 level = setpropagatelearn(solv, level, p, disablerules);
2664 if (level <= olevel)
2668 systemlevel = level + 1;
2669 if (i < solv->installed->end)
2673 POOL_DEBUG(SAT_DEBUG_STATS, "resolving update/feature rules\n");
2675 for (i = solv->installed->start, r = solv->rules + solv->updaterules; i < solv->installed->end; i++, r++)
2678 s = pool->solvables + i;
2680 /* skip if not installed (can't update) */
2681 if (s->repo != solv->installed)
2683 /* skip if already decided */
2684 if (solv->decisionmap[i] > 0)
2687 /* noupdate is set if a job is erasing the installed solvable or installing a specific version */
2688 if (MAPTST(&solv->noupdate, i - solv->installed->start))
2694 if (rr->d < 0) /* disabled -> look at feature rule ? */
2695 rr -= solv->installed->end - solv->installed->start;
2696 if (!rr->p) /* identical to update rule? */
2699 continue; /* no such rule or disabled */
2701 FOR_RULELITERALS(p, dp, rr)
2703 if (solv->decisionmap[p] > 0)
2705 if (solv->decisionmap[p] == 0)
2708 if (p || !dq.count) /* already fulfilled or empty */
2711 level = selectandinstall(solv, level, &dq, disablerules);
2718 if (level <= olevel)
2721 systemlevel = level + 1;
2722 if (i < solv->installed->end)
2726 if (level < systemlevel)
2727 systemlevel = level;
2733 POOL_DEBUG(SAT_DEBUG_POLICY, "deciding unresolved rules\n");
2734 for (i = 1, n = 1; ; i++, n++)
2736 if (n == solv->nrules)
2738 if (i == solv->nrules)
2740 r = solv->rules + i;
2741 if (r->d < 0) /* ignore disabled rules */
2746 /* binary or unary rule */
2747 /* need two positive undecided literals */
2748 if (r->p < 0 || r->w2 <= 0)
2750 if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
2752 queue_push(&dq, r->p);
2753 queue_push(&dq, r->w2);
2758 * all negative literals are installed
2759 * no positive literal is installed
2760 * i.e. the rule is not fulfilled and we
2761 * just need to decide on the positive literals
2765 if (solv->decisionmap[-r->p] <= 0)
2770 if (solv->decisionmap[r->p] > 0)
2772 if (solv->decisionmap[r->p] == 0)
2773 queue_push(&dq, r->p);
2775 dp = pool->whatprovidesdata + r->d;
2776 while ((p = *dp++) != 0)
2780 if (solv->decisionmap[-p] <= 0)
2785 if (solv->decisionmap[p] > 0)
2787 if (solv->decisionmap[p] == 0)
2794 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
2796 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "unfulfilled ");
2797 solver_printruleclass(solv, SAT_DEBUG_PROPAGATE, r);
2799 /* dq.count < 2 cannot happen as this means that
2800 * the rule is unit */
2801 assert(dq.count > 1);
2804 level = selectandinstall(solv, level, &dq, disablerules);
2811 if (level < systemlevel)
2814 } /* for(), decide */
2816 if (n != solv->nrules) /* continue if level < systemlevel */
2823 POOL_DEBUG(SAT_DEBUG_POLICY, "installing recommended packages\n");
2826 for (i = 1; i < pool->nsolvables; i++)
2828 if (solv->decisionmap[i] < 0)
2830 if (solv->decisionmap[i] > 0)
2832 /* installed, check for recommends */
2833 Id *recp, rec, pp, p;
2834 s = pool->solvables + i;
2835 if (solv->ignorealreadyrecommended && s->repo == solv->installed)
2837 /* XXX need to special case AND ? */
2840 recp = s->repo->idarraydata + s->recommends;
2841 while ((rec = *recp++) != 0)
2844 FOR_PROVIDES(p, pp, rec)
2846 if (solv->decisionmap[p] > 0)
2851 else if (solv->decisionmap[p] == 0)
2853 queue_pushunique(&dq, p);
2861 s = pool->solvables + i;
2862 if (!s->supplements)
2864 if (!pool_installable(pool, s))
2866 if (!solver_is_supplementing(solv, s))
2868 if (solv->ignorealreadyrecommended && solv->installed)
2869 queue_pushunique(&dqs, i); /* needs filter */
2871 queue_pushunique(&dq, i);
2874 if (solv->ignorealreadyrecommended && dqs.count)
2876 /* turn off all new packages */
2877 for (i = 0; i < solv->decisionq.count; i++)
2879 p = solv->decisionq.elements[i];
2882 s = pool->solvables + p;
2883 if (s->repo && s->repo != solv->installed)
2884 solv->decisionmap[p] = -solv->decisionmap[p];
2886 /* filter out old supplements */
2887 for (i = 0; i < dqs.count; i++)
2889 p = dqs.elements[i];
2890 s = pool->solvables + p;
2891 if (!s->supplements)
2893 if (!solver_is_supplementing(solv, s))
2894 queue_pushunique(&dq, p);
2896 /* undo turning off */
2897 for (i = 0; i < solv->decisionq.count; i++)
2899 p = solv->decisionq.elements[i];
2902 s = pool->solvables + p;
2903 if (s->repo && s->repo != solv->installed)
2904 solv->decisionmap[p] = -solv->decisionmap[p];
2910 policy_filter_unwanted(solv, &dq, POLICY_MODE_RECOMMEND);
2912 POOL_DEBUG(SAT_DEBUG_POLICY, "installing recommended %s\n", solvable2str(pool, pool->solvables + p));
2913 queue_push(&solv->recommendations, p);
2914 level = setpropagatelearn(solv, level, p, 0);
2919 if (solv->distupgrade && solv->installed)
2921 /* let's see if we can install some unsupported package */
2922 POOL_DEBUG(SAT_DEBUG_STATS, "deciding unsupported packages\n");
2923 for (i = 0; i < solv->orphaned.count; i++)
2925 p = solv->orphaned.elements[i];
2926 if (!solv->decisionmap[p])
2929 if (i < solv->orphaned.count)
2931 p = solv->orphaned.elements[i];
2932 if (solv->distupgrade_removeunsupported)
2934 POOL_DEBUG(SAT_DEBUG_STATS, "removing unsupported %s\n", solvable2str(pool, pool->solvables + p));
2935 level = setpropagatelearn(solv, level, -p, 0);
2939 POOL_DEBUG(SAT_DEBUG_STATS, "keeping unsupported %s\n", solvable2str(pool, pool->solvables + p));
2940 level = setpropagatelearn(solv, level, p, 0);
2946 if (solv->solution_callback)
2948 solv->solution_callback(solv, solv->solution_callback_data);
2949 if (solv->branches.count)
2951 int i = solv->branches.count - 1;
2952 int l = -solv->branches.elements[i];
2954 if (solv->branches.elements[i - 1] < 0)
2956 p = solv->branches.elements[i];
2957 POOL_DEBUG(SAT_DEBUG_STATS, "branching with %s\n", solvable2str(pool, pool->solvables + p));
2959 for (j = i + 1; j < solv->branches.count; j++)
2960 queue_push(&dq, solv->branches.elements[j]);
2961 solv->branches.count = i;
2963 revert(solv, level);
2965 for (j = 0; j < dq.count; j++)
2966 queue_push(&solv->branches, dq.elements[j]);
2968 level = setpropagatelearn(solv, level, p, disablerules);
2977 /* all branches done, we're finally finished */
2981 /* minimization step */
2982 if (solv->branches.count)
2984 int l = 0, lasti = -1, lastl = -1;
2986 for (i = solv->branches.count - 1; i >= 0; i--)
2988 p = solv->branches.elements[i];
2991 else if (p > 0 && solv->decisionmap[p] > l + 1)
2999 /* kill old solvable so that we do not loop */
3000 p = solv->branches.elements[lasti];
3001 solv->branches.elements[lasti] = 0;
3002 POOL_DEBUG(SAT_DEBUG_STATS, "minimizing %d -> %d with %s\n", solv->decisionmap[p], l, solvable2str(pool, pool->solvables + p));
3005 revert(solv, level);
3007 level = setpropagatelearn(solv, level, p, disablerules);
3019 POOL_DEBUG(SAT_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable\n", solv->stats_learned, solv->stats_unsolvable);
3021 POOL_DEBUG(SAT_DEBUG_STATS, "done solving.\n\n");
3027 /*-------------------------------------------------------------------
3031 * at this point, all rules that led to conflicts are disabled.
3032 * we re-enable all rules of a problem set but rule "sug", then
3033 * continue to disable more rules until there as again a solution.
3036 /* FIXME: think about conflicting assertions */
3039 refine_suggestion(Solver *solv, Queue *job, Id *problem, Id sug, Queue *refined)
3041 Pool *pool = solv->pool;
3047 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
3049 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "refine_suggestion start\n");
3050 for (i = 0; problem[i]; i++)
3052 if (problem[i] == sug)
3053 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "=> ");
3054 solver_printproblem(solv, problem[i]);
3057 queue_init(&disabled);
3058 queue_empty(refined);
3059 queue_push(refined, sug);
3061 /* re-enable all problem rules with the exception of "sug"(gestion) */
3065 for (i = 0; problem[i]; i++)
3066 if (problem[i] != sug)
3067 enableproblem(solv, problem[i]);
3070 disableupdaterules(solv, job, -(sug + 1));
3071 else if (sug >= solv->updaterules && sug < solv->updaterules_end)
3073 /* enable feature rule */
3074 Rule *r = solv->rules + solv->featurerules + (sug - solv->updaterules);
3076 enablerule(solv, r);
3079 enableweakrules(solv);
3083 int njob, nfeature, nupdate;
3084 queue_empty(&solv->problems);
3085 revert(solv, 1); /* XXX no longer needed? */
3088 if (!solv->problems.count)
3089 run_solver(solv, 0, 0);
3091 if (!solv->problems.count)
3093 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "no more problems!\n");
3094 IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
3095 solver_printdecisions(solv);
3096 break; /* great, no more problems */
3098 disabledcnt = disabled.count;
3099 /* start with 1 to skip over proof index */
3100 njob = nfeature = nupdate = 0;
3101 for (i = 1; i < solv->problems.count - 1; i++)
3103 /* ignore solutions in refined */
3104 v = solv->problems.elements[i];
3106 break; /* end of problem reached */
3107 for (j = 0; problem[j]; j++)
3108 if (problem[j] != sug && problem[j] == v)
3112 if (v >= solv->featurerules && v < solv->featurerules_end)
3118 if ((job->elements[-v -1] & SOLVER_ESSENTIAL) != 0)
3119 continue; /* not that one! */
3122 queue_push(&disabled, v);
3124 if (disabled.count == disabledcnt)
3126 /* no solution found, this was an invalid suggestion! */
3127 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "no solution found!\n");
3131 if (!njob && nupdate && nfeature)
3133 /* got only update rules, filter out feature rules */
3134 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "throwing away feature rules\n");
3135 for (i = j = disabledcnt; i < disabled.count; i++)
3137 v = disabled.elements[i];
3138 if (v < solv->featurerules || v >= solv->featurerules_end)
3139 disabled.elements[j++] = v;
3144 if (disabled.count == disabledcnt + 1)
3146 /* just one suggestion, add it to refined list */
3147 v = disabled.elements[disabledcnt];
3149 queue_push(refined, v); /* do not record feature rules */
3150 disableproblem(solv, v);
3151 if (v >= solv->updaterules && v < solv->updaterules_end)
3153 Rule *r = solv->rules + (v - solv->updaterules + solv->featurerules);
3155 enablerule(solv, r); /* enable corresponding feature rule */
3158 disableupdaterules(solv, job, -(v + 1));
3162 /* more than one solution, disable all */
3163 /* do not push anything on refine list, as we do not know which solution to choose */
3164 /* thus, the user will get another problem if he selects this solution, where he
3165 * can choose the right one */
3166 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
3168 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "more than one solution found:\n");
3169 for (i = disabledcnt; i < disabled.count; i++)
3170 solver_printproblem(solv, disabled.elements[i]);
3172 for (i = disabledcnt; i < disabled.count; i++)
3174 v = disabled.elements[i];
3175 disableproblem(solv, v);
3176 if (v >= solv->updaterules && v < solv->updaterules_end)
3178 Rule *r = solv->rules + (v - solv->updaterules + solv->featurerules);
3180 enablerule(solv, r);
3185 /* all done, get us back into the same state as before */
3186 /* enable refined rules again */
3187 for (i = 0; i < disabled.count; i++)
3188 enableproblem(solv, disabled.elements[i]);
3189 /* disable problem rules again */
3192 for (i = 0; problem[i]; i++)
3193 enableproblem(solv, problem[i]);
3194 disableupdaterules(solv, job, -1);
3196 /* disable problem rules again */
3197 for (i = 0; problem[i]; i++)
3198 disableproblem(solv, problem[i]);
3199 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "refine_suggestion end\n");
3203 /*-------------------------------------------------------------------
3204 * sorting helper for problems
3206 * bring update rules before job rules
3207 * make essential job rules last
3210 Queue *problems_sort_data;
3213 problems_sortcmp(const void *ap, const void *bp)
3215 Id a = *(Id *)ap, b = *(Id *)bp;
3222 Queue *job = problems_sort_data;
3223 int af = job->elements[-a - 1] & SOLVER_ESSENTIAL;
3224 int bf = job->elements[-a - 1] & SOLVER_ESSENTIAL;
3233 /*-------------------------------------------------------------------
3238 problems_sort(Solver *solv, Queue *job)
3241 if (!solv->problems.count)
3243 for (i = j = 1; i < solv->problems.count; i++)
3245 if (!solv->problems.elements[i])
3249 problems_sort_data = job;
3250 qsort(solv->problems.elements + j, i - j, sizeof(Id), problems_sortcmp);
3252 if (++i == solv->problems.count)
3260 /*-------------------------------------------------------------------
3261 * convert problems to solutions
3265 problems_to_solutions(Solver *solv, Queue *job)
3267 Pool *pool = solv->pool;
3273 int i, j, nsol, probsolved;
3274 unsigned int now, refnow;
3276 if (!solv->problems.count)
3278 now = sat_timems(0);
3279 problems_sort(solv, job);
3280 queue_clone(&problems, &solv->problems);
3281 queue_init(&solution);
3282 queue_init(&solutions);
3283 /* copy over proof index */
3284 queue_push(&solutions, problems.elements[0]);
3285 problem = problems.elements + 1;
3287 refnow = sat_timems(0);
3288 for (i = 1; i < problems.count; i++)
3290 Id v = problems.elements[i];
3293 /* mark end of this problem */
3294 queue_push(&solutions, 0);
3295 queue_push(&solutions, 0);
3296 POOL_DEBUG(SAT_DEBUG_STATS, "refining took %d ms\n", sat_timems(refnow));
3297 if (i + 1 == problems.count)
3299 /* copy over proof of next problem */
3300 queue_push(&solutions, problems.elements[i + 1]);
3302 problem = problems.elements + i + 1;
3303 refnow = sat_timems(0);
3307 if (v < 0 && (job->elements[-v - 1] & SOLVER_ESSENTIAL))
3309 /* essential job, skip if we already have a non-essential
3313 probsolved = -1; /* show all solutions */
3315 refine_suggestion(solv, job, problem, v, &solution);
3316 if (!solution.count)
3317 continue; /* this solution didn't work out */
3320 for (j = 0; j < solution.count; j++)
3322 why = solution.elements[j];
3323 /* must be either job descriptor or update rule */
3324 assert(why < 0 || (why >= solv->updaterules && why < solv->updaterules_end));
3326 solver_printproblem(solv, why);
3330 /* job descriptor */
3331 queue_push(&solutions, 0);
3332 queue_push(&solutions, -why);
3336 /* update rule, find replacement package */
3339 p = solv->installed->start + (why - solv->updaterules);
3340 rr = solv->rules + solv->featurerules + (why - solv->updaterules);
3342 rr = solv->rules + why;
3343 if (solv->distupgrade && solv->rules[why].p != p && solv->decisionmap[p] > 0)
3345 /* distupgrade case, allow to keep old package */
3346 queue_push(&solutions, p);
3347 queue_push(&solutions, p);
3351 if (solv->decisionmap[p] > 0)
3352 continue; /* false alarm, turned out we can keep the package */
3355 int mvrp = 0; /* multi-version replacement */
3356 FOR_RULELITERALS(rp, dp, rr)
3358 if (rp > 0 && solv->decisionmap[rp] > 0 && pool->solvables[rp].repo != solv->installed)
3361 if (!(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, rp)))
3367 /* found only multi-version replacements */
3368 /* have to split solution into two parts */
3369 queue_push(&solutions, p);
3370 queue_push(&solutions, mvrp);
3374 queue_push(&solutions, p);
3375 queue_push(&solutions, rp);
3379 /* mark end of this solution */
3384 queue_push(&solutions, 0);
3385 queue_push(&solutions, 0);
3389 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "Oops, everything was fine?\n");
3392 queue_free(&solution);
3393 queue_free(&problems);
3394 /* copy queue over to solutions */
3395 queue_free(&solv->problems);
3396 queue_clone(&solv->problems, &solutions);
3398 /* bring solver back into problem state */
3399 revert(solv, 1); /* XXX move to reset_solver? */
3402 assert(solv->problems.count == solutions.count);
3403 queue_free(&solutions);
3404 POOL_DEBUG(SAT_DEBUG_STATS, "problems_to_solutions took %d ms\n", sat_timems(now));
3408 /*-------------------------------------------------------------------
3412 * advance to next problem
3416 solver_next_problem(Solver *solv, Id problem)
3420 return solv->problems.count ? 1 : 0;
3421 pp = solv->problems.elements + problem;
3422 while (pp[0] || pp[1])
3426 while (pp[0] || pp[1])
3431 problem = pp - solv->problems.elements;
3432 if (problem >= solv->problems.count)
3438 /*-------------------------------------------------------------------
3444 solver_next_solution(Solver *solv, Id problem, Id solution)
3450 pp = solv->problems.elements + solution;
3451 return pp[0] || pp[1] ? solution : 0;
3453 pp = solv->problems.elements + solution;
3454 while (pp[0] || pp[1])
3457 solution = pp - solv->problems.elements;
3458 return pp[0] || pp[1] ? solution : 0;
3462 /*-------------------------------------------------------------------
3464 * solution element iterator
3468 solver_next_solutionelement(Solver *solv, Id problem, Id solution, Id element, Id *p, Id *rp)
3471 element = element ? element + 2 : solution;
3472 pp = solv->problems.elements + element;
3473 if (!(pp[0] || pp[1]))
3481 /*-------------------------------------------------------------------
3483 * Retrieve information about a problematic rule
3485 * this is basically the reverse of addrpmrulesforsolvable
3489 solver_problemruleinfo(Solver *solv, Queue *job, Id rid, Id *depp, Id *sourcep, Id *targetp)
3491 Pool *pool = solv->pool;
3492 Repo *installed = solv->installed;
3496 Id p, d, w2, pp, req, *reqp, con, *conp, obs, *obsp, *dp;
3499 if (rid >= solv->jobrules && rid < solv->jobrules_end)
3502 r = solv->rules + rid;
3503 p = solv->ruletojob.elements[rid - solv->jobrules];
3504 *depp = job->elements[p + 1];
3506 *targetp = job->elements[p];
3507 d = r->d < 0 ? -r->d - 1 : r->d;
3508 if (d == 0 && r->w2 == 0 && r->p == -SYSTEMSOLVABLE && (job->elements[p] & SOLVER_SELECTMASK) != SOLVER_SOLVABLE_ONE_OF)
3509 return SOLVER_PROBLEM_JOB_NOTHING_PROVIDES_DEP;
3510 return SOLVER_PROBLEM_JOB_RULE;
3512 if (rid >= solv->updaterules && rid < solv->updaterules_end)
3515 *sourcep = solv->installed->start + (rid - solv->updaterules);
3517 return SOLVER_PROBLEM_UPDATE_RULE;
3519 assert(rid < solv->rpmrules_end);
3520 r = solv->rules + rid;
3522 d = r->d < 0 ? -r->d - 1 : r->d;
3523 if (d == 0 && r->w2 == 0)
3525 /* a rpm rule assertion */
3526 s = pool->solvables - r->p;
3527 if (installed && !solv->fixsystem && s->repo == installed)
3529 assert(!dontfix); /* dontfix packages never have a neg assertion */
3532 /* see why the package is not installable */
3533 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC && !pool_installable(pool, s))
3536 return SOLVER_PROBLEM_NOT_INSTALLABLE;
3538 /* check requires */
3541 reqp = s->repo->idarraydata + s->requires;
3542 while ((req = *reqp++) != 0)
3544 if (req == SOLVABLE_PREREQMARKER)
3546 dp = pool->whatprovidesdata + pool_whatprovides(pool, req);
3553 return SOLVER_PROBLEM_NOTHING_PROVIDES_DEP;
3556 if (!solv->allowselfconflicts && s->conflicts)
3558 conp = s->repo->idarraydata + s->conflicts;
3559 while ((con = *conp++) != 0)
3560 FOR_PROVIDES(p, pp, con)
3564 return SOLVER_PROBLEM_SELF_CONFLICT;
3567 /* should never happen */
3569 return SOLVER_PROBLEM_RPM_RULE;
3571 s = pool->solvables - r->p;
3572 if (installed && !solv->fixsystem && s->repo == installed)
3575 if (d && pool->whatprovidesdata[d] < 0)
3577 /* rule looks like -p|-c|x|x|x..., we only create this for patches with multiversion */
3578 /* reduce it to -p|-c case */
3579 w2 = pool->whatprovidesdata[d];
3581 if (d == 0 && w2 < 0)
3583 /* a package conflict */
3584 Solvable *s2 = pool->solvables - w2;
3587 if (installed && !solv->fixsystem && s2->repo == installed)
3590 /* if both packages have the same name and at least one of them
3591 * is not installed, they conflict */
3592 if (s->name == s2->name && !(installed && s->repo == installed && s2->repo == installed))
3594 /* also check noobsoletes map */
3595 if ((s->evr == s2->evr && s->arch == s2->arch) || !solv->noobsoletes.size
3596 || ((!installed || s->repo != installed) && !MAPTST(&solv->noobsoletes, -r->p))
3597 || ((!installed || s2->repo != installed) && !MAPTST(&solv->noobsoletes, -w2)))
3602 return SOLVER_PROBLEM_SAME_NAME;
3606 /* check conflicts in both directions */
3609 conp = s->repo->idarraydata + s->conflicts;
3610 while ((con = *conp++) != 0)
3612 FOR_PROVIDES(p, pp, con)
3614 if (dontfix && pool->solvables[p].repo == installed)
3621 return SOLVER_PROBLEM_PACKAGE_CONFLICT;
3627 conp = s2->repo->idarraydata + s2->conflicts;
3628 while ((con = *conp++) != 0)
3630 FOR_PROVIDES(p, pp, con)
3632 if (dontfix2 && pool->solvables[p].repo == installed)
3639 return SOLVER_PROBLEM_PACKAGE_CONFLICT;
3643 /* check obsoletes in both directions */
3644 if ((!installed || s->repo != installed) && s->obsoletes && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -r->p)))
3646 obsp = s->repo->idarraydata + s->obsoletes;
3647 while ((obs = *obsp++) != 0)
3649 FOR_PROVIDES(p, pp, obs)
3653 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3658 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3662 if ((!installed || s2->repo != installed) && s2->obsoletes && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -w2)))
3664 obsp = s2->repo->idarraydata + s2->obsoletes;
3665 while ((obs = *obsp++) != 0)
3667 FOR_PROVIDES(p, pp, obs)
3671 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3676 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3680 if (solv->implicitobsoleteusesprovides && (!installed || s->repo != installed) && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -r->p)))
3682 FOR_PROVIDES(p, pp, s->name)
3689 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3692 if (solv->implicitobsoleteusesprovides && (!installed || s2->repo != installed) && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -w2)))
3694 FOR_PROVIDES(p, pp, s2->name)
3701 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3704 /* all cases checked, can't happen */
3708 return SOLVER_PROBLEM_RPM_RULE;
3710 /* simple requires */
3713 reqp = s->repo->idarraydata + s->requires;
3714 while ((req = *reqp++) != 0)
3716 if (req == SOLVABLE_PREREQMARKER)
3718 dp = pool->whatprovidesdata + pool_whatprovides(pool, req);
3721 if (*dp == r->w2 && dp[1] == 0)
3724 else if (dp - pool->whatprovidesdata == d)
3732 return SOLVER_PROBLEM_DEP_PROVIDERS_NOT_INSTALLABLE;
3735 /* all cases checked, can't happen */
3739 return SOLVER_PROBLEM_RPM_RULE;
3743 /*-------------------------------------------------------------------
3749 findproblemrule_internal(Solver *solv, Id idx, Id *reqrp, Id *conrp, Id *sysrp, Id *jobrp)
3752 Id lreqr, lconr, lsysr, ljobr;
3756 lreqr = lconr = lsysr = ljobr = 0;
3757 while ((rid = solv->learnt_pool.elements[idx++]) != 0)
3760 if (rid >= solv->learntrules)
3761 findproblemrule_internal(solv, solv->learnt_why.elements[rid - solv->learntrules], &lreqr, &lconr, &lsysr, &ljobr);
3762 else if (rid >= solv->jobrules && rid < solv->jobrules_end)
3767 else if (rid >= solv->updaterules && rid < solv->updaterules_end)
3774 assert(rid < solv->rpmrules_end);
3775 r = solv->rules + rid;
3776 d = r->d < 0 ? -r->d - 1 : r->d;
3777 if (!d && r->w2 < 0)
3784 if (!d && r->w2 == 0 && !reqassert)
3786 if (*reqrp > 0 && r->p < -1)
3788 Id op = -solv->rules[*reqrp].p;
3789 if (op > 1 && solv->pool->solvables[op].arch != solv->pool->solvables[-r->p].arch)
3790 continue; /* different arch, skip */
3792 /* prefer assertions */
3798 else if (solv->installed && r->p < 0 && solv->pool->solvables[-r->p].repo == solv->installed && !reqassert)
3800 /* prefer rules of installed packages */
3806 if (!*reqrp && lreqr)
3808 if (!*conrp && lconr)
3810 if (!*jobrp && ljobr)
3812 if (!*sysrp && lsysr)
3817 /*-------------------------------------------------------------------
3821 * search for a rule that describes the problem to the
3822 * user. A pretty hopeless task, actually. We currently
3823 * prefer simple requires.
3827 solver_findproblemrule(Solver *solv, Id problem)
3829 Id reqr, conr, sysr, jobr;
3830 Id idx = solv->problems.elements[problem - 1];
3831 reqr = conr = sysr = jobr = 0;
3832 findproblemrule_internal(solv, idx, &reqr, &conr, &sysr, &jobr);
3845 /*-------------------------------------------------------------------
3847 * create reverse obsoletes map for installed solvables
3849 * for each installed solvable find which packages with *different* names
3850 * obsolete the solvable.
3851 * this index is used in policy_findupdatepackages if noupdateprovide is set.
3855 create_obsolete_index(Solver *solv)
3857 Pool *pool = solv->pool;
3859 Repo *installed = solv->installed;
3860 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
3863 if (!installed || !installed->nsolvables)
3865 solv->obsoletes = obsoletes = sat_calloc(installed->end - installed->start, sizeof(Id));
3866 for (i = 1; i < pool->nsolvables; i++)
3868 s = pool->solvables + i;
3871 if (!pool_installable(pool, s))
3873 obsp = s->repo->idarraydata + s->obsoletes;
3874 while ((obs = *obsp++) != 0)
3876 FOR_PROVIDES(p, pp, obs)
3878 if (pool->solvables[p].repo != installed)
3880 if (pool->solvables[p].name == s->name)
3882 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3884 obsoletes[p - installed->start]++;
3889 for (i = 0; i < installed->nsolvables; i++)
3892 n += obsoletes[i] + 1;
3895 solv->obsoletes_data = obsoletes_data = sat_calloc(n + 1, sizeof(Id));
3896 POOL_DEBUG(SAT_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
3897 for (i = pool->nsolvables - 1; i > 0; i--)
3899 s = pool->solvables + i;
3902 if (!pool_installable(pool, s))
3904 obsp = s->repo->idarraydata + s->obsoletes;
3905 while ((obs = *obsp++) != 0)
3907 FOR_PROVIDES(p, pp, obs)
3909 if (pool->solvables[p].repo != installed)
3911 if (pool->solvables[p].name == s->name)
3913 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3915 p -= installed->start;
3916 if (obsoletes_data[obsoletes[p]] != i)
3917 obsoletes_data[--obsoletes[p]] = i;
3924 /*-------------------------------------------------------------------
3926 * remove disabled conflicts
3930 removedisabledconflicts(Solver *solv, Queue *removed)
3932 Pool *pool = solv->pool;
3937 Id *decisionmap = solv->decisionmap;
3939 POOL_DEBUG(SAT_DEBUG_SCHUBI, "removedisabledconflicts\n");
3940 queue_empty(removed);
3941 for (i = 0; i < solv->decisionq.count; i++)
3943 p = solv->decisionq.elements[i];
3946 /* a conflict. we never do conflicts on free decisions, so there
3947 * must have been an unit rule */
3948 why = solv->decisionq_why.elements[i];
3950 r = solv->rules + why;
3951 if (r->d < 0 && decisionmap[-p])
3953 /* rule is now disabled, remove from decisionmap */
3954 POOL_DEBUG(SAT_DEBUG_SCHUBI, "removing conflict for package %s[%d]\n", solvable2str(pool, pool->solvables - p), -p);
3955 queue_push(removed, -p);
3956 queue_push(removed, decisionmap[-p]);
3957 decisionmap[-p] = 0;
3960 if (!removed->count)
3962 /* we removed some confliced packages. some of them might still
3963 * be in conflict, so search for unit rules and re-conflict */
3965 for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
3967 if (i == solv->nrules)
3970 r = solv->rules + i;
3976 if (r->p < 0 && !decisionmap[-r->p])
3982 if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
3984 else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
3989 if (r->p < 0 && decisionmap[-r->p] == 0)
3991 if (new || DECISIONMAP_FALSE(r->p))
3993 dp = pool->whatprovidesdata + r->d;
3994 while ((p = *dp++) != 0)
3996 if (new && p == new)
3998 if (p < 0 && decisionmap[-p] == 0)
4007 else if (!DECISIONMAP_FALSE(p))
4017 POOL_DEBUG(SAT_DEBUG_SCHUBI, "re-conflicting package %s[%d]\n", solvable2str(pool, pool->solvables - new), -new);
4018 decisionmap[-new] = -1;
4020 n = 0; /* redo all rules */
4026 /*-------------------------------------------------------------------
4028 * weaken solvable dependencies
4032 weaken_solvable_deps(Solver *solv, Id p)
4037 for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++)
4041 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
4042 continue; /* conflict */
4043 queue_push(&solv->weakruleq, i);
4047 /********************************************************************/
4057 solver_solve(Solver *solv, Queue *job)
4059 Pool *pool = solv->pool;
4060 Repo *installed = solv->installed;
4063 Map addedmap; /* '1' == have rpm-rules for solvable */
4064 Map installcandidatemap;
4065 Id how, what, select, name, weak, p, pp, d;
4070 int now, solve_start;
4072 solve_start = sat_timems(0);
4073 POOL_DEBUG(SAT_DEBUG_STATS, "solver started\n");
4074 POOL_DEBUG(SAT_DEBUG_STATS, "fixsystem=%d updatesystem=%d dosplitprovides=%d, noupdateprovide=%d\n", solv->fixsystem, solv->updatesystem, solv->dosplitprovides, solv->noupdateprovide);
4075 POOL_DEBUG(SAT_DEBUG_STATS, "distupgrade=%d distupgrade_removeunsupported=%d\n", solv->distupgrade, solv->distupgrade_removeunsupported);
4076 POOL_DEBUG(SAT_DEBUG_STATS, "allowuninstall=%d, allowdowngrade=%d, allowarchchange=%d, allowvendorchange=%d\n", solv->allowuninstall, solv->allowdowngrade, solv->allowarchchange, solv->allowvendorchange);
4077 POOL_DEBUG(SAT_DEBUG_STATS, "promoteepoch=%d, allowvirtualconflicts=%d, allowselfconflicts=%d\n", pool->promoteepoch, solv->allowvirtualconflicts, solv->allowselfconflicts);
4078 POOL_DEBUG(SAT_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d\n", solv->obsoleteusesprovides, solv->implicitobsoleteusesprovides);
4079 POOL_DEBUG(SAT_DEBUG_STATS, "dontinstallrecommended=%d, ignorealreadyrecommended=%d, dontshowinstalledrecommended=%d\n", solv->dontinstallrecommended, solv->ignorealreadyrecommended, solv->dontshowinstalledrecommended);
4080 /* create whatprovides if not already there */
4081 if (!pool->whatprovides)
4082 pool_createwhatprovides(pool);
4084 /* create obsolete index if needed */
4085 create_obsolete_index(solv);
4088 * create basic rule set of all involved packages
4089 * use addedmap bitmap to make sure we don't create rules twice
4093 /* create noobsolete map if needed */
4094 for (i = 0; i < job->count; i += 2)
4096 how = job->elements[i] & ~SOLVER_WEAK;
4097 if ((how & SOLVER_JOBMASK) != SOLVER_NOOBSOLETES)
4099 what = job->elements[i + 1];
4100 select = how & SOLVER_SELECTMASK;
4101 if (!solv->noobsoletes.size)
4102 map_init(&solv->noobsoletes, pool->nsolvables);
4103 FOR_JOB_SELECT(p, pp, select, what)
4104 MAPSET(&solv->noobsoletes, p);
4107 map_init(&addedmap, pool->nsolvables);
4108 map_init(&installcandidatemap, pool->nsolvables);
4112 * always install our system solvable
4114 MAPSET(&addedmap, SYSTEMSOLVABLE);
4115 queue_push(&solv->decisionq, SYSTEMSOLVABLE);
4116 queue_push(&solv->decisionq_why, 0);
4117 solv->decisionmap[SYSTEMSOLVABLE] = 1; /* installed at level '1' */
4119 now = sat_timems(0);
4121 * create rules for all package that could be involved with the solving
4122 * so called: rpm rules
4127 oldnrules = solv->nrules;
4128 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for installed solvables ***\n");
4129 FOR_REPO_SOLVABLES(installed, p, s)
4130 addrpmrulesforsolvable(solv, s, &addedmap);
4131 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
4132 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for updaters of installed solvables ***\n");
4133 oldnrules = solv->nrules;
4134 FOR_REPO_SOLVABLES(installed, p, s)
4135 addrpmrulesforupdaters(solv, s, &addedmap, 1);
4136 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
4140 * create rules for all packages involved in the job
4141 * (to be installed or removed)
4144 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for packages involved with a job ***\n");
4145 oldnrules = solv->nrules;
4146 for (i = 0; i < job->count; i += 2)
4148 how = job->elements[i];
4149 what = job->elements[i + 1];
4150 select = how & SOLVER_SELECTMASK;
4152 switch (how & SOLVER_JOBMASK)
4154 case SOLVER_INSTALL:
4155 FOR_JOB_SELECT(p, pp, select, what)
4157 MAPSET(&installcandidatemap, p);
4158 addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
4162 /* FIXME: semantics? */
4163 FOR_JOB_SELECT(p, pp, select, what)
4164 addrpmrulesforupdaters(solv, pool->solvables + what, &addedmap, 0);
4168 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
4170 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for recommended/suggested packages ***\n");
4172 oldnrules = solv->nrules;
4175 * add rules for suggests, enhances
4177 addrpmrulesforweak(solv, &addedmap);
4178 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
4180 IF_POOLDEBUG (SAT_DEBUG_STATS)
4182 int possible = 0, installable = 0;
4183 for (i = 1; i < pool->nsolvables; i++)
4185 if (pool_installable(pool, pool->solvables + i))
4187 if (MAPTST(&addedmap, i))
4190 POOL_DEBUG(SAT_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
4194 * first pass done, we now have all the rpm rules we need.
4195 * unify existing rules before going over all job rules and
4197 * at this point the system is always solvable,
4198 * as an empty system (remove all packages) is a valid solution
4201 unifyrules(solv); /* remove duplicate rpm rules */
4203 solv->rpmrules_end = solv->nrules; /* mark end of rpm rules */
4205 solv->directdecisions = solv->decisionq.count;
4206 POOL_DEBUG(SAT_DEBUG_STATS, "rpm rule memory usage: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
4207 POOL_DEBUG(SAT_DEBUG_STATS, "decisions so far: %d\n", solv->decisionq.count);
4208 POOL_DEBUG(SAT_DEBUG_STATS, "rpm rule creation took %d ms\n", sat_timems(now));
4211 * create feature rules
4213 * foreach installed:
4214 * create assertion (keep installed, if no update available)
4216 * create update rule (A|update1(A)|update2(A)|...)
4218 * those are used later on to keep a version of the installed packages in
4222 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add feature rules ***\n");
4223 solv->featurerules = solv->nrules; /* mark start of feature rules */
4226 /* foreach possibly installed solvable */
4227 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
4229 if (s->repo != installed)
4231 addrule(solv, 0, 0); /* create dummy rule */
4234 addupdaterule(solv, s, 1); /* allow s to be updated */
4237 * assert one rule per installed solvable,
4238 * either an assertion (A)
4239 * or a possible update (A|update1(A)|update2(A)|...)
4241 assert(solv->nrules - solv->featurerules == installed->end - installed->start);
4243 solv->featurerules_end = solv->nrules;
4246 * Add update rules for installed solvables
4248 * almost identical to feature rules
4249 * except that downgrades/archchanges/vendorchanges are not allowed
4252 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add update rules ***\n");
4253 solv->updaterules = solv->nrules;
4256 { /* foreach installed solvables */
4257 /* we create all update rules, but disable some later on depending on the job */
4258 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
4262 if (s->repo != installed)
4264 addrule(solv, 0, 0); /* create dummy rule */
4267 addupdaterule(solv, s, 0); /* allowall = 0: downgrades not allowed */
4269 * check for and remove duplicate
4271 r = solv->rules + solv->nrules - 1; /* r: update rule */
4272 sr = r - (installed->end - installed->start); /* sr: feature rule */
4273 /* it's orphaned if there is no feature rule or the feature rule
4274 * consists just of the installed package */
4275 if (!sr->p || (sr->p == i && !sr->d && !sr->w2))
4276 queue_push(&solv->orphaned, i);
4279 assert(solv->distupgrade && !sr->p);
4282 unifyrules_sortcmp_data = pool;
4283 if (!unifyrules_sortcmp(r, sr))
4285 /* identical rule, kill unneeded rule */
4286 if (solv->allowuninstall)
4288 /* keep feature rule, make it weak */
4289 memset(r, 0, sizeof(*r));
4290 queue_push(&solv->weakruleq, sr - solv->rules);
4294 /* keep update rule */
4295 memset(sr, 0, sizeof(*sr));
4298 else if (solv->allowuninstall)
4300 /* make both feature and update rule weak */
4301 queue_push(&solv->weakruleq, r - solv->rules);
4302 queue_push(&solv->weakruleq, sr - solv->rules);
4305 disablerule(solv, sr);
4307 /* consistency check: we added a rule for _every_ installed solvable */
4308 assert(solv->nrules - solv->updaterules == installed->end - installed->start);
4310 solv->updaterules_end = solv->nrules;
4314 * now add all job rules
4317 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add JOB rules ***\n");
4319 solv->jobrules = solv->nrules;
4320 for (i = 0; i < job->count; i += 2)
4322 oldnrules = solv->nrules;
4324 how = job->elements[i];
4325 what = job->elements[i + 1];
4326 weak = how & SOLVER_WEAK;
4327 select = how & SOLVER_SELECTMASK;
4328 switch (how & SOLVER_JOBMASK)
4330 case SOLVER_INSTALL:
4331 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4332 if (select == SOLVER_SOLVABLE)
4340 FOR_JOB_SELECT(p, pp, select, what)
4344 /* no candidate found, make this an impossible rule */
4345 queue_push(&q, -SYSTEMSOLVABLE);
4347 p = queue_shift(&q); /* get first candidate */
4348 d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q); /* internalize */
4350 addrule(solv, p, d); /* add install rule */
4351 queue_push(&solv->ruletojob, i);
4353 queue_push(&solv->weakruleq, solv->nrules - 1);
4356 POOL_DEBUG(SAT_DEBUG_JOB, "job: %serase %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4357 if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
4359 /* special case for "erase a specific solvable": we also
4360 * erase all other solvables with that name, so that they
4361 * don't get picked up as replacement */
4362 name = pool->solvables[what].name;
4363 FOR_PROVIDES(p, pp, name)
4367 s = pool->solvables + p;
4368 if (s->name != name)
4370 /* keep other versions installed */
4371 if (s->repo == solv->installed)
4373 /* keep installcandidates of other jobs */
4374 if (MAPTST(&installcandidatemap, p))
4376 addrule(solv, -p, 0); /* remove by Id */
4377 queue_push(&solv->ruletojob, i);
4379 queue_push(&solv->weakruleq, solv->nrules - 1);
4382 FOR_JOB_SELECT(p, pp, select, what)
4384 addrule(solv, -p, 0);
4385 queue_push(&solv->ruletojob, i);
4387 queue_push(&solv->weakruleq, solv->nrules - 1);
4392 POOL_DEBUG(SAT_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4393 if (select != SOLVER_SOLVABLE)
4395 s = pool->solvables + what;
4396 POOL_DEBUG(SAT_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solvable2str(pool, s));
4397 addupdaterule(solv, s, 0);
4398 queue_push(&solv->ruletojob, i);
4400 queue_push(&solv->weakruleq, solv->nrules - 1);
4402 case SOLVER_WEAKENDEPS:
4403 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4404 if (select != SOLVER_SOLVABLE)
4406 s = pool->solvables + what;
4407 weaken_solvable_deps(solv, what);
4409 case SOLVER_NOOBSOLETES:
4410 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sno obsolete %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4413 POOL_DEBUG(SAT_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4414 FOR_JOB_SELECT(p, pp, select, what)
4416 s = pool->solvables + p;
4417 if (installed && s->repo == installed)
4418 addrule(solv, p, 0);
4420 addrule(solv, -p, 0);
4421 queue_push(&solv->ruletojob, i);
4423 queue_push(&solv->weakruleq, solv->nrules - 1);
4427 POOL_DEBUG(SAT_DEBUG_JOB, "job: unknown job\n");
4435 IF_POOLDEBUG (SAT_DEBUG_JOB)
4438 if (solv->nrules == oldnrules)
4439 POOL_DEBUG(SAT_DEBUG_JOB, " - no rule created\n");
4440 for (j = oldnrules; j < solv->nrules; j++)
4442 POOL_DEBUG(SAT_DEBUG_JOB, " - job ");
4443 solver_printrule(solv, SAT_DEBUG_JOB, solv->rules + j);
4447 assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
4448 solv->jobrules_end = solv->nrules;
4450 /* all rules created
4451 * --------------------------------------------------------------
4452 * prepare for solving
4455 /* free unneeded memory */
4456 map_free(&addedmap);
4457 map_free(&installcandidatemap);
4460 /* create weak map */
4461 map_init(&solv->weakrulemap, solv->nrules);
4462 for (i = 0; i < solv->weakruleq.count; i++)
4464 p = solv->weakruleq.elements[i];
4465 MAPSET(&solv->weakrulemap, p);
4468 /* all new rules are learnt after this point */
4469 solv->learntrules = solv->nrules;
4471 /* create assertion index. it is only used to speed up
4472 * makeruledecsions() a bit */
4473 for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
4474 if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
4475 queue_push(&solv->ruleassertions, i);
4477 /* disable update rules that conflict with our job */
4478 disableupdaterules(solv, job, -1);
4480 /* make decisions based on job/update assertions */
4481 makeruledecisions(solv);
4483 /* create watches chains */
4486 POOL_DEBUG(SAT_DEBUG_STATS, "problems so far: %d\n", solv->problems.count);
4489 * ********************************************
4491 * ********************************************
4494 now = sat_timems(0);
4495 run_solver(solv, 1, solv->dontinstallrecommended ? 0 : 1);
4496 POOL_DEBUG(SAT_DEBUG_STATS, "solver took %d ms\n", sat_timems(now));
4500 /* disable all erase jobs (including weak "keep uninstalled" rules) */
4501 for (i = solv->jobrules, r = solv->rules + i; i < solv->learntrules; i++, r++)
4503 if (r->d < 0) /* disabled ? */
4505 if (r->p > 0) /* install job? */
4507 disablerule(solv, r);
4513 enabledisablelearntrules(solv);
4514 removedisabledconflicts(solv, &redoq);
4518 * find recommended packages
4521 /* if redoq.count == 0 we already found all recommended in the
4523 if (redoq.count || solv->dontinstallrecommended || !solv->dontshowinstalledrecommended || solv->ignorealreadyrecommended)
4525 Id rec, *recp, p, pp;
4527 /* create map of all recommened packages */
4528 solv->recommends_index = -1;
4529 MAPZERO(&solv->recommendsmap);
4530 for (i = 0; i < solv->decisionq.count; i++)
4532 p = solv->decisionq.elements[i];
4535 s = pool->solvables + p;
4538 recp = s->repo->idarraydata + s->recommends;
4539 while ((rec = *recp++) != 0)
4541 FOR_PROVIDES(p, pp, rec)
4542 if (solv->decisionmap[p] > 0)
4546 if (!solv->dontshowinstalledrecommended)
4548 FOR_PROVIDES(p, pp, rec)
4549 if (solv->decisionmap[p] > 0)
4550 MAPSET(&solv->recommendsmap, p);
4552 continue; /* p != 0: already fulfilled */
4554 FOR_PROVIDES(p, pp, rec)
4555 MAPSET(&solv->recommendsmap, p);
4559 for (i = 1; i < pool->nsolvables; i++)
4561 if (solv->decisionmap[i] < 0)
4563 if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
4565 s = pool->solvables + i;
4566 if (!MAPTST(&solv->recommendsmap, i))
4568 if (!s->supplements)
4570 if (!pool_installable(pool, s))
4572 if (!solver_is_supplementing(solv, s))
4575 if (solv->dontinstallrecommended)
4576 queue_push(&solv->recommendations, i);
4578 queue_pushunique(&solv->recommendations, i);
4580 /* we use MODE_SUGGEST here so that repo prio is ignored */
4581 policy_filter_unwanted(solv, &solv->recommendations, POLICY_MODE_SUGGEST);
4585 * find suggested packages
4590 Id sug, *sugp, p, pp;
4592 /* create map of all suggests that are still open */
4593 solv->recommends_index = -1;
4594 MAPZERO(&solv->suggestsmap);
4595 for (i = 0; i < solv->decisionq.count; i++)
4597 p = solv->decisionq.elements[i];
4600 s = pool->solvables + p;
4603 sugp = s->repo->idarraydata + s->suggests;
4604 while ((sug = *sugp++) != 0)
4606 FOR_PROVIDES(p, pp, sug)
4607 if (solv->decisionmap[p] > 0)
4611 if (!solv->dontshowinstalledrecommended)
4613 FOR_PROVIDES(p, pp, sug)
4614 if (solv->decisionmap[p] > 0)
4615 MAPSET(&solv->suggestsmap, p);
4617 continue; /* already fulfilled */
4619 FOR_PROVIDES(p, pp, sug)
4620 MAPSET(&solv->suggestsmap, p);
4624 for (i = 1; i < pool->nsolvables; i++)
4626 if (solv->decisionmap[i] < 0)
4628 if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
4630 s = pool->solvables + i;
4631 if (!MAPTST(&solv->suggestsmap, i))
4635 if (!pool_installable(pool, s))
4637 if (!solver_is_enhancing(solv, s))
4640 queue_push(&solv->suggestions, i);
4642 policy_filter_unwanted(solv, &solv->suggestions, POLICY_MODE_SUGGEST);
4647 /* restore decisionmap */
4648 for (i = 0; i < redoq.count; i += 2)
4649 solv->decisionmap[redoq.elements[i]] = redoq.elements[i + 1];
4653 * if unsolvable, prepare solutions
4656 if (solv->problems.count)
4658 int recocount = solv->recommendations.count;
4659 solv->recommendations.count = 0; /* so that revert() doesn't mess with it */
4660 queue_empty(&redoq);
4661 for (i = 0; i < solv->decisionq.count; i++)
4663 Id p = solv->decisionq.elements[i];
4664 queue_push(&redoq, p);
4665 queue_push(&redoq, solv->decisionq_why.elements[i]);
4666 queue_push(&redoq, solv->decisionmap[p > 0 ? p : -p]);
4668 problems_to_solutions(solv, job);
4669 memset(solv->decisionmap, 0, pool->nsolvables * sizeof(Id));
4670 queue_empty(&solv->decisionq);
4671 queue_empty(&solv->decisionq_why);
4672 for (i = 0; i < redoq.count; i += 3)
4674 Id p = redoq.elements[i];
4675 queue_push(&solv->decisionq, p);
4676 queue_push(&solv->decisionq_why, redoq.elements[i + 1]);
4677 solv->decisionmap[p > 0 ? p : -p] = redoq.elements[i + 2];
4679 solv->recommendations.count = recocount;
4683 POOL_DEBUG(SAT_DEBUG_STATS, "final solver statistics: %d learned rules, %d unsolvable\n", solv->stats_learned, solv->stats_unsolvable);
4684 POOL_DEBUG(SAT_DEBUG_STATS, "solver_solve took %d ms\n", sat_timems(solve_start));
4687 /***********************************************************************/
4688 /* disk usage computations */
4690 /*-------------------------------------------------------------------
4692 * calculate DU changes
4696 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
4700 solver_create_state_maps(solv, &installedmap, 0);
4701 pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
4702 map_free(&installedmap);
4706 /*-------------------------------------------------------------------
4708 * calculate changes in install size
4712 solver_calc_installsizechange(Solver *solv)
4717 solver_create_state_maps(solv, &installedmap, 0);
4718 change = pool_calc_installsizechange(solv->pool, &installedmap);
4719 map_free(&installedmap);
4723 #define FIND_INVOLVED_DEBUG 0
4725 solver_find_involved(Solver *solv, Queue *installedq, Solvable *ts, Queue *q)
4727 Pool *pool = solv->pool;
4732 Queue installedq_internal;
4733 Id tp, ip, p, pp, req, *reqp, sup, *supp;
4736 tp = ts - pool->solvables;
4738 queue_init(&installedq_internal);
4739 map_init(&im, pool->nsolvables);
4740 map_init(&installedm, pool->nsolvables);
4744 installedq = &installedq_internal;
4745 if (solv->installed)
4747 for (ip = solv->installed->start; ip < solv->installed->end; ip++)
4749 s = pool->solvables + ip;
4750 if (s->repo != solv->installed)
4752 queue_push(installedq, ip);
4756 for (i = 0; i < installedq->count; i++)
4758 ip = installedq->elements[i];
4759 MAPSET(&installedm, ip);
4763 queue_push(&iq, ts - pool->solvables);
4766 ip = queue_shift(&iq);
4767 if (!MAPTST(&im, ip))
4769 if (!MAPTST(&installedm, ip))
4772 s = pool->solvables + ip;
4773 #if FIND_INVOLVED_DEBUG
4774 printf("hello %s\n", solvable2str(pool, s));
4778 reqp = s->repo->idarraydata + s->requires;
4779 while ((req = *reqp++) != 0)
4781 if (req == SOLVABLE_PREREQMARKER)
4783 /* count number of installed packages that match */
4785 FOR_PROVIDES(p, pp, req)
4786 if (MAPTST(&installedm, p))
4790 FOR_PROVIDES(p, pp, req)
4794 #if FIND_INVOLVED_DEBUG
4795 printf("%s requires %s\n", solvable2str(pool, pool->solvables + ip), solvable2str(pool, pool->solvables + p));
4804 reqp = s->repo->idarraydata + s->recommends;
4805 while ((req = *reqp++) != 0)
4808 FOR_PROVIDES(p, pp, req)
4809 if (MAPTST(&installedm, p))
4813 FOR_PROVIDES(p, pp, req)
4817 #if FIND_INVOLVED_DEBUG
4818 printf("%s recommends %s\n", solvable2str(pool, pool->solvables + ip), solvable2str(pool, pool->solvables + p));
4827 /* supplements pass */
4828 for (i = 0; i < installedq->count; i++)
4830 ip = installedq->elements[i];
4831 s = pool->solvables + ip;
4832 if (!s->supplements)
4834 if (!MAPTST(&im, ip))
4836 supp = s->repo->idarraydata + s->supplements;
4837 while ((sup = *supp++) != 0)
4838 if (!dep_possible(solv, sup, &im) && dep_possible(solv, sup, &installedm))
4840 /* no longer supplemented, also erase */
4843 #if FIND_INVOLVED_DEBUG
4844 printf("%s supplemented\n", solvable2str(pool, pool->solvables + ip));
4846 queue_push(&iq, ip);
4852 for (i = 0; i < installedq->count; i++)
4854 ip = installedq->elements[i];
4855 if (MAPTST(&im, ip))
4856 queue_push(&iq, ip);
4861 ip = queue_shift(&iq);
4862 if (!MAPTST(&installedm, ip))
4864 s = pool->solvables + ip;
4865 #if FIND_INVOLVED_DEBUG
4866 printf("bye %s\n", solvable2str(pool, s));
4870 reqp = s->repo->idarraydata + s->requires;
4871 while ((req = *reqp++) != 0)
4873 FOR_PROVIDES(p, pp, req)
4875 if (!MAPTST(&im, p))
4879 #if FIND_INVOLVED_DEBUG
4880 printf("%s requires %s\n", solvable2str(pool, pool->solvables + ip), solvable2str(pool, pool->solvables + p));
4890 reqp = s->repo->idarraydata + s->recommends;
4891 while ((req = *reqp++) != 0)
4893 FOR_PROVIDES(p, pp, req)
4895 if (!MAPTST(&im, p))
4899 #if FIND_INVOLVED_DEBUG
4900 printf("%s recommends %s\n", solvable2str(pool, pool->solvables + ip), solvable2str(pool, pool->solvables + p));
4910 /* supplements pass */
4911 for (i = 0; i < installedq->count; i++)
4913 ip = installedq->elements[i];
4916 s = pool->solvables + ip;
4917 if (!s->supplements)
4919 if (MAPTST(&im, ip))
4921 supp = s->repo->idarraydata + s->supplements;
4922 while ((sup = *supp++) != 0)
4923 if (dep_possible(solv, sup, &im))
4927 #if FIND_INVOLVED_DEBUG
4928 printf("%s supplemented\n", solvable2str(pool, pool->solvables + ip));
4931 queue_push(&iq, ip);
4939 /* convert map into result */
4940 for (i = 0; i < installedq->count; i++)
4942 ip = installedq->elements[i];
4943 if (MAPTST(&im, ip))
4945 if (ip == ts - pool->solvables)
4950 map_free(&installedm);
4951 queue_free(&installedq_internal);