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 "solverdebug.h"
  27
  28 #define RULES_BLOCK 63
  29
  30 /********************************************************************
  31  *
  32  * dependency check helpers
  33  *
  34  */
  35
  36 /*-------------------------------------------------------------------
  37  * handle split provides
  38  */
  39
  40 int
  41 solver_splitprovides(Solver *solv, Id dep)
  42 {
  43   Pool *pool = solv->pool;
  44   Id p, pp;
  45   Reldep *rd;
  46   Solvable *s;
  47
  48   if (!solv->dosplitprovides || !solv->installed)
  49     return 0;
  50   if (!ISRELDEP(dep))
  51     return 0;
  52   rd = GETRELDEP(pool, dep);
  53   if (rd->flags != REL_WITH)
  54     return 0;
  55   FOR_PROVIDES(p, pp, dep)
  56     {
  57       s = pool->solvables + p;
  58       if (s->repo == solv->installed && s->name == rd->name)
  59         return 1;
  60     }
  61   return 0;
  62 }
  63
  64
  65 /*-------------------------------------------------------------------
  66  * solver_dep_installed
  67  */
  68
  69 int
  70 solver_dep_installed(Solver *solv, Id dep)
  71 {
  72 #if 0
  73   Pool *pool = solv->pool;
  74   Id p, pp;
  75
  76   if (ISRELDEP(dep))
  77     {
  78       Reldep *rd = GETRELDEP(pool, dep);
  79       if (rd->flags == REL_AND)
  80         {
  81           if (!solver_dep_installed(solv, rd->name))
  82             return 0;
  83           return solver_dep_installed(solv, rd->evr);
  84         }
  85       if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
  86         return solver_dep_installed(solv, rd->evr);
  87     }
  88   FOR_PROVIDES(p, pp, dep)
  89     {
  90       if (p == SYSTEMSOLVABLE || (solv->installed && pool->solvables[p].repo == solv->installed))
  91         return 1;
  92     }
  93 #endif
  94   return 0;
  95 }
  96
  97
  98
  99 /************************************************************************/
 100
 101 /*
 102  * make assertion rules into decisions
 103  *
 104  * Go through rules and add direct assertions to the decisionqueue.
 105  * If we find a conflict, disable rules and add them to problem queue.
 106  */
 107
 108 static void
 109 makeruledecisions(Solver *solv)
 110 {
 111   Pool *pool = solv->pool;
 112   int i, ri, ii;
 113   Rule *r, *rr;
 114   Id v, vv;
 115   int decisionstart;
 116   int record_proof = 1;
 117
 118   /* The system solvable is always installed first */
 119   assert(solv->decisionq.count == 0);
 120   queue_push(&solv->decisionq, SYSTEMSOLVABLE);
 121   queue_push(&solv->decisionq_why, 0);
 122   solv->decisionmap[SYSTEMSOLVABLE] = 1;        /* installed at level '1' */
 123
 124   decisionstart = solv->decisionq.count;
 125   for (ii = 0; ii < solv->ruleassertions.count; ii++)
 126     {
 127       ri = solv->ruleassertions.elements[ii];
 128       r = solv->rules + ri;
 129
 130       if (r->d < 0 || !r->p || r->w2)   /* disabled, dummy or no assertion */
 131         continue;
 132       /* do weak rules in phase 2 */
 133       if (ri < solv->learntrules && MAPTST(&solv->weakrulemap, ri))
 134         continue;
 135
 136       v = r->p;
 137       vv = v > 0 ? v : -v;
 138
 139       if (!solv->decisionmap[vv])          /* if not yet decided */
 140         {
 141             /*
 142              * decide !
 143              */
 144           queue_push(&solv->decisionq, v);
 145           queue_push(&solv->decisionq_why, r - solv->rules);
 146           solv->decisionmap[vv] = v > 0 ? 1 : -1;
 147           IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 148             {
 149               Solvable *s = solv->pool->solvables + vv;
 150               if (v < 0)
 151                 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (assertion)\n", pool_solvable2str(solv->pool, s));
 152               else
 153                 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing  %s (assertion)\n", pool_solvable2str(solv->pool, s));
 154             }
 155           continue;
 156         }
 157         /*
 158          * check previous decision: is it sane ?
 159          */
 160
 161       if (v > 0 && solv->decisionmap[vv] > 0)    /* ok to install */
 162         continue;
 163       if (v < 0 && solv->decisionmap[vv] < 0)    /* ok to remove */
 164         continue;
 165
 166         /*
 167          * found a conflict!
 168          *
 169          * The rule (r) we're currently processing says something
 170          * different (v = r->p) than a previous decision (decisionmap[abs(v)])
 171          * on this literal
 172          */
 173
 174       if (ri >= solv->learntrules)
 175         {
 176           /* conflict with a learnt rule */
 177           /* can happen when packages cannot be installed for
 178            * multiple reasons. */
 179           /* we disable the learnt rule in this case */
 180           solver_disablerule(solv, r);
 181           continue;
 182         }
 183
 184         /*
 185          * find the decision which is the "opposite" of the rule
 186          */
 187
 188       for (i = 0; i < solv->decisionq.count; i++)
 189         if (solv->decisionq.elements[i] == -v)
 190           break;
 191       assert(i < solv->decisionq.count);         /* assert that we found it */
 192
 193       /*
 194        * conflict with system solvable ?
 195        */
 196
 197       if (v == -SYSTEMSOLVABLE)
 198         {
 199           /* conflict with system solvable */
 200           if (record_proof)
 201             {
 202               queue_push(&solv->problems, solv->learnt_pool.count);
 203               queue_push(&solv->learnt_pool, ri);
 204               queue_push(&solv->learnt_pool, 0);
 205             }
 206           else
 207             queue_push(&solv->problems, 0);
 208           POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with system solvable, disabling rule #%d\n", ri);
 209           if  (ri >= solv->jobrules && ri < solv->jobrules_end)
 210             v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
 211           else
 212             v = ri;
 213           queue_push(&solv->problems, v);
 214           queue_push(&solv->problems, 0);
 215           solver_disableproblem(solv, v);
 216           continue;
 217         }
 218
 219       assert(solv->decisionq_why.elements[i] > 0);
 220
 221       /*
 222        * conflict with an rpm rule ?
 223        */
 224
 225       if (solv->decisionq_why.elements[i] < solv->rpmrules_end)
 226         {
 227           /* conflict with rpm rule assertion */
 228           if (record_proof)
 229             {
 230               queue_push(&solv->problems, solv->learnt_pool.count);
 231               queue_push(&solv->learnt_pool, ri);
 232               queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
 233               queue_push(&solv->learnt_pool, 0);
 234             }
 235           else
 236             queue_push(&solv->problems, 0);
 237           assert(v > 0 || v == -SYSTEMSOLVABLE);
 238           POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflict with rpm rule, disabling rule #%d\n", ri);
 239           if (ri >= solv->jobrules && ri < solv->jobrules_end)
 240             v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
 241           else
 242             v = ri;
 243           queue_push(&solv->problems, v);
 244           queue_push(&solv->problems, 0);
 245           solver_disableproblem(solv, v);
 246           continue;
 247         }
 248
 249       /*
 250        * conflict with another job or update/feature rule
 251        */
 252
 253       /* record proof */
 254       if (record_proof)
 255         {
 256           queue_push(&solv->problems, solv->learnt_pool.count);
 257           queue_push(&solv->learnt_pool, ri);
 258           queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);
 259           queue_push(&solv->learnt_pool, 0);
 260         }
 261       else
 262         queue_push(&solv->problems, 0);
 263
 264       POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "conflicting update/job assertions over literal %d\n", vv);
 265
 266         /*
 267          * push all of our rules (can only be feature or job rules)
 268          * asserting this literal on the problem stack
 269          */
 270
 271       for (i = solv->featurerules, rr = solv->rules + i; i < solv->learntrules; i++, rr++)
 272         {
 273           if (rr->d < 0                          /* disabled */
 274               || rr->w2)                         /*  or no assertion */
 275             continue;
 276           if (rr->p != vv                        /* not affecting the literal */
 277               && rr->p != -vv)
 278             continue;
 279           if (MAPTST(&solv->weakrulemap, i))     /* weak: silently ignore */
 280             continue;
 281
 282           POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, " - disabling rule #%d\n", i);
 283
 284           solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + i);
 285
 286           v = i;
 287             /* is is a job rule ? */
 288           if (i >= solv->jobrules && i < solv->jobrules_end)
 289             v = -(solv->ruletojob.elements[i - solv->jobrules] + 1);
 290
 291           queue_push(&solv->problems, v);
 292           solver_disableproblem(solv, v);
 293         }
 294       queue_push(&solv->problems, 0);
 295
 296       /*
 297        * start over
 298        * (back up from decisions)
 299        */
 300       while (solv->decisionq.count > decisionstart)
 301         {
 302           v = solv->decisionq.elements[--solv->decisionq.count];
 303           --solv->decisionq_why.count;
 304           vv = v > 0 ? v : -v;
 305           solv->decisionmap[vv] = 0;
 306         }
 307       ii = -1; /* restarts loop at 0 */
 308     }
 309
 310   /*
 311    * phase 2: now do the weak assertions
 312    */
 313   for (ii = 0; ii < solv->ruleassertions.count; ii++)
 314     {
 315       ri = solv->ruleassertions.elements[ii];
 316       r = solv->rules + ri;
 317       if (r->d < 0 || r->w2)                     /* disabled or no assertion */
 318         continue;
 319       if (ri >= solv->learntrules || !MAPTST(&solv->weakrulemap, ri))       /* skip non-weak */
 320         continue;
 321       v = r->p;
 322       vv = v > 0 ? v : -v;
 323       /*
 324        * decide !
 325        * (if not yet decided)
 326        */
 327       if (!solv->decisionmap[vv])
 328         {
 329           queue_push(&solv->decisionq, v);
 330           queue_push(&solv->decisionq_why, r - solv->rules);
 331           solv->decisionmap[vv] = v > 0 ? 1 : -1;
 332           IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 333             {
 334               Solvable *s = solv->pool->solvables + vv;
 335               if (v < 0)
 336                 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "conflicting %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
 337               else
 338                 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "installing  %s (weak assertion)\n", pool_solvable2str(solv->pool, s));
 339             }
 340           continue;
 341         }
 342       /*
 343        * previously decided, sane ?
 344        */
 345       if (v > 0 && solv->decisionmap[vv] > 0)
 346         continue;
 347       if (v < 0 && solv->decisionmap[vv] < 0)
 348         continue;
 349
 350       POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "assertion conflict, but I am weak, disabling ");
 351       solver_printrule(solv, SOLV_DEBUG_UNSOLVABLE, r);
 352
 353       if (ri >= solv->jobrules && ri < solv->jobrules_end)
 354         v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1);
 355       else
 356         v = ri;
 357       solver_disableproblem(solv, v);
 358       if (v < 0)
 359         solver_reenablepolicyrules(solv, -v);
 360     }
 361 }
 362
 363
 364 /*-------------------------------------------------------------------
 365  * enable/disable learnt rules
 366  *
 367  * we have enabled or disabled some of our rules. We now reenable all
 368  * of our learnt rules except the ones that were learnt from rules that
 369  * are now disabled.
 370  */
 371 static void
 372 enabledisablelearntrules(Solver *solv)
 373 {
 374   Pool *pool = solv->pool;
 375   Rule *r;
 376   Id why, *whyp;
 377   int i;
 378
 379   POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "enabledisablelearntrules called\n");
 380   for (i = solv->learntrules, r = solv->rules + i; i < solv->nrules; i++, r++)
 381     {
 382       whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules];
 383       while ((why = *whyp++) != 0)
 384         {
 385           assert(why > 0 && why < i);
 386           if (solv->rules[why].d < 0)
 387             break;
 388         }
 389       /* why != 0: we found a disabled rule, disable the learnt rule */
 390       if (why && r->d >= 0)
 391         {
 392           IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
 393             {
 394               POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "disabling ");
 395               solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
 396             }
 397           solver_disablerule(solv, r);
 398         }
 399       else if (!why && r->d < 0)
 400         {
 401           IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
 402             {
 403               POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "re-enabling ");
 404               solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
 405             }
 406           solver_enablerule(solv, r);
 407         }
 408     }
 409 }
 410
 411
 412 /********************************************************************/
 413 /* watches */
 414
 415
 416 /*-------------------------------------------------------------------
 417  * makewatches
 418  *
 419  * initial setup for all watches
 420  */
 421
 422 static void
 423 makewatches(Solver *solv)
 424 {
 425   Rule *r;
 426   int i;
 427   int nsolvables = solv->pool->nsolvables;
 428
 429   solv_free(solv->watches);
 430                                        /* lower half for removals, upper half for installs */
 431   solv->watches = solv_calloc(2 * nsolvables, sizeof(Id));
 432 #if 1
 433   /* do it reverse so rpm rules get triggered first (XXX: obsolete?) */
 434   for (i = 1, r = solv->rules + solv->nrules - 1; i < solv->nrules; i++, r--)
 435 #else
 436   for (i = 1, r = solv->rules + 1; i < solv->nrules; i++, r++)
 437 #endif
 438     {
 439       if (!r->w2)               /* assertions do not need watches */
 440         continue;
 441
 442       /* see addwatches_rule(solv, r) */
 443       r->n1 = solv->watches[nsolvables + r->w1];
 444       solv->watches[nsolvables + r->w1] = r - solv->rules;
 445
 446       r->n2 = solv->watches[nsolvables + r->w2];
 447       solv->watches[nsolvables + r->w2] = r - solv->rules;
 448     }
 449 }
 450
 451
 452 /*-------------------------------------------------------------------
 453  *
 454  * add watches (for a new learned rule)
 455  * sets up watches for a single rule
 456  *
 457  * see also makewatches() above.
 458  */
 459
 460 static inline void
 461 addwatches_rule(Solver *solv, Rule *r)
 462 {
 463   int nsolvables = solv->pool->nsolvables;
 464
 465   r->n1 = solv->watches[nsolvables + r->w1];
 466   solv->watches[nsolvables + r->w1] = r - solv->rules;
 467
 468   r->n2 = solv->watches[nsolvables + r->w2];
 469   solv->watches[nsolvables + r->w2] = r - solv->rules;
 470 }
 471
 472
 473 /********************************************************************/
 474 /*
 475  * rule propagation
 476  */
 477
 478
 479 /* shortcuts to check if a literal (positive or negative) assignment
 480  * evaluates to 'true' or 'false'
 481  */
 482 #define DECISIONMAP_TRUE(p) ((p) > 0 ? (decisionmap[p] > 0) : (decisionmap[-p] < 0))
 483 #define DECISIONMAP_FALSE(p) ((p) > 0 ? (decisionmap[p] < 0) : (decisionmap[-p] > 0))
 484 #define DECISIONMAP_UNDEF(p) (decisionmap[(p) > 0 ? (p) : -(p)] == 0)
 485
 486 /*-------------------------------------------------------------------
 487  *
 488  * propagate
 489  *
 490  * make decision and propagate to all rules
 491  *
 492  * Evaluate each term affected by the decision (linked through watches)
 493  * If we find unit rules we make new decisions based on them
 494  *
 495  * Everything's fixed there, it's just finding rules that are
 496  * unit.
 497  *
 498  * return : 0 = everything is OK
 499  *          rule = conflict found in this rule
 500  */
 501
 502 static Rule *
 503 propagate(Solver *solv, int level)
 504 {
 505   Pool *pool = solv->pool;
 506   Id *rp, *next_rp;           /* rule pointer, next rule pointer in linked list */
 507   Rule *r;                    /* rule */
 508   Id p, pkg, other_watch;
 509   Id *dp;
 510   Id *decisionmap = solv->decisionmap;
 511
 512   Id *watches = solv->watches + pool->nsolvables;   /* place ptr in middle */
 513
 514   POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate -----\n");
 515
 516   /* foreach non-propagated decision */
 517   while (solv->propagate_index < solv->decisionq.count)
 518     {
 519         /*
 520          * 'pkg' was just decided
 521          * negate because our watches trigger if literal goes FALSE
 522          */
 523       pkg = -solv->decisionq.elements[solv->propagate_index++];
 524
 525       IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 526         {
 527           POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagate for decision %d level %d\n", -pkg, level);
 528           solver_printruleelement(solv, SOLV_DEBUG_PROPAGATE, 0, -pkg);
 529         }
 530
 531       /* foreach rule where 'pkg' is now FALSE */
 532       for (rp = watches + pkg; *rp; rp = next_rp)
 533         {
 534           r = solv->rules + *rp;
 535           if (r->d < 0)
 536             {
 537               /* rule is disabled, goto next */
 538               if (pkg == r->w1)
 539                 next_rp = &r->n1;
 540               else
 541                 next_rp = &r->n2;
 542               continue;
 543             }
 544
 545           IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 546             {
 547               POOL_DEBUG(SOLV_DEBUG_PROPAGATE,"  watch triggered ");
 548               solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
 549             }
 550
 551             /* 'pkg' was just decided (was set to FALSE)
 552              *
 553              *  now find other literal watch, check clause
 554              *   and advance on linked list
 555              */
 556           if (pkg == r->w1)
 557             {
 558               other_watch = r->w2;
 559               next_rp = &r->n1;
 560             }
 561           else
 562             {
 563               other_watch = r->w1;
 564               next_rp = &r->n2;
 565             }
 566
 567             /*
 568              * This term is already true (through the other literal)
 569              * so we have nothing to do
 570              */
 571           if (DECISIONMAP_TRUE(other_watch))
 572             continue;
 573
 574             /*
 575              * The other literal is FALSE or UNDEF
 576              *
 577              */
 578
 579           if (r->d)
 580             {
 581               /* Not a binary clause, try to move our watch.
 582                *
 583                * Go over all literals and find one that is
 584                *   not other_watch
 585                *   and not FALSE
 586                *
 587                * (TRUE is also ok, in that case the rule is fulfilled)
 588                */
 589               if (r->p                                /* we have a 'p' */
 590                   && r->p != other_watch              /* which is not watched */
 591                   && !DECISIONMAP_FALSE(r->p))        /* and not FALSE */
 592                 {
 593                   p = r->p;
 594                 }
 595               else                                    /* go find a 'd' to make 'true' */
 596                 {
 597                   /* foreach p in 'd'
 598                      we just iterate sequentially, doing it in another order just changes the order of decisions, not the decisions itself
 599                    */
 600                   for (dp = pool->whatprovidesdata + r->d; (p = *dp++) != 0;)
 601                     {
 602                       if (p != other_watch              /* which is not watched */
 603                           && !DECISIONMAP_FALSE(p))     /* and not FALSE */
 604                         break;
 605                     }
 606                 }
 607
 608               if (p)
 609                 {
 610                   /*
 611                    * if we found some p that is UNDEF or TRUE, move
 612                    * watch to it
 613                    */
 614                   IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 615                     {
 616                       if (p > 0)
 617                         POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "    -> move w%d to %s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, p));
 618                       else
 619                         POOL_DEBUG(SOLV_DEBUG_PROPAGATE,"    -> move w%d to !%s\n", (pkg == r->w1 ? 1 : 2), pool_solvid2str(pool, -p));
 620                     }
 621
 622                   *rp = *next_rp;
 623                   next_rp = rp;
 624
 625                   if (pkg == r->w1)
 626                     {
 627                       r->w1 = p;
 628                       r->n1 = watches[p];
 629                     }
 630                   else
 631                     {
 632                       r->w2 = p;
 633                       r->n2 = watches[p];
 634                     }
 635                   watches[p] = r - solv->rules;
 636                   continue;
 637                 }
 638               /* search failed, thus all unwatched literals are FALSE */
 639
 640             } /* not binary */
 641
 642             /*
 643              * unit clause found, set literal other_watch to TRUE
 644              */
 645
 646           if (DECISIONMAP_FALSE(other_watch))      /* check if literal is FALSE */
 647             return r;                              /* eek, a conflict! */
 648
 649           IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 650             {
 651               POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "   unit ");
 652               solver_printrule(solv, SOLV_DEBUG_PROPAGATE, r);
 653             }
 654
 655           if (other_watch > 0)
 656             decisionmap[other_watch] = level;    /* install! */
 657           else
 658             decisionmap[-other_watch] = -level;  /* remove! */
 659
 660           queue_push(&solv->decisionq, other_watch);
 661           queue_push(&solv->decisionq_why, r - solv->rules);
 662
 663           IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
 664             {
 665               if (other_watch > 0)
 666                 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "    -> decided to install %s\n", pool_solvid2str(pool, other_watch));
 667               else
 668                 POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "    -> decided to conflict %s\n", pool_solvid2str(pool, -other_watch));
 669             }
 670
 671         } /* foreach rule involving 'pkg' */
 672
 673     } /* while we have non-decided decisions */
 674
 675   POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "----- propagate end-----\n");
 676
 677   return 0;     /* all is well */
 678 }
 679
 680
 681 /********************************************************************/
 682 /* Analysis */
 683
 684 /*-------------------------------------------------------------------
 685  *
 686  * analyze
 687  *   and learn
 688  */
 689
 690 static int
 691 analyze(Solver *solv, int level, Rule *c, int *pr, int *dr, int *whyp)
 692 {
 693   Pool *pool = solv->pool;
 694   Queue r;
 695   Id r_buf[4];
 696   int rlevel = 1;
 697   Map seen;             /* global? */
 698   Id d, v, vv, *dp, why;
 699   int l, i, idx;
 700   int num = 0, l1num = 0;
 701   int learnt_why = solv->learnt_pool.count;
 702   Id *decisionmap = solv->decisionmap;
 703
 704   queue_init_buffer(&r, r_buf, sizeof(r_buf)/sizeof(*r_buf));
 705
 706   POOL_DEBUG(SOLV_DEBUG_ANALYZE, "ANALYZE at %d ----------------------\n", level);
 707   map_init(&seen, pool->nsolvables);
 708   idx = solv->decisionq.count;
 709   for (;;)
 710     {
 711       IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
 712         solver_printruleclass(solv, SOLV_DEBUG_ANALYZE, c);
 713       queue_push(&solv->learnt_pool, c - solv->rules);
 714       d = c->d < 0 ? -c->d - 1 : c->d;
 715       dp = d ? pool->whatprovidesdata + d : 0;
 716       /* go through all literals of the rule */
 717       for (i = -1; ; i++)
 718         {
 719           if (i == -1)
 720             v = c->p;
 721           else if (d == 0)
 722             v = i ? 0 : c->w2;
 723           else
 724             v = *dp++;
 725           if (v == 0)
 726             break;
 727
 728           if (DECISIONMAP_TRUE(v))      /* the one true literal */
 729             continue;
 730           vv = v > 0 ? v : -v;
 731           if (MAPTST(&seen, vv))
 732             continue;
 733           l = solv->decisionmap[vv];
 734           if (l < 0)
 735             l = -l;
 736           MAPSET(&seen, vv);            /* mark that we also need to look at this literal */
 737           if (l == 1)
 738             l1num++;                    /* need to do this one in level1 pass */
 739           else if (l == level)
 740             num++;                      /* need to do this one as well */
 741           else
 742             {
 743               queue_push(&r, v);        /* not level1 or conflict level, add to new rule */
 744               if (l > rlevel)
 745                 rlevel = l;
 746             }
 747         }
 748 l1retry:
 749       if (!num && !--l1num)
 750         break;  /* all level 1 literals done */
 751
 752       /* find the next literal to investigate */
 753       /* (as num + l1num > 0, we know that we'll always find one) */
 754       for (;;)
 755         {
 756           assert(idx > 0);
 757           v = solv->decisionq.elements[--idx];
 758           vv = v > 0 ? v : -v;
 759           if (MAPTST(&seen, vv))
 760             break;
 761         }
 762       MAPCLR(&seen, vv);
 763
 764       if (num && --num == 0)
 765         {
 766           *pr = -v;     /* so that v doesn't get lost */
 767           if (!l1num)
 768             break;
 769           POOL_DEBUG(SOLV_DEBUG_ANALYZE, "got %d involved level 1 decisions\n", l1num);
 770           /* clear non-l1 bits from seen map */
 771           for (i = 0; i < r.count; i++)
 772             {
 773               v = r.elements[i];
 774               MAPCLR(&seen, v > 0 ? v : -v);
 775             }
 776           /* only level 1 marks left in seen map */
 777           l1num++;      /* as l1retry decrements it */
 778           goto l1retry;
 779         }
 780
 781       why = solv->decisionq_why.elements[idx];
 782       if (why <= 0)     /* just in case, maybe for SYSTEMSOLVABLE */
 783         goto l1retry;
 784       c = solv->rules + why;
 785     }
 786   map_free(&seen);
 787
 788   if (r.count == 0)
 789     *dr = 0;
 790   else if (r.count == 1 && r.elements[0] < 0)
 791     *dr = r.elements[0];
 792   else
 793     *dr = pool_queuetowhatprovides(pool, &r);
 794   IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
 795     {
 796       POOL_DEBUG(SOLV_DEBUG_ANALYZE, "learned rule for level %d (am %d)\n", rlevel, level);
 797       solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, *pr);
 798       for (i = 0; i < r.count; i++)
 799         solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, r.elements[i]);
 800     }
 801   /* push end marker on learnt reasons stack */
 802   queue_push(&solv->learnt_pool, 0);
 803   if (whyp)
 804     *whyp = learnt_why;
 805   queue_free(&r);
 806   solv->stats_learned++;
 807   return rlevel;
 808 }
 809
 810
 811 /*-------------------------------------------------------------------
 812  *
 813  * solver_reset
 814  *
 815  * reset the solver decisions to right after the rpm rules.
 816  * called after rules have been enabled/disabled
 817  */
 818
 819 void
 820 solver_reset(Solver *solv)
 821 {
 822   Pool *pool = solv->pool;
 823   int i;
 824   Id v;
 825
 826   /* rewind all decisions */
 827   for (i = solv->decisionq.count - 1; i >= 0; i--)
 828     {
 829       v = solv->decisionq.elements[i];
 830       solv->decisionmap[v > 0 ? v : -v] = 0;
 831     }
 832   solv->decisionq_why.count = 0;
 833   solv->decisionq.count = 0;
 834   solv->recommends_index = -1;
 835   solv->propagate_index = 0;
 836   solv->recommendations.count = 0;
 837   solv->branches.count = 0;
 838
 839   /* adapt learnt rule status to new set of enabled/disabled rules */
 840   enabledisablelearntrules(solv);
 841
 842   /* redo all assertion rule decisions */
 843   makeruledecisions(solv);
 844   POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "decisions so far: %d\n", solv->decisionq.count);
 845 }
 846
 847
 848 /*-------------------------------------------------------------------
 849  *
 850  * analyze_unsolvable_rule
 851  */
 852
 853 static void
 854 analyze_unsolvable_rule(Solver *solv, Rule *r, Id *lastweakp, Map *rseen)
 855 {
 856   Pool *pool = solv->pool;
 857   int i;
 858   Id why = r - solv->rules;
 859
 860   IF_POOLDEBUG (SOLV_DEBUG_UNSOLVABLE)
 861     solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, r);
 862   if (solv->learntrules && why >= solv->learntrules)
 863     {
 864       if (MAPTST(rseen, why - solv->learntrules))
 865         return;
 866       MAPSET(rseen, why - solv->learntrules);
 867       for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++)
 868         if (solv->learnt_pool.elements[i] > 0)
 869           analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp, rseen);
 870       return;
 871     }
 872   if (MAPTST(&solv->weakrulemap, why))
 873     if (!*lastweakp || why > *lastweakp)
 874       *lastweakp = why;
 875   /* do not add rpm rules to problem */
 876   if (why < solv->rpmrules_end)
 877     return;
 878   /* turn rule into problem */
 879   if (why >= solv->jobrules && why < solv->jobrules_end)
 880     why = -(solv->ruletojob.elements[why - solv->jobrules] + 1);
 881   /* normalize dup/infarch rules */
 882   if (why > solv->infarchrules && why < solv->infarchrules_end)
 883     {
 884       Id name = pool->solvables[-solv->rules[why].p].name;
 885       while (why > solv->infarchrules && pool->solvables[-solv->rules[why - 1].p].name == name)
 886         why--;
 887     }
 888   if (why > solv->duprules && why < solv->duprules_end)
 889     {
 890       Id name = pool->solvables[-solv->rules[why].p].name;
 891       while (why > solv->duprules && pool->solvables[-solv->rules[why - 1].p].name == name)
 892         why--;
 893     }
 894
 895   /* return if problem already countains our rule */
 896   if (solv->problems.count)
 897     {
 898       for (i = solv->problems.count - 1; i >= 0; i--)
 899         if (solv->problems.elements[i] == 0)    /* end of last problem reached? */
 900           break;
 901         else if (solv->problems.elements[i] == why)
 902           return;
 903     }
 904   queue_push(&solv->problems, why);
 905 }
 906
 907
 908 /*-------------------------------------------------------------------
 909  *
 910  * analyze_unsolvable
 911  *
 912  * return: 1 - disabled some rules, try again
 913  *         0 - hopeless
 914  */
 915
 916 static int
 917 analyze_unsolvable(Solver *solv, Rule *cr, int disablerules)
 918 {
 919   Pool *pool = solv->pool;
 920   Rule *r;
 921   Map seen;             /* global to speed things up? */
 922   Map rseen;
 923   Id d, v, vv, *dp, why;
 924   int l, i, idx;
 925   Id *decisionmap = solv->decisionmap;
 926   int oldproblemcount;
 927   int oldlearntpoolcount;
 928   Id lastweak;
 929   int record_proof = 1;
 930
 931   POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "ANALYZE UNSOLVABLE ----------------------\n");
 932   solv->stats_unsolvable++;
 933   oldproblemcount = solv->problems.count;
 934   oldlearntpoolcount = solv->learnt_pool.count;
 935
 936   /* make room for proof index */
 937   /* must update it later, as analyze_unsolvable_rule would confuse
 938    * it with a rule index if we put the real value in already */
 939   queue_push(&solv->problems, 0);
 940
 941   r = cr;
 942   map_init(&seen, pool->nsolvables);
 943   map_init(&rseen, solv->learntrules ? solv->nrules - solv->learntrules : 0);
 944   if (record_proof)
 945     queue_push(&solv->learnt_pool, r - solv->rules);
 946   lastweak = 0;
 947   analyze_unsolvable_rule(solv, r, &lastweak, &rseen);
 948   d = r->d < 0 ? -r->d - 1 : r->d;
 949   dp = d ? pool->whatprovidesdata + d : 0;
 950   for (i = -1; ; i++)
 951     {
 952       if (i == -1)
 953         v = r->p;
 954       else if (d == 0)
 955         v = i ? 0 : r->w2;
 956       else
 957         v = *dp++;
 958       if (v == 0)
 959         break;
 960       if (DECISIONMAP_TRUE(v))  /* the one true literal */
 961           continue;
 962       vv = v > 0 ? v : -v;
 963       l = solv->decisionmap[vv];
 964       if (l < 0)
 965         l = -l;
 966       MAPSET(&seen, vv);
 967     }
 968   idx = solv->decisionq.count;
 969   while (idx > 0)
 970     {
 971       v = solv->decisionq.elements[--idx];
 972       vv = v > 0 ? v : -v;
 973       if (!MAPTST(&seen, vv))
 974         continue;
 975       why = solv->decisionq_why.elements[idx];
 976       assert(why > 0);
 977       if (record_proof)
 978         queue_push(&solv->learnt_pool, why);
 979       r = solv->rules + why;
 980       analyze_unsolvable_rule(solv, r, &lastweak, &rseen);
 981       d = r->d < 0 ? -r->d - 1 : r->d;
 982       dp = d ? pool->whatprovidesdata + d : 0;
 983       for (i = -1; ; i++)
 984         {
 985           if (i == -1)
 986             v = r->p;
 987           else if (d == 0)
 988             v = i ? 0 : r->w2;
 989           else
 990             v = *dp++;
 991           if (v == 0)
 992             break;
 993           if (DECISIONMAP_TRUE(v))      /* the one true literal */
 994               continue;
 995           vv = v > 0 ? v : -v;
 996           l = solv->decisionmap[vv];
 997           if (l < 0)
 998             l = -l;
 999           MAPSET(&seen, vv);
1000         }
1001     }
1002   map_free(&seen);
1003   map_free(&rseen);
1004   queue_push(&solv->problems, 0);       /* mark end of this problem */
1005
1006   if (lastweak)
1007     {
1008       Id v;
1009       /* disable last weak rule */
1010       solv->problems.count = oldproblemcount;
1011       solv->learnt_pool.count = oldlearntpoolcount;
1012       if (lastweak >= solv->jobrules && lastweak < solv->jobrules_end)
1013         v = -(solv->ruletojob.elements[lastweak - solv->jobrules] + 1);
1014       else
1015         v = lastweak;
1016       POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "disabling ");
1017       solver_printruleclass(solv, SOLV_DEBUG_UNSOLVABLE, solv->rules + lastweak);
1018       if (lastweak >= solv->choicerules && lastweak < solv->choicerules_end)
1019         solver_disablechoicerules(solv, solv->rules + lastweak);
1020       solver_disableproblem(solv, v);
1021       if (v < 0)
1022         solver_reenablepolicyrules(solv, -v);
1023       solver_reset(solv);
1024       return 1;
1025     }
1026
1027   /* finish proof */
1028   if (record_proof)
1029     {
1030       queue_push(&solv->learnt_pool, 0);
1031       solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
1032     }
1033
1034   if (disablerules)
1035     {
1036       for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
1037         solver_disableproblem(solv, solv->problems.elements[i]);
1038       /* XXX: might want to enable all weak rules again */
1039       solver_reset(solv);
1040       return 1;
1041     }
1042   POOL_DEBUG(SOLV_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
1043   return 0;
1044 }
1045
1046
1047 /********************************************************************/
1048 /* Decision revert */
1049
1050 /*-------------------------------------------------------------------
1051  *
1052  * revert
1053  * revert decisionq to a level
1054  */
1055
1056 static void
1057 revert(Solver *solv, int level)
1058 {
1059   Pool *pool = solv->pool;
1060   Id v, vv;
1061   while (solv->decisionq.count)
1062     {
1063       v = solv->decisionq.elements[solv->decisionq.count - 1];
1064       vv = v > 0 ? v : -v;
1065       if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
1066         break;
1067       POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
1068       if (v > 0 && solv->recommendations.count && v == solv->recommendations.elements[solv->recommendations.count - 1])
1069         solv->recommendations.count--;
1070       solv->decisionmap[vv] = 0;
1071       solv->decisionq.count--;
1072       solv->decisionq_why.count--;
1073       solv->propagate_index = solv->decisionq.count;
1074     }
1075   while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
1076     {
1077       solv->branches.count--;
1078       while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
1079         solv->branches.count--;
1080     }
1081   solv->recommends_index = -1;
1082 }
1083
1084
1085 /*-------------------------------------------------------------------
1086  *
1087  * watch2onhighest - put watch2 on literal with highest level
1088  */
1089
1090 static inline void
1091 watch2onhighest(Solver *solv, Rule *r)
1092 {
1093   int l, wl = 0;
1094   Id d, v, *dp;
1095
1096   d = r->d < 0 ? -r->d - 1 : r->d;
1097   if (!d)
1098     return;     /* binary rule, both watches are set */
1099   dp = solv->pool->whatprovidesdata + d;
1100   while ((v = *dp++) != 0)
1101     {
1102       l = solv->decisionmap[v < 0 ? -v : v];
1103       if (l < 0)
1104         l = -l;
1105       if (l > wl)
1106         {
1107           r->w2 = dp[-1];
1108           wl = l;
1109         }
1110     }
1111 }
1112
1113
1114 /*-------------------------------------------------------------------
1115  *
1116  * setpropagatelearn
1117  *
1118  * add free decision (solvable to install) to decisionq
1119  * increase level and propagate decision
1120  * return if no conflict.
1121  *
1122  * in conflict case, analyze conflict rule, add resulting
1123  * rule to learnt rule set, make decision from learnt
1124  * rule (always unit) and re-propagate.
1125  *
1126  * returns the new solver level or 0 if unsolvable
1127  *
1128  */
1129
1130 static int
1131 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules, Id ruleid)
1132 {
1133   Pool *pool = solv->pool;
1134   Rule *r;
1135   Id p = 0, d = 0;
1136   int l, why;
1137
1138   assert(ruleid >= 0);
1139   if (decision)
1140     {
1141       level++;
1142       if (decision > 0)
1143         solv->decisionmap[decision] = level;
1144       else
1145         solv->decisionmap[-decision] = -level;
1146       queue_push(&solv->decisionq, decision);
1147       queue_push(&solv->decisionq_why, -ruleid);        /* <= 0 -> free decision */
1148     }
1149   for (;;)
1150     {
1151       r = propagate(solv, level);
1152       if (!r)
1153         break;
1154       if (level == 1)
1155         return analyze_unsolvable(solv, r, disablerules);
1156       POOL_DEBUG(SOLV_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
1157       l = analyze(solv, level, r, &p, &d, &why);        /* learnt rule in p and d */
1158       assert(l > 0 && l < level);
1159       POOL_DEBUG(SOLV_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, l);
1160       level = l;
1161       revert(solv, level);
1162       r = solver_addrule(solv, p, d);
1163       assert(r);
1164       assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
1165       queue_push(&solv->learnt_why, why);
1166       if (d)
1167         {
1168           /* at least 2 literals, needs watches */
1169           watch2onhighest(solv, r);
1170           addwatches_rule(solv, r);
1171         }
1172       else
1173         {
1174           /* learnt rule is an assertion */
1175           queue_push(&solv->ruleassertions, r - solv->rules);
1176         }
1177       /* the new rule is unit by design */
1178       solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
1179       queue_push(&solv->decisionq, p);
1180       queue_push(&solv->decisionq_why, r - solv->rules);
1181       IF_POOLDEBUG (SOLV_DEBUG_ANALYZE)
1182         {
1183           POOL_DEBUG(SOLV_DEBUG_ANALYZE, "decision: ");
1184           solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, p);
1185           POOL_DEBUG(SOLV_DEBUG_ANALYZE, "new rule: ");
1186           solver_printrule(solv, SOLV_DEBUG_ANALYZE, r);
1187         }
1188     }
1189   return level;
1190 }
1191
1192
1193 /*-------------------------------------------------------------------
1194  *
1195  * select and install
1196  *
1197  * install best package from the queue. We add an extra package, inst, if
1198  * provided. See comment in weak install section.
1199  *
1200  * returns the new solver level or 0 if unsolvable
1201  *
1202  */
1203
1204 static int
1205 selectandinstall(Solver *solv, int level, Queue *dq, int disablerules, Id ruleid)
1206 {
1207   Pool *pool = solv->pool;
1208   Id p;
1209   int i;
1210
1211   if (dq->count > 1)
1212     policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1213   if (dq->count > 1)
1214     {
1215       /* XXX: didn't we already do that? */
1216       /* XXX: shouldn't we prefer installed packages? */
1217       /* XXX: move to policy.c? */
1218       /* choose the supplemented one */
1219       for (i = 0; i < dq->count; i++)
1220         if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
1221           {
1222             dq->elements[0] = dq->elements[i];
1223             dq->count = 1;
1224             break;
1225           }
1226     }
1227   if (dq->count > 1)
1228     {
1229       /* multiple candidates, open a branch */
1230       for (i = 1; i < dq->count; i++)
1231         queue_push(&solv->branches, dq->elements[i]);
1232       queue_push(&solv->branches, -level);
1233     }
1234   p = dq->elements[0];
1235
1236   POOL_DEBUG(SOLV_DEBUG_POLICY, "installing %s\n", pool_solvid2str(pool, p));
1237
1238   return setpropagatelearn(solv, level, p, disablerules, ruleid);
1239 }
1240
1241
1242 /********************************************************************/
1243 /* Main solver interface */
1244
1245
1246 /*-------------------------------------------------------------------
1247  *
1248  * solver_create
1249  * create solver structure
1250  *
1251  * pool: all available solvables
1252  * installed: installed Solvables
1253  *
1254  *
1255  * Upon solving, rules are created to flag the Solvables
1256  * of the 'installed' Repo as installed.
1257  */
1258
1259 Solver *
1260 solver_create(Pool *pool)
1261 {
1262   Solver *solv;
1263   solv = (Solver *)solv_calloc(1, sizeof(Solver));
1264   solv->pool = pool;
1265   solv->installed = pool->installed;
1266
1267   queue_init(&solv->ruletojob);
1268   queue_init(&solv->decisionq);
1269   queue_init(&solv->decisionq_why);
1270   queue_init(&solv->problems);
1271   queue_init(&solv->suggestions);
1272   queue_init(&solv->recommendations);
1273   queue_init(&solv->orphaned);
1274   queue_init(&solv->learnt_why);
1275   queue_init(&solv->learnt_pool);
1276   queue_init(&solv->branches);
1277   queue_init(&solv->weakruleq);
1278   queue_init(&solv->ruleassertions);
1279
1280   queue_push(&solv->learnt_pool, 0);    /* so that 0 does not describe a proof */
1281
1282   map_init(&solv->recommendsmap, pool->nsolvables);
1283   map_init(&solv->suggestsmap, pool->nsolvables);
1284   map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
1285   solv->recommends_index = 0;
1286
1287   solv->decisionmap = (Id *)solv_calloc(pool->nsolvables, sizeof(Id));
1288   solv->nrules = 1;
1289   solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
1290   memset(solv->rules, 0, sizeof(Rule));
1291
1292   return solv;
1293 }
1294
1295
1296 /*-------------------------------------------------------------------
1297  *
1298  * solver_free
1299  */
1300
1301 void
1302 solver_free(Solver *solv)
1303 {
1304   queue_free(&solv->job);
1305   queue_free(&solv->ruletojob);
1306   queue_free(&solv->decisionq);
1307   queue_free(&solv->decisionq_why);
1308   queue_free(&solv->learnt_why);
1309   queue_free(&solv->learnt_pool);
1310   queue_free(&solv->problems);
1311   queue_free(&solv->solutions);
1312   queue_free(&solv->suggestions);
1313   queue_free(&solv->recommendations);
1314   queue_free(&solv->orphaned);
1315   queue_free(&solv->branches);
1316   queue_free(&solv->weakruleq);
1317   queue_free(&solv->ruleassertions);
1318
1319   map_free(&solv->recommendsmap);
1320   map_free(&solv->suggestsmap);
1321   map_free(&solv->noupdate);
1322   map_free(&solv->weakrulemap);
1323   map_free(&solv->noobsoletes);
1324
1325   map_free(&solv->updatemap);
1326   map_free(&solv->fixmap);
1327   map_free(&solv->dupmap);
1328   map_free(&solv->dupinvolvedmap);
1329   map_free(&solv->droporphanedmap);
1330   map_free(&solv->cleandepsmap);
1331
1332   solv_free(solv->decisionmap);
1333   solv_free(solv->rules);
1334   solv_free(solv->watches);
1335   solv_free(solv->obsoletes);
1336   solv_free(solv->obsoletes_data);
1337   solv_free(solv->multiversionupdaters);
1338   solv_free(solv->choicerules_ref);
1339   solv_free(solv);
1340 }
1341
1342 int
1343 solver_get_flag(Solver *solv, int flag)
1344 {
1345   switch (flag)
1346   {
1347   case SOLVER_FLAG_ALLOW_DOWNGRADE:
1348     return solv->allowdowngrade;
1349   case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1350     return solv->allowarchchange;
1351   case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1352     return solv->allowvendorchange;
1353   case SOLVER_FLAG_ALLOW_UNINSTALL:
1354     return solv->allowuninstall;
1355   case SOLVER_FLAG_NO_UPDATEPROVIDE:
1356     return solv->noupdateprovide;
1357   case SOLVER_FLAG_SPLITPROVIDES:
1358     return solv->dosplitprovides;
1359   case SOLVER_FLAG_IGNORE_RECOMMENDED:
1360     return solv->dontinstallrecommended;
1361   case SOLVER_FLAG_IGNORE_ALREADY_RECOMMENDED:
1362     return solv->ignorealreadyrecommended;
1363   case SOLVER_FLAG_NO_INFARCHCHECK:
1364     return solv->noinfarchcheck;
1365   default:
1366     break;
1367   }
1368   return -1;
1369 }
1370
1371 int
1372 solver_set_flag(Solver *solv, int flag, int value)
1373 {
1374   int old = solver_get_flag(solv, flag);
1375   switch (flag)
1376   {
1377   case SOLVER_FLAG_ALLOW_DOWNGRADE:
1378     solv->allowdowngrade = value;
1379     break;
1380   case SOLVER_FLAG_ALLOW_ARCHCHANGE:
1381     solv->allowarchchange = value;
1382     break;
1383   case SOLVER_FLAG_ALLOW_VENDORCHANGE:
1384     solv->allowvendorchange = value;
1385     break;
1386   case SOLVER_FLAG_ALLOW_UNINSTALL:
1387     solv->allowuninstall = value;
1388     break;
1389   case SOLVER_FLAG_NO_UPDATEPROVIDE:
1390     solv->noupdateprovide = value;
1391     break;
1392   case SOLVER_FLAG_SPLITPROVIDES:
1393     solv->dosplitprovides = value;
1394     break;
1395   case SOLVER_FLAG_IGNORE_RECOMMENDED:
1396     solv->dontinstallrecommended = value;
1397     break;
1398   case SOLVER_FLAG_IGNORE_ALREADY_RECOMMENDED:
1399     solv->ignorealreadyrecommended = value;
1400     break;
1401   case SOLVER_FLAG_NO_INFARCHCHECK:
1402     solv->noinfarchcheck = value;
1403     break;
1404   default:
1405     break;
1406   }
1407   return old;
1408 }
1409
1410
1411 /*-------------------------------------------------------------------
1412  *
1413  * solver_run_sat
1414  *
1415  * all rules have been set up, now actually run the solver
1416  *
1417  */
1418
1419 void
1420 solver_run_sat(Solver *solv, int disablerules, int doweak)
1421 {
1422   Queue dq;             /* local decisionqueue */
1423   Queue dqs;            /* local decisionqueue for supplements */
1424   int systemlevel;
1425   int level, olevel;
1426   Rule *r;
1427   int i, j, n;
1428   Solvable *s;
1429   Pool *pool = solv->pool;
1430   Id p, *dp;
1431   int minimizationsteps;
1432   int installedpos = solv->installed ? solv->installed->start : 0;
1433
1434   IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
1435     {
1436       POOL_DEBUG (SOLV_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
1437       for (i = 1; i < solv->nrules; i++)
1438         solver_printruleclass(solv, SOLV_DEBUG_RULE_CREATION, solv->rules + i);
1439     }
1440
1441   POOL_DEBUG(SOLV_DEBUG_SOLVER, "initial decisions: %d\n", solv->decisionq.count);
1442
1443   /* start SAT algorithm */
1444   level = 1;
1445   systemlevel = level + 1;
1446   POOL_DEBUG(SOLV_DEBUG_SOLVER, "solving...\n");
1447
1448   queue_init(&dq);
1449   queue_init(&dqs);
1450
1451   /*
1452    * here's the main loop:
1453    * 1) propagate new decisions (only needed once)
1454    * 2) fulfill jobs
1455    * 3) try to keep installed packages
1456    * 4) fulfill all unresolved rules
1457    * 5) install recommended packages
1458    * 6) minimalize solution if we had choices
1459    * if we encounter a problem, we rewind to a safe level and restart
1460    * with step 1
1461    */
1462
1463   minimizationsteps = 0;
1464   for (;;)
1465     {
1466       /*
1467        * initial propagation of the assertions
1468        */
1469       if (level == 1)
1470         {
1471           POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "propagating (propagate_index: %d;  size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
1472           if ((r = propagate(solv, level)) != 0)
1473             {
1474               if (analyze_unsolvable(solv, r, disablerules))
1475                 continue;
1476               level = 0;
1477               break;    /* unsolvable */
1478             }
1479         }
1480
1481       /*
1482        * resolve jobs first
1483        */
1484      if (level < systemlevel)
1485         {
1486           POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving job rules\n");
1487           for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
1488             {
1489               Id l;
1490               if (r->d < 0)             /* ignore disabled rules */
1491                 continue;
1492               queue_empty(&dq);
1493               FOR_RULELITERALS(l, dp, r)
1494                 {
1495                   if (l < 0)
1496                     {
1497                       if (solv->decisionmap[-l] <= 0)
1498                         break;
1499                     }
1500                   else
1501                     {
1502                       if (solv->decisionmap[l] > 0)
1503                         break;
1504                       if (solv->decisionmap[l] == 0)
1505                         queue_push(&dq, l);
1506                     }
1507                 }
1508               if (l || !dq.count)
1509                 continue;
1510               /* prune to installed if not updating */
1511               if (dq.count > 1 && solv->installed && !solv->updatemap_all)
1512                 {
1513                   int j, k;
1514                   for (j = k = 0; j < dq.count; j++)
1515                     {
1516                       Solvable *s = pool->solvables + dq.elements[j];
1517                       if (s->repo == solv->installed)
1518                         {
1519                           dq.elements[k++] = dq.elements[j];
1520                           if (solv->updatemap.size && MAPTST(&solv->updatemap, dq.elements[j] - solv->installed->start))
1521                             {
1522                               k = 0;    /* package wants to be updated, do not prune */
1523                               break;
1524                             }
1525                         }
1526                     }
1527                   if (k)
1528                     dq.count = k;
1529                 }
1530               olevel = level;
1531               level = selectandinstall(solv, level, &dq, disablerules, i);
1532               if (level == 0)
1533                 break;
1534               if (level <= olevel)
1535                 break;
1536             }
1537           if (level == 0)
1538             break;      /* unsolvable */
1539           systemlevel = level + 1;
1540           if (i < solv->jobrules_end)
1541             continue;
1542           solv->decisioncnt_update = solv->decisionq.count;
1543           solv->decisioncnt_keep = solv->decisionq.count;
1544         }
1545
1546       /*
1547        * installed packages
1548        */
1549       if (level < systemlevel && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
1550         {
1551           Repo *installed = solv->installed;
1552           int pass;
1553
1554           POOL_DEBUG(SOLV_DEBUG_SOLVER, "resolving installed packages\n");
1555           /* we use two passes if we need to update packages
1556            * to create a better user experience */
1557           for (pass = solv->updatemap.size ? 0 : 1; pass < 2; pass++)
1558             {
1559               int passlevel = level;
1560               if (pass == 1)
1561                 solv->decisioncnt_keep = solv->decisionq.count;
1562               /* start with installedpos, the position that gave us problems last time */
1563               for (i = installedpos, n = installed->start; n < installed->end; i++, n++)
1564                 {
1565                   Rule *rr;
1566                   Id d;
1567
1568                   if (i == installed->end)
1569                     i = installed->start;
1570                   s = pool->solvables + i;
1571                   if (s->repo != installed)
1572                     continue;
1573
1574                   if (solv->decisionmap[i] > 0)
1575                     continue;
1576                   if (!pass && solv->updatemap.size && !MAPTST(&solv->updatemap, i - installed->start))
1577                     continue;           /* updates first */
1578                   r = solv->rules + solv->updaterules + (i - installed->start);
1579                   rr = r;
1580                   if (!rr->p || rr->d < 0)      /* disabled -> look at feature rule */
1581                     rr -= solv->installed->end - solv->installed->start;
1582                   if (!rr->p)           /* identical to update rule? */
1583                     rr = r;
1584                   if (!rr->p)
1585                     continue;           /* orpaned package */
1586
1587                   /* XXX: noupdate check is probably no longer needed, as all jobs should
1588                    * already be satisfied */
1589                   /* Actually we currently still need it because of erase jobs */
1590                   /* if noupdate is set we do not look at update candidates */
1591                   queue_empty(&dq);
1592                   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 != i))
1593                     {
1594                       if (solv->noobsoletes.size && solv->multiversionupdaters
1595                              && (d = solv->multiversionupdaters[i - installed->start]) != 0)
1596                         {
1597                           /* special multiversion handling, make sure best version is chosen */
1598                           queue_push(&dq, i);
1599                           while ((p = pool->whatprovidesdata[d++]) != 0)
1600                             if (solv->decisionmap[p] >= 0)
1601                               queue_push(&dq, p);
1602                           policy_filter_unwanted(solv, &dq, POLICY_MODE_CHOOSE);
1603                           p = dq.elements[0];
1604                           if (p != i && solv->decisionmap[p] == 0)
1605                             {
1606                               rr = solv->rules + solv->featurerules + (i - solv->installed->start);
1607                               if (!rr->p)               /* update rule == feature rule? */
1608                                 rr = rr - solv->featurerules + solv->updaterules;
1609                               dq.count = 1;
1610                             }
1611                           else
1612                             dq.count = 0;
1613                         }
1614                       else
1615                         {
1616                           /* update to best package */
1617                           FOR_RULELITERALS(p, dp, rr)
1618                             {
1619                               if (solv->decisionmap[p] > 0)
1620                                 {
1621                                   dq.count = 0;         /* already fulfilled */
1622                                   break;
1623                                 }
1624                               if (!solv->decisionmap[p])
1625                                 queue_push(&dq, p);
1626                             }
1627                         }
1628                     }
1629                   /* install best version */
1630                   if (dq.count)
1631                     {
1632                       olevel = level;
1633                       level = selectandinstall(solv, level, &dq, disablerules, rr - solv->rules);
1634                       if (level == 0)
1635                         {
1636                           queue_free(&dq);
1637                           queue_free(&dqs);
1638                           return;
1639                         }
1640                       if (level <= olevel)
1641                         {
1642                           if (level == 1 || level < passlevel)
1643                             break;      /* trouble */
1644                           if (level < olevel)
1645                             n = installed->start;       /* redo all */
1646                           i--;
1647                           n--;
1648                           continue;
1649                         }
1650                     }
1651                   /* if still undecided keep package */
1652                   if (solv->decisionmap[i] == 0)
1653                     {
1654                       olevel = level;
1655                       if (solv->cleandepsmap.size && MAPTST(&solv->cleandepsmap, i - installed->start))
1656                         {
1657                           POOL_DEBUG(SOLV_DEBUG_POLICY, "cleandeps erasing %s\n", pool_solvid2str(pool, i));
1658                           level = setpropagatelearn(solv, level, -i, disablerules, 0);
1659                         }
1660                       else
1661                         {
1662                           POOL_DEBUG(SOLV_DEBUG_POLICY, "keeping %s\n", pool_solvid2str(pool, i));
1663                           level = setpropagatelearn(solv, level, i, disablerules, r - solv->rules);
1664                         }
1665                       if (level == 0)
1666                         break;
1667                       if (level <= olevel)
1668                         {
1669                           if (level == 1 || level < passlevel)
1670                             break;      /* trouble */
1671                           if (level < olevel)
1672                             n = installed->start;       /* redo all */
1673                           i--;
1674                           n--;
1675                           continue;     /* retry with learnt rule */
1676                         }
1677                     }
1678                 }
1679               if (n < installed->end)
1680                 {
1681                   installedpos = i;     /* retry problem solvable next time */
1682                   break;                /* ran into trouble */
1683                 }
1684               installedpos = installed->start;  /* reset installedpos */
1685             }
1686           if (level == 0)
1687             break;              /* unsolvable */
1688           systemlevel = level + 1;
1689           if (pass < 2)
1690             continue;           /* had trouble, retry */
1691         }
1692
1693       if (level < systemlevel)
1694         systemlevel = level;
1695
1696       /*
1697        * decide
1698        */
1699       solv->decisioncnt_resolve = solv->decisionq.count;
1700       POOL_DEBUG(SOLV_DEBUG_POLICY, "deciding unresolved rules\n");
1701       for (i = 1, n = 1; n < solv->nrules; i++, n++)
1702         {
1703           if (i == solv->nrules)
1704             i = 1;
1705           r = solv->rules + i;
1706           if (r->d < 0)         /* ignore disabled rules */
1707             continue;
1708           queue_empty(&dq);
1709           if (r->d == 0)
1710             {
1711               /* binary or unary rule */
1712               /* need two positive undecided literals */
1713               if (r->p < 0 || r->w2 <= 0)
1714                 continue;
1715               if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
1716                 continue;
1717               queue_push(&dq, r->p);
1718               queue_push(&dq, r->w2);
1719             }
1720           else
1721             {
1722               /* make sure that
1723                * all negative literals are installed
1724                * no positive literal is installed
1725                * i.e. the rule is not fulfilled and we
1726                * just need to decide on the positive literals
1727                */
1728               if (r->p < 0)
1729                 {
1730                   if (solv->decisionmap[-r->p] <= 0)
1731                     continue;
1732                 }
1733               else
1734                 {
1735                   if (solv->decisionmap[r->p] > 0)
1736                     continue;
1737                   if (solv->decisionmap[r->p] == 0)
1738                     queue_push(&dq, r->p);
1739                 }
1740               dp = pool->whatprovidesdata + r->d;
1741               while ((p = *dp++) != 0)
1742                 {
1743                   if (p < 0)
1744                     {
1745                       if (solv->decisionmap[-p] <= 0)
1746                         break;
1747                     }
1748                   else
1749                     {
1750                       if (solv->decisionmap[p] > 0)
1751                         break;
1752                       if (solv->decisionmap[p] == 0)
1753                         queue_push(&dq, p);
1754                     }
1755                 }
1756               if (p)
1757                 continue;
1758             }
1759           IF_POOLDEBUG (SOLV_DEBUG_PROPAGATE)
1760             {
1761               POOL_DEBUG(SOLV_DEBUG_PROPAGATE, "unfulfilled ");
1762               solver_printruleclass(solv, SOLV_DEBUG_PROPAGATE, r);
1763             }
1764           /* dq.count < 2 cannot happen as this means that
1765            * the rule is unit */
1766           assert(dq.count > 1);
1767
1768           olevel = level;
1769           level = selectandinstall(solv, level, &dq, disablerules, r - solv->rules);
1770           if (level == 0)
1771             break;              /* unsolvable */
1772           if (level < systemlevel || level == 1)
1773             break;              /* trouble */
1774           /* something changed, so look at all rules again */
1775           n = 0;
1776         }
1777
1778       if (n != solv->nrules)    /* ran into trouble? */
1779         {
1780           if (level == 0)
1781             break;              /* unsolvable */
1782           continue;             /* start over */
1783         }
1784
1785       /* at this point we have a consistent system. now do the extras... */
1786
1787       solv->decisioncnt_weak = solv->decisionq.count;
1788       if (doweak)
1789         {
1790           int qcount;
1791
1792           POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended packages\n");
1793           queue_empty(&dq);     /* recommended packages */
1794           queue_empty(&dqs);    /* supplemented packages */
1795           for (i = 1; i < pool->nsolvables; i++)
1796             {
1797               if (solv->decisionmap[i] < 0)
1798                 continue;
1799               if (solv->decisionmap[i] > 0)
1800                 {
1801                   /* installed, check for recommends */
1802                   Id *recp, rec, pp, p;
1803                   s = pool->solvables + i;
1804                   if (solv->ignorealreadyrecommended && s->repo == solv->installed)
1805                     continue;
1806                   /* XXX need to special case AND ? */
1807                   if (s->recommends)
1808                     {
1809                       recp = s->repo->idarraydata + s->recommends;
1810                       while ((rec = *recp++) != 0)
1811                         {
1812                           qcount = dq.count;
1813                           FOR_PROVIDES(p, pp, rec)
1814                             {
1815                               if (solv->decisionmap[p] > 0)
1816                                 {
1817                                   dq.count = qcount;
1818                                   break;
1819                                 }
1820                               else if (solv->decisionmap[p] == 0)
1821                                 {
1822                                   if (solv->dupmap_all && solv->installed && pool->solvables[p].repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))))
1823                                     continue;
1824                                   queue_pushunique(&dq, p);
1825                                 }
1826                             }
1827                         }
1828                     }
1829                 }
1830               else
1831                 {
1832                   s = pool->solvables + i;
1833                   if (!s->supplements)
1834                     continue;
1835                   if (!pool_installable(pool, s))
1836                     continue;
1837                   if (!solver_is_supplementing(solv, s))
1838                     continue;
1839                   if (solv->dupmap_all && solv->installed && s->repo == solv->installed && (solv->droporphanedmap_all || (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, i - solv->installed->start))))
1840                     continue;
1841                   queue_push(&dqs, i);
1842                 }
1843             }
1844
1845           /* filter out all packages obsoleted by installed packages */
1846           /* this is no longer needed if we have reverse obsoletes */
1847           if ((dqs.count || dq.count) && solv->installed)
1848             {
1849               Map obsmap;
1850               Id obs, *obsp, po, ppo;
1851
1852               map_init(&obsmap, pool->nsolvables);
1853               for (p = solv->installed->start; p < solv->installed->end; p++)
1854                 {
1855                   s = pool->solvables + p;
1856                   if (s->repo != solv->installed || !s->obsoletes)
1857                     continue;
1858                   if (solv->decisionmap[p] <= 0)
1859                     continue;
1860                   if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
1861                     continue;
1862                   obsp = s->repo->idarraydata + s->obsoletes;
1863                   /* foreach obsoletes */
1864                   while ((obs = *obsp++) != 0)
1865                     FOR_PROVIDES(po, ppo, obs)
1866                       MAPSET(&obsmap, po);
1867                 }
1868               for (i = j = 0; i < dqs.count; i++)
1869                 if (!MAPTST(&obsmap, dqs.elements[i]))
1870                   dqs.elements[j++] = dqs.elements[i];
1871               dqs.count = j;
1872               for (i = j = 0; i < dq.count; i++)
1873                 if (!MAPTST(&obsmap, dq.elements[i]))
1874                   dq.elements[j++] = dq.elements[i];
1875               dq.count = j;
1876               map_free(&obsmap);
1877             }
1878
1879           /* filter out all already supplemented packages if requested */
1880           if (solv->ignorealreadyrecommended && dqs.count)
1881             {
1882               /* turn off all new packages */
1883               for (i = 0; i < solv->decisionq.count; i++)
1884                 {
1885                   p = solv->decisionq.elements[i];
1886                   if (p < 0)
1887                     continue;
1888                   s = pool->solvables + p;
1889                   if (s->repo && s->repo != solv->installed)
1890                     solv->decisionmap[p] = -solv->decisionmap[p];
1891                 }
1892               /* filter out old supplements */
1893               for (i = j = 0; i < dqs.count; i++)
1894                 {
1895                   p = dqs.elements[i];
1896                   s = pool->solvables + p;
1897                   if (!s->supplements)
1898                     continue;
1899                   if (!solver_is_supplementing(solv, s))
1900                     dqs.elements[j++] = p;
1901                 }
1902               dqs.count = j;
1903               /* undo turning off */
1904               for (i = 0; i < solv->decisionq.count; i++)
1905                 {
1906                   p = solv->decisionq.elements[i];
1907                   if (p < 0)
1908                     continue;
1909                   s = pool->solvables + p;
1910                   if (s->repo && s->repo != solv->installed)
1911                     solv->decisionmap[p] = -solv->decisionmap[p];
1912                 }
1913             }
1914
1915           /* multiversion doesn't mix well with supplements.
1916            * filter supplemented packages where we already decided
1917            * to install a different version (see bnc#501088) */
1918           if (dqs.count && solv->noobsoletes.size)
1919             {
1920               for (i = j = 0; i < dqs.count; i++)
1921                 {
1922                   p = dqs.elements[i];
1923                   if (MAPTST(&solv->noobsoletes, p))
1924                     {
1925                       Id p2, pp2;
1926                       s = pool->solvables + p;
1927                       FOR_PROVIDES(p2, pp2, s->name)
1928                         if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name)
1929                           break;
1930                       if (p2)
1931                         continue;       /* ignore this package */
1932                     }
1933                   dqs.elements[j++] = p;
1934                 }
1935               dqs.count = j;
1936             }
1937
1938           /* make dq contain both recommended and supplemented pkgs */
1939           if (dqs.count)
1940             {
1941               for (i = 0; i < dqs.count; i++)
1942                 queue_pushunique(&dq, dqs.elements[i]);
1943             }
1944
1945           if (dq.count)
1946             {
1947               Map dqmap;
1948               int decisioncount = solv->decisionq.count;
1949
1950               if (dq.count == 1)
1951                 {
1952                   /* simple case, just one package. no need to choose  */
1953                   p = dq.elements[0];
1954                   if (dqs.count)
1955                     POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
1956                   else
1957                     POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
1958                   queue_push(&solv->recommendations, p);
1959                   level = setpropagatelearn(solv, level, p, 0, 0);
1960                   if (level == 0)
1961                     break;
1962                   continue;     /* back to main loop */
1963                 }
1964
1965               /* filter packages, this gives us the best versions */
1966               policy_filter_unwanted(solv, &dq, POLICY_MODE_RECOMMEND);
1967
1968               /* create map of result */
1969               map_init(&dqmap, pool->nsolvables);
1970               for (i = 0; i < dq.count; i++)
1971                 MAPSET(&dqmap, dq.elements[i]);
1972
1973               /* install all supplemented packages */
1974               for (i = 0; i < dqs.count; i++)
1975                 {
1976                   p = dqs.elements[i];
1977                   if (solv->decisionmap[p] || !MAPTST(&dqmap, p))
1978                     continue;
1979                   POOL_DEBUG(SOLV_DEBUG_POLICY, "installing supplemented %s\n", pool_solvid2str(pool, p));
1980                   queue_push(&solv->recommendations, p);
1981                   olevel = level;
1982                   level = setpropagatelearn(solv, level, p, 0, 0);
1983                   if (level <= olevel)
1984                     break;
1985                 }
1986               if (i < dqs.count || solv->decisionq.count < decisioncount)
1987                 {
1988                   map_free(&dqmap);
1989                   if (level == 0)
1990                     break;
1991                   continue;
1992                 }
1993
1994               /* install all recommended packages */
1995               /* more work as we want to created branches if multiple
1996                * choices are valid */
1997               for (i = 0; i < decisioncount; i++)
1998                 {
1999                   Id rec, *recp, pp;
2000                   p = solv->decisionq.elements[i];
2001                   if (p < 0)
2002                     continue;
2003                   s = pool->solvables + p;
2004                   if (!s->repo || (solv->ignorealreadyrecommended && s->repo == solv->installed))
2005                     continue;
2006                   if (!s->recommends)
2007                     continue;
2008                   recp = s->repo->idarraydata + s->recommends;
2009                   while ((rec = *recp++) != 0)
2010                     {
2011                       queue_empty(&dq);
2012                       FOR_PROVIDES(p, pp, rec)
2013                         {
2014                           if (solv->decisionmap[p] > 0)
2015                             {
2016                               dq.count = 0;
2017                               break;
2018                             }
2019                           else if (solv->decisionmap[p] == 0 && MAPTST(&dqmap, p))
2020                             queue_pushunique(&dq, p);
2021                         }
2022                       if (!dq.count)
2023                         continue;
2024                       if (dq.count > 1)
2025                         {
2026                           /* multiple candidates, open a branch */
2027                           for (i = 1; i < dq.count; i++)
2028                             queue_push(&solv->branches, dq.elements[i]);
2029                           queue_push(&solv->branches, -level);
2030                         }
2031                       p = dq.elements[0];
2032                       POOL_DEBUG(SOLV_DEBUG_POLICY, "installing recommended %s\n", pool_solvid2str(pool, p));
2033                       queue_push(&solv->recommendations, p);
2034                       olevel = level;
2035                       level = setpropagatelearn(solv, level, p, 0, 0);
2036                       if (level <= olevel || solv->decisionq.count < decisioncount)
2037                         break;  /* we had to revert some decisions */
2038                     }
2039                   if (rec)
2040                     break;      /* had a problem above, quit loop */
2041                 }
2042               map_free(&dqmap);
2043               if (level == 0)
2044                 break;
2045               continue;         /* back to main loop so that all deps are checked */
2046             }
2047         }
2048
2049       solv->decisioncnt_orphan = solv->decisionq.count;
2050       if (solv->dupmap_all && solv->installed)
2051         {
2052           int installedone = 0;
2053
2054           /* let's see if we can install some unsupported package */
2055           POOL_DEBUG(SOLV_DEBUG_SOLVER, "deciding orphaned packages\n");
2056           for (i = 0; i < solv->orphaned.count; i++)
2057             {
2058               p = solv->orphaned.elements[i];
2059               if (solv->decisionmap[p])
2060                 continue;       /* already decided */
2061               olevel = level;
2062               if (solv->droporphanedmap_all)
2063                 continue;
2064               if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))
2065                 continue;
2066               POOL_DEBUG(SOLV_DEBUG_SOLVER, "keeping orphaned %s\n", pool_solvid2str(pool, p));
2067               level = setpropagatelearn(solv, level, p, 0, 0);
2068               installedone = 1;
2069               if (level < olevel)
2070                 break;
2071             }
2072           if (level == 0)
2073             break;
2074           if (installedone || i < solv->orphaned.count)
2075             {
2076               if (level == 0)
2077                 break;
2078               continue;         /* back to main loop */
2079             }
2080           for (i = 0; i < solv->orphaned.count; i++)
2081             {
2082               p = solv->orphaned.elements[i];
2083               if (solv->decisionmap[p])
2084                 continue;       /* already decided */
2085               POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing orphaned %s\n", pool_solvid2str(pool, p));
2086               olevel = level;
2087               level = setpropagatelearn(solv, level, -p, 0, 0);
2088               if (level < olevel)
2089                 break;
2090             }
2091           if (i < solv->orphaned.count)
2092             {
2093               if (level == 0)
2094                 break;
2095               continue;         /* back to main loop */
2096             }
2097         }
2098
2099      if (solv->solution_callback)
2100         {
2101           solv->solution_callback(solv, solv->solution_callback_data);
2102           if (solv->branches.count)
2103             {
2104               int i = solv->branches.count - 1;
2105               int l = -solv->branches.elements[i];
2106               Id why;
2107
2108               for (; i > 0; i--)
2109                 if (solv->branches.elements[i - 1] < 0)
2110                   break;
2111               p = solv->branches.elements[i];
2112               POOL_DEBUG(SOLV_DEBUG_SOLVER, "branching with %s\n", pool_solvid2str(pool, p));
2113               queue_empty(&dq);
2114               for (j = i + 1; j < solv->branches.count; j++)
2115                 queue_push(&dq, solv->branches.elements[j]);
2116               solv->branches.count = i;
2117               level = l;
2118               revert(solv, level);
2119               if (dq.count > 1)
2120                 for (j = 0; j < dq.count; j++)
2121                   queue_push(&solv->branches, dq.elements[j]);
2122               olevel = level;
2123               why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2124               assert(why >= 0);
2125               level = setpropagatelearn(solv, level, p, disablerules, why);
2126               if (level == 0)
2127                 break;
2128               continue;
2129             }
2130           /* all branches done, we're finally finished */
2131           break;
2132         }
2133
2134       /* auto-minimization step */
2135      if (solv->branches.count)
2136         {
2137           int l = 0, lasti = -1, lastl = -1;
2138           Id why;
2139
2140           p = 0;
2141           for (i = solv->branches.count - 1; i >= 0; i--)
2142             {
2143               p = solv->branches.elements[i];
2144               if (p < 0)
2145                 l = -p;
2146               else if (p > 0 && solv->decisionmap[p] > l + 1)
2147                 {
2148                   lasti = i;
2149                   lastl = l;
2150                 }
2151             }
2152           if (lasti >= 0)
2153             {
2154               /* kill old solvable so that we do not loop */
2155               p = solv->branches.elements[lasti];
2156               solv->branches.elements[lasti] = 0;
2157               POOL_DEBUG(SOLV_DEBUG_SOLVER, "minimizing %d -> %d with %s\n", solv->decisionmap[p], lastl, pool_solvid2str(pool, p));
2158               minimizationsteps++;
2159
2160               level = lastl;
2161               revert(solv, level);
2162               why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2163               assert(why >= 0);
2164               olevel = level;
2165               level = setpropagatelearn(solv, level, p, disablerules, why);
2166               if (level == 0)
2167                 break;
2168               continue;         /* back to main loop */
2169             }
2170         }
2171       /* no minimization found, we're finally finished! */
2172       break;
2173     }
2174
2175   POOL_DEBUG(SOLV_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable, %d minimization steps\n", solv->stats_learned, solv->stats_unsolvable, minimizationsteps);
2176
2177   POOL_DEBUG(SOLV_DEBUG_STATS, "done solving.\n\n");
2178   queue_free(&dq);
2179   queue_free(&dqs);
2180   if (level == 0)
2181     {
2182       /* unsolvable */
2183       solv->decisioncnt_update = solv->decisionq.count;
2184       solv->decisioncnt_keep = solv->decisionq.count;
2185       solv->decisioncnt_resolve = solv->decisionq.count;
2186       solv->decisioncnt_weak = solv->decisionq.count;
2187       solv->decisioncnt_orphan = solv->decisionq.count;
2188     }
2189 #if 0
2190   solver_printdecisionq(solv, SOLV_DEBUG_RESULT);
2191 #endif
2192 }
2193
2194
2195 /*-------------------------------------------------------------------
2196  *
2197  * remove disabled conflicts
2198  *
2199  * purpose: update the decisionmap after some rules were disabled.
2200  * this is used to calculate the suggested/recommended package list.
2201  * Also returns a "removed" list to undo the discisionmap changes.
2202  */
2203
2204 static void
2205 removedisabledconflicts(Solver *solv, Queue *removed)
2206 {
2207   Pool *pool = solv->pool;
2208   int i, n;
2209   Id p, why, *dp;
2210   Id new;
2211   Rule *r;
2212   Id *decisionmap = solv->decisionmap;
2213
2214   queue_empty(removed);
2215   for (i = 0; i < solv->decisionq.count; i++)
2216     {
2217       p = solv->decisionq.elements[i];
2218       if (p > 0)
2219         continue;       /* conflicts only, please */
2220       why = solv->decisionq_why.elements[i];
2221       if (why == 0)
2222         {
2223           /* no rule involved, must be a orphan package drop */
2224           continue;
2225         }
2226       /* we never do conflicts on free decisions, so there
2227        * must have been an unit rule */
2228       assert(why > 0);
2229       r = solv->rules + why;
2230       if (r->d < 0 && decisionmap[-p])
2231         {
2232           /* rule is now disabled, remove from decisionmap */
2233           POOL_DEBUG(SOLV_DEBUG_SOLVER, "removing conflict for package %s[%d]\n", pool_solvid2str(pool, -p), -p);
2234           queue_push(removed, -p);
2235           queue_push(removed, decisionmap[-p]);
2236           decisionmap[-p] = 0;
2237         }
2238     }
2239   if (!removed->count)
2240     return;
2241   /* we removed some confliced packages. some of them might still
2242    * be in conflict, so search for unit rules and re-conflict */
2243   new = 0;
2244   for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
2245     {
2246       if (i == solv->nrules)
2247         {
2248           i = 1;
2249           r = solv->rules + i;
2250         }
2251       if (r->d < 0)
2252         continue;
2253       if (!r->w2)
2254         {
2255           if (r->p < 0 && !decisionmap[-r->p])
2256             new = r->p;
2257         }
2258       else if (!r->d)
2259         {
2260           /* binary rule */
2261           if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
2262             new = r->p;
2263           else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
2264             new = r->w2;
2265         }
2266       else
2267         {
2268           if (r->p < 0 && decisionmap[-r->p] == 0)
2269             new = r->p;
2270           if (new || DECISIONMAP_FALSE(r->p))
2271             {
2272               dp = pool->whatprovidesdata + r->d;
2273               while ((p = *dp++) != 0)
2274                 {
2275                   if (new && p == new)
2276                     continue;
2277                   if (p < 0 && decisionmap[-p] == 0)
2278                     {
2279                       if (new)
2280                         {
2281                           new = 0;
2282                           break;
2283                         }
2284                       new = p;
2285                     }
2286                   else if (!DECISIONMAP_FALSE(p))
2287                     {
2288                       new = 0;
2289                       break;
2290                     }
2291                 }
2292             }
2293         }
2294       if (new)
2295         {
2296           POOL_DEBUG(SOLV_DEBUG_SOLVER, "re-conflicting package %s[%d]\n", pool_solvid2str(pool, -new), -new);
2297           decisionmap[-new] = -1;
2298           new = 0;
2299           n = 0;        /* redo all rules */
2300         }
2301     }
2302 }
2303
2304 static inline void
2305 undo_removedisabledconflicts(Solver *solv, Queue *removed)
2306 {
2307   int i;
2308   for (i = 0; i < removed->count; i += 2)
2309     solv->decisionmap[removed->elements[i]] = removed->elements[i + 1];
2310 }
2311
2312
2313 /*-------------------------------------------------------------------
2314  *
2315  * weaken solvable dependencies
2316  */
2317
2318 static void
2319 weaken_solvable_deps(Solver *solv, Id p)
2320 {
2321   int i;
2322   Rule *r;
2323
2324   for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++)
2325     {
2326       if (r->p != -p)
2327         continue;
2328       if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2329         continue;       /* conflict */
2330       queue_push(&solv->weakruleq, i);
2331     }
2332 }
2333
2334
2335 /********************************************************************/
2336 /* main() */
2337
2338
2339 static void
2340 findrecommendedsuggested(Solver *solv)
2341 {
2342   Pool *pool = solv->pool;
2343   Queue redoq, disabledq;
2344   int goterase, i;
2345   Solvable *s;
2346   Rule *r;
2347   Map obsmap;
2348
2349   map_init(&obsmap, pool->nsolvables);
2350   if (solv->installed)
2351     {
2352       Id obs, *obsp, p, po, ppo;
2353       for (p = solv->installed->start; p < solv->installed->end; p++)
2354         {
2355           s = pool->solvables + p;
2356           if (s->repo != solv->installed || !s->obsoletes)
2357             continue;
2358           if (solv->decisionmap[p] <= 0)
2359             continue;
2360           if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
2361             continue;
2362           obsp = s->repo->idarraydata + s->obsoletes;
2363           /* foreach obsoletes */
2364           while ((obs = *obsp++) != 0)
2365             FOR_PROVIDES(po, ppo, obs)
2366               MAPSET(&obsmap, po);
2367         }
2368     }
2369
2370   queue_init(&redoq);
2371   queue_init(&disabledq);
2372   goterase = 0;
2373   /* disable all erase jobs (including weak "keep uninstalled" rules) */
2374   for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
2375     {
2376       if (r->d < 0)     /* disabled ? */
2377         continue;
2378       if (r->p >= 0)    /* install job? */
2379         continue;
2380       queue_push(&disabledq, i);
2381       solver_disablerule(solv, r);
2382       goterase++;
2383     }
2384
2385   if (goterase)
2386     {
2387       enabledisablelearntrules(solv);
2388       removedisabledconflicts(solv, &redoq);
2389     }
2390
2391   /*
2392    * find recommended packages
2393    */
2394
2395   /* if redoq.count == 0 we already found all recommended in the
2396    * solver run */
2397   if (redoq.count || solv->dontinstallrecommended || !solv->dontshowinstalledrecommended || solv->ignorealreadyrecommended)
2398     {
2399       Id rec, *recp, p, pp;
2400
2401       /* create map of all recommened packages */
2402       solv->recommends_index = -1;
2403       MAPZERO(&solv->recommendsmap);
2404       for (i = 0; i < solv->decisionq.count; i++)
2405         {
2406           p = solv->decisionq.elements[i];
2407           if (p < 0)
2408             continue;
2409           s = pool->solvables + p;
2410           if (s->recommends)
2411             {
2412               recp = s->repo->idarraydata + s->recommends;
2413               while ((rec = *recp++) != 0)
2414                 {
2415                   FOR_PROVIDES(p, pp, rec)
2416                     if (solv->decisionmap[p] > 0)
2417                       break;
2418                   if (p)
2419                     {
2420                       if (!solv->dontshowinstalledrecommended)
2421                         {
2422                           FOR_PROVIDES(p, pp, rec)
2423                             if (solv->decisionmap[p] > 0)
2424                               MAPSET(&solv->recommendsmap, p);
2425                         }
2426                       continue; /* p != 0: already fulfilled */
2427                     }
2428                   FOR_PROVIDES(p, pp, rec)
2429                     MAPSET(&solv->recommendsmap, p);
2430                 }
2431             }
2432         }
2433       for (i = 1; i < pool->nsolvables; i++)
2434         {
2435           if (solv->decisionmap[i] < 0)
2436             continue;
2437           if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
2438             continue;
2439           if (MAPTST(&obsmap, i))
2440             continue;
2441           s = pool->solvables + i;
2442           if (!MAPTST(&solv->recommendsmap, i))
2443             {
2444               if (!s->supplements)
2445                 continue;
2446               if (!pool_installable(pool, s))
2447                 continue;
2448               if (!solver_is_supplementing(solv, s))
2449                 continue;
2450             }
2451           if (solv->dontinstallrecommended)
2452             queue_push(&solv->recommendations, i);
2453           else
2454             queue_pushunique(&solv->recommendations, i);
2455         }
2456       /* we use MODE_SUGGEST here so that repo prio is ignored */
2457       policy_filter_unwanted(solv, &solv->recommendations, POLICY_MODE_SUGGEST);
2458     }
2459
2460   /*
2461    * find suggested packages
2462    */
2463
2464   if (1)
2465     {
2466       Id sug, *sugp, p, pp;
2467
2468       /* create map of all suggests that are still open */
2469       solv->recommends_index = -1;
2470       MAPZERO(&solv->suggestsmap);
2471       for (i = 0; i < solv->decisionq.count; i++)
2472         {
2473           p = solv->decisionq.elements[i];
2474           if (p < 0)
2475             continue;
2476           s = pool->solvables + p;
2477           if (s->suggests)
2478             {
2479               sugp = s->repo->idarraydata + s->suggests;
2480               while ((sug = *sugp++) != 0)
2481                 {
2482                   FOR_PROVIDES(p, pp, sug)
2483                     if (solv->decisionmap[p] > 0)
2484                       break;
2485                   if (p)
2486                     {
2487                       if (!solv->dontshowinstalledrecommended)
2488                         {
2489                           FOR_PROVIDES(p, pp, sug)
2490                             if (solv->decisionmap[p] > 0)
2491                               MAPSET(&solv->suggestsmap, p);
2492                         }
2493                       continue; /* already fulfilled */
2494                     }
2495                   FOR_PROVIDES(p, pp, sug)
2496                     MAPSET(&solv->suggestsmap, p);
2497                 }
2498             }
2499         }
2500       for (i = 1; i < pool->nsolvables; i++)
2501         {
2502           if (solv->decisionmap[i] < 0)
2503             continue;
2504           if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
2505             continue;
2506           if (MAPTST(&obsmap, i))
2507             continue;
2508           s = pool->solvables + i;
2509           if (!MAPTST(&solv->suggestsmap, i))
2510             {
2511               if (!s->enhances)
2512                 continue;
2513               if (!pool_installable(pool, s))
2514                 continue;
2515               if (!solver_is_enhancing(solv, s))
2516                 continue;
2517             }
2518           queue_push(&solv->suggestions, i);
2519         }
2520       policy_filter_unwanted(solv, &solv->suggestions, POLICY_MODE_SUGGEST);
2521     }
2522
2523   /* undo removedisabledconflicts */
2524   if (redoq.count)
2525     undo_removedisabledconflicts(solv, &redoq);
2526   queue_free(&redoq);
2527
2528   /* undo job rule disabling */
2529   for (i = 0; i < disabledq.count; i++)
2530     solver_enablerule(solv, solv->rules + disabledq.elements[i]);
2531   queue_free(&disabledq);
2532   map_free(&obsmap);
2533 }
2534
2535 void
2536 solver_calculate_noobsmap(Pool *pool, Queue *job, Map *noobsmap)
2537 {
2538   int i;
2539   Id how, what, select;
2540   Id p, pp;
2541   for (i = 0; i < job->count; i += 2)
2542     {
2543       how = job->elements[i];
2544       if ((how & SOLVER_JOBMASK) != SOLVER_NOOBSOLETES)
2545         continue;
2546       what = job->elements[i + 1];
2547       select = how & SOLVER_SELECTMASK;
2548       if (!noobsmap->size)
2549         map_grow(noobsmap, pool->nsolvables);
2550       FOR_JOB_SELECT(p, pp, select, what)
2551         MAPSET(noobsmap, p);
2552     }
2553 }
2554
2555 /*
2556  * add a rule created by a job, record job number and weak flag
2557  */
2558 static inline void
2559 solver_addjobrule(Solver *solv, Id p, Id d, Id job, int weak)
2560 {
2561   solver_addrule(solv, p, d);
2562   queue_push(&solv->ruletojob, job);
2563   if (weak)
2564     queue_push(&solv->weakruleq, solv->nrules - 1);
2565 }
2566
2567 /*
2568  *
2569  * solve job queue
2570  *
2571  */
2572
2573 int
2574 solver_solve(Solver *solv, Queue *job)
2575 {
2576   Pool *pool = solv->pool;
2577   Repo *installed = solv->installed;
2578   int i;
2579   int oldnrules;
2580   Map addedmap;                /* '1' == have rpm-rules for solvable */
2581   Map installcandidatemap;
2582   Id how, what, select, name, weak, p, pp, d;
2583   Queue q;
2584   Solvable *s;
2585   Rule *r;
2586   int now, solve_start;
2587   int hasdupjob = 0;
2588
2589   solve_start = solv_timems(0);
2590
2591   /* log solver options */
2592   POOL_DEBUG(SOLV_DEBUG_STATS, "solver started\n");
2593   POOL_DEBUG(SOLV_DEBUG_STATS, "fixsystem=%d updatesystem=%d dosplitprovides=%d, noupdateprovide=%d noinfarchcheck=%d\n", solv->fixsystem, solv->updatesystem, solv->dosplitprovides, solv->noupdateprovide, solv->noinfarchcheck);
2594   POOL_DEBUG(SOLV_DEBUG_STATS, "distupgrade=%d distupgrade_removeunsupported=%d\n", solv->distupgrade, solv->distupgrade_removeunsupported);
2595   POOL_DEBUG(SOLV_DEBUG_STATS, "allowuninstall=%d, allowdowngrade=%d, allowarchchange=%d, allowvendorchange=%d\n", solv->allowuninstall, solv->allowdowngrade, solv->allowarchchange, solv->allowvendorchange);
2596   POOL_DEBUG(SOLV_DEBUG_STATS, "promoteepoch=%d, allowselfconflicts=%d\n", pool->promoteepoch, pool->allowselfconflicts);
2597   POOL_DEBUG(SOLV_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d, obsoleteusescolors=%d\n", pool->obsoleteusesprovides, pool->implicitobsoleteusesprovides, pool->obsoleteusescolors);
2598   POOL_DEBUG(SOLV_DEBUG_STATS, "dontinstallrecommended=%d, ignorealreadyrecommended=%d, dontshowinstalledrecommended=%d\n", solv->dontinstallrecommended, solv->ignorealreadyrecommended, solv->dontshowinstalledrecommended);
2599
2600   /* create whatprovides if not already there */
2601   if (!pool->whatprovides)
2602     pool_createwhatprovides(pool);
2603
2604   /* create obsolete index */
2605   policy_create_obsolete_index(solv);
2606
2607   /* remember job */
2608   queue_free(&solv->job);
2609   queue_init_clone(&solv->job, job);
2610
2611   /* initialize with legacy values */
2612   solv->fixmap_all = solv->fixsystem;
2613   solv->updatemap_all = solv->updatesystem;
2614   solv->droporphanedmap_all = solv->distupgrade_removeunsupported;
2615   solv->dupmap_all = solv->distupgrade;
2616
2617   /*
2618    * create basic rule set of all involved packages
2619    * use addedmap bitmap to make sure we don't create rules twice
2620    */
2621
2622   /* create noobsolete map if needed */
2623   solver_calculate_noobsmap(pool, job, &solv->noobsoletes);
2624
2625   map_init(&addedmap, pool->nsolvables);
2626   MAPSET(&addedmap, SYSTEMSOLVABLE);
2627
2628   map_init(&installcandidatemap, pool->nsolvables);
2629   queue_init(&q);
2630
2631   now = solv_timems(0);
2632   /*
2633    * create rules for all package that could be involved with the solving
2634    * so called: rpm rules
2635    *
2636    */
2637   if (installed)
2638     {
2639       /* check for update/verify jobs as they need to be known early */
2640       for (i = 0; i < job->count; i += 2)
2641         {
2642           how = job->elements[i];
2643           what = job->elements[i + 1];
2644           select = how & SOLVER_SELECTMASK;
2645           switch (how & SOLVER_JOBMASK)
2646             {
2647             case SOLVER_VERIFY:
2648               if (select == SOLVER_SOLVABLE_ALL)
2649                 solv->fixmap_all = 1;
2650               FOR_JOB_SELECT(p, pp, select, what)
2651                 {
2652                   s = pool->solvables + p;
2653                   if (!solv->installed || s->repo != solv->installed)
2654                     continue;
2655                   if (!solv->fixmap.size)
2656                     map_grow(&solv->fixmap, solv->installed->end - solv->installed->start);
2657                   MAPSET(&solv->fixmap, p - solv->installed->start);
2658                 }
2659               break;
2660             case SOLVER_UPDATE:
2661               if (select == SOLVER_SOLVABLE_ALL)
2662                 solv->updatemap_all = 1;
2663               FOR_JOB_SELECT(p, pp, select, what)
2664                 {
2665                   s = pool->solvables + p;
2666                   if (!solv->installed || s->repo != solv->installed)
2667                     continue;
2668                   if (!solv->updatemap.size)
2669                     map_grow(&solv->updatemap, solv->installed->end - solv->installed->start);
2670                   MAPSET(&solv->updatemap, p - solv->installed->start);
2671                 }
2672               break;
2673             default:
2674               break;
2675             }
2676         }
2677
2678       oldnrules = solv->nrules;
2679       FOR_REPO_SOLVABLES(installed, p, s)
2680         solver_addrpmrulesforsolvable(solv, s, &addedmap);
2681       POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
2682       oldnrules = solv->nrules;
2683       FOR_REPO_SOLVABLES(installed, p, s)
2684         solver_addrpmrulesforupdaters(solv, s, &addedmap, 1);
2685       POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
2686     }
2687
2688   /*
2689    * create rules for all packages involved in the job
2690    * (to be installed or removed)
2691    */
2692
2693   oldnrules = solv->nrules;
2694   for (i = 0; i < job->count; i += 2)
2695     {
2696       how = job->elements[i];
2697       what = job->elements[i + 1];
2698       select = how & SOLVER_SELECTMASK;
2699
2700       switch (how & SOLVER_JOBMASK)
2701         {
2702         case SOLVER_INSTALL:
2703           FOR_JOB_SELECT(p, pp, select, what)
2704             {
2705               MAPSET(&installcandidatemap, p);
2706               solver_addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
2707             }
2708           break;
2709         case SOLVER_DISTUPGRADE:
2710           if (select == SOLVER_SOLVABLE_ALL)
2711             {
2712               solv->dupmap_all = 1;
2713               solv->updatemap_all = 1;
2714             }
2715           if (!solv->dupmap_all)
2716             hasdupjob = 1;
2717           break;
2718         default:
2719           break;
2720         }
2721     }
2722   POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
2723
2724
2725   /*
2726    * add rules for suggests, enhances
2727    */
2728   oldnrules = solv->nrules;
2729   solver_addrpmrulesforweak(solv, &addedmap);
2730   POOL_DEBUG(SOLV_DEBUG_STATS, "added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
2731
2732   /*
2733    * first pass done, we now have all the rpm rules we need.
2734    * unify existing rules before going over all job rules and
2735    * policy rules.
2736    * at this point the system is always solvable,
2737    * as an empty system (remove all packages) is a valid solution
2738    */
2739
2740   IF_POOLDEBUG (SOLV_DEBUG_STATS)
2741     {
2742       int possible = 0, installable = 0;
2743       for (i = 1; i < pool->nsolvables; i++)
2744         {
2745           if (pool_installable(pool, pool->solvables + i))
2746             installable++;
2747           if (MAPTST(&addedmap, i))
2748             possible++;
2749         }
2750       POOL_DEBUG(SOLV_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
2751     }
2752
2753   solver_unifyrules(solv);                          /* remove duplicate rpm rules */
2754   solv->rpmrules_end = solv->nrules;              /* mark end of rpm rules */
2755
2756   POOL_DEBUG(SOLV_DEBUG_STATS, "rpm rule memory usage: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
2757   POOL_DEBUG(SOLV_DEBUG_STATS, "rpm rule creation took %d ms\n", solv_timems(now));
2758
2759   /* create dup maps if needed. We need the maps early to create our
2760    * update rules */
2761   if (hasdupjob)
2762     solver_createdupmaps(solv);
2763
2764   /*
2765    * create feature rules
2766    *
2767    * foreach installed:
2768    *   create assertion (keep installed, if no update available)
2769    *   or
2770    *   create update rule (A|update1(A)|update2(A)|...)
2771    *
2772    * those are used later on to keep a version of the installed packages in
2773    * best effort mode
2774    */
2775
2776   solv->featurerules = solv->nrules;              /* mark start of feature rules */
2777   if (installed)
2778     {
2779       /* foreach possibly installed solvable */
2780       for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
2781         {
2782           if (s->repo != installed)
2783             {
2784               solver_addrule(solv, 0, 0);       /* create dummy rule */
2785               continue;
2786             }
2787           solver_addupdaterule(solv, s, 1);    /* allow s to be updated */
2788         }
2789       /* make sure we accounted for all rules */
2790       assert(solv->nrules - solv->featurerules == installed->end - installed->start);
2791     }
2792   solv->featurerules_end = solv->nrules;
2793
2794     /*
2795      * Add update rules for installed solvables
2796      *
2797      * almost identical to feature rules
2798      * except that downgrades/archchanges/vendorchanges are not allowed
2799      */
2800
2801   solv->updaterules = solv->nrules;
2802
2803   if (installed)
2804     { /* foreach installed solvables */
2805       /* we create all update rules, but disable some later on depending on the job */
2806       for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
2807         {
2808           Rule *sr;
2809
2810           if (s->repo != installed)
2811             {
2812               solver_addrule(solv, 0, 0);       /* create dummy rule */
2813               continue;
2814             }
2815           solver_addupdaterule(solv, s, 0);     /* allowall = 0: downgrades not allowed */
2816           /*
2817            * check for and remove duplicate
2818            */
2819           r = solv->rules + solv->nrules - 1;           /* r: update rule */
2820           sr = r - (installed->end - installed->start); /* sr: feature rule */
2821           /* it's orphaned if there is no feature rule or the feature rule
2822            * consists just of the installed package */
2823           if (!sr->p || (sr->p == i && !sr->d && !sr->w2))
2824             queue_push(&solv->orphaned, i);
2825           if (!r->p)
2826             {
2827               assert(solv->dupmap_all && !sr->p);
2828               continue;
2829             }
2830           if (!solver_samerule(solv, r, sr))
2831             {
2832               /* identical rule, kill unneeded one */
2833               if (solv->allowuninstall)
2834                 {
2835                   /* keep feature rule, make it weak */
2836                   memset(r, 0, sizeof(*r));
2837                   queue_push(&solv->weakruleq, sr - solv->rules);
2838                 }
2839               else
2840                 {
2841                   /* keep update rule */
2842                   memset(sr, 0, sizeof(*sr));
2843                 }
2844             }
2845           else if (solv->allowuninstall)
2846             {
2847               /* make both feature and update rule weak */
2848               queue_push(&solv->weakruleq, r - solv->rules);
2849               queue_push(&solv->weakruleq, sr - solv->rules);
2850             }
2851           else
2852             solver_disablerule(solv, sr);
2853         }
2854       /* consistency check: we added a rule for _every_ installed solvable */
2855       assert(solv->nrules - solv->updaterules == installed->end - installed->start);
2856     }
2857   solv->updaterules_end = solv->nrules;
2858
2859
2860   /*
2861    * now add all job rules
2862    */
2863
2864   solv->jobrules = solv->nrules;
2865   for (i = 0; i < job->count; i += 2)
2866     {
2867       oldnrules = solv->nrules;
2868
2869       how = job->elements[i];
2870       what = job->elements[i + 1];
2871       weak = how & SOLVER_WEAK;
2872       select = how & SOLVER_SELECTMASK;
2873       switch (how & SOLVER_JOBMASK)
2874         {
2875         case SOLVER_INSTALL:
2876           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
2877           if (select == SOLVER_SOLVABLE)
2878             {
2879               p = what;
2880               d = 0;
2881             }
2882           else
2883             {
2884               queue_empty(&q);
2885               FOR_JOB_SELECT(p, pp, select, what)
2886                 queue_push(&q, p);
2887               if (!q.count)
2888                 {
2889                   /* no candidate found, make this an impossible rule */
2890                   queue_push(&q, -SYSTEMSOLVABLE);
2891                 }
2892               p = queue_shift(&q);      /* get first candidate */
2893               d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q);    /* internalize */
2894             }
2895           solver_addjobrule(solv, p, d, i, weak);
2896           break;
2897         case SOLVER_ERASE:
2898           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %s%serase %s\n", weak ? "weak " : "", how & SOLVER_CLEANDEPS ? "clean deps " : "", solver_select2str(pool, select, what));
2899           if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && solv->installed)
2900             map_grow(&solv->cleandepsmap, solv->installed->end - solv->installed->start);
2901           if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
2902             {
2903               /* special case for "erase a specific solvable": we also
2904                * erase all other solvables with that name, so that they
2905                * don't get picked up as replacement */
2906               /* XXX: look also at packages that obsolete this package? */
2907               name = pool->solvables[what].name;
2908               FOR_PROVIDES(p, pp, name)
2909                 {
2910                   if (p == what)
2911                     continue;
2912                   s = pool->solvables + p;
2913                   if (s->name != name)
2914                     continue;
2915                   /* keep other versions installed */
2916                   if (s->repo == solv->installed)
2917                     continue;
2918                   /* keep installcandidates of other jobs */
2919                   if (MAPTST(&installcandidatemap, p))
2920                     continue;
2921                   solver_addjobrule(solv, -p, 0, i, weak);      /* remove by id */
2922                 }
2923             }
2924           FOR_JOB_SELECT(p, pp, select, what)
2925             solver_addjobrule(solv, -p, 0, i, weak);
2926           break;
2927
2928         case SOLVER_UPDATE:
2929           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
2930           break;
2931         case SOLVER_VERIFY:
2932           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sverify %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
2933           break;
2934         case SOLVER_WEAKENDEPS:
2935           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
2936           if (select != SOLVER_SOLVABLE)
2937             break;
2938           s = pool->solvables + what;
2939           weaken_solvable_deps(solv, what);
2940           break;
2941         case SOLVER_NOOBSOLETES:
2942           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %sno obsolete %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
2943           break;
2944         case SOLVER_LOCK:
2945           POOL_DEBUG(SOLV_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(pool, select, what));
2946           FOR_JOB_SELECT(p, pp, select, what)
2947             {
2948               s = pool->solvables + p;
2949               solver_addjobrule(solv, installed && s->repo == installed ? p : -p, 0, i, weak);
2950             }
2951           break;
2952         case SOLVER_DISTUPGRADE:
2953           POOL_DEBUG(SOLV_DEBUG_JOB, "job: distupgrade %s\n", solver_select2str(pool, select, what));
2954           break;
2955         case SOLVER_DROP_ORPHANED:
2956           POOL_DEBUG(SOLV_DEBUG_JOB, "job: drop orphaned %s\n", solver_select2str(pool, select, what));
2957           if (select == SOLVER_SOLVABLE_ALL)
2958             solv->droporphanedmap_all = 1;
2959           FOR_JOB_SELECT(p, pp, select, what)
2960             {
2961               s = pool->solvables + p;
2962               if (!installed || s->repo != installed)
2963                 continue;
2964               if (!solv->droporphanedmap.size)
2965                 map_grow(&solv->droporphanedmap, installed->end - installed->start);
2966               MAPSET(&solv->droporphanedmap, p - installed->start);
2967             }
2968           break;
2969         case SOLVER_USERINSTALLED:
2970           POOL_DEBUG(SOLV_DEBUG_JOB, "job: user installed %s\n", solver_select2str(pool, select, what));
2971           break;
2972         default:
2973           POOL_DEBUG(SOLV_DEBUG_JOB, "job: unknown job\n");
2974           break;
2975         }
2976
2977         /*
2978          * debug
2979          */
2980
2981       IF_POOLDEBUG (SOLV_DEBUG_JOB)
2982         {
2983           int j;
2984           if (solv->nrules == oldnrules)
2985             POOL_DEBUG(SOLV_DEBUG_JOB, " - no rule created\n");
2986           for (j = oldnrules; j < solv->nrules; j++)
2987             {
2988               POOL_DEBUG(SOLV_DEBUG_JOB, " - job ");
2989               solver_printrule(solv, SOLV_DEBUG_JOB, solv->rules + j);
2990             }
2991         }
2992     }
2993   assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
2994   solv->jobrules_end = solv->nrules;
2995
2996   /* now create infarch and dup rules */
2997   if (!solv->noinfarchcheck)
2998     {
2999       solver_addinfarchrules(solv, &addedmap);
3000       if (pool->obsoleteusescolors)
3001         {
3002           /* currently doesn't work well with infarch rules, so make
3003            * them weak */
3004           for (i = solv->infarchrules; i < solv->infarchrules_end; i++)
3005             queue_push(&solv->weakruleq, i);
3006         }
3007     }
3008   else
3009     solv->infarchrules = solv->infarchrules_end = solv->nrules;
3010
3011   if (hasdupjob)
3012     {
3013       solver_addduprules(solv, &addedmap);
3014       solver_freedupmaps(solv); /* no longer needed */
3015     }
3016   else
3017     solv->duprules = solv->duprules_end = solv->nrules;
3018
3019   if (1)
3020     solver_addchoicerules(solv);
3021   else
3022     solv->choicerules = solv->choicerules_end = solv->nrules;
3023
3024   /* all rules created
3025    * --------------------------------------------------------------
3026    * prepare for solving
3027    */
3028
3029   /* free unneeded memory */
3030   map_free(&addedmap);
3031   map_free(&installcandidatemap);
3032   queue_free(&q);
3033
3034   POOL_DEBUG(SOLV_DEBUG_STATS, "%d rpm rules, %d job rules, %d infarch rules, %d dup rules, %d choice rules\n", solv->rpmrules_end - 1, solv->jobrules_end - solv->jobrules, solv->infarchrules_end - solv->infarchrules, solv->duprules_end - solv->duprules, solv->choicerules_end - solv->choicerules);
3035
3036   /* create weak map */
3037   map_init(&solv->weakrulemap, solv->nrules);
3038   for (i = 0; i < solv->weakruleq.count; i++)
3039     {
3040       p = solv->weakruleq.elements[i];
3041       MAPSET(&solv->weakrulemap, p);
3042     }
3043
3044   /* all new rules are learnt after this point */
3045   solv->learntrules = solv->nrules;
3046
3047   /* create watches chains */
3048   makewatches(solv);
3049
3050   /* create assertion index. it is only used to speed up
3051    * makeruledecsions() a bit */
3052   for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
3053     if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
3054       queue_push(&solv->ruleassertions, i);
3055
3056   /* disable update rules that conflict with our job */
3057   solver_disablepolicyrules(solv);
3058
3059   /* make initial decisions based on assertion rules */
3060   makeruledecisions(solv);
3061   POOL_DEBUG(SOLV_DEBUG_SOLVER, "problems so far: %d\n", solv->problems.count);
3062
3063   /*
3064    * ********************************************
3065    * solve!
3066    * ********************************************
3067    */
3068
3069   now = solv_timems(0);
3070   solver_run_sat(solv, 1, solv->dontinstallrecommended ? 0 : 1);
3071   POOL_DEBUG(SOLV_DEBUG_STATS, "solver took %d ms\n", solv_timems(now));
3072
3073   /*
3074    * calculate recommended/suggested packages
3075    */
3076   findrecommendedsuggested(solv);
3077
3078   /*
3079    * prepare solution queue if there were problems
3080    */
3081   solver_prepare_solutions(solv);
3082
3083   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);
3084   POOL_DEBUG(SOLV_DEBUG_STATS, "solver_solve took %d ms\n", solv_timems(solve_start));
3085
3086   /* return number of problems */
3087   return solv->problems.count ? solv->problems.count / 2 : 0;
3088 }
3089
3090 Transaction *
3091 solver_create_transaction(Solver *solv)
3092 {
3093   return transaction_create_decisionq(solv->pool, &solv->decisionq, &solv->noobsoletes);
3094 }
3095
3096 /***********************************************************************/
3097 /* disk usage computations */
3098
3099 /*-------------------------------------------------------------------
3100  *
3101  * calculate DU changes
3102  */
3103
3104 void
3105 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
3106 {
3107   Map installedmap;
3108
3109   solver_create_state_maps(solv, &installedmap, 0);
3110   pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
3111   map_free(&installedmap);
3112 }
3113
3114
3115 /*-------------------------------------------------------------------
3116  *
3117  * calculate changes in install size
3118  */
3119
3120 int
3121 solver_calc_installsizechange(Solver *solv)
3122 {
3123   Map installedmap;
3124   int change;
3125
3126   solver_create_state_maps(solv, &installedmap, 0);
3127   change = pool_calc_installsizechange(solv->pool, &installedmap);
3128   map_free(&installedmap);
3129   return change;
3130 }
3131
3132 void
3133 solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap)
3134 {
3135   pool_create_state_maps(solv->pool, &solv->decisionq, installedmap, conflictsmap);
3136 }
3137
3138 void
3139 solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res)
3140 {
3141   Map installedmap;
3142   pool_create_state_maps(solv->pool,  &solv->decisionq, &installedmap, 0);
3143   pool_trivial_installable_noobsoletesmap(solv->pool, &installedmap, pkgs, res, solv->noobsoletes.size ? &solv->noobsoletes : 0);
3144   map_free(&installedmap);
3145 }
3146
3147 int
3148 solver_get_decisionlevel(Solver *solv, Id p)
3149 {
3150   return solv->decisionmap[p];
3151 }
3152
3153 void
3154 solver_get_decisionqueue(Solver *solv, Queue *decisionq)
3155 {
3156   queue_free(decisionq);
3157   queue_init_clone(decisionq, &solv->decisionq);
3158 }
3159
3160 int
3161 solver_get_lastdecisionblocklevel(Solver *solv)
3162 {
3163   Id p;
3164   if (solv->decisionq.count == 0)
3165     return 0;
3166   p = solv->decisionq.elements[solv->decisionq.count - 1];
3167   if (p < 0)
3168     p = -p;
3169   return solv->decisionmap[p] < 0 ? -solv->decisionmap[p] : solv->decisionmap[p];
3170 }
3171
3172 void
3173 solver_get_decisionblock(Solver *solv, int level, Queue *decisionq)
3174 {
3175   Id p;
3176   int i;
3177
3178   queue_empty(decisionq);
3179   for (i = 0; i < solv->decisionq.count; i++)
3180     {
3181       p = solv->decisionq.elements[i];
3182       if (p < 0)
3183         p = -p;
3184       if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
3185         break;
3186     }
3187   if (i == solv->decisionq.count)
3188     return;
3189   for (i = 0; i < solv->decisionq.count; i++)
3190     {
3191       p = solv->decisionq.elements[i];
3192       if (p < 0)
3193         p = -p;
3194       if (solv->decisionmap[p] == level || solv->decisionmap[p] == -level)
3195         queue_push(decisionq, p);
3196       else
3197         break;
3198     }
3199 }
3200
3201 int
3202 solver_describe_decision(Solver *solv, Id p, Id *infop)
3203 {
3204   int i;
3205   Id pp, why;
3206
3207   if (infop)
3208     *infop = 0;
3209   if (!solv->decisionmap[p])
3210     return SOLVER_REASON_UNRELATED;
3211   pp = solv->decisionmap[p] < 0 ? -p : p;
3212   for (i = 0; i < solv->decisionq.count; i++)
3213     if (solv->decisionq.elements[i] == pp)
3214       break;
3215   if (i == solv->decisionq.count)       /* just in case... */
3216     return SOLVER_REASON_UNRELATED;
3217   why = solv->decisionq_why.elements[i];
3218   if (why > 0)
3219     {
3220       if (infop)
3221         *infop = why;
3222       return SOLVER_REASON_UNIT_RULE;
3223     }
3224   why = -why;
3225   if (i < solv->decisioncnt_update)
3226     {
3227       if (i == 0)
3228         {
3229           if (infop)
3230             *infop = SYSTEMSOLVABLE;
3231           return SOLVER_REASON_KEEP_INSTALLED;
3232         }
3233       if (infop)
3234         *infop = why;
3235       return SOLVER_REASON_RESOLVE_JOB;
3236     }
3237   if (i < solv->decisioncnt_keep)
3238     {
3239       if (why == 0 && pp < 0)
3240         return SOLVER_REASON_CLEANDEPS_ERASE;
3241       if (infop)
3242         {
3243           if (why >= solv->updaterules && why < solv->updaterules_end)
3244             *infop = why - solv->updaterules;
3245           else if (why >= solv->featurerules && why < solv->featurerules_end)
3246             *infop = why - solv->featurerules;
3247         }
3248       return SOLVER_REASON_UPDATE_INSTALLED;
3249     }
3250   if (i < solv->decisioncnt_resolve)
3251     {
3252       if (why == 0 && pp < 0)
3253         return SOLVER_REASON_CLEANDEPS_ERASE;
3254       if (infop)
3255         {
3256           if (why >= solv->updaterules && why < solv->updaterules_end)
3257             *infop = why - solv->updaterules;
3258           else if (why >= solv->featurerules && why < solv->featurerules_end)
3259             *infop = why - solv->featurerules;
3260         }
3261       return SOLVER_REASON_KEEP_INSTALLED;
3262     }
3263   if (i < solv->decisioncnt_weak)
3264     {
3265       if (infop)
3266         *infop = why;
3267       return SOLVER_REASON_RESOLVE;
3268     }
3269   if (solv->decisionq.count < solv->decisioncnt_orphan)
3270     return SOLVER_REASON_WEAKDEP;
3271   return SOLVER_REASON_RESOLVE_ORPHAN;
3272 }
3273
3274
3275 void
3276 solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq)
3277 {
3278   Pool *pool = solv->pool;
3279   int i;
3280   int level = solv->decisionmap[p];
3281   int decisionno;
3282   Solvable *s;
3283
3284   queue_empty(whyq);
3285   if (level < 0)
3286     return;     /* huh? */
3287   for (decisionno = 0; decisionno < solv->decisionq.count; decisionno++)
3288     if (solv->decisionq.elements[decisionno] == p)
3289       break;
3290   if (decisionno == solv->decisionq.count)
3291     return;     /* huh? */
3292   if (decisionno < solv->decisioncnt_weak || decisionno >= solv->decisioncnt_orphan)
3293     return;     /* huh? */
3294
3295   /* 1) list all packages that recommend us */
3296   for (i = 1; i < pool->nsolvables; i++)
3297     {
3298       Id *recp, rec, pp2, p2;
3299       if (solv->decisionmap[i] < 0 || solv->decisionmap[i] >= level)
3300         continue;
3301       s = pool->solvables + i;
3302       if (!s->recommends)
3303         continue;
3304       if (solv->ignorealreadyrecommended && s->repo == solv->installed)
3305         continue;
3306       recp = s->repo->idarraydata + s->recommends;
3307       while ((rec = *recp++) != 0)
3308         {
3309           int found = 0;
3310           FOR_PROVIDES(p2, pp2, rec)
3311             {
3312               if (p2 == p)
3313                 found = 1;
3314               else
3315                 {
3316                   /* if p2 is already installed, this recommends is ignored */
3317                   if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
3318                     break;
3319                 }
3320             }
3321           if (!p2 && found)
3322             {
3323               queue_push(whyq, SOLVER_REASON_RECOMMENDED);
3324               queue_push2(whyq, p2, rec);
3325             }
3326         }
3327     }
3328   /* 2) list all supplements */
3329   s = pool->solvables + p;
3330   if (s->supplements && level > 0)
3331     {
3332       Id *supp, sup, pp2, p2;
3333       int suppstart;
3334       /* this is a hack. to use solver_dep_fulfilled we temporarily clear
3335        * everything above our level in the decisionmap */
3336       for (i = decisionno; i < solv->decisionq.count; i++ )
3337         {
3338           p2 = solv->decisionq.elements[i];
3339           if (p2 > 0)
3340             solv->decisionmap[p2] = -solv->decisionmap[p2];
3341         }
3342       supp = s->repo->idarraydata + s->supplements;
3343       suppstart = whyq->count;
3344       while ((sup = *supp++) != 0)
3345         if (solver_dep_fulfilled(solv, sup))
3346           {
3347             int found = 0;
3348             /* let's see if this is an easy supp */
3349             FOR_PROVIDES(p2, pp2, sup)
3350               {
3351                 if (solv->ignorealreadyrecommended && solv->installed)
3352                   {
3353                     if (pool->solvables[p2].repo == solv->installed)
3354                       continue;
3355                   }
3356                 if (solv->decisionmap[p2] > 0 && solv->decisionmap[p2] < level)
3357                   {
3358                     queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
3359                     queue_push2(whyq, p2, sup);
3360                     found = 1;
3361                   }
3362               }
3363             if (!found)
3364               {
3365                 /* hard case, just note with no package */
3366                 queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);
3367                 queue_push2(whyq, 0, sup);
3368               }
3369           }
3370       for (i = decisionno; i < solv->decisionq.count; i++)
3371         {
3372           p2 = solv->decisionq.elements[i];
3373           if (p2 > 0)
3374             solv->decisionmap[p2] = -solv->decisionmap[p2];
3375         }
3376     }
3377 }