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 #define RULES_BLOCK 63
31 /********************************************************************
33 * dependency check helpers
37 /*-------------------------------------------------------------------
38 * handle split provides
40 * a splitprovides dep looks like
41 * namespace:splitprovides(pkg REL_WITH path)
42 * and is only true if pkg is installed and contains the specified path.
43 * we also make sure that pkg is selected for an update, otherwise the
44 * update would always be forced onto the user.
47 solver_splitprovides(Solver *solv, Id dep)
49 Pool *pool = solv->pool;
54 if (!solv->dosplitprovides || !solv->installed || (!solv->updatemap_all && !solv->updatemap.size))
58 rd = GETRELDEP(pool, dep);
59 if (rd->flags != REL_WITH)
61 FOR_PROVIDES(p, pp, dep)
63 /* here we have packages that provide the correct name and contain the path,
64 * now do extra filtering */
65 s = pool->solvables + p;
66 if (s->repo == solv->installed && s->name == rd->name &&
67 (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, p - solv->installed->start))))
74 /*-------------------------------------------------------------------
75 * solver_dep_installed
79 solver_dep_installed(Solver *solv, Id dep)
82 Pool *pool = solv->pool;
87 Reldep *rd = GETRELDEP(pool, dep);
88 if (rd->flags == REL_AND)
90 if (!solver_dep_installed(solv, rd->name))
92 return solver_dep_installed(solv, rd->evr);
94 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
95 return solver_dep_installed(solv, rd->evr);
97 FOR_PROVIDES(p, pp, dep)
99 if (p == SYSTEMSOLVABLE || (solv->installed && pool->solvables[p].repo == solv->installed))
106 /* mirrors solver_dep_installed, but returns 2 if a
107 * dependency listed in solv->installsuppdepq was involved */
109 solver_check_installsuppdepq_dep(Solver *solv, Id dep)
111 Pool *pool = solv->pool;
117 Reldep *rd = GETRELDEP(pool, dep);
118 if (rd->flags == REL_AND)
120 int r2, r1 = solver_check_installsuppdepq_dep(solv, rd->name);
123 r2 = solver_check_installsuppdepq_dep(solv, rd->evr);
126 return r1 == 2 || r2 == 2 ? 2 : 1;
128 if (rd->flags == REL_OR)
130 int r2, r1 = solver_check_installsuppdepq_dep(solv, rd->name);
131 r2 = solver_check_installsuppdepq_dep(solv, rd->evr);
134 return r1 == 2 || r2 == 2 ? 2 : 1;
136 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
137 return solver_splitprovides(solv, rd->evr);
138 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
139 return solver_dep_installed(solv, rd->evr);
140 if (rd->flags == REL_NAMESPACE && (q = solv->installsuppdepq) != 0)
143 for (i = 0; i < q->count; i++)
144 if (q->elements[i] == dep || q->elements[i] == rd->name)
148 FOR_PROVIDES(p, pp, dep)
149 if (solv->decisionmap[p] > 0)
155 solver_check_installsuppdepq(Solver *solv, Solvable *s)
158 supp = s->repo->idarraydata + s->supplements;
159 while ((sup = *supp++) != 0)
160 if (solver_check_installsuppdepq_dep(solv, sup) == 2)
166 autouninstall(Solver *solv, Id *problem)
168 Pool *pool = solv->pool;
170 int lastfeature = 0, lastupdate = 0;
174 for (i = 0; (v = problem[i]) != 0; i++)
177 extraflags &= solv->job.elements[-v - 1];
178 if (v >= solv->featurerules && v < solv->featurerules_end)
181 if (v >= solv->updaterules && v < solv->updaterules_end)
183 /* check if identical to feature rule */
184 Id p = solv->rules[v].p;
187 Rule *r = solv->rules + solv->featurerules + (p - solv->installed->start);
190 /* update rule == feature rule */
199 if (!lastupdate && !lastfeature)
201 v = lastupdate ? lastupdate : lastfeature;
202 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "allowuninstall disabling ");
203 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + v);
204 solver_disableproblem(solv, v);
205 if (extraflags != -1 && (extraflags & SOLVER_CLEANDEPS) != 0 && solv->cleandepsmap.size)
207 /* add the package to the updatepkgs list, this will automatically turn
208 * on cleandeps mode */
209 Id p = solv->rules[v].p;
210 if (!solv->cleandeps_updatepkgs)
212 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
213 queue_init(solv->cleandeps_updatepkgs);
217 int oldupdatepkgscnt = solv->cleandeps_updatepkgs->count;
218 queue_pushunique(solv->cleandeps_updatepkgs, p);
219 if (solv->cleandeps_updatepkgs->count != oldupdatepkgscnt)
220 solver_disablepolicyrules(solv);
226 /************************************************************************/
229 * enable/disable learnt rules
231 * we have enabled or disabled some of our rules. We now reenable all
232 * of our learnt rules except the ones that were learnt from rules that
236 enabledisablelearntrules(Solver *solv)
238 Pool *pool = solv->pool;
243 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "enabledisablelearntrules called\n");
244 for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
246 whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules];
247 while ((why = *whyp++) != 0)
249 assert(why > 0 && why < i);
250 if (solv->rules[why].d < 0)
253 /* why != 0: we found a disabled rule, disable the learnt rule */
254 if (why && r->d >= 0)
256 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
258 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "disabling ");
259 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
261 solver_disablerule(solv, r);
263 else if (!why && r->d < 0)
265 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
267 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "re-enabling ");
268 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
270 solver_enablerule(solv, r);
277 * make assertion rules into decisions
279 * Go through rules and add direct assertions to the decisionqueue.
280 * If we find a conflict, disable rules and add them to problem queue.
284 makeruledecisions(Solver *solv)
286 Pool *pool = solv->pool;
291 int record_proof = 1;
293 int havedisabled = 0;
295 /* The system solvable is always installed first */
296 assert(solv->decisionq.count == 0);
297 queue_push(&solv->decisionq, SYSTEMSOLVABLE);
298 queue_push(&solv->decisionq_why, 0);
299 solv->decisionmap[SYSTEMSOLVABLE] = 1; /* installed at level '1' */
301 decisionstart = solv->decisionq.count;
304 /* if we needed to re-run, back up decisions to decisionstart */
305 while (solv->decisionq.count > decisionstart)
307 v = solv->decisionq.elements[--solv->decisionq.count];
308 --solv->decisionq_why.count;
310 solv->decisionmap[vv] = 0;
313 /* note that the ruleassertions queue is ordered */
314 for (ii = 0; ii < solv->ruleassertions.count; ii++)
316 ri = solv->ruleassertions.elements[ii];
317 r = solv->rules + ri;
319 if (havedisabled && ri >= solv->learntrules)
321 /* just started with learnt rule assertions. If we have disabled
322 * some rules, adapt the learnt rule status */
323 enabledisablelearntrules(solv);
327 if (r->d < 0 || !r->p || r->w2) /* disabled, dummy or no assertion */
330 /* do weak rules in phase 2 */
331 if (ri < solv->learntrules && MAPTST(&solv->weakrulemap, ri))
337 if (!solv->decisionmap[vv]) /* if not yet decided */
339 queue_push(&solv->decisionq, v);
340 queue_push(&solv->decisionq_why, r - solv->rules);
341 solv->decisionmap[vv] = v > 0 ? 1 : -1;
342 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
344 Solvable *s = solv->pool->solvables + vv;
346 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", pool_solvable2str(solv->pool, s));
348 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (assertion)\n", pool_solvable2str(solv->pool, s));
353 /* check against previous decision: is there a conflict? */
354 if (v > 0 && solv->decisionmap[vv] > 0) /* ok to install */
356 if (v < 0 && solv->decisionmap[vv] < 0) /* ok to remove */
362 * The rule (r) we're currently processing says something
363 * different (v = r->p) than a previous decision (decisionmap[abs(v)])
367 if (ri >= solv->learntrules)
369 /* conflict with a learnt rule */
370 /* can happen when packages cannot be installed for multiple reasons. */
371 /* we disable the learnt rule in this case */
372 /* (XXX: we should really call analyze_unsolvable_rule here!) */
373 solver_disablerule(solv, r);
378 * find the decision which is the "opposite" of the rule
380 for (i = 0; i < solv->decisionq.count; i++)
381 if (solv->decisionq.elements[i] == -v)
383 assert(i < solv->decisionq.count); /* assert that we found it */
384 oldproblemcount = solv->problems.count;
387 * conflict with system solvable ?
389 if (v == -SYSTEMSOLVABLE)
393 queue_push(&solv->problems, solv->learnt_pool.count);
394 queue_push(&solv->learnt_pool, ri);
395 queue_push(&solv->learnt_pool, 0);
398 queue_push(&solv->problems, 0);
399 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with system solvable, disabling rule #%d\n", ri);
400 if (ri >= solv->jobrules && ri < solv->jobrules_end)
401 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
404 queue_push(&solv->problems, v);
405 queue_push(&solv->problems, 0);
406 if (solv->allowuninstall && v >= solv->featurerules && v < solv->updaterules_end)
407 solv->problems.count = oldproblemcount;
408 solver_disableproblem(solv, v);
410 break; /* start over */
413 assert(solv->decisionq_why.elements[i] > 0);
416 * conflict with an rpm rule ?
418 if (solv->decisionq_why.elements[i] < solv->rpmrules_end)
422 queue_push(&solv->problems, solv->learnt_pool.count);
423 queue_push(&solv->learnt_pool, ri);
424 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
425 queue_push(&solv->learnt_pool, 0);
428 queue_push(&solv->problems, 0);
429 assert(v > 0 || v == -SYSTEMSOLVABLE);
430 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with rpm rule, disabling rule #%d\n", ri);
431 if (ri >= solv->jobrules && ri < solv->jobrules_end)
432 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
435 queue_push(&solv->problems, v);
436 queue_push(&solv->problems, 0);
437 if (solv->allowuninstall && v >= solv->featurerules && v < solv->updaterules_end)
438 solv->problems.count = oldproblemcount;
439 solver_disableproblem(solv, v);
441 break; /* start over */
445 * conflict with another job or update/feature rule
451 queue_push(&solv->problems, solv->learnt_pool.count);
452 queue_push(&solv->learnt_pool, ri);
453 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
454 queue_push(&solv->learnt_pool, 0);
457 queue_push(&solv->problems, 0);
459 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflicting update/job assertions over literal %d\n", vv);
462 * push all of our rules (can only be feature or job rules)
463 * asserting this literal on the problem stack
465 for (i = solv->featurerules, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
467 if (rr->d < 0 /* disabled */
468 || rr->w2) /* or no assertion */
470 if (rr->p != vv /* not affecting the literal */
473 if (MAPTST(&solv->weakrulemap, i)) /* weak: silently ignore */
476 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, " - disabling rule #%d\n", i);
477 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + i);
480 if (i >= solv->jobrules && i < solv->jobrules_end)
481 v = -(solv->ruletojob.elements[i - solv->jobrules] + 1);
482 queue_push(&solv->problems, v);
484 queue_push(&solv->problems, 0);
486 if (solv->allowuninstall && (v = autouninstall(solv, solv->problems.elements + oldproblemcount + 1)) != 0)
487 solv->problems.count = oldproblemcount;
489 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
490 solver_disableproblem(solv, solv->problems.elements[i]);
492 break; /* start over */
494 if (ii < solv->ruleassertions.count)
498 * phase 2: now do the weak assertions
500 for (ii = 0; ii < solv->ruleassertions.count; ii++)
502 ri = solv->ruleassertions.elements[ii];
503 r = solv->rules + ri;
504 if (r->d < 0 || r->w2) /* disabled or no assertion */
506 if (ri >= solv->learntrules || !MAPTST(&solv->weakrulemap, ri)) /* skip non-weak */
511 if (!solv->decisionmap[vv]) /* if not yet decided */
513 queue_push(&solv->decisionq, v);
514 queue_push(&solv->decisionq_why, r - solv->rules);
515 solv->decisionmap[vv] = v > 0 ? 1 : -1;
516 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
518 Solvable *s = solv->pool->solvables + vv;
520 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
522 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
526 /* check against previous decision: is there a conflict? */
527 if (v > 0 && solv->decisionmap[vv] > 0)
529 if (v < 0 && solv->decisionmap[vv] < 0)
532 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "assertion conflict, but I am weak, disabling ");
533 solver_printrule(solv, SOLV_DEBUG_UNSOLVABLE, r);
535 if (ri >= solv->jobrules && ri < solv->jobrules_end)
536 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
539 solver_disableproblem(solv, v);
541 solver_reenablepolicyrules(solv, -v);
543 break; /* start over */
545 if (ii == solv->ruleassertions.count)
546 break; /* finished! */
551 /********************************************************************/
555 /*-------------------------------------------------------------------
558 * initial setup for all watches
562 makewatches(Solver *solv)
566 int nsolvables = solv->pool->nsolvables;
568 solv_free(solv->watches);
569 /* lower half for removals, upper half for installs */
570 solv->watches = solv_calloc(2 * nsolvables, sizeof(Id));
572 /* do it reverse so rpm rules get triggered first (XXX: obsolete?) */
573 for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
575 for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
578 if (!r->w2) /* assertions do not need watches */
581 /* see addwatches_rule(solv, r) */
582 r->n1 = solv->watches[nsolvables + r->w1];
583 solv->watches[nsolvables + r->w1] = r - solv->rules;
585 r->n2 = solv->watches[nsolvables + r->w2];
586 solv->watches[nsolvables + r->w2] = r - solv->rules;
591 /*-------------------------------------------------------------------
593 * add watches (for a new learned rule)
594 * sets up watches for a single rule
596 * see also makewatches() above.
600 addwatches_rule(Solver *solv, Rule *r)
602 int nsolvables = solv->pool->nsolvables;
604 r->n1 = solv->watches[nsolvables + r->w1];
605 solv->watches[nsolvables + r->w1] = r - solv->rules;
607 r->n2 = solv->watches[nsolvables + r->w2];
608 solv->watches[nsolvables + r->w2] = r - solv->rules;
612 /********************************************************************/
618 /* shortcuts to check if a literal (positive or negative) assignment
619 * evaluates to 'true' or 'false'
621 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
622 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
623 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
625 /*-------------------------------------------------------------------
629 * make decision and propagate to all rules
631 * Evaluate each term affected by the decision (linked through watches).
632 * If we find unit rules we make new decisions based on them.
634 * return : 0 = everything is OK
635 * rule = conflict found in this rule
639 propagate(Solver *solv, int level)
641 Pool *pool = solv->pool;
642 Id *rp, *next_rp; /* rule pointer, next rule pointer in linked list */
644 Id p, pkg, other_watch;
646 Id *decisionmap = solv->decisionmap;
648 Id *watches = solv->watches + pool->nsolvables; /* place ptr in middle */
650 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate -----\n");
652 /* foreach non-propagated decision */
653 while (solv->propagate_index < solv->decisionq.count)
656 * 'pkg' was just decided
657 * negate because our watches trigger if literal goes FALSE
659 pkg = -solv->decisionq.elements[solv->propagate_index++];
661 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
663 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagate for decision %d level %d\n", -pkg, level);
664 solver_printruleelement(solv, SOLV_DEBUG_PROPAGATE, 0, -pkg);
667 /* foreach rule where 'pkg' is now FALSE */
668 for (rp = watches + pkg; *rp; rp = next_rp)
670 r = solv->rules + *rp;
673 /* rule is disabled, goto next */
681 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
683 POOL_DEBUG(SOLV_DEBUG_PROPAGATE," watch triggered ");
684 solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
687 /* 'pkg' was just decided (was set to FALSE)
689 * now find other literal watch, check clause
690 * and advance on linked list
704 * This term is already true (through the other literal)
705 * so we have nothing to do
707 if (DECISIONMAP_TRUE(other_watch))
711 * The other literal is FALSE or UNDEF
717 /* Not a binary clause, try to move our watch.
719 * Go over all literals and find one that is
723 * (TRUE is also ok, in that case the rule is fulfilled)
725 if (r->p /* we have a 'p' */
726 && r->p != other_watch /* which is not watched */
727 && !DECISIONMAP_FALSE(r->p)) /* and not FALSE */
731 else /* go find a 'd' to make 'true' */
734 we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
736 for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
738 if (p != other_watch /* which is not watched */
739 && !DECISIONMAP_FALSE(p)) /* and not FALSE */
747 * if we found some p that is UNDEF or TRUE, move
750 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
753 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, p));
755 POOL_DEBUG(SOLV_DEBUG_PROPAGATE," -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, -p));
771 watches[p] = r - solv->rules;
774 /* search failed, thus all unwatched literals are FALSE */
779 * unit clause found, set literal other_watch to TRUE
782 if (DECISIONMAP_FALSE(other_watch)) /* check if literal is FALSE */
783 return r; /* eek, a conflict! */
785 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
787 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " unit ");
788 solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
792 decisionmap[other_watch] = level; /* install! */
794 decisionmap[-other_watch] = -level; /* remove! */
796 queue_push(&solv->decisionq, other_watch);
797 queue_push(&solv->decisionq_why, r - solv->rules);
799 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
802 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to install %s\n", pool_solvid2str(pool, other_watch));
804 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to conflict %s\n", pool_solvid2str(pool, -other_watch));
807 } /* foreach rule involving 'pkg' */
809 } /* while we have non-decided decisions */
811 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate end-----\n");
813 return 0; /* all is well */
817 /********************************************************************/
820 /*-------------------------------------------------------------------
827 analyze(Solver *solv, int level, Rule *c, int *pr, int *dr, int *whyp)
829 Pool *pool = solv->pool;
833 Map seen; /* global? */
834 Id d, v, vv, *dp, why;
836 int num = 0, l1num = 0;
837 int learnt_why = solv->learnt_pool.count;
838 Id *decisionmap = solv->decisionmap;
840 queue_init_buffer(&r, r_buf, sizeof(r_buf)/sizeof(*r_buf));
842 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
843 map_init(&seen, pool->nsolvables);
844 idx = solv->decisionq.count;
847 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
848 solver_printruleclass(solv, SOLV_DEBUG_ANALYZE, c);
849 queue_push(&solv->learnt_pool, c - solv->rules);
850 d = c->d < 0 ? -c->d - 1 : c->d;
851 dp = d ? pool->whatprovidesdata + d : 0;
852 /* go through all literals of the rule */
864 if (DECISIONMAP_TRUE(v)) /* the one true literal */
867 if (MAPTST(&seen, vv))
869 l = solv->decisionmap[vv];
872 MAPSET(&seen, vv); /* mark that we also need to look at this literal */
874 l1num++; /* need to do this one in level1 pass */
876 num++; /* need to do this one as well */
879 queue_push(&r, v); /* not level1 or conflict level, add to new rule */
885 if (!num && !--l1num)
886 break; /* all level 1 literals done */
888 /* find the next literal to investigate */
889 /* (as num + l1num > 0, we know that we'll always find one) */
893 v = solv->decisionq.elements[--idx];
895 if (MAPTST(&seen, vv))
900 if (num && --num == 0)
902 *pr = -v; /* so that v doesn't get lost */
905 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
906 /* clear non-l1 bits from seen map */
907 for (i = 0; i < r.count; i++)
910 MAPCLR(&seen, v > 0 ? v : -v);
912 /* only level 1 marks left in seen map */
913 l1num++; /* as l1retry decrements it */
917 why = solv->decisionq_why.elements[idx];
918 if (why <= 0) /* just in case, maybe for SYSTEMSOLVABLE */
920 c = solv->rules + why;
926 else if (r.count == 1 && r.elements[0] < 0)
929 *dr = pool_queuetowhatprovides(pool, &r);
930 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
932 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
933 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, *pr);
934 for (i = 0; i < r.count; i++)
935 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, r.elements[i]);
937 /* push end marker on learnt reasons stack */
938 queue_push(&solv->learnt_pool, 0);
942 solv->stats_learned++;
947 /*-------------------------------------------------------------------
951 * reset all solver decisions
952 * called after rules have been enabled/disabled
956 solver_reset(Solver *solv)
958 Pool *pool = solv->pool;
962 /* rewind all decisions */
963 for (i = solv->decisionq.count - 1; i >= 0; i--)
965 v = solv->decisionq.elements[i];
966 solv->decisionmap[v > 0 ? v : -v] = 0;
968 solv->decisionq_why.count = 0;
969 solv->decisionq.count = 0;
970 solv->recommends_index = -1;
971 solv->propagate_index = 0;
972 solv->branches.count = 0;
974 /* adapt learnt rule status to new set of enabled/disabled rules */
975 enabledisablelearntrules(solv);
977 /* redo all assertion rule decisions */
978 makeruledecisions(solv);
979 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "decisions so far: %d\n", solv->decisionq.count);
983 /*-------------------------------------------------------------------
985 * analyze_unsolvable_rule
987 * recursion helper used by analyze_unsolvable
991 analyze_unsolvable_rule(Solver *solv, Rule *r, Id *lastweakp, Map *rseen)
993 Pool *pool = solv->pool;
995 Id why = r - solv->rules;
997 IF_POOLDEBUG (SOLV_DEBUG_UNSOLVABLE)
998 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
999 if (solv->learntrules && why >= solv->learntrules)
1001 if (MAPTST(rseen, why - solv->learntrules))
1003 MAPSET(rseen, why - solv->learntrules);
1004 for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
1005 if (solv->learnt_pool.elements[i] > 0)
1006 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp, rseen);
1009 if (MAPTST(&solv->weakrulemap, why))
1010 if (!*lastweakp || why > *lastweakp)
1012 /* do not add rpm rules to problem */
1013 if (why < solv->rpmrules_end)
1015 /* turn rule into problem */
1016 if (why >= solv->jobrules && why < solv->jobrules_end)
1017 why = -(solv->ruletojob.elements[why - solv->jobrules] + 1);
1018 /* normalize dup/infarch rules */
1019 if (why > solv->infarchrules && why < solv->infarchrules_end)
1021 Id name = pool->solvables[-solv->rules[why].p].name;
1022 while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
1025 if (why > solv->duprules && why < solv->duprules_end)
1027 Id name = pool->solvables[-solv->rules[why].p].name;
1028 while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
1032 /* return if problem already countains our rule */
1033 if (solv->problems.count)
1035 for (i = solv->problems.count - 1; i >= 0; i--)
1036 if (solv->problems.elements[i] == 0) /* end of last problem reached? */
1038 else if (solv->problems.elements[i] == why)
1041 queue_push(&solv->problems, why);
1045 /*-------------------------------------------------------------------
1047 * analyze_unsolvable
1049 * We know that the problem is not solvable. Record all involved
1050 * rules (i.e. the "proof") into solv->learnt_pool.
1051 * Record the learnt pool index and all non-rpm rules into
1052 * solv->problems. (Our solutions to fix the problems are to
1053 * disable those rules.)
1055 * If the proof contains at least one weak rule, we disable the
1058 * Otherwise we return 0 if disablerules is not set or disable
1059 * _all_ of the problem rules and return 1.
1061 * return: 1 - disabled some rules, try again
1066 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
1068 Pool *pool = solv->pool;
1070 Map seen; /* global to speed things up? */
1072 Id d, v, vv, *dp, why;
1074 Id *decisionmap = solv->decisionmap;
1075 int oldproblemcount;
1076 int oldlearntpoolcount;
1078 int record_proof = 1;
1080 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
1081 solv->stats_unsolvable++;
1082 oldproblemcount = solv->problems.count;
1083 oldlearntpoolcount = solv->learnt_pool.count;
1085 /* make room for proof index */
1086 /* must update it later, as analyze_unsolvable_rule would confuse
1087 * it with a rule index if we put the real value in already */
1088 queue_push(&solv->problems, 0);
1091 map_init(&seen, pool->nsolvables);
1092 map_init(&rseen, solv->learntrules ? solv->nrules - solv->learntrules : 0);
1094 queue_push(&solv->learnt_pool, r - solv->rules);
1096 analyze_unsolvable_rule(solv, r, &lastweak, &rseen);
1097 d = r->d < 0 ? -r->d - 1 : r->d;
1098 dp = d ? pool->whatprovidesdata + d : 0;
1109 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1111 vv = v > 0 ? v : -v;
1112 l = solv->decisionmap[vv];
1117 idx = solv->decisionq.count;
1120 v = solv->decisionq.elements[--idx];
1121 vv = v > 0 ? v : -v;
1122 if (!MAPTST(&seen, vv))
1124 why = solv->decisionq_why.elements[idx];
1127 queue_push(&solv->learnt_pool, why);
1128 r = solv->rules + why;
1129 analyze_unsolvable_rule(solv, r, &lastweak, &rseen);
1130 d = r->d < 0 ? -r->d - 1 : r->d;
1131 dp = d ? pool->whatprovidesdata + d : 0;
1142 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1144 vv = v > 0 ? v : -v;
1145 l = solv->decisionmap[vv];
1153 queue_push(&solv->problems, 0); /* mark end of this problem */
1157 /* disable last weak rule */
1158 solv->problems.count = oldproblemcount;
1159 solv->learnt_pool.count = oldlearntpoolcount;
1160 if (lastweak >= solv->jobrules && lastweak < solv->jobrules_end)
1161 v = -(solv->ruletojob.elements[lastweak - solv->jobrules] + 1);
1164 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "disabling ");
1165 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + lastweak);
1166 if (lastweak >= solv->choicerules && lastweak < solv->choicerules_end)
1167 solver_disablechoicerules(solv, solv->rules + lastweak);
1168 solver_disableproblem(solv, v);
1170 solver_reenablepolicyrules(solv, -v);
1175 if (solv->allowuninstall && (v = autouninstall(solv, solv->problems.elements + oldproblemcount + 1)) != 0)
1177 solv->problems.count = oldproblemcount;
1178 solv->learnt_pool.count = oldlearntpoolcount;
1186 queue_push(&solv->learnt_pool, 0);
1187 solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
1190 /* + 2: index + trailing zero */
1191 if (disablerules && oldproblemcount + 2 < solv->problems.count)
1193 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
1194 solver_disableproblem(solv, solv->problems.elements[i]);
1195 /* XXX: might want to enable all weak rules again */
1199 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
1204 /********************************************************************/
1205 /* Decision revert */
1207 /*-------------------------------------------------------------------
1210 * revert decisionq to a level
1214 revert(Solver *solv, int level)
1216 Pool *pool = solv->pool;
1218 while (solv->decisionq.count)
1220 v = solv->decisionq.elements[solv->decisionq.count - 1];
1221 vv = v > 0 ? v : -v;
1222 if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
1224 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
1225 solv->decisionmap[vv] = 0;
1226 solv->decisionq.count--;
1227 solv->decisionq_why.count--;
1228 solv->propagate_index = solv->decisionq.count;
1230 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
1232 solv->branches.count--;
1233 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
1234 solv->branches.count--;
1236 solv->recommends_index = -1;
1240 /*-------------------------------------------------------------------
1242 * watch2onhighest - put watch2 on literal with highest level
1246 watch2onhighest(Solver *solv, Rule *r)
1251 d = r->d < 0 ? -r->d - 1 : r->d;
1253 return; /* binary rule, both watches are set */
1254 dp = solv->pool->whatprovidesdata + d;
1255 while ((v = *dp++) != 0)
1257 l = solv->decisionmap[v < 0 ? -v : v];
1269 /*-------------------------------------------------------------------
1273 * add free decision (solvable to install) to decisionq
1274 * increase level and propagate decision
1275 * return if no conflict.
1277 * in conflict case, analyze conflict rule, add resulting
1278 * rule to learnt rule set, make decision from learnt
1279 * rule (always unit) and re-propagate.
1281 * returns the new solver level or 0 if unsolvable
1286 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules, Id ruleid)
1288 Pool *pool = solv->pool;
1293 assert(ruleid >= 0);
1298 solv->decisionmap[decision] = level;
1300 solv->decisionmap[-decision] = -level;
1301 queue_push(&solv->decisionq, decision);
1302 queue_push(&solv->decisionq_why, -ruleid); /* <= 0 -> free decision */
1306 r = propagate(solv, level);
1310 return analyze_unsolvable(solv, r, disablerules);
1311 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
1312 l = analyze(solv, level, r, &p, &d, &why); /* learnt rule in p and d */
1313 assert(l > 0 && l < level);
1314 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, l);
1316 revert(solv, level);
1317 r = solver_addrule(solv, p, d);
1319 assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
1320 queue_push(&solv->learnt_why, why);
1323 /* at least 2 literals, needs watches */
1324 watch2onhighest(solv, r);
1325 addwatches_rule(solv, r);
1329 /* learnt rule is an assertion */
1330 queue_push(&solv->ruleassertions, r - solv->rules);
1332 /* the new rule is unit by design */
1333 solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
1334 queue_push(&solv->decisionq, p);
1335 queue_push(&solv->decisionq_why, r - solv->rules);
1336 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
1338 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "decision: ");
1339 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, p);
1340 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "new rule: ");
1341 solver_printrule(solv, SOLV_DEBUG_ANALYZE, r);
1348 /*-------------------------------------------------------------------
1350 * select and install
1352 * install best package from the queue. We add an extra package, inst, if
1353 * provided. See comment in weak install section.
1355 * returns the new solver level or 0 if unsolvable
1360 selectandinstall(Solver *solv, int level, Queue *dq, int disablerules, Id ruleid)
1362 Pool *pool = solv->pool;
1367 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1370 /* XXX: didn't we already do that? */
1371 /* XXX: shouldn't we prefer installed packages? */
1372 /* XXX: move to policy.c? */
1373 /* choose the supplemented one */
1374 for (i = 0; i < dq->count; i++)
1375 if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
1377 dq->elements[0] = dq->elements[i];
1384 /* multiple candidates, open a branch */
1385 for (i = 1; i < dq->count; i++)
1386 queue_push(&solv->branches, dq->elements[i]);
1387 queue_push(&solv->branches, -level);
1389 p = dq->elements[0];
1391 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing %s\n", pool_solvid2str(pool, p));
1393 return setpropagatelearn(solv, level, p, disablerules, ruleid);
1397 /********************************************************************/
1398 /* Main solver interface */
1401 /*-------------------------------------------------------------------
1404 * create solver structure
1406 * pool: all available solvables
1407 * installed: installed Solvables
1410 * Upon solving, rules are created to flag the Solvables
1411 * of the 'installed' Repo as installed.
1415 solver_create(Pool *pool)
1418 solv = (Solver *)solv_calloc(1, sizeof(Solver));
1420 solv->installed = pool->installed;
1422 solv->allownamechange = 1;
1424 solv->dup_allowdowngrade = 1;
1425 solv->dup_allownamechange = 1;
1426 solv->dup_allowarchchange = 1;
1427 solv->dup_allowvendorchange = 1;
1429 queue_init(&solv->ruletojob);
1430 queue_init(&solv->decisionq);
1431 queue_init(&solv->decisionq_why);
1432 queue_init(&solv->problems);
1433 queue_init(&solv->orphaned);
1434 queue_init(&solv->learnt_why);
1435 queue_init(&solv->learnt_pool);
1436 queue_init(&solv->branches);
1437 queue_init(&solv->weakruleq);
1438 queue_init(&solv->ruleassertions);
1440 queue_push(&solv->learnt_pool, 0); /* so that 0 does not describe a proof */
1442 map_init(&solv->recommendsmap, pool->nsolvables);
1443 map_init(&solv->suggestsmap, pool->nsolvables);
1444 map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
1445 solv->recommends_index = 0;
1447 solv->decisionmap = (Id *)solv_calloc(pool->nsolvables, sizeof(Id));
1449 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
1450 memset(solv->rules, 0, sizeof(Rule));
1456 /*-------------------------------------------------------------------
1462 solver_free(Solver *solv)
1464 queue_free(&solv->job);
1465 queue_free(&solv->ruletojob);
1466 queue_free(&solv->decisionq);
1467 queue_free(&solv->decisionq_why);
1468 queue_free(&solv->learnt_why);
1469 queue_free(&solv->learnt_pool);
1470 queue_free(&solv->problems);
1471 queue_free(&solv->solutions);
1472 queue_free(&solv->orphaned);
1473 queue_free(&solv->branches);
1474 queue_free(&solv->weakruleq);
1475 queue_free(&solv->ruleassertions);
1476 if (solv->cleandeps_updatepkgs)
1478 queue_free(solv->cleandeps_updatepkgs);
1479 solv->cleandeps_updatepkgs = solv_free(solv->cleandeps_updatepkgs);
1481 if (solv->cleandeps_mistakes)
1483 queue_free(solv->cleandeps_mistakes);
1484 solv->cleandeps_mistakes = solv_free(solv->cleandeps_mistakes);
1486 if (solv->update_targets)
1488 queue_free(solv->update_targets);
1489 solv->update_targets = solv_free(solv->update_targets);
1491 if (solv->installsuppdepq)
1493 queue_free(solv->installsuppdepq);
1494 solv->installsuppdepq = solv_free(solv->installsuppdepq);
1497 map_free(&solv->recommendsmap);
1498 map_free(&solv->suggestsmap);
1499 map_free(&solv->noupdate);
1500 map_free(&solv->weakrulemap);
1501 map_free(&solv->noobsoletes);
1503 map_free(&solv->updatemap);
1504 map_free(&solv->bestupdatemap);
1505 map_free(&solv->fixmap);
1506 map_free(&solv->dupmap);
1507 map_free(&solv->dupinvolvedmap);
1508 map_free(&solv->droporphanedmap);
1509 map_free(&solv->cleandepsmap);
1511 solv_free(solv->decisionmap);
1512 solv_free(solv->rules);
1513 solv_free(solv->watches);
1514 solv_free(solv->obsoletes);
1515 solv_free(solv->obsoletes_data);
1516 solv_free(solv->multiversionupdaters);
1517 solv_free(solv->choicerules_ref);
1518 solv_free(solv->bestrules_pkg);
1523 solver_get_flag(Solver *solv, int flag)
1527 case SOLVER_FLAG_ALLOW_DOWNGRADE:
1528 return solv->allowdowngrade;
1529 case SOLVER_FLAG_ALLOW_NAMECHANGE:
1530 return solv->allownamechange;
1531 case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1532 return solv->allowarchchange;
1533 case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1534 return solv->allowvendorchange;
1535 case SOLVER_FLAG_ALLOW_UNINSTALL:
1536 return solv->allowuninstall;
1537 case SOLVER_FLAG_NO_UPDATEPROVIDE:
1538 return solv->noupdateprovide;
1539 case SOLVER_FLAG_SPLITPROVIDES:
1540 return solv->dosplitprovides;
1541 case SOLVER_FLAG_IGNORE_RECOMMENDED:
1542 return solv->dontinstallrecommended;
1543 case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1544 return solv->addalreadyrecommended;
1545 case SOLVER_FLAG_NO_INFARCHCHECK:
1546 return solv->noinfarchcheck;
1547 case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1548 return solv->keepexplicitobsoletes;
1549 case SOLVER_FLAG_BEST_OBEY_POLICY:
1550 return solv->bestobeypolicy;
1551 case SOLVER_FLAG_NO_AUTOTARGET:
1552 return solv->noautotarget;
1560 solver_set_flag(Solver *solv, int flag, int value)
1562 int old = solver_get_flag(solv, flag);
1565 case SOLVER_FLAG_ALLOW_DOWNGRADE:
1566 solv->allowdowngrade = value;
1568 case SOLVER_FLAG_ALLOW_NAMECHANGE:
1569 solv->allownamechange = value;
1571 case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1572 solv->allowarchchange = value;
1574 case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1575 solv->allowvendorchange = value;
1577 case SOLVER_FLAG_ALLOW_UNINSTALL:
1578 solv->allowuninstall = value;
1580 case SOLVER_FLAG_NO_UPDATEPROVIDE:
1581 solv->noupdateprovide = value;
1583 case SOLVER_FLAG_SPLITPROVIDES:
1584 solv->dosplitprovides = value;
1586 case SOLVER_FLAG_IGNORE_RECOMMENDED:
1587 solv->dontinstallrecommended = value;
1589 case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1590 solv->addalreadyrecommended = value;
1592 case SOLVER_FLAG_NO_INFARCHCHECK:
1593 solv->noinfarchcheck = value;
1595 case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1596 solv->keepexplicitobsoletes = value;
1598 case SOLVER_FLAG_BEST_OBEY_POLICY:
1599 solv->bestobeypolicy = value;
1601 case SOLVER_FLAG_NO_AUTOTARGET:
1602 solv->noautotarget = value;
1611 cleandeps_check_mistakes(Solver *solv, int level)
1613 Pool *pool = solv->pool;
1617 int mademistake = 0;
1619 if (!solv->cleandepsmap.size)
1621 /* check for mistakes */
1622 for (i = solv->installed->start; i < solv->installed->end; i++)
1624 if (!MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1626 r = solv->rules + solv->featurerules + (i - solv->installed->start);
1627 /* a mistake is when the featurerule is true but the updaterule is false */
1630 FOR_RULELITERALS(p, pp, r)
1631 if (p > 0 && solv->decisionmap[p] > 0)
1634 continue; /* feature rule is not true */
1635 r = solv->rules + solv->updaterules + (i - solv->installed->start);
1638 FOR_RULELITERALS(p, pp, r)
1639 if (p > 0 && solv->decisionmap[p] > 0)
1642 continue; /* update rule is true */
1643 POOL_DEBUG(SOLV_DEBUG_SOLVER, "cleandeps mistake: ");
1644 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, r);
1645 POOL_DEBUG(SOLV_DEBUG_SOLVER, "feature rule: ");
1646 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, solv->rules + solv->featurerules + (i - solv->installed->start));
1647 if (!solv->cleandeps_mistakes)
1649 solv->cleandeps_mistakes = solv_calloc(1, sizeof(Queue));
1650 queue_init(solv->cleandeps_mistakes);
1652 queue_push(solv->cleandeps_mistakes, i);
1653 MAPCLR(&solv->cleandepsmap, i - solv->installed->start);
1654 solver_reenablepolicyrules_cleandeps(solv, i);
1663 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
1667 for (i = j = 0; i < q->count; i++)
1670 for (cp2 = cp; *cp2; cp2++)
1673 q->elements[j++] = p;
1677 queue_truncate(q, j);
1680 /*-------------------------------------------------------------------
1684 * all rules have been set up, now actually run the solver
1689 solver_run_sat(Solver *solv, int disablerules, int doweak)
1691 Queue dq; /* local decisionqueue */
1692 Queue dqs; /* local decisionqueue for supplements */
1698 Pool *pool = solv->pool;
1700 int minimizationsteps;
1701 int installedpos = solv->installed ? solv->installed->start : 0;
1703 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
1705 POOL_DEBUG (SOLV_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
1706 for (i = 1; i < solv->nrules; i++)
1707 solver_printruleclass(solv, SOLV_DEBUG_RULE_CREATION, solv->rules + i);
1710 POOL_DEBUG(SOLV_DEBUG_SOLVER, "initial decisions: %d\n", solv->decisionq.count);
1712 /* start SAT algorithm */
1714 systemlevel = level + 1;
1715 POOL_DEBUG(SOLV_DEBUG_SOLVER, "solving...\n");
1721 * here's the main loop:
1722 * 1) propagate new decisions (only needed once)
1724 * 3) try to keep installed packages
1725 * 4) fulfill all unresolved rules
1726 * 5) install recommended packages
1727 * 6) minimalize solution if we had choices
1728 * if we encounter a problem, we rewind to a safe level and restart
1732 minimizationsteps = 0;
1736 * initial propagation of the assertions
1740 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagating (propagate_index: %d; size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
1741 if ((r = propagate(solv, level)) != 0)
1743 if (analyze_unsolvable(solv, r, disablerules))
1746 break; /* unsolvable */
1751 * resolve jobs first
1753 if (level < systemlevel)
1755 POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving job rules\n");
1756 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
1759 if (r->d < 0) /* ignore disabled rules */
1762 FOR_RULELITERALS(l, pp, r)
1766 if (solv->decisionmap[-l] <= 0)
1771 if (solv->decisionmap[l] > 0)
1773 if (solv->decisionmap[l] == 0)
1779 /* prune to installed if not updating */
1780 if (dq.count > 1 && solv->installed && !solv->updatemap_all &&
1781 !(solv->job.elements[solv->ruletojob.elements[i - solv->jobrules]] & SOLVER_ORUPDATE))
1784 for (j = k = 0; j < dq.count; j++)
1786 Solvable *s = pool->solvables + dq.elements[j];
1787 if (s->repo == solv->installed)
1789 dq.elements[k++] = dq.elements[j];
1790 if (solv->updatemap.size && MAPTST(&solv->updatemap, dq.elements[j] - solv->installed->start))
1792 k = 0; /* package wants to be updated, do not prune */
1801 level = selectandinstall(solv, level, &dq, disablerules, i);
1804 if (level <= olevel)
1808 break; /* unsolvable */
1809 systemlevel = level + 1;
1810 if (i < solv->jobrules_end)
1812 solv->decisioncnt_update = solv->decisionq.count;
1813 solv->decisioncnt_keep = solv->decisionq.count;
1817 * installed packages
1819 if (level < systemlevel && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
1821 Repo *installed = solv->installed;
1824 POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving installed packages\n");
1825 /* we use two passes if we need to update packages
1826 * to create a better user experience */
1827 for (pass = solv->updatemap.size ? 0 : 1; pass < 2; pass++)
1829 int passlevel = level;
1831 solv->decisioncnt_keep = solv->decisionq.count;
1832 /* start with installedpos, the position that gave us problems last time */
1833 for (i = installedpos, n = installed->start; n < installed->end; i++, n++)
1838 if (i == installed->end)
1839 i = installed->start;
1840 s = pool->solvables + i;
1841 if (s->repo != installed)
1844 if (solv->decisionmap[i] > 0)
1846 if (!pass && solv->updatemap.size && !MAPTST(&solv->updatemap, i - installed->start))
1847 continue; /* updates first */
1848 r = solv->rules + solv->updaterules + (i - installed->start);
1850 if (!rr->p || rr->d < 0) /* disabled -> look at feature rule */
1851 rr -= solv->installed->end - solv->installed->start;
1852 if (!rr->p) /* identical to update rule? */
1855 continue; /* orpaned package */
1857 /* XXX: noupdate check is probably no longer needed, as all jobs should
1858 * already be satisfied */
1859 /* Actually we currently still need it because of erase jobs */
1860 /* if noupdate is set we do not look at update candidates */
1862 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 != i))
1864 if (solv->noobsoletes.size && solv->multiversionupdaters
1865 && (d = solv->multiversionupdaters[i - installed->start]) != 0)
1867 /* special multiversion handling, make sure best version is chosen */
1869 while ((p = pool->whatprovidesdata[d++]) != 0)
1870 if (solv->decisionmap[p] >= 0)
1872 if (dq.count && solv->update_targets && solv->update_targets->elements[i - installed->start])
1873 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], &dq);
1876 policy_filter_unwanted(solv, &dq, POLICY_MODE_CHOOSE);
1878 if (p != i && solv->decisionmap[p] == 0)
1880 rr = solv->rules + solv->featurerules + (i - solv->installed->start);
1881 if (!rr->p) /* update rule == feature rule? */
1882 rr = rr - solv->featurerules + solv->updaterules;
1891 /* update to best package */
1892 FOR_RULELITERALS(p, pp, rr)
1894 if (solv->decisionmap[p] > 0)
1896 dq.count = 0; /* already fulfilled */
1899 if (!solv->decisionmap[p])
1904 if (dq.count && solv->update_targets && solv->update_targets->elements[i - installed->start])
1905 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], &dq);
1906 /* install best version */
1910 level = selectandinstall(solv, level, &dq, disablerules, rr - solv->rules);
1917 if (level <= olevel)
1919 if (level == 1 || level < passlevel)
1920 break; /* trouble */
1922 n = installed->start; /* redo all */
1928 /* if still undecided keep package */
1929 if (solv->decisionmap[i] == 0)
1932 if (solv->cleandepsmap.size && MAPTST(&solv->cleandepsmap, i - installed->start))
1935 POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, i));
1936 level = setpropagatelearn(solv, level, -i, disablerules, 0);
1943 POOL_DEBUG(SOLV_DEBUG_POLICY, "keeping %s\n", pool_solvid2str(pool, i));
1944 level = setpropagatelearn(solv, level, i, disablerules, r - solv->rules);
1948 if (level <= olevel)
1950 if (level == 1 || level < passlevel)
1951 break; /* trouble */
1953 n = installed->start; /* redo all */
1956 continue; /* retry with learnt rule */
1960 if (n < installed->end)
1962 installedpos = i; /* retry problem solvable next time */
1963 break; /* ran into trouble */
1965 installedpos = installed->start; /* reset installedpos */
1968 break; /* unsolvable */
1969 systemlevel = level + 1;
1971 continue; /* had trouble, retry */
1974 if (level < systemlevel)
1975 systemlevel = level;
1980 solv->decisioncnt_resolve = solv->decisionq.count;
1981 POOL_DEBUG(SOLV_DEBUG_POLICY, "deciding unresolved rules\n");
1982 for (i = 1, n = 1; n < solv->nrules; i++, n++)
1984 if (i == solv->nrules)
1986 r = solv->rules + i;
1987 if (r->d < 0) /* ignore disabled rules */
1992 /* binary or unary rule */
1993 /* need two positive undecided literals */
1994 if (r->p < 0 || r->w2 <= 0)
1996 if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
1998 queue_push(&dq, r->p);
1999 queue_push(&dq, r->w2);
2004 * all negative literals are installed
2005 * no positive literal is installed
2006 * i.e. the rule is not fulfilled and we
2007 * just need to decide on the positive literals
2011 if (solv->decisionmap[-r->p] <= 0)
2016 if (solv->decisionmap[r->p] > 0)
2018 if (solv->decisionmap[r->p] == 0)
2019 queue_push(&dq, r->p);
2021 dp = pool->whatprovidesdata + r->d;
2022 while ((p = *dp++) != 0)
2026 if (solv->decisionmap[-p] <= 0)
2031 if (solv->decisionmap[p] > 0)
2033 if (solv->decisionmap[p] == 0)
2040 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
2042 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "unfulfilled ");
2043 solver_printruleclass(solv, SOLV_DEBUG_PROPAGATE, r);
2045 /* dq.count < 2 cannot happen as this means that
2046 * the rule is unit */
2047 assert(dq.count > 1);
2049 /* prune to cleandeps packages */
2050 if (solv->cleandepsmap.size && solv->installed)
2052 Repo *installed = solv->installed;
2053 for (j = 0; j < dq.count; j++)
2054 if (pool->solvables[dq.elements[j]].repo == installed && MAPTST(&solv->cleandepsmap, dq.elements[j] - installed->start))
2058 dq.elements[0] = dq.elements[j];
2059 queue_truncate(&dq, 1);
2064 level = selectandinstall(solv, level, &dq, disablerules, r - solv->rules);
2066 break; /* unsolvable */
2067 if (level < systemlevel || level == 1)
2068 break; /* trouble */
2069 /* something changed, so look at all rules again */
2073 if (n != solv->nrules) /* ran into trouble? */
2076 break; /* unsolvable */
2077 continue; /* start over */
2080 /* at this point we have a consistent system. now do the extras... */
2082 /* first decide leftover cleandeps packages */
2083 if (solv->cleandepsmap.size && solv->installed)
2085 for (p = solv->installed->start; p < solv->installed->end; p++)
2087 s = pool->solvables + p;
2088 if (s->repo != solv->installed)
2090 if (solv->decisionmap[p] == 0 && MAPTST(&solv->cleandepsmap, p - solv->installed->start))
2092 POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, p));
2094 level = setpropagatelearn(solv, level, -p, 0, 0);
2099 if (p < solv->installed->end)
2103 solv->decisioncnt_weak = solv->decisionq.count;
2108 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended packages\n");
2109 queue_empty(&dq); /* recommended packages */
2110 queue_empty(&dqs); /* supplemented packages */
2111 for (i = 1; i < pool->nsolvables; i++)
2113 if (solv->decisionmap[i] < 0)
2115 if (solv->decisionmap[i] > 0)
2117 /* installed, check for recommends */
2118 Id *recp, rec, pp, p;
2119 s = pool->solvables + i;
2120 if (!solv->addalreadyrecommended && s->repo == solv->installed)
2122 /* XXX need to special case AND ? */
2125 recp = s->repo->idarraydata + s->recommends;
2126 while ((rec = *recp++) != 0)
2129 FOR_PROVIDES(p, pp, rec)
2131 if (solv->decisionmap[p] > 0)
2136 else if (solv->decisionmap[p] == 0)
2138 if (solv->dupmap_all && solv->installed && pool->solvables[p].repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))))
2140 queue_pushunique(&dq, p);
2148 s = pool->solvables + i;
2149 if (!s->supplements)
2151 if (!pool_installable(pool, s))
2153 if (!solver_is_supplementing(solv, s))
2155 if (solv->dupmap_all && solv->installed && s->repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, i - solv->installed->start))))
2157 queue_push(&dqs, i);
2161 /* filter out all packages obsoleted by installed packages */
2162 /* this is no longer needed if we have reverse obsoletes */
2163 if ((dqs.count || dq.count) && solv->installed)
2166 Id obs, *obsp, po, ppo;
2168 map_init(&obsmap, pool->nsolvables);
2169 for (p = solv->installed->start; p < solv->installed->end; p++)
2171 s = pool->solvables + p;
2172 if (s->repo != solv->installed || !s->obsoletes)
2174 if (solv->decisionmap[p] <= 0)
2176 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
2178 obsp = s->repo->idarraydata + s->obsoletes;
2179 /* foreach obsoletes */
2180 while ((obs = *obsp++) != 0)
2181 FOR_PROVIDES(po, ppo, obs)
2182 MAPSET(&obsmap, po);
2184 for (i = j = 0; i < dqs.count; i++)
2185 if (!MAPTST(&obsmap, dqs.elements[i]))
2186 dqs.elements[j++] = dqs.elements[i];
2188 for (i = j = 0; i < dq.count; i++)
2189 if (!MAPTST(&obsmap, dq.elements[i]))
2190 dq.elements[j++] = dq.elements[i];
2195 /* filter out all already supplemented packages if requested */
2196 if (!solv->addalreadyrecommended && dqs.count)
2198 /* turn off all new packages */
2199 for (i = 0; i < solv->decisionq.count; i++)
2201 p = solv->decisionq.elements[i];
2204 s = pool->solvables + p;
2205 if (s->repo && s->repo != solv->installed)
2206 solv->decisionmap[p] = -solv->decisionmap[p];
2208 /* filter out old supplements */
2209 for (i = j = 0; i < dqs.count; i++)
2211 p = dqs.elements[i];
2212 s = pool->solvables + p;
2213 if (!s->supplements)
2215 if (!solver_is_supplementing(solv, s))
2216 dqs.elements[j++] = p;
2217 else if (s->supplements && solv->installsuppdepq && solver_check_installsuppdepq(solv, s))
2218 dqs.elements[j++] = p;
2221 /* undo turning off */
2222 for (i = 0; i < solv->decisionq.count; i++)
2224 p = solv->decisionq.elements[i];
2227 s = pool->solvables + p;
2228 if (s->repo && s->repo != solv->installed)
2229 solv->decisionmap[p] = -solv->decisionmap[p];
2233 /* multiversion doesn't mix well with supplements.
2234 * filter supplemented packages where we already decided
2235 * to install a different version (see bnc#501088) */
2236 if (dqs.count && solv->noobsoletes.size)
2238 for (i = j = 0; i < dqs.count; i++)
2240 p = dqs.elements[i];
2241 if (MAPTST(&solv->noobsoletes, p))
2244 s = pool->solvables + p;
2245 FOR_PROVIDES(p2, pp2, s->name)
2246 if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name)
2249 continue; /* ignore this package */
2251 dqs.elements[j++] = p;
2256 /* make dq contain both recommended and supplemented pkgs */
2259 for (i = 0; i < dqs.count; i++)
2260 queue_pushunique(&dq, dqs.elements[i]);
2266 int decisioncount = solv->decisionq.count;
2270 /* simple case, just one package. no need to choose to best version */
2273 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2275 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2276 level = setpropagatelearn(solv, level, p, 0, 0);
2279 continue; /* back to main loop */
2282 /* filter packages, this gives us the best versions */
2283 policy_filter_unwanted(solv, &dq, POLICY_MODE_RECOMMEND);
2285 /* create map of result */
2286 map_init(&dqmap, pool->nsolvables);
2287 for (i = 0; i < dq.count; i++)
2288 MAPSET(&dqmap, dq.elements[i]);
2290 /* install all supplemented packages */
2291 for (i = 0; i < dqs.count; i++)
2293 p = dqs.elements[i];
2294 if (solv->decisionmap[p] || !MAPTST(&dqmap, p))
2296 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2298 level = setpropagatelearn(solv, level, p, 0, 0);
2299 if (level <= olevel)
2302 if (i < dqs.count || solv->decisionq.count < decisioncount)
2310 /* install all recommended packages */
2311 /* more work as we want to created branches if multiple
2312 * choices are valid */
2313 for (i = 0; i < decisioncount; i++)
2316 p = solv->decisionq.elements[i];
2319 s = pool->solvables + p;
2320 if (!s->repo || (!solv->addalreadyrecommended && s->repo == solv->installed))
2324 recp = s->repo->idarraydata + s->recommends;
2325 while ((rec = *recp++) != 0)
2328 FOR_PROVIDES(p, pp, rec)
2330 if (solv->decisionmap[p] > 0)
2335 else if (solv->decisionmap[p] == 0 && MAPTST(&dqmap, p))
2336 queue_pushunique(&dq, p);
2342 /* multiple candidates, open a branch */
2343 for (i = 1; i < dq.count; i++)
2344 queue_push(&solv->branches, dq.elements[i]);
2345 queue_push(&solv->branches, -level);
2348 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2350 level = setpropagatelearn(solv, level, p, 0, 0);
2351 if (level <= olevel || solv->decisionq.count < decisioncount)
2352 break; /* we had to revert some decisions */
2355 break; /* had a problem above, quit loop */
2360 continue; /* back to main loop so that all deps are checked */
2364 solv->decisioncnt_orphan = solv->decisionq.count;
2365 if (solv->dupmap_all && solv->installed)
2367 int installedone = 0;
2369 /* let's see if we can install some unsupported package */
2370 POOL_DEBUG(SOLV_DEBUG_SOLVER, "deciding orphaned packages\n");
2371 for (i = 0; i < solv->orphaned.count; i++)
2373 p = solv->orphaned.elements[i];
2374 if (solv->decisionmap[p])
2375 continue; /* already decided */
2376 if (solv->droporphanedmap_all)
2378 if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))
2380 POOL_DEBUG(SOLV_DEBUG_SOLVER, "keeping orphaned %s\n", pool_solvid2str(pool, p));
2382 level = setpropagatelearn(solv, level, p, 0, 0);
2387 if (installedone || i < solv->orphaned.count)
2391 continue; /* back to main loop */
2393 for (i = 0; i < solv->orphaned.count; i++)
2395 p = solv->orphaned.elements[i];
2396 if (solv->decisionmap[p])
2397 continue; /* already decided */
2398 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing orphaned %s\n", pool_solvid2str(pool, p));
2400 level = setpropagatelearn(solv, level, -p, 0, 0);
2404 if (i < solv->orphaned.count)
2408 continue; /* back to main loop */
2412 if (solv->installed && solv->cleandepsmap.size)
2414 if (cleandeps_check_mistakes(solv, level))
2416 level = 1; /* restart from scratch */
2417 systemlevel = level + 1;
2422 if (solv->solution_callback)
2424 solv->solution_callback(solv, solv->solution_callback_data);
2425 if (solv->branches.count)
2427 int i = solv->branches.count - 1;
2428 int l = -solv->branches.elements[i];
2432 if (solv->branches.elements[i - 1] < 0)
2434 p = solv->branches.elements[i];
2435 POOL_DEBUG(SOLV_DEBUG_SOLVER, "branching with %s\n", pool_solvid2str(pool, p));
2437 for (j = i + 1; j < solv->branches.count; j++)
2438 queue_push(&dq, solv->branches.elements[j]);
2439 solv->branches.count = i;
2441 revert(solv, level);
2443 for (j = 0; j < dq.count; j++)
2444 queue_push(&solv->branches, dq.elements[j]);
2446 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2448 level = setpropagatelearn(solv, level, p, disablerules, why);
2453 /* all branches done, we're finally finished */
2457 /* auto-minimization step */
2458 if (solv->branches.count)
2460 int l = 0, lasti = -1, lastl = -1;
2464 for (i = solv->branches.count - 1; i >= 0; i--)
2466 p = solv->branches.elements[i];
2469 else if (p > 0 && solv->decisionmap[p] > l + 1)
2477 /* kill old solvable so that we do not loop */
2478 p = solv->branches.elements[lasti];
2479 solv->branches.elements[lasti] = 0;
2480 POOL_DEBUG(SOLV_DEBUG_SOLVER, "minimizing %d -> %d with %s\n", solv->decisionmap[p], lastl, pool_solvid2str(pool, p));
2481 minimizationsteps++;
2484 revert(solv, level);
2485 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2488 level = setpropagatelearn(solv, level, p, disablerules, why);
2491 continue; /* back to main loop */
2494 /* no minimization found, we're finally finished! */
2498 POOL_DEBUG(SOLV_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable, %d minimization steps\n", solv->stats_learned, solv->stats_unsolvable, minimizationsteps);
2500 POOL_DEBUG(SOLV_DEBUG_STATS, "done solving.\n\n");
2506 solv->decisioncnt_update = solv->decisionq.count;
2507 solv->decisioncnt_keep = solv->decisionq.count;
2508 solv->decisioncnt_resolve = solv->decisionq.count;
2509 solv->decisioncnt_weak = solv->decisionq.count;
2510 solv->decisioncnt_orphan = solv->decisionq.count;
2513 solver_printdecisionq(solv, SOLV_DEBUG_RESULT);
2518 /*-------------------------------------------------------------------
2520 * remove disabled conflicts
2522 * purpose: update the decisionmap after some rules were disabled.
2523 * this is used to calculate the suggested/recommended package list.
2524 * Also returns a "removed" list to undo the discisionmap changes.
2528 removedisabledconflicts(Solver *solv, Queue *removed)
2530 Pool *pool = solv->pool;
2535 Id *decisionmap = solv->decisionmap;
2537 queue_empty(removed);
2538 for (i = 0; i < solv->decisionq.count; i++)
2540 p = solv->decisionq.elements[i];
2542 continue; /* conflicts only, please */
2543 why = solv->decisionq_why.elements[i];
2546 /* no rule involved, must be a orphan package drop */
2549 /* we never do conflicts on free decisions, so there
2550 * must have been an unit rule */
2552 r = solv->rules + why;
2553 if (r->d < 0 && decisionmap[-p])
2555 /* rule is now disabled, remove from decisionmap */
2556 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing conflict for package %s[%d]\n", pool_solvid2str(pool, -p), -p);
2557 queue_push(removed, -p);
2558 queue_push(removed, decisionmap[-p]);
2559 decisionmap[-p] = 0;
2562 if (!removed->count)
2564 /* we removed some confliced packages. some of them might still
2565 * be in conflict, so search for unit rules and re-conflict */
2567 for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
2569 if (i == solv->nrules)
2572 r = solv->rules + i;
2578 if (r->p < 0 && !decisionmap[-r->p])
2584 if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
2586 else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
2591 if (r->p < 0 && decisionmap[-r->p] == 0)
2593 if (new || DECISIONMAP_FALSE(r->p))
2595 dp = pool->whatprovidesdata + r->d;
2596 while ((p = *dp++) != 0)
2598 if (new && p == new)
2600 if (p < 0 && decisionmap[-p] == 0)
2609 else if (!DECISIONMAP_FALSE(p))
2619 POOL_DEBUG(SOLV_DEBUG_SOLVER, "re-conflicting package %s[%d]\n", pool_solvid2str(pool, -new), -new);
2620 decisionmap[-new] = -1;
2622 n = 0; /* redo all rules */
2628 undo_removedisabledconflicts(Solver *solv, Queue *removed)
2631 for (i = 0; i < removed->count; i += 2)
2632 solv->decisionmap[removed->elements[i]] = removed->elements[i + 1];
2636 /*-------------------------------------------------------------------
2638 * weaken solvable dependencies
2642 weaken_solvable_deps(Solver *solv, Id p)
2647 for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++)
2651 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2652 continue; /* conflict */
2653 queue_push(&solv->weakruleq, i);
2658 /********************************************************************/
2663 solver_calculate_noobsmap(Pool *pool, Queue *job, Map *noobsmap)
2666 Id how, what, select;
2668 for (i = 0; i < job->count; i += 2)
2670 how = job->elements[i];
2671 if ((how & SOLVER_JOBMASK) != SOLVER_NOOBSOLETES)
2673 what = job->elements[i + 1];
2674 select = how & SOLVER_SELECTMASK;
2675 if (!noobsmap->size)
2676 map_grow(noobsmap, pool->nsolvables);
2677 if (select == SOLVER_SOLVABLE_ALL)
2679 FOR_POOL_SOLVABLES(p)
2680 MAPSET(noobsmap, p);
2682 else if (select == SOLVER_SOLVABLE_REPO)
2685 Repo *repo = pool_id2repo(pool, what);
2687 FOR_REPO_SOLVABLES(repo, p, s)
2688 MAPSET(noobsmap, p);
2690 FOR_JOB_SELECT(p, pp, select, what)
2691 MAPSET(noobsmap, p);
2696 * add a rule created by a job, record job number and weak flag
2699 solver_addjobrule(Solver *solv, Id p, Id d, Id job, int weak)
2701 solver_addrule(solv, p, d);
2702 queue_push(&solv->ruletojob, job);
2704 queue_push(&solv->weakruleq, solv->nrules - 1);
2708 add_cleandeps_package(Solver *solv, Id p)
2710 if (!solv->cleandeps_updatepkgs)
2712 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
2713 queue_init(solv->cleandeps_updatepkgs);
2715 queue_pushunique(solv->cleandeps_updatepkgs, p);
2719 add_update_target(Solver *solv, Id p, Id how)
2721 Pool *pool = solv->pool;
2722 Solvable *s = pool->solvables + p;
2723 Repo *installed = solv->installed;
2725 if (!solv->update_targets)
2727 solv->update_targets = solv_calloc(1, sizeof(Queue));
2728 queue_init(solv->update_targets);
2730 if (s->repo == installed)
2732 queue_push2(solv->update_targets, p, p);
2735 FOR_PROVIDES(pi, pip, s->name)
2737 Solvable *si = pool->solvables + pi;
2738 if (si->repo != installed || si->name != s->name)
2740 if (how & SOLVER_FORCEBEST)
2742 if (!solv->bestupdatemap.size)
2743 map_grow(&solv->bestupdatemap, installed->end - installed->start);
2744 MAPSET(&solv->bestupdatemap, pi - installed->start);
2746 if (how & SOLVER_CLEANDEPS)
2747 add_cleandeps_package(solv, pi);
2748 queue_push2(solv->update_targets, pi, p);
2749 /* check if it's ok to keep the installed package */
2750 if (s->evr == si->evr && solvable_identical(s, si))
2751 queue_push2(solv->update_targets, pi, pi);
2755 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2756 while ((obs = *obsp++) != 0)
2758 FOR_PROVIDES(pi, pip, obs)
2760 Solvable *si = pool->solvables + pi;
2761 if (si->repo != installed)
2763 if (si->name == s->name)
2764 continue; /* already handled above */
2765 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
2767 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
2769 if (how & SOLVER_FORCEBEST)
2771 if (!solv->bestupdatemap.size)
2772 map_grow(&solv->bestupdatemap, installed->end - installed->start);
2773 MAPSET(&solv->bestupdatemap, pi - installed->start);
2775 if (how & SOLVER_CLEANDEPS)
2776 add_cleandeps_package(solv, pi);
2777 queue_push2(solv->update_targets, pi, p);
2784 transform_update_targets_sortfn(const void *ap, const void *bp, void *dp)
2794 transform_update_targets(Solver *solv)
2796 Repo *installed = solv->installed;
2797 Queue *update_targets = solv->update_targets;
2799 Id p, q, lastp, lastq;
2801 if (!update_targets->count)
2803 queue_free(update_targets);
2804 solv->update_targets = solv_free(update_targets);
2807 if (update_targets->count > 2)
2808 solv_sort(update_targets->elements, update_targets->count >> 1, 2 * sizeof(Id), transform_update_targets_sortfn, solv);
2809 queue_insertn(update_targets, 0, installed->end - installed->start);
2811 for (i = j = installed->end - installed->start; i < update_targets->count; i += 2)
2813 if ((p = update_targets->elements[i]) != lastp)
2815 if (!solv->updatemap.size)
2816 map_grow(&solv->updatemap, installed->end - installed->start);
2817 MAPSET(&solv->updatemap, p - installed->start);
2818 update_targets->elements[j++] = 0; /* finish old set */
2819 update_targets->elements[p - installed->start] = j; /* start new set */
2823 if ((q = update_targets->elements[i + 1]) != lastq)
2825 update_targets->elements[j++] = q;
2829 queue_truncate(update_targets, j);
2830 queue_push(update_targets, 0); /* finish last set */
2841 solver_solve(Solver *solv, Queue *job)
2843 Pool *pool = solv->pool;
2844 Repo *installed = solv->installed;
2847 Map addedmap; /* '1' == have rpm-rules for solvable */
2848 Map installcandidatemap;
2849 Id how, what, select, name, weak, p, pp, d;
2853 int now, solve_start;
2855 int hasbestinstalljob = 0;
2857 solve_start = solv_timems(0);
2859 /* log solver options */
2860 POOL_DEBUG(SOLV_DEBUG_STATS, "solver started\n");
2861 POOL_DEBUG(SOLV_DEBUG_STATS, "dosplitprovides=%d, noupdateprovide=%d, noinfarchcheck=%d\n", solv->dosplitprovides, solv->noupdateprovide, solv->noinfarchcheck);
2862 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);
2863 POOL_DEBUG(SOLV_DEBUG_STATS, "promoteepoch=%d, forbidselfconflicts=%d\n", pool->promoteepoch, pool->forbidselfconflicts);
2864 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d, obsoleteusescolors=%d\n", pool->obsoleteusesprovides, pool->implicitobsoleteusesprovides, pool->obsoleteusescolors);
2865 POOL_DEBUG(SOLV_DEBUG_STATS, "dontinstallrecommended=%d, addalreadyrecommended=%d\n", solv->dontinstallrecommended, solv->addalreadyrecommended);
2867 /* create whatprovides if not already there */
2868 if (!pool->whatprovides)
2869 pool_createwhatprovides(pool);
2871 /* create obsolete index */
2872 policy_create_obsolete_index(solv);
2875 queue_free(&solv->job);
2876 queue_init_clone(&solv->job, job);
2877 solv->pooljobcnt = pool->pooljobs.count;
2878 if (pool->pooljobs.count)
2880 queue_insertn(&solv->job, 0, pool->pooljobs.count);
2881 memcpy(solv->job.elements, pool->pooljobs.elements, pool->pooljobs.count * sizeof(Id));
2885 /* free old stuff */
2886 if (solv->update_targets)
2888 queue_free(solv->update_targets);
2889 solv->update_targets = solv_free(solv->update_targets);
2891 if (solv->cleandeps_updatepkgs)
2893 queue_free(solv->cleandeps_updatepkgs);
2894 solv->cleandeps_updatepkgs = solv_free(solv->cleandeps_updatepkgs);
2898 * create basic rule set of all involved packages
2899 * use addedmap bitmap to make sure we don't create rules twice
2902 /* create noobsolete map if needed */
2903 solver_calculate_noobsmap(pool, job, &solv->noobsoletes);
2905 map_init(&addedmap, pool->nsolvables);
2906 MAPSET(&addedmap, SYSTEMSOLVABLE);
2908 map_init(&installcandidatemap, pool->nsolvables);
2911 now = solv_timems(0);
2913 * create rules for all package that could be involved with the solving
2914 * so called: rpm rules
2919 /* check for update/verify jobs as they need to be known early */
2920 for (i = 0; i < job->count; i += 2)
2922 how = job->elements[i];
2923 what = job->elements[i + 1];
2924 select = how & SOLVER_SELECTMASK;
2925 switch (how & SOLVER_JOBMASK)
2928 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
2929 solv->fixmap_all = 1;
2930 FOR_JOB_SELECT(p, pp, select, what)
2932 s = pool->solvables + p;
2933 if (s->repo != installed)
2935 if (!solv->fixmap.size)
2936 map_grow(&solv->fixmap, installed->end - installed->start);
2937 MAPSET(&solv->fixmap, p - installed->start);
2941 if (select == SOLVER_SOLVABLE_ALL)
2943 solv->updatemap_all = 1;
2944 if (how & SOLVER_FORCEBEST)
2945 solv->bestupdatemap_all = 1;
2946 if (how & SOLVER_CLEANDEPS)
2948 FOR_REPO_SOLVABLES(installed, p, s)
2949 add_cleandeps_package(solv, p);
2952 else if (select == SOLVER_SOLVABLE_REPO)
2954 Repo *repo = pool_id2repo(pool, what);
2957 if (repo == installed && !(how & SOLVER_TARGETED))
2959 solv->updatemap_all = 1;
2960 if (how & SOLVER_FORCEBEST)
2961 solv->bestupdatemap_all = 1;
2962 if (how & SOLVER_CLEANDEPS)
2964 FOR_REPO_SOLVABLES(installed, p, s)
2965 add_cleandeps_package(solv, p);
2969 if (solv->noautotarget && !(how & SOLVER_TARGETED))
2971 /* targeted update */
2972 FOR_REPO_SOLVABLES(repo, p, s)
2973 add_update_target(solv, p, how);
2977 if (!(how & SOLVER_TARGETED))
2980 FOR_JOB_SELECT(p, pp, select, what)
2982 s = pool->solvables + p;
2983 if (s->repo != installed)
2985 if (!solv->updatemap.size)
2986 map_grow(&solv->updatemap, installed->end - installed->start);
2987 MAPSET(&solv->updatemap, p - installed->start);
2988 if (how & SOLVER_FORCEBEST)
2990 if (!solv->bestupdatemap.size)
2991 map_grow(&solv->bestupdatemap, installed->end - installed->start);
2992 MAPSET(&solv->bestupdatemap, p - installed->start);
2994 if (how & SOLVER_CLEANDEPS)
2995 add_cleandeps_package(solv, p);
2998 if (!targeted || solv->noautotarget)
3001 FOR_JOB_SELECT(p, pp, select, what)
3002 add_update_target(solv, p, how);
3010 if (solv->update_targets)
3011 transform_update_targets(solv);
3013 oldnrules = solv->nrules;
3014 FOR_REPO_SOLVABLES(installed, p, s)
3015 solver_addrpmrulesforsolvable(solv, s, &addedmap);
3016 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
3017 oldnrules = solv->nrules;
3018 FOR_REPO_SOLVABLES(installed, p, s)
3019 solver_addrpmrulesforupdaters(solv, s, &addedmap, 1);
3020 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
3024 * create rules for all packages involved in the job
3025 * (to be installed or removed)
3028 oldnrules = solv->nrules;
3029 for (i = 0; i < job->count; i += 2)
3031 how = job->elements[i];
3032 what = job->elements[i + 1];
3033 select = how & SOLVER_SELECTMASK;
3035 switch (how & SOLVER_JOBMASK)
3037 case SOLVER_INSTALL:
3038 FOR_JOB_SELECT(p, pp, select, what)
3040 MAPSET(&installcandidatemap, p);
3041 solver_addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
3044 case SOLVER_DISTUPGRADE:
3045 if (select == SOLVER_SOLVABLE_ALL)
3047 solv->dupmap_all = 1;
3048 solv->updatemap_all = 1;
3049 if (how & SOLVER_FORCEBEST)
3050 solv->bestupdatemap_all = 1;
3052 if (!solv->dupmap_all)
3059 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
3063 * add rules for suggests, enhances
3065 oldnrules = solv->nrules;
3066 solver_addrpmrulesforweak(solv, &addedmap);
3067 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
3070 * first pass done, we now have all the rpm rules we need.
3071 * unify existing rules before going over all job rules and
3073 * at this point the system is always solvable,
3074 * as an empty system (remove all packages) is a valid solution
3077 IF_POOLDEBUG (SOLV_DEBUG_STATS)
3079 int possible = 0, installable = 0;
3080 for (i = 1; i < pool->nsolvables; i++)
3082 if (pool_installable(pool, pool->solvables + i))
3084 if (MAPTST(&addedmap, i))
3087 POOL_DEBUG(SOLV_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
3090 solver_unifyrules(solv); /* remove duplicate rpm rules */
3091 solv->rpmrules_end = solv->nrules; /* mark end of rpm rules */
3093 POOL_DEBUG(SOLV_DEBUG_STATS, "rpm rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
3094 POOL_DEBUG(SOLV_DEBUG_STATS, "rpm rule creation took %d ms\n", solv_timems(now));
3096 /* create dup maps if needed. We need the maps early to create our
3099 solver_createdupmaps(solv);
3102 * create feature rules
3104 * foreach installed:
3105 * create assertion (keep installed, if no update available)
3107 * create update rule (A|update1(A)|update2(A)|...)
3109 * those are used later on to keep a version of the installed packages in
3113 solv->featurerules = solv->nrules; /* mark start of feature rules */
3116 /* foreach possibly installed solvable */
3117 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3119 if (s->repo != installed)
3121 solver_addrule(solv, 0, 0); /* create dummy rule */
3124 solver_addupdaterule(solv, s, 1); /* allow s to be updated */
3126 /* make sure we accounted for all rules */
3127 assert(solv->nrules - solv->featurerules == installed->end - installed->start);
3129 solv->featurerules_end = solv->nrules;
3132 * Add update rules for installed solvables
3134 * almost identical to feature rules
3135 * except that downgrades/archchanges/vendorchanges are not allowed
3138 solv->updaterules = solv->nrules;
3141 { /* foreach installed solvables */
3142 /* we create all update rules, but disable some later on depending on the job */
3143 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3147 if (s->repo != installed)
3149 solver_addrule(solv, 0, 0); /* create dummy rule */
3152 solver_addupdaterule(solv, s, 0); /* allowall = 0: downgrades not allowed */
3154 * check for and remove duplicate
3156 r = solv->rules + solv->nrules - 1; /* r: update rule */
3157 sr = r - (installed->end - installed->start); /* sr: feature rule */
3158 /* it's orphaned if there is no feature rule or the feature rule
3159 * consists just of the installed package */
3160 if (!sr->p || (sr->p == i && !sr->d && !sr->w2))
3161 queue_push(&solv->orphaned, i);
3164 assert(solv->dupmap_all && !sr->p);
3167 if (!solver_rulecmp(solv, r, sr))
3168 memset(sr, 0, sizeof(*sr)); /* delete unneeded feature rule */
3170 solver_disablerule(solv, sr); /* disable feature rule */
3172 /* consistency check: we added a rule for _every_ installed solvable */
3173 assert(solv->nrules - solv->updaterules == installed->end - installed->start);
3175 solv->updaterules_end = solv->nrules;
3179 * now add all job rules
3182 solv->jobrules = solv->nrules;
3183 for (i = 0; i < job->count; i += 2)
3185 oldnrules = solv->nrules;
3187 if (i && i == solv->pooljobcnt)
3188 POOL_DEBUG(SOLV_DEBUG_JOB, "end of pool jobs\n");
3189 how = job->elements[i];
3190 what = job->elements[i + 1];
3191 weak = how & SOLVER_WEAK;
3192 select = how & SOLVER_SELECTMASK;
3193 switch (how & SOLVER_JOBMASK)
3195 case SOLVER_INSTALL:
3196 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3197 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3198 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3199 if (select == SOLVER_SOLVABLE)
3207 FOR_JOB_SELECT(p, pp, select, what)
3211 /* no candidate found, make this an impossible rule */
3212 queue_push(&q, -SYSTEMSOLVABLE);
3214 p = queue_shift(&q); /* get first candidate */
3215 d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q); /* internalize */
3217 /* force install of namespace supplements hack */
3218 if (select == SOLVER_SOLVABLE_PROVIDES && !d && (p == SYSTEMSOLVABLE || p == -SYSTEMSOLVABLE) && ISRELDEP(what))
3220 Reldep *rd = GETRELDEP(pool, what);
3221 if (rd->flags == REL_NAMESPACE)
3224 if (!solv->installsuppdepq)
3226 solv->installsuppdepq = solv_calloc(1, sizeof(Queue));
3227 queue_init(solv->installsuppdepq);
3229 queue_pushunique(solv->installsuppdepq, rd->evr == 0 ? rd->name : what);
3232 solver_addjobrule(solv, p, d, i, weak);
3233 if (how & SOLVER_FORCEBEST)
3234 hasbestinstalljob = 1;
3237 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %s%serase %s\n", weak ? "weak " : "", how & SOLVER_CLEANDEPS ? "clean deps " : "", solver_select2str(pool, select, what));
3238 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3239 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3240 /* specific solvable: by id or by nevra */
3241 name = (select == SOLVER_SOLVABLE || (select == SOLVER_SOLVABLE_NAME && ISRELDEP(what))) ? 0 : -1;
3242 if (select == SOLVER_SOLVABLE_ALL) /* hmmm ;) */
3244 FOR_POOL_SOLVABLES(p)
3245 solver_addjobrule(solv, -p, 0, i, weak);
3247 else if (select == SOLVER_SOLVABLE_REPO)
3249 Repo *repo = pool_id2repo(pool, what);
3251 FOR_REPO_SOLVABLES(repo, p, s)
3252 solver_addjobrule(solv, -p, 0, i, weak);
3254 FOR_JOB_SELECT(p, pp, select, what)
3256 s = pool->solvables + p;
3257 if (installed && s->repo == installed)
3258 name = !name ? s->name : -1;
3259 solver_addjobrule(solv, -p, 0, i, weak);
3261 /* special case for "erase a specific solvable": we also
3262 * erase all other solvables with that name, so that they
3263 * don't get picked up as replacement.
3264 * name is > 0 if exactly one installed solvable matched.
3266 /* XXX: look also at packages that obsolete this package? */
3271 FOR_PROVIDES(p, pp, name)
3273 s = pool->solvables + p;
3274 if (s->name != name)
3276 /* keep other versions installed */
3277 if (s->repo == installed)
3279 /* keep installcandidates of other jobs */
3280 if (MAPTST(&installcandidatemap, p))
3282 /* don't add the same rule twice */
3283 for (j = oldnrules; j < k; j++)
3284 if (solv->rules[j].p == -p)
3287 solver_addjobrule(solv, -p, 0, i, weak); /* remove by id */
3293 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3296 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sverify %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3298 case SOLVER_WEAKENDEPS:
3299 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3300 if (select != SOLVER_SOLVABLE)
3302 s = pool->solvables + what;
3303 weaken_solvable_deps(solv, what);
3305 case SOLVER_NOOBSOLETES:
3306 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sno obsolete %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3309 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3310 if (select == SOLVER_SOLVABLE_ALL)
3312 FOR_POOL_SOLVABLES(p)
3313 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3315 else if (select == SOLVER_SOLVABLE_REPO)
3317 Repo *repo = pool_id2repo(pool, what);
3319 FOR_REPO_SOLVABLES(repo, p, s)
3320 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3322 FOR_JOB_SELECT(p, pp, select, what)
3323 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3325 case SOLVER_DISTUPGRADE:
3326 POOL_DEBUG(SOLV_DEBUG_JOB, "job: distupgrade %s\n", solver_select2str(pool, select, what));
3328 case SOLVER_DROP_ORPHANED:
3329 POOL_DEBUG(SOLV_DEBUG_JOB, "job: drop orphaned %s\n", solver_select2str(pool, select, what));
3330 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3331 solv->droporphanedmap_all = 1;
3332 FOR_JOB_SELECT(p, pp, select, what)
3334 s = pool->solvables + p;
3335 if (!installed || s->repo != installed)
3337 if (!solv->droporphanedmap.size)
3338 map_grow(&solv->droporphanedmap, installed->end - installed->start);
3339 MAPSET(&solv->droporphanedmap, p - installed->start);
3342 case SOLVER_USERINSTALLED:
3343 POOL_DEBUG(SOLV_DEBUG_JOB, "job: user installed %s\n", solver_select2str(pool, select, what));
3346 POOL_DEBUG(SOLV_DEBUG_JOB, "job: unknown job\n");
3354 IF_POOLDEBUG (SOLV_DEBUG_JOB)
3357 if (solv->nrules == oldnrules)
3358 POOL_DEBUG(SOLV_DEBUG_JOB, " - no rule created\n");
3359 for (j = oldnrules; j < solv->nrules; j++)
3361 POOL_DEBUG(SOLV_DEBUG_JOB, " - job ");
3362 solver_printrule(solv, SOLV_DEBUG_JOB, solv->rules + j);
3366 assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
3367 solv->jobrules_end = solv->nrules;
3369 /* now create infarch and dup rules */
3370 if (!solv->noinfarchcheck)
3372 solver_addinfarchrules(solv, &addedmap);
3373 if (pool->obsoleteusescolors)
3375 /* currently doesn't work well with infarch rules, so make
3377 for (i = solv->infarchrules; i < solv->infarchrules_end; i++)
3378 queue_push(&solv->weakruleq, i);
3382 solv->infarchrules = solv->infarchrules_end = solv->nrules;
3385 solver_addduprules(solv, &addedmap);
3387 solv->duprules = solv->duprules_end = solv->nrules;
3389 if (solv->bestupdatemap_all || solv->bestupdatemap.size || hasbestinstalljob)
3390 solver_addbestrules(solv, hasbestinstalljob);
3392 solv->bestrules = solv->bestrules_end = solv->nrules;
3395 solver_freedupmaps(solv); /* no longer needed */
3398 solver_addchoicerules(solv);
3400 solv->choicerules = solv->choicerules_end = solv->nrules;
3404 for (i = solv->featurerules; i < solv->nrules; i++)
3405 solver_printruleclass(solv, SOLV_DEBUG_RESULT, solv->rules + i);
3407 /* all rules created
3408 * --------------------------------------------------------------
3409 * prepare for solving
3412 /* free unneeded memory */
3413 map_free(&addedmap);
3414 map_free(&installcandidatemap);
3417 POOL_DEBUG(SOLV_DEBUG_STATS, "%d rpm rules, 2 * %d update rules, %d job rules, %d infarch rules, %d dup rules, %d choice rules, %d best rules\n", solv->rpmrules_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);
3418 POOL_DEBUG(SOLV_DEBUG_STATS, "overall rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
3420 /* create weak map */
3421 map_init(&solv->weakrulemap, solv->nrules);
3422 for (i = 0; i < solv->weakruleq.count; i++)
3424 p = solv->weakruleq.elements[i];
3425 MAPSET(&solv->weakrulemap, p);
3428 /* enable cleandepsmap creation if we have updatepkgs */
3429 if (solv->cleandeps_updatepkgs && !solv->cleandepsmap.size)
3430 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3432 if (solv->cleandeps_mistakes)
3434 queue_free(solv->cleandeps_mistakes);
3435 solv->cleandeps_mistakes = solv_free(solv->cleandeps_mistakes);
3438 /* all new rules are learnt after this point */
3439 solv->learntrules = solv->nrules;
3441 /* create watches chains */
3444 /* create assertion index. it is only used to speed up
3445 * makeruledecsions() a bit */
3446 for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
3447 if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
3448 queue_push(&solv->ruleassertions, i);
3450 /* disable update rules that conflict with our job */
3451 solver_disablepolicyrules(solv);
3453 /* make initial decisions based on assertion rules */
3454 makeruledecisions(solv);
3455 POOL_DEBUG(SOLV_DEBUG_SOLVER, "problems so far: %d\n", solv->problems.count);
3458 * ********************************************
3460 * ********************************************
3463 now = solv_timems(0);
3464 solver_run_sat(solv, 1, solv->dontinstallrecommended ? 0 : 1);
3465 POOL_DEBUG(SOLV_DEBUG_STATS, "solver took %d ms\n", solv_timems(now));
3468 * prepare solution queue if there were problems
3470 solver_prepare_solutions(solv);
3472 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);
3473 POOL_DEBUG(SOLV_DEBUG_STATS, "solver_solve took %d ms\n", solv_timems(solve_start));
3475 /* return number of problems */
3476 return solv->problems.count ? solv->problems.count / 2 : 0;
3480 solver_create_transaction(Solver *solv)
3482 return transaction_create_decisionq(solv->pool, &solv->decisionq, &solv->noobsoletes);
3485 void solver_get_orphaned(Solver *solv, Queue *orphanedq)
3487 queue_free(orphanedq);
3488 queue_init_clone(orphanedq, &solv->orphaned);
3491 void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected)
3493 Pool *pool = solv->pool;
3494 Queue redoq, disabledq;
3500 if (!recommendationsq && !suggestionsq)
3503 map_init(&obsmap, pool->nsolvables);
3504 if (solv->installed)
3506 Id obs, *obsp, p, po, ppo;
3507 for (p = solv->installed->start; p < solv->installed->end; p++)
3509 s = pool->solvables + p;
3510 if (s->repo != solv->installed || !s->obsoletes)
3512 if (solv->decisionmap[p] <= 0)
3514 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
3516 obsp = s->repo->idarraydata + s->obsoletes;
3517 /* foreach obsoletes */
3518 while ((obs = *obsp++) != 0)
3519 FOR_PROVIDES(po, ppo, obs)
3520 MAPSET(&obsmap, po);
3525 queue_init(&disabledq);
3527 /* disable all erase jobs (including weak "keep uninstalled" rules) */
3528 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
3530 if (r->d < 0) /* disabled ? */
3532 if (r->p >= 0) /* install job? */
3534 queue_push(&disabledq, i);
3535 solver_disablerule(solv, r);
3541 enabledisablelearntrules(solv);
3542 removedisabledconflicts(solv, &redoq);
3546 * find recommended packages
3548 if (recommendationsq)
3550 Id rec, *recp, p, pp;
3552 queue_empty(recommendationsq);
3553 /* create map of all recommened packages */
3554 solv->recommends_index = -1;
3555 MAPZERO(&solv->recommendsmap);
3557 /* put all packages the solver already chose in the map */
3558 if (solv->decisioncnt_weak)
3560 for (i = solv->decisioncnt_weak; i < solv->decisioncnt_orphan; i++)
3563 why = solv->decisionq_why.elements[i];
3565 continue; /* forced by unit rule */
3566 p = solv->decisionq.elements[i];
3569 MAPSET(&solv->recommendsmap, p);
3573 for (i = 0; i < solv->decisionq.count; i++)
3575 p = solv->decisionq.elements[i];
3578 s = pool->solvables + p;
3581 recp = s->repo->idarraydata + s->recommends;
3582 while ((rec = *recp++) != 0)
3584 FOR_PROVIDES(p, pp, rec)
3585 if (solv->decisionmap[p] > 0)
3591 FOR_PROVIDES(p, pp, rec)
3592 if (solv->decisionmap[p] > 0)
3593 MAPSET(&solv->recommendsmap, p);
3595 continue; /* p != 0: already fulfilled */
3597 FOR_PROVIDES(p, pp, rec)
3598 MAPSET(&solv->recommendsmap, p);
3602 for (i = 1; i < pool->nsolvables; i++)
3604 if (solv->decisionmap[i] < 0)
3606 if (solv->decisionmap[i] > 0 && noselected)
3608 if (MAPTST(&obsmap, i))
3610 s = pool->solvables + i;
3611 if (!MAPTST(&solv->recommendsmap, i))
3613 if (!s->supplements)
3615 if (!pool_installable(pool, s))
3617 if (!solver_is_supplementing(solv, s))
3620 queue_push(recommendationsq, i);
3622 /* we use MODE_SUGGEST here so that repo prio is ignored */
3623 policy_filter_unwanted(solv, recommendationsq, POLICY_MODE_SUGGEST);
3627 * find suggested packages
3632 Id sug, *sugp, p, pp;
3634 queue_empty(suggestionsq);
3635 /* create map of all suggests that are still open */
3636 solv->recommends_index = -1;
3637 MAPZERO(&solv->suggestsmap);
3638 for (i = 0; i < solv->decisionq.count; i++)
3640 p = solv->decisionq.elements[i];
3643 s = pool->solvables + p;
3646 sugp = s->repo->idarraydata + s->suggests;
3647 while ((sug = *sugp++) != 0)
3649 FOR_PROVIDES(p, pp, sug)
3650 if (solv->decisionmap[p] > 0)
3656 FOR_PROVIDES(p, pp, sug)
3657 if (solv->decisionmap[p] > 0)
3658 MAPSET(&solv->suggestsmap, p);
3660 continue; /* already fulfilled */
3662 FOR_PROVIDES(p, pp, sug)
3663 MAPSET(&solv->suggestsmap, p);
3667 for (i = 1; i < pool->nsolvables; i++)
3669 if (solv->decisionmap[i] < 0)
3671 if (solv->decisionmap[i] > 0 && noselected)
3673 if (MAPTST(&obsmap, i))
3675 s = pool->solvables + i;
3676 if (!MAPTST(&solv->suggestsmap, i))
3680 if (!pool_installable(pool, s))
3682 if (!solver_is_enhancing(solv, s))
3685 queue_push(suggestionsq, i);
3687 policy_filter_unwanted(solv, suggestionsq, POLICY_MODE_SUGGEST);
3690 /* undo removedisabledconflicts */
3692 undo_removedisabledconflicts(solv, &redoq);
3695 /* undo job rule disabling */
3696 for (i = 0; i < disabledq.count; i++)
3697 solver_enablerule(solv, solv->rules + disabledq.elements[i]);
3698 queue_free(&disabledq);
3703 /***********************************************************************/
3704 /* disk usage computations */
3706 /*-------------------------------------------------------------------
3708 * calculate DU changes
3712 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
3716 solver_create_state_maps(solv, &installedmap, 0);
3717 pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
3718 map_free(&installedmap);
3722 /*-------------------------------------------------------------------
3724 * calculate changes in install size
3728 solver_calc_installsizechange(Solver *solv)
3733 solver_create_state_maps(solv, &installedmap, 0);
3734 change = pool_calc_installsizechange(solv->pool, &installedmap);
3735 map_free(&installedmap);
3740 solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap)
3742 pool_create_state_maps(solv->pool, &solv->decisionq, installedmap, conflictsmap);
3746 solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res)
3749 pool_create_state_maps(solv->pool, &solv->decisionq, &installedmap, 0);
3750 pool_trivial_installable_noobsoletesmap(solv->pool, &installedmap, pkgs, res, solv->noobsoletes.size ? &solv->noobsoletes : 0);
3751 map_free(&installedmap);
3754 /*-------------------------------------------------------------------
3756 * decision introspection
3760 solver_get_decisionlevel(Solver *solv, Id p)
3762 return solv->decisionmap[p];
3766 solver_get_decisionqueue(Solver *solv, Queue *decisionq)
3768 queue_free(decisionq);
3769 queue_init_clone(decisionq, &solv->decisionq);
3773 solver_get_lastdecisionblocklevel(Solver *solv)
3776 if (solv->decisionq.count == 0)
3778 p = solv->decisionq.elements[solv->decisionq.count - 1];
3781 return solv->decisionmap[p] < 0 ? -solv->decisionmap[p] : solv->decisionmap[p];
3785 solver_get_decisionblock(Solver *solv, int level, Queue *decisionq)
3790 queue_empty(decisionq);
3791 for (i = 0; i < solv->decisionq.count; i++)
3793 p = solv->decisionq.elements[i];
3796 if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
3799 if (i == solv->decisionq.count)
3801 for (i = 0; i < solv->decisionq.count; i++)
3803 p = solv->decisionq.elements[i];
3806 if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
3807 queue_push(decisionq, p);
3814 solver_describe_decision(Solver *solv, Id p, Id *infop)
3821 if (!solv->decisionmap[p])
3822 return SOLVER_REASON_UNRELATED;
3823 pp = solv->decisionmap[p] < 0 ? -p : p;
3824 for (i = 0; i < solv->decisionq.count; i++)
3825 if (solv->decisionq.elements[i] == pp)
3827 if (i == solv->decisionq.count) /* just in case... */
3828 return SOLVER_REASON_UNRELATED;
3829 why = solv->decisionq_why.elements[i];
3834 return SOLVER_REASON_UNIT_RULE;
3837 if (i < solv->decisioncnt_update)
3842 *infop = SYSTEMSOLVABLE;
3843 return SOLVER_REASON_KEEP_INSTALLED;
3847 return SOLVER_REASON_RESOLVE_JOB;
3849 if (i < solv->decisioncnt_keep)
3851 if (why == 0 && pp < 0)
3852 return SOLVER_REASON_CLEANDEPS_ERASE;
3855 if (why >= solv->updaterules && why < solv->updaterules_end)
3856 *infop = why - solv->updaterules;
3857 else if (why >= solv->featurerules && why < solv->featurerules_end)
3858 *infop = why - solv->featurerules;
3860 return SOLVER_REASON_UPDATE_INSTALLED;
3862 if (i < solv->decisioncnt_resolve)
3864 if (why == 0 && pp < 0)
3865 return SOLVER_REASON_CLEANDEPS_ERASE;
3868 if (why >= solv->updaterules && why < solv->updaterules_end)
3869 *infop = why - solv->updaterules;
3870 else if (why >= solv->featurerules && why < solv->featurerules_end)
3871 *infop = why - solv->featurerules;
3873 return SOLVER_REASON_KEEP_INSTALLED;
3875 if (i < solv->decisioncnt_weak)
3879 return SOLVER_REASON_RESOLVE;
3881 if (solv->decisionq.count < solv->decisioncnt_orphan)
3882 return SOLVER_REASON_WEAKDEP;
3883 return SOLVER_REASON_RESOLVE_ORPHAN;
3888 solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq)
3890 Pool *pool = solv->pool;
3892 int level = solv->decisionmap[p];
3899 for (decisionno = 0; decisionno < solv->decisionq.count; decisionno++)
3900 if (solv->decisionq.elements[decisionno] == p)
3902 if (decisionno == solv->decisionq.count)
3904 if (decisionno < solv->decisioncnt_weak || decisionno >= solv->decisioncnt_orphan)
3907 /* 1) list all packages that recommend us */
3908 for (i = 1; i < pool->nsolvables; i++)
3910 Id *recp, rec, pp2, p2;
3911 if (solv->decisionmap[i] < 0 || solv->decisionmap[i] >= level)
3913 s = pool->solvables + i;
3916 if (!solv->addalreadyrecommended && s->repo == solv->installed)
3918 recp = s->repo->idarraydata + s->recommends;
3919 while ((rec = *recp++) != 0)
3922 FOR_PROVIDES(p2, pp2, rec)
3928 /* if p2 is already installed, this recommends is ignored */
3929 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
3935 queue_push(whyq, SOLVER_REASON_RECOMMENDED);
3936 queue_push2(whyq, p2, rec);
3940 /* 2) list all supplements */
3941 s = pool->solvables + p;
3942 if (s->supplements && level > 0)
3944 Id *supp, sup, pp2, p2;
3945 /* this is a hack. to use solver_dep_fulfilled we temporarily clear
3946 * everything above our level in the decisionmap */
3947 for (i = decisionno; i < solv->decisionq.count; i++ )
3949 p2 = solv->decisionq.elements[i];
3951 solv->decisionmap[p2] = -solv->decisionmap[p2];
3953 supp = s->repo->idarraydata + s->supplements;
3954 while ((sup = *supp++) != 0)
3955 if (solver_dep_fulfilled(solv, sup))
3958 /* let's see if this is an easy supp */
3959 FOR_PROVIDES(p2, pp2, sup)
3961 if (!solv->addalreadyrecommended && solv->installed)
3963 if (pool->solvables[p2].repo == solv->installed)
3966 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
3968 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
3969 queue_push2(whyq, p2, sup);
3975 /* hard case, just note dependency with no package */
3976 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
3977 queue_push2(whyq, 0, sup);
3980 for (i = decisionno; i < solv->decisionq.count; i++)
3982 p2 = solv->decisionq.elements[i];
3984 solv->decisionmap[p2] = -solv->decisionmap[p2];
3990 pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what)
3993 how &= SOLVER_SELECTMASK;
3995 if (how == SOLVER_SOLVABLE_ALL)
3997 FOR_POOL_SOLVABLES(p)
3998 queue_push(pkgs, p);
4000 else if (how == SOLVER_SOLVABLE_REPO)
4002 Repo *repo = pool_id2repo(pool, what);
4005 FOR_REPO_SOLVABLES(repo, p, s)
4006 queue_push(pkgs, p);
4010 FOR_JOB_SELECT(p, pp, how, what)
4011 queue_push(pkgs, p);
4016 pool_isemptyupdatejob(Pool *pool, Id how, Id what)
4019 Id select = how & SOLVER_SELECTMASK;
4020 if ((how & SOLVER_JOBMASK) != SOLVER_UPDATE)
4022 if (select == SOLVER_SOLVABLE_ALL || select == SOLVER_SOLVABLE_REPO)
4024 if (!pool->installed)
4026 FOR_JOB_SELECT(p, pp, select, what)
4027 if (pool->solvables[p].repo == pool->installed)
4030 FOR_JOB_SELECT(p, pp, select, what)
4032 Solvable *s = pool->solvables + p;
4033 FOR_PROVIDES(pi, pip, s->name)
4035 Solvable *si = pool->solvables + pi;
4036 if (si->repo != pool->installed || si->name != s->name)
4042 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
4043 while ((obs = *obsp++) != 0)
4045 FOR_PROVIDES(pi, pip, obs)
4047 Solvable *si = pool->solvables + pi;
4048 if (si->repo != pool->installed)
4050 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
4052 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))