src/rules.c

   1 /*
   2  * Copyright (c) 2007-2009, Novell Inc.
   3  *
   4  * This program is licensed under the BSD license, read LICENSE.BSD
   5  * for further information
   6  */
   7
   8 /*
   9  * rules.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 "poolarch.h"
  25 #include "util.h"
  26 #include "evr.h"
  27 #include "policy.h"
  28 #include "solverdebug.h"
  29
  30 #define RULES_BLOCK 63
  31
  32 static void addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep);
  33 static void solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded);
  34
  35 /*-------------------------------------------------------------------
  36  * Check if dependency is possible
  37  *
  38  * mirrors solver_dep_fulfilled but uses map m instead of the decisionmap
  39  * used in solver_addrpmrulesforweak and solver_createcleandepsmap
  40  */
  41
  42 static inline int
  43 dep_possible(Solver *solv, Id dep, Map *m)
  44 {
  45   Pool *pool = solv->pool;
  46   Id p, pp;
  47
  48   if (ISRELDEP(dep))
  49     {
  50       Reldep *rd = GETRELDEP(pool, dep);
  51       if (rd->flags >= 8)
  52         {
  53           if (rd->flags == REL_AND)
  54             {
  55               if (!dep_possible(solv, rd->name, m))
  56                 return 0;
  57               return dep_possible(solv, rd->evr, m);
  58             }
  59           if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
  60             return solver_splitprovides(solv, rd->evr);
  61           if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
  62             return solver_dep_installed(solv, rd->evr);
  63         }
  64     }
  65   FOR_PROVIDES(p, pp, dep)
  66     {
  67       if (MAPTST(m, p))
  68         return 1;
  69     }
  70   return 0;
  71 }
  72
  73 /********************************************************************
  74  *
  75  * Rule handling
  76  *
  77  * - unify rules, remove duplicates
  78  */
  79
  80 /*-------------------------------------------------------------------
  81  *
  82  * compare rules for unification sort
  83  *
  84  */
  85
  86 static int
  87 unifyrules_sortcmp(const void *ap, const void *bp, void *dp)
  88 {
  89   Pool *pool = dp;
  90   Rule *a = (Rule *)ap;
  91   Rule *b = (Rule *)bp;
  92   Id *ad, *bd;
  93   int x;
  94
  95   x = a->p - b->p;
  96   if (x)
  97     return x;                          /* p differs */
  98
  99   /* identical p */
 100   if (a->d == 0 && b->d == 0)
 101     return a->w2 - b->w2;              /* assertion: return w2 diff */
 102
 103   if (a->d == 0)                       /* a is assertion, b not */
 104     {
 105       x = a->w2 - pool->whatprovidesdata[b->d];
 106       return x ? x : -1;
 107     }
 108
 109   if (b->d == 0)                       /* b is assertion, a not */
 110     {
 111       x = pool->whatprovidesdata[a->d] - b->w2;
 112       return x ? x : 1;
 113     }
 114
 115   /* compare whatprovidesdata */
 116   ad = pool->whatprovidesdata + a->d;
 117   bd = pool->whatprovidesdata + b->d;
 118   while (*bd)
 119     if ((x = *ad++ - *bd++) != 0)
 120       return x;
 121   return *ad;
 122 }
 123
 124 int
 125 solver_samerule(Solver *solv, Rule *r1, Rule *r2)
 126 {
 127   return unifyrules_sortcmp(r1, r2, solv->pool);
 128 }
 129
 130
 131 /*-------------------------------------------------------------------
 132  *
 133  * unify rules
 134  * go over all rules and remove duplicates
 135  */
 136
 137 void
 138 solver_unifyrules(Solver *solv)
 139 {
 140   Pool *pool = solv->pool;
 141   int i, j;
 142   Rule *ir, *jr;
 143
 144   if (solv->nrules <= 2)               /* nothing to unify */
 145     return;
 146
 147   /* sort rules first */
 148   solv_sort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp, solv->pool);
 149
 150   /* prune rules
 151    * i = unpruned
 152    * j = pruned
 153    */
 154   jr = 0;
 155   for (i = j = 1, ir = solv->rules + i; i < solv->nrules; i++, ir++)
 156     {
 157       if (jr && !unifyrules_sortcmp(ir, jr, pool))
 158         continue;                      /* prune! */
 159       jr = solv->rules + j++;          /* keep! */
 160       if (ir != jr)
 161         *jr = *ir;
 162     }
 163
 164   /* reduced count from nrules to j rules */
 165   POOL_DEBUG(SOLV_DEBUG_STATS, "pruned rules from %d to %d\n", solv->nrules, j);
 166
 167   /* adapt rule buffer */
 168   solv->nrules = j;
 169   solv->rules = solv_extend_resize(solv->rules, solv->nrules, sizeof(Rule), RULES_BLOCK);
 170
 171   /*
 172    * debug: log rule statistics
 173    */
 174   IF_POOLDEBUG (SOLV_DEBUG_STATS)
 175     {
 176       int binr = 0;
 177       int lits = 0;
 178       Id *dp;
 179       Rule *r;
 180
 181       for (i = 1; i < solv->nrules; i++)
 182         {
 183           r = solv->rules + i;
 184           if (r->d == 0)
 185             binr++;
 186           else
 187             {
 188               dp = solv->pool->whatprovidesdata + r->d;
 189               while (*dp++)
 190                 lits++;
 191             }
 192         }
 193       POOL_DEBUG(SOLV_DEBUG_STATS, "  binary: %d\n", binr);
 194       POOL_DEBUG(SOLV_DEBUG_STATS, "  normal: %d, %d literals\n", solv->nrules - 1 - binr, lits);
 195     }
 196 }
 197
 198 #if 0
 199
 200 /*
 201  * hash rule
 202  */
 203
 204 static Hashval
 205 hashrule(Solver *solv, Id p, Id d, int n)
 206 {
 207   unsigned int x = (unsigned int)p;
 208   int *dp;
 209
 210   if (n <= 1)
 211     return (x * 37) ^ (unsigned int)d;
 212   dp = solv->pool->whatprovidesdata + d;
 213   while (*dp)
 214     x = (x * 37) ^ (unsigned int)*dp++;
 215   return x;
 216 }
 217 #endif
 218
 219
 220 /*-------------------------------------------------------------------
 221  *
 222  */
 223
 224 /*
 225  * add rule
 226  *  p = direct literal; always < 0 for installed rpm rules
 227  *  d, if < 0 direct literal, if > 0 offset into whatprovides, if == 0 rule is assertion (look at p only)
 228  *
 229  *
 230  * A requires b, b provided by B1,B2,B3 => (-A|B1|B2|B3)
 231  *
 232  * p < 0 : pkg id of A
 233  * d > 0 : Offset in whatprovidesdata (list of providers of b)
 234  *
 235  * A conflicts b, b provided by B1,B2,B3 => (-A|-B1), (-A|-B2), (-A|-B3)
 236  * p < 0 : pkg id of A
 237  * d < 0 : Id of solvable (e.g. B1)
 238  *
 239  * d == 0: unary rule, assertion => (A) or (-A)
 240  *
 241  *   Install:    p > 0, d = 0   (A)             user requested install
 242  *   Remove:     p < 0, d = 0   (-A)            user requested remove (also: uninstallable)
 243  *   Requires:   p < 0, d > 0   (-A|B1|B2|...)  d: <list of providers for requirement of p>
 244  *   Updates:    p > 0, d > 0   (A|B1|B2|...)   d: <list of updates for solvable p>
 245  *   Conflicts:  p < 0, d < 0   (-A|-B)         either p (conflict issuer) or d (conflict provider) (binary rule)
 246  *                                              also used for obsoletes
 247  *   ?:          p > 0, d < 0   (A|-B)
 248  *   No-op ?:    p = 0, d = 0   (null)          (used as policy rule placeholder)
 249  *
 250  *   resulting watches:
 251  *   ------------------
 252  *   Direct assertion (no watch needed) --> d = 0, w1 = p, w2 = 0
 253  *   Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
 254  *   every other : w1 = p, w2 = whatprovidesdata[d];
 255  *   Disabled rule: w1 = 0
 256  *
 257  *   always returns a rule for non-rpm rules
 258  */
 259
 260 Rule *
 261 solver_addrule(Solver *solv, Id p, Id d)
 262 {
 263   Pool *pool = solv->pool;
 264   Rule *r = 0;
 265   Id *dp = 0;
 266
 267   int n = 0;                           /* number of literals in rule - 1
 268                                           0 = direct assertion (single literal)
 269                                           1 = binary rule
 270                                           >1 =
 271                                         */
 272
 273   /* it often happenes that requires lead to adding the same rpm rule
 274    * multiple times, so we prune those duplicates right away to make
 275    * the work for unifyrules a bit easier */
 276
 277   if (!solv->rpmrules_end)              /* we add rpm rules */
 278     {
 279       r = solv->rules + solv->nrules - 1;       /* get the last added rule */
 280       if (r->p == p && r->d == d && (d != 0 || !r->w2))
 281         return r;
 282     }
 283
 284     /*
 285      * compute number of literals (n) in rule
 286      */
 287
 288   if (d < 0)
 289     {
 290       /* always a binary rule */
 291       if (p == d)
 292         return 0;                      /* ignore self conflict */
 293       n = 1;
 294     }
 295   else if (d > 0)
 296     {
 297       for (dp = pool->whatprovidesdata + d; *dp; dp++, n++)
 298         if (*dp == -p)
 299           return 0;                     /* rule is self-fulfilling */
 300
 301       if (n == 1)                       /* convert to binary rule */
 302         d = dp[-1];
 303     }
 304
 305   if (n == 1 && p > d && !solv->rpmrules_end)
 306     {
 307       /* smallest literal first so we can find dups */
 308       n = p; p = d; d = n;             /* p <-> d */
 309       n = 1;                           /* re-set n, was used as temp var */
 310     }
 311
 312   /*
 313    * check for duplicate
 314    */
 315
 316   /* check if the last added rule (r) is exactly the same as what we're looking for. */
 317   if (r && n == 1 && !r->d && r->p == p && r->w2 == d)
 318     return r;  /* binary rule */
 319
 320     /* have n-ary rule with same first literal, check other literals */
 321   if (r && n > 1 && r->d && r->p == p)
 322     {
 323       /* Rule where d is an offset in whatprovidesdata */
 324       Id *dp2;
 325       if (d == r->d)
 326         return r;
 327       dp2 = pool->whatprovidesdata + r->d;
 328       for (dp = pool->whatprovidesdata + d; *dp; dp++, dp2++)
 329         if (*dp != *dp2)
 330           break;
 331       if (*dp == *dp2)
 332         return r;
 333    }
 334
 335   /*
 336    * allocate new rule
 337    */
 338
 339   /* extend rule buffer */
 340   solv->rules = solv_extend(solv->rules, solv->nrules, 1, sizeof(Rule), RULES_BLOCK);
 341   r = solv->rules + solv->nrules++;    /* point to rule space */
 342
 343     /*
 344      * r = new rule
 345      */
 346
 347   r->p = p;
 348   if (n == 0)
 349     {
 350       /* direct assertion, no watch needed */
 351       r->d = 0;
 352       r->w1 = p;
 353       r->w2 = 0;
 354     }
 355   else if (n == 1)
 356     {
 357       /* binary rule */
 358       r->d = 0;
 359       r->w1 = p;
 360       r->w2 = d;
 361     }
 362   else
 363     {
 364       r->d = d;
 365       r->w1 = p;
 366       r->w2 = pool->whatprovidesdata[d];
 367     }
 368   r->n1 = 0;
 369   r->n2 = 0;
 370
 371   IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
 372     {
 373       POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "  Add rule: ");
 374       solver_printrule(solv, SOLV_DEBUG_RULE_CREATION, r);
 375     }
 376
 377   return r;
 378 }
 379
 380
 381 /******************************************************************************
 382  ***
 383  *** rpm rule part: create rules representing the package dependencies
 384  ***
 385  ***/
 386
 387 /*
 388  *  special multiversion patch conflict handling:
 389  *  a patch conflict is also satisfied if some other
 390  *  version with the same name/arch that doesn't conflict
 391  *  gets installed. The generated rule is thus:
 392  *  -patch|-cpack|opack1|opack2|...
 393  */
 394 static Id
 395 makemultiversionconflict(Solver *solv, Id n, Id con)
 396 {
 397   Pool *pool = solv->pool;
 398   Solvable *s, *sn;
 399   Queue q;
 400   Id p, pp, qbuf[64];
 401
 402   sn = pool->solvables + n;
 403   queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
 404   queue_push(&q, -n);
 405   FOR_PROVIDES(p, pp, sn->name)
 406     {
 407       s = pool->solvables + p;
 408       if (s->name != sn->name || s->arch != sn->arch)
 409         continue;
 410       if (!MAPTST(&solv->noobsoletes, p))
 411         continue;
 412       if (pool_match_nevr(pool, pool->solvables + p, con))
 413         continue;
 414       /* here we have a multiversion solvable that doesn't conflict */
 415       /* thus we're not in conflict if it is installed */
 416       queue_push(&q, p);
 417     }
 418   if (q.count == 1)
 419     return -n;  /* no other package found, generate normal conflict */
 420   return pool_queuetowhatprovides(pool, &q);
 421 }
 422
 423 static inline void
 424 addrpmrule(Solver *solv, Id p, Id d, int type, Id dep)
 425 {
 426   if (!solv->ruleinfoq)
 427     solver_addrule(solv, p, d);
 428   else
 429     addrpmruleinfo(solv, p, d, type, dep);
 430 }
 431
 432 /*-------------------------------------------------------------------
 433  *
 434  * add (install) rules for solvable
 435  *
 436  * s: Solvable for which to add rules
 437  * m: m[s] = 1 for solvables which have rules, prevent rule duplication
 438  *
 439  * Algorithm: 'visit all nodes of a graph'. The graph nodes are
 440  *  solvables, the edges their dependencies.
 441  *  Starting from an installed solvable, this will create all rules
 442  *  representing the graph created by the solvables dependencies.
 443  *
 444  * for unfulfilled requirements, conflicts, obsoletes,....
 445  * add a negative assertion for solvables that are not installable
 446  *
 447  * It will also create rules for all solvables referenced by 's'
 448  *  i.e. descend to all providers of requirements of 's'
 449  *
 450  */
 451
 452 void
 453 solver_addrpmrulesforsolvable(Solver *solv, Solvable *s, Map *m)
 454 {
 455   Pool *pool = solv->pool;
 456   Repo *installed = solv->installed;
 457
 458   /* 'work' queue. keeps Ids of solvables we still have to work on.
 459      And buffer for it. */
 460   Queue workq;
 461   Id workqbuf[64];
 462
 463   int i;
 464     /* if to add rules for broken deps ('rpm -V' functionality)
 465      * 0 = yes, 1 = no
 466      */
 467   int dontfix;
 468     /* Id var and pointer for each dependency
 469      * (not used in parallel)
 470      */
 471   Id req, *reqp;
 472   Id con, *conp;
 473   Id obs, *obsp;
 474   Id rec, *recp;
 475   Id sug, *sugp;
 476   Id p, pp;             /* whatprovides loops */
 477   Id *dp;               /* ptr to 'whatprovides' */
 478   Id n;                 /* Id for current solvable 's' */
 479
 480   queue_init_buffer(&workq, workqbuf, sizeof(workqbuf)/sizeof(*workqbuf));
 481   queue_push(&workq, s - pool->solvables);      /* push solvable Id to work queue */
 482
 483   /* loop until there's no more work left */
 484   while (workq.count)
 485     {
 486       /*
 487        * n: Id of solvable
 488        * s: Pointer to solvable
 489        */
 490
 491       n = queue_shift(&workq);          /* 'pop' next solvable to work on from queue */
 492       if (m)
 493         {
 494           if (MAPTST(m, n))             /* continue if already visited */
 495             continue;
 496           MAPSET(m, n);                 /* mark as visited */
 497         }
 498
 499       s = pool->solvables + n;          /* s = Solvable in question */
 500
 501       dontfix = 0;
 502       if (installed                     /* Installed system available */
 503           && s->repo == installed       /* solvable is installed */
 504           && !solv->fixmap_all          /* NOT repair errors in rpm dependency graph */
 505           && !(solv->fixmap.size && MAPTST(&solv->fixmap, n - installed->start)))
 506         {
 507           dontfix = 1;                  /* dont care about broken rpm deps */
 508         }
 509
 510       if (!dontfix
 511           && s->arch != ARCH_SRC
 512           && s->arch != ARCH_NOSRC
 513           && !pool_installable(pool, s))
 514         {
 515           POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables));
 516           addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOT_INSTALLABLE, 0);
 517         }
 518
 519       /* yet another SUSE hack, sigh */
 520       if (pool->nscallback && !strncmp("product:", pool_id2str(pool, s->name), 8))
 521         {
 522           Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, n);
 523           if (buddy > 0 && buddy != SYSTEMSOLVABLE && buddy != n && buddy < pool->nsolvables)
 524             {
 525               addrpmrule(solv, n, -buddy, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + n));
 526               addrpmrule(solv, buddy, -n, SOLVER_RULE_RPM_PACKAGE_REQUIRES, solvable_selfprovidedep(pool->solvables + buddy));
 527               if (m && !MAPTST(m, buddy))
 528                 queue_push(&workq, buddy);
 529             }
 530         }
 531
 532       /*-----------------------------------------
 533        * check requires of s
 534        */
 535
 536       if (s->requires)
 537         {
 538           reqp = s->repo->idarraydata + s->requires;
 539           while ((req = *reqp++) != 0)            /* go through all requires */
 540             {
 541               if (req == SOLVABLE_PREREQMARKER)   /* skip the marker */
 542                 continue;
 543
 544               /* find list of solvables providing 'req' */
 545               dp = pool_whatprovides_ptr(pool, req);
 546
 547               if (*dp == SYSTEMSOLVABLE)          /* always installed */
 548                 continue;
 549
 550               if (dontfix)
 551                 {
 552                   /* the strategy here is to not insist on dependencies
 553                    * that are already broken. so if we find one provider
 554                    * that was already installed, we know that the
 555                    * dependency was not broken before so we enforce it */
 556
 557                   /* check if any of the providers for 'req' is installed */
 558                   for (i = 0; (p = dp[i]) != 0; i++)
 559                     {
 560                       if (pool->solvables[p].repo == installed)
 561                         break;          /* provider was installed */
 562                     }
 563                   /* didn't find an installed provider: previously broken dependency */
 564                   if (!p)
 565                     {
 566                       POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "ignoring broken requires %s of installed package %s\n", pool_dep2str(pool, req), pool_solvable2str(pool, s));
 567                       continue;
 568                     }
 569                 }
 570
 571               if (!*dp)
 572                 {
 573                   /* nothing provides req! */
 574                   POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "package %s [%d] is not installable (%s)\n", pool_solvable2str(pool, s), (Id)(s - pool->solvables), pool_dep2str(pool, req));
 575                   addrpmrule(solv, -n, 0, SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP, req);
 576                   continue;
 577                 }
 578
 579               IF_POOLDEBUG (SOLV_DEBUG_RULE_CREATION)
 580                 {
 581                   POOL_DEBUG(SOLV_DEBUG_RULE_CREATION,"  %s requires %s\n", pool_solvable2str(pool, s), pool_dep2str(pool, req));
 582                   for (i = 0; dp[i]; i++)
 583                     POOL_DEBUG(SOLV_DEBUG_RULE_CREATION, "   provided by %s\n", pool_solvid2str(pool, dp[i]));
 584                 }
 585
 586               /* add 'requires' dependency */
 587               /* rule: (-requestor|provider1|provider2|...|providerN) */
 588               addrpmrule(solv, -n, dp - pool->whatprovidesdata, SOLVER_RULE_RPM_PACKAGE_REQUIRES, req);
 589
 590               /* descend the dependency tree
 591                  push all non-visited providers on the work queue */
 592               if (m)
 593                 {
 594                   for (; *dp; dp++)
 595                     {
 596                       if (!MAPTST(m, *dp))
 597                         queue_push(&workq, *dp);
 598                     }
 599                 }
 600
 601             } /* while, requirements of n */
 602
 603         } /* if, requirements */
 604
 605       /* that's all we check for src packages */
 606       if (s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
 607         continue;
 608
 609       /*-----------------------------------------
 610        * check conflicts of s
 611        */
 612
 613       if (s->conflicts)
 614         {
 615           int ispatch = 0;
 616
 617           /* we treat conflicts in patches a bit differen:
 618            * - nevr matching
 619            * - multiversion handling
 620            * XXX: we should really handle this different, looking
 621            * at the name is a bad hack
 622            */
 623           if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
 624             ispatch = 1;
 625           conp = s->repo->idarraydata + s->conflicts;
 626           /* foreach conflicts of 's' */
 627           while ((con = *conp++) != 0)
 628             {
 629               /* foreach providers of a conflict of 's' */
 630               FOR_PROVIDES(p, pp, con)
 631                 {
 632                   if (ispatch && !pool_match_nevr(pool, pool->solvables + p, con))
 633                     continue;
 634                   /* dontfix: dont care about conflicts with already installed packs */
 635                   if (dontfix && pool->solvables[p].repo == installed)
 636                     continue;
 637                   /* p == n: self conflict */
 638                   if (p == n && pool->forbidselfconflicts)
 639                     {
 640                       if (ISRELDEP(con))
 641                         {
 642                           Reldep *rd = GETRELDEP(pool, con);
 643                           if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_OTHERPROVIDERS)
 644                             continue;
 645                         }
 646                       p = 0;    /* make it a negative assertion, aka 'uninstallable' */
 647                     }
 648                   if (p && ispatch && solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p) && ISRELDEP(con))
 649                     {
 650                       /* our patch conflicts with a noobsoletes (aka multiversion) package */
 651                       p = -makemultiversionconflict(solv, p, con);
 652                     }
 653                  /* rule: -n|-p: either solvable _or_ provider of conflict */
 654                   addrpmrule(solv, -n, -p, p ? SOLVER_RULE_RPM_PACKAGE_CONFLICT : SOLVER_RULE_RPM_SELF_CONFLICT, con);
 655                 }
 656             }
 657         }
 658
 659       /*-----------------------------------------
 660        * check obsoletes and implicit obsoletes of a package
 661        * if ignoreinstalledsobsoletes is not set, we're also checking
 662        * obsoletes of installed packages (like newer rpm versions)
 663        */
 664       if ((!installed || s->repo != installed) || !pool->noinstalledobsoletes)
 665         {
 666           int noobs = solv->noobsoletes.size && MAPTST(&solv->noobsoletes, n);
 667           int isinstalled = (installed && s->repo == installed);
 668           if (s->obsoletes && (!noobs || solv->keepexplicitobsoletes))
 669             {
 670               obsp = s->repo->idarraydata + s->obsoletes;
 671               /* foreach obsoletes */
 672               while ((obs = *obsp++) != 0)
 673                 {
 674                   /* foreach provider of an obsoletes of 's' */
 675                   FOR_PROVIDES(p, pp, obs)
 676                     {
 677                       Solvable *ps = pool->solvables + p;
 678                       if (p == n)
 679                         continue;
 680                       if (isinstalled && dontfix && ps->repo == installed)
 681                         continue;       /* don't repair installed/installed problems */
 682                       if (!pool->obsoleteusesprovides /* obsoletes are matched names, not provides */
 683                           && !pool_match_nevr(pool, ps, obs))
 684                         continue;
 685                       if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
 686                         continue;
 687                       if (!isinstalled)
 688                         addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_PACKAGE_OBSOLETES, obs);
 689                       else
 690                         addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES, obs);
 691                     }
 692                 }
 693             }
 694           /* check implicit obsoletes
 695            * for installed packages we only need to check installed/installed problems (and
 696            * only when dontfix is not set), as the others are picked up when looking at the
 697            * uninstalled package.
 698            */
 699           if (!isinstalled || !dontfix)
 700             {
 701               FOR_PROVIDES(p, pp, s->name)
 702                 {
 703                   Solvable *ps = pool->solvables + p;
 704                   if (p == n)
 705                     continue;
 706                   if (isinstalled && ps->repo != installed)
 707                     continue;
 708                   /* we still obsolete packages with same nevra, like rpm does */
 709                   /* (actually, rpm mixes those packages. yuck...) */
 710                   if (noobs && (s->name != ps->name || s->evr != ps->evr || s->arch != ps->arch))
 711                     continue;
 712                   if (!pool->implicitobsoleteusesprovides && s->name != ps->name)
 713                     continue;
 714                   if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
 715                     continue;
 716                   if (s->name == ps->name)
 717                     addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_SAME_NAME, 0);
 718                   else
 719                     addrpmrule(solv, -n, -p, SOLVER_RULE_RPM_IMPLICIT_OBSOLETES, s->name);
 720                 }
 721             }
 722         }
 723
 724       /*-----------------------------------------
 725        * add recommends to the work queue
 726        */
 727       if (s->recommends && m)
 728         {
 729           recp = s->repo->idarraydata + s->recommends;
 730           while ((rec = *recp++) != 0)
 731             {
 732               FOR_PROVIDES(p, pp, rec)
 733                 if (!MAPTST(m, p))
 734                   queue_push(&workq, p);
 735             }
 736         }
 737       if (s->suggests && m)
 738         {
 739           sugp = s->repo->idarraydata + s->suggests;
 740           while ((sug = *sugp++) != 0)
 741             {
 742               FOR_PROVIDES(p, pp, sug)
 743                 if (!MAPTST(m, p))
 744                   queue_push(&workq, p);
 745             }
 746         }
 747     }
 748   queue_free(&workq);
 749 }
 750
 751
 752 /*-------------------------------------------------------------------
 753  *
 754  * Add rules for packages possibly selected in by weak dependencies
 755  *
 756  * m: already added solvables
 757  */
 758
 759 void
 760 solver_addrpmrulesforweak(Solver *solv, Map *m)
 761 {
 762   Pool *pool = solv->pool;
 763   Solvable *s;
 764   Id sup, *supp;
 765   int i, n;
 766
 767   /* foreach solvable in pool */
 768   for (i = n = 1; n < pool->nsolvables; i++, n++)
 769     {
 770       if (i == pool->nsolvables)                /* wrap i */
 771         i = 1;
 772       if (MAPTST(m, i))                         /* already added that one */
 773         continue;
 774
 775       s = pool->solvables + i;
 776       if (!pool_installable(pool, s))           /* only look at installable ones */
 777         continue;
 778
 779       sup = 0;
 780       if (s->supplements)
 781         {
 782           /* find possible supplements */
 783           supp = s->repo->idarraydata + s->supplements;
 784           while ((sup = *supp++) != 0)
 785             if (dep_possible(solv, sup, m))
 786               break;
 787         }
 788
 789       /* if nothing found, check for enhances */
 790       if (!sup && s->enhances)
 791         {
 792           supp = s->repo->idarraydata + s->enhances;
 793           while ((sup = *supp++) != 0)
 794             if (dep_possible(solv, sup, m))
 795               break;
 796         }
 797       /* if nothing found, goto next solvables */
 798       if (!sup)
 799         continue;
 800       solver_addrpmrulesforsolvable(solv, s, m);
 801       n = 0;                    /* check all solvables again because we added solvables to m */
 802     }
 803 }
 804
 805
 806 /*-------------------------------------------------------------------
 807  *
 808  * add package rules for possible updates
 809  *
 810  * s: solvable
 811  * m: map of already visited solvables
 812  * allow_all: 0 = dont allow downgrades, 1 = allow all candidates
 813  */
 814
 815 void
 816 solver_addrpmrulesforupdaters(Solver *solv, Solvable *s, Map *m, int allow_all)
 817 {
 818   Pool *pool = solv->pool;
 819   int i;
 820     /* queue and buffer for it */
 821   Queue qs;
 822   Id qsbuf[64];
 823
 824   queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
 825     /* find update candidates for 's' */
 826   policy_findupdatepackages(solv, s, &qs, allow_all);
 827     /* add rule for 's' if not already done */
 828   if (!MAPTST(m, s - pool->solvables))
 829     solver_addrpmrulesforsolvable(solv, s, m);
 830     /* foreach update candidate, add rule if not already done */
 831   for (i = 0; i < qs.count; i++)
 832     if (!MAPTST(m, qs.elements[i]))
 833       solver_addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m);
 834   queue_free(&qs);
 835 }
 836
 837
 838 /***********************************************************************
 839  ***
 840  ***  Update/Feature rule part
 841  ***
 842  ***  Those rules make sure an installed package isn't silently deleted
 843  ***
 844  ***/
 845
 846 static Id
 847 finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
 848 {
 849   Pool *pool = solv->pool;
 850   int i;
 851
 852   policy_findupdatepackages(solv, s, qs, allow_all ? allow_all : 2);
 853   if (!qs->count)
 854     {
 855       if (allow_all)
 856         return 0;       /* orphaned, don't create feature rule */
 857       /* check if this is an orphaned package */
 858       policy_findupdatepackages(solv, s, qs, 1);
 859       if (!qs->count)
 860         return 0;       /* orphaned, don't create update rule */
 861       qs->count = 0;
 862       return -SYSTEMSOLVABLE;   /* supported but not installable */
 863     }
 864   if (allow_all)
 865     return s - pool->solvables;
 866   /* check if it is ok to keep the installed package */
 867   for (i = 0; i < qs->count; i++)
 868     {
 869       Solvable *ns = pool->solvables + qs->elements[i];
 870       if (s->evr == ns->evr && solvable_identical(s, ns))
 871         return s - pool->solvables;
 872     }
 873   /* nope, it must be some other package */
 874   return -SYSTEMSOLVABLE;
 875 }
 876
 877 /* add packages from the dup repositories to the update candidates
 878  * this isn't needed for the global dup mode as all packages are
 879  * from dup repos in that case */
 880 static void
 881 addduppackages(Solver *solv, Solvable *s, Queue *qs)
 882 {
 883   Queue dupqs;
 884   Id p, dupqsbuf[64];
 885   int i;
 886   int oldnoupdateprovide = solv->noupdateprovide;
 887
 888   queue_init_buffer(&dupqs, dupqsbuf, sizeof(dupqsbuf)/sizeof(*dupqsbuf));
 889   solv->noupdateprovide = 1;
 890   policy_findupdatepackages(solv, s, &dupqs, 2);
 891   solv->noupdateprovide = oldnoupdateprovide;
 892   for (i = 0; i < dupqs.count; i++)
 893     {
 894       p = dupqs.elements[i];
 895       if (MAPTST(&solv->dupmap, p))
 896         queue_pushunique(qs, p);
 897     }
 898   queue_free(&dupqs);
 899 }
 900
 901 /*-------------------------------------------------------------------
 902  *
 903  * add rule for update
 904  *   (A|A1|A2|A3...)  An = update candidates for A
 905  *
 906  * s = (installed) solvable
 907  */
 908
 909 void
 910 solver_addupdaterule(Solver *solv, Solvable *s, int allow_all)
 911 {
 912   /* installed packages get a special upgrade allowed rule */
 913   Pool *pool = solv->pool;
 914   Id p, d;
 915   Queue qs;
 916   Id qsbuf[64];
 917
 918   queue_init_buffer(&qs, qsbuf, sizeof(qsbuf)/sizeof(*qsbuf));
 919   p = s - pool->solvables;
 920   /* find update candidates for 's' */
 921   if (solv->dupmap_all)
 922     p = finddistupgradepackages(solv, s, &qs, allow_all);
 923   else
 924     policy_findupdatepackages(solv, s, &qs, allow_all);
 925   if (!allow_all && !solv->dupmap_all && solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p))
 926     addduppackages(solv, s, &qs);
 927
 928   if (!allow_all && qs.count && solv->noobsoletes.size)
 929     {
 930       int i, j;
 931
 932       d = pool_queuetowhatprovides(pool, &qs);
 933       /* filter out all noobsoletes packages as they don't update */
 934       for (i = j = 0; i < qs.count; i++)
 935         {
 936           if (MAPTST(&solv->noobsoletes, qs.elements[i]))
 937             {
 938               /* it's ok if they have same nevra */
 939               Solvable *ps = pool->solvables + qs.elements[i];
 940               if (ps->name != s->name || ps->evr != s->evr || ps->arch != s->arch)
 941                 continue;
 942             }
 943           qs.elements[j++] = qs.elements[i];
 944         }
 945       if (j < qs.count)
 946         {
 947           if (d && solv->installed && s->repo == solv->installed &&
 948               (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, s - pool->solvables - solv->installed->start))))
 949             {
 950               if (!solv->multiversionupdaters)
 951                 solv->multiversionupdaters = solv_calloc(solv->installed->end - solv->installed->start, sizeof(Id));
 952               solv->multiversionupdaters[s - pool->solvables - solv->installed->start] = d;
 953             }
 954           if (j == 0 && p == -SYSTEMSOLVABLE && solv->dupmap_all)
 955             {
 956               queue_push(&solv->orphaned, s - pool->solvables); /* treat as orphaned */
 957               j = qs.count;
 958             }
 959           qs.count = j;
 960         }
 961     }
 962   if (qs.count && p == -SYSTEMSOLVABLE)
 963     p = queue_shift(&qs);
 964   d = qs.count ? pool_queuetowhatprovides(pool, &qs) : 0;
 965   queue_free(&qs);
 966   solver_addrule(solv, p, d);   /* allow update of s */
 967 }
 968
 969 static inline void
 970 disableupdaterule(Solver *solv, Id p)
 971 {
 972   Rule *r;
 973
 974   MAPSET(&solv->noupdate, p - solv->installed->start);
 975   r = solv->rules + solv->updaterules + (p - solv->installed->start);
 976   if (r->p && r->d >= 0)
 977     solver_disablerule(solv, r);
 978   r = solv->rules + solv->featurerules + (p - solv->installed->start);
 979   if (r->p && r->d >= 0)
 980     solver_disablerule(solv, r);
 981 }
 982
 983 static inline void
 984 reenableupdaterule(Solver *solv, Id p)
 985 {
 986   Pool *pool = solv->pool;
 987   Rule *r;
 988
 989   MAPCLR(&solv->noupdate, p - solv->installed->start);
 990   r = solv->rules + solv->updaterules + (p - solv->installed->start);
 991   if (r->p)
 992     {
 993       if (r->d >= 0)
 994         return;
 995       solver_enablerule(solv, r);
 996       IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
 997         {
 998           POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
 999           solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1000         }
1001       return;
1002     }
1003   r = solv->rules + solv->featurerules + (p - solv->installed->start);
1004   if (r->p && r->d < 0)
1005     {
1006       solver_enablerule(solv, r);
1007       IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1008         {
1009           POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1010           solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1011         }
1012     }
1013 }
1014
1015
1016 /***********************************************************************
1017  ***
1018  ***  Infarch rule part
1019  ***
1020  ***  Infarch rules make sure the solver uses the best architecture of
1021  ***  a package if multiple archetectures are available
1022  ***
1023  ***/
1024
1025 void
1026 solver_addinfarchrules(Solver *solv, Map *addedmap)
1027 {
1028   Pool *pool = solv->pool;
1029   int first, i, j;
1030   Id p, pp, a, aa, bestarch;
1031   Solvable *s, *ps, *bests;
1032   Queue badq, allowedarchs;
1033
1034   queue_init(&badq);
1035   queue_init(&allowedarchs);
1036   solv->infarchrules = solv->nrules;
1037   for (i = 1; i < pool->nsolvables; i++)
1038     {
1039       if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1040         continue;
1041       s = pool->solvables + i;
1042       first = i;
1043       bestarch = 0;
1044       bests = 0;
1045       queue_empty(&allowedarchs);
1046       FOR_PROVIDES(p, pp, s->name)
1047         {
1048           ps = pool->solvables + p;
1049           if (ps->name != s->name || !MAPTST(addedmap, p))
1050             continue;
1051           if (p == i)
1052             first = 0;
1053           if (first)
1054             break;
1055           a = ps->arch;
1056           a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1057           if (a != 1 && pool->installed && ps->repo == pool->installed)
1058             {
1059               if (!solv->dupmap_all && !(solv->dupinvolvedmap.size && MAPTST(&solv->dupinvolvedmap, p)))
1060                 queue_pushunique(&allowedarchs, ps->arch);      /* also ok to keep this architecture */
1061               continue;         /* ignore installed solvables when calculating the best arch */
1062             }
1063           if (a && a != 1 && (!bestarch || a < bestarch))
1064             {
1065               bestarch = a;
1066               bests = ps;
1067             }
1068         }
1069       if (first)
1070         continue;
1071       /* speed up common case where installed package already has best arch */
1072       if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch)
1073         allowedarchs.count--;   /* installed arch is best */
1074       queue_empty(&badq);
1075       FOR_PROVIDES(p, pp, s->name)
1076         {
1077           ps = pool->solvables + p;
1078           if (ps->name != s->name || !MAPTST(addedmap, p))
1079             continue;
1080           a = ps->arch;
1081           a = (a <= pool->lastarch) ? pool->id2arch[a] : 0;
1082           if (a != 1 && bestarch && ((a ^ bestarch) & 0xffff0000) != 0)
1083             {
1084               if (pool->installed && ps->repo == pool->installed)
1085                 continue;       /* always ok to keep an installed package */
1086               for (j = 0; j < allowedarchs.count; j++)
1087                 {
1088                   aa = allowedarchs.elements[j];
1089                   if (ps->arch == aa)
1090                     break;
1091                   aa = (aa <= pool->lastarch) ? pool->id2arch[aa] : 0;
1092                   if (aa && ((a ^ aa) & 0xffff0000) == 0)
1093                     break;      /* compatible */
1094                 }
1095               if (j == allowedarchs.count)
1096                 queue_push(&badq, p);
1097             }
1098         }
1099       if (!badq.count)
1100         continue;
1101       /* block all solvables in the badq! */
1102       for (j = 0; j < badq.count; j++)
1103         {
1104           p = badq.elements[j];
1105           solver_addrule(solv, -p, 0);
1106         }
1107     }
1108   queue_free(&badq);
1109   queue_free(&allowedarchs);
1110   solv->infarchrules_end = solv->nrules;
1111 }
1112
1113 static inline void
1114 disableinfarchrule(Solver *solv, Id name)
1115 {
1116   Pool *pool = solv->pool;
1117   Rule *r;
1118   int i;
1119   for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1120     {
1121       if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1122         solver_disablerule(solv, r);
1123     }
1124 }
1125
1126 static inline void
1127 reenableinfarchrule(Solver *solv, Id name)
1128 {
1129   Pool *pool = solv->pool;
1130   Rule *r;
1131   int i;
1132   for (i = solv->infarchrules, r = solv->rules + i; i < solv->infarchrules_end; i++, r++)
1133     {
1134       if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1135         {
1136           solver_enablerule(solv, r);
1137           IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1138             {
1139               POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1140               solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1141             }
1142         }
1143     }
1144 }
1145
1146
1147 /***********************************************************************
1148  ***
1149  ***  Dup rule part
1150  ***
1151  ***  Dup rules make sure a package is selected from the specified dup
1152  ***  repositories if an update candidate is included in one of them.
1153  ***
1154  ***/
1155
1156 void
1157 solver_createdupmaps(Solver *solv)
1158 {
1159   Queue *job = &solv->job;
1160   Pool *pool = solv->pool;
1161   Repo *repo;
1162   Id how, what, p, pi, pp, obs, *obsp;
1163   Solvable *s, *ps;
1164   int i;
1165
1166   map_init(&solv->dupmap, pool->nsolvables);
1167   map_init(&solv->dupinvolvedmap, pool->nsolvables);
1168   for (i = 0; i < job->count; i += 2)
1169     {
1170       how = job->elements[i];
1171       what = job->elements[i + 1];
1172       switch (how & SOLVER_JOBMASK)
1173         {
1174         case SOLVER_DISTUPGRADE:
1175           if ((how & SOLVER_SELECTMASK) != SOLVER_SOLVABLE_REPO)
1176             break;
1177           if (what <= 0 || what > pool->nrepos)
1178             break;
1179           repo = pool_id2repo(pool, what);
1180           FOR_REPO_SOLVABLES(repo, p, s)
1181             {
1182               if (repo != solv->installed && !pool_installable(pool, s))
1183                 continue;
1184               MAPSET(&solv->dupmap, p);
1185               FOR_PROVIDES(pi, pp, s->name)
1186                 {
1187                   ps = pool->solvables + pi;
1188                   if (ps->name != s->name)
1189                     continue;
1190                   MAPSET(&solv->dupinvolvedmap, pi);
1191                 }
1192               if (s->obsoletes)
1193                 {
1194                   /* FIXME: check obsoletes/provides combination */
1195                   obsp = s->repo->idarraydata + s->obsoletes;
1196                   while ((obs = *obsp++) != 0)
1197                     {
1198                       FOR_PROVIDES(pi, pp, obs)
1199                         {
1200                           Solvable *pis = pool->solvables + pi;
1201                           if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pis, obs))
1202                             continue;
1203                           if (pool->obsoleteusescolors && !pool_colormatch(pool, s, pis))
1204                             continue;
1205                           MAPSET(&solv->dupinvolvedmap, pi);
1206                         }
1207                     }
1208                 }
1209             }
1210           break;
1211         default:
1212           break;
1213         }
1214     }
1215   MAPCLR(&solv->dupinvolvedmap, SYSTEMSOLVABLE);
1216 }
1217
1218 void
1219 solver_freedupmaps(Solver *solv)
1220 {
1221   map_free(&solv->dupmap);
1222   /* we no longer free solv->dupinvolvedmap as we need it in
1223    * policy's priority pruning code. sigh. */
1224 }
1225
1226 void
1227 solver_addduprules(Solver *solv, Map *addedmap)
1228 {
1229   Pool *pool = solv->pool;
1230   Id p, pp;
1231   Solvable *s, *ps;
1232   int first, i;
1233
1234   solv->duprules = solv->nrules;
1235   for (i = 1; i < pool->nsolvables; i++)
1236     {
1237       if (i == SYSTEMSOLVABLE || !MAPTST(addedmap, i))
1238         continue;
1239       s = pool->solvables + i;
1240       first = i;
1241       FOR_PROVIDES(p, pp, s->name)
1242         {
1243           ps = pool->solvables + p;
1244           if (ps->name != s->name || !MAPTST(addedmap, p))
1245             continue;
1246           if (p == i)
1247             first = 0;
1248           if (first)
1249             break;
1250           if (!MAPTST(&solv->dupinvolvedmap, p))
1251             continue;
1252           if (solv->installed && ps->repo == solv->installed)
1253             {
1254               if (!solv->updatemap.size)
1255                 map_grow(&solv->updatemap, solv->installed->end - solv->installed->start);
1256               MAPSET(&solv->updatemap, p - solv->installed->start);
1257               if (!MAPTST(&solv->dupmap, p))
1258                 {
1259                   Id ip, ipp;
1260                   /* is installed identical to a good one? */
1261                   FOR_PROVIDES(ip, ipp, ps->name)
1262                     {
1263                       Solvable *is = pool->solvables + ip;
1264                       if (!MAPTST(&solv->dupmap, ip))
1265                         continue;
1266                       if (is->evr == ps->evr && solvable_identical(ps, is))
1267                         break;
1268                     }
1269                   if (!ip)
1270                     solver_addrule(solv, -p, 0);        /* no match, sorry */
1271                 }
1272             }
1273           else if (!MAPTST(&solv->dupmap, p))
1274             solver_addrule(solv, -p, 0);
1275         }
1276     }
1277   solv->duprules_end = solv->nrules;
1278 }
1279
1280
1281 static inline void
1282 disableduprule(Solver *solv, Id name)
1283 {
1284   Pool *pool = solv->pool;
1285   Rule *r;
1286   int i;
1287   for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1288     {
1289       if (r->p < 0 && r->d >= 0 && pool->solvables[-r->p].name == name)
1290         solver_disablerule(solv, r);
1291     }
1292 }
1293
1294 static inline void
1295 reenableduprule(Solver *solv, Id name)
1296 {
1297   Pool *pool = solv->pool;
1298   Rule *r;
1299   int i;
1300   for (i = solv->duprules, r = solv->rules + i; i < solv->duprules_end; i++, r++)
1301     {
1302       if (r->p < 0 && r->d < 0 && pool->solvables[-r->p].name == name)
1303         {
1304           solver_enablerule(solv, r);
1305           IF_POOLDEBUG (SOLV_DEBUG_SOLUTIONS)
1306             {
1307               POOL_DEBUG(SOLV_DEBUG_SOLUTIONS, "@@@ re-enabling ");
1308               solver_printruleclass(solv, SOLV_DEBUG_SOLUTIONS, r);
1309             }
1310         }
1311     }
1312 }
1313
1314
1315 /***********************************************************************
1316  ***
1317  ***  Policy rule disabling/reenabling
1318  ***
1319  ***  Disable all policy rules that conflict with our jobs. If a job
1320  ***  gets disabled later on, reenable the involved policy rules again.
1321  ***
1322  ***/
1323
1324 #define DISABLE_UPDATE  1
1325 #define DISABLE_INFARCH 2
1326 #define DISABLE_DUP     3
1327
1328 /*
1329  * add all installed packages that package p obsoletes to Queue q.
1330  * Package p is not installed. Also, we know that if
1331  * solv->keepexplicitobsoletes is not set, p is not in the noobs map.
1332  * Entries may get added multiple times.
1333  */
1334 static void
1335 add_obsoletes(Solver *solv, Id p, Queue *q)
1336 {
1337   Pool *pool = solv->pool;
1338   Repo *installed = solv->installed;
1339   Id p2, pp2;
1340   Solvable *s = pool->solvables + p;
1341   Id obs, *obsp;
1342   Id lastp2 = 0;
1343
1344   if (!solv->keepexplicitobsoletes || !(solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p)))
1345     {
1346       FOR_PROVIDES(p2, pp2, s->name)
1347         {
1348           Solvable *ps = pool->solvables + p2;
1349           if (ps->repo != installed)
1350             continue;
1351           if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
1352             continue;
1353           if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1354             continue;
1355           queue_push(q, p2);
1356           lastp2 = p2;
1357         }
1358     }
1359   if (!s->obsoletes)
1360     return;
1361   obsp = s->repo->idarraydata + s->obsoletes;
1362   while ((obs = *obsp++) != 0)
1363     FOR_PROVIDES(p2, pp2, obs)
1364       {
1365         Solvable *ps = pool->solvables + p2;
1366         if (ps->repo != installed)
1367           continue;
1368         if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1369           continue;
1370         if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1371           continue;
1372         if (p2 == lastp2)
1373           continue;
1374         queue_push(q, p2);
1375         lastp2 = p2;
1376       }
1377 }
1378
1379 /*
1380  * Call add_obsoletes and intersect the result with the
1381  * elements in Queue q starting at qstart.
1382  * Assumes that it's the first call if qstart == q->count.
1383  * May use auxillary map m for the intersection process, all
1384  * elements of q starting at qstart must have their bit cleared.
1385  * (This is also true after the function returns.)
1386  */
1387 static void
1388 intersect_obsoletes(Solver *solv, Id p, Queue *q, int qstart, Map *m)
1389 {
1390   int i, j;
1391   int qcount = q->count;
1392
1393   add_obsoletes(solv, p, q);
1394   if (qcount == qstart)
1395     return;     /* first call */
1396   if (qcount == q->count)
1397     j = qstart;
1398   else if (qcount == qstart + 1)
1399     {
1400       /* easy if there's just one element */
1401       j = qstart;
1402       for (i = qcount; i < q->count; i++)
1403         if (q->elements[i] == q->elements[qstart])
1404           {
1405             j++;        /* keep the element */
1406             break;
1407           }
1408     }
1409   else if (!m->size && q->count - qstart <= 8)
1410     {
1411       /* faster than a map most of the time */
1412       int k;
1413       for (i = j = qstart; i < qcount; i++)
1414         {
1415           Id ip = q->elements[i];
1416           for (k = qcount; k < q->count; k++)
1417             if (q->elements[k] == ip)
1418               {
1419                 q->elements[j++] = ip;
1420                 break;
1421               }
1422         }
1423     }
1424   else
1425     {
1426       /* for the really pathologic cases we use the map */
1427       Repo *installed = solv->installed;
1428       if (!m->size)
1429         map_init(m, installed->end - installed->start);
1430       for (i = qcount; i < q->count; i++)
1431         MAPSET(m, q->elements[i] - installed->start);
1432       for (i = j = qstart; i < qcount; i++)
1433         if (MAPTST(m, q->elements[i] - installed->start))
1434           {
1435             MAPCLR(m, q->elements[i] - installed->start);
1436             q->elements[j++] = q->elements[i];
1437           }
1438     }
1439   queue_truncate(q, j);
1440 }
1441
1442 static void
1443 jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
1444 {
1445   Pool *pool = solv->pool;
1446   Id select, p, pp;
1447   Repo *installed;
1448   Solvable *s;
1449   int i, j, set, qstart;
1450   Map omap;
1451
1452   installed = solv->installed;
1453   select = how & SOLVER_SELECTMASK;
1454   switch (how & SOLVER_JOBMASK)
1455     {
1456     case SOLVER_INSTALL:
1457       set = how & SOLVER_SETMASK;
1458       if (!(set & SOLVER_NOAUTOSET))
1459         {
1460           /* automatically add set bits by analysing the job */
1461           if (select == SOLVER_SOLVABLE_NAME)
1462             set |= SOLVER_SETNAME;
1463           if (select == SOLVER_SOLVABLE)
1464             set |= SOLVER_SETNAME | SOLVER_SETARCH | SOLVER_SETVENDOR | SOLVER_SETREPO | SOLVER_SETEVR;
1465           else if ((select == SOLVER_SOLVABLE_NAME || select == SOLVER_SOLVABLE_PROVIDES) && ISRELDEP(what))
1466             {
1467               Reldep *rd = GETRELDEP(pool, what);
1468               if (rd->flags == REL_EQ && select == SOLVER_SOLVABLE_NAME)
1469                 {
1470                   if (pool->disttype != DISTTYPE_DEB)
1471                     {
1472                       const char *evr = pool_id2str(pool, rd->evr);
1473                       if (strchr(evr, '-'))
1474                         set |= SOLVER_SETEVR;
1475                       else
1476                         set |= SOLVER_SETEV;
1477                     }
1478                   else
1479                     set |= SOLVER_SETEVR;
1480                 }
1481               if (rd->flags <= 7 && ISRELDEP(rd->name))
1482                 rd = GETRELDEP(pool, rd->name);
1483               if (rd->flags == REL_ARCH)
1484                 set |= SOLVER_SETARCH;
1485             }
1486         }
1487       else
1488         set &= ~SOLVER_NOAUTOSET;
1489       if (!set)
1490         return;
1491       if ((set & SOLVER_SETARCH) != 0 && solv->infarchrules != solv->infarchrules_end)
1492         {
1493           if (select == SOLVER_SOLVABLE)
1494             queue_push2(q, DISABLE_INFARCH, pool->solvables[what].name);
1495           else
1496             {
1497               int qcnt = q->count;
1498               FOR_JOB_SELECT(p, pp, select, what)
1499                 {
1500                   s = pool->solvables + p;
1501                   /* unify names */
1502                   for (i = qcnt; i < q->count; i += 2)
1503                     if (q->elements[i + 1] == s->name)
1504                       break;
1505                   if (i < q->count)
1506                     continue;
1507                   queue_push2(q, DISABLE_INFARCH, s->name);
1508                 }
1509             }
1510         }
1511       if ((set & SOLVER_SETREPO) != 0 && solv->duprules != solv->duprules_end)
1512         {
1513           if (select == SOLVER_SOLVABLE)
1514             queue_push2(q, DISABLE_DUP, pool->solvables[what].name);
1515           else
1516             {
1517               int qcnt = q->count;
1518               FOR_JOB_SELECT(p, pp, select, what)
1519                 {
1520                   s = pool->solvables + p;
1521                   /* unify names */
1522                   for (i = qcnt; i < q->count; i += 2)
1523                     if (q->elements[i + 1] == s->name)
1524                       break;
1525                   if (i < q->count)
1526                     continue;
1527                   queue_push2(q, DISABLE_DUP, s->name);
1528                 }
1529             }
1530         }
1531       if (!installed || installed->end == installed->start)
1532         return;
1533       /* now the hard part: disable some update rules */
1534
1535       /* first check if we have noobs or installed packages in the job */
1536       i = j = 0;
1537       FOR_JOB_SELECT(p, pp, select, what)
1538         {
1539           if (pool->solvables[p].repo == installed)
1540             j = p;
1541           else if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p) && !solv->keepexplicitobsoletes)
1542             return;
1543           i++;
1544         }
1545       if (j)    /* have installed packages */
1546         {
1547           /* this is for dupmap_all jobs, it can go away if we create
1548            * duprules for them */
1549           if (i == 1 && (set & SOLVER_SETREPO) != 0)
1550             queue_push2(q, DISABLE_UPDATE, j);
1551           return;
1552         }
1553
1554       omap.size = 0;
1555       qstart = q->count;
1556       FOR_JOB_SELECT(p, pp, select, what)
1557         {
1558           intersect_obsoletes(solv, p, q, qstart, &omap);
1559           if (q->count == qstart)
1560             break;
1561         }
1562       if (omap.size)
1563         map_free(&omap);
1564
1565       if (qstart == q->count)
1566         return;         /* nothing to prune */
1567
1568       /* convert result to (DISABLE_UPDATE, p) pairs */
1569       i = q->count;
1570       for (j = qstart; j < i; j++)
1571         queue_push(q, q->elements[j]);
1572       for (j = qstart; j < q->count; j += 2)
1573         {
1574           q->elements[j] = DISABLE_UPDATE;
1575           q->elements[j + 1] = q->elements[i++];
1576         }
1577
1578       /* now that we know which installed packages are obsoleted check each of them */
1579       if ((set & (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR)) == (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR))
1580         return;         /* all is set, nothing to do */
1581
1582       for (i = j = qstart; i < q->count; i += 2)
1583         {
1584           Solvable *is = pool->solvables + q->elements[i + 1];
1585           FOR_JOB_SELECT(p, pp, select, what)
1586             {
1587               int illegal = 0;
1588               s = pool->solvables + p;
1589               if ((set & SOLVER_SETEVR) != 0)
1590                 illegal |= POLICY_ILLEGAL_DOWNGRADE;    /* ignore */
1591               if ((set & SOLVER_SETNAME) != 0)
1592                 illegal |= POLICY_ILLEGAL_NAMECHANGE;   /* ignore */
1593               if ((set & SOLVER_SETARCH) != 0)
1594                 illegal |= POLICY_ILLEGAL_ARCHCHANGE;   /* ignore */
1595               if ((set & SOLVER_SETVENDOR) != 0)
1596                 illegal |= POLICY_ILLEGAL_VENDORCHANGE; /* ignore */
1597               illegal = policy_is_illegal(solv, is, s, illegal);
1598               if (illegal && illegal == POLICY_ILLEGAL_DOWNGRADE && (set & SOLVER_SETEV) != 0)
1599                 {
1600                   /* it's ok if the EV is different */
1601                   if (pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE_EVONLY) != 0)
1602                     illegal = 0;
1603                 }
1604               if (illegal)
1605                 break;
1606             }
1607           if (!p)
1608             {
1609               /* no package conflicts with the update rule */
1610               /* thus keep the DISABLE_UPDATE */
1611               q->elements[j + 1] = q->elements[i + 1];
1612               j += 2;
1613             }
1614         }
1615       queue_truncate(q, j);
1616       return;
1617
1618     case SOLVER_ERASE:
1619       if (!installed)
1620         break;
1621       FOR_JOB_SELECT(p, pp, select, what)
1622         if (pool->solvables[p].repo == installed)
1623           queue_push2(q, DISABLE_UPDATE, p);
1624       return;
1625     default:
1626       return;
1627     }
1628 }
1629
1630 /* disable all policy rules that are in conflict with our job list */
1631 void
1632 solver_disablepolicyrules(Solver *solv)
1633 {
1634   Queue *job = &solv->job;
1635   int i, j;
1636   Queue allq;
1637   Rule *r;
1638   Id lastjob = -1;
1639   Id allqbuf[128];
1640
1641   queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1642
1643   for (i = solv->jobrules; i < solv->jobrules_end; i++)
1644     {
1645       r = solv->rules + i;
1646       if (r->d < 0)     /* disabled? */
1647         continue;
1648       j = solv->ruletojob.elements[i - solv->jobrules];
1649       if (j == lastjob)
1650         continue;
1651       lastjob = j;
1652       jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1653     }
1654   if (solv->cleandepsmap.size)
1655     {
1656       solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
1657       for (i = solv->installed->start; i < solv->installed->end; i++)
1658         if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1659           queue_push2(&allq, DISABLE_UPDATE, i);
1660     }
1661   MAPZERO(&solv->noupdate);
1662   for (i = 0; i < allq.count; i += 2)
1663     {
1664       Id type = allq.elements[i], arg = allq.elements[i + 1];
1665       switch(type)
1666         {
1667         case DISABLE_UPDATE:
1668           disableupdaterule(solv, arg);
1669           break;
1670         case DISABLE_INFARCH:
1671           disableinfarchrule(solv, arg);
1672           break;
1673         case DISABLE_DUP:
1674           disableduprule(solv, arg);
1675           break;
1676         default:
1677           break;
1678         }
1679     }
1680   queue_free(&allq);
1681 }
1682
1683 /* we just disabled job #jobidx, now reenable all policy rules that were
1684  * disabled because of this job */
1685 void
1686 solver_reenablepolicyrules(Solver *solv, int jobidx)
1687 {
1688   Queue *job = &solv->job;
1689   int i, j;
1690   Queue q, allq;
1691   Rule *r;
1692   Id lastjob = -1;
1693   Id qbuf[32], allqbuf[128];
1694
1695   queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
1696   queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1697   jobtodisablelist(solv, job->elements[jobidx - 1], job->elements[jobidx], &q);
1698   if (!q.count)
1699     return;
1700   for (i = solv->jobrules; i < solv->jobrules_end; i++)
1701     {
1702       r = solv->rules + i;
1703       if (r->d < 0)     /* disabled? */
1704         continue;
1705       j = solv->ruletojob.elements[i - solv->jobrules];
1706       if (j == lastjob)
1707         continue;
1708       lastjob = j;
1709       jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1710     }
1711   if (solv->cleandepsmap.size)
1712     {
1713       solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
1714       for (i = solv->installed->start; i < solv->installed->end; i++)
1715         if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1716           queue_push2(&allq, DISABLE_UPDATE, i);
1717     }
1718   for (j = 0; j < q.count; j += 2)
1719     {
1720       Id type = q.elements[j], arg = q.elements[j + 1];
1721       for (i = 0; i < allq.count; i += 2)
1722         if (allq.elements[i] == type && allq.elements[i + 1] == arg)
1723           break;
1724       if (i < allq.count)
1725         continue;       /* still disabled */
1726       switch(type)
1727         {
1728         case DISABLE_UPDATE:
1729           reenableupdaterule(solv, arg);
1730           break;
1731         case DISABLE_INFARCH:
1732           reenableinfarchrule(solv, arg);
1733           break;
1734         case DISABLE_DUP:
1735           reenableduprule(solv, arg);
1736           break;
1737         }
1738     }
1739   queue_free(&allq);
1740   queue_free(&q);
1741 }
1742
1743 /* we just removed a package from the cleandeps map, now reenable all policy rules that were
1744  * disabled because of this */
1745 void
1746 solver_reenablepolicyrules_cleandeps(Solver *solv, Id pkg)
1747 {
1748   Queue *job = &solv->job;
1749   int i, j;
1750   Queue allq;
1751   Rule *r;
1752   Id lastjob = -1;
1753   Id allqbuf[128];
1754
1755   queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1756   for (i = solv->jobrules; i < solv->jobrules_end; i++)
1757     {
1758       r = solv->rules + i;
1759       if (r->d < 0)     /* disabled? */
1760         continue;
1761       j = solv->ruletojob.elements[i - solv->jobrules];
1762       if (j == lastjob)
1763         continue;
1764       lastjob = j;
1765       jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1766     }
1767   for (i = 0; i < allq.count; i += 2)
1768     if (allq.elements[i] == DISABLE_UPDATE && allq.elements[i + 1] == pkg)
1769       break;
1770   if (i == allq.count)
1771     reenableupdaterule(solv, pkg);
1772   queue_free(&allq);
1773 }
1774
1775
1776 /***********************************************************************
1777  ***
1778  ***  Rule info part, tell the user what the rule is about.
1779  ***
1780  ***/
1781
1782 static void
1783 addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep)
1784 {
1785   Pool *pool = solv->pool;
1786   Rule *r;
1787   Id w2, op, od, ow2;
1788
1789   /* check if this creates the rule we're searching for */
1790   r = solv->rules + solv->ruleinfoq->elements[0];
1791   op = r->p;
1792   od = r->d < 0 ? -r->d - 1 : r->d;
1793   ow2 = 0;
1794
1795   /* normalize */
1796   w2 = d > 0 ? 0 : d;
1797   if (p < 0 && d > 0 && (!pool->whatprovidesdata[d] || !pool->whatprovidesdata[d + 1]))
1798     {
1799       w2 = pool->whatprovidesdata[d];
1800       d = 0;
1801
1802     }
1803   if (p > 0 && d < 0)           /* this hack is used for buddy deps */
1804     {
1805       w2 = p;
1806       p = d;
1807     }
1808
1809   if (d > 0)
1810     {
1811       if (p != op && !od)
1812         return;
1813       if (d != od)
1814         {
1815           Id *dp = pool->whatprovidesdata + d;
1816           Id *odp = pool->whatprovidesdata + od;
1817           while (*dp)
1818             if (*dp++ != *odp++)
1819               return;
1820           if (*odp)
1821             return;
1822         }
1823       w2 = 0;
1824       /* handle multiversion conflict rules */
1825       if (p < 0 && pool->whatprovidesdata[d] < 0)
1826         {
1827           w2 = pool->whatprovidesdata[d];
1828           /* XXX: free memory */
1829         }
1830     }
1831   else
1832     {
1833       if (od)
1834         return;
1835       ow2 = r->w2;
1836       if (p > w2)
1837         {
1838           if (w2 != op || p != ow2)
1839             return;
1840         }
1841       else
1842         {
1843           if (p != op || w2 != ow2)
1844             return;
1845         }
1846     }
1847   /* yep, rule matches. record info */
1848   queue_push(solv->ruleinfoq, type);
1849   if (type == SOLVER_RULE_RPM_SAME_NAME)
1850     {
1851       /* we normalize same name order */
1852       queue_push(solv->ruleinfoq, op < 0 ? -op : 0);
1853       queue_push(solv->ruleinfoq, ow2 < 0 ? -ow2 : 0);
1854     }
1855   else
1856     {
1857       queue_push(solv->ruleinfoq, p < 0 ? -p : 0);
1858       queue_push(solv->ruleinfoq, w2 < 0 ? -w2 : 0);
1859     }
1860   queue_push(solv->ruleinfoq, dep);
1861 }
1862
1863 static int
1864 solver_allruleinfos_cmp(const void *ap, const void *bp, void *dp)
1865 {
1866   const Id *a = ap, *b = bp;
1867   int r;
1868
1869   r = a[0] - b[0];
1870   if (r)
1871     return r;
1872   r = a[1] - b[1];
1873   if (r)
1874     return r;
1875   r = a[2] - b[2];
1876   if (r)
1877     return r;
1878   r = a[3] - b[3];
1879   if (r)
1880     return r;
1881   return 0;
1882 }
1883
1884 int
1885 solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
1886 {
1887   Pool *pool = solv->pool;
1888   Rule *r = solv->rules + rid;
1889   int i, j;
1890
1891   queue_empty(rq);
1892   if (rid <= 0 || rid >= solv->rpmrules_end)
1893     {
1894       Id type, from, to, dep;
1895       type = solver_ruleinfo(solv, rid, &from, &to, &dep);
1896       queue_push(rq, type);
1897       queue_push(rq, from);
1898       queue_push(rq, to);
1899       queue_push(rq, dep);
1900       return 1;
1901     }
1902   if (r->p >= 0)
1903     return 0;
1904   queue_push(rq, rid);
1905   solv->ruleinfoq = rq;
1906   solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
1907   /* also try reverse direction for conflicts */
1908   if ((r->d == 0 || r->d == -1) && r->w2 < 0)
1909     solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
1910   solv->ruleinfoq = 0;
1911   queue_shift(rq);
1912   /* now sort & unify em */
1913   if (!rq->count)
1914     return 0;
1915   solv_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
1916   /* throw out identical entries */
1917   for (i = j = 0; i < rq->count; i += 4)
1918     {
1919       if (j)
1920         {
1921           if (rq->elements[i] == rq->elements[j - 4] &&
1922               rq->elements[i + 1] == rq->elements[j - 3] &&
1923               rq->elements[i + 2] == rq->elements[j - 2] &&
1924               rq->elements[i + 3] == rq->elements[j - 1])
1925             continue;
1926         }
1927       rq->elements[j++] = rq->elements[i];
1928       rq->elements[j++] = rq->elements[i + 1];
1929       rq->elements[j++] = rq->elements[i + 2];
1930       rq->elements[j++] = rq->elements[i + 3];
1931     }
1932   rq->count = j;
1933   return j / 4;
1934 }
1935
1936 SolverRuleinfo
1937 solver_ruleinfo(Solver *solv, Id rid, Id *fromp, Id *top, Id *depp)
1938 {
1939   Pool *pool = solv->pool;
1940   Rule *r = solv->rules + rid;
1941   SolverRuleinfo type = SOLVER_RULE_UNKNOWN;
1942
1943   if (fromp)
1944     *fromp = 0;
1945   if (top)
1946     *top = 0;
1947   if (depp)
1948     *depp = 0;
1949   if (rid > 0 && rid < solv->rpmrules_end)
1950     {
1951       Queue rq;
1952       int i;
1953
1954       if (r->p >= 0)
1955         return SOLVER_RULE_RPM;
1956       if (fromp)
1957         *fromp = -r->p;
1958       queue_init(&rq);
1959       queue_push(&rq, rid);
1960       solv->ruleinfoq = &rq;
1961       solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
1962       /* also try reverse direction for conflicts */
1963       if ((r->d == 0 || r->d == -1) && r->w2 < 0)
1964         solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
1965       solv->ruleinfoq = 0;
1966       type = SOLVER_RULE_RPM;
1967       for (i = 1; i < rq.count; i += 4)
1968         {
1969           Id qt, qo, qp, qd;
1970           qt = rq.elements[i];
1971           qp = rq.elements[i + 1];
1972           qo = rq.elements[i + 2];
1973           qd = rq.elements[i + 3];
1974           if (type == SOLVER_RULE_RPM || type > qt)
1975             {
1976               type = qt;
1977               if (fromp)
1978                 *fromp = qp;
1979               if (top)
1980                 *top = qo;
1981               if (depp)
1982                 *depp = qd;
1983             }
1984         }
1985       queue_free(&rq);
1986       return type;
1987     }
1988   if (rid >= solv->jobrules && rid < solv->jobrules_end)
1989     {
1990       Id jidx = solv->ruletojob.elements[rid - solv->jobrules];
1991       if (fromp)
1992         *fromp = jidx;
1993       if (top)
1994         *top = solv->job.elements[jidx];
1995       if (depp)
1996         *depp = solv->job.elements[jidx + 1];
1997       if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE)
1998         {
1999           if ((solv->job.elements[jidx] & SOLVER_SELECTMASK) == SOLVER_SOLVABLE_NAME)
2000             return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2001           if ((solv->job.elements[jidx] & SOLVER_SELECTMASK) == SOLVER_SOLVABLE_PROVIDES)
2002             return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2003         }
2004       return SOLVER_RULE_JOB;
2005     }
2006   if (rid >= solv->updaterules && rid < solv->updaterules_end)
2007     {
2008       if (fromp)
2009         *fromp = solv->installed->start + (rid - solv->updaterules);
2010       return SOLVER_RULE_UPDATE;
2011     }
2012   if (rid >= solv->featurerules && rid < solv->featurerules_end)
2013     {
2014       if (fromp)
2015         *fromp = solv->installed->start + (rid - solv->featurerules);
2016       return SOLVER_RULE_FEATURE;
2017     }
2018   if (rid >= solv->duprules && rid < solv->duprules_end)
2019     {
2020       if (fromp)
2021         *fromp = -r->p;
2022       if (depp)
2023         *depp = pool->solvables[-r->p].name;
2024       return SOLVER_RULE_DISTUPGRADE;
2025     }
2026   if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2027     {
2028       if (fromp)
2029         *fromp = -r->p;
2030       if (depp)
2031         *depp = pool->solvables[-r->p].name;
2032       return SOLVER_RULE_INFARCH;
2033     }
2034   if (rid >= solv->choicerules && rid < solv->choicerules_end)
2035     {
2036       return SOLVER_RULE_CHOICE;
2037     }
2038   if (rid >= solv->learntrules)
2039     {
2040       return SOLVER_RULE_LEARNT;
2041     }
2042   return SOLVER_RULE_UNKNOWN;
2043 }
2044
2045 SolverRuleinfo
2046 solver_ruleclass(Solver *solv, Id rid)
2047 {
2048   if (rid <= 0)
2049     return SOLVER_RULE_UNKNOWN;
2050   if (rid > 0 && rid < solv->rpmrules_end)
2051     return SOLVER_RULE_RPM;
2052   if (rid >= solv->jobrules && rid < solv->jobrules_end)
2053     return SOLVER_RULE_JOB;
2054   if (rid >= solv->updaterules && rid < solv->updaterules_end)
2055     return SOLVER_RULE_UPDATE;
2056   if (rid >= solv->featurerules && rid < solv->featurerules_end)
2057     return SOLVER_RULE_FEATURE;
2058   if (rid >= solv->duprules && rid < solv->duprules_end)
2059     return SOLVER_RULE_DISTUPGRADE;
2060   if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2061     return SOLVER_RULE_INFARCH;
2062   if (rid >= solv->choicerules && rid < solv->choicerules_end)
2063     return SOLVER_RULE_CHOICE;
2064   if (rid >= solv->learntrules)
2065     return SOLVER_RULE_LEARNT;
2066   return SOLVER_RULE_UNKNOWN;
2067 }
2068
2069 void
2070 solver_ruleliterals(Solver *solv, Id rid, Queue *q)
2071 {
2072   Pool *pool = solv->pool;
2073   Id p, *pp;
2074   Rule *r;
2075
2076   queue_empty(q);
2077   r = solv->rules + rid;
2078   FOR_RULELITERALS(p, pp, r)
2079     if (p != -SYSTEMSOLVABLE)
2080       queue_push(q, p);
2081   if (!q->count)
2082     queue_push(q, -SYSTEMSOLVABLE);     /* hmm, better to return an empty result? */
2083 }
2084
2085 int
2086 solver_rule2jobidx(Solver *solv, Id rid)
2087 {
2088   if (rid < solv->jobrules || rid >= solv->jobrules_end)
2089     return 0;
2090   return solv->ruletojob.elements[rid - solv->jobrules] + 1;
2091 }
2092
2093 Id
2094 solver_rule2job(Solver *solv, Id rid, Id *whatp)
2095 {
2096   int idx;
2097   if (rid < solv->jobrules || rid >= solv->jobrules_end)
2098     {
2099       if (whatp)
2100         *whatp = 0;
2101       return 0;
2102     }
2103   idx = solv->ruletojob.elements[rid - solv->jobrules];
2104   if (whatp)
2105     *whatp = solv->job.elements[idx + 1];
2106   return solv->job.elements[idx];
2107 }
2108
2109 void
2110 solver_addchoicerules(Solver *solv)
2111 {
2112   Pool *pool = solv->pool;
2113   Map m, mneg;
2114   Rule *r;
2115   Queue q, qi;
2116   int i, j, rid, havechoice;
2117   Id p, d, *pp;
2118   Id p2, pp2;
2119   Solvable *s, *s2;
2120
2121   solv->choicerules = solv->nrules;
2122   if (!pool->installed)
2123     {
2124       solv->choicerules_end = solv->nrules;
2125       return;
2126     }
2127   solv->choicerules_ref = solv_calloc(solv->rpmrules_end, sizeof(Id));
2128   queue_init(&q);
2129   queue_init(&qi);
2130   map_init(&m, pool->nsolvables);
2131   map_init(&mneg, pool->nsolvables);
2132   /* set up negative assertion map from infarch and dup rules */
2133   for (rid = solv->infarchrules, r = solv->rules + rid; rid < solv->infarchrules_end; rid++, r++)
2134     if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2135       MAPSET(&mneg, -r->p);
2136   for (rid = solv->duprules, r = solv->rules + rid; rid < solv->duprules_end; rid++, r++)
2137     if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2138       MAPSET(&mneg, -r->p);
2139   for (rid = 1; rid < solv->rpmrules_end ; rid++)
2140     {
2141       r = solv->rules + rid;
2142       if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 < 0))
2143         continue;       /* only look at requires rules */
2144       /* solver_printrule(solv, SOLV_DEBUG_RESULT, r); */
2145       queue_empty(&q);
2146       queue_empty(&qi);
2147       havechoice = 0;
2148       FOR_RULELITERALS(p, pp, r)
2149         {
2150           if (p < 0)
2151             continue;
2152           s = pool->solvables + p;
2153           if (!s->repo)
2154             continue;
2155           if (s->repo == pool->installed)
2156             {
2157               queue_push(&q, p);
2158               continue;
2159             }
2160           /* check if this package is "blocked" by a installed package */
2161           s2 = 0;
2162           FOR_PROVIDES(p2, pp2, s->name)
2163             {
2164               s2 = pool->solvables + p2;
2165               if (s2->repo != pool->installed)
2166                 continue;
2167               if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
2168                 continue;
2169               if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2170                 continue;
2171               break;
2172             }
2173           if (p2)
2174             {
2175               /* found installed package p2 that we can update to p */
2176               if (MAPTST(&mneg, p))
2177                 continue;
2178               if (policy_is_illegal(solv, s2, s, 0))
2179                 continue;
2180               queue_push(&qi, p2);
2181               queue_push(&q, p);
2182               continue;
2183             }
2184           if (s->obsoletes)
2185             {
2186               Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2187               s2 = 0;
2188               while ((obs = *obsp++) != 0)
2189                 {
2190                   FOR_PROVIDES(p2, pp2, obs)
2191                     {
2192                       s2 = pool->solvables + p2;
2193                       if (s2->repo != pool->installed)
2194                         continue;
2195                       if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
2196                         continue;
2197                       if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2198                         continue;
2199                       break;
2200                     }
2201                   if (p2)
2202                     break;
2203                 }
2204               if (obs)
2205                 {
2206                   /* found installed package p2 that we can update to p */
2207                   if (MAPTST(&mneg, p))
2208                     continue;
2209                   if (policy_is_illegal(solv, s2, s, 0))
2210                     continue;
2211                   queue_push(&qi, p2);
2212                   queue_push(&q, p);
2213                   continue;
2214                 }
2215             }
2216           /* package p is independent of the installed ones */
2217           havechoice = 1;
2218         }
2219       if (!havechoice || !q.count)
2220         continue;       /* no choice */
2221
2222       /* now check the update rules of the installed package.
2223        * if all packages of the update rules are contained in
2224        * the dependency rules, there's no need to set up the choice rule */
2225       map_empty(&m);
2226       FOR_RULELITERALS(p, pp, r)
2227         if (p > 0)
2228           MAPSET(&m, p);
2229       for (i = 0; i < qi.count; i++)
2230         {
2231           Rule *ur;
2232           if (!qi.elements[i])
2233             continue;
2234           ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
2235           if (!ur->p)
2236             ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
2237           if (!ur->p)
2238             continue;
2239           FOR_RULELITERALS(p, pp, ur)
2240             if (!MAPTST(&m, p))
2241               break;
2242           if (p)
2243             break;
2244           for (j = i + 1; j < qi.count; j++)
2245             if (qi.elements[i] == qi.elements[j])
2246               qi.elements[j] = 0;
2247         }
2248       if (i == qi.count)
2249         {
2250 #if 0
2251           printf("skipping choice ");
2252           solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
2253 #endif
2254           continue;
2255         }
2256       d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
2257       solver_addrule(solv, r->p, d);
2258       queue_push(&solv->weakruleq, solv->nrules - 1);
2259       solv->choicerules_ref[solv->nrules - 1 - solv->choicerules] = rid;
2260 #if 0
2261       printf("OLD ");
2262       solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
2263       printf("WEAK CHOICE ");
2264       solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + solv->nrules - 1);
2265 #endif
2266     }
2267   queue_free(&q);
2268   queue_free(&qi);
2269   map_free(&m);
2270   map_free(&mneg);
2271   solv->choicerules_end = solv->nrules;
2272 }
2273
2274 /* called when a choice rule is disabled by analyze_unsolvable. We also
2275  * have to disable all other choice rules so that the best packages get
2276  * picked */
2277 void
2278 solver_disablechoicerules(Solver *solv, Rule *r)
2279 {
2280   Id rid, p, *pp;
2281   Pool *pool = solv->pool;
2282   Map m;
2283   Rule *or;
2284
2285   or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2286   map_init(&m, pool->nsolvables);
2287   FOR_RULELITERALS(p, pp, or)
2288     if (p > 0)
2289       MAPSET(&m, p);
2290   FOR_RULELITERALS(p, pp, r)
2291     if (p > 0)
2292       MAPCLR(&m, p);
2293   for (rid = solv->choicerules; rid < solv->choicerules_end; rid++)
2294     {
2295       r = solv->rules + rid;
2296       if (r->d < 0)
2297         continue;
2298       or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2299       FOR_RULELITERALS(p, pp, or)
2300         if (p > 0 && MAPTST(&m, p))
2301           break;
2302       if (p)
2303         solver_disablerule(solv, r);
2304     }
2305 }
2306
2307 #undef CLEANDEPSDEBUG
2308
2309 /*
2310  * This functions collects all packages that are looked at
2311  * when a dependency is checked. We need it to "pin" installed
2312  * packages when removing a supplemented package in createcleandepsmap.
2313  * Here's an not uncommon example:
2314  *   A contains "Supplements: packageand(B, C)"
2315  *   B contains "Requires: A"
2316  * Now if we remove C, the supplements is no longer true,
2317  * thus we also remove A. Without the dep_pkgcheck function, we
2318  * would now also remove B, but this is wrong, as adding back
2319  * C doesn't make the supplements true again. Thus we "pin" B
2320  * when we remove A.
2321  * There's probably a better way to do this, but I haven't come
2322  * up with it yet ;)
2323  */
2324 static inline void
2325 dep_pkgcheck(Solver *solv, Id dep, Map *m, Queue *q)
2326 {
2327   Pool *pool = solv->pool;
2328   Id p, pp;
2329
2330   if (ISRELDEP(dep))
2331     {
2332       Reldep *rd = GETRELDEP(pool, dep);
2333       if (rd->flags >= 8)
2334         {
2335           if (rd->flags == REL_AND)
2336             {
2337               dep_pkgcheck(solv, rd->name, m, q);
2338               dep_pkgcheck(solv, rd->evr, m, q);
2339               return;
2340             }
2341           if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
2342             return;
2343           if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
2344             return;
2345         }
2346     }
2347   FOR_PROVIDES(p, pp, dep)
2348     if (!m || MAPTST(m, p))
2349       queue_push(q, p);
2350 }
2351
2352 /*
2353  * Find all installed packages that are no longer
2354  * needed regarding the current solver job.
2355  *
2356  * The algorithm is:
2357  * - remove pass: remove all packages that could have
2358  *   been dragged in by the obsoleted packages.
2359  *   i.e. if package A is obsolete and contains "Requires: B",
2360  *   also remove B, as installing A will have pulled in B.
2361  *   after this pass, we have a set of still installed packages
2362  *   with broken dependencies.
2363  * - add back pass:
2364  *   now add back all packages that the still installed packages
2365  *   require.
2366  *
2367  * The cleandeps packages are the packages removed in the first
2368  * pass and not added back in the second pass.
2369  *
2370  * If we search for unneeded packages (unneeded is true), we
2371  * simply remove all packages except the userinstalled ones in
2372  * the first pass.
2373  */
2374 static void
2375 solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded)
2376 {
2377   Pool *pool = solv->pool;
2378   Repo *installed = solv->installed;
2379   Queue *job = &solv->job;
2380   Map userinstalled;
2381   Map im;
2382   Map installedm;
2383   Rule *r;
2384   Id rid, how, what, select;
2385   Id p, pp, ip, *jp;
2386   Id req, *reqp, sup, *supp;
2387   Solvable *s;
2388   Queue iq;
2389   int i;
2390
2391   map_empty(cleandepsmap);
2392   if (!installed || installed->end == installed->start)
2393     return;
2394   map_init(&userinstalled, installed->end - installed->start);
2395   map_init(&im, pool->nsolvables);
2396   map_init(&installedm, pool->nsolvables);
2397   queue_init(&iq);
2398
2399   for (i = 0; i < job->count; i += 2)
2400     {
2401       how = job->elements[i];
2402       if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
2403         {
2404           what = job->elements[i + 1];
2405           select = how & SOLVER_SELECTMASK;
2406           FOR_JOB_SELECT(p, pp, select, what)
2407             if (pool->solvables[p].repo == installed)
2408               MAPSET(&userinstalled, p - installed->start);
2409         }
2410     }
2411
2412   /* also add visible patterns to userinstalled for openSUSE */
2413   if (1)
2414     {
2415       Dataiterator di;
2416       dataiterator_init(&di, pool, 0, 0, SOLVABLE_ISVISIBLE, 0, 0);
2417       while (dataiterator_step(&di))
2418         {
2419           Id *dp;
2420           if (di.solvid <= 0)
2421             continue;
2422           s = pool->solvables + di.solvid;
2423           if (!s->requires)
2424             continue;
2425           if (!pool_installable(pool, s))
2426             continue;
2427           if (strncmp(pool_id2str(pool, s->name), "pattern:", 8) != 0)
2428             continue;
2429           dp = s->repo->idarraydata + s->requires;
2430           for (dp = s->repo->idarraydata + s->requires; *dp; dp++)
2431             FOR_PROVIDES(p, pp, *dp)
2432               if (pool->solvables[p].repo == installed)
2433                 {
2434                   if (strncmp(pool_id2str(pool, pool->solvables[p].name), "pattern", 7) != 0)
2435                     continue;
2436                   MAPSET(&userinstalled, p - installed->start);
2437                 }
2438         }
2439       dataiterator_free(&di);
2440     }
2441   if (1)
2442     {
2443       /* all products and their buddies are userinstalled */
2444       for (p = installed->start; p < installed->end; p++)
2445         {
2446           Solvable *s = pool->solvables + p;
2447           if (s->repo != installed)
2448             continue;
2449           if (!strncmp("product:", pool_id2str(pool, s->name), 8))
2450             {
2451               MAPSET(&userinstalled, p - installed->start);
2452               if (pool->nscallback)
2453                 {
2454                   Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, p);
2455                   if (buddy >= installed->start && buddy < installed->end && pool->solvables[buddy].repo == installed)
2456                     MAPSET(&userinstalled, buddy - installed->start);
2457                 }
2458             }
2459         }
2460     }
2461
2462   /* add all positive elements (e.g. locks) to "userinstalled" */
2463   for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2464     {
2465       r = solv->rules + rid;
2466       if (r->d < 0)
2467         continue;
2468       i = solv->ruletojob.elements[rid - solv->jobrules];
2469       if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
2470         continue;
2471       FOR_RULELITERALS(p, jp, r)
2472         if (p > 0 && pool->solvables[p].repo == installed)
2473           MAPSET(&userinstalled, p - installed->start);
2474     }
2475
2476   /* add all cleandeps candidates to iq */
2477   for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2478     {
2479       r = solv->rules + rid;
2480       if (r->d < 0)
2481         continue;
2482       if (r->d == 0 && r->p < 0 && r->w2 == 0)
2483         {
2484           p = -r->p;
2485           if (pool->solvables[p].repo != installed)
2486             continue;
2487           MAPCLR(&userinstalled, p - installed->start);
2488           if (unneeded)
2489             continue;
2490           i = solv->ruletojob.elements[rid - solv->jobrules];
2491           how = job->elements[i];
2492           if ((how & (SOLVER_JOBMASK|SOLVER_CLEANDEPS)) == (SOLVER_ERASE|SOLVER_CLEANDEPS))
2493             queue_push(&iq, p);
2494         }
2495       else if (r->p > 0)
2496         {
2497           if (unneeded)
2498             continue;
2499           i = solv->ruletojob.elements[rid - solv->jobrules];
2500           if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
2501             {
2502               /* check if the literals all obsolete some installed package */
2503               Map om;
2504               int iqstart;
2505
2506               /* just one installed literal */
2507               if (r->d == 0 && r->w2 == 0 && pool->solvables[r->p].repo == installed)
2508                 continue;
2509               /* noobs is bad */
2510               if (solv->noobsoletes.size && !solv->keepexplicitobsoletes)
2511                 {
2512                   FOR_RULELITERALS(p, jp, r)
2513                     if (MAPTST(&solv->noobsoletes, p))
2514                       break;
2515                   if (p)
2516                     continue;
2517                 }
2518
2519               om.size = 0;
2520               iqstart = iq.count;
2521               FOR_RULELITERALS(p, jp, r)
2522                 {
2523                   if (p < 0)
2524                     {
2525                       queue_truncate(&iq, iqstart);     /* abort */
2526                       break;
2527                     }
2528                   if (pool->solvables[p].repo == installed)
2529                     {
2530                       if (iq.count == iqstart)
2531                         queue_push(&iq, p);
2532                       else
2533                         {
2534                           for (i = iqstart; i < iq.count; i++)
2535                             if (iq.elements[i] == p)
2536                               break;
2537                           queue_truncate(&iq, iqstart);
2538                           if (i < iq.count)
2539                             queue_push(&iq, p);
2540                         }
2541                     }
2542                   else
2543                     intersect_obsoletes(solv, p, &iq, iqstart, &om);
2544                   if (iq.count == iqstart)
2545                     break;
2546                 }
2547               if (om.size)
2548                 map_free(&om);
2549             }
2550         }
2551     }
2552
2553   if (!unneeded)
2554     {
2555       if (solv->cleandeps_updatepkgs)
2556         for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
2557           queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]);
2558     }
2559
2560   if (unneeded)
2561     queue_empty(&iq);   /* just in case... */
2562
2563   /* clear userinstalled bit for the packages we really want to delete/update */
2564   for (i = 0; i < iq.count; i++)
2565     {
2566       p = iq.elements[i];
2567       if (pool->solvables[p].repo != installed)
2568         continue;
2569       MAPCLR(&userinstalled, p - installed->start);
2570     }
2571
2572   for (p = installed->start; p < installed->end; p++)
2573     {
2574       if (pool->solvables[p].repo != installed)
2575         continue;
2576       MAPSET(&installedm, p);
2577       if (unneeded && !MAPTST(&userinstalled, p - installed->start))
2578         continue;
2579       MAPSET(&im, p);
2580     }
2581
2582 #ifdef CLEANDEPSDEBUG
2583   printf("REMOVE PASS\n");
2584 #endif
2585
2586   for (;;)
2587     {
2588       if (!iq.count)
2589         {
2590           if (unneeded)
2591             break;
2592           /* supplements pass */
2593           for (ip = solv->installed->start; ip < solv->installed->end; ip++)
2594             {
2595               if (!MAPTST(&installedm, ip))
2596                 continue;
2597               s = pool->solvables + ip;
2598               if (!s->supplements)
2599                 continue;
2600               if (!MAPTST(&im, ip))
2601                 continue;
2602               if (MAPTST(&userinstalled, ip - installed->start))
2603                 continue;
2604               supp = s->repo->idarraydata + s->supplements;
2605               while ((sup = *supp++) != 0)
2606                 if (dep_possible(solv, sup, &im))
2607                   break;
2608               if (!sup)
2609                 {
2610                   supp = s->repo->idarraydata + s->supplements;
2611                   while ((sup = *supp++) != 0)
2612                     if (dep_possible(solv, sup, &installedm))
2613                       {
2614                         /* no longer supplemented, also erase */
2615                         int iqcount = iq.count;
2616                         /* pin packages, see comment above dep_pkgcheck */
2617                         dep_pkgcheck(solv, sup, &im, &iq);
2618                         for (i = iqcount; i < iq.count; i++)
2619                           {
2620                             Id pqp = iq.elements[i];
2621                             if (pool->solvables[pqp].repo == installed)
2622                               MAPSET(&userinstalled, pqp - installed->start);
2623                           }
2624                         queue_truncate(&iq, iqcount);
2625 #ifdef CLEANDEPSDEBUG
2626                         printf("%s supplemented\n", pool_solvid2str(pool, ip));
2627 #endif
2628                         queue_push(&iq, ip);
2629                       }
2630                 }
2631             }
2632           if (!iq.count)
2633             break;
2634         }
2635       ip = queue_shift(&iq);
2636       s = pool->solvables + ip;
2637       if (!MAPTST(&im, ip))
2638         continue;
2639       if (!MAPTST(&installedm, ip))
2640         continue;
2641       if (s->repo == installed && MAPTST(&userinstalled, ip - installed->start))
2642         continue;
2643       MAPCLR(&im, ip);
2644 #ifdef CLEANDEPSDEBUG
2645       printf("removing %s\n", pool_solvable2str(pool, s));
2646 #endif
2647       if (s->requires)
2648         {
2649           reqp = s->repo->idarraydata + s->requires;
2650           while ((req = *reqp++) != 0)
2651             {
2652               if (req == SOLVABLE_PREREQMARKER)
2653                 continue;
2654 #if 0
2655               /* count number of installed packages that match */
2656               count = 0;
2657               FOR_PROVIDES(p, pp, req)
2658                 if (MAPTST(&installedm, p))
2659                   count++;
2660               if (count > 1)
2661                 continue;
2662 #endif
2663               FOR_PROVIDES(p, pp, req)
2664                 {
2665                   if (MAPTST(&im, p))
2666                     {
2667 #ifdef CLEANDEPSDEBUG
2668                       printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2669 #endif
2670                       queue_push(&iq, p);
2671                     }
2672                 }
2673             }
2674         }
2675       if (s->recommends)
2676         {
2677           reqp = s->repo->idarraydata + s->recommends;
2678           while ((req = *reqp++) != 0)
2679             {
2680 #if 0
2681               count = 0;
2682               FOR_PROVIDES(p, pp, req)
2683                 if (MAPTST(&installedm, p))
2684                   count++;
2685               if (count > 1)
2686                 continue;
2687 #endif
2688               FOR_PROVIDES(p, pp, req)
2689                 {
2690                   if (MAPTST(&im, p))
2691                     {
2692 #ifdef CLEANDEPSDEBUG
2693                       printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2694 #endif
2695                       queue_push(&iq, p);
2696                     }
2697                 }
2698             }
2699         }
2700     }
2701
2702   /* turn userinstalled into remove set for pruning */
2703   map_empty(&userinstalled);
2704   for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2705     {
2706       r = solv->rules + rid;
2707       if (r->p >= 0 || r->d != 0 || r->w2 != 0)
2708         continue;       /* disabled or not erase */
2709       p = -r->p;
2710       MAPCLR(&im, p);
2711       if (pool->solvables[p].repo == installed)
2712         MAPSET(&userinstalled, p - installed->start);
2713     }
2714   for (p = installed->start; p < installed->end; p++)
2715     if (MAPTST(&im, p))
2716       queue_push(&iq, p);
2717   for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2718     {
2719       r = solv->rules + rid;
2720       if (r->d < 0)
2721         continue;
2722       FOR_RULELITERALS(p, jp, r)
2723         if (p > 0)
2724           queue_push(&iq, p);
2725     }
2726   /* also put directly addressed packages on the install queue
2727    * so we can mark patterns as installed */
2728   for (i = 0; i < job->count; i += 2)
2729     {
2730       how = job->elements[i];
2731       if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
2732         {
2733           what = job->elements[i + 1];
2734           select = how & SOLVER_SELECTMASK;
2735           if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
2736             queue_push(&iq, what);
2737         }
2738     }
2739
2740 #ifdef CLEANDEPSDEBUG
2741   printf("ADDBACK PASS\n");
2742 #endif
2743   for (;;)
2744     {
2745       if (!iq.count)
2746         {
2747           /* supplements pass */
2748           for (ip = installed->start; ip < installed->end; ip++)
2749             {
2750               if (!MAPTST(&installedm, ip))
2751                 continue;
2752               if (MAPTST(&userinstalled, ip - installed->start))
2753                 continue;
2754               s = pool->solvables + ip;
2755               if (!s->supplements)
2756                 continue;
2757               if (MAPTST(&im, ip))
2758                 continue;
2759               supp = s->repo->idarraydata + s->supplements;
2760               while ((sup = *supp++) != 0)
2761                 if (dep_possible(solv, sup, &im))
2762                   break;
2763               if (sup)
2764                 {
2765 #ifdef CLEANDEPSDEBUG
2766                   printf("%s supplemented\n", pool_solvid2str(pool, ip));
2767 #endif
2768                   MAPSET(&im, ip);
2769                   queue_push(&iq, ip);
2770                 }
2771             }
2772           if (!iq.count)
2773             break;
2774         }
2775       ip = queue_shift(&iq);
2776       s = pool->solvables + ip;
2777 #ifdef CLEANDEPSDEBUG
2778       printf("adding back %s\n", pool_solvable2str(pool, s));
2779 #endif
2780       if (s->requires)
2781         {
2782           reqp = s->repo->idarraydata + s->requires;
2783           while ((req = *reqp++) != 0)
2784             {
2785               FOR_PROVIDES(p, pp, req)
2786                 {
2787                   if (!MAPTST(&im, p) && MAPTST(&installedm, p))
2788                     {
2789                       if (p == ip)
2790                         continue;
2791                       if (MAPTST(&userinstalled, p - installed->start))
2792                         continue;
2793 #ifdef CLEANDEPSDEBUG
2794                       printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2795 #endif
2796                       MAPSET(&im, p);
2797                       queue_push(&iq, p);
2798                     }
2799                 }
2800             }
2801         }
2802       if (s->recommends)
2803         {
2804           reqp = s->repo->idarraydata + s->recommends;
2805           while ((req = *reqp++) != 0)
2806             {
2807               FOR_PROVIDES(p, pp, req)
2808                 {
2809                   if (!MAPTST(&im, p) && MAPTST(&installedm, p))
2810                     {
2811                       if (p == ip)
2812                         continue;
2813                       if (MAPTST(&userinstalled, p - installed->start))
2814                         continue;
2815 #ifdef CLEANDEPSDEBUG
2816                       printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2817 #endif
2818                       MAPSET(&im, p);
2819                       queue_push(&iq, p);
2820                     }
2821                 }
2822             }
2823         }
2824     }
2825
2826   queue_free(&iq);
2827   if (solv->cleandeps_updatepkgs)
2828     for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
2829       MAPSET(&im, solv->cleandeps_updatepkgs->elements[i]);
2830   if (solv->cleandeps_mistakes)
2831     for (i = 0; i < solv->cleandeps_mistakes->count; i++)
2832       MAPSET(&im, solv->cleandeps_mistakes->elements[i]);
2833   for (p = installed->start; p < installed->end; p++)
2834     {
2835       if (pool->solvables[p].repo != installed)
2836         continue;
2837       if (!MAPTST(&im, p))
2838         MAPSET(cleandepsmap, p - installed->start);
2839     }
2840   map_free(&im);
2841   map_free(&installedm);
2842   map_free(&userinstalled);
2843 }
2844
2845
2846 struct trj_data {
2847   Queue *edges;
2848   Id *low;
2849   Id idx;
2850   Id nstack;
2851   Id firstidx;
2852 };
2853
2854 /* Tarjan's SCC algorithm, slightly modifed */
2855 static void
2856 trj_visit(struct trj_data *trj, Id node)
2857 {
2858   Id *low = trj->low;
2859   Queue *edges = trj->edges;
2860   Id nnode, myidx, stackstart;
2861   int i;
2862
2863   low[node] = myidx = trj->idx++;
2864   low[(stackstart = trj->nstack++)] = node;
2865   for (i = edges->elements[node]; (nnode = edges->elements[i]) != 0; i++)
2866     {
2867       Id l = low[nnode];
2868       if (!l)
2869         {
2870           if (!edges->elements[edges->elements[nnode]])
2871             {
2872               trj->idx++;
2873               low[nnode] = -1;
2874               continue;
2875             }
2876           trj_visit(trj, nnode);
2877           l = low[nnode];
2878         }
2879       if (l < 0)
2880         continue;
2881       if (l < trj->firstidx)
2882         {
2883           int k;
2884           for (k = l; low[low[k]] == l; k++)
2885             low[low[k]] = -1;
2886         }
2887       else if (l < low[node])
2888         low[node] = l;
2889     }
2890   if (low[node] == myidx)
2891     {
2892       if (myidx != trj->firstidx)
2893         myidx = -1;
2894       for (i = stackstart; i < trj->nstack; i++)
2895         low[low[i]] = myidx;
2896       trj->nstack = stackstart;
2897     }
2898 }
2899
2900
2901 void
2902 solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered)
2903 {
2904   Repo *installed = solv->installed;
2905   int i;
2906   Map cleandepsmap;
2907
2908   queue_empty(unneededq);
2909   if (!installed || installed->end == installed->start)
2910     return;
2911
2912   map_init(&cleandepsmap, installed->end - installed->start);
2913   solver_createcleandepsmap(solv, &cleandepsmap, 1);
2914   for (i = installed->start; i < installed->end; i++)
2915     if (MAPTST(&cleandepsmap, i - installed->start))
2916       queue_push(unneededq, i);
2917
2918   if (filtered && unneededq->count > 1)
2919     {
2920       Pool *pool = solv->pool;
2921       Queue edges;
2922       Id *nrequires;
2923       Map installedm;
2924       int j, pass, count = unneededq->count;
2925       Id *low;
2926
2927       map_init(&installedm, pool->nsolvables);
2928       for (i = installed->start; i < installed->end; i++)
2929         if (pool->solvables[i].repo == installed)
2930           MAPSET(&installedm, i);
2931
2932       nrequires = solv_calloc(count, sizeof(Id));
2933       queue_init(&edges);
2934       queue_prealloc(&edges, count * 4 + 10);   /* pre-size */
2935
2936       /*
2937        * Go through the solvables in the nodes queue and create edges for
2938        * all requires/recommends/supplements between the nodes.
2939        * The edges are stored in the edges queue, we add 1 to the node
2940        * index so that nodes in the edges queue are != 0 and we can
2941        * terminate the edge list with 0.
2942        * Thus for node element 5, the edges are stored starting at
2943        * edges.elements[6] and are 0-terminated.
2944        */
2945       /* leave first element zero to make things easier */
2946       /* also add trailing zero */
2947       queue_insertn(&edges, 0, 1 + count + 1);
2948
2949       /* first requires and recommends */
2950       for (i = 0; i < count; i++)
2951         {
2952           Solvable *s = pool->solvables + unneededq->elements[i];
2953           edges.elements[i + 1] = edges.count;
2954           for (pass = 0; pass < 2; pass++)
2955             {
2956               int num = 0;
2957               unsigned int off = pass == 0 ? s->requires : s->recommends;
2958               Id p, pp, *dp;
2959               if (off)
2960                 for (dp = s->repo->idarraydata + off; *dp; dp++)
2961                   FOR_PROVIDES(p, pp, *dp)
2962                     {
2963                       Solvable *sp = pool->solvables + p;
2964                       if (s == sp || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
2965                         continue;
2966                       for (j = 0; j < count; j++)
2967                         if (p == unneededq->elements[j])
2968                           break;
2969                       if (j == count)
2970                         continue;
2971                       if (num && edges.elements[edges.count - 1] == j + 1)
2972                         continue;
2973                       queue_push(&edges, j + 1);
2974                       num++;
2975                     }
2976                 if (pass == 0)
2977                   nrequires[i] = num;
2978             }
2979           queue_push(&edges, 0);
2980         }
2981 #if 0
2982       printf("requires + recommends\n");
2983       for (i = 0; i < count; i++)
2984         {
2985           int j;
2986           printf("  %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
2987           for (j = edges.elements[i + 1]; edges.elements[j]; j++)
2988             printf("    - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
2989         }
2990 #endif
2991
2992       /* then add supplements */
2993       for (i = 0; i < count; i++)
2994         {
2995           Solvable *s = pool->solvables + unneededq->elements[i];
2996           if (s->supplements)
2997             {
2998               Id *dp;
2999               int k;
3000               for (dp = s->repo->idarraydata + s->supplements; *dp; dp++)
3001                 if (dep_possible(solv, *dp, &installedm))
3002                   {
3003                     Queue iq;
3004                     Id iqbuf[16];
3005                     queue_init_buffer(&iq, iqbuf, sizeof(iqbuf)/sizeof(*iqbuf));
3006                     dep_pkgcheck(solv, *dp, 0, &iq);
3007                     for (k = 0; k < iq.count; k++)
3008                       {
3009                         Id p = iq.elements[k];
3010                         Solvable *sp = pool->solvables + p;
3011                         if (p == unneededq->elements[i] || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
3012                           continue;
3013                         for (j = 0; j < count; j++)
3014                           if (p == unneededq->elements[j])
3015                             break;
3016                         /* now add edge from j + 1 to i + 1 */
3017                         queue_insert(&edges, edges.elements[j + 1] + nrequires[j], i + 1);
3018                         /* addapt following edge pointers */
3019                         for (k = j + 2; k < count + 2; k++)
3020                           edges.elements[k]++;
3021                       }
3022                     queue_free(&iq);
3023                   }
3024             }
3025         }
3026 #if 0
3027       /* print result */
3028       printf("+ supplements\n");
3029       for (i = 0; i < count; i++)
3030         {
3031           int j;
3032           printf("  %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
3033           for (j = edges.elements[i + 1]; edges.elements[j]; j++)
3034             printf("    - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
3035     }
3036 #endif
3037       map_free(&installedm);
3038
3039       /* now run SCC algo two times, first with requires+recommends+supplements,
3040        * then again without the requires. We run it the second time to get rid
3041        * of packages that got dragged in via recommends/supplements */
3042       /*
3043        * low will contain the result of the SCC search.
3044        * it must be of at least size 2 * (count + 1) and
3045        * must be zero initialized.
3046        * The layout is:
3047        *    0  low low ... low stack stack ...stack 0
3048        *            count              count
3049        */
3050       low = solv_calloc(count + 1, 2 * sizeof(Id));
3051       for (pass = 0; pass < 2; pass++)
3052         {
3053           struct trj_data trj;
3054           if (pass)
3055             {
3056               memset(low, 0, (count + 1) * (2 * sizeof(Id)));
3057               for (i = 0; i < count; i++)
3058                 {
3059                   edges.elements[i + 1] += nrequires[i];
3060                   if (!unneededq->elements[i])
3061                     low[i + 1] = -1;    /* ignore this node */
3062                 }
3063             }
3064           trj.edges = &edges;
3065           trj.low = low;
3066           trj.idx = count + 1;  /* stack starts here */
3067           for (i = 1; i <= count; i++)
3068             {
3069               if (low[i])
3070                 continue;
3071               if (edges.elements[edges.elements[i]])
3072                 {
3073                   trj.firstidx = trj.nstack = trj.idx;
3074                   trj_visit(&trj, i);
3075                 }
3076               else
3077                 {
3078                   Id myidx = trj.idx++;
3079                   low[i] = myidx;
3080                   low[myidx] = i;
3081                 }
3082             }
3083           /* prune packages */
3084           for (i = 0; i < count; i++)
3085             if (low[i + 1] <= 0)
3086               unneededq->elements[i] = 0;
3087         }
3088       solv_free(low);
3089       solv_free(nrequires);
3090       queue_free(&edges);
3091
3092       /* finally remove all pruned entries from unneededq */
3093       for (i = j = 0; i < count; i++)
3094         if (unneededq->elements[i])
3095           unneededq->elements[j++] = unneededq->elements[i];
3096       queue_truncate(unneededq, j);
3097     }
3098   map_free(&cleandepsmap);
3099 }
3100
3101 /* EOF */