src/solver.c

   1 /*
   2  * Copyright (c) 2007-2008, Novell Inc.
   3  *
   4  * This program is licensed under the BSD license, read LICENSE.BSD
   5  * for further information
   6  */
   7
   8 /*
   9  * solver.c
  10  *
  11  * SAT based dependency 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 "bitmap.h"
  23 #include "pool.h"
  24 #include "util.h"
  25 #include "policy.h"
  26 #include "poolarch.h"
  27 #include "solverdebug.h"
  28 #include "cplxdeps.h"
  29 #include "linkedpkg.h"
  30
  31 #define RULES_BLOCK 63
  32
  33
  34 /************************************************************************/
  35
  36 /*
  37  * enable/disable learnt rules
  38  *
  39  * we have enabled or disabled some of our rules. We now reenable all
  40  * of our learnt rules except the ones that were learnt from rules that
  41  * are now disabled.
  42  */
  43 static void
  44 enabledisablelearntrules(Solver *solv)
  45 {
  46   Pool *pool = solv->pool;
  47   Rule *r;
  48   Id why, *whyp;
  49   int i;
  50
  51   POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "enabledisablelearntrules called\n");
  52   for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
  53     {
  54       whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules];
  55       while ((why = *whyp++) != 0)
  56         {
  57           assert(why > 0 && why < i);
  58           if (solv->rules[why].d < 0)
  59             break;
  60         }
  61       /* why != 0: we found a disabled rule, disable the learnt rule */
  62       if (why && r->d >= 0)
  63         {
  64           IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
  65             {
  66               POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "disabling ");
  67               solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
  68             }
  69           solver_disablerule(solv, r);
  70         }
  71       else if (!why && r->d < 0)
  72         {
  73           IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
  74             {
  75               POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "re-enabling ");
  76               solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
  77             }
  78           solver_enablerule(solv, r);
  79         }
  80     }
  81 }
  82
  83
  84 /*
  85  * make assertion rules into decisions
  86  *
  87  * Go through rules and add direct assertions to the decisionqueue.
  88  * If we find a conflict, disable rules and add them to problem queue.
  89  */
  90
  91 static int
  92 makeruledecisions(Solver *solv, int disablerules)
  93 {
  94   Pool *pool = solv->pool;
  95   int i, ri, ii, ori;
  96   Rule *r, *rr;
  97   Id v, vv;
  98   int decisionstart;
  99   int record_proof = 1;
 100   int oldproblemcount;
 101   int havedisabled = 0;
 102   int doautouninstall;
 103
 104   /* The system solvable is always installed first */
 105   assert(solv->decisionq.count == 0);
 106   queue_push(&solv->decisionq, SYSTEMSOLVABLE);
 107   queue_push(&solv->decisionq_why, 0);
 108   queue_push2(&solv->decisionq_reason, 0, 0);
 109   solv->decisionmap[SYSTEMSOLVABLE] = 1;        /* installed at level '1' */
 110
 111   decisionstart = solv->decisionq.count;
 112   for (;;)
 113     {
 114       /* if we needed to re-run, back up decisions to decisionstart */
 115       while (solv->decisionq.count > decisionstart)
 116         {
 117           v = solv->decisionq.elements[--solv->decisionq.count];
 118           --solv->decisionq_why.count;
 119           vv = v > 0 ? v : -v;
 120           solv->decisionmap[vv] = 0;
 121         }
 122
 123       /* note that the ruleassertions queue is ordered */
 124       for (ii = 0; ii < solv->ruleassertions.count; ii++)
 125         {
 126           ri = solv->ruleassertions.elements[ii];
 127           r = solv->rules + ri;
 128
 129           if (havedisabled && ri >= solv->learntrules)
 130             {
 131               /* just started with learnt rule assertions. If we have disabled
 132                * some rules, adapt the learnt rule status */
 133               enabledisablelearntrules(solv);
 134               havedisabled = 0;
 135             }
 136
 137           if (r->d < 0 || !r->p || r->w2)       /* disabled, dummy or no assertion */
 138             continue;
 139
 140           /* do weak rules in phase 2 */
 141           if (ri < solv->learntrules && solv->weakrulemap.size && MAPTST(&solv->weakrulemap, ri))
 142             continue;
 143
 144           v = r->p;
 145           vv = v > 0 ? v : -v;
 146
 147           if (!solv->decisionmap[vv])          /* if not yet decided */
 148             {
 149               queue_push(&solv->decisionq, v);
 150               queue_push(&solv->decisionq_why, ri);
 151               solv->decisionmap[vv] = v > 0 ? 1 : -1;
 152               IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 153                 {
 154                   Solvable *s = solv->pool->solvables + vv;
 155                   if (v < 0)
 156                     POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", pool_solvable2str(solv->pool, s));
 157                   else
 158                     POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing  %s (assertion)\n", pool_solvable2str(solv->pool, s));
 159                 }
 160               continue;
 161             }
 162
 163           /* check against previous decision: is there a conflict? */
 164           if (v > 0 && solv->decisionmap[vv] > 0)    /* ok to install */
 165             continue;
 166           if (v < 0 && solv->decisionmap[vv] < 0)    /* ok to remove */
 167             continue;
 168
 169           /*
 170            * found a conflict!
 171            *
 172            * The rule (r) we're currently processing says something
 173            * different (v = r->p) than a previous decision (decisionmap[abs(v)])
 174            * on this literal
 175            */
 176
 177           if (ri >= solv->learntrules)
 178             {
 179               /* conflict with a learnt rule */
 180               /* can happen when packages cannot be installed for multiple reasons. */
 181               /* we disable the learnt rule in this case */
 182               /* (XXX: we should really do something like analyze_unsolvable_rule here!) */
 183               solver_disablerule(solv, r);
 184               continue;
 185             }
 186
 187           POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ASSERTION ----------------------\n");
 188           assert(ri >= solv->pkgrules_end);     /* must not have a conflict in the pkg rules! */
 189
 190           /*
 191            * find the decision which is the "opposite" of the rule
 192            */
 193           for (i = 0; i < solv->decisionq.count; i++)
 194             if (solv->decisionq.elements[i] == -v)
 195               break;
 196           assert(i < solv->decisionq.count);         /* assert that we found it */
 197           if (v == -SYSTEMSOLVABLE)
 198             ori = 0;
 199           else
 200             {
 201               ori = solv->decisionq_why.elements[i];            /* the conflicting rule */
 202               assert(ori > 0);
 203             }
 204
 205           /*
 206            * record the problem
 207            */
 208           doautouninstall = 0;
 209           oldproblemcount = solv->problems.count;
 210           queue_push(&solv->problems, 0);                       /* start problem */
 211           if (ori < solv->pkgrules_end)
 212             {
 213               /* easy: conflict with system solvable or pkg rule */
 214               assert(v > 0 || v == -SYSTEMSOLVABLE);
 215               IF_POOLDEBUG (SOLV_DEBUG_UNSOLVABLE)
 216                 {
 217                   if (ori)
 218                     POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with pkg rule, disabling rule #%d\n", ri);
 219                   else
 220                     POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with system solvable, disabling rule #%d\n", ri);
 221                   solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + ri);
 222                   if (ori)
 223                     solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + ori);
 224                 }
 225               solver_recordproblem(solv, ri);
 226               if (ri >= solv->featurerules && ri < solv->updaterules_end)
 227                 doautouninstall = 1;
 228             }
 229           else
 230             {
 231               POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflicting update/job assertions over literal %d\n", vv);
 232               /*
 233                * push all of our rules (can only be feature or job rules)
 234                * asserting this literal on the problem stack
 235                */
 236               for (i = solv->pkgrules_end, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
 237                 {
 238                   if (rr->d < 0                          /* disabled */
 239                       || rr->w2)                         /*  or no assertion */
 240                     continue;
 241                   if (rr->p != vv                        /* not affecting the literal */
 242                       && rr->p != -vv)
 243                     continue;
 244                   if (solv->weakrulemap.size && MAPTST(&solv->weakrulemap, i))     /* weak: silently ignore */
 245                     continue;
 246
 247                   POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, " - disabling rule #%d\n", i);
 248                   solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + i);
 249                   solver_recordproblem(solv, i);
 250                   if (i >= solv->featurerules && i < solv->updaterules_end)
 251                     doautouninstall = 1;
 252                 }
 253             }
 254           queue_push(&solv->problems, 0);                       /* finish problem */
 255
 256           /* try autouninstall if requested */
 257           if (doautouninstall)
 258             {
 259               if (solv->allowuninstall || solv->allowuninstall_all || solv->allowuninstallmap.size)
 260                 if (solver_autouninstall(solv, oldproblemcount) != 0)
 261                   {
 262                     solv->problems.count = oldproblemcount;
 263                     havedisabled = 1;
 264                     break;      /* start over */
 265                   }
 266             }
 267
 268           /* record the proof if requested */
 269           if (record_proof)
 270             {
 271               solv->problems.elements[oldproblemcount] = solv->learnt_pool.count;
 272               queue_push(&solv->learnt_pool, ri);
 273               if (ori)
 274                 queue_push(&solv->learnt_pool, ori);
 275               queue_push(&solv->learnt_pool, 0);
 276             }
 277
 278           if (!disablerules)
 279             {
 280               POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
 281               return -1;
 282             }
 283           /* disable all problem rules */
 284           solver_disableproblemset(solv, oldproblemcount);
 285           havedisabled = 1;
 286           break;        /* start over */
 287         }
 288       if (ii < solv->ruleassertions.count)
 289         continue;
 290
 291       /*
 292        * phase 2: now do the weak assertions
 293        */
 294       if (!solv->weakrulemap.size)
 295         break;                          /* no weak rules, no phase 2 */
 296       for (ii = 0; ii < solv->ruleassertions.count; ii++)
 297         {
 298           ri = solv->ruleassertions.elements[ii];
 299           r = solv->rules + ri;
 300           if (r->d < 0 || r->w2)                         /* disabled or no assertion */
 301             continue;
 302           if (ri >= solv->learntrules || !MAPTST(&solv->weakrulemap, ri))       /* skip non-weak */
 303             continue;
 304           v = r->p;
 305           vv = v > 0 ? v : -v;
 306
 307           if (!solv->decisionmap[vv])          /* if not yet decided */
 308             {
 309               queue_push(&solv->decisionq, v);
 310               queue_push(&solv->decisionq_why, r - solv->rules);
 311               solv->decisionmap[vv] = v > 0 ? 1 : -1;
 312               IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 313                 {
 314                   Solvable *s = solv->pool->solvables + vv;
 315                   if (v < 0)
 316                     POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
 317                   else
 318                     POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing  %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
 319                 }
 320               continue;
 321             }
 322           /* check against previous decision: is there a conflict? */
 323           if (v > 0 && solv->decisionmap[vv] > 0)
 324             continue;
 325           if (v < 0 && solv->decisionmap[vv] < 0)
 326             continue;
 327
 328           POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "assertion conflict, but I am weak, disabling ");
 329           solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
 330           solver_fixproblem(solv, ri);
 331           havedisabled = 1;
 332           break;        /* start over */
 333         }
 334       if (ii == solv->ruleassertions.count)
 335         break;  /* finished! */
 336     }
 337   return 1;             /* the new level */
 338 }
 339
 340
 341 /********************************************************************/
 342 /* watches */
 343
 344
 345 /*-------------------------------------------------------------------
 346  * makewatches
 347  *
 348  * initial setup for all watches
 349  */
 350
 351 static void
 352 makewatches(Solver *solv)
 353 {
 354   Rule *r;
 355   int i;
 356   int nsolvables = solv->pool->nsolvables;
 357
 358   solv_free(solv->watches);
 359   /* lower half for removals, upper half for installs */
 360   solv->watches = solv_calloc(2 * nsolvables, sizeof(Id));
 361   for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
 362     {
 363       if (!r->w2)               /* assertions do not need watches */
 364         continue;
 365
 366       /* see addwatches_rule(solv, r) */
 367       r->n1 = solv->watches[nsolvables + r->w1];
 368       solv->watches[nsolvables + r->w1] = r - solv->rules;
 369
 370       r->n2 = solv->watches[nsolvables + r->w2];
 371       solv->watches[nsolvables + r->w2] = r - solv->rules;
 372     }
 373 }
 374
 375
 376 /*-------------------------------------------------------------------
 377  *
 378  * add watches (for a new learned rule)
 379  * sets up watches for a single rule
 380  *
 381  * see also makewatches() above.
 382  */
 383
 384 static inline void
 385 addwatches_rule(Solver *solv, Rule *r)
 386 {
 387   int nsolvables = solv->pool->nsolvables;
 388
 389   r->n1 = solv->watches[nsolvables + r->w1];
 390   solv->watches[nsolvables + r->w1] = r - solv->rules;
 391
 392   r->n2 = solv->watches[nsolvables + r->w2];
 393   solv->watches[nsolvables + r->w2] = r - solv->rules;
 394 }
 395
 396
 397 /********************************************************************/
 398 /*
 399  * rule propagation
 400  */
 401
 402
 403 /* shortcuts to check if a literal (positive or negative) assignment
 404  * evaluates to 'true' or 'false'
 405  */
 406 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
 407 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
 408 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
 409
 410 /*-------------------------------------------------------------------
 411  *
 412  * propagate
 413  *
 414  * make decision and propagate to all rules
 415  *
 416  * Evaluate each term affected by the decision (linked through watches).
 417  * If we find unit rules we make new decisions based on them.
 418  *
 419  * return : 0 = everything is OK
 420  *          rule = conflict found in this rule
 421  */
 422
 423 static Rule *
 424 propagate(Solver *solv, int level)
 425 {
 426   Pool *pool = solv->pool;
 427   Id *rp, *next_rp;           /* rule pointer, next rule pointer in linked list */
 428   Rule *r;                    /* rule */
 429   Id p, pkg, other_watch;
 430   Id *dp;
 431   Id *decisionmap = solv->decisionmap;
 432   Id *watches = solv->watches + pool->nsolvables;   /* place ptr in middle */
 433
 434   POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate level %d -----\n", level);
 435
 436   /* foreach non-propagated decision */
 437   while (solv->propagate_index < solv->decisionq.count)
 438     {
 439       /*
 440        * 'pkg' was just decided
 441        * negate because our watches trigger if literal goes FALSE
 442        */
 443       pkg = -solv->decisionq.elements[solv->propagate_index++];
 444
 445       IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 446         {
 447           POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagate decision %d:", -pkg);
 448           solver_printruleelement(solv, SOLV_DEBUG_PROPAGATE, 0, -pkg);
 449         }
 450
 451       /* foreach rule where 'pkg' is now FALSE */
 452       for (rp = watches + pkg; *rp; rp = next_rp)
 453         {
 454           r = solv->rules + *rp;
 455           if (r->d < 0)
 456             {
 457               /* rule is disabled, goto next */
 458               if (pkg == r->w1)
 459                 next_rp = &r->n1;
 460               else
 461                 next_rp = &r->n2;
 462               continue;
 463             }
 464
 465           IF_POOLDEBUG (SOLV_DEBUG_WATCHES)
 466             {
 467               POOL_DEBUG(SOLV_DEBUG_WATCHES, "  watch triggered ");
 468               solver_printrule(solv, SOLV_DEBUG_WATCHES, r);
 469             }
 470
 471           /*
 472            * 'pkg' was just decided (was set to FALSE), so this rule
 473            * may now be unit.
 474            */
 475           /* find the other watch */
 476           if (pkg == r->w1)
 477             {
 478               other_watch = r->w2;
 479               next_rp = &r->n1;
 480             }
 481           else
 482             {
 483               other_watch = r->w1;
 484               next_rp = &r->n2;
 485             }
 486
 487           /*
 488            * if the other watch is true we have nothing to do
 489            */
 490           if (DECISIONMAP_TRUE(other_watch))
 491             continue;
 492
 493           /*
 494            * The other literal is FALSE or UNDEF
 495            *
 496            */
 497
 498           if (r->d)
 499             {
 500               /* Not a binary clause, try to move our watch.
 501                *
 502                * Go over all literals and find one that is
 503                *   not other_watch
 504                *   and not FALSE
 505                *
 506                * (TRUE is also ok, in that case the rule is fulfilled)
 507                * As speed matters here we do not use the FOR_RULELITERALS
 508                * macro.
 509                */
 510               if (r->p                                /* we have a 'p' */
 511                   && r->p != other_watch              /* which is not watched */
 512                   && !DECISIONMAP_FALSE(r->p))        /* and not FALSE */
 513                 {
 514                   p = r->p;
 515                 }
 516               else                                    /* go find a 'd' to make 'true' */
 517                 {
 518                   /* foreach p in 'd'
 519                      we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
 520                    */
 521                   for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
 522                     {
 523                       if (p != other_watch              /* which is not watched */
 524                           && !DECISIONMAP_FALSE(p))     /* and not FALSE */
 525                         break;
 526                     }
 527                 }
 528
 529               if (p)
 530                 {
 531                   /*
 532                    * if we found some p that is UNDEF or TRUE, move
 533                    * watch to it
 534                    */
 535                   IF_POOLDEBUG (SOLV_DEBUG_WATCHES)
 536                     {
 537                       if (p > 0)
 538                         POOL_DEBUG(SOLV_DEBUG_WATCHES, "    -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, p));
 539                       else
 540                         POOL_DEBUG(SOLV_DEBUG_WATCHES, "    -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, -p));
 541                     }
 542
 543                   *rp = *next_rp;
 544                   next_rp = rp;
 545
 546                   if (pkg == r->w1)
 547                     {
 548                       r->w1 = p;
 549                       r->n1 = watches[p];
 550                     }
 551                   else
 552                     {
 553                       r->w2 = p;
 554                       r->n2 = watches[p];
 555                     }
 556                   watches[p] = r - solv->rules;
 557                   continue;
 558                 }
 559               /* search failed, thus all unwatched literals are FALSE */
 560
 561             } /* not binary */
 562
 563           /*
 564            * unit clause found, set literal other_watch to TRUE
 565            */
 566
 567           if (DECISIONMAP_FALSE(other_watch))      /* check if literal is FALSE */
 568             return r;                              /* eek, a conflict! */
 569
 570           IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 571             {
 572               POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "  unit ");
 573               solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
 574             }
 575
 576           if (other_watch > 0)
 577             decisionmap[other_watch] = level;    /* install! */
 578           else
 579             decisionmap[-other_watch] = -level;  /* remove! */
 580
 581           queue_push(&solv->decisionq, other_watch);
 582           queue_push(&solv->decisionq_why, r - solv->rules);
 583
 584           IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 585             {
 586               if (other_watch > 0)
 587                 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "    -> decided to install %s\n", pool_solvid2str(pool, other_watch));
 588               else
 589                 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "    -> decided to conflict %s\n", pool_solvid2str(pool, -other_watch));
 590             }
 591
 592         } /* foreach rule involving 'pkg' */
 593
 594     } /* while we have non-decided decisions */
 595
 596   POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate end -----\n");
 597
 598   return 0;     /* all is well */
 599 }
 600
 601
 602 /********************************************************************/
 603 /* Analysis */
 604
 605 /*-------------------------------------------------------------------
 606  *
 607  * revert
 608  * revert decisionq to a level
 609  */
 610
 611 static void
 612 revert(Solver *solv, int level)
 613 {
 614   Pool *pool = solv->pool;
 615   Id v, vv;
 616   while (solv->decisionq.count)
 617     {
 618       v = solv->decisionq.elements[solv->decisionq.count - 1];
 619       vv = v > 0 ? v : -v;
 620       if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
 621         break;
 622       POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
 623       solv->decisionmap[vv] = 0;
 624       solv->decisionq.count--;
 625       solv->decisionq_why.count--;
 626       solv->propagate_index = solv->decisionq.count;
 627     }
 628   while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= level)
 629     solv->branches.count -= solv->branches.elements[solv->branches.count - 2];
 630   if (solv->recommends_index > solv->decisionq.count)
 631     solv->recommends_index = -1;        /* rebuild recommends/suggests maps */
 632   solv->decisionq_reason.count = level + 1;
 633 }
 634
 635 /*-------------------------------------------------------------------
 636  *
 637  * watch2onhighest - put watch2 on literal with highest level
 638  */
 639
 640 static inline void
 641 watch2onhighest(Solver *solv, Rule *r)
 642 {
 643   int l, wl = 0;
 644   Id d, v, *dp;
 645
 646   d = r->d < 0 ? -r->d - 1 : r->d;
 647   if (!d)
 648     return;     /* binary rule, both watches are set */
 649   dp = solv->pool->whatprovidesdata + d;
 650   while ((v = *dp++) != 0)
 651     {
 652       l = solv->decisionmap[v < 0 ? -v : v];
 653       if (l < 0)
 654         l = -l;
 655       if (l > wl)
 656         {
 657           r->w2 = dp[-1];
 658           wl = l;
 659         }
 660     }
 661 }
 662
 663
 664 /*-------------------------------------------------------------------
 665  *
 666  * analyze
 667  *   and learn
 668  */
 669
 670 static int
 671 analyze(Solver *solv, int level, Rule *c, Rule **lrp)
 672 {
 673   Pool *pool = solv->pool;
 674   Queue q;
 675   Rule *r;
 676   Id q_buf[8];
 677   int rlevel = 1;
 678   Map seen;             /* global? */
 679   Id p = 0, pp, v, vv, why;
 680   int l, i, idx;
 681   int num = 0, l1num = 0;
 682   int learnt_why = solv->learnt_pool.count;
 683   Id *decisionmap = solv->decisionmap;
 684
 685   queue_init_buffer(&q, q_buf, sizeof(q_buf)/sizeof(*q_buf));
 686
 687   POOL_DEBUG(SOLV_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
 688   map_init(&seen, pool->nsolvables);
 689   idx = solv->decisionq.count;
 690   for (;;)
 691     {
 692       IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
 693         solver_printruleclass(solv, SOLV_DEBUG_ANALYZE, c);
 694       queue_push(&solv->learnt_pool, c - solv->rules);
 695       FOR_RULELITERALS(v, pp, c)
 696         {
 697           if (DECISIONMAP_TRUE(v))      /* the one true literal */
 698             continue;
 699           vv = v > 0 ? v : -v;
 700           if (MAPTST(&seen, vv))
 701             continue;
 702           MAPSET(&seen, vv);            /* mark that we also need to look at this literal */
 703           l = solv->decisionmap[vv];
 704           if (l < 0)
 705             l = -l;
 706           if (l == 1)
 707             l1num++;                    /* need to do this one in level1 pass */
 708           else if (l == level)
 709             num++;                      /* need to do this one as well */
 710           else
 711             {
 712               queue_push(&q, v);        /* not level1 or conflict level, add to new rule */
 713               if (l > rlevel)
 714                 rlevel = l;
 715             }
 716         }
 717 l1retry:
 718       if (!num && !--l1num)
 719         break;  /* all literals done */
 720
 721       /* find the next literal to investigate */
 722       /* (as num + l1num > 0, we know that we'll always find one) */
 723       for (;;)
 724         {
 725           assert(idx > 0);
 726           v = solv->decisionq.elements[--idx];
 727           vv = v > 0 ? v : -v;
 728           if (MAPTST(&seen, vv))
 729             break;
 730         }
 731       MAPCLR(&seen, vv);
 732
 733       if (num && --num == 0)
 734         {
 735           /* done with normal literals, now start level 1 literal processing */
 736           p = -v;       /* so that v doesn't get lost */
 737           if (!l1num)
 738             break;
 739           POOL_DEBUG(SOLV_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
 740           /* clear non-l1 bits from seen map */
 741           for (i = 0; i < q.count; i++)
 742             {
 743               v = q.elements[i];
 744               MAPCLR(&seen, v > 0 ? v : -v);
 745             }
 746           /* only level 1 marks left in seen map */
 747           l1num++;      /* as l1retry decrements it */
 748           goto l1retry;
 749         }
 750
 751       why = solv->decisionq_why.elements[idx];
 752       if (why <= 0)     /* just in case, maybe for SYSTEMSOLVABLE */
 753         goto l1retry;
 754       c = solv->rules + why;
 755     }
 756   map_free(&seen);
 757   assert(p != 0);
 758   assert(rlevel > 0 && rlevel < level);
 759   IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
 760     {
 761       POOL_DEBUG(SOLV_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
 762       solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, p);
 763       for (i = 0; i < q.count; i++)
 764         solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, q.elements[i]);
 765     }
 766   /* push end marker on learnt reasons stack */
 767   queue_push(&solv->learnt_pool, 0);
 768   solv->stats_learned++;
 769
 770   POOL_DEBUG(SOLV_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, rlevel);
 771   level = rlevel;
 772   revert(solv, level);
 773   if (q.count < 2)
 774     {
 775       Id d = q.count ? q.elements[0] : 0;
 776       queue_free(&q);
 777       r = solver_addrule(solv, p, d, 0);
 778     }
 779   else
 780     {
 781       Id d = pool_queuetowhatprovides(pool, &q);
 782       queue_free(&q);
 783       r = solver_addrule(solv, p, 0, d);
 784     }
 785   assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
 786   queue_push(&solv->learnt_why, learnt_why);
 787   if (r->w2)
 788     {
 789       /* needs watches */
 790       watch2onhighest(solv, r);
 791       addwatches_rule(solv, r);
 792     }
 793   else
 794     {
 795       /* rule is an assertion */
 796       queue_push(&solv->ruleassertions, r - solv->rules);
 797     }
 798   *lrp = r;
 799   return level;
 800 }
 801
 802
 803 /*-------------------------------------------------------------------
 804  *
 805  * solver_reset
 806  *
 807  * reset all solver decisions
 808  * called after rules have been enabled/disabled
 809  */
 810
 811 void
 812 solver_reset(Solver *solv)
 813 {
 814   int i;
 815   Id v;
 816
 817   /* rewind all decisions */
 818   for (i = solv->decisionq.count - 1; i >= 0; i--)
 819     {
 820       v = solv->decisionq.elements[i];
 821       solv->decisionmap[v > 0 ? v : -v] = 0;
 822     }
 823   queue_empty(&solv->decisionq_why);
 824   queue_empty(&solv->decisionq);
 825   queue_empty(&solv->decisionq_reason);
 826   solv->recommends_index = -1;
 827   solv->propagate_index = 0;
 828   queue_empty(&solv->branches);
 829
 830   /* adapt learnt rule status to new set of enabled/disabled rules */
 831   enabledisablelearntrules(solv);
 832 }
 833
 834 static inline int
 835 queue_contains(Queue *q, Id id)
 836 {
 837   int i;
 838   for (i = 0; i < q->count; i++)
 839     if (q->elements[i] == id)
 840       return 1;
 841   return 0;
 842 }
 843
 844 static void
 845 disable_recommendsrules(Solver *solv, Queue *weakq)
 846 {
 847   Pool *pool = solv->pool;
 848   int i, rid;
 849   for (i = 0; i < weakq->count; i++)
 850     {
 851       rid = weakq->elements[i];
 852       if ((rid >= solv->recommendsrules && rid < solv->recommendsrules_end) || queue_contains(solv->recommendsruleq, rid))
 853         {
 854           Rule *r = solv->rules + rid;
 855           if (r->d >= 0)
 856             {
 857               POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "disabling ");
 858               solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
 859               solver_disablerule(solv, r);
 860             }
 861         }
 862     }
 863 }
 864
 865 /*-------------------------------------------------------------------
 866  *
 867  * analyze_unsolvable_rule
 868  *
 869  * recursion helper used by analyze_unsolvable
 870  */
 871
 872 static void
 873 analyze_unsolvable_rule(Solver *solv, Rule *r, Queue *weakq, Map *rseen)
 874 {
 875   Pool *pool = solv->pool;
 876   int i;
 877   Id why = r - solv->rules;
 878
 879   IF_POOLDEBUG (SOLV_DEBUG_UNSOLVABLE)
 880     solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
 881   if (solv->learntrules && why >= solv->learntrules)
 882     {
 883       if (MAPTST(rseen, why - solv->learntrules))
 884         return;
 885       MAPSET(rseen, why - solv->learntrules);
 886       for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
 887         if (solv->learnt_pool.elements[i] > 0)
 888           analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], weakq, rseen);
 889       return;
 890     }
 891   if (solv->weakrulemap.size && MAPTST(&solv->weakrulemap, why) && weakq)
 892     queue_push(weakq, why);
 893   /* add non-pkg rules to problem and disable */
 894   if (why >= solv->pkgrules_end)
 895     solver_recordproblem(solv, why);
 896 }
 897
 898 /* fix a problem by disabling one or more weak rules */
 899 static void
 900 disable_weakrules(Solver *solv, Queue *weakq)
 901 {
 902   Pool *pool = solv->pool;
 903   int i;
 904   Id lastweak = 0;
 905   for (i = 0; i < weakq->count; i++)
 906     if (weakq->elements[i] > lastweak)
 907       lastweak = weakq->elements[i];
 908   if (lastweak >= solv->recommendsrules && lastweak < solv->recommendsrules_end)
 909     {
 910       lastweak = 0;
 911       for (i = 0; i < weakq->count; i++)
 912         if (weakq->elements[i] < solv->recommendsrules && weakq->elements[i] > lastweak)
 913           lastweak = weakq->elements[i];
 914       if (lastweak < solv->pkgrules_end)
 915         {
 916           disable_recommendsrules(solv, weakq);
 917           return;
 918         }
 919     }
 920   if (lastweak < solv->pkgrules_end && solv->strongrecommends && solv->recommendsruleq && queue_contains(solv->recommendsruleq, lastweak))
 921     {
 922       disable_recommendsrules(solv, weakq);
 923       return;
 924     }
 925   POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "disabling ");
 926   solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + lastweak);
 927   /* choice rules need special handling */
 928   if (lastweak >= solv->choicerules && lastweak < solv->choicerules_end)
 929     solver_disablechoicerules(solv, solv->rules + lastweak);
 930   else
 931     solver_fixproblem(solv, lastweak);
 932 }
 933
 934 /*-------------------------------------------------------------------
 935  *
 936  * analyze_unsolvable (called from setpropagatelearn)
 937  *
 938  * We know that the problem is not solvable. Record all involved
 939  * rules (i.e. the "proof") into solv->learnt_pool.
 940  * Record the learnt pool index and all non-pkg rules into
 941  * solv->problems. (Our solutions to fix the problems are to
 942  * disable those rules.)
 943  *
 944  * If the proof contains at least one weak rule, we disable the
 945  * last of them.
 946  *
 947  * Otherwise we return -1 if disablerules is not set or disable
 948  * _all_ of the problem rules and return 0.
 949  *
 950  * return:  0 - disabled some rules, try again
 951  *         -1 - hopeless
 952  */
 953
 954 static int
 955 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
 956 {
 957   Pool *pool = solv->pool;
 958   Rule *r;
 959   Map involved;         /* global to speed things up? */
 960   Map rseen;
 961   Queue weakq;
 962   Id pp, v, vv, why;
 963   int idx;
 964   Id *decisionmap = solv->decisionmap;
 965   int oldproblemcount;
 966   int oldlearntpoolcount;
 967   int record_proof = 1;
 968
 969   POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
 970   solv->stats_unsolvable++;
 971   oldproblemcount = solv->problems.count;
 972   oldlearntpoolcount = solv->learnt_pool.count;
 973
 974   /* make room for proof index */
 975   /* must update it later, as analyze_unsolvable_rule would confuse
 976    * it with a rule index if we put the real value in already */
 977   queue_push(&solv->problems, 0);
 978
 979   r = cr;
 980   map_init(&involved, pool->nsolvables);
 981   map_init(&rseen, solv->learntrules ? solv->nrules - solv->learntrules : 0);
 982   queue_init(&weakq);
 983   if (record_proof)
 984     queue_push(&solv->learnt_pool, r - solv->rules);
 985   analyze_unsolvable_rule(solv, r, &weakq, &rseen);
 986   FOR_RULELITERALS(v, pp, r)
 987     {
 988       if (DECISIONMAP_TRUE(v))  /* the one true literal */
 989           continue;
 990       vv = v > 0 ? v : -v;
 991       MAPSET(&involved, vv);
 992     }
 993   idx = solv->decisionq.count;
 994   while (idx > 0)
 995     {
 996       v = solv->decisionq.elements[--idx];
 997       vv = v > 0 ? v : -v;
 998       if (!MAPTST(&involved, vv) || vv == SYSTEMSOLVABLE)
 999         continue;
1000       why = solv->decisionq_why.elements[idx];
1001       assert(why > 0);
1002       if (record_proof)
1003         queue_push(&solv->learnt_pool, why);
1004       r = solv->rules + why;
1005       analyze_unsolvable_rule(solv, r, &weakq, &rseen);
1006       FOR_RULELITERALS(v, pp, r)
1007         {
1008           if (DECISIONMAP_TRUE(v))      /* the one true literal */
1009               continue;
1010           vv = v > 0 ? v : -v;
1011           MAPSET(&involved, vv);
1012         }
1013     }
1014   map_free(&involved);
1015   map_free(&rseen);
1016   queue_push(&solv->problems, 0);       /* mark end of this problem */
1017
1018   if (weakq.count)
1019     {
1020       /* revert problems */
1021       solv->problems.count = oldproblemcount;
1022       solv->learnt_pool.count = oldlearntpoolcount;
1023       /* disable some weak rules */
1024       disable_weakrules(solv, &weakq);
1025       queue_free(&weakq);
1026       solver_reset(solv);
1027       return 0;
1028     }
1029   queue_free(&weakq);
1030
1031   if (solv->allowuninstall || solv->allowuninstall_all || solv->allowuninstallmap.size)
1032     if (solver_autouninstall(solv, oldproblemcount) != 0)
1033       {
1034         solv->problems.count = oldproblemcount;
1035         solv->learnt_pool.count = oldlearntpoolcount;
1036         solver_reset(solv);
1037         return 0;
1038       }
1039
1040   /* finish proof */
1041   if (record_proof)
1042     {
1043       queue_push(&solv->learnt_pool, 0);
1044       solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
1045     }
1046
1047   /* + 2: index + trailing zero */
1048   if (disablerules && oldproblemcount + 2 < solv->problems.count)
1049     {
1050       solver_disableproblemset(solv, oldproblemcount);
1051       /* XXX: might want to enable all weak rules again */
1052       solver_reset(solv);
1053       return 0;
1054     }
1055   POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
1056   return -1;
1057 }
1058
1059
1060 /*-------------------------------------------------------------------
1061  *
1062  * setpropagatelearn
1063  *
1064  * add free decision (solvable to install) to decisionq
1065  * increase level and propagate decision
1066  * return if no conflict.
1067  *
1068  * in conflict case, analyze conflict rule, add resulting
1069  * rule to learnt rule set, make decision from learnt
1070  * rule (always unit) and re-propagate.
1071  *
1072  * returns the new solver level or -1 if unsolvable
1073  *
1074  */
1075
1076 static int
1077 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules, Id ruleid, Id reason)
1078 {
1079   Pool *pool = solv->pool;
1080   Rule *r, *lr;
1081
1082   if (decision)
1083     {
1084       level++;
1085       if (decision > 0)
1086         solv->decisionmap[decision] = level;
1087       else
1088         solv->decisionmap[-decision] = -level;
1089       queue_push(&solv->decisionq, decision);
1090       queue_push(&solv->decisionq_why, -ruleid);        /* <= 0 -> free decision */
1091       queue_push(&solv->decisionq_reason, reason);
1092     }
1093   assert(ruleid >= 0 && level > 0);
1094   for (;;)
1095     {
1096       r = propagate(solv, level);
1097       if (!r)
1098         break;
1099       if (level == 1)
1100         return analyze_unsolvable(solv, r, disablerules);
1101       POOL_DEBUG(SOLV_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
1102       level = analyze(solv, level, r, &lr);
1103       /* the new rule is unit by design */
1104       decision = lr->p;
1105       solv->decisionmap[decision > 0 ? decision : -decision] = decision > 0 ? level : -level;
1106       queue_push(&solv->decisionq, decision);
1107       queue_push(&solv->decisionq_why, lr - solv->rules);
1108       IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
1109         {
1110           POOL_DEBUG(SOLV_DEBUG_ANALYZE, "decision: ");
1111           solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, decision);
1112           POOL_DEBUG(SOLV_DEBUG_ANALYZE, "new rule: ");
1113           solver_printrule(solv, SOLV_DEBUG_ANALYZE, lr);
1114         }
1115     }
1116   return level;
1117 }
1118
1119 static void
1120 reorder_dq_for_future_installed(Solver *solv, int level, Queue *dq)
1121 {
1122   Pool *pool = solv->pool;
1123   int i, j, haveone = 0, dqcount = dq->count;
1124   int decisionqcount = solv->decisionq.count;
1125   Id p;
1126   Solvable *s;
1127
1128   /* at the time we process jobrules the installed packages are not kept yet */
1129   /* reorder so that "future-supplemented" packages come first */
1130   FOR_REPO_SOLVABLES(solv->installed, p, s)
1131     {
1132       if (MAPTST(&solv->noupdate, p - solv->installed->start))
1133         continue;
1134       if (solv->decisionmap[p] == 0)
1135         {
1136           if (s->recommends || s->suggests)
1137             queue_push(&solv->decisionq, p);
1138           solv->decisionmap[p] = level + 1;
1139           haveone = 1;
1140         }
1141     }
1142   if (!haveone)
1143     return;
1144   policy_update_recommendsmap(solv);
1145   for (i = 0; i < dqcount; i++)
1146     {
1147       p = dq->elements[i];
1148       if (!(pool->solvables[p].repo == solv->installed || MAPTST(&solv->suggestsmap, p) || solver_is_enhancing(solv, pool->solvables + p)))
1149         {
1150           queue_push(dq, p);
1151           dq->elements[i] = 0;
1152         }
1153     }
1154   dqcount = dq->count;
1155   for (i = 0; i < dqcount; i++)
1156     {
1157       p = dq->elements[i];
1158       if (p && !(pool->solvables[p].repo == solv->installed || MAPTST(&solv->recommendsmap, p) || solver_is_supplementing(solv, pool->solvables + p)))
1159         {
1160           queue_push(dq, p);
1161           dq->elements[i] = 0;
1162         }
1163     }
1164   for (i = j = 0; i < dq->count; i++)
1165     if (dq->elements[i])
1166       dq->elements[j++] = dq->elements[i];
1167   queue_truncate(dq, j);
1168   FOR_REPO_SOLVABLES(solv->installed, p, s)
1169     if (solv->decisionmap[p] == level + 1)
1170       solv->decisionmap[p] = 0;
1171   if (solv->decisionq.count != decisionqcount)
1172     {
1173       solv->recommends_index = -1;
1174       queue_truncate(&solv->decisionq, decisionqcount);
1175     }
1176   /* but obey favored maps */
1177   policy_prefer_favored(solv, dq);
1178 }
1179
1180 /*-------------------------------------------------------------------
1181  *
1182  * branch handling
1183  *
1184  * format is:
1185  *   [ -p1 p2 p3 .. pn  opt_pkg opt_data size level ]
1186  *
1187  * pkgs are negative if we tried them (to prevent inifinite recursion)
1188  * opt_pkg:  recommends: package with the recommends
1189  *           rule: 0
1190  * opt_data: recommends: depid
1191  *           rule: ruleid
1192  */
1193
1194 static void
1195 createbranch(Solver *solv, int level, Queue *dq, Id p, Id data)
1196 {
1197   Pool *pool = solv->pool;
1198   int i;
1199   IF_POOLDEBUG (SOLV_DEBUG_POLICY)
1200     {
1201       POOL_DEBUG (SOLV_DEBUG_POLICY, "creating a branch:\n");
1202       for (i = 0; i < dq->count; i++)
1203         POOL_DEBUG (SOLV_DEBUG_POLICY, "  - %s\n", pool_solvid2str(pool, dq->elements[i]));
1204     }
1205   queue_push(&solv->branches, -dq->elements[0]);
1206   for (i = 1; i < dq->count; i++)
1207     queue_push(&solv->branches, dq->elements[i]);
1208   queue_push2(&solv->branches, p, data);
1209   queue_push2(&solv->branches, dq->count + 4, level);
1210 }
1211
1212 static int
1213 takebranch(Solver *solv, int pos, int end, const char *msg, int disablerules)
1214 {
1215   Pool *pool = solv->pool;
1216   int level;
1217   Id p, why, reason;
1218 #if 0
1219   {
1220     int i;
1221     printf("branch group level %d [%d-%d] %d %d:\n", solv->branches.elements[end - 1], start, end, solv->branches.elements[end - 4], solv->branches.elements[end - 3]);
1222     for (i = end - solv->branches.elements[end - 2]; i < end - 4; i++)
1223       printf("%c %c%s\n", i == pos ? 'x' : ' ', solv->branches.elements[i] >= 0 ? ' ' : '-', pool_solvid2str(pool, solv->branches.elements[i] >= 0 ? solv->branches.elements[i] : -solv->branches.elements[i]));
1224   }
1225 #endif
1226   level = solv->branches.elements[end - 1];
1227   p = solv->branches.elements[pos];
1228   solv->branches.elements[pos] = -p;
1229   POOL_DEBUG(SOLV_DEBUG_SOLVER, "%s %d -> %d with %s\n", msg, solv->decisionmap[p], level, pool_solvid2str(pool, p));
1230   /* hack: set level to zero so that revert does not remove the branch */
1231   solv->branches.elements[end - 1] = 0;
1232   revert(solv, level);
1233   solv->branches.elements[end - 1] = level;
1234   /* hack: revert simply sets the count, so we can still access the reverted elements */
1235   why = -solv->decisionq_why.elements[solv->decisionq_why.count];
1236   assert(why >= 0);
1237   reason = solv->decisionq_reason.elements[level + 1];
1238   return setpropagatelearn(solv, level, p, disablerules, why, reason);
1239 }
1240
1241 /*-------------------------------------------------------------------
1242  *
1243  * select and install
1244  *
1245  * install best package from the queue. We add an extra package, inst, if
1246  * provided. See comment in weak install section.
1247  *
1248  * returns the new solver level or -1 if unsolvable
1249  *
1250  */
1251
1252 static int
1253 selectandinstall(Solver *solv, int level, Queue *dq, int disablerules, Id ruleid, Id reason)
1254 {
1255   Pool *pool = solv->pool;
1256   Id p;
1257
1258   if (dq->count > 1)
1259     policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1260   /* if we're resolving rules and didn't resolve the installed packages yet,
1261    * do some special supplements ordering */
1262   if (dq->count > 1 && solv->do_extra_reordering)
1263     reorder_dq_for_future_installed(solv, level, dq);
1264   /* if we have multiple candidates we open a branch */
1265   if (dq->count > 1)
1266     createbranch(solv, level, dq, 0, ruleid);
1267   p = dq->elements[0];
1268   POOL_DEBUG(SOLV_DEBUG_POLICY, "installing %s\n", pool_solvid2str(pool, p));
1269   return setpropagatelearn(solv, level, p, disablerules, ruleid, reason);
1270 }
1271
1272
1273 /********************************************************************/
1274 /* Main solver interface */
1275
1276
1277 /*-------------------------------------------------------------------
1278  *
1279  * solver_create
1280  * create solver structure
1281  *
1282  * pool: all available solvables
1283  * installed: installed Solvables
1284  *
1285  *
1286  * Upon solving, rules are created to flag the Solvables
1287  * of the 'installed' Repo as installed.
1288  */
1289
1290 Solver *
1291 solver_create(Pool *pool)
1292 {
1293   Solver *solv;
1294   solv = (Solver *)solv_calloc(1, sizeof(Solver));
1295   solv->pool = pool;
1296   solv->installed = pool->installed;
1297
1298   solv->allownamechange = 1;
1299
1300   solv->dup_allowdowngrade = 1;
1301   solv->dup_allownamechange = 1;
1302   solv->dup_allowarchchange = 1;
1303   solv->dup_allowvendorchange = 1;
1304
1305   solv->keepexplicitobsoletes = pool->noobsoletesmultiversion ? 0 : 1;
1306
1307   queue_init(&solv->ruletojob);
1308   queue_init(&solv->decisionq);
1309   queue_init(&solv->decisionq_why);
1310   queue_init(&solv->decisionq_reason);
1311   queue_init(&solv->problems);
1312   queue_init(&solv->orphaned);
1313   queue_init(&solv->learnt_why);
1314   queue_init(&solv->learnt_pool);
1315   queue_init(&solv->branches);
1316   queue_init(&solv->weakruleq);
1317   queue_init(&solv->ruleassertions);
1318   queue_init(&solv->addedmap_deduceq);
1319
1320   queue_push(&solv->learnt_pool, 0);    /* so that 0 does not describe a proof */
1321
1322   map_init(&solv->recommendsmap, pool->nsolvables);
1323   map_init(&solv->suggestsmap, pool->nsolvables);
1324   map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
1325   solv->recommends_index = 0;
1326
1327   solv->decisionmap = (Id *)solv_calloc(pool->nsolvables, sizeof(Id));
1328   solv->nrules = 1;
1329   solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
1330   memset(solv->rules, 0, sizeof(Rule));
1331
1332   return solv;
1333 }
1334
1335
1336
1337 /*-------------------------------------------------------------------
1338  *
1339  * solver_free
1340  */
1341
1342 static inline void
1343 queuep_free(Queue **qp)
1344 {
1345   if (!*qp)
1346     return;
1347   queue_free(*qp);
1348   *qp = solv_free(*qp);
1349 }
1350
1351 static inline void
1352 map_zerosize(Map *m)
1353 {
1354   if (m->size)
1355     {
1356       map_free(m);
1357       map_init(m, 0);
1358     }
1359 }
1360
1361 void
1362 solver_free(Solver *solv)
1363 {
1364   queue_free(&solv->job);
1365   queue_free(&solv->ruletojob);
1366   queue_free(&solv->decisionq);
1367   queue_free(&solv->decisionq_why);
1368   queue_free(&solv->decisionq_reason);
1369   queue_free(&solv->learnt_why);
1370   queue_free(&solv->learnt_pool);
1371   queue_free(&solv->problems);
1372   queue_free(&solv->solutions);
1373   queue_free(&solv->orphaned);
1374   queue_free(&solv->branches);
1375   queue_free(&solv->weakruleq);
1376   queue_free(&solv->ruleassertions);
1377   queue_free(&solv->addedmap_deduceq);
1378   queuep_free(&solv->cleandeps_updatepkgs);
1379   queuep_free(&solv->cleandeps_mistakes);
1380   queuep_free(&solv->update_targets);
1381   queuep_free(&solv->installsuppdepq);
1382   queuep_free(&solv->recommendscplxq);
1383   queuep_free(&solv->suggestscplxq);
1384   queuep_free(&solv->brokenorphanrules);
1385   queuep_free(&solv->recommendsruleq);
1386
1387   map_free(&solv->recommendsmap);
1388   map_free(&solv->suggestsmap);
1389   map_free(&solv->noupdate);
1390   map_free(&solv->weakrulemap);
1391   map_free(&solv->multiversion);
1392
1393   map_free(&solv->updatemap);
1394   map_free(&solv->bestupdatemap);
1395   map_free(&solv->fixmap);
1396   map_free(&solv->dupmap);
1397   map_free(&solv->dupinvolvedmap);
1398   map_free(&solv->droporphanedmap);
1399   map_free(&solv->cleandepsmap);
1400   map_free(&solv->allowuninstallmap);
1401
1402   solv_free(solv->favormap);
1403   solv_free(solv->decisionmap);
1404   solv_free(solv->rules);
1405   solv_free(solv->watches);
1406   solv_free(solv->obsoletes);
1407   solv_free(solv->obsoletes_data);
1408   solv_free(solv->specialupdaters);
1409   solv_free(solv->choicerules_info);
1410   solv_free(solv->bestrules_info);
1411   solv_free(solv->yumobsrules_info);
1412   solv_free(solv->recommendsrules_info);
1413   solv_free(solv->instbuddy);
1414   solv_free(solv);
1415 }
1416
1417 int
1418 solver_get_flag(Solver *solv, int flag)
1419 {
1420   switch (flag)
1421   {
1422   case SOLVER_FLAG_ALLOW_DOWNGRADE:
1423     return solv->allowdowngrade;
1424   case SOLVER_FLAG_ALLOW_NAMECHANGE:
1425     return solv->allownamechange;
1426   case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1427     return solv->allowarchchange;
1428   case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1429     return solv->allowvendorchange;
1430   case SOLVER_FLAG_ALLOW_UNINSTALL:
1431     return solv->allowuninstall;
1432   case SOLVER_FLAG_NO_UPDATEPROVIDE:
1433     return solv->noupdateprovide;
1434   case SOLVER_FLAG_SPLITPROVIDES:
1435     return solv->dosplitprovides;
1436   case SOLVER_FLAG_IGNORE_RECOMMENDED:
1437     return solv->dontinstallrecommended;
1438   case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1439     return solv->addalreadyrecommended;
1440   case SOLVER_FLAG_NO_INFARCHCHECK:
1441     return solv->noinfarchcheck;
1442   case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1443     return solv->keepexplicitobsoletes;
1444   case SOLVER_FLAG_BEST_OBEY_POLICY:
1445     return solv->bestobeypolicy;
1446   case SOLVER_FLAG_NO_AUTOTARGET:
1447     return solv->noautotarget;
1448   case SOLVER_FLAG_DUP_ALLOW_DOWNGRADE:
1449     return solv->dup_allowdowngrade;
1450   case SOLVER_FLAG_DUP_ALLOW_NAMECHANGE:
1451     return solv->dup_allownamechange;
1452   case SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE:
1453     return solv->dup_allowarchchange;
1454   case SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE:
1455     return solv->dup_allowvendorchange;
1456   case SOLVER_FLAG_KEEP_ORPHANS:
1457     return solv->keep_orphans;
1458   case SOLVER_FLAG_BREAK_ORPHANS:
1459     return solv->break_orphans;
1460   case SOLVER_FLAG_FOCUS_INSTALLED:
1461     return solv->focus_installed;
1462   case SOLVER_FLAG_FOCUS_BEST:
1463     return solv->focus_best;
1464   case SOLVER_FLAG_YUM_OBSOLETES:
1465     return solv->do_yum_obsoletes;
1466   case SOLVER_FLAG_NEED_UPDATEPROVIDE:
1467     return solv->needupdateprovide;
1468   case SOLVER_FLAG_URPM_REORDER:
1469     return solv->urpmreorder;
1470   case SOLVER_FLAG_STRONG_RECOMMENDS:
1471     return solv->strongrecommends;
1472   case SOLVER_FLAG_INSTALL_ALSO_UPDATES:
1473     return solv->install_also_updates;
1474   case SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED:
1475     return solv->only_namespace_recommended;
1476   default:
1477     break;
1478   }
1479   return -1;
1480 }
1481
1482 int
1483 solver_set_flag(Solver *solv, int flag, int value)
1484 {
1485   int old = solver_get_flag(solv, flag);
1486   switch (flag)
1487   {
1488   case SOLVER_FLAG_ALLOW_DOWNGRADE:
1489     solv->allowdowngrade = value;
1490     break;
1491   case SOLVER_FLAG_ALLOW_NAMECHANGE:
1492     solv->allownamechange = value;
1493     break;
1494   case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1495     solv->allowarchchange = value;
1496     break;
1497   case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1498     solv->allowvendorchange = value;
1499     break;
1500   case SOLVER_FLAG_ALLOW_UNINSTALL:
1501     solv->allowuninstall = value;
1502     break;
1503   case SOLVER_FLAG_NO_UPDATEPROVIDE:
1504     solv->noupdateprovide = value;
1505     break;
1506   case SOLVER_FLAG_SPLITPROVIDES:
1507     solv->dosplitprovides = value;
1508     break;
1509   case SOLVER_FLAG_IGNORE_RECOMMENDED:
1510     solv->dontinstallrecommended = value;
1511     break;
1512   case SOLVER_FLAG_ADD_ALREADY_RECOMMENDED:
1513     solv->addalreadyrecommended = value;
1514     break;
1515   case SOLVER_FLAG_NO_INFARCHCHECK:
1516     solv->noinfarchcheck = value;
1517     break;
1518   case SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES:
1519     solv->keepexplicitobsoletes = value;
1520     break;
1521   case SOLVER_FLAG_BEST_OBEY_POLICY:
1522     solv->bestobeypolicy = value;
1523     break;
1524   case SOLVER_FLAG_NO_AUTOTARGET:
1525     solv->noautotarget = value;
1526     break;
1527   case SOLVER_FLAG_DUP_ALLOW_DOWNGRADE:
1528     solv->dup_allowdowngrade = value;
1529     break;
1530   case SOLVER_FLAG_DUP_ALLOW_NAMECHANGE:
1531     solv->dup_allownamechange = value;
1532     break;
1533   case SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE:
1534     solv->dup_allowarchchange = value;
1535     break;
1536   case SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE:
1537     solv->dup_allowvendorchange = value;
1538     break;
1539   case SOLVER_FLAG_KEEP_ORPHANS:
1540     solv->keep_orphans = value;
1541     break;
1542   case SOLVER_FLAG_BREAK_ORPHANS:
1543     solv->break_orphans = value;
1544     break;
1545   case SOLVER_FLAG_FOCUS_INSTALLED:
1546     solv->focus_installed = value;
1547     break;
1548   case SOLVER_FLAG_FOCUS_BEST:
1549     solv->focus_best = value;
1550     break;
1551   case SOLVER_FLAG_YUM_OBSOLETES:
1552     solv->do_yum_obsoletes = value;
1553     break;
1554   case SOLVER_FLAG_NEED_UPDATEPROVIDE:
1555     solv->needupdateprovide = value;
1556     break;
1557   case SOLVER_FLAG_URPM_REORDER:
1558     solv->urpmreorder = value;
1559     break;
1560   case SOLVER_FLAG_STRONG_RECOMMENDS:
1561     solv->strongrecommends = value;
1562     break;
1563   case SOLVER_FLAG_INSTALL_ALSO_UPDATES:
1564     solv->install_also_updates = value;
1565     break;
1566   case SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED:
1567     solv->only_namespace_recommended = value;
1568     break;
1569   default:
1570     break;
1571   }
1572   return old;
1573 }
1574
1575 static int
1576 resolve_jobrules(Solver *solv, int level, int disablerules, Queue *dq)
1577 {
1578   Pool *pool = solv->pool;
1579   int oldlevel = level;
1580   int i, olevel;
1581   Rule *r;
1582
1583   POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving job rules\n");
1584   for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
1585     {
1586       Id l, pp;
1587       if (r->d < 0)             /* ignore disabled rules */
1588         continue;
1589       queue_empty(dq);
1590       FOR_RULELITERALS(l, pp, r)
1591         {
1592           if (l < 0)
1593             {
1594               if (solv->decisionmap[-l] <= 0)
1595                 break;
1596             }
1597           else
1598             {
1599               if (solv->decisionmap[l] > 0)
1600                 break;
1601               if (solv->decisionmap[l] == 0)
1602                 queue_push(dq, l);
1603             }
1604         }
1605       if (l || !dq->count)
1606         continue;
1607       /* prune to installed if not updating */
1608       if (dq->count > 1 && solv->installed && !solv->updatemap_all &&
1609           !solv->install_also_updates &&
1610           !(solv->job.elements[solv->ruletojob.elements[i - solv->jobrules]] & SOLVER_ORUPDATE))
1611         {
1612           int j = dq->count, k;
1613           if (solv->updatemap.size)
1614             {
1615               /* do not prune if an installed package wants to be updated */
1616               for (j = 0; j < dq->count; j++)
1617                 if (pool->solvables[dq->elements[j]].repo == solv->installed
1618                     && MAPTST(&solv->updatemap, dq->elements[j] - solv->installed->start))
1619                   break;
1620             }
1621           if (j == dq->count)
1622             {
1623               for (j = k = 0; j < dq->count; j++)
1624                 if (pool->solvables[dq->elements[j]].repo == solv->installed)
1625                   dq->elements[k++] = dq->elements[j];
1626               if (k)
1627                 dq->count = k;
1628             }
1629         }
1630       olevel = level;
1631       level = selectandinstall(solv, level, dq, disablerules, i, SOLVER_REASON_RESOLVE_JOB);
1632       if (level <= olevel)
1633         {
1634           if (level == olevel)
1635             {
1636               i--;
1637               r--;
1638               continue; /* try something else */
1639             }
1640           if (level < oldlevel)
1641             return level;
1642           /* redo from start of jobrules */
1643           i = solv->jobrules - 1;
1644           r = solv->rules + i;
1645         }
1646     }
1647   return level;
1648 }
1649
1650 static void
1651 prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
1652 {
1653   int i, j;
1654   Id p, *cp2;
1655   for (i = j = 0; i < q->count; i++)
1656     {
1657       p = q->elements[i];
1658       for (cp2 = cp; *cp2; cp2++)
1659         if (*cp2 == p)
1660           {
1661             q->elements[j++] = p;
1662             break;
1663           }
1664     }
1665   queue_truncate(q, j);
1666 }
1667
1668 static int
1669 resolve_installed(Solver *solv, int level, int disablerules, Queue *dq)
1670 {
1671   Pool *pool = solv->pool;
1672   Repo *installed = solv->installed;
1673   int i, n, pass;
1674   int installedpos = solv->installedpos;
1675   Solvable *s;
1676   Id p, pp;
1677   int olevel, origlevel = level;
1678
1679   POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving installed packages\n");
1680   if (!installedpos)
1681     installedpos = installed->start;
1682   /* we use two passes if we need to update packages
1683    * to create a better user experience */
1684   for (pass = solv->updatemap.size ? 0 : 1; pass < 2; )
1685     {
1686       int passlevel = level;
1687       Id *specialupdaters = solv->specialupdaters;
1688       /* start with installedpos, the position that gave us problems the last time */
1689       for (i = installedpos, n = installed->start; n < installed->end; i++, n++)
1690         {
1691           Rule *r, *rr;
1692           Id d;
1693
1694           if (i == installed->end)
1695             i = installed->start;
1696           s = pool->solvables + i;
1697           if (s->repo != installed)
1698             continue;
1699
1700           if (solv->decisionmap[i] > 0 && (!specialupdaters || !specialupdaters[i - installed->start]))
1701             continue;           /* already decided */
1702           if (!pass && solv->updatemap.size && !MAPTST(&solv->updatemap, i - installed->start))
1703             continue;           /* updates first */
1704           r = solv->rules + solv->updaterules + (i - installed->start);
1705           rr = r;
1706           if (!rr->p || rr->d < 0)      /* disabled -> look at feature rule */
1707             rr -= solv->installed->end - solv->installed->start;
1708           if (!rr->p)           /* identical to update rule? */
1709             rr = r;
1710           if (!rr->p)
1711             continue;           /* orpaned package or pseudo package */
1712
1713           /* check if we should update this package to the latest version
1714            * noupdate is set for erase jobs, in that case we want to deinstall
1715            * the installed package and not replace it with a newer version
1716            * rr->p != i is for dup jobs where the installed package cannot be kept */
1717           if (dq->count)
1718             queue_empty(dq);
1719           if (!MAPTST(&solv->noupdate, i - installed->start) && (solv->decisionmap[i] < 0 || solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, i - installed->start)) || (rr->p && rr->p != i)))
1720             {
1721               if (specialupdaters && (d = specialupdaters[i - installed->start]) != 0)
1722                 {
1723                   int j;
1724                   /* special multiversion handling, make sure best version is chosen */
1725                   if (rr->p == i && solv->decisionmap[i] >= 0)
1726                     queue_push(dq, i);
1727                   while ((p = pool->whatprovidesdata[d++]) != 0)
1728                     if (solv->decisionmap[p] >= 0)
1729                       queue_push(dq, p);
1730                   for (j = 0; j < dq->count; j++)
1731                     {
1732                       Id p2 = dq->elements[j];
1733                       if (pool->solvables[p2].repo != installed)
1734                         continue;
1735                       d = specialupdaters[i - installed->start];
1736                       while ((p = pool->whatprovidesdata[d++]) != 0)
1737                         {
1738                           if (solv->decisionmap[p] >= 0 || pool->solvables[p].repo == installed)
1739                             continue;
1740                           if (solvable_identical(pool->solvables + p, pool->solvables + p2))
1741                             queue_push(dq, p);  /* identical to installed, put it on the list so we have a repo prio */
1742                         }
1743                     }
1744                   if (dq->count && solv->update_targets && solv->update_targets->elements[i - installed->start])
1745                     prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], dq);
1746                   if (dq->count)
1747                     {
1748                       policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1749                       p = dq->elements[0];
1750                       if (p != i && solv->decisionmap[p] == 0)
1751                         {
1752                           rr = solv->rules + solv->featurerules + (i - solv->installed->start);
1753                           if (!rr->p)           /* update rule == feature rule? */
1754                             rr = rr - solv->featurerules + solv->updaterules;
1755                           dq->count = 1;
1756                         }
1757                       else
1758                         dq->count = 0;
1759                     }
1760                 }
1761               else
1762                 {
1763                   /* update to best package of the update rule */
1764                   FOR_RULELITERALS(p, pp, rr)
1765                     {
1766                       if (solv->decisionmap[p] > 0)
1767                         {
1768                           dq->count = 0;                /* already fulfilled */
1769                           break;
1770                         }
1771                       if (!solv->decisionmap[p])
1772                         queue_push(dq, p);
1773                     }
1774                 }
1775             }
1776           if (dq->count && solv->update_targets && solv->update_targets->elements[i - installed->start])
1777             prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - installed->start], dq);
1778           /* install best version */
1779           if (dq->count)
1780             {
1781               olevel = level;
1782               level = selectandinstall(solv, level, dq, disablerules, rr - solv->rules, SOLVER_REASON_UPDATE_INSTALLED);
1783               if (level <= olevel)
1784                 {
1785                   if (level < passlevel)
1786                     break;      /* trouble */
1787                   if (level < olevel)
1788                     n = installed->start;       /* redo all */
1789                   i--;
1790                   n--;
1791                   continue;
1792                 }
1793             }
1794           /* if still undecided keep package */
1795           if (solv->decisionmap[i] == 0)
1796             {
1797               olevel = level;
1798               if (solv->cleandepsmap.size && MAPTST(&solv->cleandepsmap, i - installed->start))
1799                 {
1800 #if 0
1801                   POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, i));
1802                   level = setpropagatelearn(solv, level, -i, disablerules, 0, SOLVER_REASON_CLEANDEPS_ERASE);
1803 #else
1804                   continue;
1805 #endif
1806                 }
1807               else
1808                 {
1809                   POOL_DEBUG(SOLV_DEBUG_POLICY, "keeping %s\n", pool_solvid2str(pool, i));
1810                   level = setpropagatelearn(solv, level, i, disablerules, r - solv->rules, SOLVER_REASON_KEEP_INSTALLED);
1811                 }
1812               if (level <= olevel)
1813                 {
1814                   if (level < passlevel)
1815                     break;      /* trouble */
1816                   if (level < olevel)
1817                     n = installed->start;       /* redo all */
1818                   i--;
1819                   n--;
1820                   continue;     /* retry with learnt rule */
1821                 }
1822             }
1823         }
1824       if (n < installed->end)
1825         {
1826           installedpos = i;     /* retry problem solvable next time */
1827           if (level < origlevel)
1828             break;              /* ran into trouble */
1829           /* re-run all passes */
1830           pass = solv->updatemap.size ? 0 : 1;
1831           continue;
1832         }
1833       /* reset installedpos, advance to next pass */
1834       installedpos = installed->start;
1835       pass++;
1836     }
1837   solv->installedpos = installedpos;
1838   return level;
1839 }
1840
1841 /* one or more installed cleandeps packages in dq that are to be updated */
1842 /* we need to emulate the code in resolve_installed */
1843 static void
1844 do_cleandeps_update_filter(Solver *solv, Queue *dq)
1845 {
1846   Pool *pool = solv->pool;
1847   Repo *installed = solv->installed;
1848   Id *specialupdaters = solv->specialupdaters;
1849   Id p, p2, pp, d;
1850   Queue q;
1851   int i, j, k;
1852
1853   queue_init(&q);
1854   for (i = 0; i < dq->count; i++)
1855     {
1856       Id p = dq->elements[i];
1857       if (p < 0)
1858         p = -p;
1859       if (pool->solvables[p].repo != installed || !MAPTST(&solv->cleandepsmap, p - installed->start))
1860         continue;
1861       queue_empty(&q);
1862       /* find updaters */
1863       if (specialupdaters && (d = specialupdaters[p - installed->start]) != 0)
1864         {
1865           while ((p2 = pool->whatprovidesdata[d++]) != 0)
1866             if (solv->decisionmap[p2] >= 0)
1867               queue_push(&q, p2);
1868         }
1869       else
1870         {
1871           Rule *r = solv->rules + solv->updaterules + (p - installed->start);
1872           if (r->p)
1873             {
1874               FOR_RULELITERALS(p2, pp, r)
1875                 if (solv->decisionmap[p2] >= 0)
1876                   queue_push(&q, p2);
1877             }
1878         }
1879       if (q.count && solv->update_targets && solv->update_targets->elements[p - installed->start])
1880         prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - installed->start], &q);
1881       /* mark all elements in dq that are in the updaters list */
1882       dq->elements[i] = -p;
1883       for (j = 0; j < dq->count; j++)
1884         {
1885           p = dq->elements[j];
1886           if (p < 0)
1887             continue;
1888           for (k = 0; k < q.count; k++)
1889             if (q.elements[k] == p)
1890               {
1891                 dq->elements[j] = -p;
1892                 break;
1893               }
1894         }
1895     }
1896   /* now prune to marked elements */
1897   for (i = j = 0; i < dq->count; i++)
1898     if ((p = dq->elements[i]) < 0)
1899       dq->elements[j++] = -p;
1900   dq->count = j;
1901   queue_free(&q);
1902 }
1903
1904 static int
1905 resolve_dependencies(Solver *solv, int level, int disablerules, Queue *dq)
1906 {
1907   Pool *pool = solv->pool;
1908   int i, j, n;
1909   int postponed;
1910   Rule *r;
1911   int origlevel = level;
1912   Id p, *dp;
1913   int focusbest = solv->focus_best && solv->do_extra_reordering;
1914   Repo *installed = solv->installed;
1915
1916   /*
1917    * decide
1918    */
1919   POOL_DEBUG(SOLV_DEBUG_POLICY, "deciding unresolved rules\n");
1920   postponed = 0;
1921   for (i = 1, n = 1; ; i++, n++)
1922     {
1923       if (n >= solv->nrules)
1924         {
1925           if (postponed <= 0)
1926             break;
1927           i = postponed;
1928           postponed = -1;
1929           n = 1;
1930         }
1931       if (i == solv->nrules)
1932         i = 1;
1933       if (focusbest && i >= solv->featurerules)
1934         continue;
1935       r = solv->rules + i;
1936       if (r->d < 0)             /* ignore disabled rules */
1937         continue;
1938       if (r->p < 0)             /* most common cases first */
1939         {
1940           if (r->d == 0 || solv->decisionmap[-r->p] <= 0)
1941             continue;
1942         }
1943       if (focusbest && r->d != 0 && installed)
1944         {
1945           /* make sure at least one negative literal is from a new package */
1946           if (!(r->p < 0 && pool->solvables[-r->p].repo != installed))
1947             {
1948               dp = pool->whatprovidesdata + r->d;
1949               while ((p = *dp++) != 0)
1950                 if (p < 0 && solv->decisionmap[-p] > 0 && pool->solvables[-p].repo != installed)
1951                   break;
1952               if (!p)
1953                 continue;               /* sorry */
1954             }
1955         }
1956       if (dq->count)
1957         queue_empty(dq);
1958       if (r->d == 0)
1959         {
1960           /* binary or unary rule */
1961           /* need two positive undecided literals, r->p already checked above */
1962           if (r->w2 <= 0)
1963             continue;
1964           if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
1965             continue;
1966           queue_push(dq, r->p);
1967           queue_push(dq, r->w2);
1968         }
1969       else
1970         {
1971           /* make sure that
1972            * all negative literals are installed
1973            * no positive literal is installed
1974            * i.e. the rule is not fulfilled and we
1975            * just need to decide on the positive literals
1976            * (decisionmap[-r->p] for the r->p < 0 case is already checked above)
1977            */
1978           if (r->p >= 0)
1979             {
1980               if (solv->decisionmap[r->p] > 0)
1981                 continue;
1982               if (solv->decisionmap[r->p] == 0)
1983                 queue_push(dq, r->p);
1984             }
1985           dp = pool->whatprovidesdata + r->d;
1986           while ((p = *dp++) != 0)
1987             {
1988               if (p < 0)
1989                 {
1990                   if (solv->decisionmap[-p] <= 0)
1991                     break;
1992                 }
1993               else
1994                 {
1995                   if (solv->decisionmap[p] > 0)
1996                     break;
1997                   if (solv->decisionmap[p] == 0)
1998                     queue_push(dq, p);
1999                 }
2000             }
2001           if (p)
2002             continue;
2003         }
2004       IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
2005         {
2006           POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "unfulfilled ");
2007           solver_printruleclass(solv, SOLV_DEBUG_PROPAGATE, r);
2008         }
2009       /* dq->count < 2 cannot happen as this means that
2010        * the rule is unit */
2011       assert(dq->count > 1);
2012
2013       /* prune to cleandeps packages */
2014       if (solv->cleandepsmap.size && solv->installed)
2015         {
2016           int cleandeps_update = 0;
2017           Repo *installed = solv->installed;
2018           for (j = 0; j < dq->count; j++)
2019             if (pool->solvables[dq->elements[j]].repo == installed && MAPTST(&solv->cleandepsmap, dq->elements[j] - installed->start))
2020               {
2021                 if (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, dq->elements[j] - installed->start)))
2022                   {
2023                     cleandeps_update = 1;               /* cleandeps package is marked for update */
2024                     continue;
2025                   }
2026                 break;
2027               }
2028           if (j < dq->count)
2029             {
2030               dq->elements[0] = dq->elements[j];
2031               queue_truncate(dq, 1);
2032             }
2033           else if (cleandeps_update)
2034             do_cleandeps_update_filter(solv, dq);       /* special update filter */
2035         }
2036
2037       if (dq->count > 1 && postponed >= 0)
2038         {
2039           policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE_NOREORDER);
2040           if (dq->count > 1)
2041             {
2042               if (!postponed)
2043                 postponed = i;
2044               continue;
2045             }
2046         }
2047
2048       level = selectandinstall(solv, level, dq, disablerules, r - solv->rules, SOLVER_REASON_RESOLVE);
2049       if (level < origlevel)
2050         break;          /* trouble */
2051       /* something changed, so look at all rules again */
2052       n = 0;
2053     }
2054   return level;
2055 }
2056
2057
2058 #ifdef ENABLE_COMPLEX_DEPS
2059
2060 static void
2061 add_complex_recommends(Solver *solv, Id rec, Queue *dq, Map *dqmap)
2062 {
2063   Pool *pool = solv->pool;
2064   int oldcnt = dq->count;
2065   int cutcnt, blkcnt;
2066   Id p;
2067   int i, j;
2068
2069 #if 0
2070   printf("ADD_COMPLEX_RECOMMENDS %s\n", pool_dep2str(pool, rec));
2071 #endif
2072   i = pool_normalize_complex_dep(pool, rec, dq, CPLXDEPS_EXPAND);
2073   if (i == 0 || i == 1)
2074     return;
2075   cutcnt = dq->count;
2076   for (i = oldcnt; i < cutcnt; i++)
2077     {
2078       blkcnt = dq->count;
2079       for (; (p = dq->elements[i]) != 0; i++)
2080         {
2081           if (p < 0)
2082             {
2083               if (solv->decisionmap[-p] <= 0)
2084                 break;
2085               continue;
2086             }
2087           if (solv->decisionmap[p] > 0)
2088             {
2089               queue_truncate(dq, blkcnt);
2090               break;
2091             }
2092           if (dqmap)
2093             {
2094               if (!MAPTST(dqmap, p))
2095                 continue;
2096             }
2097           else
2098             {
2099               if (solv->decisionmap[p] < 0)
2100                 continue;
2101               if (solv->process_orphans && solv->installed && pool->solvables[p].repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))))
2102                 continue;
2103             }
2104           queue_push(dq, p);
2105         }
2106       while (dq->elements[i])
2107         i++;
2108     }
2109   queue_deleten(dq, oldcnt, cutcnt - oldcnt);
2110   /* unify */
2111   if (dq->count != oldcnt)
2112     {
2113       for (j = oldcnt; j < dq->count; j++)
2114         {
2115           p = dq->elements[j];
2116           for (i = 0; i < j; i++)
2117             if (dq->elements[i] == p)
2118               {
2119                 dq->elements[j] = 0;
2120                 break;
2121               }
2122         }
2123       for (i = j = oldcnt; j < dq->count; j++)
2124         if (dq->elements[j])
2125           dq->elements[i++] = dq->elements[j];
2126       queue_truncate(dq, i);
2127     }
2128 #if 0
2129   printf("RETURN:\n");
2130   for (i = oldcnt; i < dq->count; i++)
2131     printf("  - %s\n", pool_solvid2str(pool, dq->elements[i]));
2132 #endif
2133 }
2134
2135 static void
2136 do_complex_recommendations(Solver *solv, Id rec, Map *m, int noselected)
2137 {
2138   Pool *pool = solv->pool;
2139   Queue dq;
2140   Id p;
2141   int i, blk;
2142
2143 #if 0
2144   printf("DO_COMPLEX_RECOMMENDATIONS %s\n", pool_dep2str(pool, rec));
2145 #endif
2146   queue_init(&dq);
2147   i = pool_normalize_complex_dep(pool, rec, &dq, CPLXDEPS_EXPAND);
2148   if (i == 0 || i == 1)
2149     {
2150       queue_free(&dq);
2151       return;
2152     }
2153   for (i = 0; i < dq.count; i++)
2154     {
2155       blk = i;
2156       for (; (p = dq.elements[i]) != 0; i++)
2157         {
2158           if (p < 0)
2159             {
2160               if (solv->decisionmap[-p] <= 0)
2161                 break;
2162               continue;
2163             }
2164           if (solv->decisionmap[p] > 0)
2165             {
2166               if (noselected)
2167                 break;
2168               MAPSET(m, p);
2169               for (i++; (p = dq.elements[i]) != 0; i++)
2170                 if (p > 0 && solv->decisionmap[p] > 0)
2171                   MAPSET(m, p);
2172               p = 1;
2173               break;
2174             }
2175         }
2176       if (!p)
2177         {
2178           for (i = blk; (p = dq.elements[i]) != 0; i++)
2179             if (p > 0)
2180               MAPSET(m, p);
2181         }
2182       while (dq.elements[i])
2183         i++;
2184     }
2185   queue_free(&dq);
2186 }
2187
2188 #endif
2189
2190 static void
2191 prune_disfavored(Solver *solv, Queue *plist)
2192 {
2193   int i, j;
2194   for (i = j = 0; i < plist->count; i++)
2195     {
2196       Id p = plist->elements[i];
2197       if (solv->favormap[p] >= 0)
2198         plist->elements[j++] = p;
2199     }
2200   if (i != j)
2201     queue_truncate(plist, j);
2202 }
2203
2204 static int
2205 resolve_weak(Solver *solv, int level, int disablerules, Queue *dq, Queue *dqs, int *rerunp)
2206 {
2207   Pool *pool = solv->pool;
2208   int i, j, qcount;
2209   int olevel;
2210   Solvable *s;
2211   Map dqmap;
2212   int decisioncount;
2213   Id p;
2214
2215   POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended packages\n");
2216   if (dq->count)
2217     queue_empty(dq);    /* recommended packages */
2218   if (dqs->count)
2219     queue_empty(dqs);   /* supplemented packages */
2220   for (i = 1; i < pool->nsolvables; i++)
2221     {
2222       if (solv->decisionmap[i] < 0)
2223         continue;
2224       s = pool->solvables + i;
2225       if (solv->decisionmap[i] > 0)
2226         {
2227           /* installed, check for recommends */
2228           Id *recp, rec, pp, p;
2229           if (!solv->addalreadyrecommended && s->repo == solv->installed)
2230             continue;
2231           if (s->recommends)
2232             {
2233               recp = s->repo->idarraydata + s->recommends;
2234               while ((rec = *recp++) != 0)
2235                 {
2236                   /* cheat: we just look if there is REL_NAMESPACE in the dep */
2237                   if (solv->only_namespace_recommended && !solver_is_namespace_dep(solv, rec))
2238                     continue;
2239 #ifdef ENABLE_COMPLEX_DEPS
2240                   if (pool_is_complex_dep(pool, rec))
2241                     {
2242                       add_complex_recommends(solv, rec, dq, 0);
2243                       continue;
2244                     }
2245 #endif
2246                   qcount = dq->count;
2247                   FOR_PROVIDES(p, pp, rec)
2248                     {
2249                       if (solv->decisionmap[p] > 0)
2250                         {
2251                           dq->count = qcount;
2252                           break;
2253                         }
2254                       else if (solv->decisionmap[p] == 0)
2255                         {
2256                           if (solv->process_orphans && solv->installed && pool->solvables[p].repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))))
2257                             continue;
2258                           queue_pushunique(dq, p);
2259                         }
2260                     }
2261                 }
2262             }
2263         }
2264       else
2265         {
2266           /* not yet installed, check if supplemented */
2267           if (!s->supplements)
2268             continue;
2269           if (!pool_installable(pool, s))
2270             continue;
2271           if (!solver_is_supplementing(solv, s))
2272             continue;
2273           if (solv->process_orphans && solv->installed && s->repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, i - solv->installed->start))))
2274             continue;
2275           if (solv->havedisfavored && solv->favormap[i] < 0)
2276             continue;   /* disfavored supplements, do not install */
2277           queue_push(dqs, i);
2278         }
2279     }
2280
2281   /* filter out disfavored recommended packages */
2282   if (dq->count && solv->havedisfavored)
2283     prune_disfavored(solv, dq);
2284
2285   /* filter out all packages obsoleted by installed packages */
2286   /* this is no longer needed if we have (and trust) reverse obsoletes */
2287   if ((dqs->count || dq->count) && solv->installed)
2288     {
2289       Map obsmap;
2290       Id obs, *obsp, po, ppo;
2291
2292       map_init(&obsmap, pool->nsolvables);
2293       for (p = solv->installed->start; p < solv->installed->end; p++)
2294         {
2295           s = pool->solvables + p;
2296           if (s->repo != solv->installed || !s->obsoletes)
2297             continue;
2298           if (solv->decisionmap[p] <= 0)
2299             continue;
2300           if (!solv->keepexplicitobsoletes && solv->multiversion.size && MAPTST(&solv->multiversion, p))
2301             continue;
2302           obsp = s->repo->idarraydata + s->obsoletes;
2303           /* foreach obsoletes */
2304           while ((obs = *obsp++) != 0)
2305             FOR_PROVIDES(po, ppo, obs)
2306               {
2307                 Solvable *pos = pool->solvables + po;
2308                 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pos, obs))
2309                   continue;
2310                 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, pos))
2311                   continue;
2312                 MAPSET(&obsmap, po);
2313               }
2314         }
2315       for (i = j = 0; i < dqs->count; i++)
2316         if (!MAPTST(&obsmap, dqs->elements[i]))
2317           dqs->elements[j++] = dqs->elements[i];
2318       dqs->count = j;
2319       for (i = j = 0; i < dq->count; i++)
2320         if (!MAPTST(&obsmap, dq->elements[i]))
2321           dq->elements[j++] = dq->elements[i];
2322       dq->count = j;
2323       map_free(&obsmap);
2324     }
2325
2326   /* filter out all already supplemented packages if requested */
2327   if ((!solv->addalreadyrecommended || solv->only_namespace_recommended) && dqs->count)
2328     {
2329       /* filter out old supplements */
2330       for (i = j = 0; i < dqs->count; i++)
2331         {
2332           p = dqs->elements[i];
2333           s = pool->solvables + p;
2334           if (s->supplements && solver_is_supplementing_alreadyinstalled(solv, s))
2335             dqs->elements[j++] = p;
2336         }
2337       dqs->count = j;
2338     }
2339
2340   /* multiversion doesn't mix well with supplements.
2341    * filter supplemented packages where we already decided
2342    * to install a different version (see bnc#501088) */
2343   if (dqs->count && solv->multiversion.size)
2344     {
2345       for (i = j = 0; i < dqs->count; i++)
2346         {
2347           p = dqs->elements[i];
2348           if (MAPTST(&solv->multiversion, p))
2349             {
2350               Id p2, pp2;
2351               s = pool->solvables + p;
2352               FOR_PROVIDES(p2, pp2, s->name)
2353                 if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name)
2354                   break;
2355               if (p2)
2356                 continue;       /* ignore this package */
2357             }
2358           dqs->elements[j++] = p;
2359         }
2360       dqs->count = j;
2361     }
2362
2363   /* implicitobsoleteusescolors doesn't mix well with supplements.
2364    * filter supplemented packages where we already decided
2365    * to install a different architecture */
2366   if (dqs->count && pool->implicitobsoleteusescolors)
2367     {
2368       for (i = j = 0; i < dqs->count; i++)
2369         {
2370           Id p2, pp2;
2371           p = dqs->elements[i];
2372           s = pool->solvables + p;
2373           FOR_PROVIDES(p2, pp2, s->name)
2374             if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name && pool->solvables[p2].arch != s->arch)
2375               break;
2376           if (p2)
2377             continue;   /* ignore this package */
2378           dqs->elements[j++] = p;
2379         }
2380       dqs->count = j;
2381     }
2382
2383   /* make dq contain both recommended and supplemented pkgs */
2384   if (dqs->count)
2385     {
2386       for (i = 0; i < dqs->count; i++)
2387         queue_pushunique(dq, dqs->elements[i]);
2388     }
2389
2390   if (!dq->count)
2391     return level;
2392   *rerunp = 1;
2393
2394   if (dq->count == 1)
2395     {
2396       /* simple case, just one package. no need to choose to best version */
2397       p = dq->elements[0];
2398       if (dqs->count)
2399         POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2400       else
2401         POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2402       return setpropagatelearn(solv, level, p, 0, 0, SOLVER_REASON_WEAKDEP);
2403     }
2404
2405   /* filter packages, this gives us the best versions */
2406   policy_filter_unwanted(solv, dq, POLICY_MODE_RECOMMEND);
2407
2408   /* create map of result */
2409   map_init(&dqmap, pool->nsolvables);
2410   for (i = 0; i < dq->count; i++)
2411     MAPSET(&dqmap, dq->elements[i]);
2412
2413   /* prune dqs so that it only contains the best versions */
2414   for (i = j = 0; i < dqs->count; i++)
2415     {
2416       p = dqs->elements[i];
2417       if (MAPTST(&dqmap, p))
2418         dqs->elements[j++] = p;
2419     }
2420   dqs->count = j;
2421
2422   /* install all supplemented packages, but order first */
2423   if (dqs->count > 1)
2424     policy_filter_unwanted(solv, dqs, POLICY_MODE_SUPPLEMENT);
2425   decisioncount = solv->decisionq.count;
2426   for (i = 0; i < dqs->count; i++)
2427     {
2428       p = dqs->elements[i];
2429       if (solv->decisionmap[p])
2430         continue;
2431       POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
2432       olevel = level;
2433       level = setpropagatelearn(solv, level, p, 0, 0, SOLVER_REASON_WEAKDEP);
2434       if (level <= olevel)
2435         break;
2436     }
2437   if (i < dqs->count || solv->decisionq.count < decisioncount)
2438     {
2439       map_free(&dqmap);
2440       return level;
2441     }
2442
2443   /* install all recommended packages */
2444   /* more work as we want to created branches if multiple
2445    * choices are valid */
2446   for (i = 0; i < decisioncount; i++)
2447     {
2448       Id rec, *recp, pp;
2449       p = solv->decisionq.elements[i];
2450       if (p < 0)
2451         continue;
2452       s = pool->solvables + p;
2453       if (!s->repo || (!solv->addalreadyrecommended && s->repo == solv->installed))
2454         continue;
2455       if (!s->recommends)
2456         continue;
2457       recp = s->repo->idarraydata + s->recommends;
2458       while ((rec = *recp++) != 0)
2459         {
2460           queue_empty(dq);
2461 #ifdef ENABLE_COMPLEX_DEPS
2462           if (pool_is_complex_dep(pool, rec))
2463               add_complex_recommends(solv, rec, dq, &dqmap);
2464           else
2465 #endif
2466           FOR_PROVIDES(p, pp, rec)
2467             {
2468               if (solv->decisionmap[p] > 0)
2469                 {
2470                   dq->count = 0;
2471                   break;
2472                 }
2473               else if (solv->decisionmap[p] == 0 && MAPTST(&dqmap, p))
2474                 queue_push(dq, p);
2475             }
2476           if (!dq->count)
2477             continue;
2478           if (dq->count > 1)
2479             policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
2480           /* if we have multiple candidates we open a branch */
2481           if (dq->count > 1)
2482             createbranch(solv, level, dq, s - pool->solvables, rec);
2483           p = dq->elements[0];
2484           POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2485           olevel = level;
2486           level = setpropagatelearn(solv, level, p, 0, 0, SOLVER_REASON_WEAKDEP);
2487           if (level <= olevel || solv->decisionq.count < decisioncount)
2488             break;      /* we had to revert some decisions */
2489         }
2490       if (rec)
2491         break;  /* had a problem above, quit loop */
2492     }
2493   map_free(&dqmap);
2494   return level;
2495 }
2496
2497 static int
2498 resolve_cleandeps(Solver *solv, int level, int disablerules, int *rerunp)
2499 {
2500   Pool *pool = solv->pool;
2501   Repo *installed = solv->installed;
2502   int olevel;
2503   Id p;
2504   Solvable *s;
2505
2506   if (!installed || !solv->cleandepsmap.size)
2507     return level;
2508   POOL_DEBUG(SOLV_DEBUG_SOLVER, "deciding cleandeps packages\n");
2509   for (p = installed->start; p < installed->end; p++)
2510     {
2511       s = pool->solvables + p;
2512       if (s->repo != installed)
2513         continue;
2514       if (solv->decisionmap[p] != 0 || !MAPTST(&solv->cleandepsmap, p - installed->start))
2515         continue;
2516       POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, p));
2517       olevel = level;
2518       level = setpropagatelearn(solv, level, -p, 0, 0, SOLVER_REASON_CLEANDEPS_ERASE);
2519       if (level < olevel)
2520         break;
2521     }
2522   if (p < installed->end)
2523     *rerunp = 1;
2524   return level;
2525 }
2526
2527 static int
2528 resolve_orphaned(Solver *solv, int level, int disablerules, Queue *dq, int *rerunp)
2529 {
2530   Pool *pool = solv->pool;
2531   int i;
2532   Id p;
2533   int installedone = 0;
2534   int olevel;
2535
2536   /* let's see if we can install some unsupported package */
2537   POOL_DEBUG(SOLV_DEBUG_SOLVER, "deciding orphaned packages\n");
2538   for (i = 0; i < solv->orphaned.count; i++)
2539     {
2540       p = solv->orphaned.elements[i];
2541       if (solv->decisionmap[p])
2542         continue;       /* already decided */
2543       if (solv->droporphanedmap_all)
2544         continue;
2545       if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))
2546         continue;
2547       POOL_DEBUG(SOLV_DEBUG_SOLVER, "keeping orphaned %s\n", pool_solvid2str(pool, p));
2548       olevel = level;
2549       level = setpropagatelearn(solv, level, p, 0, 0, SOLVER_REASON_RESOLVE_ORPHAN);
2550       installedone = 1;
2551       if (level < olevel)
2552         break;
2553     }
2554   if (installedone || i < solv->orphaned.count)
2555     {
2556       *rerunp = 1;
2557       return level;
2558     }
2559   for (i = 0; i < solv->orphaned.count; i++)
2560     {
2561       p = solv->orphaned.elements[i];
2562       if (solv->decisionmap[p])
2563         continue;       /* already decided */
2564       POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing orphaned %s\n", pool_solvid2str(pool, p));
2565       olevel = level;
2566       level = setpropagatelearn(solv, level, -p, 0, 0, SOLVER_REASON_RESOLVE_ORPHAN);
2567       if (level < olevel)
2568         {
2569           *rerunp = 1;
2570           return level;
2571         }
2572     }
2573   if (solv->brokenorphanrules)
2574     {
2575       solver_check_brokenorphanrules(solv, dq);
2576       if (dq->count)
2577         {
2578           policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
2579           for (i = 0; i < dq->count; i++)
2580             {
2581               p = dq->elements[i];
2582               POOL_DEBUG(SOLV_DEBUG_POLICY, "installing orphaned dep %s\n", pool_solvid2str(pool, p));
2583               olevel = level;
2584               level = setpropagatelearn(solv, level, p, 0, 0, SOLVER_REASON_RESOLVE_ORPHAN);
2585               if (level < olevel)
2586                 break;
2587             }
2588           *rerunp = 1;
2589           return level;
2590         }
2591     }
2592   return level;
2593 }
2594
2595 /*-------------------------------------------------------------------
2596  *
2597  * solver_run_sat
2598  *
2599  * all rules have been set up, now actually run the solver
2600  *
2601  */
2602
2603 void
2604 solver_run_sat(Solver *solv, int disablerules, int doweak)
2605 {
2606   Queue dq;             /* local decisionqueue */
2607   Queue dqs;            /* local decisionqueue for supplements */
2608   int systemlevel;
2609   int level, olevel;
2610   Rule *r;
2611   int i;
2612   Solvable *s;
2613   Pool *pool = solv->pool;
2614   Id p;
2615   int minimizationsteps;
2616
2617   IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
2618     {
2619       POOL_DEBUG (SOLV_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
2620       for (i = 1; i < solv->nrules; i++)
2621         solver_printruleclass(solv, SOLV_DEBUG_RULE_CREATION, solv->rules + i);
2622     }
2623
2624   /* start SAT algorithm */
2625   level = 0;
2626   systemlevel = level + 1;
2627   POOL_DEBUG(SOLV_DEBUG_SOLVER, "solving...\n");
2628
2629   queue_init(&dq);
2630   queue_init(&dqs);
2631   solv->installedpos = 0;
2632   solv->do_extra_reordering = 0;
2633
2634   /*
2635    * here's the main loop:
2636    * 1) decide assertion rules and propagate
2637    * 2) fulfill jobs
2638    * 3) try to keep installed packages
2639    * 4) fulfill all unresolved rules
2640    * 5) install recommended packages
2641    * 6) minimalize solution if we had choices
2642    * if we encounter a problem, we rewind to a safe level and restart
2643    * with step 1
2644    */
2645
2646   minimizationsteps = 0;
2647   for (;;)
2648     {
2649       /*
2650        * initial propagation of the assertions
2651        */
2652       if (level <= 0)
2653         {
2654           if (level < 0)
2655             break;
2656           level = makeruledecisions(solv, disablerules);
2657           if (level < 0)
2658             break;
2659           POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "initial propagate (propagate_index: %d;  size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
2660           if ((r = propagate(solv, level)) != 0)
2661             {
2662               level = analyze_unsolvable(solv, r, disablerules);
2663               continue;
2664             }
2665           systemlevel = level + 1;
2666         }
2667
2668       /*
2669        * resolve jobs first (unless focus_installed is set)
2670        */
2671      if (level < systemlevel && !solv->focus_installed)
2672         {
2673           if (solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
2674             solv->do_extra_reordering = 1;
2675           olevel = level;
2676           level = resolve_jobrules(solv, level, disablerules, &dq);
2677           solv->do_extra_reordering = 0;
2678           if (level < olevel)
2679             continue;
2680           systemlevel = level + 1;
2681         }
2682
2683       /* resolve job dependencies in the focus_best case */
2684       if (level < systemlevel && solv->focus_best && !solv->focus_installed && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
2685         {
2686           solv->do_extra_reordering = 1;
2687           olevel = level;
2688           level = resolve_dependencies(solv, level, disablerules, &dq);
2689           solv->do_extra_reordering = 0;
2690           if (level < olevel)
2691             continue;           /* start over */
2692           systemlevel = level + 1;
2693         }
2694
2695       /*
2696        * installed packages
2697        */
2698       if (level < systemlevel && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
2699         {
2700           olevel = level;
2701           level = resolve_installed(solv, level, disablerules, &dq);
2702           if (level < olevel)
2703             continue;
2704           systemlevel = level + 1;
2705         }
2706
2707      /* resolve jobs in focus_installed case */
2708      if (level < systemlevel && solv->focus_installed)
2709         {
2710           olevel = level;
2711           level = resolve_jobrules(solv, level, disablerules, &dq);
2712           if (level < olevel)
2713             continue;
2714           systemlevel = level + 1;
2715         }
2716
2717       if (level < systemlevel)
2718         systemlevel = level;
2719
2720       /* resolve all dependencies */
2721       olevel = level;
2722       level = resolve_dependencies(solv, level, disablerules, &dq);
2723       if (level < olevel)
2724         continue;               /* start over */
2725
2726       /* decide leftover cleandeps packages */
2727       if (solv->cleandepsmap.size && solv->installed)
2728         {
2729           int rerun = 0;
2730           level = resolve_cleandeps(solv, level, disablerules, &rerun);
2731           if (rerun)
2732             continue;
2733         }
2734
2735       /* at this point we have a consistent system. now do the extras... */
2736
2737       if (doweak)
2738         {
2739           int rerun = 0;
2740           level = resolve_weak(solv, level, disablerules, &dq, &dqs, &rerun);
2741           if (rerun)
2742             continue;
2743         }
2744
2745       if (solv->installed && (solv->orphaned.count || solv->brokenorphanrules))
2746         {
2747           int rerun = 0;
2748           level = resolve_orphaned(solv, level, disablerules, &dq, &rerun);
2749           if (rerun)
2750             continue;
2751         }
2752
2753      /* one final pass to make sure we decided all installed packages */
2754       if (solv->installed)
2755         {
2756           for (p = solv->installed->start; p < solv->installed->end; p++)
2757             {
2758               if (solv->decisionmap[p])
2759                 continue;       /* already decided */
2760               s = pool->solvables + p;
2761               if (s->repo != solv->installed)
2762                 continue;
2763               POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing unwanted %s\n", pool_solvid2str(pool, p));
2764               olevel = level;
2765               level = setpropagatelearn(solv, level, -p, 0, 0, SOLVER_REASON_CLEANDEPS_ERASE);
2766               if (level < olevel)
2767                 break;
2768             }
2769           if (p < solv->installed->end)
2770             continue;           /* back to main loop */
2771         }
2772
2773       if (solv->installed && solv->cleandepsmap.size && solver_check_cleandeps_mistakes(solv))
2774         {
2775           solver_reset(solv);
2776           level = 0;    /* restart from scratch */
2777           continue;
2778         }
2779
2780       if (solv->solution_callback)
2781         {
2782           solv->solution_callback(solv, solv->solution_callback_data);
2783           if (solv->branches.count)
2784             {
2785               int l, endi = 0;
2786               p = l = 0;
2787               for (i = solv->branches.count - 1; i >= 0; i--)
2788                 {
2789                   p = solv->branches.elements[i];
2790                   if (p > 0 && !l)
2791                     {
2792                       endi = i + 1;
2793                       l = p;
2794                       i -= 3;   /* skip: p data count */
2795                     }
2796                   else if (p > 0)
2797                     break;
2798                   else if (p < 0)
2799                     l = 0;
2800                 }
2801               if (i >= 0)
2802                 {
2803                   while (i > 0 && solv->branches.elements[i - 1] > 0)
2804                     i--;
2805                   level = takebranch(solv, i, endi, "branching", disablerules);
2806                   continue;
2807                 }
2808             }
2809           /* all branches done, we're finally finished */
2810           break;
2811         }
2812
2813       /* auto-minimization step */
2814       if (solv->branches.count)
2815         {
2816           int endi, lasti = -1, lastiend = -1;
2817           if (solv->recommends_index < solv->decisionq.count)
2818             policy_update_recommendsmap(solv);
2819           for (endi = solv->branches.count; endi > 0;)
2820             {
2821               int l, lastsi = -1, starti = endi - solv->branches.elements[endi - 2];
2822               l = solv->branches.elements[endi - 1];
2823               for (i = starti; i < endi - 4; i++)
2824                 {
2825                   p = solv->branches.elements[i];
2826                   if (p <= 0)
2827                     continue;
2828                   if (solv->decisionmap[p] > l)
2829                     {
2830                       lasti = i;
2831                       lastiend = endi;
2832                       lastsi = -1;
2833                       break;
2834                     }
2835                   if (solv->havedisfavored && solv->favormap[p] < 0)
2836                     continue;
2837                   if (lastsi < 0 && (MAPTST(&solv->recommendsmap, p) || solver_is_supplementing(solv, pool->solvables + p)))
2838                     lastsi = i;
2839                 }
2840               if (lastsi >= 0)
2841                 {
2842                   /* we have a recommended package that could not be installed */
2843                   /* find current selection and take new one if it is not recommended */
2844                   for (i = starti; i < endi - 4; i++)
2845                     {
2846                       p = -solv->branches.elements[i];
2847                       if (p <= 0 || solv->decisionmap[p] != l + 1)
2848                         continue;
2849                       if (solv->favormap && solv->favormap[p] > solv->favormap[solv->branches.elements[lastsi]])
2850                         continue;       /* current selection is more favored */
2851                       if (!(MAPTST(&solv->recommendsmap, p) || solver_is_supplementing(solv, pool->solvables + p)))
2852                         {
2853                           lasti = lastsi;
2854                           lastiend = endi;
2855                           break;
2856                         }
2857                     }
2858                 }
2859               endi = starti;
2860             }
2861           if (lasti >= 0)
2862             {
2863               minimizationsteps++;
2864               level = takebranch(solv, lasti, lastiend, "minimizing", disablerules);
2865               continue;         /* back to main loop */
2866             }
2867         }
2868       /* no minimization found, we're finally finished! */
2869       break;
2870     }
2871   assert(level == -1 || level + 1 == solv->decisionq_reason.count);
2872
2873   POOL_DEBUG(SOLV_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable, %d minimization steps\n", solv->stats_learned, solv->stats_unsolvable, minimizationsteps);
2874
2875   POOL_DEBUG(SOLV_DEBUG_STATS, "done solving.\n\n");
2876   queue_free(&dq);
2877   queue_free(&dqs);
2878 #if 0
2879   solver_printdecisionq(solv, SOLV_DEBUG_RESULT);
2880 #endif
2881 }
2882
2883
2884 /*-------------------------------------------------------------------
2885  *
2886  * remove disabled conflicts
2887  *
2888  * purpose: update the decisionmap after some rules were disabled.
2889  * this is used to calculate the suggested/recommended package list.
2890  * Also returns a "removed" list to undo the discisionmap changes.
2891  */
2892
2893 static void
2894 removedisabledconflicts(Solver *solv, Queue *removed)
2895 {
2896   Pool *pool = solv->pool;
2897   int i, n;
2898   Id p, why, *dp;
2899   Id new;
2900   Rule *r;
2901   Id *decisionmap = solv->decisionmap;
2902
2903   queue_empty(removed);
2904   for (i = 0; i < solv->decisionq.count; i++)
2905     {
2906       p = solv->decisionq.elements[i];
2907       if (p > 0)
2908         continue;       /* conflicts only, please */
2909       why = solv->decisionq_why.elements[i];
2910       if (why == 0)
2911         {
2912           /* no rule involved, must be a orphan package drop */
2913           continue;
2914         }
2915       /* we never do conflicts on free decisions, so there
2916        * must have been an unit rule */
2917       assert(why > 0);
2918       r = solv->rules + why;
2919       if (r->d < 0 && decisionmap[-p])
2920         {
2921           /* rule is now disabled, remove from decisionmap */
2922           POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing conflict for package %s[%d]\n", pool_solvid2str(pool, -p), -p);
2923           queue_push(removed, -p);
2924           queue_push(removed, decisionmap[-p]);
2925           decisionmap[-p] = 0;
2926         }
2927     }
2928   if (!removed->count)
2929     return;
2930   /* we removed some confliced packages. some of them might still
2931    * be in conflict, so search for unit rules and re-conflict */
2932   new = 0;
2933   for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
2934     {
2935       if (i == solv->nrules)
2936         {
2937           i = 1;
2938           r = solv->rules + i;
2939         }
2940       if (r->d < 0)
2941         continue;
2942       if (!r->w2)
2943         {
2944           if (r->p < 0 && !decisionmap[-r->p])
2945             new = r->p;
2946         }
2947       else if (!r->d)
2948         {
2949           /* binary rule */
2950           if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
2951             new = r->p;
2952           else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
2953             new = r->w2;
2954         }
2955       else
2956         {
2957           if (r->p < 0 && decisionmap[-r->p] == 0)
2958             new = r->p;
2959           if (new || DECISIONMAP_FALSE(r->p))
2960             {
2961               dp = pool->whatprovidesdata + r->d;
2962               while ((p = *dp++) != 0)
2963                 {
2964                   if (new && p == new)
2965                     continue;
2966                   if (p < 0 && decisionmap[-p] == 0)
2967                     {
2968                       if (new)
2969                         {
2970                           new = 0;
2971                           break;
2972                         }
2973                       new = p;
2974                     }
2975                   else if (!DECISIONMAP_FALSE(p))
2976                     {
2977                       new = 0;
2978                       break;
2979                     }
2980                 }
2981             }
2982         }
2983       if (new)
2984         {
2985           POOL_DEBUG(SOLV_DEBUG_SOLVER, "re-conflicting package %s[%d]\n", pool_solvid2str(pool, -new), -new);
2986           decisionmap[-new] = -1;
2987           new = 0;
2988           n = 0;        /* redo all rules */
2989         }
2990     }
2991 }
2992
2993 static inline void
2994 undo_removedisabledconflicts(Solver *solv, Queue *removed)
2995 {
2996   int i;
2997   for (i = 0; i < removed->count; i += 2)
2998     solv->decisionmap[removed->elements[i]] = removed->elements[i + 1];
2999 }
3000
3001
3002 /*-------------------------------------------------------------------
3003  *
3004  * weaken solvable dependencies
3005  */
3006
3007 static void
3008 weaken_solvable_deps(Solver *solv, Id p)
3009 {
3010   int i;
3011   Rule *r;
3012
3013   for (i = 1, r = solv->rules + i; i < solv->pkgrules_end; i++, r++)
3014     {
3015       if (r->p != -p)
3016         continue;
3017       if ((r->d == 0 || r->d == -1) && r->w2 < 0)
3018         continue;       /* conflict */
3019       queue_push(&solv->weakruleq, i);
3020     }
3021 }
3022
3023
3024 /********************************************************************/
3025 /* main() */
3026
3027
3028 void
3029 solver_calculate_multiversionmap(Pool *pool, Queue *job, Map *multiversionmap)
3030 {
3031   int i;
3032   Id how, what, select;
3033   Id p, pp;
3034   for (i = 0; i < job->count; i += 2)
3035     {
3036       how = job->elements[i];
3037       if ((how & SOLVER_JOBMASK) != SOLVER_MULTIVERSION)
3038         continue;
3039       what = job->elements[i + 1];
3040       select = how & SOLVER_SELECTMASK;
3041       if (!multiversionmap->size)
3042         map_grow(multiversionmap, pool->nsolvables);
3043       if (select == SOLVER_SOLVABLE_ALL)
3044         {
3045           FOR_POOL_SOLVABLES(p)
3046             MAPSET(multiversionmap, p);
3047         }
3048       else if (select == SOLVER_SOLVABLE_REPO)
3049         {
3050           Solvable *s;
3051           Repo *repo = pool_id2repo(pool, what);
3052           if (repo)
3053             {
3054               FOR_REPO_SOLVABLES(repo, p, s)
3055                 MAPSET(multiversionmap, p);
3056             }
3057         }
3058       FOR_JOB_SELECT(p, pp, select, what)
3059         MAPSET(multiversionmap, p);
3060     }
3061 }
3062
3063 void
3064 solver_calculate_noobsmap(Pool *pool, Queue *job, Map *multiversionmap)
3065 {
3066   solver_calculate_multiversionmap(pool, job, multiversionmap);
3067 }
3068
3069 /*
3070  * add a rule created by a job, record job number and weak flag
3071  */
3072 static inline void
3073 solver_addjobrule(Solver *solv, Id p, Id p2, Id d, Id job, int weak)
3074 {
3075   solver_addrule(solv, p, p2, d);
3076   queue_push(&solv->ruletojob, job);
3077   if (weak)
3078     queue_push(&solv->weakruleq, solv->nrules - 1);
3079 }
3080
3081 static inline void
3082 add_cleandeps_updatepkg(Solver *solv, Id p)
3083 {
3084   if (!solv->cleandeps_updatepkgs)
3085     {
3086       solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
3087       queue_init(solv->cleandeps_updatepkgs);
3088     }
3089   queue_pushunique(solv->cleandeps_updatepkgs, p);
3090 }
3091
3092 static void
3093 add_update_target(Solver *solv, Id p, Id how)
3094 {
3095   Pool *pool = solv->pool;
3096   Solvable *s = pool->solvables + p;
3097   Repo *installed = solv->installed;
3098   Id pi, pip, identicalp;
3099   int startcnt, endcnt;
3100
3101   if (!solv->update_targets)
3102     {
3103       solv->update_targets = solv_calloc(1, sizeof(Queue));
3104       queue_init(solv->update_targets);
3105     }
3106   if (s->repo == installed)
3107     {
3108       queue_push2(solv->update_targets, p, p);
3109       FOR_PROVIDES(pi, pip, s->name)
3110         {
3111           Solvable *si = pool->solvables + pi;
3112           if (si->repo == installed && si->name == s->name && pi != p)
3113             queue_push2(solv->update_targets, pi, p);
3114         }
3115       return;
3116     }
3117   identicalp = 0;
3118   startcnt = solv->update_targets->count;
3119   FOR_PROVIDES(pi, pip, s->name)
3120     {
3121       Solvable *si = pool->solvables + pi;
3122       if (si->repo != installed || si->name != s->name)
3123         continue;
3124       if (how & SOLVER_FORCEBEST)
3125         {
3126           if (!solv->bestupdatemap.size)
3127             map_grow(&solv->bestupdatemap, installed->end - installed->start);
3128           MAPSET(&solv->bestupdatemap, pi - installed->start);
3129         }
3130       if (how & SOLVER_CLEANDEPS)
3131         add_cleandeps_updatepkg(solv, pi);
3132       queue_push2(solv->update_targets, pi, p);
3133       /* remember an installed package that is identical to p */
3134       if (s->evr == si->evr && solvable_identical(s, si))
3135         identicalp = pi;
3136     }
3137   if (s->obsoletes)
3138     {
3139       Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
3140       while ((obs = *obsp++) != 0)
3141         {
3142           FOR_PROVIDES(pi, pip, obs)
3143             {
3144               Solvable *si = pool->solvables + pi;
3145               if (si->repo != installed)
3146                 continue;
3147               if (si->name == s->name)
3148                 continue;       /* already handled above */
3149               if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
3150                 continue;
3151               if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
3152                 continue;
3153               if (how & SOLVER_FORCEBEST)
3154                 {
3155                   if (!solv->bestupdatemap.size)
3156                     map_grow(&solv->bestupdatemap, installed->end - installed->start);
3157                   MAPSET(&solv->bestupdatemap, pi - installed->start);
3158                 }
3159               if (how & SOLVER_CLEANDEPS)
3160                 add_cleandeps_updatepkg(solv, pi);
3161               queue_push2(solv->update_targets, pi, p);
3162             }
3163         }
3164     }
3165   /* also allow upgrading to an identical installed package */
3166   if (identicalp)
3167     {
3168       for (endcnt = solv->update_targets->count; startcnt < endcnt; startcnt += 2)
3169         queue_push2(solv->update_targets, solv->update_targets->elements[startcnt], identicalp);
3170     }
3171 }
3172
3173 static int
3174 transform_update_targets_sortfn(const void *ap, const void *bp, void *dp)
3175 {
3176   const Id *a = ap;
3177   const Id *b = bp;
3178   if (a[0] - b[0])
3179     return a[0] - b[0];
3180   return a[1] - b[1];
3181 }
3182
3183 static void
3184 transform_update_targets(Solver *solv)
3185 {
3186   Repo *installed = solv->installed;
3187   Queue *update_targets = solv->update_targets;
3188   int i, j;
3189   Id p, q, lastp, lastq;
3190
3191   if (!update_targets->count)
3192     {
3193       queue_free(update_targets);
3194       solv->update_targets = solv_free(update_targets);
3195       return;
3196     }
3197   if (update_targets->count > 2)
3198     solv_sort(update_targets->elements, update_targets->count >> 1, 2 * sizeof(Id), transform_update_targets_sortfn, solv);
3199   queue_insertn(update_targets, 0, installed->end - installed->start, 0);
3200   lastp = lastq = 0;
3201   for (i = j = installed->end - installed->start; i < update_targets->count; i += 2)
3202     {
3203       if ((p = update_targets->elements[i]) != lastp)
3204         {
3205           if (!solv->updatemap.size)
3206             map_grow(&solv->updatemap, installed->end - installed->start);
3207           MAPSET(&solv->updatemap, p - installed->start);
3208           update_targets->elements[j++] = 0;                    /* finish old set */
3209           update_targets->elements[p - installed->start] = j;   /* start new set */
3210           lastp = p;
3211           lastq = 0;
3212         }
3213       if ((q = update_targets->elements[i + 1]) != lastq)
3214         {
3215           update_targets->elements[j++] = q;
3216           lastq = q;
3217         }
3218     }
3219   queue_truncate(update_targets, j);
3220   queue_push(update_targets, 0);        /* finish last set */
3221 }
3222
3223
3224 static void
3225 addedmap2deduceq(Solver *solv, Map *addedmap)
3226 {
3227   Pool *pool = solv->pool;
3228   int i, j;
3229   Id p;
3230   Rule *r;
3231
3232   queue_empty(&solv->addedmap_deduceq);
3233   for (i = 2, j = solv->pkgrules_end - 1; i < pool->nsolvables && j > 0; j--)
3234     {
3235       r = solv->rules + j;
3236       if (r->p >= 0)
3237         continue;
3238       if ((r->d == 0 || r->d == -1) && r->w2 < 0)
3239         continue;
3240       p = -r->p;
3241       if (!MAPTST(addedmap, p))
3242         {
3243           /* this can happen with complex dependencies that have more than one pos literal */
3244           if (!solv->addedmap_deduceq.count || solv->addedmap_deduceq.elements[solv->addedmap_deduceq.count - 1] != -p)
3245             queue_push(&solv->addedmap_deduceq, -p);
3246           continue;
3247         }
3248       for (; i < p; i++)
3249         if (MAPTST(addedmap, i))
3250           queue_push(&solv->addedmap_deduceq, i);
3251       if (i == p)
3252         i++;
3253     }
3254   for (; i < pool->nsolvables; i++)
3255     if (MAPTST(addedmap, i))
3256       queue_push(&solv->addedmap_deduceq, i);
3257 }
3258
3259 static void
3260 deduceq2addedmap(Solver *solv, Map *addedmap)
3261 {
3262   int j;
3263   Id p;
3264   Rule *r;
3265   for (j = solv->pkgrules_end - 1; j > 0; j--)
3266     {
3267       r = solv->rules + j;
3268       if (r->d < 0 && r->p)
3269         solver_enablerule(solv, r);
3270       if (r->p >= 0)
3271         continue;
3272       if ((r->d == 0 || r->d == -1) && r->w2 < 0)
3273         continue;
3274       p = -r->p;
3275       MAPSET(addedmap, p);
3276     }
3277   for (j = 0; j < solv->addedmap_deduceq.count; j++)
3278     {
3279       p = solv->addedmap_deduceq.elements[j];
3280       if (p > 0)
3281         MAPSET(addedmap, p);
3282       else
3283         MAPCLR(addedmap, -p);
3284     }
3285 }
3286
3287 #ifdef ENABLE_COMPLEX_DEPS
3288 static int
3289 add_complex_jobrules(Solver *solv, Id dep, int flags, int jobidx, int weak)
3290 {
3291   Pool *pool = solv->pool;
3292   Queue bq;
3293   int i, j;
3294
3295   queue_init(&bq);
3296   i = pool_normalize_complex_dep(pool, dep, &bq, flags | CPLXDEPS_EXPAND);
3297   if (i == 0 || i == 1)
3298     {
3299       queue_free(&bq);
3300       if (i == 0)
3301         solver_addjobrule(solv, -SYSTEMSOLVABLE, 0, 0, jobidx, weak);
3302       return 0;
3303     }
3304   for (i = 0; i < bq.count; i++)
3305     {
3306       if (!bq.elements[i])
3307         continue;
3308       for (j = 0; bq.elements[i + j + 1]; j++)
3309         ;
3310       if (j > 1)
3311         solver_addjobrule(solv, bq.elements[i], 0, pool_ids2whatprovides(pool, bq.elements + i + 1, j), jobidx, weak);
3312       else
3313         solver_addjobrule(solv, bq.elements[i], bq.elements[i + 1], 0, jobidx, weak);
3314       i += j + 1;
3315     }
3316   queue_free(&bq);
3317   return 1;
3318 }
3319 #endif
3320
3321 static void
3322 setup_favormap(Solver *solv)
3323 {
3324   Queue *job = &solv->job;
3325   Pool *pool = solv->pool;
3326   int i, idx;
3327   Id p, pp, how, what, select;
3328
3329   solv_free(solv->favormap);
3330   solv->favormap = solv_calloc(pool->nsolvables, sizeof(Id));
3331   for (i = 0; i < job->count; i += 2)
3332     {
3333       how = job->elements[i];
3334       if ((how & SOLVER_JOBMASK) != SOLVER_FAVOR && (how & SOLVER_JOBMASK) != SOLVER_DISFAVOR)
3335         continue;
3336       what = job->elements[i + 1];
3337       select = how & SOLVER_SELECTMASK;
3338       idx = (how & SOLVER_JOBMASK) == SOLVER_FAVOR ? i + 1 : -(i + 1);
3339       if (select == SOLVER_SOLVABLE_REPO)
3340         {
3341           Repo *repo = pool_id2repo(pool, what);
3342           if (repo)
3343             {
3344               Solvable *s;
3345               FOR_REPO_SOLVABLES(repo, p, s)
3346                 {
3347                   solv->favormap[p] = idx;
3348                   if (idx < 0)
3349                     solv->havedisfavored = 1;
3350                 }
3351             }
3352         }
3353       FOR_JOB_SELECT(p, pp, select, what)
3354         {
3355           solv->favormap[p] = idx;
3356           if (idx < 0)
3357             solv->havedisfavored = 1;
3358         }
3359     }
3360 }
3361
3362 /*
3363  *
3364  * solve job queue
3365  *
3366  */
3367
3368 int
3369 solver_solve(Solver *solv, Queue *job)
3370 {
3371   Pool *pool = solv->pool;
3372   Repo *installed = solv->installed;
3373   int i;
3374   int oldnrules, initialnrules;
3375   Map addedmap;                /* '1' == have pkg-rules for solvable */
3376   Map installcandidatemap;
3377   Id how, what, select, name, weak, p, pp, d;
3378   Queue q;
3379   Solvable *s, *name_s;
3380   Rule *r;
3381   int now, solve_start;
3382   int needduprules = 0;
3383   int hasbestinstalljob = 0;
3384   int hasfavorjob = 0;
3385   int haslockjob = 0;
3386   int hasblacklistjob = 0;
3387
3388   solve_start = solv_timems(0);
3389
3390   /* log solver options */
3391   POOL_DEBUG(SOLV_DEBUG_STATS, "solver started\n");
3392   POOL_DEBUG(SOLV_DEBUG_STATS, "dosplitprovides=%d, noupdateprovide=%d, noinfarchcheck=%d\n", solv->dosplitprovides, solv->noupdateprovide, solv->noinfarchcheck);
3393   POOL_DEBUG(SOLV_DEBUG_STATS, "allowuninstall=%d, allowdowngrade=%d, allownamechange=%d, allowarchchange=%d, allowvendorchange=%d\n", solv->allowuninstall, solv->allowdowngrade, solv->allownamechange, solv->allowarchchange, solv->allowvendorchange);
3394   POOL_DEBUG(SOLV_DEBUG_STATS, "dupallowdowngrade=%d, dupallownamechange=%d, dupallowarchchange=%d, dupallowvendorchange=%d\n", solv->dup_allowdowngrade, solv->dup_allownamechange, solv->dup_allowarchchange, solv->dup_allowvendorchange);
3395   POOL_DEBUG(SOLV_DEBUG_STATS, "promoteepoch=%d, forbidselfconflicts=%d\n", pool->promoteepoch, pool->forbidselfconflicts);
3396   POOL_DEBUG(SOLV_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d, obsoleteusescolors=%d, implicitobsoleteusescolors=%d\n", pool->obsoleteusesprovides, pool->implicitobsoleteusesprovides, pool->obsoleteusescolors, pool->implicitobsoleteusescolors);
3397   POOL_DEBUG(SOLV_DEBUG_STATS, "dontinstallrecommended=%d, addalreadyrecommended=%d onlynamespacerecommended=%d\n", solv->dontinstallrecommended, solv->addalreadyrecommended, solv->only_namespace_recommended);
3398
3399   /* create whatprovides if not already there */
3400   if (!pool->whatprovides)
3401     pool_createwhatprovides(pool);
3402
3403   /* create obsolete index */
3404   policy_create_obsolete_index(solv);
3405
3406   /* remember job */
3407   queue_free(&solv->job);
3408   queue_init_clone(&solv->job, job);
3409   solv->pooljobcnt = pool->pooljobs.count;
3410   if (pool->pooljobs.count)
3411     queue_insertn(&solv->job, 0, pool->pooljobs.count, pool->pooljobs.elements);
3412   job = &solv->job;
3413
3414   /* free old stuff in case we re-run a solver */
3415   queuep_free(&solv->update_targets);
3416   queuep_free(&solv->cleandeps_updatepkgs);
3417   queue_empty(&solv->ruleassertions);
3418   solv->bestrules_info = solv_free(solv->bestrules_info);
3419   solv->yumobsrules_info = solv_free(solv->yumobsrules_info);
3420   solv->recommendsrules_info = solv_free(solv->recommendsrules_info);
3421   solv->choicerules_info = solv_free(solv->choicerules_info);
3422   if (solv->noupdate.size)
3423     map_empty(&solv->noupdate);
3424   map_zerosize(&solv->multiversion);
3425   solv->updatemap_all = 0;
3426   map_zerosize(&solv->updatemap);
3427   solv->bestupdatemap_all = 0;
3428   map_zerosize(&solv->bestupdatemap);
3429   solv->fixmap_all = 0;
3430   map_zerosize(&solv->fixmap);
3431   map_zerosize(&solv->dupmap);
3432   map_zerosize(&solv->dupinvolvedmap);
3433   solv->process_orphans = 0;
3434   solv->droporphanedmap_all = 0;
3435   map_zerosize(&solv->droporphanedmap);
3436   solv->allowuninstall_all = 0;
3437   map_zerosize(&solv->allowuninstallmap);
3438   map_zerosize(&solv->cleandepsmap);
3439   map_zerosize(&solv->weakrulemap);
3440   solv->favormap = solv_free(solv->favormap);
3441   queue_empty(&solv->weakruleq);
3442   solv->watches = solv_free(solv->watches);
3443   queue_empty(&solv->ruletojob);
3444   if (solv->decisionq.count)
3445     memset(solv->decisionmap, 0, pool->nsolvables * sizeof(Id));
3446   queue_empty(&solv->decisionq);
3447   queue_empty(&solv->decisionq_why);
3448   queue_empty(&solv->decisionq_reason);
3449   queue_empty(&solv->learnt_why);
3450   queue_empty(&solv->learnt_pool);
3451   queue_empty(&solv->branches);
3452   solv->propagate_index = 0;
3453   queue_empty(&solv->problems);
3454   queue_empty(&solv->solutions);
3455   queue_empty(&solv->orphaned);
3456   solv->stats_learned = solv->stats_unsolvable = 0;
3457   if (solv->recommends_index)
3458     {
3459       map_empty(&solv->recommendsmap);
3460       map_empty(&solv->suggestsmap);
3461       queuep_free(&solv->recommendscplxq);
3462       queuep_free(&solv->suggestscplxq);
3463       solv->recommends_index = 0;
3464     }
3465   queuep_free(&solv->brokenorphanrules);
3466   solv->specialupdaters = solv_free(solv->specialupdaters);
3467
3468
3469   /*
3470    * create basic rule set of all involved packages
3471    * use addedmap bitmap to make sure we don't create rules twice
3472    */
3473
3474   /* create multiversion map if needed */
3475   solver_calculate_multiversionmap(pool, job, &solv->multiversion);
3476
3477   map_init(&addedmap, pool->nsolvables);
3478   MAPSET(&addedmap, SYSTEMSOLVABLE);
3479
3480   map_init(&installcandidatemap, pool->nsolvables);
3481   queue_init(&q);
3482
3483   now = solv_timems(0);
3484   /*
3485    * create rules for all package that could be involved with the solving
3486    * so called: pkg rules
3487    *
3488    */
3489   initialnrules = solv->pkgrules_end ? solv->pkgrules_end : 1;
3490   if (initialnrules > 1)
3491     deduceq2addedmap(solv, &addedmap);          /* also enables all pkg rules */
3492   if (solv->nrules != initialnrules)
3493     solver_shrinkrules(solv, initialnrules);    /* shrink to just pkg rules */
3494   solv->lastpkgrule = 0;
3495   solv->pkgrules_end = 0;
3496
3497   if (installed)
3498     {
3499       /* check for update/verify jobs as they need to be known early */
3500       /* also setup the droporphaned map, we need it when creating update rules */
3501       for (i = 0; i < job->count; i += 2)
3502         {
3503           how = job->elements[i];
3504           what = job->elements[i + 1];
3505           select = how & SOLVER_SELECTMASK;
3506           switch (how & SOLVER_JOBMASK)
3507             {
3508             case SOLVER_VERIFY:
3509               if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3510                 solv->fixmap_all = 1;
3511               FOR_JOB_SELECT(p, pp, select, what)
3512                 {
3513                   s = pool->solvables + p;
3514                   if (s->repo != installed)
3515                     continue;
3516                   if (!solv->fixmap.size)
3517                     map_grow(&solv->fixmap, installed->end - installed->start);
3518                   MAPSET(&solv->fixmap, p - installed->start);
3519                 }
3520               break;
3521             case SOLVER_UPDATE:
3522               if (select == SOLVER_SOLVABLE_ALL)
3523                 {
3524                   solv->updatemap_all = 1;
3525                   if (how & SOLVER_FORCEBEST)
3526                     solv->bestupdatemap_all = 1;
3527                   if (how & SOLVER_CLEANDEPS)
3528                     {
3529                       FOR_REPO_SOLVABLES(installed, p, s)
3530                         add_cleandeps_updatepkg(solv, p);
3531                     }
3532                 }
3533               else if (select == SOLVER_SOLVABLE_REPO)
3534                 {
3535                   Repo *repo = pool_id2repo(pool, what);
3536                   if (!repo)
3537                     break;
3538                   if (repo == installed && !(how & SOLVER_TARGETED))
3539                     {
3540                       solv->updatemap_all = 1;
3541                       if (how & SOLVER_FORCEBEST)
3542                         solv->bestupdatemap_all = 1;
3543                       if (how & SOLVER_CLEANDEPS)
3544                         {
3545                           FOR_REPO_SOLVABLES(installed, p, s)
3546                             add_cleandeps_updatepkg(solv, p);
3547                         }
3548                       break;
3549                     }
3550                   if (solv->noautotarget && !(how & SOLVER_TARGETED))
3551                     break;
3552                   /* targeted update */
3553                   FOR_REPO_SOLVABLES(repo, p, s)
3554                     add_update_target(solv, p, how);
3555                 }
3556               else
3557                 {
3558                   if (!(how & SOLVER_TARGETED))
3559                     {
3560                       int targeted = 1;
3561                       FOR_JOB_SELECT(p, pp, select, what)
3562                         {
3563                           s = pool->solvables + p;
3564                           if (s->repo != installed)
3565                             continue;
3566                           if (!solv->updatemap.size)
3567                             map_grow(&solv->updatemap, installed->end - installed->start);
3568                           MAPSET(&solv->updatemap, p - installed->start);
3569                           if (how & SOLVER_FORCEBEST)
3570                             {
3571                               if (!solv->bestupdatemap.size)
3572                                 map_grow(&solv->bestupdatemap, installed->end - installed->start);
3573                               MAPSET(&solv->bestupdatemap, p - installed->start);
3574                             }
3575                           if (how & SOLVER_CLEANDEPS)
3576                             add_cleandeps_updatepkg(solv, p);
3577                           targeted = 0;
3578                         }
3579                       if (!targeted || solv->noautotarget)
3580                         break;
3581                     }
3582                   FOR_JOB_SELECT(p, pp, select, what)
3583                     add_update_target(solv, p, how);
3584                 }
3585               break;
3586             case SOLVER_DROP_ORPHANED:
3587               if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3588                 solv->droporphanedmap_all = 1;
3589               FOR_JOB_SELECT(p, pp, select, what)
3590                 {
3591                   s = pool->solvables + p;
3592                   if (s->repo != installed)
3593                     continue;
3594                   if (!solv->droporphanedmap.size)
3595                     map_grow(&solv->droporphanedmap, installed->end - installed->start);
3596                   MAPSET(&solv->droporphanedmap, p - installed->start);
3597                 }
3598               break;
3599             case SOLVER_ALLOWUNINSTALL:
3600               if (select == SOLVER_SOLVABLE_ALL || (select == SOLVER_SOLVABLE_REPO && installed && what == installed->repoid))
3601                 solv->allowuninstall_all = 1;
3602               FOR_JOB_SELECT(p, pp, select, what)
3603                 {
3604                   s = pool->solvables + p;
3605                   if (s->repo != installed)
3606                     continue;
3607                   if (!solv->allowuninstallmap.size)
3608                     map_grow(&solv->allowuninstallmap, installed->end - installed->start);
3609                   MAPSET(&solv->allowuninstallmap, p - installed->start);
3610                 }
3611               break;
3612             default:
3613               break;
3614             }
3615         }
3616
3617       if (solv->update_targets)
3618         transform_update_targets(solv);
3619
3620       oldnrules = solv->nrules;
3621       FOR_REPO_SOLVABLES(installed, p, s)
3622         solver_addpkgrulesforsolvable(solv, s, &addedmap);
3623       POOL_DEBUG(SOLV_DEBUG_STATS, "added %d pkg rules for installed solvables\n", solv->nrules - oldnrules);
3624       oldnrules = solv->nrules;
3625       FOR_REPO_SOLVABLES(installed, p, s)
3626         solver_addpkgrulesforupdaters(solv, s, &addedmap, 1);
3627       POOL_DEBUG(SOLV_DEBUG_STATS, "added %d pkg rules for updaters of installed solvables\n", solv->nrules - oldnrules);
3628     }
3629
3630   /*
3631    * create rules for all packages involved in the job
3632    * (to be installed or removed)
3633    */
3634
3635   oldnrules = solv->nrules;
3636   for (i = 0; i < job->count; i += 2)
3637     {
3638       how = job->elements[i];
3639       what = job->elements[i + 1];
3640       select = how & SOLVER_SELECTMASK;
3641
3642       switch (how & SOLVER_JOBMASK)
3643         {
3644         case SOLVER_INSTALL:
3645           FOR_JOB_SELECT(p, pp, select, what)
3646             {
3647               MAPSET(&installcandidatemap, p);
3648               solver_addpkgrulesforsolvable(solv, pool->solvables + p, &addedmap);
3649             }
3650           break;
3651         case SOLVER_DISTUPGRADE:
3652           needduprules = 1;
3653           if (select == SOLVER_SOLVABLE_ALL)
3654             solv->process_orphans = 1;
3655           break;
3656         default:
3657           break;
3658         }
3659     }
3660   POOL_DEBUG(SOLV_DEBUG_STATS, "added %d pkg rules for packages involved in a job\n", solv->nrules - oldnrules);
3661
3662
3663   /*
3664    * add rules for suggests, enhances
3665    */
3666   oldnrules = solv->nrules;
3667   solver_addpkgrulesforweak(solv, &addedmap);
3668   POOL_DEBUG(SOLV_DEBUG_STATS, "added %d pkg rules because of weak dependencies\n", solv->nrules - oldnrules);
3669
3670 #ifdef ENABLE_LINKED_PKGS
3671   oldnrules = solv->nrules;
3672   solver_addpkgrulesforlinked(solv, &addedmap);
3673   POOL_DEBUG(SOLV_DEBUG_STATS, "added %d pkg rules because of linked packages\n", solv->nrules - oldnrules);
3674 #endif
3675
3676   /*
3677    * first pass done, we now have all the pkg rules we need.
3678    * unify existing rules before going over all job rules and
3679    * policy rules.
3680    * at this point the system is always solvable,
3681    * as an empty system (remove all packages) is a valid solution
3682    */
3683
3684   IF_POOLDEBUG (SOLV_DEBUG_STATS)
3685     {
3686       int possible = 0, installable = 0;
3687       for (i = 1; i < pool->nsolvables; i++)
3688         {
3689           if (pool_installable(pool, pool->solvables + i))
3690             installable++;
3691           if (MAPTST(&addedmap, i))
3692             possible++;
3693         }
3694       POOL_DEBUG(SOLV_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
3695     }
3696
3697   if (solv->nrules > initialnrules)
3698     solver_unifyrules(solv);                    /* remove duplicate pkg rules */
3699   solv->pkgrules_end = solv->nrules;            /* mark end of pkg rules */
3700   solv->lastpkgrule = 0;
3701
3702   if (solv->nrules > initialnrules)
3703     addedmap2deduceq(solv, &addedmap);          /* so that we can recreate the addedmap */
3704
3705   POOL_DEBUG(SOLV_DEBUG_STATS, "pkg rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
3706   POOL_DEBUG(SOLV_DEBUG_STATS, "pkg rule creation took %d ms\n", solv_timems(now));
3707
3708   /* create dup maps if needed. We need the maps early to create our
3709    * update rules */
3710   if (needduprules)
3711     solver_createdupmaps(solv);
3712
3713   /*
3714    * create feature rules
3715    *
3716    * foreach installed:
3717    *   create assertion (keep installed, if no update available)
3718    *   or
3719    *   create update rule (A|update1(A)|update2(A)|...)
3720    *
3721    * those are used later on to keep a version of the installed packages in
3722    * best effort mode
3723    */
3724
3725   solv->featurerules = solv->nrules;              /* mark start of feature rules */
3726   if (installed)
3727     {
3728       /* foreach possibly installed solvable */
3729       for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3730         {
3731           if (s->repo != installed)
3732             {
3733               solver_addrule(solv, 0, 0, 0);    /* create dummy rule */
3734               continue;
3735             }
3736           solver_addfeaturerule(solv, s);
3737         }
3738       /* make sure we accounted for all rules */
3739       assert(solv->nrules - solv->featurerules == installed->end - installed->start);
3740     }
3741   solv->featurerules_end = solv->nrules;
3742
3743     /*
3744      * Add update rules for installed solvables
3745      *
3746      * almost identical to feature rules
3747      * except that downgrades/archchanges/vendorchanges are not allowed
3748      */
3749
3750   solv->updaterules = solv->nrules;
3751
3752   if (installed)
3753     { /* foreach installed solvables */
3754       /* we create all update rules, but disable some later on depending on the job */
3755       for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
3756         {
3757           Rule *sr;
3758
3759           if (s->repo != installed)
3760             {
3761               solver_addrule(solv, 0, 0, 0);    /* create dummy rule */
3762               continue;
3763             }
3764           solver_addupdaterule(solv, s);
3765           /*
3766            * check for and remove duplicate
3767            */
3768           r = solv->rules + solv->nrules - 1;           /* r: update rule */
3769           sr = r - (installed->end - installed->start); /* sr: feature rule */
3770           if (!r->p)
3771             {
3772               if (sr->p)
3773                 memset(sr, 0, sizeof(*sr));             /* no feature rules without update rules */
3774               continue;
3775             }
3776           /* it's also orphaned if the feature rule consists just of the installed package */
3777           if (!solv->process_orphans && sr->p == i && !sr->d && !sr->w2)
3778             queue_push(&solv->orphaned, i);
3779
3780           if (!solver_rulecmp(solv, r, sr))
3781             memset(sr, 0, sizeof(*sr));         /* delete unneeded feature rule */
3782           else if (sr->p)
3783             solver_disablerule(solv, sr);       /* disable feature rule for now */
3784         }
3785       /* consistency check: we added a rule for _every_ installed solvable */
3786       assert(solv->nrules - solv->updaterules == installed->end - installed->start);
3787     }
3788   solv->updaterules_end = solv->nrules;
3789
3790
3791   /*
3792    * now add all job rules
3793    */
3794
3795   solv->jobrules = solv->nrules;
3796   for (i = 0; i < job->count; i += 2)
3797     {
3798       oldnrules = solv->nrules;
3799
3800       if (i && i == solv->pooljobcnt)
3801         POOL_DEBUG(SOLV_DEBUG_JOB, "end of pool jobs\n");
3802       how = job->elements[i];
3803       what = job->elements[i + 1];
3804       weak = how & SOLVER_WEAK;
3805       select = how & SOLVER_SELECTMASK;
3806       switch (how & SOLVER_JOBMASK)
3807         {
3808         case SOLVER_INSTALL:
3809           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3810           if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3811             map_grow(&solv->cleandepsmap, installed->end - installed->start);
3812           if (select == SOLVER_SOLVABLE)
3813             {
3814               p = what;
3815               d = 0;
3816             }
3817 #ifdef ENABLE_COMPLEX_DEPS
3818           else if ((select == SOLVER_SOLVABLE_PROVIDES || select == SOLVER_SOLVABLE_NAME) && pool_is_complex_dep(pool, what))
3819             {
3820               if (add_complex_jobrules(solv, what, select == SOLVER_SOLVABLE_NAME ? CPLXDEPS_NAME : 0, i, weak))
3821                 if (how & SOLVER_FORCEBEST)
3822                   hasbestinstalljob = 1;
3823               break;
3824             }
3825 #endif
3826           else
3827             {
3828               queue_empty(&q);
3829               FOR_JOB_SELECT(p, pp, select, what)
3830                 queue_push(&q, p);
3831               if (!q.count)
3832                 {
3833                   if (select == SOLVER_SOLVABLE_ONE_OF)
3834                     break;      /* ignore empty installs */
3835                   /* no candidate found or unsupported, make this an impossible rule */
3836                   queue_push(&q, -SYSTEMSOLVABLE);
3837                 }
3838               p = queue_shift(&q);      /* get first candidate */
3839               d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q);    /* internalize */
3840             }
3841           /* force install of namespace supplements hack */
3842           if (select == SOLVER_SOLVABLE_PROVIDES && !d && (p == SYSTEMSOLVABLE || p == -SYSTEMSOLVABLE) && ISRELDEP(what))
3843             {
3844               Reldep *rd = GETRELDEP(pool, what);
3845               if (rd->flags == REL_NAMESPACE)
3846                 {
3847                   p = SYSTEMSOLVABLE;
3848                   if (!solv->installsuppdepq)
3849                     {
3850                       solv->installsuppdepq = solv_calloc(1, sizeof(Queue));
3851                       queue_init(solv->installsuppdepq);
3852                     }
3853                   queue_pushunique(solv->installsuppdepq, rd->evr == 0 ? rd->name : what);
3854                 }
3855             }
3856           solver_addjobrule(solv, p, 0, d, i, weak);
3857           if (how & SOLVER_FORCEBEST)
3858             hasbestinstalljob = 1;
3859           break;
3860         case SOLVER_ERASE:
3861           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %s%serase %s\n", weak ? "weak " : "", how & SOLVER_CLEANDEPS ? "clean deps " : "", solver_select2str(pool, select, what));
3862           if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && installed)
3863             map_grow(&solv->cleandepsmap, installed->end - installed->start);
3864           /* specific solvable: by id or by nevra */
3865           name = (select == SOLVER_SOLVABLE || (select == SOLVER_SOLVABLE_NAME && ISRELDEP(what))) ? 0 : -1;
3866           name_s = 0;
3867           if (select == SOLVER_SOLVABLE_ALL)    /* hmmm ;) */
3868             {
3869               FOR_POOL_SOLVABLES(p)
3870                 solver_addjobrule(solv, -p, 0, 0, i, weak);
3871             }
3872           else if (select == SOLVER_SOLVABLE_REPO)
3873             {
3874               Repo *repo = pool_id2repo(pool, what);
3875               if (repo)
3876                 {
3877                   FOR_REPO_SOLVABLES(repo, p, s)
3878                     solver_addjobrule(solv, -p, 0, 0, i, weak);
3879                 }
3880             }
3881 #ifdef ENABLE_COMPLEX_DEPS
3882           else if ((select == SOLVER_SOLVABLE_PROVIDES || select == SOLVER_SOLVABLE_NAME) && pool_is_complex_dep(pool, what))
3883             {
3884               /* no special "erase a specific solvable" handling? */
3885               add_complex_jobrules(solv, what, select == SOLVER_SOLVABLE_NAME ? (CPLXDEPS_NAME | CPLXDEPS_TODNF | CPLXDEPS_INVERT) : (CPLXDEPS_TODNF | CPLXDEPS_INVERT), i, weak);
3886               break;
3887             }
3888 #endif
3889           FOR_JOB_SELECT(p, pp, select, what)
3890             {
3891               s = pool->solvables + p;
3892               if (installed && s->repo == installed)
3893                 {
3894                   name = !name ? s->name : -1;
3895                   name_s = s;
3896                 }
3897               solver_addjobrule(solv, -p, 0, 0, i, weak);
3898 #ifdef ENABLE_LINKED_PKGS
3899               if (solv->instbuddy && installed && s->repo == installed && solv->instbuddy[p - installed->start] > 1)
3900                 solver_addjobrule(solv, -solv->instbuddy[p - installed->start], 0, 0, i, weak);
3901 #endif
3902             }
3903           /* special case for "erase a specific solvable": we also
3904            * erase all other solvables with that name, so that they
3905            * don't get picked up as replacement.
3906            * name is > 0 if exactly one installed solvable matched.
3907            */
3908           /* XXX: look also at packages that obsolete this package? */
3909           if (name > 0)
3910             {
3911               int j, k;
3912               k = solv->nrules;
3913               FOR_PROVIDES(p, pp, name)
3914                 {
3915                   s = pool->solvables + p;
3916                   if (s->name != name)
3917                     continue;
3918                   /* keep other versions installed */
3919                   if (s->repo == installed)
3920                     continue;
3921                   /* keep installcandidates of other jobs */
3922                   if (MAPTST(&installcandidatemap, p))
3923                     continue;
3924                   if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, name_s, s))
3925                     continue;
3926                   /* don't add the same rule twice */
3927                   for (j = oldnrules; j < k; j++)
3928                     if (solv->rules[j].p == -p)
3929                       break;
3930                   if (j == k)
3931                     solver_addjobrule(solv, -p, 0, 0, i, weak); /* remove by id */
3932                 }
3933             }
3934           break;
3935
3936         case SOLVER_UPDATE:
3937           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3938           break;
3939         case SOLVER_VERIFY:
3940           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sverify %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3941           break;
3942         case SOLVER_WEAKENDEPS:
3943           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3944           if (select != SOLVER_SOLVABLE)
3945             break;
3946           s = pool->solvables + what;
3947           weaken_solvable_deps(solv, what);
3948           break;
3949         case SOLVER_MULTIVERSION:
3950           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %smultiversion %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3951           break;
3952         case SOLVER_LOCK:
3953           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
3954           if (select == SOLVER_SOLVABLE_ALL)
3955             {
3956               FOR_POOL_SOLVABLES(p)
3957                 solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, 0, i, weak);
3958             }
3959           else if (select == SOLVER_SOLVABLE_REPO)
3960             {
3961               Repo *repo = pool_id2repo(pool, what);
3962               if (repo)
3963                 {
3964                   FOR_REPO_SOLVABLES(repo, p, s)
3965                     solver_addjobrule(solv, installed && pool->solvables[p].repo == installed ? p : -p, 0, 0, i, weak);
3966                 }
3967             }
3968           FOR_JOB_SELECT(p, pp, select, what)
3969             {
3970               s = pool->solvables + p;
3971               solver_addjobrule(solv, installed && s->repo == installed ? p : -p, 0, 0, i, weak);
3972 #ifdef ENABLE_LINKED_PKGS
3973               if (solv->instbuddy && installed && s->repo == installed && solv->instbuddy[p - installed->start] > 1)
3974                 solver_addjobrule(solv, solv->instbuddy[p - installed->start], 0, 0, i, weak);
3975 #endif
3976             }
3977           if (solv->nrules != oldnrules)
3978             haslockjob = 1;
3979           break;
3980         case SOLVER_DISTUPGRADE:
3981           POOL_DEBUG(SOLV_DEBUG_JOB, "job: distupgrade %s\n", solver_select2str(pool, select, what));
3982           break;
3983         case SOLVER_DROP_ORPHANED:
3984           POOL_DEBUG(SOLV_DEBUG_JOB, "job: drop orphaned %s\n", solver_select2str(pool, select, what));
3985           break;
3986         case SOLVER_USERINSTALLED:
3987           POOL_DEBUG(SOLV_DEBUG_JOB, "job: user installed %s\n", solver_select2str(pool, select, what));
3988           break;
3989         case SOLVER_ALLOWUNINSTALL:
3990           POOL_DEBUG(SOLV_DEBUG_JOB, "job: allowuninstall %s\n", solver_select2str(pool, select, what));
3991           break;
3992         case SOLVER_FAVOR:
3993         case SOLVER_DISFAVOR:
3994           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %s %s\n", (how & SOLVER_JOBMASK) == SOLVER_FAVOR ? "favor" : "disfavor", solver_select2str(pool, select, what));
3995           hasfavorjob = 1;
3996           break;
3997         case SOLVER_BLACKLIST:
3998           POOL_DEBUG(SOLV_DEBUG_JOB, "job: blacklist %s\n", solver_select2str(pool, select, what));
3999           hasblacklistjob = 1;
4000           break;
4001         default:
4002           POOL_DEBUG(SOLV_DEBUG_JOB, "job: unknown job\n");
4003           break;
4004         }
4005
4006       IF_POOLDEBUG (SOLV_DEBUG_JOB)
4007         {
4008           int j;
4009           if (solv->nrules == oldnrules)
4010             POOL_DEBUG(SOLV_DEBUG_JOB, "  - no rule created\n");
4011           for (j = oldnrules; j < solv->nrules; j++)
4012             {
4013               POOL_DEBUG(SOLV_DEBUG_JOB, "  - job ");
4014               solver_printrule(solv, SOLV_DEBUG_JOB, solv->rules + j);
4015             }
4016         }
4017     }
4018   assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
4019   solv->jobrules_end = solv->nrules;
4020
4021   /* create favormap if we have favor jobs */
4022   if (hasfavorjob)
4023     setup_favormap(solv);
4024
4025   /* now create infarch and dup rules */
4026   if (!solv->noinfarchcheck)
4027     solver_addinfarchrules(solv, &addedmap);
4028   else
4029     solv->infarchrules = solv->infarchrules_end = solv->nrules;
4030
4031   if (solv->dupinvolvedmap_all || solv->dupinvolvedmap.size)
4032     solver_addduprules(solv, &addedmap);
4033   else
4034     solv->duprules = solv->duprules_end = solv->nrules;
4035
4036 #ifdef ENABLE_LINKED_PKGS
4037   if (solv->instbuddy && solv->updatemap.size)
4038     extend_updatemap_to_buddies(solv);
4039 #endif
4040
4041   if (solv->bestupdatemap_all || solv->bestupdatemap.size || hasbestinstalljob)
4042     solver_addbestrules(solv, hasbestinstalljob, haslockjob);
4043   else
4044     solv->bestrules = solv->bestrules_end = solv->bestrules_up = solv->nrules;
4045
4046   if (needduprules)
4047     solver_freedupmaps(solv);   /* no longer needed */
4048
4049   if (solv->do_yum_obsoletes)
4050     solver_addyumobsrules(solv);
4051   else
4052     solv->yumobsrules = solv->yumobsrules_end = solv->nrules;
4053
4054   if (hasblacklistjob)
4055     solver_addblackrules(solv);
4056   else
4057     solv->blackrules = solv->blackrules_end = solv->nrules;
4058
4059   if (solv->havedisfavored && solv->strongrecommends && solv->recommendsruleq)
4060     solver_addrecommendsrules(solv);
4061   else
4062     solv->recommendsrules = solv->recommendsrules_end = solv->nrules;
4063
4064   if (1)
4065     solver_addchoicerules(solv);
4066   else
4067     solv->choicerules = solv->choicerules_end = solv->nrules;
4068
4069   /* all rules created
4070    * --------------------------------------------------------------
4071    * prepare for solving
4072    */
4073
4074   /* free unneeded memory */
4075   map_free(&addedmap);
4076   map_free(&installcandidatemap);
4077   queue_free(&q);
4078
4079   POOL_DEBUG(SOLV_DEBUG_STATS, "%d pkg rules, 2 * %d update rules, %d job rules, %d infarch rules, %d dup rules, %d choice rules, %d best rules, %d yumobs rules\n", solv->pkgrules_end - 1, solv->updaterules_end - solv->updaterules, solv->jobrules_end - solv->jobrules, solv->infarchrules_end - solv->infarchrules, solv->duprules_end - solv->duprules, solv->choicerules_end - solv->choicerules, solv->bestrules_end - solv->bestrules, solv->yumobsrules_end - solv->yumobsrules);
4080   POOL_DEBUG(SOLV_DEBUG_STATS, "overall rule memory used: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
4081
4082   /* create weak map */
4083   if (solv->weakruleq.count || solv->recommendsruleq)
4084     {
4085       map_grow(&solv->weakrulemap, solv->nrules);
4086       for (i = 0; i < solv->weakruleq.count; i++)
4087         {
4088           p = solv->weakruleq.elements[i];
4089           MAPSET(&solv->weakrulemap, p);
4090         }
4091       if (solv->recommendsruleq)
4092         {
4093           for (i = 0; i < solv->recommendsruleq->count; i++)
4094             {
4095               p = solv->recommendsruleq->elements[i];
4096               MAPSET(&solv->weakrulemap, p);
4097             }
4098         }
4099     }
4100
4101   /* enable cleandepsmap creation if we have updatepkgs */
4102   if (solv->cleandeps_updatepkgs && !solv->cleandepsmap.size)
4103     map_grow(&solv->cleandepsmap, installed->end - installed->start);
4104   /* no mistakes */
4105   if (solv->cleandeps_mistakes)
4106     {
4107       queue_free(solv->cleandeps_mistakes);
4108       solv->cleandeps_mistakes = solv_free(solv->cleandeps_mistakes);
4109     }
4110
4111   /* all new rules are learnt after this point */
4112   solv->learntrules = solv->nrules;
4113
4114   /* create watches chains */
4115   makewatches(solv);
4116
4117   /* create assertion index. it is only used to speed up
4118    * makeruledecsions() a bit */
4119   for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
4120     if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
4121       queue_push(&solv->ruleassertions, i);
4122
4123   /* disable update rules that conflict with our job */
4124   solver_disablepolicyrules(solv);
4125
4126   /* break orphans if requested */
4127   if (solv->process_orphans && solv->orphaned.count && solv->break_orphans)
4128     solver_breakorphans(solv);
4129
4130   /*
4131    * ********************************************
4132    * solve!
4133    * ********************************************
4134    */
4135
4136   now = solv_timems(0);
4137   solver_run_sat(solv, 1, solv->dontinstallrecommended ? 0 : 1);
4138   POOL_DEBUG(SOLV_DEBUG_STATS, "solver took %d ms\n", solv_timems(now));
4139
4140   /*
4141    * prepare solution queue if there were problems
4142    */
4143   solver_prepare_solutions(solv);
4144
4145   POOL_DEBUG(SOLV_DEBUG_STATS, "final solver statistics: %d problems, %d learned rules, %d unsolvable\n", solv->problems.count / 2, solv->stats_learned, solv->stats_unsolvable);
4146   POOL_DEBUG(SOLV_DEBUG_STATS, "solver_solve took %d ms\n", solv_timems(solve_start));
4147
4148   /* return number of problems */
4149   return solv->problems.count ? solv->problems.count / 2 : 0;
4150 }
4151
4152 Transaction *
4153 solver_create_transaction(Solver *solv)
4154 {
4155   return transaction_create_decisionq(solv->pool, &solv->decisionq, &solv->multiversion);
4156 }
4157
4158 void solver_get_orphaned(Solver *solv, Queue *orphanedq)
4159 {
4160   queue_free(orphanedq);
4161   queue_init_clone(orphanedq, &solv->orphaned);
4162 }
4163
4164 void solver_get_cleandeps(Solver *solv, Queue *cleandepsq)
4165 {
4166   Pool *pool = solv->pool;
4167   Repo *installed = solv->installed;
4168   Solvable *s;
4169   Rule *r;
4170   Id p, pp, pr;
4171
4172   queue_empty(cleandepsq);
4173   if (!installed || !solv->cleandepsmap.size)
4174     return;
4175   FOR_REPO_SOLVABLES(installed, p, s)
4176     {
4177       if (!MAPTST(&solv->cleandepsmap, p - installed->start) || solv->decisionmap[p] >= 0)
4178         continue;
4179       /* now check the update rule */
4180       r = solv->rules + solv->updaterules + (p - solv->installed->start);
4181       if (r->p)
4182         {
4183           FOR_RULELITERALS(pr, pp, r)
4184             if (solv->decisionmap[pr] > 0)
4185               break;
4186           if (pr)
4187             continue;
4188         }
4189       queue_push(cleandepsq, p);
4190     }
4191 }
4192
4193 void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected)
4194 {
4195   Pool *pool = solv->pool;
4196   Queue redoq, disabledq;
4197   int goterase, i;
4198   Solvable *s;
4199   Rule *r;
4200   Map obsmap;
4201
4202   if (!recommendationsq && !suggestionsq)
4203     return;
4204
4205   map_init(&obsmap, pool->nsolvables);
4206   if (solv->installed)
4207     {
4208       Id obs, *obsp, p, po, ppo;
4209       for (p = solv->installed->start; p < solv->installed->end; p++)
4210         {
4211           s = pool->solvables + p;
4212           if (s->repo != solv->installed || !s->obsoletes)
4213             continue;
4214           if (solv->decisionmap[p] <= 0)
4215             continue;
4216           if (solv->multiversion.size && MAPTST(&solv->multiversion, p))
4217             continue;
4218           obsp = s->repo->idarraydata + s->obsoletes;
4219           /* foreach obsoletes */
4220           while ((obs = *obsp++) != 0)
4221             FOR_PROVIDES(po, ppo, obs)
4222               MAPSET(&obsmap, po);
4223         }
4224     }
4225
4226   queue_init(&redoq);
4227   queue_init(&disabledq);
4228   goterase = 0;
4229   /* disable all erase jobs (including weak "keep uninstalled" rules) */
4230   for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
4231     {
4232       if (r->d < 0)     /* disabled ? */
4233         continue;
4234       if (r->p >= 0)    /* install job? */
4235         continue;
4236       queue_push(&disabledq, i);
4237       solver_disablerule(solv, r);
4238       goterase++;
4239     }
4240
4241   if (goterase)
4242     {
4243       enabledisablelearntrules(solv);
4244       removedisabledconflicts(solv, &redoq);
4245     }
4246
4247   /*
4248    * find recommended packages
4249    */
4250   if (recommendationsq)
4251     {
4252       Id rec, *recp, p, pp;
4253
4254       queue_empty(recommendationsq);
4255       /* create map of all recommened packages */
4256       solv->recommends_index = -1;
4257       MAPZERO(&solv->recommendsmap);
4258
4259       /* put all packages the solver already chose in the map */
4260       for (i = 1; i < solv->decisionq.count; i++)
4261         if ((p = solv->decisionq.elements[i]) > 0 && solv->decisionq_why.elements[i] == 0)
4262           {
4263             if (solv->decisionq_reason.elements[solv->decisionmap[p]] == SOLVER_REASON_WEAKDEP)
4264               MAPSET(&solv->recommendsmap, p);
4265           }
4266
4267       for (i = 0; i < solv->decisionq.count; i++)
4268         {
4269           p = solv->decisionq.elements[i];
4270           if (p < 0)
4271             continue;
4272           s = pool->solvables + p;
4273           if (s->recommends)
4274             {
4275               recp = s->repo->idarraydata + s->recommends;
4276               while ((rec = *recp++) != 0)
4277                 {
4278 #ifdef ENABLE_COMPLEX_DEPS
4279                   if (pool_is_complex_dep(pool, rec))
4280                     {
4281                       do_complex_recommendations(solv, rec, &solv->recommendsmap, noselected);
4282                       continue;
4283                     }
4284 #endif
4285                   FOR_PROVIDES(p, pp, rec)
4286                     if (solv->decisionmap[p] > 0)
4287                       break;
4288                   if (p)
4289                     {
4290                       if (!noselected)
4291                         {
4292                           FOR_PROVIDES(p, pp, rec)
4293                             if (solv->decisionmap[p] > 0)
4294                               MAPSET(&solv->recommendsmap, p);
4295                         }
4296                       continue; /* p != 0: already fulfilled */
4297                     }
4298                   FOR_PROVIDES(p, pp, rec)
4299                     MAPSET(&solv->recommendsmap, p);
4300                 }
4301             }
4302         }
4303       for (i = 1; i < pool->nsolvables; i++)
4304         {
4305           if (solv->decisionmap[i] < 0)
4306             continue;
4307           if (solv->decisionmap[i] > 0 && noselected)
4308             continue;
4309           if (MAPTST(&obsmap, i))
4310             continue;
4311           s = pool->solvables + i;
4312           if (!MAPTST(&solv->recommendsmap, i))
4313             {
4314               if (!s->supplements)
4315                 continue;
4316               if (!pool_installable(pool, s))
4317                 continue;
4318               if (!solver_is_supplementing(solv, s))
4319                 continue;
4320             }
4321           queue_push(recommendationsq, i);
4322         }
4323       /* we use MODE_SUGGEST here so that repo prio is ignored */
4324       policy_filter_unwanted(solv, recommendationsq, POLICY_MODE_SUGGEST);
4325     }
4326
4327   /*
4328    * find suggested packages
4329    */
4330
4331   if (suggestionsq)
4332     {
4333       Id sug, *sugp, p, pp;
4334
4335       queue_empty(suggestionsq);
4336       /* create map of all suggests that are still open */
4337       solv->recommends_index = -1;
4338       MAPZERO(&solv->suggestsmap);
4339       for (i = 0; i < solv->decisionq.count; i++)
4340         {
4341           p = solv->decisionq.elements[i];
4342           if (p < 0)
4343             continue;
4344           s = pool->solvables + p;
4345           if (s->suggests)
4346             {
4347               sugp = s->repo->idarraydata + s->suggests;
4348               while ((sug = *sugp++) != 0)
4349                 {
4350 #ifdef ENABLE_COMPLEX_DEPS
4351                   if (pool_is_complex_dep(pool, sug))
4352                     {
4353                       do_complex_recommendations(solv, sug, &solv->suggestsmap, noselected);
4354                       continue;
4355                     }
4356 #endif
4357                   FOR_PROVIDES(p, pp, sug)
4358                     if (solv->decisionmap[p] > 0)
4359                       break;
4360                   if (p)
4361                     {
4362                       if (!noselected)
4363                         {
4364                           FOR_PROVIDES(p, pp, sug)
4365                             if (solv->decisionmap[p] > 0)
4366                               MAPSET(&solv->suggestsmap, p);
4367                         }
4368                       continue; /* already fulfilled */
4369                     }
4370                   FOR_PROVIDES(p, pp, sug)
4371                     MAPSET(&solv->suggestsmap, p);
4372                 }
4373             }
4374         }
4375       for (i = 1; i < pool->nsolvables; i++)
4376         {
4377           if (solv->decisionmap[i] < 0)
4378             continue;
4379           if (solv->decisionmap[i] > 0 && noselected)
4380             continue;
4381           if (MAPTST(&obsmap, i))
4382             continue;
4383           s = pool->solvables + i;
4384           if (!MAPTST(&solv->suggestsmap, i))
4385             {
4386               if (!s->enhances)
4387                 continue;
4388               if (!pool_installable(pool, s))
4389                 continue;
4390               if (!solver_is_enhancing(solv, s))
4391                 continue;
4392             }
4393           queue_push(suggestionsq, i);
4394         }
4395       policy_filter_unwanted(solv, suggestionsq, POLICY_MODE_SUGGEST);
4396     }
4397
4398   /* undo removedisabledconflicts */
4399   if (redoq.count)
4400     undo_removedisabledconflicts(solv, &redoq);
4401   queue_free(&redoq);
4402
4403   /* undo job rule disabling */
4404   for (i = 0; i < disabledq.count; i++)
4405     solver_enablerule(solv, solv->rules + disabledq.elements[i]);
4406   queue_free(&disabledq);
4407   map_free(&obsmap);
4408 }
4409
4410
4411 /***********************************************************************/
4412 /* disk usage computations */
4413
4414 /*-------------------------------------------------------------------
4415  *
4416  * calculate DU changes
4417  */
4418
4419 void
4420 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
4421 {
4422   Map installedmap;
4423
4424   solver_create_state_maps(solv, &installedmap, 0);
4425   pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
4426   map_free(&installedmap);
4427 }
4428
4429
4430 /*-------------------------------------------------------------------
4431  *
4432  * calculate changes in install size
4433  */
4434
4435 int
4436 solver_calc_installsizechange(Solver *solv)
4437 {
4438   Map installedmap;
4439   int change;
4440
4441   solver_create_state_maps(solv, &installedmap, 0);
4442   change = pool_calc_installsizechange(solv->pool, &installedmap);
4443   map_free(&installedmap);
4444   return change;
4445 }
4446
4447 void
4448 solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap)
4449 {
4450   pool_create_state_maps(solv->pool, &solv->decisionq, installedmap, conflictsmap);
4451 }
4452
4453 /*-------------------------------------------------------------------
4454  *
4455  * decision introspection
4456  */
4457
4458 int
4459 solver_get_decisionlevel(Solver *solv, Id p)
4460 {
4461   return solv->decisionmap[p];
4462 }
4463
4464 void
4465 solver_get_decisionqueue(Solver *solv, Queue *decisionq)
4466 {
4467   queue_free(decisionq);
4468   queue_init_clone(decisionq, &solv->decisionq);
4469 }
4470
4471 int
4472 solver_get_lastdecisionblocklevel(Solver *solv)
4473 {
4474   Id p;
4475   if (solv->decisionq.count == 0)
4476     return 0;
4477   p = solv->decisionq.elements[solv->decisionq.count - 1];
4478   if (p < 0)
4479     p = -p;
4480   return solv->decisionmap[p] < 0 ? -solv->decisionmap[p] : solv->decisionmap[p];
4481 }
4482
4483 void
4484 solver_get_decisionblock(Solver *solv, int level, Queue *decisionq)
4485 {
4486   Id p;
4487   int i;
4488
4489   queue_empty(decisionq);
4490   for (i = 0; i < solv->decisionq.count; i++)
4491     {
4492       p = solv->decisionq.elements[i];
4493       if (p < 0)
4494         p = -p;
4495       if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
4496         break;
4497     }
4498   if (i == solv->decisionq.count)
4499     return;
4500   for (i = 0; i < solv->decisionq.count; i++)
4501     {
4502       p = solv->decisionq.elements[i];
4503       if (p < 0)
4504         p = -p;
4505       if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
4506         queue_push(decisionq, p);
4507       else
4508         break;
4509     }
4510 }
4511
4512 int
4513 solver_describe_decision(Solver *solv, Id p, Id *infop)
4514 {
4515   int i;
4516   Id pp, why;
4517
4518   if (infop)
4519     *infop = 0;
4520   if (!solv->decisionmap[p])
4521     return SOLVER_REASON_UNRELATED;
4522   pp = solv->decisionmap[p] < 0 ? -p : p;
4523   for (i = 0; i < solv->decisionq.count; i++)
4524     if (solv->decisionq.elements[i] == pp)
4525       break;
4526   if (i == solv->decisionq.count)       /* just in case... */
4527     return SOLVER_REASON_UNRELATED;
4528   why = solv->decisionq_why.elements[i];
4529   if (infop)
4530     *infop = why > 0 ? why : -why;
4531   if (why > 0)
4532     return SOLVER_REASON_UNIT_RULE;
4533   i = solv->decisionmap[p] >= 0 ? solv->decisionmap[p] : -solv->decisionmap[p];
4534   return solv->decisionq_reason.elements[i];
4535 }
4536
4537
4538 void
4539 solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq)
4540 {
4541   Pool *pool = solv->pool;
4542   int i;
4543   int level = solv->decisionmap[p];
4544   int decisionno;
4545   Solvable *s;
4546
4547   queue_empty(whyq);
4548   if (level < 0)
4549     return;     /* huh? */
4550   for (decisionno = 0; decisionno < solv->decisionq.count; decisionno++)
4551     if (solv->decisionq.elements[decisionno] == p)
4552       break;
4553   if (decisionno == solv->decisionq.count)
4554     return;     /* huh? */
4555   i = solv->decisionmap[p] >= 0 ? solv->decisionmap[p] : -solv->decisionmap[p];
4556   if (solv->decisionq_reason.elements[i] != SOLVER_REASON_WEAKDEP)
4557     return;     /* huh? */
4558
4559   /* 1) list all packages that recommend us */
4560   for (i = 1; i < pool->nsolvables; i++)
4561     {
4562       Id *recp, rec, pp2, p2;
4563       if (solv->decisionmap[i] <= 0 || solv->decisionmap[i] >= level)
4564         continue;
4565       s = pool->solvables + i;
4566       if (!s->recommends)
4567         continue;
4568       if (!solv->addalreadyrecommended && s->repo == solv->installed)
4569         continue;
4570       recp = s->repo->idarraydata + s->recommends;
4571       while ((rec = *recp++) != 0)
4572         {
4573           int found = 0;
4574           FOR_PROVIDES(p2, pp2, rec)
4575             {
4576               if (p2 == p)
4577                 found = 1;
4578               else
4579                 {
4580                   /* if p2 is already installed, this recommends is ignored */
4581                   if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
4582                     break;
4583                 }
4584             }
4585           if (!p2 && found)
4586             {
4587               queue_push(whyq, SOLVER_REASON_RECOMMENDED);
4588               queue_push2(whyq, i, rec);
4589             }
4590         }
4591     }
4592   /* 2) list all supplements */
4593   s = pool->solvables + p;
4594   if (s->supplements && level > 0)
4595     {
4596       Id *supp, sup, pp2, p2;
4597       /* this is a hack. to use solver_dep_fulfilled we temporarily clear
4598        * everything above our level in the decisionmap */
4599       for (i = decisionno; i < solv->decisionq.count; i++ )
4600         {
4601           p2 = solv->decisionq.elements[i];
4602           if (p2 > 0)
4603             solv->decisionmap[p2] = -solv->decisionmap[p2];
4604         }
4605       supp = s->repo->idarraydata + s->supplements;
4606       while ((sup = *supp++) != 0)
4607         if (solver_dep_fulfilled(solv, sup))
4608           {
4609             int found = 0;
4610             /* let's see if this is an easy supp */
4611             FOR_PROVIDES(p2, pp2, sup)
4612               {
4613                 if (!solv->addalreadyrecommended && solv->installed)
4614                   {
4615                     if (pool->solvables[p2].repo == solv->installed)
4616                       continue;
4617                   }
4618                 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
4619                   {
4620                     queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
4621                     queue_push2(whyq, p2, sup);
4622                     found = 1;
4623                   }
4624               }
4625             if (!found)
4626               {
4627                 /* hard case, just note dependency with no package */
4628                 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
4629                 queue_push2(whyq, 0, sup);
4630               }
4631           }
4632       for (i = decisionno; i < solv->decisionq.count; i++)
4633         {
4634           p2 = solv->decisionq.elements[i];
4635           if (p2 > 0)
4636             solv->decisionmap[p2] = -solv->decisionmap[p2];
4637         }
4638     }
4639 }
4640
4641 void
4642 pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what)
4643 {
4644   Id p, pp;
4645   how &= SOLVER_SELECTMASK;
4646   queue_empty(pkgs);
4647   if (how == SOLVER_SOLVABLE_ALL)
4648     {
4649       FOR_POOL_SOLVABLES(p)
4650         queue_push(pkgs, p);
4651     }
4652   else if (how == SOLVER_SOLVABLE_REPO)
4653     {
4654       Repo *repo = pool_id2repo(pool, what);
4655       Solvable *s;
4656       if (repo)
4657         {
4658           FOR_REPO_SOLVABLES(repo, p, s)
4659             queue_push(pkgs, p);
4660         }
4661     }
4662   else
4663     {
4664       FOR_JOB_SELECT(p, pp, how, what)
4665         queue_push(pkgs, p);
4666     }
4667 }
4668
4669 int
4670 pool_isemptyupdatejob(Pool *pool, Id how, Id what)
4671 {
4672   Id p, pp, pi, pip;
4673   Id select = how & SOLVER_SELECTMASK;
4674   if ((how & SOLVER_JOBMASK) != SOLVER_UPDATE)
4675     return 0;
4676   if (select == SOLVER_SOLVABLE_ALL || select == SOLVER_SOLVABLE_REPO)
4677     return 0;
4678   if (!pool->installed)
4679     return 1;
4680   FOR_JOB_SELECT(p, pp, select, what)
4681     if (pool->solvables[p].repo == pool->installed)
4682       return 0;
4683   /* hard work */
4684   FOR_JOB_SELECT(p, pp, select, what)
4685     {
4686       Solvable *s = pool->solvables + p;
4687       FOR_PROVIDES(pi, pip, s->name)
4688         {
4689           Solvable *si = pool->solvables + pi;
4690           if (si->repo != pool->installed || si->name != s->name)
4691             continue;
4692           return 0;
4693         }
4694       if (s->obsoletes)
4695         {
4696           Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
4697           while ((obs = *obsp++) != 0)
4698             {
4699               FOR_PROVIDES(pi, pip, obs)
4700                 {
4701                   Solvable *si = pool->solvables + pi;
4702                   if (si->repo != pool->installed)
4703                     continue;
4704                   if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, si, obs))
4705                     continue;
4706                   if (pool->obsoleteusescolors && !pool_colormatch(pool, s, si))
4707                     continue;
4708                   return 0;
4709                 }
4710             }
4711         }
4712     }
4713   return 1;
4714 }
4715
4716 int
4717 solver_alternatives_count(Solver *solv)
4718 {
4719   Id *elements = solv->branches.elements;
4720   int res, count;
4721   for (res = 0, count = solv->branches.count; count; res++)
4722     count -= elements[count - 2];
4723   return res;
4724 }
4725
4726 int
4727 solver_get_alternative(Solver *solv, Id alternative, Id *idp, Id *fromp, Id *chosenp, Queue *choices, int *levelp)
4728 {
4729   int cnt = solver_alternatives_count(solv);
4730   int count = solv->branches.count;
4731   Id *elements = solv->branches.elements;
4732   if (choices)
4733     queue_empty(choices);
4734   if (alternative <= 0 || alternative > cnt)
4735     return 0;
4736   elements += count;
4737   for (; cnt > alternative; cnt--)
4738     elements -= elements[-2];
4739   if (levelp)
4740     *levelp = elements[-1];
4741   if (fromp)
4742     *fromp = elements[-4];
4743   if (idp)
4744     *idp = elements[-3];
4745   if (chosenp)
4746     {
4747       int i;
4748       *chosenp = 0;
4749       for (i = elements[-2]; i > 4; i--)
4750         {
4751           Id p = -elements[-i];
4752           if (p > 0 && solv->decisionmap[p] == elements[-1] + 1)
4753             {
4754               *chosenp = p;
4755               break;
4756             }
4757         }
4758     }
4759   if (choices)
4760     queue_insertn(choices, 0, elements[-2] - 4, elements - elements[-2]);
4761   return elements[-4] ? SOLVER_ALTERNATIVE_TYPE_RECOMMENDS : SOLVER_ALTERNATIVE_TYPE_RULE;
4762 }
4763
4764 const char *
4765 solver_select2str(Pool *pool, Id select, Id what)
4766 {
4767   const char *s;
4768   char *b;
4769   select &= SOLVER_SELECTMASK;
4770   if (select == SOLVER_SOLVABLE)
4771     return pool_solvid2str(pool, what);
4772   if (select == SOLVER_SOLVABLE_NAME)
4773     return pool_dep2str(pool, what);
4774   if (select == SOLVER_SOLVABLE_PROVIDES)
4775     {
4776       s = pool_dep2str(pool, what);
4777       b = pool_alloctmpspace(pool, 11 + strlen(s));
4778       sprintf(b, "providing %s", s);
4779       return b;
4780     }
4781   if (select == SOLVER_SOLVABLE_ONE_OF)
4782     {
4783       Id p;
4784       b = 0;
4785       while ((p = pool->whatprovidesdata[what++]) != 0)
4786         {
4787           s = pool_solvid2str(pool, p);
4788           if (b)
4789             b = pool_tmpappend(pool, b, ", ", s);
4790           else
4791             b = pool_tmpjoin(pool, s, 0, 0);
4792           pool_freetmpspace(pool, s);
4793         }
4794       return b ? b : "nothing";
4795     }
4796   if (select == SOLVER_SOLVABLE_REPO)
4797     {
4798       b = pool_alloctmpspace(pool, 20);
4799       sprintf(b, "repo #%d", what);
4800       return b;
4801     }
4802   if (select == SOLVER_SOLVABLE_ALL)
4803     return "all packages";
4804   return "unknown job select";
4805 }
4806
4807 const char *
4808 pool_job2str(Pool *pool, Id how, Id what, Id flagmask)
4809 {
4810   Id select = how & SOLVER_SELECTMASK;
4811   const char *strstart = 0, *strend = 0;
4812   char *s;
4813   int o;
4814
4815   switch (how & SOLVER_JOBMASK)
4816     {
4817     case SOLVER_NOOP:
4818       return "do nothing";
4819     case SOLVER_INSTALL:
4820       if (select == SOLVER_SOLVABLE && pool->installed && pool->solvables[what].repo == pool->installed)
4821         strstart = "keep ", strend = " installed";
4822       else if (select == SOLVER_SOLVABLE || select == SOLVER_SOLVABLE_NAME)
4823         strstart = "install ";
4824       else if (select == SOLVER_SOLVABLE_PROVIDES)
4825         strstart = "install a package ";
4826       else
4827         strstart = "install one of ";
4828       break;
4829     case SOLVER_ERASE:
4830       if (select == SOLVER_SOLVABLE && !(pool->installed && pool->solvables[what].repo == pool->installed))
4831         strstart = "keep ", strend = " uninstalled";
4832       else if (select == SOLVER_SOLVABLE_PROVIDES)
4833         strstart = "deinstall all packages ";
4834       else
4835         strstart = "deinstall ";
4836       break;
4837     case SOLVER_UPDATE:
4838       strstart = "update ";
4839       break;
4840     case SOLVER_WEAKENDEPS:
4841       strstart = "weaken deps of ";
4842       break;
4843     case SOLVER_MULTIVERSION:
4844       strstart = "multi version ";
4845       break;
4846     case SOLVER_LOCK:
4847       strstart = "lock ";
4848       break;
4849     case SOLVER_DISTUPGRADE:
4850       strstart = "dist upgrade ";
4851       break;
4852     case SOLVER_VERIFY:
4853       strstart = "verify ";
4854       break;
4855     case SOLVER_DROP_ORPHANED:
4856       strstart = "deinstall ", strend = " if orphaned";
4857       break;
4858     case SOLVER_USERINSTALLED:
4859       strstart = "regard ", strend = " as userinstalled";
4860       break;
4861     case SOLVER_ALLOWUNINSTALL:
4862       strstart = "allow deinstallation of ";
4863       break;
4864     case SOLVER_FAVOR:
4865       strstart = "favor ";
4866       break;
4867     case SOLVER_DISFAVOR:
4868       strstart = "disfavor ";
4869       break;
4870     case SOLVER_BLACKLIST:
4871       strstart = "blacklist ";
4872       break;
4873     default:
4874       strstart = "unknown job ";
4875       break;
4876     }
4877   s = pool_tmpjoin(pool, strstart, solver_select2str(pool, select, what), strend);
4878   how &= flagmask;
4879   if ((how & ~(SOLVER_SELECTMASK|SOLVER_JOBMASK)) == 0)
4880     return s;
4881   o = strlen(s);
4882   s = pool_tmpappend(pool, s, " ", 0);
4883   if (how & SOLVER_WEAK)
4884     s = pool_tmpappend(pool, s, ",weak", 0);
4885   if (how & SOLVER_ESSENTIAL)
4886     s = pool_tmpappend(pool, s, ",essential", 0);
4887   if (how & SOLVER_CLEANDEPS)
4888     s = pool_tmpappend(pool, s, ",cleandeps", 0);
4889   if (how & SOLVER_ORUPDATE)
4890     s = pool_tmpappend(pool, s, ",orupdate", 0);
4891   if (how & SOLVER_FORCEBEST)
4892     s = pool_tmpappend(pool, s, ",forcebest", 0);
4893   if (how & SOLVER_TARGETED)
4894     s = pool_tmpappend(pool, s, ",targeted", 0);
4895   if (how & SOLVER_SETEV)
4896     s = pool_tmpappend(pool, s, ",setev", 0);
4897   if (how & SOLVER_SETEVR)
4898     s = pool_tmpappend(pool, s, ",setevr", 0);
4899   if (how & SOLVER_SETARCH)
4900     s = pool_tmpappend(pool, s, ",setarch", 0);
4901   if (how & SOLVER_SETVENDOR)
4902     s = pool_tmpappend(pool, s, ",setvendor", 0);
4903   if (how & SOLVER_SETREPO)
4904     s = pool_tmpappend(pool, s, ",setrepo", 0);
4905   if (how & SOLVER_SETNAME)
4906     s = pool_tmpappend(pool, s, ",setname", 0);
4907   if (how & SOLVER_NOAUTOSET)
4908     s = pool_tmpappend(pool, s, ",noautoset", 0);
4909   if (s[o + 1] != ',')
4910     s = pool_tmpappend(pool, s, ",?", 0);
4911   s[o + 1] = '[';
4912   return pool_tmpappend(pool, s, "]", 0);
4913 }
4914
4915 const char *
4916 solver_alternative2str(Solver *solv, int type, Id id, Id from)
4917 {
4918   Pool *pool = solv->pool;
4919   if (type == SOLVER_ALTERNATIVE_TYPE_RECOMMENDS)
4920     {
4921       const char *s = pool_dep2str(pool, id);
4922       return pool_tmpappend(pool, s, ", recommended by ", pool_solvid2str(pool, from));
4923     }
4924   if (type == SOLVER_ALTERNATIVE_TYPE_RULE)
4925     {
4926       int rtype;
4927       Id depfrom, depto, dep;
4928       char buf[64];
4929       if (solver_ruleclass(solv, id) == SOLVER_RULE_CHOICE)
4930         id = solver_rule2pkgrule(solv, id);
4931       if (solver_ruleclass(solv, id) == SOLVER_RULE_RECOMMENDS)
4932         id = solver_rule2pkgrule(solv, id);
4933       rtype = solver_ruleinfo(solv, id, &depfrom, &depto, &dep);
4934       if ((rtype & SOLVER_RULE_TYPEMASK) == SOLVER_RULE_JOB)
4935         {
4936           if ((depto & SOLVER_SELECTMASK) == SOLVER_SOLVABLE_PROVIDES)
4937             return pool_dep2str(pool, dep);
4938           return solver_select2str(pool, depto & SOLVER_SELECTMASK, dep);
4939         }
4940       if (rtype == SOLVER_RULE_PKG_REQUIRES)
4941         {
4942           const char *s = pool_dep2str(pool, dep);
4943           return pool_tmpappend(pool, s, ", required by ", pool_solvid2str(pool, depfrom));
4944         }
4945       sprintf(buf, "Rule #%d", id);
4946       return pool_tmpjoin(pool, buf, 0, 0);
4947     }
4948   return "unknown alternative type";
4949 }
4950