src/solver.c

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