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 CODE10 0 /* set to '1' to enable patch atoms */
30 #define RULES_BLOCK 63
32 /********************************************************************
34 * dependency check helpers
38 /*-------------------------------------------------------------------
39 * handle split provides
43 solver_splitprovides(Solver *solv, Id dep)
45 Pool *pool = solv->pool;
50 if (!solv->dosplitprovides || !solv->installed)
54 rd = GETRELDEP(pool, dep);
55 if (rd->flags != REL_WITH)
57 FOR_PROVIDES(p, pp, dep)
59 s = pool->solvables + p;
60 if (s->repo == solv->installed && s->name == rd->name)
67 /*-------------------------------------------------------------------
68 * solver_dep_installed
72 solver_dep_installed(Solver *solv, Id dep)
75 Pool *pool = solv->pool;
80 Reldep *rd = GETRELDEP(pool, dep);
81 if (rd->flags == REL_AND)
83 if (!solver_dep_installed(solv, rd->name))
85 return solver_dep_installed(solv, rd->evr);
87 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
88 return solver_dep_installed(solv, rd->evr);
90 FOR_PROVIDES(p, pp, dep)
92 if (p == SYSTEMSOLVABLE || (solv->installed && pool->solvables[p].repo == solv->installed))
100 /*-------------------------------------------------------------------
101 * Check if dependenc is possible
103 * this mirrors solver_dep_fulfilled
104 * but uses map m instead of the decisionmap
108 dep_possible(Solver *solv, Id dep, Map *m)
110 Pool *pool = solv->pool;
115 Reldep *rd = GETRELDEP(pool, dep);
116 if (rd->flags == REL_AND)
118 if (!dep_possible(solv, rd->name, m))
120 return dep_possible(solv, rd->evr, m);
122 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
123 return solver_splitprovides(solv, rd->evr);
124 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
125 return solver_dep_installed(solv, rd->evr);
127 FOR_PROVIDES(p, pp, dep)
135 /********************************************************************
139 * - unify rules, remove duplicates
142 static Pool *unifyrules_sortcmp_data;
144 /*-------------------------------------------------------------------
146 * compare rules for unification sort
151 unifyrules_sortcmp(const void *ap, const void *bp)
153 Pool *pool = unifyrules_sortcmp_data;
154 Rule *a = (Rule *)ap;
155 Rule *b = (Rule *)bp;
161 return x; /* p differs */
164 if (a->d == 0 && b->d == 0)
165 return a->w2 - b->w2; /* assertion: return w2 diff */
167 if (a->d == 0) /* a is assertion, b not */
169 x = a->w2 - pool->whatprovidesdata[b->d];
173 if (b->d == 0) /* b is assertion, a not */
175 x = pool->whatprovidesdata[a->d] - b->w2;
179 /* compare whatprovidesdata */
180 ad = pool->whatprovidesdata + a->d;
181 bd = pool->whatprovidesdata + b->d;
183 if ((x = *ad++ - *bd++) != 0)
189 /*-------------------------------------------------------------------
192 * go over all rules and remove duplicates
196 unifyrules(Solver *solv)
198 Pool *pool = solv->pool;
202 if (solv->nrules <= 1) /* nothing to unify */
205 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- unifyrules -----\n");
207 /* sort rules first */
208 unifyrules_sortcmp_data = solv->pool;
209 qsort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp);
216 for (i = j = 1, ir = solv->rules + i; i < solv->nrules; i++, ir++)
218 if (jr && !unifyrules_sortcmp(ir, jr))
219 continue; /* prune! */
220 jr = solv->rules + j++; /* keep! */
225 /* reduced count from nrules to j rules */
226 POOL_DEBUG(SAT_DEBUG_STATS, "pruned rules from %d to %d\n", solv->nrules, j);
228 /* adapt rule buffer */
230 solv->rules = sat_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
234 IF_POOLDEBUG (SAT_DEBUG_STATS)
241 for (i = 1; i < solv->nrules; i++)
248 dp = solv->pool->whatprovidesdata + r->d;
253 POOL_DEBUG(SAT_DEBUG_STATS, " binary: %d\n", binr);
254 POOL_DEBUG(SAT_DEBUG_STATS, " normal: %d, %d literals\n", solv->nrules - 1 - binr, lits);
256 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- unifyrules end -----\n");
266 hashrule(Solver *solv, Id p, Id d, int n)
268 unsigned int x = (unsigned int)p;
272 return (x * 37) ^ (unsigned int)d;
273 dp = solv->pool->whatprovidesdata + d;
275 x = (x * 37) ^ (unsigned int)*dp++;
281 /*-------------------------------------------------------------------
287 * p = direct literal; always < 0 for installed rpm rules
288 * d, if < 0 direct literal, if > 0 offset into whatprovides, if == 0 rule is assertion (look at p only)
291 * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
293 * p < 0 : pkg id of A
294 * d > 0 : Offset in whatprovidesdata (list of providers of b)
296 * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
297 * p < 0 : pkg id of A
298 * d < 0 : Id of solvable (e.g. B1)
300 * d == 0: unary rule, assertion => (A) or (-A)
302 * Install: p > 0, d = 0 (A) user requested install
303 * Remove: p < 0, d = 0 (-A) user requested remove
304 * Requires: p < 0, d > 0 (-A|B1|B2|...) d: <list of providers for requirement of p>
305 * Updates: p > 0, d > 0 (A|B1|B2|...) d: <list of updates for solvable p>
306 * Conflicts: p < 0, d < 0 (-A|-B) either p (conflict issuer) or d (conflict provider) (binary rule)
307 * ? p > 0, d < 0 (A|-B)
308 * No-op ?: p = 0, d = 0 (null) (used as policy rule placeholder)
312 * Direct assertion (no watch needed)( if d <0 ) --> d = 0, w1 = p, w2 = 0
313 * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
314 * every other : w1 = p, w2 = whatprovidesdata[d];
315 * Disabled rule: w1 = 0
317 * always returns a rule for non-rpm rules
321 addrule(Solver *solv, Id p, Id d)
323 Pool *pool = solv->pool;
327 int n = 0; /* number of literals in rule - 1
328 0 = direct assertion (single literal)
333 /* it often happenes that requires lead to adding the same rpm rule
334 * multiple times, so we prune those duplicates right away to make
335 * the work for unifyrules a bit easier */
337 if (solv->nrules /* we already have rules */
338 && !solv->rpmrules_end) /* but are not done with rpm rules */
340 r = solv->rules + solv->nrules - 1; /* get the last added rule */
341 if (r->p == p && r->d == d && d != 0) /* identical and not user requested */
346 * compute number of literals (n) in rule
351 /* always a binary rule */
353 return 0; /* ignore self conflict */
358 for (dp = pool->whatprovidesdata + d; *dp; dp++, n++)
360 return 0; /* rule is self-fulfilling */
362 if (n == 1) /* have single provider */
363 d = dp[-1]; /* take single literal */
367 if (n == 0 && !solv->rpmrules_end)
369 /* this is a rpm rule assertion, we do not have to allocate it */
370 /* it can be identified by a level of 1 and a zero reason */
371 /* we must not drop those rules from the decisionq when rewinding! */
373 assert(solv->decisionmap[-p] == 0 || solv->decisionmap[-p] == -1);
374 if (solv->decisionmap[-p])
375 return 0; /* already got that one */
376 queue_push(&solv->decisionq, p);
377 queue_push(&solv->decisionq_why, 0);
378 solv->decisionmap[-p] = -1;
383 if (n == 1 && p > d && !solv->rpmrules_end)
385 /* smallest literal first so we can find dups */
386 n = p; p = d; d = n; /* p <-> d */
387 n = 1; /* re-set n, was used as temp var */
391 * check for duplicate
394 /* check if the last added rule (r) is exactly the same as what we're looking for. */
395 if (r && n == 1 && !r->d && r->p == p && r->w2 == d)
396 return r; /* binary rule */
398 /* have n-ary rule with same first literal, check other literals */
399 if (r && n > 1 && r->d && r->p == p)
401 /* Rule where d is an offset in whatprovidesdata */
405 dp2 = pool->whatprovidesdata + r->d;
406 for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
417 /* extend rule buffer */
418 solv->rules = sat_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
419 r = solv->rules + solv->nrules++; /* point to rule space */
428 /* direct assertion, no watch needed */
444 r->w2 = pool->whatprovidesdata[d];
449 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
451 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, " Add rule: ");
452 solver_printrule(solv, SAT_DEBUG_RULE_CREATION, r);
458 /*-------------------------------------------------------------------
463 disablerule(Solver *solv, Rule *r)
469 /*-------------------------------------------------------------------
474 enablerule(Solver *solv, Rule *r)
481 /**********************************************************************************/
483 /* a problem is an item on the solver's problem list. It can either be >0, in that
484 * case it is a update rule, or it can be <0, which makes it refer to a job
485 * consisting of multiple job rules.
489 disableproblem(Solver *solv, Id v)
497 disablerule(solv, solv->rules + v);
501 jp = solv->ruletojob.elements;
502 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
504 disablerule(solv, r);
507 /*-------------------------------------------------------------------
512 enableproblem(Solver *solv, Id v)
520 if (v >= solv->featurerules && v < solv->featurerules_end)
522 /* do not enable feature rule if update rule is enabled */
523 r = solv->rules + (v - solv->featurerules + solv->updaterules);
527 enablerule(solv, solv->rules + v);
528 if (v >= solv->updaterules && v < solv->updaterules_end)
530 /* disable feature rule when enabling update rule */
531 r = solv->rules + (v - solv->updaterules + solv->featurerules);
533 disablerule(solv, r);
538 jp = solv->ruletojob.elements;
539 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
545 /************************************************************************/
548 * make assertion rules into decisions
550 * go through update and job rules and add direct assertions
551 * to the decisionqueue. If we find a conflict, disable rules and
552 * add them to problem queue.
556 makeruledecisions(Solver *solv)
558 Pool *pool = solv->pool;
564 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- makeruledecisions ; size decisionq: %d -----\n",solv->decisionq.count);
566 decisionstart = solv->decisionq.count;
567 for (ii = 0; ii < solv->ruleassertions.count; ii++)
569 ri = solv->ruleassertions.elements[ii];
570 r = solv->rules + ri;
572 if (r->d < 0 || !r->p || r->w2) /* disabled, dummy or no assertion */
574 /* do weak rules in phase 2 */
575 if (ri < solv->learntrules && MAPTST(&solv->weakrulemap, ri))
581 if (!solv->decisionmap[vv]) /* if not yet decided */
586 queue_push(&solv->decisionq, v);
587 queue_push(&solv->decisionq_why, r - solv->rules);
588 solv->decisionmap[vv] = v > 0 ? 1 : -1;
589 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
591 Solvable *s = solv->pool->solvables + vv;
593 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", solvable2str(solv->pool, s));
595 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "installing %s (assertion)\n", solvable2str(solv->pool, s));
600 * check previous decision: is it sane ?
603 if (v > 0 && solv->decisionmap[vv] > 0) /* ok to install */
605 if (v < 0 && solv->decisionmap[vv] < 0) /* ok to remove */
611 * The rule (r) we're currently processing says something
612 * different (v = r->p) than a previous decision (decisionmap[abs(v)])
616 if (ri >= solv->learntrules)
618 /* conflict with a learnt rule */
619 /* can happen when packages cannot be installed for
620 * multiple reasons. */
621 /* we disable the learnt rule in this case */
622 disablerule(solv, r);
627 * find the decision which is the "opposite" of the rule
630 for (i = 0; i < solv->decisionq.count; i++)
631 if (solv->decisionq.elements[i] == -v)
633 assert(i < solv->decisionq.count); /* assert that we found it */
636 * conflict with system solvable ?
639 if (v == -SYSTEMSOLVABLE) {
640 /* conflict with system solvable */
641 queue_push(&solv->problems, solv->learnt_pool.count);
642 queue_push(&solv->learnt_pool, ri);
643 queue_push(&solv->learnt_pool, 0);
644 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "conflict with system solvable, disabling rule #%d\n", ri);
645 if (ri >= solv->jobrules && ri < solv->jobrules_end)
646 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
649 queue_push(&solv->problems, v);
650 queue_push(&solv->problems, 0);
651 disableproblem(solv, v);
655 assert(solv->decisionq_why.elements[i]);
658 * conflict with an rpm rule ?
661 if (solv->decisionq_why.elements[i] < solv->rpmrules_end)
663 /* conflict with rpm rule assertion */
664 queue_push(&solv->problems, solv->learnt_pool.count);
665 queue_push(&solv->learnt_pool, ri);
666 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
667 queue_push(&solv->learnt_pool, 0);
668 assert(v > 0 || v == -SYSTEMSOLVABLE);
669 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "conflict with rpm rule, disabling rule #%d\n", ri);
670 if (ri >= solv->jobrules && ri < solv->jobrules_end)
671 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
674 queue_push(&solv->problems, v);
675 queue_push(&solv->problems, 0);
676 disableproblem(solv, v);
681 * conflict with another job or update/feature rule
685 queue_push(&solv->problems, solv->learnt_pool.count);
686 queue_push(&solv->learnt_pool, ri);
687 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
688 queue_push(&solv->learnt_pool, 0);
690 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "conflicting update/job assertions over literal %d\n", vv);
693 * push all of our rules (can only be feature or job rules)
694 * asserting this literal on the problem stack
697 for (i = solv->featurerules, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
699 if (rr->d < 0 /* disabled */
700 || rr->w2) /* or no assertion */
702 if (rr->p != vv /* not affecting the literal */
705 if (MAPTST(&solv->weakrulemap, i)) /* weak: silently ignore */
708 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, " - disabling rule #%d\n", i);
710 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, solv->rules + i);
713 /* is is a job rule ? */
714 if (i >= solv->jobrules && i < solv->jobrules_end)
715 v = -(solv->ruletojob.elements[i - solv->jobrules] + 1);
717 queue_push(&solv->problems, v);
718 disableproblem(solv, v);
720 queue_push(&solv->problems, 0);
724 * (back up from decisions)
726 while (solv->decisionq.count > decisionstart)
728 v = solv->decisionq.elements[--solv->decisionq.count];
729 --solv->decisionq_why.count;
731 solv->decisionmap[vv] = 0;
733 ii = -1; /* restarts loop at 0 */
737 * phase 2: now do the weak assertions
739 for (ii = 0; ii < solv->ruleassertions.count; ii++)
741 ri = solv->ruleassertions.elements[ii];
742 r = solv->rules + ri;
743 if (r->d < 0 || r->w2) /* disabled or no assertion */
745 if (!MAPTST(&solv->weakrulemap, ri)) /* skip non-weak */
751 * (if not yet decided)
753 if (!solv->decisionmap[vv])
755 queue_push(&solv->decisionq, v);
756 queue_push(&solv->decisionq_why, r - solv->rules);
757 solv->decisionmap[vv] = v > 0 ? 1 : -1;
758 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
760 Solvable *s = solv->pool->solvables + vv;
762 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", solvable2str(solv->pool, s));
764 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "installing %s (weak assertion)\n", solvable2str(solv->pool, s));
769 * previously decided, sane ?
771 if (v > 0 && solv->decisionmap[vv] > 0)
773 if (v < 0 && solv->decisionmap[vv] < 0)
776 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "assertion conflict, but I am weak, disabling ");
777 solver_printrule(solv, SAT_DEBUG_UNSOLVABLE, r);
778 disablerule(solv, r);
781 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- makeruledecisions end; size decisionq: %d -----\n",solv->decisionq.count);
785 /*-------------------------------------------------------------------
786 * enable/disable learnt rules
788 * we have enabled or disabled some of our rules. We now reenable all
789 * of our learnt rules but the ones that were learnt from rules that
793 enabledisablelearntrules(Solver *solv)
795 Pool *pool = solv->pool;
800 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "enabledisablelearntrules called\n");
801 for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
803 whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules];
804 while ((why = *whyp++) != 0)
806 assert(why > 0 && why < i);
807 if (solv->rules[why].d < 0)
810 /* why != 0: we found a disabled rule, disable the learnt rule */
811 if (why && r->d >= 0)
813 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
815 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "disabling ");
816 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
818 disablerule(solv, r);
820 else if (!why && r->d < 0)
822 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
824 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "re-enabling ");
825 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
833 /*-------------------------------------------------------------------
836 * Enable all rules, except learnt rules, which are
837 * - disabled and weak (set in weakrulemap)
842 enableweakrules(Solver *solv)
847 for (i = 1, r = solv->rules + i; i < solv->learntrules; i++, r++)
849 if (r->d >= 0) /* skip non-direct literals */
851 if (!MAPTST(&solv->weakrulemap, i))
858 /* FIXME: bad code ahead, replace as soon as possible */
859 /* FIXME: should probably look at SOLVER_INSTALL_SOLVABLE_ONE_OF */
861 /*-------------------------------------------------------------------
862 * disable update rules
866 disableupdaterules(Solver *solv, Queue *job, int jobidx)
868 Pool *pool = solv->pool;
870 Id how, what, p, *pp;
876 installed = solv->installed;
882 how = job->elements[jobidx] & ~SOLVER_WEAK;
885 case SOLVER_INSTALL_SOLVABLE:
886 case SOLVER_ERASE_SOLVABLE:
887 case SOLVER_ERASE_SOLVABLE_NAME:
888 case SOLVER_ERASE_SOLVABLE_PROVIDES:
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] & ~SOLVER_WEAK;
906 what = job->elements[j + 1];
909 case SOLVER_INSTALL_SOLVABLE: /* install specific solvable */
910 s = pool->solvables + what;
911 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, what))
916 obsp = s->repo->idarraydata + s->obsoletes;
917 while ((obs = *obsp++) != 0)
918 FOR_PROVIDES(p, pp, obs)
920 if (pool->solvables[p].repo != installed)
922 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
924 MAPSET(&solv->noupdate, p - installed->start);
927 FOR_PROVIDES(p, pp, s->name)
929 if (!solv->implicitobsoleteusesprovides && pool->solvables[p].name != s->name)
931 if (pool->solvables[p].repo == installed)
932 MAPSET(&solv->noupdate, p - installed->start);
935 case SOLVER_ERASE_SOLVABLE:
936 s = pool->solvables + what;
937 if (s->repo == installed)
938 MAPSET(&solv->noupdate, what - installed->start);
940 case SOLVER_ERASE_SOLVABLE_NAME: /* remove by capability */
941 case SOLVER_ERASE_SOLVABLE_PROVIDES:
942 FOR_PROVIDES(p, pp, what)
944 if (how == SOLVER_ERASE_SOLVABLE_NAME && !pool_match_nevr(pool, pool->solvables + p, what))
946 if (pool->solvables[p].repo == installed)
947 MAPSET(&solv->noupdate, p - installed->start);
955 /* fixup update rule status */
958 /* we just disabled job #jobidx. enable all update rules
959 * that aren't disabled by the remaining job rules */
960 how = job->elements[jobidx] & ~SOLVER_WEAK;
961 what = job->elements[jobidx + 1];
964 case SOLVER_INSTALL_SOLVABLE:
965 s = pool->solvables + what;
969 obsp = s->repo->idarraydata + s->obsoletes;
970 while ((obs = *obsp++) != 0)
971 FOR_PROVIDES(p, pp, obs)
973 if (pool->solvables[p].repo != installed)
975 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
977 if (MAPTST(&solv->noupdate, p - installed->start))
979 r = solv->rules + solv->updaterules + (p - installed->start);
983 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
985 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
986 solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
990 FOR_PROVIDES(p, pp, s->name)
992 if (!solv->implicitobsoleteusesprovides && pool->solvables[p].name != s->name)
994 if (pool->solvables[p].repo != installed)
996 if (MAPTST(&solv->noupdate, p - installed->start))
998 r = solv->rules + solv->updaterules + (p - installed->start);
1001 enablerule(solv, r);
1002 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
1004 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1005 solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
1009 case SOLVER_ERASE_SOLVABLE:
1010 s = pool->solvables + what;
1011 if (s->repo != installed)
1013 if (MAPTST(&solv->noupdate, what - installed->start))
1015 r = solv->rules + solv->updaterules + (what - installed->start);
1018 enablerule(solv, r);
1019 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
1021 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1022 solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
1025 case SOLVER_ERASE_SOLVABLE_NAME: /* remove by capability */
1026 case SOLVER_ERASE_SOLVABLE_PROVIDES:
1027 FOR_PROVIDES(p, pp, what)
1029 if (how == SOLVER_ERASE_SOLVABLE_NAME && !pool_match_nevr(pool, pool->solvables + p, what))
1031 if (pool->solvables[p].repo != installed)
1033 if (MAPTST(&solv->noupdate, p - installed->start))
1035 r = solv->rules + solv->updaterules + (p - installed->start);
1038 enablerule(solv, r);
1039 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
1041 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1042 solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
1052 for (i = 0; i < installed->nsolvables; i++)
1054 r = solv->rules + solv->updaterules + i;
1055 if (r->d >= 0 && MAPTST(&solv->noupdate, i))
1056 disablerule(solv, r); /* was enabled, need to disable */
1057 r = solv->rules + solv->featurerules + i;
1058 if (r->d >= 0 && MAPTST(&solv->noupdate, i))
1059 disablerule(solv, r); /* was enabled, need to disable */
1065 /*-------------------------------------------------------------------
1067 * add (install) rules for solvable
1069 * s: Solvable for which to add rules
1070 * m: m[s] = 1 for solvables which have rules, prevent rule duplication
1072 * Algorithm: 'visit all nodes of a graph'. The graph nodes are
1073 * solvables, the edges their dependencies.
1074 * Starting from an installed solvable, this will create all rules
1075 * representing the graph created by the solvables dependencies.
1077 * for unfulfilled requirements, conflicts, obsoletes,....
1078 * add a negative assertion for solvables that are not installable
1080 * It will also create rules for all solvables referenced by 's'
1081 * i.e. descend to all providers of requirements of 's'
1086 addrpmrulesforsolvable(Solver *solv, Solvable *s, Map *m)
1088 Pool *pool = solv->pool;
1089 Repo *installed = solv->installed;
1091 /* 'work' queue. keeps Ids of solvables we still have to work on.
1092 And buffer for it. */
1097 /* if to add rules for broken deps ('rpm -V' functionality)
1104 /* Id var and pointer for each dependency
1105 * (not used in parallel)
1112 /* var and ptr for loops */
1114 /* ptr to 'whatprovides' */
1116 /* Id for current solvable 's' */
1119 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforsolvable -----\n");
1121 queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
1122 queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */
1124 /* loop until there's no more work left */
1129 * s: Pointer to solvable
1132 n = queue_shift(&workq); /* 'pop' next solvable to work on from queue */
1133 if (MAPTST(m, n)) /* continue if already visited */
1136 MAPSET(m, n); /* mark as visited */
1137 s = pool->solvables + n; /* s = Solvable in question */
1140 if (installed /* Installed system available */
1141 && !solv->fixsystem /* NOT repair errors in rpm dependency graph */
1142 && s->repo == installed) /* solvable is installed? */
1144 dontfix = 1; /* dont care about broken rpm deps */
1148 && s->arch != ARCH_SRC
1149 && s->arch != ARCH_NOSRC
1150 && !pool_installable(pool, s))
1152 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", solvable2str(pool, s), (Id)(s - pool->solvables));
1153 addrule(solv, -n, 0); /* uninstallable */
1156 /*-----------------------------------------
1157 * check requires of s
1162 reqp = s->repo->idarraydata + s->requires;
1163 while ((req = *reqp++) != 0) /* go through all requires */
1165 if (req == SOLVABLE_PREREQMARKER) /* skip the marker */
1168 /* find list of solvables providing 'req' */
1169 dp = pool_whatprovides(pool, req);
1171 if (*dp == SYSTEMSOLVABLE) /* always installed */
1177 addpatchatomrequires(solv, s, dp, &workq, m);
1183 /* the strategy here is to not insist on dependencies
1184 * that are already broken. so if we find one provider
1185 * that was already installed, we know that the
1186 * dependency was not broken before so we enforce it */
1188 /* check if any of the providers for 'req' is installed */
1189 for (i = 0; (p = dp[i]) != 0; i++)
1191 if (pool->solvables[p].repo == installed)
1192 break; /* provider was installed */
1194 /* didn't find an installed provider: previously broken dependency */
1197 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", dep2str(pool, req), solvable2str(pool, s));
1204 /* nothing provides req! */
1205 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", solvable2str(pool, s), (Id)(s - pool->solvables), dep2str(pool, req));
1206 addrule(solv, -n, 0); /* mark requestor as uninstallable */
1210 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
1212 POOL_DEBUG(SAT_DEBUG_RULE_CREATION," %s requires %s\n", solvable2str(pool, s), dep2str(pool, req));
1213 for (i = 0; dp[i]; i++)
1214 POOL_DEBUG(SAT_DEBUG_RULE_CREATION, " provided by %s\n", solvable2str(pool, pool->solvables + dp[i]));
1217 /* add 'requires' dependency */
1218 /* rule: (-requestor|provider1|provider2|...|providerN) */
1219 addrule(solv, -n, dp - pool->whatprovidesdata);
1221 /* descend the dependency tree
1222 push all non-visited providers on the work queue */
1225 if (!MAPTST(m, *dp))
1226 queue_push(&workq, *dp);
1229 } /* while, requirements of n */
1231 } /* if, requirements */
1233 /* that's all we check for src packages */
1234 if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
1237 /*-----------------------------------------
1238 * check conflicts of s
1243 conp = s->repo->idarraydata + s->conflicts;
1244 /* foreach conflicts of 's' */
1245 while ((con = *conp++) != 0)
1247 /* foreach providers of a conflict of 's' */
1248 FOR_PROVIDES(p, pp, con)
1250 /* dontfix: dont care about conflicts with already installed packs */
1251 if (dontfix && pool->solvables[p].repo == installed)
1253 /* p == n: self conflict */
1254 if (p == n && !solv->allowselfconflicts)
1255 p = 0; /* make it a negative assertion, aka 'uninstallable' */
1256 /* rule: -n|-p: either solvable _or_ provider of conflict */
1257 addrule(solv, -n, -p);
1262 /*-----------------------------------------
1263 * check obsoletes if not installed
1264 * (only installation will trigger the obsoletes in rpm)
1266 if (!installed || pool->solvables[n].repo != installed)
1267 { /* not installed */
1268 int noobs = solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n);
1269 if (s->obsoletes && !noobs)
1271 obsp = s->repo->idarraydata + s->obsoletes;
1272 /* foreach obsoletes */
1273 while ((obs = *obsp++) != 0)
1275 /* foreach provider of an obsoletes of 's' */
1276 FOR_PROVIDES(p, pp, obs)
1278 if (!solv->obsoleteusesprovides /* obsoletes are matched names, not provides */
1279 && !pool_match_nevr(pool, pool->solvables + p, obs))
1281 addrule(solv, -n, -p);
1285 FOR_PROVIDES(p, pp, s->name)
1287 Solvable *ps = pool->solvables + p;
1288 /* we still obsolete packages with same nevra, like rpm does */
1289 /* (actually, rpm mixes those packages. yuck...) */
1290 if (noobs && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
1292 if (!solv->implicitobsoleteusesprovides && s->name != ps->name)
1294 addrule(solv, -n, -p);
1298 /*-----------------------------------------
1299 * add recommends to the work queue
1303 recp = s->repo->idarraydata + s->recommends;
1304 while ((rec = *recp++) != 0)
1306 FOR_PROVIDES(p, pp, rec)
1308 queue_push(&workq, p);
1313 sugp = s->repo->idarraydata + s->suggests;
1314 while ((sug = *sugp++) != 0)
1316 FOR_PROVIDES(p, pp, sug)
1318 queue_push(&workq, p);
1323 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforsolvable end -----\n");
1327 /*-------------------------------------------------------------------
1329 * Add package rules for weak rules
1331 * m: visited solvables
1335 addrpmrulesforweak(Solver *solv, Map *m)
1337 Pool *pool = solv->pool;
1342 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforweak -----\n");
1343 /* foreach solvable in pool */
1344 for (i = n = 1; n < pool->nsolvables; i++, n++)
1346 if (i == pool->nsolvables) /* wrap i */
1348 if (MAPTST(m, i)) /* been there */
1351 s = pool->solvables + i;
1352 if (!pool_installable(pool, s)) /* only look at installable ones */
1358 /* find possible supplements */
1359 supp = s->repo->idarraydata + s->supplements;
1360 while ((sup = *supp++) != ID_NULL)
1361 if (dep_possible(solv, sup, m))
1365 /* if nothing found, check for enhances */
1366 if (!sup && s->enhances)
1368 supp = s->repo->idarraydata + s->enhances;
1369 while ((sup = *supp++) != ID_NULL)
1370 if (dep_possible(solv, sup, m))
1373 /* if nothing found, goto next solvables */
1376 addrpmrulesforsolvable(solv, s, m);
1379 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforweak end -----\n");
1383 /*-------------------------------------------------------------------
1385 * add package rules for possible updates
1388 * m: map of already visited solvables
1389 * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
1393 addrpmrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
1395 Pool *pool = solv->pool;
1397 /* queue and buffer for it */
1401 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforupdaters -----\n");
1403 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1404 /* find update candidates for 's' */
1405 policy_findupdatepackages(solv, s, &qs, allow_all);
1406 /* add rule for 's' if not already done */
1407 if (!MAPTST(m, s - pool->solvables))
1408 addrpmrulesforsolvable(solv, s, m);
1409 /* foreach update candidate, add rule if not already done */
1410 for (i = 0; i < qs.count; i++)
1411 if (!MAPTST(m, qs.elements[i]))
1412 addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
1415 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addrpmrulesforupdaters -----\n");
1419 /*-------------------------------------------------------------------
1421 * add rule for update
1422 * (A|A1|A2|A3...) An = update candidates for A
1424 * s = (installed) solvable
1428 addupdaterule(Solver *solv, Solvable *s, int allow_all)
1430 /* installed packages get a special upgrade allowed rule */
1431 Pool *pool = solv->pool;
1436 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addupdaterule -----\n");
1438 queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
1439 /* find update candidates for 's' */
1440 policy_findupdatepackages(solv, s, &qs, allow_all);
1441 if (qs.count == 0) /* no updaters found */
1442 d = 0; /* assertion (keep installed) */
1444 d = pool_queuetowhatprovides(pool, &qs); /* intern computed queue */
1446 addrule(solv, s - pool->solvables, d); /* allow update of s */
1447 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- addupdaterule end -----\n");
1451 /********************************************************************/
1455 /*-------------------------------------------------------------------
1458 * initial setup for all watches
1462 makewatches(Solver *solv)
1466 int nsolvables = solv->pool->nsolvables;
1468 sat_free(solv->watches);
1469 /* lower half for removals, upper half for installs */
1470 solv->watches = sat_calloc(2 * nsolvables, sizeof(Id));
1472 /* do it reverse so rpm rules get triggered first (XXX: obsolete?) */
1473 for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
1475 for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
1478 if (!r->w2) /* assertions do not need watches */
1481 /* see addwatches_rule(solv, r) */
1482 r->n1 = solv->watches[nsolvables + r->w1];
1483 solv->watches[nsolvables + r->w1] = r - solv->rules;
1485 r->n2 = solv->watches[nsolvables + r->w2];
1486 solv->watches[nsolvables + r->w2] = r - solv->rules;
1491 /*-------------------------------------------------------------------
1493 * add watches (for rule)
1494 * sets up watches for a single rule
1496 * see also makewatches()
1500 addwatches_rule(Solver *solv, Rule *r)
1502 int nsolvables = solv->pool->nsolvables;
1504 r->n1 = solv->watches[nsolvables + r->w1];
1505 solv->watches[nsolvables + r->w1] = r - solv->rules;
1507 r->n2 = solv->watches[nsolvables + r->w2];
1508 solv->watches[nsolvables + r->w2] = r - solv->rules;
1512 /********************************************************************/
1518 /* shortcuts to check if a literal (positive or negative) assignment
1519 * evaluates to 'true' or 'false'
1521 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
1522 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
1523 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
1525 /*-------------------------------------------------------------------
1529 * make decision and propagate to all rules
1531 * Evaluate each term affected by the decision (linked through watches)
1532 * If we find unit rules we make new decisions based on them
1534 * Everything's fixed there, it's just finding rules that are
1537 * return : 0 = everything is OK
1538 * rule = conflict found in this rule
1542 propagate(Solver *solv, int level)
1544 Pool *pool = solv->pool;
1545 Id *rp, *next_rp; /* rule pointer, next rule pointer in linked list */
1547 Id p, pkg, other_watch;
1549 Id *decisionmap = solv->decisionmap;
1551 Id *watches = solv->watches + pool->nsolvables; /* place ptr in middle */
1553 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "----- propagate -----\n");
1555 /* foreach non-propagated decision */
1556 while (solv->propagate_index < solv->decisionq.count)
1559 * 'pkg' was just decided
1560 * negate because our watches trigger if literal goes FALSE
1562 pkg = -solv->decisionq.elements[solv->propagate_index++];
1564 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1566 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "propagate for decision %d level %d\n", -pkg, level);
1567 solver_printruleelement(solv, SAT_DEBUG_PROPAGATE, 0, -pkg);
1570 /* foreach rule where 'pkg' is now FALSE */
1571 for (rp = watches + pkg; *rp; rp = next_rp)
1573 r = solv->rules + *rp;
1576 /* rule is disabled, goto next */
1584 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1586 POOL_DEBUG(SAT_DEBUG_PROPAGATE," watch triggered ");
1587 solver_printrule(solv, SAT_DEBUG_PROPAGATE, r);
1590 /* 'pkg' was just decided (was set to FALSE)
1592 * now find other literal watch, check clause
1593 * and advance on linked list
1597 other_watch = r->w2;
1602 other_watch = r->w1;
1607 * This term is already true (through the other literal)
1608 * so we have nothing to do
1610 if (DECISIONMAP_TRUE(other_watch))
1614 * The other literal is FALSE or UNDEF
1620 /* Not a binary clause, try to move our watch.
1622 * Go over all literals and find one that is
1626 * (TRUE is also ok, in that case the rule is fulfilled)
1628 if (r->p /* we have a 'p' */
1629 && r->p != other_watch /* which is not watched */
1630 && !DECISIONMAP_FALSE(r->p)) /* and not FALSE */
1634 else /* go find a 'd' to make 'true' */
1637 we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
1639 for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
1641 if (p != other_watch /* which is not watched */
1642 && !DECISIONMAP_FALSE(p)) /* and not FALSE */
1650 * if we found some p that is UNDEF or TRUE, move
1653 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1656 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), solvable2str(pool, pool->solvables + p));
1658 POOL_DEBUG(SAT_DEBUG_PROPAGATE," -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), solvable2str(pool, pool->solvables - p));
1674 watches[p] = r - solv->rules;
1677 /* search failed, thus all unwatched literals are FALSE */
1682 * unit clause found, set literal other_watch to TRUE
1685 if (DECISIONMAP_FALSE(other_watch)) /* check if literal is FALSE */
1686 return r; /* eek, a conflict! */
1688 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1690 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " unit ");
1691 solver_printrule(solv, SAT_DEBUG_PROPAGATE, r);
1694 if (other_watch > 0)
1695 decisionmap[other_watch] = level; /* install! */
1697 decisionmap[-other_watch] = -level; /* remove! */
1699 queue_push(&solv->decisionq, other_watch);
1700 queue_push(&solv->decisionq_why, r - solv->rules);
1702 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1704 Solvable *s = pool->solvables + (other_watch > 0 ? other_watch : -other_watch);
1705 if (other_watch > 0)
1706 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> decided to install %s\n", solvable2str(pool, s));
1708 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> decided to conflict %s\n", solvable2str(pool, s));
1711 } /* foreach rule involving 'pkg' */
1713 } /* while we have non-decided decisions */
1715 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "----- propagate end-----\n");
1717 return 0; /* all is well */
1721 /********************************************************************/
1724 /*-------------------------------------------------------------------
1731 analyze(Solver *solv, int level, Rule *c, int *pr, int *dr, int *whyp)
1733 Pool *pool = solv->pool;
1736 Map seen; /* global? */
1737 Id d, v, vv, *dp, why;
1739 int num = 0, l1num = 0;
1740 int learnt_why = solv->learnt_pool.count;
1741 Id *decisionmap = solv->decisionmap;
1745 POOL_DEBUG(SAT_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
1746 map_init(&seen, pool->nsolvables);
1747 idx = solv->decisionq.count;
1750 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
1751 solver_printruleclass(solv, SAT_DEBUG_ANALYZE, c);
1752 queue_push(&solv->learnt_pool, c - solv->rules);
1753 d = c->d < 0 ? -c->d - 1 : c->d;
1754 dp = d ? pool->whatprovidesdata + d : 0;
1755 /* go through all literals of the rule */
1767 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1769 vv = v > 0 ? v : -v;
1770 if (MAPTST(&seen, vv))
1772 l = solv->decisionmap[vv];
1777 l1num++; /* need to do this one in level1 pass */
1778 else if (l == level)
1779 num++; /* need to do this one as well */
1782 queue_push(&r, v); /* not level1 or conflict level, add to new rule */
1788 if (!num && !--l1num)
1789 break; /* all level 1 literals done */
1793 v = solv->decisionq.elements[--idx];
1794 vv = v > 0 ? v : -v;
1795 if (MAPTST(&seen, vv))
1799 if (num && --num == 0)
1801 *pr = -v; /* so that v doesn't get lost */
1804 POOL_DEBUG(SAT_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
1805 for (i = 0; i < r.count; i++)
1808 MAPCLR(&seen, v > 0 ? v : -v);
1810 /* only level 1 marks left */
1814 why = solv->decisionq_why.elements[idx];
1815 if (!why) /* just in case, maye for SYSTEMSOLVABLE */
1817 c = solv->rules + why;
1823 else if (r.count == 1 && r.elements[0] < 0)
1824 *dr = r.elements[0];
1826 *dr = pool_queuetowhatprovides(pool, &r);
1827 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
1829 POOL_DEBUG(SAT_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
1830 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, *pr);
1831 for (i = 0; i < r.count; i++)
1832 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, r.elements[i]);
1834 /* push end marker on learnt reasons stack */
1835 queue_push(&solv->learnt_pool, 0);
1838 solv->stats_learned++;
1843 /*-------------------------------------------------------------------
1847 * reset the solver decisions to right after the rpm rules.
1848 * called after rules have been enabled/disabled
1852 reset_solver(Solver *solv)
1854 Pool *pool = solv->pool;
1858 /* rewind decisions to direct rpm rule assertions */
1859 for (i = solv->decisionq.count - 1; i >= solv->directdecisions; i--)
1861 v = solv->decisionq.elements[i];
1862 solv->decisionmap[v > 0 ? v : -v] = 0;
1865 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "decisions done reduced from %d to %d\n", solv->decisionq.count, solv->directdecisions);
1867 solv->decisionq_why.count = solv->directdecisions;
1868 solv->decisionq.count = solv->directdecisions;
1869 solv->recommends_index = -1;
1870 solv->propagate_index = 0;
1872 /* adapt learnt rule status to new set of enabled/disabled rules */
1873 enabledisablelearntrules(solv);
1875 /* redo all job/update decisions */
1876 makeruledecisions(solv);
1877 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "decisions so far: %d\n", solv->decisionq.count);
1881 /*-------------------------------------------------------------------
1883 * analyze_unsolvable_rule
1887 analyze_unsolvable_rule(Solver *solv, Rule *r, Id *lastweakp)
1889 Pool *pool = solv->pool;
1891 Id why = r - solv->rules;
1893 IF_POOLDEBUG (SAT_DEBUG_UNSOLVABLE)
1894 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, r);
1895 if (solv->learntrules && why >= solv->learntrules)
1897 for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
1898 if (solv->learnt_pool.elements[i] > 0)
1899 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp);
1902 if (MAPTST(&solv->weakrulemap, why))
1903 if (!*lastweakp || why > *lastweakp)
1905 /* do not add rpm rules to problem */
1906 if (why < solv->rpmrules_end)
1908 /* turn rule into problem */
1909 if (why >= solv->jobrules && why < solv->jobrules_end)
1910 why = -(solv->ruletojob.elements[why - solv->jobrules] + 1);
1911 /* return if problem already countains our rule */
1912 if (solv->problems.count)
1914 for (i = solv->problems.count - 1; i >= 0; i--)
1915 if (solv->problems.elements[i] == 0) /* end of last problem reached? */
1917 else if (solv->problems.elements[i] == why)
1920 queue_push(&solv->problems, why);
1924 /*-------------------------------------------------------------------
1926 * analyze_unsolvable
1928 * return: 1 - disabled some rules, try again
1933 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
1935 Pool *pool = solv->pool;
1937 Map seen; /* global to speed things up? */
1938 Id d, v, vv, *dp, why;
1940 Id *decisionmap = solv->decisionmap;
1941 int oldproblemcount;
1942 int oldlearntpoolcount;
1945 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
1946 solv->stats_unsolvable++;
1947 oldproblemcount = solv->problems.count;
1948 oldlearntpoolcount = solv->learnt_pool.count;
1950 /* make room for proof index */
1951 /* must update it later, as analyze_unsolvable_rule would confuse
1952 * it with a rule index if we put the real value in already */
1953 queue_push(&solv->problems, 0);
1956 map_init(&seen, pool->nsolvables);
1957 queue_push(&solv->learnt_pool, r - solv->rules);
1959 analyze_unsolvable_rule(solv, r, &lastweak);
1960 d = r->d < 0 ? -r->d - 1 : r->d;
1961 dp = d ? pool->whatprovidesdata + d : 0;
1972 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1974 vv = v > 0 ? v : -v;
1975 l = solv->decisionmap[vv];
1980 idx = solv->decisionq.count;
1983 v = solv->decisionq.elements[--idx];
1984 vv = v > 0 ? v : -v;
1985 if (!MAPTST(&seen, vv))
1987 why = solv->decisionq_why.elements[idx];
1988 queue_push(&solv->learnt_pool, why);
1989 r = solv->rules + why;
1990 analyze_unsolvable_rule(solv, r, &lastweak);
1991 d = r->d < 0 ? -r->d - 1 : r->d;
1992 dp = d ? pool->whatprovidesdata + d : 0;
2003 if (DECISIONMAP_TRUE(v)) /* the one true literal */
2005 vv = v > 0 ? v : -v;
2006 l = solv->decisionmap[vv];
2013 queue_push(&solv->problems, 0); /* mark end of this problem */
2017 /* disable last weak rule */
2018 solv->problems.count = oldproblemcount;
2019 solv->learnt_pool.count = oldlearntpoolcount;
2020 r = solv->rules + lastweak;
2021 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "disabling ");
2022 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, r);
2023 disablerule(solv, r);
2029 queue_push(&solv->learnt_pool, 0);
2030 solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
2034 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
2035 disableproblem(solv, solv->problems.elements[i]);
2036 /* XXX: might want to enable all weak rules again */
2040 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
2045 /********************************************************************/
2046 /* Decision revert */
2048 /*-------------------------------------------------------------------
2051 * revert decision at level
2055 revert(Solver *solv, int level)
2057 Pool *pool = solv->pool;
2059 while (solv->decisionq.count)
2061 v = solv->decisionq.elements[solv->decisionq.count - 1];
2062 vv = v > 0 ? v : -v;
2063 if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
2065 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
2066 if (v > 0 && solv->recommendations.count && v == solv->recommendations.elements[solv->recommendations.count - 1])
2067 solv->recommendations.count--;
2068 solv->decisionmap[vv] = 0;
2069 solv->decisionq.count--;
2070 solv->decisionq_why.count--;
2071 solv->propagate_index = solv->decisionq.count;
2073 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
2075 solv->branches.count--;
2076 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
2077 solv->branches.count--;
2079 solv->recommends_index = -1;
2083 /*-------------------------------------------------------------------
2085 * watch2onhighest - put watch2 on literal with highest level
2089 watch2onhighest(Solver *solv, Rule *r)
2094 d = r->d < 0 ? -r->d - 1 : r->d;
2096 return; /* binary rule, both watches are set */
2097 dp = solv->pool->whatprovidesdata + d;
2098 while ((v = *dp++) != 0)
2100 l = solv->decisionmap[v < 0 ? -v : v];
2112 /*-------------------------------------------------------------------
2116 * add free decision (solvable to install) to decisionq
2117 * increase level and propagate decision
2118 * return if no conflict.
2120 * in conflict case, analyze conflict rule, add resulting
2121 * rule to learnt rule set, make decision from learnt
2122 * rule (always unit) and re-propagate.
2124 * returns the new solver level or 0 if unsolvable
2129 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules)
2131 Pool *pool = solv->pool;
2140 solv->decisionmap[decision] = level;
2142 solv->decisionmap[-decision] = -level;
2143 queue_push(&solv->decisionq, decision);
2144 queue_push(&solv->decisionq_why, 0);
2148 r = propagate(solv, level);
2152 return analyze_unsolvable(solv, r, disablerules);
2153 POOL_DEBUG(SAT_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
2154 l = analyze(solv, level, r, &p, &d, &why); /* learnt rule in p and d */
2155 assert(l > 0 && l < level);
2156 POOL_DEBUG(SAT_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, l);
2158 revert(solv, level);
2159 r = addrule(solv, p, d); /* p requires d */
2161 assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
2162 queue_push(&solv->learnt_why, why);
2165 /* at least 2 literals, needs watches */
2166 watch2onhighest(solv, r);
2167 addwatches_rule(solv, r);
2171 /* learnt rule is an assertion */
2172 queue_push(&solv->ruleassertions, r - solv->rules);
2174 solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
2175 queue_push(&solv->decisionq, p);
2176 queue_push(&solv->decisionq_why, r - solv->rules);
2177 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
2179 POOL_DEBUG(SAT_DEBUG_ANALYZE, "decision: ");
2180 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, p);
2181 POOL_DEBUG(SAT_DEBUG_ANALYZE, "new rule: ");
2182 solver_printrule(solv, SAT_DEBUG_ANALYZE, r);
2189 /*-------------------------------------------------------------------
2191 * select and install
2193 * install best package from the queue. We add an extra package, inst, if
2194 * provided. See comment in weak install section.
2196 * returns the new solver level or 0 if unsolvable
2201 selectandinstall(Solver *solv, int level, Queue *dq, Id inst, int disablerules)
2203 Pool *pool = solv->pool;
2207 if (dq->count > 1 || inst)
2208 policy_filter_unwanted(solv, dq, inst, POLICY_MODE_CHOOSE);
2213 /* choose the supplemented one */
2214 for (i = 0; i < dq->count; i++)
2215 if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
2219 for (i = 1; i < dq->count; i++)
2220 queue_push(&solv->branches, dq->elements[i]);
2221 queue_push(&solv->branches, -level);
2225 p = dq->elements[i];
2227 POOL_DEBUG(SAT_DEBUG_POLICY, "installing %s\n", solvable2str(pool, pool->solvables + p));
2229 return setpropagatelearn(solv, level, p, disablerules);
2233 /********************************************************************/
2234 /* Main solver interface */
2237 /*-------------------------------------------------------------------
2240 * create solver structure
2242 * pool: all available solvables
2243 * installed: installed Solvables
2246 * Upon solving, rules are created to flag the Solvables
2247 * of the 'installed' Repo as installed.
2251 solver_create(Pool *pool, Repo *installed)
2254 solv = (Solver *)sat_calloc(1, sizeof(Solver));
2256 solv->installed = installed;
2258 queue_init(&solv->ruletojob);
2259 queue_init(&solv->decisionq);
2260 queue_init(&solv->decisionq_why);
2261 queue_init(&solv->problems);
2262 queue_init(&solv->suggestions);
2263 queue_init(&solv->recommendations);
2264 queue_init(&solv->learnt_why);
2265 queue_init(&solv->learnt_pool);
2266 queue_init(&solv->branches);
2267 queue_init(&solv->covenantq);
2268 queue_init(&solv->weakruleq);
2269 queue_init(&solv->ruleassertions);
2271 map_init(&solv->recommendsmap, pool->nsolvables);
2272 map_init(&solv->suggestsmap, pool->nsolvables);
2273 map_init(&solv->noupdate, installed ? installed->end - installed->start : 0);
2274 solv->recommends_index = 0;
2276 solv->decisionmap = (Id *)sat_calloc(pool->nsolvables, sizeof(Id));
2278 solv->rules = sat_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
2279 memset(solv->rules, 0, sizeof(Rule));
2285 /*-------------------------------------------------------------------
2291 solver_free(Solver *solv)
2293 queue_free(&solv->ruletojob);
2294 queue_free(&solv->decisionq);
2295 queue_free(&solv->decisionq_why);
2296 queue_free(&solv->learnt_why);
2297 queue_free(&solv->learnt_pool);
2298 queue_free(&solv->problems);
2299 queue_free(&solv->suggestions);
2300 queue_free(&solv->recommendations);
2301 queue_free(&solv->branches);
2302 queue_free(&solv->covenantq);
2303 queue_free(&solv->weakruleq);
2304 queue_free(&solv->ruleassertions);
2306 map_free(&solv->recommendsmap);
2307 map_free(&solv->suggestsmap);
2308 map_free(&solv->noupdate);
2309 map_free(&solv->weakrulemap);
2310 map_free(&solv->noobsoletes);
2312 sat_free(solv->decisionmap);
2313 sat_free(solv->rules);
2314 sat_free(solv->watches);
2315 sat_free(solv->obsoletes);
2316 sat_free(solv->obsoletes_data);
2321 /*-------------------------------------------------------------------
2325 * all rules have been set up, now actually run the solver
2330 run_solver(Solver *solv, int disablerules, int doweak)
2332 Queue dq; /* local decisionqueue */
2333 Queue dqs; /* local decisionqueue for supplements */
2339 Pool *pool = solv->pool;
2342 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
2344 POOL_DEBUG (SAT_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
2345 for (i = 1; i < solv->nrules; i++)
2346 solver_printruleclass(solv, SAT_DEBUG_RULE_CREATION, solv->rules + i);
2349 POOL_DEBUG(SAT_DEBUG_STATS, "initial decisions: %d\n", solv->decisionq.count);
2351 IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
2352 solver_printdecisions(solv);
2354 /* start SAT algorithm */
2356 systemlevel = level + 1;
2357 POOL_DEBUG(SAT_DEBUG_STATS, "solving...\n");
2363 * here's the main loop:
2364 * 1) propagate new decisions (only needed for level 1)
2365 * 2) try to keep installed packages
2366 * 3) fulfill all unresolved rules
2367 * 4) install recommended packages
2368 * 5) minimalize solution if we had choices
2369 * if we encounter a problem, we rewind to a safe level and restart
2381 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "propagating (propagate_index: %d; size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
2382 if ((r = propagate(solv, level)) != 0)
2384 if (analyze_unsolvable(solv, r, disablerules))
2391 if (level < systemlevel)
2393 POOL_DEBUG(SAT_DEBUG_STATS, "resolving job rules\n");
2394 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
2397 if (r->d < 0) /* ignore disabled rules */
2400 FOR_RULELITERALS(l, dp, r)
2404 if (solv->decisionmap[-l] <= 0)
2409 if (solv->decisionmap[l] > 0)
2411 if (solv->decisionmap[l] == 0)
2417 if (!solv->updatesystem && solv->installed && dq.count > 1)
2420 for (j = k = 0; j < dq.count; j++)
2422 Solvable *s = pool->solvables + dq.elements[j];
2423 if (s->repo == solv->installed)
2424 dq.elements[k++] = dq.elements[j];
2430 level = selectandinstall(solv, level, &dq, 0, disablerules);
2436 if (level <= olevel)
2439 systemlevel = level + 1;
2440 if (i < solv->jobrules_end)
2446 * installed packages
2449 if (level < systemlevel && solv->installed && solv->installed->nsolvables)
2451 if (!solv->updatesystem)
2454 * Normal run (non-updating)
2455 * Keep as many packages installed as possible
2457 POOL_DEBUG(SAT_DEBUG_STATS, "installing old packages\n");
2459 for (i = solv->installed->start; i < solv->installed->end; i++)
2461 s = pool->solvables + i;
2463 /* skip if not installed */
2464 if (s->repo != solv->installed)
2467 /* skip if already decided */
2468 if (solv->decisionmap[i] != 0)
2471 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "keeping %s\n", solvable2str(pool, s));
2474 level = setpropagatelearn(solv, level, i, disablerules);
2476 if (level == 0) /* unsolvable */
2481 if (level <= olevel)
2484 if (i < solv->installed->end)
2488 POOL_DEBUG(SAT_DEBUG_STATS, "resolving update/feature rules\n");
2490 for (i = solv->installed->start, r = solv->rules + solv->updaterules; i < solv->installed->end; i++, r++)
2494 s = pool->solvables + i;
2496 /* skip if not installed (can't update) */
2497 if (s->repo != solv->installed)
2499 /* skip if already decided */
2500 if (solv->decisionmap[i] > 0)
2503 /* noupdate is set if a job is erasing the installed solvable or installing a specific version */
2504 if (MAPTST(&solv->noupdate, i - solv->installed->start))
2509 if (rr->d < 0) /* disabled -> look at feature rule ? */
2510 rr -= solv->installed->end - solv->installed->start;
2511 if (!rr->p) /* identical to update rule? */
2513 d = (rr->d < 0) ? -rr->d - 1 : rr->d;
2516 if (!rr->w2 || solv->decisionmap[rr->w2] > 0)
2518 /* decide w2 if yet undecided */
2519 if (solv->decisionmap[rr->w2] == 0)
2520 queue_push(&dq, rr->w2);
2524 dp = pool->whatprovidesdata + d;
2525 while ((p = *dp++) != 0)
2527 if (solv->decisionmap[p] > 0)
2529 /* decide p if yet undecided */
2530 if (solv->decisionmap[p] == 0)
2536 if (!dq.count && solv->decisionmap[i] != 0)
2539 /* FIXME: it is handled a bit different because we do not want
2540 * to have it pruned just because it is not recommened.
2541 * we should not prune installed packages instead
2543 level = selectandinstall(solv, level, &dq, (solv->decisionmap[i] ? 0 : i), disablerules);
2549 if (level <= olevel)
2552 systemlevel = level + 1;
2553 if (i < solv->installed->end)
2557 if (level < systemlevel)
2558 systemlevel = level;
2564 POOL_DEBUG(SAT_DEBUG_STATS, "deciding unresolved rules\n");
2565 for (i = 1, n = 1; ; i++, n++)
2567 if (n == solv->nrules)
2569 if (i == solv->nrules)
2571 r = solv->rules + i;
2572 if (r->d < 0) /* ignore disabled rules */
2577 /* binary or unary rule */
2578 /* need two positive undecided literals */
2579 if (r->p < 0 || r->w2 <= 0)
2581 if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
2583 queue_push(&dq, r->p);
2584 queue_push(&dq, r->w2);
2589 * all negative literals are installed
2590 * no positive literal is installed
2591 * i.e. the rule is not fulfilled and we
2592 * just need to decide on the positive literals
2596 if (solv->decisionmap[-r->p] <= 0)
2601 if (solv->decisionmap[r->p] > 0)
2603 if (solv->decisionmap[r->p] == 0)
2604 queue_push(&dq, r->p);
2606 dp = pool->whatprovidesdata + r->d;
2607 while ((p = *dp++) != 0)
2611 if (solv->decisionmap[-p] <= 0)
2616 if (solv->decisionmap[p] > 0)
2618 if (solv->decisionmap[p] == 0)
2625 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
2627 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "unfulfilled ");
2628 solver_printruleclass(solv, SAT_DEBUG_PROPAGATE, r);
2630 /* dq.count < 2 cannot happen as this means that
2631 * the rule is unit */
2632 assert(dq.count > 1);
2635 level = selectandinstall(solv, level, &dq, 0, disablerules);
2641 if (level < systemlevel)
2644 } /* for(), decide */
2646 if (n != solv->nrules) /* continue if level < systemlevel */
2653 POOL_DEBUG(SAT_DEBUG_STATS, "installing recommended packages\n");
2656 for (i = 1; i < pool->nsolvables; i++)
2658 if (solv->decisionmap[i] < 0)
2660 if (solv->decisionmap[i] > 0)
2662 /* installed, check for recommends */
2663 Id *recp, rec, *pp, p;
2664 s = pool->solvables + i;
2665 if (solv->ignorealreadyrecommended && s->repo == solv->installed)
2667 /* XXX need to special case AND ? */
2670 recp = s->repo->idarraydata + s->recommends;
2671 while ((rec = *recp++) != 0)
2674 FOR_PROVIDES(p, pp, rec)
2676 if (solv->decisionmap[p] > 0)
2681 else if (solv->decisionmap[p] == 0)
2683 queue_pushunique(&dq, p);
2691 s = pool->solvables + i;
2692 if (!s->supplements)
2694 if (!pool_installable(pool, s))
2696 if (!solver_is_supplementing(solv, s))
2698 if (solv->ignorealreadyrecommended && solv->installed)
2699 queue_pushunique(&dqs, i); /* needs filter */
2701 queue_pushunique(&dq, i);
2704 if (solv->ignorealreadyrecommended && dqs.count)
2706 /* turn off all new packages */
2707 for (i = 0; i < solv->decisionq.count; i++)
2709 p = solv->decisionq.elements[i];
2712 s = pool->solvables + p;
2713 if (s->repo && s->repo != solv->installed)
2714 solv->decisionmap[p] = -solv->decisionmap[p];
2716 /* filter out old supplements */
2717 for (i = 0; i < dqs.count; i++)
2719 p = dqs.elements[i];
2720 s = pool->solvables + p;
2721 if (!s->supplements)
2723 if (!solver_is_supplementing(solv, s))
2724 queue_pushunique(&dq, p);
2726 /* undo turning off */
2727 for (i = 0; i < solv->decisionq.count; i++)
2729 p = solv->decisionq.elements[i];
2732 s = pool->solvables + p;
2733 if (s->repo && s->repo != solv->installed)
2734 solv->decisionmap[p] = -solv->decisionmap[p];
2740 policy_filter_unwanted(solv, &dq, 0, POLICY_MODE_RECOMMEND);
2742 POOL_DEBUG(SAT_DEBUG_STATS, "installing recommended %s\n", solvable2str(pool, pool->solvables + p));
2743 queue_push(&solv->recommendations, p);
2744 level = setpropagatelearn(solv, level, p, 0);
2749 if (solv->solution_callback)
2751 solv->solution_callback(solv, solv->solution_callback_data);
2752 if (solv->branches.count)
2754 int i = solv->branches.count - 1;
2755 int l = -solv->branches.elements[i];
2757 if (solv->branches.elements[i - 1] < 0)
2759 p = solv->branches.elements[i];
2760 POOL_DEBUG(SAT_DEBUG_STATS, "branching with %s\n", solvable2str(pool, pool->solvables + p));
2762 for (j = i + 1; j < solv->branches.count; j++)
2763 queue_push(&dq, solv->branches.elements[j]);
2764 solv->branches.count = i;
2766 revert(solv, level);
2768 for (j = 0; j < dq.count; j++)
2769 queue_push(&solv->branches, dq.elements[j]);
2771 level = setpropagatelearn(solv, level, p, disablerules);
2779 /* all branches done, we're finally finished */
2783 /* minimization step */
2784 if (solv->branches.count)
2786 int l = 0, lasti = -1, lastl = -1;
2788 for (i = solv->branches.count - 1; i >= 0; i--)
2790 p = solv->branches.elements[i];
2793 else if (p > 0 && solv->decisionmap[p] > l + 1)
2801 /* kill old solvable so that we do not loop */
2802 p = solv->branches.elements[lasti];
2803 solv->branches.elements[lasti] = 0;
2804 POOL_DEBUG(SAT_DEBUG_STATS, "minimizing %d -> %d with %s\n", solv->decisionmap[p], l, solvable2str(pool, pool->solvables + p));
2807 revert(solv, level);
2809 level = setpropagatelearn(solv, level, p, disablerules);
2820 POOL_DEBUG(SAT_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable\n", solv->stats_learned, solv->stats_unsolvable);
2822 POOL_DEBUG(SAT_DEBUG_STATS, "done solving.\n\n");
2828 /*-------------------------------------------------------------------
2832 * at this point, all rules that led to conflicts are disabled.
2833 * we re-enable all rules of a problem set but rule "sug", then
2834 * continue to disable more rules until there as again a solution.
2837 /* FIXME: think about conflicting assertions */
2840 refine_suggestion(Solver *solv, Queue *job, Id *problem, Id sug, Queue *refined)
2842 Pool *pool = solv->pool;
2848 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
2850 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "refine_suggestion start\n");
2851 for (i = 0; problem[i]; i++)
2853 if (problem[i] == sug)
2854 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "=> ");
2855 solver_printproblem(solv, problem[i]);
2858 queue_init(&disabled);
2859 queue_empty(refined);
2860 queue_push(refined, sug);
2862 /* re-enable all problem rules with the exception of "sug"(gestion) */
2866 for (i = 0; problem[i]; i++)
2867 if (problem[i] != sug)
2868 enableproblem(solv, problem[i]);
2871 disableupdaterules(solv, job, -(sug + 1));
2872 else if (sug >= solv->updaterules && sug < solv->updaterules_end)
2874 /* enable feature rule */
2875 Rule *r = solv->rules + solv->featurerules + (sug - solv->updaterules);
2877 enablerule(solv, r);
2880 enableweakrules(solv);
2884 int njob, nfeature, nupdate;
2885 queue_empty(&solv->problems);
2886 revert(solv, 1); /* XXX no longer needed? */
2889 if (!solv->problems.count)
2890 run_solver(solv, 0, 0);
2892 if (!solv->problems.count)
2894 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "no more problems!\n");
2895 IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
2896 solver_printdecisions(solv);
2897 break; /* great, no more problems */
2899 disabledcnt = disabled.count;
2900 /* start with 1 to skip over proof index */
2901 njob = nfeature = nupdate = 0;
2902 for (i = 1; i < solv->problems.count - 1; i++)
2904 /* ignore solutions in refined */
2905 v = solv->problems.elements[i];
2907 break; /* end of problem reached */
2908 for (j = 0; problem[j]; j++)
2909 if (problem[j] != sug && problem[j] == v)
2913 if (v >= solv->featurerules && v < solv->featurerules_end)
2919 queue_push(&disabled, v);
2921 if (disabled.count == disabledcnt)
2923 /* no solution found, this was an invalid suggestion! */
2924 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "no solution found!\n");
2928 if (!njob && nupdate && nfeature)
2930 /* got only update rules, filter out feature rules */
2931 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "throwing away feature rules\n");
2932 for (i = j = disabledcnt; i < disabled.count; i++)
2934 v = disabled.elements[i];
2935 if (v < solv->featurerules || v >= solv->featurerules_end)
2936 disabled.elements[j++] = v;
2941 if (disabled.count == disabledcnt + 1)
2943 /* just one suggestion, add it to refined list */
2944 v = disabled.elements[disabledcnt];
2946 queue_push(refined, v); /* do not record feature rules */
2947 disableproblem(solv, v);
2948 if (v >= solv->updaterules && v < solv->updaterules_end)
2950 Rule *r = solv->rules + (v - solv->updaterules + solv->featurerules);
2952 enablerule(solv, r); /* enable corresponding feature rule */
2955 disableupdaterules(solv, job, -(v + 1));
2959 /* more than one solution, disable all */
2960 /* do not push anything on refine list, as we do not know which solution to choose */
2961 /* thus, the user will get another problem if he selects this solution, where he
2962 * can choose the right one */
2963 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
2965 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "more than one solution found:\n");
2966 for (i = disabledcnt; i < disabled.count; i++)
2967 solver_printproblem(solv, disabled.elements[i]);
2969 for (i = disabledcnt; i < disabled.count; i++)
2971 v = disabled.elements[i];
2972 disableproblem(solv, v);
2973 if (v >= solv->updaterules && v < solv->updaterules_end)
2975 Rule *r = solv->rules + (v - solv->updaterules + solv->featurerules);
2977 enablerule(solv, r);
2982 /* all done, get us back into the same state as before */
2983 /* enable refined rules again */
2984 for (i = 0; i < disabled.count; i++)
2985 enableproblem(solv, disabled.elements[i]);
2986 /* disable problem rules again */
2989 for (i = 0; problem[i]; i++)
2990 enableproblem(solv, problem[i]);
2991 disableupdaterules(solv, job, -1);
2993 /* disable problem rules again */
2994 for (i = 0; problem[i]; i++)
2995 disableproblem(solv, problem[i]);
2996 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "refine_suggestion end\n");
3000 /*-------------------------------------------------------------------
3001 * sorting helper for problems
3005 problems_sortcmp(const void *ap, const void *bp)
3007 Id a = *(Id *)ap, b = *(Id *)bp;
3016 /*-------------------------------------------------------------------
3021 problems_sort(Solver *solv)
3024 if (!solv->problems.count)
3026 for (i = j = 1; i < solv->problems.count; i++)
3028 if (!solv->problems.elements[i])
3031 qsort(solv->problems.elements + j, i - j, sizeof(Id), problems_sortcmp);
3032 if (++i == solv->problems.count)
3040 /*-------------------------------------------------------------------
3041 * convert problems to solutions
3045 problems_to_solutions(Solver *solv, Queue *job)
3047 Pool *pool = solv->pool;
3055 if (!solv->problems.count)
3057 problems_sort(solv);
3058 queue_clone(&problems, &solv->problems);
3059 queue_init(&solution);
3060 queue_init(&solutions);
3061 /* copy over proof index */
3062 queue_push(&solutions, problems.elements[0]);
3063 problem = problems.elements + 1;
3064 for (i = 1; i < problems.count; i++)
3066 Id v = problems.elements[i];
3069 /* mark end of this problem */
3070 queue_push(&solutions, 0);
3071 queue_push(&solutions, 0);
3072 if (i + 1 == problems.count)
3074 /* copy over proof of next problem */
3075 queue_push(&solutions, problems.elements[i + 1]);
3077 problem = problems.elements + i + 1;
3080 refine_suggestion(solv, job, problem, v, &solution);
3081 if (!solution.count)
3082 continue; /* this solution didn't work out */
3085 for (j = 0; j < solution.count; j++)
3087 why = solution.elements[j];
3088 /* must be either job descriptor or update rule */
3089 assert(why < 0 || (why >= solv->updaterules && why < solv->updaterules_end));
3091 solver_printproblem(solv, why);
3095 /* job descriptor */
3096 queue_push(&solutions, 0);
3097 queue_push(&solutions, -why);
3101 /* update rule, find replacement package */
3102 Id p, d, *dp, rp = 0;
3104 p = solv->installed->start + (why - solv->updaterules);
3105 if (solv->decisionmap[p] > 0)
3106 continue; /* false alarm, turned out we can keep the package */
3107 rr = solv->rules + solv->featurerules + (why - solv->updaterules);
3109 rr = solv->rules + why;
3112 d = rr->d < 0 ? -rr->d - 1 : rr->d;
3115 if (solv->decisionmap[rr->w2] > 0 && pool->solvables[rr->w2].repo != solv->installed)
3120 for (dp = pool->whatprovidesdata + d; *dp; dp++)
3122 if (solv->decisionmap[*dp] > 0 && pool->solvables[*dp].repo != solv->installed)
3130 queue_push(&solutions, p);
3131 queue_push(&solutions, rp);
3135 /* mark end of this solution */
3138 queue_push(&solutions, 0);
3139 queue_push(&solutions, 0);
3143 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "Oops, everything was fine?\n");
3146 queue_free(&solution);
3147 queue_free(&problems);
3148 /* copy queue over to solutions */
3149 queue_free(&solv->problems);
3150 queue_clone(&solv->problems, &solutions);
3152 /* bring solver back into problem state */
3153 revert(solv, 1); /* XXX move to reset_solver? */
3156 assert(solv->problems.count == solutions.count);
3157 queue_free(&solutions);
3161 /*-------------------------------------------------------------------
3165 * advance to next problem
3169 solver_next_problem(Solver *solv, Id problem)
3173 return solv->problems.count ? 1 : 0;
3174 pp = solv->problems.elements + problem;
3175 while (pp[0] || pp[1])
3179 while (pp[0] || pp[1])
3184 problem = pp - solv->problems.elements;
3185 if (problem >= solv->problems.count)
3191 /*-------------------------------------------------------------------
3197 solver_next_solution(Solver *solv, Id problem, Id solution)
3203 pp = solv->problems.elements + solution;
3204 return pp[0] || pp[1] ? solution : 0;
3206 pp = solv->problems.elements + solution;
3207 while (pp[0] || pp[1])
3210 solution = pp - solv->problems.elements;
3211 return pp[0] || pp[1] ? solution : 0;
3215 /*-------------------------------------------------------------------
3217 * solution element iterator
3221 solver_next_solutionelement(Solver *solv, Id problem, Id solution, Id element, Id *p, Id *rp)
3224 element = element ? element + 2 : solution;
3225 pp = solv->problems.elements + element;
3226 if (!(pp[0] || pp[1]))
3234 /*-------------------------------------------------------------------
3236 * Retrieve information about a problematic rule
3238 * this is basically the reverse of addrpmrulesforsolvable
3242 solver_problemruleinfo(Solver *solv, Queue *job, Id rid, Id *depp, Id *sourcep, Id *targetp)
3244 Pool *pool = solv->pool;
3245 Repo *installed = solv->installed;
3249 Id p, d, *pp, req, *reqp, con, *conp, obs, *obsp, *dp;
3252 if (rid >= solv->jobrules && rid < solv->jobrules_end)
3255 r = solv->rules + rid;
3256 p = solv->ruletojob.elements[rid - solv->jobrules];
3257 *depp = job->elements[p + 1];
3259 *targetp = job->elements[p];
3260 d = r->d < 0 ? -r->d - 1 : r->d;
3261 if (d == 0 && r->w2 == 0 && r->p == -SYSTEMSOLVABLE && job->elements[p] != SOLVER_INSTALL_SOLVABLE_ONE_OF)
3262 return SOLVER_PROBLEM_JOB_NOTHING_PROVIDES_DEP;
3263 return SOLVER_PROBLEM_JOB_RULE;
3265 if (rid >= solv->updaterules && rid < solv->updaterules_end)
3268 *sourcep = solv->installed->start + (rid - solv->updaterules);
3270 return SOLVER_PROBLEM_UPDATE_RULE;
3272 assert(rid < solv->rpmrules_end);
3273 r = solv->rules + rid;
3275 d = r->d < 0 ? -r->d - 1 : r->d;
3276 if (d == 0 && r->w2 == 0)
3278 /* a rpm rule assertion */
3279 s = pool->solvables - r->p;
3280 if (installed && !solv->fixsystem && s->repo == installed)
3282 assert(!dontfix); /* dontfix packages never have a neg assertion */
3285 /* see why the package is not installable */
3286 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC && !pool_installable(pool, s))
3289 return SOLVER_PROBLEM_NOT_INSTALLABLE;
3291 /* check requires */
3294 reqp = s->repo->idarraydata + s->requires;
3295 while ((req = *reqp++) != 0)
3297 if (req == SOLVABLE_PREREQMARKER)
3299 dp = pool_whatprovides(pool, req);
3306 return SOLVER_PROBLEM_NOTHING_PROVIDES_DEP;
3309 if (!solv->allowselfconflicts && s->conflicts)
3311 conp = s->repo->idarraydata + s->conflicts;
3312 while ((con = *conp++) != 0)
3313 FOR_PROVIDES(p, pp, con)
3317 return SOLVER_PROBLEM_SELF_CONFLICT;
3320 /* should never happen */
3322 return SOLVER_PROBLEM_RPM_RULE;
3324 s = pool->solvables - r->p;
3325 if (installed && !solv->fixsystem && s->repo == installed)
3327 if (d == 0 && r->w2 < 0)
3329 /* a package conflict */
3330 Solvable *s2 = pool->solvables - r->w2;
3333 if (installed && !solv->fixsystem && s2->repo == installed)
3336 /* if both packages have the same name and at least one of them
3337 * is not installed, they conflict */
3338 if (s->name == s2->name && !(installed && s->repo == installed && s2->repo == installed))
3340 /* also check noobsoletes map */
3341 if ((s->evr == s2->evr && s->arch == s2->arch) || !solv->noobsoletes.size
3342 || ((!installed || s->repo != installed) && !MAPTST(&solv->noobsoletes, -r->p))
3343 || ((!installed || s2->repo != installed) && !MAPTST(&solv->noobsoletes, -r->w2)))
3348 return SOLVER_PROBLEM_SAME_NAME;
3352 /* check conflicts in both directions */
3355 conp = s->repo->idarraydata + s->conflicts;
3356 while ((con = *conp++) != 0)
3358 FOR_PROVIDES(p, pp, con)
3360 if (dontfix && pool->solvables[p].repo == installed)
3367 return SOLVER_PROBLEM_PACKAGE_CONFLICT;
3373 conp = s2->repo->idarraydata + s2->conflicts;
3374 while ((con = *conp++) != 0)
3376 FOR_PROVIDES(p, pp, con)
3378 if (dontfix2 && pool->solvables[p].repo == installed)
3385 return SOLVER_PROBLEM_PACKAGE_CONFLICT;
3389 /* check obsoletes in both directions */
3390 if ((!installed || s->repo != installed) && s->obsoletes && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -r->p)))
3392 obsp = s->repo->idarraydata + s->obsoletes;
3393 while ((obs = *obsp++) != 0)
3395 FOR_PROVIDES(p, pp, obs)
3399 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3404 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3408 if ((!installed || s2->repo != installed) && s2->obsoletes && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -r->w2)))
3410 obsp = s2->repo->idarraydata + s2->obsoletes;
3411 while ((obs = *obsp++) != 0)
3413 FOR_PROVIDES(p, pp, obs)
3417 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3422 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3426 if (solv->implicitobsoleteusesprovides && (!installed || s->repo != installed) && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -r->p)))
3428 FOR_PROVIDES(p, pp, s->name)
3435 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3438 if (solv->implicitobsoleteusesprovides && (!installed || s2->repo != installed) && !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, -r->w2)))
3440 FOR_PROVIDES(p, pp, s2->name)
3447 return SOLVER_PROBLEM_PACKAGE_OBSOLETES;
3450 /* all cases checked, can't happen */
3454 return SOLVER_PROBLEM_RPM_RULE;
3456 /* simple requires */
3459 reqp = s->repo->idarraydata + s->requires;
3460 while ((req = *reqp++) != 0)
3462 if (req == SOLVABLE_PREREQMARKER)
3464 dp = pool_whatprovides(pool, req);
3467 if (*dp == r->w2 && dp[1] == 0)
3470 else if (dp - pool->whatprovidesdata == d)
3478 return SOLVER_PROBLEM_DEP_PROVIDERS_NOT_INSTALLABLE;
3481 /* all cases checked, can't happen */
3485 return SOLVER_PROBLEM_RPM_RULE;
3489 /*-------------------------------------------------------------------
3495 findproblemrule_internal(Solver *solv, Id idx, Id *reqrp, Id *conrp, Id *sysrp, Id *jobrp)
3498 Id lreqr, lconr, lsysr, ljobr;
3502 lreqr = lconr = lsysr = ljobr = 0;
3503 while ((rid = solv->learnt_pool.elements[idx++]) != 0)
3506 if (rid >= solv->learntrules)
3507 findproblemrule_internal(solv, solv->learnt_why.elements[rid - solv->learntrules], &lreqr, &lconr, &lsysr, &ljobr);
3508 else if (rid >= solv->jobrules && rid < solv->jobrules_end)
3513 else if (rid >= solv->updaterules && rid < solv->updaterules_end)
3520 assert(rid < solv->rpmrules_end);
3521 r = solv->rules + rid;
3522 d = r->d < 0 ? -r->d - 1 : r->d;
3523 if (!d && r->w2 < 0)
3530 if (!d && r->w2 == 0 && !reqassert)
3532 /* prefer assertions (XXX: bad idea?) */
3538 else if (solv->installed && r->p < 0 && solv->pool->solvables[-r->p].repo == solv->installed)
3540 /* prefer rules of installed packages */
3541 Id op = *reqrp >= 0 ? solv->rules[*reqrp].p : -*reqrp;
3542 if (op <= 0 || solv->pool->solvables[op].repo != solv->installed)
3548 if (!*reqrp && lreqr)
3550 if (!*conrp && lconr)
3552 if (!*jobrp && ljobr)
3554 if (!*sysrp && lsysr)
3559 /*-------------------------------------------------------------------
3563 * search for a rule that describes the problem to the
3564 * user. A pretty hopeless task, actually. We currently
3565 * prefer simple requires.
3569 solver_findproblemrule(Solver *solv, Id problem)
3571 Id reqr, conr, sysr, jobr;
3572 Id idx = solv->problems.elements[problem - 1];
3573 reqr = conr = sysr = jobr = 0;
3574 findproblemrule_internal(solv, idx, &reqr, &conr, &sysr, &jobr);
3587 /*-------------------------------------------------------------------
3589 * create reverse obsoletes map for installed solvables
3591 * for each installed solvable find which packages with *different* names
3592 * obsolete the solvable.
3593 * this index is used in policy_findupdatepackages if noupdateprovide is set.
3597 create_obsolete_index(Solver *solv)
3599 Pool *pool = solv->pool;
3601 Repo *installed = solv->installed;
3602 Id p, *pp, obs, *obsp, *obsoletes, *obsoletes_data;
3605 if (!installed || !installed->nsolvables)
3607 solv->obsoletes = obsoletes = sat_calloc(installed->end - installed->start, sizeof(Id));
3608 for (i = 1; i < pool->nsolvables; i++)
3610 s = pool->solvables + i;
3613 if (!pool_installable(pool, s))
3615 obsp = s->repo->idarraydata + s->obsoletes;
3616 while ((obs = *obsp++) != 0)
3618 FOR_PROVIDES(p, pp, obs)
3620 if (pool->solvables[p].repo != installed)
3622 if (pool->solvables[p].name == s->name)
3624 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3626 obsoletes[p - installed->start]++;
3631 for (i = 0; i < installed->nsolvables; i++)
3634 n += obsoletes[i] + 1;
3637 solv->obsoletes_data = obsoletes_data = sat_calloc(n + 1, sizeof(Id));
3638 POOL_DEBUG(SAT_DEBUG_STATS, "obsoletes data: %d entries\n", n + 1);
3639 for (i = pool->nsolvables - 1; i > 0; i--)
3641 s = pool->solvables + i;
3644 if (!pool_installable(pool, s))
3646 obsp = s->repo->idarraydata + s->obsoletes;
3647 while ((obs = *obsp++) != 0)
3649 FOR_PROVIDES(p, pp, obs)
3651 if (pool->solvables[p].repo != installed)
3653 if (pool->solvables[p].name == s->name)
3655 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
3657 p -= installed->start;
3658 if (obsoletes_data[obsoletes[p]] != i)
3659 obsoletes_data[--obsoletes[p]] = i;
3666 /*-------------------------------------------------------------------
3668 * remove disabled conflicts
3672 removedisabledconflicts(Solver *solv, Queue *removed)
3674 Pool *pool = solv->pool;
3679 Id *decisionmap = solv->decisionmap;
3681 POOL_DEBUG(SAT_DEBUG_STATS, "removedisabledconflicts\n");
3682 queue_empty(removed);
3683 for (i = 0; i < solv->decisionq.count; i++)
3685 p = solv->decisionq.elements[i];
3688 /* a conflict. we never do conflicts on free decisions, so there
3689 * must have been an unit rule */
3690 why = solv->decisionq_why.elements[i];
3692 r = solv->rules + why;
3693 if (r->d < 0 && decisionmap[-p])
3695 /* rule is now disabled, remove from decisionmap */
3696 POOL_DEBUG(SAT_DEBUG_STATS, "removing conflict for package %s[%d]\n", solvable2str(pool, pool->solvables - p), -p);
3697 queue_push(removed, -p);
3698 queue_push(removed, decisionmap[-p]);
3699 decisionmap[-p] = 0;
3702 if (!removed->count)
3704 /* we removed some confliced packages. some of them might still
3705 * be in conflict, so search for unit rules and re-conflict */
3707 for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
3709 if (i == solv->nrules)
3712 r = solv->rules + i;
3718 if (r->p < 0 && !decisionmap[-r->p])
3724 if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
3726 else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
3731 if (r->p < 0 && decisionmap[-r->p] == 0)
3733 if (new || DECISIONMAP_FALSE(r->p))
3735 dp = pool->whatprovidesdata + r->d;
3736 while ((p = *dp++) != 0)
3738 if (new && p == new)
3740 if (p < 0 && decisionmap[-p] == 0)
3749 else if (!DECISIONMAP_FALSE(p))
3759 POOL_DEBUG(SAT_DEBUG_STATS, "re-conflicting package %s[%d]\n", solvable2str(pool, pool->solvables - new), -new);
3760 decisionmap[-new] = -1;
3762 n = 0; /* redo all rules */
3768 /*-------------------------------------------------------------------
3770 * weaken solvable dependencies
3774 weaken_solvable_deps(Solver *solv, Id p)
3779 for (i = 1, r = solv->rules + i; i < solv->featurerules; i++, r++)
3783 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
3784 continue; /* conflict */
3785 queue_push(&solv->weakruleq, i);
3789 /********************************************************************/
3799 solver_solve(Solver *solv, Queue *job)
3801 Pool *pool = solv->pool;
3802 Repo *installed = solv->installed;
3805 Map addedmap; /* '1' == have rpm-rules for solvable */
3806 Id how, what, weak, p, *pp, d;
3812 /* create whatprovides if not already there */
3813 if (!pool->whatprovides)
3814 pool_createwhatprovides(pool);
3816 /* create obsolete index if needed */
3817 if (solv->noupdateprovide)
3818 create_obsolete_index(solv);
3821 * create basic rule set of all involved packages
3822 * use addedmap bitmap to make sure we don't create rules twice
3826 /* create noobsolete map if needed */
3827 for (i = 0; i < job->count; i += 2)
3829 how = job->elements[i] & ~SOLVER_WEAK;
3830 what = job->elements[i + 1];
3833 case SOLVER_NOOBSOLETES_SOLVABLE:
3834 case SOLVER_NOOBSOLETES_SOLVABLE_NAME:
3835 case SOLVER_NOOBSOLETES_SOLVABLE_PROVIDES:
3836 if (!solv->noobsoletes.size)
3837 map_init(&solv->noobsoletes, pool->nsolvables);
3838 if (how == SOLVER_NOOBSOLETES_SOLVABLE)
3840 MAPSET(&solv->noobsoletes, what);
3843 FOR_PROVIDES(p, pp, what)
3845 if (how == SOLVER_NOOBSOLETES_SOLVABLE_NAME && !pool_match_nevr(pool, pool->solvables + p, what))
3847 MAPSET(&solv->noobsoletes, p);
3855 map_init(&addedmap, pool->nsolvables);
3859 * always install our system solvable
3861 MAPSET(&addedmap, SYSTEMSOLVABLE);
3862 queue_push(&solv->decisionq, SYSTEMSOLVABLE);
3863 queue_push(&solv->decisionq_why, 0);
3864 solv->decisionmap[SYSTEMSOLVABLE] = 1; /* installed at level '1' */
3867 * create rules for all package that could be involved with the solving
3868 * so called: rpm rules
3873 oldnrules = solv->nrules;
3874 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for installed solvables ***\n");
3875 FOR_REPO_SOLVABLES(installed, p, s)
3876 addrpmrulesforsolvable(solv, s, &addedmap);
3877 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
3878 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for updaters of installed solvables ***\n");
3879 oldnrules = solv->nrules;
3880 FOR_REPO_SOLVABLES(installed, p, s)
3881 addrpmrulesforupdaters(solv, s, &addedmap, 1);
3882 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
3886 * create rules for all packages involved in the job
3887 * (to be installed or removed)
3890 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for packages involved with a job ***\n");
3891 oldnrules = solv->nrules;
3892 for (i = 0; i < job->count; i += 2)
3894 how = job->elements[i] & ~SOLVER_WEAK;
3895 what = job->elements[i + 1];
3899 case SOLVER_INSTALL_SOLVABLE:
3900 addrpmrulesforsolvable(solv, pool->solvables + what, &addedmap);
3902 case SOLVER_INSTALL_SOLVABLE_NAME:
3903 case SOLVER_INSTALL_SOLVABLE_PROVIDES:
3904 FOR_PROVIDES(p, pp, what)
3906 /* if by name, ensure that the name matches */
3907 if (how == SOLVER_INSTALL_SOLVABLE_NAME && !pool_match_nevr(pool, pool->solvables + p, what))
3909 addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
3912 case SOLVER_INSTALL_SOLVABLE_UPDATE:
3913 /* dont allow downgrade */
3914 addrpmrulesforupdaters(solv, pool->solvables + what, &addedmap, 0);
3916 case SOLVER_INSTALL_SOLVABLE_ONE_OF:
3917 pp = pool->whatprovidesdata + what;
3918 while ((p = *pp++) != 0)
3919 addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
3923 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
3925 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for recommended/suggested packages ***\n");
3927 oldnrules = solv->nrules;
3930 * add rules for suggests, enhances
3932 addrpmrulesforweak(solv, &addedmap);
3933 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
3935 IF_POOLDEBUG (SAT_DEBUG_STATS)
3937 int possible = 0, installable = 0;
3938 for (i = 1; i < pool->nsolvables; i++)
3940 if (pool_installable(pool, pool->solvables + i))
3942 if (MAPTST(&addedmap, i))
3945 POOL_DEBUG(SAT_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
3949 * first pass done, we now have all the rpm rules we need.
3950 * unify existing rules before going over all job rules and
3952 * at this point the system is always solvable,
3953 * as an empty system (remove all packages) is a valid solution
3956 unifyrules(solv); /* remove duplicate rpm rules */
3958 solv->rpmrules_end = solv->nrules; /* mark end of rpm rules */
3960 solv->directdecisions = solv->decisionq.count;
3961 POOL_DEBUG(SAT_DEBUG_STATS, "decisions so far: %d\n", solv->decisionq.count);
3964 * create feature rules
3966 * foreach installed:
3967 * create assertion (keep installed, if no update available)
3969 * create update rule (A|update1(A)|update2(A)|...)
3971 * those are used later on to keep a version of the installed packages in
3975 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add feature rules ***\n");
3976 solv->featurerules = solv->nrules; /* mark start of feature rules */
3979 /* foreach possibly installed solvable */
3980 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3982 if (s->repo != installed)
3984 addrule(solv, 0, 0); /* create dummy rule */
3987 addupdaterule(solv, s, 1); /* allow s to be updated */
3990 * assert one rule per installed solvable,
3991 * either an assertion (A)
3992 * or a possible update (A|update1(A)|update2(A)|...)
3994 assert(solv->nrules - solv->featurerules == installed->end - installed->start);
3996 solv->featurerules_end = solv->nrules;
3999 * Add update rules for installed solvables
4001 * almost identical to feature rules
4002 * except that downgrades are allowed
4005 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add update rules ***\n");
4006 solv->updaterules = solv->nrules;
4009 { /* foreach installed solvables */
4010 /* we create all update rules, but disable some later on depending on the job */
4011 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
4015 if (s->repo != installed)
4017 addrule(solv, 0, 0); /* create dummy rule */
4021 addupdaterule(solv, s, 0); /* allowall = 0: downgrades allowed */
4024 * check for and remove duplicate
4027 r = solv->rules + solv->nrules - 1; /* r: update rule */
4028 sr = r - (installed->end - installed->start); /* sr: feature rule */
4029 unifyrules_sortcmp_data = pool;
4030 if (!unifyrules_sortcmp(r, sr))
4032 /* identical rule, kill unneeded rule */
4033 if (solv->allowuninstall)
4035 /* keep feature rule */
4036 memset(r, 0, sizeof(*r));
4037 queue_push(&solv->weakruleq, sr - solv->rules);
4041 /* keep update rule */
4042 memset(sr, 0, sizeof(*sr));
4045 else if (solv->allowuninstall)
4047 /* make both feature and update rule weak */
4048 queue_push(&solv->weakruleq, r - solv->rules);
4049 queue_push(&solv->weakruleq, sr - solv->rules);
4052 disablerule(solv, sr);
4054 /* consistency check: we added a rule for _every_ installed solvable */
4055 assert(solv->nrules - solv->updaterules == installed->end - installed->start);
4057 solv->updaterules_end = solv->nrules;
4061 * now add all job rules
4064 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add JOB rules ***\n");
4066 solv->jobrules = solv->nrules;
4067 for (i = 0; i < job->count; i += 2)
4069 oldnrules = solv->nrules;
4071 how = job->elements[i] & ~SOLVER_WEAK;
4072 weak = job->elements[i] & SOLVER_WEAK;
4073 what = job->elements[i + 1];
4076 case SOLVER_INSTALL_SOLVABLE: /* install specific solvable */
4077 s = pool->solvables + what;
4078 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sinstall solvable %s\n", weak ? "weak " : "", solvable2str(pool, s));
4079 addrule(solv, what, 0); /* install by Id */
4080 queue_push(&solv->ruletojob, i);
4082 queue_push(&solv->weakruleq, solv->nrules - 1);
4084 case SOLVER_ERASE_SOLVABLE:
4085 s = pool->solvables + what;
4086 POOL_DEBUG(SAT_DEBUG_JOB, "job: %serase solvable %s\n", weak ? "weak " : "", solvable2str(pool, s));
4087 addrule(solv, -what, 0); /* remove by Id */
4088 queue_push(&solv->ruletojob, i);
4090 queue_push(&solv->weakruleq, solv->nrules - 1);
4092 case SOLVER_INSTALL_SOLVABLE_NAME: /* install by capability */
4093 case SOLVER_INSTALL_SOLVABLE_PROVIDES:
4094 if (how == SOLVER_INSTALL_SOLVABLE_NAME)
4095 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sinstall name %s\n", weak ? "weak " : "", dep2str(pool, what));
4096 if (how == SOLVER_INSTALL_SOLVABLE_PROVIDES)
4097 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sinstall provides %s\n", weak ? "weak " : "", dep2str(pool, what));
4099 FOR_PROVIDES(p, pp, what)
4101 /* if by name, ensure that the name matches */
4102 if (how == SOLVER_INSTALL_SOLVABLE_NAME && !pool_match_nevr(pool, pool->solvables + p, what))
4108 /* no provider, make this an impossible rule */
4109 queue_push(&q, -SYSTEMSOLVABLE);
4112 p = queue_shift(&q); /* get first provider */
4114 d = 0; /* single provider ? -> make assertion */
4116 d = pool_queuetowhatprovides(pool, &q); /* get all providers */
4117 addrule(solv, p, d); /* add 'requires' rule */
4118 queue_push(&solv->ruletojob, i);
4120 queue_push(&solv->weakruleq, solv->nrules - 1);
4122 case SOLVER_ERASE_SOLVABLE_NAME: /* remove by capability */
4123 case SOLVER_ERASE_SOLVABLE_PROVIDES:
4124 if (how == SOLVER_ERASE_SOLVABLE_NAME)
4125 POOL_DEBUG(SAT_DEBUG_JOB, "job: %serase name %s\n", weak ? "weak " : "", dep2str(pool, what));
4126 if (how == SOLVER_ERASE_SOLVABLE_PROVIDES)
4127 POOL_DEBUG(SAT_DEBUG_JOB, "job: %serase provides %s\n", weak ? "weak " : "", dep2str(pool, what));
4128 FOR_PROVIDES(p, pp, what)
4130 /* if by name, ensure that the name matches */
4131 if (how == SOLVER_ERASE_SOLVABLE_NAME && !pool_match_nevr(pool, pool->solvables + p, what))
4133 addrule(solv, -p, 0); /* add 'remove' rule */
4134 queue_push(&solv->ruletojob, i);
4136 queue_push(&solv->weakruleq, solv->nrules - 1);
4139 case SOLVER_INSTALL_SOLVABLE_UPDATE: /* find update for solvable */
4140 s = pool->solvables + what;
4141 POOL_DEBUG(SAT_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solvable2str(pool, s));
4142 addupdaterule(solv, s, 0);
4143 queue_push(&solv->ruletojob, i);
4145 queue_push(&solv->weakruleq, solv->nrules - 1);
4147 case SOLVER_INSTALL_SOLVABLE_ONE_OF:
4148 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sone of\n", weak ? "weak " : "");
4149 for (pp = pool->whatprovidesdata + what; *pp; pp++)
4150 POOL_DEBUG(SAT_DEBUG_JOB, " %s\n", solvable2str(pool, pool->solvables + *pp));
4151 addrule(solv, -SYSTEMSOLVABLE, what);
4152 queue_push(&solv->ruletojob, i);
4154 queue_push(&solv->weakruleq, solv->nrules - 1);
4156 case SOLVER_WEAKEN_SOLVABLE_DEPS:
4157 s = pool->solvables + what;
4158 POOL_DEBUG(SAT_DEBUG_JOB, "job: weaken deps %s\n", solvable2str(pool, s));
4159 weaken_solvable_deps(solv, what);
4161 case SOLVER_NOOBSOLETES_SOLVABLE:
4162 POOL_DEBUG(SAT_DEBUG_JOB, "job: no obsolete %s\n", solvable2str(pool, pool->solvables + what));
4164 case SOLVER_NOOBSOLETES_SOLVABLE_NAME:
4165 POOL_DEBUG(SAT_DEBUG_JOB, "job: no obsolete name %s\n", dep2str(pool, what));
4167 case SOLVER_NOOBSOLETES_SOLVABLE_PROVIDES:
4168 POOL_DEBUG(SAT_DEBUG_JOB, "job: no obsolete provides %s\n", dep2str(pool, what));
4176 IF_POOLDEBUG (SAT_DEBUG_JOB)
4179 if (solv->nrules == oldnrules)
4180 POOL_DEBUG(SAT_DEBUG_JOB, " - no rule created\n");
4181 for (j = oldnrules; j < solv->nrules; j++)
4183 POOL_DEBUG(SAT_DEBUG_JOB, " - job ");
4184 solver_printrule(solv, SAT_DEBUG_JOB, solv->rules + j);
4188 assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
4189 solv->jobrules_end = solv->nrules;
4191 /* all rules created
4192 * --------------------------------------------------------------
4193 * prepare for solving
4196 /* free unneeded memory */
4197 map_free(&addedmap);
4200 /* create weak map */
4201 map_init(&solv->weakrulemap, solv->nrules);
4202 for (i = 0; i < solv->weakruleq.count; i++)
4204 p = solv->weakruleq.elements[i];
4205 MAPSET(&solv->weakrulemap, p);
4208 /* all new rules are learnt after this point */
4209 solv->learntrules = solv->nrules;
4211 /* create assertion index. it is only used to speed up
4212 * makeruledecsions() a bit */
4213 for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
4214 if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
4215 queue_push(&solv->ruleassertions, i);
4217 /* disable update rules that conflict with our job */
4218 disableupdaterules(solv, job, -1);
4220 /* make decisions based on job/update assertions */
4221 makeruledecisions(solv);
4223 /* create watches chains */
4226 POOL_DEBUG(SAT_DEBUG_STATS, "problems so far: %d\n", solv->problems.count);
4229 * ********************************************
4231 * ********************************************
4234 run_solver(solv, 1, solv->dontinstallrecommended ? 0 : 1);
4238 /* disable all erase jobs (including weak "keep uninstalled" rules) */
4239 for (i = solv->jobrules, r = solv->rules + i; i < solv->learntrules; i++, r++)
4241 if (r->d < 0) /* disabled ? */
4243 if (r->p > 0) /* install job? */
4245 disablerule(solv, r);
4251 enabledisablelearntrules(solv);
4252 removedisabledconflicts(solv, &redoq);
4256 * find recommended packages
4259 /* if redoq.count == 0 we already found all recommended in the
4261 if (redoq.count || solv->dontinstallrecommended || !solv->dontshowinstalledrecommended || solv->ignorealreadyrecommended)
4263 Id rec, *recp, p, *pp;
4265 /* create map of all recommened packages */
4266 solv->recommends_index = -1;
4267 MAPZERO(&solv->recommendsmap);
4268 for (i = 0; i < solv->decisionq.count; i++)
4270 p = solv->decisionq.elements[i];
4273 s = pool->solvables + p;
4276 recp = s->repo->idarraydata + s->recommends;
4277 while ((rec = *recp++) != 0)
4279 FOR_PROVIDES(p, pp, rec)
4280 if (solv->decisionmap[p] > 0)
4284 if (!solv->dontshowinstalledrecommended)
4286 FOR_PROVIDES(p, pp, rec)
4287 if (solv->decisionmap[p] > 0)
4288 MAPSET(&solv->recommendsmap, p);
4290 continue; /* p != 0: already fulfilled */
4292 FOR_PROVIDES(p, pp, rec)
4293 MAPSET(&solv->recommendsmap, p);
4297 for (i = 1; i < pool->nsolvables; i++)
4299 if (solv->decisionmap[i] < 0)
4301 if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
4303 s = pool->solvables + i;
4304 if (!MAPTST(&solv->recommendsmap, i))
4306 if (!s->supplements)
4308 if (!pool_installable(pool, s))
4310 if (!solver_is_supplementing(solv, s))
4313 if (solv->dontinstallrecommended)
4314 queue_push(&solv->recommendations, i);
4316 queue_pushunique(&solv->recommendations, i);
4318 /* we use MODE_SUGGEST here so that repo prio is ignored */
4319 policy_filter_unwanted(solv, &solv->recommendations, 0, POLICY_MODE_SUGGEST);
4323 * find suggested packages
4328 Id sug, *sugp, p, *pp;
4330 /* create map of all suggests that are still open */
4331 solv->recommends_index = -1;
4332 MAPZERO(&solv->suggestsmap);
4333 for (i = 0; i < solv->decisionq.count; i++)
4335 p = solv->decisionq.elements[i];
4338 s = pool->solvables + p;
4341 sugp = s->repo->idarraydata + s->suggests;
4342 while ((sug = *sugp++) != 0)
4344 FOR_PROVIDES(p, pp, sug)
4345 if (solv->decisionmap[p] > 0)
4349 if (!solv->dontshowinstalledrecommended)
4351 FOR_PROVIDES(p, pp, sug)
4352 if (solv->decisionmap[p] > 0)
4353 MAPSET(&solv->suggestsmap, p);
4355 continue; /* already fulfilled */
4357 FOR_PROVIDES(p, pp, sug)
4358 MAPSET(&solv->suggestsmap, p);
4362 for (i = 1; i < pool->nsolvables; i++)
4364 if (solv->decisionmap[i] < 0)
4366 if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
4368 s = pool->solvables + i;
4369 if (!MAPTST(&solv->suggestsmap, i))
4373 if (!pool_installable(pool, s))
4375 if (!solver_is_enhancing(solv, s))
4378 queue_push(&solv->suggestions, i);
4380 policy_filter_unwanted(solv, &solv->suggestions, 0, POLICY_MODE_SUGGEST);
4385 /* restore decisionmap */
4386 for (i = 0; i < redoq.count; i += 2)
4387 solv->decisionmap[redoq.elements[i]] = redoq.elements[i + 1];
4391 * if unsolvable, prepare solutions
4394 if (solv->problems.count)
4396 int recocount = solv->recommendations.count;
4397 solv->recommendations.count = 0; /* so that revert() doesn't mess with it */
4398 queue_empty(&redoq);
4399 for (i = 0; i < solv->decisionq.count; i++)
4401 Id p = solv->decisionq.elements[i];
4402 queue_push(&redoq, p);
4403 queue_push(&redoq, solv->decisionq_why.elements[i]);
4404 queue_push(&redoq, solv->decisionmap[p > 0 ? p : -p]);
4406 problems_to_solutions(solv, job);
4407 memset(solv->decisionmap, 0, pool->nsolvables * sizeof(Id));
4408 queue_empty(&solv->decisionq);
4409 queue_empty(&solv->decisionq_why);
4410 for (i = 0; i < redoq.count; i += 3)
4412 Id p = redoq.elements[i];
4413 queue_push(&solv->decisionq, p);
4414 queue_push(&solv->decisionq_why, redoq.elements[i + 1]);
4415 solv->decisionmap[p > 0 ? p : -p] = redoq.elements[i + 2];
4417 solv->recommendations.count = recocount;
4420 POOL_DEBUG(SAT_DEBUG_STATS, "final solver statistics: %d learned rules, %d unsolvable\n", solv->stats_learned, solv->stats_unsolvable);
4424 /***********************************************************************/
4425 /* disk usage computations */
4427 /*-------------------------------------------------------------------
4429 * calculate DU changes
4433 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
4437 solver_create_state_maps(solv, &installedmap, 0);
4438 pool_calc_duchanges(solv->pool, solv->installed, &installedmap, mps, nmps);
4439 map_free(&installedmap);
4443 /*-------------------------------------------------------------------
4445 * calculate changes in install size
4449 solver_calc_installsizechange(Solver *solv)
4454 solver_create_state_maps(solv, &installedmap, 0);
4455 change = pool_calc_installsizechange(solv->pool, solv->installed, &installedmap);
4456 map_free(&installedmap);