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 "solverdebug.h"
  22 #include "bitmap.h"
  23 #include "pool.h"
  24 #include "poolarch.h"
  25 #include "util.h"
  26 #include "evr.h"
  27 #include "policy.h"
  28
  29
  30 /*
  31  * create obsoletesmap from solver decisions
  32  *
  33  * for solvables in installed repo:
  34  *   0 - not obsoleted
  35  *   p - one of the packages that obsolete us
  36  * for all others:
  37  *   n - number of packages this package obsoletes
  38  *
  39  */
  40
  41 /* OBSOLETE: use transaction code instead! */
  42
  43 Id *
  44 solver_create_decisions_obsoletesmap(Solver *solv)
  45 {
  46   Pool *pool = solv->pool;
  47   Repo *installed = solv->installed;
  48   Id p, *obsoletesmap = NULL;
  49   int i;
  50   Solvable *s;
  51
  52   obsoletesmap = (Id *)sat_calloc(pool->nsolvables, sizeof(Id));
  53   if (installed)
  54     {
  55       for (i = 0; i < solv->decisionq.count; i++)
  56         {
  57           Id pp, n;
  58           int noobs;
  59
  60           n = solv->decisionq.elements[i];
  61           if (n < 0)
  62             continue;
  63           if (n == SYSTEMSOLVABLE)
  64             continue;
  65           s = pool->solvables + n;
  66           if (s->repo == installed)             /* obsoletes don't count for already installed packages */
  67             continue;
  68           noobs = solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n);
  69           FOR_PROVIDES(p, pp, s->name)
  70             {
  71               Solvable *ps = pool->solvables + p;
  72               if (noobs && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
  73                 continue;
  74               if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
  75                 continue;
  76               if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
  77                 continue;
  78               if (ps->repo == installed && !obsoletesmap[p])
  79                 {
  80                   obsoletesmap[p] = n;
  81                   obsoletesmap[n]++;
  82                 }
  83             }
  84         }
  85       for (i = 0; i < solv->decisionq.count; i++)
  86         {
  87           Id obs, *obsp;
  88           Id pp, n;
  89
  90           n = solv->decisionq.elements[i];
  91           if (n < 0)
  92             continue;
  93           if (n == SYSTEMSOLVABLE)
  94             continue;
  95           s = pool->solvables + n;
  96           if (s->repo == installed)             /* obsoletes don't count for already installed packages */
  97             continue;
  98           if (!s->obsoletes)
  99             continue;
 100           if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n))
 101             continue;
 102           obsp = s->repo->idarraydata + s->obsoletes;
 103           while ((obs = *obsp++) != 0)
 104             {
 105               FOR_PROVIDES(p, pp, obs)
 106                 {
 107                   Solvable *ps = pool->solvables + p;
 108                   if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
 109                     continue;
 110                   if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
 111                     continue;
 112                   if (pool->solvables[p].repo == installed && !obsoletesmap[p])
 113                     {
 114                       obsoletesmap[p] = n;
 115                       obsoletesmap[n]++;
 116                     }
 117                 }
 118             }
 119         }
 120     }
 121   return obsoletesmap;
 122 }
 123
 124 void
 125 solver_printruleelement(Solver *solv, int type, Rule *r, Id v)
 126 {
 127   Pool *pool = solv->pool;
 128   Solvable *s;
 129   if (v < 0)
 130     {
 131       s = pool->solvables + -v;
 132       POOL_DEBUG(type, "    !%s [%d]", solvable2str(pool, s), -v);
 133     }
 134   else
 135     {
 136       s = pool->solvables + v;
 137       POOL_DEBUG(type, "    %s [%d]", solvable2str(pool, s), v);
 138     }
 139   if (r)
 140     {
 141       if (r->w1 == v)
 142         POOL_DEBUG(type, " (w1)");
 143       if (r->w2 == v)
 144         POOL_DEBUG(type, " (w2)");
 145     }
 146   if (solv->decisionmap[s - pool->solvables] > 0)
 147     POOL_DEBUG(type, " Install.level%d", solv->decisionmap[s - pool->solvables]);
 148   if (solv->decisionmap[s - pool->solvables] < 0)
 149     POOL_DEBUG(type, " Conflict.level%d", -solv->decisionmap[s - pool->solvables]);
 150   POOL_DEBUG(type, "\n");
 151 }
 152
 153
 154 /*
 155  * print rule
 156  */
 157
 158 void
 159 solver_printrule(Solver *solv, int type, Rule *r)
 160 {
 161   Pool *pool = solv->pool;
 162   int i;
 163   Id d, v;
 164
 165   if (r >= solv->rules && r < solv->rules + solv->nrules)   /* r is a solver rule */
 166     POOL_DEBUG(type, "Rule #%d:", (int)(r - solv->rules));
 167   else
 168     POOL_DEBUG(type, "Rule:");                 /* r is any rule */
 169   if (r && r->d < 0)
 170     POOL_DEBUG(type, " (disabled)");
 171   POOL_DEBUG(type, "\n");
 172   d = r->d < 0 ? -r->d - 1 : r->d;
 173   for (i = 0; ; i++)
 174     {
 175       if (i == 0)
 176           /* print direct literal */
 177         v = r->p;
 178       else if (!d)
 179         {
 180           if (i == 2)
 181             break;
 182           /* binary rule --> print w2 as second literal */
 183           v = r->w2;
 184         }
 185       else
 186           /* every other which is in d */
 187         v = solv->pool->whatprovidesdata[d + i - 1];
 188       if (v == ID_NULL)
 189         break;
 190       solver_printruleelement(solv, type, r, v);
 191     }
 192   POOL_DEBUG(type, "    next rules: %d %d\n", r->n1, r->n2);
 193 }
 194
 195 void
 196 solver_printruleclass(Solver *solv, int type, Rule *r)
 197 {
 198   Pool *pool = solv->pool;
 199   Id p = r - solv->rules;
 200   assert(p >= 0);
 201   if (p < solv->learntrules)
 202     if (MAPTST(&solv->weakrulemap, p))
 203       POOL_DEBUG(type, "WEAK ");
 204   if (p >= solv->learntrules)
 205     POOL_DEBUG(type, "LEARNT ");
 206   else if (p >= solv->infarchrules && p < solv->infarchrules_end)
 207     POOL_DEBUG(type, "INFARCH ");
 208   else if (p >= solv->duprules && p < solv->duprules_end)
 209     POOL_DEBUG(type, "DUP ");
 210   else if (p >= solv->jobrules && p < solv->jobrules_end)
 211     POOL_DEBUG(type, "JOB ");
 212   else if (p >= solv->updaterules && p < solv->updaterules_end)
 213     POOL_DEBUG(type, "UPDATE ");
 214   else if (p >= solv->featurerules && p < solv->featurerules_end)
 215     POOL_DEBUG(type, "FEATURE ");
 216   solver_printrule(solv, type, r);
 217 }
 218
 219 void
 220 solver_printproblem(Solver *solv, Id v)
 221 {
 222   Pool *pool = solv->pool;
 223   int i;
 224   Rule *r;
 225   Id *jp;
 226
 227   if (v > 0)
 228     solver_printruleclass(solv, SAT_DEBUG_SOLUTIONS, solv->rules + v);
 229   else
 230     {
 231       v = -(v + 1);
 232       POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "JOB %d\n", v);
 233       jp = solv->ruletojob.elements;
 234       for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
 235         if (*jp == v)
 236           {
 237             POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "- ");
 238             solver_printrule(solv, SAT_DEBUG_SOLUTIONS, r);
 239           }
 240       POOL_DEBUG(SAT_DEBUG_SOLUTIONS, "ENDJOB\n");
 241     }
 242 }
 243
 244 void
 245 solver_printwatches(Solver *solv, int type)
 246 {
 247   Pool *pool = solv->pool;
 248   int counter;
 249
 250   POOL_DEBUG(type, "Watches: \n");
 251   for (counter = -(pool->nsolvables - 1); counter < pool->nsolvables; counter++)
 252     POOL_DEBUG(type, "    solvable [%d] -- rule [%d]\n", counter, solv->watches[counter + pool->nsolvables]);
 253 }
 254
 255 /*
 256  * printdecisions
 257  */
 258
 259 void
 260 solver_printdecisions(Solver *solv)
 261 {
 262   Pool *pool = solv->pool;
 263   Repo *installed = solv->installed;
 264   Id p, type;
 265   int i, j;
 266   Solvable *s;
 267   Queue iq;
 268
 269   IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
 270     {
 271       POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- Decisions -----\n");
 272       for (i = 0; i < solv->decisionq.count; i++)
 273         {
 274           p = solv->decisionq.elements[i];
 275           solver_printruleelement(solv, SAT_DEBUG_SCHUBI, 0, p);
 276         }
 277       POOL_DEBUG(SAT_DEBUG_SCHUBI, "----- Decisions end -----\n");
 278     }
 279
 280   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 281   POOL_DEBUG(SAT_DEBUG_RESULT, "transaction:\n");
 282
 283   queue_init(&iq);
 284   for (i = 0; i < solv->trans.steps.count; i++)
 285     {
 286       p = solv->trans.steps.elements[i];
 287       s = pool->solvables + p;
 288       type = transaction_type(&solv->trans, p, SOLVER_TRANSACTION_SHOW_ACTIVE|SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES|SOLVER_TRANSACTION_SHOW_MULTIINSTALL);
 289       switch(type)
 290         {
 291         case SOLVER_TRANSACTION_MULTIINSTALL:
 292           POOL_DEBUG(SAT_DEBUG_RESULT, "  multi install %s", solvable2str(pool, s));
 293           break;
 294         case SOLVER_TRANSACTION_MULTIREINSTALL:
 295           POOL_DEBUG(SAT_DEBUG_RESULT, "  multi reinstall %s", solvable2str(pool, s));
 296           break;
 297         case SOLVER_TRANSACTION_INSTALL:
 298           POOL_DEBUG(SAT_DEBUG_RESULT, "  install   %s", solvable2str(pool, s));
 299           break;
 300         case SOLVER_TRANSACTION_REINSTALL:
 301           POOL_DEBUG(SAT_DEBUG_RESULT, "  reinstall %s", solvable2str(pool, s));
 302           break;
 303         case SOLVER_TRANSACTION_DOWNGRADE:
 304           POOL_DEBUG(SAT_DEBUG_RESULT, "  downgrade %s", solvable2str(pool, s));
 305           break;
 306         case SOLVER_TRANSACTION_CHANGE:
 307           POOL_DEBUG(SAT_DEBUG_RESULT, "  change    %s", solvable2str(pool, s));
 308           break;
 309         case SOLVER_TRANSACTION_UPGRADE:
 310         case SOLVER_TRANSACTION_OBSOLETES:
 311           POOL_DEBUG(SAT_DEBUG_RESULT, "  upgrade   %s", solvable2str(pool, s));
 312           break;
 313         case SOLVER_TRANSACTION_ERASE:
 314           POOL_DEBUG(SAT_DEBUG_RESULT, "  erase     %s", solvable2str(pool, s));
 315           break;
 316         default:
 317           break;
 318         }
 319       switch(type)
 320         {
 321         case SOLVER_TRANSACTION_INSTALL:
 322         case SOLVER_TRANSACTION_ERASE:
 323           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 324           break;
 325         case SOLVER_TRANSACTION_REINSTALL:
 326         case SOLVER_TRANSACTION_DOWNGRADE:
 327         case SOLVER_TRANSACTION_CHANGE:
 328         case SOLVER_TRANSACTION_UPGRADE:
 329         case SOLVER_TRANSACTION_OBSOLETES:
 330           transaction_all_obs_pkgs(&solv->trans, p, &iq);
 331           if (iq.count)
 332             {
 333               POOL_DEBUG(SAT_DEBUG_RESULT, "  (obsoletes");
 334               for (j = 0; j < iq.count; j++)
 335                 POOL_DEBUG(SAT_DEBUG_RESULT, " %s", solvid2str(pool, iq.elements[j]));
 336               POOL_DEBUG(SAT_DEBUG_RESULT, ")");
 337             }
 338           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 339           break;
 340         default:
 341           break;
 342         }
 343     }
 344   queue_free(&iq);
 345
 346   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 347
 348   if (solv->recommendations.count)
 349     {
 350       POOL_DEBUG(SAT_DEBUG_RESULT, "recommended packages:\n");
 351       for (i = 0; i < solv->recommendations.count; i++)
 352         {
 353           s = pool->solvables + solv->recommendations.elements[i];
 354           if (solv->decisionmap[solv->recommendations.elements[i]] > 0)
 355             {
 356               if (installed && s->repo == installed)
 357                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (installed)\n", solvable2str(pool, s));
 358               else
 359                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (selected)\n", solvable2str(pool, s));
 360             }
 361           else
 362             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s\n", solvable2str(pool, s));
 363         }
 364       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 365     }
 366
 367   if (solv->suggestions.count)
 368     {
 369       POOL_DEBUG(SAT_DEBUG_RESULT, "suggested packages:\n");
 370       for (i = 0; i < solv->suggestions.count; i++)
 371         {
 372           s = pool->solvables + solv->suggestions.elements[i];
 373           if (solv->decisionmap[solv->suggestions.elements[i]] > 0)
 374             {
 375               if (installed && s->repo == installed)
 376                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (installed)\n", solvable2str(pool, s));
 377               else
 378                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (selected)\n", solvable2str(pool, s));
 379             }
 380           else
 381             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s\n", solvable2str(pool, s));
 382         }
 383       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 384     }
 385   if (solv->orphaned.count)
 386     {
 387       POOL_DEBUG(SAT_DEBUG_RESULT, "orphaned packages:\n");
 388       for (i = 0; i < solv->orphaned.count; i++)
 389         {
 390           s = pool->solvables + solv->orphaned.elements[i];
 391           if (solv->decisionmap[solv->orphaned.elements[i]] > 0)
 392             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (kept)\n", solvable2str(pool, s));
 393           else
 394             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (erased)\n", solvable2str(pool, s));
 395         }
 396       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 397     }
 398 }
 399
 400 static inline
 401 const char *id2strnone(Pool *pool, Id id)
 402 {
 403   return !id || id == 1 ? "(none)" : id2str(pool, id);
 404 }
 405
 406 void
 407 solver_printtransaction(Solver *solv)
 408 {
 409   Transaction *trans = &solv->trans;
 410   Pool *pool = trans->pool;
 411   Queue classes, pkgs;
 412   int i, j, mode, l, linel;
 413   char line[76];
 414   const char *n;
 415
 416   queue_init(&classes);
 417   queue_init(&pkgs);
 418   mode = 0;
 419   transaction_classify(trans, mode, &classes);
 420   for (i = 0; i < classes.count; i += 4)
 421     {
 422       Id class = classes.elements[i];
 423       Id cnt = classes.elements[i + 1];
 424       switch(class)
 425         {
 426         case SOLVER_TRANSACTION_ERASE:
 427           POOL_DEBUG(SAT_DEBUG_RESULT, "%d erased packages:\n", cnt);
 428           break;
 429         case SOLVER_TRANSACTION_INSTALL:
 430           POOL_DEBUG(SAT_DEBUG_RESULT, "%d installed packages:\n", cnt);
 431           break;
 432         case SOLVER_TRANSACTION_REINSTALLED:
 433           POOL_DEBUG(SAT_DEBUG_RESULT, "%d reinstalled packages:\n", cnt);
 434           break;
 435         case SOLVER_TRANSACTION_DOWNGRADED:
 436           POOL_DEBUG(SAT_DEBUG_RESULT, "%d downgraded packages:\n", cnt);
 437           break;
 438         case SOLVER_TRANSACTION_CHANGED:
 439           POOL_DEBUG(SAT_DEBUG_RESULT, "%d changed packages:\n", cnt);
 440           break;
 441         case SOLVER_TRANSACTION_UPGRADED:
 442           POOL_DEBUG(SAT_DEBUG_RESULT, "%d upgraded packages:\n", cnt);
 443           break;
 444         case SOLVER_TRANSACTION_VENDORCHANGE:
 445           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]));
 446           break;
 447         case SOLVER_TRANSACTION_ARCHCHANGE:
 448           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]));
 449           break;
 450         default:
 451           class = SOLVER_TRANSACTION_IGNORE;
 452           break;
 453         }
 454       if (class == SOLVER_TRANSACTION_IGNORE)
 455         continue;
 456       transaction_classify_pkgs(trans, mode, class, classes.elements[i + 2], classes.elements[i + 3], &pkgs);
 457       *line = 0;
 458       linel = 0;
 459       for (j = 0; j < pkgs.count; j++)
 460         {
 461           Id p = pkgs.elements[j];
 462           Solvable *s = pool->solvables + p;
 463           Solvable *s2;
 464
 465           switch(class)
 466             {
 467             case SOLVER_TRANSACTION_DOWNGRADED:
 468             case SOLVER_TRANSACTION_UPGRADED:
 469               s2 = pool->solvables + transaction_obs_pkg(trans, p);
 470               POOL_DEBUG(SAT_DEBUG_RESULT, "  - %s -> %s\n", solvable2str(pool, s), solvable2str(pool, s2));
 471               break;
 472             case SOLVER_TRANSACTION_VENDORCHANGE:
 473             case SOLVER_TRANSACTION_ARCHCHANGE:
 474               n = id2str(pool, s->name);
 475               l = strlen(n);
 476               if (l + linel > sizeof(line) - 3)
 477                 {
 478                   if (*line)
 479                     POOL_DEBUG(SAT_DEBUG_RESULT, "    %s\n", line);
 480                   *line = 0;
 481                   linel = 0;
 482                 }
 483               if (l + linel > sizeof(line) - 3)
 484                 POOL_DEBUG(SAT_DEBUG_RESULT, "    %s\n", n);
 485               else
 486                 {
 487                   if (*line)
 488                     {
 489                       strcpy(line + linel, ", ");
 490                       linel += 2;
 491                     }
 492                   strcpy(line + linel, n);
 493                   linel += l;
 494                 }
 495               break;
 496             default:
 497               POOL_DEBUG(SAT_DEBUG_RESULT, "  - %s\n", solvable2str(pool, s));
 498               break;
 499             }
 500         }
 501       if (*line)
 502         POOL_DEBUG(SAT_DEBUG_RESULT, "    %s\n", line);
 503       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 504     }
 505   queue_free(&classes);
 506   queue_free(&pkgs);
 507 }
 508
 509 void
 510 solver_printprobleminfo(Solver *solv, Id problem)
 511 {
 512   Pool *pool = solv->pool;
 513   Id probr;
 514   Id dep, source, target;
 515
 516   probr = solver_findproblemrule(solv, problem);
 517   switch (solver_ruleinfo(solv, probr, &source, &target, &dep))
 518     {
 519     case SOLVER_RULE_DISTUPGRADE:
 520       POOL_DEBUG(SAT_DEBUG_RESULT, "%s does not belong to a distupgrade repository\n", solvid2str(pool, source));
 521       return;
 522     case SOLVER_RULE_INFARCH:
 523       POOL_DEBUG(SAT_DEBUG_RESULT, "%s has inferior architecture\n", solvid2str(pool, source));
 524       return;
 525     case SOLVER_RULE_UPDATE:
 526       POOL_DEBUG(SAT_DEBUG_RESULT, "problem with installed package %s\n", solvid2str(pool, source));
 527       return;
 528     case SOLVER_RULE_JOB:
 529       POOL_DEBUG(SAT_DEBUG_RESULT, "conflicting requests\n");
 530       return;
 531     case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
 532       POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides requested %s\n", dep2str(pool, dep));
 533       return;
 534     case SOLVER_RULE_RPM:
 535       POOL_DEBUG(SAT_DEBUG_RESULT, "some dependency problem\n");
 536       return;
 537     case SOLVER_RULE_RPM_NOT_INSTALLABLE:
 538       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s is not installable\n", solvid2str(pool, source));
 539       return;
 540     case SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP:
 541       POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides %s needed by %s\n", dep2str(pool, dep), solvid2str(pool, source));
 542       return;
 543     case SOLVER_RULE_RPM_SAME_NAME:
 544       POOL_DEBUG(SAT_DEBUG_RESULT, "cannot install both %s and %s\n", solvid2str(pool, source), solvid2str(pool, target));
 545       return;
 546     case SOLVER_RULE_RPM_PACKAGE_CONFLICT:
 547       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target));
 548       return;
 549     case SOLVER_RULE_RPM_PACKAGE_OBSOLETES:
 550       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s obsoletes %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target));
 551       return;
 552     case SOLVER_RULE_RPM_IMPLICIT_OBSOLETES:
 553       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s implicitely obsoletes %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target));
 554       return;
 555     case SOLVER_RULE_RPM_PACKAGE_REQUIRES:
 556       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s requires %s, but none of the providers can be installed\n", solvid2str(pool, source), dep2str(pool, dep));
 557       return;
 558     case SOLVER_RULE_RPM_SELF_CONFLICT:
 559       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by itself\n", solvid2str(pool, source), dep2str(pool, dep));
 560       return;
 561     case SOLVER_RULE_UNKNOWN:
 562     case SOLVER_RULE_FEATURE:
 563     case SOLVER_RULE_LEARNT:
 564       POOL_DEBUG(SAT_DEBUG_RESULT, "bad rule type\n");
 565       return;
 566     }
 567 }
 568
 569 void
 570 solver_printsolution(Solver *solv, Id problem, Id solution)
 571 {
 572   Pool *pool = solv->pool;
 573   Id p, rp, element, how, what, select;
 574   Solvable *s, *sd;
 575
 576   element = 0;
 577   while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0)
 578     {
 579       if (p == SOLVER_SOLUTION_JOB)
 580         {
 581           /* job, rp is index into job queue */
 582           how = solv->job.elements[rp - 1];
 583           what = solv->job.elements[rp];
 584           select = how & SOLVER_SELECTMASK;
 585           switch (how & SOLVER_JOBMASK)
 586             {
 587             case SOLVER_INSTALL:
 588               if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
 589                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not keep %s installed\n", solvid2str(pool, what));
 590               else if (select == SOLVER_SOLVABLE_PROVIDES)
 591                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not install a solvable %s\n", solver_select2str(solv, select, what));
 592               else
 593                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not install %s\n", solver_select2str(solv, select, what));
 594               break;
 595             case SOLVER_ERASE:
 596               if (select == SOLVER_SOLVABLE && !(solv->installed && pool->solvables[what].repo == solv->installed))
 597                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not forbid installation of %s\n", solvid2str(pool, what));
 598               else if (select == SOLVER_SOLVABLE_PROVIDES)
 599                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not deinstall all solvables %s\n", solver_select2str(solv, select, what));
 600               else
 601                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not deinstall %s\n", solver_select2str(solv, select, what));
 602               break;
 603             case SOLVER_UPDATE:
 604               POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not install most recent version of %s\n", solver_select2str(solv, select, what));
 605               break;
 606             case SOLVER_LOCK:
 607               POOL_DEBUG(SAT_DEBUG_RESULT, "  - do not lock %s\n", solver_select2str(solv, select, what));
 608               break;
 609             default:
 610               POOL_DEBUG(SAT_DEBUG_RESULT, "  - do something different\n");
 611               break;
 612             }
 613         }
 614       else if (p == SOLVER_SOLUTION_INFARCH)
 615         {
 616           s = pool->solvables + rp;
 617           if (solv->installed && s->repo == solv->installed)
 618             POOL_DEBUG(SAT_DEBUG_RESULT, "  - keep %s despite the inferior architecture\n", solvable2str(pool, s));
 619           else
 620             POOL_DEBUG(SAT_DEBUG_RESULT, "  - install %s despite the inferior architecture\n", solvable2str(pool, s));
 621         }
 622       else if (p == SOLVER_SOLUTION_DISTUPGRADE)
 623         {
 624           s = pool->solvables + rp;
 625           if (solv->installed && s->repo == solv->installed)
 626             POOL_DEBUG(SAT_DEBUG_RESULT, "  - keep obsolete %s\n", solvable2str(pool, s));
 627           else
 628             POOL_DEBUG(SAT_DEBUG_RESULT, "  - install %s from excluded repository\n", solvable2str(pool, s));
 629         }
 630       else
 631         {
 632           /* policy, replace p with rp */
 633           s = pool->solvables + p;
 634           sd = rp ? pool->solvables + rp : 0;
 635           if (s == sd && solv->distupgrade)
 636             {
 637               POOL_DEBUG(SAT_DEBUG_RESULT, "  - keep obsolete %s\n", solvable2str(pool, s));
 638             }
 639           else if (sd)
 640             {
 641               int gotone = 0;
 642               if (!solv->allowdowngrade && evrcmp(pool, s->evr, sd->evr, EVRCMP_MATCH_RELEASE) > 0)
 643                 {
 644                   POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow downgrade of %s to %s\n", solvable2str(pool, s), solvable2str(pool, sd));
 645                   gotone = 1;
 646                 }
 647               if (!solv->allowarchchange && s->name == sd->name && s->arch != sd->arch && policy_illegal_archchange(solv, s, sd))
 648                 {
 649                   POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow architecture change of %s to %s\n", solvable2str(pool, s), solvable2str(pool, sd));
 650                   gotone = 1;
 651                 }
 652               if (!solv->allowvendorchange && s->name == sd->name && s->vendor != sd->vendor && policy_illegal_vendorchange(solv, s, sd))
 653                 {
 654                   if (sd->vendor)
 655                     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));
 656                   else
 657                     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));
 658                   gotone = 1;
 659                 }
 660               if (!gotone)
 661                 POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow replacement of %s with %s\n", solvable2str(pool, s), solvable2str(pool, sd));
 662             }
 663           else
 664             {
 665               POOL_DEBUG(SAT_DEBUG_RESULT, "  - allow deinstallation of %s\n", solvable2str(pool, s));
 666             }
 667
 668         }
 669     }
 670 }
 671
 672 void
 673 solver_printallsolutions(Solver *solv)
 674 {
 675   Pool *pool = solv->pool;
 676   int pcnt;
 677   Id problem, solution;
 678
 679   POOL_DEBUG(SAT_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n");
 680   pcnt = 0;
 681   problem = 0;
 682   while ((problem = solver_next_problem(solv, problem)) != 0)
 683     {
 684       pcnt++;
 685       POOL_DEBUG(SAT_DEBUG_RESULT, "Problem %d:\n", pcnt);
 686       POOL_DEBUG(SAT_DEBUG_RESULT, "====================================\n");
 687       solver_printprobleminfo(solv, problem);
 688       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 689       solution = 0;
 690       while ((solution = solver_next_solution(solv, problem, solution)) != 0)
 691         {
 692           solver_printsolution(solv, problem, solution);
 693           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 694         }
 695     }
 696 }
 697
 698 void
 699 solver_printtrivial(Solver *solv)
 700 {
 701   Pool *pool = solv->pool;
 702   Queue in, out;
 703   Id p;
 704   const char *n;
 705   Solvable *s;
 706   int i;
 707
 708   queue_init(&in);
 709   for (p = 1, s = pool->solvables + p; p < solv->pool->nsolvables; p++, s++)
 710     {
 711       n = id2str(pool, s->name);
 712       if (strncmp(n, "patch:", 6) != 0 && strncmp(n, "pattern:", 8) != 0)
 713         continue;
 714       queue_push(&in, p);
 715     }
 716   if (!in.count)
 717     {
 718       queue_free(&in);
 719       return;
 720     }
 721   queue_init(&out);
 722   solver_trivial_installable(solv, &in, &out);
 723   POOL_DEBUG(SAT_DEBUG_RESULT, "trivial installable status:\n");
 724   for (i = 0; i < in.count; i++)
 725     POOL_DEBUG(SAT_DEBUG_RESULT, "  %s: %d\n", solvid2str(pool, in.elements[i]), out.elements[i]);
 726   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 727   queue_free(&in);
 728   queue_free(&out);
 729 }
 730
 731 const char *
 732 solver_select2str(Solver *solv, Id select, Id what)
 733 {
 734   Pool *pool = solv->pool;
 735   const char *s;
 736   char *b;
 737   if (select == SOLVER_SOLVABLE)
 738     return solvid2str(pool, what);
 739   if (select == SOLVER_SOLVABLE_NAME)
 740     return dep2str(pool, what);
 741   if (select == SOLVER_SOLVABLE_PROVIDES)
 742     {
 743       s = dep2str(pool, what);
 744       b = pool_alloctmpspace(pool, 11 + strlen(s));
 745       sprintf(b, "providing %s", s);
 746       return b;
 747     }
 748   if (select == SOLVER_SOLVABLE_ONE_OF)
 749     {
 750       Id p;
 751       char *b2;
 752       b = "";
 753       while ((p = pool->whatprovidesdata[what++]) != 0)
 754         {
 755           s = solvid2str(pool, p);
 756           b2 = pool_alloctmpspace(pool, strlen(b) + strlen(s) + 3);
 757           sprintf(b2, "%s, %s", b, s);
 758           b = b2;
 759         }
 760       return *b ? b + 2 : "nothing";
 761     }
 762   return "unknown job select";
 763 }