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
25 #include "solverdebug.h"
27 #define RULES_BLOCK 63
29 /********************************************************************
31 * dependency check helpers
35 /*-------------------------------------------------------------------
36 * handle split provides
40 solver_splitprovides(Solver *solv, Id dep)
42 Pool *pool = solv->pool;
47 if (!solv->dosplitprovides || !solv->installed)
51 rd = GETRELDEP(pool, dep);
52 if (rd->flags != REL_WITH)
54 FOR_PROVIDES(p, pp, dep)
56 s = pool->solvables + p;
57 if (s->repo == solv->installed && s->name == rd->name)
64 /*-------------------------------------------------------------------
65 * solver_dep_installed
69 solver_dep_installed(Solver *solv, Id dep)
72 Pool *pool = solv->pool;
77 Reldep *rd = GETRELDEP(pool, dep);
78 if (rd->flags == REL_AND)
80 if (!solver_dep_installed(solv, rd->name))
82 return solver_dep_installed(solv, rd->evr);
84 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
85 return solver_dep_installed(solv, rd->evr);
87 FOR_PROVIDES(p, pp, dep)
89 if (p == SYSTEMSOLVABLE || (solv->installed && pool->solvables[p].repo == solv->installed))
98 /************************************************************************/
101 * make assertion rules into decisions
103 * Go through rules and add direct assertions to the decisionqueue.
104 * If we find a conflict, disable rules and add them to problem queue.
108 makeruledecisions(Solver *solv)
110 Pool *pool = solv->pool;
116 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- makeruledecisions ; size decisionq: %d -----\n",solv->decisionq.count);
118 /* The system solvable is always installed first */
119 assert(solv->decisionq.count == 0);
120 queue_push(&solv->decisionq, SYSTEMSOLVABLE);
121 queue_push(&solv->decisionq_why, 0);
122 solv->decisionmap[SYSTEMSOLVABLE] = 1; /* installed at level '1' */
124 decisionstart = solv->decisionq.count;
125 for (ii = 0; ii < solv->ruleassertions.count; ii++)
127 ri = solv->ruleassertions.elements[ii];
128 r = solv->rules + ri;
130 if (r->d < 0 || !r->p || r->w2) /* disabled, dummy or no assertion */
132 /* do weak rules in phase 2 */
133 if (ri < solv->learntrules && MAPTST(&solv->weakrulemap, ri))
139 if (!solv->decisionmap[vv]) /* if not yet decided */
144 queue_push(&solv->decisionq, v);
145 queue_push(&solv->decisionq_why, r - solv->rules);
146 solv->decisionmap[vv] = v > 0 ? 1 : -1;
147 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
149 Solvable *s = solv->pool->solvables + vv;
151 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", solvable2str(solv->pool, s));
153 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "installing %s (assertion)\n", solvable2str(solv->pool, s));
158 * check previous decision: is it sane ?
161 if (v > 0 && solv->decisionmap[vv] > 0) /* ok to install */
163 if (v < 0 && solv->decisionmap[vv] < 0) /* ok to remove */
169 * The rule (r) we're currently processing says something
170 * different (v = r->p) than a previous decision (decisionmap[abs(v)])
174 if (ri >= solv->learntrules)
176 /* conflict with a learnt rule */
177 /* can happen when packages cannot be installed for
178 * multiple reasons. */
179 /* we disable the learnt rule in this case */
180 solver_disablerule(solv, r);
185 * find the decision which is the "opposite" of the rule
188 for (i = 0; i < solv->decisionq.count; i++)
189 if (solv->decisionq.elements[i] == -v)
191 assert(i < solv->decisionq.count); /* assert that we found it */
194 * conflict with system solvable ?
197 if (v == -SYSTEMSOLVABLE) {
198 /* conflict with system solvable */
199 queue_push(&solv->problems, solv->learnt_pool.count);
200 queue_push(&solv->learnt_pool, ri);
201 queue_push(&solv->learnt_pool, 0);
202 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "conflict with system solvable, disabling rule #%d\n", ri);
203 if (ri >= solv->jobrules && ri < solv->jobrules_end)
204 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
207 queue_push(&solv->problems, v);
208 queue_push(&solv->problems, 0);
209 solver_disableproblem(solv, v);
213 assert(solv->decisionq_why.elements[i] > 0);
216 * conflict with an rpm rule ?
219 if (solv->decisionq_why.elements[i] < solv->rpmrules_end)
221 /* conflict with rpm rule assertion */
222 queue_push(&solv->problems, solv->learnt_pool.count);
223 queue_push(&solv->learnt_pool, ri);
224 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
225 queue_push(&solv->learnt_pool, 0);
226 assert(v > 0 || v == -SYSTEMSOLVABLE);
227 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "conflict with rpm rule, disabling rule #%d\n", ri);
228 if (ri >= solv->jobrules && ri < solv->jobrules_end)
229 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
232 queue_push(&solv->problems, v);
233 queue_push(&solv->problems, 0);
234 solver_disableproblem(solv, v);
239 * conflict with another job or update/feature rule
243 queue_push(&solv->problems, solv->learnt_pool.count);
244 queue_push(&solv->learnt_pool, ri);
245 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
246 queue_push(&solv->learnt_pool, 0);
248 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "conflicting update/job assertions over literal %d\n", vv);
251 * push all of our rules (can only be feature or job rules)
252 * asserting this literal on the problem stack
255 for (i = solv->featurerules, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
257 if (rr->d < 0 /* disabled */
258 || rr->w2) /* or no assertion */
260 if (rr->p != vv /* not affecting the literal */
263 if (MAPTST(&solv->weakrulemap, i)) /* weak: silently ignore */
266 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, " - disabling rule #%d\n", i);
268 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, solv->rules + i);
271 /* is is a job rule ? */
272 if (i >= solv->jobrules && i < solv->jobrules_end)
273 v = -(solv->ruletojob.elements[i - solv->jobrules] + 1);
275 queue_push(&solv->problems, v);
276 solver_disableproblem(solv, v);
278 queue_push(&solv->problems, 0);
282 * (back up from decisions)
284 while (solv->decisionq.count > decisionstart)
286 v = solv->decisionq.elements[--solv->decisionq.count];
287 --solv->decisionq_why.count;
289 solv->decisionmap[vv] = 0;
291 ii = -1; /* restarts loop at 0 */
295 * phase 2: now do the weak assertions
297 for (ii = 0; ii < solv->ruleassertions.count; ii++)
299 ri = solv->ruleassertions.elements[ii];
300 r = solv->rules + ri;
301 if (r->d < 0 || r->w2) /* disabled or no assertion */
303 if (ri >= solv->learntrules || !MAPTST(&solv->weakrulemap, ri)) /* skip non-weak */
309 * (if not yet decided)
311 if (!solv->decisionmap[vv])
313 queue_push(&solv->decisionq, v);
314 queue_push(&solv->decisionq_why, r - solv->rules);
315 solv->decisionmap[vv] = v > 0 ? 1 : -1;
316 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
318 Solvable *s = solv->pool->solvables + vv;
320 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", solvable2str(solv->pool, s));
322 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "installing %s (weak assertion)\n", solvable2str(solv->pool, s));
327 * previously decided, sane ?
329 if (v > 0 && solv->decisionmap[vv] > 0)
331 if (v < 0 && solv->decisionmap[vv] < 0)
334 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "assertion conflict, but I am weak, disabling ");
335 solver_printrule(solv, SAT_DEBUG_UNSOLVABLE, r);
337 if (ri >= solv->jobrules && ri < solv->jobrules_end)
338 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
341 solver_disableproblem(solv, v);
343 solver_reenablepolicyrules(solv, -(v + 1));
346 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- makeruledecisions end; size decisionq: %d -----\n",solv->decisionq.count);
350 /*-------------------------------------------------------------------
351 * enable/disable learnt rules
353 * we have enabled or disabled some of our rules. We now reenable all
354 * of our learnt rules except the ones that were learnt from rules that
358 enabledisablelearntrules(Solver *solv)
360 Pool *pool = solv->pool;
365 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "enabledisablelearntrules called\n");
366 for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
368 whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules];
369 while ((why = *whyp++) != 0)
371 assert(why > 0 && why < i);
372 if (solv->rules[why].d < 0)
375 /* why != 0: we found a disabled rule, disable the learnt rule */
376 if (why && r->d >= 0)
378 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
380 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "disabling ");
381 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
383 solver_disablerule(solv, r);
385 else if (!why && r->d < 0)
387 IF_POOLDEBUG (SAT_DEBUG_SOLUTIONS)
389 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "re-enabling ");
390 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, r);
392 solver_enablerule(solv, r);
398 /********************************************************************/
402 /*-------------------------------------------------------------------
405 * initial setup for all watches
409 makewatches(Solver *solv)
413 int nsolvables = solv->pool->nsolvables;
415 sat_free(solv->watches);
416 /* lower half for removals, upper half for installs */
417 solv->watches = sat_calloc(2 * nsolvables, sizeof(Id));
419 /* do it reverse so rpm rules get triggered first (XXX: obsolete?) */
420 for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
422 for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
425 if (!r->w2) /* assertions do not need watches */
428 /* see addwatches_rule(solv, r) */
429 r->n1 = solv->watches[nsolvables + r->w1];
430 solv->watches[nsolvables + r->w1] = r - solv->rules;
432 r->n2 = solv->watches[nsolvables + r->w2];
433 solv->watches[nsolvables + r->w2] = r - solv->rules;
438 /*-------------------------------------------------------------------
440 * add watches (for a new learned rule)
441 * sets up watches for a single rule
443 * see also makewatches() above.
447 addwatches_rule(Solver *solv, Rule *r)
449 int nsolvables = solv->pool->nsolvables;
451 r->n1 = solv->watches[nsolvables + r->w1];
452 solv->watches[nsolvables + r->w1] = r - solv->rules;
454 r->n2 = solv->watches[nsolvables + r->w2];
455 solv->watches[nsolvables + r->w2] = r - solv->rules;
459 /********************************************************************/
465 /* shortcuts to check if a literal (positive or negative) assignment
466 * evaluates to 'true' or 'false'
468 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
469 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
470 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
472 /*-------------------------------------------------------------------
476 * make decision and propagate to all rules
478 * Evaluate each term affected by the decision (linked through watches)
479 * If we find unit rules we make new decisions based on them
481 * Everything's fixed there, it's just finding rules that are
484 * return : 0 = everything is OK
485 * rule = conflict found in this rule
489 propagate(Solver *solv, int level)
491 Pool *pool = solv->pool;
492 Id *rp, *next_rp; /* rule pointer, next rule pointer in linked list */
494 Id p, pkg, other_watch;
496 Id *decisionmap = solv->decisionmap;
498 Id *watches = solv->watches + pool->nsolvables; /* place ptr in middle */
500 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "----- propagate -----\n");
502 /* foreach non-propagated decision */
503 while (solv->propagate_index < solv->decisionq.count)
506 * 'pkg' was just decided
507 * negate because our watches trigger if literal goes FALSE
509 pkg = -solv->decisionq.elements[solv->propagate_index++];
511 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
513 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "propagate for decision %d level %d\n", -pkg, level);
514 solver_printruleelement(solv, SAT_DEBUG_PROPAGATE, 0, -pkg);
517 /* foreach rule where 'pkg' is now FALSE */
518 for (rp = watches + pkg; *rp; rp = next_rp)
520 r = solv->rules + *rp;
523 /* rule is disabled, goto next */
531 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
533 POOL_DEBUG(SAT_DEBUG_PROPAGATE," watch triggered ");
534 solver_printrule(solv, SAT_DEBUG_PROPAGATE, r);
537 /* 'pkg' was just decided (was set to FALSE)
539 * now find other literal watch, check clause
540 * and advance on linked list
554 * This term is already true (through the other literal)
555 * so we have nothing to do
557 if (DECISIONMAP_TRUE(other_watch))
561 * The other literal is FALSE or UNDEF
567 /* Not a binary clause, try to move our watch.
569 * Go over all literals and find one that is
573 * (TRUE is also ok, in that case the rule is fulfilled)
575 if (r->p /* we have a 'p' */
576 && r->p != other_watch /* which is not watched */
577 && !DECISIONMAP_FALSE(r->p)) /* and not FALSE */
581 else /* go find a 'd' to make 'true' */
584 we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
586 for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
588 if (p != other_watch /* which is not watched */
589 && !DECISIONMAP_FALSE(p)) /* and not FALSE */
597 * if we found some p that is UNDEF or TRUE, move
600 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
603 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), solvid2str(pool, p));
605 POOL_DEBUG(SAT_DEBUG_PROPAGATE," -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), solvid2str(pool, -p));
621 watches[p] = r - solv->rules;
624 /* search failed, thus all unwatched literals are FALSE */
629 * unit clause found, set literal other_watch to TRUE
632 if (DECISIONMAP_FALSE(other_watch)) /* check if literal is FALSE */
633 return r; /* eek, a conflict! */
635 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
637 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " unit ");
638 solver_printrule(solv, SAT_DEBUG_PROPAGATE, r);
642 decisionmap[other_watch] = level; /* install! */
644 decisionmap[-other_watch] = -level; /* remove! */
646 queue_push(&solv->decisionq, other_watch);
647 queue_push(&solv->decisionq_why, r - solv->rules);
649 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
652 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> decided to install %s\n", solvid2str(pool, other_watch));
654 POOL_DEBUG(SAT_DEBUG_PROPAGATE, " -> decided to conflict %s\n", solvid2str(pool, -other_watch));
657 } /* foreach rule involving 'pkg' */
659 } /* while we have non-decided decisions */
661 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "----- propagate end-----\n");
663 return 0; /* all is well */
667 /********************************************************************/
670 /*-------------------------------------------------------------------
677 analyze(Solver *solv, int level, Rule *c, int *pr, int *dr, int *whyp)
679 Pool *pool = solv->pool;
682 Map seen; /* global? */
683 Id d, v, vv, *dp, why;
685 int num = 0, l1num = 0;
686 int learnt_why = solv->learnt_pool.count;
687 Id *decisionmap = solv->decisionmap;
691 POOL_DEBUG(SAT_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
692 map_init(&seen, pool->nsolvables);
693 idx = solv->decisionq.count;
696 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
697 solver_printruleclass(solv, SAT_DEBUG_ANALYZE, c);
698 queue_push(&solv->learnt_pool, c - solv->rules);
699 d = c->d < 0 ? -c->d - 1 : c->d;
700 dp = d ? pool->whatprovidesdata + d : 0;
701 /* go through all literals of the rule */
713 if (DECISIONMAP_TRUE(v)) /* the one true literal */
716 if (MAPTST(&seen, vv))
718 l = solv->decisionmap[vv];
723 l1num++; /* need to do this one in level1 pass */
725 num++; /* need to do this one as well */
728 queue_push(&r, v); /* not level1 or conflict level, add to new rule */
734 if (!num && !--l1num)
735 break; /* all level 1 literals done */
739 v = solv->decisionq.elements[--idx];
741 if (MAPTST(&seen, vv))
745 if (num && --num == 0)
747 *pr = -v; /* so that v doesn't get lost */
750 POOL_DEBUG(SAT_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
751 for (i = 0; i < r.count; i++)
754 MAPCLR(&seen, v > 0 ? v : -v);
756 /* only level 1 marks left */
760 why = solv->decisionq_why.elements[idx];
761 if (why <= 0) /* just in case, maybe for SYSTEMSOLVABLE */
763 c = solv->rules + why;
769 else if (r.count == 1 && r.elements[0] < 0)
772 *dr = pool_queuetowhatprovides(pool, &r);
773 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
775 POOL_DEBUG(SAT_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
776 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, *pr);
777 for (i = 0; i < r.count; i++)
778 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, r.elements[i]);
780 /* push end marker on learnt reasons stack */
781 queue_push(&solv->learnt_pool, 0);
784 solv->stats_learned++;
789 /*-------------------------------------------------------------------
793 * reset the solver decisions to right after the rpm rules.
794 * called after rules have been enabled/disabled
798 solver_reset(Solver *solv)
800 Pool *pool = solv->pool;
804 /* rewind all decisions */
805 for (i = solv->decisionq.count - 1; i >= 0; i--)
807 v = solv->decisionq.elements[i];
808 solv->decisionmap[v > 0 ? v : -v] = 0;
810 solv->decisionq_why.count = 0;
811 solv->decisionq.count = 0;
812 solv->recommends_index = -1;
813 solv->propagate_index = 0;
814 solv->recommendations.count = 0;
815 solv->branches.count = 0;
817 /* adapt learnt rule status to new set of enabled/disabled rules */
818 enabledisablelearntrules(solv);
820 /* redo all job/update decisions */
821 makeruledecisions(solv);
822 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "decisions so far: %d\n", solv->decisionq.count);
826 /*-------------------------------------------------------------------
828 * analyze_unsolvable_rule
832 analyze_unsolvable_rule(Solver *solv, Rule *r, Id *lastweakp)
834 Pool *pool = solv->pool;
836 Id why = r - solv->rules;
838 IF_POOLDEBUG (SAT_DEBUG_UNSOLVABLE)
839 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, r);
840 if (solv->learntrules && why >= solv->learntrules)
842 for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
843 if (solv->learnt_pool.elements[i] > 0)
844 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp);
847 if (MAPTST(&solv->weakrulemap, why))
848 if (!*lastweakp || why > *lastweakp)
850 /* do not add rpm rules to problem */
851 if (why < solv->rpmrules_end)
853 /* turn rule into problem */
854 if (why >= solv->jobrules && why < solv->jobrules_end)
855 why = -(solv->ruletojob.elements[why - solv->jobrules] + 1);
856 /* normalize dup/infarch rules */
857 if (why > solv->infarchrules && why < solv->infarchrules_end)
859 Id name = pool->solvables[-solv->rules[why].p].name;
860 while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
863 if (why > solv->duprules && why < solv->duprules_end)
865 Id name = pool->solvables[-solv->rules[why].p].name;
866 while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
870 /* return if problem already countains our rule */
871 if (solv->problems.count)
873 for (i = solv->problems.count - 1; i >= 0; i--)
874 if (solv->problems.elements[i] == 0) /* end of last problem reached? */
876 else if (solv->problems.elements[i] == why)
879 queue_push(&solv->problems, why);
883 /*-------------------------------------------------------------------
887 * return: 1 - disabled some rules, try again
892 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
894 Pool *pool = solv->pool;
896 Map seen; /* global to speed things up? */
897 Id d, v, vv, *dp, why;
899 Id *decisionmap = solv->decisionmap;
901 int oldlearntpoolcount;
904 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
905 solv->stats_unsolvable++;
906 oldproblemcount = solv->problems.count;
907 oldlearntpoolcount = solv->learnt_pool.count;
909 /* make room for proof index */
910 /* must update it later, as analyze_unsolvable_rule would confuse
911 * it with a rule index if we put the real value in already */
912 queue_push(&solv->problems, 0);
915 map_init(&seen, pool->nsolvables);
916 queue_push(&solv->learnt_pool, r - solv->rules);
918 analyze_unsolvable_rule(solv, r, &lastweak);
919 d = r->d < 0 ? -r->d - 1 : r->d;
920 dp = d ? pool->whatprovidesdata + d : 0;
931 if (DECISIONMAP_TRUE(v)) /* the one true literal */
934 l = solv->decisionmap[vv];
939 idx = solv->decisionq.count;
942 v = solv->decisionq.elements[--idx];
944 if (!MAPTST(&seen, vv))
946 why = solv->decisionq_why.elements[idx];
948 queue_push(&solv->learnt_pool, why);
949 r = solv->rules + why;
950 analyze_unsolvable_rule(solv, r, &lastweak);
951 d = r->d < 0 ? -r->d - 1 : r->d;
952 dp = d ? pool->whatprovidesdata + d : 0;
963 if (DECISIONMAP_TRUE(v)) /* the one true literal */
966 l = solv->decisionmap[vv];
973 queue_push(&solv->problems, 0); /* mark end of this problem */
978 /* disable last weak rule */
979 solv->problems.count = oldproblemcount;
980 solv->learnt_pool.count = oldlearntpoolcount;
981 if (lastweak >= solv->jobrules && lastweak < solv->jobrules_end)
982 v = -(solv->ruletojob.elements[lastweak - solv->jobrules] + 1);
985 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "disabling ");
986 solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, solv->rules + lastweak);
987 if (lastweak >= solv->choicerules && lastweak < solv->choicerules_end)
988 solver_disablechoicerules(solv, solv->rules + lastweak);
989 solver_disableproblem(solv, v);
991 solver_reenablepolicyrules(solv, -(v + 1));
997 queue_push(&solv->learnt_pool, 0);
998 solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
1002 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
1003 solver_disableproblem(solv, solv->problems.elements[i]);
1004 /* XXX: might want to enable all weak rules again */
1008 POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
1013 /********************************************************************/
1014 /* Decision revert */
1016 /*-------------------------------------------------------------------
1019 * revert decision at level
1023 revert(Solver *solv, int level)
1025 Pool *pool = solv->pool;
1027 while (solv->decisionq.count)
1029 v = solv->decisionq.elements[solv->decisionq.count - 1];
1030 vv = v > 0 ? v : -v;
1031 if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
1033 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
1034 if (v > 0 && solv->recommendations.count && v == solv->recommendations.elements[solv->recommendations.count - 1])
1035 solv->recommendations.count--;
1036 solv->decisionmap[vv] = 0;
1037 solv->decisionq.count--;
1038 solv->decisionq_why.count--;
1039 solv->propagate_index = solv->decisionq.count;
1041 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
1043 solv->branches.count--;
1044 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
1045 solv->branches.count--;
1047 solv->recommends_index = -1;
1051 /*-------------------------------------------------------------------
1053 * watch2onhighest - put watch2 on literal with highest level
1057 watch2onhighest(Solver *solv, Rule *r)
1062 d = r->d < 0 ? -r->d - 1 : r->d;
1064 return; /* binary rule, both watches are set */
1065 dp = solv->pool->whatprovidesdata + d;
1066 while ((v = *dp++) != 0)
1068 l = solv->decisionmap[v < 0 ? -v : v];
1080 /*-------------------------------------------------------------------
1084 * add free decision (solvable to install) to decisionq
1085 * increase level and propagate decision
1086 * return if no conflict.
1088 * in conflict case, analyze conflict rule, add resulting
1089 * rule to learnt rule set, make decision from learnt
1090 * rule (always unit) and re-propagate.
1092 * returns the new solver level or 0 if unsolvable
1097 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules, Id ruleid)
1099 Pool *pool = solv->pool;
1104 assert(ruleid >= 0);
1109 solv->decisionmap[decision] = level;
1111 solv->decisionmap[-decision] = -level;
1112 queue_push(&solv->decisionq, decision);
1113 queue_push(&solv->decisionq_why, -ruleid); /* <= 0 -> free decision */
1117 r = propagate(solv, level);
1121 return analyze_unsolvable(solv, r, disablerules);
1122 POOL_DEBUG(SAT_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
1123 l = analyze(solv, level, r, &p, &d, &why); /* learnt rule in p and d */
1124 assert(l > 0 && l < level);
1125 POOL_DEBUG(SAT_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, l);
1127 revert(solv, level);
1128 r = solver_addrule(solv, p, d);
1130 assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
1131 queue_push(&solv->learnt_why, why);
1134 /* at least 2 literals, needs watches */
1135 watch2onhighest(solv, r);
1136 addwatches_rule(solv, r);
1140 /* learnt rule is an assertion */
1141 queue_push(&solv->ruleassertions, r - solv->rules);
1143 /* the new rule is unit by design */
1144 solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
1145 queue_push(&solv->decisionq, p);
1146 queue_push(&solv->decisionq_why, r - solv->rules);
1147 IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
1149 POOL_DEBUG(SAT_DEBUG_ANALYZE, "decision: ");
1150 solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, p);
1151 POOL_DEBUG(SAT_DEBUG_ANALYZE, "new rule: ");
1152 solver_printrule(solv, SAT_DEBUG_ANALYZE, r);
1159 /*-------------------------------------------------------------------
1161 * select and install
1163 * install best package from the queue. We add an extra package, inst, if
1164 * provided. See comment in weak install section.
1166 * returns the new solver level or 0 if unsolvable
1171 selectandinstall(Solver *solv, int level, Queue *dq, int disablerules, Id ruleid)
1173 Pool *pool = solv->pool;
1178 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1181 /* XXX: didn't we already do that? */
1182 /* XXX: shouldn't we prefer installed packages? */
1183 /* XXX: move to policy.c? */
1184 /* choose the supplemented one */
1185 for (i = 0; i < dq->count; i++)
1186 if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
1188 dq->elements[0] = dq->elements[i];
1195 /* multiple candidates, open a branch */
1196 for (i = 1; i < dq->count; i++)
1197 queue_push(&solv->branches, dq->elements[i]);
1198 queue_push(&solv->branches, -level);
1200 p = dq->elements[0];
1202 POOL_DEBUG(SAT_DEBUG_POLICY, "installing %s\n", solvid2str(pool, p));
1204 return setpropagatelearn(solv, level, p, disablerules, ruleid);
1208 /********************************************************************/
1209 /* Main solver interface */
1212 /*-------------------------------------------------------------------
1215 * create solver structure
1217 * pool: all available solvables
1218 * installed: installed Solvables
1221 * Upon solving, rules are created to flag the Solvables
1222 * of the 'installed' Repo as installed.
1226 solver_create(Pool *pool)
1229 solv = (Solver *)sat_calloc(1, sizeof(Solver));
1231 solv->installed = pool->installed;
1233 transaction_init(&solv->trans, pool);
1234 queue_init(&solv->ruletojob);
1235 queue_init(&solv->decisionq);
1236 queue_init(&solv->decisionq_why);
1237 queue_init(&solv->problems);
1238 queue_init(&solv->suggestions);
1239 queue_init(&solv->recommendations);
1240 queue_init(&solv->orphaned);
1241 queue_init(&solv->learnt_why);
1242 queue_init(&solv->learnt_pool);
1243 queue_init(&solv->branches);
1244 queue_init(&solv->covenantq);
1245 queue_init(&solv->weakruleq);
1246 queue_init(&solv->ruleassertions);
1248 map_init(&solv->recommendsmap, pool->nsolvables);
1249 map_init(&solv->suggestsmap, pool->nsolvables);
1250 map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
1251 solv->recommends_index = 0;
1253 solv->decisionmap = (Id *)sat_calloc(pool->nsolvables, sizeof(Id));
1255 solv->rules = sat_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
1256 memset(solv->rules, 0, sizeof(Rule));
1262 /*-------------------------------------------------------------------
1268 solver_free(Solver *solv)
1270 transaction_free(&solv->trans);
1271 queue_free(&solv->job);
1272 queue_free(&solv->ruletojob);
1273 queue_free(&solv->decisionq);
1274 queue_free(&solv->decisionq_why);
1275 queue_free(&solv->learnt_why);
1276 queue_free(&solv->learnt_pool);
1277 queue_free(&solv->problems);
1278 queue_free(&solv->solutions);
1279 queue_free(&solv->suggestions);
1280 queue_free(&solv->recommendations);
1281 queue_free(&solv->orphaned);
1282 queue_free(&solv->branches);
1283 queue_free(&solv->covenantq);
1284 queue_free(&solv->weakruleq);
1285 queue_free(&solv->ruleassertions);
1287 map_free(&solv->recommendsmap);
1288 map_free(&solv->suggestsmap);
1289 map_free(&solv->noupdate);
1290 map_free(&solv->weakrulemap);
1291 map_free(&solv->noobsoletes);
1293 map_free(&solv->updatemap);
1294 map_free(&solv->fixmap);
1295 map_free(&solv->dupmap);
1296 map_free(&solv->dupinvolvedmap);
1297 map_free(&solv->droporphanedmap);
1298 map_free(&solv->cleandepsmap);
1300 sat_free(solv->decisionmap);
1301 sat_free(solv->rules);
1302 sat_free(solv->watches);
1303 sat_free(solv->obsoletes);
1304 sat_free(solv->obsoletes_data);
1305 sat_free(solv->multiversionupdaters);
1306 sat_free(solv->choicerules_ref);
1311 /*-------------------------------------------------------------------
1315 * all rules have been set up, now actually run the solver
1320 solver_run_sat(Solver *solv, int disablerules, int doweak)
1322 Queue dq; /* local decisionqueue */
1323 Queue dqs; /* local decisionqueue for supplements */
1329 Pool *pool = solv->pool;
1331 int minimizationsteps;
1332 int installedpos = solv->installed ? solv->installed->start : 0;
1334 IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
1336 POOL_DEBUG (SAT_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
1337 for (i = 1; i < solv->nrules; i++)
1338 solver_printruleclass(solv, SAT_DEBUG_RULE_CREATION, solv->rules + i);
1341 POOL_DEBUG(SAT_DEBUG_SOLVER, "initial decisions: %d\n", solv->decisionq.count);
1343 IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
1344 solver_printdecisions(solv);
1346 /* start SAT algorithm */
1348 systemlevel = level + 1;
1349 POOL_DEBUG(SAT_DEBUG_SOLVER, "solving...\n");
1355 * here's the main loop:
1356 * 1) propagate new decisions (only needed once)
1358 * 3) try to keep installed packages
1359 * 4) fulfill all unresolved rules
1360 * 5) install recommended packages
1361 * 6) minimalize solution if we had choices
1362 * if we encounter a problem, we rewind to a safe level and restart
1366 minimizationsteps = 0;
1370 * initial propagation of the assertions
1374 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "propagating (propagate_index: %d; size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
1375 if ((r = propagate(solv, level)) != 0)
1377 if (analyze_unsolvable(solv, r, disablerules))
1386 * resolve jobs first
1388 if (level < systemlevel)
1390 POOL_DEBUG(SAT_DEBUG_SOLVER, "resolving job rules\n");
1391 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
1394 if (r->d < 0) /* ignore disabled rules */
1397 FOR_RULELITERALS(l, dp, r)
1401 if (solv->decisionmap[-l] <= 0)
1406 if (solv->decisionmap[l] > 0)
1408 if (solv->decisionmap[l] == 0)
1414 /* prune to installed if not updating */
1415 if (!solv->updatesystem && solv->installed && dq.count > 1)
1418 for (j = k = 0; j < dq.count; j++)
1420 Solvable *s = pool->solvables + dq.elements[j];
1421 if (s->repo == solv->installed)
1422 dq.elements[k++] = dq.elements[j];
1428 level = selectandinstall(solv, level, &dq, disablerules, i);
1435 if (level <= olevel)
1438 systemlevel = level + 1;
1439 if (i < solv->jobrules_end)
1445 * installed packages
1447 if (level < systemlevel && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
1449 Repo *installed = solv->installed;
1452 POOL_DEBUG(SAT_DEBUG_SOLVER, "resolving installed packages\n");
1453 /* we use two passes if we need to update packages
1454 * to create a better user experience */
1455 for (pass = solv->updatemap.size ? 0 : 1; pass < 2; pass++)
1457 int passlevel = level;
1458 /* start with installedpos, the position that gave us problems last time */
1459 for (i = installedpos, n = installed->start; n < installed->end; i++, n++)
1464 if (i == installed->end)
1465 i = installed->start;
1466 s = pool->solvables + i;
1467 if (s->repo != installed)
1470 if (solv->decisionmap[i] > 0)
1472 if (!pass && solv->updatemap.size && !MAPTST(&solv->updatemap, i - installed->start))
1473 continue; /* updates first */
1474 r = solv->rules + solv->updaterules + (i - installed->start);
1476 if (!rr->p || rr->d < 0) /* disabled -> look at feature rule */
1477 rr -= solv->installed->end - solv->installed->start;
1478 if (!rr->p) /* identical to update rule? */
1481 continue; /* orpaned package */
1483 /* XXX: noupdate check is probably no longer needed, as all jobs should
1484 * already be satisfied */
1485 /* Actually we currently still need it because of erase jobs */
1486 /* if noupdate is set we do not look at update candidates */
1488 if (!MAPTST(&solv->noupdate, i - installed->start) && (solv->decisionmap[i] < 0 || solv->updatesystem || (solv->updatemap.size && MAPTST(&solv->updatemap, i - installed->start)) || rr->p != i))
1490 if (solv->noobsoletes.size && solv->multiversionupdaters
1491 && (d = solv->multiversionupdaters[i - installed->start]) != 0)
1493 /* special multiversion handling, make sure best version is chosen */
1495 while ((p = pool->whatprovidesdata[d++]) != 0)
1496 if (solv->decisionmap[p] >= 0)
1498 policy_filter_unwanted(solv, &dq, POLICY_MODE_CHOOSE);
1500 if (p != i && solv->decisionmap[p] == 0)
1502 rr = solv->rules + solv->featurerules + (i - solv->installed->start);
1503 if (!rr->p) /* update rule == feature rule? */
1504 rr = rr - solv->featurerules + solv->updaterules;
1512 /* update to best package */
1513 FOR_RULELITERALS(p, dp, rr)
1515 if (solv->decisionmap[p] > 0)
1517 dq.count = 0; /* already fulfilled */
1520 if (!solv->decisionmap[p])
1525 /* install best version */
1529 level = selectandinstall(solv, level, &dq, disablerules, rr - solv->rules);
1536 if (level <= olevel)
1538 if (level == 1 || level < passlevel)
1539 break; /* trouble */
1541 n = installed->start; /* redo all */
1547 /* if still undecided keep package */
1548 if (solv->decisionmap[i] == 0)
1551 if (solv->cleandepsmap.size && MAPTST(&solv->cleandepsmap, i - installed->start))
1553 POOL_DEBUG(SAT_DEBUG_POLICY, "cleandeps erasing %s\n", solvid2str(pool, i));
1554 level = setpropagatelearn(solv, level, -i, disablerules, 0);
1558 POOL_DEBUG(SAT_DEBUG_POLICY, "keeping %s\n", solvid2str(pool, i));
1559 level = setpropagatelearn(solv, level, i, disablerules, r - solv->rules);
1567 if (level <= olevel)
1569 if (level == 1 || level < passlevel)
1570 break; /* trouble */
1572 n = installed->start; /* redo all */
1575 continue; /* retry with learnt rule */
1579 if (n < installed->end)
1581 installedpos = i; /* retry problem solvable next time */
1582 break; /* ran into trouble */
1584 installedpos = installed->start; /* reset installedpos */
1586 systemlevel = level + 1;
1588 continue; /* had trouble, retry */
1591 if (level < systemlevel)
1592 systemlevel = level;
1597 POOL_DEBUG(SAT_DEBUG_POLICY, "deciding unresolved rules\n");
1598 for (i = 1, n = 1; n < solv->nrules; i++, n++)
1600 if (i == solv->nrules)
1602 r = solv->rules + i;
1603 if (r->d < 0) /* ignore disabled rules */
1608 /* binary or unary rule */
1609 /* need two positive undecided literals */
1610 if (r->p < 0 || r->w2 <= 0)
1612 if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
1614 queue_push(&dq, r->p);
1615 queue_push(&dq, r->w2);
1620 * all negative literals are installed
1621 * no positive literal is installed
1622 * i.e. the rule is not fulfilled and we
1623 * just need to decide on the positive literals
1627 if (solv->decisionmap[-r->p] <= 0)
1632 if (solv->decisionmap[r->p] > 0)
1634 if (solv->decisionmap[r->p] == 0)
1635 queue_push(&dq, r->p);
1637 dp = pool->whatprovidesdata + r->d;
1638 while ((p = *dp++) != 0)
1642 if (solv->decisionmap[-p] <= 0)
1647 if (solv->decisionmap[p] > 0)
1649 if (solv->decisionmap[p] == 0)
1656 IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1658 POOL_DEBUG(SAT_DEBUG_PROPAGATE, "unfulfilled ");
1659 solver_printruleclass(solv, SAT_DEBUG_PROPAGATE, r);
1661 /* dq.count < 2 cannot happen as this means that
1662 * the rule is unit */
1663 assert(dq.count > 1);
1666 level = selectandinstall(solv, level, &dq, disablerules, r - solv->rules);
1673 if (level < systemlevel || level == 1)
1674 break; /* trouble */
1675 /* something changed, so look at all rules again */
1679 if (n != solv->nrules) /* ran into trouble, restart */
1682 /* at this point we have a consistent system. now do the extras... */
1688 POOL_DEBUG(SAT_DEBUG_POLICY, "installing recommended packages\n");
1689 queue_empty(&dq); /* recommended packages */
1690 queue_empty(&dqs); /* supplemented packages */
1691 for (i = 1; i < pool->nsolvables; i++)
1693 if (solv->decisionmap[i] < 0)
1695 if (solv->decisionmap[i] > 0)
1697 /* installed, check for recommends */
1698 Id *recp, rec, pp, p;
1699 s = pool->solvables + i;
1700 if (solv->ignorealreadyrecommended && s->repo == solv->installed)
1702 /* XXX need to special case AND ? */
1705 recp = s->repo->idarraydata + s->recommends;
1706 while ((rec = *recp++) != 0)
1709 FOR_PROVIDES(p, pp, rec)
1711 if (solv->decisionmap[p] > 0)
1716 else if (solv->decisionmap[p] == 0)
1718 queue_pushunique(&dq, p);
1726 s = pool->solvables + i;
1727 if (!s->supplements)
1729 if (!pool_installable(pool, s))
1731 if (!solver_is_supplementing(solv, s))
1733 queue_push(&dqs, i);
1737 /* filter out all packages obsoleted by installed packages */
1738 /* this is no longer needed if we have reverse obsoletes */
1739 if ((dqs.count || dq.count) && solv->installed)
1742 Id obs, *obsp, po, ppo;
1744 map_init(&obsmap, pool->nsolvables);
1745 for (p = solv->installed->start; p < solv->installed->end; p++)
1747 s = pool->solvables + p;
1748 if (s->repo != solv->installed || !s->obsoletes)
1750 if (solv->decisionmap[p] <= 0)
1752 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
1754 obsp = s->repo->idarraydata + s->obsoletes;
1755 /* foreach obsoletes */
1756 while ((obs = *obsp++) != 0)
1757 FOR_PROVIDES(po, ppo, obs)
1758 MAPSET(&obsmap, po);
1760 for (i = j = 0; i < dqs.count; i++)
1761 if (!MAPTST(&obsmap, dqs.elements[i]))
1762 dqs.elements[j++] = dqs.elements[i];
1764 for (i = j = 0; i < dq.count; i++)
1765 if (!MAPTST(&obsmap, dq.elements[i]))
1766 dq.elements[j++] = dq.elements[i];
1771 /* filter out all already supplemented packages if requested */
1772 if (solv->ignorealreadyrecommended && dqs.count)
1774 /* turn off all new packages */
1775 for (i = 0; i < solv->decisionq.count; i++)
1777 p = solv->decisionq.elements[i];
1780 s = pool->solvables + p;
1781 if (s->repo && s->repo != solv->installed)
1782 solv->decisionmap[p] = -solv->decisionmap[p];
1784 /* filter out old supplements */
1785 for (i = j = 0; i < dqs.count; i++)
1787 p = dqs.elements[i];
1788 s = pool->solvables + p;
1789 if (!s->supplements)
1791 if (!solver_is_supplementing(solv, s))
1792 dqs.elements[j++] = p;
1795 /* undo turning off */
1796 for (i = 0; i < solv->decisionq.count; i++)
1798 p = solv->decisionq.elements[i];
1801 s = pool->solvables + p;
1802 if (s->repo && s->repo != solv->installed)
1803 solv->decisionmap[p] = -solv->decisionmap[p];
1807 /* multiversion doesn't mix well with supplements.
1808 * filter supplemented packages where we already decided
1809 * to install a different version (see bnc#501088) */
1810 if (dqs.count && solv->noobsoletes.size)
1812 for (i = j = 0; i < dqs.count; i++)
1814 p = dqs.elements[i];
1815 if (MAPTST(&solv->noobsoletes, p))
1818 s = pool->solvables + p;
1819 FOR_PROVIDES(p2, pp2, s->name)
1820 if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name)
1823 continue; /* ignore this package */
1825 dqs.elements[j++] = p;
1830 /* make dq contain both recommended and supplemented pkgs */
1833 for (i = 0; i < dqs.count; i++)
1834 queue_pushunique(&dq, dqs.elements[i]);
1840 int decisioncount = solv->decisionq.count;
1844 /* simple case, just one package. no need to choose */
1847 POOL_DEBUG(SAT_DEBUG_POLICY, "installing supplemented %s\n", solvid2str(pool, p));
1849 POOL_DEBUG(SAT_DEBUG_POLICY, "installing recommended %s\n", solvid2str(pool, p));
1850 queue_push(&solv->recommendations, p);
1851 level = setpropagatelearn(solv, level, p, 0, 0);
1852 continue; /* back to main loop */
1855 /* filter packages, this gives us the best versions */
1856 policy_filter_unwanted(solv, &dq, POLICY_MODE_RECOMMEND);
1858 /* create map of result */
1859 map_init(&dqmap, pool->nsolvables);
1860 for (i = 0; i < dq.count; i++)
1861 MAPSET(&dqmap, dq.elements[i]);
1863 /* install all supplemented packages */
1864 for (i = 0; i < dqs.count; i++)
1866 p = dqs.elements[i];
1867 if (solv->decisionmap[p] || !MAPTST(&dqmap, p))
1869 POOL_DEBUG(SAT_DEBUG_POLICY, "installing supplemented %s\n", solvid2str(pool, p));
1870 queue_push(&solv->recommendations, p);
1872 level = setpropagatelearn(solv, level, p, 0, 0);
1873 if (level <= olevel)
1876 if (i < dqs.count || solv->decisionq.count < decisioncount)
1882 /* install all recommended packages */
1883 /* more work as we want to created branches if multiple
1884 * choices are valid */
1885 for (i = 0; i < decisioncount; i++)
1888 p = solv->decisionq.elements[i];
1891 s = pool->solvables + p;
1892 if (!s->repo || (solv->ignorealreadyrecommended && s->repo == solv->installed))
1896 recp = s->repo->idarraydata + s->recommends;
1897 while ((rec = *recp++) != 0)
1900 FOR_PROVIDES(p, pp, rec)
1902 if (solv->decisionmap[p] > 0)
1907 else if (solv->decisionmap[p] == 0 && MAPTST(&dqmap, p))
1908 queue_pushunique(&dq, p);
1914 /* multiple candidates, open a branch */
1915 for (i = 1; i < dq.count; i++)
1916 queue_push(&solv->branches, dq.elements[i]);
1917 queue_push(&solv->branches, -level);
1920 POOL_DEBUG(SAT_DEBUG_POLICY, "installing recommended %s\n", solvid2str(pool, p));
1921 queue_push(&solv->recommendations, p);
1923 level = setpropagatelearn(solv, level, p, 0, 0);
1924 if (level <= olevel || solv->decisionq.count < decisioncount)
1925 break; /* we had to revert some decisions */
1928 break; /* had a problem above, quit loop */
1932 continue; /* back to main loop so that all deps are checked */
1936 if (solv->distupgrade && solv->installed)
1938 int installedone = 0;
1940 /* let's see if we can install some unsupported package */
1941 POOL_DEBUG(SAT_DEBUG_SOLVER, "deciding orphaned packages\n");
1942 for (i = 0; i < solv->orphaned.count; i++)
1944 p = solv->orphaned.elements[i];
1945 if (solv->decisionmap[p])
1946 continue; /* already decided */
1948 if (solv->distupgrade_removeunsupported)
1950 if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))
1952 POOL_DEBUG(SAT_DEBUG_SOLVER, "keeping orphaned %s\n", solvid2str(pool, p));
1953 level = setpropagatelearn(solv, level, p, 0, 0);
1958 if (installedone || i < solv->orphaned.count)
1959 continue; /* back to main loop */
1960 for (i = 0; i < solv->orphaned.count; i++)
1962 p = solv->orphaned.elements[i];
1963 if (solv->decisionmap[p])
1964 continue; /* already decided */
1965 POOL_DEBUG(SAT_DEBUG_SOLVER, "removing orphaned %s\n", solvid2str(pool, p));
1967 level = setpropagatelearn(solv, level, -p, 0, 0);
1971 if (i < solv->orphaned.count)
1972 continue; /* back to main loop */
1975 if (solv->solution_callback)
1977 solv->solution_callback(solv, solv->solution_callback_data);
1978 if (solv->branches.count)
1980 int i = solv->branches.count - 1;
1981 int l = -solv->branches.elements[i];
1985 if (solv->branches.elements[i - 1] < 0)
1987 p = solv->branches.elements[i];
1988 POOL_DEBUG(SAT_DEBUG_SOLVER, "branching with %s\n", solvid2str(pool, p));
1990 for (j = i + 1; j < solv->branches.count; j++)
1991 queue_push(&dq, solv->branches.elements[j]);
1992 solv->branches.count = i;
1994 revert(solv, level);
1996 for (j = 0; j < dq.count; j++)
1997 queue_push(&solv->branches, dq.elements[j]);
1999 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2001 level = setpropagatelearn(solv, level, p, disablerules, why);
2010 /* all branches done, we're finally finished */
2014 /* minimization step */
2015 if (solv->branches.count)
2017 int l = 0, lasti = -1, lastl = -1;
2021 for (i = solv->branches.count - 1; i >= 0; i--)
2023 p = solv->branches.elements[i];
2026 else if (p > 0 && solv->decisionmap[p] > l + 1)
2034 /* kill old solvable so that we do not loop */
2035 p = solv->branches.elements[lasti];
2036 solv->branches.elements[lasti] = 0;
2037 POOL_DEBUG(SAT_DEBUG_SOLVER, "minimizing %d -> %d with %s\n", solv->decisionmap[p], lastl, solvid2str(pool, p));
2038 minimizationsteps++;
2041 revert(solv, level);
2042 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2045 level = setpropagatelearn(solv, level, p, disablerules, why);
2052 continue; /* back to main loop */
2055 /* no minimization found, we're finally finished! */
2059 POOL_DEBUG(SAT_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable, %d minimization steps\n", solv->stats_learned, solv->stats_unsolvable, minimizationsteps);
2061 POOL_DEBUG(SAT_DEBUG_STATS, "done solving.\n\n");
2065 solver_printdecisionq(solv, SAT_DEBUG_RESULT);
2070 /*-------------------------------------------------------------------
2072 * remove disabled conflicts
2074 * purpose: update the decisionmap after some rules were disabled.
2075 * this is used to calculate the suggested/recommended package list.
2076 * Also returns a "removed" list to undo the discisionmap changes.
2080 removedisabledconflicts(Solver *solv, Queue *removed)
2082 Pool *pool = solv->pool;
2087 Id *decisionmap = solv->decisionmap;
2089 POOL_DEBUG(SAT_DEBUG_SCHUBI, "removedisabledconflicts\n");
2090 queue_empty(removed);
2091 for (i = 0; i < solv->decisionq.count; i++)
2093 p = solv->decisionq.elements[i];
2095 continue; /* conflicts only, please */
2096 why = solv->decisionq_why.elements[i];
2099 /* no rule involved, must be a orphan package drop */
2102 /* we never do conflicts on free decisions, so there
2103 * must have been an unit rule */
2105 r = solv->rules + why;
2106 if (r->d < 0 && decisionmap[-p])
2108 /* rule is now disabled, remove from decisionmap */
2109 POOL_DEBUG(SAT_DEBUG_SCHUBI, "removing conflict for package %s[%d]\n", solvid2str(pool, -p), -p);
2110 queue_push(removed, -p);
2111 queue_push(removed, decisionmap[-p]);
2112 decisionmap[-p] = 0;
2115 if (!removed->count)
2117 /* we removed some confliced packages. some of them might still
2118 * be in conflict, so search for unit rules and re-conflict */
2120 for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
2122 if (i == solv->nrules)
2125 r = solv->rules + i;
2131 if (r->p < 0 && !decisionmap[-r->p])
2137 if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
2139 else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
2144 if (r->p < 0 && decisionmap[-r->p] == 0)
2146 if (new || DECISIONMAP_FALSE(r->p))
2148 dp = pool->whatprovidesdata + r->d;
2149 while ((p = *dp++) != 0)
2151 if (new && p == new)
2153 if (p < 0 && decisionmap[-p] == 0)
2162 else if (!DECISIONMAP_FALSE(p))
2172 POOL_DEBUG(SAT_DEBUG_SCHUBI, "re-conflicting package %s[%d]\n", solvid2str(pool, -new), -new);
2173 decisionmap[-new] = -1;
2175 n = 0; /* redo all rules */
2181 undo_removedisabledconflicts(Solver *solv, Queue *removed)
2184 for (i = 0; i < removed->count; i += 2)
2185 solv->decisionmap[removed->elements[i]] = removed->elements[i + 1];
2189 /*-------------------------------------------------------------------
2191 * weaken solvable dependencies
2195 weaken_solvable_deps(Solver *solv, Id p)
2200 for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++)
2204 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2205 continue; /* conflict */
2206 queue_push(&solv->weakruleq, i);
2211 /********************************************************************/
2216 findrecommendedsuggested(Solver *solv)
2218 Pool *pool = solv->pool;
2219 Queue redoq, disabledq;
2225 map_init(&obsmap, pool->nsolvables);
2226 if (solv->installed)
2228 Id obs, *obsp, p, po, ppo;
2229 for (p = solv->installed->start; p < solv->installed->end; p++)
2231 s = pool->solvables + p;
2232 if (s->repo != solv->installed || !s->obsoletes)
2234 if (solv->decisionmap[p] <= 0)
2236 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
2238 obsp = s->repo->idarraydata + s->obsoletes;
2239 /* foreach obsoletes */
2240 while ((obs = *obsp++) != 0)
2241 FOR_PROVIDES(po, ppo, obs)
2242 MAPSET(&obsmap, po);
2247 queue_init(&disabledq);
2249 /* disable all erase jobs (including weak "keep uninstalled" rules) */
2250 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
2252 if (r->d < 0) /* disabled ? */
2254 if (r->p >= 0) /* install job? */
2256 queue_push(&disabledq, i);
2257 solver_disablerule(solv, r);
2263 enabledisablelearntrules(solv);
2264 removedisabledconflicts(solv, &redoq);
2268 * find recommended packages
2271 /* if redoq.count == 0 we already found all recommended in the
2273 if (redoq.count || solv->dontinstallrecommended || !solv->dontshowinstalledrecommended || solv->ignorealreadyrecommended)
2275 Id rec, *recp, p, pp;
2277 /* create map of all recommened packages */
2278 solv->recommends_index = -1;
2279 MAPZERO(&solv->recommendsmap);
2280 for (i = 0; i < solv->decisionq.count; i++)
2282 p = solv->decisionq.elements[i];
2285 s = pool->solvables + p;
2288 recp = s->repo->idarraydata + s->recommends;
2289 while ((rec = *recp++) != 0)
2291 FOR_PROVIDES(p, pp, rec)
2292 if (solv->decisionmap[p] > 0)
2296 if (!solv->dontshowinstalledrecommended)
2298 FOR_PROVIDES(p, pp, rec)
2299 if (solv->decisionmap[p] > 0)
2300 MAPSET(&solv->recommendsmap, p);
2302 continue; /* p != 0: already fulfilled */
2304 FOR_PROVIDES(p, pp, rec)
2305 MAPSET(&solv->recommendsmap, p);
2309 for (i = 1; i < pool->nsolvables; i++)
2311 if (solv->decisionmap[i] < 0)
2313 if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
2315 if (MAPTST(&obsmap, i))
2317 s = pool->solvables + i;
2318 if (!MAPTST(&solv->recommendsmap, i))
2320 if (!s->supplements)
2322 if (!pool_installable(pool, s))
2324 if (!solver_is_supplementing(solv, s))
2327 if (solv->dontinstallrecommended)
2328 queue_push(&solv->recommendations, i);
2330 queue_pushunique(&solv->recommendations, i);
2332 /* we use MODE_SUGGEST here so that repo prio is ignored */
2333 policy_filter_unwanted(solv, &solv->recommendations, POLICY_MODE_SUGGEST);
2337 * find suggested packages
2342 Id sug, *sugp, p, pp;
2344 /* create map of all suggests that are still open */
2345 solv->recommends_index = -1;
2346 MAPZERO(&solv->suggestsmap);
2347 for (i = 0; i < solv->decisionq.count; i++)
2349 p = solv->decisionq.elements[i];
2352 s = pool->solvables + p;
2355 sugp = s->repo->idarraydata + s->suggests;
2356 while ((sug = *sugp++) != 0)
2358 FOR_PROVIDES(p, pp, sug)
2359 if (solv->decisionmap[p] > 0)
2363 if (!solv->dontshowinstalledrecommended)
2365 FOR_PROVIDES(p, pp, sug)
2366 if (solv->decisionmap[p] > 0)
2367 MAPSET(&solv->suggestsmap, p);
2369 continue; /* already fulfilled */
2371 FOR_PROVIDES(p, pp, sug)
2372 MAPSET(&solv->suggestsmap, p);
2376 for (i = 1; i < pool->nsolvables; i++)
2378 if (solv->decisionmap[i] < 0)
2380 if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
2382 if (MAPTST(&obsmap, i))
2384 s = pool->solvables + i;
2385 if (!MAPTST(&solv->suggestsmap, i))
2389 if (!pool_installable(pool, s))
2391 if (!solver_is_enhancing(solv, s))
2394 queue_push(&solv->suggestions, i);
2396 policy_filter_unwanted(solv, &solv->suggestions, POLICY_MODE_SUGGEST);
2399 /* undo removedisabledconflicts */
2401 undo_removedisabledconflicts(solv, &redoq);
2404 /* undo job rule disabling */
2405 for (i = 0; i < disabledq.count; i++)
2406 solver_enablerule(solv, solv->rules + disabledq.elements[i]);
2407 queue_free(&disabledq);
2412 solver_calculate_noobsmap(Pool *pool, Queue *job, Map *noobsmap)
2415 Id how, what, select;
2417 for (i = 0; i < job->count; i += 2)
2419 how = job->elements[i];
2420 if ((how & SOLVER_JOBMASK) != SOLVER_NOOBSOLETES)
2422 what = job->elements[i + 1];
2423 select = how & SOLVER_SELECTMASK;
2424 if (!noobsmap->size)
2425 map_grow(noobsmap, pool->nsolvables);
2426 FOR_JOB_SELECT(p, pp, select, what)
2427 MAPSET(noobsmap, p);
2432 * add a rule created by a job, record job number and weak flag
2435 solver_addjobrule(Solver *solv, Id p, Id d, Id job, int weak)
2437 solver_addrule(solv, p, d);
2438 queue_push(&solv->ruletojob, job);
2440 queue_push(&solv->weakruleq, solv->nrules - 1);
2450 solver_solve(Solver *solv, Queue *job)
2452 Pool *pool = solv->pool;
2453 Repo *installed = solv->installed;
2456 Map addedmap; /* '1' == have rpm-rules for solvable */
2457 Map installcandidatemap;
2458 Id how, what, select, name, weak, p, pp, d;
2462 int now, solve_start;
2465 solve_start = sat_timems(0);
2467 /* log solver options */
2468 POOL_DEBUG(SAT_DEBUG_STATS, "solver started\n");
2469 POOL_DEBUG(SAT_DEBUG_STATS, "fixsystem=%d updatesystem=%d dosplitprovides=%d, noupdateprovide=%d noinfarchcheck=%d\n", solv->fixsystem, solv->updatesystem, solv->dosplitprovides, solv->noupdateprovide, solv->noinfarchcheck);
2470 POOL_DEBUG(SAT_DEBUG_STATS, "distupgrade=%d distupgrade_removeunsupported=%d\n", solv->distupgrade, solv->distupgrade_removeunsupported);
2471 POOL_DEBUG(SAT_DEBUG_STATS, "allowuninstall=%d, allowdowngrade=%d, allowarchchange=%d, allowvendorchange=%d\n", solv->allowuninstall, solv->allowdowngrade, solv->allowarchchange, solv->allowvendorchange);
2472 POOL_DEBUG(SAT_DEBUG_STATS, "promoteepoch=%d, novirtualconflicts=%d, allowselfconflicts=%d\n", pool->promoteepoch, pool->novirtualconflicts, pool->allowselfconflicts);
2473 POOL_DEBUG(SAT_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d, obsoleteusescolors=%d\n", pool->obsoleteusesprovides, pool->implicitobsoleteusesprovides, pool->obsoleteusescolors);
2474 POOL_DEBUG(SAT_DEBUG_STATS, "dontinstallrecommended=%d, ignorealreadyrecommended=%d, dontshowinstalledrecommended=%d\n", solv->dontinstallrecommended, solv->ignorealreadyrecommended, solv->dontshowinstalledrecommended);
2476 /* create whatprovides if not already there */
2477 if (!pool->whatprovides)
2478 pool_createwhatprovides(pool);
2480 /* create obsolete index */
2481 policy_create_obsolete_index(solv);
2484 queue_free(&solv->job);
2485 queue_init_clone(&solv->job, job);
2488 * create basic rule set of all involved packages
2489 * use addedmap bitmap to make sure we don't create rules twice
2492 /* create noobsolete map if needed */
2493 solver_calculate_noobsmap(pool, job, &solv->noobsoletes);
2495 map_init(&addedmap, pool->nsolvables);
2496 MAPSET(&addedmap, SYSTEMSOLVABLE);
2498 map_init(&installcandidatemap, pool->nsolvables);
2501 now = sat_timems(0);
2503 * create rules for all package that could be involved with the solving
2504 * so called: rpm rules
2509 /* check for verify jobs */
2510 for (i = 0; i < job->count; i += 2)
2512 how = job->elements[i];
2513 what = job->elements[i + 1];
2514 select = how & SOLVER_SELECTMASK;
2515 switch (how & SOLVER_JOBMASK)
2518 FOR_JOB_SELECT(p, pp, select, what)
2520 s = pool->solvables + p;
2521 if (!solv->installed || s->repo != solv->installed)
2523 if (!solv->fixmap.size)
2524 map_grow(&solv->fixmap, solv->installed->end - solv->installed->start);
2525 MAPSET(&solv->fixmap, p - solv->installed->start);
2533 oldnrules = solv->nrules;
2534 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for installed solvables ***\n");
2535 FOR_REPO_SOLVABLES(installed, p, s)
2536 solver_addrpmrulesforsolvable(solv, s, &addedmap);
2537 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
2538 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for updaters of installed solvables ***\n");
2539 oldnrules = solv->nrules;
2540 FOR_REPO_SOLVABLES(installed, p, s)
2541 solver_addrpmrulesforupdaters(solv, s, &addedmap, 1);
2542 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
2546 * create rules for all packages involved in the job
2547 * (to be installed or removed)
2550 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for packages involved with a job ***\n");
2551 oldnrules = solv->nrules;
2552 for (i = 0; i < job->count; i += 2)
2554 how = job->elements[i];
2555 what = job->elements[i + 1];
2556 select = how & SOLVER_SELECTMASK;
2558 switch (how & SOLVER_JOBMASK)
2560 case SOLVER_INSTALL:
2561 FOR_JOB_SELECT(p, pp, select, what)
2563 MAPSET(&installcandidatemap, p);
2564 solver_addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
2567 case SOLVER_DISTUPGRADE:
2568 if (!solv->distupgrade)
2575 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
2579 * add rules for suggests, enhances
2581 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for suggested/enhanced packages ***\n");
2582 oldnrules = solv->nrules;
2583 solver_addrpmrulesforweak(solv, &addedmap);
2584 POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
2587 * first pass done, we now have all the rpm rules we need.
2588 * unify existing rules before going over all job rules and
2590 * at this point the system is always solvable,
2591 * as an empty system (remove all packages) is a valid solution
2594 IF_POOLDEBUG (SAT_DEBUG_STATS)
2596 int possible = 0, installable = 0;
2597 for (i = 1; i < pool->nsolvables; i++)
2599 if (pool_installable(pool, pool->solvables + i))
2601 if (MAPTST(&addedmap, i))
2604 POOL_DEBUG(SAT_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
2607 solver_unifyrules(solv); /* remove duplicate rpm rules */
2608 solv->rpmrules_end = solv->nrules; /* mark end of rpm rules */
2610 POOL_DEBUG(SAT_DEBUG_STATS, "rpm rule memory usage: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
2611 POOL_DEBUG(SAT_DEBUG_STATS, "rpm rule creation took %d ms\n", sat_timems(now));
2613 /* create dup maps if needed. We need the maps early to create our
2616 solver_createdupmaps(solv);
2619 * create feature rules
2621 * foreach installed:
2622 * create assertion (keep installed, if no update available)
2624 * create update rule (A|update1(A)|update2(A)|...)
2626 * those are used later on to keep a version of the installed packages in
2630 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add feature rules ***\n");
2631 solv->featurerules = solv->nrules; /* mark start of feature rules */
2634 /* foreach possibly installed solvable */
2635 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
2637 if (s->repo != installed)
2639 solver_addrule(solv, 0, 0); /* create dummy rule */
2642 solver_addupdaterule(solv, s, 1); /* allow s to be updated */
2644 /* make sure we accounted for all rules */
2645 assert(solv->nrules - solv->featurerules == installed->end - installed->start);
2647 solv->featurerules_end = solv->nrules;
2650 * Add update rules for installed solvables
2652 * almost identical to feature rules
2653 * except that downgrades/archchanges/vendorchanges are not allowed
2656 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add update rules ***\n");
2657 solv->updaterules = solv->nrules;
2660 { /* foreach installed solvables */
2661 /* we create all update rules, but disable some later on depending on the job */
2662 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
2666 if (s->repo != installed)
2668 solver_addrule(solv, 0, 0); /* create dummy rule */
2671 solver_addupdaterule(solv, s, 0); /* allowall = 0: downgrades not allowed */
2673 * check for and remove duplicate
2675 r = solv->rules + solv->nrules - 1; /* r: update rule */
2676 sr = r - (installed->end - installed->start); /* sr: feature rule */
2677 /* it's orphaned if there is no feature rule or the feature rule
2678 * consists just of the installed package */
2679 if (!sr->p || (sr->p == i && !sr->d && !sr->w2))
2680 queue_push(&solv->orphaned, i);
2683 assert(solv->distupgrade && !sr->p);
2686 if (!solver_samerule(solv, r, sr))
2688 /* identical rule, kill unneeded one */
2689 if (solv->allowuninstall)
2691 /* keep feature rule, make it weak */
2692 memset(r, 0, sizeof(*r));
2693 queue_push(&solv->weakruleq, sr - solv->rules);
2697 /* keep update rule */
2698 memset(sr, 0, sizeof(*sr));
2701 else if (solv->allowuninstall)
2703 /* make both feature and update rule weak */
2704 queue_push(&solv->weakruleq, r - solv->rules);
2705 queue_push(&solv->weakruleq, sr - solv->rules);
2708 solver_disablerule(solv, sr);
2710 /* consistency check: we added a rule for _every_ installed solvable */
2711 assert(solv->nrules - solv->updaterules == installed->end - installed->start);
2713 solv->updaterules_end = solv->nrules;
2717 * now add all job rules
2720 POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add JOB rules ***\n");
2722 solv->jobrules = solv->nrules;
2723 for (i = 0; i < job->count; i += 2)
2725 oldnrules = solv->nrules;
2727 how = job->elements[i];
2728 what = job->elements[i + 1];
2729 weak = how & SOLVER_WEAK;
2730 select = how & SOLVER_SELECTMASK;
2731 switch (how & SOLVER_JOBMASK)
2733 case SOLVER_INSTALL:
2734 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2735 if (select == SOLVER_SOLVABLE)
2743 FOR_JOB_SELECT(p, pp, select, what)
2747 /* no candidate found, make this an impossible rule */
2748 queue_push(&q, -SYSTEMSOLVABLE);
2750 p = queue_shift(&q); /* get first candidate */
2751 d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q); /* internalize */
2753 solver_addjobrule(solv, p, d, i, weak);
2756 POOL_DEBUG(SAT_DEBUG_JOB, "job: %s%serase %s\n", weak ? "weak " : "", how & SOLVER_CLEANDEPS ? "clean deps " : "", solver_select2str(solv, select, what));
2757 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && solv->installed)
2758 map_grow(&solv->cleandepsmap, solv->installed->end - solv->installed->start);
2759 if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
2761 /* special case for "erase a specific solvable": we also
2762 * erase all other solvables with that name, so that they
2763 * don't get picked up as replacement */
2764 /* XXX: look also at packages that obsolete this package? */
2765 name = pool->solvables[what].name;
2766 FOR_PROVIDES(p, pp, name)
2770 s = pool->solvables + p;
2771 if (s->name != name)
2773 /* keep other versions installed */
2774 if (s->repo == solv->installed)
2776 /* keep installcandidates of other jobs */
2777 if (MAPTST(&installcandidatemap, p))
2779 solver_addjobrule(solv, -p, 0, i, weak); /* remove by id */
2782 FOR_JOB_SELECT(p, pp, select, what)
2783 solver_addjobrule(solv, -p, 0, i, weak);
2787 POOL_DEBUG(SAT_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2788 FOR_JOB_SELECT(p, pp, select, what)
2790 s = pool->solvables + p;
2791 if (!solv->installed || s->repo != solv->installed)
2793 if (!solv->updatemap.size)
2794 map_grow(&solv->updatemap, solv->installed->end - solv->installed->start);
2795 MAPSET(&solv->updatemap, p - solv->installed->start);
2799 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sverify %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2801 case SOLVER_WEAKENDEPS:
2802 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2803 if (select != SOLVER_SOLVABLE)
2805 s = pool->solvables + what;
2806 weaken_solvable_deps(solv, what);
2808 case SOLVER_NOOBSOLETES:
2809 POOL_DEBUG(SAT_DEBUG_JOB, "job: %sno obsolete %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2812 POOL_DEBUG(SAT_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2813 FOR_JOB_SELECT(p, pp, select, what)
2815 s = pool->solvables + p;
2816 solver_addjobrule(solv, installed && s->repo == installed ? p : -p, 0, i, weak);
2819 case SOLVER_DISTUPGRADE:
2820 POOL_DEBUG(SAT_DEBUG_JOB, "job: distupgrade %s\n", solver_select2str(solv, select, what));
2822 case SOLVER_DROP_ORPHANED:
2823 POOL_DEBUG(SAT_DEBUG_JOB, "job: drop orphaned %s\n", solver_select2str(solv, select, what));
2824 FOR_JOB_SELECT(p, pp, select, what)
2826 s = pool->solvables + p;
2827 if (!installed || s->repo != installed)
2829 if (!solv->droporphanedmap.size)
2830 map_grow(&solv->droporphanedmap, installed->end - installed->start);
2831 MAPSET(&solv->droporphanedmap, p - installed->start);
2834 case SOLVER_USERINSTALLED:
2835 POOL_DEBUG(SAT_DEBUG_JOB, "job: user installed %s\n", solver_select2str(solv, select, what));
2838 POOL_DEBUG(SAT_DEBUG_JOB, "job: unknown job\n");
2846 IF_POOLDEBUG (SAT_DEBUG_JOB)
2849 if (solv->nrules == oldnrules)
2850 POOL_DEBUG(SAT_DEBUG_JOB, " - no rule created\n");
2851 for (j = oldnrules; j < solv->nrules; j++)
2853 POOL_DEBUG(SAT_DEBUG_JOB, " - job ");
2854 solver_printrule(solv, SAT_DEBUG_JOB, solv->rules + j);
2858 assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
2859 solv->jobrules_end = solv->nrules;
2861 /* now create infarch and dup rules */
2862 if (!solv->noinfarchcheck)
2864 solver_addinfarchrules(solv, &addedmap);
2865 if (pool->obsoleteusescolors)
2867 /* currently doesn't work well with infarch rules, so make
2869 for (i = solv->infarchrules; i < solv->infarchrules_end; i++)
2870 queue_push(&solv->weakruleq, i);
2874 solv->infarchrules = solv->infarchrules_end = solv->nrules;
2878 solver_addduprules(solv, &addedmap);
2879 solver_freedupmaps(solv); /* no longer needed */
2882 solv->duprules = solv->duprules_end = solv->nrules;
2886 extern void addchoicerules(Solver *solv);
2887 addchoicerules(solv);
2890 solv->choicerules = solv->choicerules_end = solv->nrules;
2892 /* all rules created
2893 * --------------------------------------------------------------
2894 * prepare for solving
2897 /* free unneeded memory */
2898 map_free(&addedmap);
2899 map_free(&installcandidatemap);
2902 POOL_DEBUG(SAT_DEBUG_STATS, "%d rpm rules, %d job rules, %d infarch rules, %d dup rules, %d choice rules\n", solv->rpmrules_end - 1, solv->jobrules_end - solv->jobrules, solv->infarchrules_end - solv->infarchrules, solv->duprules_end - solv->duprules, solv->choicerules_end - solv->choicerules);
2904 /* create weak map */
2905 map_init(&solv->weakrulemap, solv->nrules);
2906 for (i = 0; i < solv->weakruleq.count; i++)
2908 p = solv->weakruleq.elements[i];
2909 MAPSET(&solv->weakrulemap, p);
2912 /* all new rules are learnt after this point */
2913 solv->learntrules = solv->nrules;
2915 /* create watches chains */
2918 /* create assertion index. it is only used to speed up
2919 * makeruledecsions() a bit */
2920 for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
2921 if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
2922 queue_push(&solv->ruleassertions, i);
2924 /* disable update rules that conflict with our job */
2925 solver_disablepolicyrules(solv);
2927 /* make decisions based on job/update assertions */
2928 makeruledecisions(solv);
2929 POOL_DEBUG(SAT_DEBUG_SOLVER, "problems so far: %d\n", solv->problems.count);
2932 * ********************************************
2934 * ********************************************
2937 now = sat_timems(0);
2938 solver_run_sat(solv, 1, solv->dontinstallrecommended ? 0 : 1);
2939 POOL_DEBUG(SAT_DEBUG_STATS, "solver took %d ms\n", sat_timems(now));
2942 * calculate recommended/suggested packages
2944 findrecommendedsuggested(solv);
2947 * prepare solution queue if there were problems
2949 solver_prepare_solutions(solv);
2952 * finally prepare transaction info
2954 transaction_calculate(&solv->trans, &solv->decisionq, &solv->noobsoletes);
2956 POOL_DEBUG(SAT_DEBUG_STATS, "final solver statistics: %d problems, %d learned rules, %d unsolvable\n", solv->problems.count / 2, solv->stats_learned, solv->stats_unsolvable);
2957 POOL_DEBUG(SAT_DEBUG_STATS, "solver_solve took %d ms\n", sat_timems(solve_start));
2960 /***********************************************************************/
2961 /* disk usage computations */
2963 /*-------------------------------------------------------------------
2965 * calculate DU changes
2969 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
2973 solver_create_state_maps(solv, &installedmap, 0);
2974 pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
2975 map_free(&installedmap);
2979 /*-------------------------------------------------------------------
2981 * calculate changes in install size
2985 solver_calc_installsizechange(Solver *solv)
2990 solver_create_state_maps(solv, &installedmap, 0);
2991 change = pool_calc_installsizechange(solv->pool, &installedmap);
2992 map_free(&installedmap);
2997 solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res)
3000 solver_create_state_maps(solv, &installedmap, 0);
3001 pool_trivial_installable_noobsoletesmap(solv->pool, &installedmap, pkgs, res, solv->noobsoletes.size ? &solv->noobsoletes : 0);
3002 map_free(&installedmap);