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
21 #include "solver_private.h"
27 #include "solverdebug.h"
29 #include "linkedpkg.h"
31 #define RULES_BLOCK 63
34 /************************************************************************/
37 * enable/disable learnt rules
39 * we have enabled or disabled some of our rules. We now reenable all
40 * of our learnt rules except the ones that were learnt from rules that
44 enabledisablelearntrules(Solver *solv)
46 Pool *pool = solv->pool;
51 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "enabledisablelearntrules called\n");
52 for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
54 whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules];
55 while ((why = *whyp++) != 0)
57 assert(why > 0 && why < i);
58 if (solv->rules[why].d < 0)
61 /* why != 0: we found a disabled rule, disable the learnt rule */
64 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
66 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "disabling ");
67 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
69 solver_disablerule(solv, r);
71 else if (!why && r->d < 0)
73 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
75 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "re-enabling ");
76 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
78 solver_enablerule(solv, r);
85 * make assertion rules into decisions
87 * Go through rules and add direct assertions to the decisionqueue.
88 * If we find a conflict, disable rules and add them to problem queue.
92 makeruledecisions(Solver *solv, int disablerules)
94 Pool *pool = solv->pool;
101 int havedisabled = 0;
104 /* The system solvable is always installed first */
105 assert(solv->decisionq.count == 0);
106 queue_push(&solv->decisionq, SYSTEMSOLVABLE);
107 queue_push(&solv->decisionq_why, 0);
108 queue_push2(&solv->decisionq_reason, 0, 0);
109 solv->decisionmap[SYSTEMSOLVABLE] = 1; /* installed at level '1' */
111 decisionstart = solv->decisionq.count;
114 /* if we needed to re-run, back up decisions to decisionstart */
115 while (solv->decisionq.count > decisionstart)
117 v = solv->decisionq.elements[--solv->decisionq.count];
118 --solv->decisionq_why.count;
120 solv->decisionmap[vv] = 0;
123 /* note that the ruleassertions queue is ordered */
124 for (ii = 0; ii < solv->ruleassertions.count; ii++)
126 ri = solv->ruleassertions.elements[ii];
127 r = solv->rules + ri;
129 if (havedisabled && ri >= solv->learntrules)
131 /* just started with learnt rule assertions. If we have disabled
132 * some rules, adapt the learnt rule status */
133 enabledisablelearntrules(solv);
137 if (r->d < 0 || !r->p || r->w2) /* disabled, dummy or no assertion */
140 /* do weak rules in phase 2 */
141 if (ri < solv->learntrules && solv->weakrulemap.size && MAPTST(&solv->weakrulemap, ri))
147 if (!solv->decisionmap[vv]) /* if not yet decided */
149 queue_push(&solv->decisionq, v);
150 queue_push(&solv->decisionq_why, ri);
151 solv->decisionmap[vv] = v > 0 ? 1 : -1;
152 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
154 Solvable *s = solv->pool->solvables + vv;
156 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", pool_solvable2str(solv->pool, s));
158 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (assertion)\n", pool_solvable2str(solv->pool, s));
163 /* check against previous decision: is there a conflict? */
164 if (v > 0 && solv->decisionmap[vv] > 0) /* ok to install */
166 if (v < 0 && solv->decisionmap[vv] < 0) /* ok to remove */
172 * The rule (r) we're currently processing says something
173 * different (v = r->p) than a previous decision (decisionmap[abs(v)])
177 if (ri >= solv->learntrules)
179 /* conflict with a learnt rule */
180 /* can happen when packages cannot be installed for multiple reasons. */
181 /* we disable the learnt rule in this case */
182 /* (XXX: we should really do something like analyze_unsolvable_rule here!) */
183 solver_disablerule(solv, r);
187 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ASSERTION ----------------------\n");
188 assert(ri >= solv->pkgrules_end); /* must not have a conflict in the pkg rules! */
191 * find the decision which is the "opposite" of the rule
193 for (i = 0; i < solv->decisionq.count; i++)
194 if (solv->decisionq.elements[i] == -v)
196 assert(i < solv->decisionq.count); /* assert that we found it */
197 if (v == -SYSTEMSOLVABLE)
201 ori = solv->decisionq_why.elements[i]; /* the conflicting rule */
209 oldproblemcount = solv->problems.count;
210 queue_push(&solv->problems, 0); /* start problem */
211 if (ori < solv->pkgrules_end)
213 /* easy: conflict with system solvable or pkg rule */
214 assert(v > 0 || v == -SYSTEMSOLVABLE);
215 IF_POOLDEBUG (SOLV_DEBUG_UNSOLVABLE)
218 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with pkg rule, disabling rule #%d\n", ri);
220 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with system solvable, disabling rule #%d\n", ri);
221 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + ri);
223 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + ori);
225 solver_recordproblem(solv, ri);
226 if (ri >= solv->featurerules && ri < solv->updaterules_end)
231 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflicting update/job assertions over literal %d\n", vv);
233 * push all of our rules (can only be feature or job rules)
234 * asserting this literal on the problem stack
236 for (i = solv->pkgrules_end, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
238 if (rr->d < 0 /* disabled */
239 || rr->w2) /* or no assertion */
241 if (rr->p != vv /* not affecting the literal */
244 if (solv->weakrulemap.size && MAPTST(&solv->weakrulemap, i)) /* weak: silently ignore */
247 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, " - disabling rule #%d\n", i);
248 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + i);
249 solver_recordproblem(solv, i);
250 if (i >= solv->featurerules && i < solv->updaterules_end)
254 queue_push(&solv->problems, 0); /* finish problem */
256 /* try autouninstall if requested */
259 if (solv->allowuninstall || solv->allowuninstall_all || solv->allowuninstallmap.size)
260 if (solver_autouninstall(solv, oldproblemcount) != 0)
262 solv->problems.count = oldproblemcount;
264 break; /* start over */
268 /* record the proof if requested */
271 solv->problems.elements[oldproblemcount] = solv->learnt_pool.count;
272 queue_push(&solv->learnt_pool, ri);
274 queue_push(&solv->learnt_pool, ori);
275 queue_push(&solv->learnt_pool, 0);
280 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
283 /* disable all problem rules */
284 solver_disableproblemset(solv, oldproblemcount);
286 break; /* start over */
288 if (ii < solv->ruleassertions.count)
292 * phase 2: now do the weak assertions
294 if (!solv->weakrulemap.size)
295 break; /* no weak rules, no phase 2 */
296 for (ii = 0; ii < solv->ruleassertions.count; ii++)
298 ri = solv->ruleassertions.elements[ii];
299 r = solv->rules + ri;
300 if (r->d < 0 || r->w2) /* disabled or no assertion */
302 if (ri >= solv->learntrules || !MAPTST(&solv->weakrulemap, ri)) /* skip non-weak */
307 if (!solv->decisionmap[vv]) /* if not yet decided */
309 queue_push(&solv->decisionq, v);
310 queue_push(&solv->decisionq_why, r - solv->rules);
311 solv->decisionmap[vv] = v > 0 ? 1 : -1;
312 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
314 Solvable *s = solv->pool->solvables + vv;
316 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
318 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
322 /* check against previous decision: is there a conflict? */
323 if (v > 0 && solv->decisionmap[vv] > 0)
325 if (v < 0 && solv->decisionmap[vv] < 0)
328 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "assertion conflict, but I am weak, disabling ");
329 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
330 solver_fixproblem(solv, ri);
332 break; /* start over */
334 if (ii == solv->ruleassertions.count)
335 break; /* finished! */
337 return 1; /* the new level */
341 /********************************************************************/
345 /*-------------------------------------------------------------------
348 * initial setup for all watches
352 makewatches(Solver *solv)
356 int nsolvables = solv->pool->nsolvables;
358 solv_free(solv->watches);
359 /* lower half for removals, upper half for installs */
360 solv->watches = solv_calloc(2 * nsolvables, sizeof(Id));
361 for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
363 if (!r->w2) /* assertions do not need watches */
366 /* see addwatches_rule(solv, r) */
367 r->n1 = solv->watches[nsolvables + r->w1];
368 solv->watches[nsolvables + r->w1] = r - solv->rules;
370 r->n2 = solv->watches[nsolvables + r->w2];
371 solv->watches[nsolvables + r->w2] = r - solv->rules;
376 /*-------------------------------------------------------------------
378 * add watches (for a new learned rule)
379 * sets up watches for a single rule
381 * see also makewatches() above.
385 addwatches_rule(Solver *solv, Rule *r)
387 int nsolvables = solv->pool->nsolvables;
389 r->n1 = solv->watches[nsolvables + r->w1];
390 solv->watches[nsolvables + r->w1] = r - solv->rules;
392 r->n2 = solv->watches[nsolvables + r->w2];
393 solv->watches[nsolvables + r->w2] = r - solv->rules;
397 /********************************************************************/
403 /* shortcuts to check if a literal (positive or negative) assignment
404 * evaluates to 'true' or 'false'
406 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
407 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
408 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
410 /*-------------------------------------------------------------------
414 * make decision and propagate to all rules
416 * Evaluate each term affected by the decision (linked through watches).
417 * If we find unit rules we make new decisions based on them.
419 * return : 0 = everything is OK
420 * rule = conflict found in this rule
424 propagate(Solver *solv, int level)
426 Pool *pool = solv->pool;
427 Id *rp, *next_rp; /* rule pointer, next rule pointer in linked list */
429 Id p, pkg, other_watch;
431 Id *decisionmap = solv->decisionmap;
432 Id *watches = solv->watches + pool->nsolvables; /* place ptr in middle */
434 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate level %d -----\n", level);
436 /* foreach non-propagated decision */
437 while (solv->propagate_index < solv->decisionq.count)
440 * 'pkg' was just decided
441 * negate because our watches trigger if literal goes FALSE
443 pkg = -solv->decisionq.elements[solv->propagate_index++];
445 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
447 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagate decision %d:", -pkg);
448 solver_printruleelement(solv, SOLV_DEBUG_PROPAGATE, 0, -pkg);
451 /* foreach rule where 'pkg' is now FALSE */
452 for (rp = watches + pkg; *rp; rp = next_rp)
454 r = solv->rules + *rp;
457 /* rule is disabled, goto next */
465 IF_POOLDEBUG (SOLV_DEBUG_WATCHES)
467 POOL_DEBUG(SOLV_DEBUG_WATCHES, " watch triggered ");
468 solver_printrule(solv, SOLV_DEBUG_WATCHES, r);
472 * 'pkg' was just decided (was set to FALSE), so this rule
475 /* find the other watch */
488 * if the other watch is true we have nothing to do
490 if (DECISIONMAP_TRUE(other_watch))
494 * The other literal is FALSE or UNDEF
500 /* Not a binary clause, try to move our watch.
502 * Go over all literals and find one that is
506 * (TRUE is also ok, in that case the rule is fulfilled)
507 * As speed matters here we do not use the FOR_RULELITERALS
510 if (r->p /* we have a 'p' */
511 && r->p != other_watch /* which is not watched */
512 && !DECISIONMAP_FALSE(r->p)) /* and not FALSE */
516 else /* go find a 'd' to make 'true' */
519 we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
521 for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
523 if (p != other_watch /* which is not watched */
524 && !DECISIONMAP_FALSE(p)) /* and not FALSE */
532 * if we found some p that is UNDEF or TRUE, move
535 IF_POOLDEBUG (SOLV_DEBUG_WATCHES)
538 POOL_DEBUG(SOLV_DEBUG_WATCHES, " -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, p));
540 POOL_DEBUG(SOLV_DEBUG_WATCHES, " -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, -p));
556 watches[p] = r - solv->rules;
559 /* search failed, thus all unwatched literals are FALSE */
564 * unit clause found, set literal other_watch to TRUE
567 if (DECISIONMAP_FALSE(other_watch)) /* check if literal is FALSE */
568 return r; /* eek, a conflict! */
570 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
572 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " unit ");
573 solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
577 decisionmap[other_watch] = level; /* install! */
579 decisionmap[-other_watch] = -level; /* remove! */
581 queue_push(&solv->decisionq, other_watch);
582 queue_push(&solv->decisionq_why, r - solv->rules);
584 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
587 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to install %s\n", pool_solvid2str(pool, other_watch));
589 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to conflict %s\n", pool_solvid2str(pool, -other_watch));
592 } /* foreach rule involving 'pkg' */
594 } /* while we have non-decided decisions */
596 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate end -----\n");
598 return 0; /* all is well */
602 /********************************************************************/
605 /*-------------------------------------------------------------------
608 * revert decisionq to a level
612 revert(Solver *solv, int level)
614 Pool *pool = solv->pool;
616 while (solv->decisionq.count)
618 v = solv->decisionq.elements[solv->decisionq.count - 1];
620 if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
622 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
623 solv->decisionmap[vv] = 0;
624 solv->decisionq.count--;
625 solv->decisionq_why.count--;
626 solv->propagate_index = solv->decisionq.count;
628 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= level)
629 solv->branches.count -= solv->branches.elements[solv->branches.count - 2];
630 if (solv->recommends_index > solv->decisionq.count)
631 solv->recommends_index = -1; /* rebuild recommends/suggests maps */
632 solv->decisionq_reason.count = level + 1;
635 /*-------------------------------------------------------------------
637 * watch2onhighest - put watch2 on literal with highest level
641 watch2onhighest(Solver *solv, Rule *r)
646 d = r->d < 0 ? -r->d - 1 : r->d;
648 return; /* binary rule, both watches are set */
649 dp = solv->pool->whatprovidesdata + d;
650 while ((v = *dp++) != 0)
652 l = solv->decisionmap[v < 0 ? -v : v];
664 /*-------------------------------------------------------------------
671 analyze(Solver *solv, int level, Rule *c, Rule **lrp)
673 Pool *pool = solv->pool;
678 Map seen; /* global? */
679 Id p = 0, pp, v, vv, why;
681 int num = 0, l1num = 0;
682 int learnt_why = solv->learnt_pool.count;
683 Id *decisionmap = solv->decisionmap;
685 queue_init_buffer(&q, q_buf, sizeof(q_buf)/sizeof(*q_buf));
687 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
688 map_init(&seen, pool->nsolvables);
689 idx = solv->decisionq.count;
692 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
693 solver_printruleclass(solv, SOLV_DEBUG_ANALYZE, c);
694 queue_push(&solv->learnt_pool, c - solv->rules);
695 FOR_RULELITERALS(v, pp, c)
697 if (DECISIONMAP_TRUE(v)) /* the one true literal */
700 if (MAPTST(&seen, vv))
702 MAPSET(&seen, vv); /* mark that we also need to look at this literal */
703 l = solv->decisionmap[vv];
707 l1num++; /* need to do this one in level1 pass */
709 num++; /* need to do this one as well */
712 queue_push(&q, v); /* not level1 or conflict level, add to new rule */
718 if (!num && !--l1num)
719 break; /* all literals done */
721 /* find the next literal to investigate */
722 /* (as num + l1num > 0, we know that we'll always find one) */
726 v = solv->decisionq.elements[--idx];
728 if (MAPTST(&seen, vv))
733 if (num && --num == 0)
735 /* done with normal literals, now start level 1 literal processing */
736 p = -v; /* so that v doesn't get lost */
739 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
740 /* clear non-l1 bits from seen map */
741 for (i = 0; i < q.count; i++)
744 MAPCLR(&seen, v > 0 ? v : -v);
746 /* only level 1 marks left in seen map */
747 l1num++; /* as l1retry decrements it */
751 why = solv->decisionq_why.elements[idx];
752 if (why <= 0) /* just in case, maybe for SYSTEMSOLVABLE */
754 c = solv->rules + why;
758 assert(rlevel > 0 && rlevel < level);
759 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
761 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
762 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, p);
763 for (i = 0; i < q.count; i++)
764 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, q.elements[i]);
766 /* push end marker on learnt reasons stack */
767 queue_push(&solv->learnt_pool, 0);
768 solv->stats_learned++;
770 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, rlevel);
775 Id d = q.count ? q.elements[0] : 0;
777 r = solver_addrule(solv, p, d, 0);
781 Id d = pool_queuetowhatprovides(pool, &q);
783 r = solver_addrule(solv, p, 0, d);
785 assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
786 queue_push(&solv->learnt_why, learnt_why);
790 watch2onhighest(solv, r);
791 addwatches_rule(solv, r);
795 /* rule is an assertion */
796 queue_push(&solv->ruleassertions, r - solv->rules);
803 /*-------------------------------------------------------------------
807 * reset all solver decisions
808 * called after rules have been enabled/disabled
812 solver_reset(Solver *solv)
817 /* rewind all decisions */
818 for (i = solv->decisionq.count - 1; i >= 0; i--)
820 v = solv->decisionq.elements[i];
821 solv->decisionmap[v > 0 ? v : -v] = 0;
823 queue_empty(&solv->decisionq_why);
824 queue_empty(&solv->decisionq);
825 queue_empty(&solv->decisionq_reason);
826 solv->recommends_index = -1;
827 solv->propagate_index = 0;
828 queue_empty(&solv->branches);
830 /* adapt learnt rule status to new set of enabled/disabled rules */
831 enabledisablelearntrules(solv);
835 queue_contains(Queue *q, Id id)
838 for (i = 0; i < q->count; i++)
839 if (q->elements[i] == id)
845 disable_recommendsrules(Solver *solv, Queue *weakq)
847 Pool *pool = solv->pool;
849 for (i = 0; i < weakq->count; i++)
851 rid = weakq->elements[i];
852 if ((rid >= solv->recommendsrules && rid < solv->recommendsrules_end) || queue_contains(solv->recommendsruleq, rid))
854 Rule *r = solv->rules + rid;
857 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "disabling ");
858 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
859 solver_disablerule(solv, r);
865 /*-------------------------------------------------------------------
867 * analyze_unsolvable_rule
869 * recursion helper used by analyze_unsolvable
873 analyze_unsolvable_rule(Solver *solv, Rule *r, Queue *weakq, Map *rseen)
875 Pool *pool = solv->pool;
877 Id why = r - solv->rules;
879 IF_POOLDEBUG (SOLV_DEBUG_UNSOLVABLE)
880 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
881 if (solv->learntrules && why >= solv->learntrules)
883 if (MAPTST(rseen, why - solv->learntrules))
885 MAPSET(rseen, why - solv->learntrules);
886 for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
887 if (solv->learnt_pool.elements[i] > 0)
888 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], weakq, rseen);
891 if (solv->weakrulemap.size && MAPTST(&solv->weakrulemap, why) && weakq)
892 queue_push(weakq, why);
893 /* add non-pkg rules to problem and disable */
894 if (why >= solv->pkgrules_end)
895 solver_recordproblem(solv, why);
898 /* fix a problem by disabling one or more weak rules */
900 disable_weakrules(Solver *solv, Queue *weakq)
902 Pool *pool = solv->pool;
905 for (i = 0; i < weakq->count; i++)
906 if (weakq->elements[i] > lastweak)
907 lastweak = weakq->elements[i];
908 if (lastweak >= solv->recommendsrules && lastweak < solv->recommendsrules_end)
911 for (i = 0; i < weakq->count; i++)
912 if (weakq->elements[i] < solv->recommendsrules && weakq->elements[i] > lastweak)
913 lastweak = weakq->elements[i];
914 if (lastweak < solv->pkgrules_end)
916 disable_recommendsrules(solv, weakq);
920 if (lastweak < solv->pkgrules_end && solv->strongrecommends && solv->recommendsruleq && queue_contains(solv->recommendsruleq, lastweak))
922 disable_recommendsrules(solv, weakq);
925 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "disabling ");
926 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + lastweak);
927 /* choice rules need special handling */
928 if (lastweak >= solv->choicerules && lastweak < solv->choicerules_end)
929 solver_disablechoicerules(solv, solv->rules + lastweak);
931 solver_fixproblem(solv, lastweak);
934 /*-------------------------------------------------------------------
936 * analyze_unsolvable (called from setpropagatelearn)
938 * We know that the problem is not solvable. Record all involved
939 * rules (i.e. the "proof") into solv->learnt_pool.
940 * Record the learnt pool index and all non-pkg rules into
941 * solv->problems. (Our solutions to fix the problems are to
942 * disable those rules.)
944 * If the proof contains at least one weak rule, we disable the
947 * Otherwise we return -1 if disablerules is not set or disable
948 * _all_ of the problem rules and return 0.
950 * return: 0 - disabled some rules, try again
955 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
957 Pool *pool = solv->pool;
959 Map involved; /* global to speed things up? */
964 Id *decisionmap = solv->decisionmap;
966 int oldlearntpoolcount;
967 int record_proof = 1;
969 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
970 solv->stats_unsolvable++;
971 oldproblemcount = solv->problems.count;
972 oldlearntpoolcount = solv->learnt_pool.count;
974 /* make room for proof index */
975 /* must update it later, as analyze_unsolvable_rule would confuse
976 * it with a rule index if we put the real value in already */
977 queue_push(&solv->problems, 0);
980 map_init(&involved, pool->nsolvables);
981 map_init(&rseen, solv->learntrules ? solv->nrules - solv->learntrules : 0);
984 queue_push(&solv->learnt_pool, r - solv->rules);
985 analyze_unsolvable_rule(solv, r, &weakq, &rseen);
986 FOR_RULELITERALS(v, pp, r)
988 if (DECISIONMAP_TRUE(v)) /* the one true literal */
991 MAPSET(&involved, vv);
993 idx = solv->decisionq.count;
996 v = solv->decisionq.elements[--idx];
998 if (!MAPTST(&involved, vv) || vv == SYSTEMSOLVABLE)
1000 why = solv->decisionq_why.elements[idx];
1003 queue_push(&solv->learnt_pool, why);
1004 r = solv->rules + why;
1005 analyze_unsolvable_rule(solv, r, &weakq, &rseen);
1006 FOR_RULELITERALS(v, pp, r)
1008 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1010 vv = v > 0 ? v : -v;
1011 MAPSET(&involved, vv);
1014 map_free(&involved);
1016 queue_push(&solv->problems, 0); /* mark end of this problem */
1020 /* revert problems */
1021 solv->problems.count = oldproblemcount;
1022 solv->learnt_pool.count = oldlearntpoolcount;
1023 /* disable some weak rules */
1024 disable_weakrules(solv, &weakq);
1031 if (solv->allowuninstall || solv->allowuninstall_all || solv->allowuninstallmap.size)
1032 if (solver_autouninstall(solv, oldproblemcount) != 0)
1034 solv->problems.count = oldproblemcount;
1035 solv->learnt_pool.count = oldlearntpoolcount;
1043 queue_push(&solv->learnt_pool, 0);
1044 solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
1047 /* + 2: index + trailing zero */
1048 if (disablerules && oldproblemcount + 2 < solv->problems.count)
1050 solver_disableproblemset(solv, oldproblemcount);
1051 /* XXX: might want to enable all weak rules again */
1055 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
1060 /*-------------------------------------------------------------------
1064 * add free decision (solvable to install) to decisionq
1065 * increase level and propagate decision
1066 * return if no conflict.
1068 * in conflict case, analyze conflict rule, add resulting
1069 * rule to learnt rule set, make decision from learnt
1070 * rule (always unit) and re-propagate.
1072 * returns the new solver level or -1 if unsolvable
1077 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules, Id ruleid, Id reason)
1079 Pool *pool = solv->pool;
1086 solv->decisionmap[decision] = level;
1088 solv->decisionmap[-decision] = -level;
1089 queue_push(&solv->decisionq, decision);
1090 queue_push(&solv->decisionq_why, -ruleid); /* <= 0 -> free decision */
1091 queue_push(&solv->decisionq_reason, reason);
1093 assert(ruleid >= 0 && level > 0);
1096 r = propagate(solv, level);
1100 return analyze_unsolvable(solv, r, disablerules);
1101 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
1102 level = analyze(solv, level, r, &lr);
1103 /* the new rule is unit by design */
1105 solv->decisionmap[decision > 0 ? decision : -decision] = decision > 0 ? level : -level;
1106 queue_push(&solv->decisionq, decision);
1107 queue_push(&solv->decisionq_why, lr - solv->rules);
1108 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
1110 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "decision: ");
1111 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, decision);
1112 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "new rule: ");
1113 solver_printrule(solv, SOLV_DEBUG_ANALYZE, lr);
1120 reorder_dq_for_future_installed(Solver *solv, int level, Queue *dq)
1122 Pool *pool = solv->pool;
1123 int i, j, haveone = 0, dqcount = dq->count;
1124 int decisionqcount = solv->decisionq.count;
1128 /* at the time we process jobrules the installed packages are not kept yet */
1129 /* reorder so that "future-supplemented" packages come first */
1130 FOR_REPO_SOLVABLES(solv->installed, p, s)
1132 if (MAPTST(&solv->noupdate, p - solv->installed->start))
1134 if (solv->decisionmap[p] == 0)
1136 if (s->recommends || s->suggests)
1137 queue_push(&solv->decisionq, p);
1138 solv->decisionmap[p] = level + 1;
1144 policy_update_recommendsmap(solv);
1145 for (i = 0; i < dqcount; i++)
1147 p = dq->elements[i];
1148 if (!(pool->solvables[p].repo == solv->installed || MAPTST(&solv->suggestsmap, p) || solver_is_enhancing(solv, pool->solvables + p)))
1151 dq->elements[i] = 0;
1154 dqcount = dq->count;
1155 for (i = 0; i < dqcount; i++)
1157 p = dq->elements[i];
1158 if (p && !(pool->solvables[p].repo == solv->installed || MAPTST(&solv->recommendsmap, p) || solver_is_supplementing(solv, pool->solvables + p)))
1161 dq->elements[i] = 0;
1164 for (i = j = 0; i < dq->count; i++)
1165 if (dq->elements[i])
1166 dq->elements[j++] = dq->elements[i];
1167 queue_truncate(dq, j);
1168 FOR_REPO_SOLVABLES(solv->installed, p, s)
1169 if (solv->decisionmap[p] == level + 1)
1170 solv->decisionmap[p] = 0;
1171 if (solv->decisionq.count != decisionqcount)
1173 solv->recommends_index = -1;
1174 queue_truncate(&solv->decisionq, decisionqcount);
1176 /* but obey favored maps */
1177 policy_prefer_favored(solv, dq);
1180 /*-------------------------------------------------------------------
1185 * [ -p1 p2 p3 .. pn opt_pkg opt_data size level ]
1187 * pkgs are negative if we tried them (to prevent inifinite recursion)
1188 * opt_pkg: recommends: package with the recommends
1190 * opt_data: recommends: depid
1195 createbranch(Solver *solv, int level, Queue *dq, Id p, Id data)
1197 Pool *pool = solv->pool;
1199 IF_POOLDEBUG (SOLV_DEBUG_POLICY)
1201 POOL_DEBUG (SOLV_DEBUG_POLICY, "creating a branch:\n");
1202 for (i = 0; i < dq->count; i++)
1203 POOL_DEBUG (SOLV_DEBUG_POLICY, " - %s\n", pool_solvid2str(pool, dq->elements[i]));
1205 queue_push(&solv->branches, -dq->elements[0]);
1206 for (i = 1; i < dq->count; i++)
1207 queue_push(&solv->branches, dq->elements[i]);
1208 queue_push2(&solv->branches, p, data);
1209 queue_push2(&solv->branches, dq->count + 4, level);
1213 takebranch(Solver *solv, int pos, int end, const char *msg, int disablerules)
1215 Pool *pool = solv->pool;
1221 printf("branch group level %d [%d-%d] %d %d:\n", solv->branches.elements[end - 1], start, end, solv->branches.elements[end - 4], solv->branches.elements[end - 3]);
1222 for (i = end - solv->branches.elements[end - 2]; i < end - 4; i++)
1223 printf("%c %c%s\n", i == pos ? 'x' : ' ', solv->branches.elements[i] >= 0 ? ' ' : '-', pool_solvid2str(pool, solv->branches.elements[i] >= 0 ? solv->branches.elements[i] : -solv->branches.elements[i]));
1226 level = solv->branches.elements[end - 1];
1227 p = solv->branches.elements[pos];
1228 solv->branches.elements[pos] = -p;
1229 POOL_DEBUG(SOLV_DEBUG_SOLVER, "%s %d -> %d with %s\n", msg, solv->decisionmap[p], level, pool_solvid2str(pool, p));
1230 /* hack: set level to zero so that revert does not remove the branch */
1231 solv->branches.elements[end - 1] = 0;
1232 revert(solv, level);
1233 solv->branches.elements[end - 1] = level;
1234 /* hack: revert simply sets the count, so we can still access the reverted elements */
1235 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
1237 reason = solv->decisionq_reason.elements[level + 1];
1238 return setpropagatelearn(solv, level, p, disablerules, why, reason);
1241 /*-------------------------------------------------------------------
1243 * select and install
1245 * install best package from the queue. We add an extra package, inst, if
1246 * provided. See comment in weak install section.
1248 * returns the new solver level or -1 if unsolvable
1253 selectandinstall(Solver *solv, int level, Queue *dq, int disablerules, Id ruleid, Id reason)
1255 Pool *pool = solv->pool;
1259 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1260 /* if we're resolving rules and didn't resolve the installed packages yet,
1261 * do some special supplements ordering */
1262 if (dq->count > 1 && solv->do_extra_reordering)
1263 reorder_dq_for_future_installed(solv, level, dq);
1264 /* if we have multiple candidates we open a branch */
1266 createbranch(solv, level, dq, 0, ruleid);
1267 p = dq->elements[0];
1268 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing %s\n", pool_solvid2str(pool, p));
1269 return setpropagatelearn(solv, level, p, disablerules, ruleid, reason);
1273 /********************************************************************/
1274 /* Main solver interface */
1277 /*-------------------------------------------------------------------
1280 * create solver structure
1282 * pool: all available solvables
1283 * installed: installed Solvables
1286 * Upon solving, rules are created to flag the Solvables
1287 * of the 'installed' Repo as installed.
1291 solver_create(Pool *pool)
1294 solv = (Solver *)solv_calloc(1, sizeof(Solver));
1296 solv->installed = pool->installed;
1298 solv->allownamechange = 1;
1300 solv->dup_allowdowngrade = 1;
1301 solv->dup_allownamechange = 1;
1302 solv->dup_allowarchchange = 1;
1303 solv->dup_allowvendorchange = 1;
1305 solv->keepexplicitobsoletes = pool->noobsoletesmultiversion ? 0 : 1;
1307 queue_init(&solv->ruletojob);
1308 queue_init(&solv->decisionq);
1309 queue_init(&solv->decisionq_why);
1310 queue_init(&solv->decisionq_reason);
1311 queue_init(&solv->problems);
1312 queue_init(&solv->orphaned);
1313 queue_init(&solv->learnt_why);
1314 queue_init(&solv->learnt_pool);
1315 queue_init(&solv->branches);
1316 queue_init(&solv->weakruleq);
1317 queue_init(&solv->ruleassertions);
1318 queue_init(&solv->addedmap_deduceq);
1320 queue_push(&solv->learnt_pool, 0); /* so that 0 does not describe a proof */
1322 map_init(&solv->recommendsmap, pool->nsolvables);
1323 map_init(&solv->suggestsmap, pool->nsolvables);
1324 map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
1325 solv->recommends_index = 0;
1327 solv->decisionmap = (Id *)solv_calloc(pool->nsolvables, sizeof(Id));
1329 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
1330 memset(solv->rules, 0, sizeof(Rule));
1337 /*-------------------------------------------------------------------
1343 queuep_free(Queue **qp)
1348 *qp = solv_free(*qp);
1352 map_zerosize(Map *m)
1362 solver_free(Solver *solv)
1364 queue_free(&solv->job);
1365 queue_free(&solv->ruletojob);
1366 queue_free(&solv->decisionq);
1367 queue_free(&solv->decisionq_why);
1368 queue_free(&solv->decisionq_reason);
1369 queue_free(&solv->learnt_why);
1370 queue_free(&solv->learnt_pool);
1371 queue_free(&solv->problems);
1372 queue_free(&solv->solutions);
1373 queue_free(&solv->orphaned);
1374 queue_free(&solv->branches);
1375 queue_free(&solv->weakruleq);
1376 queue_free(&solv->ruleassertions);
1377 queue_free(&solv->addedmap_deduceq);
1378 queuep_free(&solv->cleandeps_updatepkgs);
1379 queuep_free(&solv->cleandeps_mistakes);
1380 queuep_free(&solv->update_targets);
1381 queuep_free(&solv->installsuppdepq);
1382 queuep_free(&solv->recommendscplxq);
1383 queuep_free(&solv->suggestscplxq);
1384 queuep_free(&solv->brokenorphanrules);
1385 queuep_free(&solv->recommendsruleq);
1387 map_free(&solv->recommendsmap);
1388 map_free(&solv->suggestsmap);
1389 map_free(&solv->noupdate);
1390 map_free(&solv->weakrulemap);
1391 map_free(&solv->multiversion);
1393 map_free(&solv->updatemap);
1394 map_free(&solv->bestupdatemap);
1395 map_free(&solv->fixmap);
1396 map_free(&solv->dupmap);
1397 map_free(&solv->dupinvolvedmap);
1398 map_free(&solv->droporphanedmap);
1399 map_free(&solv->cleandepsmap);
1400 map_free(&solv->allowuninstallmap);
1402 solv_free(solv->favormap);
1403 solv_free(solv->decisionmap);
1404 solv_free(solv->rules);
1405 solv_free(solv->watches);
1406 solv_free(solv->obsoletes);
1407 solv_free(solv->obsoletes_data);
1408 solv_free(solv->specialupdaters);
1409 solv_free(solv->choicerules_info);
1410 solv_free(solv->bestrules_info);
1411 solv_free(solv->yumobsrules_info);
1412 solv_free(solv->recommendsrules_info);
1413 solv_free(solv->instbuddy);
1418 solver_get_flag(Solver *solv, int flag)
1422 case SOLVER_FLAG_ALLOW_DOWNGRADE:
1423 return solv->allowdowngrade;
1424 case SOLVER_FLAG_ALLOW_NAMECHANGE:
1425 return solv->allownamechange;
1426 case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1427 return solv->allowarchchange;
1428 case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1429 return solv->allowvendorchange;
1430 case SOLVER_FLAG_ALLOW_UNINSTALL:
1431 return solv->allowuninstall;
1432 case SOLVER_FLAG_NO_UPDATEPROVIDE:
1433 return solv->noupdateprovide;
1434 case SOLVER_FLAG_SPLITPROVIDES:
1435 return solv->dosplitprovides;
1436 case SOLVER_FLAG_IGNORE_RECOMMENDED:
1437 return solv->dontinstallrecommended;
1438 case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1439 return solv->addalreadyrecommended;
1440 case SOLVER_FLAG_NO_INFARCHCHECK:
1441 return solv->noinfarchcheck;
1442 case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1443 return solv->keepexplicitobsoletes;
1444 case SOLVER_FLAG_BEST_OBEY_POLICY:
1445 return solv->bestobeypolicy;
1446 case SOLVER_FLAG_NO_AUTOTARGET:
1447 return solv->noautotarget;
1448 case SOLVER_FLAG_DUP_ALLOW_DOWNGRADE:
1449 return solv->dup_allowdowngrade;
1450 case SOLVER_FLAG_DUP_ALLOW_NAMECHANGE:
1451 return solv->dup_allownamechange;
1452 case SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE:
1453 return solv->dup_allowarchchange;
1454 case SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE:
1455 return solv->dup_allowvendorchange;
1456 case SOLVER_FLAG_KEEP_ORPHANS:
1457 return solv->keep_orphans;
1458 case SOLVER_FLAG_BREAK_ORPHANS:
1459 return solv->break_orphans;
1460 case SOLVER_FLAG_FOCUS_INSTALLED:
1461 return solv->focus_installed;
1462 case SOLVER_FLAG_FOCUS_BEST:
1463 return solv->focus_best;
1464 case SOLVER_FLAG_YUM_OBSOLETES:
1465 return solv->do_yum_obsoletes;
1466 case SOLVER_FLAG_NEED_UPDATEPROVIDE:
1467 return solv->needupdateprovide;
1468 case SOLVER_FLAG_URPM_REORDER:
1469 return solv->urpmreorder;
1470 case SOLVER_FLAG_STRONG_RECOMMENDS:
1471 return solv->strongrecommends;
1472 case SOLVER_FLAG_INSTALL_ALSO_UPDATES:
1473 return solv->install_also_updates;
1474 case SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED:
1475 return solv->only_namespace_recommended;
1483 solver_set_flag(Solver *solv, int flag, int value)
1485 int old = solver_get_flag(solv, flag);
1488 case SOLVER_FLAG_ALLOW_DOWNGRADE:
1489 solv->allowdowngrade = value;
1491 case SOLVER_FLAG_ALLOW_NAMECHANGE:
1492 solv->allownamechange = value;
1494 case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1495 solv->allowarchchange = value;
1497 case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1498 solv->allowvendorchange = value;
1500 case SOLVER_FLAG_ALLOW_UNINSTALL:
1501 solv->allowuninstall = value;
1503 case SOLVER_FLAG_NO_UPDATEPROVIDE:
1504 solv->noupdateprovide = value;
1506 case SOLVER_FLAG_SPLITPROVIDES:
1507 solv->dosplitprovides = value;
1509 case SOLVER_FLAG_IGNORE_RECOMMENDED:
1510 solv->dontinstallrecommended = value;
1512 case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1513 solv->addalreadyrecommended = value;
1515 case SOLVER_FLAG_NO_INFARCHCHECK:
1516 solv->noinfarchcheck = value;
1518 case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1519 solv->keepexplicitobsoletes = value;
1521 case SOLVER_FLAG_BEST_OBEY_POLICY:
1522 solv->bestobeypolicy = value;
1524 case SOLVER_FLAG_NO_AUTOTARGET:
1525 solv->noautotarget = value;
1527 case SOLVER_FLAG_DUP_ALLOW_DOWNGRADE:
1528 solv->dup_allowdowngrade = value;
1530 case SOLVER_FLAG_DUP_ALLOW_NAMECHANGE:
1531 solv->dup_allownamechange = value;
1533 case SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE:
1534 solv->dup_allowarchchange = value;
1536 case SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE:
1537 solv->dup_allowvendorchange = value;
1539 case SOLVER_FLAG_KEEP_ORPHANS:
1540 solv->keep_orphans = value;
1542 case SOLVER_FLAG_BREAK_ORPHANS:
1543 solv->break_orphans = value;
1545 case SOLVER_FLAG_FOCUS_INSTALLED:
1546 solv->focus_installed = value;
1548 case SOLVER_FLAG_FOCUS_BEST:
1549 solv->focus_best = value;
1551 case SOLVER_FLAG_YUM_OBSOLETES:
1552 solv->do_yum_obsoletes = value;
1554 case SOLVER_FLAG_NEED_UPDATEPROVIDE:
1555 solv->needupdateprovide = value;
1557 case SOLVER_FLAG_URPM_REORDER:
1558 solv->urpmreorder = value;
1560 case SOLVER_FLAG_STRONG_RECOMMENDS:
1561 solv->strongrecommends = value;
1563 case SOLVER_FLAG_INSTALL_ALSO_UPDATES:
1564 solv->install_also_updates = value;
1566 case SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED:
1567 solv->only_namespace_recommended = value;
1576 resolve_jobrules(Solver *solv, int level, int disablerules, Queue *dq)
1578 Pool *pool = solv->pool;
1579 int oldlevel = level;
1583 POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving job rules\n");
1584 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
1587 if (r->d < 0) /* ignore disabled rules */
1590 FOR_RULELITERALS(l, pp, r)
1594 if (solv->decisionmap[-l] <= 0)
1599 if (solv->decisionmap[l] > 0)
1601 if (solv->decisionmap[l] == 0)
1605 if (l || !dq->count)
1607 /* prune to installed if not updating */
1608 if (dq->count > 1 && solv->installed && !solv->updatemap_all &&
1609 !solv->install_also_updates &&
1610 !(solv->job.elements[solv->ruletojob.elements[i - solv->jobrules]] & SOLVER_ORUPDATE))
1612 int j = dq->count, k;
1613 if (solv->updatemap.size)
1615 /* do not prune if an installed package wants to be updated */
1616 for (j = 0; j < dq->count; j++)
1617 if (pool->solvables[dq->elements[j]].repo == solv->installed
1618 && MAPTST(&solv->updatemap, dq->elements[j] - solv->installed->start))
1623 for (j = k = 0; j < dq->count; j++)
1624 if (pool->solvables[dq->elements[j]].repo == solv->installed)
1625 dq->elements[k++] = dq->elements[j];
1631 level = selectandinstall(solv, level, dq, disablerules, i, SOLVER_REASON_RESOLVE_JOB);
1632 if (level <= olevel)
1634 if (level == olevel)
1638 continue; /* try something else */
1640 if (level < oldlevel)
1642 /* redo from start of jobrules */
1643 i = solv->jobrules - 1;
1644 r = solv->rules + i;
1651 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
1655 for (i = j = 0; i < q->count; i++)
1658 for (cp2 = cp; *cp2; cp2++)
1661 q->elements[j++] = p;
1665 queue_truncate(q, j);
1669 resolve_installed(Solver *solv, int level, int disablerules, Queue *dq)
1671 Pool *pool = solv->pool;
1672 Repo *installed = solv->installed;
1674 int installedpos = solv->installedpos;
1677 int olevel, origlevel = level;
1679 POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving installed packages\n");
1681 installedpos = installed->start;
1682 /* we use two passes if we need to update packages
1683 * to create a better user experience */
1684 for (pass = solv->updatemap.size ? 0 : 1; pass < 2; )
1686 int passlevel = level;
1687 Id *specialupdaters = solv->specialupdaters;
1688 /* start with installedpos, the position that gave us problems the last time */
1689 for (i = installedpos, n = installed->start; n < installed->end; i++, n++)
1694 if (i == installed->end)
1695 i = installed->start;
1696 s = pool->solvables + i;
1697 if (s->repo != installed)
1700 if (solv->decisionmap[i] > 0 && (!specialupdaters || !specialupdaters[i - installed->start]))
1701 continue; /* already decided */
1702 if (!pass && solv->updatemap.size && !MAPTST(&solv->updatemap, i - installed->start))
1703 continue; /* updates first */
1704 r = solv->rules + solv->updaterules + (i - installed->start);
1706 if (!rr->p || rr->d < 0) /* disabled -> look at feature rule */
1707 rr -= solv->installed->end - solv->installed->start;
1708 if (!rr->p) /* identical to update rule? */
1711 continue; /* orpaned package or pseudo package */
1713 /* check if we should update this package to the latest version
1714 * noupdate is set for erase jobs, in that case we want to deinstall
1715 * the installed package and not replace it with a newer version
1716 * rr->p != i is for dup jobs where the installed package cannot be kept */
1719 if (!MAPTST(&solv->noupdate, i - installed->start) && (solv->decisionmap[i] < 0 || solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, i - installed->start)) || (rr->p && rr->p != i)))
1721 if (specialupdaters && (d = specialupdaters[i - installed->start]) != 0)
1724 /* special multiversion handling, make sure best version is chosen */
1725 if (rr->p == i && solv->decisionmap[i] >= 0)
1727 while ((p = pool->whatprovidesdata[d++]) != 0)
1728 if (solv->decisionmap[p] >= 0)
1730 for (j = 0; j < dq->count; j++)
1732 Id p2 = dq->elements[j];
1733 if (pool->solvables[p2].repo != installed)
1735 d = specialupdaters[i - installed->start];
1736 while ((p = pool->whatprovidesdata[d++]) != 0)
1738 if (solv->decisionmap[p] >= 0 || pool->solvables[p].repo == installed)
1740 if (solvable_identical(pool->solvables + p, pool->solvables + p2))
1741 queue_push(dq, p); /* identical to installed, put it on the list so we have a repo prio */
1744 if (dq->count && solv->update_targets && solv->update_targets->elements[i - installed->start])
1745 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], dq);
1748 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1749 p = dq->elements[0];
1750 if (p != i && solv->decisionmap[p] == 0)
1752 rr = solv->rules + solv->featurerules + (i - solv->installed->start);
1753 if (!rr->p) /* update rule == feature rule? */
1754 rr = rr - solv->featurerules + solv->updaterules;
1763 /* update to best package of the update rule */
1764 FOR_RULELITERALS(p, pp, rr)
1766 if (solv->decisionmap[p] > 0)
1768 dq->count = 0; /* already fulfilled */
1771 if (!solv->decisionmap[p])
1776 if (dq->count && solv->update_targets && solv->update_targets->elements[i - installed->start])
1777 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], dq);
1778 /* install best version */
1782 level = selectandinstall(solv, level, dq, disablerules, rr - solv->rules, SOLVER_REASON_UPDATE_INSTALLED);
1783 if (level <= olevel)
1785 if (level < passlevel)
1786 break; /* trouble */
1788 n = installed->start; /* redo all */
1794 /* if still undecided keep package */
1795 if (solv->decisionmap[i] == 0)
1798 if (solv->cleandepsmap.size && MAPTST(&solv->cleandepsmap, i - installed->start))
1801 POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, i));
1802 level = setpropagatelearn(solv, level, -i, disablerules, 0, SOLVER_REASON_CLEANDEPS_ERASE);
1809 POOL_DEBUG(SOLV_DEBUG_POLICY, "keeping %s\n", pool_solvid2str(pool, i));
1810 level = setpropagatelearn(solv, level, i, disablerules, r - solv->rules, SOLVER_REASON_KEEP_INSTALLED);
1812 if (level <= olevel)
1814 if (level < passlevel)
1815 break; /* trouble */
1817 n = installed->start; /* redo all */
1820 continue; /* retry with learnt rule */
1824 if (n < installed->end)
1826 installedpos = i; /* retry problem solvable next time */
1827 if (level < origlevel)
1828 break; /* ran into trouble */
1829 /* re-run all passes */
1830 pass = solv->updatemap.size ? 0 : 1;
1833 /* reset installedpos, advance to next pass */
1834 installedpos = installed->start;
1837 solv->installedpos = installedpos;
1841 /* one or more installed cleandeps packages in dq that are to be updated */
1842 /* we need to emulate the code in resolve_installed */
1844 do_cleandeps_update_filter(Solver *solv, Queue *dq)
1846 Pool *pool = solv->pool;
1847 Repo *installed = solv->installed;
1848 Id *specialupdaters = solv->specialupdaters;
1854 for (i = 0; i < dq->count; i++)
1856 Id p = dq->elements[i];
1859 if (pool->solvables[p].repo != installed || !MAPTST(&solv->cleandepsmap, p - installed->start))
1863 if (specialupdaters && (d = specialupdaters[p - installed->start]) != 0)
1865 while ((p2 = pool->whatprovidesdata[d++]) != 0)
1866 if (solv->decisionmap[p2] >= 0)
1871 Rule *r = solv->rules + solv->updaterules + (p - installed->start);
1874 FOR_RULELITERALS(p2, pp, r)
1875 if (solv->decisionmap[p2] >= 0)
1879 if (q.count && solv->update_targets && solv->update_targets->elements[p - installed->start])
1880 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q);
1881 /* mark all elements in dq that are in the updaters list */
1882 dq->elements[i] = -p;
1883 for (j = 0; j < dq->count; j++)
1885 p = dq->elements[j];
1888 for (k = 0; k < q.count; k++)
1889 if (q.elements[k] == p)
1891 dq->elements[j] = -p;
1896 /* now prune to marked elements */
1897 for (i = j = 0; i < dq->count; i++)
1898 if ((p = dq->elements[i]) < 0)
1899 dq->elements[j++] = -p;
1905 resolve_dependencies(Solver *solv, int level, int disablerules, Queue *dq)
1907 Pool *pool = solv->pool;
1911 int origlevel = level;
1917 POOL_DEBUG(SOLV_DEBUG_POLICY, "deciding unresolved rules\n");
1919 for (i = 1, n = 1; ; i++, n++)
1921 if (n >= solv->nrules)
1929 if (i == solv->nrules)
1931 if (solv->focus_best && solv->do_extra_reordering && i >= solv->featurerules)
1933 r = solv->rules + i;
1934 if (r->d < 0) /* ignore disabled rules */
1936 if (r->p < 0) /* most common cases first */
1938 if (r->d == 0 || solv->decisionmap[-r->p] <= 0)
1945 /* binary or unary rule */
1946 /* need two positive undecided literals, r->p already checked above */
1949 if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
1951 queue_push(dq, r->p);
1952 queue_push(dq, r->w2);
1957 * all negative literals are installed
1958 * no positive literal is installed
1959 * i.e. the rule is not fulfilled and we
1960 * just need to decide on the positive literals
1961 * (decisionmap[-r->p] for the r->p < 0 case is already checked above)
1965 if (solv->decisionmap[r->p] > 0)
1967 if (solv->decisionmap[r->p] == 0)
1968 queue_push(dq, r->p);
1970 dp = pool->whatprovidesdata + r->d;
1971 while ((p = *dp++) != 0)
1975 if (solv->decisionmap[-p] <= 0)
1980 if (solv->decisionmap[p] > 0)
1982 if (solv->decisionmap[p] == 0)
1989 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
1991 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "unfulfilled ");
1992 solver_printruleclass(solv, SOLV_DEBUG_PROPAGATE, r);
1994 /* dq->count < 2 cannot happen as this means that
1995 * the rule is unit */
1996 assert(dq->count > 1);
1998 /* prune to cleandeps packages */
1999 if (solv->cleandepsmap.size && solv->installed)
2001 int cleandeps_update = 0;
2002 Repo *installed = solv->installed;
2003 for (j = 0; j < dq->count; j++)
2004 if (pool->solvables[dq->elements[j]].repo == installed && MAPTST(&solv->cleandepsmap, dq->elements[j] - installed->start))
2006 if (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, dq->elements[j] - installed->start)))
2008 cleandeps_update = 1; /* cleandeps package is marked for update */
2015 dq->elements[0] = dq->elements[j];
2016 queue_truncate(dq, 1);
2018 else if (cleandeps_update)
2019 do_cleandeps_update_filter(solv, dq); /* special update filter */
2022 if (dq->count > 1 && postponed >= 0)
2024 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE_NOREORDER);
2033 level = selectandinstall(solv, level, dq, disablerules, r - solv->rules, SOLVER_REASON_RESOLVE);
2034 if (level < origlevel)
2035 break; /* trouble */
2036 /* something changed, so look at all rules again */
2043 #ifdef ENABLE_COMPLEX_DEPS
2046 add_complex_recommends(Solver *solv, Id rec, Queue *dq, Map *dqmap)
2048 Pool *pool = solv->pool;
2049 int oldcnt = dq->count;
2055 printf("ADD_COMPLEX_RECOMMENDS %s\n", pool_dep2str(pool, rec));
2057 i = pool_normalize_complex_dep(pool, rec, dq, CPLXDEPS_EXPAND);
2058 if (i == 0 || i == 1)
2061 for (i = oldcnt; i < cutcnt; i++)
2064 for (; (p = dq->elements[i]) != 0; i++)
2068 if (solv->decisionmap[-p] <= 0)
2072 if (solv->decisionmap[p] > 0)
2074 queue_truncate(dq, blkcnt);
2079 if (!MAPTST(dqmap, p))
2084 if (solv->decisionmap[p] < 0)
2086 if (solv->process_orphans && solv->installed && pool->solvables[p].repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))))
2091 while (dq->elements[i])
2094 queue_deleten(dq, oldcnt, cutcnt - oldcnt);
2096 if (dq->count != oldcnt)
2098 for (j = oldcnt; j < dq->count; j++)
2100 p = dq->elements[j];
2101 for (i = 0; i < j; i++)
2102 if (dq->elements[i] == p)
2104 dq->elements[j] = 0;
2108 for (i = j = oldcnt; j < dq->count; j++)
2109 if (dq->elements[j])
2110 dq->elements[i++] = dq->elements[j];
2111 queue_truncate(dq, i);
2114 printf("RETURN:\n");
2115 for (i = oldcnt; i < dq->count; i++)
2116 printf(" - %s\n", pool_solvid2str(pool, dq->elements[i]));
2121 do_complex_recommendations(Solver *solv, Id rec, Map *m, int noselected)
2123 Pool *pool = solv->pool;
2129 printf("DO_COMPLEX_RECOMMENDATIONS %s\n", pool_dep2str(pool, rec));
2132 i = pool_normalize_complex_dep(pool, rec, &dq, CPLXDEPS_EXPAND);
2133 if (i == 0 || i == 1)
2138 for (i = 0; i < dq.count; i++)
2141 for (; (p = dq.elements[i]) != 0; i++)
2145 if (solv->decisionmap[-p] <= 0)
2149 if (solv->decisionmap[p] > 0)
2154 for (i++; (p = dq.elements[i]) != 0; i++)
2155 if (p > 0 && solv->decisionmap[p] > 0)
2163 for (i = blk; (p = dq.elements[i]) != 0; i++)
2167 while (dq.elements[i])
2176 prune_disfavored(Solver *solv, Queue *plist)
2179 for (i = j = 0; i < plist->count; i++)
2181 Id p = plist->elements[i];
2182 if (solv->favormap[p] >= 0)
2183 plist->elements[j++] = p;
2186 queue_truncate(plist, j);
2190 resolve_weak(Solver *solv, int level, int disablerules, Queue *dq, Queue *dqs, int *rerunp)
2192 Pool *pool = solv->pool;
2200 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended packages\n");
2202 queue_empty(dq); /* recommended packages */
2204 queue_empty(dqs); /* supplemented packages */
2205 for (i = 1; i < pool->nsolvables; i++)
2207 if (solv->decisionmap[i] < 0)
2209 s = pool->solvables + i;
2210 if (solv->decisionmap[i] > 0)
2212 /* installed, check for recommends */
2213 Id *recp, rec, pp, p;
2214 if (!solv->addalreadyrecommended && s->repo == solv->installed)
2218 recp = s->repo->idarraydata + s->recommends;
2219 while ((rec = *recp++) != 0)
2221 /* cheat: we just look if there is REL_NAMESPACE in the dep */
2222 if (solv->only_namespace_recommended && !solver_is_namespace_dep(solv, rec))
2224 #ifdef ENABLE_COMPLEX_DEPS
2225 if (pool_is_complex_dep(pool, rec))
2227 add_complex_recommends(solv, rec, dq, 0);
2232 FOR_PROVIDES(p, pp, rec)
2234 if (solv->decisionmap[p] > 0)
2239 else if (solv->decisionmap[p] == 0)
2241 if (solv->process_orphans && solv->installed && pool->solvables[p].repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))))
2243 queue_pushunique(dq, p);
2251 /* not yet installed, check if supplemented */
2252 if (!s->supplements)
2254 if (!pool_installable(pool, s))
2256 if (!solver_is_supplementing(solv, s))
2258 if (solv->process_orphans && solv->installed && s->repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, i - solv->installed->start))))
2260 if (solv->havedisfavored && solv->favormap[i] < 0)
2261 continue; /* disfavored supplements, do not install */
2266 /* filter out disfavored recommended packages */
2267 if (dq->count && solv->havedisfavored)
2268 prune_disfavored(solv, dq);
2270 /* filter out all packages obsoleted by installed packages */
2271 /* this is no longer needed if we have (and trust) reverse obsoletes */
2272 if ((dqs->count || dq->count) && solv->installed)
2275 Id obs, *obsp, po, ppo;
2277 map_init(&obsmap, pool->nsolvables);
2278 for (p = solv->installed->start; p < solv->installed->end; p++)
2280 s = pool->solvables + p;
2281 if (s->repo != solv->installed || !s->obsoletes)
2283 if (solv->decisionmap[p] <= 0)
2285 if (!solv->keepexplicitobsoletes && solv->multiversion.size && MAPTST(&solv->multiversion, p))
2287 obsp = s->repo->idarraydata + s->obsoletes;
2288 /* foreach obsoletes */
2289 while ((obs = *obsp++) != 0)
2290 FOR_PROVIDES(po, ppo, obs)
2292 Solvable *pos = pool->solvables + po;
2293 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pos, obs))
2295 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, pos))
2297 MAPSET(&obsmap, po);
2300 for (i = j = 0; i < dqs->count; i++)
2301 if (!MAPTST(&obsmap, dqs->elements[i]))
2302 dqs->elements[j++] = dqs->elements[i];
2304 for (i = j = 0; i < dq->count; i++)
2305 if (!MAPTST(&obsmap, dq->elements[i]))
2306 dq->elements[j++] = dq->elements[i];
2311 /* filter out all already supplemented packages if requested */
2312 if ((!solv->addalreadyrecommended || solv->only_namespace_recommended) && dqs->count)
2314 /* filter out old supplements */
2315 for (i = j = 0; i < dqs->count; i++)
2317 p = dqs->elements[i];
2318 s = pool->solvables + p;
2319 if (s->supplements && solver_is_supplementing_alreadyinstalled(solv, s))
2320 dqs->elements[j++] = p;
2325 /* multiversion doesn't mix well with supplements.
2326 * filter supplemented packages where we already decided
2327 * to install a different version (see bnc#501088) */
2328 if (dqs->count && solv->multiversion.size)
2330 for (i = j = 0; i < dqs->count; i++)
2332 p = dqs->elements[i];
2333 if (MAPTST(&solv->multiversion, p))
2336 s = pool->solvables + p;
2337 FOR_PROVIDES(p2, pp2, s->name)
2338 if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name)
2341 continue; /* ignore this package */
2343 dqs->elements[j++] = p;
2348 /* implicitobsoleteusescolors doesn't mix well with supplements.
2349 * filter supplemented packages where we already decided
2350 * to install a different architecture */
2351 if (dqs->count && pool->implicitobsoleteusescolors)
2353 for (i = j = 0; i < dqs->count; i++)
2356 p = dqs->elements[i];
2357 s = pool->solvables + p;
2358 FOR_PROVIDES(p2, pp2, s->name)
2359 if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name && pool->solvables[p2].arch != s->arch)
2362 continue; /* ignore this package */
2363 dqs->elements[j++] = p;
2368 /* make dq contain both recommended and supplemented pkgs */
2371 for (i = 0; i < dqs->count; i++)
2372 queue_pushunique(dq, dqs->elements[i]);
2381 /* simple case, just one package. no need to choose to best version */
2382 p = dq->elements[0];
2384 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2386 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2387 return setpropagatelearn(solv, level, p, 0, 0, SOLVER_REASON_WEAKDEP);
2390 /* filter packages, this gives us the best versions */
2391 policy_filter_unwanted(solv, dq, POLICY_MODE_RECOMMEND);
2393 /* create map of result */
2394 map_init(&dqmap, pool->nsolvables);
2395 for (i = 0; i < dq->count; i++)
2396 MAPSET(&dqmap, dq->elements[i]);
2398 /* prune dqs so that it only contains the best versions */
2399 for (i = j = 0; i < dqs->count; i++)
2401 p = dqs->elements[i];
2402 if (MAPTST(&dqmap, p))
2403 dqs->elements[j++] = p;
2407 /* install all supplemented packages, but order first */
2409 policy_filter_unwanted(solv, dqs, POLICY_MODE_SUPPLEMENT);
2410 decisioncount = solv->decisionq.count;
2411 for (i = 0; i < dqs->count; i++)
2413 p = dqs->elements[i];
2414 if (solv->decisionmap[p])
2416 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2418 level = setpropagatelearn(solv, level, p, 0, 0, SOLVER_REASON_WEAKDEP);
2419 if (level <= olevel)
2422 if (i < dqs->count || solv->decisionq.count < decisioncount)
2428 /* install all recommended packages */
2429 /* more work as we want to created branches if multiple
2430 * choices are valid */
2431 for (i = 0; i < decisioncount; i++)
2434 p = solv->decisionq.elements[i];
2437 s = pool->solvables + p;
2438 if (!s->repo || (!solv->addalreadyrecommended && s->repo == solv->installed))
2442 recp = s->repo->idarraydata + s->recommends;
2443 while ((rec = *recp++) != 0)
2446 #ifdef ENABLE_COMPLEX_DEPS
2447 if (pool_is_complex_dep(pool, rec))
2448 add_complex_recommends(solv, rec, dq, &dqmap);
2451 FOR_PROVIDES(p, pp, rec)
2453 if (solv->decisionmap[p] > 0)
2458 else if (solv->decisionmap[p] == 0 && MAPTST(&dqmap, p))
2464 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
2465 /* if we have multiple candidates we open a branch */
2467 createbranch(solv, level, dq, s - pool->solvables, rec);
2468 p = dq->elements[0];
2469 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2471 level = setpropagatelearn(solv, level, p, 0, 0, SOLVER_REASON_WEAKDEP);
2472 if (level <= olevel || solv->decisionq.count < decisioncount)
2473 break; /* we had to revert some decisions */
2476 break; /* had a problem above, quit loop */
2483 resolve_cleandeps(Solver *solv, int level, int disablerules, int *rerunp)
2485 Pool *pool = solv->pool;
2486 Repo *installed = solv->installed;
2491 if (!installed || !solv->cleandepsmap.size)
2493 POOL_DEBUG(SOLV_DEBUG_SOLVER, "deciding cleandeps packages\n");
2494 for (p = installed->start; p < installed->end; p++)
2496 s = pool->solvables + p;
2497 if (s->repo != installed)
2499 if (solv->decisionmap[p] != 0 || !MAPTST(&solv->cleandepsmap, p - installed->start))
2501 POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, p));
2503 level = setpropagatelearn(solv, level, -p, 0, 0, SOLVER_REASON_CLEANDEPS_ERASE);
2507 if (p < installed->end)
2513 resolve_orphaned(Solver *solv, int level, int disablerules, Queue *dq, int *rerunp)
2515 Pool *pool = solv->pool;
2518 int installedone = 0;
2521 /* let's see if we can install some unsupported package */
2522 POOL_DEBUG(SOLV_DEBUG_SOLVER, "deciding orphaned packages\n");
2523 for (i = 0; i < solv->orphaned.count; i++)
2525 p = solv->orphaned.elements[i];
2526 if (solv->decisionmap[p])
2527 continue; /* already decided */
2528 if (solv->droporphanedmap_all)
2530 if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))
2532 POOL_DEBUG(SOLV_DEBUG_SOLVER, "keeping orphaned %s\n", pool_solvid2str(pool, p));
2534 level = setpropagatelearn(solv, level, p, 0, 0, SOLVER_REASON_RESOLVE_ORPHAN);
2539 if (installedone || i < solv->orphaned.count)
2544 for (i = 0; i < solv->orphaned.count; i++)
2546 p = solv->orphaned.elements[i];
2547 if (solv->decisionmap[p])
2548 continue; /* already decided */
2549 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing orphaned %s\n", pool_solvid2str(pool, p));
2551 level = setpropagatelearn(solv, level, -p, 0, 0, SOLVER_REASON_RESOLVE_ORPHAN);
2558 if (solv->brokenorphanrules)
2560 solver_check_brokenorphanrules(solv, dq);
2563 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
2564 for (i = 0; i < dq->count; i++)
2566 p = dq->elements[i];
2567 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing orphaned dep %s\n", pool_solvid2str(pool, p));
2569 level = setpropagatelearn(solv, level, p, 0, 0, SOLVER_REASON_RESOLVE_ORPHAN);
2580 /*-------------------------------------------------------------------
2584 * all rules have been set up, now actually run the solver
2589 solver_run_sat(Solver *solv, int disablerules, int doweak)
2591 Queue dq; /* local decisionqueue */
2592 Queue dqs; /* local decisionqueue for supplements */
2598 Pool *pool = solv->pool;
2600 int minimizationsteps;
2602 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
2604 POOL_DEBUG (SOLV_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
2605 for (i = 1; i < solv->nrules; i++)
2606 solver_printruleclass(solv, SOLV_DEBUG_RULE_CREATION, solv->rules + i);
2609 /* start SAT algorithm */
2611 systemlevel = level + 1;
2612 POOL_DEBUG(SOLV_DEBUG_SOLVER, "solving...\n");
2616 solv->installedpos = 0;
2617 solv->do_extra_reordering = 0;
2620 * here's the main loop:
2621 * 1) decide assertion rules and propagate
2623 * 3) try to keep installed packages
2624 * 4) fulfill all unresolved rules
2625 * 5) install recommended packages
2626 * 6) minimalize solution if we had choices
2627 * if we encounter a problem, we rewind to a safe level and restart
2631 minimizationsteps = 0;
2635 * initial propagation of the assertions
2641 level = makeruledecisions(solv, disablerules);
2644 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "initial propagate (propagate_index: %d; size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
2645 if ((r = propagate(solv, level)) != 0)
2647 level = analyze_unsolvable(solv, r, disablerules);
2650 systemlevel = level + 1;
2654 * resolve jobs first (unless focus_installed is set)
2656 if (level < systemlevel && !solv->focus_installed)
2658 if (solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
2659 solv->do_extra_reordering = 1;
2661 level = resolve_jobrules(solv, level, disablerules, &dq);
2662 solv->do_extra_reordering = 0;
2665 systemlevel = level + 1;
2668 /* resolve job dependencies in the focus_best case */
2669 if (level < systemlevel && solv->focus_best && !solv->focus_installed && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
2671 solv->do_extra_reordering = 1;
2673 level = resolve_dependencies(solv, level, disablerules, &dq);
2674 solv->do_extra_reordering = 0;
2676 continue; /* start over */
2677 systemlevel = level + 1;
2681 * installed packages
2683 if (level < systemlevel && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
2686 level = resolve_installed(solv, level, disablerules, &dq);
2689 systemlevel = level + 1;
2692 /* resolve jobs in focus_installed case */
2693 if (level < systemlevel && solv->focus_installed)
2696 level = resolve_jobrules(solv, level, disablerules, &dq);
2699 systemlevel = level + 1;
2702 if (level < systemlevel)
2703 systemlevel = level;
2705 /* resolve all dependencies */
2707 level = resolve_dependencies(solv, level, disablerules, &dq);
2709 continue; /* start over */
2711 /* decide leftover cleandeps packages */
2712 if (solv->cleandepsmap.size && solv->installed)
2715 level = resolve_cleandeps(solv, level, disablerules, &rerun);
2720 /* at this point we have a consistent system. now do the extras... */
2725 level = resolve_weak(solv, level, disablerules, &dq, &dqs, &rerun);
2730 if (solv->installed && (solv->orphaned.count || solv->brokenorphanrules))
2733 level = resolve_orphaned(solv, level, disablerules, &dq, &rerun);
2738 /* one final pass to make sure we decided all installed packages */
2739 if (solv->installed)
2741 for (p = solv->installed->start; p < solv->installed->end; p++)
2743 if (solv->decisionmap[p])
2744 continue; /* already decided */
2745 s = pool->solvables + p;
2746 if (s->repo != solv->installed)
2748 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing unwanted %s\n", pool_solvid2str(pool, p));
2750 level = setpropagatelearn(solv, level, -p, 0, 0, SOLVER_REASON_CLEANDEPS_ERASE);
2754 if (p < solv->installed->end)
2755 continue; /* back to main loop */
2758 if (solv->installed && solv->cleandepsmap.size && solver_check_cleandeps_mistakes(solv))
2761 level = 0; /* restart from scratch */
2765 if (solv->solution_callback)
2767 solv->solution_callback(solv, solv->solution_callback_data);
2768 if (solv->branches.count)
2772 for (i = solv->branches.count - 1; i >= 0; i--)
2774 p = solv->branches.elements[i];
2779 i -= 3; /* skip: p data count */
2788 while (i > 0 && solv->branches.elements[i - 1] > 0)
2790 level = takebranch(solv, i, endi, "branching", disablerules);
2794 /* all branches done, we're finally finished */
2798 /* auto-minimization step */
2799 if (solv->branches.count)
2801 int endi, lasti = -1, lastiend = -1;
2802 if (solv->recommends_index < solv->decisionq.count)
2803 policy_update_recommendsmap(solv);
2804 for (endi = solv->branches.count; endi > 0;)
2806 int l, lastsi = -1, starti = endi - solv->branches.elements[endi - 2];
2807 l = solv->branches.elements[endi - 1];
2808 for (i = starti; i < endi - 4; i++)
2810 p = solv->branches.elements[i];
2813 if (solv->decisionmap[p] > l)
2820 if (solv->havedisfavored && solv->favormap[p] < 0)
2822 if (lastsi < 0 && (MAPTST(&solv->recommendsmap, p) || solver_is_supplementing(solv, pool->solvables + p)))
2827 /* we have a recommended package that could not be installed */
2828 /* find current selection and take new one if it is not recommended */
2829 for (i = starti; i < endi - 4; i++)
2831 p = -solv->branches.elements[i];
2832 if (p <= 0 || solv->decisionmap[p] != l + 1)
2834 if (solv->favormap && solv->favormap[p] > solv->favormap[solv->branches.elements[lastsi]])
2835 continue; /* current selection is more favored */
2836 if (!(MAPTST(&solv->recommendsmap, p) || solver_is_supplementing(solv, pool->solvables + p)))
2848 minimizationsteps++;
2849 level = takebranch(solv, lasti, lastiend, "minimizing", disablerules);
2850 continue; /* back to main loop */
2853 /* no minimization found, we're finally finished! */
2856 assert(level == -1 || level + 1 == solv->decisionq_reason.count);
2858 POOL_DEBUG(SOLV_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable, %d minimization steps\n", solv->stats_learned, solv->stats_unsolvable, minimizationsteps);
2860 POOL_DEBUG(SOLV_DEBUG_STATS, "done solving.\n\n");
2864 solver_printdecisionq(solv, SOLV_DEBUG_RESULT);
2869 /*-------------------------------------------------------------------
2871 * remove disabled conflicts
2873 * purpose: update the decisionmap after some rules were disabled.
2874 * this is used to calculate the suggested/recommended package list.
2875 * Also returns a "removed" list to undo the discisionmap changes.
2879 removedisabledconflicts(Solver *solv, Queue *removed)
2881 Pool *pool = solv->pool;
2886 Id *decisionmap = solv->decisionmap;
2888 queue_empty(removed);
2889 for (i = 0; i < solv->decisionq.count; i++)
2891 p = solv->decisionq.elements[i];
2893 continue; /* conflicts only, please */
2894 why = solv->decisionq_why.elements[i];
2897 /* no rule involved, must be a orphan package drop */
2900 /* we never do conflicts on free decisions, so there
2901 * must have been an unit rule */
2903 r = solv->rules + why;
2904 if (r->d < 0 && decisionmap[-p])
2906 /* rule is now disabled, remove from decisionmap */
2907 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing conflict for package %s[%d]\n", pool_solvid2str(pool, -p), -p);
2908 queue_push(removed, -p);
2909 queue_push(removed, decisionmap[-p]);
2910 decisionmap[-p] = 0;
2913 if (!removed->count)
2915 /* we removed some confliced packages. some of them might still
2916 * be in conflict, so search for unit rules and re-conflict */
2918 for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
2920 if (i == solv->nrules)
2923 r = solv->rules + i;
2929 if (r->p < 0 && !decisionmap[-r->p])
2935 if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
2937 else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
2942 if (r->p < 0 && decisionmap[-r->p] == 0)
2944 if (new || DECISIONMAP_FALSE(r->p))
2946 dp = pool->whatprovidesdata + r->d;
2947 while ((p = *dp++) != 0)
2949 if (new && p == new)
2951 if (p < 0 && decisionmap[-p] == 0)
2960 else if (!DECISIONMAP_FALSE(p))
2970 POOL_DEBUG(SOLV_DEBUG_SOLVER, "re-conflicting package %s[%d]\n", pool_solvid2str(pool, -new), -new);
2971 decisionmap[-new] = -1;
2973 n = 0; /* redo all rules */
2979 undo_removedisabledconflicts(Solver *solv, Queue *removed)
2982 for (i = 0; i < removed->count; i += 2)
2983 solv->decisionmap[removed->elements[i]] = removed->elements[i + 1];
2987 /*-------------------------------------------------------------------
2989 * weaken solvable dependencies
2993 weaken_solvable_deps(Solver *solv, Id p)
2998 for (i = 1, r = solv->rules + i; i < solv->pkgrules_end; i++, r++)
3002 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
3003 continue; /* conflict */
3004 queue_push(&solv->weakruleq, i);
3009 /********************************************************************/
3014 solver_calculate_multiversionmap(Pool *pool, Queue *job, Map *multiversionmap)
3017 Id how, what, select;
3019 for (i = 0; i < job->count; i += 2)
3021 how = job->elements[i];
3022 if ((how & SOLVER_JOBMASK) != SOLVER_MULTIVERSION)
3024 what = job->elements[i + 1];
3025 select = how & SOLVER_SELECTMASK;
3026 if (!multiversionmap->size)
3027 map_grow(multiversionmap, pool->nsolvables);
3028 if (select == SOLVER_SOLVABLE_ALL)
3030 FOR_POOL_SOLVABLES(p)
3031 MAPSET(multiversionmap, p);
3033 else if (select == SOLVER_SOLVABLE_REPO)
3036 Repo *repo = pool_id2repo(pool, what);
3039 FOR_REPO_SOLVABLES(repo, p, s)
3040 MAPSET(multiversionmap, p);
3043 FOR_JOB_SELECT(p, pp, select, what)
3044 MAPSET(multiversionmap, p);
3049 solver_calculate_noobsmap(Pool *pool, Queue *job, Map *multiversionmap)
3051 solver_calculate_multiversionmap(pool, job, multiversionmap);
3055 * add a rule created by a job, record job number and weak flag
3058 solver_addjobrule(Solver *solv, Id p, Id p2, Id d, Id job, int weak)
3060 solver_addrule(solv, p, p2, d);
3061 queue_push(&solv->ruletojob, job);
3063 queue_push(&solv->weakruleq, solv->nrules - 1);
3067 add_cleandeps_updatepkg(Solver *solv, Id p)
3069 if (!solv->cleandeps_updatepkgs)
3071 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
3072 queue_init(solv->cleandeps_updatepkgs);
3074 queue_pushunique(solv->cleandeps_updatepkgs, p);
3078 add_update_target(Solver *solv, Id p, Id how)
3080 Pool *pool = solv->pool;
3081 Solvable *s = pool->solvables + p;
3082 Repo *installed = solv->installed;
3083 Id pi, pip, identicalp;
3084 int startcnt, endcnt;
3086 if (!solv->update_targets)
3088 solv->update_targets = solv_calloc(1, sizeof(Queue));
3089 queue_init(solv->update_targets);
3091 if (s->repo == installed)
3093 queue_push2(solv->update_targets, p, p);
3097 startcnt = solv->update_targets->count;
3098 FOR_PROVIDES(pi, pip, s->name)
3100 Solvable *si = pool->solvables + pi;
3101 if (si->repo != installed || si->name != s->name)
3103 if (how & SOLVER_FORCEBEST)
3105 if (!solv->bestupdatemap.size)
3106 map_grow(&solv->bestupdatemap, installed->end - installed->start);
3107 MAPSET(&solv->bestupdatemap, pi - installed->start);
3109 if (how & SOLVER_CLEANDEPS)
3110 add_cleandeps_updatepkg(solv, pi);
3111 queue_push2(solv->update_targets, pi, p);
3112 /* remember an installed package that is identical to p */
3113 if (s->evr == si->evr && solvable_identical(s, si))
3118 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
3119 while ((obs = *obsp++) != 0)
3121 FOR_PROVIDES(pi, pip, obs)
3123 Solvable *si = pool->solvables + pi;
3124 if (si->repo != installed)
3126 if (si->name == s->name)
3127 continue; /* already handled above */
3128 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
3130 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
3132 if (how & SOLVER_FORCEBEST)
3134 if (!solv->bestupdatemap.size)
3135 map_grow(&solv->bestupdatemap, installed->end - installed->start);
3136 MAPSET(&solv->bestupdatemap, pi - installed->start);
3138 if (how & SOLVER_CLEANDEPS)
3139 add_cleandeps_updatepkg(solv, pi);
3140 queue_push2(solv->update_targets, pi, p);
3144 /* also allow upgrading to an identical installed package */
3147 for (endcnt = solv->update_targets->count; startcnt < endcnt; startcnt += 2)
3148 queue_push2(solv->update_targets, solv->update_targets->elements[startcnt], identicalp);
3153 transform_update_targets_sortfn(const void *ap, const void *bp, void *dp)
3163 transform_update_targets(Solver *solv)
3165 Repo *installed = solv->installed;
3166 Queue *update_targets = solv->update_targets;
3168 Id p, q, lastp, lastq;
3170 if (!update_targets->count)
3172 queue_free(update_targets);
3173 solv->update_targets = solv_free(update_targets);
3176 if (update_targets->count > 2)
3177 solv_sort(update_targets->elements, update_targets->count >> 1, 2 * sizeof(Id), transform_update_targets_sortfn, solv);
3178 queue_insertn(update_targets, 0, installed->end - installed->start, 0);
3180 for (i = j = installed->end - installed->start; i < update_targets->count; i += 2)
3182 if ((p = update_targets->elements[i]) != lastp)
3184 if (!solv->updatemap.size)
3185 map_grow(&solv->updatemap, installed->end - installed->start);
3186 MAPSET(&solv->updatemap, p - installed->start);
3187 update_targets->elements[j++] = 0; /* finish old set */
3188 update_targets->elements[p - installed->start] = j; /* start new set */
3192 if ((q = update_targets->elements[i + 1]) != lastq)
3194 update_targets->elements[j++] = q;
3198 queue_truncate(update_targets, j);
3199 queue_push(update_targets, 0); /* finish last set */
3204 addedmap2deduceq(Solver *solv, Map *addedmap)
3206 Pool *pool = solv->pool;
3211 queue_empty(&solv->addedmap_deduceq);
3212 for (i = 2, j = solv->pkgrules_end - 1; i < pool->nsolvables && j > 0; j--)
3214 r = solv->rules + j;
3217 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
3220 if (!MAPTST(addedmap, p))
3222 /* should never happen, but... */
3223 if (!solv->addedmap_deduceq.count || solv->addedmap_deduceq.elements[solv->addedmap_deduceq.count - 1] != -p)
3224 queue_push(&solv->addedmap_deduceq, -p);
3228 if (MAPTST(addedmap, i))
3229 queue_push(&solv->addedmap_deduceq, i);
3233 for (; i < pool->nsolvables; i++)
3234 if (MAPTST(addedmap, i))
3235 queue_push(&solv->addedmap_deduceq, i);
3239 deduceq2addedmap(Solver *solv, Map *addedmap)
3244 for (j = solv->pkgrules_end - 1; j > 0; j--)
3246 r = solv->rules + j;
3247 if (r->d < 0 && r->p)
3248 solver_enablerule(solv, r);
3251 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
3254 MAPSET(addedmap, p);
3256 for (j = 0; j < solv->addedmap_deduceq.count; j++)
3258 p = solv->addedmap_deduceq.elements[j];
3260 MAPSET(addedmap, p);
3262 MAPCLR(addedmap, p);
3266 #ifdef ENABLE_COMPLEX_DEPS
3268 add_complex_jobrules(Solver *solv, Id dep, int flags, int jobidx, int weak)
3270 Pool *pool = solv->pool;
3275 i = pool_normalize_complex_dep(pool, dep, &bq, flags | CPLXDEPS_EXPAND);
3276 if (i == 0 || i == 1)
3280 solver_addjobrule(solv, -SYSTEMSOLVABLE, 0, 0, jobidx, weak);
3283 for (i = 0; i < bq.count; i++)
3285 if (!bq.elements[i])
3287 for (j = 0; bq.elements[i + j + 1]; j++)
3290 solver_addjobrule(solv, bq.elements[i], 0, pool_ids2whatprovides(pool, bq.elements + i + 1, j), jobidx, weak);
3292 solver_addjobrule(solv, bq.elements[i], bq.elements[i + 1], 0, jobidx, weak);
3301 setup_favormap(Solver *solv)
3303 Queue *job = &solv->job;
3304 Pool *pool = solv->pool;
3306 Id p, pp, how, what, select;
3308 solv_free(solv->favormap);
3309 solv->favormap = solv_calloc(pool->nsolvables, sizeof(Id));
3310 for (i = 0; i < job->count; i += 2)
3312 how = job->elements[i];
3313 if ((how & SOLVER_JOBMASK) != SOLVER_FAVOR && (how & SOLVER_JOBMASK) != SOLVER_DISFAVOR)
3315 what = job->elements[i + 1];
3316 select = how & SOLVER_SELECTMASK;
3317 idx = (how & SOLVER_JOBMASK) == SOLVER_FAVOR ? i + 1 : -(i + 1);
3318 if (select == SOLVER_SOLVABLE_REPO)
3320 Repo *repo = pool_id2repo(pool, what);
3324 FOR_REPO_SOLVABLES(repo, p, s)
3326 solv->favormap[p] = idx;
3328 solv->havedisfavored = 1;
3332 FOR_JOB_SELECT(p, pp, select, what)
3334 solv->favormap[p] = idx;
3336 solv->havedisfavored = 1;
3348 solver_solve(Solver *solv, Queue *job)
3350 Pool *pool = solv->pool;
3351 Repo *installed = solv->installed;
3353 int oldnrules, initialnrules;
3354 Map addedmap; /* '1' == have pkg-rules for solvable */
3355 Map installcandidatemap;
3356 Id how, what, select, name, weak, p, pp, d;
3358 Solvable *s, *name_s;
3360 int now, solve_start;
3361 int needduprules = 0;
3362 int hasbestinstalljob = 0;
3363 int hasfavorjob = 0;
3366 solve_start = solv_timems(0);
3368 /* log solver options */
3369 POOL_DEBUG(SOLV_DEBUG_STATS, "solver started\n");
3370 POOL_DEBUG(SOLV_DEBUG_STATS, "dosplitprovides=%d, noupdateprovide=%d, noinfarchcheck=%d\n", solv->dosplitprovides, solv->noupdateprovide, solv->noinfarchcheck);
3371 POOL_DEBUG(SOLV_DEBUG_STATS, "allowuninstall=%d, allowdowngrade=%d, allownamechange=%d, allowarchchange=%d, allowvendorchange=%d\n", solv->allowuninstall, solv->allowdowngrade, solv->allownamechange, solv->allowarchchange, solv->allowvendorchange);
3372 POOL_DEBUG(SOLV_DEBUG_STATS, "dupallowdowngrade=%d, dupallownamechange=%d, dupallowarchchange=%d, dupallowvendorchange=%d\n", solv->dup_allowdowngrade, solv->dup_allownamechange, solv->dup_allowarchchange, solv->dup_allowvendorchange);
3373 POOL_DEBUG(SOLV_DEBUG_STATS, "promoteepoch=%d, forbidselfconflicts=%d\n", pool->promoteepoch, pool->forbidselfconflicts);
3374 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d, obsoleteusescolors=%d, implicitobsoleteusescolors=%d\n", pool->obsoleteusesprovides, pool->implicitobsoleteusesprovides, pool->obsoleteusescolors, pool->implicitobsoleteusescolors);
3375 POOL_DEBUG(SOLV_DEBUG_STATS, "dontinstallrecommended=%d, addalreadyrecommended=%d onlynamespacerecommended=%d\n", solv->dontinstallrecommended, solv->addalreadyrecommended, solv->only_namespace_recommended);
3377 /* create whatprovides if not already there */
3378 if (!pool->whatprovides)
3379 pool_createwhatprovides(pool);
3381 /* create obsolete index */
3382 policy_create_obsolete_index(solv);
3385 queue_free(&solv->job);
3386 queue_init_clone(&solv->job, job);
3387 solv->pooljobcnt = pool->pooljobs.count;
3388 if (pool->pooljobs.count)
3389 queue_insertn(&solv->job, 0, pool->pooljobs.count, pool->pooljobs.elements);
3392 /* free old stuff in case we re-run a solver */
3393 queuep_free(&solv->update_targets);
3394 queuep_free(&solv->cleandeps_updatepkgs);
3395 queue_empty(&solv->ruleassertions);
3396 solv->bestrules_info = solv_free(solv->bestrules_info);
3397 solv->yumobsrules_info = solv_free(solv->yumobsrules_info);
3398 solv->recommendsrules_info = solv_free(solv->recommendsrules_info);
3399 solv->choicerules_info = solv_free(solv->choicerules_info);
3400 if (solv->noupdate.size)
3401 map_empty(&solv->noupdate);
3402 map_zerosize(&solv->multiversion);
3403 solv->updatemap_all = 0;
3404 map_zerosize(&solv->updatemap);
3405 solv->bestupdatemap_all = 0;
3406 map_zerosize(&solv->bestupdatemap);
3407 solv->fixmap_all = 0;
3408 map_zerosize(&solv->fixmap);
3409 map_zerosize(&solv->dupmap);
3410 map_zerosize(&solv->dupinvolvedmap);
3411 solv->process_orphans = 0;
3412 solv->droporphanedmap_all = 0;
3413 map_zerosize(&solv->droporphanedmap);
3414 solv->allowuninstall_all = 0;
3415 map_zerosize(&solv->allowuninstallmap);
3416 map_zerosize(&solv->cleandepsmap);
3417 map_zerosize(&solv->weakrulemap);
3418 solv->favormap = solv_free(solv->favormap);
3419 queue_empty(&solv->weakruleq);
3420 solv->watches = solv_free(solv->watches);
3421 queue_empty(&solv->ruletojob);
3422 if (solv->decisionq.count)
3423 memset(solv->decisionmap, 0, pool->nsolvables * sizeof(Id));
3424 queue_empty(&solv->decisionq);
3425 queue_empty(&solv->decisionq_why);
3426 queue_empty(&solv->decisionq_reason);
3427 queue_empty(&solv->learnt_why);
3428 queue_empty(&solv->learnt_pool);
3429 queue_empty(&solv->branches);
3430 solv->propagate_index = 0;
3431 queue_empty(&solv->problems);
3432 queue_empty(&solv->solutions);
3433 queue_empty(&solv->orphaned);
3434 solv->stats_learned = solv->stats_unsolvable = 0;
3435 if (solv->recommends_index)
3437 map_empty(&solv->recommendsmap);
3438 map_empty(&solv->suggestsmap);
3439 queuep_free(&solv->recommendscplxq);
3440 queuep_free(&solv->suggestscplxq);
3441 solv->recommends_index = 0;
3443 queuep_free(&solv->brokenorphanrules);
3444 solv->specialupdaters = solv_free(solv->specialupdaters);
3448 * create basic rule set of all involved packages
3449 * use addedmap bitmap to make sure we don't create rules twice
3452 /* create multiversion map if needed */
3453 solver_calculate_multiversionmap(pool, job, &solv->multiversion);
3455 map_init(&addedmap, pool->nsolvables);
3456 MAPSET(&addedmap, SYSTEMSOLVABLE);
3458 map_init(&installcandidatemap, pool->nsolvables);
3461 now = solv_timems(0);
3463 * create rules for all package that could be involved with the solving
3464 * so called: pkg rules
3467 initialnrules = solv->pkgrules_end ? solv->pkgrules_end : 1;
3468 if (initialnrules > 1)
3469 deduceq2addedmap(solv, &addedmap); /* also enables all pkg rules */
3470 if (solv->nrules != initialnrules)
3471 solver_shrinkrules(solv, initialnrules); /* shrink to just pkg rules */
3472 solv->lastpkgrule = 0;
3473 solv->pkgrules_end = 0;
3477 /* check for update/verify jobs as they need to be known early */
3478 /* also setup the droporphaned map, we need it when creating update rules */
3479 for (i = 0; i < job->count; i += 2)
3481 how = job->elements[i];
3482 what = job->elements[i + 1];
3483 select = how & SOLVER_SELECTMASK;
3484 switch (how & SOLVER_JOBMASK)
3487 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3488 solv->fixmap_all = 1;
3489 FOR_JOB_SELECT(p, pp, select, what)
3491 s = pool->solvables + p;
3492 if (s->repo != installed)
3494 if (!solv->fixmap.size)
3495 map_grow(&solv->fixmap, installed->end - installed->start);
3496 MAPSET(&solv->fixmap, p - installed->start);
3500 if (select == SOLVER_SOLVABLE_ALL)
3502 solv->updatemap_all = 1;
3503 if (how & SOLVER_FORCEBEST)
3504 solv->bestupdatemap_all = 1;
3505 if (how & SOLVER_CLEANDEPS)
3507 FOR_REPO_SOLVABLES(installed, p, s)
3508 add_cleandeps_updatepkg(solv, p);
3511 else if (select == SOLVER_SOLVABLE_REPO)
3513 Repo *repo = pool_id2repo(pool, what);
3516 if (repo == installed && !(how & SOLVER_TARGETED))
3518 solv->updatemap_all = 1;
3519 if (how & SOLVER_FORCEBEST)
3520 solv->bestupdatemap_all = 1;
3521 if (how & SOLVER_CLEANDEPS)
3523 FOR_REPO_SOLVABLES(installed, p, s)
3524 add_cleandeps_updatepkg(solv, p);
3528 if (solv->noautotarget && !(how & SOLVER_TARGETED))
3530 /* targeted update */
3531 FOR_REPO_SOLVABLES(repo, p, s)
3532 add_update_target(solv, p, how);
3536 if (!(how & SOLVER_TARGETED))
3539 FOR_JOB_SELECT(p, pp, select, what)
3541 s = pool->solvables + p;
3542 if (s->repo != installed)
3544 if (!solv->updatemap.size)
3545 map_grow(&solv->updatemap, installed->end - installed->start);
3546 MAPSET(&solv->updatemap, p - installed->start);
3547 if (how & SOLVER_FORCEBEST)
3549 if (!solv->bestupdatemap.size)
3550 map_grow(&solv->bestupdatemap, installed->end - installed->start);
3551 MAPSET(&solv->bestupdatemap, p - installed->start);
3553 if (how & SOLVER_CLEANDEPS)
3554 add_cleandeps_updatepkg(solv, p);
3557 if (!targeted || solv->noautotarget)
3560 FOR_JOB_SELECT(p, pp, select, what)
3561 add_update_target(solv, p, how);
3564 case SOLVER_DROP_ORPHANED:
3565 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3566 solv->droporphanedmap_all = 1;
3567 FOR_JOB_SELECT(p, pp, select, what)
3569 s = pool->solvables + p;
3570 if (s->repo != installed)
3572 if (!solv->droporphanedmap.size)
3573 map_grow(&solv->droporphanedmap, installed->end - installed->start);
3574 MAPSET(&solv->droporphanedmap, p - installed->start);
3577 case SOLVER_ALLOWUNINSTALL:
3578 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3579 solv->allowuninstall_all = 1;
3580 FOR_JOB_SELECT(p, pp, select, what)
3582 s = pool->solvables + p;
3583 if (s->repo != installed)
3585 if (!solv->allowuninstallmap.size)
3586 map_grow(&solv->allowuninstallmap, installed->end - installed->start);
3587 MAPSET(&solv->allowuninstallmap, p - installed->start);
3595 if (solv->update_targets)
3596 transform_update_targets(solv);
3598 oldnrules = solv->nrules;
3599 FOR_REPO_SOLVABLES(installed, p, s)
3600 solver_addpkgrulesforsolvable(solv, s, &addedmap);
3601 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d pkg rules for installed solvables\n", solv->nrules - oldnrules);
3602 oldnrules = solv->nrules;
3603 FOR_REPO_SOLVABLES(installed, p, s)
3604 solver_addpkgrulesforupdaters(solv, s, &addedmap, 1);
3605 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d pkg rules for updaters of installed solvables\n", solv->nrules - oldnrules);
3609 * create rules for all packages involved in the job
3610 * (to be installed or removed)
3613 oldnrules = solv->nrules;
3614 for (i = 0; i < job->count; i += 2)
3616 how = job->elements[i];
3617 what = job->elements[i + 1];
3618 select = how & SOLVER_SELECTMASK;
3620 switch (how & SOLVER_JOBMASK)
3622 case SOLVER_INSTALL:
3623 FOR_JOB_SELECT(p, pp, select, what)
3625 MAPSET(&installcandidatemap, p);
3626 solver_addpkgrulesforsolvable(solv, pool->solvables + p, &addedmap);
3629 case SOLVER_DISTUPGRADE:
3631 if (select == SOLVER_SOLVABLE_ALL)
3632 solv->process_orphans = 1;
3638 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d pkg rules for packages involved in a job\n", solv->nrules - oldnrules);
3642 * add rules for suggests, enhances
3644 oldnrules = solv->nrules;
3645 solver_addpkgrulesforweak(solv, &addedmap);
3646 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d pkg rules because of weak dependencies\n", solv->nrules - oldnrules);
3648 #ifdef ENABLE_LINKED_PKGS
3649 oldnrules = solv->nrules;
3650 solver_addpkgrulesforlinked(solv, &addedmap);
3651 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d pkg rules because of linked packages\n", solv->nrules - oldnrules);
3655 * first pass done, we now have all the pkg rules we need.
3656 * unify existing rules before going over all job rules and
3658 * at this point the system is always solvable,
3659 * as an empty system (remove all packages) is a valid solution
3662 IF_POOLDEBUG (SOLV_DEBUG_STATS)
3664 int possible = 0, installable = 0;
3665 for (i = 1; i < pool->nsolvables; i++)
3667 if (pool_installable(pool, pool->solvables + i))
3669 if (MAPTST(&addedmap, i))
3672 POOL_DEBUG(SOLV_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
3675 if (solv->nrules > initialnrules)
3676 solver_unifyrules(solv); /* remove duplicate pkg rules */
3677 solv->pkgrules_end = solv->nrules; /* mark end of pkg rules */
3678 solv->lastpkgrule = 0;
3680 if (solv->nrules > initialnrules)
3681 addedmap2deduceq(solv, &addedmap); /* so that we can recreate the addedmap */
3683 POOL_DEBUG(SOLV_DEBUG_STATS, "pkg rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
3684 POOL_DEBUG(SOLV_DEBUG_STATS, "pkg rule creation took %d ms\n", solv_timems(now));
3686 /* create dup maps if needed. We need the maps early to create our
3689 solver_createdupmaps(solv);
3692 * create feature rules
3694 * foreach installed:
3695 * create assertion (keep installed, if no update available)
3697 * create update rule (A|update1(A)|update2(A)|...)
3699 * those are used later on to keep a version of the installed packages in
3703 solv->featurerules = solv->nrules; /* mark start of feature rules */
3706 /* foreach possibly installed solvable */
3707 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3709 if (s->repo != installed)
3711 solver_addrule(solv, 0, 0, 0); /* create dummy rule */
3714 solver_addfeaturerule(solv, s);
3716 /* make sure we accounted for all rules */
3717 assert(solv->nrules - solv->featurerules == installed->end - installed->start);
3719 solv->featurerules_end = solv->nrules;
3722 * Add update rules for installed solvables
3724 * almost identical to feature rules
3725 * except that downgrades/archchanges/vendorchanges are not allowed
3728 solv->updaterules = solv->nrules;
3731 { /* foreach installed solvables */
3732 /* we create all update rules, but disable some later on depending on the job */
3733 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3737 if (s->repo != installed)
3739 solver_addrule(solv, 0, 0, 0); /* create dummy rule */
3742 solver_addupdaterule(solv, s);
3744 * check for and remove duplicate
3746 r = solv->rules + solv->nrules - 1; /* r: update rule */
3747 sr = r - (installed->end - installed->start); /* sr: feature rule */
3751 memset(sr, 0, sizeof(*sr)); /* no feature rules without update rules */
3754 /* it's also orphaned if the feature rule consists just of the installed package */
3755 if (!solv->process_orphans && sr->p == i && !sr->d && !sr->w2)
3756 queue_push(&solv->orphaned, i);
3758 if (!solver_rulecmp(solv, r, sr))
3759 memset(sr, 0, sizeof(*sr)); /* delete unneeded feature rule */
3761 solver_disablerule(solv, sr); /* disable feature rule for now */
3763 /* consistency check: we added a rule for _every_ installed solvable */
3764 assert(solv->nrules - solv->updaterules == installed->end - installed->start);
3766 solv->updaterules_end = solv->nrules;
3770 * now add all job rules
3773 solv->jobrules = solv->nrules;
3774 for (i = 0; i < job->count; i += 2)
3776 oldnrules = solv->nrules;
3778 if (i && i == solv->pooljobcnt)
3779 POOL_DEBUG(SOLV_DEBUG_JOB, "end of pool jobs\n");
3780 how = job->elements[i];
3781 what = job->elements[i + 1];
3782 weak = how & SOLVER_WEAK;
3783 select = how & SOLVER_SELECTMASK;
3784 switch (how & SOLVER_JOBMASK)
3786 case SOLVER_INSTALL:
3787 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3788 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3789 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3790 if (select == SOLVER_SOLVABLE)
3795 #ifdef ENABLE_COMPLEX_DEPS
3796 else if ((select == SOLVER_SOLVABLE_PROVIDES || select == SOLVER_SOLVABLE_NAME) && pool_is_complex_dep(pool, what))
3798 if (add_complex_jobrules(solv, what, select == SOLVER_SOLVABLE_NAME ? CPLXDEPS_NAME : 0, i, weak))
3799 if (how & SOLVER_FORCEBEST)
3800 hasbestinstalljob = 1;
3807 FOR_JOB_SELECT(p, pp, select, what)
3811 if (select == SOLVER_SOLVABLE_ONE_OF)
3812 break; /* ignore empty installs */
3813 /* no candidate found or unsupported, make this an impossible rule */
3814 queue_push(&q, -SYSTEMSOLVABLE);
3816 p = queue_shift(&q); /* get first candidate */
3817 d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q); /* internalize */
3819 /* force install of namespace supplements hack */
3820 if (select == SOLVER_SOLVABLE_PROVIDES && !d && (p == SYSTEMSOLVABLE || p == -SYSTEMSOLVABLE) && ISRELDEP(what))
3822 Reldep *rd = GETRELDEP(pool, what);
3823 if (rd->flags == REL_NAMESPACE)
3826 if (!solv->installsuppdepq)
3828 solv->installsuppdepq = solv_calloc(1, sizeof(Queue));
3829 queue_init(solv->installsuppdepq);
3831 queue_pushunique(solv->installsuppdepq, rd->evr == 0 ? rd->name : what);
3834 solver_addjobrule(solv, p, 0, d, i, weak);
3835 if (how & SOLVER_FORCEBEST)
3836 hasbestinstalljob = 1;
3839 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %s%serase %s\n", weak ? "weak " : "", how & SOLVER_CLEANDEPS ? "clean deps " : "", solver_select2str(pool, select, what));
3840 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3841 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3842 /* specific solvable: by id or by nevra */
3843 name = (select == SOLVER_SOLVABLE || (select == SOLVER_SOLVABLE_NAME && ISRELDEP(what))) ? 0 : -1;
3845 if (select == SOLVER_SOLVABLE_ALL) /* hmmm ;) */
3847 FOR_POOL_SOLVABLES(p)
3848 solver_addjobrule(solv, -p, 0, 0, i, weak);
3850 else if (select == SOLVER_SOLVABLE_REPO)
3852 Repo *repo = pool_id2repo(pool, what);
3855 FOR_REPO_SOLVABLES(repo, p, s)
3856 solver_addjobrule(solv, -p, 0, 0, i, weak);
3859 #ifdef ENABLE_COMPLEX_DEPS
3860 else if ((select == SOLVER_SOLVABLE_PROVIDES || select == SOLVER_SOLVABLE_NAME) && pool_is_complex_dep(pool, what))
3862 /* no special "erase a specific solvable" handling? */
3863 add_complex_jobrules(solv, what, select == SOLVER_SOLVABLE_NAME ? (CPLXDEPS_NAME | CPLXDEPS_TODNF | CPLXDEPS_INVERT) : (CPLXDEPS_TODNF | CPLXDEPS_INVERT), i, weak);
3867 FOR_JOB_SELECT(p, pp, select, what)
3869 s = pool->solvables + p;
3870 if (installed && s->repo == installed)
3872 name = !name ? s->name : -1;
3875 solver_addjobrule(solv, -p, 0, 0, i, weak);
3876 #ifdef ENABLE_LINKED_PKGS
3877 if (solv->instbuddy && installed && s->repo == installed && solv->instbuddy[p - installed->start] > 1)
3878 solver_addjobrule(solv, -solv->instbuddy[p - installed->start], 0, 0, i, weak);
3881 /* special case for "erase a specific solvable": we also
3882 * erase all other solvables with that name, so that they
3883 * don't get picked up as replacement.
3884 * name is > 0 if exactly one installed solvable matched.
3886 /* XXX: look also at packages that obsolete this package? */
3891 FOR_PROVIDES(p, pp, name)
3893 s = pool->solvables + p;
3894 if (s->name != name)
3896 /* keep other versions installed */
3897 if (s->repo == installed)
3899 /* keep installcandidates of other jobs */
3900 if (MAPTST(&installcandidatemap, p))
3902 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, name_s, s))
3904 /* don't add the same rule twice */
3905 for (j = oldnrules; j < k; j++)
3906 if (solv->rules[j].p == -p)
3909 solver_addjobrule(solv, -p, 0, 0, i, weak); /* remove by id */
3915 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3918 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sverify %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3920 case SOLVER_WEAKENDEPS:
3921 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3922 if (select != SOLVER_SOLVABLE)
3924 s = pool->solvables + what;
3925 weaken_solvable_deps(solv, what);
3927 case SOLVER_MULTIVERSION:
3928 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %smultiversion %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3931 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3932 if (select == SOLVER_SOLVABLE_ALL)
3934 FOR_POOL_SOLVABLES(p)
3935 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, 0, i, weak);
3937 else if (select == SOLVER_SOLVABLE_REPO)
3939 Repo *repo = pool_id2repo(pool, what);
3942 FOR_REPO_SOLVABLES(repo, p, s)
3943 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, 0, i, weak);
3946 FOR_JOB_SELECT(p, pp, select, what)
3948 s = pool->solvables + p;
3949 solver_addjobrule(solv, installed && s->repo == installed ? p : -p, 0, 0, i, weak);
3950 #ifdef ENABLE_LINKED_PKGS
3951 if (solv->instbuddy && installed && s->repo == installed && solv->instbuddy[p - installed->start] > 1)
3952 solver_addjobrule(solv, solv->instbuddy[p - installed->start], 0, 0, i, weak);
3955 if (solv->nrules != oldnrules)
3958 case SOLVER_DISTUPGRADE:
3959 POOL_DEBUG(SOLV_DEBUG_JOB, "job: distupgrade %s\n", solver_select2str(pool, select, what));
3961 case SOLVER_DROP_ORPHANED:
3962 POOL_DEBUG(SOLV_DEBUG_JOB, "job: drop orphaned %s\n", solver_select2str(pool, select, what));
3964 case SOLVER_USERINSTALLED:
3965 POOL_DEBUG(SOLV_DEBUG_JOB, "job: user installed %s\n", solver_select2str(pool, select, what));
3967 case SOLVER_ALLOWUNINSTALL:
3968 POOL_DEBUG(SOLV_DEBUG_JOB, "job: allowuninstall %s\n", solver_select2str(pool, select, what));
3971 case SOLVER_DISFAVOR:
3972 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %s %s\n", (how & SOLVER_JOBMASK) == SOLVER_FAVOR ? "favor" : "disfavor", solver_select2str(pool, select, what));
3976 POOL_DEBUG(SOLV_DEBUG_JOB, "job: unknown job\n");
3980 IF_POOLDEBUG (SOLV_DEBUG_JOB)
3983 if (solv->nrules == oldnrules)
3984 POOL_DEBUG(SOLV_DEBUG_JOB, " - no rule created\n");
3985 for (j = oldnrules; j < solv->nrules; j++)
3987 POOL_DEBUG(SOLV_DEBUG_JOB, " - job ");
3988 solver_printrule(solv, SOLV_DEBUG_JOB, solv->rules + j);
3992 assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
3993 solv->jobrules_end = solv->nrules;
3995 /* create favormap if we have favor jobs */
3997 setup_favormap(solv);
3999 /* now create infarch and dup rules */
4000 if (!solv->noinfarchcheck)
4001 solver_addinfarchrules(solv, &addedmap);
4003 solv->infarchrules = solv->infarchrules_end = solv->nrules;
4005 if (solv->dupinvolvedmap_all || solv->dupinvolvedmap.size)
4006 solver_addduprules(solv, &addedmap);
4008 solv->duprules = solv->duprules_end = solv->nrules;
4010 #ifdef ENABLE_LINKED_PKGS
4011 if (solv->instbuddy && solv->updatemap.size)
4012 extend_updatemap_to_buddies(solv);
4015 if (solv->bestupdatemap_all || solv->bestupdatemap.size || hasbestinstalljob)
4016 solver_addbestrules(solv, hasbestinstalljob, haslockjob);
4018 solv->bestrules = solv->bestrules_end = solv->bestrules_up = solv->nrules;
4021 solver_freedupmaps(solv); /* no longer needed */
4023 if (solv->do_yum_obsoletes)
4024 solver_addyumobsrules(solv);
4026 solv->yumobsrules = solv->yumobsrules_end = solv->nrules;
4028 if (solv->havedisfavored && solv->strongrecommends && solv->recommendsruleq)
4029 solver_addrecommendsrules(solv);
4031 solv->recommendsrules = solv->recommendsrules_end = solv->nrules;
4034 solver_addchoicerules(solv);
4036 solv->choicerules = solv->choicerules_end = solv->nrules;
4038 /* all rules created
4039 * --------------------------------------------------------------
4040 * prepare for solving
4043 /* free unneeded memory */
4044 map_free(&addedmap);
4045 map_free(&installcandidatemap);
4048 POOL_DEBUG(SOLV_DEBUG_STATS, "%d pkg rules, 2 * %d update rules, %d job rules, %d infarch rules, %d dup rules, %d choice rules, %d best rules, %d yumobs rules\n", solv->pkgrules_end - 1, solv->updaterules_end - solv->updaterules, solv->jobrules_end - solv->jobrules, solv->infarchrules_end - solv->infarchrules, solv->duprules_end - solv->duprules, solv->choicerules_end - solv->choicerules, solv->bestrules_end - solv->bestrules, solv->yumobsrules_end - solv->yumobsrules);
4049 POOL_DEBUG(SOLV_DEBUG_STATS, "overall rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
4051 /* create weak map */
4052 if (solv->weakruleq.count || solv->recommendsruleq)
4054 map_grow(&solv->weakrulemap, solv->nrules);
4055 for (i = 0; i < solv->weakruleq.count; i++)
4057 p = solv->weakruleq.elements[i];
4058 MAPSET(&solv->weakrulemap, p);
4060 if (solv->recommendsruleq)
4062 for (i = 0; i < solv->recommendsruleq->count; i++)
4064 p = solv->recommendsruleq->elements[i];
4065 MAPSET(&solv->weakrulemap, p);
4070 /* enable cleandepsmap creation if we have updatepkgs */
4071 if (solv->cleandeps_updatepkgs && !solv->cleandepsmap.size)
4072 map_grow(&solv->cleandepsmap, installed->end - installed->start);
4074 if (solv->cleandeps_mistakes)
4076 queue_free(solv->cleandeps_mistakes);
4077 solv->cleandeps_mistakes = solv_free(solv->cleandeps_mistakes);
4080 /* all new rules are learnt after this point */
4081 solv->learntrules = solv->nrules;
4083 /* create watches chains */
4086 /* create assertion index. it is only used to speed up
4087 * makeruledecsions() a bit */
4088 for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
4089 if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
4090 queue_push(&solv->ruleassertions, i);
4092 /* disable update rules that conflict with our job */
4093 solver_disablepolicyrules(solv);
4095 /* break orphans if requested */
4096 if (solv->process_orphans && solv->orphaned.count && solv->break_orphans)
4097 solver_breakorphans(solv);
4100 * ********************************************
4102 * ********************************************
4105 now = solv_timems(0);
4106 solver_run_sat(solv, 1, solv->dontinstallrecommended ? 0 : 1);
4107 POOL_DEBUG(SOLV_DEBUG_STATS, "solver took %d ms\n", solv_timems(now));
4110 * prepare solution queue if there were problems
4112 solver_prepare_solutions(solv);
4114 POOL_DEBUG(SOLV_DEBUG_STATS, "final solver statistics: %d problems, %d learned rules, %d unsolvable\n", solv->problems.count / 2, solv->stats_learned, solv->stats_unsolvable);
4115 POOL_DEBUG(SOLV_DEBUG_STATS, "solver_solve took %d ms\n", solv_timems(solve_start));
4117 /* return number of problems */
4118 return solv->problems.count ? solv->problems.count / 2 : 0;
4122 solver_create_transaction(Solver *solv)
4124 return transaction_create_decisionq(solv->pool, &solv->decisionq, &solv->multiversion);
4127 void solver_get_orphaned(Solver *solv, Queue *orphanedq)
4129 queue_free(orphanedq);
4130 queue_init_clone(orphanedq, &solv->orphaned);
4133 void solver_get_cleandeps(Solver *solv, Queue *cleandepsq)
4135 Pool *pool = solv->pool;
4136 Repo *installed = solv->installed;
4141 queue_empty(cleandepsq);
4142 if (!installed || !solv->cleandepsmap.size)
4144 FOR_REPO_SOLVABLES(installed, p, s)
4146 if (!MAPTST(&solv->cleandepsmap, p - installed->start) || solv->decisionmap[p] >= 0)
4148 /* now check the update rule */
4149 r = solv->rules + solv->updaterules + (p - solv->installed->start);
4152 FOR_RULELITERALS(pr, pp, r)
4153 if (solv->decisionmap[pr] > 0)
4158 queue_push(cleandepsq, p);
4162 void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected)
4164 Pool *pool = solv->pool;
4165 Queue redoq, disabledq;
4171 if (!recommendationsq && !suggestionsq)
4174 map_init(&obsmap, pool->nsolvables);
4175 if (solv->installed)
4177 Id obs, *obsp, p, po, ppo;
4178 for (p = solv->installed->start; p < solv->installed->end; p++)
4180 s = pool->solvables + p;
4181 if (s->repo != solv->installed || !s->obsoletes)
4183 if (solv->decisionmap[p] <= 0)
4185 if (solv->multiversion.size && MAPTST(&solv->multiversion, p))
4187 obsp = s->repo->idarraydata + s->obsoletes;
4188 /* foreach obsoletes */
4189 while ((obs = *obsp++) != 0)
4190 FOR_PROVIDES(po, ppo, obs)
4191 MAPSET(&obsmap, po);
4196 queue_init(&disabledq);
4198 /* disable all erase jobs (including weak "keep uninstalled" rules) */
4199 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
4201 if (r->d < 0) /* disabled ? */
4203 if (r->p >= 0) /* install job? */
4205 queue_push(&disabledq, i);
4206 solver_disablerule(solv, r);
4212 enabledisablelearntrules(solv);
4213 removedisabledconflicts(solv, &redoq);
4217 * find recommended packages
4219 if (recommendationsq)
4221 Id rec, *recp, p, pp;
4223 queue_empty(recommendationsq);
4224 /* create map of all recommened packages */
4225 solv->recommends_index = -1;
4226 MAPZERO(&solv->recommendsmap);
4228 /* put all packages the solver already chose in the map */
4229 for (i = 1; i < solv->decisionq.count; i++)
4230 if ((p = solv->decisionq.elements[i]) > 0 && solv->decisionq_why.elements[i] == 0)
4232 if (solv->decisionq_reason.elements[solv->decisionmap[p]] == SOLVER_REASON_WEAKDEP)
4233 MAPSET(&solv->recommendsmap, p);
4236 for (i = 0; i < solv->decisionq.count; i++)
4238 p = solv->decisionq.elements[i];
4241 s = pool->solvables + p;
4244 recp = s->repo->idarraydata + s->recommends;
4245 while ((rec = *recp++) != 0)
4247 #ifdef ENABLE_COMPLEX_DEPS
4248 if (pool_is_complex_dep(pool, rec))
4250 do_complex_recommendations(solv, rec, &solv->recommendsmap, noselected);
4254 FOR_PROVIDES(p, pp, rec)
4255 if (solv->decisionmap[p] > 0)
4261 FOR_PROVIDES(p, pp, rec)
4262 if (solv->decisionmap[p] > 0)
4263 MAPSET(&solv->recommendsmap, p);
4265 continue; /* p != 0: already fulfilled */
4267 FOR_PROVIDES(p, pp, rec)
4268 MAPSET(&solv->recommendsmap, p);
4272 for (i = 1; i < pool->nsolvables; i++)
4274 if (solv->decisionmap[i] < 0)
4276 if (solv->decisionmap[i] > 0 && noselected)
4278 if (MAPTST(&obsmap, i))
4280 s = pool->solvables + i;
4281 if (!MAPTST(&solv->recommendsmap, i))
4283 if (!s->supplements)
4285 if (!pool_installable(pool, s))
4287 if (!solver_is_supplementing(solv, s))
4290 queue_push(recommendationsq, i);
4292 /* we use MODE_SUGGEST here so that repo prio is ignored */
4293 policy_filter_unwanted(solv, recommendationsq, POLICY_MODE_SUGGEST);
4297 * find suggested packages
4302 Id sug, *sugp, p, pp;
4304 queue_empty(suggestionsq);
4305 /* create map of all suggests that are still open */
4306 solv->recommends_index = -1;
4307 MAPZERO(&solv->suggestsmap);
4308 for (i = 0; i < solv->decisionq.count; i++)
4310 p = solv->decisionq.elements[i];
4313 s = pool->solvables + p;
4316 sugp = s->repo->idarraydata + s->suggests;
4317 while ((sug = *sugp++) != 0)
4319 #ifdef ENABLE_COMPLEX_DEPS
4320 if (pool_is_complex_dep(pool, sug))
4322 do_complex_recommendations(solv, sug, &solv->suggestsmap, noselected);
4326 FOR_PROVIDES(p, pp, sug)
4327 if (solv->decisionmap[p] > 0)
4333 FOR_PROVIDES(p, pp, sug)
4334 if (solv->decisionmap[p] > 0)
4335 MAPSET(&solv->suggestsmap, p);
4337 continue; /* already fulfilled */
4339 FOR_PROVIDES(p, pp, sug)
4340 MAPSET(&solv->suggestsmap, p);
4344 for (i = 1; i < pool->nsolvables; i++)
4346 if (solv->decisionmap[i] < 0)
4348 if (solv->decisionmap[i] > 0 && noselected)
4350 if (MAPTST(&obsmap, i))
4352 s = pool->solvables + i;
4353 if (!MAPTST(&solv->suggestsmap, i))
4357 if (!pool_installable(pool, s))
4359 if (!solver_is_enhancing(solv, s))
4362 queue_push(suggestionsq, i);
4364 policy_filter_unwanted(solv, suggestionsq, POLICY_MODE_SUGGEST);
4367 /* undo removedisabledconflicts */
4369 undo_removedisabledconflicts(solv, &redoq);
4372 /* undo job rule disabling */
4373 for (i = 0; i < disabledq.count; i++)
4374 solver_enablerule(solv, solv->rules + disabledq.elements[i]);
4375 queue_free(&disabledq);
4380 /***********************************************************************/
4381 /* disk usage computations */
4383 /*-------------------------------------------------------------------
4385 * calculate DU changes
4389 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
4393 solver_create_state_maps(solv, &installedmap, 0);
4394 pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
4395 map_free(&installedmap);
4399 /*-------------------------------------------------------------------
4401 * calculate changes in install size
4405 solver_calc_installsizechange(Solver *solv)
4410 solver_create_state_maps(solv, &installedmap, 0);
4411 change = pool_calc_installsizechange(solv->pool, &installedmap);
4412 map_free(&installedmap);
4417 solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap)
4419 pool_create_state_maps(solv->pool, &solv->decisionq, installedmap, conflictsmap);
4422 /*-------------------------------------------------------------------
4424 * decision introspection
4428 solver_get_decisionlevel(Solver *solv, Id p)
4430 return solv->decisionmap[p];
4434 solver_get_decisionqueue(Solver *solv, Queue *decisionq)
4436 queue_free(decisionq);
4437 queue_init_clone(decisionq, &solv->decisionq);
4441 solver_get_lastdecisionblocklevel(Solver *solv)
4444 if (solv->decisionq.count == 0)
4446 p = solv->decisionq.elements[solv->decisionq.count - 1];
4449 return solv->decisionmap[p] < 0 ? -solv->decisionmap[p] : solv->decisionmap[p];
4453 solver_get_decisionblock(Solver *solv, int level, Queue *decisionq)
4458 queue_empty(decisionq);
4459 for (i = 0; i < solv->decisionq.count; i++)
4461 p = solv->decisionq.elements[i];
4464 if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
4467 if (i == solv->decisionq.count)
4469 for (i = 0; i < solv->decisionq.count; i++)
4471 p = solv->decisionq.elements[i];
4474 if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
4475 queue_push(decisionq, p);
4482 solver_describe_decision(Solver *solv, Id p, Id *infop)
4489 if (!solv->decisionmap[p])
4490 return SOLVER_REASON_UNRELATED;
4491 pp = solv->decisionmap[p] < 0 ? -p : p;
4492 for (i = 0; i < solv->decisionq.count; i++)
4493 if (solv->decisionq.elements[i] == pp)
4495 if (i == solv->decisionq.count) /* just in case... */
4496 return SOLVER_REASON_UNRELATED;
4497 why = solv->decisionq_why.elements[i];
4499 *infop = why > 0 ? why : -why;
4501 return SOLVER_REASON_UNIT_RULE;
4502 i = solv->decisionmap[p] >= 0 ? solv->decisionmap[p] : -solv->decisionmap[p];
4503 return solv->decisionq_reason.elements[i];
4508 solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq)
4510 Pool *pool = solv->pool;
4512 int level = solv->decisionmap[p];
4519 for (decisionno = 0; decisionno < solv->decisionq.count; decisionno++)
4520 if (solv->decisionq.elements[decisionno] == p)
4522 if (decisionno == solv->decisionq.count)
4524 i = solv->decisionmap[p] >= 0 ? solv->decisionmap[p] : -solv->decisionmap[p];
4525 if (solv->decisionq_reason.elements[i] != SOLVER_REASON_WEAKDEP)
4528 /* 1) list all packages that recommend us */
4529 for (i = 1; i < pool->nsolvables; i++)
4531 Id *recp, rec, pp2, p2;
4532 if (solv->decisionmap[i] <= 0 || solv->decisionmap[i] >= level)
4534 s = pool->solvables + i;
4537 if (!solv->addalreadyrecommended && s->repo == solv->installed)
4539 recp = s->repo->idarraydata + s->recommends;
4540 while ((rec = *recp++) != 0)
4543 FOR_PROVIDES(p2, pp2, rec)
4549 /* if p2 is already installed, this recommends is ignored */
4550 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
4556 queue_push(whyq, SOLVER_REASON_RECOMMENDED);
4557 queue_push2(whyq, i, rec);
4561 /* 2) list all supplements */
4562 s = pool->solvables + p;
4563 if (s->supplements && level > 0)
4565 Id *supp, sup, pp2, p2;
4566 /* this is a hack. to use solver_dep_fulfilled we temporarily clear
4567 * everything above our level in the decisionmap */
4568 for (i = decisionno; i < solv->decisionq.count; i++ )
4570 p2 = solv->decisionq.elements[i];
4572 solv->decisionmap[p2] = -solv->decisionmap[p2];
4574 supp = s->repo->idarraydata + s->supplements;
4575 while ((sup = *supp++) != 0)
4576 if (solver_dep_fulfilled(solv, sup))
4579 /* let's see if this is an easy supp */
4580 FOR_PROVIDES(p2, pp2, sup)
4582 if (!solv->addalreadyrecommended && solv->installed)
4584 if (pool->solvables[p2].repo == solv->installed)
4587 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
4589 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
4590 queue_push2(whyq, p2, sup);
4596 /* hard case, just note dependency with no package */
4597 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
4598 queue_push2(whyq, 0, sup);
4601 for (i = decisionno; i < solv->decisionq.count; i++)
4603 p2 = solv->decisionq.elements[i];
4605 solv->decisionmap[p2] = -solv->decisionmap[p2];
4611 pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what)
4614 how &= SOLVER_SELECTMASK;
4616 if (how == SOLVER_SOLVABLE_ALL)
4618 FOR_POOL_SOLVABLES(p)
4619 queue_push(pkgs, p);
4621 else if (how == SOLVER_SOLVABLE_REPO)
4623 Repo *repo = pool_id2repo(pool, what);
4627 FOR_REPO_SOLVABLES(repo, p, s)
4628 queue_push(pkgs, p);
4633 FOR_JOB_SELECT(p, pp, how, what)
4634 queue_push(pkgs, p);
4639 pool_isemptyupdatejob(Pool *pool, Id how, Id what)
4642 Id select = how & SOLVER_SELECTMASK;
4643 if ((how & SOLVER_JOBMASK) != SOLVER_UPDATE)
4645 if (select == SOLVER_SOLVABLE_ALL || select == SOLVER_SOLVABLE_REPO)
4647 if (!pool->installed)
4649 FOR_JOB_SELECT(p, pp, select, what)
4650 if (pool->solvables[p].repo == pool->installed)
4653 FOR_JOB_SELECT(p, pp, select, what)
4655 Solvable *s = pool->solvables + p;
4656 FOR_PROVIDES(pi, pip, s->name)
4658 Solvable *si = pool->solvables + pi;
4659 if (si->repo != pool->installed || si->name != s->name)
4665 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
4666 while ((obs = *obsp++) != 0)
4668 FOR_PROVIDES(pi, pip, obs)
4670 Solvable *si = pool->solvables + pi;
4671 if (si->repo != pool->installed)
4673 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
4675 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
4686 solver_alternatives_count(Solver *solv)
4688 Id *elements = solv->branches.elements;
4690 for (res = 0, count = solv->branches.count; count; res++)
4691 count -= elements[count - 2];
4696 solver_get_alternative(Solver *solv, Id alternative, Id *idp, Id *fromp, Id *chosenp, Queue *choices, int *levelp)
4698 int cnt = solver_alternatives_count(solv);
4699 int count = solv->branches.count;
4700 Id *elements = solv->branches.elements;
4702 queue_empty(choices);
4703 if (alternative <= 0 || alternative > cnt)
4706 for (; cnt > alternative; cnt--)
4707 elements -= elements[-2];
4709 *levelp = elements[-1];
4711 *fromp = elements[-4];
4713 *idp = elements[-3];
4718 for (i = elements[-2]; i > 4; i--)
4720 Id p = -elements[-i];
4721 if (p > 0 && solv->decisionmap[p] == elements[-1] + 1)
4729 queue_insertn(choices, 0, elements[-2] - 4, elements - elements[-2]);
4730 return elements[-4] ? SOLVER_ALTERNATIVE_TYPE_RECOMMENDS : SOLVER_ALTERNATIVE_TYPE_RULE;
4734 solver_select2str(Pool *pool, Id select, Id what)
4738 select &= SOLVER_SELECTMASK;
4739 if (select == SOLVER_SOLVABLE)
4740 return pool_solvid2str(pool, what);
4741 if (select == SOLVER_SOLVABLE_NAME)
4742 return pool_dep2str(pool, what);
4743 if (select == SOLVER_SOLVABLE_PROVIDES)
4745 s = pool_dep2str(pool, what);
4746 b = pool_alloctmpspace(pool, 11 + strlen(s));
4747 sprintf(b, "providing %s", s);
4750 if (select == SOLVER_SOLVABLE_ONE_OF)
4754 while ((p = pool->whatprovidesdata[what++]) != 0)
4756 s = pool_solvid2str(pool, p);
4758 b = pool_tmpappend(pool, b, ", ", s);
4760 b = pool_tmpjoin(pool, s, 0, 0);
4761 pool_freetmpspace(pool, s);
4763 return b ? b : "nothing";
4765 if (select == SOLVER_SOLVABLE_REPO)
4767 b = pool_alloctmpspace(pool, 20);
4768 sprintf(b, "repo #%d", what);
4771 if (select == SOLVER_SOLVABLE_ALL)
4772 return "all packages";
4773 return "unknown job select";
4777 pool_job2str(Pool *pool, Id how, Id what, Id flagmask)
4779 Id select = how & SOLVER_SELECTMASK;
4780 const char *strstart = 0, *strend = 0;
4784 switch (how & SOLVER_JOBMASK)
4787 return "do nothing";
4788 case SOLVER_INSTALL:
4789 if (select == SOLVER_SOLVABLE && pool->installed && pool->solvables[what].repo == pool->installed)
4790 strstart = "keep ", strend = " installed";
4791 else if (select == SOLVER_SOLVABLE || select == SOLVER_SOLVABLE_NAME)
4792 strstart = "install ";
4793 else if (select == SOLVER_SOLVABLE_PROVIDES)
4794 strstart = "install a package ";
4796 strstart = "install one of ";
4799 if (select == SOLVER_SOLVABLE && !(pool->installed && pool->solvables[what].repo == pool->installed))
4800 strstart = "keep ", strend = " uninstalled";
4801 else if (select == SOLVER_SOLVABLE_PROVIDES)
4802 strstart = "deinstall all packages ";
4804 strstart = "deinstall ";
4807 strstart = "update ";
4809 case SOLVER_WEAKENDEPS:
4810 strstart = "weaken deps of ";
4812 case SOLVER_MULTIVERSION:
4813 strstart = "multi version ";
4818 case SOLVER_DISTUPGRADE:
4819 strstart = "dist upgrade ";
4822 strstart = "verify ";
4824 case SOLVER_DROP_ORPHANED:
4825 strstart = "deinstall ", strend = " if orphaned";
4827 case SOLVER_USERINSTALLED:
4828 strstart = "regard ", strend = " as userinstalled";
4830 case SOLVER_ALLOWUNINSTALL:
4831 strstart = "allow deinstallation of ";
4834 strstart = "favor ";
4836 case SOLVER_DISFAVOR:
4837 strstart = "disfavor ";
4840 strstart = "unknown job ";
4843 s = pool_tmpjoin(pool, strstart, solver_select2str(pool, select, what), strend);
4845 if ((how & ~(SOLVER_SELECTMASK|SOLVER_JOBMASK)) == 0)
4848 s = pool_tmpappend(pool, s, " ", 0);
4849 if (how & SOLVER_WEAK)
4850 s = pool_tmpappend(pool, s, ",weak", 0);
4851 if (how & SOLVER_ESSENTIAL)
4852 s = pool_tmpappend(pool, s, ",essential", 0);
4853 if (how & SOLVER_CLEANDEPS)
4854 s = pool_tmpappend(pool, s, ",cleandeps", 0);
4855 if (how & SOLVER_ORUPDATE)
4856 s = pool_tmpappend(pool, s, ",orupdate", 0);
4857 if (how & SOLVER_FORCEBEST)
4858 s = pool_tmpappend(pool, s, ",forcebest", 0);
4859 if (how & SOLVER_TARGETED)
4860 s = pool_tmpappend(pool, s, ",targeted", 0);
4861 if (how & SOLVER_SETEV)
4862 s = pool_tmpappend(pool, s, ",setev", 0);
4863 if (how & SOLVER_SETEVR)
4864 s = pool_tmpappend(pool, s, ",setevr", 0);
4865 if (how & SOLVER_SETARCH)
4866 s = pool_tmpappend(pool, s, ",setarch", 0);
4867 if (how & SOLVER_SETVENDOR)
4868 s = pool_tmpappend(pool, s, ",setvendor", 0);
4869 if (how & SOLVER_SETREPO)
4870 s = pool_tmpappend(pool, s, ",setrepo", 0);
4871 if (how & SOLVER_SETNAME)
4872 s = pool_tmpappend(pool, s, ",setname", 0);
4873 if (how & SOLVER_NOAUTOSET)
4874 s = pool_tmpappend(pool, s, ",noautoset", 0);
4875 if (s[o + 1] != ',')
4876 s = pool_tmpappend(pool, s, ",?", 0);
4878 return pool_tmpappend(pool, s, "]", 0);
4882 solver_alternative2str(Solver *solv, int type, Id id, Id from)
4884 Pool *pool = solv->pool;
4885 if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
4887 const char *s = pool_dep2str(pool, id);
4888 return pool_tmpappend(pool, s, ", recommended by ", pool_solvid2str(pool, from));
4890 if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
4893 Id depfrom, depto, dep;
4895 if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
4896 id = solver_rule2pkgrule(solv, id);
4897 if (solver_ruleclass(solv, id) == SOLVER_RULE_RECOMMENDS)
4898 id = solver_rule2pkgrule(solv, id);
4899 rtype = solver_ruleinfo(solv, id, &depfrom, &depto, &dep);
4900 if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
4902 if ((depto & SOLVER_SELECTMASK) == SOLVER_SOLVABLE_PROVIDES)
4903 return pool_dep2str(pool, dep);
4904 return solver_select2str(pool, depto & SOLVER_SELECTMASK, dep);
4906 if (rtype == SOLVER_RULE_PKG_REQUIRES)
4908 const char *s = pool_dep2str(pool, dep);
4909 return pool_tmpappend(pool, s, ", required by ", pool_solvid2str(pool, depfrom));
4911 sprintf(buf, "Rule #%d", id);
4912 return pool_tmpjoin(pool, buf, 0, 0);
4914 return "unknown alternative type";