00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014 #include <stdio.h>
00015 #include <stdlib.h>
00016 #include <unistd.h>
00017 #include <string.h>
00018 #include <assert.h>
00019
00020 #include "solver.h"
00021 #include "solverdebug.h"
00022 #include "bitmap.h"
00023 #include "pool.h"
00024 #include "poolarch.h"
00025 #include "util.h"
00026 #include "evr.h"
00027 #include "policy.h"
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038
00039
00040
00041
00042
00043 Id *
00044 solver_create_decisions_obsoletesmap(Solver *solv)
00045 {
00046 Pool *pool = solv->pool;
00047 Repo *installed = solv->installed;
00048 Id p, *obsoletesmap = NULL;
00049 int i;
00050 Solvable *s;
00051
00052 obsoletesmap = (Id *)sat_calloc(pool->nsolvables, sizeof(Id));
00053 if (installed)
00054 {
00055 for (i = 0; i < solv->decisionq.count; i++)
00056 {
00057 Id pp, n;
00058 int noobs;
00059
00060 n = solv->decisionq.elements[i];
00061 if (n < 0)
00062 continue;
00063 if (n == SYSTEMSOLVABLE)
00064 continue;
00065 s = pool->solvables + n;
00066 if (s->repo == installed)
00067 continue;
00068 noobs = solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n);
00069 FOR_PROVIDES(p, pp, s->name)
00070 {
00071 Solvable *ps = pool->solvables + p;
00072 if (noobs && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
00073 continue;
00074 if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
00075 continue;
00076 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
00077 continue;
00078 if (ps->repo == installed && !obsoletesmap[p])
00079 {
00080 obsoletesmap[p] = n;
00081 obsoletesmap[n]++;
00082 }
00083 }
00084 }
00085 for (i = 0; i < solv->decisionq.count; i++)
00086 {
00087 Id obs, *obsp;
00088 Id pp, n;
00089
00090 n = solv->decisionq.elements[i];
00091 if (n < 0)
00092 continue;
00093 if (n == SYSTEMSOLVABLE)
00094 continue;
00095 s = pool->solvables + n;
00096 if (s->repo == installed)
00097 continue;
00098 if (!s->obsoletes)
00099 continue;
00100 if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n))
00101 continue;
00102 obsp = s->repo->idarraydata + s->obsoletes;
00103 while ((obs = *obsp++) != 0)
00104 {
00105 FOR_PROVIDES(p, pp, obs)
00106 {
00107 Solvable *ps = pool->solvables + p;
00108 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
00109 continue;
00110 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
00111 continue;
00112 if (pool->solvables[p].repo == installed && !obsoletesmap[p])
00113 {
00114 obsoletesmap[p] = n;
00115 obsoletesmap[n]++;
00116 }
00117 }
00118 }
00119 }
00120 }
00121 return obsoletesmap;
00122 }
00123
00124 void
00125 solver_printruleelement(Solver *solv, int type, Rule *r, Id v)
00126 {
00127 Pool *pool = solv->pool;
00128 Solvable *s;
00129 if (v < 0)
00130 {
00131 s = pool->solvables + -v;
00132 POOL_DEBUG(type, " !%s [%d]", solvable2str(pool, s), -v);
00133 }
00134 else
00135 {
00136 s = pool->solvables + v;
00137 POOL_DEBUG(type, " %s [%d]", solvable2str(pool, s), v);
00138 }
00139 if (pool->installed && s->repo == pool->installed)
00140 POOL_DEBUG(type, "I");
00141 if (r)
00142 {
00143 if (r->w1 == v)
00144 POOL_DEBUG(type, " (w1)");
00145 if (r->w2 == v)
00146 POOL_DEBUG(type, " (w2)");
00147 }
00148 if (solv->decisionmap[s - pool->solvables] > 0)
00149 POOL_DEBUG(type, " Install.level%d", solv->decisionmap[s - pool->solvables]);
00150 if (solv->decisionmap[s - pool->solvables] < 0)
00151 POOL_DEBUG(type, " Conflict.level%d", -solv->decisionmap[s - pool->solvables]);
00152 POOL_DEBUG(type, "\n");
00153 }
00154
00155
00156
00157
00158
00159
00160 void
00161 solver_printrule(Solver *solv, int type, Rule *r)
00162 {
00163 Pool *pool = solv->pool;
00164 int i;
00165 Id d, v;
00166
00167 if (r >= solv->rules && r < solv->rules + solv->nrules)
00168 POOL_DEBUG(type, "Rule #%d:", (int)(r - solv->rules));
00169 else
00170 POOL_DEBUG(type, "Rule:");
00171 if (r && r->d < 0)
00172 POOL_DEBUG(type, " (disabled)");
00173 POOL_DEBUG(type, "\n");
00174 d = r->d < 0 ? -r->d - 1 : r->d;
00175 for (i = 0; ; i++)
00176 {
00177 if (i == 0)
00178
00179 v = r->p;
00180 else if (!d)
00181 {
00182 if (i == 2)
00183 break;
00184
00185 v = r->w2;
00186 }
00187 else
00188
00189 v = solv->pool->whatprovidesdata[d + i - 1];
00190 if (v == ID_NULL)
00191 break;
00192 solver_printruleelement(solv, type, r, v);
00193 }
00194 POOL_DEBUG(type, " next rules: %d %d\n", r->n1, r->n2);
00195 }
00196
00197 void
00198 solver_printruleclass(Solver *solv, int type, Rule *r)
00199 {
00200 Pool *pool = solv->pool;
00201 Id p = r - solv->rules;
00202 assert(p >= 0);
00203 if (p < solv->learntrules)
00204 if (MAPTST(&solv->weakrulemap, p))
00205 POOL_DEBUG(type, "WEAK ");
00206 if (solv->learntrules && p >= solv->learntrules)
00207 POOL_DEBUG(type, "LEARNT ");
00208 else if (p >= solv->choicerules && p < solv->choicerules_end)
00209 POOL_DEBUG(type, "CHOICE ");
00210 else if (p >= solv->infarchrules && p < solv->infarchrules_end)
00211 POOL_DEBUG(type, "INFARCH ");
00212 else if (p >= solv->duprules && p < solv->duprules_end)
00213 POOL_DEBUG(type, "DUP ");
00214 else if (p >= solv->jobrules && p < solv->jobrules_end)
00215 POOL_DEBUG(type, "JOB ");
00216 else if (p >= solv->updaterules && p < solv->updaterules_end)
00217 POOL_DEBUG(type, "UPDATE ");
00218 else if (p >= solv->featurerules && p < solv->featurerules_end)
00219 POOL_DEBUG(type, "FEATURE ");
00220 solver_printrule(solv, type, r);
00221 }
00222
00223 void
00224 solver_printproblem(Solver *solv, Id v)
00225 {
00226 Pool *pool = solv->pool;
00227 int i;
00228 Rule *r;
00229 Id *jp;
00230
00231 if (v > 0)
00232 solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, solv->rules + v);
00233 else
00234 {
00235 v = -(v + 1);
00236 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "JOB %d\n", v);
00237 jp = solv->ruletojob.elements;
00238 for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
00239 if (*jp == v)
00240 {
00241 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "- ");
00242 solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
00243 }
00244 POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "ENDJOB\n");
00245 }
00246 }
00247
00248 void
00249 solver_printwatches(Solver *solv, int type)
00250 {
00251 Pool *pool = solv->pool;
00252 int counter;
00253
00254 POOL_DEBUG(type, "Watches: \n");
00255 for (counter = -(pool->nsolvables - 1); counter < pool->nsolvables; counter++)
00256 POOL_DEBUG(type, " solvable [%d] -- rule [%d]\n", counter, solv->watches[counter + pool->nsolvables]);
00257 }
00258
00259 void
00260 solver_printdecisionq(Solver *solv, int type)
00261 {
00262 Pool *pool = solv->pool;
00263 int i;
00264 Id p, why;
00265
00266 POOL_DEBUG(type, "Decisions:\n");
00267 for (i = 0; i < solv->decisionq.count; i++)
00268 {
00269 p = solv->decisionq.elements[i];
00270 if (p > 0)
00271 POOL_DEBUG(type, "%d %d install %s, ", i, solv->decisionmap[p], solvid2str(pool, p));
00272 else
00273 POOL_DEBUG(type, "%d %d conflict %s, ", i, -solv->decisionmap[-p], solvid2str(pool, -p));
00274 why = solv->decisionq_why.elements[i];
00275 if (why > 0)
00276 {
00277 POOL_DEBUG(type, "forced by ");
00278 solver_printruleclass(solv, type, solv->rules + why);
00279 }
00280 else if (why < 0)
00281 {
00282 POOL_DEBUG(type, "chosen from ");
00283 solver_printruleclass(solv, type, solv->rules - why);
00284 }
00285 else
00286 POOL_DEBUG(type, "picked for some unknown reason.\n");
00287 }
00288 }
00289
00290
00291
00292
00293
00294 void
00295 solver_printdecisions(Solver *solv)
00296 {
00297 Pool *pool = solv->pool;
00298 Repo *installed = solv->installed;
00299 Id p, type;
00300 int i, j;
00301 Solvable *s;
00302 Queue iq;
00303
00304 IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
00305 {
00306 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- Decisions -----\n");
00307 for (i = 0; i < solv->decisionq.count; i++)
00308 {
00309 p = solv->decisionq.elements[i];
00310 solver_printruleelement(solv, SAT_DEBUG_SCHUBI, 0, p);
00311 }
00312 POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- Decisions end -----\n");
00313 }
00314
00315 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00316 POOL_DEBUG(SAT_DEBUG_RESULT, "transaction:\n");
00317
00318 queue_init(&iq);
00319 for (i = 0; i < solv->trans.steps.count; i++)
00320 {
00321 p = solv->trans.steps.elements[i];
00322 s = pool->solvables + p;
00323 type = transaction_type(&solv->trans, p, SOLVER_TRANSACTION_SHOW_ACTIVE|SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES|SOLVER_TRANSACTION_SHOW_MULTIINSTALL);
00324 switch(type)
00325 {
00326 case SOLVER_TRANSACTION_MULTIINSTALL:
00327 POOL_DEBUG(SAT_DEBUG_RESULT, " multi install %s", solvable2str(pool, s));
00328 break;
00329 case SOLVER_TRANSACTION_MULTIREINSTALL:
00330 POOL_DEBUG(SAT_DEBUG_RESULT, " multi reinstall %s", solvable2str(pool, s));
00331 break;
00332 case SOLVER_TRANSACTION_INSTALL:
00333 POOL_DEBUG(SAT_DEBUG_RESULT, " install %s", solvable2str(pool, s));
00334 break;
00335 case SOLVER_TRANSACTION_REINSTALL:
00336 POOL_DEBUG(SAT_DEBUG_RESULT, " reinstall %s", solvable2str(pool, s));
00337 break;
00338 case SOLVER_TRANSACTION_DOWNGRADE:
00339 POOL_DEBUG(SAT_DEBUG_RESULT, " downgrade %s", solvable2str(pool, s));
00340 break;
00341 case SOLVER_TRANSACTION_CHANGE:
00342 POOL_DEBUG(SAT_DEBUG_RESULT, " change %s", solvable2str(pool, s));
00343 break;
00344 case SOLVER_TRANSACTION_UPGRADE:
00345 case SOLVER_TRANSACTION_OBSOLETES:
00346 POOL_DEBUG(SAT_DEBUG_RESULT, " upgrade %s", solvable2str(pool, s));
00347 break;
00348 case SOLVER_TRANSACTION_ERASE:
00349 POOL_DEBUG(SAT_DEBUG_RESULT, " erase %s", solvable2str(pool, s));
00350 break;
00351 default:
00352 break;
00353 }
00354 switch(type)
00355 {
00356 case SOLVER_TRANSACTION_INSTALL:
00357 case SOLVER_TRANSACTION_ERASE:
00358 case SOLVER_TRANSACTION_MULTIINSTALL:
00359 case SOLVER_TRANSACTION_MULTIREINSTALL:
00360 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00361 break;
00362 case SOLVER_TRANSACTION_REINSTALL:
00363 case SOLVER_TRANSACTION_DOWNGRADE:
00364 case SOLVER_TRANSACTION_CHANGE:
00365 case SOLVER_TRANSACTION_UPGRADE:
00366 case SOLVER_TRANSACTION_OBSOLETES:
00367 transaction_all_obs_pkgs(&solv->trans, p, &iq);
00368 if (iq.count)
00369 {
00370 POOL_DEBUG(SAT_DEBUG_RESULT, " (obsoletes");
00371 for (j = 0; j < iq.count; j++)
00372 POOL_DEBUG(SAT_DEBUG_RESULT, " %s", solvid2str(pool, iq.elements[j]));
00373 POOL_DEBUG(SAT_DEBUG_RESULT, ")");
00374 }
00375 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00376 break;
00377 default:
00378 break;
00379 }
00380 }
00381 queue_free(&iq);
00382
00383 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00384
00385 if (solv->recommendations.count)
00386 {
00387 POOL_DEBUG(SAT_DEBUG_RESULT, "recommended packages:\n");
00388 for (i = 0; i < solv->recommendations.count; i++)
00389 {
00390 s = pool->solvables + solv->recommendations.elements[i];
00391 if (solv->decisionmap[solv->recommendations.elements[i]] > 0)
00392 {
00393 if (installed && s->repo == installed)
00394 POOL_DEBUG(SAT_DEBUG_RESULT, " %s (installed)\n", solvable2str(pool, s));
00395 else
00396 POOL_DEBUG(SAT_DEBUG_RESULT, " %s (selected)\n", solvable2str(pool, s));
00397 }
00398 else
00399 POOL_DEBUG(SAT_DEBUG_RESULT, " %s\n", solvable2str(pool, s));
00400 }
00401 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00402 }
00403
00404 if (solv->suggestions.count)
00405 {
00406 POOL_DEBUG(SAT_DEBUG_RESULT, "suggested packages:\n");
00407 for (i = 0; i < solv->suggestions.count; i++)
00408 {
00409 s = pool->solvables + solv->suggestions.elements[i];
00410 if (solv->decisionmap[solv->suggestions.elements[i]] > 0)
00411 {
00412 if (installed && s->repo == installed)
00413 POOL_DEBUG(SAT_DEBUG_RESULT, " %s (installed)\n", solvable2str(pool, s));
00414 else
00415 POOL_DEBUG(SAT_DEBUG_RESULT, " %s (selected)\n", solvable2str(pool, s));
00416 }
00417 else
00418 POOL_DEBUG(SAT_DEBUG_RESULT, " %s\n", solvable2str(pool, s));
00419 }
00420 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00421 }
00422 if (solv->orphaned.count)
00423 {
00424 POOL_DEBUG(SAT_DEBUG_RESULT, "orphaned packages:\n");
00425 for (i = 0; i < solv->orphaned.count; i++)
00426 {
00427 s = pool->solvables + solv->orphaned.elements[i];
00428 if (solv->decisionmap[solv->orphaned.elements[i]] > 0)
00429 POOL_DEBUG(SAT_DEBUG_RESULT, " %s (kept)\n", solvable2str(pool, s));
00430 else
00431 POOL_DEBUG(SAT_DEBUG_RESULT, " %s (erased)\n", solvable2str(pool, s));
00432 }
00433 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00434 }
00435 }
00436
00437 static inline
00438 const char *id2strnone(Pool *pool, Id id)
00439 {
00440 return !id || id == 1 ? "(none)" : id2str(pool, id);
00441 }
00442
00443 void
00444 solver_printtransaction(Solver *solv)
00445 {
00446 Transaction *trans = &solv->trans;
00447 Pool *pool = trans->pool;
00448 Queue classes, pkgs;
00449 int i, j, mode, l, linel;
00450 char line[76];
00451 const char *n;
00452
00453 queue_init(&classes);
00454 queue_init(&pkgs);
00455 mode = 0;
00456 transaction_classify(trans, mode, &classes);
00457 for (i = 0; i < classes.count; i += 4)
00458 {
00459 Id class = classes.elements[i];
00460 Id cnt = classes.elements[i + 1];
00461 switch(class)
00462 {
00463 case SOLVER_TRANSACTION_ERASE:
00464 POOL_DEBUG(SAT_DEBUG_RESULT, "%d erased packages:\n", cnt);
00465 break;
00466 case SOLVER_TRANSACTION_INSTALL:
00467 POOL_DEBUG(SAT_DEBUG_RESULT, "%d installed packages:\n", cnt);
00468 break;
00469 case SOLVER_TRANSACTION_REINSTALLED:
00470 POOL_DEBUG(SAT_DEBUG_RESULT, "%d reinstalled packages:\n", cnt);
00471 break;
00472 case SOLVER_TRANSACTION_DOWNGRADED:
00473 POOL_DEBUG(SAT_DEBUG_RESULT, "%d downgraded packages:\n", cnt);
00474 break;
00475 case SOLVER_TRANSACTION_CHANGED:
00476 POOL_DEBUG(SAT_DEBUG_RESULT, "%d changed packages:\n", cnt);
00477 break;
00478 case SOLVER_TRANSACTION_UPGRADED:
00479 POOL_DEBUG(SAT_DEBUG_RESULT, "%d upgraded packages:\n", cnt);
00480 break;
00481 case SOLVER_TRANSACTION_VENDORCHANGE:
00482 POOL_DEBUG(SAT_DEBUG_RESULT, "%d vendor changes from '%s' to '%s':\n", cnt, id2strnone(pool, classes.elements[i + 2]), id2strnone(pool, classes.elements[i + 3]));
00483 break;
00484 case SOLVER_TRANSACTION_ARCHCHANGE:
00485 POOL_DEBUG(SAT_DEBUG_RESULT, "%d arch changes from %s to %s:\n", cnt, id2str(pool, classes.elements[i + 2]), id2str(pool, classes.elements[i + 3]));
00486 break;
00487 default:
00488 class = SOLVER_TRANSACTION_IGNORE;
00489 break;
00490 }
00491 if (class == SOLVER_TRANSACTION_IGNORE)
00492 continue;
00493 transaction_classify_pkgs(trans, mode, class, classes.elements[i + 2], classes.elements[i + 3], &pkgs);
00494 *line = 0;
00495 linel = 0;
00496 for (j = 0; j < pkgs.count; j++)
00497 {
00498 Id p = pkgs.elements[j];
00499 Solvable *s = pool->solvables + p;
00500 Solvable *s2;
00501
00502 switch(class)
00503 {
00504 case SOLVER_TRANSACTION_DOWNGRADED:
00505 case SOLVER_TRANSACTION_UPGRADED:
00506 s2 = pool->solvables + transaction_obs_pkg(trans, p);
00507 POOL_DEBUG(SAT_DEBUG_RESULT, " - %s -> %s\n", solvable2str(pool, s), solvable2str(pool, s2));
00508 break;
00509 case SOLVER_TRANSACTION_VENDORCHANGE:
00510 case SOLVER_TRANSACTION_ARCHCHANGE:
00511 n = id2str(pool, s->name);
00512 l = strlen(n);
00513 if (l + linel > sizeof(line) - 3)
00514 {
00515 if (*line)
00516 POOL_DEBUG(SAT_DEBUG_RESULT, " %s\n", line);
00517 *line = 0;
00518 linel = 0;
00519 }
00520 if (l + linel > sizeof(line) - 3)
00521 POOL_DEBUG(SAT_DEBUG_RESULT, " %s\n", n);
00522 else
00523 {
00524 if (*line)
00525 {
00526 strcpy(line + linel, ", ");
00527 linel += 2;
00528 }
00529 strcpy(line + linel, n);
00530 linel += l;
00531 }
00532 break;
00533 default:
00534 POOL_DEBUG(SAT_DEBUG_RESULT, " - %s\n", solvable2str(pool, s));
00535 break;
00536 }
00537 }
00538 if (*line)
00539 POOL_DEBUG(SAT_DEBUG_RESULT, " %s\n", line);
00540 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00541 }
00542 queue_free(&classes);
00543 queue_free(&pkgs);
00544 }
00545
00546 void
00547 solver_printprobleminfo(Solver *solv, Id problem)
00548 {
00549 Pool *pool = solv->pool;
00550 Id probr;
00551 Id dep, source, target;
00552
00553 probr = solver_findproblemrule(solv, problem);
00554 switch (solver_ruleinfo(solv, probr, &source, &target, &dep))
00555 {
00556 case SOLVER_RULE_DISTUPGRADE:
00557 POOL_DEBUG(SAT_DEBUG_RESULT, "%s does not belong to a distupgrade repository\n", solvid2str(pool, source));
00558 return;
00559 case SOLVER_RULE_INFARCH:
00560 POOL_DEBUG(SAT_DEBUG_RESULT, "%s has inferior architecture\n", solvid2str(pool, source));
00561 return;
00562 case SOLVER_RULE_UPDATE:
00563 POOL_DEBUG(SAT_DEBUG_RESULT, "problem with installed package %s\n", solvid2str(pool, source));
00564 return;
00565 case SOLVER_RULE_JOB:
00566 POOL_DEBUG(SAT_DEBUG_RESULT, "conflicting requests\n");
00567 return;
00568 case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
00569 POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides requested %s\n", dep2str(pool, dep));
00570 return;
00571 case SOLVER_RULE_RPM:
00572 POOL_DEBUG(SAT_DEBUG_RESULT, "some dependency problem\n");
00573 return;
00574 case SOLVER_RULE_RPM_NOT_INSTALLABLE:
00575 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s is not installable\n", solvid2str(pool, source));
00576 return;
00577 case SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP:
00578 POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides %s needed by %s\n", dep2str(pool, dep), solvid2str(pool, source));
00579 return;
00580 case SOLVER_RULE_RPM_SAME_NAME:
00581 POOL_DEBUG(SAT_DEBUG_RESULT, "cannot install both %s and %s\n", solvid2str(pool, source), solvid2str(pool, target));
00582 return;
00583 case SOLVER_RULE_RPM_PACKAGE_CONFLICT:
00584 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target));
00585 return;
00586 case SOLVER_RULE_RPM_PACKAGE_OBSOLETES:
00587 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s obsoletes %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target));
00588 return;
00589 case SOLVER_RULE_RPM_IMPLICIT_OBSOLETES:
00590 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s implicitely obsoletes %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target));
00591 return;
00592 case SOLVER_RULE_RPM_PACKAGE_REQUIRES:
00593 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s requires %s, but none of the providers can be installed\n", solvid2str(pool, source), dep2str(pool, dep));
00594 return;
00595 case SOLVER_RULE_RPM_SELF_CONFLICT:
00596 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by itself\n", solvid2str(pool, source), dep2str(pool, dep));
00597 return;
00598 case SOLVER_RULE_UNKNOWN:
00599 case SOLVER_RULE_FEATURE:
00600 case SOLVER_RULE_LEARNT:
00601 case SOLVER_RULE_CHOICE:
00602 POOL_DEBUG(SAT_DEBUG_RESULT, "bad rule type\n");
00603 return;
00604 }
00605 }
00606
00607 void
00608 solver_printsolution(Solver *solv, Id problem, Id solution)
00609 {
00610 Pool *pool = solv->pool;
00611 Id p, rp, element, how, what, select;
00612 Solvable *s, *sd;
00613
00614 element = 0;
00615 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0)
00616 {
00617 if (p == SOLVER_SOLUTION_JOB)
00618 {
00619
00620 how = solv->job.elements[rp - 1];
00621 what = solv->job.elements[rp];
00622 select = how & SOLVER_SELECTMASK;
00623 switch (how & SOLVER_JOBMASK)
00624 {
00625 case SOLVER_INSTALL:
00626 if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
00627 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not keep %s installed\n", solvid2str(pool, what));
00628 else if (select == SOLVER_SOLVABLE_PROVIDES)
00629 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not install a solvable %s\n", solver_select2str(solv, select, what));
00630 else
00631 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not install %s\n", solver_select2str(solv, select, what));
00632 break;
00633 case SOLVER_ERASE:
00634 if (select == SOLVER_SOLVABLE && !(solv->installed && pool->solvables[what].repo == solv->installed))
00635 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not forbid installation of %s\n", solvid2str(pool, what));
00636 else if (select == SOLVER_SOLVABLE_PROVIDES)
00637 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not deinstall all solvables %s\n", solver_select2str(solv, select, what));
00638 else
00639 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not deinstall %s\n", solver_select2str(solv, select, what));
00640 break;
00641 case SOLVER_UPDATE:
00642 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not install most recent version of %s\n", solver_select2str(solv, select, what));
00643 break;
00644 case SOLVER_LOCK:
00645 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not lock %s\n", solver_select2str(solv, select, what));
00646 break;
00647 default:
00648 POOL_DEBUG(SAT_DEBUG_RESULT, " - do something different\n");
00649 break;
00650 }
00651 }
00652 else if (p == SOLVER_SOLUTION_INFARCH)
00653 {
00654 s = pool->solvables + rp;
00655 if (solv->installed && s->repo == solv->installed)
00656 POOL_DEBUG(SAT_DEBUG_RESULT, " - keep %s despite the inferior architecture\n", solvable2str(pool, s));
00657 else
00658 POOL_DEBUG(SAT_DEBUG_RESULT, " - install %s despite the inferior architecture\n", solvable2str(pool, s));
00659 }
00660 else if (p == SOLVER_SOLUTION_DISTUPGRADE)
00661 {
00662 s = pool->solvables + rp;
00663 if (solv->installed && s->repo == solv->installed)
00664 POOL_DEBUG(SAT_DEBUG_RESULT, " - keep obsolete %s\n", solvable2str(pool, s));
00665 else
00666 POOL_DEBUG(SAT_DEBUG_RESULT, " - install %s from excluded repository\n", solvable2str(pool, s));
00667 }
00668 else
00669 {
00670
00671 s = pool->solvables + p;
00672 sd = rp ? pool->solvables + rp : 0;
00673 if (s == sd && solv->distupgrade)
00674 {
00675 POOL_DEBUG(SAT_DEBUG_RESULT, " - keep obsolete %s\n", solvable2str(pool, s));
00676 }
00677 else if (sd)
00678 {
00679 int gotone = 0;
00680 if (!solv->allowdowngrade && evrcmp(pool, s->evr, sd->evr, EVRCMP_MATCH_RELEASE) > 0)
00681 {
00682 POOL_DEBUG(SAT_DEBUG_RESULT, " - allow downgrade of %s to %s\n", solvable2str(pool, s), solvable2str(pool, sd));
00683 gotone = 1;
00684 }
00685 if (!solv->allowarchchange && s->name == sd->name && s->arch != sd->arch && policy_illegal_archchange(solv, s, sd))
00686 {
00687 POOL_DEBUG(SAT_DEBUG_RESULT, " - allow architecture change of %s to %s\n", solvable2str(pool, s), solvable2str(pool, sd));
00688 gotone = 1;
00689 }
00690 if (!solv->allowvendorchange && s->name == sd->name && s->vendor != sd->vendor && policy_illegal_vendorchange(solv, s, sd))
00691 {
00692 if (sd->vendor)
00693 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));
00694 else
00695 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));
00696 gotone = 1;
00697 }
00698 if (!gotone)
00699 POOL_DEBUG(SAT_DEBUG_RESULT, " - allow replacement of %s with %s\n", solvable2str(pool, s), solvable2str(pool, sd));
00700 }
00701 else
00702 {
00703 POOL_DEBUG(SAT_DEBUG_RESULT, " - allow deinstallation of %s\n", solvable2str(pool, s));
00704 }
00705
00706 }
00707 }
00708 }
00709
00710 void
00711 solver_printallsolutions(Solver *solv)
00712 {
00713 Pool *pool = solv->pool;
00714 int pcnt;
00715 Id problem, solution;
00716
00717 POOL_DEBUG(SAT_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n");
00718 pcnt = 0;
00719 problem = 0;
00720 while ((problem = solver_next_problem(solv, problem)) != 0)
00721 {
00722 pcnt++;
00723 POOL_DEBUG(SAT_DEBUG_RESULT, "Problem %d:\n", pcnt);
00724 POOL_DEBUG(SAT_DEBUG_RESULT, "====================================\n");
00725 solver_printprobleminfo(solv, problem);
00726 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00727 solution = 0;
00728 while ((solution = solver_next_solution(solv, problem, solution)) != 0)
00729 {
00730 solver_printsolution(solv, problem, solution);
00731 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00732 }
00733 }
00734 }
00735
00736 void
00737 solver_printtrivial(Solver *solv)
00738 {
00739 Pool *pool = solv->pool;
00740 Queue in, out;
00741 Id p;
00742 const char *n;
00743 Solvable *s;
00744 int i;
00745
00746 queue_init(&in);
00747 for (p = 1, s = pool->solvables + p; p < solv->pool->nsolvables; p++, s++)
00748 {
00749 n = id2str(pool, s->name);
00750 if (strncmp(n, "patch:", 6) != 0 && strncmp(n, "pattern:", 8) != 0)
00751 continue;
00752 queue_push(&in, p);
00753 }
00754 if (!in.count)
00755 {
00756 queue_free(&in);
00757 return;
00758 }
00759 queue_init(&out);
00760 solver_trivial_installable(solv, &in, &out);
00761 POOL_DEBUG(SAT_DEBUG_RESULT, "trivial installable status:\n");
00762 for (i = 0; i < in.count; i++)
00763 POOL_DEBUG(SAT_DEBUG_RESULT, " %s: %d\n", solvid2str(pool, in.elements[i]), out.elements[i]);
00764 POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
00765 queue_free(&in);
00766 queue_free(&out);
00767 }
00768
00769 const char *
00770 solver_select2str(Solver *solv, Id select, Id what)
00771 {
00772 Pool *pool = solv->pool;
00773 const char *s;
00774 char *b;
00775 if (select == SOLVER_SOLVABLE)
00776 return solvid2str(pool, what);
00777 if (select == SOLVER_SOLVABLE_NAME)
00778 return dep2str(pool, what);
00779 if (select == SOLVER_SOLVABLE_PROVIDES)
00780 {
00781 s = dep2str(pool, what);
00782 b = pool_alloctmpspace(pool, 11 + strlen(s));
00783 sprintf(b, "providing %s", s);
00784 return b;
00785 }
00786 if (select == SOLVER_SOLVABLE_ONE_OF)
00787 {
00788 Id p;
00789 char *b2;
00790 b = "";
00791 while ((p = pool->whatprovidesdata[what++]) != 0)
00792 {
00793 s = solvid2str(pool, p);
00794 b2 = pool_alloctmpspace(pool, strlen(b) + strlen(s) + 3);
00795 sprintf(b2, "%s, %s", b, s);
00796 b = b2;
00797 }
00798 return *b ? b + 2 : "nothing";
00799 }
00800 if (select == SOLVER_SOLVABLE_REPO)
00801 {
00802 b = pool_alloctmpspace(pool, 20);
00803 sprintf(b, "repo #%d", what);
00804 return b;
00805 }
00806 return "unknown job select";
00807 }