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   Id p, type;
 301   int i, j;
 302   Solvable *s;
 303   Queue iq;
 304
 305   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 306   POOL_DEBUG(SAT_DEBUG_RESULT, "transaction:\n");
 307
 308   queue_init(&iq);
 309   for (i = 0; i < solv->trans.steps.count; i++)
 310     {
 311       p = solv->trans.steps.elements[i];
 312       s = pool->solvables + p;
 313       type = transaction_type(&solv->trans, p, SOLVER_TRANSACTION_SHOW_ACTIVE|SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES|SOLVER_TRANSACTION_SHOW_MULTIINSTALL);
 314       switch(type)
 315         {
 316         case SOLVER_TRANSACTION_MULTIINSTALL:
 317           POOL_DEBUG(SAT_DEBUG_RESULT, "  multi install %s", pool_solvable2str(pool, s));
 318           break;
 319         case SOLVER_TRANSACTION_MULTIREINSTALL:
 320           POOL_DEBUG(SAT_DEBUG_RESULT, "  multi reinstall %s", pool_solvable2str(pool, s));
 321           break;
 322         case SOLVER_TRANSACTION_INSTALL:
 323           POOL_DEBUG(SAT_DEBUG_RESULT, "  install   %s", pool_solvable2str(pool, s));
 324           break;
 325         case SOLVER_TRANSACTION_REINSTALL:
 326           POOL_DEBUG(SAT_DEBUG_RESULT, "  reinstall %s", pool_solvable2str(pool, s));
 327           break;
 328         case SOLVER_TRANSACTION_DOWNGRADE:
 329           POOL_DEBUG(SAT_DEBUG_RESULT, "  downgrade %s", pool_solvable2str(pool, s));
 330           break;
 331         case SOLVER_TRANSACTION_CHANGE:
 332           POOL_DEBUG(SAT_DEBUG_RESULT, "  change    %s", pool_solvable2str(pool, s));
 333           break;
 334         case SOLVER_TRANSACTION_UPGRADE:
 335         case SOLVER_TRANSACTION_OBSOLETES:
 336           POOL_DEBUG(SAT_DEBUG_RESULT, "  upgrade   %s", pool_solvable2str(pool, s));
 337           break;
 338         case SOLVER_TRANSACTION_ERASE:
 339           POOL_DEBUG(SAT_DEBUG_RESULT, "  erase     %s", pool_solvable2str(pool, s));
 340           break;
 341         default:
 342           break;
 343         }
 344       switch(type)
 345         {
 346         case SOLVER_TRANSACTION_INSTALL:
 347         case SOLVER_TRANSACTION_ERASE:
 348         case SOLVER_TRANSACTION_MULTIINSTALL:
 349         case SOLVER_TRANSACTION_MULTIREINSTALL:
 350           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 351           break;
 352         case SOLVER_TRANSACTION_REINSTALL:
 353         case SOLVER_TRANSACTION_DOWNGRADE:
 354         case SOLVER_TRANSACTION_CHANGE:
 355         case SOLVER_TRANSACTION_UPGRADE:
 356         case SOLVER_TRANSACTION_OBSOLETES:
 357           transaction_all_obs_pkgs(&solv->trans, p, &iq);
 358           if (iq.count)
 359             {
 360               POOL_DEBUG(SAT_DEBUG_RESULT, "  (obsoletes");
 361               for (j = 0; j < iq.count; j++)
 362                 POOL_DEBUG(SAT_DEBUG_RESULT, " %s", pool_solvid2str(pool, iq.elements[j]));
 363               POOL_DEBUG(SAT_DEBUG_RESULT, ")");
 364             }
 365           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 366           break;
 367         default:
 368           break;
 369         }
 370     }
 371   queue_free(&iq);
 372
 373   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 374
 375   if (solv->recommendations.count)
 376     {
 377       POOL_DEBUG(SAT_DEBUG_RESULT, "recommended packages:\n");
 378       for (i = 0; i < solv->recommendations.count; i++)
 379         {
 380           s = pool->solvables + solv->recommendations.elements[i];
 381           if (solv->decisionmap[solv->recommendations.elements[i]] > 0)
 382             {
 383               if (installed && s->repo == installed)
 384                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (installed)\n", pool_solvable2str(pool, s));
 385               else
 386                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (selected)\n", pool_solvable2str(pool, s));
 387             }
 388           else
 389             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s\n", pool_solvable2str(pool, s));
 390         }
 391       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 392     }
 393
 394   if (solv->suggestions.count)
 395     {
 396       POOL_DEBUG(SAT_DEBUG_RESULT, "suggested packages:\n");
 397       for (i = 0; i < solv->suggestions.count; i++)
 398         {
 399           s = pool->solvables + solv->suggestions.elements[i];
 400           if (solv->decisionmap[solv->suggestions.elements[i]] > 0)
 401             {
 402               if (installed && s->repo == installed)
 403                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (installed)\n", pool_solvable2str(pool, s));
 404               else
 405                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (selected)\n", pool_solvable2str(pool, s));
 406             }
 407           else
 408             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s\n", pool_solvable2str(pool, s));
 409         }
 410       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 411     }
 412   if (solv->orphaned.count)
 413     {
 414       POOL_DEBUG(SAT_DEBUG_RESULT, "orphaned packages:\n");
 415       for (i = 0; i < solv->orphaned.count; i++)
 416         {
 417           s = pool->solvables + solv->orphaned.elements[i];
 418           if (solv->decisionmap[solv->orphaned.elements[i]] > 0)
 419             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (kept)\n", pool_solvable2str(pool, s));
 420           else
 421             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (erased)\n", pool_solvable2str(pool, s));
 422         }
 423       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 424     }
 425 }
 426
 427 static inline
 428 const char *id2strnone(Pool *pool, Id id)
 429 {
 430   return !id || id == 1 ? "(none)" : pool_id2str(pool, id);
 431 }
 432
 433 void
 434 solver_printtransaction(Solver *solv)
 435 {
 436   Transaction *trans = &solv->trans;
 437   Pool *pool = trans->pool;
 438   Queue classes, pkgs;
 439   int i, j, mode, l, linel;
 440   char line[76];
 441   const char *n;
 442
 443   queue_init(&classes);
 444   queue_init(&pkgs);
 445   mode = 0;
 446   transaction_classify(trans, mode, &classes);
 447   for (i = 0; i < classes.count; i += 4)
 448     {
 449       Id class = classes.elements[i];
 450       Id cnt = classes.elements[i + 1];
 451       switch(class)
 452         {
 453         case SOLVER_TRANSACTION_ERASE:
 454           POOL_DEBUG(SAT_DEBUG_RESULT, "%d erased packages:\n", cnt);
 455           break;
 456         case SOLVER_TRANSACTION_INSTALL:
 457           POOL_DEBUG(SAT_DEBUG_RESULT, "%d installed packages:\n", cnt);
 458           break;
 459         case SOLVER_TRANSACTION_REINSTALLED:
 460           POOL_DEBUG(SAT_DEBUG_RESULT, "%d reinstalled packages:\n", cnt);
 461           break;
 462         case SOLVER_TRANSACTION_DOWNGRADED:
 463           POOL_DEBUG(SAT_DEBUG_RESULT, "%d downgraded packages:\n", cnt);
 464           break;
 465         case SOLVER_TRANSACTION_CHANGED:
 466           POOL_DEBUG(SAT_DEBUG_RESULT, "%d changed packages:\n", cnt);
 467           break;
 468         case SOLVER_TRANSACTION_UPGRADED:
 469           POOL_DEBUG(SAT_DEBUG_RESULT, "%d upgraded packages:\n", cnt);
 470           break;
 471         case SOLVER_TRANSACTION_VENDORCHANGE:
 472           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]));
 473           break;
 474         case SOLVER_TRANSACTION_ARCHCHANGE:
 475           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]));
 476           break;
 477         default:
 478           class = SOLVER_TRANSACTION_IGNORE;
 479           break;
 480         }
 481       if (class == SOLVER_TRANSACTION_IGNORE)
 482         continue;
 483       transaction_classify_pkgs(trans, mode, class, classes.elements[i + 2], classes.elements[i + 3], &pkgs);
 484       *line = 0;
 485       linel = 0;
 486       for (j = 0; j < pkgs.count; j++)
 487         {
 488           Id p = pkgs.elements[j];
 489           Solvable *s = pool->solvables + p;
 490           Solvable *s2;
 491
 492           switch(class)
 493             {
 494             case SOLVER_TRANSACTION_DOWNGRADED:
 495             case SOLVER_TRANSACTION_UPGRADED:
 496               s2 = pool->solvables + transaction_obs_pkg(trans, p);
 497               POOL_DEBUG(SAT_DEBUG_RESULT, "  - %s -> %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, s2));
 498               break;
 499             case SOLVER_TRANSACTION_VENDORCHANGE:
 500             case SOLVER_TRANSACTION_ARCHCHANGE:
 501               n = pool_id2str(pool, s->name);
 502               l = strlen(n);
 503               if (l + linel > sizeof(line) - 3)
 504                 {
 505                   if (*line)
 506                     POOL_DEBUG(SAT_DEBUG_RESULT, "    %s\n", line);
 507                   *line = 0;
 508                   linel = 0;
 509                 }
 510               if (l + linel > sizeof(line) - 3)
 511                 POOL_DEBUG(SAT_DEBUG_RESULT, "    %s\n", n);
 512               else
 513                 {
 514                   if (*line)
 515                     {
 516                       strcpy(line + linel, ", ");
 517                       linel += 2;
 518                     }
 519                   strcpy(line + linel, n);
 520                   linel += l;
 521                 }
 522               break;
 523             default:
 524               POOL_DEBUG(SAT_DEBUG_RESULT, "  - %s\n", pool_solvable2str(pool, s));
 525               break;
 526             }
 527         }
 528       if (*line)
 529         POOL_DEBUG(SAT_DEBUG_RESULT, "    %s\n", line);
 530       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 531     }
 532   queue_free(&classes);
 533   queue_free(&pkgs);
 534 }
 535
 536 void
 537 solver_printproblemruleinfo(Solver *solv, Id probr)
 538 {
 539   Pool *pool = solv->pool;
 540   Id dep, source, target;
 541
 542   switch (solver_ruleinfo(solv, probr, &source, &target, &dep))
 543     {
 544     case SOLVER_RULE_DISTUPGRADE:
 545       POOL_DEBUG(SAT_DEBUG_RESULT, "%s does not belong to a distupgrade repository\n", pool_solvid2str(pool, source));
 546       return;
 547     case SOLVER_RULE_INFARCH:
 548       POOL_DEBUG(SAT_DEBUG_RESULT, "%s has inferior architecture\n", pool_solvid2str(pool, source));
 549       return;
 550     case SOLVER_RULE_UPDATE:
 551       POOL_DEBUG(SAT_DEBUG_RESULT, "problem with installed package %s\n", pool_solvid2str(pool, source));
 552       return;
 553     case SOLVER_RULE_JOB:
 554       POOL_DEBUG(SAT_DEBUG_RESULT, "conflicting requests\n");
 555       return;
 556     case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
 557       POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides requested %s\n", pool_dep2str(pool, dep));
 558       return;
 559     case SOLVER_RULE_RPM:
 560       POOL_DEBUG(SAT_DEBUG_RESULT, "some dependency problem\n");
 561       return;
 562     case SOLVER_RULE_RPM_NOT_INSTALLABLE:
 563       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s is not installable\n", pool_solvid2str(pool, source));
 564       return;
 565     case SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP:
 566       POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides %s needed by %s\n", pool_dep2str(pool, dep), pool_solvid2str(pool, source));
 567       return;
 568     case SOLVER_RULE_RPM_SAME_NAME:
 569       POOL_DEBUG(SAT_DEBUG_RESULT, "cannot install both %s and %s\n", pool_solvid2str(pool, source), pool_solvid2str(pool, target));
 570       return;
 571     case SOLVER_RULE_RPM_PACKAGE_CONFLICT:
 572       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));
 573       return;
 574     case SOLVER_RULE_RPM_PACKAGE_OBSOLETES:
 575       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));
 576       return;
 577     case SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES:
 578       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));
 579       return;
 580     case SOLVER_RULE_RPM_IMPLICIT_OBSOLETES:
 581       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));
 582       return;
 583     case SOLVER_RULE_RPM_PACKAGE_REQUIRES:
 584       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));
 585       return;
 586     case SOLVER_RULE_RPM_SELF_CONFLICT:
 587       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by itself\n", pool_solvid2str(pool, source), pool_dep2str(pool, dep));
 588       return;
 589     case SOLVER_RULE_UNKNOWN:
 590     case SOLVER_RULE_FEATURE:
 591     case SOLVER_RULE_LEARNT:
 592     case SOLVER_RULE_CHOICE:
 593       POOL_DEBUG(SAT_DEBUG_RESULT, "bad rule type\n");
 594       return;
 595     }
 596 }
 597
 598 void
 599 solver_printprobleminfo(Solver *solv, Id problem)
 600 {
 601   solver_printproblemruleinfo(solv, solver_findproblemrule(solv, problem));
 602 }
 603
 604 void
 605 solver_printcompleteprobleminfo(Solver *solv, Id problem)
 606 {
 607   Queue q;
 608   Id probr;
 609   int i, nobad = 0;
 610
 611   queue_init(&q);
 612   solver_findallproblemrules(solv, problem, &q);
 613   for (i = 0; i < q.count; i++)
 614     {
 615       probr = q.elements[i];
 616       if (!(probr >= solv->updaterules && probr < solv->updaterules_end) && !(probr >= solv->jobrules && probr < solv->jobrules_end))
 617         {
 618           nobad = 1;
 619           break;
 620         }
 621     }
 622   for (i = 0; i < q.count; i++)
 623     {
 624       probr = q.elements[i];
 625       if (nobad && ((probr >= solv->updaterules && probr < solv->updaterules_end) || (probr >= solv->jobrules && probr < solv->jobrules_end)))
 626         continue;
 627       solver_printproblemruleinfo(solv, probr);
 628     }
 629   queue_free(&q);
 630 }
 631
 632 void
 633 solver_printsolution(Solver *solv, Id problem, Id solution)
 634 {
 635   Pool *pool = solv->pool;
 636   Id p, rp, element, how, what, select;
 637   Solvable *s, *sd;
 638
 639   element = 0;
 640   while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0)
 641     {
 642       if (p == SOLVER_SOLUTION_JOB)
 643         {
 644           /* job, rp is index into job queue */
 645           how = solv->job.elements[rp - 1];
 646           what = solv->job.elements[rp];
 647           select = how & SOLVER_SELECTMASK;
 648           switch (how & SOLVER_JOBMASK)
 649             {
 650             case SOLVER_INSTALL:
 651               if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
 652                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not keep %s installed\n", pool_solvid2str(pool, what));
 653               else if (select == SOLVER_SOLVABLE_PROVIDES)
 654                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not install a solvable %s\n", solver_select2str(pool, select, what));
 655               else
 656                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not install %s\n", solver_select2str(pool, select, what));
 657               break;
 658             case SOLVER_ERASE:
 659               if (select == SOLVER_SOLVABLE && !(solv->installed && pool->solvables[what].repo == solv->installed))
 660                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not forbid installation of %s\n", pool_solvid2str(pool, what));
 661               else if (select == SOLVER_SOLVABLE_PROVIDES)
 662                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not deinstall all solvables %s\n", solver_select2str(pool, select, what));
 663               else
 664                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not deinstall %s\n", solver_select2str(pool, select, what));
 665               break;
 666             case SOLVER_UPDATE:
 667               POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not install most recent version of %s\n", solver_select2str(pool, select, what));
 668               break;
 669             case SOLVER_LOCK:
 670               POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not lock %s\n", solver_select2str(pool, select, what));
 671               break;
 672             default:
 673               POOL_DEBUG(SAT_DEBUG_RESULT, "  - do something different\n");
 674               break;
 675             }
 676         }
 677       else if (p == SOLVER_SOLUTION_INFARCH)
 678         {
 679           s = pool->solvables + rp;
 680           if (solv->installed && s->repo == solv->installed)
 681             POOL_DEBUG(SAT_DEBUG_RESULT, "  - keep %s despite the inferior architecture\n", pool_solvable2str(pool, s));
 682           else
 683             POOL_DEBUG(SAT_DEBUG_RESULT, "  - install %s despite the inferior architecture\n", pool_solvable2str(pool, s));
 684         }
 685       else if (p == SOLVER_SOLUTION_DISTUPGRADE)
 686         {
 687           s = pool->solvables + rp;
 688           if (solv->installed && s->repo == solv->installed)
 689             POOL_DEBUG(SAT_DEBUG_RESULT, "  - keep obsolete %s\n", pool_solvable2str(pool, s));
 690           else
 691             POOL_DEBUG(SAT_DEBUG_RESULT, "  - install %s from excluded repository\n", pool_solvable2str(pool, s));
 692         }
 693       else
 694         {
 695           /* policy, replace p with rp */
 696           s = pool->solvables + p;
 697           sd = rp ? pool->solvables + rp : 0;
 698           if (sd)
 699             {
 700               int illegal = policy_is_illegal(solv, s, sd, 0);
 701               if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
 702                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow downgrade of %s to %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
 703               if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
 704                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow architecture change of %s to %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
 705               if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
 706                 {
 707                   if (sd->vendor)
 708                     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));
 709                   else
 710                     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));
 711                 }
 712               if (!illegal)
 713                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow replacement of %s with %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, sd));
 714             }
 715           else
 716             {
 717               POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow deinstallation of %s\n", pool_solvable2str(pool, s));
 718             }
 719         }
 720     }
 721 }
 722
 723 void
 724 solver_printallsolutions(Solver *solv)
 725 {
 726   Pool *pool = solv->pool;
 727   int pcnt;
 728   Id problem, solution;
 729
 730   POOL_DEBUG(SAT_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n");
 731   pcnt = 0;
 732   problem = 0;
 733   while ((problem = solver_next_problem(solv, problem)) != 0)
 734     {
 735       pcnt++;
 736       POOL_DEBUG(SAT_DEBUG_RESULT, "Problem %d:\n", pcnt);
 737       POOL_DEBUG(SAT_DEBUG_RESULT, "====================================\n");
 738 #if 1
 739       solver_printprobleminfo(solv, problem);
 740 #else
 741       solver_printcompleteprobleminfo(solv, problem);
 742 #endif
 743       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 744       solution = 0;
 745       while ((solution = solver_next_solution(solv, problem, solution)) != 0)
 746         {
 747           solver_printsolution(solv, problem, solution);
 748           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 749         }
 750     }
 751 }
 752
 753 void
 754 solver_printtrivial(Solver *solv)
 755 {
 756   Pool *pool = solv->pool;
 757   Queue in, out;
 758   Id p;
 759   const char *n;
 760   Solvable *s;
 761   int i;
 762
 763   queue_init(&in);
 764   for (p = 1, s = pool->solvables + p; p < solv->pool->nsolvables; p++, s++)
 765     {
 766       n = pool_id2str(pool, s->name);
 767       if (strncmp(n, "patch:", 6) != 0 && strncmp(n, "pattern:", 8) != 0)
 768         continue;
 769       queue_push(&in, p);
 770     }
 771   if (!in.count)
 772     {
 773       queue_free(&in);
 774       return;
 775     }
 776   queue_init(&out);
 777   solver_trivial_installable(solv, &in, &out);
 778   POOL_DEBUG(SAT_DEBUG_RESULT, "trivial installable status:\n");
 779   for (i = 0; i < in.count; i++)
 780     POOL_DEBUG(SAT_DEBUG_RESULT, "  %s: %d\n", pool_solvid2str(pool, in.elements[i]), out.elements[i]);
 781   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 782   queue_free(&in);
 783   queue_free(&out);
 784 }
 785
 786 const char *
 787 solver_select2str(Pool *pool, Id select, Id what)
 788 {
 789   const char *s;
 790   char *b;
 791   if (select == SOLVER_SOLVABLE)
 792     return pool_solvid2str(pool, what);
 793   if (select == SOLVER_SOLVABLE_NAME)
 794     return pool_dep2str(pool, what);
 795   if (select == SOLVER_SOLVABLE_PROVIDES)
 796     {
 797       s = pool_dep2str(pool, what);
 798       b = pool_alloctmpspace(pool, 11 + strlen(s));
 799       sprintf(b, "providing %s", s);
 800       return b;
 801     }
 802   if (select == SOLVER_SOLVABLE_ONE_OF)
 803     {
 804       Id p;
 805       b = 0;
 806       while ((p = pool->whatprovidesdata[what++]) != 0)
 807         {
 808           s = pool_solvid2str(pool, p);
 809           if (b)
 810             b = pool_tmpappend(pool, b, ", ", s);
 811           else
 812             b = pool_tmpjoin(pool, s, 0, 0);
 813           pool_freetmpspace(pool, s);
 814         }
 815       return b ? b : "nothing";
 816     }
 817   if (select == SOLVER_SOLVABLE_REPO)
 818     {
 819       b = pool_alloctmpspace(pool, 20);
 820       sprintf(b, "repo #%d", what);
 821       return b;
 822     }
 823   if (select == SOLVER_SOLVABLE_ALL)
 824     return "all packages";
 825   return "unknown job select";
 826 }
 827
 828 const char *
 829 pool_job2str(Pool *pool, Id how, Id what, Id flagmask)
 830 {
 831   Id select = how & SOLVER_SELECTMASK;
 832   const char *strstart = 0, *strend = 0;
 833   char *s;
 834   int o;
 835
 836   switch (how & SOLVER_JOBMASK)
 837     {
 838     case SOLVER_NOOP:
 839       return "do nothing";
 840     case SOLVER_INSTALL:
 841       if (select == SOLVER_SOLVABLE && pool->installed && pool->solvables[what].repo == pool->installed)
 842         strstart = "keep ", strend = "installed";
 843       else if (select == SOLVER_SOLVABLE || select == SOLVER_SOLVABLE_NAME)
 844         strstart = "install ";
 845       else if (select == SOLVER_SOLVABLE_PROVIDES)
 846         strstart = "install a package ";
 847       else
 848         strstart = "install one of ";
 849       break;
 850     case SOLVER_ERASE:
 851       if (select == SOLVER_SOLVABLE && !(pool->installed && pool->solvables[what].repo == pool->installed))
 852         strstart = "keep ", strend = "unstalled";
 853       else if (select == SOLVER_SOLVABLE_PROVIDES)
 854         strstart = "deinstall all packages ";
 855       else
 856         strstart = "deinstall ";
 857       break;
 858     case SOLVER_UPDATE:
 859       strstart = "update ";
 860       break;
 861     case SOLVER_WEAKENDEPS:
 862       strstart = "weaken deps of ";
 863       break;
 864     case SOLVER_NOOBSOLETES:
 865       strstart = "multi version ";
 866       break;
 867     case SOLVER_LOCK:
 868       strstart = "update ";
 869       break;
 870     case SOLVER_DISTUPGRADE:
 871       strstart = "dist upgrade ";
 872       break;
 873     case SOLVER_VERIFY:
 874       strstart = "verify ";
 875       break;
 876     case SOLVER_DROP_ORPHANED:
 877       strstart = "deinstall ", strend = "if orphaned";
 878       break;
 879     case SOLVER_USERINSTALLED:
 880       strstart = "regard ", strend = "as userinstalled";
 881       break;
 882     default:
 883       strstart = "unknown job ";
 884       break;
 885     }
 886   s = pool_tmpjoin(pool, strstart, solver_select2str(pool, select, what), strend);
 887   if ((how & flagmask & ~(SOLVER_SELECTMASK|SOLVER_JOBMASK)) == 0)
 888     return s;
 889   o = strlen(s);
 890   s = pool_tmpappend(pool, s, " ", 0);
 891   if (how & SOLVER_WEAK)
 892     s = pool_tmpappend(pool, s, ",weak", 0);
 893   if (how & SOLVER_ESSENTIAL)
 894     s = pool_tmpappend(pool, s, ",essential", 0);
 895   if (how & SOLVER_CLEANDEPS)
 896     s = pool_tmpappend(pool, s, ",cleandeps", 0);
 897   if (how & SOLVER_SETEV)
 898     s = pool_tmpappend(pool, s, ",setev", 0);
 899   if (how & SOLVER_SETEVR)
 900     s = pool_tmpappend(pool, s, ",setevr", 0);
 901   if (how & SOLVER_SETARCH)
 902     s = pool_tmpappend(pool, s, ",setarch", 0);
 903   if (how & SOLVER_SETVENDOR)
 904     s = pool_tmpappend(pool, s, ",setvendor", 0);
 905   if (how & SOLVER_SETREPO)
 906     s = pool_tmpappend(pool, s, ",setrepo", 0);
 907   if (how & SOLVER_NOAUTOSET)
 908     s = pool_tmpappend(pool, s, ",noautoset", 0);
 909   if (s[o + 1] != ',')
 910     s = pool_tmpappend(pool, s, ",?", 0);
 911   s[o + 1] = '[';
 912   return pool_tmpappend(pool, s, "]", 0);
 913 }
 914
 915 const char *
 916 solver_problemruleinfo2str(Solver *solv, SolverRuleinfo type, Id source, Id target, Id dep)
 917 {
 918   Pool *pool = solv->pool;
 919   char *s;
 920   switch (type)
 921     {
 922     case SOLVER_RULE_DISTUPGRADE:
 923       return pool_tmpjoin(pool, pool_solvid2str(pool, source), " does not belong to a distupgrade repository", 0);
 924     case SOLVER_RULE_INFARCH:
 925       return pool_tmpjoin(pool, pool_solvid2str(pool, source), " has inferior architecture", 0);
 926     case SOLVER_RULE_UPDATE:
 927       return pool_tmpjoin(pool, "problem with installed package ", pool_solvid2str(pool, source), 0);
 928     case SOLVER_RULE_JOB:
 929       return "conflicting requests";
 930     case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
 931       return pool_tmpjoin(pool, "nothing provides requested ", pool_dep2str(pool, dep), 0);
 932     case SOLVER_RULE_RPM:
 933       return "some dependency problem";
 934     case SOLVER_RULE_RPM_NOT_INSTALLABLE:
 935       return pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " is not installable");
 936     case SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP:
 937       s = pool_tmpjoin(pool, "nothing provides ", pool_dep2str(pool, dep), 0);
 938       return pool_tmpappend(pool, s, " needed by ", pool_solvid2str(pool, source));
 939     case SOLVER_RULE_RPM_SAME_NAME:
 940       s = pool_tmpjoin(pool, "cannot install both ", pool_solvid2str(pool, source), 0);
 941       return pool_tmpappend(pool, s, " and ", pool_solvid2str(pool, target));
 942     case SOLVER_RULE_RPM_PACKAGE_CONFLICT:
 943       s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
 944       s = pool_tmpappend(pool, s, " conflicts with ", pool_dep2str(pool, dep));
 945       return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
 946     case SOLVER_RULE_RPM_PACKAGE_OBSOLETES:
 947       s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
 948       s = pool_tmpappend(pool, s, " obsoletes ", pool_dep2str(pool, dep));
 949       return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
 950     case SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES:
 951       s = pool_tmpjoin(pool, "installed package ", pool_solvid2str(pool, source), 0);
 952       s = pool_tmpappend(pool, s, " obsoletes ", pool_dep2str(pool, dep));
 953       return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
 954     case SOLVER_RULE_RPM_IMPLICIT_OBSOLETES:
 955       s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), 0);
 956       s = pool_tmpappend(pool, s, " implicitely obsoletes ", pool_dep2str(pool, dep));
 957       return pool_tmpappend(pool, s, " provided by ", pool_solvid2str(pool, target));
 958     case SOLVER_RULE_RPM_PACKAGE_REQUIRES:
 959       s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " requires ");
 960       return pool_tmpappend(pool, s, pool_dep2str(pool, dep), ", but none of the providers can be installed");
 961     case SOLVER_RULE_RPM_SELF_CONFLICT:
 962       s = pool_tmpjoin(pool, "package ", pool_solvid2str(pool, source), " conflicts with ");
 963       return pool_tmpappend(pool, s, pool_dep2str(pool, dep), " provided by itself");
 964     default:
 965       return "bad problem rule type";
 966     }
 967 }
 968
 969 const char *
 970 solver_solutionelement2str(Solver *solv, Id p, Id rp)
 971 {
 972   Pool *pool = solv->pool;
 973   if (p == SOLVER_SOLUTION_JOB)
 974     {
 975       Id how = solv->job.elements[rp - 1];
 976       Id what = solv->job.elements[rp];
 977       return pool_tmpjoin(pool, "do not ask to ", pool_job2str(pool, how, what, 0), 0);
 978     }
 979   else if (p == SOLVER_SOLUTION_INFARCH)
 980     {
 981       Solvable *s = pool->solvables + rp;
 982       if (solv->installed && s->repo == solv->installed)
 983         return pool_tmpjoin(pool, "keep ", pool_solvable2str(pool, s), " despite the inferior architecture");
 984       else
 985         return pool_tmpjoin(pool, "install ", pool_solvable2str(pool, s), " despite the inferior architecture");
 986     }
 987   else if (p == SOLVER_SOLUTION_DISTUPGRADE)
 988     {
 989       Solvable *s = pool->solvables + rp;
 990       if (solv->installed && s->repo == solv->installed)
 991         return pool_tmpjoin(pool, "keep obsolete ", pool_solvable2str(pool, s), 0);
 992       else
 993         return pool_tmpjoin(pool, "install ", pool_solvable2str(pool, s), " from excluded repository");
 994     }
 995   else if (p > 0 && rp == 0)
 996     return pool_tmpjoin(pool, "allow deinstallation of ", pool_solvid2str(pool, p), 0);
 997   else if (p > 0 && rp > 0)
 998     {
 999       const char *sp = pool_solvid2str(pool, p);
1000       const char *srp = pool_solvid2str(pool, rp);
1001       const char *str = pool_tmpjoin(pool, "allow replacement of ", sp, 0);
1002       return pool_tmpappend(pool, str, " with ", srp);
1003     }
1004   else
1005     return "bad solution element";
1006 }
1007
1008 const char *
1009 policy_illegal2str(Solver *solv, int illegal, Solvable *s, Solvable *rs)
1010 {
1011   Pool *pool = solv->pool;
1012   const char *str;
1013   if (illegal == POLICY_ILLEGAL_DOWNGRADE)
1014     {
1015       str = pool_tmpjoin(pool, "downgrade of ", pool_solvable2str(pool, s), 0);
1016       return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1017     }
1018   if (illegal == POLICY_ILLEGAL_ARCHCHANGE)
1019     {
1020       str = pool_tmpjoin(pool, "architecture change of ", pool_solvable2str(pool, s), 0);
1021       return pool_tmpappend(pool, str, " to ", pool_solvable2str(pool, rs));
1022     }
1023   if (illegal == POLICY_ILLEGAL_VENDORCHANGE)
1024     {
1025       str = pool_tmpjoin(pool, "vendor change from '", pool_id2str(pool, s->vendor), "' (");
1026       if (rs->vendor)
1027         {
1028           str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to '");
1029           str = pool_tmpappend(pool, str, pool_id2str(pool, rs->vendor), "' (");
1030         }
1031       else
1032         str = pool_tmpappend(pool, str, pool_solvable2str(pool, s), ") to no vendor (");
1033       return pool_tmpappend(pool, str, pool_solvable2str(pool, rs), ")");
1034     }
1035   return "unknown illegal change";
1036 }