src/solverdebug.c

   1 /*
   2  * Copyright (c) 2008, Novell Inc.
   3  *
   4  * This program is licensed under the BSD license, read LICENSE.BSD
   5  * for further information
   6  */
   7
   8 /*
   9  * solverdebug.c
  10  *
  11  * debug functions for the SAT solver
  12  */
  13
  14 #include <stdio.h>
  15 #include <stdlib.h>
  16 #include <unistd.h>
  17 #include <string.h>
  18 #include <assert.h>
  19
  20 #include "solver.h"
  21 #include "solver_private.h"
  22 #include "solverdebug.h"
  23 #include "bitmap.h"
  24 #include "pool.h"
  25 #include "poolarch.h"
  26 #include "util.h"
  27 #include "evr.h"
  28 #include "policy.h"
  29
  30
  31 /*
  32  * create obsoletesmap from solver decisions
  33  *
  34  * for solvables in installed repo:
  35  *   0 - not obsoleted
  36  *   p - one of the packages that obsolete us
  37  * for all others:
  38  *   n - number of packages this package obsoletes
  39  *
  40  */
  41
  42 /* OBSOLETE: use transaction code instead! */
  43
  44 Id *
  45 solver_create_decisions_obsoletesmap(Solver *solv)
  46 {
  47   Pool *pool = solv->pool;
  48   Repo *installed = solv->installed;
  49   Id p, *obsoletesmap = NULL;
  50   int i;
  51   Solvable *s;
  52
  53   obsoletesmap = (Id *)sat_calloc(pool->nsolvables, sizeof(Id));
  54   if (installed)
  55     {
  56       for (i = 0; i < solv->decisionq.count; i++)
  57         {
  58           Id pp, n;
  59           int noobs;
  60
  61           n = solv->decisionq.elements[i];
  62           if (n < 0)
  63             continue;
  64           if (n == SYSTEMSOLVABLE)
  65             continue;
  66           s = pool->solvables + n;
  67           if (s->repo == installed)             /* obsoletes don't count for already installed packages */
  68             continue;
  69           noobs = solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n);
  70           FOR_PROVIDES(p, pp, s->name)
  71             {
  72               Solvable *ps = pool->solvables + p;
  73               if (noobs && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
  74                 continue;
  75               if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
  76                 continue;
  77               if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
  78                 continue;
  79               if (ps->repo == installed && !obsoletesmap[p])
  80                 {
  81                   obsoletesmap[p] = n;
  82                   obsoletesmap[n]++;
  83                 }
  84             }
  85         }
  86       for (i = 0; i < solv->decisionq.count; i++)
  87         {
  88           Id obs, *obsp;
  89           Id pp, n;
  90
  91           n = solv->decisionq.elements[i];
  92           if (n < 0)
  93             continue;
  94           if (n == SYSTEMSOLVABLE)
  95             continue;
  96           s = pool->solvables + n;
  97           if (s->repo == installed)             /* obsoletes don't count for already installed packages */
  98             continue;
  99           if (!s->obsoletes)
 100             continue;
 101           if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n))
 102             continue;
 103           obsp = s->repo->idarraydata + s->obsoletes;
 104           while ((obs = *obsp++) != 0)
 105             {
 106               FOR_PROVIDES(p, pp, obs)
 107                 {
 108                   Solvable *ps = pool->solvables + p;
 109                   if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
 110                     continue;
 111                   if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
 112                     continue;
 113                   if (pool->solvables[p].repo == installed && !obsoletesmap[p])
 114                     {
 115                       obsoletesmap[p] = n;
 116                       obsoletesmap[n]++;
 117                     }
 118                 }
 119             }
 120         }
 121     }
 122   return obsoletesmap;
 123 }
 124
 125 void
 126 solver_printruleelement(Solver *solv, int type, Rule *r, Id v)
 127 {
 128   Pool *pool = solv->pool;
 129   Solvable *s;
 130   if (v < 0)
 131     {
 132       s = pool->solvables + -v;
 133       POOL_DEBUG(type, "    !%s [%d]", pool_solvable2str(pool, s), -v);
 134     }
 135   else
 136     {
 137       s = pool->solvables + v;
 138       POOL_DEBUG(type, "    %s [%d]", pool_solvable2str(pool, s), v);
 139     }
 140   if (pool->installed && s->repo == pool->installed)
 141     POOL_DEBUG(type, "I");
 142   if (r)
 143     {
 144       if (r->w1 == v)
 145         POOL_DEBUG(type, " (w1)");
 146       if (r->w2 == v)
 147         POOL_DEBUG(type, " (w2)");
 148     }
 149   if (solv->decisionmap[s - pool->solvables] > 0)
 150     POOL_DEBUG(type, " Install.level%d", solv->decisionmap[s - pool->solvables]);
 151   if (solv->decisionmap[s - pool->solvables] < 0)
 152     POOL_DEBUG(type, " Conflict.level%d", -solv->decisionmap[s - pool->solvables]);
 153   POOL_DEBUG(type, "\n");
 154 }
 155
 156
 157 /*
 158  * print rule
 159  */
 160
 161 void
 162 solver_printrule(Solver *solv, int type, Rule *r)
 163 {
 164   Pool *pool = solv->pool;
 165   int i;
 166   Id d, v;
 167
 168   if (r >= solv->rules && r < solv->rules + solv->nrules)   /* r is a solver rule */
 169     POOL_DEBUG(type, "Rule #%d:", (int)(r - solv->rules));
 170   else
 171     POOL_DEBUG(type, "Rule:");                 /* r is any rule */
 172   if (r && r->d < 0)
 173     POOL_DEBUG(type, " (disabled)");
 174   POOL_DEBUG(type, "\n");
 175   d = r->d < 0 ? -r->d - 1 : r->d;
 176   for (i = 0; ; i++)
 177     {
 178       if (i == 0)
 179           /* print direct literal */
 180         v = r->p;
 181       else if (!d)
 182         {
 183           if (i == 2)
 184             break;
 185           /* binary rule --> print w2 as second literal */
 186           v = r->w2;
 187         }
 188       else
 189           /* every other which is in d */
 190         v = solv->pool->whatprovidesdata[d + i - 1];
 191       if (v == ID_NULL)
 192         break;
 193       solver_printruleelement(solv, type, r, v);
 194     }
 195   POOL_DEBUG(type, "    next rules: %d %d\n", r->n1, r->n2);
 196 }
 197
 198 void
 199 solver_printruleclass(Solver *solv, int type, Rule *r)
 200 {
 201   Pool *pool = solv->pool;
 202   Id p = r - solv->rules;
 203   assert(p >= 0);
 204   if (p < solv->learntrules)
 205     if (MAPTST(&solv->weakrulemap, p))
 206       POOL_DEBUG(type, "WEAK ");
 207   if (solv->learntrules && p >= solv->learntrules)
 208     POOL_DEBUG(type, "LEARNT ");
 209   else if (p >= solv->choicerules && p < solv->choicerules_end)
 210     POOL_DEBUG(type, "CHOICE ");
 211   else if (p >= solv->infarchrules && p < solv->infarchrules_end)
 212     POOL_DEBUG(type, "INFARCH ");
 213   else if (p >= solv->duprules && p < solv->duprules_end)
 214     POOL_DEBUG(type, "DUP ");
 215   else if (p >= solv->jobrules && p < solv->jobrules_end)
 216     POOL_DEBUG(type, "JOB ");
 217   else if (p >= solv->updaterules && p < solv->updaterules_end)
 218     POOL_DEBUG(type, "UPDATE ");
 219   else if (p >= solv->featurerules && p < solv->featurerules_end)
 220     POOL_DEBUG(type, "FEATURE ");
 221   solver_printrule(solv, type, r);
 222 }
 223
 224 void
 225 solver_printproblem(Solver *solv, Id v)
 226 {
 227   Pool *pool = solv->pool;
 228   int i;
 229   Rule *r;
 230   Id *jp;
 231
 232   if (v > 0)
 233     solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, solv->rules + v);
 234   else
 235     {
 236       v = -(v + 1);
 237       POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "JOB %d\n", v);
 238       jp = solv->ruletojob.elements;
 239       for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
 240         if (*jp == v)
 241           {
 242             POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "- ");
 243             solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
 244           }
 245       POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "ENDJOB\n");
 246     }
 247 }
 248
 249 void
 250 solver_printwatches(Solver *solv, int type)
 251 {
 252   Pool *pool = solv->pool;
 253   int counter;
 254
 255   POOL_DEBUG(type, "Watches: \n");
 256   for (counter = -(pool->nsolvables - 1); counter < pool->nsolvables; counter++)
 257     POOL_DEBUG(type, "    solvable [%d] -- rule [%d]\n", counter, solv->watches[counter + pool->nsolvables]);
 258 }
 259
 260 void
 261 solver_printdecisionq(Solver *solv, int type)
 262 {
 263   Pool *pool = solv->pool;
 264   int i;
 265   Id p, why;
 266
 267   POOL_DEBUG(type, "Decisions:\n");
 268   for (i = 0; i < solv->decisionq.count; i++)
 269     {
 270       p = solv->decisionq.elements[i];
 271       if (p > 0)
 272         POOL_DEBUG(type, "%d %d install  %s, ", i, solv->decisionmap[p], pool_solvid2str(pool, p));
 273       else
 274         POOL_DEBUG(type, "%d %d conflict %s, ", i, -solv->decisionmap[-p], pool_solvid2str(pool, -p));
 275       why = solv->decisionq_why.elements[i];
 276       if (why > 0)
 277         {
 278           POOL_DEBUG(type, "forced by ");
 279           solver_printruleclass(solv, type, solv->rules + why);
 280         }
 281       else if (why < 0)
 282         {
 283           POOL_DEBUG(type, "chosen from ");
 284           solver_printruleclass(solv, type, solv->rules - why);
 285         }
 286       else
 287         POOL_DEBUG(type, "picked for some unknown reason.\n");
 288     }
 289 }
 290
 291 /*
 292  * printdecisions
 293  */
 294
 295 void
 296 solver_printdecisions(Solver *solv)
 297 {
 298   Pool *pool = solv->pool;
 299   Repo *installed = solv->installed;
 300   Transaction *trans = solver_create_transaction(solv);
 301   Id p, type;
 302   int i, j;
 303   Solvable *s;
 304   Queue iq;
 305
 306   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 307   POOL_DEBUG(SAT_DEBUG_RESULT, "transaction:\n");
 308
 309   queue_init(&iq);
 310   for (i = 0; i < trans->steps.count; i++)
 311     {
 312       p = trans->steps.elements[i];
 313       s = pool->solvables + p;
 314       type = transaction_type(trans, p, SOLVER_TRANSACTION_SHOW_ACTIVE|SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES|SOLVER_TRANSACTION_SHOW_MULTIINSTALL);
 315       switch(type)
 316         {
 317         case SOLVER_TRANSACTION_MULTIINSTALL:
 318           POOL_DEBUG(SAT_DEBUG_RESULT, "  multi install %s", pool_solvable2str(pool, s));
 319           break;
 320         case SOLVER_TRANSACTION_MULTIREINSTALL:
 321           POOL_DEBUG(SAT_DEBUG_RESULT, "  multi reinstall %s", pool_solvable2str(pool, s));
 322           break;
 323         case SOLVER_TRANSACTION_INSTALL:
 324           POOL_DEBUG(SAT_DEBUG_RESULT, "  install   %s", pool_solvable2str(pool, s));
 325           break;
 326         case SOLVER_TRANSACTION_REINSTALL:
 327           POOL_DEBUG(SAT_DEBUG_RESULT, "  reinstall %s", pool_solvable2str(pool, s));
 328           break;
 329         case SOLVER_TRANSACTION_DOWNGRADE:
 330           POOL_DEBUG(SAT_DEBUG_RESULT, "  downgrade %s", pool_solvable2str(pool, s));
 331           break;
 332         case SOLVER_TRANSACTION_CHANGE:
 333           POOL_DEBUG(SAT_DEBUG_RESULT, "  change    %s", pool_solvable2str(pool, s));
 334           break;
 335         case SOLVER_TRANSACTION_UPGRADE:
 336         case SOLVER_TRANSACTION_OBSOLETES:
 337           POOL_DEBUG(SAT_DEBUG_RESULT, "  upgrade   %s", pool_solvable2str(pool, s));
 338           break;
 339         case SOLVER_TRANSACTION_ERASE:
 340           POOL_DEBUG(SAT_DEBUG_RESULT, "  erase     %s", pool_solvable2str(pool, s));
 341           break;
 342         default:
 343           break;
 344         }
 345       switch(type)
 346         {
 347         case SOLVER_TRANSACTION_INSTALL:
 348         case SOLVER_TRANSACTION_ERASE:
 349         case SOLVER_TRANSACTION_MULTIINSTALL:
 350         case SOLVER_TRANSACTION_MULTIREINSTALL:
 351           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 352           break;
 353         case SOLVER_TRANSACTION_REINSTALL:
 354         case SOLVER_TRANSACTION_DOWNGRADE:
 355         case SOLVER_TRANSACTION_CHANGE:
 356         case SOLVER_TRANSACTION_UPGRADE:
 357         case SOLVER_TRANSACTION_OBSOLETES:
 358           transaction_all_obs_pkgs(trans, p, &iq);
 359           if (iq.count)
 360             {
 361               POOL_DEBUG(SAT_DEBUG_RESULT, "  (obsoletes");
 362               for (j = 0; j < iq.count; j++)
 363                 POOL_DEBUG(SAT_DEBUG_RESULT, " %s", pool_solvid2str(pool, iq.elements[j]));
 364               POOL_DEBUG(SAT_DEBUG_RESULT, ")");
 365             }
 366           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 367           break;
 368         default:
 369           break;
 370         }
 371     }
 372   queue_free(&iq);
 373
 374   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 375
 376   if (solv->recommendations.count)
 377     {
 378       POOL_DEBUG(SAT_DEBUG_RESULT, "recommended packages:\n");
 379       for (i = 0; i < solv->recommendations.count; i++)
 380         {
 381           s = pool->solvables + solv->recommendations.elements[i];
 382           if (solv->decisionmap[solv->recommendations.elements[i]] > 0)
 383             {
 384               if (installed && s->repo == installed)
 385                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (installed)\n", pool_solvable2str(pool, s));
 386               else
 387                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (selected)\n", pool_solvable2str(pool, s));
 388             }
 389           else
 390             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s\n", pool_solvable2str(pool, s));
 391         }
 392       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 393     }
 394
 395   if (solv->suggestions.count)
 396     {
 397       POOL_DEBUG(SAT_DEBUG_RESULT, "suggested packages:\n");
 398       for (i = 0; i < solv->suggestions.count; i++)
 399         {
 400           s = pool->solvables + solv->suggestions.elements[i];
 401           if (solv->decisionmap[solv->suggestions.elements[i]] > 0)
 402             {
 403               if (installed && s->repo == installed)
 404                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (installed)\n", pool_solvable2str(pool, s));
 405               else
 406                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (selected)\n", pool_solvable2str(pool, s));
 407             }
 408           else
 409             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s\n", pool_solvable2str(pool, s));
 410         }
 411       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 412     }
 413   if (solv->orphaned.count)
 414     {
 415       POOL_DEBUG(SAT_DEBUG_RESULT, "orphaned packages:\n");
 416       for (i = 0; i < solv->orphaned.count; i++)
 417         {
 418           s = pool->solvables + solv->orphaned.elements[i];
 419           if (solv->decisionmap[solv->orphaned.elements[i]] > 0)
 420             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (kept)\n", pool_solvable2str(pool, s));
 421           else
 422             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (erased)\n", pool_solvable2str(pool, s));
 423         }
 424       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 425     }
 426   transaction_free(trans);
 427 }
 428
 429 static inline
 430 const char *id2strnone(Pool *pool, Id id)
 431 {
 432   return !id || id == 1 ? "(none)" : pool_id2str(pool, id);
 433 }
 434
 435 void
 436 transaction_print(Transaction *trans)
 437 {
 438   Pool *pool = trans->pool;
 439   Queue classes, pkgs;
 440   int i, j, mode, l, linel;
 441   char line[76];
 442   const char *n;
 443
 444   queue_init(&classes);
 445   queue_init(&pkgs);
 446   mode = 0;
 447   transaction_classify(trans, mode, &classes);
 448   for (i = 0; i < classes.count; i += 4)
 449     {
 450       Id class = classes.elements[i];
 451       Id cnt = classes.elements[i + 1];
 452       switch(class)
 453         {
 454         case SOLVER_TRANSACTION_ERASE:
 455           POOL_DEBUG(SAT_DEBUG_RESULT, "%d erased packages:\n", cnt);
 456           break;
 457         case SOLVER_TRANSACTION_INSTALL:
 458           POOL_DEBUG(SAT_DEBUG_RESULT, "%d installed packages:\n", cnt);
 459           break;
 460         case SOLVER_TRANSACTION_REINSTALLED:
 461           POOL_DEBUG(SAT_DEBUG_RESULT, "%d reinstalled packages:\n", cnt);
 462           break;
 463         case SOLVER_TRANSACTION_DOWNGRADED:
 464           POOL_DEBUG(SAT_DEBUG_RESULT, "%d downgraded packages:\n", cnt);
 465           break;
 466         case SOLVER_TRANSACTION_CHANGED:
 467           POOL_DEBUG(SAT_DEBUG_RESULT, "%d changed packages:\n", cnt);
 468           break;
 469         case SOLVER_TRANSACTION_UPGRADED:
 470           POOL_DEBUG(SAT_DEBUG_RESULT, "%d upgraded packages:\n", cnt);
 471           break;
 472         case SOLVER_TRANSACTION_VENDORCHANGE:
 473           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]));
 474           break;
 475         case SOLVER_TRANSACTION_ARCHCHANGE:
 476           POOL_DEBUG(SAT_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]));
 477           break;
 478         default:
 479           class = SOLVER_TRANSACTION_IGNORE;
 480           break;
 481         }
 482       if (class == SOLVER_TRANSACTION_IGNORE)
 483         continue;
 484       transaction_classify_pkgs(trans, mode, class, classes.elements[i + 2], classes.elements[i + 3], &pkgs);
 485       *line = 0;
 486       linel = 0;
 487       for (j = 0; j < pkgs.count; j++)
 488         {
 489           Id p = pkgs.elements[j];
 490           Solvable *s = pool->solvables + p;
 491           Solvable *s2;
 492
 493           switch(class)
 494             {
 495             case SOLVER_TRANSACTION_DOWNGRADED:
 496             case SOLVER_TRANSACTION_UPGRADED:
 497               s2 = pool->solvables + transaction_obs_pkg(trans, p);
 498               POOL_DEBUG(SAT_DEBUG_RESULT, "  - %s -> %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, s2));
 499               break;
 500             case SOLVER_TRANSACTION_VENDORCHANGE:
 501             case SOLVER_TRANSACTION_ARCHCHANGE:
 502               n = pool_id2str(pool, s->name);
 503               l = strlen(n);
 504               if (l + linel > sizeof(line) - 3)
 505                 {
 506                   if (*line)
 507                     POOL_DEBUG(SAT_DEBUG_RESULT, "    %s\n", line);
 508                   *line = 0;
 509                   linel = 0;
 510                 }
 511               if (l + linel > sizeof(line) - 3)
 512                 POOL_DEBUG(SAT_DEBUG_RESULT, "    %s\n", n);
 513               else
 514                 {
 515                   if (*line)
 516                     {
 517                       strcpy(line + linel, ", ");
 518                       linel += 2;
 519                     }
 520                   strcpy(line + linel, n);
 521                   linel += l;
 522                 }
 523               break;
 524             default:
 525               POOL_DEBUG(SAT_DEBUG_RESULT, "  - %s\n", pool_solvable2str(pool, s));
 526               break;
 527             }
 528         }
 529       if (*line)
 530         POOL_DEBUG(SAT_DEBUG_RESULT, "    %s\n", line);
 531       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 532     }
 533   queue_free(&classes);
 534   queue_free(&pkgs);
 535 }
 536
 537 void
 538 solver_printproblemruleinfo(Solver *solv, Id probr)
 539 {
 540   Pool *pool = solv->pool;
 541   Id dep, source, target;
 542
 543   switch (solver_ruleinfo(solv, probr, &source, &target, &dep))
 544     {
 545     case SOLVER_RULE_DISTUPGRADE:
 546       POOL_DEBUG(SAT_DEBUG_RESULT, "%s does not belong to a distupgrade repository\n", pool_solvid2str(pool, source));
 547       return;
 548     case SOLVER_RULE_INFARCH:
 549       POOL_DEBUG(SAT_DEBUG_RESULT, "%s has inferior architecture\n", pool_solvid2str(pool, source));
 550       return;
 551     case SOLVER_RULE_UPDATE:
 552       POOL_DEBUG(SAT_DEBUG_RESULT, "problem with installed package %s\n", pool_solvid2str(pool, source));
 553       return;
 554     case SOLVER_RULE_JOB:
 555       POOL_DEBUG(SAT_DEBUG_RESULT, "conflicting requests\n");
 556       return;
 557     case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
 558       POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides requested %s\n", pool_dep2str(pool, dep));
 559       return;
 560     case SOLVER_RULE_RPM:
 561       POOL_DEBUG(SAT_DEBUG_RESULT, "some dependency problem\n");
 562       return;
 563     case SOLVER_RULE_RPM_NOT_INSTALLABLE:
 564       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s is not installable\n", pool_solvid2str(pool, source));
 565       return;
 566     case SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP:
 567       POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides %s needed by %s\n", pool_dep2str(pool, dep), pool_solvid2str(pool, source));
 568       return;
 569     case SOLVER_RULE_RPM_SAME_NAME:
 570       POOL_DEBUG(SAT_DEBUG_RESULT, "cannot install both %s and %s\n", pool_solvid2str(pool, source), pool_solvid2str(pool, target));
 571       return;
 572     case SOLVER_RULE_RPM_PACKAGE_CONFLICT:
 573       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by %s\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep), pool_solvid2str(pool, target));
 574       return;
 575     case SOLVER_RULE_RPM_PACKAGE_OBSOLETES:
 576       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s obsoletes %s provided by %s\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep), pool_solvid2str(pool, target));
 577       return;
 578     case SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES:
 579       POOL_DEBUG(SAT_DEBUG_RESULT, "installed package %s obsoletes %s provided by %s\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep), pool_solvid2str(pool, target));
 580       return;
 581     case SOLVER_RULE_RPM_IMPLICIT_OBSOLETES:
 582       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s implicitely obsoletes %s provided by %s\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep), pool_solvid2str(pool, target));
 583       return;
 584     case SOLVER_RULE_RPM_PACKAGE_REQUIRES:
 585       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s requires %s, but none of the providers can be installed\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep));
 586       return;
 587     case SOLVER_RULE_RPM_SELF_CONFLICT:
 588       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by itself\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep));
 589       return;
 590     case SOLVER_RULE_UNKNOWN:
 591     case SOLVER_RULE_FEATURE:
 592     case SOLVER_RULE_LEARNT:
 593     case SOLVER_RULE_CHOICE:
 594       POOL_DEBUG(SAT_DEBUG_RESULT, "bad rule type\n");
 595       return;
 596     }
 597 }
 598
 599 void
 600 solver_printprobleminfo(Solver *solv, Id problem)
 601 {
 602   solver_printproblemruleinfo(solv, solver_findproblemrule(solv, problem));
 603 }
 604
 605 void
 606 solver_printcompleteprobleminfo(Solver *solv, Id problem)
 607 {
 608   Queue q;
 609   Id probr;
 610   int i, nobad = 0;
 611
 612   queue_init(&q);
 613   solver_findallproblemrules(solv, problem, &q);
 614   for (i = 0; i < q.count; i++)
 615     {
 616       probr = q.elements[i];
 617       if (!(probr >= solv->updaterules && probr < solv->updaterules_end) && !(probr >= solv->jobrules && probr < solv->jobrules_end))
 618         {
 619           nobad = 1;
 620           break;
 621         }
 622     }
 623   for (i = 0; i < q.count; i++)
 624     {
 625       probr = q.elements[i];
 626       if (nobad && ((probr >= solv->updaterules && probr < solv->updaterules_end) || (probr >= solv->jobrules && probr < solv->jobrules_end)))
 627         continue;
 628       solver_printproblemruleinfo(solv, probr);
 629     }
 630   queue_free(&q);
 631 }
 632
 633 void
 634 solver_printsolution(Solver *solv, Id problem, Id solution)
 635 {
 636   Pool *pool = solv->pool;
 637   Id p, rp, element, how, what, select;
 638   Solvable *s, *sd;
 639
 640   element = 0;
 641   while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0)
 642     {
 643       if (p == SOLVER_SOLUTION_JOB)
 644         {
 645           /* job, rp is index into job queue */
 646           how = solv->job.elements[rp - 1];
 647           what = solv->job.elements[rp];
 648           select = how & SOLVER_SELECTMASK;
 649           switch (how & SOLVER_JOBMASK)
 650             {
 651             case SOLVER_INSTALL:
 652               if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
 653                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not keep %s installed\n", pool_solvid2str(pool, what));
 654               else if (select == SOLVER_SOLVABLE_PROVIDES)
 655                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not install a solvable %s\n", solver_select2str(pool, select, what));
 656               else
 657                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not install %s\n", solver_select2str(pool, select, what));
 658               break;
 659             case SOLVER_ERASE:
 660               if (select == SOLVER_SOLVABLE && !(solv->installed && pool->solvables[what].repo == solv->installed))
 661                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not forbid installation of %s\n", pool_solvid2str(pool, what));
 662               else if (select == SOLVER_SOLVABLE_PROVIDES)
 663                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not deinstall all solvables %s\n", solver_select2str(pool, select, what));
 664               else
 665                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not deinstall %s\n", solver_select2str(pool, select, what));
 666               break;
 667             case SOLVER_UPDATE:
 668               POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not install most recent version of %s\n", solver_select2str(pool, select, what));
 669               break;
 670             case SOLVER_LOCK:
 671               POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not lock %s\n", solver_select2str(pool, select, what));
 672               break;
 673             default:
 674               POOL_DEBUG(SAT_DEBUG_RESULT, "  - do something different\n");
 675               break;
 676             }
 677         }
 678       else if (p == SOLVER_SOLUTION_INFARCH)
 679         {
 680           s = pool->solvables + rp;
 681           if (solv->installed && s->repo == solv->installed)
 682             POOL_DEBUG(SAT_DEBUG_RESULT, "  - keep %s despite the inferior architecture\n", pool_solvable2str(pool, s));
 683           else
 684             POOL_DEBUG(SAT_DEBUG_RESULT, "  - install %s despite the inferior architecture\n", pool_solvable2str(pool, s));
 685         }
 686       else if (p == SOLVER_SOLUTION_DISTUPGRADE)
 687         {
 688           s = pool->solvables + rp;
 689           if (solv->installed && s->repo == solv->installed)
 690             POOL_DEBUG(SAT_DEBUG_RESULT, "  - keep obsolete %s\n", pool_solvable2str(pool, s));
 691           else
 692             POOL_DEBUG(SAT_DEBUG_RESULT, "  - install %s from excluded repository\n", pool_solvable2str(pool, s));
 693         }
 694       else
 695         {
 696           /* policy, replace p with rp */
 697           s = pool->solvables + p;
 698           sd = rp ? pool->solvables + rp : 0;
 699           if (sd)
 700             {
 701               int illegal = policy_is_illegal(solv, s, sd, 0);
 702               if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
 703                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow downgrade of %s to %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
 704               if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
 705                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow architecture change of %s to %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
 706               if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
 707                 {
 708                   if (sd->vendor)
 709                     POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow vendor change from '%s' (%s) to '%s' (%s)\n", pool_id2str(pool, s->vendor), pool_solvable2str(pool, s), pool_id2str(pool, sd->vendor), pool_solvable2str(pool, sd));
 710                   else
 711                     POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow vendor change from '%s' (%s) to no vendor (%s)\n", pool_id2str(pool, s->vendor), pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
 712                 }
 713               if (!illegal)
 714                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow replacement of %s with %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
 715             }
 716           else
 717             {
 718               POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow deinstallation of %s\n", pool_solvable2str(pool, s));
 719             }
 720         }
 721     }
 722 }
 723
 724 void
 725 solver_printallsolutions(Solver *solv)
 726 {
 727   Pool *pool = solv->pool;
 728   int pcnt;
 729   Id problem, solution;
 730
 731   POOL_DEBUG(SAT_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n");
 732   pcnt = 0;
 733   problem = 0;
 734   while ((problem = solver_next_problem(solv, problem)) != 0)
 735     {
 736       pcnt++;
 737       POOL_DEBUG(SAT_DEBUG_RESULT, "Problem %d:\n", pcnt);
 738       POOL_DEBUG(SAT_DEBUG_RESULT, "====================================\n");
 739 #if 1
 740       solver_printprobleminfo(solv, problem);
 741 #else
 742       solver_printcompleteprobleminfo(solv, problem);
 743 #endif
 744       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 745       solution = 0;
 746       while ((solution = solver_next_solution(solv, problem, solution)) != 0)
 747         {
 748           solver_printsolution(solv, problem, solution);
 749           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 750         }
 751     }
 752 }
 753
 754 void
 755 solver_printtrivial(Solver *solv)
 756 {
 757   Pool *pool = solv->pool;
 758   Queue in, out;
 759   Id p;
 760   const char *n;
 761   Solvable *s;
 762   int i;
 763
 764   queue_init(&in);
 765   for (p = 1, s = pool->solvables + p; p < solv->pool->nsolvables; p++, s++)
 766     {
 767       n = pool_id2str(pool, s->name);
 768       if (strncmp(n, "patch:", 6) != 0 && strncmp(n, "pattern:", 8) != 0)
 769         continue;
 770       queue_push(&in, p);
 771     }
 772   if (!in.count)
 773     {
 774       queue_free(&in);
 775       return;
 776     }
 777   queue_init(&out);
 778   solver_trivial_installable(solv, &in, &out);
 779   POOL_DEBUG(SAT_DEBUG_RESULT, "trivial installable status:\n");
 780   for (i = 0; i < in.count; i++)
 781     POOL_DEBUG(SAT_DEBUG_RESULT, "  %s: %d\n", pool_solvid2str(pool, in.elements[i]), out.elements[i]);
 782   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 783   queue_free(&in);
 784   queue_free(&out);
 785 }
 786
 787 const char *
 788 solver_select2str(Pool *pool, Id select, Id what)
 789 {
 790   const char *s;
 791   char *b;
 792   if (select == SOLVER_SOLVABLE)
 793     return pool_solvid2str(pool, what);
 794   if (select == SOLVER_SOLVABLE_NAME)
 795     return pool_dep2str(pool, what);
 796   if (select == SOLVER_SOLVABLE_PROVIDES)
 797     {
 798       s = pool_dep2str(pool, what);
 799       b = pool_alloctmpspace(pool, 11 + strlen(s));
 800       sprintf(b, "providing %s", s);
 801       return b;
 802     }
 803   if (select == SOLVER_SOLVABLE_ONE_OF)
 804     {
 805       Id p;
 806       b = 0;
 807       while ((p = pool->whatprovidesdata[what++]) != 0)
 808         {
 809           s = pool_solvid2str(pool, p);
 810           if (b)
 811             b = pool_tmpappend(pool, b, ", ", s);
 812           else
 813             b = pool_tmpjoin(pool, s, 0, 0);
 814           pool_freetmpspace(pool, s);
 815         }
 816       return b ? b : "nothing";
 817     }
 818   if (select == SOLVER_SOLVABLE_REPO)
 819     {
 820       b = pool_alloctmpspace(pool, 20);
 821       sprintf(b, "repo #%d", what);
 822       return b;
 823     }
 824   if (select == SOLVER_SOLVABLE_ALL)
 825     return "all packages";
 826   return "unknown job select";
 827 }
 828
 829 const char *
 830 pool_job2str(Pool *pool, Id how, Id what, Id flagmask)
 831 {
 832   Id select = how & SOLVER_SELECTMASK;
 833   const char *strstart = 0, *strend = 0;
 834   char *s;
 835   int o;
 836
 837   switch (how & SOLVER_JOBMASK)
 838     {
 839     case SOLVER_NOOP:
 840       return "do nothing";
 841     case SOLVER_INSTALL:
 842       if (select == SOLVER_SOLVABLE && pool->installed && pool->solvables[what].repo == pool->installed)
 843         strstart = "keep ", strend = "installed";
 844       else if (select == SOLVER_SOLVABLE || select == SOLVER_SOLVABLE_NAME)
 845         strstart = "install ";
 846       else if (select == SOLVER_SOLVABLE_PROVIDES)
 847         strstart = "install a package ";
 848       else
 849         strstart = "install one of ";
 850       break;
 851     case SOLVER_ERASE:
 852       if (select == SOLVER_SOLVABLE && !(pool->installed && pool->solvables[what].repo == pool->installed))
 853         strstart = "keep ", strend = "unstalled";
 854       else if (select == SOLVER_SOLVABLE_PROVIDES)
 855         strstart = "deinstall all packages ";
 856       else
 857         strstart = "deinstall ";
 858       break;
 859     case SOLVER_UPDATE:
 860       strstart = "update ";
 861       break;
 862     case SOLVER_WEAKENDEPS:
 863       strstart = "weaken deps of ";
 864       break;
 865     case SOLVER_NOOBSOLETES:
 866       strstart = "multi version ";
 867       break;
 868     case SOLVER_LOCK:
 869       strstart = "update ";
 870       break;
 871     case SOLVER_DISTUPGRADE:
 872       strstart = "dist upgrade ";
 873       break;
 874     case SOLVER_VERIFY:
 875       strstart = "verify ";
 876       break;
 877     case SOLVER_DROP_ORPHANED:
 878       strstart = "deinstall ", strend = "if orphaned";
 879       break;
 880     case SOLVER_USERINSTALLED:
 881       strstart = "regard ", strend = "as userinstalled";
 882       break;
 883     default:
 884       strstart = "unknown job ";
 885       break;
 886     }
 887   s = pool_tmpjoin(pool, strstart, solver_select2str(pool, select, what), strend);
 888   if ((how & flagmask & ~(SOLVER_SELECTMASK|SOLVER_JOBMASK)) == 0)
 889     return s;
 890   o = strlen(s);
 891   s = pool_tmpappend(pool, s, " ", 0);
 892   if (how & SOLVER_WEAK)
 893     s = pool_tmpappend(pool, s, ",weak", 0);
 894   if (how & SOLVER_ESSENTIAL)
 895     s = pool_tmpappend(pool, s, ",essential", 0);
 896   if (how & SOLVER_CLEANDEPS)
 897     s = pool_tmpappend(pool, s, ",cleandeps", 0);
 898   if (how & SOLVER_SETEV)
 899     s = pool_tmpappend(pool, s, ",setev", 0);
 900   if (how & SOLVER_SETEVR)
 901     s = pool_tmpappend(pool, s, ",setevr", 0);
 902   if (how & SOLVER_SETARCH)
 903     s = pool_tmpappend(pool, s, ",setarch", 0);
 904   if (how & SOLVER_SETVENDOR)
 905     s = pool_tmpappend(pool, s, ",setvendor", 0);
 906   if (how & SOLVER_SETREPO)
 907     s = pool_tmpappend(pool, s, ",setrepo", 0);
 908   if (how & SOLVER_NOAUTOSET)
 909     s = pool_tmpappend(pool, s, ",noautoset", 0);
 910   if (s[o + 1] != ',')
 911     s = pool_tmpappend(pool, s, ",?", 0);
 912   s[o + 1] = '[';
 913   return pool_tmpappend(pool, s, "]", 0);
 914 }
 915
 916 const char *
 917 solver_problemruleinfo2str(Solver *solv, SolverRuleinfo type, Id source, Id target, Id dep)
 918 {
 919   Pool *pool = solv->pool;
 920   char *s;
 921   switch (type)
 922     {
 923     case SOLVER_RULE_DISTUPGRADE:
 924       return pool_tmpjoin(pool, pool_solvid2str(pool, source), " does not belong to a distupgrade repository", 0);
 925     case SOLVER_RULE_INFARCH:
 926       return pool_tmpjoin(pool, pool_solvid2str(pool, source), " has inferior architecture", 0);
 927     case SOLVER_RULE_UPDATE:
 928       return pool_tmpjoin(pool, "problem with installed package ", pool_solvid2str(pool, source), 0);
 929     case SOLVER_RULE_JOB:
 930       return "conflicting requests";
 931     case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
 932       return pool_tmpjoin(pool, "nothing provides requested ", pool_dep2str(pool, dep), 0);
 933     case SOLVER_RULE_RPM:
 934       return "some dependency problem";
 935     case SOLVER_RULE_RPM_NOT_INSTALLABLE:
 936       return pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " is not installable");
 937     case SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP:
 938       s = pool_tmpjoin(pool, "nothing provides ", pool_dep2str(pool, dep), 0);
 939       return pool_tmpappend(pool, s, " needed by ", pool_solvid2str(pool, source));
 940     case SOLVER_RULE_RPM_SAME_NAME:
 941       s = pool_tmpjoin(pool, "cannot install both ", pool_solvid2str(pool, source), 0);
 942       return pool_tmpappend(pool, s, " and ", pool_solvid2str(pool, target));
 943     case SOLVER_RULE_RPM_PACKAGE_CONFLICT:
 944       s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
 945       s = pool_tmpappend(pool, s, " conflicts with ", pool_dep2str(pool, dep));
 946       return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
 947     case SOLVER_RULE_RPM_PACKAGE_OBSOLETES:
 948       s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
 949       s = pool_tmpappend(pool, s, " obsoletes ", pool_dep2str(pool, dep));
 950       return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
 951     case SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES:
 952       s = pool_tmpjoin(pool, "installed package ", pool_solvid2str(pool, source), 0);
 953       s = pool_tmpappend(pool, s, " obsoletes ", pool_dep2str(pool, dep));
 954       return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
 955     case SOLVER_RULE_RPM_IMPLICIT_OBSOLETES:
 956       s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
 957       s = pool_tmpappend(pool, s, " implicitely obsoletes ", pool_dep2str(pool, dep));
 958       return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
 959     case SOLVER_RULE_RPM_PACKAGE_REQUIRES:
 960       s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " requires ");
 961       return pool_tmpappend(pool, s, pool_dep2str(pool, dep), ", but none of the providers can be installed");
 962     case SOLVER_RULE_RPM_SELF_CONFLICT:
 963       s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " conflicts with ");
 964       return pool_tmpappend(pool, s, pool_dep2str(pool, dep), " provided by itself");
 965     default:
 966       return "bad problem rule type";
 967     }
 968 }
 969
 970 const char *
 971 solver_solutionelement2str(Solver *solv, Id p, Id rp)
 972 {
 973   Pool *pool = solv->pool;
 974   if (p == SOLVER_SOLUTION_JOB)
 975     {
 976       Id how = solv->job.elements[rp - 1];
 977       Id what = solv->job.elements[rp];
 978       return pool_tmpjoin(pool, "do not ask to ", pool_job2str(pool, how, what, 0), 0);
 979     }
 980   else if (p == SOLVER_SOLUTION_INFARCH)
 981     {
 982       Solvable *s = pool->solvables + rp;
 983       if (solv->installed && s->repo == solv->installed)
 984         return pool_tmpjoin(pool, "keep ", pool_solvable2str(pool, s), " despite the inferior architecture");
 985       else
 986         return pool_tmpjoin(pool, "install ", pool_solvable2str(pool, s), " despite the inferior architecture");
 987     }
 988   else if (p == SOLVER_SOLUTION_DISTUPGRADE)
 989     {
 990       Solvable *s = pool->solvables + rp;
 991       if (solv->installed && s->repo == solv->installed)
 992         return pool_tmpjoin(pool, "keep obsolete ", pool_solvable2str(pool, s), 0);
 993       else
 994         return pool_tmpjoin(pool, "install ", pool_solvable2str(pool, s), " from excluded repository");
 995     }
 996   else if (p > 0 && rp == 0)
 997     return pool_tmpjoin(pool, "allow deinstallation of ", pool_solvid2str(pool, p), 0);
 998   else if (p > 0 && rp > 0)
 999     {
1000       const char *sp = pool_solvid2str(pool, p);
1001       const char *srp = pool_solvid2str(pool, rp);
1002       const char *str = pool_tmpjoin(pool, "allow replacement of ", sp, 0);
1003       return pool_tmpappend(pool, str, " with ", srp);
1004     }
1005   else
1006     return "bad solution element";
1007 }
1008
1009 const char *
1010 policy_illegal2str(Solver *solv, int illegal, Solvable *s, Solvable *rs)
1011 {
1012   Pool *pool = solv->pool;
1013   const char *str;
1014   if (illegal == POLICY_ILLEGAL_DOWNGRADE)
1015     {
1016       str = pool_tmpjoin(pool, "downgrade of ", pool_solvable2str(pool, s), 0);
1017       return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1018     }
1019   if (illegal == POLICY_ILLEGAL_ARCHCHANGE)
1020     {
1021       str = pool_tmpjoin(pool, "architecture change of ", pool_solvable2str(pool, s), 0);
1022       return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1023     }
1024   if (illegal == POLICY_ILLEGAL_VENDORCHANGE)
1025     {
1026       str = pool_tmpjoin(pool, "vendor change from '", pool_id2str(pool, s->vendor), "' (");
1027       if (rs->vendor)
1028         {
1029           str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to '");
1030           str = pool_tmpappend(pool, str, pool_id2str(pool, rs->vendor), "' (");
1031         }
1032       else
1033         str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to no vendor (");
1034       return pool_tmpappend(pool, str, pool_solvable2str(pool, rs), ")");
1035     }
1036   return "unknown illegal change";
1037 }