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