2 * Copyright (c) 2007-2009, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
20 #include "solver_private.h"
25 #include "solverdebug.h"
27 /**********************************************************************************/
29 /* a problem is an item on the solver's problem list. It can either be >0, in that
30 * case it is a update/infarch/dup rule, or it can be <0, which makes it refer to a job
31 * consisting of multiple job rules.
35 solver_disableproblem(Solver *solv, Id v)
42 if (v >= solv->infarchrules && v < solv->infarchrules_end)
44 Pool *pool = solv->pool;
45 Id name = pool->solvables[-solv->rules[v].p].name;
46 while (v > solv->infarchrules && pool->solvables[-solv->rules[v - 1].p].name == name)
48 for (; v < solv->infarchrules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
49 solver_disablerule(solv, solv->rules + v);
52 if (v >= solv->duprules && v < solv->duprules_end)
54 Pool *pool = solv->pool;
55 Id name = pool->solvables[-solv->rules[v].p].name;
56 while (v > solv->duprules && pool->solvables[-solv->rules[v - 1].p].name == name)
58 for (; v < solv->duprules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
59 solver_disablerule(solv, solv->rules + v);
62 solver_disablerule(solv, solv->rules + v);
66 jp = solv->ruletojob.elements;
67 if (solv->bestrules_pkg)
69 int ni = solv->bestrules_up - solv->bestrules;
70 for (i = 0; i < ni; i++)
72 int j = solv->bestrules_pkg[i];
73 if (j < 0 && jp[-j - solv->jobrules] == v)
74 solver_disablerule(solv, solv->rules + solv->bestrules + i);
77 for (i = solv->jobrules; i < solv->jobrules_end; i++, jp++)
79 solver_disablerule(solv, solv->rules + i);
82 /*-------------------------------------------------------------------
87 solver_enableproblem(Solver *solv, Id v)
95 if (v >= solv->infarchrules && v < solv->infarchrules_end)
97 Pool *pool = solv->pool;
98 Id name = pool->solvables[-solv->rules[v].p].name;
99 while (v > solv->infarchrules && pool->solvables[-solv->rules[v - 1].p].name == name)
101 for (; v < solv->infarchrules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
102 solver_enablerule(solv, solv->rules + v);
105 if (v >= solv->duprules && v < solv->duprules_end)
107 Pool *pool = solv->pool;
108 Id name = pool->solvables[-solv->rules[v].p].name;
109 while (v > solv->duprules && pool->solvables[-solv->rules[v - 1].p].name == name)
111 for (; v < solv->duprules_end && pool->solvables[-solv->rules[v].p].name == name; v++)
112 solver_enablerule(solv, solv->rules + v);
115 if (v >= solv->featurerules && v < solv->featurerules_end)
117 /* do not enable feature rule if update rule is enabled */
118 r = solv->rules + (v - solv->featurerules + solv->updaterules);
122 solver_enablerule(solv, solv->rules + v);
123 if (v >= solv->updaterules && v < solv->updaterules_end)
125 /* disable feature rule when enabling update rule */
126 r = solv->rules + (v - solv->updaterules + solv->featurerules);
128 solver_disablerule(solv, r);
133 jp = solv->ruletojob.elements;
134 if (solv->bestrules_pkg)
136 int ni = solv->bestrules_up - solv->bestrules;
137 for (i = 0; i < ni; i++)
139 int j = solv->bestrules_pkg[i];
140 if (j < 0 && jp[-j - solv->jobrules] == v)
141 solver_enablerule(solv, solv->rules + solv->bestrules + i);
144 for (i = solv->jobrules; i < solv->jobrules_end; i++, jp++)
146 solver_enablerule(solv, solv->rules + i);
150 /*-------------------------------------------------------------------
151 * turn a problem rule into a problem id by normalizing it
154 solver_ruletoproblem(Solver *solv, Id rid)
156 if (rid >= solv->jobrules && rid < solv->jobrules_end)
157 rid = -(solv->ruletojob.elements[rid - solv->jobrules] + 1);
158 else if (rid >= solv->bestrules && rid < solv->bestrules_up && solv->bestrules_pkg[rid - solv->bestrules] < 0)
159 rid = -(solv->ruletojob.elements[-solv->bestrules_pkg[rid - solv->bestrules] - solv->jobrules] + 1);
160 else if (rid > solv->infarchrules && rid < solv->infarchrules_end)
162 Pool *pool = solv->pool;
163 Id name = pool->solvables[-solv->rules[rid].p].name;
164 while (rid > solv->infarchrules && pool->solvables[-solv->rules[rid - 1].p].name == name)
167 else if (rid > solv->duprules && rid < solv->duprules_end)
169 Pool *pool = solv->pool;
170 Id name = pool->solvables[-solv->rules[rid].p].name;
171 while (rid > solv->duprules && pool->solvables[-solv->rules[rid - 1].p].name == name)
177 /*-------------------------------------------------------------------
178 * when the solver runs into a problem, it needs to disable all
179 * involved non-pkg rules and record the rules for solution
183 solver_recordproblem(Solver *solv, Id rid)
185 Id v = solver_ruletoproblem(solv, rid);
186 /* return if problem already countains our rule */
187 if (solv->problems.count)
190 for (i = solv->problems.count - 1; i >= 0; i--)
191 if (solv->problems.elements[i] == 0) /* end of last problem reached? */
193 else if (solv->problems.elements[i] == v)
196 queue_push(&solv->problems, v);
199 /*-------------------------------------------------------------------
200 * this is called when a problem is solved by disabling a rule.
201 * It calls disableproblem and then re-enables policy rules
204 solver_fixproblem(Solver *solv, Id rid)
206 Id v = solver_ruletoproblem(solv, rid);
207 solver_disableproblem(solv, v);
209 solver_reenablepolicyrules(solv, -v);
212 /*-------------------------------------------------------------------
213 * disable a set of problems
216 solver_disableproblemset(Solver *solv, int start)
219 for (i = start + 1; i < solv->problems.count - 1; i++)
220 solver_disableproblem(solv, solv->problems.elements[i]);
223 /*-------------------------------------------------------------------
224 * try to fix a problem by auto-uninstalling packages
227 solver_autouninstall(Solver *solv, int start)
229 Pool *pool = solv->pool;
231 int lastfeature = 0, lastupdate = 0;
236 if (!solv->allowuninstall && !solv->allowuninstall_all)
238 if (!solv->allowuninstallmap.size)
239 return 0; /* why did we get called? */
240 m = &solv->allowuninstallmap;
242 for (i = start + 1; i < solv->problems.count - 1; i++)
244 v = solv->problems.elements[i];
246 extraflags &= solv->job.elements[-v - 1];
247 if (v >= solv->updaterules && v < solv->updaterules_end)
250 Id p = solv->installed->start + (v - solv->updaterules);
251 if (m && !MAPTST(m, v - solv->updaterules))
253 if (pool->considered && !MAPTST(pool->considered, p))
254 continue; /* do not uninstalled disabled packages */
255 if (solv->bestrules_pkg && solv->bestrules_end > solv->bestrules)
258 for (j = start + 1; j < solv->problems.count - 1; j++)
260 Id vv = solv->problems.elements[j];
261 if (vv >= solv->bestrules && vv < solv->bestrules_end && solv->bestrules_pkg[vv - solv->bestrules] == p)
264 if (j < solv->problems.count - 1)
265 continue; /* best rule involved, do not uninstall */
267 /* check if identical to feature rule, we don't like that (except for orphans) */
268 r = solv->rules + solv->featurerules + (v - solv->updaterules);
271 /* update rule == feature rule */
274 /* prefer orphaned packages in dup mode */
275 if (solv->keep_orphans)
278 if (!r->d && !r->w2 && r->p == p)
291 if (!lastupdate && !lastfeature)
293 v = lastupdate ? lastupdate : lastfeature;
294 POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "allowuninstall disabling ");
295 solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + v);
296 /* should really be solver_fixproblem, but we know v is an update/feature rule */
297 solver_disableproblem(solv, v);
298 if (extraflags != -1 && (extraflags & SOLVER_CLEANDEPS) != 0 && solv->cleandepsmap.size)
300 /* add the package to the updatepkgs list, this will automatically turn
301 * on cleandeps mode */
302 Id p = solv->rules[v].p;
303 if (!solv->cleandeps_updatepkgs)
305 solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
306 queue_init(solv->cleandeps_updatepkgs);
310 int oldupdatepkgscnt = solv->cleandeps_updatepkgs->count;
311 queue_pushunique(solv->cleandeps_updatepkgs, p);
312 if (solv->cleandeps_updatepkgs->count != oldupdatepkgscnt)
313 solver_disablepolicyrules(solv);
320 /*-------------------------------------------------------------------
323 * Reenable all disabled weak rules (marked in weakrulemap)
328 enableweakrules(Solver *solv)
333 if (!solv->weakrulemap.size)
335 for (i = 1, r = solv->rules + i; i < solv->learntrules; i++, r++)
337 if (r->d >= 0) /* already enabled? */
339 if (!MAPTST(&solv->weakrulemap, i))
341 solver_enablerule(solv, r);
343 /* make sure broken orphan rules stay disabled */
344 if (solv->brokenorphanrules)
345 for (i = 0; i < solv->brokenorphanrules->count; i++)
346 solver_disablerule(solv, solv->rules + solv->brokenorphanrules->elements[i]);
350 /*-------------------------------------------------------------------
354 * at this point, all rules that led to conflicts are disabled.
355 * we re-enable all rules of a problem set but rule "sug", then
356 * continue to disable more rules until there as again a solution.
359 /* FIXME: think about conflicting assertions */
362 refine_suggestion(Solver *solv, Id *problem, Id sug, Queue *refined, int essentialok)
364 Pool *pool = solv->pool;
370 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
372 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "refine_suggestion start\n");
373 for (i = 0; problem[i]; i++)
375 if (problem[i] == sug)
376 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "=> ");
377 solver_printproblem(solv, problem[i]);
380 queue_empty(refined);
381 if (!essentialok && sug < 0 && (solv->job.elements[-sug - 1] & SOLVER_ESSENTIAL) != 0)
383 queue_push(refined, sug);
385 /* re-enable all problem rules with the exception of "sug"(gestion) */
388 for (i = 0; problem[i]; i++)
389 if (problem[i] != sug)
390 solver_enableproblem(solv, problem[i]);
392 solver_reenablepolicyrules(solv, -sug);
394 /* here is where the feature rules come into play: if we disabled an
395 * update rule, we enable the corresponding feature rule if there is
396 * one. We do this to make the solver downgrade packages instead of
397 * deinstalling them */
398 if (sug >= solv->updaterules && sug < solv->updaterules_end)
400 /* enable feature rule */
401 Rule *r = solv->rules + solv->featurerules + (sug - solv->updaterules);
403 solver_enablerule(solv, r);
406 enableweakrules(solv);
408 /* disabled contains all of the rules we disabled in the refinement process */
409 queue_init(&disabled);
412 int nother, nfeature, nupdate, pass;
413 queue_empty(&solv->problems);
415 /* we set disablerules to zero because we are only interested in
416 * the first problem and we don't want the solver to disable the problems */
417 solver_run_sat(solv, 0, 0);
419 if (!solv->problems.count)
421 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "no more problems!\n");
422 break; /* great, no more problems */
424 disabledcnt = disabled.count;
425 nother = nfeature = nupdate = 0;
426 for (pass = 0; pass < 2; pass++)
428 /* start with 1 to skip over proof index */
429 for (i = 1; i < solv->problems.count - 1; i++)
431 /* ignore solutions in refined */
432 v = solv->problems.elements[i];
434 break; /* end of problem reached */
435 if (!essentialok && v < 0 && (solv->job.elements[-v - 1] & SOLVER_ESSENTIAL) != 0)
436 continue; /* not that one! */
439 /* check if v is in the given problems list
440 * we allow disabling all problem rules *after* sug in
441 * pass 2, to prevent getting the same solution twice */
442 for (j = 0; problem[j]; j++)
443 if (problem[j] == v || (pass && problem[j] == sug))
448 if (v >= solv->featurerules && v < solv->featurerules_end)
450 else if (v > solv->updaterules && v < solv->updaterules_end)
454 queue_push(&disabled, v);
456 if (disabled.count != disabledcnt)
459 if (disabled.count == disabledcnt)
461 /* no solution found, this was an invalid suggestion! */
462 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "no solution found!\n");
466 if (!nother && nupdate && nfeature)
468 /* got only update rules, filter out feature rules */
469 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "throwing away feature rules\n");
470 for (i = j = disabledcnt; i < disabled.count; i++)
472 v = disabled.elements[i];
473 if (v < solv->featurerules || v >= solv->featurerules_end)
474 disabled.elements[j++] = v;
479 if (disabled.count == disabledcnt + 1)
481 /* just one suggestion, add it to refined list */
482 v = disabled.elements[disabledcnt];
483 if (!nfeature && v != sug)
484 queue_push(refined, v); /* do not record feature rules */
485 solver_disableproblem(solv, v);
487 solver_reenablepolicyrules(solv, -v);
488 if (v >= solv->updaterules && v < solv->updaterules_end)
490 Rule *r = solv->rules + (v - solv->updaterules + solv->featurerules);
492 solver_enablerule(solv, r); /* enable corresponding feature rule */
497 /* more than one solution, disable all */
498 /* do not push anything on refine list, as we do not know which solution to choose */
499 /* thus, the user will get another problem if he selects this solution, where he
500 * can choose the right one */
501 IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
503 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "more than one solution found:\n");
504 for (i = disabledcnt; i < disabled.count; i++)
505 solver_printproblem(solv, disabled.elements[i]);
507 for (i = disabledcnt; i < disabled.count; i++)
509 v = disabled.elements[i];
510 solver_disableproblem(solv, v);
511 if (v >= solv->updaterules && v < solv->updaterules_end)
513 Rule *r = solv->rules + (v - solv->updaterules + solv->featurerules);
515 solver_enablerule(solv, r);
520 /* all done, get us back into the same state as before */
521 /* enable refined rules again */
522 for (i = 0; i < disabled.count; i++)
523 solver_enableproblem(solv, disabled.elements[i]);
524 queue_free(&disabled);
526 /* reset policy rules */
527 for (i = 0; problem[i]; i++)
528 solver_enableproblem(solv, problem[i]);
529 solver_disablepolicyrules(solv);
530 /* disable problem rules again */
531 for (i = 0; problem[i]; i++)
532 solver_disableproblem(solv, problem[i]);
533 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "refine_suggestion end\n");
537 /*-------------------------------------------------------------------
538 * sorting helper for problems
540 * bring update rules before job rules
541 * make essential job rules last
545 problems_sortcmp(const void *ap, const void *bp, void *dp)
548 Id a = *(Id *)ap, b = *(Id *)bp;
555 int af = job->elements[-a - 1] & SOLVER_ESSENTIAL;
556 int bf = job->elements[-b - 1] & SOLVER_ESSENTIAL;
565 * convert a solution rule into a job modifier
568 convertsolution(Solver *solv, Id why, Queue *solutionq)
570 Pool *pool = solv->pool;
574 if (why < solv->pooljobcnt)
576 queue_push(solutionq, SOLVER_SOLUTION_POOLJOB);
577 queue_push(solutionq, why);
581 queue_push(solutionq, SOLVER_SOLUTION_JOB);
582 queue_push(solutionq, why - solv->pooljobcnt);
586 if (why >= solv->infarchrules && why < solv->infarchrules_end)
589 /* infarch rule, find replacement */
590 assert(solv->rules[why].p < 0);
591 name = pool->solvables[-solv->rules[why].p].name;
592 while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
595 for (; why < solv->infarchrules_end && pool->solvables[-solv->rules[why].p].name == name; why++)
596 if (solv->decisionmap[-solv->rules[why].p] > 0)
598 p = -solv->rules[why].p;
602 return; /* false alarm */
603 queue_push(solutionq, SOLVER_SOLUTION_INFARCH);
604 queue_push(solutionq, p);
607 if (why >= solv->duprules && why < solv->duprules_end)
610 /* dist upgrade rule, find replacement */
611 assert(solv->rules[why].p < 0);
612 name = pool->solvables[-solv->rules[why].p].name;
613 while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
616 for (; why < solv->duprules_end && pool->solvables[-solv->rules[why].p].name == name; why++)
617 if (solv->decisionmap[-solv->rules[why].p] > 0)
619 p = -solv->rules[why].p;
623 return; /* false alarm */
624 queue_push(solutionq, SOLVER_SOLUTION_DISTUPGRADE);
625 queue_push(solutionq, p);
628 if (why >= solv->updaterules && why < solv->updaterules_end)
630 /* update rule, find replacement package */
634 /* check if this is a false positive, i.e. the update rule is fulfilled */
635 rr = solv->rules + why;
636 FOR_RULELITERALS(p, pp, rr)
637 if (p > 0 && solv->decisionmap[p] > 0)
638 return; /* false alarm */
640 p = solv->installed->start + (why - solv->updaterules);
641 if (solv->decisionmap[p] > 0)
642 return; /* false alarm, turned out we can keep the package */
643 rr = solv->rules + solv->featurerules + (why - solv->updaterules);
645 rr = solv->rules + why;
648 int mvrp = 0; /* multi-version replacement */
649 FOR_RULELITERALS(rp, pp, rr)
651 if (rp > 0 && solv->decisionmap[rp] > 0 && pool->solvables[rp].repo != solv->installed)
654 if (!(solv->multiversion.size && MAPTST(&solv->multiversion, rp)))
660 /* found only multi-version replacements */
661 /* have to split solution into two parts */
662 queue_push(solutionq, p);
663 queue_push(solutionq, mvrp);
666 queue_push(solutionq, p);
667 queue_push(solutionq, rp);
670 if (why >= solv->bestrules && why < solv->bestrules_end)
675 /* check false positive */
676 rr = solv->rules + why;
677 FOR_RULELITERALS(p, pp, rr)
678 if (p > 0 && solv->decisionmap[p] > 0)
679 return; /* false alarm */
680 /* check update/feature rule */
681 p = solv->bestrules_pkg[why - solv->bestrules];
685 queue_push(solutionq, 0);
686 queue_push(solutionq, solv->ruletojob.elements[-p - solv->jobrules] + 1);
689 if (solv->decisionmap[p] > 0)
691 /* disable best rule by keeping the old package */
692 queue_push(solutionq, SOLVER_SOLUTION_BEST);
693 queue_push(solutionq, p);
696 rr = solv->rules + solv->featurerules + (p - solv->installed->start);
698 rr = solv->rules + solv->updaterules + (p - solv->installed->start);
699 mvrp = 0; /* multi-version replacement */
700 FOR_RULELITERALS(rp, pp, rr)
701 if (rp > 0 && solv->decisionmap[rp] > 0 && pool->solvables[rp].repo != solv->installed)
704 if (!(solv->multiversion.size && MAPTST(&solv->multiversion, rp)))
709 queue_push(solutionq, SOLVER_SOLUTION_BEST); /* split, see above */
710 queue_push(solutionq, mvrp);
711 queue_push(solutionq, p);
712 queue_push(solutionq, 0);
717 queue_push(solutionq, SOLVER_SOLUTION_BEST);
718 queue_push(solutionq, rp);
725 * convert problem data into a form usable for refining.
726 * Returns the number of problems.
729 solver_prepare_solutions(Solver *solv)
733 if (!solv->problems.count)
735 queue_empty(&solv->solutions);
736 queue_push(&solv->solutions, 0); /* dummy so idx is always nonzero */
737 idx = solv->solutions.count;
738 queue_push(&solv->solutions, -1); /* unrefined */
739 /* proofidx stays in position, thus we start with 1 */
740 for (i = 1; i < solv->problems.count; i++)
742 Id p = solv->problems.elements[i];
743 queue_push(&solv->solutions, p);
746 /* end of problem reached */
747 solv->problems.elements[j++] = idx;
748 if (i + 1 >= solv->problems.count)
750 /* start another problem */
751 solv->problems.elements[j++] = solv->problems.elements[++i]; /* copy proofidx */
752 idx = solv->solutions.count;
753 queue_push(&solv->solutions, -1); /* unrefined */
755 solv->problems.count = j;
760 * refine the simple solution rule list provided by
761 * the solver into multiple lists of job modifiers.
764 create_solutions(Solver *solv, int probnr, int solidx)
766 Pool *pool = solv->pool;
768 Queue problem, solution, problems_save, branches_save, decisionq_reason_save;
772 int oldmistakes = solv->cleandeps_mistakes ? solv->cleandeps_mistakes->count : 0;
775 now = solv_timems(0);
777 /* save decisionq, decisionq_why, decisionmap, and decisioncnt */
778 for (i = 0; i < solv->decisionq.count; i++)
780 Id p = solv->decisionq.elements[i];
781 queue_push(&redoq, p);
782 queue_push(&redoq, solv->decisionq_why.elements[i]);
783 queue_push(&redoq, solv->decisionmap[p > 0 ? p : -p]);
786 /* save problems queue */
787 problems_save = solv->problems;
788 memset(&solv->problems, 0, sizeof(solv->problems));
790 /* save branches queue */
791 branches_save = solv->branches;
792 memset(&solv->branches, 0, sizeof(solv->branches));
794 /* save decisionq_reason */
795 decisionq_reason_save = solv->decisionq_reason;
796 memset(&solv->decisionq_reason, 0, sizeof(solv->decisionq_reason));
798 /* extract problem from queue */
799 queue_init(&problem);
800 for (i = solidx + 1; i < solv->solutions.count; i++)
802 Id v = solv->solutions.elements[i];
805 queue_push(&problem, v);
807 extraflags &= solv->job.elements[-v - 1];
809 if (extraflags == -1)
811 if (problem.count > 1)
812 solv_sort(problem.elements, problem.count, sizeof(Id), problems_sortcmp, &solv->job);
813 queue_push(&problem, 0); /* mark end for refine_suggestion */
816 for (i = 0; i < problem.count; i++)
817 printf("PP %d %d\n", i, problem.elements[i]);
820 /* refine each solution element */
823 queue_init(&solution);
824 for (i = 0; i < problem.count; i++)
826 int solstart = solv->solutions.count;
827 refine_suggestion(solv, problem.elements, problem.elements[i], &solution, essentialok);
828 queue_push(&solv->solutions, 0); /* reserve room for number of elements */
829 for (j = 0; j < solution.count; j++)
830 convertsolution(solv, solution.elements[j], &solv->solutions);
831 if (solv->solutions.count == solstart + 1)
833 solv->solutions.count--; /* this one did not work out */
834 if (nsol || i + 1 < problem.count)
835 continue; /* got one or still hope */
838 /* nothing found, start over */
839 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "nothing found, re-run with essentialok = 1\n");
844 /* this is bad, we found no solution */
845 /* for now just offer a rule */
846 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "nothing found, already did essentialok, fake it\n");
847 queue_push(&solv->solutions, 0);
848 for (j = 0; j < problem.count; j++)
850 convertsolution(solv, problem.elements[j], &solv->solutions);
851 if (solv->solutions.count > solstart + 1)
854 if (solv->solutions.count == solstart + 1)
856 solv->solutions.count--;
857 continue; /* sorry */
860 /* patch in number of solution elements */
861 solv->solutions.elements[solstart] = (solv->solutions.count - (solstart + 1)) / 2;
862 queue_push(&solv->solutions, 0); /* add end marker */
863 queue_push(&solv->solutions, 0); /* add end marker */
864 queue_push(&solv->solutions, problem.elements[i]); /* just for bookkeeping */
865 queue_push(&solv->solutions, extraflags & SOLVER_CLEANDEPS); /* our extraflags */
866 solv->solutions.elements[solidx + 1 + nsol++] = solstart;
868 solv->solutions.elements[solidx + 1 + nsol] = 0; /* end marker */
869 solv->solutions.elements[solidx] = nsol;
870 queue_free(&problem);
871 queue_free(&solution);
873 /* restore decisions */
874 memset(solv->decisionmap, 0, pool->nsolvables * sizeof(Id));
875 queue_empty(&solv->decisionq);
876 queue_empty(&solv->decisionq_why);
877 for (i = 0; i < redoq.count; i += 3)
879 Id p = redoq.elements[i];
880 queue_push(&solv->decisionq, p);
881 queue_push(&solv->decisionq_why, redoq.elements[i + 1]);
882 solv->decisionmap[p > 0 ? p : -p] = redoq.elements[i + 2];
886 /* restore decision reasons */
887 queue_free(&solv->decisionq_reason);
888 solv->decisionq_reason = decisionq_reason_save;
890 /* restore problems */
891 queue_free(&solv->problems);
892 solv->problems = problems_save;
894 /* restore branches */
895 queue_free(&solv->branches);
896 solv->branches = branches_save;
898 if (solv->cleandeps_mistakes)
901 queue_truncate(solv->cleandeps_mistakes, oldmistakes);
904 queue_free(solv->cleandeps_mistakes);
905 solv->cleandeps_mistakes = solv_free(solv->cleandeps_mistakes);
909 POOL_DEBUG(SOLV_DEBUG_STATS, "create_solutions for problem #%d took %d ms\n", probnr, solv_timems(now));
913 /**************************************************************************/
916 solver_problem_count(Solver *solv)
918 return solv->problems.count / 2;
922 solver_next_problem(Solver *solv, Id problem)
925 return solv->problems.count ? 1 : 0;
926 return (problem + 1) * 2 - 1 < solv->problems.count ? problem + 1 : 0;
930 solver_solution_count(Solver *solv, Id problem)
932 Id solidx = solv->problems.elements[problem * 2 - 1];
933 if (solv->solutions.elements[solidx] < 0)
934 create_solutions(solv, problem, solidx);
935 return solv->solutions.elements[solidx];
939 solver_next_solution(Solver *solv, Id problem, Id solution)
941 Id solidx = solv->problems.elements[problem * 2 - 1];
942 if (solv->solutions.elements[solidx] < 0)
943 create_solutions(solv, problem, solidx);
944 return solv->solutions.elements[solidx + solution + 1] ? solution + 1 : 0;
948 solver_solutionelement_count(Solver *solv, Id problem, Id solution)
950 Id solidx = solv->problems.elements[problem * 2 - 1];
951 solidx = solv->solutions.elements[solidx + solution];
952 return solv->solutions.elements[solidx];
956 solver_solutionelement_internalid(Solver *solv, Id problem, Id solution)
958 Id solidx = solv->problems.elements[problem * 2 - 1];
959 solidx = solv->solutions.elements[solidx + solution];
960 return solv->solutions.elements[solidx + 2 * solv->solutions.elements[solidx] + 3];
964 solver_solutionelement_extrajobflags(Solver *solv, Id problem, Id solution)
966 Id solidx = solv->problems.elements[problem * 2 - 1];
967 solidx = solv->solutions.elements[solidx + solution];
968 return solv->solutions.elements[solidx + 2 * solv->solutions.elements[solidx] + 4];
973 * return the next item of the proposed solution
974 * here are the possibilities for p / rp and what
975 * the solver expects the application to do:
977 * -------------------------------------------------------
978 * SOLVER_SOLUTION_INFARCH pkgid
979 * -> add (SOLVER_INSTALL|SOLVER_SOLVABLE, rp) to the job
980 * SOLVER_SOLUTION_DISTUPGRADE pkgid
981 * -> add (SOLVER_INSTALL|SOLVER_SOLVABLE, rp) to the job
982 * SOLVER_SOLUTION_BEST pkgid
983 * -> add (SOLVER_INSTALL|SOLVER_SOLVABLE, rp) to the job
984 * SOLVER_SOLUTION_JOB jobidx
985 * -> remove job (jobidx - 1, jobidx) from job queue
986 * SOLVER_SOLUTION_POOLJOB jobidx
987 * -> remove job (jobidx - 1, jobidx) from pool job queue
989 * -> add (SOLVER_ERASE|SOLVER_SOLVABLE, p) to the job
990 * pkgid (> 0) pkgid (> 0)
991 * -> add (SOLVER_INSTALL|SOLVER_SOLVABLE, rp) to the job
992 * (this will replace package p)
994 * Thus, the solver will either ask the application to remove
995 * a specific job from the job queue, or ask to add an install/erase
1001 solver_next_solutionelement(Solver *solv, Id problem, Id solution, Id element, Id *p, Id *rp)
1003 Id solidx = solv->problems.elements[problem * 2 - 1];
1004 solidx = solv->solutions.elements[solidx + solution];
1007 solidx += 1 + element * 2;
1008 if (!solv->solutions.elements[solidx] && !solv->solutions.elements[solidx + 1])
1010 *p = solv->solutions.elements[solidx];
1011 *rp = solv->solutions.elements[solidx + 1];
1016 solver_take_solutionelement(Solver *solv, Id p, Id rp, Id extrajobflags, Queue *job)
1020 if (p == SOLVER_SOLUTION_POOLJOB)
1022 solv->pool->pooljobs.elements[rp - 1] = SOLVER_NOOP;
1023 solv->pool->pooljobs.elements[rp] = 0;
1026 if (p == SOLVER_SOLUTION_JOB)
1028 job->elements[rp - 1] = SOLVER_NOOP;
1029 job->elements[rp] = 0;
1032 if (rp <= 0 && p <= 0)
1033 return; /* just in case */
1035 p = SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extrajobflags;
1039 p = SOLVER_ERASE|SOLVER_SOLVABLE|extrajobflags;
1041 for (i = 0; i < job->count; i += 2)
1042 if (job->elements[i] == p && job->elements[i + 1] == rp)
1044 queue_push2(job, p, rp);
1048 solver_take_solution(Solver *solv, Id problem, Id solution, Queue *job)
1050 Id p, rp, element = 0;
1051 Id extrajobflags = solver_solutionelement_extrajobflags(solv, problem, solution);
1052 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0)
1053 solver_take_solutionelement(solv, p, rp, extrajobflags, job);
1057 /*-------------------------------------------------------------------
1063 findproblemrule_internal(Solver *solv, Id idx, Id *reqrp, Id *conrp, Id *sysrp, Id *jobrp, Map *rseen)
1066 Id lreqr, lconr, lsysr, ljobr;
1069 int i, reqset = 0; /* 0: unset, 1: installed, 2: jobassert, 3: assert */
1070 int conset = 0; /* 0: unset, 1: installed */
1072 /* find us a jobassert rule */
1073 for (i = idx; (rid = solv->learnt_pool.elements[i]) != 0; i++)
1075 if (rid < solv->jobrules || rid >= solv->jobrules_end)
1077 r = solv->rules + rid;
1078 d = r->d < 0 ? -r->d - 1 : r->d;
1079 if (!d && r->w2 == 0 && r->p > 0)
1086 /* the problem rules are somewhat ordered from "near to the problem" to
1087 * "near to the job" */
1088 lreqr = lconr = lsysr = ljobr = 0;
1089 while ((rid = solv->learnt_pool.elements[idx++]) != 0)
1092 if (rid >= solv->learntrules)
1094 if (MAPTST(rseen, rid - solv->learntrules))
1096 MAPSET(rseen, rid - solv->learntrules);
1097 findproblemrule_internal(solv, solv->learnt_why.elements[rid - solv->learntrules], &lreqr, &lconr, &lsysr, &ljobr, rseen);
1099 else if ((rid >= solv->jobrules && rid < solv->jobrules_end) || (rid >= solv->infarchrules && rid < solv->infarchrules_end) || (rid >= solv->duprules && rid < solv->duprules_end) || (rid >= solv->bestrules && rid < solv->bestrules_end) || (rid >= solv->yumobsrules && rid <= solv->yumobsrules_end))
1104 else if (rid >= solv->updaterules && rid < solv->updaterules_end)
1111 assert(rid < solv->pkgrules_end);
1112 r = solv->rules + rid;
1113 d = r->d < 0 ? -r->d - 1 : r->d;
1114 if (!d && r->w2 < 0)
1116 /* prefer conflicts of installed packages */
1117 if (solv->installed && !conset)
1119 if (r->p < 0 && (solv->pool->solvables[-r->p].repo == solv->installed ||
1120 solv->pool->solvables[-r->w2].repo == solv->installed))
1131 if (!d && r->w2 == 0 && reqset < 3)
1133 if (*reqrp > 0 && r->p < -1)
1135 Pool *pool = solv->pool;
1136 Id op = -solv->rules[*reqrp].p;
1137 if (op > 1 && pool->solvables[op].arch != pool->solvables[-r->p].arch &&
1138 pool->solvables[op].arch != pool->noarchid &&
1139 pool->solvables[-r->p].arch != pool->noarchid)
1140 continue; /* different arch, skip */
1142 /* prefer assertions */
1146 else if (jobassert && r->p == -jobassert)
1148 /* prefer rules of job assertions */
1152 else if (solv->installed && r->p < 0 && solv->pool->solvables[-r->p].repo == solv->installed && reqset <= 1)
1154 /* prefer rules of job installed package so that the user doesn't get confused by strange packages */
1163 if (!*reqrp && lreqr)
1165 if (!*conrp && lconr)
1167 if (!*jobrp && ljobr)
1169 if (!*sysrp && lsysr)
1176 * search for a rule that describes the problem to the
1177 * user. Actually a pretty hopeless task that may leave the user
1178 * puzzled. To get all of the needed information use
1179 * solver_findallproblemrules() instead.
1183 solver_findproblemrule(Solver *solv, Id problem)
1185 Id reqr, conr, sysr, jobr;
1186 Id idx = solv->problems.elements[2 * problem - 2];
1188 reqr = conr = sysr = jobr = 0;
1189 map_init(&rseen, solv->learntrules ? solv->nrules - solv->learntrules : 0);
1190 findproblemrule_internal(solv, idx, &reqr, &conr, &sysr, &jobr, &rseen);
1192 /* check if the request is about a not-installed package requiring a installed
1193 * package conflicting with the non-installed package. In that case return the conflict */
1194 if (reqr && conr && solv->installed && solv->rules[reqr].p < 0 && solv->rules[conr].p < 0 && solv->rules[conr].w2 < 0)
1196 Pool *pool = solv->pool;
1197 Solvable *s = pool->solvables - solv->rules[reqr].p;
1198 Solvable *s1 = pool->solvables - solv->rules[conr].p;
1199 Solvable *s2 = pool->solvables - solv->rules[conr].w2;
1201 if (s == s1 && s2->repo == solv->installed)
1202 cp = -solv->rules[conr].w2;
1203 else if (s == s2 && s1->repo == solv->installed)
1204 cp = -solv->rules[conr].p;
1205 if (cp && s1->name != s2->name && s->repo != solv->installed)
1208 Rule *r = solv->rules + reqr;
1209 FOR_RULELITERALS(p, pp, r)
1215 return reqr; /* some requires */
1217 return conr; /* some conflict */
1219 return sysr; /* an update rule */
1221 return jobr; /* a user request */
1226 /*-------------------------------------------------------------------*/
1229 findallproblemrules_internal(Solver *solv, Id idx, Queue *rules, Map *rseen)
1232 while ((rid = solv->learnt_pool.elements[idx++]) != 0)
1234 if (rid >= solv->learntrules)
1236 if (MAPTST(rseen, rid - solv->learntrules))
1238 MAPSET(rseen, rid - solv->learntrules);
1239 findallproblemrules_internal(solv, solv->learnt_why.elements[rid - solv->learntrules], rules, rseen);
1242 queue_pushunique(rules, rid);
1247 * find all problem rule
1249 * return all rules that lead to the problem. This gives the user
1250 * all of the information to understand the problem, but the result
1251 * can be a large number of rules.
1255 solver_findallproblemrules(Solver *solv, Id problem, Queue *rules)
1259 map_init(&rseen, solv->learntrules ? solv->nrules - solv->learntrules : 0);
1260 findallproblemrules_internal(solv, solv->problems.elements[2 * problem - 2], rules, &rseen);
1265 solver_problemruleinfo2str(Solver *solv, SolverRuleinfo type, Id source, Id target, Id dep)
1267 Pool *pool = solv->pool;
1272 case SOLVER_RULE_DISTUPGRADE:
1273 return pool_tmpjoin(pool, pool_solvid2str(pool, source), " does not belong to a distupgrade repository", 0);
1274 case SOLVER_RULE_INFARCH:
1275 return pool_tmpjoin(pool, pool_solvid2str(pool, source), " has inferior architecture", 0);
1276 case SOLVER_RULE_UPDATE:
1277 return pool_tmpjoin(pool, "problem with installed package ", pool_solvid2str(pool, source), 0);
1278 case SOLVER_RULE_JOB:
1279 return "conflicting requests";
1280 case SOLVER_RULE_JOB_UNSUPPORTED:
1281 return "unsupported request";
1282 case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
1283 return pool_tmpjoin(pool, "nothing provides requested ", pool_dep2str(pool, dep), 0);
1284 case SOLVER_RULE_JOB_UNKNOWN_PACKAGE:
1285 return pool_tmpjoin(pool, "package ", pool_dep2str(pool, dep), " does not exist");
1286 case SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM:
1287 return pool_tmpjoin(pool, pool_dep2str(pool, dep), " is provided by the system", 0);
1288 case SOLVER_RULE_PKG:
1289 return "some dependency problem";
1290 case SOLVER_RULE_BEST:
1292 return pool_tmpjoin(pool, "cannot install the best update candidate for package ", pool_solvid2str(pool, source), 0);
1293 return "cannot install the best candidate for the job";
1294 case SOLVER_RULE_PKG_NOT_INSTALLABLE:
1295 ss = pool->solvables + source;
1296 if (pool_disabled_solvable(pool, ss))
1297 return pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " is disabled");
1298 if (ss->arch && ss->arch != ARCH_SRC && ss->arch != ARCH_NOSRC &&
1299 pool->id2arch && pool_arch2score(pool, ss->arch) == 0)
1300 return pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " does not have a compatible architecture");
1301 return pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " is not installable");
1302 case SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP:
1303 s = pool_tmpjoin(pool, "nothing provides ", pool_dep2str(pool, dep), 0);
1304 return pool_tmpappend(pool, s, " needed by ", pool_solvid2str(pool, source));
1305 case SOLVER_RULE_PKG_SAME_NAME:
1306 s = pool_tmpjoin(pool, "cannot install both ", pool_solvid2str(pool, source), 0);
1307 return pool_tmpappend(pool, s, " and ", pool_solvid2str(pool, target));
1308 case SOLVER_RULE_PKG_CONFLICTS:
1309 s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
1310 s = pool_tmpappend(pool, s, " conflicts with ", pool_dep2str(pool, dep));
1311 return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
1312 case SOLVER_RULE_PKG_OBSOLETES:
1313 s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
1314 s = pool_tmpappend(pool, s, " obsoletes ", pool_dep2str(pool, dep));
1315 return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
1316 case SOLVER_RULE_PKG_INSTALLED_OBSOLETES:
1317 s = pool_tmpjoin(pool, "installed package ", pool_solvid2str(pool, source), 0);
1318 s = pool_tmpappend(pool, s, " obsoletes ", pool_dep2str(pool, dep));
1319 return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
1320 case SOLVER_RULE_PKG_IMPLICIT_OBSOLETES:
1321 s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
1322 s = pool_tmpappend(pool, s, " implicitly obsoletes ", pool_dep2str(pool, dep));
1323 return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
1324 case SOLVER_RULE_PKG_REQUIRES:
1325 s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " requires ");
1326 return pool_tmpappend(pool, s, pool_dep2str(pool, dep), ", but none of the providers can be installed");
1327 case SOLVER_RULE_PKG_SELF_CONFLICT:
1328 s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " conflicts with ");
1329 return pool_tmpappend(pool, s, pool_dep2str(pool, dep), " provided by itself");
1330 case SOLVER_RULE_YUMOBS:
1331 s = pool_tmpjoin(pool, "both package ", pool_solvid2str(pool, source), " and ");
1332 s = pool_tmpjoin(pool, s, pool_solvid2str(pool, target), " obsolete ");
1333 return pool_tmpappend(pool, s, pool_dep2str(pool, dep), 0);
1335 return "bad problem rule type";
1339 /* convenience function */
1341 solver_problem2str(Solver *solv, Id problem)
1343 Id type, source, target, dep;
1344 Id r = solver_findproblemrule(solv, problem);
1346 return "no problem rule?";
1347 type = solver_ruleinfo(solv, r, &source, &target, &dep);
1348 return solver_problemruleinfo2str(solv, type, source, target, dep);
1352 solver_solutionelement2str(Solver *solv, Id p, Id rp)
1354 Pool *pool = solv->pool;
1355 if (p == SOLVER_SOLUTION_JOB || p == SOLVER_SOLUTION_POOLJOB)
1358 if (p == SOLVER_SOLUTION_JOB)
1359 rp += solv->pooljobcnt;
1360 how = solv->job.elements[rp - 1];
1361 what = solv->job.elements[rp];
1362 return pool_tmpjoin(pool, "do not ask to ", pool_job2str(pool, how, what, 0), 0);
1364 else if (p == SOLVER_SOLUTION_INFARCH)
1366 Solvable *s = pool->solvables + rp;
1367 if (solv->installed && s->repo == solv->installed)
1368 return pool_tmpjoin(pool, "keep ", pool_solvable2str(pool, s), " despite the inferior architecture");
1370 return pool_tmpjoin(pool, "install ", pool_solvable2str(pool, s), " despite the inferior architecture");
1372 else if (p == SOLVER_SOLUTION_DISTUPGRADE)
1374 Solvable *s = pool->solvables + rp;
1375 if (solv->installed && s->repo == solv->installed)
1376 return pool_tmpjoin(pool, "keep obsolete ", pool_solvable2str(pool, s), 0);
1378 return pool_tmpjoin(pool, "install ", pool_solvable2str(pool, s), " from excluded repository");
1380 else if (p == SOLVER_SOLUTION_BEST)
1382 Solvable *s = pool->solvables + rp;
1383 if (solv->installed && s->repo == solv->installed)
1384 return pool_tmpjoin(pool, "keep old ", pool_solvable2str(pool, s), 0);
1386 return pool_tmpjoin(pool, "install ", pool_solvable2str(pool, s), " despite the old version");
1388 else if (p > 0 && rp == 0)
1389 return pool_tmpjoin(pool, "allow deinstallation of ", pool_solvid2str(pool, p), 0);
1390 else if (p > 0 && rp > 0)
1392 const char *sp = pool_solvid2str(pool, p);
1393 const char *srp = pool_solvid2str(pool, rp);
1394 const char *str = pool_tmpjoin(pool, "allow replacement of ", sp, 0);
1395 return pool_tmpappend(pool, str, " with ", srp);
1398 return "bad solution element";