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