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       extern void disablechoicerules(Solver *solv, Rule *r);
 979       /* disable last weak rule */
 980       solv->problems.count = oldproblemcount;
 981       solv->learnt_pool.count = oldlearntpoolcount;
 982       if (lastweak >= solv->jobrules && lastweak < solv->jobrules_end)
 983         v = -(solv->ruletojob.elements[lastweak - solv->jobrules] + 1);
 984       else
 985         v = lastweak;
 986       POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "disabling ");
 987       solver_printruleclass(solv, SAT_DEBUG_UNSOLVABLE, solv->rules + lastweak);
 988       if (lastweak >= solv->choicerules && lastweak < solv->choicerules_end)
 989         disablechoicerules(solv, solv->rules + lastweak);
 990       solver_disableproblem(solv, v);
 991       if (v < 0)
 992         solver_reenablepolicyrules(solv, -(v + 1));
 993       solver_reset(solv);
 994       return 1;
 995     }
 996
 997   /* finish proof */
 998   queue_push(&solv->learnt_pool, 0);
 999   solv->problems.elements[oldproblemcount] = oldlearntpoolcount;
1000
1001   if (disablerules)
1002     {
1003       for (i = oldproblemcount + 1; i < solv->problems.count - 1; i++)
1004         solver_disableproblem(solv, solv->problems.elements[i]);
1005       /* XXX: might want to enable all weak rules again */
1006       solver_reset(solv);
1007       return 1;
1008     }
1009   POOL_DEBUG(SAT_DEBUG_UNSOLVABLE, "UNSOLVABLE\n");
1010   return 0;
1011 }
1012
1013
1014 /********************************************************************/
1015 /* Decision revert */
1016
1017 /*-------------------------------------------------------------------
1018  *
1019  * revert
1020  * revert decision at level
1021  */
1022
1023 static void
1024 revert(Solver *solv, int level)
1025 {
1026   Pool *pool = solv->pool;
1027   Id v, vv;
1028   while (solv->decisionq.count)
1029     {
1030       v = solv->decisionq.elements[solv->decisionq.count - 1];
1031       vv = v > 0 ? v : -v;
1032       if (solv->decisionmap[vv] <= level && solv->decisionmap[vv] >= -level)
1033         break;
1034       POOL_DEBUG(SAT_DEBUG_PROPAGATE, "reverting decision %d at %d\n", v, solv->decisionmap[vv]);
1035       if (v > 0 && solv->recommendations.count && v == solv->recommendations.elements[solv->recommendations.count - 1])
1036         solv->recommendations.count--;
1037       solv->decisionmap[vv] = 0;
1038       solv->decisionq.count--;
1039       solv->decisionq_why.count--;
1040       solv->propagate_index = solv->decisionq.count;
1041     }
1042   while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level)
1043     {
1044       solv->branches.count--;
1045       while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0)
1046         solv->branches.count--;
1047     }
1048   solv->recommends_index = -1;
1049 }
1050
1051
1052 /*-------------------------------------------------------------------
1053  *
1054  * watch2onhighest - put watch2 on literal with highest level
1055  */
1056
1057 static inline void
1058 watch2onhighest(Solver *solv, Rule *r)
1059 {
1060   int l, wl = 0;
1061   Id d, v, *dp;
1062
1063   d = r->d < 0 ? -r->d - 1 : r->d;
1064   if (!d)
1065     return;     /* binary rule, both watches are set */
1066   dp = solv->pool->whatprovidesdata + d;
1067   while ((v = *dp++) != 0)
1068     {
1069       l = solv->decisionmap[v < 0 ? -v : v];
1070       if (l < 0)
1071         l = -l;
1072       if (l > wl)
1073         {
1074           r->w2 = dp[-1];
1075           wl = l;
1076         }
1077     }
1078 }
1079
1080
1081 /*-------------------------------------------------------------------
1082  *
1083  * setpropagatelearn
1084  *
1085  * add free decision (solvable to install) to decisionq
1086  * increase level and propagate decision
1087  * return if no conflict.
1088  *
1089  * in conflict case, analyze conflict rule, add resulting
1090  * rule to learnt rule set, make decision from learnt
1091  * rule (always unit) and re-propagate.
1092  *
1093  * returns the new solver level or 0 if unsolvable
1094  *
1095  */
1096
1097 static int
1098 setpropagatelearn(Solver *solv, int level, Id decision, int disablerules, Id ruleid)
1099 {
1100   Pool *pool = solv->pool;
1101   Rule *r;
1102   Id p = 0, d = 0;
1103   int l, why;
1104
1105   assert(ruleid >= 0);
1106   if (decision)
1107     {
1108       level++;
1109       if (decision > 0)
1110         solv->decisionmap[decision] = level;
1111       else
1112         solv->decisionmap[-decision] = -level;
1113       queue_push(&solv->decisionq, decision);
1114       queue_push(&solv->decisionq_why, -ruleid);        /* <= 0 -> free decision */
1115     }
1116   for (;;)
1117     {
1118       r = propagate(solv, level);
1119       if (!r)
1120         break;
1121       if (level == 1)
1122         return analyze_unsolvable(solv, r, disablerules);
1123       POOL_DEBUG(SAT_DEBUG_ANALYZE, "conflict with rule #%d\n", (int)(r - solv->rules));
1124       l = analyze(solv, level, r, &p, &d, &why);        /* learnt rule in p and d */
1125       assert(l > 0 && l < level);
1126       POOL_DEBUG(SAT_DEBUG_ANALYZE, "reverting decisions (level %d -> %d)\n", level, l);
1127       level = l;
1128       revert(solv, level);
1129       r = solver_addrule(solv, p, d);
1130       assert(r);
1131       assert(solv->learnt_why.count == (r - solv->rules) - solv->learntrules);
1132       queue_push(&solv->learnt_why, why);
1133       if (d)
1134         {
1135           /* at least 2 literals, needs watches */
1136           watch2onhighest(solv, r);
1137           addwatches_rule(solv, r);
1138         }
1139       else
1140         {
1141           /* learnt rule is an assertion */
1142           queue_push(&solv->ruleassertions, r - solv->rules);
1143         }
1144       /* the new rule is unit by design */
1145       solv->decisionmap[p > 0 ? p : -p] = p > 0 ? level : -level;
1146       queue_push(&solv->decisionq, p);
1147       queue_push(&solv->decisionq_why, r - solv->rules);
1148       IF_POOLDEBUG (SAT_DEBUG_ANALYZE)
1149         {
1150           POOL_DEBUG(SAT_DEBUG_ANALYZE, "decision: ");
1151           solver_printruleelement(solv, SAT_DEBUG_ANALYZE, 0, p);
1152           POOL_DEBUG(SAT_DEBUG_ANALYZE, "new rule: ");
1153           solver_printrule(solv, SAT_DEBUG_ANALYZE, r);
1154         }
1155     }
1156   return level;
1157 }
1158
1159
1160 /*-------------------------------------------------------------------
1161  *
1162  * select and install
1163  *
1164  * install best package from the queue. We add an extra package, inst, if
1165  * provided. See comment in weak install section.
1166  *
1167  * returns the new solver level or 0 if unsolvable
1168  *
1169  */
1170
1171 static int
1172 selectandinstall(Solver *solv, int level, Queue *dq, int disablerules, Id ruleid)
1173 {
1174   Pool *pool = solv->pool;
1175   Id p;
1176   int i;
1177
1178   if (dq->count > 1)
1179     policy_filter_unwanted(solv, dq, POLICY_MODE_CHOOSE);
1180   if (dq->count > 1)
1181     {
1182       /* XXX: didn't we already do that? */
1183       /* XXX: shouldn't we prefer installed packages? */
1184       /* XXX: move to policy.c? */
1185       /* choose the supplemented one */
1186       for (i = 0; i < dq->count; i++)
1187         if (solver_is_supplementing(solv, pool->solvables + dq->elements[i]))
1188           {
1189             dq->elements[0] = dq->elements[i];
1190             dq->count = 1;
1191             break;
1192           }
1193     }
1194   if (dq->count > 1)
1195     {
1196       /* multiple candidates, open a branch */
1197       for (i = 1; i < dq->count; i++)
1198         queue_push(&solv->branches, dq->elements[i]);
1199       queue_push(&solv->branches, -level);
1200     }
1201   p = dq->elements[0];
1202
1203   POOL_DEBUG(SAT_DEBUG_POLICY, "installing %s\n", solvid2str(pool, p));
1204
1205   return setpropagatelearn(solv, level, p, disablerules, ruleid);
1206 }
1207
1208
1209 /********************************************************************/
1210 /* Main solver interface */
1211
1212
1213 /*-------------------------------------------------------------------
1214  *
1215  * solver_create
1216  * create solver structure
1217  *
1218  * pool: all available solvables
1219  * installed: installed Solvables
1220  *
1221  *
1222  * Upon solving, rules are created to flag the Solvables
1223  * of the 'installed' Repo as installed.
1224  */
1225
1226 Solver *
1227 solver_create(Pool *pool)
1228 {
1229   Solver *solv;
1230   solv = (Solver *)sat_calloc(1, sizeof(Solver));
1231   solv->pool = pool;
1232   solv->installed = pool->installed;
1233
1234   transaction_init(&solv->trans, pool);
1235   queue_init(&solv->ruletojob);
1236   queue_init(&solv->decisionq);
1237   queue_init(&solv->decisionq_why);
1238   queue_init(&solv->problems);
1239   queue_init(&solv->suggestions);
1240   queue_init(&solv->recommendations);
1241   queue_init(&solv->orphaned);
1242   queue_init(&solv->learnt_why);
1243   queue_init(&solv->learnt_pool);
1244   queue_init(&solv->branches);
1245   queue_init(&solv->covenantq);
1246   queue_init(&solv->weakruleq);
1247   queue_init(&solv->ruleassertions);
1248
1249   map_init(&solv->recommendsmap, pool->nsolvables);
1250   map_init(&solv->suggestsmap, pool->nsolvables);
1251   map_init(&solv->noupdate, solv->installed ? solv->installed->end - solv->installed->start : 0);
1252   solv->recommends_index = 0;
1253
1254   solv->decisionmap = (Id *)sat_calloc(pool->nsolvables, sizeof(Id));
1255   solv->nrules = 1;
1256   solv->rules = sat_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
1257   memset(solv->rules, 0, sizeof(Rule));
1258
1259   return solv;
1260 }
1261
1262
1263 /*-------------------------------------------------------------------
1264  *
1265  * solver_free
1266  */
1267
1268 void
1269 solver_free(Solver *solv)
1270 {
1271   transaction_free(&solv->trans);
1272   queue_free(&solv->job);
1273   queue_free(&solv->ruletojob);
1274   queue_free(&solv->decisionq);
1275   queue_free(&solv->decisionq_why);
1276   queue_free(&solv->learnt_why);
1277   queue_free(&solv->learnt_pool);
1278   queue_free(&solv->problems);
1279   queue_free(&solv->solutions);
1280   queue_free(&solv->suggestions);
1281   queue_free(&solv->recommendations);
1282   queue_free(&solv->orphaned);
1283   queue_free(&solv->branches);
1284   queue_free(&solv->covenantq);
1285   queue_free(&solv->weakruleq);
1286   queue_free(&solv->ruleassertions);
1287
1288   map_free(&solv->recommendsmap);
1289   map_free(&solv->suggestsmap);
1290   map_free(&solv->noupdate);
1291   map_free(&solv->weakrulemap);
1292   map_free(&solv->noobsoletes);
1293
1294   map_free(&solv->updatemap);
1295   map_free(&solv->fixmap);
1296   map_free(&solv->dupmap);
1297   map_free(&solv->dupinvolvedmap);
1298   map_free(&solv->droporphanedmap);
1299   map_free(&solv->cleandepsmap);
1300
1301   sat_free(solv->decisionmap);
1302   sat_free(solv->rules);
1303   sat_free(solv->watches);
1304   sat_free(solv->obsoletes);
1305   sat_free(solv->obsoletes_data);
1306   sat_free(solv->multiversionupdaters);
1307   sat_free(solv->choicerules_ref);
1308   sat_free(solv);
1309 }
1310
1311
1312 /*-------------------------------------------------------------------
1313  *
1314  * solver_run_sat
1315  *
1316  * all rules have been set up, now actually run the solver
1317  *
1318  */
1319
1320 void
1321 solver_run_sat(Solver *solv, int disablerules, int doweak)
1322 {
1323   Queue dq;             /* local decisionqueue */
1324   Queue dqs;            /* local decisionqueue for supplements */
1325   int systemlevel;
1326   int level, olevel;
1327   Rule *r;
1328   int i, j, n;
1329   Solvable *s;
1330   Pool *pool = solv->pool;
1331   Id p, *dp;
1332   int minimizationsteps;
1333   int installedpos = solv->installed ? solv->installed->start : 0;
1334
1335   IF_POOLDEBUG (SAT_DEBUG_RULE_CREATION)
1336     {
1337       POOL_DEBUG (SAT_DEBUG_RULE_CREATION, "number of rules: %d\n", solv->nrules);
1338       for (i = 1; i < solv->nrules; i++)
1339         solver_printruleclass(solv, SAT_DEBUG_RULE_CREATION, solv->rules + i);
1340     }
1341
1342   POOL_DEBUG(SAT_DEBUG_SOLVER, "initial decisions: %d\n", solv->decisionq.count);
1343
1344   IF_POOLDEBUG (SAT_DEBUG_SCHUBI)
1345     solver_printdecisions(solv);
1346
1347   /* start SAT algorithm */
1348   level = 1;
1349   systemlevel = level + 1;
1350   POOL_DEBUG(SAT_DEBUG_SOLVER, "solving...\n");
1351
1352   queue_init(&dq);
1353   queue_init(&dqs);
1354
1355   /*
1356    * here's the main loop:
1357    * 1) propagate new decisions (only needed once)
1358    * 2) fulfill jobs
1359    * 3) try to keep installed packages
1360    * 4) fulfill all unresolved rules
1361    * 5) install recommended packages
1362    * 6) minimalize solution if we had choices
1363    * if we encounter a problem, we rewind to a safe level and restart
1364    * with step 1
1365    */
1366
1367   minimizationsteps = 0;
1368   for (;;)
1369     {
1370       /*
1371        * initial propagation of the assertions
1372        */
1373       if (level == 1)
1374         {
1375           POOL_DEBUG(SAT_DEBUG_PROPAGATE, "propagating (propagate_index: %d;  size decisionq: %d)...\n", solv->propagate_index, solv->decisionq.count);
1376           if ((r = propagate(solv, level)) != 0)
1377             {
1378               if (analyze_unsolvable(solv, r, disablerules))
1379                 continue;
1380               queue_free(&dq);
1381               queue_free(&dqs);
1382               return;
1383             }
1384         }
1385
1386       /*
1387        * resolve jobs first
1388        */
1389      if (level < systemlevel)
1390         {
1391           POOL_DEBUG(SAT_DEBUG_SOLVER, "resolving job rules\n");
1392           for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
1393             {
1394               Id l;
1395               if (r->d < 0)             /* ignore disabled rules */
1396                 continue;
1397               queue_empty(&dq);
1398               FOR_RULELITERALS(l, dp, r)
1399                 {
1400                   if (l < 0)
1401                     {
1402                       if (solv->decisionmap[-l] <= 0)
1403                         break;
1404                     }
1405                   else
1406                     {
1407                       if (solv->decisionmap[l] > 0)
1408                         break;
1409                       if (solv->decisionmap[l] == 0)
1410                         queue_push(&dq, l);
1411                     }
1412                 }
1413               if (l || !dq.count)
1414                 continue;
1415               /* prune to installed if not updating */
1416               if (!solv->updatesystem && solv->installed && dq.count > 1)
1417                 {
1418                   int j, k;
1419                   for (j = k = 0; j < dq.count; j++)
1420                     {
1421                       Solvable *s = pool->solvables + dq.elements[j];
1422                       if (s->repo == solv->installed)
1423                         dq.elements[k++] = dq.elements[j];
1424                     }
1425                   if (k)
1426                     dq.count = k;
1427                 }
1428               olevel = level;
1429               level = selectandinstall(solv, level, &dq, disablerules, i);
1430               if (level == 0)
1431                 {
1432                   queue_free(&dq);
1433                   queue_free(&dqs);
1434                   return;
1435                 }
1436               if (level <= olevel)
1437                 break;
1438             }
1439           systemlevel = level + 1;
1440           if (i < solv->jobrules_end)
1441             continue;
1442         }
1443
1444
1445       /*
1446        * installed packages
1447        */
1448       if (level < systemlevel && solv->installed && solv->installed->nsolvables && !solv->installed->disabled)
1449         {
1450           Repo *installed = solv->installed;
1451           int pass;
1452
1453           POOL_DEBUG(SAT_DEBUG_SOLVER, "resolving installed packages\n");
1454           /* we use two passes if we need to update packages
1455            * to create a better user experience */
1456           for (pass = solv->updatemap.size ? 0 : 1; pass < 2; pass++)
1457             {
1458               int passlevel = level;
1459               /* start with installedpos, the position that gave us problems last time */
1460               for (i = installedpos, n = installed->start; n < installed->end; i++, n++)
1461                 {
1462                   Rule *rr;
1463                   Id d;
1464
1465                   if (i == installed->end)
1466                     i = installed->start;
1467                   s = pool->solvables + i;
1468                   if (s->repo != installed)
1469                     continue;
1470
1471                   if (solv->decisionmap[i] > 0)
1472                     continue;
1473                   if (!pass && solv->updatemap.size && !MAPTST(&solv->updatemap, i - installed->start))
1474                     continue;           /* updates first */
1475                   r = solv->rules + solv->updaterules + (i - installed->start);
1476                   rr = r;
1477                   if (!rr->p || rr->d < 0)      /* disabled -> look at feature rule */
1478                     rr -= solv->installed->end - solv->installed->start;
1479                   if (!rr->p)           /* identical to update rule? */
1480                     rr = r;
1481                   if (!rr->p)
1482                     continue;           /* orpaned package */
1483
1484                   /* XXX: noupdate check is probably no longer needed, as all jobs should
1485                    * already be satisfied */
1486                   /* Actually we currently still need it because of erase jobs */
1487                   /* if noupdate is set we do not look at update candidates */
1488                   queue_empty(&dq);
1489                   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))
1490                     {
1491                       if (solv->noobsoletes.size && solv->multiversionupdaters
1492                              && (d = solv->multiversionupdaters[i - installed->start]) != 0)
1493                         {
1494                           /* special multiversion handling, make sure best version is chosen */
1495                           queue_push(&dq, i);
1496                           while ((p = pool->whatprovidesdata[d++]) != 0)
1497                             if (solv->decisionmap[p] >= 0)
1498                               queue_push(&dq, p);
1499                           policy_filter_unwanted(solv, &dq, POLICY_MODE_CHOOSE);
1500                           p = dq.elements[0];
1501                           if (p != i && solv->decisionmap[p] == 0)
1502                             {
1503                               rr = solv->rules + solv->featurerules + (i - solv->installed->start);
1504                               if (!rr->p)               /* update rule == feature rule? */
1505                                 rr = rr - solv->featurerules + solv->updaterules;
1506                               dq.count = 1;
1507                             }
1508                           else
1509                             dq.count = 0;
1510                         }
1511                       else
1512                         {
1513                           /* update to best package */
1514                           FOR_RULELITERALS(p, dp, rr)
1515                             {
1516                               if (solv->decisionmap[p] > 0)
1517                                 {
1518                                   dq.count = 0;         /* already fulfilled */
1519                                   break;
1520                                 }
1521                               if (!solv->decisionmap[p])
1522                                 queue_push(&dq, p);
1523                             }
1524                         }
1525                     }
1526                   /* install best version */
1527                   if (dq.count)
1528                     {
1529                       olevel = level;
1530                       level = selectandinstall(solv, level, &dq, disablerules, rr - solv->rules);
1531                       if (level == 0)
1532                         {
1533                           queue_free(&dq);
1534                           queue_free(&dqs);
1535                           return;
1536                         }
1537                       if (level <= olevel)
1538                         {
1539                           if (level == 1 || level < passlevel)
1540                             break;      /* trouble */
1541                           if (level < olevel)
1542                             n = installed->start;       /* redo all */
1543                           i--;
1544                           n--;
1545                           continue;
1546                         }
1547                     }
1548                   /* if still undecided keep package */
1549                   if (solv->decisionmap[i] == 0)
1550                     {
1551                       olevel = level;
1552                       if (solv->cleandepsmap.size && MAPTST(&solv->cleandepsmap, i - installed->start))
1553                         {
1554                           POOL_DEBUG(SAT_DEBUG_POLICY, "cleandeps erasing %s\n", solvid2str(pool, i));
1555                           level = setpropagatelearn(solv, level, -i, disablerules, 0);
1556                         }
1557                       else
1558                         {
1559                           POOL_DEBUG(SAT_DEBUG_POLICY, "keeping %s\n", solvid2str(pool, i));
1560                           level = setpropagatelearn(solv, level, i, disablerules, r - solv->rules);
1561                         }
1562                       if (level == 0)
1563                         {
1564                           queue_free(&dq);
1565                           queue_free(&dqs);
1566                           return;
1567                         }
1568                       if (level <= olevel)
1569                         {
1570                           if (level == 1 || level < passlevel)
1571                             break;      /* trouble */
1572                           if (level < olevel)
1573                             n = installed->start;       /* redo all */
1574                           i--;
1575                           n--;
1576                           continue; /* retry with learnt rule */
1577                         }
1578                     }
1579                 }
1580               if (n < installed->end)
1581                 {
1582                   installedpos = i;     /* retry problem solvable next time */
1583                   break;                /* ran into trouble */
1584                 }
1585               installedpos = installed->start;  /* reset installedpos */
1586             }
1587           systemlevel = level + 1;
1588           if (pass < 2)
1589             continue;           /* had trouble, retry */
1590         }
1591
1592       if (level < systemlevel)
1593         systemlevel = level;
1594
1595       /*
1596        * decide
1597        */
1598       POOL_DEBUG(SAT_DEBUG_POLICY, "deciding unresolved rules\n");
1599       for (i = 1, n = 1; n < solv->nrules; i++, n++)
1600         {
1601           if (i == solv->nrules)
1602             i = 1;
1603           r = solv->rules + i;
1604           if (r->d < 0)         /* ignore disabled rules */
1605             continue;
1606           queue_empty(&dq);
1607           if (r->d == 0)
1608             {
1609               /* binary or unary rule */
1610               /* need two positive undecided literals */
1611               if (r->p < 0 || r->w2 <= 0)
1612                 continue;
1613               if (solv->decisionmap[r->p] || solv->decisionmap[r->w2])
1614                 continue;
1615               queue_push(&dq, r->p);
1616               queue_push(&dq, r->w2);
1617             }
1618           else
1619             {
1620               /* make sure that
1621                * all negative literals are installed
1622                * no positive literal is installed
1623                * i.e. the rule is not fulfilled and we
1624                * just need to decide on the positive literals
1625                */
1626               if (r->p < 0)
1627                 {
1628                   if (solv->decisionmap[-r->p] <= 0)
1629                     continue;
1630                 }
1631               else
1632                 {
1633                   if (solv->decisionmap[r->p] > 0)
1634                     continue;
1635                   if (solv->decisionmap[r->p] == 0)
1636                     queue_push(&dq, r->p);
1637                 }
1638               dp = pool->whatprovidesdata + r->d;
1639               while ((p = *dp++) != 0)
1640                 {
1641                   if (p < 0)
1642                     {
1643                       if (solv->decisionmap[-p] <= 0)
1644                         break;
1645                     }
1646                   else
1647                     {
1648                       if (solv->decisionmap[p] > 0)
1649                         break;
1650                       if (solv->decisionmap[p] == 0)
1651                         queue_push(&dq, p);
1652                     }
1653                 }
1654               if (p)
1655                 continue;
1656             }
1657           IF_POOLDEBUG (SAT_DEBUG_PROPAGATE)
1658             {
1659               POOL_DEBUG(SAT_DEBUG_PROPAGATE, "unfulfilled ");
1660               solver_printruleclass(solv, SAT_DEBUG_PROPAGATE, r);
1661             }
1662           /* dq.count < 2 cannot happen as this means that
1663            * the rule is unit */
1664           assert(dq.count > 1);
1665
1666           olevel = level;
1667           level = selectandinstall(solv, level, &dq, disablerules, r - solv->rules);
1668           if (level == 0)
1669             {
1670               queue_free(&dq);
1671               queue_free(&dqs);
1672               return;
1673             }
1674           if (level < systemlevel || level == 1)
1675             break;              /* trouble */
1676           /* something changed, so look at all rules again */
1677           n = 0;
1678         }
1679
1680       if (n != solv->nrules)    /* ran into trouble, restart */
1681         continue;
1682
1683       /* at this point we have a consistent system. now do the extras... */
1684
1685       if (doweak)
1686         {
1687           int qcount;
1688
1689           POOL_DEBUG(SAT_DEBUG_POLICY, "installing recommended packages\n");
1690           queue_empty(&dq);     /* recommended packages */
1691           queue_empty(&dqs);    /* supplemented packages */
1692           for (i = 1; i < pool->nsolvables; i++)
1693             {
1694               if (solv->decisionmap[i] < 0)
1695                 continue;
1696               if (solv->decisionmap[i] > 0)
1697                 {
1698                   /* installed, check for recommends */
1699                   Id *recp, rec, pp, p;
1700                   s = pool->solvables + i;
1701                   if (solv->ignorealreadyrecommended && s->repo == solv->installed)
1702                     continue;
1703                   /* XXX need to special case AND ? */
1704                   if (s->recommends)
1705                     {
1706                       recp = s->repo->idarraydata + s->recommends;
1707                       while ((rec = *recp++) != 0)
1708                         {
1709                           qcount = dq.count;
1710                           FOR_PROVIDES(p, pp, rec)
1711                             {
1712                               if (solv->decisionmap[p] > 0)
1713                                 {
1714                                   dq.count = qcount;
1715                                   break;
1716                                 }
1717                               else if (solv->decisionmap[p] == 0)
1718                                 {
1719                                   queue_pushunique(&dq, p);
1720                                 }
1721                             }
1722                         }
1723                     }
1724                 }
1725               else
1726                 {
1727                   s = pool->solvables + i;
1728                   if (!s->supplements)
1729                     continue;
1730                   if (!pool_installable(pool, s))
1731                     continue;
1732                   if (!solver_is_supplementing(solv, s))
1733                     continue;
1734                   queue_push(&dqs, i);
1735                 }
1736             }
1737
1738           /* filter out all packages obsoleted by installed packages */
1739           /* this is no longer needed if we have reverse obsoletes */
1740           if ((dqs.count || dq.count) && solv->installed)
1741             {
1742               Map obsmap;
1743               Id obs, *obsp, po, ppo;
1744
1745               map_init(&obsmap, pool->nsolvables);
1746               for (p = solv->installed->start; p < solv->installed->end; p++)
1747                 {
1748                   s = pool->solvables + p;
1749                   if (s->repo != solv->installed || !s->obsoletes)
1750                     continue;
1751                   if (solv->decisionmap[p] <= 0)
1752                     continue;
1753                   if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
1754                     continue;
1755                   obsp = s->repo->idarraydata + s->obsoletes;
1756                   /* foreach obsoletes */
1757                   while ((obs = *obsp++) != 0)
1758                     FOR_PROVIDES(po, ppo, obs)
1759                       MAPSET(&obsmap, po);
1760                 }
1761               for (i = j = 0; i < dqs.count; i++)
1762                 if (!MAPTST(&obsmap, dqs.elements[i]))
1763                   dqs.elements[j++] = dqs.elements[i];
1764               dqs.count = j;
1765               for (i = j = 0; i < dq.count; i++)
1766                 if (!MAPTST(&obsmap, dq.elements[i]))
1767                   dq.elements[j++] = dq.elements[i];
1768               dq.count = j;
1769               map_free(&obsmap);
1770             }
1771
1772           /* filter out all already supplemented packages if requested */
1773           if (solv->ignorealreadyrecommended && dqs.count)
1774             {
1775               /* turn off all new packages */
1776               for (i = 0; i < solv->decisionq.count; i++)
1777                 {
1778                   p = solv->decisionq.elements[i];
1779                   if (p < 0)
1780                     continue;
1781                   s = pool->solvables + p;
1782                   if (s->repo && s->repo != solv->installed)
1783                     solv->decisionmap[p] = -solv->decisionmap[p];
1784                 }
1785               /* filter out old supplements */
1786               for (i = j = 0; i < dqs.count; i++)
1787                 {
1788                   p = dqs.elements[i];
1789                   s = pool->solvables + p;
1790                   if (!s->supplements)
1791                     continue;
1792                   if (!solver_is_supplementing(solv, s))
1793                     dqs.elements[j++] = p;
1794                 }
1795               dqs.count = j;
1796               /* undo turning off */
1797               for (i = 0; i < solv->decisionq.count; i++)
1798                 {
1799                   p = solv->decisionq.elements[i];
1800                   if (p < 0)
1801                     continue;
1802                   s = pool->solvables + p;
1803                   if (s->repo && s->repo != solv->installed)
1804                     solv->decisionmap[p] = -solv->decisionmap[p];
1805                 }
1806             }
1807
1808           /* multiversion doesn't mix well with supplements.
1809            * filter supplemented packages where we already decided
1810            * to install a different version (see bnc#501088) */
1811           if (dqs.count && solv->noobsoletes.size)
1812             {
1813               for (i = j = 0; i < dqs.count; i++)
1814                 {
1815                   p = dqs.elements[i];
1816                   if (MAPTST(&solv->noobsoletes, p))
1817                     {
1818                       Id p2, pp2;
1819                       s = pool->solvables + p;
1820                       FOR_PROVIDES(p2, pp2, s->name)
1821                         if (solv->decisionmap[p2] > 0 && pool->solvables[p2].name == s->name)
1822                           break;
1823                       if (p2)
1824                         continue;       /* ignore this package */
1825                     }
1826                   dqs.elements[j++] = p;
1827                 }
1828               dqs.count = j;
1829             }
1830
1831           /* make dq contain both recommended and supplemented pkgs */
1832           if (dqs.count)
1833             {
1834               for (i = 0; i < dqs.count; i++)
1835                 queue_pushunique(&dq, dqs.elements[i]);
1836             }
1837
1838           if (dq.count)
1839             {
1840               Map dqmap;
1841               int decisioncount = solv->decisionq.count;
1842
1843               if (dq.count == 1)
1844                 {
1845                   /* simple case, just one package. no need to choose  */
1846                   p = dq.elements[0];
1847                   if (dqs.count)
1848                     POOL_DEBUG(SAT_DEBUG_POLICY, "installing supplemented %s\n", solvid2str(pool, p));
1849                   else
1850                     POOL_DEBUG(SAT_DEBUG_POLICY, "installing recommended %s\n", solvid2str(pool, p));
1851                   queue_push(&solv->recommendations, p);
1852                   level = setpropagatelearn(solv, level, p, 0, 0);
1853                   continue;     /* back to main loop */
1854                 }
1855
1856               /* filter packages, this gives us the best versions */
1857               policy_filter_unwanted(solv, &dq, POLICY_MODE_RECOMMEND);
1858
1859               /* create map of result */
1860               map_init(&dqmap, pool->nsolvables);
1861               for (i = 0; i < dq.count; i++)
1862                 MAPSET(&dqmap, dq.elements[i]);
1863
1864               /* install all supplemented packages */
1865               for (i = 0; i < dqs.count; i++)
1866                 {
1867                   p = dqs.elements[i];
1868                   if (solv->decisionmap[p] || !MAPTST(&dqmap, p))
1869                     continue;
1870                   POOL_DEBUG(SAT_DEBUG_POLICY, "installing supplemented %s\n", solvid2str(pool, p));
1871                   queue_push(&solv->recommendations, p);
1872                   olevel = level;
1873                   level = setpropagatelearn(solv, level, p, 0, 0);
1874                   if (level <= olevel)
1875                     break;
1876                 }
1877               if (i < dqs.count || solv->decisionq.count < decisioncount)
1878                 {
1879                   map_free(&dqmap);
1880                   continue;
1881                 }
1882
1883               /* install all recommended packages */
1884               /* more work as we want to created branches if multiple
1885                * choices are valid */
1886               for (i = 0; i < decisioncount; i++)
1887                 {
1888                   Id rec, *recp, pp;
1889                   p = solv->decisionq.elements[i];
1890                   if (p < 0)
1891                     continue;
1892                   s = pool->solvables + p;
1893                   if (!s->repo || (solv->ignorealreadyrecommended && s->repo == solv->installed))
1894                     continue;
1895                   if (!s->recommends)
1896                     continue;
1897                   recp = s->repo->idarraydata + s->recommends;
1898                   while ((rec = *recp++) != 0)
1899                     {
1900                       queue_empty(&dq);
1901                       FOR_PROVIDES(p, pp, rec)
1902                         {
1903                           if (solv->decisionmap[p] > 0)
1904                             {
1905                               dq.count = 0;
1906                               break;
1907                             }
1908                           else if (solv->decisionmap[p] == 0 && MAPTST(&dqmap, p))
1909                             queue_pushunique(&dq, p);
1910                         }
1911                       if (!dq.count)
1912                         continue;
1913                       if (dq.count > 1)
1914                         {
1915                           /* multiple candidates, open a branch */
1916                           for (i = 1; i < dq.count; i++)
1917                             queue_push(&solv->branches, dq.elements[i]);
1918                           queue_push(&solv->branches, -level);
1919                         }
1920                       p = dq.elements[0];
1921                       POOL_DEBUG(SAT_DEBUG_POLICY, "installing recommended %s\n", solvid2str(pool, p));
1922                       queue_push(&solv->recommendations, p);
1923                       olevel = level;
1924                       level = setpropagatelearn(solv, level, p, 0, 0);
1925                       if (level <= olevel || solv->decisionq.count < decisioncount)
1926                         break;  /* we had to revert some decisions */
1927                     }
1928                   if (rec)
1929                     break;      /* had a problem above, quit loop */
1930                 }
1931               map_free(&dqmap);
1932
1933               continue;         /* back to main loop so that all deps are checked */
1934             }
1935         }
1936
1937      if (solv->distupgrade && solv->installed)
1938         {
1939           int installedone = 0;
1940
1941           /* let's see if we can install some unsupported package */
1942           POOL_DEBUG(SAT_DEBUG_SOLVER, "deciding orphaned packages\n");
1943           for (i = 0; i < solv->orphaned.count; i++)
1944             {
1945               p = solv->orphaned.elements[i];
1946               if (solv->decisionmap[p])
1947                 continue;       /* already decided */
1948               olevel = level;
1949               if (solv->distupgrade_removeunsupported)
1950                 continue;
1951               if (solv->droporphanedmap.size && MAPTST(&solv->droporphanedmap, p - solv->installed->start))
1952                 continue;
1953               POOL_DEBUG(SAT_DEBUG_SOLVER, "keeping orphaned %s\n", solvid2str(pool, p));
1954               level = setpropagatelearn(solv, level, p, 0, 0);
1955               installedone = 1;
1956               if (level < olevel)
1957                 break;
1958             }
1959           if (installedone || i < solv->orphaned.count)
1960             continue;           /* back to main loop */
1961           for (i = 0; i < solv->orphaned.count; i++)
1962             {
1963               p = solv->orphaned.elements[i];
1964               if (solv->decisionmap[p])
1965                 continue;       /* already decided */
1966               POOL_DEBUG(SAT_DEBUG_SOLVER, "removing orphaned %s\n", solvid2str(pool, p));
1967               olevel = level;
1968               level = setpropagatelearn(solv, level, -p, 0, 0);
1969               if (level < olevel)
1970                 break;
1971             }
1972           if (i < solv->orphaned.count)
1973             continue;           /* back to main loop */
1974         }
1975
1976      if (solv->solution_callback)
1977         {
1978           solv->solution_callback(solv, solv->solution_callback_data);
1979           if (solv->branches.count)
1980             {
1981               int i = solv->branches.count - 1;
1982               int l = -solv->branches.elements[i];
1983               Id why;
1984
1985               for (; i > 0; i--)
1986                 if (solv->branches.elements[i - 1] < 0)
1987                   break;
1988               p = solv->branches.elements[i];
1989               POOL_DEBUG(SAT_DEBUG_SOLVER, "branching with %s\n", solvid2str(pool, p));
1990               queue_empty(&dq);
1991               for (j = i + 1; j < solv->branches.count; j++)
1992                 queue_push(&dq, solv->branches.elements[j]);
1993               solv->branches.count = i;
1994               level = l;
1995               revert(solv, level);
1996               if (dq.count > 1)
1997                 for (j = 0; j < dq.count; j++)
1998                   queue_push(&solv->branches, dq.elements[j]);
1999               olevel = level;
2000               why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2001               assert(why >= 0);
2002               level = setpropagatelearn(solv, level, p, disablerules, why);
2003               if (level == 0)
2004                 {
2005                   queue_free(&dq);
2006                   queue_free(&dqs);
2007                   return;
2008                 }
2009               continue;
2010             }
2011           /* all branches done, we're finally finished */
2012           break;
2013         }
2014
2015       /* minimization step */
2016      if (solv->branches.count)
2017         {
2018           int l = 0, lasti = -1, lastl = -1;
2019           Id why;
2020
2021           p = 0;
2022           for (i = solv->branches.count - 1; i >= 0; i--)
2023             {
2024               p = solv->branches.elements[i];
2025               if (p < 0)
2026                 l = -p;
2027               else if (p > 0 && solv->decisionmap[p] > l + 1)
2028                 {
2029                   lasti = i;
2030                   lastl = l;
2031                 }
2032             }
2033           if (lasti >= 0)
2034             {
2035               /* kill old solvable so that we do not loop */
2036               p = solv->branches.elements[lasti];
2037               solv->branches.elements[lasti] = 0;
2038               POOL_DEBUG(SAT_DEBUG_SOLVER, "minimizing %d -> %d with %s\n", solv->decisionmap[p], lastl, solvid2str(pool, p));
2039               minimizationsteps++;
2040
2041               level = lastl;
2042               revert(solv, level);
2043               why = -solv->decisionq_why.elements[solv->decisionq_why.count];
2044               assert(why >= 0);
2045               olevel = level;
2046               level = setpropagatelearn(solv, level, p, disablerules, why);
2047               if (level == 0)
2048                 {
2049                   queue_free(&dq);
2050                   queue_free(&dqs);
2051                   return;
2052                 }
2053               continue;         /* back to main loop */
2054             }
2055         }
2056       /* no minimization found, we're finally finished! */
2057       break;
2058     }
2059
2060   POOL_DEBUG(SAT_DEBUG_STATS, "solver statistics: %d learned rules, %d unsolvable, %d minimization steps\n", solv->stats_learned, solv->stats_unsolvable, minimizationsteps);
2061
2062   POOL_DEBUG(SAT_DEBUG_STATS, "done solving.\n\n");
2063   queue_free(&dq);
2064   queue_free(&dqs);
2065 #if 0
2066   solver_printdecisionq(solv, SAT_DEBUG_RESULT);
2067 #endif
2068 }
2069
2070
2071 /*-------------------------------------------------------------------
2072  *
2073  * remove disabled conflicts
2074  *
2075  * purpose: update the decisionmap after some rules were disabled.
2076  * this is used to calculate the suggested/recommended package list.
2077  * Also returns a "removed" list to undo the discisionmap changes.
2078  */
2079
2080 static void
2081 removedisabledconflicts(Solver *solv, Queue *removed)
2082 {
2083   Pool *pool = solv->pool;
2084   int i, n;
2085   Id p, why, *dp;
2086   Id new;
2087   Rule *r;
2088   Id *decisionmap = solv->decisionmap;
2089
2090   POOL_DEBUG(SAT_DEBUG_SCHUBI, "removedisabledconflicts\n");
2091   queue_empty(removed);
2092   for (i = 0; i < solv->decisionq.count; i++)
2093     {
2094       p = solv->decisionq.elements[i];
2095       if (p > 0)
2096         continue;       /* conflicts only, please */
2097       why = solv->decisionq_why.elements[i];
2098       if (why == 0)
2099         {
2100           /* no rule involved, must be a orphan package drop */
2101           continue;
2102         }
2103       /* we never do conflicts on free decisions, so there
2104        * must have been an unit rule */
2105       assert(why > 0);
2106       r = solv->rules + why;
2107       if (r->d < 0 && decisionmap[-p])
2108         {
2109           /* rule is now disabled, remove from decisionmap */
2110           POOL_DEBUG(SAT_DEBUG_SCHUBI, "removing conflict for package %s[%d]\n", solvid2str(pool, -p), -p);
2111           queue_push(removed, -p);
2112           queue_push(removed, decisionmap[-p]);
2113           decisionmap[-p] = 0;
2114         }
2115     }
2116   if (!removed->count)
2117     return;
2118   /* we removed some confliced packages. some of them might still
2119    * be in conflict, so search for unit rules and re-conflict */
2120   new = 0;
2121   for (i = n = 1, r = solv->rules + i; n < solv->nrules; i++, r++, n++)
2122     {
2123       if (i == solv->nrules)
2124         {
2125           i = 1;
2126           r = solv->rules + i;
2127         }
2128       if (r->d < 0)
2129         continue;
2130       if (!r->w2)
2131         {
2132           if (r->p < 0 && !decisionmap[-r->p])
2133             new = r->p;
2134         }
2135       else if (!r->d)
2136         {
2137           /* binary rule */
2138           if (r->p < 0 && decisionmap[-r->p] == 0 && DECISIONMAP_FALSE(r->w2))
2139             new = r->p;
2140           else if (r->w2 < 0 && decisionmap[-r->w2] == 0 && DECISIONMAP_FALSE(r->p))
2141             new = r->w2;
2142         }
2143       else
2144         {
2145           if (r->p < 0 && decisionmap[-r->p] == 0)
2146             new = r->p;
2147           if (new || DECISIONMAP_FALSE(r->p))
2148             {
2149               dp = pool->whatprovidesdata + r->d;
2150               while ((p = *dp++) != 0)
2151                 {
2152                   if (new && p == new)
2153                     continue;
2154                   if (p < 0 && decisionmap[-p] == 0)
2155                     {
2156                       if (new)
2157                         {
2158                           new = 0;
2159                           break;
2160                         }
2161                       new = p;
2162                     }
2163                   else if (!DECISIONMAP_FALSE(p))
2164                     {
2165                       new = 0;
2166                       break;
2167                     }
2168                 }
2169             }
2170         }
2171       if (new)
2172         {
2173           POOL_DEBUG(SAT_DEBUG_SCHUBI, "re-conflicting package %s[%d]\n", solvid2str(pool, -new), -new);
2174           decisionmap[-new] = -1;
2175           new = 0;
2176           n = 0;        /* redo all rules */
2177         }
2178     }
2179 }
2180
2181 static inline void
2182 undo_removedisabledconflicts(Solver *solv, Queue *removed)
2183 {
2184   int i;
2185   for (i = 0; i < removed->count; i += 2)
2186     solv->decisionmap[removed->elements[i]] = removed->elements[i + 1];
2187 }
2188
2189
2190 /*-------------------------------------------------------------------
2191  *
2192  * weaken solvable dependencies
2193  */
2194
2195 static void
2196 weaken_solvable_deps(Solver *solv, Id p)
2197 {
2198   int i;
2199   Rule *r;
2200
2201   for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++)
2202     {
2203       if (r->p != -p)
2204         continue;
2205       if ((r->d == 0 || r->d == -1) && r->w2 < 0)
2206         continue;       /* conflict */
2207       queue_push(&solv->weakruleq, i);
2208     }
2209 }
2210
2211
2212 /********************************************************************/
2213 /* main() */
2214
2215
2216 static void
2217 findrecommendedsuggested(Solver *solv)
2218 {
2219   Pool *pool = solv->pool;
2220   Queue redoq, disabledq;
2221   int goterase, i;
2222   Solvable *s;
2223   Rule *r;
2224   Map obsmap;
2225
2226   map_init(&obsmap, pool->nsolvables);
2227   if (solv->installed)
2228     {
2229       Id obs, *obsp, p, po, ppo;
2230       for (p = solv->installed->start; p < solv->installed->end; p++)
2231         {
2232           s = pool->solvables + p;
2233           if (s->repo != solv->installed || !s->obsoletes)
2234             continue;
2235           if (solv->decisionmap[p] <= 0)
2236             continue;
2237           if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
2238             continue;
2239           obsp = s->repo->idarraydata + s->obsoletes;
2240           /* foreach obsoletes */
2241           while ((obs = *obsp++) != 0)
2242             FOR_PROVIDES(po, ppo, obs)
2243               MAPSET(&obsmap, po);
2244         }
2245     }
2246
2247   queue_init(&redoq);
2248   queue_init(&disabledq);
2249   goterase = 0;
2250   /* disable all erase jobs (including weak "keep uninstalled" rules) */
2251   for (i = solv->jobrules, r = solv->rules + i; i < solv->jobrules_end; i++, r++)
2252     {
2253       if (r->d < 0)     /* disabled ? */
2254         continue;
2255       if (r->p >= 0)    /* install job? */
2256         continue;
2257       queue_push(&disabledq, i);
2258       solver_disablerule(solv, r);
2259       goterase++;
2260     }
2261
2262   if (goterase)
2263     {
2264       enabledisablelearntrules(solv);
2265       removedisabledconflicts(solv, &redoq);
2266     }
2267
2268   /*
2269    * find recommended packages
2270    */
2271
2272   /* if redoq.count == 0 we already found all recommended in the
2273    * solver run */
2274   if (redoq.count || solv->dontinstallrecommended || !solv->dontshowinstalledrecommended || solv->ignorealreadyrecommended)
2275     {
2276       Id rec, *recp, p, pp;
2277
2278       /* create map of all recommened packages */
2279       solv->recommends_index = -1;
2280       MAPZERO(&solv->recommendsmap);
2281       for (i = 0; i < solv->decisionq.count; i++)
2282         {
2283           p = solv->decisionq.elements[i];
2284           if (p < 0)
2285             continue;
2286           s = pool->solvables + p;
2287           if (s->recommends)
2288             {
2289               recp = s->repo->idarraydata + s->recommends;
2290               while ((rec = *recp++) != 0)
2291                 {
2292                   FOR_PROVIDES(p, pp, rec)
2293                     if (solv->decisionmap[p] > 0)
2294                       break;
2295                   if (p)
2296                     {
2297                       if (!solv->dontshowinstalledrecommended)
2298                         {
2299                           FOR_PROVIDES(p, pp, rec)
2300                             if (solv->decisionmap[p] > 0)
2301                               MAPSET(&solv->recommendsmap, p);
2302                         }
2303                       continue; /* p != 0: already fulfilled */
2304                     }
2305                   FOR_PROVIDES(p, pp, rec)
2306                     MAPSET(&solv->recommendsmap, p);
2307                 }
2308             }
2309         }
2310       for (i = 1; i < pool->nsolvables; i++)
2311         {
2312           if (solv->decisionmap[i] < 0)
2313             continue;
2314           if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
2315             continue;
2316           if (MAPTST(&obsmap, i))
2317             continue;
2318           s = pool->solvables + i;
2319           if (!MAPTST(&solv->recommendsmap, i))
2320             {
2321               if (!s->supplements)
2322                 continue;
2323               if (!pool_installable(pool, s))
2324                 continue;
2325               if (!solver_is_supplementing(solv, s))
2326                 continue;
2327             }
2328           if (solv->dontinstallrecommended)
2329             queue_push(&solv->recommendations, i);
2330           else
2331             queue_pushunique(&solv->recommendations, i);
2332         }
2333       /* we use MODE_SUGGEST here so that repo prio is ignored */
2334       policy_filter_unwanted(solv, &solv->recommendations, POLICY_MODE_SUGGEST);
2335     }
2336
2337   /*
2338    * find suggested packages
2339    */
2340
2341   if (1)
2342     {
2343       Id sug, *sugp, p, pp;
2344
2345       /* create map of all suggests that are still open */
2346       solv->recommends_index = -1;
2347       MAPZERO(&solv->suggestsmap);
2348       for (i = 0; i < solv->decisionq.count; i++)
2349         {
2350           p = solv->decisionq.elements[i];
2351           if (p < 0)
2352             continue;
2353           s = pool->solvables + p;
2354           if (s->suggests)
2355             {
2356               sugp = s->repo->idarraydata + s->suggests;
2357               while ((sug = *sugp++) != 0)
2358                 {
2359                   FOR_PROVIDES(p, pp, sug)
2360                     if (solv->decisionmap[p] > 0)
2361                       break;
2362                   if (p)
2363                     {
2364                       if (!solv->dontshowinstalledrecommended)
2365                         {
2366                           FOR_PROVIDES(p, pp, sug)
2367                             if (solv->decisionmap[p] > 0)
2368                               MAPSET(&solv->suggestsmap, p);
2369                         }
2370                       continue; /* already fulfilled */
2371                     }
2372                   FOR_PROVIDES(p, pp, sug)
2373                     MAPSET(&solv->suggestsmap, p);
2374                 }
2375             }
2376         }
2377       for (i = 1; i < pool->nsolvables; i++)
2378         {
2379           if (solv->decisionmap[i] < 0)
2380             continue;
2381           if (solv->decisionmap[i] > 0 && solv->dontshowinstalledrecommended)
2382             continue;
2383           if (MAPTST(&obsmap, i))
2384             continue;
2385           s = pool->solvables + i;
2386           if (!MAPTST(&solv->suggestsmap, i))
2387             {
2388               if (!s->enhances)
2389                 continue;
2390               if (!pool_installable(pool, s))
2391                 continue;
2392               if (!solver_is_enhancing(solv, s))
2393                 continue;
2394             }
2395           queue_push(&solv->suggestions, i);
2396         }
2397       policy_filter_unwanted(solv, &solv->suggestions, POLICY_MODE_SUGGEST);
2398     }
2399
2400   /* undo removedisabledconflicts */
2401   if (redoq.count)
2402     undo_removedisabledconflicts(solv, &redoq);
2403   queue_free(&redoq);
2404
2405   /* undo job rule disabling */
2406   for (i = 0; i < disabledq.count; i++)
2407     solver_enablerule(solv, solv->rules + disabledq.elements[i]);
2408   queue_free(&disabledq);
2409   map_free(&obsmap);
2410 }
2411
2412 void
2413 solver_calculate_noobsmap(Pool *pool, Queue *job, Map *noobsmap)
2414 {
2415   int i;
2416   Id how, what, select;
2417   Id p, pp;
2418   for (i = 0; i < job->count; i += 2)
2419     {
2420       how = job->elements[i];
2421       if ((how & SOLVER_JOBMASK) != SOLVER_NOOBSOLETES)
2422         continue;
2423       what = job->elements[i + 1];
2424       select = how & SOLVER_SELECTMASK;
2425       if (!noobsmap->size)
2426         map_grow(noobsmap, pool->nsolvables);
2427       FOR_JOB_SELECT(p, pp, select, what)
2428         MAPSET(noobsmap, p);
2429     }
2430 }
2431
2432 /*
2433  * add a rule created by a job, record job number and weak flag
2434  */
2435 static inline void
2436 solver_addjobrule(Solver *solv, Id p, Id d, Id job, int weak)
2437 {
2438   solver_addrule(solv, p, d);
2439   queue_push(&solv->ruletojob, job);
2440   if (weak)
2441     queue_push(&solv->weakruleq, solv->nrules - 1);
2442 }
2443
2444 /*
2445  *
2446  * solve job queue
2447  *
2448  */
2449
2450 void
2451 solver_solve(Solver *solv, Queue *job)
2452 {
2453   Pool *pool = solv->pool;
2454   Repo *installed = solv->installed;
2455   int i;
2456   int oldnrules;
2457   Map addedmap;                /* '1' == have rpm-rules for solvable */
2458   Map installcandidatemap;
2459   Id how, what, select, name, weak, p, pp, d;
2460   Queue q;
2461   Solvable *s;
2462   Rule *r;
2463   int now, solve_start;
2464   int hasdupjob = 0;
2465
2466   solve_start = sat_timems(0);
2467
2468   /* log solver options */
2469   POOL_DEBUG(SAT_DEBUG_STATS, "solver started\n");
2470   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);
2471   POOL_DEBUG(SAT_DEBUG_STATS, "distupgrade=%d distupgrade_removeunsupported=%d\n", solv->distupgrade, solv->distupgrade_removeunsupported);
2472   POOL_DEBUG(SAT_DEBUG_STATS, "allowuninstall=%d, allowdowngrade=%d, allowarchchange=%d, allowvendorchange=%d\n", solv->allowuninstall, solv->allowdowngrade, solv->allowarchchange, solv->allowvendorchange);
2473   POOL_DEBUG(SAT_DEBUG_STATS, "promoteepoch=%d, novirtualconflicts=%d, allowselfconflicts=%d\n", pool->promoteepoch, pool->novirtualconflicts, pool->allowselfconflicts);
2474   POOL_DEBUG(SAT_DEBUG_STATS, "obsoleteusesprovides=%d, implicitobsoleteusesprovides=%d, obsoleteusescolors=%d\n", pool->obsoleteusesprovides, pool->implicitobsoleteusesprovides, pool->obsoleteusescolors);
2475   POOL_DEBUG(SAT_DEBUG_STATS, "dontinstallrecommended=%d, ignorealreadyrecommended=%d, dontshowinstalledrecommended=%d\n", solv->dontinstallrecommended, solv->ignorealreadyrecommended, solv->dontshowinstalledrecommended);
2476
2477   /* create whatprovides if not already there */
2478   if (!pool->whatprovides)
2479     pool_createwhatprovides(pool);
2480
2481   /* create obsolete index */
2482   policy_create_obsolete_index(solv);
2483
2484   /* remember job */
2485   queue_free(&solv->job);
2486   queue_init_clone(&solv->job, job);
2487
2488   /*
2489    * create basic rule set of all involved packages
2490    * use addedmap bitmap to make sure we don't create rules twice
2491    */
2492
2493   /* create noobsolete map if needed */
2494   solver_calculate_noobsmap(pool, job, &solv->noobsoletes);
2495
2496   map_init(&addedmap, pool->nsolvables);
2497   MAPSET(&addedmap, SYSTEMSOLVABLE);
2498
2499   map_init(&installcandidatemap, pool->nsolvables);
2500   queue_init(&q);
2501
2502   now = sat_timems(0);
2503   /*
2504    * create rules for all package that could be involved with the solving
2505    * so called: rpm rules
2506    *
2507    */
2508   if (installed)
2509     {
2510       /* check for verify jobs */
2511       for (i = 0; i < job->count; i += 2)
2512         {
2513           how = job->elements[i];
2514           what = job->elements[i + 1];
2515           select = how & SOLVER_SELECTMASK;
2516           switch (how & SOLVER_JOBMASK)
2517             {
2518             case SOLVER_VERIFY:
2519               FOR_JOB_SELECT(p, pp, select, what)
2520                 {
2521                   s = pool->solvables + p;
2522                   if (!solv->installed || s->repo != solv->installed)
2523                     continue;
2524                   if (!solv->fixmap.size)
2525                     map_grow(&solv->fixmap, solv->installed->end - solv->installed->start);
2526                   MAPSET(&solv->fixmap, p - solv->installed->start);
2527                 }
2528               break;
2529             default:
2530               break;
2531             }
2532         }
2533
2534       oldnrules = solv->nrules;
2535       POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for installed solvables ***\n");
2536       FOR_REPO_SOLVABLES(installed, p, s)
2537         solver_addrpmrulesforsolvable(solv, s, &addedmap);
2538       POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for installed solvables\n", solv->nrules - oldnrules);
2539       POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for updaters of installed solvables ***\n");
2540       oldnrules = solv->nrules;
2541       FOR_REPO_SOLVABLES(installed, p, s)
2542         solver_addrpmrulesforupdaters(solv, s, &addedmap, 1);
2543       POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for updaters of installed solvables\n", solv->nrules - oldnrules);
2544     }
2545
2546   /*
2547    * create rules for all packages involved in the job
2548    * (to be installed or removed)
2549    */
2550
2551   POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for packages involved with a job ***\n");
2552   oldnrules = solv->nrules;
2553   for (i = 0; i < job->count; i += 2)
2554     {
2555       how = job->elements[i];
2556       what = job->elements[i + 1];
2557       select = how & SOLVER_SELECTMASK;
2558
2559       switch (how & SOLVER_JOBMASK)
2560         {
2561         case SOLVER_INSTALL:
2562           FOR_JOB_SELECT(p, pp, select, what)
2563             {
2564               MAPSET(&installcandidatemap, p);
2565               solver_addrpmrulesforsolvable(solv, pool->solvables + p, &addedmap);
2566             }
2567           break;
2568         case SOLVER_DISTUPGRADE:
2569           if (!solv->distupgrade)
2570             hasdupjob = 1;
2571           break;
2572         default:
2573           break;
2574         }
2575     }
2576   POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules for packages involved in a job\n", solv->nrules - oldnrules);
2577
2578
2579   /*
2580    * add rules for suggests, enhances
2581    */
2582   POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** create rpm rules for suggested/enhanced packages ***\n");
2583   oldnrules = solv->nrules;
2584   solver_addrpmrulesforweak(solv, &addedmap);
2585   POOL_DEBUG(SAT_DEBUG_STATS, "added %d rpm rules because of weak dependencies\n", solv->nrules - oldnrules);
2586
2587   /*
2588    * first pass done, we now have all the rpm rules we need.
2589    * unify existing rules before going over all job rules and
2590    * policy rules.
2591    * at this point the system is always solvable,
2592    * as an empty system (remove all packages) is a valid solution
2593    */
2594
2595   IF_POOLDEBUG (SAT_DEBUG_STATS)
2596     {
2597       int possible = 0, installable = 0;
2598       for (i = 1; i < pool->nsolvables; i++)
2599         {
2600           if (pool_installable(pool, pool->solvables + i))
2601             installable++;
2602           if (MAPTST(&addedmap, i))
2603             possible++;
2604         }
2605       POOL_DEBUG(SAT_DEBUG_STATS, "%d of %d installable solvables considered for solving\n", possible, installable);
2606     }
2607
2608   solver_unifyrules(solv);                          /* remove duplicate rpm rules */
2609   solv->rpmrules_end = solv->nrules;              /* mark end of rpm rules */
2610
2611   POOL_DEBUG(SAT_DEBUG_STATS, "rpm rule memory usage: %d K\n", solv->nrules * (int)sizeof(Rule) / 1024);
2612   POOL_DEBUG(SAT_DEBUG_STATS, "rpm rule creation took %d ms\n", sat_timems(now));
2613
2614   /* create dup maps if needed. We need the maps early to create our
2615    * update rules */
2616   if (hasdupjob)
2617     solver_createdupmaps(solv);
2618
2619   /*
2620    * create feature rules
2621    *
2622    * foreach installed:
2623    *   create assertion (keep installed, if no update available)
2624    *   or
2625    *   create update rule (A|update1(A)|update2(A)|...)
2626    *
2627    * those are used later on to keep a version of the installed packages in
2628    * best effort mode
2629    */
2630
2631   POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add feature rules ***\n");
2632   solv->featurerules = solv->nrules;              /* mark start of feature rules */
2633   if (installed)
2634     {
2635       /* foreach possibly installed solvable */
2636       for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
2637         {
2638           if (s->repo != installed)
2639             {
2640               solver_addrule(solv, 0, 0);       /* create dummy rule */
2641               continue;
2642             }
2643           solver_addupdaterule(solv, s, 1);    /* allow s to be updated */
2644         }
2645       /* make sure we accounted for all rules */
2646       assert(solv->nrules - solv->featurerules == installed->end - installed->start);
2647     }
2648   solv->featurerules_end = solv->nrules;
2649
2650     /*
2651      * Add update rules for installed solvables
2652      *
2653      * almost identical to feature rules
2654      * except that downgrades/archchanges/vendorchanges are not allowed
2655      */
2656
2657   POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add update rules ***\n");
2658   solv->updaterules = solv->nrules;
2659
2660   if (installed)
2661     { /* foreach installed solvables */
2662       /* we create all update rules, but disable some later on depending on the job */
2663       for (i = installed->start, s = pool->solvables + i; i < installed->end; i++, s++)
2664         {
2665           Rule *sr;
2666
2667           if (s->repo != installed)
2668             {
2669               solver_addrule(solv, 0, 0);       /* create dummy rule */
2670               continue;
2671             }
2672           solver_addupdaterule(solv, s, 0);     /* allowall = 0: downgrades not allowed */
2673           /*
2674            * check for and remove duplicate
2675            */
2676           r = solv->rules + solv->nrules - 1;           /* r: update rule */
2677           sr = r - (installed->end - installed->start); /* sr: feature rule */
2678           /* it's orphaned if there is no feature rule or the feature rule
2679            * consists just of the installed package */
2680           if (!sr->p || (sr->p == i && !sr->d && !sr->w2))
2681             queue_push(&solv->orphaned, i);
2682           if (!r->p)
2683             {
2684               assert(solv->distupgrade && !sr->p);
2685               continue;
2686             }
2687           if (!solver_samerule(solv, r, sr))
2688             {
2689               /* identical rule, kill unneeded one */
2690               if (solv->allowuninstall)
2691                 {
2692                   /* keep feature rule, make it weak */
2693                   memset(r, 0, sizeof(*r));
2694                   queue_push(&solv->weakruleq, sr - solv->rules);
2695                 }
2696               else
2697                 {
2698                   /* keep update rule */
2699                   memset(sr, 0, sizeof(*sr));
2700                 }
2701             }
2702           else if (solv->allowuninstall)
2703             {
2704               /* make both feature and update rule weak */
2705               queue_push(&solv->weakruleq, r - solv->rules);
2706               queue_push(&solv->weakruleq, sr - solv->rules);
2707             }
2708           else
2709             solver_disablerule(solv, sr);
2710         }
2711       /* consistency check: we added a rule for _every_ installed solvable */
2712       assert(solv->nrules - solv->updaterules == installed->end - installed->start);
2713     }
2714   solv->updaterules_end = solv->nrules;
2715
2716
2717   /*
2718    * now add all job rules
2719    */
2720
2721   POOL_DEBUG(SAT_DEBUG_SCHUBI, "*** Add JOB rules ***\n");
2722
2723   solv->jobrules = solv->nrules;
2724   for (i = 0; i < job->count; i += 2)
2725     {
2726       oldnrules = solv->nrules;
2727
2728       how = job->elements[i];
2729       what = job->elements[i + 1];
2730       weak = how & SOLVER_WEAK;
2731       select = how & SOLVER_SELECTMASK;
2732       switch (how & SOLVER_JOBMASK)
2733         {
2734         case SOLVER_INSTALL:
2735           POOL_DEBUG(SAT_DEBUG_JOB, "job: %sinstall %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2736           if (select == SOLVER_SOLVABLE)
2737             {
2738               p = what;
2739               d = 0;
2740             }
2741           else
2742             {
2743               queue_empty(&q);
2744               FOR_JOB_SELECT(p, pp, select, what)
2745                 queue_push(&q, p);
2746               if (!q.count)
2747                 {
2748                   /* no candidate found, make this an impossible rule */
2749                   queue_push(&q, -SYSTEMSOLVABLE);
2750                 }
2751               p = queue_shift(&q);      /* get first candidate */
2752               d = !q.count ? 0 : pool_queuetowhatprovides(pool, &q);    /* internalize */
2753             }
2754           solver_addjobrule(solv, p, d, i, weak);
2755           break;
2756         case SOLVER_ERASE:
2757           POOL_DEBUG(SAT_DEBUG_JOB, "job: %s%serase %s\n", weak ? "weak " : "", how & SOLVER_CLEANDEPS ? "clean deps " : "", solver_select2str(solv, select, what));
2758           if ((how & SOLVER_CLEANDEPS) != 0 && !solv->cleandepsmap.size && solv->installed)
2759             map_grow(&solv->cleandepsmap, solv->installed->end - solv->installed->start);
2760           if (select == SOLVER_SOLVABLE && solv->installed && pool->solvables[what].repo == solv->installed)
2761             {
2762               /* special case for "erase a specific solvable": we also
2763                * erase all other solvables with that name, so that they
2764                * don't get picked up as replacement */
2765               /* XXX: look also at packages that obsolete this package? */
2766               name = pool->solvables[what].name;
2767               FOR_PROVIDES(p, pp, name)
2768                 {
2769                   if (p == what)
2770                     continue;
2771                   s = pool->solvables + p;
2772                   if (s->name != name)
2773                     continue;
2774                   /* keep other versions installed */
2775                   if (s->repo == solv->installed)
2776                     continue;
2777                   /* keep installcandidates of other jobs */
2778                   if (MAPTST(&installcandidatemap, p))
2779                     continue;
2780                   solver_addjobrule(solv, -p, 0, i, weak);      /* remove by id */
2781                 }
2782             }
2783           FOR_JOB_SELECT(p, pp, select, what)
2784             solver_addjobrule(solv, -p, 0, i, weak);
2785           break;
2786
2787         case SOLVER_UPDATE:
2788           POOL_DEBUG(SAT_DEBUG_JOB, "job: %supdate %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2789           FOR_JOB_SELECT(p, pp, select, what)
2790             {
2791               s = pool->solvables + p;
2792               if (!solv->installed || s->repo != solv->installed)
2793                 continue;
2794               if (!solv->updatemap.size)
2795                 map_grow(&solv->updatemap, solv->installed->end - solv->installed->start);
2796               MAPSET(&solv->updatemap, p - solv->installed->start);
2797             }
2798           break;
2799         case SOLVER_VERIFY:
2800           POOL_DEBUG(SAT_DEBUG_JOB, "job: %sverify %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2801           break;
2802         case SOLVER_WEAKENDEPS:
2803           POOL_DEBUG(SAT_DEBUG_JOB, "job: %sweaken deps %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2804           if (select != SOLVER_SOLVABLE)
2805             break;
2806           s = pool->solvables + what;
2807           weaken_solvable_deps(solv, what);
2808           break;
2809         case SOLVER_NOOBSOLETES:
2810           POOL_DEBUG(SAT_DEBUG_JOB, "job: %sno obsolete %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2811           break;
2812         case SOLVER_LOCK:
2813           POOL_DEBUG(SAT_DEBUG_JOB, "job: %slock %s\n", weak ? "weak " : "", solver_select2str(solv, select, what));
2814           FOR_JOB_SELECT(p, pp, select, what)
2815             {
2816               s = pool->solvables + p;
2817               solver_addjobrule(solv, installed && s->repo == installed ? p : -p, 0, i, weak);
2818             }
2819           break;
2820         case SOLVER_DISTUPGRADE:
2821           POOL_DEBUG(SAT_DEBUG_JOB, "job: distupgrade %s\n", solver_select2str(solv, select, what));
2822           break;
2823         case SOLVER_DROP_ORPHANED:
2824           POOL_DEBUG(SAT_DEBUG_JOB, "job: drop orphaned %s\n", solver_select2str(solv, select, what));
2825           FOR_JOB_SELECT(p, pp, select, what)
2826             {
2827               s = pool->solvables + p;
2828               if (!installed || s->repo != installed)
2829                 continue;
2830               if (!solv->droporphanedmap.size)
2831                 map_grow(&solv->droporphanedmap, installed->end - installed->start);
2832               MAPSET(&solv->droporphanedmap, p - installed->start);
2833             }
2834           break;
2835         case SOLVER_USERINSTALLED:
2836           POOL_DEBUG(SAT_DEBUG_JOB, "job: user installed %s\n", solver_select2str(solv, select, what));
2837           break;
2838         default:
2839           POOL_DEBUG(SAT_DEBUG_JOB, "job: unknown job\n");
2840           break;
2841         }
2842
2843         /*
2844          * debug
2845          */
2846
2847       IF_POOLDEBUG (SAT_DEBUG_JOB)
2848         {
2849           int j;
2850           if (solv->nrules == oldnrules)
2851             POOL_DEBUG(SAT_DEBUG_JOB, " - no rule created\n");
2852           for (j = oldnrules; j < solv->nrules; j++)
2853             {
2854               POOL_DEBUG(SAT_DEBUG_JOB, " - job ");
2855               solver_printrule(solv, SAT_DEBUG_JOB, solv->rules + j);
2856             }
2857         }
2858     }
2859   assert(solv->ruletojob.count == solv->nrules - solv->jobrules);
2860   solv->jobrules_end = solv->nrules;
2861
2862   /* now create infarch and dup rules */
2863   if (!solv->noinfarchcheck)
2864     {
2865       solver_addinfarchrules(solv, &addedmap);
2866       if (pool->obsoleteusescolors)
2867         {
2868           /* currently doesn't work well with infarch rules, so make
2869            * them weak */
2870           for (i = solv->infarchrules; i < solv->infarchrules_end; i++)
2871             queue_push(&solv->weakruleq, i);
2872         }
2873     }
2874   else
2875     solv->infarchrules = solv->infarchrules_end = solv->nrules;
2876
2877   if (hasdupjob)
2878     {
2879       solver_addduprules(solv, &addedmap);
2880       solver_freedupmaps(solv); /* no longer needed */
2881     }
2882   else
2883     solv->duprules = solv->duprules_end = solv->nrules;
2884
2885   if (1)
2886     {
2887       extern void addchoicerules(Solver *solv);
2888       addchoicerules(solv);
2889     }
2890   else
2891     solv->choicerules = solv->choicerules_end = solv->nrules;
2892
2893   /* all rules created
2894    * --------------------------------------------------------------
2895    * prepare for solving
2896    */
2897
2898   /* free unneeded memory */
2899   map_free(&addedmap);
2900   map_free(&installcandidatemap);
2901   queue_free(&q);
2902
2903   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);
2904
2905   /* create weak map */
2906   map_init(&solv->weakrulemap, solv->nrules);
2907   for (i = 0; i < solv->weakruleq.count; i++)
2908     {
2909       p = solv->weakruleq.elements[i];
2910       MAPSET(&solv->weakrulemap, p);
2911     }
2912
2913   /* all new rules are learnt after this point */
2914   solv->learntrules = solv->nrules;
2915
2916   /* create watches chains */
2917   makewatches(solv);
2918
2919   /* create assertion index. it is only used to speed up
2920    * makeruledecsions() a bit */
2921   for (i = 1, r = solv->rules + i; i < solv->nrules; i++, r++)
2922     if (r->p && !r->w2 && (r->d == 0 || r->d == -1))
2923       queue_push(&solv->ruleassertions, i);
2924
2925   /* disable update rules that conflict with our job */
2926   solver_disablepolicyrules(solv);
2927
2928   /* make decisions based on job/update assertions */
2929   makeruledecisions(solv);
2930   POOL_DEBUG(SAT_DEBUG_SOLVER, "problems so far: %d\n", solv->problems.count);
2931
2932   /*
2933    * ********************************************
2934    * solve!
2935    * ********************************************
2936    */
2937
2938   now = sat_timems(0);
2939   solver_run_sat(solv, 1, solv->dontinstallrecommended ? 0 : 1);
2940   POOL_DEBUG(SAT_DEBUG_STATS, "solver took %d ms\n", sat_timems(now));
2941
2942   /*
2943    * calculate recommended/suggested packages
2944    */
2945   findrecommendedsuggested(solv);
2946
2947   /*
2948    * prepare solution queue if there were problems
2949    */
2950   solver_prepare_solutions(solv);
2951
2952   /*
2953    * finally prepare transaction info
2954    */
2955   transaction_calculate(&solv->trans, &solv->decisionq, &solv->noobsoletes);
2956
2957   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);
2958   POOL_DEBUG(SAT_DEBUG_STATS, "solver_solve took %d ms\n", sat_timems(solve_start));
2959 }
2960
2961 /***********************************************************************/
2962 /* disk usage computations */
2963
2964 /*-------------------------------------------------------------------
2965  *
2966  * calculate DU changes
2967  */
2968
2969 void
2970 solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps)
2971 {
2972   Map installedmap;
2973
2974   solver_create_state_maps(solv, &installedmap, 0);
2975   pool_calc_duchanges(solv->pool, &installedmap, mps, nmps);
2976   map_free(&installedmap);
2977 }
2978
2979
2980 /*-------------------------------------------------------------------
2981  *
2982  * calculate changes in install size
2983  */
2984
2985 int
2986 solver_calc_installsizechange(Solver *solv)
2987 {
2988   Map installedmap;
2989   int change;
2990
2991   solver_create_state_maps(solv, &installedmap, 0);
2992   change = pool_calc_installsizechange(solv->pool, &installedmap);
2993   map_free(&installedmap);
2994   return change;
2995 }
2996
2997 void
2998 solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res)
2999 {
3000   Map installedmap;
3001   solver_create_state_maps(solv, &installedmap, 0);
3002   pool_trivial_installable_noobsoletesmap(solv->pool, &installedmap, pkgs, res, solv->noobsoletes.size ? &solv->noobsoletes : 0);
3003   map_free(&installedmap);
3004 }
3005