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 "solver_private.h"
  22 #include "solverdebug.h"
  23 #include "bitmap.h"
  24 #include "pool.h"
  25 #include "poolarch.h"
  26 #include "util.h"
  27 #include "evr.h"
  28 #include "policy.h"
  29
  30
  31 void
  32 solver_printruleelement(Solver *solv, int type, Rule *r, Id v)
  33 {
  34   Pool *pool = solv->pool;
  35   Solvable *s;
  36   if (v < 0)
  37     {
  38       s = pool->solvables + -v;
  39       POOL_DEBUG(type, "    !%s [%d]", pool_solvable2str(pool, s), -v);
  40     }
  41   else
  42     {
  43       s = pool->solvables + v;
  44       POOL_DEBUG(type, "    %s [%d]", pool_solvable2str(pool, s), v);
  45     }
  46   if (pool->installed && s->repo == pool->installed)
  47     POOL_DEBUG(type, "I");
  48   if (r)
  49     {
  50       if (r->w1 == v)
  51         POOL_DEBUG(type, " (w1)");
  52       if (r->w2 == v)
  53         POOL_DEBUG(type, " (w2)");
  54     }
  55   if (solv->decisionmap[s - pool->solvables] > 0)
  56     POOL_DEBUG(type, " Install.level%d", solv->decisionmap[s - pool->solvables]);
  57   if (solv->decisionmap[s - pool->solvables] < 0)
  58     POOL_DEBUG(type, " Conflict.level%d", -solv->decisionmap[s - pool->solvables]);
  59   POOL_DEBUG(type, "\n");
  60 }
  61
  62
  63 /*
  64  * print rule
  65  */
  66
  67 void
  68 solver_printrule(Solver *solv, int type, Rule *r)
  69 {
  70   Pool *pool = solv->pool;
  71   int i;
  72   Id d, v;
  73
  74   if (r >= solv->rules && r < solv->rules + solv->nrules)   /* r is a solver rule */
  75     POOL_DEBUG(type, "Rule #%d:", (int)(r - solv->rules));
  76   else
  77     POOL_DEBUG(type, "Rule:");                 /* r is any rule */
  78   if (r->d < 0)
  79     POOL_DEBUG(type, " (disabled)");
  80   POOL_DEBUG(type, "\n");
  81   d = r->d < 0 ? -r->d - 1 : r->d;
  82   for (i = 0; ; i++)
  83     {
  84       if (i == 0)
  85           /* print direct literal */
  86         v = r->p;
  87       else if (!d)
  88         {
  89           if (i == 2)
  90             break;
  91           /* binary rule --> print w2 as second literal */
  92           v = r->w2;
  93         }
  94       else
  95           /* every other which is in d */
  96         v = solv->pool->whatprovidesdata[d + i - 1];
  97       if (v == ID_NULL)
  98         break;
  99       solver_printruleelement(solv, type, r, v);
 100     }
 101   POOL_DEBUG(type, "    next rules: %d %d\n", r->n1, r->n2);
 102 }
 103
 104 void
 105 solver_printruleclass(Solver *solv, int type, Rule *r)
 106 {
 107   Pool *pool = solv->pool;
 108   Id p = r - solv->rules;
 109   assert(p >= 0);
 110   if (p < solv->learntrules)
 111     if (MAPTST(&solv->weakrulemap, p))
 112       POOL_DEBUG(type, "WEAK ");
 113   if (solv->learntrules && p >= solv->learntrules)
 114     POOL_DEBUG(type, "LEARNT ");
 115   else if (p >= solv->bestrules && p < solv->bestrules_end)
 116     POOL_DEBUG(type, "BEST ");
 117   else if (p >= solv->choicerules && p < solv->choicerules_end)
 118     POOL_DEBUG(type, "CHOICE ");
 119   else if (p >= solv->infarchrules && p < solv->infarchrules_end)
 120     POOL_DEBUG(type, "INFARCH ");
 121   else if (p >= solv->duprules && p < solv->duprules_end)
 122     POOL_DEBUG(type, "DUP ");
 123   else if (p >= solv->jobrules && p < solv->jobrules_end)
 124     POOL_DEBUG(type, "JOB ");
 125   else if (p >= solv->updaterules && p < solv->updaterules_end)
 126     POOL_DEBUG(type, "UPDATE ");
 127   else if (p >= solv->featurerules && p < solv->featurerules_end)
 128     POOL_DEBUG(type, "FEATURE ");
 129   solver_printrule(solv, type, r);
 130 }
 131
 132 void
 133 solver_printproblem(Solver *solv, Id v)
 134 {
 135   Pool *pool = solv->pool;
 136   int i;
 137   Rule *r;
 138   Id *jp;
 139
 140   if (v > 0)
 141     solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, solv->rules + v);
 142   else
 143     {
 144       v = -(v + 1);
 145       POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "JOB %d\n", v);
 146       jp = solv->ruletojob.elements;
 147       for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++, jp++)
 148         if (*jp == v)
 149           {
 150             POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "- ");
 151             solver_printrule(solv, SOLV_DEBUG_SOLUTIONS, r);
 152           }
 153       POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "ENDJOB\n");
 154     }
 155 }
 156
 157 void
 158 solver_printwatches(Solver *solv, int type)
 159 {
 160   Pool *pool = solv->pool;
 161   int counter;
 162
 163   POOL_DEBUG(type, "Watches: \n");
 164   for (counter = -(pool->nsolvables - 1); counter < pool->nsolvables; counter++)
 165     POOL_DEBUG(type, "    solvable [%d] -- rule [%d]\n", counter, solv->watches[counter + pool->nsolvables]);
 166 }
 167
 168 void
 169 solver_printdecisionq(Solver *solv, int type)
 170 {
 171   Pool *pool = solv->pool;
 172   int i;
 173   Id p, why;
 174
 175   POOL_DEBUG(type, "Decisions:\n");
 176   for (i = 0; i < solv->decisionq.count; i++)
 177     {
 178       p = solv->decisionq.elements[i];
 179       if (p > 0)
 180         POOL_DEBUG(type, "%d %d install  %s, ", i, solv->decisionmap[p], pool_solvid2str(pool, p));
 181       else
 182         POOL_DEBUG(type, "%d %d conflict %s, ", i, -solv->decisionmap[-p], pool_solvid2str(pool, -p));
 183       why = solv->decisionq_why.elements[i];
 184       if (why > 0)
 185         {
 186           POOL_DEBUG(type, "forced by ");
 187           solver_printruleclass(solv, type, solv->rules + why);
 188         }
 189       else if (why < 0)
 190         {
 191           POOL_DEBUG(type, "chosen from ");
 192           solver_printruleclass(solv, type, solv->rules - why);
 193         }
 194       else
 195         POOL_DEBUG(type, "picked for some unknown reason.\n");
 196     }
 197 }
 198
 199 /*
 200  * printdecisions
 201  */
 202
 203 void
 204 solver_printdecisions(Solver *solv)
 205 {
 206   Pool *pool = solv->pool;
 207   Repo *installed = solv->installed;
 208   Transaction *trans = solver_create_transaction(solv);
 209   Id p, type;
 210   int i, j;
 211   Solvable *s;
 212   Queue iq;
 213   Queue recommendations;
 214   Queue suggestions;
 215   Queue orphaned;
 216
 217   POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 218   POOL_DEBUG(SOLV_DEBUG_RESULT, "transaction:\n");
 219
 220   queue_init(&iq);
 221   for (i = 0; i < trans->steps.count; i++)
 222     {
 223       p = trans->steps.elements[i];
 224       s = pool->solvables + p;
 225       type = transaction_type(trans, p, SOLVER_TRANSACTION_SHOW_ACTIVE|SOLVER_TRANSACTION_SHOW_ALL|SOLVER_TRANSACTION_SHOW_OBSOLETES|SOLVER_TRANSACTION_SHOW_MULTIINSTALL);
 226       switch(type)
 227         {
 228         case SOLVER_TRANSACTION_MULTIINSTALL:
 229           POOL_DEBUG(SOLV_DEBUG_RESULT, "  multi install %s", pool_solvable2str(pool, s));
 230           break;
 231         case SOLVER_TRANSACTION_MULTIREINSTALL:
 232           POOL_DEBUG(SOLV_DEBUG_RESULT, "  multi reinstall %s", pool_solvable2str(pool, s));
 233           break;
 234         case SOLVER_TRANSACTION_INSTALL:
 235           POOL_DEBUG(SOLV_DEBUG_RESULT, "  install   %s", pool_solvable2str(pool, s));
 236           break;
 237         case SOLVER_TRANSACTION_REINSTALL:
 238           POOL_DEBUG(SOLV_DEBUG_RESULT, "  reinstall %s", pool_solvable2str(pool, s));
 239           break;
 240         case SOLVER_TRANSACTION_DOWNGRADE:
 241           POOL_DEBUG(SOLV_DEBUG_RESULT, "  downgrade %s", pool_solvable2str(pool, s));
 242           break;
 243         case SOLVER_TRANSACTION_CHANGE:
 244           POOL_DEBUG(SOLV_DEBUG_RESULT, "  change    %s", pool_solvable2str(pool, s));
 245           break;
 246         case SOLVER_TRANSACTION_UPGRADE:
 247         case SOLVER_TRANSACTION_OBSOLETES:
 248           POOL_DEBUG(SOLV_DEBUG_RESULT, "  upgrade   %s", pool_solvable2str(pool, s));
 249           break;
 250         case SOLVER_TRANSACTION_ERASE:
 251           POOL_DEBUG(SOLV_DEBUG_RESULT, "  erase     %s", pool_solvable2str(pool, s));
 252           break;
 253         default:
 254           break;
 255         }
 256       switch(type)
 257         {
 258         case SOLVER_TRANSACTION_INSTALL:
 259         case SOLVER_TRANSACTION_ERASE:
 260         case SOLVER_TRANSACTION_MULTIINSTALL:
 261         case SOLVER_TRANSACTION_MULTIREINSTALL:
 262           POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 263           break;
 264         case SOLVER_TRANSACTION_REINSTALL:
 265         case SOLVER_TRANSACTION_DOWNGRADE:
 266         case SOLVER_TRANSACTION_CHANGE:
 267         case SOLVER_TRANSACTION_UPGRADE:
 268         case SOLVER_TRANSACTION_OBSOLETES:
 269           transaction_all_obs_pkgs(trans, p, &iq);
 270           if (iq.count)
 271             {
 272               POOL_DEBUG(SOLV_DEBUG_RESULT, "  (obsoletes");
 273               for (j = 0; j < iq.count; j++)
 274                 POOL_DEBUG(SOLV_DEBUG_RESULT, " %s", pool_solvid2str(pool, iq.elements[j]));
 275               POOL_DEBUG(SOLV_DEBUG_RESULT, ")");
 276             }
 277           POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 278           break;
 279         default:
 280           break;
 281         }
 282     }
 283   queue_free(&iq);
 284
 285   POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 286
 287   queue_init(&recommendations);
 288   queue_init(&suggestions);
 289   queue_init(&orphaned);
 290   solver_get_recommendations(solv, &recommendations, &suggestions, 0);
 291   solver_get_orphaned(solv, &orphaned);
 292   if (recommendations.count)
 293     {
 294       POOL_DEBUG(SOLV_DEBUG_RESULT, "recommended packages:\n");
 295       for (i = 0; i < recommendations.count; i++)
 296         {
 297           s = pool->solvables + recommendations.elements[i];
 298           if (solv->decisionmap[recommendations.elements[i]] > 0)
 299             {
 300               if (installed && s->repo == installed)
 301                 POOL_DEBUG(SOLV_DEBUG_RESULT, "  %s (installed)\n", pool_solvable2str(pool, s));
 302               else
 303                 POOL_DEBUG(SOLV_DEBUG_RESULT, "  %s (selected)\n", pool_solvable2str(pool, s));
 304             }
 305           else
 306             POOL_DEBUG(SOLV_DEBUG_RESULT, "  %s\n", pool_solvable2str(pool, s));
 307         }
 308       POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 309     }
 310
 311   if (suggestions.count)
 312     {
 313       POOL_DEBUG(SOLV_DEBUG_RESULT, "suggested packages:\n");
 314       for (i = 0; i < suggestions.count; i++)
 315         {
 316           s = pool->solvables + suggestions.elements[i];
 317           if (solv->decisionmap[suggestions.elements[i]] > 0)
 318             {
 319               if (installed && s->repo == installed)
 320                 POOL_DEBUG(SOLV_DEBUG_RESULT, "  %s (installed)\n", pool_solvable2str(pool, s));
 321               else
 322                 POOL_DEBUG(SOLV_DEBUG_RESULT, "  %s (selected)\n", pool_solvable2str(pool, s));
 323             }
 324           else
 325             POOL_DEBUG(SOLV_DEBUG_RESULT, "  %s\n", pool_solvable2str(pool, s));
 326         }
 327       POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 328     }
 329   if (orphaned.count)
 330     {
 331       POOL_DEBUG(SOLV_DEBUG_RESULT, "orphaned packages:\n");
 332       for (i = 0; i < orphaned.count; i++)
 333         {
 334           s = pool->solvables + orphaned.elements[i];
 335           if (solv->decisionmap[solv->orphaned.elements[i]] > 0)
 336             POOL_DEBUG(SOLV_DEBUG_RESULT, "  %s (kept)\n", pool_solvable2str(pool, s));
 337           else
 338             POOL_DEBUG(SOLV_DEBUG_RESULT, "  %s (erased)\n", pool_solvable2str(pool, s));
 339         }
 340       POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 341     }
 342   queue_free(&recommendations);
 343   queue_free(&suggestions);
 344   queue_free(&orphaned);
 345   transaction_free(trans);
 346 }
 347
 348 static inline
 349 const char *id2strnone(Pool *pool, Id id)
 350 {
 351   return !id || id == 1 ? "(none)" : pool_id2str(pool, id);
 352 }
 353
 354 void
 355 transaction_print(Transaction *trans)
 356 {
 357   Pool *pool = trans->pool;
 358   Queue classes, pkgs;
 359   int i, j, mode, l, linel;
 360   char line[76];
 361   const char *n;
 362
 363   queue_init(&classes);
 364   queue_init(&pkgs);
 365   mode = SOLVER_TRANSACTION_SHOW_OBSOLETES | SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
 366   transaction_classify(trans, mode, &classes);
 367   for (i = 0; i < classes.count; i += 4)
 368     {
 369       Id class = classes.elements[i];
 370       Id cnt = classes.elements[i + 1];
 371       switch(class)
 372         {
 373         case SOLVER_TRANSACTION_ERASE:
 374           POOL_DEBUG(SOLV_DEBUG_RESULT, "%d erased packages:\n", cnt);
 375           break;
 376         case SOLVER_TRANSACTION_INSTALL:
 377           POOL_DEBUG(SOLV_DEBUG_RESULT, "%d installed packages:\n", cnt);
 378           break;
 379         case SOLVER_TRANSACTION_REINSTALLED:
 380           POOL_DEBUG(SOLV_DEBUG_RESULT, "%d reinstalled packages:\n", cnt);
 381           break;
 382         case SOLVER_TRANSACTION_DOWNGRADED:
 383           POOL_DEBUG(SOLV_DEBUG_RESULT, "%d downgraded packages:\n", cnt);
 384           break;
 385         case SOLVER_TRANSACTION_CHANGED:
 386           POOL_DEBUG(SOLV_DEBUG_RESULT, "%d changed packages:\n", cnt);
 387           break;
 388         case SOLVER_TRANSACTION_UPGRADED:
 389           POOL_DEBUG(SOLV_DEBUG_RESULT, "%d upgraded packages:\n", cnt);
 390           break;
 391         case SOLVER_TRANSACTION_VENDORCHANGE:
 392           POOL_DEBUG(SOLV_DEBUG_RESULT, "%d vendor changes from '%s' to '%s':\n", cnt, id2strnone(pool, classes.elements[i + 2]), id2strnone(pool, classes.elements[i + 3]));
 393           break;
 394         case SOLVER_TRANSACTION_ARCHCHANGE:
 395           POOL_DEBUG(SOLV_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]));
 396           break;
 397         default:
 398           class = SOLVER_TRANSACTION_IGNORE;
 399           break;
 400         }
 401       if (class == SOLVER_TRANSACTION_IGNORE)
 402         continue;
 403       transaction_classify_pkgs(trans, mode, class, classes.elements[i + 2], classes.elements[i + 3], &pkgs);
 404       *line = 0;
 405       linel = 0;
 406       for (j = 0; j < pkgs.count; j++)
 407         {
 408           Id p = pkgs.elements[j];
 409           Solvable *s = pool->solvables + p;
 410           Solvable *s2;
 411
 412           switch(class)
 413             {
 414             case SOLVER_TRANSACTION_DOWNGRADED:
 415             case SOLVER_TRANSACTION_UPGRADED:
 416               s2 = pool->solvables + transaction_obs_pkg(trans, p);
 417               POOL_DEBUG(SOLV_DEBUG_RESULT, "  - %s -> %s\n", pool_solvable2str(pool, s), pool_solvable2str(pool, s2));
 418               break;
 419             case SOLVER_TRANSACTION_VENDORCHANGE:
 420             case SOLVER_TRANSACTION_ARCHCHANGE:
 421               n = pool_id2str(pool, s->name);
 422               l = strlen(n);
 423               if (l + linel > sizeof(line) - 3)
 424                 {
 425                   if (*line)
 426                     POOL_DEBUG(SOLV_DEBUG_RESULT, "    %s\n", line);
 427                   *line = 0;
 428                   linel = 0;
 429                 }
 430               if (l + linel > sizeof(line) - 3)
 431                 POOL_DEBUG(SOLV_DEBUG_RESULT, "    %s\n", n);
 432               else
 433                 {
 434                   if (*line)
 435                     {
 436                       strcpy(line + linel, ", ");
 437                       linel += 2;
 438                     }
 439                   strcpy(line + linel, n);
 440                   linel += l;
 441                 }
 442               break;
 443             default:
 444               POOL_DEBUG(SOLV_DEBUG_RESULT, "  - %s\n", pool_solvable2str(pool, s));
 445               break;
 446             }
 447         }
 448       if (*line)
 449         POOL_DEBUG(SOLV_DEBUG_RESULT, "    %s\n", line);
 450       POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 451     }
 452   queue_free(&classes);
 453   queue_free(&pkgs);
 454 }
 455
 456 void
 457 solver_printproblemruleinfo(Solver *solv, Id probr)
 458 {
 459   Pool *pool = solv->pool;
 460   Id dep, source, target;
 461   SolverRuleinfo type = solver_ruleinfo(solv, probr, &source, &target, &dep);
 462
 463   POOL_DEBUG(SOLV_DEBUG_RESULT, "%s\n", solver_problemruleinfo2str(solv, type, source, target, dep));
 464 }
 465
 466 void
 467 solver_printprobleminfo(Solver *solv, Id problem)
 468 {
 469   solver_printproblemruleinfo(solv, solver_findproblemrule(solv, problem));
 470 }
 471
 472 void
 473 solver_printcompleteprobleminfo(Solver *solv, Id problem)
 474 {
 475   Queue q;
 476   Id probr;
 477   int i, nobad = 0;
 478
 479   queue_init(&q);
 480   solver_findallproblemrules(solv, problem, &q);
 481   for (i = 0; i < q.count; i++)
 482     {
 483       probr = q.elements[i];
 484       if (!(probr >= solv->updaterules && probr < solv->updaterules_end) && !(probr >= solv->jobrules && probr < solv->jobrules_end))
 485         {
 486           nobad = 1;
 487           break;
 488         }
 489     }
 490   for (i = 0; i < q.count; i++)
 491     {
 492       probr = q.elements[i];
 493       if (nobad && ((probr >= solv->updaterules && probr < solv->updaterules_end) || (probr >= solv->jobrules && probr < solv->jobrules_end)))
 494         continue;
 495       solver_printproblemruleinfo(solv, probr);
 496     }
 497   queue_free(&q);
 498 }
 499
 500 static int illegals[] = {
 501   POLICY_ILLEGAL_DOWNGRADE,
 502   POLICY_ILLEGAL_NAMECHANGE,
 503   POLICY_ILLEGAL_ARCHCHANGE,
 504   POLICY_ILLEGAL_VENDORCHANGE,
 505   0
 506 };
 507
 508 void
 509 solver_printsolution(Solver *solv, Id problem, Id solution)
 510 {
 511   Pool *pool = solv->pool;
 512   Id p, rp, element;
 513
 514   element = 0;
 515   while ((element = solver_next_solutionelement(solv, problem, solution, element, &p, &rp)) != 0)
 516     {
 517       if (p > 0 && rp > 0)
 518         {
 519           /* for replacements we want to know why it was illegal */
 520           Solvable *s = pool->solvables + p, *rs = pool->solvables + rp;
 521           int illegal = policy_is_illegal(solv, s, rs, 0);
 522           if (illegal)
 523             {
 524               int i;
 525               for (i = 0; illegals[i]; i++)
 526                 if ((illegal & illegals[i]) != 0)
 527                   {
 528                     POOL_DEBUG(SOLV_DEBUG_RESULT, "  - allow %s\n", policy_illegal2str(solv, illegals[i], s, rs));
 529                     illegal ^= illegals[i];
 530                   }
 531               if (!illegal)
 532                 continue;
 533             }
 534         }
 535       POOL_DEBUG(SOLV_DEBUG_RESULT, "  - %s\n", solver_solutionelement2str(solv, p, rp));
 536     }
 537 }
 538
 539 void
 540 solver_printallsolutions(Solver *solv)
 541 {
 542   Pool *pool = solv->pool;
 543   int pcnt;
 544   Id problem, solution;
 545
 546   POOL_DEBUG(SOLV_DEBUG_RESULT, "Encountered problems! Here are the solutions:\n\n");
 547   pcnt = 0;
 548   problem = 0;
 549   while ((problem = solver_next_problem(solv, problem)) != 0)
 550     {
 551       pcnt++;
 552       POOL_DEBUG(SOLV_DEBUG_RESULT, "Problem %d:\n", pcnt);
 553       POOL_DEBUG(SOLV_DEBUG_RESULT, "====================================\n");
 554 #if 1
 555       solver_printprobleminfo(solv, problem);
 556 #else
 557       solver_printcompleteprobleminfo(solv, problem);
 558 #endif
 559       POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 560       solution = 0;
 561       while ((solution = solver_next_solution(solv, problem, solution)) != 0)
 562         {
 563           solver_printsolution(solv, problem, solution);
 564           POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 565         }
 566     }
 567 }
 568
 569 void
 570 solver_printtrivial(Solver *solv)
 571 {
 572   Pool *pool = solv->pool;
 573   Queue in, out;
 574   Id p;
 575   const char *n;
 576   Solvable *s;
 577   int i;
 578
 579   queue_init(&in);
 580   for (p = 1, s = pool->solvables + p; p < solv->pool->nsolvables; p++, s++)
 581     {
 582       n = pool_id2str(pool, s->name);
 583       if (strncmp(n, "patch:", 6) != 0 && strncmp(n, "pattern:", 8) != 0)
 584         continue;
 585       queue_push(&in, p);
 586     }
 587   if (!in.count)
 588     {
 589       queue_free(&in);
 590       return;
 591     }
 592   queue_init(&out);
 593   solver_trivial_installable(solv, &in, &out);
 594   POOL_DEBUG(SOLV_DEBUG_RESULT, "trivial installable status:\n");
 595   for (i = 0; i < in.count; i++)
 596     POOL_DEBUG(SOLV_DEBUG_RESULT, "  %s: %d\n", pool_solvid2str(pool, in.elements[i]), out.elements[i]);
 597   POOL_DEBUG(SOLV_DEBUG_RESULT, "\n");
 598   queue_free(&in);
 599   queue_free(&out);
 600 }
 601