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->recommendsrules && p < solv->recommendsrules_end)
134 POOL_DEBUG(type, "RECOMMENDS ");
135 solver_printrule(solv, type, r);
139 solver_printproblem(Solver *solv, Id v)
141 Pool *pool = solv->pool;
147 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, solv->rules + v);
151 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "JOB %d\n", v);
152 jp = solv->ruletojob.elements;
153 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
156 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "- ");
157 solver_printrule(solv, SOLV_DEBUG_SOLUTIONS, r);
159 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "ENDJOB\n");
164 solver_printwatches(Solver *solv, int type)
166 Pool *pool = solv->pool;
169 POOL_DEBUG(type, "Watches: \n");
170 for (counter = -(pool->nsolvables - 1); counter < pool->nsolvables; counter++)
171 POOL_DEBUG(type, " solvable [%d] -- rule [%d]\n", counter, solv->watches[counter + pool->nsolvables]);
175 solver_printdecisionq(Solver *solv, int type)
177 Pool *pool = solv->pool;
181 POOL_DEBUG(type, "Decisions:\n");
182 for (i = 0; i < solv->decisionq.count; i++)
184 p = solv->decisionq.elements[i];
186 POOL_DEBUG(type, "%d %d install %s, ", i, solv->decisionmap[p], pool_solvid2str(pool, p));
188 POOL_DEBUG(type, "%d %d conflict %s, ", i, -solv->decisionmap[-p], pool_solvid2str(pool, -p));
189 why = solv->decisionq_why.elements[i];
192 POOL_DEBUG(type, "forced by ");
193 solver_printruleclass(solv, type, solv->rules + why);
197 POOL_DEBUG(type, "chosen from ");
198 solver_printruleclass(solv, type, solv->rules - why);
201 POOL_DEBUG(type, "picked for some unknown reason.\n");
210 solver_printdecisions(Solver *solv)
212 Pool *pool = solv->pool;
213 Repo *installed = solv->installed;
214 Transaction *trans = solver_create_transaction(solv);
219 Queue recommendations;
223 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
224 POOL_DEBUG(SOLV_DEBUG_RESULT, "transaction:\n");
227 for (i = 0; i < trans->steps.count; i++)
229 p = trans->steps.elements[i];
230 s = pool->solvables + p;
231 type = transaction_type(trans, p, SOLVER_TRANSACTION_SHOW_ACTIVE|SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES|SOLVER_TRANSACTION_SHOW_MULTIINSTALL);
234 case SOLVER_TRANSACTION_MULTIINSTALL:
235 POOL_DEBUG(SOLV_DEBUG_RESULT, " multi install %s", pool_solvable2str(pool, s));
237 case SOLVER_TRANSACTION_MULTIREINSTALL:
238 POOL_DEBUG(SOLV_DEBUG_RESULT, " multi reinstall %s", pool_solvable2str(pool, s));
240 case SOLVER_TRANSACTION_INSTALL:
241 POOL_DEBUG(SOLV_DEBUG_RESULT, " install %s", pool_solvable2str(pool, s));
243 case SOLVER_TRANSACTION_REINSTALL:
244 POOL_DEBUG(SOLV_DEBUG_RESULT, " reinstall %s", pool_solvable2str(pool, s));
246 case SOLVER_TRANSACTION_DOWNGRADE:
247 POOL_DEBUG(SOLV_DEBUG_RESULT, " downgrade %s", pool_solvable2str(pool, s));
249 case SOLVER_TRANSACTION_CHANGE:
250 POOL_DEBUG(SOLV_DEBUG_RESULT, " change %s", pool_solvable2str(pool, s));
252 case SOLVER_TRANSACTION_UPGRADE:
253 case SOLVER_TRANSACTION_OBSOLETES:
254 POOL_DEBUG(SOLV_DEBUG_RESULT, " upgrade %s", pool_solvable2str(pool, s));
256 case SOLVER_TRANSACTION_ERASE:
257 POOL_DEBUG(SOLV_DEBUG_RESULT, " erase %s", pool_solvable2str(pool, s));
264 case SOLVER_TRANSACTION_INSTALL:
265 case SOLVER_TRANSACTION_ERASE:
266 case SOLVER_TRANSACTION_MULTIINSTALL:
267 case SOLVER_TRANSACTION_MULTIREINSTALL:
268 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
270 case SOLVER_TRANSACTION_REINSTALL:
271 case SOLVER_TRANSACTION_DOWNGRADE:
272 case SOLVER_TRANSACTION_CHANGE:
273 case SOLVER_TRANSACTION_UPGRADE:
274 case SOLVER_TRANSACTION_OBSOLETES:
275 transaction_all_obs_pkgs(trans, p, &iq);
278 POOL_DEBUG(SOLV_DEBUG_RESULT, " (obsoletes");
279 for (j = 0; j < iq.count; j++)
280 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s", pool_solvid2str(pool, iq.elements[j]));
281 POOL_DEBUG(SOLV_DEBUG_RESULT, ")");
283 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
291 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
293 queue_init(&recommendations);
294 queue_init(&suggestions);
295 queue_init(&orphaned);
296 solver_get_recommendations(solv, &recommendations, &suggestions, 0);
297 solver_get_orphaned(solv, &orphaned);
298 if (recommendations.count)
300 POOL_DEBUG(SOLV_DEBUG_RESULT, "recommended packages:\n");
301 for (i = 0; i < recommendations.count; i++)
303 s = pool->solvables + recommendations.elements[i];
304 if (solv->decisionmap[recommendations.elements[i]] > 0)
306 if (installed && s->repo == installed)
307 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (installed)\n", pool_solvable2str(pool, s));
309 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (selected)\n", pool_solvable2str(pool, s));
312 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", pool_solvable2str(pool, s));
314 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
317 if (suggestions.count)
319 POOL_DEBUG(SOLV_DEBUG_RESULT, "suggested packages:\n");
320 for (i = 0; i < suggestions.count; i++)
322 s = pool->solvables + suggestions.elements[i];
323 if (solv->decisionmap[suggestions.elements[i]] > 0)
325 if (installed && s->repo == installed)
326 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (installed)\n", pool_solvable2str(pool, s));
328 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (selected)\n", pool_solvable2str(pool, s));
331 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", pool_solvable2str(pool, s));
333 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
337 POOL_DEBUG(SOLV_DEBUG_RESULT, "orphaned packages:\n");
338 for (i = 0; i < orphaned.count; i++)
340 s = pool->solvables + orphaned.elements[i];
341 if (solv->decisionmap[solv->orphaned.elements[i]] > 0)
342 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (kept)\n", pool_solvable2str(pool, s));
344 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (erased)\n", pool_solvable2str(pool, s));
346 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
348 queue_free(&recommendations);
349 queue_free(&suggestions);
350 queue_free(&orphaned);
351 transaction_free(trans);
355 const char *id2strnone(Pool *pool, Id id)
357 return !id || id == 1 ? "(none)" : pool_id2str(pool, id);
361 transaction_print(Transaction *trans)
363 Pool *pool = trans->pool;
365 int i, j, mode, l, linel;
369 queue_init(&classes);
371 mode = SOLVER_TRANSACTION_SHOW_OBSOLETES | SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
372 transaction_classify(trans, mode, &classes);
373 for (i = 0; i < classes.count; i += 4)
375 Id class = classes.elements[i];
376 Id cnt = classes.elements[i + 1];
379 case SOLVER_TRANSACTION_ERASE:
380 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d erased packages:\n", cnt);
382 case SOLVER_TRANSACTION_INSTALL:
383 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d installed packages:\n", cnt);
385 case SOLVER_TRANSACTION_REINSTALLED:
386 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d reinstalled packages:\n", cnt);
388 case SOLVER_TRANSACTION_DOWNGRADED:
389 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d downgraded packages:\n", cnt);
391 case SOLVER_TRANSACTION_CHANGED:
392 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d changed packages:\n", cnt);
394 case SOLVER_TRANSACTION_UPGRADED:
395 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d upgraded packages:\n", cnt);
397 case SOLVER_TRANSACTION_VENDORCHANGE:
398 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]));
400 case SOLVER_TRANSACTION_ARCHCHANGE:
401 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]));
404 class = SOLVER_TRANSACTION_IGNORE;
407 if (class == SOLVER_TRANSACTION_IGNORE)
409 transaction_classify_pkgs(trans, mode, class, classes.elements[i + 2], classes.elements[i + 3], &pkgs);
412 for (j = 0; j < pkgs.count; j++)
414 Id p = pkgs.elements[j];
415 Solvable *s = pool->solvables + p;
420 case SOLVER_TRANSACTION_DOWNGRADED:
421 case SOLVER_TRANSACTION_UPGRADED:
422 s2 = pool->solvables + transaction_obs_pkg(trans, p);
423 POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s -> %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, s2));
425 case SOLVER_TRANSACTION_VENDORCHANGE:
426 case SOLVER_TRANSACTION_ARCHCHANGE:
427 n = pool_id2str(pool, s->name);
429 if (l + linel > sizeof(line) - 3)
432 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", line);
436 if (l + linel > sizeof(line) - 3)
437 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", n);
442 strcpy(line + linel, ", ");
445 strcpy(line + linel, n);
450 POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s\n", pool_solvable2str(pool, s));
455 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", line);
456 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
458 queue_free(&classes);
463 solver_printproblemruleinfo(Solver *solv, Id probr)
465 Pool *pool = solv->pool;
466 Id dep, source, target;
467 SolverRuleinfo type = solver_ruleinfo(solv, probr, &source, &target, &dep);
469 POOL_DEBUG(SOLV_DEBUG_RESULT, "%s\n", solver_problemruleinfo2str(solv, type, source, target, dep));
473 solver_printprobleminfo(Solver *solv, Id problem)
475 solver_printproblemruleinfo(solv, solver_findproblemrule(solv, problem));
479 solver_printcompleteprobleminfo(Solver *solv, Id problem)
486 solver_findallproblemrules(solv, problem, &q);
487 for (i = 0; i < q.count; i++)
489 probr = q.elements[i];
490 if (!(probr >= solv->updaterules && probr < solv->updaterules_end) && !(probr >= solv->jobrules && probr < solv->jobrules_end))
496 for (i = 0; i < q.count; i++)
498 probr = q.elements[i];
499 if (nobad && ((probr >= solv->updaterules && probr < solv->updaterules_end) || (probr >= solv->jobrules && probr < solv->jobrules_end)))
501 solver_printproblemruleinfo(solv, probr);
506 static int illegals[] = {
507 POLICY_ILLEGAL_DOWNGRADE,
508 POLICY_ILLEGAL_NAMECHANGE,
509 POLICY_ILLEGAL_ARCHCHANGE,
510 POLICY_ILLEGAL_VENDORCHANGE,
515 solver_printsolution(Solver *solv, Id problem, Id solution)
517 Pool *pool = solv->pool;
521 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0)
525 /* for replacements we want to know why it was illegal */
526 Solvable *s = pool->solvables + p, *rs = pool->solvables + rp;
527 int illegal = policy_is_illegal(solv, s, rs, 0);
531 for (i = 0; illegals[i]; i++)
532 if ((illegal & illegals[i]) != 0)
534 POOL_DEBUG(SOLV_DEBUG_RESULT, " - allow %s\n", policy_illegal2str(solv, illegals[i], s, rs));
535 illegal ^= illegals[i];
541 POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s\n", solver_solutionelement2str(solv, p, rp));
546 solver_printallsolutions(Solver *solv)
548 Pool *pool = solv->pool;
550 Id problem, solution;
552 POOL_DEBUG(SOLV_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n");
555 while ((problem = solver_next_problem(solv, problem)) != 0)
558 POOL_DEBUG(SOLV_DEBUG_RESULT, "Problem %d:\n", pcnt);
559 POOL_DEBUG(SOLV_DEBUG_RESULT, "====================================\n");
561 solver_printprobleminfo(solv, problem);
563 solver_printcompleteprobleminfo(solv, problem);
565 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
567 while ((solution = solver_next_solution(solv, problem, solution)) != 0)
569 solver_printsolution(solv, problem, solution);
570 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");