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