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))
108 autouninstall(Solver *solv, Id *problem)
110 Pool *pool = solv->pool;
112 int lastfeature = 0, lastupdate = 0;
116 for (i = 0; (v = problem[i]) != 0; i++)
119 extraflags &= solv->job.elements[-v - 1];
120 if (v >= solv->featurerules && v < solv->featurerules_end)
123 if (v >= solv->updaterules && v < solv->updaterules_end)
125 /* check if identical to feature rule */
126 Id p = solv->rules[v].p;
129 Rule *r = solv->rules + solv->featurerules + (p - solv->installed->start);
132 /* update rule == feature rule */
141 if (!lastupdate && !lastfeature)
143 v = lastupdate ? lastupdate : lastfeature;
144 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "allowuninstall disabling ");
145 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + v);
146 solver_disableproblem(solv, v);
147 if (extraflags != -1 && (extraflags & SOLVER_CLEANDEPS) != 0 && solv->cleandepsmap.size)
149 /* add the package to the updatepkgs list, this will automatically turn
150 * on cleandeps mode */
151 Id p = solv->rules[v].p;
152 if (!solv->cleandeps_updatepkgs)
154 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
155 queue_init(solv->cleandeps_updatepkgs);
159 int oldupdatepkgscnt = solv->cleandeps_updatepkgs->count;
160 queue_pushunique(solv->cleandeps_updatepkgs, p);
161 if (solv->cleandeps_updatepkgs->count != oldupdatepkgscnt)
162 solver_disablepolicyrules(solv);
168 /************************************************************************/
171 * enable/disable learnt rules
173 * we have enabled or disabled some of our rules. We now reenable all
174 * of our learnt rules except the ones that were learnt from rules that
178 enabledisablelearntrules(Solver *solv)
180 Pool *pool = solv->pool;
185 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "enabledisablelearntrules called\n");
186 for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
188 whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules];
189 while ((why = *whyp++) != 0)
191 assert(why > 0 && why < i);
192 if (solv->rules[why].d < 0)
195 /* why != 0: we found a disabled rule, disable the learnt rule */
196 if (why && r->d >= 0)
198 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
200 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "disabling ");
201 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
203 solver_disablerule(solv, r);
205 else if (!why && r->d < 0)
207 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
209 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "re-enabling ");
210 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
212 solver_enablerule(solv, r);
219 * make assertion rules into decisions
221 * Go through rules and add direct assertions to the decisionqueue.
222 * If we find a conflict, disable rules and add them to problem queue.
226 makeruledecisions(Solver *solv)
228 Pool *pool = solv->pool;
233 int record_proof = 1;
235 int havedisabled = 0;
237 /* The system solvable is always installed first */
238 assert(solv->decisionq.count == 0);
239 queue_push(&solv->decisionq, SYSTEMSOLVABLE);
240 queue_push(&solv->decisionq_why, 0);
241 solv->decisionmap[SYSTEMSOLVABLE] = 1; /* installed at level '1' */
243 decisionstart = solv->decisionq.count;
246 /* if we needed to re-run, back up decisions to decisionstart */
247 while (solv->decisionq.count > decisionstart)
249 v = solv->decisionq.elements[--solv->decisionq.count];
250 --solv->decisionq_why.count;
252 solv->decisionmap[vv] = 0;
255 /* note that the ruleassertions queue is ordered */
256 for (ii = 0; ii < solv->ruleassertions.count; ii++)
258 ri = solv->ruleassertions.elements[ii];
259 r = solv->rules + ri;
261 if (havedisabled && ri >= solv->learntrules)
263 /* just started with learnt rule assertions. If we have disabled
264 * some rules, adapt the learnt rule status */
265 enabledisablelearntrules(solv);
269 if (r->d < 0 || !r->p || r->w2) /* disabled, dummy or no assertion */
272 /* do weak rules in phase 2 */
273 if (ri < solv->learntrules && MAPTST(&solv->weakrulemap, ri))
279 if (!solv->decisionmap[vv]) /* if not yet decided */
281 queue_push(&solv->decisionq, v);
282 queue_push(&solv->decisionq_why, r - solv->rules);
283 solv->decisionmap[vv] = v > 0 ? 1 : -1;
284 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
286 Solvable *s = solv->pool->solvables + vv;
288 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", pool_solvable2str(solv->pool, s));
290 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (assertion)\n", pool_solvable2str(solv->pool, s));
295 /* check against previous decision: is there a conflict? */
296 if (v > 0 && solv->decisionmap[vv] > 0) /* ok to install */
298 if (v < 0 && solv->decisionmap[vv] < 0) /* ok to remove */
304 * The rule (r) we're currently processing says something
305 * different (v = r->p) than a previous decision (decisionmap[abs(v)])
309 if (ri >= solv->learntrules)
311 /* conflict with a learnt rule */
312 /* can happen when packages cannot be installed for multiple reasons. */
313 /* we disable the learnt rule in this case */
314 /* (XXX: we should really call analyze_unsolvable_rule here!) */
315 solver_disablerule(solv, r);
320 * find the decision which is the "opposite" of the rule
322 for (i = 0; i < solv->decisionq.count; i++)
323 if (solv->decisionq.elements[i] == -v)
325 assert(i < solv->decisionq.count); /* assert that we found it */
326 oldproblemcount = solv->problems.count;
329 * conflict with system solvable ?
331 if (v == -SYSTEMSOLVABLE)
335 queue_push(&solv->problems, solv->learnt_pool.count);
336 queue_push(&solv->learnt_pool, ri);
337 queue_push(&solv->learnt_pool, 0);
340 queue_push(&solv->problems, 0);
341 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with system solvable, disabling rule #%d\n", ri);
342 if (ri >= solv->jobrules && ri < solv->jobrules_end)
343 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
346 queue_push(&solv->problems, v);
347 queue_push(&solv->problems, 0);
348 if (solv->allowuninstall && v >= solv->featurerules && v < solv->updaterules_end)
349 solv->problems.count = oldproblemcount;
350 solver_disableproblem(solv, v);
352 break; /* start over */
355 assert(solv->decisionq_why.elements[i] > 0);
358 * conflict with an rpm rule ?
360 if (solv->decisionq_why.elements[i] < solv->rpmrules_end)
364 queue_push(&solv->problems, solv->learnt_pool.count);
365 queue_push(&solv->learnt_pool, ri);
366 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
367 queue_push(&solv->learnt_pool, 0);
370 queue_push(&solv->problems, 0);
371 assert(v > 0 || v == -SYSTEMSOLVABLE);
372 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with rpm rule, disabling rule #%d\n", ri);
373 if (ri >= solv->jobrules && ri < solv->jobrules_end)
374 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
377 queue_push(&solv->problems, v);
378 queue_push(&solv->problems, 0);
379 if (solv->allowuninstall && v >= solv->featurerules && v < solv->updaterules_end)
380 solv->problems.count = oldproblemcount;
381 solver_disableproblem(solv, v);
383 break; /* start over */
387 * conflict with another job or update/feature rule
393 queue_push(&solv->problems, solv->learnt_pool.count);
394 queue_push(&solv->learnt_pool, ri);
395 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
396 queue_push(&solv->learnt_pool, 0);
399 queue_push(&solv->problems, 0);
401 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflicting update/job assertions over literal %d\n", vv);
404 * push all of our rules (can only be feature or job rules)
405 * asserting this literal on the problem stack
407 for (i = solv->featurerules, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
409 if (rr->d < 0 /* disabled */
410 || rr->w2) /* or no assertion */
412 if (rr->p != vv /* not affecting the literal */
415 if (MAPTST(&solv->weakrulemap, i)) /* weak: silently ignore */
418 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, " - disabling rule #%d\n", i);
419 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + i);
422 if (i >= solv->jobrules && i < solv->jobrules_end)
423 v = -(solv->ruletojob.elements[i - solv->jobrules] + 1);
424 queue_push(&solv->problems, v);
426 queue_push(&solv->problems, 0);
428 if (solv->allowuninstall && (v = autouninstall(solv, solv->problems.elements + oldproblemcount + 1)) != 0)
429 solv->problems.count = oldproblemcount;
431 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
432 solver_disableproblem(solv, solv->problems.elements[i]);
434 break; /* start over */
436 if (ii < solv->ruleassertions.count)
440 * phase 2: now do the weak assertions
442 for (ii = 0; ii < solv->ruleassertions.count; ii++)
444 ri = solv->ruleassertions.elements[ii];
445 r = solv->rules + ri;
446 if (r->d < 0 || r->w2) /* disabled or no assertion */
448 if (ri >= solv->learntrules || !MAPTST(&solv->weakrulemap, ri)) /* skip non-weak */
453 if (!solv->decisionmap[vv]) /* if not yet decided */
455 queue_push(&solv->decisionq, v);
456 queue_push(&solv->decisionq_why, r - solv->rules);
457 solv->decisionmap[vv] = v > 0 ? 1 : -1;
458 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
460 Solvable *s = solv->pool->solvables + vv;
462 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
464 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
468 /* check against previous decision: is there a conflict? */
469 if (v > 0 && solv->decisionmap[vv] > 0)
471 if (v < 0 && solv->decisionmap[vv] < 0)
474 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "assertion conflict, but I am weak, disabling ");
475 solver_printrule(solv, SOLV_DEBUG_UNSOLVABLE, r);
477 if (ri >= solv->jobrules && ri < solv->jobrules_end)
478 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
481 solver_disableproblem(solv, v);
483 solver_reenablepolicyrules(solv, -v);
485 break; /* start over */
487 if (ii == solv->ruleassertions.count)
488 break; /* finished! */
493 /********************************************************************/
497 /*-------------------------------------------------------------------
500 * initial setup for all watches
504 makewatches(Solver *solv)
508 int nsolvables = solv->pool->nsolvables;
510 solv_free(solv->watches);
511 /* lower half for removals, upper half for installs */
512 solv->watches = solv_calloc(2 * nsolvables, sizeof(Id));
514 /* do it reverse so rpm rules get triggered first (XXX: obsolete?) */
515 for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
517 for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
520 if (!r->w2) /* assertions do not need watches */
523 /* see addwatches_rule(solv, r) */
524 r->n1 = solv->watches[nsolvables + r->w1];
525 solv->watches[nsolvables + r->w1] = r - solv->rules;
527 r->n2 = solv->watches[nsolvables + r->w2];
528 solv->watches[nsolvables + r->w2] = r - solv->rules;
533 /*-------------------------------------------------------------------
535 * add watches (for a new learned rule)
536 * sets up watches for a single rule
538 * see also makewatches() above.
542 addwatches_rule(Solver *solv, Rule *r)
544 int nsolvables = solv->pool->nsolvables;
546 r->n1 = solv->watches[nsolvables + r->w1];
547 solv->watches[nsolvables + r->w1] = r - solv->rules;
549 r->n2 = solv->watches[nsolvables + r->w2];
550 solv->watches[nsolvables + r->w2] = r - solv->rules;
554 /********************************************************************/
560 /* shortcuts to check if a literal (positive or negative) assignment
561 * evaluates to 'true' or 'false'
563 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
564 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
565 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
567 /*-------------------------------------------------------------------
571 * make decision and propagate to all rules
573 * Evaluate each term affected by the decision (linked through watches).
574 * If we find unit rules we make new decisions based on them.
576 * return : 0 = everything is OK
577 * rule = conflict found in this rule
581 propagate(Solver *solv, int level)
583 Pool *pool = solv->pool;
584 Id *rp, *next_rp; /* rule pointer, next rule pointer in linked list */
586 Id p, pkg, other_watch;
588 Id *decisionmap = solv->decisionmap;
590 Id *watches = solv->watches + pool->nsolvables; /* place ptr in middle */
592 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate -----\n");
594 /* foreach non-propagated decision */
595 while (solv->propagate_index < solv->decisionq.count)
598 * 'pkg' was just decided
599 * negate because our watches trigger if literal goes FALSE
601 pkg = -solv->decisionq.elements[solv->propagate_index++];
603 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
605 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagate for decision %d level %d\n", -pkg, level);
606 solver_printruleelement(solv, SOLV_DEBUG_PROPAGATE, 0, -pkg);
609 /* foreach rule where 'pkg' is now FALSE */
610 for (rp = watches + pkg; *rp; rp = next_rp)
612 r = solv->rules + *rp;
615 /* rule is disabled, goto next */
623 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
625 POOL_DEBUG(SOLV_DEBUG_PROPAGATE," watch triggered ");
626 solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
629 /* 'pkg' was just decided (was set to FALSE)
631 * now find other literal watch, check clause
632 * and advance on linked list
646 * This term is already true (through the other literal)
647 * so we have nothing to do
649 if (DECISIONMAP_TRUE(other_watch))
653 * The other literal is FALSE or UNDEF
659 /* Not a binary clause, try to move our watch.
661 * Go over all literals and find one that is
665 * (TRUE is also ok, in that case the rule is fulfilled)
667 if (r->p /* we have a 'p' */
668 && r->p != other_watch /* which is not watched */
669 && !DECISIONMAP_FALSE(r->p)) /* and not FALSE */
673 else /* go find a 'd' to make 'true' */
676 we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
678 for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
680 if (p != other_watch /* which is not watched */
681 && !DECISIONMAP_FALSE(p)) /* and not FALSE */
689 * if we found some p that is UNDEF or TRUE, move
692 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
695 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, p));
697 POOL_DEBUG(SOLV_DEBUG_PROPAGATE," -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, -p));
713 watches[p] = r - solv->rules;
716 /* search failed, thus all unwatched literals are FALSE */
721 * unit clause found, set literal other_watch to TRUE
724 if (DECISIONMAP_FALSE(other_watch)) /* check if literal is FALSE */
725 return r; /* eek, a conflict! */
727 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
729 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " unit ");
730 solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
734 decisionmap[other_watch] = level; /* install! */
736 decisionmap[-other_watch] = -level; /* remove! */
738 queue_push(&solv->decisionq, other_watch);
739 queue_push(&solv->decisionq_why, r - solv->rules);
741 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
744 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to install %s\n", pool_solvid2str(pool, other_watch));
746 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to conflict %s\n", pool_solvid2str(pool, -other_watch));
749 } /* foreach rule involving 'pkg' */
751 } /* while we have non-decided decisions */
753 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate end-----\n");
755 return 0; /* all is well */
759 /********************************************************************/
762 /*-------------------------------------------------------------------
769 analyze(Solver *solv, int level, Rule *c, int *pr, int *dr, int *whyp)
771 Pool *pool = solv->pool;
775 Map seen; /* global? */
776 Id d, v, vv, *dp, why;
778 int num = 0, l1num = 0;
779 int learnt_why = solv->learnt_pool.count;
780 Id *decisionmap = solv->decisionmap;
782 queue_init_buffer(&r, r_buf, sizeof(r_buf)/sizeof(*r_buf));
784 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
785 map_init(&seen, pool->nsolvables);
786 idx = solv->decisionq.count;
789 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
790 solver_printruleclass(solv, SOLV_DEBUG_ANALYZE, c);
791 queue_push(&solv->learnt_pool, c - solv->rules);
792 d = c->d < 0 ? -c->d - 1 : c->d;
793 dp = d ? pool->whatprovidesdata + d : 0;
794 /* go through all literals of the rule */
806 if (DECISIONMAP_TRUE(v)) /* the one true literal */
809 if (MAPTST(&seen, vv))
811 l = solv->decisionmap[vv];
814 MAPSET(&seen, vv); /* mark that we also need to look at this literal */
816 l1num++; /* need to do this one in level1 pass */
818 num++; /* need to do this one as well */
821 queue_push(&r, v); /* not level1 or conflict level, add to new rule */
827 if (!num && !--l1num)
828 break; /* all level 1 literals done */
830 /* find the next literal to investigate */
831 /* (as num + l1num > 0, we know that we'll always find one) */
835 v = solv->decisionq.elements[--idx];
837 if (MAPTST(&seen, vv))
842 if (num && --num == 0)
844 *pr = -v; /* so that v doesn't get lost */
847 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
848 /* clear non-l1 bits from seen map */
849 for (i = 0; i < r.count; i++)
852 MAPCLR(&seen, v > 0 ? v : -v);
854 /* only level 1 marks left in seen map */
855 l1num++; /* as l1retry decrements it */
859 why = solv->decisionq_why.elements[idx];
860 if (why <= 0) /* just in case, maybe for SYSTEMSOLVABLE */
862 c = solv->rules + why;
868 else if (r.count == 1 && r.elements[0] < 0)
871 *dr = pool_queuetowhatprovides(pool, &r);
872 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
874 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
875 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, *pr);
876 for (i = 0; i < r.count; i++)
877 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, r.elements[i]);
879 /* push end marker on learnt reasons stack */
880 queue_push(&solv->learnt_pool, 0);
884 solv->stats_learned++;
889 /*-------------------------------------------------------------------
893 * reset all solver decisions
894 * called after rules have been enabled/disabled
898 solver_reset(Solver *solv)
900 Pool *pool = solv->pool;
904 /* rewind all decisions */
905 for (i = solv->decisionq.count - 1; i >= 0; i--)
907 v = solv->decisionq.elements[i];
908 solv->decisionmap[v > 0 ? v : -v] = 0;
910 solv->decisionq_why.count = 0;
911 solv->decisionq.count = 0;
912 solv->recommends_index = -1;
913 solv->propagate_index = 0;
914 solv->branches.count = 0;
916 /* adapt learnt rule status to new set of enabled/disabled rules */
917 enabledisablelearntrules(solv);
919 /* redo all assertion rule decisions */
920 makeruledecisions(solv);
921 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "decisions so far: %d\n", solv->decisionq.count);
925 /*-------------------------------------------------------------------
927 * analyze_unsolvable_rule
929 * recursion helper used by analyze_unsolvable
933 analyze_unsolvable_rule(Solver *solv, Rule *r, Id *lastweakp, Map *rseen)
935 Pool *pool = solv->pool;
937 Id why = r - solv->rules;
939 IF_POOLDEBUG (SOLV_DEBUG_UNSOLVABLE)
940 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
941 if (solv->learntrules && why >= solv->learntrules)
943 if (MAPTST(rseen, why - solv->learntrules))
945 MAPSET(rseen, why - solv->learntrules);
946 for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
947 if (solv->learnt_pool.elements[i] > 0)
948 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp, rseen);
951 if (MAPTST(&solv->weakrulemap, why))
952 if (!*lastweakp || why > *lastweakp)
954 /* do not add rpm rules to problem */
955 if (why < solv->rpmrules_end)
957 /* turn rule into problem */
958 if (why >= solv->jobrules && why < solv->jobrules_end)
959 why = -(solv->ruletojob.elements[why - solv->jobrules] + 1);
960 /* normalize dup/infarch rules */
961 if (why > solv->infarchrules && why < solv->infarchrules_end)
963 Id name = pool->solvables[-solv->rules[why].p].name;
964 while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
967 if (why > solv->duprules && why < solv->duprules_end)
969 Id name = pool->solvables[-solv->rules[why].p].name;
970 while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
974 /* return if problem already countains our rule */
975 if (solv->problems.count)
977 for (i = solv->problems.count - 1; i >= 0; i--)
978 if (solv->problems.elements[i] == 0) /* end of last problem reached? */
980 else if (solv->problems.elements[i] == why)
983 queue_push(&solv->problems, why);
987 /*-------------------------------------------------------------------
991 * We know that the problem is not solvable. Record all involved
992 * rules (i.e. the "proof") into solv->learnt_pool.
993 * Record the learnt pool index and all non-rpm rules into
994 * solv->problems. (Our solutions to fix the problems are to
995 * disable those rules.)
997 * If the proof contains at least one weak rule, we disable the
1000 * Otherwise we return 0 if disablerules is not set or disable
1001 * _all_ of the problem rules and return 1.
1003 * return: 1 - disabled some rules, try again
1008 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
1010 Pool *pool = solv->pool;
1012 Map seen; /* global to speed things up? */
1014 Id d, v, vv, *dp, why;
1016 Id *decisionmap = solv->decisionmap;
1017 int oldproblemcount;
1018 int oldlearntpoolcount;
1020 int record_proof = 1;
1022 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
1023 solv->stats_unsolvable++;
1024 oldproblemcount = solv->problems.count;
1025 oldlearntpoolcount = solv->learnt_pool.count;
1027 /* make room for proof index */
1028 /* must update it later, as analyze_unsolvable_rule would confuse
1029 * it with a rule index if we put the real value in already */
1030 queue_push(&solv->problems, 0);
1033 map_init(&seen, pool->nsolvables);
1034 map_init(&rseen, solv->learntrules ? solv->nrules - solv->learntrules : 0);
1036 queue_push(&solv->learnt_pool, r - solv->rules);
1038 analyze_unsolvable_rule(solv, r, &lastweak, &rseen);
1039 d = r->d < 0 ? -r->d - 1 : r->d;
1040 dp = d ? pool->whatprovidesdata + d : 0;
1051 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1053 vv = v > 0 ? v : -v;
1054 l = solv->decisionmap[vv];
1059 idx = solv->decisionq.count;
1062 v = solv->decisionq.elements[--idx];
1063 vv = v > 0 ? v : -v;
1064 if (!MAPTST(&seen, vv))
1066 why = solv->decisionq_why.elements[idx];
1069 queue_push(&solv->learnt_pool, why);
1070 r = solv->rules + why;
1071 analyze_unsolvable_rule(solv, r, &lastweak, &rseen);
1072 d = r->d < 0 ? -r->d - 1 : r->d;
1073 dp = d ? pool->whatprovidesdata + d : 0;
1084 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1086 vv = v > 0 ? v : -v;
1087 l = solv->decisionmap[vv];
1095 queue_push(&solv->problems, 0); /* mark end of this problem */
1099 /* disable last weak rule */
1100 solv->problems.count = oldproblemcount;
1101 solv->learnt_pool.count = oldlearntpoolcount;
1102 if (lastweak >= solv->jobrules && lastweak < solv->jobrules_end)
1103 v = -(solv->ruletojob.elements[lastweak - solv->jobrules] + 1);
1106 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "disabling ");
1107 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + lastweak);
1108 if (lastweak >= solv->choicerules && lastweak < solv->choicerules_end)
1109 solver_disablechoicerules(solv, solv->rules + lastweak);
1110 solver_disableproblem(solv, v);
1112 solver_reenablepolicyrules(solv, -v);
1117 if (solv->allowuninstall && (v = autouninstall(solv, solv->problems.elements + oldproblemcount + 1)) != 0)
1119 solv->problems.count = oldproblemcount;
1120 solv->learnt_pool.count = oldlearntpoolcount;
1128 queue_push(&solv->learnt_pool, 0);
1129 solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
1132 /* + 2: index + trailing zero */
1133 if (disablerules && oldproblemcount + 2 < solv->problems.count)
1135 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
1136 solver_disableproblem(solv, solv->problems.elements[i]);
1137 /* XXX: might want to enable all weak rules again */
1141 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
1146 /********************************************************************/
1147 /* Decision revert */
1149 /*-------------------------------------------------------------------
1152 * revert decisionq to a level
1156 revert(Solver *solv, int level)
1158 Pool *pool = solv->pool;
1160 while (solv->decisionq.count)
1162 v = solv->decisionq.elements[solv->decisionq.count - 1];
1163 vv = v > 0 ? v : -v;
1164 if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
1166 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
1167 solv->decisionmap[vv] = 0;
1168 solv->decisionq.count--;
1169 solv->decisionq_why.count--;
1170 solv->propagate_index = solv->decisionq.count;
1172 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
1174 solv->branches.count--;
1175 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
1176 solv->branches.count--;
1178 solv->recommends_index = -1;
1182 /*-------------------------------------------------------------------
1184 * watch2onhighest - put watch2 on literal with highest level
1188 watch2onhighest(Solver *solv, Rule *r)
1193 d = r->d < 0 ? -r->d - 1 : r->d;
1195 return; /* binary rule, both watches are set */
1196 dp = solv->pool->whatprovidesdata + d;
1197 while ((v = *dp++) != 0)
1199 l = solv->decisionmap[v < 0 ? -v : v];
1211 /*-------------------------------------------------------------------
1215 * add free decision (solvable to install) to decisionq
1216 * increase level and propagate decision
1217 * return if no conflict.
1219 * in conflict case, analyze conflict rule, add resulting
1220 * rule to learnt rule set, make decision from learnt
1221 * rule (always unit) and re-propagate.
1223 * returns the new solver level or 0 if unsolvable
1228 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules, Id ruleid)
1230 Pool *pool = solv->pool;
1235 assert(ruleid >= 0);
1240 solv->decisionmap[decision] = level;
1242 solv->decisionmap[-decision] = -level;
1243 queue_push(&solv->decisionq, decision);
1244 queue_push(&solv->decisionq_why, -ruleid); /* <= 0 -> free decision */
1248 r = propagate(solv, level);
1252 return analyze_unsolvable(solv, r, disablerules);
1253 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
1254 l = analyze(solv, level, r, &p, &d, &why); /* learnt rule in p and d */
1255 assert(l > 0 && l < level);
1256 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, l);
1258 revert(solv, level);
1259 r = solver_addrule(solv, p, d);
1261 assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
1262 queue_push(&solv->learnt_why, why);
1265 /* at least 2 literals, needs watches */
1266 watch2onhighest(solv, r);
1267 addwatches_rule(solv, r);
1271 /* learnt rule is an assertion */
1272 queue_push(&solv->ruleassertions, r - solv->rules);
1274 /* the new rule is unit by design */
1275 solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
1276 queue_push(&solv->decisionq, p);
1277 queue_push(&solv->decisionq_why, r - solv->rules);
1278 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
1280 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "decision: ");
1281 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, p);
1282 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "new rule: ");
1283 solver_printrule(solv, SOLV_DEBUG_ANALYZE, r);
1290 /*-------------------------------------------------------------------
1292 * select and install
1294 * install best package from the queue. We add an extra package, inst, if
1295 * provided. See comment in weak install section.
1297 * returns the new solver level or 0 if unsolvable
1302 selectandinstall(Solver *solv, int level, Queue *dq, int disablerules, Id ruleid)
1304 Pool *pool = solv->pool;
1309 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1312 /* XXX: didn't we already do that? */
1313 /* XXX: shouldn't we prefer installed packages? */
1314 /* XXX: move to policy.c? */
1315 /* choose the supplemented one */
1316 for (i = 0; i < dq->count; i++)
1317 if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
1319 dq->elements[0] = dq->elements[i];
1326 /* multiple candidates, open a branch */
1327 for (i = 1; i < dq->count; i++)
1328 queue_push(&solv->branches, dq->elements[i]);
1329 queue_push(&solv->branches, -level);
1331 p = dq->elements[0];
1333 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing %s\n", pool_solvid2str(pool, p));
1335 return setpropagatelearn(solv, level, p, disablerules, ruleid);
1339 /********************************************************************/
1340 /* Main solver interface */
1343 /*-------------------------------------------------------------------
1346 * create solver structure
1348 * pool: all available solvables
1349 * installed: installed Solvables
1352 * Upon solving, rules are created to flag the Solvables
1353 * of the 'installed' Repo as installed.
1357 solver_create(Pool *pool)
1360 solv = (Solver *)solv_calloc(1, sizeof(Solver));
1362 solv->installed = pool->installed;
1364 solv->allownamechange = 1;
1366 solv->dup_allowdowngrade = 1;
1367 solv->dup_allownamechange = 1;
1368 solv->dup_allowarchchange = 1;
1369 solv->dup_allowvendorchange = 1;
1371 queue_init(&solv->ruletojob);
1372 queue_init(&solv->decisionq);
1373 queue_init(&solv->decisionq_why);
1374 queue_init(&solv->problems);
1375 queue_init(&solv->orphaned);
1376 queue_init(&solv->learnt_why);
1377 queue_init(&solv->learnt_pool);
1378 queue_init(&solv->branches);
1379 queue_init(&solv->weakruleq);
1380 queue_init(&solv->ruleassertions);
1382 queue_push(&solv->learnt_pool, 0); /* so that 0 does not describe a proof */
1384 map_init(&solv->recommendsmap, pool->nsolvables);
1385 map_init(&solv->suggestsmap, pool->nsolvables);
1386 map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
1387 solv->recommends_index = 0;
1389 solv->decisionmap = (Id *)solv_calloc(pool->nsolvables, sizeof(Id));
1391 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
1392 memset(solv->rules, 0, sizeof(Rule));
1398 /*-------------------------------------------------------------------
1404 solver_free(Solver *solv)
1406 queue_free(&solv->job);
1407 queue_free(&solv->ruletojob);
1408 queue_free(&solv->decisionq);
1409 queue_free(&solv->decisionq_why);
1410 queue_free(&solv->learnt_why);
1411 queue_free(&solv->learnt_pool);
1412 queue_free(&solv->problems);
1413 queue_free(&solv->solutions);
1414 queue_free(&solv->orphaned);
1415 queue_free(&solv->branches);
1416 queue_free(&solv->weakruleq);
1417 queue_free(&solv->ruleassertions);
1418 if (solv->cleandeps_updatepkgs)
1420 queue_free(solv->cleandeps_updatepkgs);
1421 solv->cleandeps_updatepkgs = solv_free(solv->cleandeps_updatepkgs);
1423 if (solv->cleandeps_mistakes)
1425 queue_free(solv->cleandeps_mistakes);
1426 solv->cleandeps_mistakes = solv_free(solv->cleandeps_mistakes);
1428 if (solv->update_targets)
1430 queue_free(solv->update_targets);
1431 solv->update_targets = solv_free(solv->update_targets);
1434 map_free(&solv->recommendsmap);
1435 map_free(&solv->suggestsmap);
1436 map_free(&solv->noupdate);
1437 map_free(&solv->weakrulemap);
1438 map_free(&solv->noobsoletes);
1440 map_free(&solv->updatemap);
1441 map_free(&solv->fixmap);
1442 map_free(&solv->dupmap);
1443 map_free(&solv->dupinvolvedmap);
1444 map_free(&solv->droporphanedmap);
1445 map_free(&solv->cleandepsmap);
1447 solv_free(solv->decisionmap);
1448 solv_free(solv->rules);
1449 solv_free(solv->watches);
1450 solv_free(solv->obsoletes);
1451 solv_free(solv->obsoletes_data);
1452 solv_free(solv->multiversionupdaters);
1453 solv_free(solv->choicerules_ref);
1458 solver_get_flag(Solver *solv, int flag)
1462 case SOLVER_FLAG_ALLOW_DOWNGRADE:
1463 return solv->allowdowngrade;
1464 case SOLVER_FLAG_ALLOW_NAMECHANGE:
1465 return solv->allownamechange;
1466 case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1467 return solv->allowarchchange;
1468 case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1469 return solv->allowvendorchange;
1470 case SOLVER_FLAG_ALLOW_UNINSTALL:
1471 return solv->allowuninstall;
1472 case SOLVER_FLAG_NO_UPDATEPROVIDE:
1473 return solv->noupdateprovide;
1474 case SOLVER_FLAG_SPLITPROVIDES:
1475 return solv->dosplitprovides;
1476 case SOLVER_FLAG_IGNORE_RECOMMENDED:
1477 return solv->dontinstallrecommended;
1478 case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1479 return solv->addalreadyrecommended;
1480 case SOLVER_FLAG_NO_INFARCHCHECK:
1481 return solv->noinfarchcheck;
1482 case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1483 return solv->keepexplicitobsoletes;
1491 solver_set_flag(Solver *solv, int flag, int value)
1493 int old = solver_get_flag(solv, flag);
1496 case SOLVER_FLAG_ALLOW_DOWNGRADE:
1497 solv->allowdowngrade = value;
1499 case SOLVER_FLAG_ALLOW_NAMECHANGE:
1500 solv->allownamechange = value;
1502 case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1503 solv->allowarchchange = value;
1505 case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1506 solv->allowvendorchange = value;
1508 case SOLVER_FLAG_ALLOW_UNINSTALL:
1509 solv->allowuninstall = value;
1511 case SOLVER_FLAG_NO_UPDATEPROVIDE:
1512 solv->noupdateprovide = value;
1514 case SOLVER_FLAG_SPLITPROVIDES:
1515 solv->dosplitprovides = value;
1517 case SOLVER_FLAG_IGNORE_RECOMMENDED:
1518 solv->dontinstallrecommended = value;
1520 case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1521 solv->addalreadyrecommended = value;
1523 case SOLVER_FLAG_NO_INFARCHCHECK:
1524 solv->noinfarchcheck = value;
1526 case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1527 solv->keepexplicitobsoletes = value;
1536 cleandeps_check_mistakes(Solver *solv, int level)
1538 Pool *pool = solv->pool;
1542 int mademistake = 0;
1544 if (!solv->cleandepsmap.size)
1546 /* check for mistakes */
1547 for (i = solv->installed->start; i < solv->installed->end; i++)
1549 if (!MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1551 r = solv->rules + solv->featurerules + (i - solv->installed->start);
1552 /* a mistake is when the featurerule is true but the updaterule is false */
1555 FOR_RULELITERALS(p, dp, r)
1556 if (p > 0 && solv->decisionmap[p] > 0)
1560 r = solv->rules + solv->updaterules + (i - solv->installed->start);
1563 FOR_RULELITERALS(p, dp, r)
1564 if (p > 0 && solv->decisionmap[p] > 0)
1568 POOL_DEBUG(SOLV_DEBUG_SOLVER, "cleandeps mistake: ");
1569 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, r);
1570 POOL_DEBUG(SOLV_DEBUG_SOLVER, "feature rule: ");
1571 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, solv->rules + solv->featurerules + (i - solv->installed->start));
1572 if (!solv->cleandeps_mistakes)
1574 solv->cleandeps_mistakes = solv_calloc(1, sizeof(Queue));
1575 queue_init(solv->cleandeps_mistakes);
1577 queue_push(solv->cleandeps_mistakes, i);
1578 MAPCLR(&solv->cleandepsmap, i - solv->installed->start);
1579 solver_reenablepolicyrules_cleandeps(solv, i);
1591 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
1595 for (i = j = 0; i < q->count; i++)
1598 for (cp2 = cp; *cp2; cp2++)
1601 q->elements[j++] = p;
1605 queue_truncate(q, j);
1608 /*-------------------------------------------------------------------
1612 * all rules have been set up, now actually run the solver
1617 solver_run_sat(Solver *solv, int disablerules, int doweak)
1619 Queue dq; /* local decisionqueue */
1620 Queue dqs; /* local decisionqueue for supplements */
1626 Pool *pool = solv->pool;
1628 int minimizationsteps;
1629 int installedpos = solv->installed ? solv->installed->start : 0;
1631 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
1633 POOL_DEBUG (SOLV_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
1634 for (i = 1; i < solv->nrules; i++)
1635 solver_printruleclass(solv, SOLV_DEBUG_RULE_CREATION, solv->rules + i);
1638 POOL_DEBUG(SOLV_DEBUG_SOLVER, "initial decisions: %d\n", solv->decisionq.count);
1640 /* start SAT algorithm */
1642 systemlevel = level + 1;
1643 POOL_DEBUG(SOLV_DEBUG_SOLVER, "solving...\n");
1649 * here's the main loop:
1650 * 1) propagate new decisions (only needed once)
1652 * 3) try to keep installed packages
1653 * 4) fulfill all unresolved rules
1654 * 5) install recommended packages
1655 * 6) minimalize solution if we had choices
1656 * if we encounter a problem, we rewind to a safe level and restart
1660 minimizationsteps = 0;
1664 * initial propagation of the assertions
1668 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagating (propagate_index: %d; size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
1669 if ((r = propagate(solv, level)) != 0)
1671 if (analyze_unsolvable(solv, r, disablerules))
1674 break; /* unsolvable */
1679 * resolve jobs first
1681 if (level < systemlevel)
1683 POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving job rules\n");
1684 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
1687 if (r->d < 0) /* ignore disabled rules */
1690 FOR_RULELITERALS(l, dp, r)
1694 if (solv->decisionmap[-l] <= 0)
1699 if (solv->decisionmap[l] > 0)
1701 if (solv->decisionmap[l] == 0)
1707 /* prune to installed if not updating */
1708 if (dq.count > 1 && solv->installed && !solv->updatemap_all &&
1709 !(solv->job.elements[solv->ruletojob.elements[i - solv->jobrules]] & SOLVER_ORUPDATE))
1712 for (j = k = 0; j < dq.count; j++)
1714 Solvable *s = pool->solvables + dq.elements[j];
1715 if (s->repo == solv->installed)
1717 dq.elements[k++] = dq.elements[j];
1718 if (solv->updatemap.size && MAPTST(&solv->updatemap, dq.elements[j] - solv->installed->start))
1720 k = 0; /* package wants to be updated, do not prune */
1729 level = selectandinstall(solv, level, &dq, disablerules, i);
1732 if (level <= olevel)
1736 break; /* unsolvable */
1737 systemlevel = level + 1;
1738 if (i < solv->jobrules_end)
1740 solv->decisioncnt_update = solv->decisionq.count;
1741 solv->decisioncnt_keep = solv->decisionq.count;
1745 * installed packages
1747 if (level < systemlevel && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
1749 Repo *installed = solv->installed;
1752 POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving installed packages\n");
1753 /* we use two passes if we need to update packages
1754 * to create a better user experience */
1755 for (pass = solv->updatemap.size ? 0 : 1; pass < 2; pass++)
1757 int passlevel = level;
1759 solv->decisioncnt_keep = solv->decisionq.count;
1760 /* start with installedpos, the position that gave us problems last time */
1761 for (i = installedpos, n = installed->start; n < installed->end; i++, n++)
1766 if (i == installed->end)
1767 i = installed->start;
1768 s = pool->solvables + i;
1769 if (s->repo != installed)
1772 if (solv->decisionmap[i] > 0)
1774 if (!pass && solv->updatemap.size && !MAPTST(&solv->updatemap, i - installed->start))
1775 continue; /* updates first */
1776 r = solv->rules + solv->updaterules + (i - installed->start);
1778 if (!rr->p || rr->d < 0) /* disabled -> look at feature rule */
1779 rr -= solv->installed->end - solv->installed->start;
1780 if (!rr->p) /* identical to update rule? */
1783 continue; /* orpaned package */
1785 /* XXX: noupdate check is probably no longer needed, as all jobs should
1786 * already be satisfied */
1787 /* Actually we currently still need it because of erase jobs */
1788 /* if noupdate is set we do not look at update candidates */
1790 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))
1792 if (solv->noobsoletes.size && solv->multiversionupdaters
1793 && (d = solv->multiversionupdaters[i - installed->start]) != 0)
1795 /* special multiversion handling, make sure best version is chosen */
1797 while ((p = pool->whatprovidesdata[d++]) != 0)
1798 if (solv->decisionmap[p] >= 0)
1800 if (dq.count && solv->update_targets && solv->update_targets->elements[i - installed->start])
1801 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], &dq);
1804 policy_filter_unwanted(solv, &dq, POLICY_MODE_CHOOSE);
1806 if (p != i && solv->decisionmap[p] == 0)
1808 rr = solv->rules + solv->featurerules + (i - solv->installed->start);
1809 if (!rr->p) /* update rule == feature rule? */
1810 rr = rr - solv->featurerules + solv->updaterules;
1819 /* update to best package */
1820 FOR_RULELITERALS(p, dp, rr)
1822 if (solv->decisionmap[p] > 0)
1824 dq.count = 0; /* already fulfilled */
1827 if (!solv->decisionmap[p])
1832 if (dq.count && solv->update_targets && solv->update_targets->elements[i - installed->start])
1833 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], &dq);
1834 /* install best version */
1838 level = selectandinstall(solv, level, &dq, disablerules, rr - solv->rules);
1845 if (level <= olevel)
1847 if (level == 1 || level < passlevel)
1848 break; /* trouble */
1850 n = installed->start; /* redo all */
1856 /* if still undecided keep package */
1857 if (solv->decisionmap[i] == 0)
1860 if (solv->cleandepsmap.size && MAPTST(&solv->cleandepsmap, i - installed->start))
1862 POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, i));
1863 level = setpropagatelearn(solv, level, -i, disablerules, 0);
1867 POOL_DEBUG(SOLV_DEBUG_POLICY, "keeping %s\n", pool_solvid2str(pool, i));
1868 level = setpropagatelearn(solv, level, i, disablerules, r - solv->rules);
1872 if (level <= olevel)
1874 if (level == 1 || level < passlevel)
1875 break; /* trouble */
1877 n = installed->start; /* redo all */
1880 continue; /* retry with learnt rule */
1884 if (n < installed->end)
1886 installedpos = i; /* retry problem solvable next time */
1887 break; /* ran into trouble */
1889 installedpos = installed->start; /* reset installedpos */
1892 break; /* unsolvable */
1893 systemlevel = level + 1;
1895 continue; /* had trouble, retry */
1898 if (level < systemlevel)
1899 systemlevel = level;
1904 solv->decisioncnt_resolve = solv->decisionq.count;
1905 POOL_DEBUG(SOLV_DEBUG_POLICY, "deciding unresolved rules\n");
1906 for (i = 1, n = 1; n < solv->nrules; i++, n++)
1908 if (i == solv->nrules)
1910 r = solv->rules + i;
1911 if (r->d < 0) /* ignore disabled rules */
1916 /* binary or unary rule */
1917 /* need two positive undecided literals */
1918 if (r->p < 0 || r->w2 <= 0)
1920 if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
1922 queue_push(&dq, r->p);
1923 queue_push(&dq, r->w2);
1928 * all negative literals are installed
1929 * no positive literal is installed
1930 * i.e. the rule is not fulfilled and we
1931 * just need to decide on the positive literals
1935 if (solv->decisionmap[-r->p] <= 0)
1940 if (solv->decisionmap[r->p] > 0)
1942 if (solv->decisionmap[r->p] == 0)
1943 queue_push(&dq, r->p);
1945 dp = pool->whatprovidesdata + r->d;
1946 while ((p = *dp++) != 0)
1950 if (solv->decisionmap[-p] <= 0)
1955 if (solv->decisionmap[p] > 0)
1957 if (solv->decisionmap[p] == 0)
1964 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
1966 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "unfulfilled ");
1967 solver_printruleclass(solv, SOLV_DEBUG_PROPAGATE, r);
1969 /* dq.count < 2 cannot happen as this means that
1970 * the rule is unit */
1971 assert(dq.count > 1);
1974 level = selectandinstall(solv, level, &dq, disablerules, r - solv->rules);
1976 break; /* unsolvable */
1977 if (level < systemlevel || level == 1)
1978 break; /* trouble */
1979 /* something changed, so look at all rules again */
1983 if (n != solv->nrules) /* ran into trouble? */
1986 break; /* unsolvable */
1987 continue; /* start over */
1990 /* at this point we have a consistent system. now do the extras... */
1992 solv->decisioncnt_weak = solv->decisionq.count;
1997 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended packages\n");
1998 queue_empty(&dq); /* recommended packages */
1999 queue_empty(&dqs); /* supplemented packages */
2000 for (i = 1; i < pool->nsolvables; i++)
2002 if (solv->decisionmap[i] < 0)
2004 if (solv->decisionmap[i] > 0)
2006 /* installed, check for recommends */
2007 Id *recp, rec, pp, p;
2008 s = pool->solvables + i;
2009 if (!solv->addalreadyrecommended && s->repo == solv->installed)
2011 /* XXX need to special case AND ? */
2014 recp = s->repo->idarraydata + s->recommends;
2015 while ((rec = *recp++) != 0)
2018 FOR_PROVIDES(p, pp, rec)
2020 if (solv->decisionmap[p] > 0)
2025 else if (solv->decisionmap[p] == 0)
2027 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))))
2029 queue_pushunique(&dq, p);
2037 s = pool->solvables + i;
2038 if (!s->supplements)
2040 if (!pool_installable(pool, s))
2042 if (!solver_is_supplementing(solv, s))
2044 if (solv->dupmap_all && solv->installed && s->repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, i - solv->installed->start))))
2046 queue_push(&dqs, i);
2050 /* filter out all packages obsoleted by installed packages */
2051 /* this is no longer needed if we have reverse obsoletes */
2052 if ((dqs.count || dq.count) && solv->installed)
2055 Id obs, *obsp, po, ppo;
2057 map_init(&obsmap, pool->nsolvables);
2058 for (p = solv->installed->start; p < solv->installed->end; p++)
2060 s = pool->solvables + p;
2061 if (s->repo != solv->installed || !s->obsoletes)
2063 if (solv->decisionmap[p] <= 0)
2065 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
2067 obsp = s->repo->idarraydata + s->obsoletes;
2068 /* foreach obsoletes */
2069 while ((obs = *obsp++) != 0)
2070 FOR_PROVIDES(po, ppo, obs)
2071 MAPSET(&obsmap, po);
2073 for (i = j = 0; i < dqs.count; i++)
2074 if (!MAPTST(&obsmap, dqs.elements[i]))
2075 dqs.elements[j++] = dqs.elements[i];
2077 for (i = j = 0; i < dq.count; i++)
2078 if (!MAPTST(&obsmap, dq.elements[i]))
2079 dq.elements[j++] = dq.elements[i];
2084 /* filter out all already supplemented packages if requested */
2085 if (!solv->addalreadyrecommended && dqs.count)
2087 /* turn off all new packages */
2088 for (i = 0; i < solv->decisionq.count; i++)
2090 p = solv->decisionq.elements[i];
2093 s = pool->solvables + p;
2094 if (s->repo && s->repo != solv->installed)
2095 solv->decisionmap[p] = -solv->decisionmap[p];
2097 /* filter out old supplements */
2098 for (i = j = 0; i < dqs.count; i++)
2100 p = dqs.elements[i];
2101 s = pool->solvables + p;
2102 if (!s->supplements)
2104 if (!solver_is_supplementing(solv, s))
2105 dqs.elements[j++] = p;
2108 /* undo turning off */
2109 for (i = 0; i < solv->decisionq.count; i++)
2111 p = solv->decisionq.elements[i];
2114 s = pool->solvables + p;
2115 if (s->repo && s->repo != solv->installed)
2116 solv->decisionmap[p] = -solv->decisionmap[p];
2120 /* multiversion doesn't mix well with supplements.
2121 * filter supplemented packages where we already decided
2122 * to install a different version (see bnc#501088) */
2123 if (dqs.count && solv->noobsoletes.size)
2125 for (i = j = 0; i < dqs.count; i++)
2127 p = dqs.elements[i];
2128 if (MAPTST(&solv->noobsoletes, p))
2131 s = pool->solvables + p;
2132 FOR_PROVIDES(p2, pp2, s->name)
2133 if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name)
2136 continue; /* ignore this package */
2138 dqs.elements[j++] = p;
2143 /* make dq contain both recommended and supplemented pkgs */
2146 for (i = 0; i < dqs.count; i++)
2147 queue_pushunique(&dq, dqs.elements[i]);
2153 int decisioncount = solv->decisionq.count;
2157 /* simple case, just one package. no need to choose to best version */
2160 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2162 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2163 level = setpropagatelearn(solv, level, p, 0, 0);
2166 continue; /* back to main loop */
2169 /* filter packages, this gives us the best versions */
2170 policy_filter_unwanted(solv, &dq, POLICY_MODE_RECOMMEND);
2172 /* create map of result */
2173 map_init(&dqmap, pool->nsolvables);
2174 for (i = 0; i < dq.count; i++)
2175 MAPSET(&dqmap, dq.elements[i]);
2177 /* install all supplemented packages */
2178 for (i = 0; i < dqs.count; i++)
2180 p = dqs.elements[i];
2181 if (solv->decisionmap[p] || !MAPTST(&dqmap, p))
2183 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2185 level = setpropagatelearn(solv, level, p, 0, 0);
2186 if (level <= olevel)
2189 if (i < dqs.count || solv->decisionq.count < decisioncount)
2197 /* install all recommended packages */
2198 /* more work as we want to created branches if multiple
2199 * choices are valid */
2200 for (i = 0; i < decisioncount; i++)
2203 p = solv->decisionq.elements[i];
2206 s = pool->solvables + p;
2207 if (!s->repo || (!solv->addalreadyrecommended && s->repo == solv->installed))
2211 recp = s->repo->idarraydata + s->recommends;
2212 while ((rec = *recp++) != 0)
2215 FOR_PROVIDES(p, pp, rec)
2217 if (solv->decisionmap[p] > 0)
2222 else if (solv->decisionmap[p] == 0 && MAPTST(&dqmap, p))
2223 queue_pushunique(&dq, p);
2229 /* multiple candidates, open a branch */
2230 for (i = 1; i < dq.count; i++)
2231 queue_push(&solv->branches, dq.elements[i]);
2232 queue_push(&solv->branches, -level);
2235 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2237 level = setpropagatelearn(solv, level, p, 0, 0);
2238 if (level <= olevel || solv->decisionq.count < decisioncount)
2239 break; /* we had to revert some decisions */
2242 break; /* had a problem above, quit loop */
2247 continue; /* back to main loop so that all deps are checked */
2251 solv->decisioncnt_orphan = solv->decisionq.count;
2252 if (solv->dupmap_all && solv->installed)
2254 int installedone = 0;
2256 /* let's see if we can install some unsupported package */
2257 POOL_DEBUG(SOLV_DEBUG_SOLVER, "deciding orphaned packages\n");
2258 for (i = 0; i < solv->orphaned.count; i++)
2260 p = solv->orphaned.elements[i];
2261 if (solv->decisionmap[p])
2262 continue; /* already decided */
2263 if (solv->droporphanedmap_all)
2265 if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))
2267 POOL_DEBUG(SOLV_DEBUG_SOLVER, "keeping orphaned %s\n", pool_solvid2str(pool, p));
2269 level = setpropagatelearn(solv, level, p, 0, 0);
2274 if (installedone || i < solv->orphaned.count)
2278 continue; /* back to main loop */
2280 for (i = 0; i < solv->orphaned.count; i++)
2282 p = solv->orphaned.elements[i];
2283 if (solv->decisionmap[p])
2284 continue; /* already decided */
2285 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing orphaned %s\n", pool_solvid2str(pool, p));
2287 level = setpropagatelearn(solv, level, -p, 0, 0);
2291 if (i < solv->orphaned.count)
2295 continue; /* back to main loop */
2299 if (solv->installed && solv->cleandepsmap.size)
2301 if (cleandeps_check_mistakes(solv, level))
2303 level = 1; /* restart from scratch */
2308 if (solv->solution_callback)
2310 solv->solution_callback(solv, solv->solution_callback_data);
2311 if (solv->branches.count)
2313 int i = solv->branches.count - 1;
2314 int l = -solv->branches.elements[i];
2318 if (solv->branches.elements[i - 1] < 0)
2320 p = solv->branches.elements[i];
2321 POOL_DEBUG(SOLV_DEBUG_SOLVER, "branching with %s\n", pool_solvid2str(pool, p));
2323 for (j = i + 1; j < solv->branches.count; j++)
2324 queue_push(&dq, solv->branches.elements[j]);
2325 solv->branches.count = i;
2327 revert(solv, level);
2329 for (j = 0; j < dq.count; j++)
2330 queue_push(&solv->branches, dq.elements[j]);
2332 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2334 level = setpropagatelearn(solv, level, p, disablerules, why);
2339 /* all branches done, we're finally finished */
2343 /* auto-minimization step */
2344 if (solv->branches.count)
2346 int l = 0, lasti = -1, lastl = -1;
2350 for (i = solv->branches.count - 1; i >= 0; i--)
2352 p = solv->branches.elements[i];
2355 else if (p > 0 && solv->decisionmap[p] > l + 1)
2363 /* kill old solvable so that we do not loop */
2364 p = solv->branches.elements[lasti];
2365 solv->branches.elements[lasti] = 0;
2366 POOL_DEBUG(SOLV_DEBUG_SOLVER, "minimizing %d -> %d with %s\n", solv->decisionmap[p], lastl, pool_solvid2str(pool, p));
2367 minimizationsteps++;
2370 revert(solv, level);
2371 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2374 level = setpropagatelearn(solv, level, p, disablerules, why);
2377 continue; /* back to main loop */
2380 /* no minimization found, we're finally finished! */
2384 POOL_DEBUG(SOLV_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable, %d minimization steps\n", solv->stats_learned, solv->stats_unsolvable, minimizationsteps);
2386 POOL_DEBUG(SOLV_DEBUG_STATS, "done solving.\n\n");
2392 solv->decisioncnt_update = solv->decisionq.count;
2393 solv->decisioncnt_keep = solv->decisionq.count;
2394 solv->decisioncnt_resolve = solv->decisionq.count;
2395 solv->decisioncnt_weak = solv->decisionq.count;
2396 solv->decisioncnt_orphan = solv->decisionq.count;
2399 solver_printdecisionq(solv, SOLV_DEBUG_RESULT);
2404 /*-------------------------------------------------------------------
2406 * remove disabled conflicts
2408 * purpose: update the decisionmap after some rules were disabled.
2409 * this is used to calculate the suggested/recommended package list.
2410 * Also returns a "removed" list to undo the discisionmap changes.
2414 removedisabledconflicts(Solver *solv, Queue *removed)
2416 Pool *pool = solv->pool;
2421 Id *decisionmap = solv->decisionmap;
2423 queue_empty(removed);
2424 for (i = 0; i < solv->decisionq.count; i++)
2426 p = solv->decisionq.elements[i];
2428 continue; /* conflicts only, please */
2429 why = solv->decisionq_why.elements[i];
2432 /* no rule involved, must be a orphan package drop */
2435 /* we never do conflicts on free decisions, so there
2436 * must have been an unit rule */
2438 r = solv->rules + why;
2439 if (r->d < 0 && decisionmap[-p])
2441 /* rule is now disabled, remove from decisionmap */
2442 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing conflict for package %s[%d]\n", pool_solvid2str(pool, -p), -p);
2443 queue_push(removed, -p);
2444 queue_push(removed, decisionmap[-p]);
2445 decisionmap[-p] = 0;
2448 if (!removed->count)
2450 /* we removed some confliced packages. some of them might still
2451 * be in conflict, so search for unit rules and re-conflict */
2453 for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
2455 if (i == solv->nrules)
2458 r = solv->rules + i;
2464 if (r->p < 0 && !decisionmap[-r->p])
2470 if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
2472 else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
2477 if (r->p < 0 && decisionmap[-r->p] == 0)
2479 if (new || DECISIONMAP_FALSE(r->p))
2481 dp = pool->whatprovidesdata + r->d;
2482 while ((p = *dp++) != 0)
2484 if (new && p == new)
2486 if (p < 0 && decisionmap[-p] == 0)
2495 else if (!DECISIONMAP_FALSE(p))
2505 POOL_DEBUG(SOLV_DEBUG_SOLVER, "re-conflicting package %s[%d]\n", pool_solvid2str(pool, -new), -new);
2506 decisionmap[-new] = -1;
2508 n = 0; /* redo all rules */
2514 undo_removedisabledconflicts(Solver *solv, Queue *removed)
2517 for (i = 0; i < removed->count; i += 2)
2518 solv->decisionmap[removed->elements[i]] = removed->elements[i + 1];
2522 /*-------------------------------------------------------------------
2524 * weaken solvable dependencies
2528 weaken_solvable_deps(Solver *solv, Id p)
2533 for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++)
2537 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2538 continue; /* conflict */
2539 queue_push(&solv->weakruleq, i);
2544 /********************************************************************/
2549 solver_calculate_noobsmap(Pool *pool, Queue *job, Map *noobsmap)
2552 Id how, what, select;
2554 for (i = 0; i < job->count; i += 2)
2556 how = job->elements[i];
2557 if ((how & SOLVER_JOBMASK) != SOLVER_NOOBSOLETES)
2559 what = job->elements[i + 1];
2560 select = how & SOLVER_SELECTMASK;
2561 if (!noobsmap->size)
2562 map_grow(noobsmap, pool->nsolvables);
2563 if (select == SOLVER_SOLVABLE_ALL)
2565 FOR_POOL_SOLVABLES(p)
2566 MAPSET(noobsmap, p);
2568 else if (select == SOLVER_SOLVABLE_REPO)
2571 Repo *repo = pool_id2repo(pool, what);
2573 FOR_REPO_SOLVABLES(repo, p, s)
2574 MAPSET(noobsmap, p);
2576 FOR_JOB_SELECT(p, pp, select, what)
2577 MAPSET(noobsmap, p);
2582 * add a rule created by a job, record job number and weak flag
2585 solver_addjobrule(Solver *solv, Id p, Id d, Id job, int weak)
2587 solver_addrule(solv, p, d);
2588 queue_push(&solv->ruletojob, job);
2590 queue_push(&solv->weakruleq, solv->nrules - 1);
2594 add_update_target(Solver *solv, Id p)
2596 Pool *pool = solv->pool;
2597 Solvable *s = pool->solvables + p;
2598 Repo *installed = solv->installed;
2600 if (!solv->update_targets)
2602 solv->update_targets = solv_calloc(1, sizeof(Queue));
2603 queue_init(solv->update_targets);
2605 FOR_PROVIDES(pi, pip, s->name)
2607 Solvable *si = pool->solvables + pi;
2608 if (si->repo != installed || si->name != s->name)
2610 queue_push2(solv->update_targets, pi, p);
2611 /* check if it's ok to keep the installed package */
2612 if (s->evr == si->evr && solvable_identical(s, si))
2613 queue_push2(solv->update_targets, pi, pi);
2617 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2618 while ((obs = *obsp++) != 0)
2620 FOR_PROVIDES(pi, pip, obs)
2622 Solvable *si = pool->solvables + pi;
2623 if (si->repo != installed)
2625 if (si->name == s->name)
2626 continue; /* already handled above */
2627 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
2629 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
2631 queue_push2(solv->update_targets, pi, p);
2638 transform_update_targets_sortfn(const void *ap, const void *bp, void *dp)
2648 transform_update_targets(Solver *solv)
2650 Repo *installed = solv->installed;
2651 Queue *update_targets = solv->update_targets;
2653 Id p, q, lastp, lastq;
2655 if (!update_targets->count)
2657 queue_free(update_targets);
2658 solv->update_targets = solv_free(update_targets);
2661 if (update_targets->count > 2)
2662 solv_sort(update_targets->elements, update_targets->count >> 1, 2 * sizeof(Id), transform_update_targets_sortfn, solv);
2663 queue_insertn(update_targets, 0, installed->end - installed->start);
2665 for (i = j = installed->end - installed->start; i < update_targets->count; i += 2)
2667 if ((p = update_targets->elements[i]) != lastp)
2669 if (!solv->updatemap.size)
2670 map_grow(&solv->updatemap, installed->end - installed->start);
2671 MAPSET(&solv->updatemap, p - installed->start);
2672 update_targets->elements[j++] = 0; /* finish old set */
2673 update_targets->elements[p - installed->start] = j; /* start new set */
2677 if ((q = update_targets->elements[i + 1]) != lastq)
2679 update_targets->elements[j++] = q;
2683 queue_truncate(update_targets, j);
2684 queue_push(update_targets, 0); /* finish last set */
2695 solver_solve(Solver *solv, Queue *job)
2697 Pool *pool = solv->pool;
2698 Repo *installed = solv->installed;
2701 Map addedmap; /* '1' == have rpm-rules for solvable */
2702 Map installcandidatemap;
2703 Id how, what, select, name, weak, p, pp, d;
2707 int now, solve_start;
2710 solve_start = solv_timems(0);
2712 /* log solver options */
2713 POOL_DEBUG(SOLV_DEBUG_STATS, "solver started\n");
2714 POOL_DEBUG(SOLV_DEBUG_STATS, "dosplitprovides=%d, noupdateprovide=%d, noinfarchcheck=%d\n", solv->dosplitprovides, solv->noupdateprovide, solv->noinfarchcheck);
2715 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);
2716 POOL_DEBUG(SOLV_DEBUG_STATS, "promoteepoch=%d, forbidselfconflicts=%d\n", pool->promoteepoch, pool->forbidselfconflicts);
2717 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d, obsoleteusescolors=%d\n", pool->obsoleteusesprovides, pool->implicitobsoleteusesprovides, pool->obsoleteusescolors);
2718 POOL_DEBUG(SOLV_DEBUG_STATS, "dontinstallrecommended=%d, addalreadyrecommended=%d\n", solv->dontinstallrecommended, solv->addalreadyrecommended);
2720 /* create whatprovides if not already there */
2721 if (!pool->whatprovides)
2722 pool_createwhatprovides(pool);
2724 /* create obsolete index */
2725 policy_create_obsolete_index(solv);
2728 queue_free(&solv->job);
2729 queue_init_clone(&solv->job, job);
2731 if (solv->update_targets)
2733 queue_free(solv->update_targets);
2734 solv->update_targets = solv_free(solv->update_targets);
2737 * create basic rule set of all involved packages
2738 * use addedmap bitmap to make sure we don't create rules twice
2741 /* create noobsolete map if needed */
2742 solver_calculate_noobsmap(pool, job, &solv->noobsoletes);
2744 map_init(&addedmap, pool->nsolvables);
2745 MAPSET(&addedmap, SYSTEMSOLVABLE);
2747 map_init(&installcandidatemap, pool->nsolvables);
2750 now = solv_timems(0);
2752 * create rules for all package that could be involved with the solving
2753 * so called: rpm rules
2758 /* check for update/verify jobs as they need to be known early */
2759 for (i = 0; i < job->count; i += 2)
2761 how = job->elements[i];
2762 what = job->elements[i + 1];
2763 select = how & SOLVER_SELECTMASK;
2764 switch (how & SOLVER_JOBMASK)
2767 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
2768 solv->fixmap_all = 1;
2769 FOR_JOB_SELECT(p, pp, select, what)
2771 s = pool->solvables + p;
2772 if (s->repo != installed)
2774 if (!solv->fixmap.size)
2775 map_grow(&solv->fixmap, installed->end - installed->start);
2776 MAPSET(&solv->fixmap, p - installed->start);
2780 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
2781 solv->updatemap_all = 1;
2782 else if (select == SOLVER_SOLVABLE_REPO && what != installed->repoid)
2784 Repo *repo = pool_id2repo(pool, what);
2787 /* targeted update */
2788 FOR_REPO_SOLVABLES(repo, p, s)
2789 add_update_target(solv, p);
2794 FOR_JOB_SELECT(p, pp, select, what)
2796 s = pool->solvables + p;
2797 if (s->repo != installed)
2799 if (!solv->updatemap.size)
2800 map_grow(&solv->updatemap, installed->end - installed->start);
2801 MAPSET(&solv->updatemap, p - installed->start);
2806 FOR_JOB_SELECT(p, pp, select, what)
2807 add_update_target(solv, p);
2816 if (solv->update_targets)
2817 transform_update_targets(solv);
2819 oldnrules = solv->nrules;
2820 FOR_REPO_SOLVABLES(installed, p, s)
2821 solver_addrpmrulesforsolvable(solv, s, &addedmap);
2822 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
2823 oldnrules = solv->nrules;
2824 FOR_REPO_SOLVABLES(installed, p, s)
2825 solver_addrpmrulesforupdaters(solv, s, &addedmap, 1);
2826 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
2830 * create rules for all packages involved in the job
2831 * (to be installed or removed)
2834 oldnrules = solv->nrules;
2835 for (i = 0; i < job->count; i += 2)
2837 how = job->elements[i];
2838 what = job->elements[i + 1];
2839 select = how & SOLVER_SELECTMASK;
2841 switch (how & SOLVER_JOBMASK)
2843 case SOLVER_INSTALL:
2844 FOR_JOB_SELECT(p, pp, select, what)
2846 MAPSET(&installcandidatemap, p);
2847 solver_addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
2850 case SOLVER_DISTUPGRADE:
2851 if (select == SOLVER_SOLVABLE_ALL)
2853 solv->dupmap_all = 1;
2854 solv->updatemap_all = 1;
2856 if (!solv->dupmap_all)
2863 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
2867 * add rules for suggests, enhances
2869 oldnrules = solv->nrules;
2870 solver_addrpmrulesforweak(solv, &addedmap);
2871 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
2874 * first pass done, we now have all the rpm rules we need.
2875 * unify existing rules before going over all job rules and
2877 * at this point the system is always solvable,
2878 * as an empty system (remove all packages) is a valid solution
2881 IF_POOLDEBUG (SOLV_DEBUG_STATS)
2883 int possible = 0, installable = 0;
2884 for (i = 1; i < pool->nsolvables; i++)
2886 if (pool_installable(pool, pool->solvables + i))
2888 if (MAPTST(&addedmap, i))
2891 POOL_DEBUG(SOLV_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
2894 solver_unifyrules(solv); /* remove duplicate rpm rules */
2895 solv->rpmrules_end = solv->nrules; /* mark end of rpm rules */
2897 POOL_DEBUG(SOLV_DEBUG_STATS, "rpm rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
2898 POOL_DEBUG(SOLV_DEBUG_STATS, "rpm rule creation took %d ms\n", solv_timems(now));
2900 /* create dup maps if needed. We need the maps early to create our
2903 solver_createdupmaps(solv);
2906 * create feature rules
2908 * foreach installed:
2909 * create assertion (keep installed, if no update available)
2911 * create update rule (A|update1(A)|update2(A)|...)
2913 * those are used later on to keep a version of the installed packages in
2917 solv->featurerules = solv->nrules; /* mark start of feature rules */
2920 /* foreach possibly installed solvable */
2921 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
2923 if (s->repo != installed)
2925 solver_addrule(solv, 0, 0); /* create dummy rule */
2928 solver_addupdaterule(solv, s, 1); /* allow s to be updated */
2930 /* make sure we accounted for all rules */
2931 assert(solv->nrules - solv->featurerules == installed->end - installed->start);
2933 solv->featurerules_end = solv->nrules;
2936 * Add update rules for installed solvables
2938 * almost identical to feature rules
2939 * except that downgrades/archchanges/vendorchanges are not allowed
2942 solv->updaterules = solv->nrules;
2945 { /* foreach installed solvables */
2946 /* we create all update rules, but disable some later on depending on the job */
2947 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
2951 if (s->repo != installed)
2953 solver_addrule(solv, 0, 0); /* create dummy rule */
2956 solver_addupdaterule(solv, s, 0); /* allowall = 0: downgrades not allowed */
2958 * check for and remove duplicate
2960 r = solv->rules + solv->nrules - 1; /* r: update rule */
2961 sr = r - (installed->end - installed->start); /* sr: feature rule */
2962 /* it's orphaned if there is no feature rule or the feature rule
2963 * consists just of the installed package */
2964 if (!sr->p || (sr->p == i && !sr->d && !sr->w2))
2965 queue_push(&solv->orphaned, i);
2968 assert(solv->dupmap_all && !sr->p);
2971 if (!solver_samerule(solv, r, sr))
2972 memset(sr, 0, sizeof(*sr)); /* delete unneeded feature rule */
2974 solver_disablerule(solv, sr); /* disable feature rule */
2976 /* consistency check: we added a rule for _every_ installed solvable */
2977 assert(solv->nrules - solv->updaterules == installed->end - installed->start);
2979 solv->updaterules_end = solv->nrules;
2983 * now add all job rules
2986 solv->jobrules = solv->nrules;
2987 if (solv->cleandeps_updatepkgs)
2989 queue_free(solv->cleandeps_updatepkgs);
2990 solv->cleandeps_updatepkgs = solv_free(solv->cleandeps_updatepkgs);
2992 for (i = 0; i < job->count; i += 2)
2994 oldnrules = solv->nrules;
2996 how = job->elements[i];
2997 what = job->elements[i + 1];
2998 weak = how & SOLVER_WEAK;
2999 select = how & SOLVER_SELECTMASK;
3000 switch (how & SOLVER_JOBMASK)
3002 case SOLVER_INSTALL:
3003 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3004 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3005 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3006 if (select == SOLVER_SOLVABLE)
3014 FOR_JOB_SELECT(p, pp, select, what)
3018 /* no candidate found, make this an impossible rule */
3019 queue_push(&q, -SYSTEMSOLVABLE);
3021 p = queue_shift(&q); /* get first candidate */
3022 d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q); /* internalize */
3024 solver_addjobrule(solv, p, d, i, weak);
3027 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %s%serase %s\n", weak ? "weak " : "", how & SOLVER_CLEANDEPS ? "clean deps " : "", solver_select2str(pool, select, what));
3028 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3029 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3030 /* specific solvable: by id or by nevra */
3031 name = (select == SOLVER_SOLVABLE || (select == SOLVER_SOLVABLE_NAME && ISRELDEP(what))) ? 0 : -1;
3032 if (select == SOLVER_SOLVABLE_ALL) /* hmmm ;) */
3034 FOR_POOL_SOLVABLES(p)
3035 solver_addjobrule(solv, -p, 0, i, weak);
3037 else if (select == SOLVER_SOLVABLE_REPO)
3039 Repo *repo = pool_id2repo(pool, what);
3041 FOR_REPO_SOLVABLES(repo, p, s)
3042 solver_addjobrule(solv, -p, 0, i, weak);
3044 FOR_JOB_SELECT(p, pp, select, what)
3046 s = pool->solvables + p;
3047 if (installed && s->repo == installed)
3048 name = !name ? s->name : -1;
3049 solver_addjobrule(solv, -p, 0, i, weak);
3051 /* special case for "erase a specific solvable": we also
3052 * erase all other solvables with that name, so that they
3053 * don't get picked up as replacement.
3054 * name is > 0 if exactly one installed solvable matched.
3056 /* XXX: look also at packages that obsolete this package? */
3061 FOR_PROVIDES(p, pp, name)
3063 s = pool->solvables + p;
3064 if (s->name != name)
3066 /* keep other versions installed */
3067 if (s->repo == installed)
3069 /* keep installcandidates of other jobs */
3070 if (MAPTST(&installcandidatemap, p))
3072 /* don't add the same rule twice */
3073 for (j = oldnrules; j < k; j++)
3074 if (solv->rules[j].p == -p)
3077 solver_addjobrule(solv, -p, 0, i, weak); /* remove by id */
3083 if ((how & SOLVER_CLEANDEPS) != 0 && installed)
3085 if (how == SOLVER_SOLVABLE_ALL || (how == SOLVER_SOLVABLE_REPO && what == installed->repoid))
3087 FOR_REPO_SOLVABLES(installed, p, s)
3089 if (!solv->cleandeps_updatepkgs)
3091 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
3092 queue_init(solv->cleandeps_updatepkgs);
3094 queue_pushunique(solv->cleandeps_updatepkgs, p);
3095 if (!solv->cleandepsmap.size)
3096 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3099 FOR_JOB_SELECT(p, pp, select, what)
3101 s = pool->solvables + p;
3102 if (s->repo != installed)
3104 if (!solv->cleandeps_updatepkgs)
3106 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
3107 queue_init(solv->cleandeps_updatepkgs);
3109 queue_pushunique(solv->cleandeps_updatepkgs, p);
3110 if (!solv->cleandepsmap.size)
3111 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3114 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3117 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sverify %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3119 case SOLVER_WEAKENDEPS:
3120 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3121 if (select != SOLVER_SOLVABLE)
3123 s = pool->solvables + what;
3124 weaken_solvable_deps(solv, what);
3126 case SOLVER_NOOBSOLETES:
3127 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sno obsolete %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3130 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3131 if (select == SOLVER_SOLVABLE_ALL)
3133 FOR_POOL_SOLVABLES(p)
3134 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3136 else if (select == SOLVER_SOLVABLE_REPO)
3138 Repo *repo = pool_id2repo(pool, what);
3140 FOR_REPO_SOLVABLES(repo, p, s)
3141 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3143 FOR_JOB_SELECT(p, pp, select, what)
3144 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3146 case SOLVER_DISTUPGRADE:
3147 POOL_DEBUG(SOLV_DEBUG_JOB, "job: distupgrade %s\n", solver_select2str(pool, select, what));
3149 case SOLVER_DROP_ORPHANED:
3150 POOL_DEBUG(SOLV_DEBUG_JOB, "job: drop orphaned %s\n", solver_select2str(pool, select, what));
3151 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3152 solv->droporphanedmap_all = 1;
3153 FOR_JOB_SELECT(p, pp, select, what)
3155 s = pool->solvables + p;
3156 if (!installed || s->repo != installed)
3158 if (!solv->droporphanedmap.size)
3159 map_grow(&solv->droporphanedmap, installed->end - installed->start);
3160 MAPSET(&solv->droporphanedmap, p - installed->start);
3163 case SOLVER_USERINSTALLED:
3164 POOL_DEBUG(SOLV_DEBUG_JOB, "job: user installed %s\n", solver_select2str(pool, select, what));
3167 POOL_DEBUG(SOLV_DEBUG_JOB, "job: unknown job\n");
3175 IF_POOLDEBUG (SOLV_DEBUG_JOB)
3178 if (solv->nrules == oldnrules)
3179 POOL_DEBUG(SOLV_DEBUG_JOB, " - no rule created\n");
3180 for (j = oldnrules; j < solv->nrules; j++)
3182 POOL_DEBUG(SOLV_DEBUG_JOB, " - job ");
3183 solver_printrule(solv, SOLV_DEBUG_JOB, solv->rules + j);
3187 assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
3188 solv->jobrules_end = solv->nrules;
3190 /* now create infarch and dup rules */
3191 if (!solv->noinfarchcheck)
3193 solver_addinfarchrules(solv, &addedmap);
3194 if (pool->obsoleteusescolors)
3196 /* currently doesn't work well with infarch rules, so make
3198 for (i = solv->infarchrules; i < solv->infarchrules_end; i++)
3199 queue_push(&solv->weakruleq, i);
3203 solv->infarchrules = solv->infarchrules_end = solv->nrules;
3207 solver_addduprules(solv, &addedmap);
3208 solver_freedupmaps(solv); /* no longer needed */
3211 solv->duprules = solv->duprules_end = solv->nrules;
3214 solver_addchoicerules(solv);
3216 solv->choicerules = solv->choicerules_end = solv->nrules;
3218 /* all rules created
3219 * --------------------------------------------------------------
3220 * prepare for solving
3223 /* free unneeded memory */
3224 map_free(&addedmap);
3225 map_free(&installcandidatemap);
3228 POOL_DEBUG(SOLV_DEBUG_STATS, "%d rpm rules, 2 * %d update rules, %d job rules, %d infarch rules, %d dup rules, %d choice 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);
3229 POOL_DEBUG(SOLV_DEBUG_STATS, "overall rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
3231 /* create weak map */
3232 map_init(&solv->weakrulemap, solv->nrules);
3233 for (i = 0; i < solv->weakruleq.count; i++)
3235 p = solv->weakruleq.elements[i];
3236 MAPSET(&solv->weakrulemap, p);
3239 /* all new rules are learnt after this point */
3240 solv->learntrules = solv->nrules;
3242 /* create watches chains */
3245 /* create assertion index. it is only used to speed up
3246 * makeruledecsions() a bit */
3247 for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
3248 if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
3249 queue_push(&solv->ruleassertions, i);
3251 /* disable update rules that conflict with our job */
3252 solver_disablepolicyrules(solv);
3254 /* make initial decisions based on assertion rules */
3255 makeruledecisions(solv);
3256 POOL_DEBUG(SOLV_DEBUG_SOLVER, "problems so far: %d\n", solv->problems.count);
3259 if (solv->cleandeps_mistakes)
3261 queue_free(solv->cleandeps_mistakes);
3262 solv->cleandeps_mistakes = solv_free(solv->cleandeps_mistakes);
3266 * ********************************************
3268 * ********************************************
3271 now = solv_timems(0);
3272 solver_run_sat(solv, 1, solv->dontinstallrecommended ? 0 : 1);
3273 POOL_DEBUG(SOLV_DEBUG_STATS, "solver took %d ms\n", solv_timems(now));
3276 * prepare solution queue if there were problems
3278 solver_prepare_solutions(solv);
3280 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);
3281 POOL_DEBUG(SOLV_DEBUG_STATS, "solver_solve took %d ms\n", solv_timems(solve_start));
3283 /* return number of problems */
3284 return solv->problems.count ? solv->problems.count / 2 : 0;
3288 solver_create_transaction(Solver *solv)
3290 return transaction_create_decisionq(solv->pool, &solv->decisionq, &solv->noobsoletes);
3293 void solver_get_orphaned(Solver *solv, Queue *orphanedq)
3295 queue_free(orphanedq);
3296 queue_init_clone(orphanedq, &solv->orphaned);
3299 void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected)
3301 Pool *pool = solv->pool;
3302 Queue redoq, disabledq;
3308 if (!recommendationsq && !suggestionsq)
3311 map_init(&obsmap, pool->nsolvables);
3312 if (solv->installed)
3314 Id obs, *obsp, p, po, ppo;
3315 for (p = solv->installed->start; p < solv->installed->end; p++)
3317 s = pool->solvables + p;
3318 if (s->repo != solv->installed || !s->obsoletes)
3320 if (solv->decisionmap[p] <= 0)
3322 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
3324 obsp = s->repo->idarraydata + s->obsoletes;
3325 /* foreach obsoletes */
3326 while ((obs = *obsp++) != 0)
3327 FOR_PROVIDES(po, ppo, obs)
3328 MAPSET(&obsmap, po);
3333 queue_init(&disabledq);
3335 /* disable all erase jobs (including weak "keep uninstalled" rules) */
3336 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
3338 if (r->d < 0) /* disabled ? */
3340 if (r->p >= 0) /* install job? */
3342 queue_push(&disabledq, i);
3343 solver_disablerule(solv, r);
3349 enabledisablelearntrules(solv);
3350 removedisabledconflicts(solv, &redoq);
3354 * find recommended packages
3356 if (recommendationsq)
3358 Id rec, *recp, p, pp;
3360 queue_empty(recommendationsq);
3361 /* create map of all recommened packages */
3362 solv->recommends_index = -1;
3363 MAPZERO(&solv->recommendsmap);
3365 /* put all packages the solver already chose in the map */
3366 if (solv->decisioncnt_weak)
3368 for (i = solv->decisioncnt_weak; i < solv->decisioncnt_orphan; i++)
3371 why = solv->decisionq_why.elements[i];
3373 continue; /* forced by unit rule */
3374 p = solv->decisionq.elements[i];
3377 MAPSET(&solv->recommendsmap, p);
3381 for (i = 0; i < solv->decisionq.count; i++)
3383 p = solv->decisionq.elements[i];
3386 s = pool->solvables + p;
3389 recp = s->repo->idarraydata + s->recommends;
3390 while ((rec = *recp++) != 0)
3392 FOR_PROVIDES(p, pp, rec)
3393 if (solv->decisionmap[p] > 0)
3399 FOR_PROVIDES(p, pp, rec)
3400 if (solv->decisionmap[p] > 0)
3401 MAPSET(&solv->recommendsmap, p);
3403 continue; /* p != 0: already fulfilled */
3405 FOR_PROVIDES(p, pp, rec)
3406 MAPSET(&solv->recommendsmap, p);
3410 for (i = 1; i < pool->nsolvables; i++)
3412 if (solv->decisionmap[i] < 0)
3414 if (solv->decisionmap[i] > 0 && noselected)
3416 if (MAPTST(&obsmap, i))
3418 s = pool->solvables + i;
3419 if (!MAPTST(&solv->recommendsmap, i))
3421 if (!s->supplements)
3423 if (!pool_installable(pool, s))
3425 if (!solver_is_supplementing(solv, s))
3428 queue_push(recommendationsq, i);
3430 /* we use MODE_SUGGEST here so that repo prio is ignored */
3431 policy_filter_unwanted(solv, recommendationsq, POLICY_MODE_SUGGEST);
3435 * find suggested packages
3440 Id sug, *sugp, p, pp;
3442 queue_empty(suggestionsq);
3443 /* create map of all suggests that are still open */
3444 solv->recommends_index = -1;
3445 MAPZERO(&solv->suggestsmap);
3446 for (i = 0; i < solv->decisionq.count; i++)
3448 p = solv->decisionq.elements[i];
3451 s = pool->solvables + p;
3454 sugp = s->repo->idarraydata + s->suggests;
3455 while ((sug = *sugp++) != 0)
3457 FOR_PROVIDES(p, pp, sug)
3458 if (solv->decisionmap[p] > 0)
3464 FOR_PROVIDES(p, pp, sug)
3465 if (solv->decisionmap[p] > 0)
3466 MAPSET(&solv->suggestsmap, p);
3468 continue; /* already fulfilled */
3470 FOR_PROVIDES(p, pp, sug)
3471 MAPSET(&solv->suggestsmap, p);
3475 for (i = 1; i < pool->nsolvables; i++)
3477 if (solv->decisionmap[i] < 0)
3479 if (solv->decisionmap[i] > 0 && noselected)
3481 if (MAPTST(&obsmap, i))
3483 s = pool->solvables + i;
3484 if (!MAPTST(&solv->suggestsmap, i))
3488 if (!pool_installable(pool, s))
3490 if (!solver_is_enhancing(solv, s))
3493 queue_push(suggestionsq, i);
3495 policy_filter_unwanted(solv, suggestionsq, POLICY_MODE_SUGGEST);
3498 /* undo removedisabledconflicts */
3500 undo_removedisabledconflicts(solv, &redoq);
3503 /* undo job rule disabling */
3504 for (i = 0; i < disabledq.count; i++)
3505 solver_enablerule(solv, solv->rules + disabledq.elements[i]);
3506 queue_free(&disabledq);
3511 /***********************************************************************/
3512 /* disk usage computations */
3514 /*-------------------------------------------------------------------
3516 * calculate DU changes
3520 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
3524 solver_create_state_maps(solv, &installedmap, 0);
3525 pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
3526 map_free(&installedmap);
3530 /*-------------------------------------------------------------------
3532 * calculate changes in install size
3536 solver_calc_installsizechange(Solver *solv)
3541 solver_create_state_maps(solv, &installedmap, 0);
3542 change = pool_calc_installsizechange(solv->pool, &installedmap);
3543 map_free(&installedmap);
3548 solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap)
3550 pool_create_state_maps(solv->pool, &solv->decisionq, installedmap, conflictsmap);
3554 solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res)
3557 pool_create_state_maps(solv->pool, &solv->decisionq, &installedmap, 0);
3558 pool_trivial_installable_noobsoletesmap(solv->pool, &installedmap, pkgs, res, solv->noobsoletes.size ? &solv->noobsoletes : 0);
3559 map_free(&installedmap);
3562 /*-------------------------------------------------------------------
3564 * decision introspection
3568 solver_get_decisionlevel(Solver *solv, Id p)
3570 return solv->decisionmap[p];
3574 solver_get_decisionqueue(Solver *solv, Queue *decisionq)
3576 queue_free(decisionq);
3577 queue_init_clone(decisionq, &solv->decisionq);
3581 solver_get_lastdecisionblocklevel(Solver *solv)
3584 if (solv->decisionq.count == 0)
3586 p = solv->decisionq.elements[solv->decisionq.count - 1];
3589 return solv->decisionmap[p] < 0 ? -solv->decisionmap[p] : solv->decisionmap[p];
3593 solver_get_decisionblock(Solver *solv, int level, Queue *decisionq)
3598 queue_empty(decisionq);
3599 for (i = 0; i < solv->decisionq.count; i++)
3601 p = solv->decisionq.elements[i];
3604 if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
3607 if (i == solv->decisionq.count)
3609 for (i = 0; i < solv->decisionq.count; i++)
3611 p = solv->decisionq.elements[i];
3614 if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
3615 queue_push(decisionq, p);
3622 solver_describe_decision(Solver *solv, Id p, Id *infop)
3629 if (!solv->decisionmap[p])
3630 return SOLVER_REASON_UNRELATED;
3631 pp = solv->decisionmap[p] < 0 ? -p : p;
3632 for (i = 0; i < solv->decisionq.count; i++)
3633 if (solv->decisionq.elements[i] == pp)
3635 if (i == solv->decisionq.count) /* just in case... */
3636 return SOLVER_REASON_UNRELATED;
3637 why = solv->decisionq_why.elements[i];
3642 return SOLVER_REASON_UNIT_RULE;
3645 if (i < solv->decisioncnt_update)
3650 *infop = SYSTEMSOLVABLE;
3651 return SOLVER_REASON_KEEP_INSTALLED;
3655 return SOLVER_REASON_RESOLVE_JOB;
3657 if (i < solv->decisioncnt_keep)
3659 if (why == 0 && pp < 0)
3660 return SOLVER_REASON_CLEANDEPS_ERASE;
3663 if (why >= solv->updaterules && why < solv->updaterules_end)
3664 *infop = why - solv->updaterules;
3665 else if (why >= solv->featurerules && why < solv->featurerules_end)
3666 *infop = why - solv->featurerules;
3668 return SOLVER_REASON_UPDATE_INSTALLED;
3670 if (i < solv->decisioncnt_resolve)
3672 if (why == 0 && pp < 0)
3673 return SOLVER_REASON_CLEANDEPS_ERASE;
3676 if (why >= solv->updaterules && why < solv->updaterules_end)
3677 *infop = why - solv->updaterules;
3678 else if (why >= solv->featurerules && why < solv->featurerules_end)
3679 *infop = why - solv->featurerules;
3681 return SOLVER_REASON_KEEP_INSTALLED;
3683 if (i < solv->decisioncnt_weak)
3687 return SOLVER_REASON_RESOLVE;
3689 if (solv->decisionq.count < solv->decisioncnt_orphan)
3690 return SOLVER_REASON_WEAKDEP;
3691 return SOLVER_REASON_RESOLVE_ORPHAN;
3696 solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq)
3698 Pool *pool = solv->pool;
3700 int level = solv->decisionmap[p];
3707 for (decisionno = 0; decisionno < solv->decisionq.count; decisionno++)
3708 if (solv->decisionq.elements[decisionno] == p)
3710 if (decisionno == solv->decisionq.count)
3712 if (decisionno < solv->decisioncnt_weak || decisionno >= solv->decisioncnt_orphan)
3715 /* 1) list all packages that recommend us */
3716 for (i = 1; i < pool->nsolvables; i++)
3718 Id *recp, rec, pp2, p2;
3719 if (solv->decisionmap[i] < 0 || solv->decisionmap[i] >= level)
3721 s = pool->solvables + i;
3724 if (!solv->addalreadyrecommended && s->repo == solv->installed)
3726 recp = s->repo->idarraydata + s->recommends;
3727 while ((rec = *recp++) != 0)
3730 FOR_PROVIDES(p2, pp2, rec)
3736 /* if p2 is already installed, this recommends is ignored */
3737 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
3743 queue_push(whyq, SOLVER_REASON_RECOMMENDED);
3744 queue_push2(whyq, p2, rec);
3748 /* 2) list all supplements */
3749 s = pool->solvables + p;
3750 if (s->supplements && level > 0)
3752 Id *supp, sup, pp2, p2;
3753 /* this is a hack. to use solver_dep_fulfilled we temporarily clear
3754 * everything above our level in the decisionmap */
3755 for (i = decisionno; i < solv->decisionq.count; i++ )
3757 p2 = solv->decisionq.elements[i];
3759 solv->decisionmap[p2] = -solv->decisionmap[p2];
3761 supp = s->repo->idarraydata + s->supplements;
3762 while ((sup = *supp++) != 0)
3763 if (solver_dep_fulfilled(solv, sup))
3766 /* let's see if this is an easy supp */
3767 FOR_PROVIDES(p2, pp2, sup)
3769 if (!solv->addalreadyrecommended && solv->installed)
3771 if (pool->solvables[p2].repo == solv->installed)
3774 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
3776 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
3777 queue_push2(whyq, p2, sup);
3783 /* hard case, just note dependency with no package */
3784 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
3785 queue_push2(whyq, 0, sup);
3788 for (i = decisionno; i < solv->decisionq.count; i++)
3790 p2 = solv->decisionq.elements[i];
3792 solv->decisionmap[p2] = -solv->decisionmap[p2];
3798 pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what)
3801 how &= SOLVER_SELECTMASK;
3803 if (how == SOLVER_SOLVABLE_ALL)
3805 FOR_POOL_SOLVABLES(p)
3806 queue_push(pkgs, p);
3808 else if (how == SOLVER_SOLVABLE_REPO)
3810 Repo *repo = pool_id2repo(pool, what);
3813 FOR_REPO_SOLVABLES(repo, p, s)
3814 queue_push(pkgs, p);
3818 FOR_JOB_SELECT(p, pp, how, what)
3819 queue_push(pkgs, p);
3824 pool_isemptyupdatejob(Pool *pool, Id how, Id what)
3827 Id select = how & SOLVER_SELECTMASK;
3828 if ((how & SOLVER_JOBMASK) != SOLVER_UPDATE)
3830 if (select == SOLVER_SOLVABLE_ALL || select == SOLVER_SOLVABLE_REPO)
3832 if (!pool->installed)
3834 FOR_JOB_SELECT(p, pp, select, what)
3835 if (pool->solvables[p].repo == pool->installed)
3838 FOR_JOB_SELECT(p, pp, select, what)
3840 Solvable *s = pool->solvables + p;
3841 FOR_PROVIDES(pi, pip, s->name)
3843 Solvable *si = pool->solvables + pi;
3844 if (si->repo != pool->installed || si->name != s->name)
3850 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
3851 while ((obs = *obsp++) != 0)
3853 FOR_PROVIDES(pi, pip, obs)
3855 Solvable *si = pool->solvables + pi;
3856 if (si->repo != pool->installed)
3858 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
3860 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))