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;
 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 += 2)
 279     {
 280       s = pool->solvables + solv->trans.steps.elements[i + 1];
 281       switch(solv->trans.steps.elements[i])
 282         {
 283         case SOLVER_TRANSACTION_MULTIINSTALL:
 284           POOL_DEBUG(SAT_DEBUG_RESULT, "  multi install %s", solvable2str(pool, s));
 285           break;
 286         case SOLVER_TRANSACTION_MULTIREINSTALL:
 287           POOL_DEBUG(SAT_DEBUG_RESULT, "  multi reinstall %s", solvable2str(pool, s));
 288           break;
 289         case SOLVER_TRANSACTION_INSTALL:
 290           POOL_DEBUG(SAT_DEBUG_RESULT, "  install   %s", solvable2str(pool, s));
 291           break;
 292         case SOLVER_TRANSACTION_REINSTALL:
 293           POOL_DEBUG(SAT_DEBUG_RESULT, "  reinstall %s", solvable2str(pool, s));
 294           break;
 295         case SOLVER_TRANSACTION_DOWNGRADE:
 296           POOL_DEBUG(SAT_DEBUG_RESULT, "  downgrade %s", solvable2str(pool, s));
 297           break;
 298         case SOLVER_TRANSACTION_CHANGE:
 299           POOL_DEBUG(SAT_DEBUG_RESULT, "  change    %s", solvable2str(pool, s));
 300           break;
 301         case SOLVER_TRANSACTION_UPGRADE:
 302         case SOLVER_TRANSACTION_REPLACE:
 303           POOL_DEBUG(SAT_DEBUG_RESULT, "  upgrade   %s", solvable2str(pool, s));
 304           break;
 305         case SOLVER_TRANSACTION_ERASE:
 306           POOL_DEBUG(SAT_DEBUG_RESULT, "  erase     %s", solvable2str(pool, s));
 307           break;
 308         default:
 309           break;
 310         }
 311       switch(solv->trans.steps.elements[i])
 312         {
 313         case SOLVER_TRANSACTION_INSTALL:
 314         case SOLVER_TRANSACTION_ERASE:
 315           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 316           break;
 317         case SOLVER_TRANSACTION_REINSTALL:
 318         case SOLVER_TRANSACTION_DOWNGRADE:
 319         case SOLVER_TRANSACTION_CHANGE:
 320         case SOLVER_TRANSACTION_UPGRADE:
 321         case SOLVER_TRANSACTION_REPLACE:
 322           solver_transaction_all_pkgs(&solv->trans, solv->trans.steps.elements[i + 1], &iq);
 323           if (iq.count)
 324             {
 325               POOL_DEBUG(SAT_DEBUG_RESULT, "  (obsoletes");
 326               for (j = 0; j < iq.count; j++)
 327                 POOL_DEBUG(SAT_DEBUG_RESULT, " %s", solvid2str(pool, iq.elements[j]));
 328               POOL_DEBUG(SAT_DEBUG_RESULT, ")");
 329             }
 330           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 331           break;
 332         default:
 333           break;
 334         }
 335     }
 336   queue_free(&iq);
 337
 338   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 339
 340   if (solv->recommendations.count)
 341     {
 342       POOL_DEBUG(SAT_DEBUG_RESULT, "recommended packages:\n");
 343       for (i = 0; i < solv->recommendations.count; i++)
 344         {
 345           s = pool->solvables + solv->recommendations.elements[i];
 346           if (solv->decisionmap[solv->recommendations.elements[i]] > 0)
 347             {
 348               if (installed && s->repo == installed)
 349                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (installed)\n", solvable2str(pool, s));
 350               else
 351                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (selected)\n", solvable2str(pool, s));
 352             }
 353           else
 354             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s\n", solvable2str(pool, s));
 355         }
 356       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 357     }
 358
 359   if (solv->suggestions.count)
 360     {
 361       POOL_DEBUG(SAT_DEBUG_RESULT, "suggested packages:\n");
 362       for (i = 0; i < solv->suggestions.count; i++)
 363         {
 364           s = pool->solvables + solv->suggestions.elements[i];
 365           if (solv->decisionmap[solv->suggestions.elements[i]] > 0)
 366             {
 367               if (installed && s->repo == installed)
 368                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (installed)\n", solvable2str(pool, s));
 369               else
 370                 POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (selected)\n", solvable2str(pool, s));
 371             }
 372           else
 373             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s\n", solvable2str(pool, s));
 374         }
 375       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 376     }
 377   if (solv->orphaned.count)
 378     {
 379       POOL_DEBUG(SAT_DEBUG_RESULT, "orphaned packages:\n");
 380       for (i = 0; i < solv->orphaned.count; i++)
 381         {
 382           s = pool->solvables + solv->orphaned.elements[i];
 383           if (solv->decisionmap[solv->orphaned.elements[i]] > 0)
 384             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (kept)\n", solvable2str(pool, s));
 385           else
 386             POOL_DEBUG(SAT_DEBUG_RESULT, "  %s (erased)\n", solvable2str(pool, s));
 387         }
 388       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 389     }
 390 }
 391
 392 void
 393 solver_printprobleminfo(Solver *solv, Queue *job, Id problem)
 394 {
 395   Pool *pool = solv->pool;
 396   Id probr;
 397   Id dep, source, target;
 398
 399   probr = solver_findproblemrule(solv, problem);
 400   switch (solver_problemruleinfo(solv, job, probr, &dep, &source, &target))
 401     {
 402     case SOLVER_RULE_DISTUPGRADE:
 403       POOL_DEBUG(SAT_DEBUG_RESULT, "%s does not belong to a distupgrade repository\n", solvid2str(pool, source));
 404       return;
 405     case SOLVER_RULE_INFARCH:
 406       POOL_DEBUG(SAT_DEBUG_RESULT, "%s has inferior architecture\n", solvid2str(pool, source));
 407       return;
 408     case SOLVER_RULE_UPDATE:
 409       POOL_DEBUG(SAT_DEBUG_RESULT, "problem with installed package %s\n", solvid2str(pool, source));
 410       return;
 411     case SOLVER_RULE_JOB:
 412       POOL_DEBUG(SAT_DEBUG_RESULT, "conflicting requests\n");
 413       return;
 414     case SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP:
 415       POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides requested %s\n", dep2str(pool, dep));
 416       return;
 417     case SOLVER_RULE_RPM:
 418       POOL_DEBUG(SAT_DEBUG_RESULT, "some dependency problem\n");
 419       return;
 420     case SOLVER_RULE_RPM_NOT_INSTALLABLE:
 421       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s is not installable\n", solvid2str(pool, source));
 422       return;
 423     case SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP:
 424       POOL_DEBUG(SAT_DEBUG_RESULT, "nothing provides %s needed by %s\n", dep2str(pool, dep), solvid2str(pool, source));
 425       return;
 426     case SOLVER_RULE_RPM_SAME_NAME:
 427       POOL_DEBUG(SAT_DEBUG_RESULT, "cannot install both %s and %s\n", solvid2str(pool, source), solvid2str(pool, target));
 428       return;
 429     case SOLVER_RULE_RPM_PACKAGE_CONFLICT:
 430       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target));
 431       return;
 432     case SOLVER_RULE_RPM_PACKAGE_OBSOLETES:
 433       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s obsoletes %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target));
 434       return;
 435     case SOLVER_RULE_RPM_IMPLICIT_OBSOLETES:
 436       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s implicitely obsoletes %s provided by %s\n", solvid2str(pool, source), dep2str(pool, dep), solvid2str(pool, target));
 437       return;
 438     case SOLVER_RULE_RPM_PACKAGE_REQUIRES:
 439       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s requires %s, but none of the providers can be installed\n", solvid2str(pool, source), dep2str(pool, dep));
 440       return;
 441     case SOLVER_RULE_RPM_SELF_CONFLICT:
 442       POOL_DEBUG(SAT_DEBUG_RESULT, "package %s conflicts with %s provided by itself\n", solvid2str(pool, source), dep2str(pool, dep));
 443       return;
 444     case SOLVER_RULE_UNKNOWN:
 445     case SOLVER_RULE_FEATURE:
 446     case SOLVER_RULE_LEARNT:
 447       POOL_DEBUG(SAT_DEBUG_RESULT, "bad rule type\n");
 448       return;
 449     }
 450 }
 451
 452 void
 453 solver_printsolutions(Solver *solv, Queue *job)
 454 {
 455   Pool *pool = solv->pool;
 456   int pcnt;
 457   Id p, rp, how, what, select;
 458   Id problem, solution, element;
 459   Solvable *s, *sd;
 460
 461   POOL_DEBUG(SAT_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n");
 462   pcnt = 1;
 463   problem = 0;
 464   while ((problem = solver_next_problem(solv, problem)) != 0)
 465     {
 466       POOL_DEBUG(SAT_DEBUG_RESULT, "Problem %d:\n", pcnt++);
 467       POOL_DEBUG(SAT_DEBUG_RESULT, "====================================\n");
 468       solver_printprobleminfo(solv, job, problem);
 469       POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 470       solution = 0;
 471       while ((solution = solver_next_solution(solv, problem, solution)) != 0)
 472         {
 473           element = 0;
 474           while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0)
 475             {
 476               if (p == SOLVER_SOLUTION_JOB)
 477                 {
 478                   /* job, rp is index into job queue */
 479                   how = job->elements[rp - 1];
 480                   what = job->elements[rp];
 481                   select = how & SOLVER_SELECTMASK;
 482                   switch (how & SOLVER_JOBMASK)
 483                     {
 484                     case SOLVER_INSTALL:
 485                       if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
 486                         POOL_DEBUG(SAT_DEBUG_RESULT, "- do not keep %s installed\n", solvid2str(pool, what));
 487                       else if (select == SOLVER_SOLVABLE_PROVIDES)
 488                         POOL_DEBUG(SAT_DEBUG_RESULT, "- do not install a solvable %s\n", solver_select2str(solv, select, what));
 489                       else
 490                         POOL_DEBUG(SAT_DEBUG_RESULT, "- do not install %s\n", solver_select2str(solv, select, what));
 491                       break;
 492                     case SOLVER_ERASE:
 493                       if (select == SOLVER_SOLVABLE && !(solv->installed && pool->solvables[what].repo == solv->installed))
 494                         POOL_DEBUG(SAT_DEBUG_RESULT, "- do not forbid installation of %s\n", solvid2str(pool, what));
 495                       else if (select == SOLVER_SOLVABLE_PROVIDES)
 496                         POOL_DEBUG(SAT_DEBUG_RESULT, "- do not deinstall all solvables %s\n", solver_select2str(solv, select, what));
 497                       else
 498                         POOL_DEBUG(SAT_DEBUG_RESULT, "- do not deinstall %s\n", solver_select2str(solv, select, what));
 499                       break;
 500                     case SOLVER_UPDATE:
 501                       POOL_DEBUG(SAT_DEBUG_RESULT, "- do not install most recent version of %s\n", solver_select2str(solv, select, what));
 502                       break;
 503                     case SOLVER_LOCK:
 504                       POOL_DEBUG(SAT_DEBUG_RESULT, "- do not lock %s\n", solver_select2str(solv, select, what));
 505                       break;
 506                     default:
 507                       POOL_DEBUG(SAT_DEBUG_RESULT, "- do something different\n");
 508                       break;
 509                     }
 510                 }
 511               else if (p == SOLVER_SOLUTION_INFARCH)
 512                 {
 513                   s = pool->solvables + rp;
 514                   if (solv->installed && s->repo == solv->installed)
 515                     POOL_DEBUG(SAT_DEBUG_RESULT, "- keep %s despite the inferior architecture\n", solvable2str(pool, s));
 516                   else
 517                     POOL_DEBUG(SAT_DEBUG_RESULT, "- install %s despite the inferior architecture\n", solvable2str(pool, s));
 518                 }
 519               else if (p == SOLVER_SOLUTION_DISTUPGRADE)
 520                 {
 521                   s = pool->solvables + rp;
 522                   if (solv->installed && s->repo == solv->installed)
 523                     POOL_DEBUG(SAT_DEBUG_RESULT, "- keep obsolete %s\n", solvable2str(pool, s));
 524                   else
 525                     POOL_DEBUG(SAT_DEBUG_RESULT, "- install %s from excluded repository\n", solvable2str(pool, s));
 526                 }
 527               else
 528                 {
 529                   /* policy, replace p with rp */
 530                   s = pool->solvables + p;
 531                   sd = rp ? pool->solvables + rp : 0;
 532                   if (s == sd && solv->distupgrade)
 533                     {
 534                       POOL_DEBUG(SAT_DEBUG_RESULT, "- keep obsolete %s\n", solvable2str(pool, s));
 535                     }
 536                   else if (sd)
 537                     {
 538                       int gotone = 0;
 539                       if (!solv->allowdowngrade && evrcmp(pool, s->evr, sd->evr, EVRCMP_MATCH_RELEASE) > 0)
 540                         {
 541                           POOL_DEBUG(SAT_DEBUG_RESULT, "- allow downgrade of %s to %s\n", solvable2str(pool, s), solvable2str(pool, sd));
 542                           gotone = 1;
 543                         }
 544                       if (!solv->allowarchchange && s->name == sd->name && s->arch != sd->arch && policy_illegal_archchange(solv, s, sd))
 545                         {
 546                           POOL_DEBUG(SAT_DEBUG_RESULT, "- allow architecture change of %s to %s\n", solvable2str(pool, s), solvable2str(pool, sd));
 547                           gotone = 1;
 548                         }
 549                       if (!solv->allowvendorchange && s->name == sd->name && s->vendor != sd->vendor && policy_illegal_vendorchange(solv, s, sd))
 550                         {
 551                           if (sd->vendor)
 552                             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));
 553                           else
 554                             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));
 555                           gotone = 1;
 556                         }
 557                       if (!gotone)
 558                         POOL_DEBUG(SAT_DEBUG_RESULT, "- allow replacement of %s with %s\n", solvable2str(pool, s), solvable2str(pool, sd));
 559                     }
 560                   else
 561                     {
 562                       POOL_DEBUG(SAT_DEBUG_RESULT, "- allow deinstallation of %s\n", solvable2str(pool, s));
 563                     }
 564
 565                 }
 566             }
 567           POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 568         }
 569     }
 570 }
 571
 572 void
 573 solver_printtrivial(Solver *solv)
 574 {
 575   Pool *pool = solv->pool;
 576   Queue in, out;
 577   Id p;
 578   const char *n;
 579   Solvable *s;
 580   int i;
 581
 582   queue_init(&in);
 583   for (p = 1, s = pool->solvables + p; p < solv->pool->nsolvables; p++, s++)
 584     {
 585       n = id2str(pool, s->name);
 586       if (strncmp(n, "patch:", 6) != 0 && strncmp(n, "pattern:", 8) != 0)
 587         continue;
 588       queue_push(&in, p);
 589     }
 590   if (!in.count)
 591     {
 592       queue_free(&in);
 593       return;
 594     }
 595   queue_init(&out);
 596   solver_trivial_installable(solv, &in, &out);
 597   POOL_DEBUG(SAT_DEBUG_RESULT, "trivial installable status:\n");
 598   for (i = 0; i < in.count; i++)
 599     POOL_DEBUG(SAT_DEBUG_RESULT, "  %s: %d\n", solvid2str(pool, in.elements[i]), out.elements[i]);
 600   POOL_DEBUG(SAT_DEBUG_RESULT, "\n");
 601   queue_free(&in);
 602   queue_free(&out);
 603 }
 604
 605 const char *
 606 solver_select2str(Solver *solv, Id select, Id what)
 607 {
 608   Pool *pool = solv->pool;
 609   const char *s;
 610   char *b;
 611   if (select == SOLVER_SOLVABLE)
 612     return solvid2str(pool, what);
 613   if (select == SOLVER_SOLVABLE_NAME)
 614     return dep2str(pool, what);
 615   if (select == SOLVER_SOLVABLE_PROVIDES)
 616     {
 617       s = dep2str(pool, what);
 618       b = pool_alloctmpspace(pool, 11 + strlen(s));
 619       sprintf(b, "providing %s", s);
 620       return b;
 621     }
 622   if (select == SOLVER_SOLVABLE_ONE_OF)
 623     {
 624       Id p;
 625       char *b2;
 626       b = "";
 627       while ((p = pool->whatprovidesdata[what++]) != 0)
 628         {
 629           s = solvid2str(pool, p);
 630           b2 = pool_alloctmpspace(pool, strlen(b) + strlen(s) + 3);
 631           sprintf(b2, "%s, %s", b, s);
 632           b = b2;
 633         }
 634       return *b ? b + 2 : "nothing";
 635     }
 636   return "unknown job select";
 637 }