src/solver.c

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