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)
62 * things are a bit tricky here if pool->addedprovides == 1, because most split-provides are in
63 * a non-standard location. If we simply call pool_whatprovides, we'll drag in the complete
64 * file list. Instead we rely on pool_addfileprovides ignoring the addfileprovidesfiltered flag
65 * for installed packages and check the lazywhatprovidesq (ignoring the REL_WITH part, but
66 * we filter the package name further down anyway).
68 if (pool->addedfileprovides == 1 && !ISRELDEP(rd->evr) && !pool->whatprovides[rd->evr])
69 pp = pool_searchlazywhatprovidesq(pool, rd->evr);
71 pp = pool_whatprovides(pool, dep);
72 while ((p = pool->whatprovidesdata[pp++]) != 0)
74 /* here we have packages that provide the correct name and contain the path,
75 * now do extra filtering */
76 s = pool->solvables + p;
77 if (s->repo == solv->installed && s->name == rd->name &&
78 (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, p - solv->installed->start))))
85 /*-------------------------------------------------------------------
86 * solver_dep_installed
90 solver_dep_installed(Solver *solv, Id dep)
93 Pool *pool = solv->pool;
98 Reldep *rd = GETRELDEP(pool, dep);
99 if (rd->flags == REL_AND)
101 if (!solver_dep_installed(solv, rd->name))
103 return solver_dep_installed(solv, rd->evr);
105 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
106 return solver_dep_installed(solv, rd->evr);
108 FOR_PROVIDES(p, pp, dep)
110 if (p == SYSTEMSOLVABLE || (solv->installed && pool->solvables[p].repo == solv->installed))
117 /* mirrors solver_dep_installed, but returns 2 if a
118 * dependency listed in solv->installsuppdepq was involved */
120 solver_check_installsuppdepq_dep(Solver *solv, Id dep)
122 Pool *pool = solv->pool;
128 Reldep *rd = GETRELDEP(pool, dep);
129 if (rd->flags == REL_AND)
131 int r2, r1 = solver_check_installsuppdepq_dep(solv, rd->name);
134 r2 = solver_check_installsuppdepq_dep(solv, rd->evr);
137 return r1 == 2 || r2 == 2 ? 2 : 1;
139 if (rd->flags == REL_OR)
141 int r2, r1 = solver_check_installsuppdepq_dep(solv, rd->name);
142 r2 = solver_check_installsuppdepq_dep(solv, rd->evr);
145 return r1 == 2 || r2 == 2 ? 2 : 1;
147 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
148 return solver_splitprovides(solv, rd->evr);
149 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
150 return solver_dep_installed(solv, rd->evr);
151 if (rd->flags == REL_NAMESPACE && (q = solv->installsuppdepq) != 0)
154 for (i = 0; i < q->count; i++)
155 if (q->elements[i] == dep || q->elements[i] == rd->name)
159 FOR_PROVIDES(p, pp, dep)
160 if (solv->decisionmap[p] > 0)
166 solver_check_installsuppdepq(Solver *solv, Solvable *s)
169 supp = s->repo->idarraydata + s->supplements;
170 while ((sup = *supp++) != 0)
171 if (solver_check_installsuppdepq_dep(solv, sup) == 2)
177 autouninstall(Solver *solv, Id *problem)
179 Pool *pool = solv->pool;
181 int lastfeature = 0, lastupdate = 0;
185 for (i = 0; (v = problem[i]) != 0; i++)
188 extraflags &= solv->job.elements[-v - 1];
189 if (v >= solv->featurerules && v < solv->featurerules_end)
192 if (v >= solv->updaterules && v < solv->updaterules_end)
194 /* check if identical to feature rule */
195 Id p = solv->rules[v].p;
199 r = solv->rules + solv->featurerules + (p - solv->installed->start);
202 /* update rule == feature rule */
211 if (!lastupdate && !lastfeature)
213 v = lastupdate ? lastupdate : lastfeature;
214 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "allowuninstall disabling ");
215 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + v);
216 solver_disableproblem(solv, v);
217 if (extraflags != -1 && (extraflags & SOLVER_CLEANDEPS) != 0 && solv->cleandepsmap.size)
219 /* add the package to the updatepkgs list, this will automatically turn
220 * on cleandeps mode */
221 Id p = solv->rules[v].p;
222 if (!solv->cleandeps_updatepkgs)
224 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
225 queue_init(solv->cleandeps_updatepkgs);
229 int oldupdatepkgscnt = solv->cleandeps_updatepkgs->count;
230 queue_pushunique(solv->cleandeps_updatepkgs, p);
231 if (solv->cleandeps_updatepkgs->count != oldupdatepkgscnt)
232 solver_disablepolicyrules(solv);
238 /************************************************************************/
241 * enable/disable learnt rules
243 * we have enabled or disabled some of our rules. We now reenable all
244 * of our learnt rules except the ones that were learnt from rules that
248 enabledisablelearntrules(Solver *solv)
250 Pool *pool = solv->pool;
255 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "enabledisablelearntrules called\n");
256 for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
258 whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules];
259 while ((why = *whyp++) != 0)
261 assert(why > 0 && why < i);
262 if (solv->rules[why].d < 0)
265 /* why != 0: we found a disabled rule, disable the learnt rule */
266 if (why && r->d >= 0)
268 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
270 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "disabling ");
271 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
273 solver_disablerule(solv, r);
275 else if (!why && r->d < 0)
277 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
279 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "re-enabling ");
280 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
282 solver_enablerule(solv, r);
289 * make assertion rules into decisions
291 * Go through rules and add direct assertions to the decisionqueue.
292 * If we find a conflict, disable rules and add them to problem queue.
296 makeruledecisions(Solver *solv)
298 Pool *pool = solv->pool;
303 int record_proof = 1;
305 int havedisabled = 0;
307 /* The system solvable is always installed first */
308 assert(solv->decisionq.count == 0);
309 queue_push(&solv->decisionq, SYSTEMSOLVABLE);
310 queue_push(&solv->decisionq_why, 0);
311 solv->decisionmap[SYSTEMSOLVABLE] = 1; /* installed at level '1' */
313 decisionstart = solv->decisionq.count;
316 /* if we needed to re-run, back up decisions to decisionstart */
317 while (solv->decisionq.count > decisionstart)
319 v = solv->decisionq.elements[--solv->decisionq.count];
320 --solv->decisionq_why.count;
322 solv->decisionmap[vv] = 0;
325 /* note that the ruleassertions queue is ordered */
326 for (ii = 0; ii < solv->ruleassertions.count; ii++)
328 ri = solv->ruleassertions.elements[ii];
329 r = solv->rules + ri;
331 if (havedisabled && ri >= solv->learntrules)
333 /* just started with learnt rule assertions. If we have disabled
334 * some rules, adapt the learnt rule status */
335 enabledisablelearntrules(solv);
339 if (r->d < 0 || !r->p || r->w2) /* disabled, dummy or no assertion */
342 /* do weak rules in phase 2 */
343 if (ri < solv->learntrules && MAPTST(&solv->weakrulemap, ri))
349 if (!solv->decisionmap[vv]) /* if not yet decided */
351 queue_push(&solv->decisionq, v);
352 queue_push(&solv->decisionq_why, r - solv->rules);
353 solv->decisionmap[vv] = v > 0 ? 1 : -1;
354 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
356 Solvable *s = solv->pool->solvables + vv;
358 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", pool_solvable2str(solv->pool, s));
360 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (assertion)\n", pool_solvable2str(solv->pool, s));
365 /* check against previous decision: is there a conflict? */
366 if (v > 0 && solv->decisionmap[vv] > 0) /* ok to install */
368 if (v < 0 && solv->decisionmap[vv] < 0) /* ok to remove */
374 * The rule (r) we're currently processing says something
375 * different (v = r->p) than a previous decision (decisionmap[abs(v)])
379 if (ri >= solv->learntrules)
381 /* conflict with a learnt rule */
382 /* can happen when packages cannot be installed for multiple reasons. */
383 /* we disable the learnt rule in this case */
384 /* (XXX: we should really call analyze_unsolvable_rule here!) */
385 solver_disablerule(solv, r);
390 * find the decision which is the "opposite" of the rule
392 for (i = 0; i < solv->decisionq.count; i++)
393 if (solv->decisionq.elements[i] == -v)
395 assert(i < solv->decisionq.count); /* assert that we found it */
396 oldproblemcount = solv->problems.count;
399 * conflict with system solvable ?
401 if (v == -SYSTEMSOLVABLE)
405 queue_push(&solv->problems, solv->learnt_pool.count);
406 queue_push(&solv->learnt_pool, ri);
407 queue_push(&solv->learnt_pool, 0);
410 queue_push(&solv->problems, 0);
411 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with system solvable, disabling rule #%d\n", ri);
412 if (ri >= solv->jobrules && ri < solv->jobrules_end)
413 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
416 queue_push(&solv->problems, v);
417 queue_push(&solv->problems, 0);
418 if (solv->allowuninstall && v >= solv->featurerules && v < solv->updaterules_end)
419 solv->problems.count = oldproblemcount;
420 solver_disableproblem(solv, v);
422 break; /* start over */
425 assert(solv->decisionq_why.elements[i] > 0);
428 * conflict with an rpm rule ?
430 if (solv->decisionq_why.elements[i] < solv->rpmrules_end)
434 queue_push(&solv->problems, solv->learnt_pool.count);
435 queue_push(&solv->learnt_pool, ri);
436 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
437 queue_push(&solv->learnt_pool, 0);
440 queue_push(&solv->problems, 0);
441 assert(v > 0 || v == -SYSTEMSOLVABLE);
442 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with rpm rule, disabling rule #%d\n", ri);
443 if (ri >= solv->jobrules && ri < solv->jobrules_end)
444 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
447 queue_push(&solv->problems, v);
448 queue_push(&solv->problems, 0);
449 if (solv->allowuninstall && v >= solv->featurerules && v < solv->updaterules_end)
450 solv->problems.count = oldproblemcount;
451 solver_disableproblem(solv, v);
453 break; /* start over */
457 * conflict with another job or update/feature rule
463 queue_push(&solv->problems, solv->learnt_pool.count);
464 queue_push(&solv->learnt_pool, ri);
465 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
466 queue_push(&solv->learnt_pool, 0);
469 queue_push(&solv->problems, 0);
471 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflicting update/job assertions over literal %d\n", vv);
474 * push all of our rules (can only be feature or job rules)
475 * asserting this literal on the problem stack
477 for (i = solv->featurerules, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
479 if (rr->d < 0 /* disabled */
480 || rr->w2) /* or no assertion */
482 if (rr->p != vv /* not affecting the literal */
485 if (MAPTST(&solv->weakrulemap, i)) /* weak: silently ignore */
488 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, " - disabling rule #%d\n", i);
489 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + i);
492 if (i >= solv->jobrules && i < solv->jobrules_end)
493 v = -(solv->ruletojob.elements[i - solv->jobrules] + 1);
494 queue_push(&solv->problems, v);
496 queue_push(&solv->problems, 0);
498 if (solv->allowuninstall && (v = autouninstall(solv, solv->problems.elements + oldproblemcount + 1)) != 0)
499 solv->problems.count = oldproblemcount;
501 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
502 solver_disableproblem(solv, solv->problems.elements[i]);
504 break; /* start over */
506 if (ii < solv->ruleassertions.count)
510 * phase 2: now do the weak assertions
512 for (ii = 0; ii < solv->ruleassertions.count; ii++)
514 ri = solv->ruleassertions.elements[ii];
515 r = solv->rules + ri;
516 if (r->d < 0 || r->w2) /* disabled or no assertion */
518 if (ri >= solv->learntrules || !MAPTST(&solv->weakrulemap, ri)) /* skip non-weak */
523 if (!solv->decisionmap[vv]) /* if not yet decided */
525 queue_push(&solv->decisionq, v);
526 queue_push(&solv->decisionq_why, r - solv->rules);
527 solv->decisionmap[vv] = v > 0 ? 1 : -1;
528 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
530 Solvable *s = solv->pool->solvables + vv;
532 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
534 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
538 /* check against previous decision: is there a conflict? */
539 if (v > 0 && solv->decisionmap[vv] > 0)
541 if (v < 0 && solv->decisionmap[vv] < 0)
544 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "assertion conflict, but I am weak, disabling ");
545 solver_printrule(solv, SOLV_DEBUG_UNSOLVABLE, r);
547 if (ri >= solv->jobrules && ri < solv->jobrules_end)
548 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
551 solver_disableproblem(solv, v);
553 solver_reenablepolicyrules(solv, -v);
555 break; /* start over */
557 if (ii == solv->ruleassertions.count)
558 break; /* finished! */
563 /********************************************************************/
567 /*-------------------------------------------------------------------
570 * initial setup for all watches
574 makewatches(Solver *solv)
578 int nsolvables = solv->pool->nsolvables;
580 solv_free(solv->watches);
581 /* lower half for removals, upper half for installs */
582 solv->watches = solv_calloc(2 * nsolvables, sizeof(Id));
584 /* do it reverse so rpm rules get triggered first (XXX: obsolete?) */
585 for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
587 for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
590 if (!r->w2) /* assertions do not need watches */
593 /* see addwatches_rule(solv, r) */
594 r->n1 = solv->watches[nsolvables + r->w1];
595 solv->watches[nsolvables + r->w1] = r - solv->rules;
597 r->n2 = solv->watches[nsolvables + r->w2];
598 solv->watches[nsolvables + r->w2] = r - solv->rules;
603 /*-------------------------------------------------------------------
605 * add watches (for a new learned rule)
606 * sets up watches for a single rule
608 * see also makewatches() above.
612 addwatches_rule(Solver *solv, Rule *r)
614 int nsolvables = solv->pool->nsolvables;
616 r->n1 = solv->watches[nsolvables + r->w1];
617 solv->watches[nsolvables + r->w1] = r - solv->rules;
619 r->n2 = solv->watches[nsolvables + r->w2];
620 solv->watches[nsolvables + r->w2] = r - solv->rules;
624 /********************************************************************/
630 /* shortcuts to check if a literal (positive or negative) assignment
631 * evaluates to 'true' or 'false'
633 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
634 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
635 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
637 /*-------------------------------------------------------------------
641 * make decision and propagate to all rules
643 * Evaluate each term affected by the decision (linked through watches).
644 * If we find unit rules we make new decisions based on them.
646 * return : 0 = everything is OK
647 * rule = conflict found in this rule
651 propagate(Solver *solv, int level)
653 Pool *pool = solv->pool;
654 Id *rp, *next_rp; /* rule pointer, next rule pointer in linked list */
656 Id p, pkg, other_watch;
658 Id *decisionmap = solv->decisionmap;
660 Id *watches = solv->watches + pool->nsolvables; /* place ptr in middle */
662 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate -----\n");
664 /* foreach non-propagated decision */
665 while (solv->propagate_index < solv->decisionq.count)
668 * 'pkg' was just decided
669 * negate because our watches trigger if literal goes FALSE
671 pkg = -solv->decisionq.elements[solv->propagate_index++];
673 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
675 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagate for decision %d level %d\n", -pkg, level);
676 solver_printruleelement(solv, SOLV_DEBUG_PROPAGATE, 0, -pkg);
679 /* foreach rule where 'pkg' is now FALSE */
680 for (rp = watches + pkg; *rp; rp = next_rp)
682 r = solv->rules + *rp;
685 /* rule is disabled, goto next */
693 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
695 POOL_DEBUG(SOLV_DEBUG_PROPAGATE," watch triggered ");
696 solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
699 /* 'pkg' was just decided (was set to FALSE)
701 * now find other literal watch, check clause
702 * and advance on linked list
716 * This term is already true (through the other literal)
717 * so we have nothing to do
719 if (DECISIONMAP_TRUE(other_watch))
723 * The other literal is FALSE or UNDEF
729 /* Not a binary clause, try to move our watch.
731 * Go over all literals and find one that is
735 * (TRUE is also ok, in that case the rule is fulfilled)
737 if (r->p /* we have a 'p' */
738 && r->p != other_watch /* which is not watched */
739 && !DECISIONMAP_FALSE(r->p)) /* and not FALSE */
743 else /* go find a 'd' to make 'true' */
746 we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
748 for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
750 if (p != other_watch /* which is not watched */
751 && !DECISIONMAP_FALSE(p)) /* and not FALSE */
759 * if we found some p that is UNDEF or TRUE, move
762 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
765 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, p));
767 POOL_DEBUG(SOLV_DEBUG_PROPAGATE," -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, -p));
783 watches[p] = r - solv->rules;
786 /* search failed, thus all unwatched literals are FALSE */
791 * unit clause found, set literal other_watch to TRUE
794 if (DECISIONMAP_FALSE(other_watch)) /* check if literal is FALSE */
795 return r; /* eek, a conflict! */
797 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
799 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " unit ");
800 solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
804 decisionmap[other_watch] = level; /* install! */
806 decisionmap[-other_watch] = -level; /* remove! */
808 queue_push(&solv->decisionq, other_watch);
809 queue_push(&solv->decisionq_why, r - solv->rules);
811 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
814 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to install %s\n", pool_solvid2str(pool, other_watch));
816 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to conflict %s\n", pool_solvid2str(pool, -other_watch));
819 } /* foreach rule involving 'pkg' */
821 } /* while we have non-decided decisions */
823 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate end-----\n");
825 return 0; /* all is well */
829 /********************************************************************/
832 /*-------------------------------------------------------------------
839 analyze(Solver *solv, int level, Rule *c, int *pr, int *dr, int *whyp)
841 Pool *pool = solv->pool;
845 Map seen; /* global? */
846 Id d, v, vv, *dp, why;
848 int num = 0, l1num = 0;
849 int learnt_why = solv->learnt_pool.count;
850 Id *decisionmap = solv->decisionmap;
852 queue_init_buffer(&r, r_buf, sizeof(r_buf)/sizeof(*r_buf));
854 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
855 map_init(&seen, pool->nsolvables);
856 idx = solv->decisionq.count;
859 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
860 solver_printruleclass(solv, SOLV_DEBUG_ANALYZE, c);
861 queue_push(&solv->learnt_pool, c - solv->rules);
862 d = c->d < 0 ? -c->d - 1 : c->d;
863 dp = d ? pool->whatprovidesdata + d : 0;
864 /* go through all literals of the rule */
876 if (DECISIONMAP_TRUE(v)) /* the one true literal */
879 if (MAPTST(&seen, vv))
881 l = solv->decisionmap[vv];
884 MAPSET(&seen, vv); /* mark that we also need to look at this literal */
886 l1num++; /* need to do this one in level1 pass */
888 num++; /* need to do this one as well */
891 queue_push(&r, v); /* not level1 or conflict level, add to new rule */
897 if (!num && !--l1num)
898 break; /* all level 1 literals done */
900 /* find the next literal to investigate */
901 /* (as num + l1num > 0, we know that we'll always find one) */
905 v = solv->decisionq.elements[--idx];
907 if (MAPTST(&seen, vv))
912 if (num && --num == 0)
914 *pr = -v; /* so that v doesn't get lost */
917 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
918 /* clear non-l1 bits from seen map */
919 for (i = 0; i < r.count; i++)
922 MAPCLR(&seen, v > 0 ? v : -v);
924 /* only level 1 marks left in seen map */
925 l1num++; /* as l1retry decrements it */
929 why = solv->decisionq_why.elements[idx];
930 if (why <= 0) /* just in case, maybe for SYSTEMSOLVABLE */
932 c = solv->rules + why;
938 else if (r.count == 1 && r.elements[0] < 0)
941 *dr = pool_queuetowhatprovides(pool, &r);
942 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
944 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
945 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, *pr);
946 for (i = 0; i < r.count; i++)
947 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, r.elements[i]);
949 /* push end marker on learnt reasons stack */
950 queue_push(&solv->learnt_pool, 0);
954 solv->stats_learned++;
959 /*-------------------------------------------------------------------
963 * reset all solver decisions
964 * called after rules have been enabled/disabled
968 solver_reset(Solver *solv)
970 Pool *pool = solv->pool;
974 /* rewind all decisions */
975 for (i = solv->decisionq.count - 1; i >= 0; i--)
977 v = solv->decisionq.elements[i];
978 solv->decisionmap[v > 0 ? v : -v] = 0;
980 queue_empty(&solv->decisionq_why);
981 queue_empty(&solv->decisionq);
982 solv->recommends_index = -1;
983 solv->propagate_index = 0;
984 solv->decisioncnt_update = solv->decisioncnt_keep = solv->decisioncnt_resolve = solv->decisioncnt_weak = solv->decisioncnt_orphan = 0;
985 queue_empty(&solv->branches);
987 /* adapt learnt rule status to new set of enabled/disabled rules */
988 enabledisablelearntrules(solv);
990 /* redo all assertion rule decisions */
991 makeruledecisions(solv);
992 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "decisions so far: %d\n", solv->decisionq.count);
996 /*-------------------------------------------------------------------
998 * analyze_unsolvable_rule
1000 * recursion helper used by analyze_unsolvable
1004 analyze_unsolvable_rule(Solver *solv, Rule *r, Id *lastweakp, Map *rseen)
1006 Pool *pool = solv->pool;
1008 Id why = r - solv->rules;
1010 IF_POOLDEBUG (SOLV_DEBUG_UNSOLVABLE)
1011 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
1012 if (solv->learntrules && why >= solv->learntrules)
1014 if (MAPTST(rseen, why - solv->learntrules))
1016 MAPSET(rseen, why - solv->learntrules);
1017 for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
1018 if (solv->learnt_pool.elements[i] > 0)
1019 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp, rseen);
1022 if (MAPTST(&solv->weakrulemap, why))
1023 if (!*lastweakp || why > *lastweakp)
1025 /* do not add rpm rules to problem */
1026 if (why < solv->rpmrules_end)
1028 /* turn rule into problem */
1029 if (why >= solv->jobrules && why < solv->jobrules_end)
1030 why = -(solv->ruletojob.elements[why - solv->jobrules] + 1);
1031 /* normalize dup/infarch rules */
1032 if (why > solv->infarchrules && why < solv->infarchrules_end)
1034 Id name = pool->solvables[-solv->rules[why].p].name;
1035 while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
1038 if (why > solv->duprules && why < solv->duprules_end)
1040 Id name = pool->solvables[-solv->rules[why].p].name;
1041 while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
1045 /* return if problem already countains our rule */
1046 if (solv->problems.count)
1048 for (i = solv->problems.count - 1; i >= 0; i--)
1049 if (solv->problems.elements[i] == 0) /* end of last problem reached? */
1051 else if (solv->problems.elements[i] == why)
1054 queue_push(&solv->problems, why);
1058 /*-------------------------------------------------------------------
1060 * analyze_unsolvable
1062 * We know that the problem is not solvable. Record all involved
1063 * rules (i.e. the "proof") into solv->learnt_pool.
1064 * Record the learnt pool index and all non-rpm rules into
1065 * solv->problems. (Our solutions to fix the problems are to
1066 * disable those rules.)
1068 * If the proof contains at least one weak rule, we disable the
1071 * Otherwise we return 0 if disablerules is not set or disable
1072 * _all_ of the problem rules and return 1.
1074 * return: 1 - disabled some rules, try again
1079 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
1081 Pool *pool = solv->pool;
1083 Map seen; /* global to speed things up? */
1085 Id d, v, vv, *dp, why;
1087 Id *decisionmap = solv->decisionmap;
1088 int oldproblemcount;
1089 int oldlearntpoolcount;
1091 int record_proof = 1;
1093 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
1094 solv->stats_unsolvable++;
1095 oldproblemcount = solv->problems.count;
1096 oldlearntpoolcount = solv->learnt_pool.count;
1098 /* make room for proof index */
1099 /* must update it later, as analyze_unsolvable_rule would confuse
1100 * it with a rule index if we put the real value in already */
1101 queue_push(&solv->problems, 0);
1104 map_init(&seen, pool->nsolvables);
1105 map_init(&rseen, solv->learntrules ? solv->nrules - solv->learntrules : 0);
1107 queue_push(&solv->learnt_pool, r - solv->rules);
1109 analyze_unsolvable_rule(solv, r, &lastweak, &rseen);
1110 d = r->d < 0 ? -r->d - 1 : r->d;
1111 dp = d ? pool->whatprovidesdata + d : 0;
1122 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1124 vv = v > 0 ? v : -v;
1125 l = solv->decisionmap[vv];
1130 idx = solv->decisionq.count;
1133 v = solv->decisionq.elements[--idx];
1134 vv = v > 0 ? v : -v;
1135 if (!MAPTST(&seen, vv))
1137 why = solv->decisionq_why.elements[idx];
1140 queue_push(&solv->learnt_pool, why);
1141 r = solv->rules + why;
1142 analyze_unsolvable_rule(solv, r, &lastweak, &rseen);
1143 d = r->d < 0 ? -r->d - 1 : r->d;
1144 dp = d ? pool->whatprovidesdata + d : 0;
1155 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1157 vv = v > 0 ? v : -v;
1158 l = solv->decisionmap[vv];
1166 queue_push(&solv->problems, 0); /* mark end of this problem */
1170 /* disable last weak rule */
1171 solv->problems.count = oldproblemcount;
1172 solv->learnt_pool.count = oldlearntpoolcount;
1173 if (lastweak >= solv->jobrules && lastweak < solv->jobrules_end)
1174 v = -(solv->ruletojob.elements[lastweak - solv->jobrules] + 1);
1177 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "disabling ");
1178 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + lastweak);
1179 if (lastweak >= solv->choicerules && lastweak < solv->choicerules_end)
1180 solver_disablechoicerules(solv, solv->rules + lastweak);
1181 solver_disableproblem(solv, v);
1183 solver_reenablepolicyrules(solv, -v);
1188 if (solv->allowuninstall && (v = autouninstall(solv, solv->problems.elements + oldproblemcount + 1)) != 0)
1190 solv->problems.count = oldproblemcount;
1191 solv->learnt_pool.count = oldlearntpoolcount;
1199 queue_push(&solv->learnt_pool, 0);
1200 solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
1203 /* + 2: index + trailing zero */
1204 if (disablerules && oldproblemcount + 2 < solv->problems.count)
1206 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
1207 solver_disableproblem(solv, solv->problems.elements[i]);
1208 /* XXX: might want to enable all weak rules again */
1212 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
1217 /********************************************************************/
1218 /* Decision revert */
1220 /*-------------------------------------------------------------------
1223 * revert decisionq to a level
1227 revert(Solver *solv, int level)
1229 Pool *pool = solv->pool;
1231 while (solv->decisionq.count)
1233 v = solv->decisionq.elements[solv->decisionq.count - 1];
1234 vv = v > 0 ? v : -v;
1235 if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
1237 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
1238 solv->decisionmap[vv] = 0;
1239 solv->decisionq.count--;
1240 solv->decisionq_why.count--;
1241 solv->propagate_index = solv->decisionq.count;
1243 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
1245 solv->branches.count--;
1246 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
1247 solv->branches.count--;
1249 solv->recommends_index = -1;
1250 if (solv->decisionq.count < solv->decisioncnt_update)
1251 solv->decisioncnt_update = 0;
1252 if (solv->decisionq.count < solv->decisioncnt_keep)
1253 solv->decisioncnt_keep = 0;
1254 if (solv->decisionq.count < solv->decisioncnt_resolve)
1255 solv->decisioncnt_resolve = 0;
1256 if (solv->decisionq.count < solv->decisioncnt_weak)
1257 solv->decisioncnt_weak= 0;
1258 if (solv->decisionq.count < solv->decisioncnt_orphan)
1259 solv->decisioncnt_orphan = 0;
1263 /*-------------------------------------------------------------------
1265 * watch2onhighest - put watch2 on literal with highest level
1269 watch2onhighest(Solver *solv, Rule *r)
1274 d = r->d < 0 ? -r->d - 1 : r->d;
1276 return; /* binary rule, both watches are set */
1277 dp = solv->pool->whatprovidesdata + d;
1278 while ((v = *dp++) != 0)
1280 l = solv->decisionmap[v < 0 ? -v : v];
1292 /*-------------------------------------------------------------------
1296 * add free decision (solvable to install) to decisionq
1297 * increase level and propagate decision
1298 * return if no conflict.
1300 * in conflict case, analyze conflict rule, add resulting
1301 * rule to learnt rule set, make decision from learnt
1302 * rule (always unit) and re-propagate.
1304 * returns the new solver level or 0 if unsolvable
1309 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules, Id ruleid)
1311 Pool *pool = solv->pool;
1316 assert(ruleid >= 0);
1321 solv->decisionmap[decision] = level;
1323 solv->decisionmap[-decision] = -level;
1324 queue_push(&solv->decisionq, decision);
1325 queue_push(&solv->decisionq_why, -ruleid); /* <= 0 -> free decision */
1329 r = propagate(solv, level);
1333 return analyze_unsolvable(solv, r, disablerules);
1334 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
1335 l = analyze(solv, level, r, &p, &d, &why); /* learnt rule in p and d */
1336 assert(l > 0 && l < level);
1337 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, l);
1339 revert(solv, level);
1340 r = solver_addrule(solv, p, d);
1342 assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
1343 queue_push(&solv->learnt_why, why);
1346 /* at least 2 literals, needs watches */
1347 watch2onhighest(solv, r);
1348 addwatches_rule(solv, r);
1352 /* learnt rule is an assertion */
1353 queue_push(&solv->ruleassertions, r - solv->rules);
1355 /* the new rule is unit by design */
1356 solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
1357 queue_push(&solv->decisionq, p);
1358 queue_push(&solv->decisionq_why, r - solv->rules);
1359 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
1361 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "decision: ");
1362 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, p);
1363 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "new rule: ");
1364 solver_printrule(solv, SOLV_DEBUG_ANALYZE, r);
1371 reorder_dq_for_jobrules(Solver *solv, int level, Queue *dq)
1373 Pool *pool = solv->pool;
1374 int i, j, haveone = 0, dqcount = dq->count;
1378 /* at the time we process jobrules the installed packages are not kept yet */
1379 /* reorder so that "future-supplemented" packages come first */
1380 FOR_REPO_SOLVABLES(solv->installed, p, s)
1382 if (MAPTST(&solv->noupdate, p - solv->installed->start))
1384 if (solv->decisionmap[p] == 0)
1386 solv->decisionmap[p] = level;
1392 for (i = 0; i < dqcount; i++)
1393 if (!solver_is_enhancing(solv, pool->solvables + dq->elements[i]))
1395 queue_push(dq, dq->elements[i]);
1396 dq->elements[i] = 0;
1398 dqcount = dq->count;
1399 for (i = 0; i < dqcount; i++)
1400 if (dq->elements[i] && !solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
1402 queue_push(dq, dq->elements[i]);
1403 dq->elements[i] = 0;
1405 for (i = j = 0; i < dq->count; i++)
1406 if (dq->elements[i])
1407 dq->elements[j++] = dq->elements[i];
1408 queue_truncate(dq, j);
1409 FOR_REPO_SOLVABLES(solv->installed, p, s)
1410 if (solv->decisionmap[p] == level)
1411 solv->decisionmap[p] = 0;
1414 /*-------------------------------------------------------------------
1416 * select and install
1418 * install best package from the queue. We add an extra package, inst, if
1419 * provided. See comment in weak install section.
1421 * returns the new solver level or 0 if unsolvable
1426 selectandinstall(Solver *solv, int level, Queue *dq, int disablerules, Id ruleid)
1428 Pool *pool = solv->pool;
1433 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1436 /* XXX: didn't we already do that? */
1437 /* XXX: shouldn't we prefer installed packages? */
1438 /* XXX: move to policy.c? */
1439 /* choose the supplemented one */
1440 for (i = 0; i < dq->count; i++)
1441 if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
1443 dq->elements[0] = dq->elements[i];
1448 if (dq->count > 1 && ruleid >= solv->jobrules && ruleid < solv->jobrules_end && solv->installed)
1449 reorder_dq_for_jobrules(solv, level, dq);
1452 /* multiple candidates, open a branch */
1453 for (i = 1; i < dq->count; i++)
1454 queue_push(&solv->branches, dq->elements[i]);
1455 queue_push(&solv->branches, -level);
1457 p = dq->elements[0];
1459 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing %s\n", pool_solvid2str(pool, p));
1461 return setpropagatelearn(solv, level, p, disablerules, ruleid);
1465 /********************************************************************/
1466 /* Main solver interface */
1469 /*-------------------------------------------------------------------
1472 * create solver structure
1474 * pool: all available solvables
1475 * installed: installed Solvables
1478 * Upon solving, rules are created to flag the Solvables
1479 * of the 'installed' Repo as installed.
1483 solver_create(Pool *pool)
1486 solv = (Solver *)solv_calloc(1, sizeof(Solver));
1488 solv->installed = pool->installed;
1490 solv->allownamechange = 1;
1492 solv->dup_allowdowngrade = 1;
1493 solv->dup_allownamechange = 1;
1494 solv->dup_allowarchchange = 1;
1495 solv->dup_allowvendorchange = 1;
1497 solv->keepexplicitobsoletes = pool->noobsoletesmultiversion ? 0 : 1;
1499 queue_init(&solv->ruletojob);
1500 queue_init(&solv->decisionq);
1501 queue_init(&solv->decisionq_why);
1502 queue_init(&solv->problems);
1503 queue_init(&solv->orphaned);
1504 queue_init(&solv->learnt_why);
1505 queue_init(&solv->learnt_pool);
1506 queue_init(&solv->branches);
1507 queue_init(&solv->weakruleq);
1508 queue_init(&solv->ruleassertions);
1509 queue_init(&solv->addedmap_deduceq);
1511 queue_push(&solv->learnt_pool, 0); /* so that 0 does not describe a proof */
1513 map_init(&solv->recommendsmap, pool->nsolvables);
1514 map_init(&solv->suggestsmap, pool->nsolvables);
1515 map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
1516 solv->recommends_index = 0;
1518 solv->decisionmap = (Id *)solv_calloc(pool->nsolvables, sizeof(Id));
1520 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
1521 memset(solv->rules, 0, sizeof(Rule));
1527 /*-------------------------------------------------------------------
1533 solver_free(Solver *solv)
1535 queue_free(&solv->job);
1536 queue_free(&solv->ruletojob);
1537 queue_free(&solv->decisionq);
1538 queue_free(&solv->decisionq_why);
1539 queue_free(&solv->learnt_why);
1540 queue_free(&solv->learnt_pool);
1541 queue_free(&solv->problems);
1542 queue_free(&solv->solutions);
1543 queue_free(&solv->orphaned);
1544 queue_free(&solv->branches);
1545 queue_free(&solv->weakruleq);
1546 queue_free(&solv->ruleassertions);
1547 queue_free(&solv->addedmap_deduceq);
1548 if (solv->cleandeps_updatepkgs)
1550 queue_free(solv->cleandeps_updatepkgs);
1551 solv->cleandeps_updatepkgs = solv_free(solv->cleandeps_updatepkgs);
1553 if (solv->cleandeps_mistakes)
1555 queue_free(solv->cleandeps_mistakes);
1556 solv->cleandeps_mistakes = solv_free(solv->cleandeps_mistakes);
1558 if (solv->update_targets)
1560 queue_free(solv->update_targets);
1561 solv->update_targets = solv_free(solv->update_targets);
1563 if (solv->installsuppdepq)
1565 queue_free(solv->installsuppdepq);
1566 solv->installsuppdepq = solv_free(solv->installsuppdepq);
1569 map_free(&solv->recommendsmap);
1570 map_free(&solv->suggestsmap);
1571 map_free(&solv->noupdate);
1572 map_free(&solv->weakrulemap);
1573 map_free(&solv->multiversion);
1575 map_free(&solv->updatemap);
1576 map_free(&solv->bestupdatemap);
1577 map_free(&solv->fixmap);
1578 map_free(&solv->dupmap);
1579 map_free(&solv->dupinvolvedmap);
1580 map_free(&solv->droporphanedmap);
1581 map_free(&solv->cleandepsmap);
1583 solv_free(solv->decisionmap);
1584 solv_free(solv->rules);
1585 solv_free(solv->watches);
1586 solv_free(solv->obsoletes);
1587 solv_free(solv->obsoletes_data);
1588 solv_free(solv->multiversionupdaters);
1589 solv_free(solv->choicerules_ref);
1590 solv_free(solv->bestrules_pkg);
1591 solv_free(solv->instbuddy);
1596 solver_get_flag(Solver *solv, int flag)
1600 case SOLVER_FLAG_ALLOW_DOWNGRADE:
1601 return solv->allowdowngrade;
1602 case SOLVER_FLAG_ALLOW_NAMECHANGE:
1603 return solv->allownamechange;
1604 case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1605 return solv->allowarchchange;
1606 case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1607 return solv->allowvendorchange;
1608 case SOLVER_FLAG_ALLOW_UNINSTALL:
1609 return solv->allowuninstall;
1610 case SOLVER_FLAG_NO_UPDATEPROVIDE:
1611 return solv->noupdateprovide;
1612 case SOLVER_FLAG_SPLITPROVIDES:
1613 return solv->dosplitprovides;
1614 case SOLVER_FLAG_IGNORE_RECOMMENDED:
1615 return solv->dontinstallrecommended;
1616 case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1617 return solv->addalreadyrecommended;
1618 case SOLVER_FLAG_NO_INFARCHCHECK:
1619 return solv->noinfarchcheck;
1620 case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1621 return solv->keepexplicitobsoletes;
1622 case SOLVER_FLAG_BEST_OBEY_POLICY:
1623 return solv->bestobeypolicy;
1624 case SOLVER_FLAG_NO_AUTOTARGET:
1625 return solv->noautotarget;
1633 solver_set_flag(Solver *solv, int flag, int value)
1635 int old = solver_get_flag(solv, flag);
1638 case SOLVER_FLAG_ALLOW_DOWNGRADE:
1639 solv->allowdowngrade = value;
1641 case SOLVER_FLAG_ALLOW_NAMECHANGE:
1642 solv->allownamechange = value;
1644 case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1645 solv->allowarchchange = value;
1647 case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1648 solv->allowvendorchange = value;
1650 case SOLVER_FLAG_ALLOW_UNINSTALL:
1651 solv->allowuninstall = value;
1653 case SOLVER_FLAG_NO_UPDATEPROVIDE:
1654 solv->noupdateprovide = value;
1656 case SOLVER_FLAG_SPLITPROVIDES:
1657 solv->dosplitprovides = value;
1659 case SOLVER_FLAG_IGNORE_RECOMMENDED:
1660 solv->dontinstallrecommended = value;
1662 case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1663 solv->addalreadyrecommended = value;
1665 case SOLVER_FLAG_NO_INFARCHCHECK:
1666 solv->noinfarchcheck = value;
1668 case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1669 solv->keepexplicitobsoletes = value;
1671 case SOLVER_FLAG_BEST_OBEY_POLICY:
1672 solv->bestobeypolicy = value;
1674 case SOLVER_FLAG_NO_AUTOTARGET:
1675 solv->noautotarget = value;
1684 cleandeps_check_mistakes(Solver *solv, int level)
1686 Pool *pool = solv->pool;
1690 int mademistake = 0;
1692 if (!solv->cleandepsmap.size)
1694 /* check for mistakes */
1695 for (i = solv->installed->start; i < solv->installed->end; i++)
1697 if (!MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1699 r = solv->rules + solv->featurerules + (i - solv->installed->start);
1700 /* a mistake is when the featurerule is true but the updaterule is false */
1703 FOR_RULELITERALS(p, pp, r)
1704 if (p > 0 && solv->decisionmap[p] > 0)
1707 continue; /* feature rule is not true */
1708 r = solv->rules + solv->updaterules + (i - solv->installed->start);
1711 FOR_RULELITERALS(p, pp, r)
1712 if (p > 0 && solv->decisionmap[p] > 0)
1715 continue; /* update rule is true */
1716 POOL_DEBUG(SOLV_DEBUG_SOLVER, "cleandeps mistake: ");
1717 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, r);
1718 POOL_DEBUG(SOLV_DEBUG_SOLVER, "feature rule: ");
1719 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, solv->rules + solv->featurerules + (i - solv->installed->start));
1720 if (!solv->cleandeps_mistakes)
1722 solv->cleandeps_mistakes = solv_calloc(1, sizeof(Queue));
1723 queue_init(solv->cleandeps_mistakes);
1725 queue_push(solv->cleandeps_mistakes, i);
1726 MAPCLR(&solv->cleandepsmap, i - solv->installed->start);
1727 solver_reenablepolicyrules_cleandeps(solv, i);
1736 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
1740 for (i = j = 0; i < q->count; i++)
1743 for (cp2 = cp; *cp2; cp2++)
1746 q->elements[j++] = p;
1750 queue_truncate(q, j);
1753 /*-------------------------------------------------------------------
1757 * all rules have been set up, now actually run the solver
1762 solver_run_sat(Solver *solv, int disablerules, int doweak)
1764 Queue dq; /* local decisionqueue */
1765 Queue dqs; /* local decisionqueue for supplements */
1771 Pool *pool = solv->pool;
1773 int minimizationsteps;
1774 int installedpos = solv->installed ? solv->installed->start : 0;
1776 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
1778 POOL_DEBUG (SOLV_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
1779 for (i = 1; i < solv->nrules; i++)
1780 solver_printruleclass(solv, SOLV_DEBUG_RULE_CREATION, solv->rules + i);
1783 POOL_DEBUG(SOLV_DEBUG_SOLVER, "initial decisions: %d\n", solv->decisionq.count);
1785 /* start SAT algorithm */
1787 systemlevel = level + 1;
1788 POOL_DEBUG(SOLV_DEBUG_SOLVER, "solving...\n");
1794 * here's the main loop:
1795 * 1) propagate new decisions (only needed once)
1797 * 3) try to keep installed packages
1798 * 4) fulfill all unresolved rules
1799 * 5) install recommended packages
1800 * 6) minimalize solution if we had choices
1801 * if we encounter a problem, we rewind to a safe level and restart
1805 minimizationsteps = 0;
1809 * initial propagation of the assertions
1813 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagating (propagate_index: %d; size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
1814 if ((r = propagate(solv, level)) != 0)
1816 if (analyze_unsolvable(solv, r, disablerules))
1819 break; /* unsolvable */
1824 * resolve jobs first
1826 if (level < systemlevel)
1828 POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving job rules\n");
1829 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
1832 if (r->d < 0) /* ignore disabled rules */
1835 FOR_RULELITERALS(l, pp, r)
1839 if (solv->decisionmap[-l] <= 0)
1844 if (solv->decisionmap[l] > 0)
1846 if (solv->decisionmap[l] == 0)
1852 /* prune to installed if not updating */
1853 if (dq.count > 1 && solv->installed && !solv->updatemap_all &&
1854 !(solv->job.elements[solv->ruletojob.elements[i - solv->jobrules]] & SOLVER_ORUPDATE))
1857 for (j = k = 0; j < dq.count; j++)
1859 Solvable *s = pool->solvables + dq.elements[j];
1860 if (s->repo == solv->installed)
1862 dq.elements[k++] = dq.elements[j];
1863 if (solv->updatemap.size && MAPTST(&solv->updatemap, dq.elements[j] - solv->installed->start))
1865 k = 0; /* package wants to be updated, do not prune */
1874 level = selectandinstall(solv, level, &dq, disablerules, i);
1877 if (level <= olevel)
1881 break; /* unsolvable */
1882 systemlevel = level + 1;
1883 if (i < solv->jobrules_end)
1885 if (!solv->decisioncnt_update)
1886 solv->decisioncnt_update = solv->decisionq.count;
1890 * installed packages
1892 if (level < systemlevel && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
1894 Repo *installed = solv->installed;
1897 POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving installed packages\n");
1898 /* we use two passes if we need to update packages
1899 * to create a better user experience */
1900 for (pass = solv->updatemap.size ? 0 : 1; pass < 2; pass++)
1902 int passlevel = level;
1903 Id *multiversionupdaters = solv->multiversion.size ? solv->multiversionupdaters : 0;
1904 if (pass == 1 && !solv->decisioncnt_keep)
1905 solv->decisioncnt_keep = solv->decisionq.count;
1906 /* start with installedpos, the position that gave us problems the last time */
1907 for (i = installedpos, n = installed->start; n < installed->end; i++, n++)
1912 if (i == installed->end)
1913 i = installed->start;
1914 s = pool->solvables + i;
1915 if (s->repo != installed)
1918 if (solv->decisionmap[i] > 0 && (!multiversionupdaters || !multiversionupdaters[i - installed->start]))
1919 continue; /* already decided */
1920 if (!pass && solv->updatemap.size && !MAPTST(&solv->updatemap, i - installed->start))
1921 continue; /* updates first */
1922 r = solv->rules + solv->updaterules + (i - installed->start);
1924 if (!rr->p || rr->d < 0) /* disabled -> look at feature rule */
1925 rr -= solv->installed->end - solv->installed->start;
1926 if (!rr->p) /* identical to update rule? */
1929 continue; /* orpaned package */
1931 /* check if we should update this package to the latest version
1932 * noupdate is set for erase jobs, in that case we want to deinstall
1933 * the installed package and not replace it with a newer version */
1935 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))
1937 if (multiversionupdaters && (d = multiversionupdaters[i - installed->start]) != 0)
1939 /* special multiversion handling, make sure best version is chosen */
1940 if (rr->p == i && solv->decisionmap[i] >= 0)
1942 while ((p = pool->whatprovidesdata[d++]) != 0)
1943 if (solv->decisionmap[p] >= 0)
1945 if (dq.count && solv->update_targets && solv->update_targets->elements[i - installed->start])
1946 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], &dq);
1949 policy_filter_unwanted(solv, &dq, POLICY_MODE_CHOOSE);
1951 if (p != i && solv->decisionmap[p] == 0)
1953 rr = solv->rules + solv->featurerules + (i - solv->installed->start);
1954 if (!rr->p) /* update rule == feature rule? */
1955 rr = rr - solv->featurerules + solv->updaterules;
1964 /* update to best package of the update rule */
1965 FOR_RULELITERALS(p, pp, rr)
1967 if (solv->decisionmap[p] > 0)
1969 dq.count = 0; /* already fulfilled */
1972 if (!solv->decisionmap[p])
1977 if (dq.count && solv->update_targets && solv->update_targets->elements[i - installed->start])
1978 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], &dq);
1979 /* install best version */
1983 level = selectandinstall(solv, level, &dq, disablerules, rr - solv->rules);
1990 if (level <= olevel)
1992 if (level == 1 || level < passlevel)
1993 break; /* trouble */
1995 n = installed->start; /* redo all */
2001 /* if still undecided keep package */
2002 if (solv->decisionmap[i] == 0)
2005 if (solv->cleandepsmap.size && MAPTST(&solv->cleandepsmap, i - installed->start))
2008 POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, i));
2009 level = setpropagatelearn(solv, level, -i, disablerules, 0);
2016 POOL_DEBUG(SOLV_DEBUG_POLICY, "keeping %s\n", pool_solvid2str(pool, i));
2017 level = setpropagatelearn(solv, level, i, disablerules, r - solv->rules);
2021 if (level <= olevel)
2023 if (level == 1 || level < passlevel)
2024 break; /* trouble */
2026 n = installed->start; /* redo all */
2029 continue; /* retry with learnt rule */
2033 if (n < installed->end)
2035 installedpos = i; /* retry problem solvable next time */
2036 break; /* ran into trouble */
2038 installedpos = installed->start; /* reset installedpos */
2041 break; /* unsolvable */
2042 systemlevel = level + 1;
2044 continue; /* had trouble, retry */
2046 if (!solv->decisioncnt_keep)
2047 solv->decisioncnt_keep = solv->decisionq.count;
2049 if (level < systemlevel)
2050 systemlevel = level;
2055 if (!solv->decisioncnt_resolve)
2056 solv->decisioncnt_resolve = solv->decisionq.count;
2057 POOL_DEBUG(SOLV_DEBUG_POLICY, "deciding unresolved rules\n");
2058 for (i = 1, n = 1; n < solv->nrules; i++, n++)
2060 if (i == solv->nrules)
2062 r = solv->rules + i;
2063 if (r->d < 0) /* ignore disabled rules */
2068 /* binary or unary rule */
2069 /* need two positive undecided literals */
2070 if (r->p < 0 || r->w2 <= 0)
2072 if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
2074 queue_push(&dq, r->p);
2075 queue_push(&dq, r->w2);
2080 * all negative literals are installed
2081 * no positive literal is installed
2082 * i.e. the rule is not fulfilled and we
2083 * just need to decide on the positive literals
2087 if (solv->decisionmap[-r->p] <= 0)
2092 if (solv->decisionmap[r->p] > 0)
2094 if (solv->decisionmap[r->p] == 0)
2095 queue_push(&dq, r->p);
2097 dp = pool->whatprovidesdata + r->d;
2098 while ((p = *dp++) != 0)
2102 if (solv->decisionmap[-p] <= 0)
2107 if (solv->decisionmap[p] > 0)
2109 if (solv->decisionmap[p] == 0)
2116 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
2118 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "unfulfilled ");
2119 solver_printruleclass(solv, SOLV_DEBUG_PROPAGATE, r);
2121 /* dq.count < 2 cannot happen as this means that
2122 * the rule is unit */
2123 assert(dq.count > 1);
2125 /* prune to cleandeps packages */
2126 if (solv->cleandepsmap.size && solv->installed)
2128 Repo *installed = solv->installed;
2129 for (j = 0; j < dq.count; j++)
2130 if (pool->solvables[dq.elements[j]].repo == installed && MAPTST(&solv->cleandepsmap, dq.elements[j] - installed->start))
2134 dq.elements[0] = dq.elements[j];
2135 queue_truncate(&dq, 1);
2140 level = selectandinstall(solv, level, &dq, disablerules, r - solv->rules);
2142 break; /* unsolvable */
2143 if (level < systemlevel || level == 1)
2144 break; /* trouble */
2145 /* something changed, so look at all rules again */
2149 if (n != solv->nrules) /* ran into trouble? */
2152 break; /* unsolvable */
2153 continue; /* start over */
2156 /* at this point we have a consistent system. now do the extras... */
2158 /* first decide leftover cleandeps packages */
2159 if (solv->cleandepsmap.size && solv->installed)
2161 for (p = solv->installed->start; p < solv->installed->end; p++)
2163 s = pool->solvables + p;
2164 if (s->repo != solv->installed)
2166 if (solv->decisionmap[p] == 0 && MAPTST(&solv->cleandepsmap, p - solv->installed->start))
2168 POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, p));
2170 level = setpropagatelearn(solv, level, -p, 0, 0);
2175 if (p < solv->installed->end)
2179 if (!solv->decisioncnt_weak)
2180 solv->decisioncnt_weak = solv->decisionq.count;
2185 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended packages\n");
2186 queue_empty(&dq); /* recommended packages */
2187 queue_empty(&dqs); /* supplemented packages */
2188 for (i = 1; i < pool->nsolvables; i++)
2190 if (solv->decisionmap[i] < 0)
2192 if (solv->decisionmap[i] > 0)
2194 /* installed, check for recommends */
2195 Id *recp, rec, pp, p;
2196 s = pool->solvables + i;
2197 if (!solv->addalreadyrecommended && s->repo == solv->installed)
2199 /* XXX need to special case AND ? */
2202 recp = s->repo->idarraydata + s->recommends;
2203 while ((rec = *recp++) != 0)
2206 FOR_PROVIDES(p, pp, rec)
2208 if (solv->decisionmap[p] > 0)
2213 else if (solv->decisionmap[p] == 0)
2215 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))))
2217 queue_pushunique(&dq, p);
2225 s = pool->solvables + i;
2226 if (!s->supplements)
2228 if (!pool_installable(pool, s))
2230 if (!solver_is_supplementing(solv, s))
2232 if (solv->dupmap_all && solv->installed && s->repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, i - solv->installed->start))))
2234 queue_push(&dqs, i);
2238 /* filter out all packages obsoleted by installed packages */
2239 /* this is no longer needed if we have reverse obsoletes */
2240 if ((dqs.count || dq.count) && solv->installed)
2243 Id obs, *obsp, po, ppo;
2245 map_init(&obsmap, pool->nsolvables);
2246 for (p = solv->installed->start; p < solv->installed->end; p++)
2248 s = pool->solvables + p;
2249 if (s->repo != solv->installed || !s->obsoletes)
2251 if (solv->decisionmap[p] <= 0)
2253 if (solv->multiversion.size && MAPTST(&solv->multiversion, p))
2255 obsp = s->repo->idarraydata + s->obsoletes;
2256 /* foreach obsoletes */
2257 while ((obs = *obsp++) != 0)
2258 FOR_PROVIDES(po, ppo, obs)
2259 MAPSET(&obsmap, po);
2261 for (i = j = 0; i < dqs.count; i++)
2262 if (!MAPTST(&obsmap, dqs.elements[i]))
2263 dqs.elements[j++] = dqs.elements[i];
2265 for (i = j = 0; i < dq.count; i++)
2266 if (!MAPTST(&obsmap, dq.elements[i]))
2267 dq.elements[j++] = dq.elements[i];
2272 /* filter out all already supplemented packages if requested */
2273 if (!solv->addalreadyrecommended && dqs.count)
2275 int dosplitprovides_old = solv->dosplitprovides;
2276 /* turn off all new packages */
2277 for (i = 0; i < solv->decisionq.count; i++)
2279 p = solv->decisionq.elements[i];
2282 s = pool->solvables + p;
2283 if (s->repo && s->repo != solv->installed)
2284 solv->decisionmap[p] = -solv->decisionmap[p];
2286 solv->dosplitprovides = 0;
2287 /* filter out old supplements */
2288 for (i = j = 0; i < dqs.count; i++)
2290 p = dqs.elements[i];
2291 s = pool->solvables + p;
2292 if (!s->supplements)
2294 if (!solver_is_supplementing(solv, s))
2295 dqs.elements[j++] = p;
2296 else if (solv->installsuppdepq && solver_check_installsuppdepq(solv, s))
2297 dqs.elements[j++] = p;
2300 /* undo turning off */
2301 for (i = 0; i < solv->decisionq.count; i++)
2303 p = solv->decisionq.elements[i];
2306 s = pool->solvables + p;
2307 if (s->repo && s->repo != solv->installed)
2308 solv->decisionmap[p] = -solv->decisionmap[p];
2310 solv->dosplitprovides = dosplitprovides_old;
2313 /* multiversion doesn't mix well with supplements.
2314 * filter supplemented packages where we already decided
2315 * to install a different version (see bnc#501088) */
2316 if (dqs.count && solv->multiversion.size)
2318 for (i = j = 0; i < dqs.count; i++)
2320 p = dqs.elements[i];
2321 if (MAPTST(&solv->multiversion, p))
2324 s = pool->solvables + p;
2325 FOR_PROVIDES(p2, pp2, s->name)
2326 if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name)
2329 continue; /* ignore this package */
2331 dqs.elements[j++] = p;
2336 /* make dq contain both recommended and supplemented pkgs */
2339 for (i = 0; i < dqs.count; i++)
2340 queue_pushunique(&dq, dqs.elements[i]);
2346 int decisioncount = solv->decisionq.count;
2350 /* simple case, just one package. no need to choose to best version */
2353 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2355 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2356 level = setpropagatelearn(solv, level, p, 0, 0);
2359 continue; /* back to main loop */
2362 /* filter packages, this gives us the best versions */
2363 policy_filter_unwanted(solv, &dq, POLICY_MODE_RECOMMEND);
2365 /* create map of result */
2366 map_init(&dqmap, pool->nsolvables);
2367 for (i = 0; i < dq.count; i++)
2368 MAPSET(&dqmap, dq.elements[i]);
2370 /* install all supplemented packages */
2371 for (i = 0; i < dqs.count; i++)
2373 p = dqs.elements[i];
2374 if (solv->decisionmap[p] || !MAPTST(&dqmap, p))
2376 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2378 level = setpropagatelearn(solv, level, p, 0, 0);
2379 if (level <= olevel)
2382 if (i < dqs.count || solv->decisionq.count < decisioncount)
2390 /* install all recommended packages */
2391 /* more work as we want to created branches if multiple
2392 * choices are valid */
2393 for (i = 0; i < decisioncount; i++)
2396 p = solv->decisionq.elements[i];
2399 s = pool->solvables + p;
2400 if (!s->repo || (!solv->addalreadyrecommended && s->repo == solv->installed))
2404 recp = s->repo->idarraydata + s->recommends;
2405 while ((rec = *recp++) != 0)
2408 FOR_PROVIDES(p, pp, rec)
2410 if (solv->decisionmap[p] > 0)
2415 else if (solv->decisionmap[p] == 0 && MAPTST(&dqmap, p))
2416 queue_pushunique(&dq, p);
2422 /* multiple candidates, open a branch */
2423 for (i = 1; i < dq.count; i++)
2424 queue_push(&solv->branches, dq.elements[i]);
2425 queue_push(&solv->branches, -level);
2428 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2430 level = setpropagatelearn(solv, level, p, 0, 0);
2431 if (level <= olevel || solv->decisionq.count < decisioncount)
2432 break; /* we had to revert some decisions */
2435 break; /* had a problem above, quit loop */
2440 continue; /* back to main loop so that all deps are checked */
2444 if (!solv->decisioncnt_orphan)
2445 solv->decisioncnt_orphan = solv->decisionq.count;
2446 if (solv->dupmap_all && solv->installed)
2448 int installedone = 0;
2450 /* let's see if we can install some unsupported package */
2451 POOL_DEBUG(SOLV_DEBUG_SOLVER, "deciding orphaned packages\n");
2452 for (i = 0; i < solv->orphaned.count; i++)
2454 p = solv->orphaned.elements[i];
2455 if (solv->decisionmap[p])
2456 continue; /* already decided */
2457 if (solv->droporphanedmap_all)
2459 if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))
2461 POOL_DEBUG(SOLV_DEBUG_SOLVER, "keeping orphaned %s\n", pool_solvid2str(pool, p));
2463 level = setpropagatelearn(solv, level, p, 0, 0);
2468 if (installedone || i < solv->orphaned.count)
2472 continue; /* back to main loop */
2474 for (i = 0; i < solv->orphaned.count; i++)
2476 p = solv->orphaned.elements[i];
2477 if (solv->decisionmap[p])
2478 continue; /* already decided */
2479 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing orphaned %s\n", pool_solvid2str(pool, p));
2481 level = setpropagatelearn(solv, level, -p, 0, 0);
2485 if (i < solv->orphaned.count)
2489 continue; /* back to main loop */
2493 if (solv->installed && solv->cleandepsmap.size)
2495 if (cleandeps_check_mistakes(solv, level))
2497 level = 1; /* restart from scratch */
2498 systemlevel = level + 1;
2503 if (solv->solution_callback)
2505 solv->solution_callback(solv, solv->solution_callback_data);
2506 if (solv->branches.count)
2508 int i = solv->branches.count - 1;
2509 int l = -solv->branches.elements[i];
2513 if (solv->branches.elements[i - 1] < 0)
2515 p = solv->branches.elements[i];
2516 POOL_DEBUG(SOLV_DEBUG_SOLVER, "branching with %s\n", pool_solvid2str(pool, p));
2518 for (j = i + 1; j < solv->branches.count; j++)
2519 queue_push(&dq, solv->branches.elements[j]);
2520 solv->branches.count = i;
2522 revert(solv, level);
2524 for (j = 0; j < dq.count; j++)
2525 queue_push(&solv->branches, dq.elements[j]);
2527 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2529 level = setpropagatelearn(solv, level, p, disablerules, why);
2534 /* all branches done, we're finally finished */
2538 /* auto-minimization step */
2539 if (solv->branches.count)
2541 int l = 0, lasti = -1, lastl = -1;
2545 for (i = solv->branches.count - 1; i >= 0; i--)
2547 p = solv->branches.elements[i];
2550 else if (p > 0 && solv->decisionmap[p] > l + 1)
2558 /* kill old solvable so that we do not loop */
2559 p = solv->branches.elements[lasti];
2560 solv->branches.elements[lasti] = 0;
2561 POOL_DEBUG(SOLV_DEBUG_SOLVER, "minimizing %d -> %d with %s\n", solv->decisionmap[p], lastl, pool_solvid2str(pool, p));
2562 minimizationsteps++;
2565 revert(solv, level);
2566 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2569 level = setpropagatelearn(solv, level, p, disablerules, why);
2572 continue; /* back to main loop */
2575 /* no minimization found, we're finally finished! */
2579 POOL_DEBUG(SOLV_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable, %d minimization steps\n", solv->stats_learned, solv->stats_unsolvable, minimizationsteps);
2581 POOL_DEBUG(SOLV_DEBUG_STATS, "done solving.\n\n");
2587 solv->decisioncnt_update = solv->decisionq.count;
2588 solv->decisioncnt_keep = solv->decisionq.count;
2589 solv->decisioncnt_resolve = solv->decisionq.count;
2590 solv->decisioncnt_weak = solv->decisionq.count;
2591 solv->decisioncnt_orphan = solv->decisionq.count;
2594 solver_printdecisionq(solv, SOLV_DEBUG_RESULT);
2599 /*-------------------------------------------------------------------
2601 * remove disabled conflicts
2603 * purpose: update the decisionmap after some rules were disabled.
2604 * this is used to calculate the suggested/recommended package list.
2605 * Also returns a "removed" list to undo the discisionmap changes.
2609 removedisabledconflicts(Solver *solv, Queue *removed)
2611 Pool *pool = solv->pool;
2616 Id *decisionmap = solv->decisionmap;
2618 queue_empty(removed);
2619 for (i = 0; i < solv->decisionq.count; i++)
2621 p = solv->decisionq.elements[i];
2623 continue; /* conflicts only, please */
2624 why = solv->decisionq_why.elements[i];
2627 /* no rule involved, must be a orphan package drop */
2630 /* we never do conflicts on free decisions, so there
2631 * must have been an unit rule */
2633 r = solv->rules + why;
2634 if (r->d < 0 && decisionmap[-p])
2636 /* rule is now disabled, remove from decisionmap */
2637 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing conflict for package %s[%d]\n", pool_solvid2str(pool, -p), -p);
2638 queue_push(removed, -p);
2639 queue_push(removed, decisionmap[-p]);
2640 decisionmap[-p] = 0;
2643 if (!removed->count)
2645 /* we removed some confliced packages. some of them might still
2646 * be in conflict, so search for unit rules and re-conflict */
2648 for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
2650 if (i == solv->nrules)
2653 r = solv->rules + i;
2659 if (r->p < 0 && !decisionmap[-r->p])
2665 if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
2667 else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
2672 if (r->p < 0 && decisionmap[-r->p] == 0)
2674 if (new || DECISIONMAP_FALSE(r->p))
2676 dp = pool->whatprovidesdata + r->d;
2677 while ((p = *dp++) != 0)
2679 if (new && p == new)
2681 if (p < 0 && decisionmap[-p] == 0)
2690 else if (!DECISIONMAP_FALSE(p))
2700 POOL_DEBUG(SOLV_DEBUG_SOLVER, "re-conflicting package %s[%d]\n", pool_solvid2str(pool, -new), -new);
2701 decisionmap[-new] = -1;
2703 n = 0; /* redo all rules */
2709 undo_removedisabledconflicts(Solver *solv, Queue *removed)
2712 for (i = 0; i < removed->count; i += 2)
2713 solv->decisionmap[removed->elements[i]] = removed->elements[i + 1];
2717 /*-------------------------------------------------------------------
2719 * weaken solvable dependencies
2723 weaken_solvable_deps(Solver *solv, Id p)
2728 for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++)
2732 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2733 continue; /* conflict */
2734 queue_push(&solv->weakruleq, i);
2739 /********************************************************************/
2744 solver_calculate_multiversionmap(Pool *pool, Queue *job, Map *multiversionmap)
2747 Id how, what, select;
2749 for (i = 0; i < job->count; i += 2)
2751 how = job->elements[i];
2752 if ((how & SOLVER_JOBMASK) != SOLVER_MULTIVERSION)
2754 what = job->elements[i + 1];
2755 select = how & SOLVER_SELECTMASK;
2756 if (!multiversionmap->size)
2757 map_grow(multiversionmap, pool->nsolvables);
2758 if (select == SOLVER_SOLVABLE_ALL)
2760 FOR_POOL_SOLVABLES(p)
2761 MAPSET(multiversionmap, p);
2763 else if (select == SOLVER_SOLVABLE_REPO)
2766 Repo *repo = pool_id2repo(pool, what);
2768 FOR_REPO_SOLVABLES(repo, p, s)
2769 MAPSET(multiversionmap, p);
2771 FOR_JOB_SELECT(p, pp, select, what)
2772 MAPSET(multiversionmap, p);
2777 solver_calculate_noobsmap(Pool *pool, Queue *job, Map *multiversionmap)
2779 solver_calculate_multiversionmap(pool, job, multiversionmap);
2783 * add a rule created by a job, record job number and weak flag
2786 solver_addjobrule(Solver *solv, Id p, Id d, Id job, int weak)
2788 solver_addrule(solv, p, d);
2789 queue_push(&solv->ruletojob, job);
2791 queue_push(&solv->weakruleq, solv->nrules - 1);
2795 add_cleandeps_package(Solver *solv, Id p)
2797 if (!solv->cleandeps_updatepkgs)
2799 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
2800 queue_init(solv->cleandeps_updatepkgs);
2802 queue_pushunique(solv->cleandeps_updatepkgs, p);
2806 add_update_target(Solver *solv, Id p, Id how)
2808 Pool *pool = solv->pool;
2809 Solvable *s = pool->solvables + p;
2810 Repo *installed = solv->installed;
2812 if (!solv->update_targets)
2814 solv->update_targets = solv_calloc(1, sizeof(Queue));
2815 queue_init(solv->update_targets);
2817 if (s->repo == installed)
2819 queue_push2(solv->update_targets, p, p);
2822 FOR_PROVIDES(pi, pip, s->name)
2824 Solvable *si = pool->solvables + pi;
2825 if (si->repo != installed || si->name != s->name)
2827 if (how & SOLVER_FORCEBEST)
2829 if (!solv->bestupdatemap.size)
2830 map_grow(&solv->bestupdatemap, installed->end - installed->start);
2831 MAPSET(&solv->bestupdatemap, pi - installed->start);
2833 if (how & SOLVER_CLEANDEPS)
2834 add_cleandeps_package(solv, pi);
2835 queue_push2(solv->update_targets, pi, p);
2836 /* check if it's ok to keep the installed package */
2837 if (s->evr == si->evr && solvable_identical(s, si))
2838 queue_push2(solv->update_targets, pi, pi);
2842 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2843 while ((obs = *obsp++) != 0)
2845 FOR_PROVIDES(pi, pip, obs)
2847 Solvable *si = pool->solvables + pi;
2848 if (si->repo != installed)
2850 if (si->name == s->name)
2851 continue; /* already handled above */
2852 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
2854 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
2856 if (how & SOLVER_FORCEBEST)
2858 if (!solv->bestupdatemap.size)
2859 map_grow(&solv->bestupdatemap, installed->end - installed->start);
2860 MAPSET(&solv->bestupdatemap, pi - installed->start);
2862 if (how & SOLVER_CLEANDEPS)
2863 add_cleandeps_package(solv, pi);
2864 queue_push2(solv->update_targets, pi, p);
2871 transform_update_targets_sortfn(const void *ap, const void *bp, void *dp)
2881 transform_update_targets(Solver *solv)
2883 Repo *installed = solv->installed;
2884 Queue *update_targets = solv->update_targets;
2886 Id p, q, lastp, lastq;
2888 if (!update_targets->count)
2890 queue_free(update_targets);
2891 solv->update_targets = solv_free(update_targets);
2894 if (update_targets->count > 2)
2895 solv_sort(update_targets->elements, update_targets->count >> 1, 2 * sizeof(Id), transform_update_targets_sortfn, solv);
2896 queue_insertn(update_targets, 0, installed->end - installed->start, 0);
2898 for (i = j = installed->end - installed->start; i < update_targets->count; i += 2)
2900 if ((p = update_targets->elements[i]) != lastp)
2902 if (!solv->updatemap.size)
2903 map_grow(&solv->updatemap, installed->end - installed->start);
2904 MAPSET(&solv->updatemap, p - installed->start);
2905 update_targets->elements[j++] = 0; /* finish old set */
2906 update_targets->elements[p - installed->start] = j; /* start new set */
2910 if ((q = update_targets->elements[i + 1]) != lastq)
2912 update_targets->elements[j++] = q;
2916 queue_truncate(update_targets, j);
2917 queue_push(update_targets, 0); /* finish last set */
2922 addedmap2deduceq(Solver *solv, Map *addedmap)
2924 Pool *pool = solv->pool;
2929 queue_empty(&solv->addedmap_deduceq);
2930 for (i = 2, j = solv->rpmrules_end - 1; i < pool->nsolvables && j > 0; j--)
2932 r = solv->rules + j;
2935 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2938 if (!MAPTST(addedmap, p))
2940 /* should never happen, but... */
2941 if (!solv->addedmap_deduceq.count || solv->addedmap_deduceq.elements[solv->addedmap_deduceq.count - 1] != -p)
2942 queue_push(&solv->addedmap_deduceq, -p);
2946 if (MAPTST(addedmap, i))
2947 queue_push(&solv->addedmap_deduceq, i);
2951 for (; i < pool->nsolvables; i++)
2952 if (MAPTST(addedmap, i))
2953 queue_push(&solv->addedmap_deduceq, i);
2955 for (i = 2; i < pool->nsolvables; i++)
2956 if (MAPTST(addedmap, i))
2961 deduceq2addedmap(Solver *solv, Map *addedmap)
2966 for (j = solv->rpmrules_end - 1; j > 0; j--)
2968 r = solv->rules + j;
2969 if (r->d < 0 && r->p)
2970 solver_enablerule(solv, r);
2973 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2976 MAPSET(addedmap, p);
2978 for (j = 0; j < solv->addedmap_deduceq.count; j++)
2980 p = solv->addedmap_deduceq.elements[j];
2982 MAPSET(addedmap, p);
2984 MAPCLR(addedmap, p);
2996 solver_solve(Solver *solv, Queue *job)
2998 Pool *pool = solv->pool;
2999 Repo *installed = solv->installed;
3001 int oldnrules, initialnrules;
3002 Map addedmap; /* '1' == have rpm-rules for solvable */
3003 Map installcandidatemap;
3004 Id how, what, select, name, weak, p, pp, d;
3008 int now, solve_start;
3010 int hasbestinstalljob = 0;
3012 solve_start = solv_timems(0);
3014 /* log solver options */
3015 POOL_DEBUG(SOLV_DEBUG_STATS, "solver started\n");
3016 POOL_DEBUG(SOLV_DEBUG_STATS, "dosplitprovides=%d, noupdateprovide=%d, noinfarchcheck=%d\n", solv->dosplitprovides, solv->noupdateprovide, solv->noinfarchcheck);
3017 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);
3018 POOL_DEBUG(SOLV_DEBUG_STATS, "promoteepoch=%d, forbidselfconflicts=%d\n", pool->promoteepoch, pool->forbidselfconflicts);
3019 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d, obsoleteusescolors=%d, implicitobsoleteusescolors=%d\n", pool->obsoleteusesprovides, pool->implicitobsoleteusesprovides, pool->obsoleteusescolors, pool->implicitobsoleteusescolors);
3020 POOL_DEBUG(SOLV_DEBUG_STATS, "dontinstallrecommended=%d, addalreadyrecommended=%d\n", solv->dontinstallrecommended, solv->addalreadyrecommended);
3022 /* create whatprovides if not already there */
3023 if (!pool->whatprovides)
3024 pool_createwhatprovides(pool);
3026 /* create obsolete index */
3027 policy_create_obsolete_index(solv);
3030 queue_free(&solv->job);
3031 queue_init_clone(&solv->job, job);
3032 solv->pooljobcnt = pool->pooljobs.count;
3033 if (pool->pooljobs.count)
3034 queue_insertn(&solv->job, 0, pool->pooljobs.count, pool->pooljobs.elements);
3037 /* free old stuff */
3038 if (solv->update_targets)
3040 queue_free(solv->update_targets);
3041 solv->update_targets = solv_free(solv->update_targets);
3043 if (solv->cleandeps_updatepkgs)
3045 queue_free(solv->cleandeps_updatepkgs);
3046 solv->cleandeps_updatepkgs = solv_free(solv->cleandeps_updatepkgs);
3048 queue_empty(&solv->ruleassertions);
3049 solv->bestrules_pkg = solv_free(solv->bestrules_pkg);
3050 solv->choicerules_ref = solv_free(solv->choicerules_ref);
3051 if (solv->noupdate.size)
3052 map_empty(&solv->noupdate);
3053 if (solv->multiversion.size)
3055 map_free(&solv->multiversion);
3056 map_init(&solv->multiversion, 0);
3058 solv->updatemap_all = 0;
3059 if (solv->updatemap.size)
3061 map_free(&solv->updatemap);
3062 map_init(&solv->updatemap, 0);
3064 solv->bestupdatemap_all = 0;
3065 if (solv->bestupdatemap.size)
3067 map_free(&solv->bestupdatemap);
3068 map_init(&solv->bestupdatemap, 0);
3070 solv->fixmap_all = 0;
3071 if (solv->fixmap.size)
3073 map_free(&solv->fixmap);
3074 map_init(&solv->fixmap, 0);
3076 solv->dupmap_all = 0;
3077 if (solv->dupmap.size)
3079 map_free(&solv->dupmap);
3080 map_init(&solv->dupmap, 0);
3082 if (solv->dupinvolvedmap.size)
3084 map_free(&solv->dupinvolvedmap);
3085 map_init(&solv->dupinvolvedmap, 0);
3087 solv->droporphanedmap_all = 0;
3088 if (solv->droporphanedmap.size)
3090 map_free(&solv->droporphanedmap);
3091 map_init(&solv->droporphanedmap, 0);
3093 if (solv->cleandepsmap.size)
3095 map_free(&solv->cleandepsmap);
3096 map_init(&solv->cleandepsmap, 0);
3098 if (solv->weakrulemap.size)
3100 map_free(&solv->weakrulemap);
3101 map_init(&solv->weakrulemap, 0);
3104 queue_empty(&solv->weakruleq);
3105 solv->watches = solv_free(solv->watches);
3106 queue_empty(&solv->ruletojob);
3107 if (solv->decisionq.count)
3108 memset(solv->decisionmap, 0, pool->nsolvables * sizeof(Id));
3109 queue_empty(&solv->decisionq);
3110 queue_empty(&solv->decisionq_why);
3111 solv->decisioncnt_update = solv->decisioncnt_keep = solv->decisioncnt_resolve = solv->decisioncnt_weak = solv->decisioncnt_orphan = 0;
3112 queue_empty(&solv->learnt_why);
3113 queue_empty(&solv->learnt_pool);
3114 queue_empty(&solv->branches);
3115 solv->propagate_index = 0;
3116 queue_empty(&solv->problems);
3117 queue_empty(&solv->solutions);
3118 queue_empty(&solv->orphaned);
3119 solv->stats_learned = solv->stats_unsolvable = 0;
3120 if (solv->recommends_index)
3122 map_empty(&solv->recommendsmap);
3123 map_empty(&solv->suggestsmap);
3124 solv->recommends_index = 0;
3126 solv->multiversionupdaters = solv_free(solv->multiversionupdaters);
3130 * create basic rule set of all involved packages
3131 * use addedmap bitmap to make sure we don't create rules twice
3134 /* create multiversion map if needed */
3135 solver_calculate_multiversionmap(pool, job, &solv->multiversion);
3137 map_init(&addedmap, pool->nsolvables);
3138 MAPSET(&addedmap, SYSTEMSOLVABLE);
3140 map_init(&installcandidatemap, pool->nsolvables);
3143 now = solv_timems(0);
3145 * create rules for all package that could be involved with the solving
3146 * so called: rpm rules
3149 initialnrules = solv->rpmrules_end ? solv->rpmrules_end : 1;
3150 if (initialnrules > 1)
3151 deduceq2addedmap(solv, &addedmap);
3152 if (solv->nrules != initialnrules)
3153 solver_shrinkrules(solv, initialnrules);
3154 solv->nrules = initialnrules;
3155 solv->rpmrules_end = 0;
3159 /* check for update/verify jobs as they need to be known early */
3160 for (i = 0; i < job->count; i += 2)
3162 how = job->elements[i];
3163 what = job->elements[i + 1];
3164 select = how & SOLVER_SELECTMASK;
3165 switch (how & SOLVER_JOBMASK)
3168 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3169 solv->fixmap_all = 1;
3170 FOR_JOB_SELECT(p, pp, select, what)
3172 s = pool->solvables + p;
3173 if (s->repo != installed)
3175 if (!solv->fixmap.size)
3176 map_grow(&solv->fixmap, installed->end - installed->start);
3177 MAPSET(&solv->fixmap, p - installed->start);
3181 if (select == SOLVER_SOLVABLE_ALL)
3183 solv->updatemap_all = 1;
3184 if (how & SOLVER_FORCEBEST)
3185 solv->bestupdatemap_all = 1;
3186 if (how & SOLVER_CLEANDEPS)
3188 FOR_REPO_SOLVABLES(installed, p, s)
3189 add_cleandeps_package(solv, p);
3192 else if (select == SOLVER_SOLVABLE_REPO)
3194 Repo *repo = pool_id2repo(pool, what);
3197 if (repo == installed && !(how & SOLVER_TARGETED))
3199 solv->updatemap_all = 1;
3200 if (how & SOLVER_FORCEBEST)
3201 solv->bestupdatemap_all = 1;
3202 if (how & SOLVER_CLEANDEPS)
3204 FOR_REPO_SOLVABLES(installed, p, s)
3205 add_cleandeps_package(solv, p);
3209 if (solv->noautotarget && !(how & SOLVER_TARGETED))
3211 /* targeted update */
3212 FOR_REPO_SOLVABLES(repo, p, s)
3213 add_update_target(solv, p, how);
3217 if (!(how & SOLVER_TARGETED))
3220 FOR_JOB_SELECT(p, pp, select, what)
3222 s = pool->solvables + p;
3223 if (s->repo != installed)
3225 if (!solv->updatemap.size)
3226 map_grow(&solv->updatemap, installed->end - installed->start);
3227 MAPSET(&solv->updatemap, p - installed->start);
3228 if (how & SOLVER_FORCEBEST)
3230 if (!solv->bestupdatemap.size)
3231 map_grow(&solv->bestupdatemap, installed->end - installed->start);
3232 MAPSET(&solv->bestupdatemap, p - installed->start);
3234 if (how & SOLVER_CLEANDEPS)
3235 add_cleandeps_package(solv, p);
3238 if (!targeted || solv->noautotarget)
3241 FOR_JOB_SELECT(p, pp, select, what)
3242 add_update_target(solv, p, how);
3250 if (solv->update_targets)
3251 transform_update_targets(solv);
3253 oldnrules = solv->nrules;
3254 FOR_REPO_SOLVABLES(installed, p, s)
3255 solver_addrpmrulesforsolvable(solv, s, &addedmap);
3256 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
3257 oldnrules = solv->nrules;
3258 FOR_REPO_SOLVABLES(installed, p, s)
3259 solver_addrpmrulesforupdaters(solv, s, &addedmap, 1);
3260 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
3264 * create rules for all packages involved in the job
3265 * (to be installed or removed)
3268 oldnrules = solv->nrules;
3269 for (i = 0; i < job->count; i += 2)
3271 how = job->elements[i];
3272 what = job->elements[i + 1];
3273 select = how & SOLVER_SELECTMASK;
3275 switch (how & SOLVER_JOBMASK)
3277 case SOLVER_INSTALL:
3278 FOR_JOB_SELECT(p, pp, select, what)
3280 MAPSET(&installcandidatemap, p);
3281 solver_addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
3284 case SOLVER_DISTUPGRADE:
3285 if (select == SOLVER_SOLVABLE_ALL)
3287 solv->dupmap_all = 1;
3288 solv->updatemap_all = 1;
3289 if (how & SOLVER_FORCEBEST)
3290 solv->bestupdatemap_all = 1;
3292 if (!solv->dupmap_all)
3299 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
3303 * add rules for suggests, enhances
3305 oldnrules = solv->nrules;
3306 solver_addrpmrulesforweak(solv, &addedmap);
3307 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
3309 #ifdef ENABLE_LINKED_PKGS
3310 oldnrules = solv->nrules;
3311 solver_addrpmrulesforlinked(solv, &addedmap);
3312 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules because of linked packages\n", solv->nrules - oldnrules);
3316 * first pass done, we now have all the rpm rules we need.
3317 * unify existing rules before going over all job rules and
3319 * at this point the system is always solvable,
3320 * as an empty system (remove all packages) is a valid solution
3323 IF_POOLDEBUG (SOLV_DEBUG_STATS)
3325 int possible = 0, installable = 0;
3326 for (i = 1; i < pool->nsolvables; i++)
3328 if (pool_installable(pool, pool->solvables + i))
3330 if (MAPTST(&addedmap, i))
3333 POOL_DEBUG(SOLV_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
3336 if (solv->nrules > initialnrules)
3337 solver_unifyrules(solv); /* remove duplicate rpm rules */
3338 solv->rpmrules_end = solv->nrules; /* mark end of rpm rules */
3340 if (solv->nrules > initialnrules)
3341 addedmap2deduceq(solv, &addedmap); /* so that we can recreate the addedmap */
3343 POOL_DEBUG(SOLV_DEBUG_STATS, "rpm rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
3344 POOL_DEBUG(SOLV_DEBUG_STATS, "rpm rule creation took %d ms\n", solv_timems(now));
3346 /* create dup maps if needed. We need the maps early to create our
3349 solver_createdupmaps(solv);
3352 * create feature rules
3354 * foreach installed:
3355 * create assertion (keep installed, if no update available)
3357 * create update rule (A|update1(A)|update2(A)|...)
3359 * those are used later on to keep a version of the installed packages in
3363 solv->featurerules = solv->nrules; /* mark start of feature rules */
3366 /* foreach possibly installed solvable */
3367 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3369 if (s->repo != installed)
3371 solver_addrule(solv, 0, 0); /* create dummy rule */
3374 solver_addupdaterule(solv, s, 1); /* allow s to be updated */
3376 /* make sure we accounted for all rules */
3377 assert(solv->nrules - solv->featurerules == installed->end - installed->start);
3379 solv->featurerules_end = solv->nrules;
3382 * Add update rules for installed solvables
3384 * almost identical to feature rules
3385 * except that downgrades/archchanges/vendorchanges are not allowed
3388 solv->updaterules = solv->nrules;
3391 { /* foreach installed solvables */
3392 /* we create all update rules, but disable some later on depending on the job */
3393 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3397 if (s->repo != installed)
3399 solver_addrule(solv, 0, 0); /* create dummy rule */
3402 solver_addupdaterule(solv, s, 0); /* allowall = 0: downgrades not allowed */
3404 * check for and remove duplicate
3406 r = solv->rules + solv->nrules - 1; /* r: update rule */
3407 sr = r - (installed->end - installed->start); /* sr: feature rule */
3408 /* it's orphaned if there is no feature rule or the feature rule
3409 * consists just of the installed package */
3410 if (!sr->p || (sr->p == i && !sr->d && !sr->w2))
3411 queue_push(&solv->orphaned, i);
3414 assert(solv->dupmap_all && !sr->p);
3417 if (!solver_rulecmp(solv, r, sr))
3418 memset(sr, 0, sizeof(*sr)); /* delete unneeded feature rule */
3420 solver_disablerule(solv, sr); /* disable feature rule */
3422 /* consistency check: we added a rule for _every_ installed solvable */
3423 assert(solv->nrules - solv->updaterules == installed->end - installed->start);
3425 solv->updaterules_end = solv->nrules;
3429 * now add all job rules
3432 solv->jobrules = solv->nrules;
3433 for (i = 0; i < job->count; i += 2)
3435 oldnrules = solv->nrules;
3437 if (i && i == solv->pooljobcnt)
3438 POOL_DEBUG(SOLV_DEBUG_JOB, "end of pool jobs\n");
3439 how = job->elements[i];
3440 what = job->elements[i + 1];
3441 weak = how & SOLVER_WEAK;
3442 select = how & SOLVER_SELECTMASK;
3443 switch (how & SOLVER_JOBMASK)
3445 case SOLVER_INSTALL:
3446 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3447 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3448 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3449 if (select == SOLVER_SOLVABLE)
3457 FOR_JOB_SELECT(p, pp, select, what)
3461 if (select == SOLVER_SOLVABLE_ONE_OF)
3462 break; /* ignore empty installs */
3463 /* no candidate found or unsupported, make this an impossible rule */
3464 queue_push(&q, -SYSTEMSOLVABLE);
3466 p = queue_shift(&q); /* get first candidate */
3467 d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q); /* internalize */
3469 /* force install of namespace supplements hack */
3470 if (select == SOLVER_SOLVABLE_PROVIDES && !d && (p == SYSTEMSOLVABLE || p == -SYSTEMSOLVABLE) && ISRELDEP(what))
3472 Reldep *rd = GETRELDEP(pool, what);
3473 if (rd->flags == REL_NAMESPACE)
3476 if (!solv->installsuppdepq)
3478 solv->installsuppdepq = solv_calloc(1, sizeof(Queue));
3479 queue_init(solv->installsuppdepq);
3481 queue_pushunique(solv->installsuppdepq, rd->evr == 0 ? rd->name : what);
3484 solver_addjobrule(solv, p, d, i, weak);
3485 if (how & SOLVER_FORCEBEST)
3486 hasbestinstalljob = 1;
3489 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %s%serase %s\n", weak ? "weak " : "", how & SOLVER_CLEANDEPS ? "clean deps " : "", solver_select2str(pool, select, what));
3490 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3491 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3492 /* specific solvable: by id or by nevra */
3493 name = (select == SOLVER_SOLVABLE || (select == SOLVER_SOLVABLE_NAME && ISRELDEP(what))) ? 0 : -1;
3494 if (select == SOLVER_SOLVABLE_ALL) /* hmmm ;) */
3496 FOR_POOL_SOLVABLES(p)
3497 solver_addjobrule(solv, -p, 0, i, weak);
3499 else if (select == SOLVER_SOLVABLE_REPO)
3501 Repo *repo = pool_id2repo(pool, what);
3503 FOR_REPO_SOLVABLES(repo, p, s)
3504 solver_addjobrule(solv, -p, 0, i, weak);
3506 FOR_JOB_SELECT(p, pp, select, what)
3508 s = pool->solvables + p;
3509 if (installed && s->repo == installed)
3510 name = !name ? s->name : -1;
3511 solver_addjobrule(solv, -p, 0, i, weak);
3513 /* special case for "erase a specific solvable": we also
3514 * erase all other solvables with that name, so that they
3515 * don't get picked up as replacement.
3516 * name is > 0 if exactly one installed solvable matched.
3518 /* XXX: look also at packages that obsolete this package? */
3523 FOR_PROVIDES(p, pp, name)
3525 s = pool->solvables + p;
3526 if (s->name != name)
3528 /* keep other versions installed */
3529 if (s->repo == installed)
3531 /* keep installcandidates of other jobs */
3532 if (MAPTST(&installcandidatemap, p))
3534 /* don't add the same rule twice */
3535 for (j = oldnrules; j < k; j++)
3536 if (solv->rules[j].p == -p)
3539 solver_addjobrule(solv, -p, 0, i, weak); /* remove by id */
3545 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3548 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sverify %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3550 case SOLVER_WEAKENDEPS:
3551 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3552 if (select != SOLVER_SOLVABLE)
3554 s = pool->solvables + what;
3555 weaken_solvable_deps(solv, what);
3557 case SOLVER_MULTIVERSION:
3558 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %smultiversion %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3561 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3562 if (select == SOLVER_SOLVABLE_ALL)
3564 FOR_POOL_SOLVABLES(p)
3565 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3567 else if (select == SOLVER_SOLVABLE_REPO)
3569 Repo *repo = pool_id2repo(pool, what);
3571 FOR_REPO_SOLVABLES(repo, p, s)
3572 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3574 FOR_JOB_SELECT(p, pp, select, what)
3575 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3577 case SOLVER_DISTUPGRADE:
3578 POOL_DEBUG(SOLV_DEBUG_JOB, "job: distupgrade %s\n", solver_select2str(pool, select, what));
3580 case SOLVER_DROP_ORPHANED:
3581 POOL_DEBUG(SOLV_DEBUG_JOB, "job: drop orphaned %s\n", solver_select2str(pool, select, what));
3582 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3583 solv->droporphanedmap_all = 1;
3584 FOR_JOB_SELECT(p, pp, select, what)
3586 s = pool->solvables + p;
3587 if (!installed || s->repo != installed)
3589 if (!solv->droporphanedmap.size)
3590 map_grow(&solv->droporphanedmap, installed->end - installed->start);
3591 MAPSET(&solv->droporphanedmap, p - installed->start);
3594 case SOLVER_USERINSTALLED:
3595 POOL_DEBUG(SOLV_DEBUG_JOB, "job: user installed %s\n", solver_select2str(pool, select, what));
3598 POOL_DEBUG(SOLV_DEBUG_JOB, "job: unknown job\n");
3606 IF_POOLDEBUG (SOLV_DEBUG_JOB)
3609 if (solv->nrules == oldnrules)
3610 POOL_DEBUG(SOLV_DEBUG_JOB, " - no rule created\n");
3611 for (j = oldnrules; j < solv->nrules; j++)
3613 POOL_DEBUG(SOLV_DEBUG_JOB, " - job ");
3614 solver_printrule(solv, SOLV_DEBUG_JOB, solv->rules + j);
3618 assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
3619 solv->jobrules_end = solv->nrules;
3621 /* now create infarch and dup rules */
3622 if (!solv->noinfarchcheck)
3624 solver_addinfarchrules(solv, &addedmap);
3626 if (pool->implicitobsoleteusescolors)
3628 /* currently doesn't work well with infarch rules, so make
3630 for (i = solv->infarchrules; i < solv->infarchrules_end; i++)
3631 queue_push(&solv->weakruleq, i);
3636 solv->infarchrules = solv->infarchrules_end = solv->nrules;
3639 solver_addduprules(solv, &addedmap);
3641 solv->duprules = solv->duprules_end = solv->nrules;
3643 if (solv->bestupdatemap_all || solv->bestupdatemap.size || hasbestinstalljob)
3644 solver_addbestrules(solv, hasbestinstalljob);
3646 solv->bestrules = solv->bestrules_end = solv->nrules;
3649 solver_freedupmaps(solv); /* no longer needed */
3652 solver_addchoicerules(solv);
3654 solv->choicerules = solv->choicerules_end = solv->nrules;
3658 for (i = solv->featurerules; i < solv->nrules; i++)
3659 solver_printruleclass(solv, SOLV_DEBUG_RESULT, solv->rules + i);
3661 /* all rules created
3662 * --------------------------------------------------------------
3663 * prepare for solving
3666 /* free unneeded memory */
3667 map_free(&addedmap);
3668 map_free(&installcandidatemap);
3671 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);
3672 POOL_DEBUG(SOLV_DEBUG_STATS, "overall rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
3674 /* create weak map */
3675 map_init(&solv->weakrulemap, solv->nrules);
3676 for (i = 0; i < solv->weakruleq.count; i++)
3678 p = solv->weakruleq.elements[i];
3679 MAPSET(&solv->weakrulemap, p);
3682 /* enable cleandepsmap creation if we have updatepkgs */
3683 if (solv->cleandeps_updatepkgs && !solv->cleandepsmap.size)
3684 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3686 if (solv->cleandeps_mistakes)
3688 queue_free(solv->cleandeps_mistakes);
3689 solv->cleandeps_mistakes = solv_free(solv->cleandeps_mistakes);
3692 /* all new rules are learnt after this point */
3693 solv->learntrules = solv->nrules;
3695 /* create watches chains */
3698 /* create assertion index. it is only used to speed up
3699 * makeruledecsions() a bit */
3700 for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
3701 if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
3702 queue_push(&solv->ruleassertions, i);
3704 /* disable update rules that conflict with our job */
3705 solver_disablepolicyrules(solv);
3707 /* make initial decisions based on assertion rules */
3708 makeruledecisions(solv);
3709 POOL_DEBUG(SOLV_DEBUG_SOLVER, "problems so far: %d\n", solv->problems.count);
3712 * ********************************************
3714 * ********************************************
3717 now = solv_timems(0);
3718 solver_run_sat(solv, 1, solv->dontinstallrecommended ? 0 : 1);
3719 POOL_DEBUG(SOLV_DEBUG_STATS, "solver took %d ms\n", solv_timems(now));
3722 * prepare solution queue if there were problems
3724 solver_prepare_solutions(solv);
3726 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);
3727 POOL_DEBUG(SOLV_DEBUG_STATS, "solver_solve took %d ms\n", solv_timems(solve_start));
3729 /* return number of problems */
3730 return solv->problems.count ? solv->problems.count / 2 : 0;
3734 solver_create_transaction(Solver *solv)
3736 return transaction_create_decisionq(solv->pool, &solv->decisionq, &solv->multiversion);
3739 void solver_get_orphaned(Solver *solv, Queue *orphanedq)
3741 queue_free(orphanedq);
3742 queue_init_clone(orphanedq, &solv->orphaned);
3745 void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected)
3747 Pool *pool = solv->pool;
3748 Queue redoq, disabledq;
3754 if (!recommendationsq && !suggestionsq)
3757 map_init(&obsmap, pool->nsolvables);
3758 if (solv->installed)
3760 Id obs, *obsp, p, po, ppo;
3761 for (p = solv->installed->start; p < solv->installed->end; p++)
3763 s = pool->solvables + p;
3764 if (s->repo != solv->installed || !s->obsoletes)
3766 if (solv->decisionmap[p] <= 0)
3768 if (solv->multiversion.size && MAPTST(&solv->multiversion, p))
3770 obsp = s->repo->idarraydata + s->obsoletes;
3771 /* foreach obsoletes */
3772 while ((obs = *obsp++) != 0)
3773 FOR_PROVIDES(po, ppo, obs)
3774 MAPSET(&obsmap, po);
3779 queue_init(&disabledq);
3781 /* disable all erase jobs (including weak "keep uninstalled" rules) */
3782 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
3784 if (r->d < 0) /* disabled ? */
3786 if (r->p >= 0) /* install job? */
3788 queue_push(&disabledq, i);
3789 solver_disablerule(solv, r);
3795 enabledisablelearntrules(solv);
3796 removedisabledconflicts(solv, &redoq);
3800 * find recommended packages
3802 if (recommendationsq)
3804 Id rec, *recp, p, pp;
3806 queue_empty(recommendationsq);
3807 /* create map of all recommened packages */
3808 solv->recommends_index = -1;
3809 MAPZERO(&solv->recommendsmap);
3811 /* put all packages the solver already chose in the map */
3812 if (solv->decisioncnt_weak)
3814 for (i = solv->decisioncnt_weak; i < solv->decisioncnt_orphan; i++)
3817 why = solv->decisionq_why.elements[i];
3819 continue; /* forced by unit rule or dep resolving */
3820 p = solv->decisionq.elements[i];
3823 MAPSET(&solv->recommendsmap, p);
3827 for (i = 0; i < solv->decisionq.count; i++)
3829 p = solv->decisionq.elements[i];
3832 s = pool->solvables + p;
3835 recp = s->repo->idarraydata + s->recommends;
3836 while ((rec = *recp++) != 0)
3838 FOR_PROVIDES(p, pp, rec)
3839 if (solv->decisionmap[p] > 0)
3845 FOR_PROVIDES(p, pp, rec)
3846 if (solv->decisionmap[p] > 0)
3847 MAPSET(&solv->recommendsmap, p);
3849 continue; /* p != 0: already fulfilled */
3851 FOR_PROVIDES(p, pp, rec)
3852 MAPSET(&solv->recommendsmap, p);
3856 for (i = 1; i < pool->nsolvables; i++)
3858 if (solv->decisionmap[i] < 0)
3860 if (solv->decisionmap[i] > 0 && noselected)
3862 if (MAPTST(&obsmap, i))
3864 s = pool->solvables + i;
3865 if (!MAPTST(&solv->recommendsmap, i))
3867 if (!s->supplements)
3869 if (!pool_installable(pool, s))
3871 if (!solver_is_supplementing(solv, s))
3874 queue_push(recommendationsq, i);
3876 /* we use MODE_SUGGEST here so that repo prio is ignored */
3877 policy_filter_unwanted(solv, recommendationsq, POLICY_MODE_SUGGEST);
3881 * find suggested packages
3886 Id sug, *sugp, p, pp;
3888 queue_empty(suggestionsq);
3889 /* create map of all suggests that are still open */
3890 solv->recommends_index = -1;
3891 MAPZERO(&solv->suggestsmap);
3892 for (i = 0; i < solv->decisionq.count; i++)
3894 p = solv->decisionq.elements[i];
3897 s = pool->solvables + p;
3900 sugp = s->repo->idarraydata + s->suggests;
3901 while ((sug = *sugp++) != 0)
3903 FOR_PROVIDES(p, pp, sug)
3904 if (solv->decisionmap[p] > 0)
3910 FOR_PROVIDES(p, pp, sug)
3911 if (solv->decisionmap[p] > 0)
3912 MAPSET(&solv->suggestsmap, p);
3914 continue; /* already fulfilled */
3916 FOR_PROVIDES(p, pp, sug)
3917 MAPSET(&solv->suggestsmap, p);
3921 for (i = 1; i < pool->nsolvables; i++)
3923 if (solv->decisionmap[i] < 0)
3925 if (solv->decisionmap[i] > 0 && noselected)
3927 if (MAPTST(&obsmap, i))
3929 s = pool->solvables + i;
3930 if (!MAPTST(&solv->suggestsmap, i))
3934 if (!pool_installable(pool, s))
3936 if (!solver_is_enhancing(solv, s))
3939 queue_push(suggestionsq, i);
3941 policy_filter_unwanted(solv, suggestionsq, POLICY_MODE_SUGGEST);
3944 /* undo removedisabledconflicts */
3946 undo_removedisabledconflicts(solv, &redoq);
3949 /* undo job rule disabling */
3950 for (i = 0; i < disabledq.count; i++)
3951 solver_enablerule(solv, solv->rules + disabledq.elements[i]);
3952 queue_free(&disabledq);
3957 /***********************************************************************/
3958 /* disk usage computations */
3960 /*-------------------------------------------------------------------
3962 * calculate DU changes
3966 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
3970 solver_create_state_maps(solv, &installedmap, 0);
3971 pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
3972 map_free(&installedmap);
3976 /*-------------------------------------------------------------------
3978 * calculate changes in install size
3982 solver_calc_installsizechange(Solver *solv)
3987 solver_create_state_maps(solv, &installedmap, 0);
3988 change = pool_calc_installsizechange(solv->pool, &installedmap);
3989 map_free(&installedmap);
3994 solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap)
3996 pool_create_state_maps(solv->pool, &solv->decisionq, installedmap, conflictsmap);
4000 solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res)
4002 Pool *pool = solv->pool;
4005 pool_create_state_maps(pool, &solv->decisionq, &installedmap, 0);
4006 pool_trivial_installable_multiversionmap(pool, &installedmap, pkgs, res, solv->multiversion.size ? &solv->multiversion : 0);
4007 for (i = 0; i < res->count; i++)
4008 if (res->elements[i] != -1)
4010 Solvable *s = pool->solvables + pkgs->elements[i];
4011 if (!strncmp("patch:", pool_id2str(pool, s->name), 6) && solvable_is_irrelevant_patch(s, &installedmap))
4012 res->elements[i] = -1;
4014 map_free(&installedmap);
4017 /*-------------------------------------------------------------------
4019 * decision introspection
4023 solver_get_decisionlevel(Solver *solv, Id p)
4025 return solv->decisionmap[p];
4029 solver_get_decisionqueue(Solver *solv, Queue *decisionq)
4031 queue_free(decisionq);
4032 queue_init_clone(decisionq, &solv->decisionq);
4036 solver_get_lastdecisionblocklevel(Solver *solv)
4039 if (solv->decisionq.count == 0)
4041 p = solv->decisionq.elements[solv->decisionq.count - 1];
4044 return solv->decisionmap[p] < 0 ? -solv->decisionmap[p] : solv->decisionmap[p];
4048 solver_get_decisionblock(Solver *solv, int level, Queue *decisionq)
4053 queue_empty(decisionq);
4054 for (i = 0; i < solv->decisionq.count; i++)
4056 p = solv->decisionq.elements[i];
4059 if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
4062 if (i == solv->decisionq.count)
4064 for (i = 0; i < solv->decisionq.count; i++)
4066 p = solv->decisionq.elements[i];
4069 if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
4070 queue_push(decisionq, p);
4077 solver_describe_decision(Solver *solv, Id p, Id *infop)
4084 if (!solv->decisionmap[p])
4085 return SOLVER_REASON_UNRELATED;
4086 pp = solv->decisionmap[p] < 0 ? -p : p;
4087 for (i = 0; i < solv->decisionq.count; i++)
4088 if (solv->decisionq.elements[i] == pp)
4090 if (i == solv->decisionq.count) /* just in case... */
4091 return SOLVER_REASON_UNRELATED;
4092 why = solv->decisionq_why.elements[i];
4094 *infop = why > 0 ? why : -why;
4096 return SOLVER_REASON_UNIT_RULE;
4098 if (i < solv->decisioncnt_update)
4101 return SOLVER_REASON_KEEP_INSTALLED;
4102 return SOLVER_REASON_RESOLVE_JOB;
4104 if (i < solv->decisioncnt_keep)
4106 if (why == 0 && pp < 0)
4107 return SOLVER_REASON_CLEANDEPS_ERASE;
4108 return SOLVER_REASON_UPDATE_INSTALLED;
4110 if (i < solv->decisioncnt_resolve)
4112 if (why == 0 && pp < 0)
4113 return SOLVER_REASON_CLEANDEPS_ERASE;
4114 return SOLVER_REASON_KEEP_INSTALLED;
4117 return SOLVER_REASON_RESOLVE;
4118 /* weak or orphaned */
4119 if (solv->decisionq.count < solv->decisioncnt_orphan)
4120 return SOLVER_REASON_WEAKDEP;
4121 return SOLVER_REASON_RESOLVE_ORPHAN;
4126 solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq)
4128 Pool *pool = solv->pool;
4130 int level = solv->decisionmap[p];
4137 for (decisionno = 0; decisionno < solv->decisionq.count; decisionno++)
4138 if (solv->decisionq.elements[decisionno] == p)
4140 if (decisionno == solv->decisionq.count)
4142 if (decisionno < solv->decisioncnt_weak || decisionno >= solv->decisioncnt_orphan)
4145 /* 1) list all packages that recommend us */
4146 for (i = 1; i < pool->nsolvables; i++)
4148 Id *recp, rec, pp2, p2;
4149 if (solv->decisionmap[i] < 0 || solv->decisionmap[i] >= level)
4151 s = pool->solvables + i;
4154 if (!solv->addalreadyrecommended && s->repo == solv->installed)
4156 recp = s->repo->idarraydata + s->recommends;
4157 while ((rec = *recp++) != 0)
4160 FOR_PROVIDES(p2, pp2, rec)
4166 /* if p2 is already installed, this recommends is ignored */
4167 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
4173 queue_push(whyq, SOLVER_REASON_RECOMMENDED);
4174 queue_push2(whyq, p2, rec);
4178 /* 2) list all supplements */
4179 s = pool->solvables + p;
4180 if (s->supplements && level > 0)
4182 Id *supp, sup, pp2, p2;
4183 /* this is a hack. to use solver_dep_fulfilled we temporarily clear
4184 * everything above our level in the decisionmap */
4185 for (i = decisionno; i < solv->decisionq.count; i++ )
4187 p2 = solv->decisionq.elements[i];
4189 solv->decisionmap[p2] = -solv->decisionmap[p2];
4191 supp = s->repo->idarraydata + s->supplements;
4192 while ((sup = *supp++) != 0)
4193 if (solver_dep_fulfilled(solv, sup))
4196 /* let's see if this is an easy supp */
4197 FOR_PROVIDES(p2, pp2, sup)
4199 if (!solv->addalreadyrecommended && solv->installed)
4201 if (pool->solvables[p2].repo == solv->installed)
4204 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
4206 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
4207 queue_push2(whyq, p2, sup);
4213 /* hard case, just note dependency with no package */
4214 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
4215 queue_push2(whyq, 0, sup);
4218 for (i = decisionno; i < solv->decisionq.count; i++)
4220 p2 = solv->decisionq.elements[i];
4222 solv->decisionmap[p2] = -solv->decisionmap[p2];
4228 pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what)
4231 how &= SOLVER_SELECTMASK;
4233 if (how == SOLVER_SOLVABLE_ALL)
4235 FOR_POOL_SOLVABLES(p)
4236 queue_push(pkgs, p);
4238 else if (how == SOLVER_SOLVABLE_REPO)
4240 Repo *repo = pool_id2repo(pool, what);
4243 FOR_REPO_SOLVABLES(repo, p, s)
4244 queue_push(pkgs, p);
4248 FOR_JOB_SELECT(p, pp, how, what)
4249 queue_push(pkgs, p);
4254 pool_isemptyupdatejob(Pool *pool, Id how, Id what)
4257 Id select = how & SOLVER_SELECTMASK;
4258 if ((how & SOLVER_JOBMASK) != SOLVER_UPDATE)
4260 if (select == SOLVER_SOLVABLE_ALL || select == SOLVER_SOLVABLE_REPO)
4262 if (!pool->installed)
4264 FOR_JOB_SELECT(p, pp, select, what)
4265 if (pool->solvables[p].repo == pool->installed)
4268 FOR_JOB_SELECT(p, pp, select, what)
4270 Solvable *s = pool->solvables + p;
4271 FOR_PROVIDES(pi, pip, s->name)
4273 Solvable *si = pool->solvables + pi;
4274 if (si->repo != pool->installed || si->name != s->name)
4280 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
4281 while ((obs = *obsp++) != 0)
4283 FOR_PROVIDES(pi, pip, obs)
4285 Solvable *si = pool->solvables + pi;
4286 if (si->repo != pool->installed)
4288 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
4290 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
4301 solver_select2str(Pool *pool, Id select, Id what)
4305 select &= SOLVER_SELECTMASK;
4306 if (select == SOLVER_SOLVABLE)
4307 return pool_solvid2str(pool, what);
4308 if (select == SOLVER_SOLVABLE_NAME)
4309 return pool_dep2str(pool, what);
4310 if (select == SOLVER_SOLVABLE_PROVIDES)
4312 s = pool_dep2str(pool, what);
4313 b = pool_alloctmpspace(pool, 11 + strlen(s));
4314 sprintf(b, "providing %s", s);
4317 if (select == SOLVER_SOLVABLE_ONE_OF)
4321 while ((p = pool->whatprovidesdata[what++]) != 0)
4323 s = pool_solvid2str(pool, p);
4325 b = pool_tmpappend(pool, b, ", ", s);
4327 b = pool_tmpjoin(pool, s, 0, 0);
4328 pool_freetmpspace(pool, s);
4330 return b ? b : "nothing";
4332 if (select == SOLVER_SOLVABLE_REPO)
4334 b = pool_alloctmpspace(pool, 20);
4335 sprintf(b, "repo #%d", what);
4338 if (select == SOLVER_SOLVABLE_ALL)
4339 return "all packages";
4340 return "unknown job select";
4344 pool_job2str(Pool *pool, Id how, Id what, Id flagmask)
4346 Id select = how & SOLVER_SELECTMASK;
4347 const char *strstart = 0, *strend = 0;
4351 switch (how & SOLVER_JOBMASK)
4354 return "do nothing";
4355 case SOLVER_INSTALL:
4356 if (select == SOLVER_SOLVABLE && pool->installed && pool->solvables[what].repo == pool->installed)
4357 strstart = "keep ", strend = "installed";
4358 else if (select == SOLVER_SOLVABLE || select == SOLVER_SOLVABLE_NAME)
4359 strstart = "install ";
4360 else if (select == SOLVER_SOLVABLE_PROVIDES)
4361 strstart = "install a package ";
4363 strstart = "install one of ";
4366 if (select == SOLVER_SOLVABLE && !(pool->installed && pool->solvables[what].repo == pool->installed))
4367 strstart = "keep ", strend = "unstalled";
4368 else if (select == SOLVER_SOLVABLE_PROVIDES)
4369 strstart = "deinstall all packages ";
4371 strstart = "deinstall ";
4374 strstart = "update ";
4376 case SOLVER_WEAKENDEPS:
4377 strstart = "weaken deps of ";
4379 case SOLVER_MULTIVERSION:
4380 strstart = "multi version ";
4383 strstart = "update ";
4385 case SOLVER_DISTUPGRADE:
4386 strstart = "dist upgrade ";
4389 strstart = "verify ";
4391 case SOLVER_DROP_ORPHANED:
4392 strstart = "deinstall ", strend = "if orphaned";
4394 case SOLVER_USERINSTALLED:
4395 strstart = "regard ", strend = "as userinstalled";
4398 strstart = "unknown job ";
4401 s = pool_tmpjoin(pool, strstart, solver_select2str(pool, select, what), strend);
4403 if ((how & ~(SOLVER_SELECTMASK|SOLVER_JOBMASK)) == 0)
4406 s = pool_tmpappend(pool, s, " ", 0);
4407 if (how & SOLVER_WEAK)
4408 s = pool_tmpappend(pool, s, ",weak", 0);
4409 if (how & SOLVER_ESSENTIAL)
4410 s = pool_tmpappend(pool, s, ",essential", 0);
4411 if (how & SOLVER_CLEANDEPS)
4412 s = pool_tmpappend(pool, s, ",cleandeps", 0);
4413 if (how & SOLVER_ORUPDATE)
4414 s = pool_tmpappend(pool, s, ",orupdate", 0);
4415 if (how & SOLVER_FORCEBEST)
4416 s = pool_tmpappend(pool, s, ",forcebest", 0);
4417 if (how & SOLVER_TARGETED)
4418 s = pool_tmpappend(pool, s, ",targeted", 0);
4419 if (how & SOLVER_SETEV)
4420 s = pool_tmpappend(pool, s, ",setev", 0);
4421 if (how & SOLVER_SETEVR)
4422 s = pool_tmpappend(pool, s, ",setevr", 0);
4423 if (how & SOLVER_SETARCH)
4424 s = pool_tmpappend(pool, s, ",setarch", 0);
4425 if (how & SOLVER_SETVENDOR)
4426 s = pool_tmpappend(pool, s, ",setvendor", 0);
4427 if (how & SOLVER_SETREPO)
4428 s = pool_tmpappend(pool, s, ",setrepo", 0);
4429 if (how & SOLVER_SETNAME)
4430 s = pool_tmpappend(pool, s, ",setname", 0);
4431 if (how & SOLVER_NOAUTOSET)
4432 s = pool_tmpappend(pool, s, ",noautoset", 0);
4433 if (s[o + 1] != ',')
4434 s = pool_tmpappend(pool, s, ",?", 0);
4436 return pool_tmpappend(pool, s, "]", 0);