satsolver 0.16.3
|
00001 /* 00002 * Copyright (c) 2008, Novell Inc. 00003 * 00004 * This program is licensed under the BSD license, read LICENSE.BSD 00005 * for further information 00006 */ 00007 00008 /* 00009 * solverdebug.c 00010 * 00011 * debug functions for the SAT solver 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 * create obsoletesmap from solver decisions 00032 * 00033 * for solvables in installed repo: 00034 * 0 - not obsoleted 00035 * p - one of the packages that obsolete us 00036 * for all others: 00037 * n - number of packages this package obsoletes 00038 * 00039 */ 00040 00041 /* OBSOLETE: use transaction code instead! */ 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) /* obsoletes don't count for already installed packages */ 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) /* obsoletes don't count for already installed packages */ 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 * print rule 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) /* r is a solver rule */ 00168 POOL_DEBUG(type, "Rule #%d:", (int)(r - solv->rules)); 00169 else 00170 POOL_DEBUG(type, "Rule:"); /* r is any 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 /* print direct literal */ 00179 v = r->p; 00180 else if (!d) 00181 { 00182 if (i == 2) 00183 break; 00184 /* binary rule --> print w2 as second literal */ 00185 v = r->w2; 00186 } 00187 else 00188 /* every other which is in d */ 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 * printdecisions 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 static void 00547 solver_printproblemruleinfo(Solver *solv, Id probr) 00548 { 00549 Pool *pool = solv->pool; 00550 Id dep, source, target; 00551 00552 switch (solver_ruleinfo(solv, probr, &source, &target, &dep)) 00553 { 00554 case SOLVER_RULE_DISTUPGRADE: 00555 POOL_DEBUG(SAT_DEBUG_RESULT, "%s does not belong to a distupgrade repository\n", solvid2str(pool, source)); 00556 return; 00557 case SOLVER_RULE_INFARCH: 00558 POOL_DEBUG(SAT_DEBUG_RESULT, "%s has inferior architecture\n", solvid2str(pool, source)); 00559 return; 00560 case SOLVER_RULE_UPDATE: 00561 POOL_DEBUG(SAT_DEBUG_RESULT, "problem with installed package %s\n", solvid2str(pool, source)); 00562 return; 00563 case SOLVER_RULE_JOB: 00564 POOL_DEBUG(SAT_DEBUG_RESULT, "conflicting requests\n"); 00565 return; 00566 case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP: 00567 POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides requested %s\n", dep2str(pool, dep)); 00568 return; 00569 case SOLVER_RULE_RPM: 00570 POOL_DEBUG(SAT_DEBUG_RESULT, "some dependency problem\n"); 00571 return; 00572 case SOLVER_RULE_RPM_NOT_INSTALLABLE: 00573 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s is not installable\n", solvid2str(pool, source)); 00574 return; 00575 case SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP: 00576 POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides %s needed by %s\n", dep2str(pool, dep), solvid2str(pool, source)); 00577 return; 00578 case SOLVER_RULE_RPM_SAME_NAME: 00579 POOL_DEBUG(SAT_DEBUG_RESULT, "cannot install both %s and %s\n", solvid2str(pool, source), solvid2str(pool, target)); 00580 return; 00581 case SOLVER_RULE_RPM_PACKAGE_CONFLICT: 00582 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target)); 00583 return; 00584 case SOLVER_RULE_RPM_PACKAGE_OBSOLETES: 00585 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s obsoletes %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target)); 00586 return; 00587 case SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES: 00588 POOL_DEBUG(SAT_DEBUG_RESULT, "installed package %s obsoletes %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target)); 00589 return; 00590 case SOLVER_RULE_RPM_IMPLICIT_OBSOLETES: 00591 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s implicitely obsoletes %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target)); 00592 return; 00593 case SOLVER_RULE_RPM_PACKAGE_REQUIRES: 00594 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s requires %s, but none of the providers can be installed\n", solvid2str(pool, source), dep2str(pool, dep)); 00595 return; 00596 case SOLVER_RULE_RPM_SELF_CONFLICT: 00597 POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by itself\n", solvid2str(pool, source), dep2str(pool, dep)); 00598 return; 00599 case SOLVER_RULE_UNKNOWN: 00600 case SOLVER_RULE_FEATURE: 00601 case SOLVER_RULE_LEARNT: 00602 case SOLVER_RULE_CHOICE: 00603 POOL_DEBUG(SAT_DEBUG_RESULT, "bad rule type\n"); 00604 return; 00605 } 00606 } 00607 00608 void 00609 solver_printprobleminfo(Solver *solv, Id problem) 00610 { 00611 solver_printproblemruleinfo(solv, solver_findproblemrule(solv, problem)); 00612 } 00613 00614 void 00615 solver_printcompleteprobleminfo(Solver *solv, Id problem) 00616 { 00617 Queue q; 00618 Id probr; 00619 int i, nobad = 0; 00620 00621 queue_init(&q); 00622 solver_findallproblemrules(solv, problem, &q); 00623 for (i = 0; i < q.count; i++) 00624 { 00625 probr = q.elements[i]; 00626 if (!(probr >= solv->updaterules && probr < solv->updaterules_end) && !(probr >= solv->jobrules && probr < solv->jobrules_end)) 00627 { 00628 nobad = 1; 00629 break; 00630 } 00631 } 00632 for (i = 0; i < q.count; i++) 00633 { 00634 probr = q.elements[i]; 00635 if (nobad && ((probr >= solv->updaterules && probr < solv->updaterules_end) || (probr >= solv->jobrules && probr < solv->jobrules_end))) 00636 continue; 00637 solver_printproblemruleinfo(solv, probr); 00638 } 00639 queue_free(&q); 00640 } 00641 00642 void 00643 solver_printsolution(Solver *solv, Id problem, Id solution) 00644 { 00645 Pool *pool = solv->pool; 00646 Id p, rp, element, how, what, select; 00647 Solvable *s, *sd; 00648 00649 element = 0; 00650 while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0) 00651 { 00652 if (p == SOLVER_SOLUTION_JOB) 00653 { 00654 /* job, rp is index into job queue */ 00655 how = solv->job.elements[rp - 1]; 00656 what = solv->job.elements[rp]; 00657 select = how & SOLVER_SELECTMASK; 00658 switch (how & SOLVER_JOBMASK) 00659 { 00660 case SOLVER_INSTALL: 00661 if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed) 00662 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not keep %s installed\n", solvid2str(pool, what)); 00663 else if (select == SOLVER_SOLVABLE_PROVIDES) 00664 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not install a solvable %s\n", solver_select2str(pool, select, what)); 00665 else 00666 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not install %s\n", solver_select2str(pool, select, what)); 00667 break; 00668 case SOLVER_ERASE: 00669 if (select == SOLVER_SOLVABLE && !(solv->installed && pool->solvables[what].repo == solv->installed)) 00670 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not forbid installation of %s\n", solvid2str(pool, what)); 00671 else if (select == SOLVER_SOLVABLE_PROVIDES) 00672 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not deinstall all solvables %s\n", solver_select2str(pool, select, what)); 00673 else 00674 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not deinstall %s\n", solver_select2str(pool, select, what)); 00675 break; 00676 case SOLVER_UPDATE: 00677 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not install most recent version of %s\n", solver_select2str(pool, select, what)); 00678 break; 00679 case SOLVER_LOCK: 00680 POOL_DEBUG(SAT_DEBUG_RESULT, " - do not lock %s\n", solver_select2str(pool, select, what)); 00681 break; 00682 default: 00683 POOL_DEBUG(SAT_DEBUG_RESULT, " - do something different\n"); 00684 break; 00685 } 00686 } 00687 else if (p == SOLVER_SOLUTION_INFARCH) 00688 { 00689 s = pool->solvables + rp; 00690 if (solv->installed && s->repo == solv->installed) 00691 POOL_DEBUG(SAT_DEBUG_RESULT, " - keep %s despite the inferior architecture\n", solvable2str(pool, s)); 00692 else 00693 POOL_DEBUG(SAT_DEBUG_RESULT, " - install %s despite the inferior architecture\n", solvable2str(pool, s)); 00694 } 00695 else if (p == SOLVER_SOLUTION_DISTUPGRADE) 00696 { 00697 s = pool->solvables + rp; 00698 if (solv->installed && s->repo == solv->installed) 00699 POOL_DEBUG(SAT_DEBUG_RESULT, " - keep obsolete %s\n", solvable2str(pool, s)); 00700 else 00701 POOL_DEBUG(SAT_DEBUG_RESULT, " - install %s from excluded repository\n", solvable2str(pool, s)); 00702 } 00703 else 00704 { 00705 /* policy, replace p with rp */ 00706 s = pool->solvables + p; 00707 sd = rp ? pool->solvables + rp : 0; 00708 if (sd) 00709 { 00710 int illegal = policy_is_illegal(solv, s, sd, 0); 00711 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) 00712 POOL_DEBUG(SAT_DEBUG_RESULT, " - allow downgrade of %s to %s\n", solvable2str(pool, s), solvable2str(pool, sd)); 00713 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) 00714 POOL_DEBUG(SAT_DEBUG_RESULT, " - allow architecture change of %s to %s\n", solvable2str(pool, s), solvable2str(pool, sd)); 00715 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) 00716 { 00717 if (sd->vendor) 00718 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)); 00719 else 00720 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)); 00721 } 00722 if (!illegal) 00723 POOL_DEBUG(SAT_DEBUG_RESULT, " - allow replacement of %s with %s\n", solvable2str(pool, s), solvable2str(pool, sd)); 00724 } 00725 else 00726 { 00727 POOL_DEBUG(SAT_DEBUG_RESULT, " - allow deinstallation of %s\n", solvable2str(pool, s)); 00728 } 00729 } 00730 } 00731 } 00732 00733 void 00734 solver_printallsolutions(Solver *solv) 00735 { 00736 Pool *pool = solv->pool; 00737 int pcnt; 00738 Id problem, solution; 00739 00740 POOL_DEBUG(SAT_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n"); 00741 pcnt = 0; 00742 problem = 0; 00743 while ((problem = solver_next_problem(solv, problem)) != 0) 00744 { 00745 pcnt++; 00746 POOL_DEBUG(SAT_DEBUG_RESULT, "Problem %d:\n", pcnt); 00747 POOL_DEBUG(SAT_DEBUG_RESULT, "====================================\n"); 00748 #if 1 00749 solver_printprobleminfo(solv, problem); 00750 #else 00751 solver_printcompleteprobleminfo(solv, problem); 00752 #endif 00753 POOL_DEBUG(SAT_DEBUG_RESULT, "\n"); 00754 solution = 0; 00755 while ((solution = solver_next_solution(solv, problem, solution)) != 0) 00756 { 00757 solver_printsolution(solv, problem, solution); 00758 POOL_DEBUG(SAT_DEBUG_RESULT, "\n"); 00759 } 00760 } 00761 } 00762 00763 void 00764 solver_printtrivial(Solver *solv) 00765 { 00766 Pool *pool = solv->pool; 00767 Queue in, out; 00768 Id p; 00769 const char *n; 00770 Solvable *s; 00771 int i; 00772 00773 queue_init(&in); 00774 for (p = 1, s = pool->solvables + p; p < solv->pool->nsolvables; p++, s++) 00775 { 00776 n = id2str(pool, s->name); 00777 if (strncmp(n, "patch:", 6) != 0 && strncmp(n, "pattern:", 8) != 0) 00778 continue; 00779 queue_push(&in, p); 00780 } 00781 if (!in.count) 00782 { 00783 queue_free(&in); 00784 return; 00785 } 00786 queue_init(&out); 00787 solver_trivial_installable(solv, &in, &out); 00788 POOL_DEBUG(SAT_DEBUG_RESULT, "trivial installable status:\n"); 00789 for (i = 0; i < in.count; i++) 00790 POOL_DEBUG(SAT_DEBUG_RESULT, " %s: %d\n", solvid2str(pool, in.elements[i]), out.elements[i]); 00791 POOL_DEBUG(SAT_DEBUG_RESULT, "\n"); 00792 queue_free(&in); 00793 queue_free(&out); 00794 } 00795 00796 const char * 00797 solver_select2str(Pool *pool, Id select, Id what) 00798 { 00799 const char *s; 00800 char *b; 00801 if (select == SOLVER_SOLVABLE) 00802 return solvid2str(pool, what); 00803 if (select == SOLVER_SOLVABLE_NAME) 00804 return dep2str(pool, what); 00805 if (select == SOLVER_SOLVABLE_PROVIDES) 00806 { 00807 s = dep2str(pool, what); 00808 b = pool_alloctmpspace(pool, 11 + strlen(s)); 00809 sprintf(b, "providing %s", s); 00810 return b; 00811 } 00812 if (select == SOLVER_SOLVABLE_ONE_OF) 00813 { 00814 Id p; 00815 char *b2; 00816 b = ""; 00817 while ((p = pool->whatprovidesdata[what++]) != 0) 00818 { 00819 s = solvid2str(pool, p); 00820 b2 = pool_alloctmpspace(pool, strlen(b) + strlen(s) + 3); 00821 sprintf(b2, "%s, %s", b, s); 00822 b = b2; 00823 } 00824 return *b ? b + 2 : "nothing"; 00825 } 00826 if (select == SOLVER_SOLVABLE_REPO) 00827 { 00828 b = pool_alloctmpspace(pool, 20); 00829 sprintf(b, "repo #%d", what); 00830 return b; 00831 } 00832 if (select == SOLVER_SOLVABLE_ALL) 00833 return "all packages"; 00834 return "unknown job select"; 00835 }