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
21 #include "solver_private.h"
22 #include "solverdebug.h"
32 solver_printruleelement(Solver *solv, int type, Rule *r, Id v)
34 Pool *pool = solv->pool;
38 s = pool->solvables + -v;
39 POOL_DEBUG(type, " !%s [%d]", pool_solvable2str(pool, s), -v);
43 s = pool->solvables + v;
44 POOL_DEBUG(type, " %s [%d]", pool_solvable2str(pool, s), v);
46 if (pool->installed && s->repo == pool->installed)
47 POOL_DEBUG(type, "I");
51 POOL_DEBUG(type, " (w1)");
53 POOL_DEBUG(type, " (w2)");
55 if (solv->decisionmap[s - pool->solvables] > 0)
56 POOL_DEBUG(type, " Install.level%d", solv->decisionmap[s - pool->solvables]);
57 if (solv->decisionmap[s - pool->solvables] < 0)
58 POOL_DEBUG(type, " Conflict.level%d", -solv->decisionmap[s - pool->solvables]);
59 POOL_DEBUG(type, "\n");
68 solver_printrule(Solver *solv, int type, Rule *r)
70 Pool *pool = solv->pool;
74 if (r >= solv->rules && r < solv->rules + solv->nrules) /* r is a solver rule */
75 POOL_DEBUG(type, "Rule #%d:", (int)(r - solv->rules));
77 POOL_DEBUG(type, "Rule:"); /* r is any rule */
79 POOL_DEBUG(type, " (disabled)");
80 POOL_DEBUG(type, "\n");
81 d = r->d < 0 ? -r->d - 1 : r->d;
85 /* print direct literal */
91 /* binary rule --> print w2 as second literal */
95 /* every other which is in d */
96 v = solv->pool->whatprovidesdata[d + i - 1];
99 solver_printruleelement(solv, type, r, v);
101 POOL_DEBUG(type, " next rules: %d %d\n", r->n1, r->n2);
105 solver_printruleclass(Solver *solv, int type, Rule *r)
107 Pool *pool = solv->pool;
108 Id p = r - solv->rules;
110 if (p < solv->learntrules)
111 if (solv->weakrulemap.size && MAPTST(&solv->weakrulemap, p))
112 POOL_DEBUG(type, "WEAK ");
113 if (solv->learntrules && p >= solv->learntrules)
114 POOL_DEBUG(type, "LEARNT ");
115 else if (p >= solv->bestrules && p < solv->bestrules_end)
116 POOL_DEBUG(type, "BEST ");
117 else if (p >= solv->choicerules && p < solv->choicerules_end)
118 POOL_DEBUG(type, "CHOICE ");
119 else if (p >= solv->infarchrules && p < solv->infarchrules_end)
120 POOL_DEBUG(type, "INFARCH ");
121 else if (p >= solv->duprules && p < solv->duprules_end)
122 POOL_DEBUG(type, "DUP ");
123 else if (p >= solv->jobrules && p < solv->jobrules_end)
124 POOL_DEBUG(type, "JOB ");
125 else if (p >= solv->updaterules && p < solv->updaterules_end)
126 POOL_DEBUG(type, "UPDATE ");
127 else if (p >= solv->featurerules && p < solv->featurerules_end)
128 POOL_DEBUG(type, "FEATURE ");
129 else if (p >= solv->yumobsrules && p < solv->yumobsrules_end)
130 POOL_DEBUG(type, "YUMOBS ");
131 else if (p >= solv->blackrules && p < solv->blackrules_end)
132 POOL_DEBUG(type, "BLACK ");
133 else if (p >= solv->strictrepopriorules && p < solv->strictrepopriorules_end)
134 POOL_DEBUG(type, "REPOPRIO ");
135 else if (p >= solv->recommendsrules && p < solv->recommendsrules_end)
136 POOL_DEBUG(type, "RECOMMENDS ");
137 solver_printrule(solv, type, r);
141 solver_printproblem(Solver *solv, Id v)
143 Pool *pool = solv->pool;
149 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, solv->rules + v);
153 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "JOB %d\n", v);
154 jp = solv->ruletojob.elements;
155 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
158 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "- ");
159 solver_printrule(solv, SOLV_DEBUG_SOLUTIONS, r);
161 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "ENDJOB\n");
166 solver_printwatches(Solver *solv, int type)
168 Pool *pool = solv->pool;
171 POOL_DEBUG(type, "Watches: \n");
172 for (counter = -(pool->nsolvables - 1); counter < pool->nsolvables; counter++)
173 POOL_DEBUG(type, " solvable [%d] -- rule [%d]\n", counter, solv->watches[counter + pool->nsolvables]);
177 solver_printdecisionq(Solver *solv, int type)
179 Pool *pool = solv->pool;
183 POOL_DEBUG(type, "Decisions:\n");
184 for (i = 0; i < solv->decisionq.count; i++)
186 p = solv->decisionq.elements[i];
188 POOL_DEBUG(type, "%d %d install %s, ", i, solv->decisionmap[p], pool_solvid2str(pool, p));
190 POOL_DEBUG(type, "%d %d conflict %s, ", i, -solv->decisionmap[-p], pool_solvid2str(pool, -p));
191 why = solv->decisionq_why.elements[i];
194 POOL_DEBUG(type, "forced by ");
195 solver_printruleclass(solv, type, solv->rules + why);
199 POOL_DEBUG(type, "chosen from ");
200 solver_printruleclass(solv, type, solv->rules - why);
203 POOL_DEBUG(type, "picked for some unknown reason.\n");
212 solver_printdecisions(Solver *solv)
214 Pool *pool = solv->pool;
215 Repo *installed = solv->installed;
216 Transaction *trans = solver_create_transaction(solv);
221 Queue recommendations;
225 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
226 POOL_DEBUG(SOLV_DEBUG_RESULT, "transaction:\n");
229 for (i = 0; i < trans->steps.count; i++)
231 p = trans->steps.elements[i];
232 s = pool->solvables + p;
233 type = transaction_type(trans, p, SOLVER_TRANSACTION_SHOW_ACTIVE|SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES|SOLVER_TRANSACTION_SHOW_MULTIINSTALL);
236 case SOLVER_TRANSACTION_MULTIINSTALL:
237 POOL_DEBUG(SOLV_DEBUG_RESULT, " multi install %s", pool_solvable2str(pool, s));
239 case SOLVER_TRANSACTION_MULTIREINSTALL:
240 POOL_DEBUG(SOLV_DEBUG_RESULT, " multi reinstall %s", pool_solvable2str(pool, s));
242 case SOLVER_TRANSACTION_INSTALL:
243 POOL_DEBUG(SOLV_DEBUG_RESULT, " install %s", pool_solvable2str(pool, s));
245 case SOLVER_TRANSACTION_REINSTALL:
246 POOL_DEBUG(SOLV_DEBUG_RESULT, " reinstall %s", pool_solvable2str(pool, s));
248 case SOLVER_TRANSACTION_DOWNGRADE:
249 POOL_DEBUG(SOLV_DEBUG_RESULT, " downgrade %s", pool_solvable2str(pool, s));
251 case SOLVER_TRANSACTION_CHANGE:
252 POOL_DEBUG(SOLV_DEBUG_RESULT, " change %s", pool_solvable2str(pool, s));
254 case SOLVER_TRANSACTION_UPGRADE:
255 case SOLVER_TRANSACTION_OBSOLETES:
256 POOL_DEBUG(SOLV_DEBUG_RESULT, " upgrade %s", pool_solvable2str(pool, s));
258 case SOLVER_TRANSACTION_ERASE:
259 POOL_DEBUG(SOLV_DEBUG_RESULT, " erase %s", pool_solvable2str(pool, s));
266 case SOLVER_TRANSACTION_INSTALL:
267 case SOLVER_TRANSACTION_ERASE:
268 case SOLVER_TRANSACTION_MULTIINSTALL:
269 case SOLVER_TRANSACTION_MULTIREINSTALL:
270 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
272 case SOLVER_TRANSACTION_REINSTALL:
273 case SOLVER_TRANSACTION_DOWNGRADE:
274 case SOLVER_TRANSACTION_CHANGE:
275 case SOLVER_TRANSACTION_UPGRADE:
276 case SOLVER_TRANSACTION_OBSOLETES:
277 transaction_all_obs_pkgs(trans, p, &iq);
280 POOL_DEBUG(SOLV_DEBUG_RESULT, " (obsoletes");
281 for (j = 0; j < iq.count; j++)
282 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s", pool_solvid2str(pool, iq.elements[j]));
283 POOL_DEBUG(SOLV_DEBUG_RESULT, ")");
285 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
293 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
295 queue_init(&recommendations);
296 queue_init(&suggestions);
297 queue_init(&orphaned);
298 solver_get_recommendations(solv, &recommendations, &suggestions, 0);
299 solver_get_orphaned(solv, &orphaned);
300 if (recommendations.count)
302 POOL_DEBUG(SOLV_DEBUG_RESULT, "recommended packages:\n");
303 for (i = 0; i < recommendations.count; i++)
305 s = pool->solvables + recommendations.elements[i];
306 if (solv->decisionmap[recommendations.elements[i]] > 0)
308 if (installed && s->repo == installed)
309 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (installed)\n", pool_solvable2str(pool, s));
311 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (selected)\n", pool_solvable2str(pool, s));
314 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", pool_solvable2str(pool, s));
316 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
319 if (suggestions.count)
321 POOL_DEBUG(SOLV_DEBUG_RESULT, "suggested packages:\n");
322 for (i = 0; i < suggestions.count; i++)
324 s = pool->solvables + suggestions.elements[i];
325 if (solv->decisionmap[suggestions.elements[i]] > 0)
327 if (installed && s->repo == installed)
328 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (installed)\n", pool_solvable2str(pool, s));
330 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (selected)\n", pool_solvable2str(pool, s));
333 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", pool_solvable2str(pool, s));
335 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
339 POOL_DEBUG(SOLV_DEBUG_RESULT, "orphaned packages:\n");
340 for (i = 0; i < orphaned.count; i++)
342 s = pool->solvables + orphaned.elements[i];
343 if (solv->decisionmap[solv->orphaned.elements[i]] > 0)
344 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (kept)\n", pool_solvable2str(pool, s));
346 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (erased)\n", pool_solvable2str(pool, s));
348 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
350 queue_free(&recommendations);
351 queue_free(&suggestions);
352 queue_free(&orphaned);
353 transaction_free(trans);
357 const char *id2strnone(Pool *pool, Id id)
359 return !id || id == 1 ? "(none)" : pool_id2str(pool, id);
363 transaction_print(Transaction *trans)
365 Pool *pool = trans->pool;
367 int i, j, mode, l, linel;
371 queue_init(&classes);
373 mode = SOLVER_TRANSACTION_SHOW_OBSOLETES | SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
374 transaction_classify(trans, mode, &classes);
375 for (i = 0; i < classes.count; i += 4)
377 Id class = classes.elements[i];
378 Id cnt = classes.elements[i + 1];
381 case SOLVER_TRANSACTION_ERASE:
382 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d erased packages:\n", cnt);
384 case SOLVER_TRANSACTION_INSTALL:
385 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d installed packages:\n", cnt);
387 case SOLVER_TRANSACTION_REINSTALLED:
388 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d reinstalled packages:\n", cnt);
390 case SOLVER_TRANSACTION_DOWNGRADED:
391 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d downgraded packages:\n", cnt);
393 case SOLVER_TRANSACTION_CHANGED:
394 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d changed packages:\n", cnt);
396 case SOLVER_TRANSACTION_UPGRADED:
397 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d upgraded packages:\n", cnt);
399 case SOLVER_TRANSACTION_VENDORCHANGE:
400 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d vendor changes from '%s' to '%s':\n", cnt, id2strnone(pool, classes.elements[i + 2]), id2strnone(pool, classes.elements[i + 3]));
402 case SOLVER_TRANSACTION_ARCHCHANGE:
403 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d arch changes from %s to %s:\n", cnt, pool_id2str(pool, classes.elements[i + 2]), pool_id2str(pool, classes.elements[i + 3]));
406 class = SOLVER_TRANSACTION_IGNORE;
409 if (class == SOLVER_TRANSACTION_IGNORE)
411 transaction_classify_pkgs(trans, mode, class, classes.elements[i + 2], classes.elements[i + 3], &pkgs);
414 for (j = 0; j < pkgs.count; j++)
416 Id p = pkgs.elements[j];
417 Solvable *s = pool->solvables + p;
422 case SOLVER_TRANSACTION_DOWNGRADED:
423 case SOLVER_TRANSACTION_UPGRADED:
424 s2 = pool->solvables + transaction_obs_pkg(trans, p);
425 POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s -> %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, s2));
427 case SOLVER_TRANSACTION_VENDORCHANGE:
428 case SOLVER_TRANSACTION_ARCHCHANGE:
429 n = pool_id2str(pool, s->name);
431 if (l + linel > sizeof(line) - 3)
434 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", line);
438 if (l + linel > sizeof(line) - 3)
439 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", n);
444 strcpy(line + linel, ", ");
447 strcpy(line + linel, n);
452 POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s\n", pool_solvable2str(pool, s));
457 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", line);
458 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
460 queue_free(&classes);
465 solver_printproblemruleinfo(Solver *solv, Id probr)
467 Pool *pool = solv->pool;
468 Id dep, source, target;
469 SolverRuleinfo type = solver_ruleinfo(solv, probr, &source, &target, &dep);
471 POOL_DEBUG(SOLV_DEBUG_RESULT, "%s\n", solver_problemruleinfo2str(solv, type, source, target, dep));
475 solver_printprobleminfo(Solver *solv, Id problem)
477 solver_printproblemruleinfo(solv, solver_findproblemrule(solv, problem));
481 solver_printcompleteprobleminfo(Solver *solv, Id problem)
488 solver_findallproblemrules(solv, problem, &q);
489 for (i = 0; i < q.count; i++)
491 probr = q.elements[i];
492 if (!(probr >= solv->updaterules && probr < solv->updaterules_end) && !(probr >= solv->jobrules && probr < solv->jobrules_end))
498 for (i = 0; i < q.count; i++)
500 probr = q.elements[i];
501 if (nobad && ((probr >= solv->updaterules && probr < solv->updaterules_end) || (probr >= solv->jobrules && probr < solv->jobrules_end)))
503 solver_printproblemruleinfo(solv, probr);
509 solver_printsolution(Solver *solv, Id problem, Id solution)
511 Pool *pool = solv->pool;
515 solver_all_solutionelements(solv, problem, solution, 1, &q);
516 for (i = 0; i < q.count; i += 3)
517 POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s\n", solver_solutionelementtype2str(solv, q.elements[i], q.elements[i + 1], q.elements[i + 2]));
522 solver_printallsolutions(Solver *solv)
524 Pool *pool = solv->pool;
526 Id problem, solution;
528 POOL_DEBUG(SOLV_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n");
531 while ((problem = solver_next_problem(solv, problem)) != 0)
534 POOL_DEBUG(SOLV_DEBUG_RESULT, "Problem %d:\n", pcnt);
535 POOL_DEBUG(SOLV_DEBUG_RESULT, "====================================\n");
537 solver_printprobleminfo(solv, problem);
539 solver_printcompleteprobleminfo(solv, problem);
541 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
543 while ((solution = solver_next_solution(solv, problem, solution)) != 0)
545 solver_printsolution(solv, problem, solution);
546 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");