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