2 * Copyright (c) 2007-2008, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * SAT based dependency solver
21 #include "solver_private.h"
27 #include "solverdebug.h"
29 #include "linkedpkg.h"
31 #define RULES_BLOCK 63
33 /********************************************************************
35 * dependency check helpers
39 /*-------------------------------------------------------------------
40 * handle split provides
42 * a splitprovides dep looks like
43 * namespace:splitprovides(pkg REL_WITH path)
44 * and is only true if pkg is installed and contains the specified path.
45 * we also make sure that pkg is selected for an update, otherwise the
46 * update would always be forced onto the user.
49 solver_splitprovides(Solver *solv, Id dep)
51 Pool *pool = solv->pool;
56 if (!solv->dosplitprovides || !solv->installed || (!solv->updatemap_all && !solv->updatemap.size))
60 rd = GETRELDEP(pool, dep);
61 if (rd->flags != REL_WITH)
64 * things are a bit tricky here if pool->addedprovides == 1, because most split-provides are in
65 * a non-standard location. If we simply call pool_whatprovides, we'll drag in the complete
66 * file list. Instead we rely on pool_addfileprovides ignoring the addfileprovidesfiltered flag
67 * for installed packages and check the lazywhatprovidesq (ignoring the REL_WITH part, but
68 * we filter the package name further down anyway).
70 if (pool->addedfileprovides == 1 && !ISRELDEP(rd->evr) && !pool->whatprovides[rd->evr])
71 pp = pool_searchlazywhatprovidesq(pool, rd->evr);
73 pp = pool_whatprovides(pool, dep);
74 while ((p = pool->whatprovidesdata[pp++]) != 0)
76 /* here we have packages that provide the correct name and contain the path,
77 * now do extra filtering */
78 s = pool->solvables + p;
79 if (s->repo == solv->installed && s->name == rd->name &&
80 (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, p - solv->installed->start))))
87 /*-------------------------------------------------------------------
88 * solver_dep_installed
92 solver_dep_installed(Solver *solv, Id dep)
95 Pool *pool = solv->pool;
100 Reldep *rd = GETRELDEP(pool, dep);
101 if (rd->flags == REL_AND)
103 if (!solver_dep_installed(solv, rd->name))
105 return solver_dep_installed(solv, rd->evr);
107 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
108 return solver_dep_installed(solv, rd->evr);
110 FOR_PROVIDES(p, pp, dep)
112 if (p == SYSTEMSOLVABLE || (solv->installed && pool->solvables[p].repo == solv->installed))
119 /* mirrors solver_dep_installed, but returns 2 if a
120 * dependency listed in solv->installsuppdepq was involved */
122 solver_check_installsuppdepq_dep(Solver *solv, Id dep)
124 Pool *pool = solv->pool;
130 Reldep *rd = GETRELDEP(pool, dep);
131 if (rd->flags == REL_AND)
133 int r2, r1 = solver_check_installsuppdepq_dep(solv, rd->name);
136 r2 = solver_check_installsuppdepq_dep(solv, rd->evr);
139 return r1 == 2 || r2 == 2 ? 2 : 1;
141 if (rd->flags == REL_OR)
143 int r2, r1 = solver_check_installsuppdepq_dep(solv, rd->name);
144 r2 = solver_check_installsuppdepq_dep(solv, rd->evr);
147 return r1 == 2 || r2 == 2 ? 2 : 1;
149 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
150 return solver_splitprovides(solv, rd->evr);
151 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
152 return solver_dep_installed(solv, rd->evr);
153 if (rd->flags == REL_NAMESPACE && (q = solv->installsuppdepq) != 0)
156 for (i = 0; i < q->count; i++)
157 if (q->elements[i] == dep || q->elements[i] == rd->name)
161 FOR_PROVIDES(p, pp, dep)
162 if (solv->decisionmap[p] > 0)
168 solver_check_installsuppdepq(Solver *solv, Solvable *s)
171 supp = s->repo->idarraydata + s->supplements;
172 while ((sup = *supp++) != 0)
173 if (solver_check_installsuppdepq_dep(solv, sup) == 2)
179 autouninstall(Solver *solv, Id *problem)
181 Pool *pool = solv->pool;
183 int lastfeature = 0, lastupdate = 0;
187 for (i = 0; (v = problem[i]) != 0; i++)
190 extraflags &= solv->job.elements[-v - 1];
191 if (v >= solv->featurerules && v < solv->featurerules_end)
194 if (v >= solv->updaterules && v < solv->updaterules_end)
196 /* check if identical to feature rule */
197 Id p = solv->rules[v].p;
201 r = solv->rules + solv->featurerules + (p - solv->installed->start);
204 /* update rule == feature rule */
213 if (!lastupdate && !lastfeature)
215 v = lastupdate ? lastupdate : lastfeature;
216 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "allowuninstall disabling ");
217 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + v);
218 solver_disableproblem(solv, v);
219 if (extraflags != -1 && (extraflags & SOLVER_CLEANDEPS) != 0 && solv->cleandepsmap.size)
221 /* add the package to the updatepkgs list, this will automatically turn
222 * on cleandeps mode */
223 Id p = solv->rules[v].p;
224 if (!solv->cleandeps_updatepkgs)
226 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
227 queue_init(solv->cleandeps_updatepkgs);
231 int oldupdatepkgscnt = solv->cleandeps_updatepkgs->count;
232 queue_pushunique(solv->cleandeps_updatepkgs, p);
233 if (solv->cleandeps_updatepkgs->count != oldupdatepkgscnt)
234 solver_disablepolicyrules(solv);
240 /************************************************************************/
243 * enable/disable learnt rules
245 * we have enabled or disabled some of our rules. We now reenable all
246 * of our learnt rules except the ones that were learnt from rules that
250 enabledisablelearntrules(Solver *solv)
252 Pool *pool = solv->pool;
257 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "enabledisablelearntrules called\n");
258 for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
260 whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules];
261 while ((why = *whyp++) != 0)
263 assert(why > 0 && why < i);
264 if (solv->rules[why].d < 0)
267 /* why != 0: we found a disabled rule, disable the learnt rule */
268 if (why && r->d >= 0)
270 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
272 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "disabling ");
273 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
275 solver_disablerule(solv, r);
277 else if (!why && r->d < 0)
279 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
281 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "re-enabling ");
282 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
284 solver_enablerule(solv, r);
291 * make assertion rules into decisions
293 * Go through rules and add direct assertions to the decisionqueue.
294 * If we find a conflict, disable rules and add them to problem queue.
298 makeruledecisions(Solver *solv)
300 Pool *pool = solv->pool;
305 int record_proof = 1;
307 int havedisabled = 0;
309 /* The system solvable is always installed first */
310 assert(solv->decisionq.count == 0);
311 queue_push(&solv->decisionq, SYSTEMSOLVABLE);
312 queue_push(&solv->decisionq_why, 0);
313 solv->decisionmap[SYSTEMSOLVABLE] = 1; /* installed at level '1' */
315 decisionstart = solv->decisionq.count;
318 /* if we needed to re-run, back up decisions to decisionstart */
319 while (solv->decisionq.count > decisionstart)
321 v = solv->decisionq.elements[--solv->decisionq.count];
322 --solv->decisionq_why.count;
324 solv->decisionmap[vv] = 0;
327 /* note that the ruleassertions queue is ordered */
328 for (ii = 0; ii < solv->ruleassertions.count; ii++)
330 ri = solv->ruleassertions.elements[ii];
331 r = solv->rules + ri;
333 if (havedisabled && ri >= solv->learntrules)
335 /* just started with learnt rule assertions. If we have disabled
336 * some rules, adapt the learnt rule status */
337 enabledisablelearntrules(solv);
341 if (r->d < 0 || !r->p || r->w2) /* disabled, dummy or no assertion */
344 /* do weak rules in phase 2 */
345 if (ri < solv->learntrules && MAPTST(&solv->weakrulemap, ri))
351 if (!solv->decisionmap[vv]) /* if not yet decided */
353 queue_push(&solv->decisionq, v);
354 queue_push(&solv->decisionq_why, r - solv->rules);
355 solv->decisionmap[vv] = v > 0 ? 1 : -1;
356 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
358 Solvable *s = solv->pool->solvables + vv;
360 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", pool_solvable2str(solv->pool, s));
362 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (assertion)\n", pool_solvable2str(solv->pool, s));
367 /* check against previous decision: is there a conflict? */
368 if (v > 0 && solv->decisionmap[vv] > 0) /* ok to install */
370 if (v < 0 && solv->decisionmap[vv] < 0) /* ok to remove */
376 * The rule (r) we're currently processing says something
377 * different (v = r->p) than a previous decision (decisionmap[abs(v)])
381 if (ri >= solv->learntrules)
383 /* conflict with a learnt rule */
384 /* can happen when packages cannot be installed for multiple reasons. */
385 /* we disable the learnt rule in this case */
386 /* (XXX: we should really call analyze_unsolvable_rule here!) */
387 solver_disablerule(solv, r);
392 * find the decision which is the "opposite" of the rule
394 for (i = 0; i < solv->decisionq.count; i++)
395 if (solv->decisionq.elements[i] == -v)
397 assert(i < solv->decisionq.count); /* assert that we found it */
398 oldproblemcount = solv->problems.count;
401 * conflict with system solvable ?
403 if (v == -SYSTEMSOLVABLE)
407 queue_push(&solv->problems, solv->learnt_pool.count);
408 queue_push(&solv->learnt_pool, ri);
409 queue_push(&solv->learnt_pool, 0);
412 queue_push(&solv->problems, 0);
413 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with system solvable, disabling rule #%d\n", ri);
414 if (ri >= solv->jobrules && ri < solv->jobrules_end)
415 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
418 queue_push(&solv->problems, v);
419 queue_push(&solv->problems, 0);
420 if (solv->allowuninstall && v >= solv->featurerules && v < solv->updaterules_end)
421 solv->problems.count = oldproblemcount;
422 solver_disableproblem(solv, v);
424 break; /* start over */
427 assert(solv->decisionq_why.elements[i] > 0);
430 * conflict with an rpm rule ?
432 if (solv->decisionq_why.elements[i] < solv->rpmrules_end)
436 queue_push(&solv->problems, solv->learnt_pool.count);
437 queue_push(&solv->learnt_pool, ri);
438 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
439 queue_push(&solv->learnt_pool, 0);
442 queue_push(&solv->problems, 0);
443 assert(v > 0 || v == -SYSTEMSOLVABLE);
444 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with rpm rule, disabling rule #%d\n", ri);
445 if (ri >= solv->jobrules && ri < solv->jobrules_end)
446 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
449 queue_push(&solv->problems, v);
450 queue_push(&solv->problems, 0);
451 if (solv->allowuninstall && v >= solv->featurerules && v < solv->updaterules_end)
452 solv->problems.count = oldproblemcount;
453 solver_disableproblem(solv, v);
455 break; /* start over */
459 * conflict with another job or update/feature rule
465 queue_push(&solv->problems, solv->learnt_pool.count);
466 queue_push(&solv->learnt_pool, ri);
467 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
468 queue_push(&solv->learnt_pool, 0);
471 queue_push(&solv->problems, 0);
473 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflicting update/job assertions over literal %d\n", vv);
476 * push all of our rules (can only be feature or job rules)
477 * asserting this literal on the problem stack
479 for (i = solv->featurerules, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
481 if (rr->d < 0 /* disabled */
482 || rr->w2) /* or no assertion */
484 if (rr->p != vv /* not affecting the literal */
487 if (MAPTST(&solv->weakrulemap, i)) /* weak: silently ignore */
490 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, " - disabling rule #%d\n", i);
491 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + i);
494 if (i >= solv->jobrules && i < solv->jobrules_end)
495 v = -(solv->ruletojob.elements[i - solv->jobrules] + 1);
496 queue_push(&solv->problems, v);
498 queue_push(&solv->problems, 0);
500 if (solv->allowuninstall && (v = autouninstall(solv, solv->problems.elements + oldproblemcount + 1)) != 0)
501 solv->problems.count = oldproblemcount;
503 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
504 solver_disableproblem(solv, solv->problems.elements[i]);
506 break; /* start over */
508 if (ii < solv->ruleassertions.count)
512 * phase 2: now do the weak assertions
514 for (ii = 0; ii < solv->ruleassertions.count; ii++)
516 ri = solv->ruleassertions.elements[ii];
517 r = solv->rules + ri;
518 if (r->d < 0 || r->w2) /* disabled or no assertion */
520 if (ri >= solv->learntrules || !MAPTST(&solv->weakrulemap, ri)) /* skip non-weak */
525 if (!solv->decisionmap[vv]) /* if not yet decided */
527 queue_push(&solv->decisionq, v);
528 queue_push(&solv->decisionq_why, r - solv->rules);
529 solv->decisionmap[vv] = v > 0 ? 1 : -1;
530 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
532 Solvable *s = solv->pool->solvables + vv;
534 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
536 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
540 /* check against previous decision: is there a conflict? */
541 if (v > 0 && solv->decisionmap[vv] > 0)
543 if (v < 0 && solv->decisionmap[vv] < 0)
546 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "assertion conflict, but I am weak, disabling ");
547 solver_printrule(solv, SOLV_DEBUG_UNSOLVABLE, r);
549 if (ri >= solv->jobrules && ri < solv->jobrules_end)
550 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
553 solver_disableproblem(solv, v);
555 solver_reenablepolicyrules(solv, -v);
557 break; /* start over */
559 if (ii == solv->ruleassertions.count)
560 break; /* finished! */
565 /********************************************************************/
569 /*-------------------------------------------------------------------
572 * initial setup for all watches
576 makewatches(Solver *solv)
580 int nsolvables = solv->pool->nsolvables;
582 solv_free(solv->watches);
583 /* lower half for removals, upper half for installs */
584 solv->watches = solv_calloc(2 * nsolvables, sizeof(Id));
586 /* do it reverse so rpm rules get triggered first (XXX: obsolete?) */
587 for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
589 for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
592 if (!r->w2) /* assertions do not need watches */
595 /* see addwatches_rule(solv, r) */
596 r->n1 = solv->watches[nsolvables + r->w1];
597 solv->watches[nsolvables + r->w1] = r - solv->rules;
599 r->n2 = solv->watches[nsolvables + r->w2];
600 solv->watches[nsolvables + r->w2] = r - solv->rules;
605 /*-------------------------------------------------------------------
607 * add watches (for a new learned rule)
608 * sets up watches for a single rule
610 * see also makewatches() above.
614 addwatches_rule(Solver *solv, Rule *r)
616 int nsolvables = solv->pool->nsolvables;
618 r->n1 = solv->watches[nsolvables + r->w1];
619 solv->watches[nsolvables + r->w1] = r - solv->rules;
621 r->n2 = solv->watches[nsolvables + r->w2];
622 solv->watches[nsolvables + r->w2] = r - solv->rules;
626 /********************************************************************/
632 /* shortcuts to check if a literal (positive or negative) assignment
633 * evaluates to 'true' or 'false'
635 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
636 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
637 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
639 /*-------------------------------------------------------------------
643 * make decision and propagate to all rules
645 * Evaluate each term affected by the decision (linked through watches).
646 * If we find unit rules we make new decisions based on them.
648 * return : 0 = everything is OK
649 * rule = conflict found in this rule
653 propagate(Solver *solv, int level)
655 Pool *pool = solv->pool;
656 Id *rp, *next_rp; /* rule pointer, next rule pointer in linked list */
658 Id p, pkg, other_watch;
660 Id *decisionmap = solv->decisionmap;
662 Id *watches = solv->watches + pool->nsolvables; /* place ptr in middle */
664 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate -----\n");
666 /* foreach non-propagated decision */
667 while (solv->propagate_index < solv->decisionq.count)
670 * 'pkg' was just decided
671 * negate because our watches trigger if literal goes FALSE
673 pkg = -solv->decisionq.elements[solv->propagate_index++];
675 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
677 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagate for decision %d level %d\n", -pkg, level);
678 solver_printruleelement(solv, SOLV_DEBUG_PROPAGATE, 0, -pkg);
681 /* foreach rule where 'pkg' is now FALSE */
682 for (rp = watches + pkg; *rp; rp = next_rp)
684 r = solv->rules + *rp;
687 /* rule is disabled, goto next */
695 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
697 POOL_DEBUG(SOLV_DEBUG_PROPAGATE," watch triggered ");
698 solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
701 /* 'pkg' was just decided (was set to FALSE)
703 * now find other literal watch, check clause
704 * and advance on linked list
718 * This term is already true (through the other literal)
719 * so we have nothing to do
721 if (DECISIONMAP_TRUE(other_watch))
725 * The other literal is FALSE or UNDEF
731 /* Not a binary clause, try to move our watch.
733 * Go over all literals and find one that is
737 * (TRUE is also ok, in that case the rule is fulfilled)
739 if (r->p /* we have a 'p' */
740 && r->p != other_watch /* which is not watched */
741 && !DECISIONMAP_FALSE(r->p)) /* and not FALSE */
745 else /* go find a 'd' to make 'true' */
748 we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
750 for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
752 if (p != other_watch /* which is not watched */
753 && !DECISIONMAP_FALSE(p)) /* and not FALSE */
761 * if we found some p that is UNDEF or TRUE, move
764 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
767 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, p));
769 POOL_DEBUG(SOLV_DEBUG_PROPAGATE," -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, -p));
785 watches[p] = r - solv->rules;
788 /* search failed, thus all unwatched literals are FALSE */
793 * unit clause found, set literal other_watch to TRUE
796 if (DECISIONMAP_FALSE(other_watch)) /* check if literal is FALSE */
797 return r; /* eek, a conflict! */
799 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
801 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " unit ");
802 solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
806 decisionmap[other_watch] = level; /* install! */
808 decisionmap[-other_watch] = -level; /* remove! */
810 queue_push(&solv->decisionq, other_watch);
811 queue_push(&solv->decisionq_why, r - solv->rules);
813 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
816 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to install %s\n", pool_solvid2str(pool, other_watch));
818 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, " -> decided to conflict %s\n", pool_solvid2str(pool, -other_watch));
821 } /* foreach rule involving 'pkg' */
823 } /* while we have non-decided decisions */
825 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate end-----\n");
827 return 0; /* all is well */
831 /********************************************************************/
834 /*-------------------------------------------------------------------
841 analyze(Solver *solv, int level, Rule *c, int *pr, int *dr, int *whyp)
843 Pool *pool = solv->pool;
847 Map seen; /* global? */
848 Id d, v, vv, *dp, why;
850 int num = 0, l1num = 0;
851 int learnt_why = solv->learnt_pool.count;
852 Id *decisionmap = solv->decisionmap;
854 queue_init_buffer(&r, r_buf, sizeof(r_buf)/sizeof(*r_buf));
856 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
857 map_init(&seen, pool->nsolvables);
858 idx = solv->decisionq.count;
861 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
862 solver_printruleclass(solv, SOLV_DEBUG_ANALYZE, c);
863 queue_push(&solv->learnt_pool, c - solv->rules);
864 d = c->d < 0 ? -c->d - 1 : c->d;
865 dp = d ? pool->whatprovidesdata + d : 0;
866 /* go through all literals of the rule */
878 if (DECISIONMAP_TRUE(v)) /* the one true literal */
881 if (MAPTST(&seen, vv))
883 l = solv->decisionmap[vv];
886 MAPSET(&seen, vv); /* mark that we also need to look at this literal */
888 l1num++; /* need to do this one in level1 pass */
890 num++; /* need to do this one as well */
893 queue_push(&r, v); /* not level1 or conflict level, add to new rule */
899 if (!num && !--l1num)
900 break; /* all level 1 literals done */
902 /* find the next literal to investigate */
903 /* (as num + l1num > 0, we know that we'll always find one) */
907 v = solv->decisionq.elements[--idx];
909 if (MAPTST(&seen, vv))
914 if (num && --num == 0)
916 *pr = -v; /* so that v doesn't get lost */
919 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
920 /* clear non-l1 bits from seen map */
921 for (i = 0; i < r.count; i++)
924 MAPCLR(&seen, v > 0 ? v : -v);
926 /* only level 1 marks left in seen map */
927 l1num++; /* as l1retry decrements it */
931 why = solv->decisionq_why.elements[idx];
932 if (why <= 0) /* just in case, maybe for SYSTEMSOLVABLE */
934 c = solv->rules + why;
940 else if (r.count == 1 && r.elements[0] < 0)
943 *dr = pool_queuetowhatprovides(pool, &r);
944 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
946 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
947 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, *pr);
948 for (i = 0; i < r.count; i++)
949 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, r.elements[i]);
951 /* push end marker on learnt reasons stack */
952 queue_push(&solv->learnt_pool, 0);
956 solv->stats_learned++;
961 /*-------------------------------------------------------------------
965 * reset all solver decisions
966 * called after rules have been enabled/disabled
970 solver_reset(Solver *solv)
972 Pool *pool = solv->pool;
976 /* rewind all decisions */
977 for (i = solv->decisionq.count - 1; i >= 0; i--)
979 v = solv->decisionq.elements[i];
980 solv->decisionmap[v > 0 ? v : -v] = 0;
982 queue_empty(&solv->decisionq_why);
983 queue_empty(&solv->decisionq);
984 solv->recommends_index = -1;
985 solv->propagate_index = 0;
986 solv->decisioncnt_update = solv->decisioncnt_keep = solv->decisioncnt_resolve = solv->decisioncnt_weak = solv->decisioncnt_orphan = 0;
987 queue_empty(&solv->branches);
989 /* adapt learnt rule status to new set of enabled/disabled rules */
990 enabledisablelearntrules(solv);
992 /* redo all assertion rule decisions */
993 makeruledecisions(solv);
994 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "decisions so far: %d\n", solv->decisionq.count);
998 /*-------------------------------------------------------------------
1000 * analyze_unsolvable_rule
1002 * recursion helper used by analyze_unsolvable
1006 analyze_unsolvable_rule(Solver *solv, Rule *r, Id *lastweakp, Map *rseen)
1008 Pool *pool = solv->pool;
1010 Id why = r - solv->rules;
1012 IF_POOLDEBUG (SOLV_DEBUG_UNSOLVABLE)
1013 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
1014 if (solv->learntrules && why >= solv->learntrules)
1016 if (MAPTST(rseen, why - solv->learntrules))
1018 MAPSET(rseen, why - solv->learntrules);
1019 for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
1020 if (solv->learnt_pool.elements[i] > 0)
1021 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp, rseen);
1024 if (MAPTST(&solv->weakrulemap, why))
1025 if (!*lastweakp || why > *lastweakp)
1027 /* do not add rpm rules to problem */
1028 if (why < solv->rpmrules_end)
1030 /* turn rule into problem */
1031 if (why >= solv->jobrules && why < solv->jobrules_end)
1032 why = -(solv->ruletojob.elements[why - solv->jobrules] + 1);
1033 /* normalize dup/infarch rules */
1034 if (why > solv->infarchrules && why < solv->infarchrules_end)
1036 Id name = pool->solvables[-solv->rules[why].p].name;
1037 while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
1040 if (why > solv->duprules && why < solv->duprules_end)
1042 Id name = pool->solvables[-solv->rules[why].p].name;
1043 while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
1047 /* return if problem already countains our rule */
1048 if (solv->problems.count)
1050 for (i = solv->problems.count - 1; i >= 0; i--)
1051 if (solv->problems.elements[i] == 0) /* end of last problem reached? */
1053 else if (solv->problems.elements[i] == why)
1056 queue_push(&solv->problems, why);
1060 /*-------------------------------------------------------------------
1062 * analyze_unsolvable
1064 * We know that the problem is not solvable. Record all involved
1065 * rules (i.e. the "proof") into solv->learnt_pool.
1066 * Record the learnt pool index and all non-rpm rules into
1067 * solv->problems. (Our solutions to fix the problems are to
1068 * disable those rules.)
1070 * If the proof contains at least one weak rule, we disable the
1073 * Otherwise we return 0 if disablerules is not set or disable
1074 * _all_ of the problem rules and return 1.
1076 * return: 1 - disabled some rules, try again
1081 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
1083 Pool *pool = solv->pool;
1085 Map seen; /* global to speed things up? */
1087 Id d, v, vv, *dp, why;
1089 Id *decisionmap = solv->decisionmap;
1090 int oldproblemcount;
1091 int oldlearntpoolcount;
1093 int record_proof = 1;
1095 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
1096 solv->stats_unsolvable++;
1097 oldproblemcount = solv->problems.count;
1098 oldlearntpoolcount = solv->learnt_pool.count;
1100 /* make room for proof index */
1101 /* must update it later, as analyze_unsolvable_rule would confuse
1102 * it with a rule index if we put the real value in already */
1103 queue_push(&solv->problems, 0);
1106 map_init(&seen, pool->nsolvables);
1107 map_init(&rseen, solv->learntrules ? solv->nrules - solv->learntrules : 0);
1109 queue_push(&solv->learnt_pool, r - solv->rules);
1111 analyze_unsolvable_rule(solv, r, &lastweak, &rseen);
1112 d = r->d < 0 ? -r->d - 1 : r->d;
1113 dp = d ? pool->whatprovidesdata + d : 0;
1124 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1126 vv = v > 0 ? v : -v;
1127 l = solv->decisionmap[vv];
1132 idx = solv->decisionq.count;
1135 v = solv->decisionq.elements[--idx];
1136 vv = v > 0 ? v : -v;
1137 if (!MAPTST(&seen, vv) || vv == SYSTEMSOLVABLE)
1139 why = solv->decisionq_why.elements[idx];
1142 queue_push(&solv->learnt_pool, why);
1143 r = solv->rules + why;
1144 analyze_unsolvable_rule(solv, r, &lastweak, &rseen);
1145 d = r->d < 0 ? -r->d - 1 : r->d;
1146 dp = d ? pool->whatprovidesdata + d : 0;
1157 if (DECISIONMAP_TRUE(v)) /* the one true literal */
1159 vv = v > 0 ? v : -v;
1160 l = solv->decisionmap[vv];
1168 queue_push(&solv->problems, 0); /* mark end of this problem */
1172 /* disable last weak rule */
1173 solv->problems.count = oldproblemcount;
1174 solv->learnt_pool.count = oldlearntpoolcount;
1175 if (lastweak >= solv->jobrules && lastweak < solv->jobrules_end)
1176 v = -(solv->ruletojob.elements[lastweak - solv->jobrules] + 1);
1179 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "disabling ");
1180 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + lastweak);
1181 if (lastweak >= solv->choicerules && lastweak < solv->choicerules_end)
1182 solver_disablechoicerules(solv, solv->rules + lastweak);
1183 solver_disableproblem(solv, v);
1185 solver_reenablepolicyrules(solv, -v);
1190 if (solv->allowuninstall && (v = autouninstall(solv, solv->problems.elements + oldproblemcount + 1)) != 0)
1192 solv->problems.count = oldproblemcount;
1193 solv->learnt_pool.count = oldlearntpoolcount;
1201 queue_push(&solv->learnt_pool, 0);
1202 solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
1205 /* + 2: index + trailing zero */
1206 if (disablerules && oldproblemcount + 2 < solv->problems.count)
1208 for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
1209 solver_disableproblem(solv, solv->problems.elements[i]);
1210 /* XXX: might want to enable all weak rules again */
1214 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
1219 /********************************************************************/
1220 /* Decision revert */
1222 /*-------------------------------------------------------------------
1225 * revert decisionq to a level
1229 revert(Solver *solv, int level)
1231 Pool *pool = solv->pool;
1233 while (solv->decisionq.count)
1235 v = solv->decisionq.elements[solv->decisionq.count - 1];
1236 vv = v > 0 ? v : -v;
1237 if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
1239 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
1240 solv->decisionmap[vv] = 0;
1241 solv->decisionq.count--;
1242 solv->decisionq_why.count--;
1243 solv->propagate_index = solv->decisionq.count;
1245 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
1247 solv->branches.count--;
1248 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
1249 solv->branches.count--;
1251 if (solv->recommends_index > solv->decisionq.count)
1252 solv->recommends_index = -1; /* rebuild recommends/suggests maps */
1253 if (solv->decisionq.count < solv->decisioncnt_update)
1254 solv->decisioncnt_update = 0;
1255 if (solv->decisionq.count < solv->decisioncnt_keep)
1256 solv->decisioncnt_keep = 0;
1257 if (solv->decisionq.count < solv->decisioncnt_resolve)
1258 solv->decisioncnt_resolve = 0;
1259 if (solv->decisionq.count < solv->decisioncnt_weak)
1260 solv->decisioncnt_weak= 0;
1261 if (solv->decisionq.count < solv->decisioncnt_orphan)
1262 solv->decisioncnt_orphan = 0;
1266 /*-------------------------------------------------------------------
1268 * watch2onhighest - put watch2 on literal with highest level
1272 watch2onhighest(Solver *solv, Rule *r)
1277 d = r->d < 0 ? -r->d - 1 : r->d;
1279 return; /* binary rule, both watches are set */
1280 dp = solv->pool->whatprovidesdata + d;
1281 while ((v = *dp++) != 0)
1283 l = solv->decisionmap[v < 0 ? -v : v];
1295 /*-------------------------------------------------------------------
1299 * add free decision (solvable to install) to decisionq
1300 * increase level and propagate decision
1301 * return if no conflict.
1303 * in conflict case, analyze conflict rule, add resulting
1304 * rule to learnt rule set, make decision from learnt
1305 * rule (always unit) and re-propagate.
1307 * returns the new solver level or 0 if unsolvable
1312 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules, Id ruleid)
1314 Pool *pool = solv->pool;
1319 assert(ruleid >= 0);
1324 solv->decisionmap[decision] = level;
1326 solv->decisionmap[-decision] = -level;
1327 queue_push(&solv->decisionq, decision);
1328 queue_push(&solv->decisionq_why, -ruleid); /* <= 0 -> free decision */
1332 r = propagate(solv, level);
1336 return analyze_unsolvable(solv, r, disablerules);
1337 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
1338 l = analyze(solv, level, r, &p, &d, &why); /* learnt rule in p and d */
1339 assert(l > 0 && l < level);
1340 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, l);
1342 revert(solv, level);
1343 r = solver_addrule(solv, p, d);
1345 assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
1346 queue_push(&solv->learnt_why, why);
1349 /* at least 2 literals, needs watches */
1350 watch2onhighest(solv, r);
1351 addwatches_rule(solv, r);
1355 /* learnt rule is an assertion */
1356 queue_push(&solv->ruleassertions, r - solv->rules);
1358 /* the new rule is unit by design */
1359 solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
1360 queue_push(&solv->decisionq, p);
1361 queue_push(&solv->decisionq_why, r - solv->rules);
1362 IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
1364 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "decision: ");
1365 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, p);
1366 POOL_DEBUG(SOLV_DEBUG_ANALYZE, "new rule: ");
1367 solver_printrule(solv, SOLV_DEBUG_ANALYZE, r);
1374 reorder_dq_for_jobrules(Solver *solv, int level, Queue *dq)
1376 Pool *pool = solv->pool;
1377 int i, j, haveone = 0, dqcount = dq->count;
1381 /* at the time we process jobrules the installed packages are not kept yet */
1382 /* reorder so that "future-supplemented" packages come first */
1383 FOR_REPO_SOLVABLES(solv->installed, p, s)
1385 if (MAPTST(&solv->noupdate, p - solv->installed->start))
1387 if (solv->decisionmap[p] == 0)
1389 solv->decisionmap[p] = level;
1395 for (i = 0; i < dqcount; i++)
1396 if (!solver_is_enhancing(solv, pool->solvables + dq->elements[i]))
1398 queue_push(dq, dq->elements[i]);
1399 dq->elements[i] = 0;
1401 dqcount = dq->count;
1402 for (i = 0; i < dqcount; i++)
1403 if (dq->elements[i] && !solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
1405 queue_push(dq, dq->elements[i]);
1406 dq->elements[i] = 0;
1408 for (i = j = 0; i < dq->count; i++)
1409 if (dq->elements[i])
1410 dq->elements[j++] = dq->elements[i];
1411 queue_truncate(dq, j);
1412 FOR_REPO_SOLVABLES(solv->installed, p, s)
1413 if (solv->decisionmap[p] == level)
1414 solv->decisionmap[p] = 0;
1417 /*-------------------------------------------------------------------
1419 * select and install
1421 * install best package from the queue. We add an extra package, inst, if
1422 * provided. See comment in weak install section.
1424 * returns the new solver level or 0 if unsolvable
1429 selectandinstall(Solver *solv, int level, Queue *dq, int disablerules, Id ruleid)
1431 Pool *pool = solv->pool;
1436 policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1439 /* XXX: didn't we already do that? */
1440 /* XXX: shouldn't we prefer installed packages? */
1441 /* XXX: move to policy.c? */
1442 /* choose the supplemented one */
1443 for (i = 0; i < dq->count; i++)
1444 if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
1446 dq->elements[0] = dq->elements[i];
1451 if (dq->count > 1 && ruleid >= solv->jobrules && ruleid < solv->jobrules_end && solv->installed)
1452 reorder_dq_for_jobrules(solv, level, dq);
1455 /* multiple candidates, open a branch */
1456 for (i = 1; i < dq->count; i++)
1457 queue_push(&solv->branches, dq->elements[i]);
1458 queue_push(&solv->branches, -level);
1460 p = dq->elements[0];
1462 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing %s\n", pool_solvid2str(pool, p));
1464 return setpropagatelearn(solv, level, p, disablerules, ruleid);
1468 /********************************************************************/
1469 /* Main solver interface */
1472 /*-------------------------------------------------------------------
1475 * create solver structure
1477 * pool: all available solvables
1478 * installed: installed Solvables
1481 * Upon solving, rules are created to flag the Solvables
1482 * of the 'installed' Repo as installed.
1486 solver_create(Pool *pool)
1489 solv = (Solver *)solv_calloc(1, sizeof(Solver));
1491 solv->installed = pool->installed;
1493 solv->allownamechange = 1;
1495 solv->dup_allowdowngrade = 1;
1496 solv->dup_allownamechange = 1;
1497 solv->dup_allowarchchange = 1;
1498 solv->dup_allowvendorchange = 1;
1500 solv->keepexplicitobsoletes = pool->noobsoletesmultiversion ? 0 : 1;
1502 queue_init(&solv->ruletojob);
1503 queue_init(&solv->decisionq);
1504 queue_init(&solv->decisionq_why);
1505 queue_init(&solv->problems);
1506 queue_init(&solv->orphaned);
1507 queue_init(&solv->learnt_why);
1508 queue_init(&solv->learnt_pool);
1509 queue_init(&solv->branches);
1510 queue_init(&solv->weakruleq);
1511 queue_init(&solv->ruleassertions);
1512 queue_init(&solv->addedmap_deduceq);
1514 queue_push(&solv->learnt_pool, 0); /* so that 0 does not describe a proof */
1516 map_init(&solv->recommendsmap, pool->nsolvables);
1517 map_init(&solv->suggestsmap, pool->nsolvables);
1518 map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
1519 solv->recommends_index = 0;
1521 solv->decisionmap = (Id *)solv_calloc(pool->nsolvables, sizeof(Id));
1523 solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
1524 memset(solv->rules, 0, sizeof(Rule));
1530 /*-------------------------------------------------------------------
1536 queuep_free(Queue **qp)
1541 *qp = solv_free(*qp);
1545 map_zerosize(Map *m)
1555 solver_free(Solver *solv)
1557 queue_free(&solv->job);
1558 queue_free(&solv->ruletojob);
1559 queue_free(&solv->decisionq);
1560 queue_free(&solv->decisionq_why);
1561 queue_free(&solv->learnt_why);
1562 queue_free(&solv->learnt_pool);
1563 queue_free(&solv->problems);
1564 queue_free(&solv->solutions);
1565 queue_free(&solv->orphaned);
1566 queue_free(&solv->branches);
1567 queue_free(&solv->weakruleq);
1568 queue_free(&solv->ruleassertions);
1569 queue_free(&solv->addedmap_deduceq);
1570 queuep_free(&solv->cleandeps_updatepkgs);
1571 queuep_free(&solv->cleandeps_mistakes);
1572 queuep_free(&solv->update_targets);
1573 queuep_free(&solv->installsuppdepq);
1574 queuep_free(&solv->recommendscplxq);
1575 queuep_free(&solv->suggestscplxq);
1576 queuep_free(&solv->brokenorphanrules);
1578 map_free(&solv->recommendsmap);
1579 map_free(&solv->suggestsmap);
1580 map_free(&solv->noupdate);
1581 map_free(&solv->weakrulemap);
1582 map_free(&solv->multiversion);
1584 map_free(&solv->updatemap);
1585 map_free(&solv->bestupdatemap);
1586 map_free(&solv->fixmap);
1587 map_free(&solv->dupmap);
1588 map_free(&solv->dupinvolvedmap);
1589 map_free(&solv->droporphanedmap);
1590 map_free(&solv->cleandepsmap);
1592 solv_free(solv->decisionmap);
1593 solv_free(solv->rules);
1594 solv_free(solv->watches);
1595 solv_free(solv->obsoletes);
1596 solv_free(solv->obsoletes_data);
1597 solv_free(solv->specialupdaters);
1598 solv_free(solv->choicerules_ref);
1599 solv_free(solv->bestrules_pkg);
1600 solv_free(solv->instbuddy);
1605 solver_get_flag(Solver *solv, int flag)
1609 case SOLVER_FLAG_ALLOW_DOWNGRADE:
1610 return solv->allowdowngrade;
1611 case SOLVER_FLAG_ALLOW_NAMECHANGE:
1612 return solv->allownamechange;
1613 case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1614 return solv->allowarchchange;
1615 case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1616 return solv->allowvendorchange;
1617 case SOLVER_FLAG_ALLOW_UNINSTALL:
1618 return solv->allowuninstall;
1619 case SOLVER_FLAG_NO_UPDATEPROVIDE:
1620 return solv->noupdateprovide;
1621 case SOLVER_FLAG_SPLITPROVIDES:
1622 return solv->dosplitprovides;
1623 case SOLVER_FLAG_IGNORE_RECOMMENDED:
1624 return solv->dontinstallrecommended;
1625 case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1626 return solv->addalreadyrecommended;
1627 case SOLVER_FLAG_NO_INFARCHCHECK:
1628 return solv->noinfarchcheck;
1629 case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1630 return solv->keepexplicitobsoletes;
1631 case SOLVER_FLAG_BEST_OBEY_POLICY:
1632 return solv->bestobeypolicy;
1633 case SOLVER_FLAG_NO_AUTOTARGET:
1634 return solv->noautotarget;
1635 case SOLVER_FLAG_DUP_ALLOW_DOWNGRADE:
1636 return solv->dup_allowdowngrade;
1637 case SOLVER_FLAG_DUP_ALLOW_NAMECHANGE:
1638 return solv->dup_allownamechange;
1639 case SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE:
1640 return solv->dup_allowarchchange;
1641 case SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE:
1642 return solv->dup_allowvendorchange;
1643 case SOLVER_FLAG_KEEP_ORPHANS:
1644 return solv->keep_orphans;
1645 case SOLVER_FLAG_BREAK_ORPHANS:
1646 return solv->break_orphans;
1654 solver_set_flag(Solver *solv, int flag, int value)
1656 int old = solver_get_flag(solv, flag);
1659 case SOLVER_FLAG_ALLOW_DOWNGRADE:
1660 solv->allowdowngrade = value;
1662 case SOLVER_FLAG_ALLOW_NAMECHANGE:
1663 solv->allownamechange = value;
1665 case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1666 solv->allowarchchange = value;
1668 case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1669 solv->allowvendorchange = value;
1671 case SOLVER_FLAG_ALLOW_UNINSTALL:
1672 solv->allowuninstall = value;
1674 case SOLVER_FLAG_NO_UPDATEPROVIDE:
1675 solv->noupdateprovide = value;
1677 case SOLVER_FLAG_SPLITPROVIDES:
1678 solv->dosplitprovides = value;
1680 case SOLVER_FLAG_IGNORE_RECOMMENDED:
1681 solv->dontinstallrecommended = value;
1683 case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1684 solv->addalreadyrecommended = value;
1686 case SOLVER_FLAG_NO_INFARCHCHECK:
1687 solv->noinfarchcheck = value;
1689 case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1690 solv->keepexplicitobsoletes = value;
1692 case SOLVER_FLAG_BEST_OBEY_POLICY:
1693 solv->bestobeypolicy = value;
1695 case SOLVER_FLAG_NO_AUTOTARGET:
1696 solv->noautotarget = value;
1698 case SOLVER_FLAG_DUP_ALLOW_DOWNGRADE:
1699 solv->dup_allowdowngrade = value;
1701 case SOLVER_FLAG_DUP_ALLOW_NAMECHANGE:
1702 solv->dup_allownamechange = value;
1704 case SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE:
1705 solv->dup_allowarchchange = value;
1707 case SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE:
1708 solv->dup_allowvendorchange = value;
1710 case SOLVER_FLAG_KEEP_ORPHANS:
1711 solv->keep_orphans = value;
1713 case SOLVER_FLAG_BREAK_ORPHANS:
1714 solv->break_orphans = value;
1723 cleandeps_check_mistakes(Solver *solv, int level)
1725 Pool *pool = solv->pool;
1729 int mademistake = 0;
1731 if (!solv->cleandepsmap.size)
1733 /* check for mistakes */
1734 for (i = solv->installed->start; i < solv->installed->end; i++)
1736 if (!MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1738 r = solv->rules + solv->featurerules + (i - solv->installed->start);
1739 /* a mistake is when the featurerule is true but the updaterule is false */
1742 FOR_RULELITERALS(p, pp, r)
1743 if (p > 0 && solv->decisionmap[p] > 0)
1746 continue; /* feature rule is not true */
1747 r = solv->rules + solv->updaterules + (i - solv->installed->start);
1750 FOR_RULELITERALS(p, pp, r)
1751 if (p > 0 && solv->decisionmap[p] > 0)
1754 continue; /* update rule is true */
1755 POOL_DEBUG(SOLV_DEBUG_SOLVER, "cleandeps mistake: ");
1756 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, r);
1757 POOL_DEBUG(SOLV_DEBUG_SOLVER, "feature rule: ");
1758 solver_printruleclass(solv, SOLV_DEBUG_SOLVER, solv->rules + solv->featurerules + (i - solv->installed->start));
1759 if (!solv->cleandeps_mistakes)
1761 solv->cleandeps_mistakes = solv_calloc(1, sizeof(Queue));
1762 queue_init(solv->cleandeps_mistakes);
1764 queue_push(solv->cleandeps_mistakes, i);
1765 MAPCLR(&solv->cleandepsmap, i - solv->installed->start);
1766 solver_reenablepolicyrules_cleandeps(solv, i);
1775 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
1779 for (i = j = 0; i < q->count; i++)
1782 for (cp2 = cp; *cp2; cp2++)
1785 q->elements[j++] = p;
1789 queue_truncate(q, j);
1792 #ifdef ENABLE_COMPLEX_DEPS
1795 add_complex_recommends(Solver *solv, Id rec, Queue *dq, Map *dqmap)
1797 Pool *pool = solv->pool;
1798 int oldcnt = dq->count;
1804 printf("ADD_COMPLEX_RECOMMENDS %s\n", pool_dep2str(pool, rec));
1806 i = pool_normalize_complex_dep(pool, rec, dq, CPLXDEPS_EXPAND);
1807 if (i == 0 || i == 1)
1810 for (i = oldcnt; i < cutcnt; i++)
1813 for (; (p = dq->elements[i]) != 0; i++)
1817 if (solv->decisionmap[-p] <= 0)
1821 if (solv->decisionmap[p] > 0)
1823 queue_truncate(dq, blkcnt);
1828 if (!MAPTST(dqmap, p))
1833 if (solv->decisionmap[p] < 0)
1835 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))))
1840 while (dq->elements[i])
1843 queue_deleten(dq, oldcnt, cutcnt - oldcnt);
1845 if (dq->count != oldcnt)
1847 for (j = oldcnt; j < dq->count; j++)
1849 p = dq->elements[j];
1850 for (i = 0; i < j; i++)
1851 if (dq->elements[i] == p)
1853 dq->elements[j] = 0;
1857 for (i = j = oldcnt; j < dq->count; j++)
1858 if (dq->elements[j])
1859 dq->elements[i++] = dq->elements[j];
1860 queue_truncate(dq, i);
1863 printf("RETURN:\n");
1864 for (i = oldcnt; i < dq->count; i++)
1865 printf(" - %s\n", pool_solvid2str(pool, dq->elements[i]));
1870 do_complex_recommendations(Solver *solv, Id rec, Map *m, int noselected)
1872 Pool *pool = solv->pool;
1878 printf("DO_COMPLEX_RECOMMENDATIONS %s\n", pool_dep2str(pool, rec));
1881 i = pool_normalize_complex_dep(pool, rec, &dq, CPLXDEPS_EXPAND);
1882 if (i == 0 || i == 1)
1887 for (i = 0; i < dq.count; i++)
1890 for (; (p = dq.elements[i]) != 0; i++)
1894 if (solv->decisionmap[-p] <= 0)
1898 if (solv->decisionmap[p] > 0)
1903 for (i++; (p = dq.elements[i]) != 0; i++)
1904 if (p > 0 && solv->decisionmap[p] > 0)
1912 for (i = blk; (p = dq.elements[i]) != 0; i++)
1916 while (dq.elements[i])
1924 /*-------------------------------------------------------------------
1928 * all rules have been set up, now actually run the solver
1933 solver_run_sat(Solver *solv, int disablerules, int doweak)
1935 Queue dq; /* local decisionqueue */
1936 Queue dqs; /* local decisionqueue for supplements */
1942 Pool *pool = solv->pool;
1944 int minimizationsteps;
1945 int installedpos = solv->installed ? solv->installed->start : 0;
1947 IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
1949 POOL_DEBUG (SOLV_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
1950 for (i = 1; i < solv->nrules; i++)
1951 solver_printruleclass(solv, SOLV_DEBUG_RULE_CREATION, solv->rules + i);
1954 POOL_DEBUG(SOLV_DEBUG_SOLVER, "initial decisions: %d\n", solv->decisionq.count);
1956 /* start SAT algorithm */
1958 systemlevel = level + 1;
1959 POOL_DEBUG(SOLV_DEBUG_SOLVER, "solving...\n");
1965 * here's the main loop:
1966 * 1) propagate new decisions (only needed once)
1968 * 3) try to keep installed packages
1969 * 4) fulfill all unresolved rules
1970 * 5) install recommended packages
1971 * 6) minimalize solution if we had choices
1972 * if we encounter a problem, we rewind to a safe level and restart
1976 minimizationsteps = 0;
1980 * initial propagation of the assertions
1984 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagating (propagate_index: %d; size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
1985 if ((r = propagate(solv, level)) != 0)
1987 if (analyze_unsolvable(solv, r, disablerules))
1990 break; /* unsolvable */
1995 * resolve jobs first
1997 if (level < systemlevel)
1999 POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving job rules\n");
2000 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
2003 if (r->d < 0) /* ignore disabled rules */
2006 FOR_RULELITERALS(l, pp, r)
2010 if (solv->decisionmap[-l] <= 0)
2015 if (solv->decisionmap[l] > 0)
2017 if (solv->decisionmap[l] == 0)
2023 /* prune to installed if not updating */
2024 if (dq.count > 1 && solv->installed && !solv->updatemap_all &&
2025 !(solv->job.elements[solv->ruletojob.elements[i - solv->jobrules]] & SOLVER_ORUPDATE))
2028 for (j = k = 0; j < dq.count; j++)
2030 Solvable *s = pool->solvables + dq.elements[j];
2031 if (s->repo == solv->installed)
2033 dq.elements[k++] = dq.elements[j];
2034 if (solv->updatemap.size && MAPTST(&solv->updatemap, dq.elements[j] - solv->installed->start))
2036 k = 0; /* package wants to be updated, do not prune */
2045 level = selectandinstall(solv, level, &dq, disablerules, i);
2048 if (level <= olevel)
2052 break; /* unsolvable */
2053 systemlevel = level + 1;
2054 if (i < solv->jobrules_end)
2056 if (!solv->decisioncnt_update)
2057 solv->decisioncnt_update = solv->decisionq.count;
2061 * installed packages
2063 if (level < systemlevel && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
2065 Repo *installed = solv->installed;
2068 POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving installed packages\n");
2069 /* we use two passes if we need to update packages
2070 * to create a better user experience */
2071 for (pass = solv->updatemap.size ? 0 : 1; pass < 2; pass++)
2073 int passlevel = level;
2074 Id *specialupdaters = solv->specialupdaters;
2075 if (pass == 1 && !solv->decisioncnt_keep)
2076 solv->decisioncnt_keep = solv->decisionq.count;
2077 /* start with installedpos, the position that gave us problems the last time */
2078 for (i = installedpos, n = installed->start; n < installed->end; i++, n++)
2083 if (i == installed->end)
2084 i = installed->start;
2085 s = pool->solvables + i;
2086 if (s->repo != installed)
2089 if (solv->decisionmap[i] > 0 && (!specialupdaters || !specialupdaters[i - installed->start]))
2090 continue; /* already decided */
2091 if (!pass && solv->updatemap.size && !MAPTST(&solv->updatemap, i - installed->start))
2092 continue; /* updates first */
2093 r = solv->rules + solv->updaterules + (i - installed->start);
2095 if (!rr->p || rr->d < 0) /* disabled -> look at feature rule */
2096 rr -= solv->installed->end - solv->installed->start;
2097 if (!rr->p) /* identical to update rule? */
2099 if (!rr->p && !(specialupdaters && specialupdaters[i - installed->start]))
2100 continue; /* orpaned package */
2102 /* check if we should update this package to the latest version
2103 * noupdate is set for erase jobs, in that case we want to deinstall
2104 * the installed package and not replace it with a newer version
2105 * rr->p != i is for dup jobs where the installed package cannot be kept */
2107 if (!MAPTST(&solv->noupdate, i - installed->start) && (solv->decisionmap[i] < 0 || solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, i - installed->start)) || (rr->p && rr->p != i)))
2111 /* specialupdater with no update/feature rule */
2112 for (d = specialupdaters[i - installed->start]; (p = pool->whatprovidesdata[d++]) != 0; )
2114 if (solv->decisionmap[p] > 0)
2119 if (!solv->decisionmap[p])
2123 else if (specialupdaters && (d = specialupdaters[i - installed->start]) != 0)
2125 /* special multiversion handling, make sure best version is chosen */
2126 if (rr->p == i && solv->decisionmap[i] >= 0)
2128 while ((p = pool->whatprovidesdata[d++]) != 0)
2129 if (solv->decisionmap[p] >= 0)
2131 if (dq.count && solv->update_targets && solv->update_targets->elements[i - installed->start])
2132 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], &dq);
2135 policy_filter_unwanted(solv, &dq, POLICY_MODE_CHOOSE);
2137 if (p != i && solv->decisionmap[p] == 0)
2139 rr = solv->rules + solv->featurerules + (i - solv->installed->start);
2140 if (!rr->p) /* update rule == feature rule? */
2141 rr = rr - solv->featurerules + solv->updaterules;
2150 /* update to best package of the update rule */
2151 FOR_RULELITERALS(p, pp, rr)
2153 if (solv->decisionmap[p] > 0)
2155 dq.count = 0; /* already fulfilled */
2158 if (!solv->decisionmap[p])
2163 if (dq.count && solv->update_targets && solv->update_targets->elements[i - installed->start])
2164 prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], &dq);
2165 /* install best version */
2169 level = selectandinstall(solv, level, &dq, disablerules, rr - solv->rules);
2176 if (level <= olevel)
2178 if (level == 1 || level < passlevel)
2179 break; /* trouble */
2181 n = installed->start; /* redo all */
2187 /* if still undecided keep package */
2188 if (solv->decisionmap[i] == 0)
2191 if (solv->cleandepsmap.size && MAPTST(&solv->cleandepsmap, i - installed->start))
2194 POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, i));
2195 level = setpropagatelearn(solv, level, -i, disablerules, 0);
2202 POOL_DEBUG(SOLV_DEBUG_POLICY, "keeping %s\n", pool_solvid2str(pool, i));
2203 level = setpropagatelearn(solv, level, i, disablerules, r - solv->rules);
2207 if (level <= olevel)
2209 if (level == 1 || level < passlevel)
2210 break; /* trouble */
2212 n = installed->start; /* redo all */
2215 continue; /* retry with learnt rule */
2219 if (n < installed->end)
2221 installedpos = i; /* retry problem solvable next time */
2222 break; /* ran into trouble */
2224 installedpos = installed->start; /* reset installedpos */
2227 break; /* unsolvable */
2228 systemlevel = level + 1;
2230 continue; /* had trouble, retry */
2232 if (!solv->decisioncnt_keep)
2233 solv->decisioncnt_keep = solv->decisionq.count;
2235 if (level < systemlevel)
2236 systemlevel = level;
2241 if (!solv->decisioncnt_resolve)
2242 solv->decisioncnt_resolve = solv->decisionq.count;
2243 POOL_DEBUG(SOLV_DEBUG_POLICY, "deciding unresolved rules\n");
2244 for (i = 1, n = 1; n < solv->nrules; i++, n++)
2246 if (i == solv->nrules)
2248 r = solv->rules + i;
2249 if (r->d < 0) /* ignore disabled rules */
2251 if (r->p < 0) /* most common cases first */
2253 if (r->d == 0 || solv->decisionmap[-r->p] <= 0)
2260 /* binary or unary rule */
2261 /* need two positive undecided literals, r->p already checked above */
2264 if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
2266 queue_push(&dq, r->p);
2267 queue_push(&dq, r->w2);
2272 * all negative literals are installed
2273 * no positive literal is installed
2274 * i.e. the rule is not fulfilled and we
2275 * just need to decide on the positive literals
2276 * (decisionmap[-r->p] for the r->p < 0 case is already checked above)
2280 if (solv->decisionmap[r->p] > 0)
2282 if (solv->decisionmap[r->p] == 0)
2283 queue_push(&dq, r->p);
2285 dp = pool->whatprovidesdata + r->d;
2286 while ((p = *dp++) != 0)
2290 if (solv->decisionmap[-p] <= 0)
2295 if (solv->decisionmap[p] > 0)
2297 if (solv->decisionmap[p] == 0)
2304 IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
2306 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "unfulfilled ");
2307 solver_printruleclass(solv, SOLV_DEBUG_PROPAGATE, r);
2309 /* dq.count < 2 cannot happen as this means that
2310 * the rule is unit */
2311 assert(dq.count > 1);
2313 /* prune to cleandeps packages */
2314 if (solv->cleandepsmap.size && solv->installed)
2316 Repo *installed = solv->installed;
2317 for (j = 0; j < dq.count; j++)
2318 if (pool->solvables[dq.elements[j]].repo == installed && MAPTST(&solv->cleandepsmap, dq.elements[j] - installed->start))
2322 dq.elements[0] = dq.elements[j];
2323 queue_truncate(&dq, 1);
2328 level = selectandinstall(solv, level, &dq, disablerules, r - solv->rules);
2330 break; /* unsolvable */
2331 if (level < systemlevel || level == 1)
2332 break; /* trouble */
2333 /* something changed, so look at all rules again */
2337 if (n != solv->nrules) /* ran into trouble? */
2340 break; /* unsolvable */
2341 continue; /* start over */
2344 /* decide leftover cleandeps packages */
2345 if (solv->cleandepsmap.size && solv->installed)
2347 for (p = solv->installed->start; p < solv->installed->end; p++)
2349 s = pool->solvables + p;
2350 if (s->repo != solv->installed)
2352 if (solv->decisionmap[p] == 0 && MAPTST(&solv->cleandepsmap, p - solv->installed->start))
2354 POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, p));
2356 level = setpropagatelearn(solv, level, -p, 0, 0);
2361 if (p < solv->installed->end)
2365 /* at this point we have a consistent system. now do the extras... */
2367 if (!solv->decisioncnt_weak)
2368 solv->decisioncnt_weak = solv->decisionq.count;
2373 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended packages\n");
2374 queue_empty(&dq); /* recommended packages */
2375 queue_empty(&dqs); /* supplemented packages */
2376 for (i = 1; i < pool->nsolvables; i++)
2378 if (solv->decisionmap[i] < 0)
2380 if (solv->decisionmap[i] > 0)
2382 /* installed, check for recommends */
2383 Id *recp, rec, pp, p;
2384 s = pool->solvables + i;
2385 if (!solv->addalreadyrecommended && s->repo == solv->installed)
2387 /* XXX need to special case AND ? */
2390 recp = s->repo->idarraydata + s->recommends;
2391 while ((rec = *recp++) != 0)
2393 #ifdef ENABLE_COMPLEX_DEPS
2394 if (pool_is_complex_dep(pool, rec))
2396 add_complex_recommends(solv, rec, &dq, 0);
2401 FOR_PROVIDES(p, pp, rec)
2403 if (solv->decisionmap[p] > 0)
2408 else if (solv->decisionmap[p] == 0)
2410 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))))
2412 queue_pushunique(&dq, p);
2420 s = pool->solvables + i;
2421 if (!s->supplements)
2423 if (!pool_installable(pool, s))
2425 if (!solver_is_supplementing(solv, s))
2427 if (solv->dupmap_all && solv->installed && s->repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, i - solv->installed->start))))
2429 queue_push(&dqs, i);
2433 /* filter out all packages obsoleted by installed packages */
2434 /* this is no longer needed if we have reverse obsoletes */
2435 if ((dqs.count || dq.count) && solv->installed)
2438 Id obs, *obsp, po, ppo;
2440 map_init(&obsmap, pool->nsolvables);
2441 for (p = solv->installed->start; p < solv->installed->end; p++)
2443 s = pool->solvables + p;
2444 if (s->repo != solv->installed || !s->obsoletes)
2446 if (solv->decisionmap[p] <= 0)
2448 if (solv->multiversion.size && MAPTST(&solv->multiversion, p))
2450 obsp = s->repo->idarraydata + s->obsoletes;
2451 /* foreach obsoletes */
2452 while ((obs = *obsp++) != 0)
2453 FOR_PROVIDES(po, ppo, obs)
2454 MAPSET(&obsmap, po);
2456 for (i = j = 0; i < dqs.count; i++)
2457 if (!MAPTST(&obsmap, dqs.elements[i]))
2458 dqs.elements[j++] = dqs.elements[i];
2460 for (i = j = 0; i < dq.count; i++)
2461 if (!MAPTST(&obsmap, dq.elements[i]))
2462 dq.elements[j++] = dq.elements[i];
2467 /* filter out all already supplemented packages if requested */
2468 if (!solv->addalreadyrecommended && dqs.count)
2470 int dosplitprovides_old = solv->dosplitprovides;
2471 /* turn off all new packages */
2472 for (i = 0; i < solv->decisionq.count; i++)
2474 p = solv->decisionq.elements[i];
2477 s = pool->solvables + p;
2478 if (s->repo && s->repo != solv->installed)
2479 solv->decisionmap[p] = -solv->decisionmap[p];
2481 solv->dosplitprovides = 0;
2482 /* filter out old supplements */
2483 for (i = j = 0; i < dqs.count; i++)
2485 p = dqs.elements[i];
2486 s = pool->solvables + p;
2487 if (!s->supplements)
2489 if (!solver_is_supplementing(solv, s))
2490 dqs.elements[j++] = p;
2491 else if (solv->installsuppdepq && solver_check_installsuppdepq(solv, s))
2492 dqs.elements[j++] = p;
2495 /* undo turning off */
2496 for (i = 0; i < solv->decisionq.count; i++)
2498 p = solv->decisionq.elements[i];
2501 s = pool->solvables + p;
2502 if (s->repo && s->repo != solv->installed)
2503 solv->decisionmap[p] = -solv->decisionmap[p];
2505 solv->dosplitprovides = dosplitprovides_old;
2508 /* multiversion doesn't mix well with supplements.
2509 * filter supplemented packages where we already decided
2510 * to install a different version (see bnc#501088) */
2511 if (dqs.count && solv->multiversion.size)
2513 for (i = j = 0; i < dqs.count; i++)
2515 p = dqs.elements[i];
2516 if (MAPTST(&solv->multiversion, p))
2519 s = pool->solvables + p;
2520 FOR_PROVIDES(p2, pp2, s->name)
2521 if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name)
2524 continue; /* ignore this package */
2526 dqs.elements[j++] = p;
2531 /* make dq contain both recommended and supplemented pkgs */
2534 for (i = 0; i < dqs.count; i++)
2535 queue_pushunique(&dq, dqs.elements[i]);
2541 int decisioncount = solv->decisionq.count;
2545 /* simple case, just one package. no need to choose to best version */
2548 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2550 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2551 level = setpropagatelearn(solv, level, p, 0, 0);
2554 continue; /* back to main loop */
2557 /* filter packages, this gives us the best versions */
2558 policy_filter_unwanted(solv, &dq, POLICY_MODE_RECOMMEND);
2560 /* create map of result */
2561 map_init(&dqmap, pool->nsolvables);
2562 for (i = 0; i < dq.count; i++)
2563 MAPSET(&dqmap, dq.elements[i]);
2565 /* install all supplemented packages */
2566 for (i = 0; i < dqs.count; i++)
2568 p = dqs.elements[i];
2569 if (solv->decisionmap[p] || !MAPTST(&dqmap, p))
2571 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2573 level = setpropagatelearn(solv, level, p, 0, 0);
2574 if (level <= olevel)
2577 if (i < dqs.count || solv->decisionq.count < decisioncount)
2585 /* install all recommended packages */
2586 /* more work as we want to created branches if multiple
2587 * choices are valid */
2588 for (i = 0; i < decisioncount; i++)
2591 p = solv->decisionq.elements[i];
2594 s = pool->solvables + p;
2595 if (!s->repo || (!solv->addalreadyrecommended && s->repo == solv->installed))
2599 recp = s->repo->idarraydata + s->recommends;
2600 while ((rec = *recp++) != 0)
2603 #ifdef ENABLE_COMPLEX_DEPS
2604 if (pool_is_complex_dep(pool, rec))
2605 add_complex_recommends(solv, rec, &dq, &dqmap);
2608 FOR_PROVIDES(p, pp, rec)
2610 if (solv->decisionmap[p] > 0)
2615 else if (solv->decisionmap[p] == 0 && MAPTST(&dqmap, p))
2622 /* multiple candidates, open a branch */
2623 for (i = 1; i < dq.count; i++)
2624 queue_push(&solv->branches, dq.elements[i]);
2625 queue_push(&solv->branches, -level);
2628 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2630 level = setpropagatelearn(solv, level, p, 0, 0);
2631 if (level <= olevel || solv->decisionq.count < decisioncount)
2632 break; /* we had to revert some decisions */
2635 break; /* had a problem above, quit loop */
2640 continue; /* back to main loop so that all deps are checked */
2644 if (!solv->decisioncnt_orphan)
2645 solv->decisioncnt_orphan = solv->decisionq.count;
2646 if (solv->dupmap_all && solv->installed)
2648 int installedone = 0;
2650 /* let's see if we can install some unsupported package */
2651 POOL_DEBUG(SOLV_DEBUG_SOLVER, "deciding orphaned packages\n");
2652 for (i = 0; i < solv->orphaned.count; i++)
2654 p = solv->orphaned.elements[i];
2655 if (solv->decisionmap[p])
2656 continue; /* already decided */
2657 if (solv->droporphanedmap_all)
2659 if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))
2661 POOL_DEBUG(SOLV_DEBUG_SOLVER, "keeping orphaned %s\n", pool_solvid2str(pool, p));
2663 level = setpropagatelearn(solv, level, p, 0, 0);
2668 if (installedone || i < solv->orphaned.count)
2672 continue; /* back to main loop */
2674 for (i = 0; i < solv->orphaned.count; i++)
2676 p = solv->orphaned.elements[i];
2677 if (solv->decisionmap[p])
2678 continue; /* already decided */
2679 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing orphaned %s\n", pool_solvid2str(pool, p));
2681 level = setpropagatelearn(solv, level, -p, 0, 0);
2685 if (i < solv->orphaned.count)
2689 continue; /* back to main loop */
2691 if (solv->brokenorphanrules)
2693 solver_check_brokenorphanrules(solv, &dq);
2696 policy_filter_unwanted(solv, &dq, POLICY_MODE_CHOOSE);
2697 for (i = 0; i < dq.count; i++)
2700 POOL_DEBUG(SOLV_DEBUG_POLICY, "installing orphaned dep %s\n", pool_solvid2str(pool, p));
2702 level = setpropagatelearn(solv, level, p, 0, 0);
2713 /* one final pass to make sure we decided all installed packages */
2714 if (solv->installed)
2716 for (p = solv->installed->start; p < solv->installed->end; p++)
2718 if (solv->decisionmap[p])
2719 continue; /* already decided */
2720 s = pool->solvables + p;
2721 if (s->repo != solv->installed)
2723 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing unwanted %s\n", pool_solvid2str(pool, p));
2725 level = setpropagatelearn(solv, level, -p, 0, 0);
2729 if (p < solv->installed->end)
2733 continue; /* back to main loop */
2737 if (solv->installed && solv->cleandepsmap.size)
2739 if (cleandeps_check_mistakes(solv, level))
2741 level = 1; /* restart from scratch */
2742 systemlevel = level + 1;
2747 if (solv->solution_callback)
2749 solv->solution_callback(solv, solv->solution_callback_data);
2750 if (solv->branches.count)
2752 int i = solv->branches.count - 1;
2753 int l = -solv->branches.elements[i];
2757 if (solv->branches.elements[i - 1] < 0)
2759 p = solv->branches.elements[i];
2760 POOL_DEBUG(SOLV_DEBUG_SOLVER, "branching with %s\n", pool_solvid2str(pool, p));
2762 for (j = i + 1; j < solv->branches.count; j++)
2763 queue_push(&dq, solv->branches.elements[j]);
2764 solv->branches.count = i;
2766 revert(solv, level);
2768 for (j = 0; j < dq.count; j++)
2769 queue_push(&solv->branches, dq.elements[j]);
2771 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2773 level = setpropagatelearn(solv, level, p, disablerules, why);
2778 /* all branches done, we're finally finished */
2782 /* auto-minimization step */
2783 if (solv->branches.count)
2785 int l = 0, lasti = -1, lastl = -1;
2789 for (i = solv->branches.count - 1; i >= 0; i--)
2791 p = solv->branches.elements[i];
2794 else if (p > 0 && solv->decisionmap[p] > l + 1)
2802 /* kill old solvable so that we do not loop */
2803 p = solv->branches.elements[lasti];
2804 solv->branches.elements[lasti] = 0;
2805 POOL_DEBUG(SOLV_DEBUG_SOLVER, "minimizing %d -> %d with %s\n", solv->decisionmap[p], lastl, pool_solvid2str(pool, p));
2806 minimizationsteps++;
2809 revert(solv, level);
2810 why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2813 level = setpropagatelearn(solv, level, p, disablerules, why);
2816 continue; /* back to main loop */
2819 /* no minimization found, we're finally finished! */
2823 POOL_DEBUG(SOLV_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable, %d minimization steps\n", solv->stats_learned, solv->stats_unsolvable, minimizationsteps);
2825 POOL_DEBUG(SOLV_DEBUG_STATS, "done solving.\n\n");
2831 solv->decisioncnt_update = solv->decisionq.count;
2832 solv->decisioncnt_keep = solv->decisionq.count;
2833 solv->decisioncnt_resolve = solv->decisionq.count;
2834 solv->decisioncnt_weak = solv->decisionq.count;
2835 solv->decisioncnt_orphan = solv->decisionq.count;
2838 solver_printdecisionq(solv, SOLV_DEBUG_RESULT);
2843 /*-------------------------------------------------------------------
2845 * remove disabled conflicts
2847 * purpose: update the decisionmap after some rules were disabled.
2848 * this is used to calculate the suggested/recommended package list.
2849 * Also returns a "removed" list to undo the discisionmap changes.
2853 removedisabledconflicts(Solver *solv, Queue *removed)
2855 Pool *pool = solv->pool;
2860 Id *decisionmap = solv->decisionmap;
2862 queue_empty(removed);
2863 for (i = 0; i < solv->decisionq.count; i++)
2865 p = solv->decisionq.elements[i];
2867 continue; /* conflicts only, please */
2868 why = solv->decisionq_why.elements[i];
2871 /* no rule involved, must be a orphan package drop */
2874 /* we never do conflicts on free decisions, so there
2875 * must have been an unit rule */
2877 r = solv->rules + why;
2878 if (r->d < 0 && decisionmap[-p])
2880 /* rule is now disabled, remove from decisionmap */
2881 POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing conflict for package %s[%d]\n", pool_solvid2str(pool, -p), -p);
2882 queue_push(removed, -p);
2883 queue_push(removed, decisionmap[-p]);
2884 decisionmap[-p] = 0;
2887 if (!removed->count)
2889 /* we removed some confliced packages. some of them might still
2890 * be in conflict, so search for unit rules and re-conflict */
2892 for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
2894 if (i == solv->nrules)
2897 r = solv->rules + i;
2903 if (r->p < 0 && !decisionmap[-r->p])
2909 if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
2911 else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
2916 if (r->p < 0 && decisionmap[-r->p] == 0)
2918 if (new || DECISIONMAP_FALSE(r->p))
2920 dp = pool->whatprovidesdata + r->d;
2921 while ((p = *dp++) != 0)
2923 if (new && p == new)
2925 if (p < 0 && decisionmap[-p] == 0)
2934 else if (!DECISIONMAP_FALSE(p))
2944 POOL_DEBUG(SOLV_DEBUG_SOLVER, "re-conflicting package %s[%d]\n", pool_solvid2str(pool, -new), -new);
2945 decisionmap[-new] = -1;
2947 n = 0; /* redo all rules */
2953 undo_removedisabledconflicts(Solver *solv, Queue *removed)
2956 for (i = 0; i < removed->count; i += 2)
2957 solv->decisionmap[removed->elements[i]] = removed->elements[i + 1];
2961 /*-------------------------------------------------------------------
2963 * weaken solvable dependencies
2967 weaken_solvable_deps(Solver *solv, Id p)
2972 for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++)
2976 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2977 continue; /* conflict */
2978 queue_push(&solv->weakruleq, i);
2983 /********************************************************************/
2988 solver_calculate_multiversionmap(Pool *pool, Queue *job, Map *multiversionmap)
2991 Id how, what, select;
2993 for (i = 0; i < job->count; i += 2)
2995 how = job->elements[i];
2996 if ((how & SOLVER_JOBMASK) != SOLVER_MULTIVERSION)
2998 what = job->elements[i + 1];
2999 select = how & SOLVER_SELECTMASK;
3000 if (!multiversionmap->size)
3001 map_grow(multiversionmap, pool->nsolvables);
3002 if (select == SOLVER_SOLVABLE_ALL)
3004 FOR_POOL_SOLVABLES(p)
3005 MAPSET(multiversionmap, p);
3007 else if (select == SOLVER_SOLVABLE_REPO)
3010 Repo *repo = pool_id2repo(pool, what);
3012 FOR_REPO_SOLVABLES(repo, p, s)
3013 MAPSET(multiversionmap, p);
3015 FOR_JOB_SELECT(p, pp, select, what)
3016 MAPSET(multiversionmap, p);
3021 solver_calculate_noobsmap(Pool *pool, Queue *job, Map *multiversionmap)
3023 solver_calculate_multiversionmap(pool, job, multiversionmap);
3027 * add a rule created by a job, record job number and weak flag
3030 solver_addjobrule(Solver *solv, Id p, Id d, Id job, int weak)
3032 solver_addrule(solv, p, d);
3033 queue_push(&solv->ruletojob, job);
3035 queue_push(&solv->weakruleq, solv->nrules - 1);
3039 add_cleandeps_package(Solver *solv, Id p)
3041 if (!solv->cleandeps_updatepkgs)
3043 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
3044 queue_init(solv->cleandeps_updatepkgs);
3046 queue_pushunique(solv->cleandeps_updatepkgs, p);
3050 add_update_target(Solver *solv, Id p, Id how)
3052 Pool *pool = solv->pool;
3053 Solvable *s = pool->solvables + p;
3054 Repo *installed = solv->installed;
3056 if (!solv->update_targets)
3058 solv->update_targets = solv_calloc(1, sizeof(Queue));
3059 queue_init(solv->update_targets);
3061 if (s->repo == installed)
3063 queue_push2(solv->update_targets, p, p);
3066 FOR_PROVIDES(pi, pip, s->name)
3068 Solvable *si = pool->solvables + pi;
3069 if (si->repo != installed || si->name != s->name)
3071 if (how & SOLVER_FORCEBEST)
3073 if (!solv->bestupdatemap.size)
3074 map_grow(&solv->bestupdatemap, installed->end - installed->start);
3075 MAPSET(&solv->bestupdatemap, pi - installed->start);
3077 if (how & SOLVER_CLEANDEPS)
3078 add_cleandeps_package(solv, pi);
3079 queue_push2(solv->update_targets, pi, p);
3080 /* check if it's ok to keep the installed package */
3081 if (s->evr == si->evr && solvable_identical(s, si))
3082 queue_push2(solv->update_targets, pi, pi);
3086 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
3087 while ((obs = *obsp++) != 0)
3089 FOR_PROVIDES(pi, pip, obs)
3091 Solvable *si = pool->solvables + pi;
3092 if (si->repo != installed)
3094 if (si->name == s->name)
3095 continue; /* already handled above */
3096 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
3098 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
3100 if (how & SOLVER_FORCEBEST)
3102 if (!solv->bestupdatemap.size)
3103 map_grow(&solv->bestupdatemap, installed->end - installed->start);
3104 MAPSET(&solv->bestupdatemap, pi - installed->start);
3106 if (how & SOLVER_CLEANDEPS)
3107 add_cleandeps_package(solv, pi);
3108 queue_push2(solv->update_targets, pi, p);
3115 transform_update_targets_sortfn(const void *ap, const void *bp, void *dp)
3125 transform_update_targets(Solver *solv)
3127 Repo *installed = solv->installed;
3128 Queue *update_targets = solv->update_targets;
3130 Id p, q, lastp, lastq;
3132 if (!update_targets->count)
3134 queue_free(update_targets);
3135 solv->update_targets = solv_free(update_targets);
3138 if (update_targets->count > 2)
3139 solv_sort(update_targets->elements, update_targets->count >> 1, 2 * sizeof(Id), transform_update_targets_sortfn, solv);
3140 queue_insertn(update_targets, 0, installed->end - installed->start, 0);
3142 for (i = j = installed->end - installed->start; i < update_targets->count; i += 2)
3144 if ((p = update_targets->elements[i]) != lastp)
3146 if (!solv->updatemap.size)
3147 map_grow(&solv->updatemap, installed->end - installed->start);
3148 MAPSET(&solv->updatemap, p - installed->start);
3149 update_targets->elements[j++] = 0; /* finish old set */
3150 update_targets->elements[p - installed->start] = j; /* start new set */
3154 if ((q = update_targets->elements[i + 1]) != lastq)
3156 update_targets->elements[j++] = q;
3160 queue_truncate(update_targets, j);
3161 queue_push(update_targets, 0); /* finish last set */
3166 addedmap2deduceq(Solver *solv, Map *addedmap)
3168 Pool *pool = solv->pool;
3173 queue_empty(&solv->addedmap_deduceq);
3174 for (i = 2, j = solv->rpmrules_end - 1; i < pool->nsolvables && j > 0; j--)
3176 r = solv->rules + j;
3179 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
3182 if (!MAPTST(addedmap, p))
3184 /* should never happen, but... */
3185 if (!solv->addedmap_deduceq.count || solv->addedmap_deduceq.elements[solv->addedmap_deduceq.count - 1] != -p)
3186 queue_push(&solv->addedmap_deduceq, -p);
3190 if (MAPTST(addedmap, i))
3191 queue_push(&solv->addedmap_deduceq, i);
3195 for (; i < pool->nsolvables; i++)
3196 if (MAPTST(addedmap, i))
3197 queue_push(&solv->addedmap_deduceq, i);
3199 for (i = 2; i < pool->nsolvables; i++)
3200 if (MAPTST(addedmap, i))
3205 deduceq2addedmap(Solver *solv, Map *addedmap)
3210 for (j = solv->rpmrules_end - 1; j > 0; j--)
3212 r = solv->rules + j;
3213 if (r->d < 0 && r->p)
3214 solver_enablerule(solv, r);
3217 if ((r->d == 0 || r->d == -1) && r->w2 < 0)
3220 MAPSET(addedmap, p);
3222 for (j = 0; j < solv->addedmap_deduceq.count; j++)
3224 p = solv->addedmap_deduceq.elements[j];
3226 MAPSET(addedmap, p);
3228 MAPCLR(addedmap, p);
3240 solver_solve(Solver *solv, Queue *job)
3242 Pool *pool = solv->pool;
3243 Repo *installed = solv->installed;
3245 int oldnrules, initialnrules;
3246 Map addedmap; /* '1' == have rpm-rules for solvable */
3247 Map installcandidatemap;
3248 Id how, what, select, name, weak, p, pp, d;
3252 int now, solve_start;
3254 int hasbestinstalljob = 0;
3256 solve_start = solv_timems(0);
3258 /* log solver options */
3259 POOL_DEBUG(SOLV_DEBUG_STATS, "solver started\n");
3260 POOL_DEBUG(SOLV_DEBUG_STATS, "dosplitprovides=%d, noupdateprovide=%d, noinfarchcheck=%d\n", solv->dosplitprovides, solv->noupdateprovide, solv->noinfarchcheck);
3261 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);
3262 POOL_DEBUG(SOLV_DEBUG_STATS, "promoteepoch=%d, forbidselfconflicts=%d\n", pool->promoteepoch, pool->forbidselfconflicts);
3263 POOL_DEBUG(SOLV_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d, obsoleteusescolors=%d, implicitobsoleteusescolors=%d\n", pool->obsoleteusesprovides, pool->implicitobsoleteusesprovides, pool->obsoleteusescolors, pool->implicitobsoleteusescolors);
3264 POOL_DEBUG(SOLV_DEBUG_STATS, "dontinstallrecommended=%d, addalreadyrecommended=%d\n", solv->dontinstallrecommended, solv->addalreadyrecommended);
3266 /* create whatprovides if not already there */
3267 if (!pool->whatprovides)
3268 pool_createwhatprovides(pool);
3270 /* create obsolete index */
3271 policy_create_obsolete_index(solv);
3274 queue_free(&solv->job);
3275 queue_init_clone(&solv->job, job);
3276 solv->pooljobcnt = pool->pooljobs.count;
3277 if (pool->pooljobs.count)
3278 queue_insertn(&solv->job, 0, pool->pooljobs.count, pool->pooljobs.elements);
3281 /* free old stuff in jase we re-run a solver */
3282 queuep_free(&solv->update_targets);
3283 queuep_free(&solv->cleandeps_updatepkgs);
3284 queue_empty(&solv->ruleassertions);
3285 solv->bestrules_pkg = solv_free(solv->bestrules_pkg);
3286 solv->choicerules_ref = solv_free(solv->choicerules_ref);
3287 if (solv->noupdate.size)
3288 map_empty(&solv->noupdate);
3289 map_zerosize(&solv->multiversion);
3290 solv->updatemap_all = 0;
3291 map_zerosize(&solv->updatemap);
3292 solv->bestupdatemap_all = 0;
3293 map_zerosize(&solv->bestupdatemap);
3294 solv->fixmap_all = 0;
3295 map_zerosize(&solv->fixmap);
3296 solv->dupmap_all = 0;
3297 map_zerosize(&solv->dupmap);
3298 map_zerosize(&solv->dupinvolvedmap);
3299 solv->droporphanedmap_all = 0;
3300 map_zerosize(&solv->droporphanedmap);
3301 map_zerosize(&solv->cleandepsmap);
3302 map_zerosize(&solv->weakrulemap);
3303 queue_empty(&solv->weakruleq);
3304 solv->watches = solv_free(solv->watches);
3305 queue_empty(&solv->ruletojob);
3306 if (solv->decisionq.count)
3307 memset(solv->decisionmap, 0, pool->nsolvables * sizeof(Id));
3308 queue_empty(&solv->decisionq);
3309 queue_empty(&solv->decisionq_why);
3310 solv->decisioncnt_update = solv->decisioncnt_keep = solv->decisioncnt_resolve = solv->decisioncnt_weak = solv->decisioncnt_orphan = 0;
3311 queue_empty(&solv->learnt_why);
3312 queue_empty(&solv->learnt_pool);
3313 queue_empty(&solv->branches);
3314 solv->propagate_index = 0;
3315 queue_empty(&solv->problems);
3316 queue_empty(&solv->solutions);
3317 queue_empty(&solv->orphaned);
3318 solv->stats_learned = solv->stats_unsolvable = 0;
3319 if (solv->recommends_index)
3321 map_empty(&solv->recommendsmap);
3322 map_empty(&solv->suggestsmap);
3323 queuep_free(&solv->recommendscplxq);
3324 queuep_free(&solv->suggestscplxq);
3325 solv->recommends_index = 0;
3327 queuep_free(&solv->brokenorphanrules);
3328 solv->specialupdaters = solv_free(solv->specialupdaters);
3332 * create basic rule set of all involved packages
3333 * use addedmap bitmap to make sure we don't create rules twice
3336 /* create multiversion map if needed */
3337 solver_calculate_multiversionmap(pool, job, &solv->multiversion);
3339 map_init(&addedmap, pool->nsolvables);
3340 MAPSET(&addedmap, SYSTEMSOLVABLE);
3342 map_init(&installcandidatemap, pool->nsolvables);
3345 now = solv_timems(0);
3347 * create rules for all package that could be involved with the solving
3348 * so called: rpm rules
3351 initialnrules = solv->rpmrules_end ? solv->rpmrules_end : 1;
3352 if (initialnrules > 1)
3353 deduceq2addedmap(solv, &addedmap);
3354 if (solv->nrules != initialnrules)
3355 solver_shrinkrules(solv, initialnrules);
3356 solv->nrules = initialnrules;
3357 solv->rpmrules_end = 0;
3361 /* check for update/verify jobs as they need to be known early */
3362 for (i = 0; i < job->count; i += 2)
3364 how = job->elements[i];
3365 what = job->elements[i + 1];
3366 select = how & SOLVER_SELECTMASK;
3367 switch (how & SOLVER_JOBMASK)
3370 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3371 solv->fixmap_all = 1;
3372 FOR_JOB_SELECT(p, pp, select, what)
3374 s = pool->solvables + p;
3375 if (s->repo != installed)
3377 if (!solv->fixmap.size)
3378 map_grow(&solv->fixmap, installed->end - installed->start);
3379 MAPSET(&solv->fixmap, p - installed->start);
3383 if (select == SOLVER_SOLVABLE_ALL)
3385 solv->updatemap_all = 1;
3386 if (how & SOLVER_FORCEBEST)
3387 solv->bestupdatemap_all = 1;
3388 if (how & SOLVER_CLEANDEPS)
3390 FOR_REPO_SOLVABLES(installed, p, s)
3391 add_cleandeps_package(solv, p);
3394 else if (select == SOLVER_SOLVABLE_REPO)
3396 Repo *repo = pool_id2repo(pool, what);
3399 if (repo == installed && !(how & SOLVER_TARGETED))
3401 solv->updatemap_all = 1;
3402 if (how & SOLVER_FORCEBEST)
3403 solv->bestupdatemap_all = 1;
3404 if (how & SOLVER_CLEANDEPS)
3406 FOR_REPO_SOLVABLES(installed, p, s)
3407 add_cleandeps_package(solv, p);
3411 if (solv->noautotarget && !(how & SOLVER_TARGETED))
3413 /* targeted update */
3414 FOR_REPO_SOLVABLES(repo, p, s)
3415 add_update_target(solv, p, how);
3419 if (!(how & SOLVER_TARGETED))
3422 FOR_JOB_SELECT(p, pp, select, what)
3424 s = pool->solvables + p;
3425 if (s->repo != installed)
3427 if (!solv->updatemap.size)
3428 map_grow(&solv->updatemap, installed->end - installed->start);
3429 MAPSET(&solv->updatemap, p - installed->start);
3430 if (how & SOLVER_FORCEBEST)
3432 if (!solv->bestupdatemap.size)
3433 map_grow(&solv->bestupdatemap, installed->end - installed->start);
3434 MAPSET(&solv->bestupdatemap, p - installed->start);
3436 if (how & SOLVER_CLEANDEPS)
3437 add_cleandeps_package(solv, p);
3440 if (!targeted || solv->noautotarget)
3443 FOR_JOB_SELECT(p, pp, select, what)
3444 add_update_target(solv, p, how);
3452 if (solv->update_targets)
3453 transform_update_targets(solv);
3455 oldnrules = solv->nrules;
3456 FOR_REPO_SOLVABLES(installed, p, s)
3457 solver_addrpmrulesforsolvable(solv, s, &addedmap);
3458 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
3459 oldnrules = solv->nrules;
3460 FOR_REPO_SOLVABLES(installed, p, s)
3461 solver_addrpmrulesforupdaters(solv, s, &addedmap, 1);
3462 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
3466 * create rules for all packages involved in the job
3467 * (to be installed or removed)
3470 oldnrules = solv->nrules;
3471 for (i = 0; i < job->count; i += 2)
3473 how = job->elements[i];
3474 what = job->elements[i + 1];
3475 select = how & SOLVER_SELECTMASK;
3477 switch (how & SOLVER_JOBMASK)
3479 case SOLVER_INSTALL:
3480 FOR_JOB_SELECT(p, pp, select, what)
3482 MAPSET(&installcandidatemap, p);
3483 solver_addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
3486 case SOLVER_DISTUPGRADE:
3487 if (select == SOLVER_SOLVABLE_ALL)
3489 solv->dupmap_all = 1;
3490 solv->updatemap_all = 1;
3491 if (how & SOLVER_FORCEBEST)
3492 solv->bestupdatemap_all = 1;
3494 if (!solv->dupmap_all)
3501 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
3505 * add rules for suggests, enhances
3507 oldnrules = solv->nrules;
3508 solver_addrpmrulesforweak(solv, &addedmap);
3509 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
3511 #ifdef ENABLE_LINKED_PKGS
3512 oldnrules = solv->nrules;
3513 solver_addrpmrulesforlinked(solv, &addedmap);
3514 POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules because of linked packages\n", solv->nrules - oldnrules);
3518 * first pass done, we now have all the rpm rules we need.
3519 * unify existing rules before going over all job rules and
3521 * at this point the system is always solvable,
3522 * as an empty system (remove all packages) is a valid solution
3525 IF_POOLDEBUG (SOLV_DEBUG_STATS)
3527 int possible = 0, installable = 0;
3528 for (i = 1; i < pool->nsolvables; i++)
3530 if (pool_installable(pool, pool->solvables + i))
3532 if (MAPTST(&addedmap, i))
3535 POOL_DEBUG(SOLV_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
3538 if (solv->nrules > initialnrules)
3539 solver_unifyrules(solv); /* remove duplicate rpm rules */
3540 solv->rpmrules_end = solv->nrules; /* mark end of rpm rules */
3542 if (solv->nrules > initialnrules)
3543 addedmap2deduceq(solv, &addedmap); /* so that we can recreate the addedmap */
3545 POOL_DEBUG(SOLV_DEBUG_STATS, "rpm rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
3546 POOL_DEBUG(SOLV_DEBUG_STATS, "rpm rule creation took %d ms\n", solv_timems(now));
3548 /* create dup maps if needed. We need the maps early to create our
3551 solver_createdupmaps(solv);
3554 * create feature rules
3556 * foreach installed:
3557 * create assertion (keep installed, if no update available)
3559 * create update rule (A|update1(A)|update2(A)|...)
3561 * those are used later on to keep a version of the installed packages in
3565 solv->featurerules = solv->nrules; /* mark start of feature rules */
3568 /* foreach possibly installed solvable */
3569 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3571 if (s->repo != installed)
3573 solver_addrule(solv, 0, 0); /* create dummy rule */
3576 solver_addupdaterule(solv, s, 1); /* allow s to be updated */
3578 /* make sure we accounted for all rules */
3579 assert(solv->nrules - solv->featurerules == installed->end - installed->start);
3581 solv->featurerules_end = solv->nrules;
3584 * Add update rules for installed solvables
3586 * almost identical to feature rules
3587 * except that downgrades/archchanges/vendorchanges are not allowed
3590 solv->updaterules = solv->nrules;
3593 { /* foreach installed solvables */
3594 /* we create all update rules, but disable some later on depending on the job */
3595 for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3599 if (s->repo != installed)
3601 solver_addrule(solv, 0, 0); /* create dummy rule */
3604 solver_addupdaterule(solv, s, 0); /* allowall = 0: downgrades not allowed */
3606 * check for and remove duplicate
3608 r = solv->rules + solv->nrules - 1; /* r: update rule */
3611 sr = r - (installed->end - installed->start); /* sr: feature rule */
3612 /* it's also orphaned if the feature rule consists just of the installed package */
3613 if (!solv->dupmap_all && sr->p == i && !sr->d && !sr->w2)
3614 queue_push(&solv->orphaned, i);
3615 if (!solver_rulecmp(solv, r, sr))
3616 memset(sr, 0, sizeof(*sr)); /* delete unneeded feature rule */
3618 solver_disablerule(solv, sr); /* disable feature rule for now */
3620 /* consistency check: we added a rule for _every_ installed solvable */
3621 assert(solv->nrules - solv->updaterules == installed->end - installed->start);
3623 solv->updaterules_end = solv->nrules;
3627 * now add all job rules
3630 solv->jobrules = solv->nrules;
3631 for (i = 0; i < job->count; i += 2)
3633 oldnrules = solv->nrules;
3635 if (i && i == solv->pooljobcnt)
3636 POOL_DEBUG(SOLV_DEBUG_JOB, "end of pool jobs\n");
3637 how = job->elements[i];
3638 what = job->elements[i + 1];
3639 weak = how & SOLVER_WEAK;
3640 select = how & SOLVER_SELECTMASK;
3641 switch (how & SOLVER_JOBMASK)
3643 case SOLVER_INSTALL:
3644 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3645 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3646 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3647 if (select == SOLVER_SOLVABLE)
3655 FOR_JOB_SELECT(p, pp, select, what)
3659 if (select == SOLVER_SOLVABLE_ONE_OF)
3660 break; /* ignore empty installs */
3661 /* no candidate found or unsupported, make this an impossible rule */
3662 queue_push(&q, -SYSTEMSOLVABLE);
3664 p = queue_shift(&q); /* get first candidate */
3665 d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q); /* internalize */
3667 /* force install of namespace supplements hack */
3668 if (select == SOLVER_SOLVABLE_PROVIDES && !d && (p == SYSTEMSOLVABLE || p == -SYSTEMSOLVABLE) && ISRELDEP(what))
3670 Reldep *rd = GETRELDEP(pool, what);
3671 if (rd->flags == REL_NAMESPACE)
3674 if (!solv->installsuppdepq)
3676 solv->installsuppdepq = solv_calloc(1, sizeof(Queue));
3677 queue_init(solv->installsuppdepq);
3679 queue_pushunique(solv->installsuppdepq, rd->evr == 0 ? rd->name : what);
3682 solver_addjobrule(solv, p, d, i, weak);
3683 if (how & SOLVER_FORCEBEST)
3684 hasbestinstalljob = 1;
3687 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %s%serase %s\n", weak ? "weak " : "", how & SOLVER_CLEANDEPS ? "clean deps " : "", solver_select2str(pool, select, what));
3688 if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3689 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3690 /* specific solvable: by id or by nevra */
3691 name = (select == SOLVER_SOLVABLE || (select == SOLVER_SOLVABLE_NAME && ISRELDEP(what))) ? 0 : -1;
3692 if (select == SOLVER_SOLVABLE_ALL) /* hmmm ;) */
3694 FOR_POOL_SOLVABLES(p)
3695 solver_addjobrule(solv, -p, 0, i, weak);
3697 else if (select == SOLVER_SOLVABLE_REPO)
3699 Repo *repo = pool_id2repo(pool, what);
3701 FOR_REPO_SOLVABLES(repo, p, s)
3702 solver_addjobrule(solv, -p, 0, i, weak);
3704 FOR_JOB_SELECT(p, pp, select, what)
3706 s = pool->solvables + p;
3707 if (installed && s->repo == installed)
3708 name = !name ? s->name : -1;
3709 solver_addjobrule(solv, -p, 0, i, weak);
3711 /* special case for "erase a specific solvable": we also
3712 * erase all other solvables with that name, so that they
3713 * don't get picked up as replacement.
3714 * name is > 0 if exactly one installed solvable matched.
3716 /* XXX: look also at packages that obsolete this package? */
3721 FOR_PROVIDES(p, pp, name)
3723 s = pool->solvables + p;
3724 if (s->name != name)
3726 /* keep other versions installed */
3727 if (s->repo == installed)
3729 /* keep installcandidates of other jobs */
3730 if (MAPTST(&installcandidatemap, p))
3732 /* don't add the same rule twice */
3733 for (j = oldnrules; j < k; j++)
3734 if (solv->rules[j].p == -p)
3737 solver_addjobrule(solv, -p, 0, i, weak); /* remove by id */
3743 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3746 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sverify %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3748 case SOLVER_WEAKENDEPS:
3749 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3750 if (select != SOLVER_SOLVABLE)
3752 s = pool->solvables + what;
3753 weaken_solvable_deps(solv, what);
3755 case SOLVER_MULTIVERSION:
3756 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %smultiversion %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3759 POOL_DEBUG(SOLV_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3760 if (select == SOLVER_SOLVABLE_ALL)
3762 FOR_POOL_SOLVABLES(p)
3763 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3765 else if (select == SOLVER_SOLVABLE_REPO)
3767 Repo *repo = pool_id2repo(pool, what);
3769 FOR_REPO_SOLVABLES(repo, p, s)
3770 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3772 FOR_JOB_SELECT(p, pp, select, what)
3773 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, i, weak);
3775 case SOLVER_DISTUPGRADE:
3776 POOL_DEBUG(SOLV_DEBUG_JOB, "job: distupgrade %s\n", solver_select2str(pool, select, what));
3778 case SOLVER_DROP_ORPHANED:
3779 POOL_DEBUG(SOLV_DEBUG_JOB, "job: drop orphaned %s\n", solver_select2str(pool, select, what));
3780 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3781 solv->droporphanedmap_all = 1;
3782 FOR_JOB_SELECT(p, pp, select, what)
3784 s = pool->solvables + p;
3785 if (!installed || s->repo != installed)
3787 if (!solv->droporphanedmap.size)
3788 map_grow(&solv->droporphanedmap, installed->end - installed->start);
3789 MAPSET(&solv->droporphanedmap, p - installed->start);
3792 case SOLVER_USERINSTALLED:
3793 POOL_DEBUG(SOLV_DEBUG_JOB, "job: user installed %s\n", solver_select2str(pool, select, what));
3796 POOL_DEBUG(SOLV_DEBUG_JOB, "job: unknown job\n");
3804 IF_POOLDEBUG (SOLV_DEBUG_JOB)
3807 if (solv->nrules == oldnrules)
3808 POOL_DEBUG(SOLV_DEBUG_JOB, " - no rule created\n");
3809 for (j = oldnrules; j < solv->nrules; j++)
3811 POOL_DEBUG(SOLV_DEBUG_JOB, " - job ");
3812 solver_printrule(solv, SOLV_DEBUG_JOB, solv->rules + j);
3816 assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
3817 solv->jobrules_end = solv->nrules;
3819 /* now create infarch and dup rules */
3820 if (!solv->noinfarchcheck)
3822 solver_addinfarchrules(solv, &addedmap);
3824 if (pool->implicitobsoleteusescolors)
3826 /* currently doesn't work well with infarch rules, so make
3828 for (i = solv->infarchrules; i < solv->infarchrules_end; i++)
3829 queue_push(&solv->weakruleq, i);
3834 solv->infarchrules = solv->infarchrules_end = solv->nrules;
3837 solver_addduprules(solv, &addedmap);
3839 solv->duprules = solv->duprules_end = solv->nrules;
3841 if (solv->bestupdatemap_all || solv->bestupdatemap.size || hasbestinstalljob)
3842 solver_addbestrules(solv, hasbestinstalljob);
3844 solv->bestrules = solv->bestrules_end = solv->nrules;
3847 solver_freedupmaps(solv); /* no longer needed */
3850 solver_addchoicerules(solv);
3852 solv->choicerules = solv->choicerules_end = solv->nrules;
3856 for (i = solv->featurerules; i < solv->nrules; i++)
3857 solver_printruleclass(solv, SOLV_DEBUG_RESULT, solv->rules + i);
3859 /* all rules created
3860 * --------------------------------------------------------------
3861 * prepare for solving
3864 /* free unneeded memory */
3865 map_free(&addedmap);
3866 map_free(&installcandidatemap);
3869 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);
3870 POOL_DEBUG(SOLV_DEBUG_STATS, "overall rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
3872 /* create weak map */
3873 map_init(&solv->weakrulemap, solv->nrules);
3874 for (i = 0; i < solv->weakruleq.count; i++)
3876 p = solv->weakruleq.elements[i];
3877 MAPSET(&solv->weakrulemap, p);
3880 /* enable cleandepsmap creation if we have updatepkgs */
3881 if (solv->cleandeps_updatepkgs && !solv->cleandepsmap.size)
3882 map_grow(&solv->cleandepsmap, installed->end - installed->start);
3884 if (solv->cleandeps_mistakes)
3886 queue_free(solv->cleandeps_mistakes);
3887 solv->cleandeps_mistakes = solv_free(solv->cleandeps_mistakes);
3890 /* all new rules are learnt after this point */
3891 solv->learntrules = solv->nrules;
3893 /* create watches chains */
3896 /* create assertion index. it is only used to speed up
3897 * makeruledecsions() a bit */
3898 for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
3899 if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
3900 queue_push(&solv->ruleassertions, i);
3902 /* disable update rules that conflict with our job */
3903 solver_disablepolicyrules(solv);
3905 /* break orphans if requested */
3906 if (solv->dupmap_all && solv->orphaned.count && solv->break_orphans)
3907 solver_breakorphans(solv);
3909 /* make initial decisions based on assertion rules */
3910 makeruledecisions(solv);
3911 POOL_DEBUG(SOLV_DEBUG_SOLVER, "problems so far: %d\n", solv->problems.count);
3914 * ********************************************
3916 * ********************************************
3919 now = solv_timems(0);
3920 solver_run_sat(solv, 1, solv->dontinstallrecommended ? 0 : 1);
3921 POOL_DEBUG(SOLV_DEBUG_STATS, "solver took %d ms\n", solv_timems(now));
3924 * prepare solution queue if there were problems
3926 solver_prepare_solutions(solv);
3928 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);
3929 POOL_DEBUG(SOLV_DEBUG_STATS, "solver_solve took %d ms\n", solv_timems(solve_start));
3931 /* return number of problems */
3932 return solv->problems.count ? solv->problems.count / 2 : 0;
3936 solver_create_transaction(Solver *solv)
3938 return transaction_create_decisionq(solv->pool, &solv->decisionq, &solv->multiversion);
3941 void solver_get_orphaned(Solver *solv, Queue *orphanedq)
3943 queue_free(orphanedq);
3944 queue_init_clone(orphanedq, &solv->orphaned);
3947 void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected)
3949 Pool *pool = solv->pool;
3950 Queue redoq, disabledq;
3956 if (!recommendationsq && !suggestionsq)
3959 map_init(&obsmap, pool->nsolvables);
3960 if (solv->installed)
3962 Id obs, *obsp, p, po, ppo;
3963 for (p = solv->installed->start; p < solv->installed->end; p++)
3965 s = pool->solvables + p;
3966 if (s->repo != solv->installed || !s->obsoletes)
3968 if (solv->decisionmap[p] <= 0)
3970 if (solv->multiversion.size && MAPTST(&solv->multiversion, p))
3972 obsp = s->repo->idarraydata + s->obsoletes;
3973 /* foreach obsoletes */
3974 while ((obs = *obsp++) != 0)
3975 FOR_PROVIDES(po, ppo, obs)
3976 MAPSET(&obsmap, po);
3981 queue_init(&disabledq);
3983 /* disable all erase jobs (including weak "keep uninstalled" rules) */
3984 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
3986 if (r->d < 0) /* disabled ? */
3988 if (r->p >= 0) /* install job? */
3990 queue_push(&disabledq, i);
3991 solver_disablerule(solv, r);
3997 enabledisablelearntrules(solv);
3998 removedisabledconflicts(solv, &redoq);
4002 * find recommended packages
4004 if (recommendationsq)
4006 Id rec, *recp, p, pp;
4008 queue_empty(recommendationsq);
4009 /* create map of all recommened packages */
4010 solv->recommends_index = -1;
4011 MAPZERO(&solv->recommendsmap);
4013 /* put all packages the solver already chose in the map */
4014 if (solv->decisioncnt_weak)
4016 for (i = solv->decisioncnt_weak; i < solv->decisioncnt_orphan; i++)
4019 why = solv->decisionq_why.elements[i];
4021 continue; /* forced by unit rule or dep resolving */
4022 p = solv->decisionq.elements[i];
4025 MAPSET(&solv->recommendsmap, p);
4029 for (i = 0; i < solv->decisionq.count; i++)
4031 p = solv->decisionq.elements[i];
4034 s = pool->solvables + p;
4037 recp = s->repo->idarraydata + s->recommends;
4038 while ((rec = *recp++) != 0)
4040 #ifdef ENABLE_COMPLEX_DEPS
4041 if (pool_is_complex_dep(pool, rec))
4043 do_complex_recommendations(solv, rec, &solv->recommendsmap, noselected);
4047 FOR_PROVIDES(p, pp, rec)
4048 if (solv->decisionmap[p] > 0)
4054 FOR_PROVIDES(p, pp, rec)
4055 if (solv->decisionmap[p] > 0)
4056 MAPSET(&solv->recommendsmap, p);
4058 continue; /* p != 0: already fulfilled */
4060 FOR_PROVIDES(p, pp, rec)
4061 MAPSET(&solv->recommendsmap, p);
4065 for (i = 1; i < pool->nsolvables; i++)
4067 if (solv->decisionmap[i] < 0)
4069 if (solv->decisionmap[i] > 0 && noselected)
4071 if (MAPTST(&obsmap, i))
4073 s = pool->solvables + i;
4074 if (!MAPTST(&solv->recommendsmap, i))
4076 if (!s->supplements)
4078 if (!pool_installable(pool, s))
4080 if (!solver_is_supplementing(solv, s))
4083 queue_push(recommendationsq, i);
4085 /* we use MODE_SUGGEST here so that repo prio is ignored */
4086 policy_filter_unwanted(solv, recommendationsq, POLICY_MODE_SUGGEST);
4090 * find suggested packages
4095 Id sug, *sugp, p, pp;
4097 queue_empty(suggestionsq);
4098 /* create map of all suggests that are still open */
4099 solv->recommends_index = -1;
4100 MAPZERO(&solv->suggestsmap);
4101 for (i = 0; i < solv->decisionq.count; i++)
4103 p = solv->decisionq.elements[i];
4106 s = pool->solvables + p;
4109 sugp = s->repo->idarraydata + s->suggests;
4110 while ((sug = *sugp++) != 0)
4112 #ifdef ENABLE_COMPLEX_DEPS
4113 if (pool_is_complex_dep(pool, sug))
4115 do_complex_recommendations(solv, sug, &solv->suggestsmap, noselected);
4119 FOR_PROVIDES(p, pp, sug)
4120 if (solv->decisionmap[p] > 0)
4126 FOR_PROVIDES(p, pp, sug)
4127 if (solv->decisionmap[p] > 0)
4128 MAPSET(&solv->suggestsmap, p);
4130 continue; /* already fulfilled */
4132 FOR_PROVIDES(p, pp, sug)
4133 MAPSET(&solv->suggestsmap, p);
4137 for (i = 1; i < pool->nsolvables; i++)
4139 if (solv->decisionmap[i] < 0)
4141 if (solv->decisionmap[i] > 0 && noselected)
4143 if (MAPTST(&obsmap, i))
4145 s = pool->solvables + i;
4146 if (!MAPTST(&solv->suggestsmap, i))
4150 if (!pool_installable(pool, s))
4152 if (!solver_is_enhancing(solv, s))
4155 queue_push(suggestionsq, i);
4157 policy_filter_unwanted(solv, suggestionsq, POLICY_MODE_SUGGEST);
4160 /* undo removedisabledconflicts */
4162 undo_removedisabledconflicts(solv, &redoq);
4165 /* undo job rule disabling */
4166 for (i = 0; i < disabledq.count; i++)
4167 solver_enablerule(solv, solv->rules + disabledq.elements[i]);
4168 queue_free(&disabledq);
4173 /***********************************************************************/
4174 /* disk usage computations */
4176 /*-------------------------------------------------------------------
4178 * calculate DU changes
4182 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
4186 solver_create_state_maps(solv, &installedmap, 0);
4187 pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
4188 map_free(&installedmap);
4192 /*-------------------------------------------------------------------
4194 * calculate changes in install size
4198 solver_calc_installsizechange(Solver *solv)
4203 solver_create_state_maps(solv, &installedmap, 0);
4204 change = pool_calc_installsizechange(solv->pool, &installedmap);
4205 map_free(&installedmap);
4210 solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap)
4212 pool_create_state_maps(solv->pool, &solv->decisionq, installedmap, conflictsmap);
4216 solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res)
4218 Pool *pool = solv->pool;
4221 pool_create_state_maps(pool, &solv->decisionq, &installedmap, 0);
4222 pool_trivial_installable_multiversionmap(pool, &installedmap, pkgs, res, solv->multiversion.size ? &solv->multiversion : 0);
4223 for (i = 0; i < res->count; i++)
4224 if (res->elements[i] != -1)
4226 Solvable *s = pool->solvables + pkgs->elements[i];
4227 if (!strncmp("patch:", pool_id2str(pool, s->name), 6) && solvable_is_irrelevant_patch(s, &installedmap))
4228 res->elements[i] = -1;
4230 map_free(&installedmap);
4233 /*-------------------------------------------------------------------
4235 * decision introspection
4239 solver_get_decisionlevel(Solver *solv, Id p)
4241 return solv->decisionmap[p];
4245 solver_get_decisionqueue(Solver *solv, Queue *decisionq)
4247 queue_free(decisionq);
4248 queue_init_clone(decisionq, &solv->decisionq);
4252 solver_get_lastdecisionblocklevel(Solver *solv)
4255 if (solv->decisionq.count == 0)
4257 p = solv->decisionq.elements[solv->decisionq.count - 1];
4260 return solv->decisionmap[p] < 0 ? -solv->decisionmap[p] : solv->decisionmap[p];
4264 solver_get_decisionblock(Solver *solv, int level, Queue *decisionq)
4269 queue_empty(decisionq);
4270 for (i = 0; i < solv->decisionq.count; i++)
4272 p = solv->decisionq.elements[i];
4275 if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
4278 if (i == solv->decisionq.count)
4280 for (i = 0; i < solv->decisionq.count; i++)
4282 p = solv->decisionq.elements[i];
4285 if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
4286 queue_push(decisionq, p);
4293 solver_describe_decision(Solver *solv, Id p, Id *infop)
4300 if (!solv->decisionmap[p])
4301 return SOLVER_REASON_UNRELATED;
4302 pp = solv->decisionmap[p] < 0 ? -p : p;
4303 for (i = 0; i < solv->decisionq.count; i++)
4304 if (solv->decisionq.elements[i] == pp)
4306 if (i == solv->decisionq.count) /* just in case... */
4307 return SOLVER_REASON_UNRELATED;
4308 why = solv->decisionq_why.elements[i];
4310 *infop = why > 0 ? why : -why;
4312 return SOLVER_REASON_UNIT_RULE;
4314 if (i < solv->decisioncnt_update)
4317 return SOLVER_REASON_KEEP_INSTALLED;
4318 return SOLVER_REASON_RESOLVE_JOB;
4320 if (i < solv->decisioncnt_keep)
4322 if (why == 0 && pp < 0)
4323 return SOLVER_REASON_CLEANDEPS_ERASE;
4324 return SOLVER_REASON_UPDATE_INSTALLED;
4326 if (i < solv->decisioncnt_resolve)
4328 if (why == 0 && pp < 0)
4329 return SOLVER_REASON_CLEANDEPS_ERASE;
4330 return SOLVER_REASON_KEEP_INSTALLED;
4333 return SOLVER_REASON_RESOLVE;
4334 /* weak or orphaned */
4335 if (solv->decisionq.count < solv->decisioncnt_orphan)
4336 return SOLVER_REASON_WEAKDEP;
4337 return SOLVER_REASON_RESOLVE_ORPHAN;
4342 solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq)
4344 Pool *pool = solv->pool;
4346 int level = solv->decisionmap[p];
4353 for (decisionno = 0; decisionno < solv->decisionq.count; decisionno++)
4354 if (solv->decisionq.elements[decisionno] == p)
4356 if (decisionno == solv->decisionq.count)
4358 if (decisionno < solv->decisioncnt_weak || decisionno >= solv->decisioncnt_orphan)
4361 /* 1) list all packages that recommend us */
4362 for (i = 1; i < pool->nsolvables; i++)
4364 Id *recp, rec, pp2, p2;
4365 if (solv->decisionmap[i] < 0 || solv->decisionmap[i] >= level)
4367 s = pool->solvables + i;
4370 if (!solv->addalreadyrecommended && s->repo == solv->installed)
4372 recp = s->repo->idarraydata + s->recommends;
4373 while ((rec = *recp++) != 0)
4376 FOR_PROVIDES(p2, pp2, rec)
4382 /* if p2 is already installed, this recommends is ignored */
4383 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
4389 queue_push(whyq, SOLVER_REASON_RECOMMENDED);
4390 queue_push2(whyq, p2, rec);
4394 /* 2) list all supplements */
4395 s = pool->solvables + p;
4396 if (s->supplements && level > 0)
4398 Id *supp, sup, pp2, p2;
4399 /* this is a hack. to use solver_dep_fulfilled we temporarily clear
4400 * everything above our level in the decisionmap */
4401 for (i = decisionno; i < solv->decisionq.count; i++ )
4403 p2 = solv->decisionq.elements[i];
4405 solv->decisionmap[p2] = -solv->decisionmap[p2];
4407 supp = s->repo->idarraydata + s->supplements;
4408 while ((sup = *supp++) != 0)
4409 if (solver_dep_fulfilled(solv, sup))
4412 /* let's see if this is an easy supp */
4413 FOR_PROVIDES(p2, pp2, sup)
4415 if (!solv->addalreadyrecommended && solv->installed)
4417 if (pool->solvables[p2].repo == solv->installed)
4420 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
4422 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
4423 queue_push2(whyq, p2, sup);
4429 /* hard case, just note dependency with no package */
4430 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
4431 queue_push2(whyq, 0, sup);
4434 for (i = decisionno; i < solv->decisionq.count; i++)
4436 p2 = solv->decisionq.elements[i];
4438 solv->decisionmap[p2] = -solv->decisionmap[p2];
4444 pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what)
4447 how &= SOLVER_SELECTMASK;
4449 if (how == SOLVER_SOLVABLE_ALL)
4451 FOR_POOL_SOLVABLES(p)
4452 queue_push(pkgs, p);
4454 else if (how == SOLVER_SOLVABLE_REPO)
4456 Repo *repo = pool_id2repo(pool, what);
4459 FOR_REPO_SOLVABLES(repo, p, s)
4460 queue_push(pkgs, p);
4464 FOR_JOB_SELECT(p, pp, how, what)
4465 queue_push(pkgs, p);
4470 pool_isemptyupdatejob(Pool *pool, Id how, Id what)
4473 Id select = how & SOLVER_SELECTMASK;
4474 if ((how & SOLVER_JOBMASK) != SOLVER_UPDATE)
4476 if (select == SOLVER_SOLVABLE_ALL || select == SOLVER_SOLVABLE_REPO)
4478 if (!pool->installed)
4480 FOR_JOB_SELECT(p, pp, select, what)
4481 if (pool->solvables[p].repo == pool->installed)
4484 FOR_JOB_SELECT(p, pp, select, what)
4486 Solvable *s = pool->solvables + p;
4487 FOR_PROVIDES(pi, pip, s->name)
4489 Solvable *si = pool->solvables + pi;
4490 if (si->repo != pool->installed || si->name != s->name)
4496 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
4497 while ((obs = *obsp++) != 0)
4499 FOR_PROVIDES(pi, pip, obs)
4501 Solvable *si = pool->solvables + pi;
4502 if (si->repo != pool->installed)
4504 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
4506 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
4517 get_userinstalled_cmp(const void *ap, const void *bp, void *dp)
4519 return *(Id *)ap - *(Id *)bp;
4523 get_userinstalled_cmp_names(const void *ap, const void *bp, void *dp)
4526 return strcmp(pool_id2str(pool, *(Id *)ap), pool_id2str(pool, *(Id *)bp));
4530 get_userinstalled_sort_uniq(Pool *pool, Queue *q, int flags)
4534 if ((flags & GET_USERINSTALLED_NAMES) != 0)
4535 solv_sort(q->elements, q->count, sizeof(Id), get_userinstalled_cmp_names, pool);
4537 solv_sort(q->elements, q->count, sizeof(Id), get_userinstalled_cmp, 0);
4538 for (i = j = 0; i < q->count; i++)
4539 if (q->elements[i] != lastp)
4540 q->elements[j++] = lastp = q->elements[i];
4541 queue_truncate(q, j);
4545 solver_get_userinstalled(Solver *solv, Queue *q, int flags)
4547 Pool *pool = solv->pool;
4550 Repo *installed = solv->installed;
4554 map_init(&userinstalled, 0);
4556 /* first process jobs */
4557 for (i = 0; i < solv->job.count; i += 2)
4559 Id how = solv->job.elements[i];
4561 if (installed && (how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
4563 if (!userinstalled.size)
4564 map_grow(&userinstalled, installed->end - installed->start);
4565 what = solv->job.elements[i + 1];
4566 select = how & SOLVER_SELECTMASK;
4567 if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && what == installed->repoid))
4568 FOR_REPO_SOLVABLES(installed, p, s)
4569 MAPSET(&userinstalled, p - installed->start);
4570 FOR_JOB_SELECT(p, pp, select, what)
4571 if (pool->solvables[p].repo == installed)
4572 MAPSET(&userinstalled, p - installed->start);
4575 if ((how & SOLVER_JOBMASK) != SOLVER_INSTALL)
4577 if ((how & SOLVER_NOTBYUSER) != 0)
4579 what = solv->job.elements[i + 1];
4580 select = how & SOLVER_SELECTMASK;
4581 FOR_JOB_SELECT(p, pp, select, what)
4582 if (solv->decisionmap[p] > 0)
4585 #ifdef ENABLE_LINKED_PKGS
4586 if (has_package_link(pool, pool->solvables + p))
4591 find_package_link(pool, pool->solvables + p, 0, &lq, 0, 0);
4592 for (j = 0; j < lq.count; j++)
4593 if (solv->decisionmap[lq.elements[j]] > 0)
4594 queue_push(q, lq.elements[j]);
4599 /* now process updates of userinstalled packages */
4600 if (installed && userinstalled.size)
4602 for (i = 1; i < solv->decisionq.count; i++)
4604 p = solv->decisionq.elements[i];
4607 s = pool->solvables + p;
4610 if (s->repo == installed)
4612 if (MAPTST(&userinstalled, p - installed->start))
4616 /* new package, check if we replace a userinstalled one */
4617 FOR_PROVIDES(p2, pp, s->name)
4619 Solvable *ps = pool->solvables + p2;
4620 if (p2 == p || ps->repo != installed || !MAPTST(&userinstalled, p2 - installed->start))
4622 if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
4624 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, ps))
4629 if (!p2 && s->repo != installed && s->obsoletes)
4631 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
4632 while ((obs = *obsp++) != 0)
4634 FOR_PROVIDES(p2, pp, obs)
4636 Solvable *ps = pool->solvables + p2;
4637 if (p2 == p || ps->repo != installed || !MAPTST(&userinstalled, p2 - installed->start))
4639 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
4641 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
4652 map_free(&userinstalled);
4653 /* convert to names if asked */
4654 if ((flags & GET_USERINSTALLED_NAMES) != 0)
4656 for (i = 0; i < q->count; i++)
4658 s = pool->solvables + q->elements[i];
4659 q->elements[i] = s->name;
4662 /* sort and unify */
4664 get_userinstalled_sort_uniq(pool, q, flags);
4665 /* invert if asked */
4666 if ((flags & GET_USERINSTALLED_INVERTED) != 0)
4668 /* first generate queue with all installed packages */
4671 for (i = 1; i < solv->decisionq.count; i++)
4673 p = solv->decisionq.elements[i];
4676 s = pool->solvables + p;
4679 if ((flags & GET_USERINSTALLED_NAMES) != 0)
4680 queue_push(&invq, s->name);
4682 queue_push(&invq, p);
4684 /* push q on invq, just in case... */
4685 queue_insertn(&invq, invq.count, q->count, q->elements);
4687 get_userinstalled_sort_uniq(pool, &invq, flags);
4688 /* subtract queues (easy as they are sorted and invq is a superset of q) */
4691 for (i = j = 0; i < invq.count; i++)
4692 if (invq.elements[i] == q->elements[j])
4694 invq.elements[i] = 0;
4695 if (++j >= q->count)
4700 for (i = j = 0; i < invq.count; i++)
4701 if (invq.elements[i])
4702 queue_push(q, invq.elements[i]);
4708 pool_add_userinstalled_jobs(Pool *pool, Queue *q, Queue *job, int flags)
4712 if (flags & GET_USERINSTALLED_INVERTED)
4718 if (!pool->installed)
4721 FOR_REPO_SOLVABLES(pool->installed, p, s)
4722 queue_push(&invq, flags & GET_USERINSTALLED_NAMES ? s->name : p);
4723 queue_insertn(&invq, invq.count, q->count, q->elements);
4725 get_userinstalled_sort_uniq(pool, &invq, flags);
4726 /* now the fun part, add q again, sort, and remove all dups */
4727 queue_insertn(&invq, invq.count, q->count, q->elements);
4730 if ((flags & GET_USERINSTALLED_NAMES) != 0)
4731 solv_sort(invq.elements, invq.count, sizeof(Id), get_userinstalled_cmp_names, pool);
4733 solv_sort(invq.elements, invq.count, sizeof(Id), get_userinstalled_cmp, 0);
4737 for (i = 0; i < invq.count; i++)
4739 if (invq.elements[i] == lastid)
4745 queue_push2(job, SOLVER_USERINSTALLED | (flags & GET_USERINSTALLED_NAMES ? SOLVER_SOLVABLE_NAME : SOLVER_SOLVABLE), lastid);
4747 lastid = invq.elements[i];
4750 queue_push2(job, SOLVER_USERINSTALLED | (flags & GET_USERINSTALLED_NAMES ? SOLVER_SOLVABLE_NAME : SOLVER_SOLVABLE), lastid);
4755 for (i = 0; i < q->count; i++)
4756 queue_push2(job, SOLVER_USERINSTALLED | (flags & GET_USERINSTALLED_NAMES ? SOLVER_SOLVABLE_NAME : SOLVER_SOLVABLE), q->elements[i]);
4761 solver_select2str(Pool *pool, Id select, Id what)
4765 select &= SOLVER_SELECTMASK;
4766 if (select == SOLVER_SOLVABLE)
4767 return pool_solvid2str(pool, what);
4768 if (select == SOLVER_SOLVABLE_NAME)
4769 return pool_dep2str(pool, what);
4770 if (select == SOLVER_SOLVABLE_PROVIDES)
4772 s = pool_dep2str(pool, what);
4773 b = pool_alloctmpspace(pool, 11 + strlen(s));
4774 sprintf(b, "providing %s", s);
4777 if (select == SOLVER_SOLVABLE_ONE_OF)
4781 while ((p = pool->whatprovidesdata[what++]) != 0)
4783 s = pool_solvid2str(pool, p);
4785 b = pool_tmpappend(pool, b, ", ", s);
4787 b = pool_tmpjoin(pool, s, 0, 0);
4788 pool_freetmpspace(pool, s);
4790 return b ? b : "nothing";
4792 if (select == SOLVER_SOLVABLE_REPO)
4794 b = pool_alloctmpspace(pool, 20);
4795 sprintf(b, "repo #%d", what);
4798 if (select == SOLVER_SOLVABLE_ALL)
4799 return "all packages";
4800 return "unknown job select";
4804 pool_job2str(Pool *pool, Id how, Id what, Id flagmask)
4806 Id select = how & SOLVER_SELECTMASK;
4807 const char *strstart = 0, *strend = 0;
4811 switch (how & SOLVER_JOBMASK)
4814 return "do nothing";
4815 case SOLVER_INSTALL:
4816 if (select == SOLVER_SOLVABLE && pool->installed && pool->solvables[what].repo == pool->installed)
4817 strstart = "keep ", strend = " installed";
4818 else if (select == SOLVER_SOLVABLE || select == SOLVER_SOLVABLE_NAME)
4819 strstart = "install ";
4820 else if (select == SOLVER_SOLVABLE_PROVIDES)
4821 strstart = "install a package ";
4823 strstart = "install one of ";
4826 if (select == SOLVER_SOLVABLE && !(pool->installed && pool->solvables[what].repo == pool->installed))
4827 strstart = "keep ", strend = " uninstalled";
4828 else if (select == SOLVER_SOLVABLE_PROVIDES)
4829 strstart = "deinstall all packages ";
4831 strstart = "deinstall ";
4834 strstart = "update ";
4836 case SOLVER_WEAKENDEPS:
4837 strstart = "weaken deps of ";
4839 case SOLVER_MULTIVERSION:
4840 strstart = "multi version ";
4845 case SOLVER_DISTUPGRADE:
4846 strstart = "dist upgrade ";
4849 strstart = "verify ";
4851 case SOLVER_DROP_ORPHANED:
4852 strstart = "deinstall ", strend = " if orphaned";
4854 case SOLVER_USERINSTALLED:
4855 strstart = "regard ", strend = " as userinstalled";
4858 strstart = "unknown job ";
4861 s = pool_tmpjoin(pool, strstart, solver_select2str(pool, select, what), strend);
4863 if ((how & ~(SOLVER_SELECTMASK|SOLVER_JOBMASK)) == 0)
4866 s = pool_tmpappend(pool, s, " ", 0);
4867 if (how & SOLVER_WEAK)
4868 s = pool_tmpappend(pool, s, ",weak", 0);
4869 if (how & SOLVER_ESSENTIAL)
4870 s = pool_tmpappend(pool, s, ",essential", 0);
4871 if (how & SOLVER_CLEANDEPS)
4872 s = pool_tmpappend(pool, s, ",cleandeps", 0);
4873 if (how & SOLVER_ORUPDATE)
4874 s = pool_tmpappend(pool, s, ",orupdate", 0);
4875 if (how & SOLVER_FORCEBEST)
4876 s = pool_tmpappend(pool, s, ",forcebest", 0);
4877 if (how & SOLVER_TARGETED)
4878 s = pool_tmpappend(pool, s, ",targeted", 0);
4879 if (how & SOLVER_SETEV)
4880 s = pool_tmpappend(pool, s, ",setev", 0);
4881 if (how & SOLVER_SETEVR)
4882 s = pool_tmpappend(pool, s, ",setevr", 0);
4883 if (how & SOLVER_SETARCH)
4884 s = pool_tmpappend(pool, s, ",setarch", 0);
4885 if (how & SOLVER_SETVENDOR)
4886 s = pool_tmpappend(pool, s, ",setvendor", 0);
4887 if (how & SOLVER_SETREPO)
4888 s = pool_tmpappend(pool, s, ",setrepo", 0);
4889 if (how & SOLVER_SETNAME)
4890 s = pool_tmpappend(pool, s, ",setname", 0);
4891 if (how & SOLVER_NOAUTOSET)
4892 s = pool_tmpappend(pool, s, ",noautoset", 0);
4893 if (s[o + 1] != ',')
4894 s = pool_tmpappend(pool, s, ",?", 0);
4896 return pool_tmpappend(pool, s, "]", 0);