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);
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 queue_shift(qs);
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 d = qs.count ? pool_queuetowhatprovides(pool, &qs) : 0;
1521 addrule(solv, p, d); /* allow update of s */
1522 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addupdaterule end -----\n");
1526 /********************************************************************/
1530 /*-------------------------------------------------------------------
1533 * initial setup for all watches
1537 makewatches(Solver *solv)
1541 int nsolvables = solv->pool->nsolvables;
1543 sat_free(solv->watches);
1544 /* lower half for removals, upper half for installs */
1545 solv->watches = sat_calloc(2 * nsolvables, sizeof(Id));
1547 /* do it reverse so rpm rules get triggered first (XXX: obsolete?) */
1548 for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
1550 for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
1553 if (!r->w2) /* assertions do not need watches */
1556 /* see addwatches_rule(solv, r) */
1557 r->n1 = solv->watches[nsolvables + r->w1];
1558 solv->watches[nsolvables + r->w1] = r - solv->rules;
1560 r->n2 = solv->watches[nsolvables + r->w2];
1561 solv->watches[nsolvables + r->w2] = r - solv->rules;
1566 /*-------------------------------------------------------------------
1568 * add watches (for rule)
1569 * sets up watches for a single rule
1571 * see also makewatches()
1575 addwatches_rule(Solver *solv, Rule *r)
1577 int nsolvables = solv->pool->nsolvables;
1579 r->n1 = solv->watches[nsolvables + r->w1];
1580 solv->watches[nsolvables + r->w1] = r - solv->rules;
1582 r->n2 = solv->watches[nsolvables + r->w2];
1583 solv->watches[nsolvables + r->w2] = r - solv->rules;
1587 /********************************************************************/
1593 /* shortcuts to check if a literal (positive or negative) assignment
1594 * evaluates to 'true' or 'false'
1596 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
1597 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
1598 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
1600 /*-------------------------------------------------------------------
1604 * make decision and propagate to all rules
1606 * Evaluate each term affected by the decision (linked through watches)
1607 * If we find unit rules we make new decisions based on them
1609 * Everything's fixed there, it's just finding rules that are
1612 * return : 0 = everything is OK
1613 * rule = conflict found in this rule
1617 propagate(Solver *solv, int level)
1619 Pool *pool = solv->pool;
1620 Id *rp, *next_rp; /* rule pointer, next rule pointer in linked list */
1622 Id p, pkg, other_watch;
1624 Id *decisionmap = solv->decisionmap;
1626 Id *watches = solv->watches + pool->nsolvables; /* place ptr in middle */
1628 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "----- propagate -----\n");
1630 /* foreach non-propagated decision */
1631 while (solv->propagate_index < solv->decisionq.count)
1634 * 'pkg' was just decided
1635 * negate because our watches trigger if literal goes FALSE
1637 pkg = -solv->decisionq.elements[solv->propagate_index++];
1639 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1641 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "propagate for decision %d level %d\n", -pkg, level);
1642 solver_printruleelement(solv, SAT_DEBUG_PROPAGATE, 0, -pkg);
1645 /* foreach rule where 'pkg' is now FALSE */
1646 for (rp = watches + pkg; *rp; rp = next_rp)
1648 r = solv->rules + *rp;
1651 /* rule is disabled, goto next */
1659 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1661 POOL_DEBUG(SAT_DEBUG_PROPAGATE," watch triggered ");
1662 solver_printrule(solv, SAT_DEBUG_PROPAGATE, r);
1665 /* 'pkg' was just decided (was set to FALSE)
1667 * now find other literal watch, check clause
1668 * and advance on linked list
1672 other_watch = r->w2;
1677 other_watch = r->w1;
1682 * This term is already true (through the other literal)
1683 * so we have nothing to do
1685 if (DECISIONMAP_TRUE(other_watch))
1689 * The other literal is FALSE or UNDEF
1695 /* Not a binary clause, try to move our watch.
1697 * Go over all literals and find one that is
1701 * (TRUE is also ok, in that case the rule is fulfilled)
1703 if (r->p /* we have a 'p' */
1704 && r->p != other_watch /* which is not watched */
1705 && !DECISIONMAP_FALSE(r->p)) /* and not FALSE */
1709 else /* go find a 'd' to make 'true' */
1712 we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
1714 for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
1716 if (p != other_watch /* which is not watched */
1717 && !DECISIONMAP_FALSE(p)) /* and not FALSE */
1725 * if we found some p that is UNDEF or TRUE, move
1728 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1731 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), solvable2str(pool, pool->solvables + p));
1733 POOL_DEBUG(SAT_DEBUG_PROPAGATE," -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), solvable2str(pool, pool->solvables - p));
1749 watches[p] = r - solv->rules;
1752 /* search failed, thus all unwatched literals are FALSE */
1757 * unit clause found, set literal other_watch to TRUE
1760 if (DECISIONMAP_FALSE(other_watch)) /* check if literal is FALSE */
1761 return r; /* eek, a conflict! */
1763 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1765 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " unit ");
1766 solver_printrule(solv, SAT_DEBUG_PROPAGATE, r);
1769 if (other_watch > 0)
1770 decisionmap[other_watch] = level; /* install! */
1772 decisionmap[-other_watch] = -level; /* remove! */
1774 queue_push(&solv->decisionq, other_watch);
1775 queue_push(&solv->decisionq_why, r - solv->rules);
1777 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1779 Solvable *s = pool->solvables + (other_watch > 0 ? other_watch : -other_watch);
1780 if (other_watch > 0)
1781 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> decided to install %s\n", solvable2str(pool, s));
1783 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> decided to conflict %s\n", solvable2str(pool, s));
1786 } /* foreach rule involving 'pkg' */
1788 } /* while we have non-decided decisions */
1790 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "----- propagate end-----\n");
1792 return 0; /* all is well */
1796 /********************************************************************/
1799 /*-------------------------------------------------------------------
1806 analyze(Solver *solv, int level, Rule *c, int *pr, int *dr, int *whyp)
1808 Pool *pool = solv->pool;
1811 Map seen; /* global? */
1812 Id d, v, vv, *dp, why;
1814 int num = 0, l1num = 0;
1815 int learnt_why = solv->learnt_pool.count;
1816 Id *decisionmap = solv->decisionmap;
1820 POOL_DEBUG(SAT_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
1821 map_init(&seen, pool->nsolvables);
1822 idx = solv->decisionq.count;
1825 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
1826 solver_printruleclass(solv, SAT_DEBUG_ANALYZE, c);
1827 queue_push(&solv->learnt_pool, c - solv->rules);
1828 d = c->d < 0 ? -c->d - 1 : c->d;
1829 dp = d ? pool->whatprovidesdata + d : 0;
1830 /* go through all literals of the rule */
1842 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1844 vv = v > 0 ? v : -v;
1845 if (MAPTST(&seen, vv))
1847 l = solv->decisionmap[vv];
1852 l1num++; /* need to do this one in level1 pass */
1853 else if (l == level)
1854 num++; /* need to do this one as well */
1857 queue_push(&r, v); /* not level1 or conflict level, add to new rule */
1863 if (!num && !--l1num)
1864 break; /* all level 1 literals done */
1868 v = solv->decisionq.elements[--idx];
1869 vv = v > 0 ? v : -v;
1870 if (MAPTST(&seen, vv))
1874 if (num && --num == 0)
1876 *pr = -v; /* so that v doesn't get lost */
1879 POOL_DEBUG(SAT_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
1880 for (i = 0; i < r.count; i++)
1883 MAPCLR(&seen, v > 0 ? v : -v);
1885 /* only level 1 marks left */
1889 why = solv->decisionq_why.elements[idx];
1890 if (!why) /* just in case, maybe for SYSTEMSOLVABLE */
1892 c = solv->rules + why;
1898 else if (r.count == 1 && r.elements[0] < 0)
1899 *dr = r.elements[0];
1901 *dr = pool_queuetowhatprovides(pool, &r);
1902 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
1904 POOL_DEBUG(SAT_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
1905 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, *pr);
1906 for (i = 0; i < r.count; i++)
1907 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, r.elements[i]);
1909 /* push end marker on learnt reasons stack */
1910 queue_push(&solv->learnt_pool, 0);
1913 solv->stats_learned++;
1918 /*-------------------------------------------------------------------
1922 * reset the solver decisions to right after the rpm rules.
1923 * called after rules have been enabled/disabled
1927 reset_solver(Solver *solv)
1929 Pool *pool = solv->pool;
1933 /* rewind decisions to direct rpm rule assertions */
1934 for (i = solv->decisionq.count - 1; i >= solv->directdecisions; i--)
1936 v = solv->decisionq.elements[i];
1937 solv->decisionmap[v > 0 ? v : -v] = 0;
1940 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "decisions done reduced from %d to %d\n", solv->decisionq.count, solv->directdecisions);
1942 solv->decisionq_why.count = solv->directdecisions;
1943 solv->decisionq.count = solv->directdecisions;
1944 solv->recommends_index = -1;
1945 solv->propagate_index = 0;
1947 /* adapt learnt rule status to new set of enabled/disabled rules */
1948 enabledisablelearntrules(solv);
1950 /* redo all job/update decisions */
1951 makeruledecisions(solv);
1952 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "decisions so far: %d\n", solv->decisionq.count);
1956 /*-------------------------------------------------------------------
1958 * analyze_unsolvable_rule
1962 analyze_unsolvable_rule(Solver *solv, Rule *r, Id *lastweakp)
1964 Pool *pool = solv->pool;
1966 Id why = r - solv->rules;
1968 IF_POOLDEBUG (SAT_DEBUG_UNSOLVABLE)
1969 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, r);
1970 if (solv->learntrules && why >= solv->learntrules)
1972 for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
1973 if (solv->learnt_pool.elements[i] > 0)
1974 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp);
1977 if (MAPTST(&solv->weakrulemap, why))
1978 if (!*lastweakp || why > *lastweakp)
1980 /* do not add rpm rules to problem */
1981 if (why < solv->rpmrules_end)
1983 /* turn rule into problem */
1984 if (why >= solv->jobrules && why < solv->jobrules_end)
1985 why = -(solv->ruletojob.elements[why - solv->jobrules] + 1);
1986 /* return if problem already countains our rule */
1987 if (solv->problems.count)
1989 for (i = solv->problems.count - 1; i >= 0; i--)
1990 if (solv->problems.elements[i] == 0) /* end of last problem reached? */
1992 else if (solv->problems.elements[i] == why)
1995 queue_push(&solv->problems, why);
1999 /*-------------------------------------------------------------------
2001 * analyze_unsolvable
2003 * return: 1 - disabled some rules, try again
2008 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
2010 Pool *pool = solv->pool;
2012 Map seen; /* global to speed things up? */
2013 Id d, v, vv, *dp, why;
2015 Id *decisionmap = solv->decisionmap;
2016 int oldproblemcount;
2017 int oldlearntpoolcount;
2020 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
2021 solv->stats_unsolvable++;
2022 oldproblemcount = solv->problems.count;
2023 oldlearntpoolcount = solv->learnt_pool.count;
2025 /* make room for proof index */
2026 /* must update it later, as analyze_unsolvable_rule would confuse
2027 * it with a rule index if we put the real value in already */
2028 queue_push(&solv->problems, 0);
2031 map_init(&seen, pool->nsolvables);
2032 queue_push(&solv->learnt_pool, r - solv->rules);
2034 analyze_unsolvable_rule(solv, r, &lastweak);
2035 d = r->d < 0 ? -r->d - 1 : r->d;
2036 dp = d ? pool->whatprovidesdata + d : 0;
2047 if (DECISIONMAP_TRUE(v)) /* the one true literal */
2049 vv = v > 0 ? v : -v;
2050 l = solv->decisionmap[vv];
2055 idx = solv->decisionq.count;
2058 v = solv->decisionq.elements[--idx];
2059 vv = v > 0 ? v : -v;
2060 if (!MAPTST(&seen, vv))
2062 why = solv->decisionq_why.elements[idx];
2063 queue_push(&solv->learnt_pool, why);
2064 r = solv->rules + why;
2065 analyze_unsolvable_rule(solv, r, &lastweak);
2066 d = r->d < 0 ? -r->d - 1 : r->d;
2067 dp = d ? pool->whatprovidesdata + d : 0;
2078 if (DECISIONMAP_TRUE(v)) /* the one true literal */
2080 vv = v > 0 ? v : -v;
2081 l = solv->decisionmap[vv];
2088 queue_push(&solv->problems, 0); /* mark end of this problem */
2092 /* disable last weak rule */
2093 solv->problems.count = oldproblemcount;
2094 solv->learnt_pool.count = oldlearntpoolcount;
2095 r = solv->rules + lastweak;
2096 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "disabling ");
2097 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, r);
2098 disablerule(solv, r);
2104 queue_push(&solv->learnt_pool, 0);
2105 solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
2109 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
2110 disableproblem(solv, solv->problems.elements[i]);
2111 /* XXX: might want to enable all weak rules again */
2115 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
2120 /********************************************************************/
2121 /* Decision revert */
2123 /*-------------------------------------------------------------------
2126 * revert decision at level
2130 revert(Solver *solv, int level)
2132 Pool *pool = solv->pool;
2134 while (solv->decisionq.count)
2136 v = solv->decisionq.elements[solv->decisionq.count - 1];
2137 vv = v > 0 ? v : -v;
2138 if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
2140 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
2141 if (v > 0 && solv->recommendations.count && v == solv->recommendations.elements[solv->recommendations.count - 1])
2142 solv->recommendations.count--;
2143 solv->decisionmap[vv] = 0;
2144 solv->decisionq.count--;
2145 solv->decisionq_why.count--;
2146 solv->propagate_index = solv->decisionq.count;
2148 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
2150 solv->branches.count--;
2151 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
2152 solv->branches.count--;
2154 solv->recommends_index = -1;
2158 /*-------------------------------------------------------------------
2160 * watch2onhighest - put watch2 on literal with highest level
2164 watch2onhighest(Solver *solv, Rule *r)
2169 d = r->d < 0 ? -r->d - 1 : r->d;
2171 return; /* binary rule, both watches are set */
2172 dp = solv->pool->whatprovidesdata + d;
2173 while ((v = *dp++) != 0)
2175 l = solv->decisionmap[v < 0 ? -v : v];
2187 /*-------------------------------------------------------------------
2191 * add free decision (solvable to install) to decisionq
2192 * increase level and propagate decision
2193 * return if no conflict.
2195 * in conflict case, analyze conflict rule, add resulting
2196 * rule to learnt rule set, make decision from learnt
2197 * rule (always unit) and re-propagate.
2199 * returns the new solver level or 0 if unsolvable
2204 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules)
2206 Pool *pool = solv->pool;
2215 solv->decisionmap[decision] = level;
2217 solv->decisionmap[-decision] = -level;
2218 queue_push(&solv->decisionq, decision);
2219 queue_push(&solv->decisionq_why, 0);
2223 r = propagate(solv, level);
2227 return analyze_unsolvable(solv, r, disablerules);
2228 POOL_DEBUG(SAT_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
2229 l = analyze(solv, level, r, &p, &d, &why); /* learnt rule in p and d */
2230 assert(l > 0 && l < level);
2231 POOL_DEBUG(SAT_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, l);
2233 revert(solv, level);
2234 r = addrule(solv, p, d); /* p requires d */
2236 assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
2237 queue_push(&solv->learnt_why, why);
2240 /* at least 2 literals, needs watches */
2241 watch2onhighest(solv, r);
2242 addwatches_rule(solv, r);
2246 /* learnt rule is an assertion */
2247 queue_push(&solv->ruleassertions, r - solv->rules);
2249 solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
2250 queue_push(&solv->decisionq, p);
2251 queue_push(&solv->decisionq_why, r - solv->rules);
2252 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
2254 POOL_DEBUG(SAT_DEBUG_ANALYZE, "decision: ");
2255 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, p);
2256 POOL_DEBUG(SAT_DEBUG_ANALYZE, "new rule: ");
2257 solver_printrule(solv, SAT_DEBUG_ANALYZE, r);
2264 /*-------------------------------------------------------------------
2266 * select and install
2268 * install best package from the queue. We add an extra package, inst, if
2269 * provided. See comment in weak install section.
2271 * returns the new solver level or 0 if unsolvable
2276 selectandinstall(Solver *solv, int level, Queue *dq, Id inst, int disablerules)
2278 Pool *pool = solv->pool;
2282 /* FIXME: do we really need that inst handling? */
2283 if (solv->distupgrade && inst && dq->count)
2285 policy_filter_unwanted(solv, dq, 0, POLICY_MODE_CHOOSE);
2286 for (i = 0; i < dq->count; i++)
2287 if (solvable_identical(pool, pool->solvables + inst, pool->solvables + dq->elements[i]))
2288 dq->elements[i] = inst;
2292 if (dq->count > 1 || inst)
2293 policy_filter_unwanted(solv, dq, inst, POLICY_MODE_CHOOSE);
2299 /* choose the supplemented one */
2300 for (i = 0; i < dq->count; i++)
2301 if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
2305 for (i = 1; i < dq->count; i++)
2306 queue_push(&solv->branches, dq->elements[i]);
2307 queue_push(&solv->branches, -level);
2311 p = dq->elements[i];
2313 POOL_DEBUG(SAT_DEBUG_POLICY, "installing %s\n", solvable2str(pool, pool->solvables + p));
2315 return setpropagatelearn(solv, level, p, disablerules);
2319 /********************************************************************/
2320 /* Main solver interface */
2323 /*-------------------------------------------------------------------
2326 * create solver structure
2328 * pool: all available solvables
2329 * installed: installed Solvables
2332 * Upon solving, rules are created to flag the Solvables
2333 * of the 'installed' Repo as installed.
2337 solver_create(Pool *pool)
2340 solv = (Solver *)sat_calloc(1, sizeof(Solver));
2342 solv->installed = pool->installed;
2344 queue_init(&solv->ruletojob);
2345 queue_init(&solv->decisionq);
2346 queue_init(&solv->decisionq_why);
2347 queue_init(&solv->problems);
2348 queue_init(&solv->suggestions);
2349 queue_init(&solv->recommendations);
2350 queue_init(&solv->orphaned);
2351 queue_init(&solv->learnt_why);
2352 queue_init(&solv->learnt_pool);
2353 queue_init(&solv->branches);
2354 queue_init(&solv->covenantq);
2355 queue_init(&solv->weakruleq);
2356 queue_init(&solv->ruleassertions);
2358 map_init(&solv->recommendsmap, pool->nsolvables);
2359 map_init(&solv->suggestsmap, pool->nsolvables);
2360 map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
2361 solv->recommends_index = 0;
2363 solv->decisionmap = (Id *)sat_calloc(pool->nsolvables, sizeof(Id));
2365 solv->rules = sat_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
2366 memset(solv->rules, 0, sizeof(Rule));
2372 /*-------------------------------------------------------------------
2378 solver_free(Solver *solv)
2380 queue_free(&solv->ruletojob);
2381 queue_free(&solv->decisionq);
2382 queue_free(&solv->decisionq_why);
2383 queue_free(&solv->learnt_why);
2384 queue_free(&solv->learnt_pool);
2385 queue_free(&solv->problems);
2386 queue_free(&solv->suggestions);
2387 queue_free(&solv->recommendations);
2388 queue_free(&solv->orphaned);
2389 queue_free(&solv->branches);
2390 queue_free(&solv->covenantq);
2391 queue_free(&solv->weakruleq);
2392 queue_free(&solv->ruleassertions);
2394 map_free(&solv->recommendsmap);
2395 map_free(&solv->suggestsmap);
2396 map_free(&solv->noupdate);
2397 map_free(&solv->weakrulemap);
2398 map_free(&solv->noobsoletes);
2400 sat_free(solv->decisionmap);
2401 sat_free(solv->rules);
2402 sat_free(solv->watches);
2403 sat_free(solv->obsoletes);
2404 sat_free(solv->obsoletes_data);
2409 /*-------------------------------------------------------------------
2413 * all rules have been set up, now actually run the solver
2418 run_solver(Solver *solv, int disablerules, int doweak)
2420 Queue dq; /* local decisionqueue */
2421 Queue dqs; /* local decisionqueue for supplements */
2427 Pool *pool = solv->pool;
2430 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
2432 POOL_DEBUG (SAT_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
2433 for (i = 1; i < solv->nrules; i++)
2434 solver_printruleclass(solv, SAT_DEBUG_RULE_CREATION, solv->rules + i);
2437 POOL_DEBUG(SAT_DEBUG_STATS, "initial decisions: %d\n", solv->decisionq.count);
2439 IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
2440 solver_printdecisions(solv);
2442 /* start SAT algorithm */
2444 systemlevel = level + 1;
2445 POOL_DEBUG(SAT_DEBUG_STATS, "solving...\n");
2451 * here's the main loop:
2452 * 1) propagate new decisions (only needed for level 1)
2453 * 2) try to keep installed packages
2454 * 3) fulfill all unresolved rules
2455 * 4) install recommended packages
2456 * 5) minimalize solution if we had choices
2457 * if we encounter a problem, we rewind to a safe level and restart
2469 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "propagating (propagate_index: %d; size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
2470 if ((r = propagate(solv, level)) != 0)
2472 if (analyze_unsolvable(solv, r, disablerules))
2479 if (level < systemlevel)
2481 POOL_DEBUG(SAT_DEBUG_STATS, "resolving job rules\n");
2482 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
2485 if (r->d < 0) /* ignore disabled rules */
2488 FOR_RULELITERALS(l, dp, r)
2492 if (solv->decisionmap[-l] <= 0)
2497 if (solv->decisionmap[l] > 0)
2499 if (solv->decisionmap[l] == 0)
2505 /* prune to installed if not updating */
2506 if (!solv->updatesystem && solv->installed && dq.count > 1)
2509 for (j = k = 0; j < dq.count; j++)
2511 Solvable *s = pool->solvables + dq.elements[j];
2512 if (s->repo == solv->installed)
2513 dq.elements[k++] = dq.elements[j];
2519 level = selectandinstall(solv, level, &dq, 0, disablerules);
2525 if (level <= olevel)
2528 systemlevel = level + 1;
2529 if (i < solv->jobrules_end)
2535 * installed packages
2538 if (level < systemlevel && solv->installed && solv->installed->nsolvables)
2540 if (!solv->updatesystem)
2543 * Normal run (non-updating)
2544 * Keep as many packages installed as possible
2546 POOL_DEBUG(SAT_DEBUG_STATS, "installing old packages\n");
2548 for (i = solv->installed->start; i < solv->installed->end; i++)
2550 s = pool->solvables + i;
2552 /* skip if not installed */
2553 if (s->repo != solv->installed)
2556 /* skip if already decided */
2557 if (solv->decisionmap[i] != 0)
2560 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "keeping %s\n", solvable2str(pool, s));
2563 level = setpropagatelearn(solv, level, i, disablerules);
2565 if (level == 0) /* unsolvable */
2570 if (level <= olevel)
2573 if (i < solv->installed->end)
2577 POOL_DEBUG(SAT_DEBUG_STATS, "resolving update/feature rules\n");
2579 for (i = solv->installed->start, r = solv->rules + solv->updaterules; i < solv->installed->end; i++, r++)
2583 s = pool->solvables + i;
2585 /* skip if not installed (can't update) */
2586 if (s->repo != solv->installed)
2588 /* skip if already decided */
2589 if (solv->decisionmap[i] > 0)
2592 /* noupdate is set if a job is erasing the installed solvable or installing a specific version */
2593 if (MAPTST(&solv->noupdate, i - solv->installed->start))
2599 if (rr->d < 0) /* disabled -> look at feature rule ? */
2600 rr -= solv->installed->end - solv->installed->start;
2601 if (!rr->p) /* identical to update rule? */
2606 FOR_RULELITERALS(p, dp, rr)
2608 if (solv->decisionmap[p] > 0)
2610 if (solv->decisionmap[p] == 0)
2613 if (p || !dq.count) /* already fulfilled or empty */
2615 if (dq.elements[0] == i)
2616 inst = queue_shift(&dq);
2620 /* FIXME: it is handled a bit different because we do not want
2621 * to have it pruned just because it is not recommened.
2622 * we should not prune installed packages instead.
2624 level = selectandinstall(solv, level, &dq, inst, disablerules);
2630 if (level <= olevel)
2633 systemlevel = level + 1;
2634 if (i < solv->installed->end)
2638 if (level < systemlevel)
2639 systemlevel = level;
2645 POOL_DEBUG(SAT_DEBUG_POLICY, "deciding unresolved rules\n");
2646 for (i = 1, n = 1; ; i++, n++)
2648 if (n == solv->nrules)
2650 if (i == solv->nrules)
2652 r = solv->rules + i;
2653 if (r->d < 0) /* ignore disabled rules */
2658 /* binary or unary rule */
2659 /* need two positive undecided literals */
2660 if (r->p < 0 || r->w2 <= 0)
2662 if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
2664 queue_push(&dq, r->p);
2665 queue_push(&dq, r->w2);
2670 * all negative literals are installed
2671 * no positive literal is installed
2672 * i.e. the rule is not fulfilled and we
2673 * just need to decide on the positive literals
2677 if (solv->decisionmap[-r->p] <= 0)
2682 if (solv->decisionmap[r->p] > 0)
2684 if (solv->decisionmap[r->p] == 0)
2685 queue_push(&dq, r->p);
2687 dp = pool->whatprovidesdata + r->d;
2688 while ((p = *dp++) != 0)
2692 if (solv->decisionmap[-p] <= 0)
2697 if (solv->decisionmap[p] > 0)
2699 if (solv->decisionmap[p] == 0)
2706 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
2708 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "unfulfilled ");
2709 solver_printruleclass(solv, SAT_DEBUG_PROPAGATE, r);
2711 /* dq.count < 2 cannot happen as this means that
2712 * the rule is unit */
2713 assert(dq.count > 1);
2716 level = selectandinstall(solv, level, &dq, 0, disablerules);
2722 if (level < systemlevel)
2725 } /* for(), decide */
2727 if (n != solv->nrules) /* continue if level < systemlevel */
2734 POOL_DEBUG(SAT_DEBUG_POLICY, "installing recommended packages\n");
2737 for (i = 1; i < pool->nsolvables; i++)
2739 if (solv->decisionmap[i] < 0)
2741 if (solv->decisionmap[i] > 0)
2743 /* installed, check for recommends */
2744 Id *recp, rec, pp, p;
2745 s = pool->solvables + i;
2746 if (solv->ignorealreadyrecommended && s->repo == solv->installed)
2748 /* XXX need to special case AND ? */
2751 recp = s->repo->idarraydata + s->recommends;
2752 while ((rec = *recp++) != 0)
2755 FOR_PROVIDES(p, pp, rec)
2757 if (solv->decisionmap[p] > 0)
2762 else if (solv->decisionmap[p] == 0)
2764 queue_pushunique(&dq, p);
2772 s = pool->solvables + i;
2773 if (!s->supplements)
2775 if (!pool_installable(pool, s))
2777 if (!solver_is_supplementing(solv, s))
2779 if (solv->ignorealreadyrecommended && solv->installed)
2780 queue_pushunique(&dqs, i); /* needs filter */
2782 queue_pushunique(&dq, i);
2785 if (solv->ignorealreadyrecommended && dqs.count)
2787 /* turn off all new packages */
2788 for (i = 0; i < solv->decisionq.count; i++)
2790 p = solv->decisionq.elements[i];
2793 s = pool->solvables + p;
2794 if (s->repo && s->repo != solv->installed)
2795 solv->decisionmap[p] = -solv->decisionmap[p];
2797 /* filter out old supplements */
2798 for (i = 0; i < dqs.count; i++)
2800 p = dqs.elements[i];
2801 s = pool->solvables + p;
2802 if (!s->supplements)
2804 if (!solver_is_supplementing(solv, s))
2805 queue_pushunique(&dq, p);
2807 /* undo turning off */
2808 for (i = 0; i < solv->decisionq.count; i++)
2810 p = solv->decisionq.elements[i];
2813 s = pool->solvables + p;
2814 if (s->repo && s->repo != solv->installed)
2815 solv->decisionmap[p] = -solv->decisionmap[p];
2821 policy_filter_unwanted(solv, &dq, 0, POLICY_MODE_RECOMMEND);
2823 POOL_DEBUG(SAT_DEBUG_POLICY, "installing recommended %s\n", solvable2str(pool, pool->solvables + p));
2824 queue_push(&solv->recommendations, p);
2825 level = setpropagatelearn(solv, level, p, 0);
2830 if (solv->distupgrade && solv->installed)
2832 /* let's see if we can install some unsupported package */
2834 POOL_DEBUG(SAT_DEBUG_STATS, "deciding unsupported packages\n");
2835 for (i = solv->installed->start, ri = 0; i < solv->installed->end; i++, ri++)
2837 s = pool->solvables + i;
2838 if (s->repo != solv->installed)
2840 if (solv->decisionmap[i])
2842 if (!solv->rules[solv->updaterules + ri].p && !solv->rules[solv->featurerules + ri].p)
2845 if (i < solv->installed->end)
2847 if (solv->distupgrade_removeunsupported)
2849 POOL_DEBUG(SAT_DEBUG_STATS, "removing unsupported %s\n", solvable2str(pool, pool->solvables + i));
2850 level = setpropagatelearn(solv, level, -i, 0);
2854 POOL_DEBUG(SAT_DEBUG_STATS, "keeping unsupported %s\n", solvable2str(pool, pool->solvables + i));
2855 level = setpropagatelearn(solv, level, i, 0);
2861 if (solv->solution_callback)
2863 solv->solution_callback(solv, solv->solution_callback_data);
2864 if (solv->branches.count)
2866 int i = solv->branches.count - 1;
2867 int l = -solv->branches.elements[i];
2869 if (solv->branches.elements[i - 1] < 0)
2871 p = solv->branches.elements[i];
2872 POOL_DEBUG(SAT_DEBUG_STATS, "branching with %s\n", solvable2str(pool, pool->solvables + p));
2874 for (j = i + 1; j < solv->branches.count; j++)
2875 queue_push(&dq, solv->branches.elements[j]);
2876 solv->branches.count = i;
2878 revert(solv, level);
2880 for (j = 0; j < dq.count; j++)
2881 queue_push(&solv->branches, dq.elements[j]);
2883 level = setpropagatelearn(solv, level, p, disablerules);
2891 /* all branches done, we're finally finished */
2895 /* minimization step */
2896 if (solv->branches.count)
2898 int l = 0, lasti = -1, lastl = -1;
2900 for (i = solv->branches.count - 1; i >= 0; i--)
2902 p = solv->branches.elements[i];
2905 else if (p > 0 && solv->decisionmap[p] > l + 1)
2913 /* kill old solvable so that we do not loop */
2914 p = solv->branches.elements[lasti];
2915 solv->branches.elements[lasti] = 0;
2916 POOL_DEBUG(SAT_DEBUG_STATS, "minimizing %d -> %d with %s\n", solv->decisionmap[p], l, solvable2str(pool, pool->solvables + p));
2919 revert(solv, level);
2921 level = setpropagatelearn(solv, level, p, disablerules);
2932 POOL_DEBUG(SAT_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable\n", solv->stats_learned, solv->stats_unsolvable);
2934 POOL_DEBUG(SAT_DEBUG_STATS, "done solving.\n\n");
2940 /*-------------------------------------------------------------------
2944 * at this point, all rules that led to conflicts are disabled.
2945 * we re-enable all rules of a problem set but rule "sug", then
2946 * continue to disable more rules until there as again a solution.
2949 /* FIXME: think about conflicting assertions */
2952 refine_suggestion(Solver *solv, Queue *job, Id *problem, Id sug, Queue *refined)
2954 Pool *pool = solv->pool;
2960 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
2962 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "refine_suggestion start\n");
2963 for (i = 0; problem[i]; i++)
2965 if (problem[i] == sug)
2966 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "=> ");
2967 solver_printproblem(solv, problem[i]);
2970 queue_init(&disabled);
2971 queue_empty(refined);
2972 queue_push(refined, sug);
2974 /* re-enable all problem rules with the exception of "sug"(gestion) */
2978 for (i = 0; problem[i]; i++)
2979 if (problem[i] != sug)
2980 enableproblem(solv, problem[i]);
2983 disableupdaterules(solv, job, -(sug + 1));
2984 else if (sug >= solv->updaterules && sug < solv->updaterules_end)
2986 /* enable feature rule */
2987 Rule *r = solv->rules + solv->featurerules + (sug - solv->updaterules);
2989 enablerule(solv, r);
2992 enableweakrules(solv);
2996 int njob, nfeature, nupdate;
2997 queue_empty(&solv->problems);
2998 revert(solv, 1); /* XXX no longer needed? */
3001 if (!solv->problems.count)
3002 run_solver(solv, 0, 0);
3004 if (!solv->problems.count)
3006 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "no more problems!\n");
3007 IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
3008 solver_printdecisions(solv);
3009 break; /* great, no more problems */
3011 disabledcnt = disabled.count;
3012 /* start with 1 to skip over proof index */
3013 njob = nfeature = nupdate = 0;
3014 for (i = 1; i < solv->problems.count - 1; i++)
3016 /* ignore solutions in refined */
3017 v = solv->problems.elements[i];
3019 break; /* end of problem reached */
3020 for (j = 0; problem[j]; j++)
3021 if (problem[j] != sug && problem[j] == v)
3025 if (v >= solv->featurerules && v < solv->featurerules_end)
3031 if ((job->elements[-v -1] & SOLVER_ESSENTIAL) != 0)
3032 continue; /* not that one! */
3035 queue_push(&disabled, v);
3037 if (disabled.count == disabledcnt)
3039 /* no solution found, this was an invalid suggestion! */
3040 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "no solution found!\n");
3044 if (!njob && nupdate && nfeature)
3046 /* got only update rules, filter out feature rules */
3047 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "throwing away feature rules\n");
3048 for (i = j = disabledcnt; i < disabled.count; i++)
3050 v = disabled.elements[i];
3051 if (v < solv->featurerules || v >= solv->featurerules_end)
3052 disabled.elements[j++] = v;
3057 if (disabled.count == disabledcnt + 1)
3059 /* just one suggestion, add it to refined list */
3060 v = disabled.elements[disabledcnt];
3062 queue_push(refined, v); /* do not record feature rules */
3063 disableproblem(solv, v);
3064 if (v >= solv->updaterules && v < solv->updaterules_end)
3066 Rule *r = solv->rules + (v - solv->updaterules + solv->featurerules);
3068 enablerule(solv, r); /* enable corresponding feature rule */
3071 disableupdaterules(solv, job, -(v + 1));
3075 /* more than one solution, disable all */
3076 /* do not push anything on refine list, as we do not know which solution to choose */
3077 /* thus, the user will get another problem if he selects this solution, where he
3078 * can choose the right one */
3079 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
3081 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "more than one solution found:\n");
3082 for (i = disabledcnt; i < disabled.count; i++)
3083 solver_printproblem(solv, disabled.elements[i]);
3085 for (i = disabledcnt; i < disabled.count; i++)
3087 v = disabled.elements[i];
3088 disableproblem(solv, v);
3089 if (v >= solv->updaterules && v < solv->updaterules_end)
3091 Rule *r = solv->rules + (v - solv->updaterules + solv->featurerules);
3093 enablerule(solv, r);
3098 /* all done, get us back into the same state as before */
3099 /* enable refined rules again */
3100 for (i = 0; i < disabled.count; i++)
3101 enableproblem(solv, disabled.elements[i]);
3102 /* disable problem rules again */
3105 for (i = 0; problem[i]; i++)
3106 enableproblem(solv, problem[i]);
3107 disableupdaterules(solv, job, -1);
3109 /* disable problem rules again */
3110 for (i = 0; problem[i]; i++)
3111 disableproblem(solv, problem[i]);
3112 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "refine_suggestion end\n");
3116 /*-------------------------------------------------------------------
3117 * sorting helper for problems
3119 * bring update rules before job rules
3120 * make essential job rules last
3123 Queue *problems_sort_data;
3126 problems_sortcmp(const void *ap, const void *bp)
3128 Id a = *(Id *)ap, b = *(Id *)bp;
3135 Queue *job = problems_sort_data;
3136 int af = job->elements[-a - 1] & SOLVER_ESSENTIAL;
3137 int bf = job->elements[-a - 1] & SOLVER_ESSENTIAL;
3146 /*-------------------------------------------------------------------
3151 problems_sort(Solver *solv, Queue *job)
3154 if (!solv->problems.count)
3156 for (i = j = 1; i < solv->problems.count; i++)
3158 if (!solv->problems.elements[i])
3162 problems_sort_data = job;
3163 qsort(solv->problems.elements + j, i - j, sizeof(Id), problems_sortcmp);
3165 if (++i == solv->problems.count)
3173 /*-------------------------------------------------------------------
3174 * convert problems to solutions
3178 problems_to_solutions(Solver *solv, Queue *job)
3180 Pool *pool = solv->pool;
3186 int i, j, nsol, probsolved;
3187 unsigned int now, refnow;
3189 if (!solv->problems.count)
3191 now = sat_timems(0);
3192 problems_sort(solv, job);
3193 queue_clone(&problems, &solv->problems);
3194 queue_init(&solution);
3195 queue_init(&solutions);
3196 /* copy over proof index */
3197 queue_push(&solutions, problems.elements[0]);
3198 problem = problems.elements + 1;
3200 refnow = sat_timems(0);
3201 for (i = 1; i < problems.count; i++)
3203 Id v = problems.elements[i];
3206 /* mark end of this problem */
3207 queue_push(&solutions, 0);
3208 queue_push(&solutions, 0);
3209 POOL_DEBUG(SAT_DEBUG_STATS, "refining took %d ms\n", sat_timems(refnow));
3210 if (i + 1 == problems.count)
3212 /* copy over proof of next problem */
3213 queue_push(&solutions, problems.elements[i + 1]);
3215 problem = problems.elements + i + 1;
3216 refnow = sat_timems(0);
3220 if (v < 0 && (job->elements[-v - 1] & SOLVER_ESSENTIAL))
3222 /* essential job, skip if we already have a solution */
3226 refine_suggestion(solv, job, problem, v, &solution);
3227 if (!solution.count)
3228 continue; /* this solution didn't work out */
3231 for (j = 0; j < solution.count; j++)
3233 why = solution.elements[j];
3234 /* must be either job descriptor or update rule */
3235 assert(why < 0 || (why >= solv->updaterules && why < solv->updaterules_end));
3237 solver_printproblem(solv, why);
3241 /* job descriptor */
3242 queue_push(&solutions, 0);
3243 queue_push(&solutions, -why);
3247 /* update rule, find replacement package */
3248 Id p, d, *dp, rp = 0;
3250 p = solv->installed->start + (why - solv->updaterules);
3251 rr = solv->rules + solv->featurerules + (why - solv->updaterules);
3253 rr = solv->rules + why;
3254 if (solv->distupgrade && solv->rules[why].p != p && solv->decisionmap[p] > 0)
3256 /* distupgrade case, allow to keep old package */
3257 queue_push(&solutions, p);
3258 queue_push(&solutions, p);
3262 if (solv->decisionmap[p] > 0)
3263 continue; /* false alarm, turned out we can keep the package */
3266 d = rr->d < 0 ? -rr->d - 1 : rr->d;
3269 if (solv->decisionmap[rr->w2] > 0 && pool->solvables[rr->w2].repo != solv->installed)
3274 for (dp = pool->whatprovidesdata + d; *dp; dp++)
3276 if (solv->decisionmap[*dp] > 0 && pool->solvables[*dp].repo != solv->installed)
3284 queue_push(&solutions, p);
3285 queue_push(&solutions, rp);
3289 /* mark end of this solution */
3293 queue_push(&solutions, 0);
3294 queue_push(&solutions, 0);
3298 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "Oops, everything was fine?\n");
3301 queue_free(&solution);
3302 queue_free(&problems);
3303 /* copy queue over to solutions */
3304 queue_free(&solv->problems);
3305 queue_clone(&solv->problems, &solutions);
3307 /* bring solver back into problem state */
3308 revert(solv, 1); /* XXX move to reset_solver? */
3311 assert(solv->problems.count == solutions.count);
3312 queue_free(&solutions);
3313 POOL_DEBUG(SAT_DEBUG_STATS, "problems_to_solutions took %d ms\n", sat_timems(now));
3317 /*-------------------------------------------------------------------
3321 * advance to next problem
3325 solver_next_problem(Solver *solv, Id problem)
3329 return solv->problems.count ? 1 : 0;
3330 pp = solv->problems.elements + problem;
3331 while (pp[0] || pp[1])
3335 while (pp[0] || pp[1])
3340 problem = pp - solv->problems.elements;
3341 if (problem >= solv->problems.count)
3347 /*-------------------------------------------------------------------
3353 solver_next_solution(Solver *solv, Id problem, Id solution)
3359 pp = solv->problems.elements + solution;
3360 return pp[0] || pp[1] ? solution : 0;
3362 pp = solv->problems.elements + solution;
3363 while (pp[0] || pp[1])
3366 solution = pp - solv->problems.elements;
3367 return pp[0] || pp[1] ? solution : 0;
3371 /*-------------------------------------------------------------------
3373 * solution element iterator
3377 solver_next_solutionelement(Solver *solv, Id problem, Id solution, Id element, Id *p, Id *rp)
3380 element = element ? element + 2 : solution;
3381 pp = solv->problems.elements + element;
3382 if (!(pp[0] || pp[1]))
3390 /*-------------------------------------------------------------------
3392 * Retrieve information about a problematic rule
3394 * this is basically the reverse of addrpmrulesforsolvable
3398 solver_problemruleinfo(Solver *solv, Queue *job, Id rid, Id *depp, Id *sourcep, Id *targetp)
3400 Pool *pool = solv->pool;
3401 Repo *installed = solv->installed;
3405 Id p, d, w2, pp, req, *reqp, con, *conp, obs, *obsp, *dp;
3408 if (rid >= solv->jobrules && rid < solv->jobrules_end)
3411 r = solv->rules + rid;
3412 p = solv->ruletojob.elements[rid - solv->jobrules];
3413 *depp = job->elements[p + 1];
3415 *targetp = job->elements[p];
3416 d = r->d < 0 ? -r->d - 1 : r->d;
3417 if (d == 0 && r->w2 == 0 && r->p == -SYSTEMSOLVABLE && (job->elements[p] & SOLVER_SELECTMASK) != SOLVER_SOLVABLE_ONE_OF)
3418 return SOLVER_PROBLEM_JOB_NOTHING_PROVIDES_DEP;
3419 return SOLVER_PROBLEM_JOB_RULE;
3421 if (rid >= solv->updaterules && rid < solv->updaterules_end)
3424 *sourcep = solv->installed->start + (rid - solv->updaterules);
3426 return SOLVER_PROBLEM_UPDATE_RULE;
3428 assert(rid < solv->rpmrules_end);
3429 r = solv->rules + rid;
3431 d = r->d < 0 ? -r->d - 1 : r->d;
3432 if (d == 0 && r->w2 == 0)
3434 /* a rpm rule assertion */
3435 s = pool->solvables - r->p;
3436 if (installed && !solv->fixsystem && s->repo == installed)
3438 assert(!dontfix); /* dontfix packages never have a neg assertion */
3441 /* see why the package is not installable */
3442 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC && !pool_installable(pool, s))
3445 return SOLVER_PROBLEM_NOT_INSTALLABLE;
3447 /* check requires */
3450 reqp = s->repo->idarraydata + s->requires;
3451 while ((req = *reqp++) != 0)
3453 if (req == SOLVABLE_PREREQMARKER)
3455 dp = pool->whatprovidesdata + pool_whatprovides(pool, req);
3462 return SOLVER_PROBLEM_NOTHING_PROVIDES_DEP;
3465 if (!solv->allowselfconflicts && s->conflicts)
3467 conp = s->repo->idarraydata + s->conflicts;
3468 while ((con = *conp++) != 0)
3469 FOR_PROVIDES(p, pp, con)
3473 return SOLVER_PROBLEM_SELF_CONFLICT;
3476 /* should never happen */
3478 return SOLVER_PROBLEM_RPM_RULE;
3480 s = pool->solvables - r->p;
3481 if (installed && !solv->fixsystem && s->repo == installed)
3484 if (d && pool->whatprovidesdata[d] < 0)
3486 /* rule looks like -p|-c|x|x|x..., we only create this for patches with multiversion */
3487 /* reduce it to -p|-c case */
3488 w2 = pool->whatprovidesdata[d];
3490 if (d == 0 && w2 < 0)
3492 /* a package conflict */
3493 Solvable *s2 = pool->solvables - w2;
3496 if (installed && !solv->fixsystem && s2->repo == installed)
3499 /* if both packages have the same name and at least one of them
3500 * is not installed, they conflict */
3501 if (s->name == s2->name && !(installed && s->repo == installed && s2->repo == installed))
3503 /* also check noobsoletes map */
3504 if ((s->evr == s2->evr && s->arch == s2->arch) || !solv->noobsoletes.size
3505 || ((!installed || s->repo != installed) && !MAPTST(&solv->noobsoletes, -r->p))
3506 || ((!installed || s2->repo != installed) && !MAPTST(&solv->noobsoletes, -w2)))
3511 return SOLVER_PROBLEM_SAME_NAME;
3515 /* check conflicts in both directions */
3518 conp = s->repo->idarraydata + s->conflicts;
3519 while ((con = *conp++) != 0)
3521 FOR_PROVIDES(p, pp, con)
3523 if (dontfix && pool->solvables[p].repo == installed)
3530 return SOLVER_PROBLEM_PACKAGE_CONFLICT;
3536 conp = s2->repo->idarraydata + s2->conflicts;
3537 while ((con = *conp++) != 0)
3539 FOR_PROVIDES(p, pp, con)
3541 if (dontfix2 && pool->solvables[p].repo == installed)
3548 return SOLVER_PROBLEM_PACKAGE_CONFLICT;
3552 /* check obsoletes in both directions */
3553 if ((!installed || s->repo != installed) && s->obsoletes && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -r->p)))
3555 obsp = s->repo->idarraydata + s->obsoletes;
3556 while ((obs = *obsp++) != 0)
3558 FOR_PROVIDES(p, pp, obs)
3562 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3567 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3571 if ((!installed || s2->repo != installed) && s2->obsoletes && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -w2)))
3573 obsp = s2->repo->idarraydata + s2->obsoletes;
3574 while ((obs = *obsp++) != 0)
3576 FOR_PROVIDES(p, pp, obs)
3580 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3585 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3589 if (solv->implicitobsoleteusesprovides && (!installed || s->repo != installed) && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -r->p)))
3591 FOR_PROVIDES(p, pp, s->name)
3598 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3601 if (solv->implicitobsoleteusesprovides && (!installed || s2->repo != installed) && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -w2)))
3603 FOR_PROVIDES(p, pp, s2->name)
3610 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3613 /* all cases checked, can't happen */
3617 return SOLVER_PROBLEM_RPM_RULE;
3619 /* simple requires */
3622 reqp = s->repo->idarraydata + s->requires;
3623 while ((req = *reqp++) != 0)
3625 if (req == SOLVABLE_PREREQMARKER)
3627 dp = pool->whatprovidesdata + pool_whatprovides(pool, req);
3630 if (*dp == r->w2 && dp[1] == 0)
3633 else if (dp - pool->whatprovidesdata == d)
3641 return SOLVER_PROBLEM_DEP_PROVIDERS_NOT_INSTALLABLE;
3644 /* all cases checked, can't happen */
3648 return SOLVER_PROBLEM_RPM_RULE;
3652 /*-------------------------------------------------------------------
3658 findproblemrule_internal(Solver *solv, Id idx, Id *reqrp, Id *conrp, Id *sysrp, Id *jobrp)
3661 Id lreqr, lconr, lsysr, ljobr;
3665 lreqr = lconr = lsysr = ljobr = 0;
3666 while ((rid = solv->learnt_pool.elements[idx++]) != 0)
3669 if (rid >= solv->learntrules)
3670 findproblemrule_internal(solv, solv->learnt_why.elements[rid - solv->learntrules], &lreqr, &lconr, &lsysr, &ljobr);
3671 else if (rid >= solv->jobrules && rid < solv->jobrules_end)
3676 else if (rid >= solv->updaterules && rid < solv->updaterules_end)
3683 assert(rid < solv->rpmrules_end);
3684 r = solv->rules + rid;
3685 d = r->d < 0 ? -r->d - 1 : r->d;
3686 if (!d && r->w2 < 0)
3693 if (!d && r->w2 == 0 && !reqassert)
3695 /* prefer assertions (XXX: bad idea?) */
3701 else if (solv->installed && r->p < 0 && solv->pool->solvables[-r->p].repo == solv->installed)
3703 /* prefer rules of installed packages */
3704 Id op = *reqrp >= 0 ? solv->rules[*reqrp].p : -*reqrp;
3705 if (op <= 0 || solv->pool->solvables[op].repo != solv->installed)
3711 if (!*reqrp && lreqr)
3713 if (!*conrp && lconr)
3715 if (!*jobrp && ljobr)
3717 if (!*sysrp && lsysr)
3722 /*-------------------------------------------------------------------
3726 * search for a rule that describes the problem to the
3727 * user. A pretty hopeless task, actually. We currently
3728 * prefer simple requires.
3732 solver_findproblemrule(Solver *solv, Id problem)
3734 Id reqr, conr, sysr, jobr;
3735 Id idx = solv->problems.elements[problem - 1];
3736 reqr = conr = sysr = jobr = 0;
3737 findproblemrule_internal(solv, idx, &reqr, &conr, &sysr, &jobr);
3750 /*-------------------------------------------------------------------
3752 * create reverse obsoletes map for installed solvables
3754 * for each installed solvable find which packages with *different* names
3755 * obsolete the solvable.
3756 * this index is used in policy_findupdatepackages if noupdateprovide is set.
3760 create_obsolete_index(Solver *solv)
3762 Pool *pool = solv->pool;
3764 Repo *installed = solv->installed;
3765 Id p, pp, obs, *obsp, *obsoletes, *obsoletes_data;
3768 if (!installed || !installed->nsolvables)
3770 solv->obsoletes = obsoletes = sat_calloc(installed->end - installed->start, sizeof(Id));
3771 for (i = 1; i < pool->nsolvables; i++)
3773 s = pool->solvables + i;
3776 if (!pool_installable(pool, s))
3778 obsp = s->repo->idarraydata + s->obsoletes;
3779 while ((obs = *obsp++) != 0)
3781 FOR_PROVIDES(p, pp, obs)
3783 if (pool->solvables[p].repo != installed)
3785 if (pool->solvables[p].name == s->name)
3787 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3789 obsoletes[p - installed->start]++;
3794 for (i = 0; i < installed->nsolvables; i++)
3797 n += obsoletes[i] + 1;
3800 solv->obsoletes_data = obsoletes_data = sat_calloc(n + 1, sizeof(Id));
3801 POOL_DEBUG(SAT_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
3802 for (i = pool->nsolvables - 1; i > 0; i--)
3804 s = pool->solvables + i;
3807 if (!pool_installable(pool, s))
3809 obsp = s->repo->idarraydata + s->obsoletes;
3810 while ((obs = *obsp++) != 0)
3812 FOR_PROVIDES(p, pp, obs)
3814 if (pool->solvables[p].repo != installed)
3816 if (pool->solvables[p].name == s->name)
3818 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3820 p -= installed->start;
3821 if (obsoletes_data[obsoletes[p]] != i)
3822 obsoletes_data[--obsoletes[p]] = i;
3829 /*-------------------------------------------------------------------
3831 * remove disabled conflicts
3835 removedisabledconflicts(Solver *solv, Queue *removed)
3837 Pool *pool = solv->pool;
3842 Id *decisionmap = solv->decisionmap;
3844 POOL_DEBUG(SAT_DEBUG_SCHUBI, "removedisabledconflicts\n");
3845 queue_empty(removed);
3846 for (i = 0; i < solv->decisionq.count; i++)
3848 p = solv->decisionq.elements[i];
3851 /* a conflict. we never do conflicts on free decisions, so there
3852 * must have been an unit rule */
3853 why = solv->decisionq_why.elements[i];
3855 r = solv->rules + why;
3856 if (r->d < 0 && decisionmap[-p])
3858 /* rule is now disabled, remove from decisionmap */
3859 POOL_DEBUG(SAT_DEBUG_SCHUBI, "removing conflict for package %s[%d]\n", solvable2str(pool, pool->solvables - p), -p);
3860 queue_push(removed, -p);
3861 queue_push(removed, decisionmap[-p]);
3862 decisionmap[-p] = 0;
3865 if (!removed->count)
3867 /* we removed some confliced packages. some of them might still
3868 * be in conflict, so search for unit rules and re-conflict */
3870 for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
3872 if (i == solv->nrules)
3875 r = solv->rules + i;
3881 if (r->p < 0 && !decisionmap[-r->p])
3887 if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
3889 else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
3894 if (r->p < 0 && decisionmap[-r->p] == 0)
3896 if (new || DECISIONMAP_FALSE(r->p))
3898 dp = pool->whatprovidesdata + r->d;
3899 while ((p = *dp++) != 0)
3901 if (new && p == new)
3903 if (p < 0 && decisionmap[-p] == 0)
3912 else if (!DECISIONMAP_FALSE(p))
3922 POOL_DEBUG(SAT_DEBUG_SCHUBI, "re-conflicting package %s[%d]\n", solvable2str(pool, pool->solvables - new), -new);
3923 decisionmap[-new] = -1;
3925 n = 0; /* redo all rules */
3931 /*-------------------------------------------------------------------
3933 * weaken solvable dependencies
3937 weaken_solvable_deps(Solver *solv, Id p)
3942 for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++)
3946 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
3947 continue; /* conflict */
3948 queue_push(&solv->weakruleq, i);
3952 /********************************************************************/
3962 solver_solve(Solver *solv, Queue *job)
3964 Pool *pool = solv->pool;
3965 Repo *installed = solv->installed;
3968 Map addedmap; /* '1' == have rpm-rules for solvable */
3969 Map installcandidatemap;
3970 Id how, what, select, name, weak, p, pp, d;
3975 int now, solve_start;
3977 solve_start = sat_timems(0);
3978 POOL_DEBUG(SAT_DEBUG_STATS, "solver started\n");
3979 POOL_DEBUG(SAT_DEBUG_STATS, "fixsystem=%d updatesystem=%d dosplitprovides=%d, noupdateprovide=%d\n", solv->fixsystem, solv->updatesystem, solv->dosplitprovides, solv->noupdateprovide);
3980 POOL_DEBUG(SAT_DEBUG_STATS, "distupgrade=%d distupgrade_removeunsupported=%d\n", solv->distupgrade, solv->distupgrade_removeunsupported);
3981 POOL_DEBUG(SAT_DEBUG_STATS, "allowuninstall=%d, allowdowngrade=%d, allowarchchange=%d, allowvendorchange=%d\n", solv->allowuninstall, solv->allowdowngrade, solv->allowarchchange, solv->allowvendorchange);
3982 POOL_DEBUG(SAT_DEBUG_STATS, "promoteepoch=%d, allowvirtualconflicts=%d, allowselfconflicts=%d\n", pool->promoteepoch, solv->allowvirtualconflicts, solv->allowselfconflicts);
3983 POOL_DEBUG(SAT_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d\n", solv->obsoleteusesprovides, solv->implicitobsoleteusesprovides);
3984 POOL_DEBUG(SAT_DEBUG_STATS, "dontinstallrecommended=%d, ignorealreadyrecommended=%d, dontshowinstalledrecommended=%d\n", solv->dontinstallrecommended, solv->ignorealreadyrecommended, solv->dontshowinstalledrecommended);
3985 /* create whatprovides if not already there */
3986 if (!pool->whatprovides)
3987 pool_createwhatprovides(pool);
3989 /* create obsolete index if needed */
3990 create_obsolete_index(solv);
3993 * create basic rule set of all involved packages
3994 * use addedmap bitmap to make sure we don't create rules twice
3998 /* create noobsolete map if needed */
3999 for (i = 0; i < job->count; i += 2)
4001 how = job->elements[i] & ~SOLVER_WEAK;
4002 if ((how & SOLVER_JOBMASK) != SOLVER_NOOBSOLETES)
4004 what = job->elements[i + 1];
4005 select = how & SOLVER_SELECTMASK;
4006 if (!solv->noobsoletes.size)
4007 map_init(&solv->noobsoletes, pool->nsolvables);
4008 FOR_JOB_SELECT(p, pp, select, what)
4009 MAPSET(&solv->noobsoletes, p);
4012 map_init(&addedmap, pool->nsolvables);
4013 map_init(&installcandidatemap, pool->nsolvables);
4017 * always install our system solvable
4019 MAPSET(&addedmap, SYSTEMSOLVABLE);
4020 queue_push(&solv->decisionq, SYSTEMSOLVABLE);
4021 queue_push(&solv->decisionq_why, 0);
4022 solv->decisionmap[SYSTEMSOLVABLE] = 1; /* installed at level '1' */
4024 now = sat_timems(0);
4026 * create rules for all package that could be involved with the solving
4027 * so called: rpm rules
4032 oldnrules = solv->nrules;
4033 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for installed solvables ***\n");
4034 FOR_REPO_SOLVABLES(installed, p, s)
4035 addrpmrulesforsolvable(solv, s, &addedmap);
4036 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
4037 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for updaters of installed solvables ***\n");
4038 oldnrules = solv->nrules;
4039 FOR_REPO_SOLVABLES(installed, p, s)
4040 addrpmrulesforupdaters(solv, s, &addedmap, 1);
4041 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
4045 * create rules for all packages involved in the job
4046 * (to be installed or removed)
4049 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for packages involved with a job ***\n");
4050 oldnrules = solv->nrules;
4051 for (i = 0; i < job->count; i += 2)
4053 how = job->elements[i];
4054 what = job->elements[i + 1];
4055 select = how & SOLVER_SELECTMASK;
4057 switch (how & SOLVER_JOBMASK)
4059 case SOLVER_INSTALL:
4060 FOR_JOB_SELECT(p, pp, select, what)
4062 MAPSET(&installcandidatemap, p);
4063 addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
4067 /* FIXME: semantics? */
4068 FOR_JOB_SELECT(p, pp, select, what)
4069 addrpmrulesforupdaters(solv, pool->solvables + what, &addedmap, 0);
4073 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
4075 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for recommended/suggested packages ***\n");
4077 oldnrules = solv->nrules;
4080 * add rules for suggests, enhances
4082 addrpmrulesforweak(solv, &addedmap);
4083 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
4085 IF_POOLDEBUG (SAT_DEBUG_STATS)
4087 int possible = 0, installable = 0;
4088 for (i = 1; i < pool->nsolvables; i++)
4090 if (pool_installable(pool, pool->solvables + i))
4092 if (MAPTST(&addedmap, i))
4095 POOL_DEBUG(SAT_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
4099 * first pass done, we now have all the rpm rules we need.
4100 * unify existing rules before going over all job rules and
4102 * at this point the system is always solvable,
4103 * as an empty system (remove all packages) is a valid solution
4106 unifyrules(solv); /* remove duplicate rpm rules */
4108 solv->rpmrules_end = solv->nrules; /* mark end of rpm rules */
4110 solv->directdecisions = solv->decisionq.count;
4111 POOL_DEBUG(SAT_DEBUG_STATS, "rpm rule memory usage: %ld K\n", (unsigned long)solv->nrules * sizeof(Rule) / 1024);
4112 POOL_DEBUG(SAT_DEBUG_STATS, "decisions so far: %d\n", solv->decisionq.count);
4113 POOL_DEBUG(SAT_DEBUG_STATS, "rpm rule creation took %d ms\n", sat_timems(now));
4116 * create feature rules
4118 * foreach installed:
4119 * create assertion (keep installed, if no update available)
4121 * create update rule (A|update1(A)|update2(A)|...)
4123 * those are used later on to keep a version of the installed packages in
4127 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add feature rules ***\n");
4128 solv->featurerules = solv->nrules; /* mark start of feature rules */
4131 /* foreach possibly installed solvable */
4132 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
4134 if (s->repo != installed)
4136 addrule(solv, 0, 0); /* create dummy rule */
4139 addupdaterule(solv, s, 1); /* allow s to be updated */
4142 * assert one rule per installed solvable,
4143 * either an assertion (A)
4144 * or a possible update (A|update1(A)|update2(A)|...)
4146 assert(solv->nrules - solv->featurerules == installed->end - installed->start);
4148 solv->featurerules_end = solv->nrules;
4151 * Add update rules for installed solvables
4153 * almost identical to feature rules
4154 * except that downgrades/archchanges/vendorchanges are not allowed
4157 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add update rules ***\n");
4158 solv->updaterules = solv->nrules;
4161 { /* foreach installed solvables */
4162 /* we create all update rules, but disable some later on depending on the job */
4163 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
4167 if (s->repo != installed)
4169 addrule(solv, 0, 0); /* create dummy rule */
4172 addupdaterule(solv, s, 0); /* allowall = 0: downgrades not allowed */
4174 * check for and remove duplicate
4176 r = solv->rules + solv->nrules - 1; /* r: update rule */
4177 sr = r - (installed->end - installed->start); /* sr: feature rule */
4178 /* it's orphaned if there is no feature rule or the feature rule
4179 * consists just of the installed package */
4180 if (!sr->p || (sr->p == i && !sr->d && !sr->w2))
4181 queue_push(&solv->orphaned, i);
4184 assert(!sr->p); /* can't have feature rule and no update rule */
4187 unifyrules_sortcmp_data = pool;
4188 if (!unifyrules_sortcmp(r, sr))
4190 /* identical rule, kill unneeded rule */
4191 if (solv->allowuninstall)
4193 /* keep feature rule, make it weak */
4194 memset(r, 0, sizeof(*r));
4195 queue_push(&solv->weakruleq, sr - solv->rules);
4199 /* keep update rule */
4200 memset(sr, 0, sizeof(*sr));
4203 else if (solv->allowuninstall)
4205 /* make both feature and update rule weak */
4206 queue_push(&solv->weakruleq, r - solv->rules);
4207 queue_push(&solv->weakruleq, sr - solv->rules);
4210 disablerule(solv, sr);
4212 /* consistency check: we added a rule for _every_ installed solvable */
4213 assert(solv->nrules - solv->updaterules == installed->end - installed->start);
4215 solv->updaterules_end = solv->nrules;
4219 * now add all job rules
4222 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add JOB rules ***\n");
4224 solv->jobrules = solv->nrules;
4225 for (i = 0; i < job->count; i += 2)
4227 oldnrules = solv->nrules;
4229 how = job->elements[i];
4230 what = job->elements[i + 1];
4231 weak = how & SOLVER_WEAK;
4232 select = how & SOLVER_SELECTMASK;
4233 switch (how & SOLVER_JOBMASK)
4235 case SOLVER_INSTALL:
4236 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4237 if (select == SOLVER_SOLVABLE)
4245 FOR_JOB_SELECT(p, pp, select, what)
4249 /* no candidate found, make this an impossible rule */
4250 queue_push(&q, -SYSTEMSOLVABLE);
4252 p = queue_shift(&q); /* get first candidate */
4253 d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q); /* internalize */
4255 addrule(solv, p, d); /* add install rule */
4256 queue_push(&solv->ruletojob, i);
4258 queue_push(&solv->weakruleq, solv->nrules - 1);
4261 POOL_DEBUG(SAT_DEBUG_JOB, "job: %serase %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4262 if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
4264 /* special case for "erase a specific solvable": we also
4265 * erase all other solvables with that name, so that they
4266 * don't get picked up as replacement */
4267 name = pool->solvables[what].name;
4268 FOR_PROVIDES(p, pp, name)
4272 s = pool->solvables + p;
4273 if (s->name != name)
4275 /* keep other versions installed */
4276 if (s->repo == solv->installed)
4278 /* keep installcandidates of other jobs */
4279 if (MAPTST(&installcandidatemap, p))
4281 addrule(solv, -p, 0); /* remove by Id */
4282 queue_push(&solv->ruletojob, i);
4284 queue_push(&solv->weakruleq, solv->nrules - 1);
4287 FOR_JOB_SELECT(p, pp, select, what)
4289 addrule(solv, -p, 0);
4290 queue_push(&solv->ruletojob, i);
4292 queue_push(&solv->weakruleq, solv->nrules - 1);
4297 POOL_DEBUG(SAT_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4298 if (select != SOLVER_SOLVABLE)
4300 s = pool->solvables + what;
4301 POOL_DEBUG(SAT_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solvable2str(pool, s));
4302 addupdaterule(solv, s, 0);
4303 queue_push(&solv->ruletojob, i);
4305 queue_push(&solv->weakruleq, solv->nrules - 1);
4307 case SOLVER_WEAKENDEPS:
4308 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4309 if (select != SOLVER_SOLVABLE)
4311 s = pool->solvables + what;
4312 weaken_solvable_deps(solv, what);
4314 case SOLVER_NOOBSOLETES:
4315 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sno obsolete %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4318 POOL_DEBUG(SAT_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
4319 FOR_JOB_SELECT(p, pp, select, what)
4321 s = pool->solvables + p;
4322 if (installed && s->repo == installed)
4323 addrule(solv, p, 0);
4325 addrule(solv, -p, 0);
4326 queue_push(&solv->ruletojob, i);
4328 queue_push(&solv->weakruleq, solv->nrules - 1);
4332 POOL_DEBUG(SAT_DEBUG_JOB, "job: unknown job\n");
4340 IF_POOLDEBUG (SAT_DEBUG_JOB)
4343 if (solv->nrules == oldnrules)
4344 POOL_DEBUG(SAT_DEBUG_JOB, " - no rule created\n");
4345 for (j = oldnrules; j < solv->nrules; j++)
4347 POOL_DEBUG(SAT_DEBUG_JOB, " - job ");
4348 solver_printrule(solv, SAT_DEBUG_JOB, solv->rules + j);
4352 assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
4353 solv->jobrules_end = solv->nrules;
4355 /* all rules created
4356 * --------------------------------------------------------------
4357 * prepare for solving
4360 /* free unneeded memory */
4361 map_free(&addedmap);
4362 map_free(&installcandidatemap);
4365 /* create weak map */
4366 map_init(&solv->weakrulemap, solv->nrules);
4367 for (i = 0; i < solv->weakruleq.count; i++)
4369 p = solv->weakruleq.elements[i];
4370 MAPSET(&solv->weakrulemap, p);
4373 /* all new rules are learnt after this point */
4374 solv->learntrules = solv->nrules;
4376 /* create assertion index. it is only used to speed up
4377 * makeruledecsions() a bit */
4378 for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
4379 if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
4380 queue_push(&solv->ruleassertions, i);
4382 /* disable update rules that conflict with our job */
4383 disableupdaterules(solv, job, -1);
4385 /* make decisions based on job/update assertions */
4386 makeruledecisions(solv);
4388 /* create watches chains */
4391 POOL_DEBUG(SAT_DEBUG_STATS, "problems so far: %d\n", solv->problems.count);
4394 * ********************************************
4396 * ********************************************
4399 now = sat_timems(0);
4400 run_solver(solv, 1, solv->dontinstallrecommended ? 0 : 1);
4401 POOL_DEBUG(SAT_DEBUG_STATS, "solver took %d ms\n", sat_timems(now));
4405 /* disable all erase jobs (including weak "keep uninstalled" rules) */
4406 for (i = solv->jobrules, r = solv->rules + i; i < solv->learntrules; i++, r++)
4408 if (r->d < 0) /* disabled ? */
4410 if (r->p > 0) /* install job? */
4412 disablerule(solv, r);
4418 enabledisablelearntrules(solv);
4419 removedisabledconflicts(solv, &redoq);
4423 * find recommended packages
4426 /* if redoq.count == 0 we already found all recommended in the
4428 if (redoq.count || solv->dontinstallrecommended || !solv->dontshowinstalledrecommended || solv->ignorealreadyrecommended)
4430 Id rec, *recp, p, pp;
4432 /* create map of all recommened packages */
4433 solv->recommends_index = -1;
4434 MAPZERO(&solv->recommendsmap);
4435 for (i = 0; i < solv->decisionq.count; i++)
4437 p = solv->decisionq.elements[i];
4440 s = pool->solvables + p;
4443 recp = s->repo->idarraydata + s->recommends;
4444 while ((rec = *recp++) != 0)
4446 FOR_PROVIDES(p, pp, rec)
4447 if (solv->decisionmap[p] > 0)
4451 if (!solv->dontshowinstalledrecommended)
4453 FOR_PROVIDES(p, pp, rec)
4454 if (solv->decisionmap[p] > 0)
4455 MAPSET(&solv->recommendsmap, p);
4457 continue; /* p != 0: already fulfilled */
4459 FOR_PROVIDES(p, pp, rec)
4460 MAPSET(&solv->recommendsmap, p);
4464 for (i = 1; i < pool->nsolvables; i++)
4466 if (solv->decisionmap[i] < 0)
4468 if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
4470 s = pool->solvables + i;
4471 if (!MAPTST(&solv->recommendsmap, i))
4473 if (!s->supplements)
4475 if (!pool_installable(pool, s))
4477 if (!solver_is_supplementing(solv, s))
4480 if (solv->dontinstallrecommended)
4481 queue_push(&solv->recommendations, i);
4483 queue_pushunique(&solv->recommendations, i);
4485 /* we use MODE_SUGGEST here so that repo prio is ignored */
4486 policy_filter_unwanted(solv, &solv->recommendations, 0, POLICY_MODE_SUGGEST);
4490 * find suggested packages
4495 Id sug, *sugp, p, pp;
4497 /* create map of all suggests that are still open */
4498 solv->recommends_index = -1;
4499 MAPZERO(&solv->suggestsmap);
4500 for (i = 0; i < solv->decisionq.count; i++)
4502 p = solv->decisionq.elements[i];
4505 s = pool->solvables + p;
4508 sugp = s->repo->idarraydata + s->suggests;
4509 while ((sug = *sugp++) != 0)
4511 FOR_PROVIDES(p, pp, sug)
4512 if (solv->decisionmap[p] > 0)
4516 if (!solv->dontshowinstalledrecommended)
4518 FOR_PROVIDES(p, pp, sug)
4519 if (solv->decisionmap[p] > 0)
4520 MAPSET(&solv->suggestsmap, p);
4522 continue; /* already fulfilled */
4524 FOR_PROVIDES(p, pp, sug)
4525 MAPSET(&solv->suggestsmap, p);
4529 for (i = 1; i < pool->nsolvables; i++)
4531 if (solv->decisionmap[i] < 0)
4533 if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
4535 s = pool->solvables + i;
4536 if (!MAPTST(&solv->suggestsmap, i))
4540 if (!pool_installable(pool, s))
4542 if (!solver_is_enhancing(solv, s))
4545 queue_push(&solv->suggestions, i);
4547 policy_filter_unwanted(solv, &solv->suggestions, 0, POLICY_MODE_SUGGEST);
4552 /* restore decisionmap */
4553 for (i = 0; i < redoq.count; i += 2)
4554 solv->decisionmap[redoq.elements[i]] = redoq.elements[i + 1];
4558 * if unsolvable, prepare solutions
4561 if (solv->problems.count)
4563 int recocount = solv->recommendations.count;
4564 solv->recommendations.count = 0; /* so that revert() doesn't mess with it */
4565 queue_empty(&redoq);
4566 for (i = 0; i < solv->decisionq.count; i++)
4568 Id p = solv->decisionq.elements[i];
4569 queue_push(&redoq, p);
4570 queue_push(&redoq, solv->decisionq_why.elements[i]);
4571 queue_push(&redoq, solv->decisionmap[p > 0 ? p : -p]);
4573 problems_to_solutions(solv, job);
4574 memset(solv->decisionmap, 0, pool->nsolvables * sizeof(Id));
4575 queue_empty(&solv->decisionq);
4576 queue_empty(&solv->decisionq_why);
4577 for (i = 0; i < redoq.count; i += 3)
4579 Id p = redoq.elements[i];
4580 queue_push(&solv->decisionq, p);
4581 queue_push(&solv->decisionq_why, redoq.elements[i + 1]);
4582 solv->decisionmap[p > 0 ? p : -p] = redoq.elements[i + 2];
4584 solv->recommendations.count = recocount;
4588 POOL_DEBUG(SAT_DEBUG_STATS, "final solver statistics: %d learned rules, %d unsolvable\n", solv->stats_learned, solv->stats_unsolvable);
4589 POOL_DEBUG(SAT_DEBUG_STATS, "solver_solve took %d ms\n", sat_timems(solve_start));
4592 /***********************************************************************/
4593 /* disk usage computations */
4595 /*-------------------------------------------------------------------
4597 * calculate DU changes
4601 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
4605 solver_create_state_maps(solv, &installedmap, 0);
4606 pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
4607 map_free(&installedmap);
4611 /*-------------------------------------------------------------------
4613 * calculate changes in install size
4617 solver_calc_installsizechange(Solver *solv)
4622 solver_create_state_maps(solv, &installedmap, 0);
4623 change = pool_calc_installsizechange(solv->pool, &installedmap);
4624 map_free(&installedmap);
4628 #define FIND_INVOLVED_DEBUG 0
4630 solver_find_involved(Solver *solv, Queue *installedq, Solvable *ts, Queue *q)
4632 Pool *pool = solv->pool;
4637 Queue installedq_internal;
4638 Id tp, ip, p, pp, req, *reqp, sup, *supp;
4641 tp = ts - pool->solvables;
4643 queue_init(&installedq_internal);
4644 map_init(&im, pool->nsolvables);
4645 map_init(&installedm, pool->nsolvables);
4649 installedq = &installedq_internal;
4650 if (solv->installed)
4652 for (ip = solv->installed->start; ip < solv->installed->end; ip++)
4654 s = pool->solvables + ip;
4655 if (s->repo != solv->installed)
4657 queue_push(installedq, ip);
4661 for (i = 0; i < installedq->count; i++)
4663 ip = installedq->elements[i];
4664 MAPSET(&installedm, ip);
4668 queue_push(&iq, ts - pool->solvables);
4671 ip = queue_shift(&iq);
4672 if (!MAPTST(&im, ip))
4674 if (!MAPTST(&installedm, ip))
4677 s = pool->solvables + ip;
4678 #if FIND_INVOLVED_DEBUG
4679 printf("hello %s\n", solvable2str(pool, s));
4683 reqp = s->repo->idarraydata + s->requires;
4684 while ((req = *reqp++) != 0)
4686 if (req == SOLVABLE_PREREQMARKER)
4688 /* count number of installed packages that match */
4690 FOR_PROVIDES(p, pp, req)
4691 if (MAPTST(&installedm, p))
4695 FOR_PROVIDES(p, pp, req)
4699 #if FIND_INVOLVED_DEBUG
4700 printf("%s requires %s\n", solvable2str(pool, pool->solvables + ip), solvable2str(pool, pool->solvables + p));
4709 reqp = s->repo->idarraydata + s->recommends;
4710 while ((req = *reqp++) != 0)
4713 FOR_PROVIDES(p, pp, req)
4714 if (MAPTST(&installedm, p))
4718 FOR_PROVIDES(p, pp, req)
4722 #if FIND_INVOLVED_DEBUG
4723 printf("%s recommends %s\n", solvable2str(pool, pool->solvables + ip), solvable2str(pool, pool->solvables + p));
4732 /* supplements pass */
4733 for (i = 0; i < installedq->count; i++)
4735 ip = installedq->elements[i];
4736 s = pool->solvables + ip;
4737 if (!s->supplements)
4739 if (!MAPTST(&im, ip))
4741 supp = s->repo->idarraydata + s->supplements;
4742 while ((sup = *supp++) != 0)
4743 if (!dep_possible(solv, sup, &im) && dep_possible(solv, sup, &installedm))
4745 /* no longer supplemented, also erase */
4748 #if FIND_INVOLVED_DEBUG
4749 printf("%s supplemented\n", solvable2str(pool, pool->solvables + ip));
4751 queue_push(&iq, ip);
4757 for (i = 0; i < installedq->count; i++)
4759 ip = installedq->elements[i];
4760 if (MAPTST(&im, ip))
4761 queue_push(&iq, ip);
4766 ip = queue_shift(&iq);
4767 if (!MAPTST(&installedm, ip))
4769 s = pool->solvables + ip;
4770 #if FIND_INVOLVED_DEBUG
4771 printf("bye %s\n", solvable2str(pool, s));
4775 reqp = s->repo->idarraydata + s->requires;
4776 while ((req = *reqp++) != 0)
4778 FOR_PROVIDES(p, pp, req)
4780 if (!MAPTST(&im, p))
4784 #if FIND_INVOLVED_DEBUG
4785 printf("%s requires %s\n", solvable2str(pool, pool->solvables + ip), solvable2str(pool, pool->solvables + p));
4795 reqp = s->repo->idarraydata + s->recommends;
4796 while ((req = *reqp++) != 0)
4798 FOR_PROVIDES(p, pp, req)
4800 if (!MAPTST(&im, p))
4804 #if FIND_INVOLVED_DEBUG
4805 printf("%s recommends %s\n", solvable2str(pool, pool->solvables + ip), solvable2str(pool, pool->solvables + p));
4815 /* supplements pass */
4816 for (i = 0; i < installedq->count; i++)
4818 ip = installedq->elements[i];
4821 s = pool->solvables + ip;
4822 if (!s->supplements)
4824 if (MAPTST(&im, ip))
4826 supp = s->repo->idarraydata + s->supplements;
4827 while ((sup = *supp++) != 0)
4828 if (dep_possible(solv, sup, &im))
4832 #if FIND_INVOLVED_DEBUG
4833 printf("%s supplemented\n", solvable2str(pool, pool->solvables + ip));
4836 queue_push(&iq, ip);
4844 /* convert map into result */
4845 for (i = 0; i < installedq->count; i++)
4847 ip = installedq->elements[i];
4848 if (MAPTST(&im, ip))
4850 if (ip == ts - pool->solvables)
4855 map_free(&installedm);
4856 queue_free(&installedq_internal);