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 (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 solver_printrule(solv, type, r);
133 solver_printproblem(Solver *solv, Id v)
135 Pool *pool = solv->pool;
141 solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, solv->rules + v);
145 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "JOB %d\n", v);
146 jp = solv->ruletojob.elements;
147 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
150 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "- ");
151 solver_printrule(solv, SOLV_DEBUG_SOLUTIONS, r);
153 POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "ENDJOB\n");
158 solver_printwatches(Solver *solv, int type)
160 Pool *pool = solv->pool;
163 POOL_DEBUG(type, "Watches: \n");
164 for (counter = -(pool->nsolvables - 1); counter < pool->nsolvables; counter++)
165 POOL_DEBUG(type, " solvable [%d] -- rule [%d]\n", counter, solv->watches[counter + pool->nsolvables]);
169 solver_printdecisionq(Solver *solv, int type)
171 Pool *pool = solv->pool;
175 POOL_DEBUG(type, "Decisions:\n");
176 for (i = 0; i < solv->decisionq.count; i++)
178 p = solv->decisionq.elements[i];
180 POOL_DEBUG(type, "%d %d install %s, ", i, solv->decisionmap[p], pool_solvid2str(pool, p));
182 POOL_DEBUG(type, "%d %d conflict %s, ", i, -solv->decisionmap[-p], pool_solvid2str(pool, -p));
183 why = solv->decisionq_why.elements[i];
186 POOL_DEBUG(type, "forced by ");
187 solver_printruleclass(solv, type, solv->rules + why);
191 POOL_DEBUG(type, "chosen from ");
192 solver_printruleclass(solv, type, solv->rules - why);
195 POOL_DEBUG(type, "picked for some unknown reason.\n");
204 solver_printdecisions(Solver *solv)
206 Pool *pool = solv->pool;
207 Repo *installed = solv->installed;
208 Transaction *trans = solver_create_transaction(solv);
213 Queue recommendations;
217 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
218 POOL_DEBUG(SOLV_DEBUG_RESULT, "transaction:\n");
221 for (i = 0; i < trans->steps.count; i++)
223 p = trans->steps.elements[i];
224 s = pool->solvables + p;
225 type = transaction_type(trans, p, SOLVER_TRANSACTION_SHOW_ACTIVE|SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES|SOLVER_TRANSACTION_SHOW_MULTIINSTALL);
228 case SOLVER_TRANSACTION_MULTIINSTALL:
229 POOL_DEBUG(SOLV_DEBUG_RESULT, " multi install %s", pool_solvable2str(pool, s));
231 case SOLVER_TRANSACTION_MULTIREINSTALL:
232 POOL_DEBUG(SOLV_DEBUG_RESULT, " multi reinstall %s", pool_solvable2str(pool, s));
234 case SOLVER_TRANSACTION_INSTALL:
235 POOL_DEBUG(SOLV_DEBUG_RESULT, " install %s", pool_solvable2str(pool, s));
237 case SOLVER_TRANSACTION_REINSTALL:
238 POOL_DEBUG(SOLV_DEBUG_RESULT, " reinstall %s", pool_solvable2str(pool, s));
240 case SOLVER_TRANSACTION_DOWNGRADE:
241 POOL_DEBUG(SOLV_DEBUG_RESULT, " downgrade %s", pool_solvable2str(pool, s));
243 case SOLVER_TRANSACTION_CHANGE:
244 POOL_DEBUG(SOLV_DEBUG_RESULT, " change %s", pool_solvable2str(pool, s));
246 case SOLVER_TRANSACTION_UPGRADE:
247 case SOLVER_TRANSACTION_OBSOLETES:
248 POOL_DEBUG(SOLV_DEBUG_RESULT, " upgrade %s", pool_solvable2str(pool, s));
250 case SOLVER_TRANSACTION_ERASE:
251 POOL_DEBUG(SOLV_DEBUG_RESULT, " erase %s", pool_solvable2str(pool, s));
258 case SOLVER_TRANSACTION_INSTALL:
259 case SOLVER_TRANSACTION_ERASE:
260 case SOLVER_TRANSACTION_MULTIINSTALL:
261 case SOLVER_TRANSACTION_MULTIREINSTALL:
262 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
264 case SOLVER_TRANSACTION_REINSTALL:
265 case SOLVER_TRANSACTION_DOWNGRADE:
266 case SOLVER_TRANSACTION_CHANGE:
267 case SOLVER_TRANSACTION_UPGRADE:
268 case SOLVER_TRANSACTION_OBSOLETES:
269 transaction_all_obs_pkgs(trans, p, &iq);
272 POOL_DEBUG(SOLV_DEBUG_RESULT, " (obsoletes");
273 for (j = 0; j < iq.count; j++)
274 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s", pool_solvid2str(pool, iq.elements[j]));
275 POOL_DEBUG(SOLV_DEBUG_RESULT, ")");
277 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
285 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
287 queue_init(&recommendations);
288 queue_init(&suggestions);
289 queue_init(&orphaned);
290 solver_get_recommendations(solv, &recommendations, &suggestions, 0);
291 if (recommendations.count)
293 POOL_DEBUG(SOLV_DEBUG_RESULT, "recommended packages:\n");
294 for (i = 0; i < recommendations.count; i++)
296 s = pool->solvables + recommendations.elements[i];
297 if (solv->decisionmap[recommendations.elements[i]] > 0)
299 if (installed && s->repo == installed)
300 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (installed)\n", pool_solvable2str(pool, s));
302 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (selected)\n", pool_solvable2str(pool, s));
305 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", pool_solvable2str(pool, s));
307 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
310 if (suggestions.count)
312 POOL_DEBUG(SOLV_DEBUG_RESULT, "suggested packages:\n");
313 for (i = 0; i < suggestions.count; i++)
315 s = pool->solvables + suggestions.elements[i];
316 if (solv->decisionmap[suggestions.elements[i]] > 0)
318 if (installed && s->repo == installed)
319 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (installed)\n", pool_solvable2str(pool, s));
321 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (selected)\n", pool_solvable2str(pool, s));
324 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", pool_solvable2str(pool, s));
326 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
330 POOL_DEBUG(SOLV_DEBUG_RESULT, "orphaned packages:\n");
331 for (i = 0; i < orphaned.count; i++)
333 s = pool->solvables + orphaned.elements[i];
334 if (solv->decisionmap[solv->orphaned.elements[i]] > 0)
335 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (kept)\n", pool_solvable2str(pool, s));
337 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s (erased)\n", pool_solvable2str(pool, s));
339 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
341 queue_free(&recommendations);
342 queue_free(&suggestions);
343 queue_free(&orphaned);
344 transaction_free(trans);
348 const char *id2strnone(Pool *pool, Id id)
350 return !id || id == 1 ? "(none)" : pool_id2str(pool, id);
354 transaction_print(Transaction *trans)
356 Pool *pool = trans->pool;
358 int i, j, mode, l, linel;
362 queue_init(&classes);
364 mode = SOLVER_TRANSACTION_SHOW_OBSOLETES | SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
365 transaction_classify(trans, mode, &classes);
366 for (i = 0; i < classes.count; i += 4)
368 Id class = classes.elements[i];
369 Id cnt = classes.elements[i + 1];
372 case SOLVER_TRANSACTION_ERASE:
373 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d erased packages:\n", cnt);
375 case SOLVER_TRANSACTION_INSTALL:
376 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d installed packages:\n", cnt);
378 case SOLVER_TRANSACTION_REINSTALLED:
379 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d reinstalled packages:\n", cnt);
381 case SOLVER_TRANSACTION_DOWNGRADED:
382 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d downgraded packages:\n", cnt);
384 case SOLVER_TRANSACTION_CHANGED:
385 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d changed packages:\n", cnt);
387 case SOLVER_TRANSACTION_UPGRADED:
388 POOL_DEBUG(SOLV_DEBUG_RESULT, "%d upgraded packages:\n", cnt);
390 case SOLVER_TRANSACTION_VENDORCHANGE:
391 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]));
393 case SOLVER_TRANSACTION_ARCHCHANGE:
394 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]));
397 class = SOLVER_TRANSACTION_IGNORE;
400 if (class == SOLVER_TRANSACTION_IGNORE)
402 transaction_classify_pkgs(trans, mode, class, classes.elements[i + 2], classes.elements[i + 3], &pkgs);
405 for (j = 0; j < pkgs.count; j++)
407 Id p = pkgs.elements[j];
408 Solvable *s = pool->solvables + p;
413 case SOLVER_TRANSACTION_DOWNGRADED:
414 case SOLVER_TRANSACTION_UPGRADED:
415 s2 = pool->solvables + transaction_obs_pkg(trans, p);
416 POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s -> %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, s2));
418 case SOLVER_TRANSACTION_VENDORCHANGE:
419 case SOLVER_TRANSACTION_ARCHCHANGE:
420 n = pool_id2str(pool, s->name);
422 if (l + linel > sizeof(line) - 3)
425 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", line);
429 if (l + linel > sizeof(line) - 3)
430 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", n);
435 strcpy(line + linel, ", ");
438 strcpy(line + linel, n);
443 POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s\n", pool_solvable2str(pool, s));
448 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s\n", line);
449 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
451 queue_free(&classes);
456 solver_printproblemruleinfo(Solver *solv, Id probr)
458 Pool *pool = solv->pool;
459 Id dep, source, target;
460 SolverRuleinfo type = solver_ruleinfo(solv, probr, &source, &target, &dep);
462 POOL_DEBUG(SOLV_DEBUG_RESULT, "%s\n", solver_problemruleinfo2str(solv, type, source, target, dep));
466 solver_printprobleminfo(Solver *solv, Id problem)
468 solver_printproblemruleinfo(solv, solver_findproblemrule(solv, problem));
472 solver_printcompleteprobleminfo(Solver *solv, Id problem)
479 solver_findallproblemrules(solv, problem, &q);
480 for (i = 0; i < q.count; i++)
482 probr = q.elements[i];
483 if (!(probr >= solv->updaterules && probr < solv->updaterules_end) && !(probr >= solv->jobrules && probr < solv->jobrules_end))
489 for (i = 0; i < q.count; i++)
491 probr = q.elements[i];
492 if (nobad && ((probr >= solv->updaterules && probr < solv->updaterules_end) || (probr >= solv->jobrules && probr < solv->jobrules_end)))
494 solver_printproblemruleinfo(solv, probr);
499 static int illegals[] = {
500 POLICY_ILLEGAL_DOWNGRADE,
501 POLICY_ILLEGAL_NAMECHANGE,
502 POLICY_ILLEGAL_ARCHCHANGE,
503 POLICY_ILLEGAL_VENDORCHANGE,
508 solver_printsolution(Solver *solv, Id problem, Id solution)
510 Pool *pool = solv->pool;
514 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0)
518 /* for replacements we want to know why it was illegal */
519 Solvable *s = pool->solvables + p, *rs = pool->solvables + rp;
520 int illegal = policy_is_illegal(solv, s, rs, 0);
524 for (i = 0; illegals[i]; i++)
525 if ((illegal & illegals[i]) != 0)
527 POOL_DEBUG(SOLV_DEBUG_RESULT, " - allow %s\n", policy_illegal2str(solv, illegals[i], s, rs));
528 illegal ^= illegals[i];
534 POOL_DEBUG(SOLV_DEBUG_RESULT, " - %s\n", solver_solutionelement2str(solv, p, rp));
539 solver_printallsolutions(Solver *solv)
541 Pool *pool = solv->pool;
543 Id problem, solution;
545 POOL_DEBUG(SOLV_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n");
548 while ((problem = solver_next_problem(solv, problem)) != 0)
551 POOL_DEBUG(SOLV_DEBUG_RESULT, "Problem %d:\n", pcnt);
552 POOL_DEBUG(SOLV_DEBUG_RESULT, "====================================\n");
554 solver_printprobleminfo(solv, problem);
556 solver_printcompleteprobleminfo(solv, problem);
558 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
560 while ((solution = solver_next_solution(solv, problem, solution)) != 0)
562 solver_printsolution(solv, problem, solution);
563 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
569 solver_printtrivial(Solver *solv)
571 Pool *pool = solv->pool;
579 for (p = 1, s = pool->solvables + p; p < solv->pool->nsolvables; p++, s++)
581 n = pool_id2str(pool, s->name);
582 if (strncmp(n, "patch:", 6) != 0 && strncmp(n, "pattern:", 8) != 0)
592 solver_trivial_installable(solv, &in, &out);
593 POOL_DEBUG(SOLV_DEBUG_RESULT, "trivial installable status:\n");
594 for (i = 0; i < in.count; i++)
595 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s: %d\n", pool_solvid2str(pool, in.elements[i]), out.elements[i]);
596 POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");