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