2 * Copyright (c) 2008, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * debug functions for the SAT solver
29 * create obsoletesmap from solver decisions
31 * for solvables in installed repo:
33 * p - one of the packages that obsolete us
35 * n - number of packages this package obsoletes
40 solver_create_decisions_obsoletesmap(Solver *solv)
42 Pool *pool = solv->pool;
43 Repo *installed = solv->installed;
44 Id p, *obsoletesmap = NULL;
48 obsoletesmap = (Id *)sat_calloc(pool->nsolvables, sizeof(Id));
51 for (i = 0; i < solv->decisionq.count; i++)
56 n = solv->decisionq.elements[i];
59 if (n == SYSTEMSOLVABLE)
61 s = pool->solvables + n;
62 if (s->repo == installed) /* obsoletes don't count for already installed packages */
64 noobs = solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n);
65 FOR_PROVIDES(p, pp, s->name)
67 Solvable *ps = pool->solvables + p;
68 if (noobs && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
70 if (!solv->implicitobsoleteusesprovides && s->name != ps->name)
72 if (pool->solvables[p].repo == installed && !obsoletesmap[p])
79 for (i = 0; i < solv->decisionq.count; i++)
84 n = solv->decisionq.elements[i];
87 if (n == SYSTEMSOLVABLE)
89 s = pool->solvables + n;
90 if (s->repo == installed) /* obsoletes don't count for already installed packages */
94 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n))
96 obsp = s->repo->idarraydata + s->obsoletes;
97 while ((obs = *obsp++) != 0)
99 FOR_PROVIDES(p, pp, obs)
101 if (!solv->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p, obs))
103 if (pool->solvables[p].repo == installed && !obsoletesmap[p])
116 solver_printruleelement(Solver *solv, int type, Rule *r, Id v)
118 Pool *pool = solv->pool;
122 s = pool->solvables + -v;
123 POOL_DEBUG(type, " !%s [%d]", solvable2str(pool, s), -v);
127 s = pool->solvables + v;
128 POOL_DEBUG(type, " %s [%d]", solvable2str(pool, s), v);
133 POOL_DEBUG(type, " (w1)");
135 POOL_DEBUG(type, " (w2)");
137 if (solv->decisionmap[s - pool->solvables] > 0)
138 POOL_DEBUG(type, " Install.level%d", solv->decisionmap[s - pool->solvables]);
139 if (solv->decisionmap[s - pool->solvables] < 0)
140 POOL_DEBUG(type, " Conflict.level%d", -solv->decisionmap[s - pool->solvables]);
141 POOL_DEBUG(type, "\n");
150 solver_printrule(Solver *solv, int type, Rule *r)
152 Pool *pool = solv->pool;
156 if (r >= solv->rules && r < solv->rules + solv->nrules) /* r is a solver rule */
157 POOL_DEBUG(type, "Rule #%d:", (int)(r - solv->rules));
159 POOL_DEBUG(type, "Rule:"); /* r is any rule */
161 POOL_DEBUG(type, " (disabled)");
162 POOL_DEBUG(type, "\n");
163 d = r->d < 0 ? -r->d - 1 : r->d;
167 /* print direct literal */
173 /* binary rule --> print w2 as second literal */
177 /* every other which is in d */
178 v = solv->pool->whatprovidesdata[d + i - 1];
181 solver_printruleelement(solv, type, r, v);
183 POOL_DEBUG(type, " next rules: %d %d\n", r->n1, r->n2);
187 solver_printruleclass(Solver *solv, int type, Rule *r)
189 Pool *pool = solv->pool;
190 Id p = r - solv->rules;
192 if (p < solv->learntrules)
193 if (MAPTST(&solv->weakrulemap, p))
194 POOL_DEBUG(type, "WEAK ");
195 if (p >= solv->learntrules)
196 POOL_DEBUG(type, "LEARNT ");
197 else if (p >= solv->jobrules && p < solv->jobrules_end)
198 POOL_DEBUG(type, "JOB ");
199 else if (p >= solv->updaterules && p < solv->updaterules_end)
200 POOL_DEBUG(type, "UPDATE ");
201 else if (p >= solv->featurerules && p < solv->featurerules_end)
202 POOL_DEBUG(type, "FEATURE ");
203 solver_printrule(solv, type, r);
207 solver_printproblem(Solver *solv, Id v)
209 Pool *pool = solv->pool;
215 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, solv->rules + v);
219 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "JOB %d\n", v);
220 jp = solv->ruletojob.elements;
221 for (i = solv->jobrules, r = solv->rules + i; i < solv->learntrules; i++, r++, jp++)
224 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "- ");
225 solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
227 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "ENDJOB\n");
232 solver_printwatches(Solver *solv, int type)
234 Pool *pool = solv->pool;
237 POOL_DEBUG(type, "Watches: \n");
238 for (counter = -(pool->nsolvables - 1); counter < pool->nsolvables; counter++)
239 POOL_DEBUG(type, " solvable [%d] -- rule [%d]\n", counter, solv->watches[counter + pool->nsolvables]);
247 solver_printdecisions(Solver *solv)
249 Pool *pool = solv->pool;
250 Repo *installed = solv->installed;
251 Id p, *obsoletesmap = solver_create_decisions_obsoletesmap(solv);
255 IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
257 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- Decisions -----\n");
258 for (i = 0; i < solv->decisionq.count; i++)
260 p = solv->decisionq.elements[i];
261 solver_printruleelement(solv, SAT_DEBUG_SCHUBI, 0, p);
263 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- Decisions end -----\n");
266 /* print solvables to be erased */
270 FOR_REPO_SOLVABLES(installed, p, s)
272 if (solv->decisionmap[p] >= 0)
276 POOL_DEBUG(SAT_DEBUG_RESULT, "erase %s\n", solvable2str(pool, s));
280 /* print solvables to be installed */
282 for (i = 0; i < solv->decisionq.count; i++)
285 p = solv->decisionq.elements[i];
288 if (p == SYSTEMSOLVABLE)
290 s = pool->solvables + p;
291 if (installed && s->repo == installed)
294 if (!obsoletesmap[p])
296 POOL_DEBUG(SAT_DEBUG_RESULT, "install %s", solvable2str(pool, s));
301 FOR_PROVIDES(xp, xpp, s->name)
303 Solvable *s2 = pool->solvables + xp;
304 if (s2->name != s->name)
306 if (evrcmp(pool, s->evr, s2->evr, EVRCMP_MATCH_RELEASE) < 0)
310 POOL_DEBUG(SAT_DEBUG_RESULT, "downgrade %s", solvable2str(pool, s));
312 POOL_DEBUG(SAT_DEBUG_RESULT, "upgrade %s", solvable2str(pool, s));
313 POOL_DEBUG(SAT_DEBUG_RESULT, " (obsoletes");
314 for (j = installed->start; j < installed->end; j++)
315 if (obsoletesmap[j] == p)
316 POOL_DEBUG(SAT_DEBUG_RESULT, " %s", solvable2str(pool, pool->solvables + j));
317 POOL_DEBUG(SAT_DEBUG_RESULT, ")");
319 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
322 sat_free(obsoletesmap);
324 if (solv->recommendations.count)
326 POOL_DEBUG(SAT_DEBUG_RESULT, "\nrecommended packages:\n");
327 for (i = 0; i < solv->recommendations.count; i++)
329 s = pool->solvables + solv->recommendations.elements[i];
330 if (solv->decisionmap[solv->recommendations.elements[i]] > 0)
332 if (installed && s->repo == installed)
333 POOL_DEBUG(SAT_DEBUG_RESULT, "- %s (installed)\n", solvable2str(pool, s));
335 POOL_DEBUG(SAT_DEBUG_RESULT, "- %s (selected)\n", solvable2str(pool, s));
338 POOL_DEBUG(SAT_DEBUG_RESULT, "- %s\n", solvable2str(pool, s));
342 if (solv->suggestions.count)
344 POOL_DEBUG(SAT_DEBUG_RESULT, "\nsuggested packages:\n");
345 for (i = 0; i < solv->suggestions.count; i++)
347 s = pool->solvables + solv->suggestions.elements[i];
348 if (solv->decisionmap[solv->suggestions.elements[i]] > 0)
350 if (installed && s->repo == installed)
351 POOL_DEBUG(SAT_DEBUG_RESULT, "- %s (installed)\n", solvable2str(pool, s));
353 POOL_DEBUG(SAT_DEBUG_RESULT, "- %s (selected)\n", solvable2str(pool, s));
356 POOL_DEBUG(SAT_DEBUG_RESULT, "- %s\n", solvable2str(pool, s));
362 solver_printprobleminfo(Solver *solv, Queue *job, Id problem)
364 Pool *pool = solv->pool;
366 Id dep, source, target;
369 probr = solver_findproblemrule(solv, problem);
370 switch (solver_problemruleinfo(solv, job, probr, &dep, &source, &target))
372 case SOLVER_PROBLEM_UPDATE_RULE:
373 s = pool_id2solvable(pool, source);
374 POOL_DEBUG(SAT_DEBUG_RESULT, "problem with installed package %s\n", solvable2str(pool, s));
376 case SOLVER_PROBLEM_JOB_RULE:
377 POOL_DEBUG(SAT_DEBUG_RESULT, "conflicting requests\n");
379 case SOLVER_PROBLEM_JOB_NOTHING_PROVIDES_DEP:
380 POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides requested %s\n", dep2str(pool, dep));
382 case SOLVER_PROBLEM_NOT_INSTALLABLE:
383 s = pool_id2solvable(pool, source);
384 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s is not installable\n", solvable2str(pool, s));
386 case SOLVER_PROBLEM_NOTHING_PROVIDES_DEP:
387 s = pool_id2solvable(pool, source);
388 POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides %s needed by %s\n", dep2str(pool, dep), solvable2str(pool, s));
390 case SOLVER_PROBLEM_SAME_NAME:
391 s = pool_id2solvable(pool, source);
392 s2 = pool_id2solvable(pool, target);
393 POOL_DEBUG(SAT_DEBUG_RESULT, "cannot install both %s and %s\n", solvable2str(pool, s), solvable2str(pool, s2));
395 case SOLVER_PROBLEM_PACKAGE_CONFLICT:
396 s = pool_id2solvable(pool, source);
397 s2 = pool_id2solvable(pool, target);
398 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by %s\n", solvable2str(pool, s), dep2str(pool, dep), solvable2str(pool, s2));
400 case SOLVER_PROBLEM_PACKAGE_OBSOLETES:
401 s = pool_id2solvable(pool, source);
402 s2 = pool_id2solvable(pool, target);
403 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s obsoletes %s provided by %s\n", solvable2str(pool, s), dep2str(pool, dep), solvable2str(pool, s2));
405 case SOLVER_PROBLEM_DEP_PROVIDERS_NOT_INSTALLABLE:
406 s = pool_id2solvable(pool, source);
407 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s requires %s, but none of the providers can be installed\n", solvable2str(pool, s), dep2str(pool, dep));
409 case SOLVER_PROBLEM_SELF_CONFLICT:
410 s = pool_id2solvable(pool, source);
411 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by itself\n", solvable2str(pool, s), dep2str(pool, dep));
417 solver_printsolutions(Solver *solv, Queue *job)
419 Pool *pool = solv->pool;
422 Id problem, solution, element;
425 POOL_DEBUG(SAT_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n");
428 while ((problem = solver_next_problem(solv, problem)) != 0)
430 POOL_DEBUG(SAT_DEBUG_RESULT, "Problem %d:\n", pcnt++);
431 POOL_DEBUG(SAT_DEBUG_RESULT, "====================================\n");
432 solver_printprobleminfo(solv, job, problem);
433 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
435 while ((solution = solver_next_solution(solv, problem, solution)) != 0)
438 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0)
442 /* job, rp is index into job queue */
443 how = job->elements[rp - 1] & ~SOLVER_WEAK;
444 what = job->elements[rp];
447 case SOLVER_INSTALL_SOLVABLE:
448 s = pool->solvables + what;
449 if (solv->installed && s->repo == solv->installed)
450 POOL_DEBUG(SAT_DEBUG_RESULT, "- do not keep %s installed\n", solvable2str(pool, s));
452 POOL_DEBUG(SAT_DEBUG_RESULT, "- do not install %s\n", solvable2str(pool, s));
454 case SOLVER_ERASE_SOLVABLE:
455 s = pool->solvables + what;
456 if (solv->installed && s->repo == solv->installed)
457 POOL_DEBUG(SAT_DEBUG_RESULT, "- do not deinstall %s\n", solvable2str(pool, s));
459 POOL_DEBUG(SAT_DEBUG_RESULT, "- do not forbid installation of %s\n", solvable2str(pool, s));
461 case SOLVER_INSTALL_SOLVABLE_NAME:
462 POOL_DEBUG(SAT_DEBUG_RESULT, "- do not install %s\n", dep2str(pool, what));
464 case SOLVER_ERASE_SOLVABLE_NAME:
465 POOL_DEBUG(SAT_DEBUG_RESULT, "- do not deinstall %s\n", dep2str(pool, what));
467 case SOLVER_INSTALL_SOLVABLE_PROVIDES:
468 POOL_DEBUG(SAT_DEBUG_RESULT, "- do not install a solvable providing %s\n", dep2str(pool, what));
470 case SOLVER_ERASE_SOLVABLE_PROVIDES:
471 POOL_DEBUG(SAT_DEBUG_RESULT, "- do not deinstall all solvables providing %s\n", dep2str(pool, what));
473 case SOLVER_INSTALL_SOLVABLE_UPDATE:
474 s = pool->solvables + what;
475 POOL_DEBUG(SAT_DEBUG_RESULT, "- do not install most recent version of %s\n", solvable2str(pool, s));
478 POOL_DEBUG(SAT_DEBUG_RESULT, "- do something different\n");
484 /* policy, replace p with rp */
485 s = pool->solvables + p;
486 sd = rp ? pool->solvables + rp : 0;
490 if (!solv->allowdowngrade && evrcmp(pool, s->evr, sd->evr, EVRCMP_MATCH_RELEASE) > 0)
492 POOL_DEBUG(SAT_DEBUG_RESULT, "- allow downgrade of %s to %s\n", solvable2str(pool, s), solvable2str(pool, sd));
495 if (!solv->allowarchchange && s->name == sd->name && s->arch != sd->arch && policy_illegal_archchange(solv, s, sd))
497 POOL_DEBUG(SAT_DEBUG_RESULT, "- allow architecture change of %s to %s\n", solvable2str(pool, s), solvable2str(pool, sd));
500 if (!solv->allowvendorchange && s->name == sd->name && s->vendor != sd->vendor && policy_illegal_vendorchange(solv, s, sd))
503 POOL_DEBUG(SAT_DEBUG_RESULT, "- allow vendor change from '%s' (%s) to '%s' (%s)\n", id2str(pool, s->vendor), solvable2str(pool, s), id2str(pool, sd->vendor), solvable2str(pool, sd));
505 POOL_DEBUG(SAT_DEBUG_RESULT, "- allow vendor change from '%s' (%s) to no vendor (%s)\n", id2str(pool, s->vendor), solvable2str(pool, s), solvable2str(pool, sd));
509 POOL_DEBUG(SAT_DEBUG_RESULT, "- allow replacement of %s with %s\n", solvable2str(pool, s), solvable2str(pool, sd));
513 POOL_DEBUG(SAT_DEBUG_RESULT, "- allow deinstallation of %s\n", solvable2str(pool, s));
518 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");